The soft sets were known since 1999, and because of their wide applications and their great flexibility to solve the problems, we used these concepts to define new types of soft limit points, that we called soft turning points.Finally, we used these points to define new types of soft separation axioms and we study their properties.

      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

   Let M is a Г-ring. In this paper the concept of orthogonal symmetric higher bi-derivations on semiprime Г-ring is presented and studied and the relations of two symmetric higher bi-derivations on Г-ring are introduced.

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

Optical Mark Recognition (OMR) is an important technology for applications that require speedy, high-accuracy processing of a huge volume of hand-filled forms. The aim of this technology is to reduce manual work, human effort, high accuracy in assessment, and minimize time for evaluation answer sheets. This paper proposed OMR by using Modify Bidirectional Associative Memory (MBAM), MBAM has two phases (learning and analysis phases), it will learn on the answer sheets that contain the correct answers by giving its own code that represents the number of correct answers, then detection marks from answer sheets by using analysis phase. This proposal will be able to detect no selection or select more than one choice, in addition, using M

        Zadah in [1] introduced the notion of a fuzzy subset A of a nonempty set S as a mapping from S into [0,1], Liu in [2] introduced the concept of a fuzzy ring, Martines [3] introduced the notion of a fuzzy ideal of a fuzzy ring.         A non zero proper ideal I of a ring R is called an essential ideal if I  J  (0), for any non zero ideal J of R, [4].         Inaam in [5] fuzzified this concept to essential fuzzy ideal of fuzzy ring and gave its basic properties.         Nada in [6] introduced and studied notion of semiessential ideal in a ring R, where a non zero i

The purpose of this paper is to define fuzzy subspaces for fuzzy space of orderings and we prove some results about this definition in which it leads to a lot of new results on fuzzy space of orderings. Also we define the sum and product over such spaces such that: If f = < a1,…,an > and g = < b1,…bm>, their sum and product are f + g = < a1…,an, b1, …, bm> and f × g =. for all a1,…,an,b1,…,bm ? G