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 current study primarily aims to develop a dictionary system for tracing mobile phone numbers for call centers of mobile communication companies. This system tries to save the numbers using a digital search tree in order to make the processes of searching and retrieving customers’ information easier and faster. Several shrubs that represent digits of the total phone numbers will be built through following the phone number digits to be added to the dictionary, with the owner name being at the last node in the tree. Thus, by such searching process, every phone number can be tracked digit-by-digit according to a required path inside its tree, until reaching the leaf. Then, the value stored in the node, that rep

In this study, the four tests employed for non-linear dependence which is Engle (1982), McLeod &Li (1983), Tsay (1986), and Hinich & Patterson (1995). To test the null hypothesis that the time series is a serially independent and identical distribution process .The linear structure is removed from the data which is represent the sales of State Company for Electrical Industries, through a pre-whitening model, AR (p) model .From The results for tests to the data is not so clear.

In this paper we investigate the use of two types of local search methods (LSM), the Simulated Annealing (SA) and Particle Swarm Optimization (PSO), to solve the problems ( ) and . The results of the two LSMs are compared with the Branch and Bound method and good heuristic methods. This work shows the good performance of SA and PSO compared with the exact and heuristic methods in terms of best solutions and CPU time.

In this paper, the computational complexity will be reduced using a revised version of the selected mapping (SLM) algorithm. Where a partial SLM is achieved to reduce the mathematical operations around 50%. Although the peak to average power ratio (PAPR) reduction gain has been slightly degraded, the dramatic reduction in the computational complexity is an outshining achievement. Matlab simulation is used to evaluate the results, where the PAPR result shows the capability of the proposed method.  

 The logistic regression model of the most important regression models a non-linear which aim getting estimators have a high of efficiency, taking character more advanced in the process of statistical analysis for being a models appropriate form of Binary Data.                                                          

Among the problems that appear as a result of the use of some statistical methods I

Alzheimer’s disease (AD) is a progressive disorder that affects cognitive brain functions and starts many years before its clinical manifestations. A biomarker that provides a quantitative measure of changes in the brain due to AD in the early stages would be useful for early diagnosis of AD, but this would involve dealing with large numbers of people because up to 50% of dementia sufferers do not receive formal diagnosis. Thus, there is a need for accurate, low-cost, and easy to use biomarkers that could be used to detect AD in its early stages. Potentially, electroencephalogram (EEG) based biomarkers can play a vital role in early diagnosis of AD as they can fulfill these needs. This is a cross-sectional study that aims to demon