Preferred Language
Articles
/
ijs-5425
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’s waiting time to be executed. As a result, this research proves that the proposed technique achieves an optimization efficiency with a percentage average 45.5 % according to the FCFS algorithm and 54.5% according to SJF method.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Mon Dec 21 2020
Journal Name
2020 Emerging Technology In Computing, Communication And Electronics (etcce)
An Integrated Grey Wolf Optimizer with Nelder-Mead Method for Workflow Scheduling Problem
...Show More Authors

View Publication
Scopus (1)
Scopus Crossref
Publication Date
Wed Jun 01 2016
Journal Name
Nternational Journal Of Mathematics Trends And Technology (ijmtt)
Fuzzy Scheduling Problem on Two Machines
...Show More Authors

Publication Date
Sun Jun 30 2024
Journal Name
Iraqi Journal Of Science
Gray-Scale Image Compression Method Based on a Pixel-Based Adaptive Technique
...Show More Authors

     Today in the digital realm, where images constitute the massive resource of the social media base but unfortunately suffer from two issues of size and transmission, compression is the ideal solution. Pixel base techniques are one of the modern spatially optimized modeling techniques of deterministic and probabilistic bases that imply mean, index, and residual. This paper introduces adaptive pixel-based coding techniques for the probabilistic part of a lossy scheme by incorporating the MMSA of the C321 base along with the utilization of the deterministic part losslessly. The tested results achieved higher size reduction performance compared to the traditional pixel-based techniques and the standard JPEG by about 40% and 50%,

... Show More
View Publication
Scopus Crossref
Publication Date
Sat Jun 03 2023
Journal Name
Iraqi Journal Of Science
Fast encoding algorithm based on Weber's law and Triangular Inequality Theorem
...Show More Authors

In the present work, an image compression method have been modified by combining The Absolute Moment Block Truncation Coding algorithm (AMBTC) with a VQ-based image coding. At the beginning, the AMBTC algorithm based on Weber's law condition have been used to distinguish low and high detail blocks in the original image. The coder will transmit only mean of low detailed block (i.e. uniform blocks like background) on the channel instate of transmit the two reconstruction mean values and bit map for this block. While the high detail block is coded by the proposed fast encoding algorithm for vector quantized method based on the Triangular Inequality Theorem (TIE), then the coder will transmit the two reconstruction mean values (i.e. H&L)

... Show More
View Publication Preview PDF
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (4)
Crossref
Publication Date
Sat Apr 01 2023
Journal Name
International Journal Of Electrical And Computer Engineering (ijece)
Image encryption algorithm based on the density and 6D logistic map
...Show More Authors

One of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera

... Show More
View Publication
Scopus (16)
Crossref (8)
Scopus Crossref
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 (4)
Crossref (2)
Scopus Crossref
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (40)
Crossref (39)
Scopus Clarivate Crossref
Publication Date
Thu Jul 01 2021
Journal Name
Iraqi Journal Of Science
Improvement of Chacha20 Algorithm based on Tent and Chebyshev Chaotic Maps
...Show More Authors

Chacha 20 is a stream cypher that is used as lightweight on many CPUs that ‎do not have dedicated AES instructions. As stated by Google, that is the reason why they use it on many ‎devices, such as mobile devices, for authentication in TLS protocol. This paper ‎proposes an improvement of chaha20 stream cypher algorithm based on tent and ‎Chebyshev functions (IChacha20). The main objectives of the proposed IChacha20 ‎algorithm are increasing security layer, designing a robust structure of the IChacha20 ‎to be enabled to resist various types of attacks, implementing the proposed ‎algorithm for encryption of colour images, and transiting it in a secure manner. The ‎ test results proved that the MSE, PSNR, UQI and NCC metrics

... Show More
View Publication Preview PDF
Scopus (5)
Crossref (1)
Scopus Crossref
Publication Date
Fri Jul 19 2019
Journal Name
Iraqi Journal Of Science
Real Time Multi Face Blurring on Uncontrolled Environment based on Color Space algorithm
...Show More Authors

Faces blurring is one of the important complex processes that is considered one of the advanced computer vision fields. The face blurring processes generally have two main steps to be done. The first step has detected the faces that appear in the frames while the second step is tracking the detected faces which based on the information extracted during the detection step. In the proposed method, an image is captured by the camera in real time, then the Viola Jones algorithm used for the purpose of detecting multiple faces in the captured image and for the purpose of reducing the time consumed to handle the entire captured image, the image background is removed and only the motion areas are processe

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (1)
Scopus Crossref