<p>The directing of a wheeled robot in an unknown moving environment with physical barriers is a difficult proposition. In particular, having an optimal or near-optimal path that avoids obstacles is a major challenge. In this paper, a modified neuro-controller mechanism is proposed for controlling the movement of an indoor mobile robot. The proposed mechanism is based on the design of a modified Elman neural network (MENN) with an effective element aware gate (MEEG) as the neuro-controller. This controller is updated to overcome the rigid and dynamic barriers in the indoor area. The proposed controller is implemented with a mobile robot known as Khepera IV in a practical manner. The practical results demonstrate that the propo

The current Iraqi standard specifications for roads and bridges allowed the prepared Job-Mix Formula for asphalt mixtures to witness some tolerances with regard to the following: coarse aggregate gradation by ± 6.0 %, fine aggregate gradation by ± 4.0 %, filler gradation by ± 2.0 %, asphalt cement content by ± 0.3 % and mixing temperature by ± 15 ^oC. The objective of this work is to evaluate the behavior of asphalt mixtures prepared by different aggregates gradations (12.5 mm nominal maximum size) that fabricated by several asphalt contents (40-50 grade) and various mixing temperature. All the tolerances specified in the specifications are taken into account, furthermore, the zones beyond these tolerances

The estimation of the parameters of linear regression is based on the usual Least Square method, as this method is based on the estimation of several basic assumptions. Therefore, the accuracy of estimating the parameters of the model depends on the validity of these hypotheses. The most successful technique was the robust estimation method which is minimizing maximum likelihood estimator (MM-estimator) that proved its efficiency in this purpose. However, the use of the model becomes unrealistic and one of these assumptions is the uniformity of the variance and the normal distribution of the error. These assumptions are not achievable in the case of studying a specific problem that may include complex data of more than one model. To

The δ-mixing of γ-transitions in 70As populated in the 32 70 70 33 Ge p n As (, ) γ reaction is calculated in the present work by using the a2-ratio methods. In one work we applied this method for two cases, the first one is for pure transition and the sacend one is for non pure transition, We take into account the experimental a2-coefficient for previous works and δ -values for one transition only.The results obtained are, in general, in a good agreement within associated errors, with those reported previously , the discrepancies that occur are due to inaccuracies existing in the experimental data of the previous works.

This paper proposes a novel finite-time generalized proportional integral observer (FTGPIO) based a sliding mode control (SMC) scheme for the tracking control problem of high order uncertain systems subject to fast time-varying disturbances. For this purpose, the construction of the controller consists of two consecutive steps. First, the novel FTGPIO is designed to observe unmeasurable plant dynamics states and disturbance with its higher time derivatives in finite time rather than infinite time as in the standard GPIO. In the FTGPO estimator, the finite time convergence rate of estimations is well achieved, whereas the convergence rate of estimations by classical GPIO is asymptotic and slow. Secondly, on the basis of the finite and fast e

Multiplicative inverse in GF (2 m ) is a complex step in some important application such as Elliptic Curve Cryptography (ECC) and other applications. It operates by multiplying and squaring operation depending on the number of bits (m) in the field GF (2 m ). In this paper, a fast method is suggested to find inversion in GF (2 m ) using FPGA by reducing the number of multiplication operations in the Fermat's Theorem and transferring the squaring into a fast method to find exponentiation to (2 k ). In the proposed algorithm, the multiplicative inverse in GF(2 m ) is achieved by number of multiplications depending on log 2 (m) and each exponentiation is operates in a single clock cycle by generating a reduction matrix for high power of two ex