Cryptography algorithms play a critical role in information technology against various attacks witnessed in the digital era. Many studies and algorithms are done to achieve security issues for information systems. The high complexity of computational operations characterizes the traditional cryptography algorithms. On the other hand, lightweight algorithms are the way to solve most of the security issues that encounter applying traditional cryptography in constrained devices. However, a symmetric cipher is widely applied for ensuring the security of data communication in constraint devices. In this study, we proposed a hybrid algorithm based on two cryptography algorithms PRESENT and Salsa20. Also, a 2D logistic map of a chaotic system is applied to generate pseudo-random keys that produce more complexity for the proposed cipher algorithm. The goal of the proposed algorithm is to present a hybrid algorithm by enhancing the complexity of the current PRESENT algorithm while keeping the performance of computational operations as minimal. The proposed algorithm proved working efficiently with fast executed time, and the analyzed result of the generated sequence keys passed the randomness of the NIST suite.
Fatigue cracking is the most common distress in road pavement. It is mainly due to the increase in the number of load repetition of vehicles, particularly those with high axle loads, and to the environmental conditions. In this study, four-point bending beam fatigue testing has been used for control and modified mixture under various micro strain levels of (250 μƐ, 400 μƐ, and 750 μƐ) and 5HZ. The main objective of the study is to provide a comparative evaluation of pavement resistance to the phenomenon of fatigue cracking between modified asphalt concrete and conventional asphalt concrete mixes (under the influence of three percentage of Silica fumes 1%, 2%, 3% by the weight of asphalt content), and (chan
... Show MoreAbsence or hypoplasia of the internal carotid artery (ICA) is a rare congenital anomaly that is mostly unilateral and highly associated with other intracranial vascular anomalies, of which saccular aneurysm is the most common. Blood flow to the circulation of the affected side is maintained by collateral pathways, some of which include the anterior communicating artery (Acom) as part of their anatomy. Therefore, temporary clipping during microsurgery on Acom aneurysms in patients with unilateral ICA anomalies could jeopardize these collaterals and place the patient at risk of ischemic damage. In this paper, we review the literature on cases with a unilaterally absent ICA associa
In this paper a system is designed and implemented using a Field Programmable Gate Array (FPGA) to move objects from a pick up location to a delivery location. This transportation of objects is done via a vehicle equipped with a robot arm and an FPGA. The path between the two locations is followed by recognizing a black line between them. The black line is sensed by Infrared sensors (IR) located on the front and on the back of the vehicle. The Robot was successfully implemented by programming the Field Programmable Gate Array with the designed system that was described as a state diagram and the robot operated properly.
Artificial Intelligence Algorithms have been used in recent years in many scientific fields. We suggest employing flower pollination algorithm in the environmental field to find the best estimate of the semi-parametric regression function with measurement errors in the explanatory variables and the dependent variable, where measurement errors appear frequently in fields such as chemistry, biological sciences, medicine, and epidemiological studies, rather than an exact measurement. We estimate the regression function of the semi-parametric model by estimating the parametric model and estimating the non-parametric model, the parametric model is estimated by using an instrumental variables method (Wald method, Bartlett’s method, and Durbin
... Show MoreA simple straightforward mathematical method has been developed to cluster grid nodes on a boundary segment of an arbitrary geometry that can be fitted by a relevant polynomial. The method of solution is accomplished in two steps. At the first step, the length of the boundary segment is evaluated by using the mean value theorem, then grids are clustered as desired, using relevant linear clustering functions. At the second step, as the coordinates cell nodes have been computed and the incremental distance between each two nodes has been evaluated, the original coordinate of each node is then computed utilizing the same fitted polynomial with the mean value theorem but reversibly.
The method is utilized to predict
... Show MoreThis paper presents a cognition path planning with control algorithm design for a nonholonomic wheeled mobile robot based on Particle Swarm Optimization (PSO) algorithm. The aim of this work is to propose the circular roadmap (CRM) method to plan and generate optimal path with free navigation as well as to propose a nonlinear MIMO-PID-MENN controller in order to track the wheeled mobile robot on the reference path. The PSO is used to find an online tune the control parameters of the proposed controller to get the best torques actions for the wheeled mobile robot. The numerical simulation results based on the Matlab package show that the proposed structure has a precise and highly accurate distance of the generated refere
... Show MoreThere are many methods of searching large amount of data to find one particular piece of information. Such as find name of person in record of mobile. Certain methods of organizing data make the search process more efficient the objective of these methods is to find the element with least cost (least time). Binary search algorithm is faster than sequential and other commonly used search algorithms. This research develops binary search algorithm by using new structure called Triple, structure in this structure data are represented as triple. It consists of three locations (1-Top, 2-Left, and 3-Right) Binary search algorithm divide the search interval in half, this process makes the maximum number of comparisons (Average case com
... Show More