Computing the characteristic polynomials of a class of hyperelliptic curves for cryptographic applications.
The paper presents connections between the criteria which make three types of objects possible to be recognized, namely, edges, planes and corners. These criteria can be applied while a binaural sonar system is used. It is shown that the criteria are specific forms of a general equation. The form of the equation depends on a single coefficient. In the paper, the meaning of this coefficient is discussed. The constructions of the arrangement of objects are presented and are bound with values of the...
The simultaneous problem of consensus and trajectory tracking of linear multi-agent systems is considered in this paper, where the dynamics of each agent is represented by a single-input single-output linear system. In order to solve this problem, a distributed control strategy is proposed in this work, where the trajectory and the formation of the agents are achieved asymptotically even in the presence of switching communication topologies and smooth formation changes, and ensuring the closed-loop...
Recently several papers have related the production of sampling and interpolating sequences for multi-band signals to the solution of certain kinds of Wiener-Hopf equations. Our approach is based on connections between exponential Riesz bases and the controllability of distributed parameter systems. For the case of two-band signals we derive an operator whose invertibility is equivalent to the existence of a sampling and interpolating sequence, and prove the invertibility of this operator.
We give a short account of the construction and properties of left neofields. Most useful in practice seem to be neofields based on the cyclic group and particularly those having an additional divisibility property, called D-neofields. We shall give examples of applications to the construction of orthogonal latin squares, to the design of tournaments balanced for residual effects and to cryptography.
We consider a class of discrete convex functionals which satisfy a (generalized) coarea formula. These functionals, based on submodular interactions, arise in discrete optimization and are known as a large class of problems which can be solved in polynomial time. In particular, some of them can be solved very efficiently by maximal flow algorithms and are quite popular in the image processing community. We study the limit in the continuum of these functionals, show that they always converge...
Generalized entropic functionals are in an active area of research. Hence lower and upper bounds on these functionals are of interest. Lower bounds for estimating Rényi conditional -entropy and two kinds of non-extensive conditional -entropy are obtained. These bounds are expressed in terms of error probability of the standard decision and extend the inequalities known for the regular conditional entropy. The presented inequalities are mainly based on the convexity of some functions. In a certain...
We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a code reuse mechanism by introducing a crossbreeding operator that allows importing the genetic material from...