Preferred Language
Articles
/
KxfUN48BVTCNdQwCgWNZ
An Evolutionary Algorithm for Task scheduling Problem in the Cloud-Fog environment
...Show More Authors
Abstract<p>The rapid and enormous growth of the Internet of Things, as well as its widespread adoption, has resulted in the production of massive quantities of data that must be processed and sent to the cloud, but the delay in processing the data and the time it takes to send it to the cloud has resulted in the emergence of fog, a new generation of cloud in which the fog serves as an extension of cloud services at the edge of the network, reducing latency and traffic. The distribution of computational resources to minimize makespan and running costs is one of the disadvantages of fog computing. This paper provides a new approach for improving the task scheduling problem in a Cloud-Fog environment in terms of execution time(makespan) and operating costs for Bag-of-Tasks applications. A task scheduling evolutionary algorithm has been proposed. A single custom representation of the problem and a uniform intersection are built for the proposed algorithm. Furthermore, the individual initialization and perturbation operators (crossover and mutation) were created to resolve the inapplicability of any solution found or reached by the proposed evolutionary algorithm. The proposed ETS (Evolutionary Task Scheduling algorithm) algorithm was evaluated on 11 datasets of varying size in a number of tasks. The ETS outperformed the Bee Life (BLA), Modified Particle Swarm (MPSO), and RR algorithms in terms of Makespan and operating costs, according to the results of the experiments.</p>
Scopus Crossref
View Publication
Publication Date
Wed Oct 02 2024
Journal Name
International Development Planning Review
DESIGNING AN AUXILIARY DEVICE AND ITS IMPACT ON LEARNING THE SKILLS OF ANGULAR SUPPORT AND OPEN SUPPORT FOR HANDSTAND PUSH-UPS ON THE PARALLEL APPARATUS IN ARTISTIC GYMNASTICS FOR BUDS
...Show More Authors

Publication Date
Wed Jan 01 2020
Journal Name
Aip Conference Proceedings
Developing a lightweight cryptographic algorithm based on DNA computing
...Show More Authors

This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

... Show More
Crossref (7)
Crossref
Publication Date
Wed Sep 15 2021
Journal Name
2021 International Conference On Computing And Communications Applications And Technologies (i3cat)
Parallel Hybrid String Matching Algorithm Using CUDA API Function
...Show More Authors

View Publication
Scopus Crossref
Publication Date
Wed Nov 20 2019
Journal Name
Proceedings Of The 2019 3rd International Conference On Big Data Research
Pressure Vessel Design Simulation Using Hybrid Harmony Search Algorithm
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Thu Feb 25 2016
Journal Name
Research Journal Of Applied Sciences, Engineering And Technology
Block Matching Algorithm Using Mean and Low Order Moments
...Show More Authors

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed May 06 2015
Journal Name
16th Conference In Natural Science And Mathematics
Efficient digital Image filtering method based on fuzzy algorithm
...Show More Authors

Recently, Image enhancement techniques can be represented as one of the most significant topics in the field of digital image processing. The basic problem in the enhancement method is how to remove noise or improve digital image details. In the current research a method for digital image de-noising and its detail sharpening/highlighted was proposed. The proposed approach uses fuzzy logic technique to process each pixel inside entire image, and then take the decision if it is noisy or need more processing for highlighting. This issue is performed by examining the degree of association with neighboring elements based on fuzzy algorithm. The proposed de-noising approach was evaluated by some standard images after corrupting them with impulse

... Show More
View Publication
Publication Date
Sat Mar 30 2024
Journal Name
Wasit Journal For Pure Sciences
Arabic and English Texts Encryption Using Modified Playfair Algorithm
...Show More Authors

To maintain the security and integrity of data, with the growth of the Internet and the increasing prevalence of transmission channels, it is necessary to strengthen security and develop several algorithms. The substitution scheme is the Playfair cipher. The traditional Playfair scheme uses a small 5*5 matrix containing only uppercase letters, making it vulnerable to hackers and cryptanalysis. In this study, a new encryption and decryption approach is proposed to enhance the resistance of the Playfair cipher. For this purpose, the development of symmetric cryptography based on shared secrets is desired. The proposed Playfair method uses a 5*5 keyword matrix for English and a 6*6 keyword matrix for Arabic to encrypt the alphabets of

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Feb 05 2019
Journal Name
Journal Of Al-qadisiyah For Computer Science And Mathematics
Anemia Blood Cell localization Using Modified K- Means Algorithm
...Show More Authors

View Publication
Publication Date
Thu Apr 25 2019
Journal Name
Engineering And Technology Journal
Improvement of Harris Algorithm Based on Gaussian Scale Space
...Show More Authors

Features is the description of the image contents which could be corner, blob or edge. Corners are one of the most important feature to describe image, therefore there are many algorithms to detect corners such as Harris, FAST, SUSAN, etc. Harris is a method for corner detection and it is an efficient and accurate feature detection method. Harris corner detection is rotation invariant but it isn’t scale invariant. This paper presents an efficient harris corner detector invariant to scale, this improvement done by using gaussian function with different scales. The experimental results illustrate that it is very useful to use Gaussian linear equation to deal with harris weakness.

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Thu Dec 01 2022
Journal Name
International Journal Of Electrical And Computer Engineering
SENTIMENT RETRIEVAL OF HEALTH RECORDS USING NLP-BASED ALGORITHM
...Show More Authors

Scopus (4)
Scopus