A network (or formally a graph) can be described by a set of nodes and a set of edges connecting these nodes. Networks model many real-world phenomena in various research domains, such as biology, engineering and sociology. Community mining is discovering the groups in a network where individuals group of membership are not explicitly given. Detecting natural divisions in such complex networks is proved to be extremely NP-hard problem that recently enjoyed a considerable interest. Among the proposed methods, the field of evolutionary algorithms (EAs) takes a remarkable interest. To this end, the aim of this paper is to present the general statement of community detection problem in social networks. Then, it visits the problem as an optim

Artificial pancreas is simulated to handle Type I diabetic patients under intensive care by automatically controlling the insulin infusion rate. A Backstepping technique is used to apply the effect of PID controller to blood glucose level since there is no direct relation between insulin infusion (the manipulated variable) and glucose level in Bergman’s system model subjected to an oral glucose tolerance test by applying a meal translated into a disturbance. Backstepping technique is usually recommended to stabilize and control the states of Bergman's class of nonlinear systems. The results showed a very satisfactory behavior of glucose deviation to a sudden rise represented by the meal that increase the blood glucose

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

Abstract-Servo motors are important parts of industry automation due to their several advantages such as cost and energy efficiency, simple design, and flexibility. However, the position control of the servo motor is a difficult task because of different factors of external disturbances, nonlinearities, and uncertainties. To tackle these challenges, an adaptive integral sliding mode control (AISMC) is proposed, in which a novel bidirectional adaptive law is constructed to reduce the control chattering. The proposed control has three steps to be designed. Firstly, a full-order integral sliding manifold is designed to improve the servo motor position tracking performance, in which the reaching phase is eliminated to achieve the invariance of

One study whose importance has significantly grown in recent years is lip-reading, particularly with the widespread of using deep learning techniques. Lip reading is essential for speech recognition in noisy environments or for those with hearing impairments. It refers to recognizing spoken sentences using visual information acquired from lip movements. Also, the lip area, especially for males, suffers from several problems, such as the mouth area containing the mustache and beard, which may cover the lip area. This paper proposes an automatic lip-reading system to recognize and classify short English sentences spoken by speakers using deep learning networks. The input video extracts frames and each frame is passed to the Viola-Jone

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

An evaluation was achieved by designing a matlab program to solve Kepler’s equation of an elliptical orbit for methods (Newton-Raphson, Danby, Halley and Mikkola). This involves calculating the Eccentric anomaly (E) from mean anomaly (M=0°-360°) for each step and for different values of eccentricities (e=0.1, 0.3, 0.5, 0.7 and 0.9). The results of E were demonstrated that Newton’s- Raphson Danby’s, Halley’s can be used for e between (0-1). Mikkola’s method can be used for e between (0-0.6).The term  that added to Danby’s method to obtain the solution of Kepler’s equation is not influence too much on the value of E. The most appropriate initial Gauss value was also determined to