The inverse kinematic equation for a robot is very important to the control robot’s motion and position. The solving of this equation is complex for the rigid robot due to the dependency of this equation on the joint configuration and structure of robot link. In light robot arms, where the flexibility exists, the solving of this problem is more complicated than the rigid link robot because the deformation variables (elongation and bending) are present in the forward kinematic equation. The finding of an inverse kinematic equation needs to obtain the relation between the joint angles and both of the end-effector position and deformations variables. In this work, a neural network has been proposed to solve the problem of inverse kinemati

    In this work, we use the explicit and the implicit finite-difference methods to solve the nonlocal problem that consists of the diffusion equations together with nonlocal conditions. The nonlocal conditions for these partial differential equations are approximated by using the composite trapezoidal rule, the composite Simpson's 1/3 and 3/8 rules. Also, some numerical examples are presented to show the efficiency of these methods.

An efficient combination of Adomian Decomposition iterative technique coupled with Laplace transformation to solve non-linear Random Integro differential equation (NRIDE) is introduced in a novel way to get an accurate analytical solution. This technique is an elegant combination of theLaplace transform, and the Adomian polynomial. The suggested method will convert differential equations into iterative algebraic equations, thus reducing processing and analytical work. The technique solves the problem of calculating the Adomian polynomials. The method’s efficiency was investigated using some numerical instances, and the findings demonstrate that it is easier to use than many other numerical procedures. It has also been established that (LT

This manuscript presents several applications for solving special kinds of ordinary and partial differential equations using iteration methods such as Adomian decomposition method (ADM), Variation iterative method (VIM) and Taylor series method. These methods can be applied as well as to solve nonperturbed problems and 3rd order parabolic PDEs with variable coefficient. Moreover, we compare the results using ADM, VIM and Taylor series method. These methods are a commination of the two initial conditions.

The study aimed to find out the degree of practicing Arabic language teachers in the preparatory stage of higher-order thinking skills from their point of view in the first, second and third Baghdad Rusafa directorates of education. The descriptive survey method was used. The study population consisted of teachers of the Arabic language in the directorates of Baghdad, Rusafa, First, Second and Third, and the sample number was (284) teachers. A questionnaire was built on higher-order thinking skills. The validity and reliability of the tool were verified, after which the scale was applied to the research sample of (116) schools and (168) teachers who were randomly selected from the schools affiliated to the Baghdad Education Directorates Rus

This paper presents new modification of HPM to solve system of 3 rd order PDEs with initial condition, for finding suitable accurate solutions in a wider domain.

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

The problem of rapid population growth is one of the main problems effecting countries of the world the reason for this the growth in different environment areas of life commercial, industrial, social, food and educational. Therefore, this study was conducted on the amount of potable water consumed using two models of the two satellite and aerial images of the Kadhimiya District-block 427 and Al-Shu^,laa district-block 450 in Baghdad city for available years in the Secretariat of Baghdad (2005, 2011,2013,2015). Through the characteristics of geographic information systems, which revealed the spatial patterns of urban creep by determining the role and buildings to be created, which appear in the picture for the