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
Tue May 16 2023
Journal Name
Journal Of Engineering
Parallel Routing in Wireless Sensor Network
...Show More Authors

The limitations of wireless sensor nodes are power, computational capabilities, and memory. This paper suggests a method to reduce the power consumption by a sensor node. This work is based on the analogy of the routing problem to distribute an electrical field in a physical media with a given density of charges. From this analogy a set of partial differential equations (Poisson's equation) is obtained. A finite difference method is utilized to solve this set numerically. Then a parallel implementation is presented. The parallel implementation is based on domain decomposition, where the original calculation domain is decomposed into several blocks, each of which given to a processing element. All nodes then execute computations in parall

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Feb 28 2021
Journal Name
Journal Of Economics And Administrative Sciences
The use of the genetic algorithm to estimate the parameters function of the hypoexponential distribution by simulation
...Show More Authors

In this research, the focus was placed on estimating the parameters of the Hypoexponential distribution function using the maximum likelihood method and genetic algorithm. More than one standard, including MSE, has been adopted for comparison by Using the simulation method

View Publication Preview PDF
Crossref
Publication Date
Sun May 01 2016
Journal Name
International Journal Of Computer Applications
Lossless Image Compression using Adaptive Predictive Coding of Selected Seed Values
...Show More Authors

Publication Date
Wed Feb 29 2012
Journal Name
Al-khwarizmi Engineering Journal
Color Image Denoising Using Stationary Wavelet Transform and Adaptive Wiener Filter
...Show More Authors

The denoising of a natural image corrupted by Gaussian noise is a problem in signal or image processing.  Much work has been done in the field of wavelet thresholding but most of it was focused on statistical modeling of wavelet coefficients and the optimal choice of thresholds.  This paper describes a new method for the suppression of noise in image by fusing the stationary wavelet denoising technique with adaptive wiener filter. The wiener filter is applied to the reconstructed image for the approximation coefficients only, while the thresholding technique is applied to the details coefficients of the transform, then get the final denoised image is obtained by combining the two results. The proposed method was applied by usin

... Show More
View Publication Preview PDF
Publication Date
Thu Dec 29 2016
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Technique For Image De-blurring Using Adaptive Wavelet Lagrange Fuzzy Filter
...Show More Authors

A new de-blurring technique was proposed in order to reduced or remove the blur in the images. The proposed filter was designed from the Lagrange interpolation calculation with adjusted by fuzzy rules and supported by wavelet decomposing technique. The proposed Wavelet Lagrange Fuzzy filter gives good results for fully and partially blurring region in images.
 

View Publication Preview PDF
Publication Date
Thu Mar 01 2007
Journal Name
Al-khwarizmi Engineering Journal
Image restoration using regularized inverse filtering and adaptive threshold wavelet denoising
...Show More Authors

Although the Wiener filtering is the optimal tradeoff of inverse filtering and noise smoothing, in the case when the blurring filter is singular, the Wiener filtering actually amplify the noise. This suggests that a denoising step is needed to remove the amplified noise .Wavelet-based denoising scheme provides a natural technique for this purpose .

                In this paper  a new image restoration scheme is proposed, the scheme contains two separate steps : Fourier-domain inverse filtering  and wavelet-domain image denoising. The first stage is Wiener filtering of the input image , the filtered image is inputted to adaptive threshold wavelet

... Show More
View Publication Preview PDF
Publication Date
Wed Apr 01 2015
Journal Name
2015 Annual Ieee Systems Conference (syscon) Proceedings
Automatic generation of fuzzy classification rules using granulation-based adaptive clustering
...Show More Authors

View Publication
Scopus (4)
Crossref (4)
Scopus Crossref
Publication Date
Fri Jan 26 2024
Journal Name
Iraqi Journal Of Science
Harmony-Scatter Search to Solve Travelling Salesman Problem
...Show More Authors

This paper presents a hybrid metaheuristic algorithm which is Harmony-Scatter Search (HSS). The HSS provides Scatter Search (SS) with random exploration for search space of problem and more of diversity and intensification for promising solutions. The SS and HSS have been tested on Traveling Salesman Problem. A computational experiment with benchmark instances is reported. The results demonstrate that the HSS algorithm produce better performance than original Scatter Search algorithm. The HSS in the value of average fitness is 27.6% comparing with original SS. In other hand the elapsed time of HSS is larger than the original SS by small value. The developed algorithm has been compared with other algorithms for the same problem, and the r

... Show More
View Publication Preview PDF
Publication Date
Sat Dec 30 2023
Journal Name
Iraqi Journal Of Science
Using Semi-Analytic Technique for Solving Lane Emden Equations
...Show More Authors

This paper propose the semi - analytic technique using two point osculatory interpolation to construct polynomial solution for solving some well-known classes of Lane-Emden type equations which are linear ordinary differential equations, and disusse the behavior of the solution in the neighborhood of the singular points along with its numerical approximation. Many examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.

View Publication Preview PDF
Publication Date
Sun Apr 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solving a three dimensional transportation problem using linear programming
...Show More Authors

Transport is a problem and one of the most important mathematical methods that help in making the right decision for the transfer of goods from sources of supply to demand centers and the lowest possible costs, In this research, the mathematical model of the three-dimensional transport problem in which the transport of goods is not homogeneous was constructed. The simplex programming method was used to solve the problem of transporting the three food products (rice, oil, paste) from warehouses to the student areas in Baghdad, This model proved its efficiency in reducing the total transport costs of the three products. After the model was solved in (Winqsb) program, the results showed that the total cost of transportation is (269,

... Show More
View Publication Preview PDF
Crossref