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

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise near topological spaces over B. Also, we introduce the concepts of fibrewise near closed and near open topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

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

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

We introduce some new generalizations of some definitions which are, supra closure converge to a point, supra closure directed toward a set, almost supra converges to a set, almost supra cluster point, a set supra H-closed relative, supra closure continuous functions, supra weakly continuous functions, supra compact functions, supra rigid a set, almost supra closed functions and supra perfect functions. And we state and prove several results concerning it

Contemporary arts have achieved, in accordance with the transition of concepts, a new logic in presentation and expression in general, and specifically in the field of ceramic art. The shift towards the logic of rejection and subversion of prevailing methods, which have been almost a constant foundation for a long period, has directly influenced the direction of visual arts in the contemporary world.
The growth and cultural transformations that the world has witnessed after the two World Wars have produced cognitive shifts based on strategies that diverge from the dominant culture. These approaches vary according to existential needs, as the language of art has become conceptual and a medium for contemporary culture with its rapid an

  The aim of this paper is to introduce a new type of proper mappings called semi-p-proper mapping by using semi-p-open sets, which is weaker than the proper mapping. Some properties and characterizations of this type of mappings are given.

In this paper, we presented new types of Mc-function by using 𝜔-open and 𝑁-open sets some of them are weaker than Mc-function and some are stronger, which are 𝜔Mc-function, M𝜔c-function, 𝜔M𝜔c-function, 𝑁Mc-function, M𝑁c-function and 𝑁M𝑁c-function, also we submitted new kinds of continuous functions and compact functions and we illustrated the relationships between these types. The purpose of this paper is to expand the study of Mcfunction and to get results that we need to find the relationship with the types that have been introduced.

            This paper is interested in certain  subclasses of univalent and bi-univalent functions concerning  to shell- like curves connected with k-Fibonacci numbers involving modified Sigmoid activation function θ(t)=2/(1+e^(-t) ) ,t ≥0 in unit disk |z|<1 . For estimating of the initial coefficients |c_2 | , |c_3 |, Fekete-Szego ̈ inequality and the  second Hankel determinant have been investigated for the functions in our classes. 

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the