Flexible joint robot (FJR) manipulators can offer many attractive features over rigid manipulators, including light weight, safe operation, and high power efficiency. However, the tracking control of the FJR is challenging due to its inherent problems, such as underactuation, coupling, nonlinearities, uncertainties, and unknown external disturbances. In this article, a terminal sliding mode control (TSMC) is proposed for the FJR system to guarantee the finite-time convergence of the systems output, and to achieve the total robustness against the lumped disturbance and estimation error. By using two coordinate transformations, the FJR dynamics is turned into a canonical form. A cascaded finite-time sliding mode observer (CFTSMO) is construct

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 presence of different noise sources and continuous increase in crosstalk in the deep submicrometer technology raised concerns for on-chip communication reliability, leading to the incorporation of crosstalk avoidance techniques in error control coding schemes. This brief proposes joint crosstalk avoidance with adaptive error control scheme to reduce the power consumption by providing appropriate communication resiliency based on runtime noise level. By switching between shielding and duplication as the crosstalk avoidance technique and between hybrid automatic repeat request and forward error correction as the error control policies, three modes of error resiliencies are provided. The results show that, in reduced mode, the scheme achie

In this paper the oscillation criterion was investigated for all solutions of the third-order half linear neutral differential equations. Some necessary and sufficient conditions are established for every solution of (a(t)[(x(t)±p(t)x(?(t) ) )^'' ]^? )^'+q(t) x^? (?(t) )=0, t?t_0, to be oscillatory. Examples are given to illustrate our main results.

in this paper the second order neutral differential equations are incestigated are were we give some new suffucient conditions for all nonoscillatory

In this study, a fast block matching search algorithm based on blocks' descriptors and multilevel blocks filtering is introduced. The used descriptors are the mean and a set of centralized low order moments. Hierarchal filtering and MAE similarity measure were adopted to nominate the best similar blocks lay within the pool of neighbor blocks. As next step to blocks nomination the similarity of the mean and moments is used to classify the nominated blocks and put them in one of three sub-pools, each one represents certain nomination priority level (i.e., most, less & least level). The main reason of the introducing nomination and classification steps is a significant reduction in the number of matching instances of the pixels belong to the c

In this paper, a sufficient condition for stability of a system of nonlinear multi-fractional order differential equations on a finite time interval with an illustrative example, has been presented to demonstrate our result. Also, an idea to extend our result on such system on an infinite time interval is suggested.

Orthogonal polynomials and their moments have significant role in image processing and computer vision field. One of the polynomials is discrete Hahn polynomials (DHaPs), which are used for compression, and feature extraction. However, when the moment order becomes high, they suffer from numerical instability. This paper proposes a fast approach for computing the high orders DHaPs. This work takes advantage of the multithread for the calculation of Hahn polynomials coefficients. To take advantage of the available processing capabilities, independent calculations are divided among threads. The research provides a distribution method to achieve a more balanced processing burden among the threads. The proposed methods are tested for va