We consider the structure of JordanH-pseudoalgebras which are linearly finitely generated over a Hopf algebra H . There are two cases under consideration: H = U(h) and H = U(h)#C[Γ], where h is a finite-dimensional Lie algebra over C, Γ is an arbitrary group acting on U(h) by automorphisms. We construct an analogue of the Tits–Kantor–Koecher construction for finite Jordan pseudoalgebras and des...

a paper-pot transplanter was designed, developed and evaluated in the field by transplanting sugar beet seedlings grown in paper pots. a ground-driven counter wheel equipped with an infra-red sensor measures the traveled distance and sends the corresponding signals to a micro-controller. a step motor controlled by the micro-controller turns the driving shaft of the paper-pot metering mechanism ...

Based on a common article of the authors, we are concerned with solving monotone inclusion problems expressed by the sum of a set-valued maximally monotone operator with a single-valued maximally monotone one and the normal cone to the nonempty set of zeros of another set-valued maximally monotone operator. Depending on the nature of the single-valued operator, we propose two iterative penalty ...

In this paper, to improve the uniform convergence of the known Lagrange interpolation polynomials, a new triangle interpolation operator of Bernstein type is constructed by using the method of two revised nodes. It is proved that the constructed operator converges uniformly to arbitrary continuous functions with period on the whole axis. The best approximation order of the operator is then obta...

We investigate the convergence properties of a stochastic primal-dual splitting algorithm for solving structured monotone inclusions involving the sum of a cocoercive operator and a composite monotone operator. The proposed method is the stochastic extension to monotone inclusions of a proximal method studied in [26, 35] for saddle point problems. It consists in a forward step determined by the...

We introduce and study three notions of typeness for automata on infinite words. For an acceptance-condition class γ (that is, γ is weak, Büchi, co-Büchi, Rabin, or Streett), deterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same deterministic structure, nondeterministic γ-typeness asks for the existence of an equivalent γ-automaton on the same structure, and γ...

Most existing studies on the expressive power of query languages have focused on what queries can be expressed and what queries cannot be expressed in a query language. They do not tell us much about whether a query can be implemented efficiently in a query language. Yet, paradoxically, efficiency is of primary concern in computer science. In this paper, the efficiency of queries in NRC(powerse...

This paper studies trace-based equivalences for systems combining nondeterministic and probabilistic choices. We show how trace semantics such processes can be recovered by instantiating a coalgebraic construction known as the generalised powerset construction. characterise compare resulting to definitions of appearing in literature. Most our results are based on exciting interplay between mona...