This article presents a new cascaded extended state observer (CESO)-based sliding-mode control (SMC) for an underactuated flexible joint robot (FJR). The control of the FJR has many challenges, including coupling, underactuation, nonlinearity, uncertainties and external disturbances, and the noise amplification especially in the high-order systems. The proposed control integrates the CESO and SMC, in which the CESO estimates the states and disturbances, and the SMC provides the system robustness to the uncertainty and disturbance estimation errors. First, a dynamic model of the FJR is derived and converted from an underactuated form to a canonical form via the Olfati transformation and a flatness approach, which reduces the complexity of th

Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject

In data mining, classification is a form of data analysis that can be used to extract models describing important data classes. Two of the well known algorithms used in data mining classification are Backpropagation Neural Network (BNN) and Naïve Bayesian (NB). This paper investigates the performance of these two classification methods using the Car Evaluation dataset. Two models were built for both algorithms and the results were compared. Our experimental results indicated that the BNN classifier yield higher accuracy as compared to the NB classifier but it is less efficient because it is time-consuming and difficult to analyze due to its black-box implementation.

This 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

 The interest in Multi social skills and self-concept is extremely  important for many of the scholars of education and psychology has taken a great deal in their writings and their interests as they see that social skills training is to make sure of the same, and that whenever enable the individual from acquiring social skills whenever asserted itself.The research aims know social skills and self-concept and their relationship to the children Riyadh age (4-6 years), and the research sample consisted of(200) boys and girls from kindergarten in the city of Baghdad Bjanbey Rusafa second and Karkh second.And to the objectives of the research realized the researcher has built two measures of social skills a

In this paper, we use concepts and results from percolation theory to investigate and characterize the effects of multi-channels on the connectivity of Dynamic Spectrum Access networks. In particular, we focus on the scenario where the secondary nodes have plenty of vacant channels to choose from-a phenomenon which we define as channel abundance. To cope with the existence of multi-channels, we use two types of rendezvous protocols: naive ones which do not guarantee a common channel and advanced ones which do. We show that, with more channel abundance, even with the use of either type of rendezvous protocol, it becomes difficult for two nodes to agree on a common channel, thereby potentially remaining invisible to each other. We model this