Search results for "Euclidean"
showing 10 items of 185 documents
Dirichlet approximation and universal Dirichlet series
2016
We characterize the uniform limits of Dirichlet polynomials on a right half plane. In the Dirichlet setting, we find approximation results, with respect to the Euclidean distance and {to} the chordal one as well, analogous to classical results of Runge, Mergelyan and Vitushkin. We also strengthen the notion of universal Dirichlet series.
A short proof of the infinitesimal Hilbertianity of the weighted Euclidean space
2020
We provide a quick proof of the following known result: the Sobolev space associated with the Euclidean space, endowed with the Euclidean distance and an arbitrary Radon measure, is Hilbert. Our new approach relies upon the properties of the Alberti-Marchese decomposability bundle. As a consequence of our arguments, we also prove that if the Sobolev norm is closable on compactly-supported smooth functions, then the reference measure is absolutely continuous with respect to the Lebesgue measure.
CUDA-Accelerated Alignment of Subsequences in Streamed Time Series Data
2014
Euclidean Distance (ED) and Dynamic Time Warping (DTW) are cornerstones in the field of time series data mining. Many high-level algorithms like kNN-classification, clustering or anomaly detection make excessive use of these distance measures as subroutines. Furthermore, the vast growth of recorded data produced by automated monitoring systems or integrated sensors establishes the need for efficient implementations. In this paper, we introduce linear memory parallelization schemes for the alignment of a given query Q in a stream of time series data S for both ED and DTW using CUDA-enabled accelerators. The ED parallelization features a log-linear calculation scheme in contrast to the naive …
The computational complexity of the relative robust shortest path problem with interval data
2004
Abstract The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP -hard.
Algebraic models of the Euclidean plane
2018
We introduce a new invariant, the real (logarithmic)-Kodaira dimension, that allows to distinguish smooth real algebraic surfaces up to birational diffeomorphism. As an application, we construct infinite families of smooth rational real algebraic surfaces with trivial homology groups, whose real loci are diffeomorphic to $\mathbb{R}^2$, but which are pairwise not birationally diffeomorphic. There are thus infinitely many non-trivial models of the euclidean plane, contrary to the compact case.
Rescaling principle for isolated essential singularities of quasiregular mappings
2012
We establish a rescaling theorem for isolated essential singularities of quasiregular mappings. As a consequence we show that the class of closed manifolds receiving a quasiregular mapping from a punctured unit ball with an essential singularity at the origin is exactly the class of closed quasiregularly elliptic manifolds, that is, closed manifolds receiving a non-constant quasiregular mapping from a Euclidean space.
Regular Minimality and Thurstonian-type modeling
2009
Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…
Estimation of orientation characteristic of fibrous material
2001
A new statistical method for estimating the orientation distribution of fibres in a fibre process is suggested where the process is observed in the form of a degraded digital greyscale image. The method is based on line transect sampling of the image in a few fixed directions. A well-known method based on stereology is available if the intersections between the transects and fibres can be counted. We extend this to the case where, instead of the intersection points, only scaled variograms of grey levels along the transects are observed. The nonlinear estimation equations for a parametric orientation distribution as well as a numerical algorithm are given. The method is illustrated by a real…
Ultraviolet Fixed Point and Generalized Flow Equation of Quantum Gravity
2001
A new exact renormalization group equation for the effective average action of Euclidean quantum gravity is constructed. It is formulated in terms of the component fields appearing in the transverse-traceless decomposition of the metric. It facilitates both the construction of an appropriate infrared cutoff and the projection of the renormalization group flow onto a large class of truncated parameter spaces. The Einstein-Hilbert truncation is investigated in detail and the fixed point structure of the resulting flow is analyzed. Both a Gaussian and a non-Gaussian fixed point are found. If the non-Gaussian fixed point is present in the exact theory, quantum Einstein gravity is likely to be r…
Blood vessels and feature points detection on retinal images
2009
In this paper we present a method for the automatic extraction of blood vessels from retinal images, while capturing points of intersection/overlap and endpoints of the vascular tree. The algorithm performance is evaluated through a comparison with handmade segmented images available on the STARE project database (STructured Analysis of the REtina). The algorithm is performed on the green channel of the RGB triad. The green channel can be used to represent the illumination component. The matched filter is used to enhance vessels w.r.t. the background. The separation between vessels and background is accomplished by a threshold operator based on gaussian probability density function. The len…