In this paper, we relate the feedback canonical form \textbf{FNCF} of differential-algebraic control systems (DACSs) with famous Morse \textbf{MCF} ordinary differential equation (ODECSs). First, a procedure called an explicitation (with driving variables) is proposed to connect two above categories by attaching DACS class ODECSs kinds inputs (the original input $u$ and vector variables $v$). T...

corrective feedback (cf) and its different types have long absorbed many scholars and practitioners. as ellis (2009) mentioned some experimental studies need to be carefully designed to discover the relative effectiveness of each of these cf techniques. the goal of this qualitative study was to discover whether the employment of different cf strategies could bring about an attitudinal shift. to...

This paper studies the technique of the composite nonlinear feedback (CNF) control for a class of cascade nonlinear systems with input saturation. The objective of this paper is to improve the transient performance of the closed-loop system by designing a CNF control law such that the output of the system tracks a step input rapidly with small overshoot and at the same time maintains the stabil...

in this paper, some basic results concerning strict, nonstrict inequalities, local existence theorem and differential inequalities  have been proved for an ivp of first order hybrid  random differential equations with the linear perturbation of second type. a comparison theorem is proved and  applied to prove the uniqueness of random solution for the considered perturbed random differential equ...

linear state bisection is introduced as a new method to find time-invariant state feedback control laws for a special form of underactuated nonlinear systems. the specialty of the systems considered is that every unactuated state should be coupled with at least two directly actuated states. the basic idea is based on bisecting actuated states and using linear combinations with adjustable parame...

We study various shortcut fusion rules for languages like Haskell. Following a careful semantic account of a recently proposed rule for circular program transformation, we propose a new rule that trades circularity for higher-orderedness, and thus attains better semantic properties. This also leads us to revisit the original foldr/build-rule, as well as its dual, and to develop variants that do...