The biometric-based keys generation represents the utilization of the extracted features from the human anatomical (physiological) traits like a fingerprint, retina, etc. or behavioral traits like a signature. The retina biometric has inherent robustness, therefore, it is capable of generating random keys with a higher security level compared to the other biometric traits. In this paper, an effective system to generate secure, robust and unique random keys based on retina features has been proposed for cryptographic applications. The retina features are extracted by using the algorithm of glowworm swarm optimization (GSO) that provides promising results through the experiments using the standard retina databases. Additionally, in order to provide high-quality random, unpredictable, and non-regenerated keys, the chaotic map has been used in the proposed system. In the experiments, the NIST statistical analysis which includes ten statistical tests has been employed to check the randomness of the generated binary bits key. The obtained random cryptographic keys are successful in the tests of NIST, in addition to a considerable degree of aperiodicity.
Peak ground acceleration (PGA) is one of the critical factors that affect the determination of earthquake intensity. PGA is generally utilized to describe ground motion in a particular zone and is able to efficiently predict the parameters of site ground motion for the design of engineering structures. Therefore, novel models are developed to forecast PGA in the case of the Iraqi database, which utilizes the particle swarm optimization (PSO) approach. A data set of 187 historical ground-motion recordings in Iraq’s tectonic regions was used to build the explicit proposed models. The proposed PGA models relate to different seismic parameters, including the magnitude of the earthquake (Mw), average shear-wave velocity (VS30), focal depth (FD
... Show MoreMetaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory char
... Show MoreThis 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 MoreFinding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO)
... Show MoreThis paper discusses an optimal path planning algorithm based on an Adaptive Multi-Objective Particle Swarm Optimization Algorithm (AMOPSO) for two case studies. First case, single robot wants to reach a goal in the static environment that contain two obstacles and two danger source. The second one, is improving the ability for five robots to reach the shortest way. The proposed algorithm solves the optimization problems for the first case by finding the minimum distance from initial to goal position and also ensuring that the generated path has a maximum distance from the danger zones. And for the second case, finding the shortest path for every robot and without any collision between them with the shortest time. In ord
... Show MoreThe world's renewable energy sources have taken on great importance, for its cleanness and its environmental effects as well as being a renewable source, Increased demand for fossil energy sources is also causing global warming and climate change. Iraq is an appropriate area for renewable energy This study shows that renewable alternative energy has not been used sufficiently enough at present. But this energy can play an important role in the future of renewable energy in Iraq. This research aims to study the renewable energy in Iraq (solar energy) and it is appropriate to develop this alternative energy for crude oil, which is characterized by the use of the most appropriate and less economical and more environmentally friendly. Solar
... Show MoreIdentification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed
... Show MoreThe economy is exceptionally reliant on agricultural productivity. Therefore, in domain of agriculture, plant infection discovery is a vital job because it gives promising advance towards the development of agricultural production. In this work, a framework for potato diseases classification based on feed foreword neural network is proposed. The objective of this work is presenting a system that can detect and classify four kinds of potato tubers diseases; black dot, common scab, potato virus Y and early blight based on their images. The presented PDCNN framework comprises three levels: the pre-processing is first level, which is based on K-means clustering algorithm to detect the infected area from potato image. The s
... Show MoreThis research deals with the relationship between television advertising and buying random cosmetics, where we find that TV ads influence on the purchasing behavior of women, has conducted research in the field on a sample of women in the University of Baghdad, was a random sample taken from 150 different women in the age and social levels educational and cultural students and employees and teachers in order to sample representative be for the research community, and designed a questionnaire for this purpose form as a tool to collect data and information search and analyzed they answered the sample surveyed using a statistical program (spss) to extract percentages And correlation coefficients and testing square Kay , The study found Of w
... Show More