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 paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using  Mathcad 15.and graphic in Matlab R2015a.

Contracting cancer typically induces a state of terror among the individuals who are affected. Exploring how chemotherapy and anxiety work together to affect the speed at which cancer cells multiply and the immune system’s response model is necessary to come up with ways to stop the spread of cancer. This paper proposes a mathematical model to investigate the impact of psychological scare and chemotherapy on the interaction of cancer and immunity. The proposed model is accurately described. The focus of the model’s dynamic analysis is to identify the potential equilibrium locations. According to the analysis, it is possible to establish three equilibrium positions. The stability analysis reveals that all equilibrium points consi

The aim of this research is to employ the roundhouse strategy to study its impact on the students achievement of the 10th grade in physics and their core thinking. After the application of the research experience and gaining data, which was processed statistically using the statistical packages program (SPSS). The results of the researcher revealed the superiority of the students of the experimental group who studied using the roundhouse strategy on the students of the control group who studied the usual method in the achievement test. As results showed that there were statistically significant differences between the average scores of the experimental group and the average scores of the control group students in the core thinking test and

         International companies are striving to reduce their costs and increase their profits, and these trends have produced many methods and techniques to achieve these goals. these methods is heuristic and the other Optimization.. The research includes an attempt to adapt some of these techniques in the Iraqi companies, and these techniques are to determine the optimal lot size using the algorithms Wagner-Whitin under the theory of constraints. The research adopted the case study methodology to objectively identify the problem of research, namely determining lot size optimal for each of the products of electronic measurement laboratory in Diyala and in light of the bottlenecks in w

Using watermarking techniques and digital signatures can better solve the problems of digital images transmitted on the Internet like forgery, tampering, altering, etc. In this paper we proposed invisible fragile watermark and MD-5 based algorithm for digital image authenticating and tampers detecting in the Discrete Wavelet Transform DWT domain. The digital image is decomposed using 2-level DWT and the middle and high frequency sub-bands are used for watermark and digital signature embedding. The authentication data are embedded in number of the coefficients of these sub-bands according to the adaptive threshold based on the watermark length and the coefficients of each DWT level. These sub-bands are used because they a

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed