Search results for "Orff"
showing 10 items of 199 documents
Thin Points of Brownian Motion Intersection Local Times
2005
Let \(\ell \) be the projected intersection local time of two independent Brownian paths in \(\mathbb{R}^d \) for d = 2, 3. We determine the lower tail of the random variable \(\ell \)(B(0, 1)), where B(0, 1) is the unit ball. The answer is given in terms of intersection exponents, which are explicitly known in the case of planar Brownian motion. We use this result to obtain the multifractal spectrum, or spectrum of thin points, for the intersection local times.
Approximation of piecewise smooth functions and images by edge-adapted (ENO-EA) nonlinear multiresolution techniques
2008
Abstract This paper introduces and analyzes new approximation procedures for bivariate functions. These procedures are based on an edge-adapted nonlinear reconstruction technique which is an intrinsically two-dimensional extension of the essentially non-oscillatory and subcell resolution techniques introduced in the one-dimensional setting by Harten and Osher. Edge-adapted reconstructions are tailored to piecewise smooth functions with geometrically smooth edge discontinuities, and are therefore attractive for applications such as image compression and shock computations. The local approximation order is investigated both in L p and in the Hausdorff distance between graphs. In particular, i…
High Precision Conservative Surface Mesh Generation for Swept Volumes
2015
We present a novel, efficient, and flexible scheme to generate a high-quality mesh that approximates the outer boundary of a swept volume. Our approach comes with two guarantees. First, the approximation is conservative, i.e., the swept volume is enclosed by the generated mesh. Second, the one-sided Hausdorff distance of the generated mesh to the swept volume is upper bounded by a user defined tolerance. Exploiting this tolerance the algorithm generates a mesh that is adapted to the local complexity of the swept volume boundary, keeping the overall output complexity remarkably low. The algorithm is two-phased: the actual sweep and the mesh generation. In the sweeping phase, we introduce a g…
Automatic segmentation of the spine by means of a probabilistic atlas with a special focus on ribs suppression
2017
[EN] Purpose: The development of automatic and reliable algorithms for the detection and segmentation of the vertebrae are of great importance prior to any diagnostic task. However, an important problem found to accurately segment the vertebrae is the presence of the ribs in the thoracic region. To overcome this problem, a probabilistic atlas of the spine has been developed dealing with the proximity of other structures, with a special focus on ribs suppression. Methods: The data sets used consist of Computed Tomography images corresponding to 21 patients suffering from spinal metastases. Two methods have been combined to obtain the final result: firstly, an initial segmentation is performe…
A remark on weakly convex continuous mappings in topological linear spaces
2009
Abstract Let C be a compact convex subset of a Hausdorff topological linear space and T : C → C a continuous mapping. We characterize those mappings T for which T ( C ) is convexly totally bounded.
A new approximation procedure for fractals
2003
AbstractThis paper is based upon Hutchinson's theory of generating fractals as fixed points of a finite set of contractions, when considering this finite set of contractions as a contractive set-valued map.We approximate the fractal using some preselected parameters and we obtain formulae describing the “distance” between the “exact fractal” and the “approximate fractal” in terms of the preselected parameters. Some examples and also computation programs are given, showing how our procedure works.
On the Extension of the DIRECT Algorithm to Multiple Objectives
2020
AbstractDeterministic global optimization algorithms like Piyavskii–Shubert, direct, ego and many more, have a recognized standing, for problems with many local optima. Although many single objective optimization algorithms have been extended to multiple objectives, completely deterministic algorithms for nonlinear problems with guarantees of convergence to global Pareto optimality are still missing. For instance, deterministic algorithms usually make use of some form of scalarization, which may lead to incomplete representations of the Pareto optimal set. Thus, all global Pareto optima may not be obtained, especially in nonconvex cases. On the other hand, algorithms attempting to produce r…
A quantitative reverse Faber-Krahn inequality for the first Robin eigenvalue with negative boundary parameter
2021
The aim of this paper is to prove a quantitative form of a reverse Faber-Krahn type inequality for the first Robin Laplacian eigenvalueλβwith negative boundary parameter among convex sets of prescribed perimeter. In that framework, the ball is the only maximizer forλβand the distance from the optimal set is considered in terms of Hausdorff distance. The key point of our stategy is to prove a quantitative reverse Faber-Krahn inequality for the first eigenvalue of a Steklov-type problem related to the original Robin problem.
R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case
2010
This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.
Delta- and Daugavet points in Banach spaces
2020
AbstractA Δ-pointxof a Banach space is a norm-one element that is arbitrarily close to convex combinations of elements in the unit ball that are almost at distance 2 fromx. If, in addition, every point in the unit ball is arbitrarily close to such convex combinations,xis a Daugavet point. A Banach spaceXhas the Daugavet property if and only if every norm-one element is a Daugavet point. We show that Δ- and Daugavet points are the same inL1-spaces, inL1-preduals, as well as in a big class of Müntz spaces. We also provide an example of a Banach space where all points on the unit sphere are Δ-points, but none of them are Daugavet points. We also study the property that the unit ball is the clo…