The aim of this paper is to provide a rigorous variational formulation for the detection of points in 2-d biological images. To this purpose we introduce a new functional whose minimizers give the points we want to detect. Then we define an approximating sequence of functionals for which we prove the Γ-convergence to the initial one.
The aim of this paper is to provide a rigorous variational formulation for the detection of points in 2-d biological images. To this purpose we introduce a new functional whose minimizers give the points we want to detect. Then we define an approximating sequence of functionals for which we prove the Γ-convergence to the initial one.
This is a report on recent joint work with J. Asch, and with T. Hudetz and F. Benatti.We consider classical, quantum and semiclassical motion in periodic potentials and prove various results on the distribution of asymptotic velocities.The Kolmogorov-Sinai entropy and its quantum generalization, the Connes-Narnhofer-Thirring entropy, of the single particle and of a gas of noninteracting particles are related.
The entropy region is a fundamental object of study in mathematics, statistics, and information theory. On the one hand, it involves pure group theory, governing inequalities satisfied by subgroup indices, whereas on the other hand, computing network coding capacities amounts to a convex optimization over this region. In the case of four random variables, the points in the region that satisfy the Ingleton inequality (corresponding to abelian groups and to linear network codes) form a well-understood...
Visual simultaneous localisation and map-building systems which take advantage of some landmarks other than point-wise environment features are not frequently reported. In the following paper the method of using the operational map of robot surrounding, which is complemented with visible structured passive landmarks, is described. These landmarks are used to improve self-localisation accuracy of the robot camera and to reduce the size of the Kalman-filter state-vector with respect to the vector...
We give a short account of some time-frequency methods which are relevant in the context of gravity waves detection. We focus on the case of wavelet analysis which we believe is particularly appropriate. We show how wavelet transforms can lead to efficient algorithms for detection and parameter estimation of binary coalescence signals. In addition, we give in an appendix some of the ingredients needed for the construction of discrete wavelet decompositions and corresponding fast algorithms.
We present an axiomatic characterization of entropies with properties of branching, continuity, and weighted additivity. We deliberately do not assume that the entropies are symmetric. The resulting entropies are generalizations of the entropies of degree α, including the Shannon entropy as the case α = 1. Such “weighted” entropies have potential applications to the “utility of gambling” problem.
It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...
In the last decade it has become clear that one of the central themes within Gabor analysis (with respect to general time-frequency lattices) is a duality theory for Gabor frames, including the Wexler-Raz biorthogonality condition, the Ron-Shen duality principle and the Janssen representation of a Gabor frame operator. All these results are closely connected with the so-called Fundamental Identity of Gabor Analysis, which we derive from an application of Poisson's summation formula for the symplectic...
In this article, we formalize Z-module, that is a module over integer ring. Z-module is necassary for lattice problems, LLL (Lenstra-Lenstra-Lovász) base reduction algorithm and cryptographic systems with lattices [11].