Preferred Language
Articles
/
ijs-5767
Solving Adaptive Distributed Routing Algorithm Using Crow Search Algorithm
...Show More Authors

    Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the problems that are related to the optimization. This study presents a new adaptive distributed algorithm of routing on CSA. Because the search space may be modified according to the size and kind of the network, the algorithm can be easily customized to the issue space. In contrast to population-based algorithms that have a broad and time-consuming search space. For ten networks of various sizes, the technique was used to solve the shortest path issue. And its capability for solving the problem of the routing in the switched networks is examined: detecting the shortest path in the process of a data packet transfer amongst the networks. The suggested method was compared with four common metaheuristic algorithms (which are: ACO, AHA, PSO and GA) on 10 datasets (integer, weighted, and not negative graphs) with a variety of the node sizes (10 - 297 nodes). The results have proven that the efficiency of the suggested methods is promising as well as competing with other approaches.

Scopus Crossref
View Publication
Publication Date
Sun Feb 25 2024
Journal Name
Baghdad Science Journal
Facial Emotion Images Recognition Based On Binarized Genetic Algorithm-Random Forest
...Show More Authors

Most recognition system of human facial emotions are assessed solely on accuracy, even if other performance criteria are also thought to be important in the evaluation process such as sensitivity, precision, F-measure, and G-mean. Moreover, the most common problem that must be resolved in face emotion recognition systems is the feature extraction methods, which is comparable to traditional manual feature extraction methods. This traditional method is not able to extract features efficiently. In other words, there are redundant amount of features which are considered not significant, which affect the classification performance. In this work, a new system to recognize human facial emotions from images is proposed. The HOG (Histograms of Or

... Show More
View Publication Preview PDF
Scopus (2)
Crossref (1)
Scopus Crossref
Publication Date
Fri Apr 01 2011
Journal Name
Al-mustansiriyah Journal Of Science
A Genetic Algorithm Based Approach For Generating Unit Maintenance Scheduling
...Show More Authors

Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Al-mansoor College
An Improvement to Face Detection Algorithm for Non-Frontal Faces
...Show More Authors

Publication Date
Thu Jan 14 2021
Journal Name
Iraqi Journal Of Science
Highly-Performed Fuzzily-logicized Edge Detecting Algorithm for Noisy Handwritings
...Show More Authors

The main targets for using the edge detection techniques in image processing are to reduce the number of features and find the edge of image based-contents. In this paper, comparisons have been demonstrated between classical methods (Canny, Sobel, Roberts, and Prewitt) and Fuzzy Logic Technique to detect the edges of different samples of image's contents and patterns. These methods are tested to detect edges of images that are corrupted with different types of noise such as (Gaussian, and Salt and pepper). The performance indices are mean square error and peak signal to noise ratio (MSE and PSNR). Finally, experimental results show that the proposed Fuzzy rules and membership function provide better results for both noisy and noise-free

... Show More
View Publication Preview PDF
Scopus Crossref
Publication Date
Fri Feb 08 2019
Journal Name
Journal Of The College Of Education For Women
Minimum Spanning Tree Algorithm for Skin Cancer Image Object Detection
...Show More Authors

This paper proposes a new method Object Detection in Skin Cancer Image, the minimum
spanning tree Detection descriptor (MST). This ObjectDetection descriptor builds on the
structure of the minimum spanning tree constructed on the targettraining set of Skin Cancer
Images only. The Skin Cancer Image Detection of test objects relies on their distances to the
closest edge of thattree. Our experimentsshow that the Minimum Spanning Tree (MST) performs
especially well in case of Fogginessimage problems and in highNoisespaces for Skin Cancer
Image.
The proposed method of Object Detection Skin Cancer Image wasimplemented and tested on
different Skin Cancer Images. We obtained very good results . The experiment showed that

... Show More
View Publication Preview PDF
Publication Date
Sun Dec 01 2013
Journal Name
2013 Ieee International Rf And Microwave Conference (rfm)
Differential Evolution algorithm for linear frequency modulation radar signal denoising
...Show More Authors

Signal denoising is directly related to sample estimation of received signals, either by estimating the equation parameters for the target reflections or the surrounding noise and clutter accompanying the data of interest. Radar signals recorded using analogue or digital devices are not immune to noise. Random or white noise with no coherency is mainly produced in the form of random electrons, and caused by heat, environment, and stray circuitry loses. These factors influence the output signal voltage, thus creating detectable noise. Differential Evolution (DE) is an effectual, competent, and robust optimisation method used to solve different problems in the engineering and scientific domains, such as in signal processing. This paper looks

... Show More
View Publication
Scopus Crossref
Publication Date
Thu May 01 2008
Journal Name
2008 International Conference On Computer And Communication Engineering
A binary Particle Swarm Optimization for attacking knapsacks Cipher Algorithm
...Show More Authors

View Publication
Scopus (10)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Thu Mar 01 2018
Journal Name
Journal Of Engineering
Flexible Genetic Algorithm Based Optimal Power Flow of Power Systems
...Show More Authors

Nowadays, the power plant is changing the power industry from a centralized and vertically integrated form into regional, competitive and functionally separate units. This is done with the future aims of increasing efficiency by better management and better employment of existing equipment and lower price of electricity to all types of customers while retaining a reliable system. This research is aimed to solve the optimal power flow (OPF) problem. The OPF is used to minimize the total generations fuel cost function. Optimal power flow may be single objective or multi objective function. In this thesis, an attempt is made to minimize the objective function with keeping the voltages magnitudes of all load buses, real outp

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Jul 01 2019
Journal Name
2019 International Joint Conference On Neural Networks (ijcnn)
A Fast Feature Extraction Algorithm for Image and Video Processing
...Show More Authors

View Publication
Scopus (37)
Crossref (35)
Scopus Clarivate Crossref
Publication Date
Wed Aug 31 2022
Journal Name
Iraqi Journal Of Science
Optimal CPU Jobs Scheduling Method Based on Simulated Annealing Algorithm
...Show More Authors

     Task scheduling in an important element in a distributed system. It is vital how the jobs are correctly assigned for each computer’s processor to improve performance. The presented approaches attempt to reduce the expense of optimizing the use of the CPU. These techniques mostly lack planning and in need to be comprehensive. To address this fault, a hybrid optimization scheduling technique is proposed for the hybridization of both First-Come First-Served (FCFS), and Shortest Job First (SJF). In addition, we propose to apply Simulated Annealing (SA) algorithm as an optimization technique to find optimal job’s execution sequence considering both job’s entrance time and job’s execution time to balance them to reduce the job

... Show More
View Publication Preview PDF
Scopus (3)
Scopus Crossref