Results 51 to 60 of about 65,475 (209)
Invariant Measure and Universality of the 2D Yang–Mills Langevin Dynamic
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We prove that the Yang–Mills (YM) measure for the trivial principal bundle over the two‐dimensional torus, with any connected, compact structure group, is invariant for the associated renormalised Langevin dynamic. Our argument relies on a combination of regularity structures, lattice gauge‐fixing and Bourgain's method for invariant measures ...
Ilya Chevyrev, Hao Shen
wiley +1 more source
Hausdorff clustering of financial time series
, 2005 A clustering procedure, based on the Hausdorff distance, is introduced and tested on the financial time series of the Dow Jones Industrial Average (DJIA) index.Comment: 9 pages, 3 ...
Basalto N +5 more
core +1 more source
Front Propagation Through a Perforated Wall
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT We consider a bistable reaction– diffusion equation ut=Δu+f(u)$u_t=\Delta u +f(u)$ on RN${\mathbb {R}}^N$ in the presence of an obstacle K$K$, which is a wall of infinite span with many holes. More precisely, K$K$ is a closed subset of RN${\mathbb {R}}^N$ with smooth boundary such that its projection onto the x1$x_1$‐axis is bounded and that ...
Henri Berestycki +2 more
wiley +1 more source
Health Care Science, EarlyView.We developed a lightweight deep learning framework that integrates frequency‐ and spatial‐domain ultrasound features with segmentation‐assisted classification for hepatic echinococcosis diagnosis. The model outperformed existing state‐of‐the‐art methods in both accuracy and inference speed while requiring substantially fewer computational resources ...
Zhu He +11 more
wiley +1 more source
On Oriented Colourings of Graphs on Surfaces
Journal of Graph Theory, EarlyView.ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley +1 more source
Physics and Imaging in Radiation Oncology, 2020 Background and purpose: In radiotherapy, automatic organ-at-risk segmentation algorithms allow faster delineation times, but clinically relevant contour evaluation remains challenging.
Femke Vaassen +6 more
doaj +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
Journal of Graph Theory, EarlyView.ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) $G=(V,E)$ is said to be ( X , Y ) $(X,Y)$‐embeddable if any set of induced edge lengths from an ...
Sean Dewar +3 more
wiley +1 more source
Journal of New Theory, 2015 In this paper we present a new distance measure between neutrosophic refined sets on the basis of extended Hausdorff distance of neutrosophic set and we study some of their basic properties.
Said Broumi, Florentin Smarandache
doaj
A (p,q)-Averaged Hausdorff Distance for Arbitrary Measurable Sets
Mathematical and Computational Applications, 2018 The Hausdorff distance is a widely used tool to measure the distance between different sets. For the approximation of certain objects via stochastic search algorithms this distance is, however, of limited use as it punishes single outliers.
Johan M. Bogoya +3 more
doaj +1 more source
On the complexity of computing the Hausdorff distance
Journal of Complexity, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source