Soft closure spaces are a new structure that was introduced very recently. These new spaces are based on the notion of soft closure operators. This work aims to provide applications of soft closure operators. We introduce the concept of soft continuous mappings and soft closed (resp. open) mappings, support them with examples, and investigate some of their properties.

تهدف هذه الدراسة للتعرف على السياسات اإلاسرائيلية المتبعة على الارض والمتمثلة في االاستيطان
الاستعماري والطرق التفافية، ومصادرة الاراضي وجدار الضم والتوسع العنصري، بالاضافة إلى التصنيف
الاداري للمناطق في الضفة الغربية حسب ما جاء في اتفاقية أوسلو، والتي من شأنها التأثير على تلك
المناطق، وال سيما قطاع اإلسكان الذي يعد من أهم القطاعات التي تتر كب وبالتحديد في منطقة الدراسة،
وسوف تحاول هذه الدراسة تس

      Let  R  be a commutative ring  with identity  and  E  be a unitary left  R – module .We introduce  and study the concept Weak Pseudo – 2 – Absorbing submodules as  generalization of weakle – 2 – Absorbing submodules , where a proper submodule  A of  an  R – module  E is  called  Weak Pseudo – 2 – Absorbing  if   0 ≠ rsx   A   for  r, s  R , x  E , implies that  rx   A + soc ( E ) or  sx  A + soc (E)  or   rs  [ A + soc ( E ) E ]. Many basic  properties, char

Let G be a graph, each edge e of which is given a weight w(e). The shortest path problem is a path of minimum weight connecting two specified vertices a and b, and from it we have a pre-topology. Furthermore, we study the restriction and separators in pre-topology generated by the shortest path problems. Finally, we study the rate of liaison in pre-topology between two subgraphs. It is formally shown that the new distance measure is a metric

The main idea of this research is to consider fibrewise pairwise versions of the more important separation axioms of ordinary bitopology named fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise - spaces, fibrewise pairwise -Hausdorff spaces, fibrewise pairwise functionally -Hausdorff spaces, fibrewise pairwise -regular spaces, fibrewise pairwise completely -regular spaces, fibrewise pairwise -normal spaces and fibrewise pairwise functionally -normal spaces. In addition we offer some results concerning it.

     The primary purpose of this subject is to define new games in ideal spaces via set. The relationships between games that provided and the winning and losing strategy for any player were elucidated.

The primary objective of this paper is to introduce a new concept of fibrewise topological spaces on D is named fibrewise multi- topological spaces on D. Also, we entroduce the concepts of multi-proper, fibrewise multi-compact, fibrewise locally multi-compact spaces, Moreover, we study relationships between fibrewise multi-compact (resp., locally multi-compac) space and some fibrewise multi-separation axioms.

In this paper we introduced many new concepts all of these concepts completely
depended on the concept of feebly open set. The main concepts which introduced in
this paper are minimal f-open and maximal f-open sets. Also new types of
topological spaces introduced which called Tf min and Tf max spaces. Besides,
we present a package of maps called: minimal f-continuous, maximal f-continuous,
f-irresolute minimal, f-irresolute maximal, minimal f-irresolute and maximal firresolute.
Additionally we investigated some fundamental properties of the concepts
which presented in this paper.

     The diseases presence in various species of fruits are the crucial parameter of economic composition and degradation of the cultivation industry around the world. The proposed pear fruit disease identification neural network (PFDINN) frame-work to identify three types of pear diseases was presented in this work. The major phases of the presented frame-work were as the following: (1) the infected area in the pear fruit was detected by using the algorithm of K-means clustering. (2) hybrid statistical features were computed over the segmented pear image and combined to form one descriptor. (3) Feed forward neural network (FFNN), which depends on three learning algorithms of back propagation (BP) training, namely Sca