Preferred Language
Articles
/
ijs-7721
Multi-Objective Genetic Algorithm-Based Technique for Achieving Low-Power VLSI Circuit Partition
...Show More Authors

     Minimizing the power consumption of electronic systems is one of the most critical concerns in the design of integrated circuits for very large-scale integration (VLSI). Despite the reality that VLSI design is known for its compact size, low power, low price, excellent dependability, and high functionality, the design stage remains difficult to improve in terms of time and power. Several optimization algorithms have been designed to tackle the present issues in VLSI design. This study discusses a bi-objective optimization technique for circuit partitioning based on a genetic algorithm. The motivation for the proposed research is derived from the basic concept that, if some portions of a circuit's system are deactivated during the processor's idle time, the circuit's power consumption is automatically reduced. To reduce the overall system's power consumption, maximization of sleep time and minimization of net cuts are required. To achieve these, an effective fitness function has been constructed in such a way that the balance criteria are also maintained. The approach has been tested on a set of net lists from the ISPD'98 benchmark suite, each containing 10 to 30 nodes. The experimental results are compared with two existing methods that clearly indicate the acceptability of the suggested method. The suggested strategy achieves an average reduction of 24.69% and 31.46% for net cut, whereas average extensions of 15.20% and 12.31% are observed in sleep time when compared with two existing methods. The proposed method also achieves an average power efficiency of 14.98% and 12.09% with respect to these two state-of-the-art methods.

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Tue Jan 18 2022
Journal Name
Iraqi Journal Of Science
Modified Bees Swarm Optimization Algorithm for Association Rules Mining
...Show More Authors

Mining association rules is a popular and well-studied method of data mining tasks whose primary aim is the discovers of the correlation among sets of items in the transactional databases. However, generating high- quality association rules in a reasonable time from a given database has been considered as an important and challenging problem, especially with the fast increasing in database's size. Many algorithms for association rules mining have been already proposed with promosing results. In this paper, a new association rules mining algorithm based on Bees Swarm Optimization metaheuristic named Modified Bees Swarm Optimization for Association Rules Mining (MBSO-ARM) algorithm is proposed. Results show that the proposed algorithm can

... Show More
View Publication Preview PDF
Publication Date
Sun Feb 27 2022
Journal Name
Iraqi Journal Of Science
An Improved Meerkat Clan Algorithm for Solving 0-1 Knapsack Problem
...Show More Authors

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Crossref
Publication Date
Wed Feb 08 2023
Journal Name
Iraqi Journal Of Science
Modified Light Stemming Algorithm for Arabic Language
...Show More Authors

Stemming is a pre-processing step in Text mining applications as well as it is very important in most of the Information Retrieval systems. The goal of stemming is to reduce different grammatical forms of a word and sometimes derivationally related forms of a word to a common base (root or stem) form like reducing noun, adjective, verb, adverb etc. to its base form. The stem needs not to be identical to the morphological root of the word; it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. As in other languages; there is a need for an effective stemming algorithm for the indexing and retrieval of Arabic documents while the Arabic stemming algorithms are not widely available.

... Show More
View Publication Preview PDF
Publication Date
Wed Nov 24 2021
Journal Name
Iraqi Journal Of Science
A proposal of Multimedia Steganography Algorithm based on Improved Least Significant Bit (LSB) Method
...Show More Authors

Because of the rapid development and use of the Internet as a communication media emerged to need a high level of security during data transmission and one of these ways is "Steganography". This paper reviews the Least Signification Bit steganography used for embedding text file with related image in gray-scale image. As well as we discuss the bit plane which is divided into eight different images when combination them we get the actual image. The findings of the research was the stego-image is indistinguishable to the naked eye from the original cover image when the value of bit less than four Thus we get to the goal is to cover up the existence of a connection or hidden data. The Peak to Signal Noise Ratio(PSNR) and Mean Square Error (

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Nov 30 2023
Journal Name
Iraqi Journal Of Science
A Lightweight Image Encryption Algorithm Based on Elliptic Curves and a 5D Logistic Map
...Show More Authors

    Cryptography can be thought of as a toolbox, where potential attackers gain access to various computing resources and technologies to try to compute key values. In modern cryptography, the strength of the encryption algorithm is only determined by the size of the key. Therefore, our goal is to create a strong key value that has a minimum bit length that will be useful in light encryption. Using elliptic curve cryptography (ECC) with Rubik's cube and image density, the image colors are combined and distorted, and by using the Chaotic Logistics Map and Image Density with a secret key, the Rubik's cubes for the image are encrypted, obtaining a secure image against attacks. ECC itself is a powerful algorithm that generates a pair of p

... Show More
View Publication
Scopus (3)
Crossref (2)
Scopus Crossref
Publication Date
Mon Feb 20 2017
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A Hybrid Algorithm to Protect Computer Networks Based on Human Biometrics and Computer Attributes
...Show More Authors

Objective of this work is the mixing between human biometric characteristics and unique attributes of the computer in order to protect computer networks and resources environments through the development of authentication and authorization techniques. In human biometric side has been studying the best methods and algorithms used, and the conclusion is that the fingerprint is the best, but it has some flaws. Fingerprint algorithm has been improved so that their performance can be adapted to enhance the clarity of the edge of the gully structures of pictures fingerprint, taking into account the evaluation of the direction of the nearby edges and repeat. In the side of the computer features, computer and its components like human have uniqu

... Show More
View Publication Preview PDF
Publication Date
Thu Jun 01 2023
Journal Name
Iaes International Journal Of Artificial Intelligence (ij-ai)
Innovations in t-way test creation based on a hybrid hill climbing-greedy algorithm
...Show More Authors

<p>In combinatorial testing development, the fabrication of covering arrays is the key challenge by the multiple aspects that influence it. A wide range of combinatorial problems can be solved using metaheuristic and greedy techniques. Combining the greedy technique utilizing a metaheuristic search technique like hill climbing (HC), can produce feasible results for combinatorial tests. Methods based on metaheuristics are used to deal with tuples that may be left after redundancy using greedy strategies; then the result utilization is assured to be near-optimal using a metaheuristic algorithm. As a result, the use of both greedy and HC algorithms in a single test generation system is a good candidate if constructed correctly. T

... Show More
View Publication
Scopus (3)
Crossref (3)
Scopus Crossref
Publication Date
Sun Mar 04 2018
Journal Name
Iraqi Journal Of Science
Efficient Method to Segment Objects from Images Based on Enhanced Connected Component Labeling algorithm
...Show More Authors

This paper include the problem of segmenting an image into regions represent (objects), segment this object by define boundary between two regions using a connected component labeling. Then develop an efficient segmentation algorithm based on this method, to apply the algorithm to image segmentation using different kinds of images, this algorithm consist four steps at the first step convert the image gray level the are applied on the image, these images then in the second step convert to binary image, edge detection using Canny edge detection in third Are applie the final step is images. Best segmentation rates are (90%) obtained when using the developed algorithm compared with (77%) which are obtained using (ccl) before enhancement.

View Publication Preview PDF
Publication Date
Mon Dec 01 2014
Journal Name
Advances In Engineering Software
System identification and control of robot manipulator based on fuzzy adaptive differential evolution algorithm
...Show More Authors

View Publication
Scopus (46)
Crossref (38)
Scopus Clarivate Crossref
Publication Date
Wed Nov 16 2016
Journal Name
Eurasip Journal On Wireless Communications And Networking
Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm
...Show More Authors

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-ho

... Show More
View Publication Preview PDF
Scopus (26)
Crossref (18)
Scopus Clarivate Crossref