In this research the results of applying Artificial Neural Networks with modified activation function to perform the online and offline identification of four Degrees of Freedom (4-DOF) Selective Compliance Assembly Robot Arm (SCARA) manipulator robot will be described. The proposed model of identification strategy consists of a feed-forward neural network with a modified activation function that operates in parallel with the SCARA robot model. Feed-Forward Neural Networks (FFNN) which have been trained online and offline have been used, without requiring any previous knowledge about the system to be identified. The activation function that is used in the hidden layer in FFNN is a modified version of the wavelet function. This approach ha

In this research the results of applying Artificial Neural Networks with modified activation function to
perform the online and offline identification of four Degrees of Freedom (4-DOF) Selective Compliance
Assembly Robot Arm (SCARA) manipulator robot will be described. The proposed model of
identification strategy consists of a feed-forward neural network with a modified activation function that
operates in parallel with the SCARA robot model. Feed-Forward Neural Networks (FFNN) which have
been trained online and offline have been used, without requiring any previous knowledge about the
system to be identified. The activation function that is used in the hidden layer in FFNN is a modified
version of the wavelet func

The techniques of fractional calculus are applied successfully in many branches of science and engineering, one of the techniques is the Elzaki Adomian decomposition method (EADM), which researchers did not study with the fractional derivative of Caputo Fabrizio. This work aims to study the Elzaki Adomian decomposition method (EADM) to solve fractional differential equations with the Caputo-Fabrizio derivative. We presented the algorithm of this method with the CF operator and discussed its convergence by using the method of the Cauchy series then, the method has applied to solve Burger, heat-like, and, couped Burger equations with the Caputo -Fabrizio operator. To conclude the method was convergent and effective for solving this type of

In this research study the synodic month for the moon and theirrelationship with the mean anomaly for the moon orbit and date A.Dand for long periods of time (100 years), we was design a computerprogram that calculates the period of synodic months, and thecoordinates of the moon at the moment of the new moon with highaccuracy. During the 100 year, there are 1236 period of synodicmonths.We found that the when New Moon occurs near perigee (meananomaly = 0°), the length of the synodic month at a minimum.Similarly, when New Moon occurs near apogee (mean anomaly =180°), the length of the synodic month reaches a maximum. Theshortest synodic month on 2053 /1/ 16 and lasted (29.27436) days.The longest synodic month began on 2008 /11/ 27 a

In this research study the synodic month for the moon and their
relationship with the mean anomaly for the moon orbit and date A.D
and for long periods of time (100 years), we was design a computer
program that calculates the period of synodic months, and the
coordinates of the moon at the moment of the new moon with high
accuracy. During the 100 year, there are 1236 period of synodic
months.
We found that the when New Moon occurs near perigee (mean
anomaly = 0°), the length of the synodic month at a minimum.
Similarly, when New Moon occurs near apogee (mean anomaly =
180°), the length of the synodic month reaches a maximum. The
shortest synodic month on 2053 /1/ 16 and lasted (29.27436) days.
The lo

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

Browse Iraqi academic journals and research papers

This study was done to find a cheap, available and ecofriendly materials that can remove eosin y dye from aqueous solutions by adsorption in this study, two adsorbent materials were used, the shells of fresh water clam (Cabicula fluminea) and walnut shells. To make a comparison between the two adsorbents, five experiments were conducted. First, the effects of the contact time, here the nut shell removed the dye quickly, while the C. flumina need more contact time to remove the dye. Second, the effects of adsorbent weight were examined. The nut shell was very promising and for all used adsorbent weight, the R% ranged from 94.87 to 99.29. However C. fluminea was less effective in removing the dye with R% ranged from 47.59 to 55.39. The thi