planning is among the most significant in the field of robotics research.  As it is linked to finding a safe and efficient route in a cluttered environment for wheeled mobile robots and is considered a significant prerequisite for any such mobile robot project to be a success. This paper proposes the optimal path planning of the wheeled mobile robot with collision avoidance by using an algorithm called grey wolf optimization (GWO) as a method for finding the shortest and safe. The research goals in this study for identify the best path while taking into account the effect of the number of obstacles and design parameters on performance for the algorithm to find the best path. The simulations are run in the MATLAB environment to test the

Until recently, researchers have utilized and applied various techniques for intrusion detection system (IDS), including DNA encoding and clustering that are widely used for this purpose. In addition to the other two major techniques for detection are anomaly and misuse detection, where anomaly detection is done based on user behavior, while misuse detection is done based on known attacks signatures. However, both techniques have some drawbacks, such as a high false alarm rate. Therefore, hybrid IDS takes advantage of combining the strength of both techniques to overcome their limitations. In this paper, a hybrid IDS is proposed based on the DNA encoding and clustering method. The proposed DNA encoding is done based on the UNSW-NB15

Lately great interests have emerged to find educational alternatives to teach and improve motor skills according to modern educational methods that take into account individual differences and speed in learning for the learner through individual learning that the learner adopts by teaching himself by passing through various educational situations to acquire skills and information in the way he is The learner is the focus of the educational process and among these alternatives the interactive video, the researchers noted through the educational training units at the Model Squash School of the Central Union, and that most of the methods and methods used in learning basic skills take a lot of time in the educational program and do not involve

An adaptive nonlinear neural controller to reduce the nonlinear flutter in 2-D wing is proposed in the paper. The nonlinearities in the system come from the quasi steady aerodynamic model and torsional spring in pitch direction. Time domain simulations are used to examine the dynamic aero elastic instabilities of the system (e.g. the onset of flutter and limit cycle oscillation, LCO). The structure of the controller consists of two models :the modified Elman neural network (MENN) and the feed forward multi-layer Perceptron (MLP). The MENN model is trained with off-line and on-line stages to guarantee that the outputs of the model accurately represent the plunge and pitch motion of the wing and this neural model acts as the identifier. Th

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit