The paper discusses several control techniques for a class of systems described by fractional order equations. presents the unit frequency criteria that ensure closed loop for: Fractional Order Linear Systems, Systems with nonlinear components, Time Delay components. stability criterion is proposed composed subsystems. These are used in two applications: Soft Exoskeleton Glove Control, studied ...

In this paper, we consider a new class of analytic functions in the unit disk using polynomials of order alpha. We give some sufficient conditions for functions belonging to this class.

Let $p=(q^4+q^3+q^2+q+1)/(5,q-1)$ be a prime number, where $q$ is a prime power. In this paper, we will show $Gcong mathrm{PSL}(5,q)$ if and only if $|G|=|mathrm{PSL}(5,q)|$, and $G$ has a conjugacy class size $frac{| mathrm{PSL}(5,q)|}{p}$. Further, the validity of a conjecture of J. G. Thompson is generalized to the groups under consideration by a new way.

This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program t...

We consider first-order formulas over relational structures which may use arbitrary numerical predicates. We require that the validity of the formula is independent of the particular interpretation of the numerical predicates and refer to such formulas as Arb-invariant first-order. Our main result shows a Gaifman locality theorem: two tuples of a structure with n elements, having the same neigh...

We expose a new approach to tackle non-structural subtyping problems. We introduce uniform subtyping as a means to capture some properties of non-structural subtyping. In the uniform theory, we show that the validity of a first-order sentence is decidable, and entailment is PSPACEhard. In addition, we give decidable approximations to entailment and subtyping constrained types — two problems whi...