With the combination of the model reference adaptive control and iterative learning control, a model reference adaptive iterative learning control algorithm was proposed for a class of first order linear time-varying systems which are BIBO stable and repeatable in a finite time interval . By means of Lyapunov technique , an iterative learning control law with adaptive update law for time-varyin...

in the present paper, we rst modify the concepts of weakly fuzzy boundedness, strongly fuzzy boundedness, fuzzy continuity, strongly fuzzy continuity and weakly fuzzy continuity. then, we try to nd some relations by making a comparative study of the fuzzy norms of linear operators.

A new definition of boundedness of linear order-homomorphisms (LOH)in $L$-topological vector spaces is proposed. The new definition iscompared with the previous one given by Fang [The continuity offuzzy linear order-homomorphism, J. Fuzzy Math. 5 (4) (1997)829$-$838]. In addition, the relationship between boundedness andcontinuity of LOHs is discussed. Finally, a new uniform boundednessprincipl...

Incremental SAT solving under assumptions, introduced in Minisat, is in wide use. However, Minisat’s algorithm for incremental SAT solving under assumptions has two main drawbacks which hinder performance considerably. First, it is not compliant with the highly effective and commonly used preprocessor SatELite. Second, all the assumptions are left in the formula, rather than being represented a...

This paper considers the problem of adaptive output feedback tracking control for a class of nonstrict-feedback nonlinear systems with unknown time-varying delays and unknown backlash-like hysteresis. Fuzzy logic systems are used to estimate the unknown nonlinear functions. Based on the Lyapunov–Krasovskii method, the control scheme is constructed by using the backstepping and adaptive techniqu...

Let [Formula: see text] be a minimal parabolic subgroup of real reductive Lie group and closed text]. Then it is proved by Kobayashi Oshima that the regular representation contains each irreducible at most finitely many times if number text]-orbits on finite. Moreover, they also multiplicities are uniformly bounded finite, where complexifications text], respectively, Borel In this paper, we pro...