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 acceptance sampling plans for generalized exponential distribution, when life time experiment is truncated at a pre-determined time are provided in this article. The two parameters (α, λ), (Scale parameters and Shape parameters) are estimated by LSE, WLSE and the Best Estimator’s for various samples sizes are used to find the ratio of true mean time to a pre-determined, and are used to find the smallest possible sample size required to ensure the producer’s risks, with a pre-fixed probability (1 - P^*). The result of estimations and of sampling plans is provided in tables.

Key words: Generalized Exponential Distribution, Acceptance Sampling Plan, and Consumer’s and Producer Risks

            A field study aimed to improve  administrative performance of the Heads of Departments in Wasit University in light of the administrative functions, a questionnaire constructed was c of 38 items, as have been applied during the academic year 2014/2015 to a group of experts from the deans and assistants, professors and heads of departments using the Delphi method by two rounds the adoption rate of 90% and an agreement was numbered 30 experts and study reached important results have been analyzed and discussed according to fields of study, a planning, organization and direction.

In this paper we define and study new generalizations of continuous functions namely, -weakly (resp., w-closure, w-strongly) continuous and the main properties are studies: (a) If f : X®Y is w-weakly (resp., w-closure, w-strongly) continuous, then for any AÌX and any BÌY the restrictions fïA : A®Y and fB : f -1(B)®B are w-weakly (resp., w-closure, w-strongly) continuous. (b) Comparison between deferent forms of generalizations of continuous functions. (c) Relationship between compositions of deferent forms of generalizations of continuous functions. Moreover, we expanded the above generalizations and namely almost w-weakly (resp., w-closure, w-strongly) continuous functions and we state and prove several results concerning it.

         Continuous functions are novel concepts in topology. Many topologists contributed to the theory of continuous functions in topology. The present authors continued the study on continuous functions by utilizing the concept of gpα-closed sets in topology and introduced the concepts of weakly, subweakly and almost continuous functions. Further, the properties of these functions are established.

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

Discrete Krawtchouk polynomials are widely utilized in different fields for their remarkable characteristics, specifically, the localization property. Discrete orthogonal moments are utilized as a feature descriptor for images and video frames in computer vision applications. In this paper, we present a new method for computing discrete Krawtchouk polynomial coefficients swiftly and efficiently. The presented method proposes a new initial value that does not tend to be zero as the polynomial size increases. In addition, a combination of the existing recurrence relations is presented which are in the n- and x-directions. The utilized recurrence relations are developed to reduce the computational cost. The proposed method computes app