This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra

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

       It is a common Knowledge that adverbs in Turkish languages can modify verbs, adjectives, nouns or other adverbs. Moreover, adverbs can determine the meanings of nouns and verbs in a sentence as far as time, place, manner, quantity and interrogative are concerned. The present study debates adverbs’ functions in Namiq Kamal’s play Vatan yahut Silistre.

 The study sheds light on the author’s use of the adverbs to describe the required theatrical actions of the play  and to convey his reflections and thoughts easily to the auidence. One of the main hindrances encountered in conducting the study is the shortage of the  upto date academic resources necessary for

We introduce and discus recent type of fibrewise topological spaces, namely fibrewise bitopological spaces, Also, we introduce the concepts of fibrewise closed bitopological spaces, fibrewise open bitopological spaces, fibrewise locally sliceable bitopological spaces and fibrewise locally sectionable bitopological spaces. Furthermore, we state and prove several propositions concerning with these concepts.

In this paper, we used four classification methods to classify objects and compareamong these methods, these are K Nearest Neighbor's (KNN), Stochastic Gradient Descentlearning (SGD), Logistic Regression Algorithm(LR), and Multi-Layer Perceptron (MLP). Weused MCOCO dataset for classification and detection the objects, these dataset image wererandomly divided into training and testing datasets at a ratio of 7:3, respectively. In randomlyselect training and testing dataset images, converted the color images to the gray level, thenenhancement these gray images using the histogram equalization method, resize (20 x 20) fordataset image. Principal component analysis (PCA) was used for feature extraction, andfinally apply four classification metho

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.

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