This paper studies the iterative learning control of robotic systems with repetitive tasks. A fuzzy neural network is applied to design a direct adaptive iterative learning controller. The fuzzy neural network is introduced for compensation of the unknown certainty equivalent controller. A new adaptive law using mixed time-domain and iteration-domain adaptation is developed. It is shown that th...

Baer has shown that, for a group G, finiteness of G=Zi(G) implies finiteness of ɣi+1(G). In this paper we will show that the converse is true provided that G=Zi(G) is finitely generated. In particular, when G is a finite nilpotent group we show that |G=Zi(G)| divides |ɣi+1(G)|d′ i(G), where d′i(G) =(d( G /Zi(G)))i.

Call a domain R an sQQR-domain if each simple overring of R, i.e., each ring of the form R[u] with u in the quotient field of R, is an intersection of localizations of R. We characterize Prüfer domains as integrally closed sQQR-domains. In the presence of certain finiteness conditions, we show that the sQQR-property is very strong; for instance, a Mori sQQR-domain must be a Dedekind domain. We ...

Let R be an integral domain with quotient field L. An overring T of R is t-linked over R if I = R implies that (T : IT ) = T for each finitely generated ideal I of R. Let Ot(R) denotes the set of all t-linked overrings of R and O(R) the set of all overrings of R. The purpose of this paper is to study some finiteness conditions on the set Ot(R). Particularly, we prove that if Ot(R) is finite, th...

Let R be an integral domain with quotient field L. An overring T of R is t-linked over R if I = R implies that (T : IT ) = T for each finitely generated ideal I of R. Let Ot(R) denotes the set of all t-linked overrings of R and O(R) the set of all overrings of R. The purpose of this paper is to study some finiteness conditions on the set Ot(R). Particularly, we prove that if Ot(R) is finite, th...

we prove that if $m$ is a monoid and $a$ a finite set with more than one element‎, ‎then the residual finiteness of $m$ is equivalent to that of the monoid consisting of all cellular automata over $m$ with alphabet $a$‎.

Abstract Let A be an abelian scheme of dimension at least four over a $\mathbb {Z}$ -finitely generated integral domain R characteristic zero, and let L ample line bundle on . We prove that the set smooth hypersurfaces D in representing is finite by showing moduli stack such has only finitely many -points. accomplish this using level structures to interpolate finiteness results between canonica...

For the basic Description Logics reasoning with respect to finite models amounts to reasoning with respect to arbitrary ones, but finiteness of the domain needs to be considered if expressivity is increased and the finite model property fails. Procedures for reasoning with respect to arbitrary models in very expressive Description Logics have been developed, but these are not directly applicabl...