—This paper studies the control motion of a single link flexible joint robot by using a hierarchical non-singular terminal sliding mode controller (HNTSMC). In comparison to the conventional sliding mode controller (CSMC), the proposed algorithm (NTSMC) not only can conserve characteristics of the convention CSMC, such as easy implementation, guaranteed stability and good robustness against system uncertainties and external disturbances, but also can ensure a faster convergence rate of the systems states to zero in a finite time and singularity free. The flexible joint robot (FJR) is a two degree of freedom (2DOF) nonlinear and underactuated system. The system here is modeled as a fourth order system by using Lagrangian method. Based on the modeling dynamics, the system is decomposed hierarchically into two-second order subsystems, namely, a rigid body and a flexible subsystem. In the first level, the sliding manifold for each subsystem is designed based on the NTS surfaces. Then, in the second level, the total sliding surface is constructed as the linear combination of NTS surfaces of two subsystems. Thereafter, a HNTSM control is obtained based on Lyapunov theorem to drive both subsystems to their equilibrium points in the finite time. Simulation results demonstrate the effectiveness of proposed scheme (HNTSMC) over (HCSMC).
The oyster ??????? (planned) (Pallas) of lesions that have entered Iraq recently became spyware severe damage in more than a station from power plants in Iraq, including the power plant in Mussayab Vamahar accumulates in pipes cooling and disrupts their work Vtafrtf heat systems cooling and thereby determiningefficiency and lead to added cost many cleaning or replacement of damaged parts
In this research, we introduce and study the concept of fibrewise bitopological spaces. We generalize some fundamental results from fibrewise topology into fibrewise bitopological space. We also introduce the concepts of fibrewise closed bitopological spaces,(resp., open, locally sliceable and locally sectionable). We state and prove several propositions concerning with these concepts. On the other hand, we extend separation axioms of ordinary bitopology into fibrewise setting. The separation axioms we extend are called fibrewise pairwise T_0 spaces, fibrewise pairwise T_1 spaces, fibrewise pairwise R_0 spaces, fibrewise pairwise Hausdorff spaces, fibrewise pairwise functionally Hausdorff spaces, fibrewise pairwise regular spaces, fibrewise
... Show MoreThe bandwidth requirements of telecommunication network users increased rapidly during the last decades. Optical access technologies must provide the bandwidth demand for each user. The passive optical access networks (PONs) support a maximum data rate of 100 Gbps by using the Orthogonal Frequency Division Multiplexing (OFDM) technique in the optical access network. In this paper, the optical broadband access networks with many techniques from Time Division Multiplexing Passive Optical Networks (TDM PON) to Orthogonal Frequency Division Multiplex Passive Optical Networks (OFDM PON) are presented. The architectures, advantages, disadvantages, and main parameters of these optical access networks are discussed and reported which have many ad
... Show MoreThis article investigates Iraq wars presentation in literature and media. The first section investigates the case of the returnees from the war and their experience, their trauma and final presentation of that experience. The article also investigates how trauma and fear is depicted to create an optimized image and state of fear that could in turn show Iraqi society as a traumatized society. Critics such as Suzie Grogan believes that the concept of trauma could expand to influence societies rather than one individual after exposure to trauma of being involved in wars and different major conflicts. This is reflected in Iraq as a country that was subjected to six comprehensive conflicts in its recent history, i.e. less than half a century; th
... Show MoreThis paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.