Preferred Language
Articles
/
YRf-Q48BVTCNdQwCwWh8
Fast Hybrid String Matching Algorithm based on the Quick-Skip and Tuned Boyer-Moore Algorithms
...Show More Authors

Crossref
View Publication
Publication Date
Sun Jan 01 2023
Journal Name
Aip Conference Proceedings
Fast lightweight encryption device based on LFSR technique for increasing the speed of LED performance
...Show More Authors

LED is an ultra-lightweight block cipher that is mainly used in devices with limited resources. Currently, the software and hardware structure of this cipher utilize a complex logic operation to generate a sequence of random numbers called round constant and this causes the algorithm to slow down and record low throughput. To improve the speed and throughput of the original algorithm, the Fast Lightweight Encryption Device (FLED) has been proposed in this paper. The key size of the currently existing LED algorithm is in 64-bit & 128-bit but this article focused mainly on the 64-bit key (block size=64-bit). In the proposed FLED design, complex operations have been replaced by LFSR left feedback technology to make the algorithm perform more e

... Show More
View Publication
Scopus (1)
Crossref (1)
Scopus Crossref
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
Optimum Median Filter Based on Crow Optimization Algorithm
...Show More Authors

          A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

... Show More
View Publication Preview PDF
Scopus (8)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Wed Jun 01 2016
Journal Name
Journal Of Economics And Administrative Sciences
Compared with Genetic Algorithm Fast – MCD – Nested Extension and Neural Network Multilayer Back propagation
...Show More Authors

The study using Nonparametric methods for roubust to estimate a location and scatter it is depending  minimum covariance determinant of multivariate regression model , due to the presence of outliear values and increase the sample size and presence of more than after the model regression multivariate therefore be difficult to find a median location .       

It has been the use of genetic algorithm Fast – MCD – Nested Extension and compared with neural Network Back Propagation of multilayer in terms of accuracy of the results and speed in finding median location ,while the best sample to be determined by relying on less distance (Mahalanobis distance)has the stu

... Show More
View Publication Preview PDF
Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Nurse Scheduling Problem Using Hybrid Simulated Annealing Algorithm
...Show More Authors

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Mar 31 2023
Journal Name
Wasit Journal Of Computer And Mathematics Science
Security In Wireless Sensor Networks Based On Lightweight Algorithms : An Effective Survey
...Show More Authors

At the level of both individuals and companies, Wireless Sensor Networks (WSNs) get a wide range of applications and uses. Sensors are used in a wide range of industries, including agriculture, transportation, health, and many more. Many technologies, such as wireless communication protocols, the Internet of Things, cloud computing, mobile computing, and other emerging technologies, are connected to the usage of sensors. In many circumstances, this contact necessitates the transmission of crucial data, necessitating the need to protect that data from potential threats. However, as the WSN components often have constrained computation and power capabilities, protecting the communication in WSNs comes at a significant performance pena

... Show More
View Publication
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 (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Thu Oct 01 2020
Journal Name
Engineering Science And Technology, An International Journal
Thermal performance improvement based on the hybrid design of a heat sink
...Show More Authors

View Publication
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Sun Oct 10 2021
Journal Name
Journal Of Physics
A novel kite cross hexagonal search algorithm for fast block motion estimation
...Show More Authors

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to resul

... Show More
Preview PDF
Scopus (2)
Scopus
Publication Date
Mon Jan 01 2024
Journal Name
Baghdad Science Journal
Proposed Hybrid Cryptosystems Based on Modifications of Playfair Cipher and RSA Cryptosystem
...Show More Authors

Cipher security is becoming an important step when transmitting important information through networks. The algorithms of cryptography play major roles in providing security and avoiding hacker attacks. In this work two hybrid cryptosystems have been proposed, that combine a modification of the symmetric cryptosystem Playfair cipher called the modified Playfair cipher and two modifications of the asymmetric cryptosystem RSA called the square of RSA technique and the square RSA with Chinese remainder theorem technique. The proposed hybrid cryptosystems have two layers of encryption and decryption. In the first layer the plaintext is encrypted using modified Playfair to get the cipher text, this cipher text will be encrypted using squared

... Show More
View Publication Preview PDF
Scopus (3)
Scopus Crossref
Publication Date
Mon Jul 05 2010
Journal Name
Evolutionary Algorithms
Variants of Hybrid Genetic Algorithms for Optimizing Likelihood ARMA Model Function and Many of Problems
...Show More Authors

Optimization is essentially the art, science and mathematics of choosing the best among a given set of finite or infinite alternatives. Though currently optimization is an interdisciplinary subject cutting through the boundaries of mathematics, economics, engineering, natural sciences, and many other fields of human Endeavour it had its root in antiquity. In modern day language the problem mathematically is as follows - Among all closed curves of a given length find the one that closes maximum area. This is called the Isoperimetric problem. This problem is now mentioned in a regular fashion in any course in the Calculus of Variations. However, most problems of antiquity came from geometry and since there were no general methods to solve suc

... Show More
Preview PDF