Preferred Language
Articles
/
dRZvBocBVTCNdQwCtC9B
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. This study presents a hybrid greedy hill climbing algorithm (HGHC) that ensures both effectiveness and near-optimal results for generating a small number of test data. To make certain that the suggested HGHC outperforms the most used techniques in terms of test size. It is compared to others in order to determine its effectiveness. In contrast to recent practices utilized for the production of covering arrays (CAs) and mixed covering arrays (MCAs), this hybrid strategy is superior since allowing it to provide the utmost outcome while reducing the size and limit the loss of unique pairings in the CA/MCA generation.</p>

Scopus Crossref
View Publication
Publication Date
Sun Jun 01 2014
Journal Name
Baghdad Science Journal
Evaluation of the Organic-Pollution Based on the Determination of some Polycyclic Aromatic Hydrocarbons(PAHs) in Tigris River Water in 2012 at Baghdad City , Iraq
...Show More Authors

This study aims to predict the organic pollution produced from the presence of some polycyclic aromatic hydrocarbons (PAHs) and determination it's concentrations (µg/L , ppb) in Tigris river water by a collection twenty-seven water samples from a selected three stations with nine sampling sites and three depths of water (5 cm , 2 m and 4 m) each site for 4.6 km distance of a geographic studied area which is located between the ( Al-Senak and AL-Sarrafiah bridges ) at Baghdad city – Iraq on May, 2012. The geographic location was determined with a Global Positioning System (GPS) and Geographic Information System (GIS) software program. The concentrations of fourteen components (PAHs) were performed using the reverse phase

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Jul 01 2016
Journal Name
Journal Of Engineering
An Adaptive Multi-Objective Particle Swarm Optimization Algorithm for Multi-Robot Path Planning
...Show More Authors

This paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord

... Show More
View Publication Preview PDF
Publication Date
Sun Mar 01 2015
Journal Name
Journal Of Engineering
Multi-Sites Multi-Variables Forecasting Model for Hydrological Data using Genetic Algorithm Modeling
...Show More Authors

A two time step stochastic multi-variables multi-sites hydrological data forecasting model was developed and verified using a case study. The philosophy of this model is to use the cross-variables correlations, cross-sites correlations and the two steps time lag correlations simultaneously, for estimating the parameters of the model which then are modified using the mutation process of the genetic algorithm optimization model. The objective function that to be minimized is the Akiake test value. The case study is of four variables and three sites. The variables are the monthly air temperature, humidity, precipitation, and evaporation; the sites are Sulaimania, Chwarta, and Penjwin, which are located north Iraq. The model performance was

... Show More
View Publication Preview PDF
Publication Date
Thu Feb 01 2018
Journal Name
Journal Of Engineering
Tuning of PID Controllers for Quadcopter System using Cultural Exchange Imperialist Competitive Algorithm
...Show More Authors

Quadrotors are coming up as an attractive platform for unmanned aerial vehicle (UAV) research, due to the simplicity of their structure and maintenance, their ability to hover, and their vertical take-off and landing (VTOL) capability. With the vast advancements in small-size sensors, actuators, and processors, researchers are now focusing on developing mini UAV’s to be used in both research and commercial applications. This work presents a detailed mathematical nonlinear dynamic model of the quadrotor which is formulated using the Newton-Euler method. Although the quadrotor is a 6 DOF under-actuated system, the derived rotational subsystem is fully actuated, while the translational subsystem is under-actuated. The der

... Show More
View Publication Preview PDF
Publication Date
Mon Dec 18 2017
Journal Name
Al-khwarizmi Engineering Journal
Path Planning of an Autonomous Mobile Robot using Enhanced Bacterial Foraging Optimization Algorithm
...Show More Authors

This paper describes the problem of online autonomous mobile robot path planning, which is consisted of finding optimal paths or trajectories for an autonomous mobile robot from a starting point to a destination across a flat map of a terrain, represented by a 2-D workspace. An enhanced algorithm for solving the problem of path planning using Bacterial Foraging Optimization algorithm is presented. This nature-inspired metaheuristic algorithm, which imitates the foraging behavior of E-coli bacteria, was used to find the optimal path from a starting point to a target point. The proposed algorithm was demonstrated by simulations in both static and dynamic different environments. A comparative study was evaluated between the developed algori

... Show More
View Publication Preview PDF
Crossref (15)
Crossref
Publication Date
Tue May 01 2012
Journal Name
2012 Second International Conference On Digital Information And Communication Technology And It's Applications (dictap)
The compact Genetic Algorithm for likelihood estimator of first order moving average model
...Show More Authors

Recently Genetic Algorithms (GAs) have frequently been used for optimizing the solution of estimation problems. One of the main advantages of using these techniques is that they require no knowledge or gradient information about the response surface. The poor behavior of genetic algorithms in some problems, sometimes attributed to design operators, has led to the development of other types of algorithms. One such class of these algorithms is compact Genetic Algorithm (cGA), it dramatically reduces the number of bits reqyuired to store the poulation and has a faster convergence speed. In this paper compact Genetic Algorithm is used to optimize the maximum likelihood estimator of the first order moving avergae model MA(1). Simulation results

... Show More
View Publication
Scopus (5)
Scopus Crossref
Publication Date
Sun Apr 30 2023
Journal Name
Iraqi Journal Of Science
An Evolutionary Algorithm with Gene Ontology-Aware Crossover Operator for Protein Complex Detection
...Show More Authors

     Evolutionary algorithms (EAs), as global search methods, are proved to be more robust than their counterpart local heuristics for detecting protein complexes in protein-protein interaction (PPI) networks. Typically, the source of robustness of these EAs comes from their components and parameters. These components are solution representation, selection, crossover, and mutation. Unfortunately, almost all EA based complex detection methods suggested in the literature were designed with only canonical or traditional components. Further, topological structure of the protein network is the main information that is used in the design of almost all such components. The main contribution of this paper is to formulate a more robust E

... Show More
Scopus (3)
Scopus Crossref
Publication Date
Sun Jan 01 2017
Journal Name
Iraqi Journal Of Science
Strong Triple Data Encryption Standard Algorithm using Nth Degree Truncated Polynomial Ring Unit
...Show More Authors

Cryptography is the process of transforming message to avoid an unauthorized access of data. One of the main problems and an important part in cryptography with secret key algorithms is key. For higher level of secure communication key plays an important role. For increasing the level of security in any communication, both parties must have a copy of the secret key which, unfortunately, is not that easy to achieve. Triple Data Encryption Standard algorithm is weak due to its weak key generation, so that key must be reconfigured to make this algorithm more secure, effective, and strong. Encryption key enhances the Triple Data Encryption Standard algorithm securities. This paper proposed a combination of two efficient encryption algorithms to

... Show More
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of Building Engineering
Development of gravitational search algorithm model for predicting packing density of cementitious pastes
...Show More Authors

View Publication Preview PDF
Scopus (22)
Crossref (11)
Scopus Clarivate Crossref
Publication Date
Sun Sep 07 2014
Journal Name
Baghdad Science Journal
An Algorithm for nth Order Intgro-Differential Equations by Using Hermite Wavelets Functions
...Show More Authors

In this paper, the construction of Hermite wavelets functions and their operational matrix of integration is presented. The Hermite wavelets method is applied to solve nth order Volterra integro diferential equations (VIDE) by expanding the unknown functions, as series in terms of Hermite wavelets with unknown coefficients. Finally, two examples are given

View Publication Preview PDF
Crossref