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

We presented in this paper a new class containing analytic univalent functions defined on unit disk. We obtained many geometric properties , like , coefficient inequality , distortion and growth theorems, convolution property, convex set, arithmetic mean and radius of starlikness and convexity by using Gaussian hypergeometric function for the class

The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively. Various non-trivial examples are introduced to illustrate the new functions and show their relationships with -convex functions recently introduced in the literature. Different general properties and characteristics of this class of functions are established. In addition, some optimality properties of generalized non-linear optimization problems are discussed. In this generalized optimization problems, we used, as the objective function, quasi semi -convex (respectively, strictly quasi semi -convex

Csaszar introduced the concept of generalized topological space and a new open set in a generalized topological space called -preopen in 2002 and 2005, respectively. Definitions of -preinterior and -preclosuer were given. Successively, several studies have appeared to give many generalizations for an open set. The object of our paper is to give a new type of generalization of an open set in a generalized topological space called -semi-p-open set. We present the definition of this set with its equivalent. We give definitions of -semi-p-interior and -semi-p-closure of a set and discuss their properties. Also the properties of -preinterior and -preclosuer are discussed. In addition, we give a new type of continuous function

In this paper, the reliability of the stress-strength model is derived for probability P(Y<X) of a component having its strength X exposed to one independent stress Y, when X and Y are following Gompertz Fréchet distribution with unknown shape parameters and known parameters . Different methods were used to estimate reliability R and Gompertz Fréchet distribution parameters, which are maximum likelihood, least square, weighted least square, regression, and ranked set sampling. Also, a comparison of these estimators was made by a simulation study based on mean square error (MSE) criteria. The comparison confirms that the performance of the maximum likelihood estimator is better than that of the other estimators.

The aims of this thesis are to study the topological space; we introduce a new kind of perfect mappings, namely j-perfect mappings and j-ω-perfect mappings. Furthermore, we devoted to study the relationship between j-perfect mappings and j-ω-perfect mappings. Finally, certain theorems and characterization concerning these concepts are studied. On the other hand, we studied weakly/ strongly forms of ω-perfect mappings, namely -ω-perfect mappings, weakly -ω-perfect mappings and strongly-ω-perfect mappings; also, we investigate their fundamental properties. We devoted to study the relationship between weakly -ω-perfect mappings and strongly -ω-perfect mappings. As well as, some new generalizations of some definitions wh

The last decade of this 20th century provides a wide spread of applications of one of the computer techniques, which is called Fuzzy Logic. This technique depends mainly on the fuzzy set theory, which is considered as a general domain with respect to the conventional set theory. This paper presents in initiative the fuzzy sets theory and fuzzy logic as a complete mathematics system. Here it was explained the concept of fuzzy set and defined the operations of fuzzy logic. It contains eleven operations beside the other operations which related to fuzzy algebra. Such search is considered as an enhancement for supporting the others waiting search activities in this field.

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

This paper consist some new generalizations of some definitions such: j-ω-closure converge to a point,  j-ω-closure directed toward a set, almost  j-ω-converges to a set, almost  j-ω-cluster point, a set  j-ω-H-closed relative, j-ω-closure continuous mappings, j-ω-weakly continuous mappings, j-ω-compact mappings, j-ω-rigid a set, almost j-ω-closed mappings and  j-ω-perfect mappings. Also, we prove several results concerning it, where j ÃŽ{q, δ,a, pre, b, b}.

     The objective of this paper is to show modern class of open sets which is an -open. Some functions via this concept were studied and the relationships such as continuous function strongly -continuous function -irresolute function -continuous function.