The flexible joint robot (FJR) typically experiences parametric variations, nonlinearities, underactuation, noise propagation, and external disturbances which seriously degrade the FJR tracking. This article proposes an adaptive integral sliding mode controller (AISMC) based on a singular perturbation method and two state observers for the FJR to achieve high performance. First, the underactuated FJR is modeled into two simple second-order fast and slow subsystems by using Olfati transformation and singular perturbation method, which handles underactuation while reducing noise amplification. Then, the AISMC is proposed to effectively accomplish the desired tracking performance, in which the integral sliding surface is designed to reduce cha

The aim of the thesis is to estimate the partial and inaccessible population groups, which is a field study to estimate the number of drug’s users in the Baghdad governorate for males who are (15-60) years old.

Because of the absence of data approved by government institutions, as well as the difficulty of estimating the numbers of these people from the traditional survey, in which the respondent expresses himself or his family members in some cases. In these challenges, the NSUM Network Scale-Up Method Is mainly based on asking respondents about the number of people they know in their network of drug addicts.

Based on this principle, a statistical questionnaire was designed to

During more than (50) years past, India has achieved considerable social and economic progress. It is also generally assumed that the future progress will be even more rapid and that India will be an important player in the global market. India has only (2.5) percent of global land whereas it has to provide home for one-sixth of world's population .On examining the past trends of India's population ,it may be observed that during the latter half of the twentieth century ,about (650) million populations were added to the country ,thus living in a country with a high population density and high growth rate , India in need a transition from high fertility high mortality to a low fertility low mortality and towards stable population situatio

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

Oscillation criterion is investigated for all solutions of the first-order linear neutral differential equations with positive and negative coefficients. Some sufficient conditions are established so that every solution of eq.(1.1) oscillate. Generalizing of some results in [4] and [5] are given. Examples are given to illustrated our main results.

The method of operational matrices based on different types of polynomials such as Bernstein, shifted Legendre and Bernoulli polynomials will be presented and implemented to solve the nonlinear Blasius equations approximately. The nonlinear differential equation will be converted into a system of nonlinear algebraic equations that can be solved using Mathematica®12. The efficiency of these methods has been studied by calculating the maximum error remainder ( ), and it was found that their efficiency increases as the polynomial degree (n) increases, since the errors decrease. Moreover, the approximate solutions obtained by the proposed methods are compared with the solution of the 4th order Runge-Kutta method (RK4), which gives very

The aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.

<p>Daftardar Gejji and Hossein Jafari have proposed a new iterative method for solving many of the linear and nonlinear equations namely (DJM). This method proved already the effectiveness in solved many of the ordinary differential equations, partial differential equations and integral equations. The main aim from this paper is to propose the Daftardar-Jafari method (DJM) to solve the Duffing equations and to find the exact solution and numerical solutions. The proposed (DJM) is very effective and reliable, and the solution is obtained in the series form with easily computed components. The software used for the calculations in this study was MATHEMATICA^® 9.0.</p>

The Korteweg-de Vries equation plays an important role in fluid physics and applied mathematics. This equation is a fundamental within study of shallow water waves. Since these equations arise in many applications and physical phenomena, it is officially showed that this equation has solitary waves as solutions, The Korteweg-de Vries equation is utilized to characterize a long waves travelling in channels. The goal of this paper is to construct the new effective frequent relation to resolve these problems where the semi analytic iterative technique presents new enforcement to solve Korteweg-de Vries equations. The distinctive feature of this method is, it can be utilized to get approximate solutions for travelling waves of