Preferred Language
Articles
/
joe-1998
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 algorithms are proposed in this work with a discussion on the difference between them. These algorithms find the shortest route through finding the optimal rate between two nodes in the wireless networks but with bounded end-to-end delay. The Dijkstra-based algorithm is especially favorable in terms of processing time. We also present a comparison between our proposed single-constraint Dijkstra-based routing algorithm and the mesh routing algorithm (MRA) existing in the literature to clarify the merits of the former.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Mar 01 2010
Journal Name
Journal Of Economics And Administrative Sciences
Planning the main production tables using the correct binary programming method
...Show More Authors

This research include building mathematical models for aggregating planning and shorting planning by using integer programming technique for planning master production scheduling in order to control on the operating production for manufacturing companies to achieve their objectives of increasing the efficiency of utilizing resources and reduce storage and  improving customers service  through  deliver in the actual dates and reducing delays.

View Publication Preview PDF
Crossref
Publication Date
Sun Oct 01 2017
Journal Name
Journal Of Computational And Theoretical Nanoscience
Parametric Nonlinear Programming Approach with Fuzzy Queues Using Hexagonal Membership Functions
...Show More Authors

View Publication
Scopus (6)
Crossref (7)
Scopus Crossref
Publication Date
Fri Sep 30 2016
Journal Name
Australian Journal Of Basic And Applied Sciences
Programming Exam Questions Classification Based On Bloom’s Taxonomy Using Grammatical Rule
...Show More Authors

Preview PDF
Publication Date
Mon May 20 2019
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
An Improved Image Compression Technique Using EZW and SPHIT Algorithms
...Show More Authors

 Uncompressed form of the digital images are needed a very large storage capacity amount, as a consequence requires large communication bandwidth for data transmission over the network. Image compression techniques not only minimize the image storage space but also preserve the quality of image. This paper reveal image compression technique which uses distinct image coding scheme based on wavelet transform that combined effective types of compression algorithms for further compression. EZW and SPIHT algorithms are types of significant compression techniques that obtainable for lossy image compression algorithms. The EZW coding is a worthwhile and simple efficient algorithm. SPIHT is an most powerful technique that utilize for image

... Show More
View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Combining Several Substitution Cipher Algorithms using Circular Queue Data Structure
...Show More Authors

With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security.  This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for

... Show More
View Publication Preview PDF
Scopus (12)
Crossref (6)
Scopus Clarivate 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 (13)
Crossref (4)
Scopus Crossref
Publication Date
Sun Mar 02 2014
Journal Name
Baghdad Science Journal
On Solving Hyperbolic Trajectory Using New Predictor-Corrector Quadrature Algorithms
...Show More Authors

In this Paper, we proposed two new predictor corrector methods for solving Kepler's equation in hyperbolic case using quadrature formula which plays an important and significant rule in the evaluation of the integrals. The two procedures are developed that, in two or three iterations, solve the hyperbolic orbit equation in a very efficient manner, and to an accuracy that proves to be always better than 10-15. The solution is examined with and with grid size , using the first guesses hyperbolic eccentric anomaly is and , where is the eccentricity and is the hyperbolic mean anomaly.

View Publication Preview PDF
Crossref
Publication Date
Sun Dec 06 2009
Journal Name
Baghdad Science Journal
Automatic Block Selection for Synthesizing Texture Images using Genetic Algorithms
...Show More Authors

Texture synthesis using genetic algorithms is one way; proposed in the previous research, to synthesis texture in a fast and easy way. In genetic texture synthesis algorithms ,the chromosome consist of random blocks selected manually by the user .However ,this method of selection is highly dependent on the experience of user .Hence, wrong selection of blocks will greatly affect the synthesized texture result. In this paper a new method is suggested for selecting the blocks automatically without the participation of user .The results show that this method of selection eliminates some blending caused from the previous manual method of selection.

View Publication Preview PDF
Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Plant Archives
A comparative anatomical study of three types of gymnospermplantscycasrevoluta,thujaoreintalisand cupressussemperviens
...Show More Authors

Scopus
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
The Influence of NMI against Modularity in Community Detection Problem: A Case Study for Unsigned and Signed Networks
...Show More Authors

Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Although many optimization algo

... Show More
Scopus (1)
Crossref (1)
Scopus Crossref