Preferred Language
Articles
/
ijs-3215
Meerkat Clan Algorithm for Solving N-Queen Problems
...Show More Authors

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environment is a directed graph, called the search space, produced for the efficient search of valid n-queens’ placement, in a way that they do not cause harm to one another. This paper also presents the development of an intelligent heuristic function which is helpful to find the solution with high speed and effectiveness. This study includes a detailed discussion of the problem background, problem complexity, Meerkat Clan Algorithm, and comparisons of the problem solution with the Practical Swarm Optimization (PSO) and Genetic Algorithm (GA. It is an entirely review-based work which implemented the suggested designs and architectures of the methods and a fair amount of experimental results.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Jan 30 2022
Journal Name
Iraqi Journal Of Science
Characterization of strict local minimizers of order two for semi -infinite problems in the nonparametric constraint case
...Show More Authors

We extended the characterization of strict local minimizers of order two in ward,s
theorem for nonlinear problem to a certain class of nonsmooth semi-infinite problems with inequality constraints in the nonparametric constraint case.

View Publication Preview PDF
Publication Date
Mon Jan 01 2024
Journal Name
Ieee Access
A Direct Solution Scheme for Wide-Angle Electromagnetic Scattering Problems Using Compressive Sensing-Based Method of Moments
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Wed Jun 30 2021
Journal Name
Iraqi Journal Of Chemical And Petroleum Engineering
Advanced Study of Promoted Pt /SAPO-11 Catalyst for Hydroisomerization of the n-Decane Model and Lube Oil
...Show More Authors

   SAPO-11 is synthesized from silicoaluminophosphate in the presence of di-n-propylamine as a template. The results show that the sample obtained has good crystallinity, 396m2/g BET surface area, and 0.35 cm3/g pore volume. The hydroisomerization activity of (0.25)Pt (1)Zr (0.5)W/SAPO-11 catalyst was determined using n-decane and base oil. All hydroisomerization experiments of n-decane were achieved at a fixed bed plug flow reactor at a temperature range of 200-275°C and  LHSV 0.5-2h-1.  The results show that the n-decane conversion increases with increasing temperature and decreasing LHSV, the maximum conversion of 66.7 % was achieved at temperature 275°C and LHSV of 0.5 h-1

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Wed Jun 30 2021
Journal Name
Iraqi Journal Of Chemical And Petroleum Engineering
Advanced Study of Promoted Pt /SAPO-11 Catalyst for Hydroisomerization of the n-Decane Model and Lube Oil
...Show More Authors

SAPO-11 is synthesized from silicoaluminophosphate in the presence of di-n-propylamine as a template. The results show that the sample obtained has good crystallinity, 396m2/g BET surface area, and 0.35 cm3/g pore volume. The hydroisomerization activity of (0.25)Pt (1)Zr (0.5)W/SAPO-11 catalyst was determined using n-decane and base oil. All hydroisomerization experiments of n-decane were achieved at a fixed bed plug flow reactor at a temperature range of 200-275°C and  LHSV 0.5-2h-1.  The results show that the n-decane conversion increases with increasing temperature and decreasing LHSV, the maximum conversion of 66.7 % was achieved at temperature 275°C and LHSV of 0.5 h-1. Meanwhile, the same catalyst was used to improve base oil spec

... Show More
Crossref (1)
Crossref
Publication Date
Mon Mar 09 2015
Journal Name
Monthly Notices Of The Royal Astronomical Society
A reliable iterative method for solving Volterra integro-differential equations and some applications for the Lane–Emden equations of the first kind
...Show More Authors

View Publication
Crossref (7)
Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Journal Of Physics: Conference Series
Wireless Optimization Algorithm for Multi-floor AP deployment using binary particle swarm optimization (BPSO)
...Show More Authors
Abstract<p>Optimizing the Access Point (AP) deployment is of great importance in wireless applications owing the requirement to provide efficient and cost-effective communication. Highly targeted by many researchers and academic industries, Quality of Service (QOS) is an important primary parameter and objective in mind along with AP placement and overall publishing cost. This study proposes and investigates a multi-level optimization algorithm based on Binary Particle Swarm Optimization (BPSO). It aims to an optimal multi-floor AP placement with effective coverage that makes it more capable of supporting QOS and cost effectiveness. Five pairs (coverage, AP placement) of weights, signal threshol</p> ... Show More
View Publication
Scopus Crossref
Publication Date
Fri Jun 24 2022
Journal Name
Iraqi Journal Of Science
The Design of Efficient Algorithm for Face Recognition Based on Hybrid PCA-Wavelet Transform
...Show More Authors

In modern times face recognition is one of the vital sides for computer vision. This is due to many reasons involving availability and accessibility of technologies and commercial applications. Face recognition in a brief statement is robotically recognizing a person from an image or video frame. In this paper, an efficient face recognition algorithm is proposed based on the benefit of wavelet decomposition to extract the most important and distractive features for the face and Eigen face method to classify faces according to the minimum distance with feature vectors. Faces94 data base is used to test the method. An excellent recognition with minimum computation time is obtained with accuracy reaches to 100% and recognition time decrease

... Show More
View Publication Preview PDF
Publication Date
Thu Dec 01 2022
Journal Name
Baghdad Science Journal
Distributed Heuristic Algorithm for Migration and Replication of Self-organized Services in Future Networks
...Show More Authors

Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject

... Show More
View Publication Preview PDF
Scopus (1)
Scopus Clarivate 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