Preferred Language
Articles
/
bsj-2557
Development Binary Search Algorithm
...Show More Authors

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 complexity of Search) is O(log2 n) (pronounce this "big-Oh-n" or "the order of magnitude"), if we search in a list consists of (N) elements. In this research the number of comparison is reduced to triple by using Triple structure, this process makes the maximum number of comparisons is O(log2 (n)/3+1) if we search key in list consist of (N) elements.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat May 30 2020
Journal Name
Neuroquantology Journal
The Effect of Re-Use of Lossy JPEG Compression Algorithm on the Quality of Satellite Image
...Show More Authors

In this study, an analysis of re-using the JPEG lossy algorithm on the quality of satellite imagery is presented. The standard JPEG compression algorithm is adopted and applied using Irfan view program, the rang of JPEG quality that used is 50-100.Depending on the calculated satellite image quality variation, the maximum number of the re-use of the JPEG lossy algorithm adopted in this study is 50 times. The image quality degradation to the JPEG quality factor and the number of re-use of the JPEG algorithm to store the satellite image is analyzed.

View Publication Preview PDF
Scopus (4)
Crossref (4)
Scopus Crossref
Publication Date
Fri Dec 30 2022
Journal Name
Journal Of Mathematics
Estimation of Parameters of Finite Mixture of Rayleigh Distribution by the Expectation-Maximization Algorithm
...Show More Authors

In the lifetime process in some systems, most data cannot belong to one single population. In fact, it can represent several subpopulations. In such a case, the known distribution cannot be used to model data. Instead, a mixture of distribution is used to modulate the data and classify them into several subgroups. The mixture of Rayleigh distribution is best to be used with the lifetime process. This paper aims to infer model parameters by the expectation-maximization (EM) algorithm through the maximum likelihood function. The technique is applied to simulated data by following several scenarios. The accuracy of estimation has been examined by the average mean square error (AMSE) and the average classification success rate (ACSR). T

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Mon Sep 12 2022
Journal Name
Electronics
TWGH: A Tripartite Whale–Gray Wolf–Harmony Algorithm to Minimize Combinatorial Test Suite Problem
...Show More Authors

Today’s academics have a major hurdle in solving combinatorial problems in the actual world. It is nevertheless possible to use optimization techniques to find, design, and solve a genuine optimal solution to a particular problem, despite the limitations of the applied approach. A surge in interest in population-based optimization methodologies has spawned a plethora of new and improved approaches to a wide range of engineering problems. Optimizing test suites is a combinatorial testing challenge that has been demonstrated to be an extremely difficult combinatorial optimization limitation of the research. The authors have proposed an almost infallible method for selecting combinatorial test cases. It uses a hybrid whale–gray wol

... Show More
View Publication
Scopus (11)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sun Mar 01 2020
Journal Name
Periodicals Of Engineering And Natural Sciences
Employment of the genetic algorithm in some methods of estimating survival function with application
...Show More Authors

Intended for getting good estimates with more accurate results, we must choose the appropriate method of estimation. Most of the equations in classical methods are linear equations and finding analytical solutions to such equations is very difficult. Some estimators are inefficient because of problems in solving these equations. In this paper, we will estimate the survival function of censored data by using one of the most important artificial intelligence algorithms that is called the genetic algorithm to get optimal estimates for parameters Weibull distribution with two parameters. This leads to optimal estimates of the survival function. The genetic algorithm is employed in the method of moment, the least squares method and the weighted

... Show More
Scopus (2)
Scopus
Publication Date
Sat Dec 31 2022
Journal Name
International Journal Of Intelligent Engineering And Systems
Using Three-Dimensional Logistic Equations and Glowworm Swarm Optimization Algorithm to Generate S-Box
...Show More Authors

View Publication
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Wed Jun 01 2016
Journal Name
Journal Of Economics And Administrative Sciences
Compared with Genetic Algorithm Fast – MCD – Nested Extension and Neural Network Multilayer Back propagation
...Show More Authors

The study using Nonparametric methods for roubust to estimate a location and scatter it is depending  minimum covariance determinant of multivariate regression model , due to the presence of outliear values and increase the sample size and presence of more than after the model regression multivariate therefore be difficult to find a median location .       

It has been the use of genetic algorithm Fast – MCD – Nested Extension and compared with neural Network Back Propagation of multilayer in terms of accuracy of the results and speed in finding median location ,while the best sample to be determined by relying on less distance (Mahalanobis distance)has the stu

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Oct 31 2019
Journal Name
Journal Of Theoretical And Applied Information Technology
AN ENHANCED EVOLUTIONARY ALGORITHM WITH LOCAL HEURISTIC APPROACH FOR DETECTING COMMUNITY IN COMPLEX NETWORKS
...Show More Authors

Preview PDF
Scopus (5)
Scopus
Publication Date
Thu Jun 01 2023
Journal Name
Iaes International Journal Of Artificial Intelligence (ij-ai)
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
...Show More Authors

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

... Show More
View Publication
Scopus (5)
Crossref (5)
Scopus Crossref
Publication Date
Wed Sep 05 2007
Journal Name
Neural Network World
A canonical generic algorithm for likelihood estimator of first order moving average model parameter
...Show More Authors

The increasing availability of computing power in the past two decades has been use to develop new techniques for optimizing solution of estimation problem. Today's computational capacity and the widespread availability of computers have enabled development of new generation of intelligent computing techniques, such as our interest algorithm, this paper presents one of new class of stochastic search algorithm (known as Canonical Genetic' Algorithm ‘CGA’) for optimizing the maximum likelihood function strategy is composed of three main steps: recombination, mutation, and selection. The experimental design is based on simulating the CGA with different values of are compared with those of moment method. Based on MSE value obtained from bot

... Show More
Scopus (3)
Scopus
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
Genetic Algorithm Optimization Model for Central Marches Restoration Flows with Different Water Quality Scenarios
...Show More Authors

A Genetic Algorithm optimization model is used in this study to find the optimum flow values of the Tigris river branches near Ammara city, which their water is to be used for central marshes restoration after mixing in Maissan River. These tributaries are Al-Areed, AlBittera and Al-Majar Al-Kabeer Rivers. The aim of this model is to enhance the water quality in Maissan River, hence provide acceptable water quality for marsh restoration. The model is applied for different water quality change scenarios ,i.e. , 10%,20% increase in EC,TDS and BOD. The model output are the optimum flow values for the three rivers while, the input data are monthly flows(1994-2011),monthly water requirements and water quality parameters (EC, TDS, BOD, DO and

... Show More
View Publication Preview PDF
Crossref (2)
Crossref