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
Fri Jan 01 2021
Journal Name
Ieee Access
Microwave Nondestructive Testing for Defect Detection in Composites Based on K-Means Clustering Algorithm
...Show More Authors

View Publication
Scopus (45)
Crossref (46)
Scopus Clarivate Crossref
Publication Date
Thu May 18 2023
Journal Name
Journal Of Engineering
A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms
...Show More Authors

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Dec 08 2023
Journal Name
Iraqi Journal Of Science
Video Image Compression Using Absolute Moment Block Truncation Method with Orthogonal Search Motion Estimation Technique
...Show More Authors

Image compression has become one of the most important applications of the image processing field because of the rapid growth in computer power. The corresponding growth in the multimedia market, and the advent of the World Wide Web, which makes the internet easily accessible for everyone. Since the early 1980, digital image sequence processing has been an attractive research area because an image sequence, as acollection of images, may provide much compression than a single image frame. The increased computational complexity and memory space required for image sequence processing, has in fact, becoming more attainable. this research absolute Moment Block Truncation compression technique which is depend on adopting the good points of oth

... Show More
View Publication Preview PDF
Publication Date
Sun Dec 01 2019
Journal Name
Journal Of Economics And Administrative Sciences
Application of the Holonic Manufacturing System using the Genetic Algorithm : Case Study in Lab 7 of the General Company for the Leather Industry
...Show More Authors

The study aims to achieve several objectives, including follow-up scientific developments and transformations in the modern concepts of the Holistic Manufacturing System for the purpose of identifying the methods of switching to the entrances of artificial intelligence, and clarifying the mechanism of operation of the genetic algorithm under the Holonic Manufacturing System, to benefit from the advantages of systems and to achieve the maximum savings in time and cost of machines Using the Holistic Manufacturing System method and the Genetic algorithm, which allows for optimal maintenance time and minimizing the total cost, which in turn enables the workers of these machines to control the vacations in th

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Apr 20 2023
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A Novel Algorithm to Find the Best Solution for Pentagonal Fuzzy Numbers with Linear Programming Problems
...Show More Authors

    Fuzzy numbers are used in various fields such as fuzzy process methods, decision control theory, problems involving decision making, and systematic reasoning. Fuzzy systems, including fuzzy set theory. In this paper, pentagonal fuzzy variables (PFV) are used to formulate linear programming problems (LPP). Here, we will concentrate on an approach to addressing these issues that uses the simplex technique (SM). Linear programming problems (LPP) and linear programming problems (LPP) with pentagonal fuzzy numbers (PFN) are the two basic categories into which we divide these issues. The focus of this paper is to find the optimal solution (OS) for LPP with PFN on the objective function (OF) and right-hand side. New ranking f

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jan 08 2017
Journal Name
International Journal Of Information Technology And Computer Science
Adaptive Modeling of Urban Dynamics during Armada Event using CDRs
...Show More Authors

View Publication
Crossref
Publication Date
Sun Jan 10 2016
Journal Name
British Journal Of Applied Science & Technology
Illumination - Invariant Facial Components Extraction Using Adaptive Contrast Enhancement Methods
...Show More Authors

The process of accurate localization of the basic components of human faces (i.e., eyebrows, eyes, nose, mouth, etc.) from images is an important step in face processing techniques like face tracking, facial expression recognition or face recognition. However, it is a challenging task due to the variations in scale, orientation, pose, facial expressions, partial occlusions and lighting conditions. In the current paper, a scheme includes the method of three-hierarchal stages for facial components extraction is presented; it works regardless of illumination variance. Adaptive linear contrast enhancement methods like gamma correction and contrast stretching are used to simulate the variance in light condition among images. As testing material

... Show More
View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Fri Jan 01 2021
Journal Name
Indonesian Journal Of Electrical Engineering And Computer Science
Stamps extraction using local adaptive k- means and ISODATA algorithms
...Show More Authors

<span>One of the main difficulties facing the certified documents documentary archiving system is checking the stamps system, but, that stamps may be contains complex background and surrounded by unwanted data. Therefore, the main objective of this paper is to isolate background and to remove noise that may be surrounded stamp. Our proposed method comprises of four phases, firstly, we apply k-means algorithm for clustering stamp image into a number of clusters and merged them using ISODATA algorithm. Secondly, we compute mean and standard deviation for each remaining cluster to isolate background cluster from stamp cluster. Thirdly, a region growing algorithm is applied to segment the image and then choosing the connected regi

... Show More
View Publication
Scopus (12)
Crossref (4)
Scopus Crossref
Publication Date
Fri Sep 30 2022
Journal Name
Journal Of Economics And Administrative Sciences
Estimation of Reliability through the Wiener Degradation Process Based on the Genetic Algorithm to Estimating Parameters
...Show More Authors

      In this paper, the researcher suggested using the Genetic algorithm method to estimate the parameters of the Wiener degradation process,  where it is based on the Wiener process in order to estimate the reliability of high-efficiency products, due to the difficulty of estimating the reliability of them using traditional techniques that depend only on the failure times of products. Monte Carlo simulation has been applied for the purpose of proving the efficiency of the proposed method in estimating parameters; it was compared with the method of the maximum likelihood estimation. The results were that the Genetic algorithm method is the best based on the AMSE comparison criterion, then the reliab

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Journal Of Advanced Research In Dynamical And Control Systems
The impact of node density over routing protocols in manet by using NS-3
...Show More Authors

Scopus (4)
Scopus