In this paper, we  introduce new concepts that relates to soft space based on   work that was previously presented by researchers in this regard. First we give  the definition of Soft Contraction Operator and some examples. After that we introduce the concepts of soft Picard iteration and soft Mann iteration processes. We also give  some examples to illustrate them.

    Many concepts in normed spaces have been generalized in soft normed spaces. One of the important concepts is the concept of stability of soft iteration in soft normed spaces. We discuss this concept by giving some lemmas that  are  used to prove some theorems about stability of soft i

In any security system, we need a high level of security, to maintain the secrecy of important data. Steganography is one of the security systems that are hiding secret information within a certain cover (video, image, sound, text), so that the adversary does not suspect the existence of such confidential information. In our proposed work will hide secret messages (Arabic or English) text in the Arabic cover text, we employed the RNA as a tool for encoding the secret information and used non-printed characters to hide these codes. Each character (English or Arabic) is represented by using only six bits based on secret tables this operation has provided a good compression since each Arabic character needs 16 bits and each English characte

       Based on the German language department’s theoretical and practical aspects as well as educational programs, the present study discusses the semantic relations in text sentences and their role in the science of translation.  Through clarifying the semantic relationship between the text sentence and the methods used to express a news item, a situation or an occurrence and through the statement of the multiple theoretical semantic structures of the text’s construction and interrelation, a translator can easily translate a text into the target language.

        It is known that language learners face multiple difficulties in writing and creating an inte

Although text document images authentication is difficult due to the binary nature and clear separation between the background and foreground but it is getting higher demand for many applications. Most previous researches in this field depend on insertion watermark in the document, the drawback in these techniques lie in the fact that changing pixel values in a binary document could introduce irregularities that are very visually noticeable. In this paper, a new method is proposed for object-based text document authentication, in which I propose a different approach where a text document is signed by shifting individual words slightly left or right from their original positions to make the center of gravity for each line fall in with the m

      In this work, we introduced and studied  a new kind of soft mapping  on soft topological spaces with an ideal, which we called  soft strongly generalized mapping with respect an ideal I, we studied the concepts like SSIg-continuous, Contra-SSIg-continuous, SSIg-open, SSIg-closed and SSIg-irresolute mapping  and  the relations between these kinds of mappings and the composition of two mappings of the same type of two different types, with proofs or counter examples

      In this paper, we show that each soft topological group is a strong small soft loop transfer space at the identity element. This indicates that the soft quasitopological fundamental group of a soft connected and locally soft path connected space, is a soft topological group.

        In this paper, we introduce the notation of the soft bornological group to solve the problem of boundedness for the soft group. We combine soft set theory with bornology space to produce a new structure which is called    soft bornological group. So that both the product and inverse maps are soft bounded. As well as, we study the actions of the soft bornological group on the soft bornological sets. The aim soft bornological set is to partition into orbital classes by acting soft bornological group on the soft bornological set. In addition, we explain the centralizer, normalizer, and stabilizer in details. The main important results are to prove that the product of soft bornological groups is soft bornol

     Structure of network, which is known as community detection in networks, has received a great attention in diverse topics, including social sciences, biological studies, politics, etc. There are a large number of studies and practical approaches that were designed to solve the problem of finding the structure of the network. The definition of complex network model based on clustering is a non-deterministic polynomial-time hardness (NP-hard) problem. There are no ideal techniques to define the clustering. Here, we present a statistical approach based on using the likelihood function of a Stochastic Block Model (SBM). The objective is to define the general model and select the best model with high quality. Therefor

The theory of probabilistic programming  may be conceived in several different ways. As a method of programming it analyses the implications of probabilistic variations in the parameter space of linear or nonlinear programming model. The generating mechanism of such probabilistic variations in the economic models may be due to incomplete information about changes in demand, pro­duction and technology, specification errors about the econometric relations presumed for different economic agents, uncertainty of various sorts and the consequences of imperfect aggregation or disaggregating of economic variables. In this Research we discuss the probabilistic programming problem when the coefficient b_i is random variable