There are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com

Songs are considered as an educational and a substantial dependable references used in teaching and learning, particularly the so - called foreign language learning that allows learners to adapt to the target language culture and to develop their language learning skills including: listening comprehension, reading comprehension, speaking and writing. Consequently, it can be said that the Francophone songs with the musical richness and resonance specifically facilities French language learning skills  for all levels of education and achieve short and long terms predetermined educational language learning goals.  

     In fact, language learning through songs method does not only include the

     In this study, we propose a suitable solution for a non-linear system of ordinary differential equations (ODE) of the first order with the initial value problems (IVP) that contains multi variables and multi-parameters with missing real data. To solve the mentioned system, a new modified numerical simulation method is created for the first time which is called Mean Latin Hypercube Runge-Kutta (MLHRK). This method can be obtained by combining the Runge-Kutta (RK) method with the statistical simulation procedure which is the Latin Hypercube Sampling (LHS) method. The present work is applied to the influenza epidemic model in Australia in 1919  for a previous study. The comparison between the numerical and numerical simulation res

    We introduce in this paper the concept of approximaitly semi-prime submodules of unitary left -module  over a commutative ring  with identity as a generalization of a prime submodules and semi-prime submodules, also generalization of quasi-prime submodules and approximaitly prime submodules. Various basic properties of an approximaitly semi-prime submodules are discussed, where a proper submodule  of an -module  is called an approximaitly semi-prime submodule of  , if whenever , where ,  and , implies that . Furthermore the behaviors of approximaitly semi-prime submodule in some classes of modules are studied. On the other hand several characterizations of this concept are

      Let  be a commutative ring with identity. The aim of this paper is introduce the notion of a pseudo primary-2-absorbing submodule as generalization of 2-absorbing submodule and a pseudo-2-absorbing submodules. A proper submodule  of an -module  is called pseudo primary-2-absorbing if whenever , for , , implies that either                  or  or . Many basic properties, examples and characterizations of these concepts are given. Furthermore, characterizations of pseudo primary-2-absorbing submodules in some classes of modules are introduced. Moreover, the behavior of a pseudo primary-2-absorbing submodul

     Let R be a commutative ring with unity and an R-submodule N is called semimaximal if and only if

 the sufficient conditions of F-submodules to be semimaximal .Also the concepts of (simple , semisimple) F- submodules and quotient F- modules are  introduced and given some  properties .

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

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.

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