Professional Details
-
Fullname Haval Tariq Sadeeq
-
E-mail [email protected]
-
Phone 07504507840
-
Gender male
-
Birth Date 1985-04-11
-
Address Iraq - Duhok
-
Nationality Iraqi
SOCIAL LINKS
Contact Me
Education
Lecturer
Computer Sciences
University of Zakho
Publication Journal
Improved Northern Goshawk Optimization Algorithm for Global Optimization
2022 4th International Conference on Advanced Science and Engineering (ICOASE)
Global optimization has been used in many real-world problems. Nature-inspired meta-heuristic algorithms, such as the Northern Goshawk Optimization NGO algorithm that has just been proposed, are often used to solve these kinds of optimization problems. An NGO provides satisfactory results. In this algorithm, the proposed exploration model may not provide sufficient coverage of the problem space, trapping the system in a local optimal solution. To improve the performance of NGO, a novel and efficient improved northern goshawk optimization technique named INGO is proposed in this paper. In INGO, a new concept of switching between exploration and exploitation has been developed to improve overall algorithm performance to avoid being stuck in local optima. Also, to increase search capabilities, Levy Flight is used. Twenty-three known benchmark functions were used to test the performance of the proposed INGO. The results were compared to those of an NGO and some well-known robust algorithms. Experimental data indicates that the INGO suggested in this study consistently outperforms the traditional NGO and alternative methods in a significant number of test functions.
Giant Trevally Optimizer (GTO): A Novel Metaheuristic Algorithm for Global Optimization and Challenging Engineering Problems
IEEE Access (Volume: 10)
Metaheuristic algorithms are becoming powerful methods for solving continuous global optimization and engineering problems due to their flexible implementation on the given problem. Most of these algorithms draw their inspiration from the collective intelligence and hunting behavior of animals in nature. This paper proposes a novel metaheuristic algorithm called the Giant Trevally Optimizer (GTO). In nature, giant trevally feeds on many animals, including fish, cephalopods, and seabirds (sooty terns). In this work, the unique strategies of giant trevally when hunting seabirds are mathematically modeled and are divided into three main steps. In the first step, the foraging movement patterns of giant trevallies are simulated. In the second step, the giant trevallies choose the appropriate area in terms of food where they can hunt for prey. In the last step, the trevally starts to chase the seabird (prey). When the prey is close enough to the trevally, the trevally jumps out of the water and attacks the prey in the air or even snatches the prey from the water surface. The performance of GTO is compared against state-of-the-art metaheuristics for global optimization on a set of forty benchmark functions with different characteristics and five complex engineering problems. The comparative study, scalability analysis, statistical analysis based on the Wilcoxon rank sum test, and the findings suggest that the proposed GTO is an efficient optimizer for global optimization.
Modified Vigenère cipher algorithm based on new key generation method
Indonesian Journal of Electrical Engineering and Computer Science (Issue: 28) (Volume: 2)
Nowadays, as communication and network technologies evolve in modern life, ensuring the confidentiality of a cryptography system has become a critical requirement. The Vigenère cipher is attracting the attention of cryptography specialists, although the Vigenère cipher algorithm has a problem. The problem is due to a repeating encryption key. As a result of the multiple cryptographic approaches described in the literature, this paper proposes a novel encryption strategy for safe and secure data exchange by utilizing a new key generation process. The proposed encryption approach avoids the issue of repeating keys. Additionally, the classic Vigenère cipher encrypts the plaintext using a 26x26 Vigenère table, the researcher modified the original Vigenère table to 95x95, which adds more potential letters, mathematical symbols, numerals, and punctuation to a standard QWERTY keyboard layout. Additionally, the researcher added case sensitivity. To observe the performance of the proposed method, the index of coincidence and entropy have been calculated. The obtained results confirm the high performance of the proposed algorithm in comparison to the other algorithms used in this paper. The primary goal of this paper is to make cryptanalysis extremely complex and to promote data security.
New symmetric key cipher capable of digraph to single letter conversion utilizing binary system
Indonesian Journal of Electrical Engineering and Computer Science
In this paper, a new Playfair cipher built on bits level symmetric key cryptographic was proposed for the purpose of converting pairs of letters (digraphs) into single letters. The proposed algorithm is capable to overcome many of the shortcoming and vulnerabilities that exist in the current classical version of Playfair algorithm. The Playfair cipher is exceedingly complex than a classical substitution cipher, but still simple to hack using automated tactics. It is famous as a digraph cipher because two letters are exchanged by other two letters. This destroys any solo letter occurrence statistics, but the digraph statistics still unaffected (frequencies of two letters). Unluckily letter pairs have a flatter distribution than the one letter frequencies, so this intricacy matters for solving the code using pen and paper procedures. The suggested encryption process is conducted as follows; letters are first arranged in a spiral manner in Polybius square, afterwards, each pair will be replaced utilizing before-after technique if we are arranging pairs horizontally and down-up technique (vertically). The former process produces pairs of Plaintext that will be converted to binary bit stream then will be divided over blocks with stable sizes. Bits of these blocks are taken from pairs then fit them into square matrix of suitable order to put the concept of row-wise and revers row-wise matrix. Bits of this matrix are split into 2x2 square matrixes. The sub-matrixes are formed 8 bits. Here the XNOR operation is taken into consideration for bitwise operation to generate the keys for decryption and produce the cipher-text.
Hardware Implementation of Firefly Optimization Algorithm Using FPGAs
International Conference on Advanced Science and Engineering (ICOASE) 2018
Mimicking natural phenomenon of social insects, such as bird flocks and insect colonies by merging randomness facility and some other simulation rules, are the core tasks of the artificial meta-heuristic algorithms. Such algorithms are the most efficient and powerful techniques used to solve various complicated real-world optimization problems. Firefly algorithm, which belongs to nature meta-heuristics algorithms, is inspired by mating and flashing behavior or the phenomenon of bioluminescent communication of fireflies in the nature. In this paper, a hardware structure design for firefly algorithm has been proposed. Firefly algorithm is executing sequentially as all meta-heuristic algorithms, due to the nature of the algorithm. Therefore, sequential hardware structure design for the algorithm using Finite State Machine (FSM) system has been proposed. The hardware design structure implementation is mapped into a …
A Novel Hybrid Bird Mating Optimizer with Differential Evolution for Engineering Design Optimization Problems
International Conference of Reliable Information and Communication Technology
This paper presents the hybridization of the Bird Mating Optimizer (BMO) with the Differential Evolution (DE) approach. BMO is a new meta-heuristic algorithm that still suffers from some drawbacks, namely the convergence speed, the poor solution quality and trapping into local optima. To overcome these insufficient, a novel BMO-DE algorithm is proposed. BMO-DE has been implemented on some standard engineering design optimization problems reported in the specialized literature and are considered to be constrained optimization ones. The original BMO was basically proposed to solve unconstrained optimization problems. Accordingly, a penalty function method has been adopted to handle the different constraints. Experimental results show that the proposed method can put forward better solutions when compared to other state-of-the-art meta-heuristic algorithms that address such a kind of
A Modified Flower Pollination Algorithm for Engineering Design Optimization Problems
Polytechnic Journal (Issue: 1) (Volume: 7)
Conventional classical optimization methods failed or were unable to resolve the tough optimization problems, on the other hand nature inspired meta-heuristic algorithms such as firefly algorithm, particle swarm algorithm and bat algorithm are powerful methods for solving various optimization problems. Recently developed flower pollination algorithm, is a promising algorithm to solve various optimization problems. This algorithm belongs to nature inspired meta-heuristic algorithms and inspired by the pollination process of the flower. In flowers, by some mechanisms the pollen is carried to stigma in order to ensure generating new generations of the species. It’s worth mentioning that in this paper a modified version of flower pollination algorithm has been used to solve three standard engineering design problems reported in the specialized literature and it is compared with the well-known algorithms that are used to solve these kind of optimization problems. The results indicate that this scheme (algorithm) is a promising technique to solve those kind of optimization problems in terms of both solution quality and run-time efficiency as it obtains excellent solution quality results with a low number of iterations or low number (of objective functions evaluations) and a good run-time efficiency with faster execution time.
Training Course
Online Platform for Academic Teaching and Learning in Iraq and Iran (OPATEL)
Tehran, International
OPATEL is a three years project started on October 15, 2016, and funded by the European Union through Erasmus+ programme that concentrates on providing Iraqis and Iranian students and teachers with competencies and skills needed by using Learning Management Systems in Education.