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

This paper including a gravitational lens time delays study for a general family of lensing potentials, the popular singular isothermal elliptical potential (SIEP), and singular isothermal elliptical density distribution (SIED) but allows general angular structure. At first section there is an introduction for the selected observations from the gravitationally lensed systems. Then section two shows that the time delays for singular isothermal elliptical potential (SIEP) and singular isothermal elliptical density distributions (SIED) have a remarkably simple and elegant form, and that the result for Hubble constant estimations actually holds for a general family of potentials by combining the analytic results with data for the time dela

      Faintly continuous (FC) functions, entitled faintly S-continuous and faintly δS-continuous functions have been introduced and investigated via a -open and -open sets. Several characterizations and properties of faintly S-continuous and faintly -Continuous functions were obtained. In addition, relationships between faintly s- Continuous and faintly S-continuous function and other forms of FC function were investigated. Also, it is shown that every faintly  S-continuous is weakly S-continuous. The Convers is shown to be satisfied only if the co-domain of the function is almost regular.

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

Aspergillus flavus isolates which are considered on conidial shape through microscopic examination and mycelial colour through cultural properties . Primary screening for the ability of A. flavus isolates for aflatoxin production was determined using A.flavus parasiticus agar medium (AFPA) as well , 7 isolates from 11 isolates give a positive result by the presence of bright yellow-orange pigments indicated the presence of aflatoxins. Molecular genetics techniques using DNA polymorphism have been increasingly used to characterize and identify genetic diversity and relationships among eleven A. flavus isolated from different source using the ISSR(inter simple sequence repeats) technique. Three universal primers designed at University of B

Five levels of Zn-EDTA fertilizer and foliar application of boron were used to study the local rice response through studying of some vegetative and reproductive growth characters, by conducting two field experiments at Kanipanka Agricultural Research Station during the summer season of 2004 by using RCBD with three replications. Significant differences were found in studied characters, there were increase in the number of days from seeding to 50% flowering (94.330-96.233) days, from 50% flowering to physiological maturity (37.50-38.28) days, plant height (82.50-91.423) cm and LAI (5.441-7.525). Reproductive characters such as number of grains panicle-1 (74.11-85.88), number of panicles m-2 (321.00-426.083), biological yield (8166.166-11082

The Nuclear structure of 110-116Cd isotopes was studied theoretically in the framework of the interacting boson model of IBM-l and IBM-2. The properties of the lowest mixed symmetry states such as the 1+, 2+ and 3+ levels produced by the IBM-2 model in the vibrational-limit U(5) of Cd - isotopes are studied in details. This analysis shows that the character of mixed symmetry of 2+ is shared between and states in 110-114Cd – isotopes, the large shar goes to s, while in isotope, the state is declared as a mixed symmetry state without sharing. This identification is confirmed by the percentage of F-spin contribution. The electromagnetic properties of E2 and Ml operators were investigated and the results were analyzed. Various

Background: Psoriatic arthritis is a type of arthritis that can often affect some patients who suffer from psoriasis. Approximately 40-50% of individuals with psoriatic arthritis have the HLA-B27 genotype

Objective: To investigate whether we could confirm the role of HLA-B27 alleles and psoriatic arthritis in Iraqi Arab Muslims patients.

Method: A cross sectional case control comparative study included thirty Iraqi Arab Muslims who had psoriatic arthritis that consulted the Dermatological and Rheumatological Department in AL-Kindy Teaching Hospital from November 2014 to June 2015. HLA-genotyping for HLA-B27 were assessed. A control group consisted of fifty-one healthy vol

     In this paper, we present a Branch and Bound (B&B) algorithm of scheduling (n) jobs on a single machine to minimize the sum total completion time, total tardiness, total earliness, number of tardy jobs and total late work with unequal release dates. We proposed six heuristic methods for account upper bound. Also to obtain lower bound (LB) to this problem we modified a (LB) select from literature, with (Moore algorithm and Lawler's algorithm).  And some dominance rules were suggested. Also, two special cases were derived. Computational experience showed the proposed (B&B) algorithm was effective in solving problems with up to (16) jobs, also the upper bounds and the lower bound were effective in restr