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

The main purpose of this work is to introduce some types of fuzzy convergence sequences of operators defined on a standard fuzzy normed space (SFN-spaces) and investigate some properties and relationships between these concepts. Firstly, the definition of weak fuzzy convergence sequence in terms of fuzzy bounded linear functional is given. Then the notions of weakly and strongly fuzzy convergence sequences of operators  are introduced and essential theorems related to these concepts are proved. In particular, if ( ) is a strongly fuzzy convergent sequence with a limit  where linear operator from complete standard fuzzy normed space  into a standard fuzzy normed space  then  belongs to the set of all fuzzy bounded linear operators

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 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.

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 aim of this research is to study some types of fibrewise fuzzy topological spaces. The six major goals are explored in this thesis. The very first goal, introduce and study the notions types of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j={δ,θ,α,p,s,b,β} The second goal is to introduce weak and strong forms of fibrewise fuzzy ω-topological spaces, namely the fibrewise fuz

Arabic text classification is a challenging task because of the complex morphology of the language, the existence of different writing forms and a multitude of dialects, which can result in sparser common text representations. While transformer models such as AraBERT have obtained superior results on many Arabic NLP tasks, their high computational requirements make them difficult to deploy in environments with limited hardware resources. In some cases this can also make the model less practical for researchers working with basic computer systems. This study focuses on a more practical issue: how much accuracy a simple classifier may lose when the amount of required computation is reduced. We use a combined TF-IDF representation based on bo

In this work we define and study new concept of fibrewise topological spaces, namely fibrewise soft topological spaces, Also, we introduce the concepts of fibrewise closed soft topological spaces, fibrewise open soft topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces.