skip to main content


Title: From curves to currents
Abstract Many natural real-valued functions of closed curves are known to extend continuously to the larger space of geodesic currents. For instance, the extension of length with respect to a fixed hyperbolic metric was a motivating example for the development of geodesic currents. We give a simple criterion on a curve function that guarantees a continuous extension to geodesic currents. The main condition of our criterion is the smoothing property, which has played a role in the study of systoles of translation lengths for Anosov representations. It is easy to see that our criterion is satisfied for almost all known examples of continuous functions on geodesic currents, such as nonpositively curved lengths or stable lengths for surface groups, while also applying to new examples like extremal length. We use this extension to obtain a new curve counting result for extremal length.  more » « less
Award ID(s):
2110143 1507244
NSF-PAR ID:
10349026
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Forum of Mathematics, Sigma
Volume:
9
ISSN:
2050-5094
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. Medical image segmentation is one of the most challenging tasks in medical image analysis and widely developed for many clinical applications. While deep learning-based approaches have achieved impressive performance in semantic segmentation, they are limited to pixel-wise settings with imbalanced-class data problems and weak boundary object segmentation in medical images. In this paper, we tackle those limitations by developing a new two-branch deep network architecture which takes both higher level features and lower level features into account. The first branch extracts higher level feature as region information by a common encoder-decoder network structure such as Unet and FCN, whereas the second branch focuses on lower level features as support information around the boundary and processes in parallel to the first branch. Our key contribution is the second branch named Narrow Band Active Contour (NB-AC) attention model which treats the object contour as a hyperplane and all data inside a narrow band as support information that influences the position and orientation of the hyperplane. Our proposed NB-AC attention model incorporates the contour length with the region energy involving a fixed-width band around the curve or surface. The proposed network loss contains two fitting terms: (i) a high level feature (i.e., region) fitting term from the first branch; (ii) a lower level feature (i.e., contour) fitting term from the second branch including the (ii1) length of the object contour and (ii2) regional energy functional formed by the homogeneity criterion of both the inner band and outer band neighboring the evolving curve or surface. The proposed NB-AC loss can be incorporated into both 2D and 3D deep network architectures. The proposed network has been evaluated on different challenging medical image datasets, including DRIVE, iSeg17, MRBrainS18 and Brats18. The experimental results have shown that the proposed NB-AC loss outperforms other mainstream loss functions: Cross Entropy, Dice, Focal on two common segmentation frameworks Unet and FCN. Our 3D network which is built upon the proposed NB-AC loss and 3DUnet framework achieved state-of-the-art results on multiple volumetric datasets. 
    more » « less
  2. Abstract

    Dynamic shearing banding and fracturing in unsaturated porous media are significant problems in engineering and science. This article proposes a multiphase micro‐periporomechanics (PPM) paradigm for modeling dynamic shear banding and fracturing in unsaturated porous media. Periporomechanics (PPM) is a nonlocal reformulation of classical poromechanics to model continuous and discontinuous deformation/fracture and fluid flow in porous media through a single framework. In PPM, a multiphase porous material is postulated as a collection of a finite number of mixed material points. The length scale in PPM that dictates the nonlocal interaction between material points is a mathematical object that lacks a direct physical meaning. As a novelty, in the coupled PPM, a microstructure‐based material length scale is incorporated by considering micro‐rotations of the solid skeleton following the Cosserat continuum theory for solids. As a new contribution, we reformulate the second‐order work for detecting material instability and the energy‐based crack criterion and J‐integral for modeling fracturing in the PPM paradigm. The stabilized Cosserat PPM correspondence principle that mitigates the multiphase zero‐energy mode instability is augmented to include unsaturated fluid flow. We have numerically implemented the novel PPM paradigm through a dual‐way fractional‐step algorithm in time and a hybrid Lagrangian–Eulerian meshfree method in space. Numerical examples are presented to demonstrate the robustness and efficacy of the proposed PPM paradigm for modeling shear banding and fracturing in unsaturated porous media.

     
    more » « less
  3. We develop a novel and generic algorithm for the adversarial multi-armed bandit problem (or more generally the combinatorial semi-bandit problem). When instantiated differently, our algorithm achieves various new data-dependent regret bounds improving previous work. Examples include: 1) a regret bound depending on the variance of only the best arm; 2) a regret bound depending on the first-order path-length of only the best arm; 3) a regret bound depending on the sum of the first-order path-lengths of all arms as well as an important negative term, which together lead to faster convergence rates for some normal form games with partial feedback; 4) a regret bound that simultaneously implies small regret when the best arm has small loss {\it and} logarithmic regret when there exists an arm whose expected loss is always smaller than those of other arms by a fixed gap (e.g. the classic i.i.d. setting). In some cases, such as the last two results, our algorithm is completely parameter-free. The main idea of our algorithm is to apply the optimism and adaptivity techniques to the well-known Online Mirror Descent framework with a special log-barrier regularizer. The challenges are to come up with appropriate optimistic predictions and correction terms in this framework. Some of our results also crucially rely on using a sophisticated increasing learning rate schedule. 
    more » « less
  4. This study introduces an objective definition for onset and demise of the northeast Indian monsoon (NEM). The definition is based on the land surface temperature analysis over the Indian subcontinent. It is diagnosed from the inflection points in the daily anomaly cumulative curve of the area-averaged surface temperature over the provinces of Andhra Pradesh, Rayalseema, and Tamil Nadu located in the southeastern part of India. Per this definition, the climatological onset and demise dates of the NEM season are 6 November and 13 March, respectively. The composite evolution of the seasonal cycle of 850-hPa winds, surface wind stress, surface ocean currents, and upper-ocean heat content suggest a seasonal shift around the time of the diagnosed onset and demise dates of the NEM season. The interannual variations indicate onset date variations have a larger impact than demise date variations on the seasonal length, seasonal anomalies of rainfall, and surface temperature of the NEM. Furthermore, it is shown that warm El Niño–Southern Oscillation (ENSO) episodes are associated with excess seasonal rainfall, warm seasonal land surface temperature anomalies, and reduced lengths of the NEM season. Likewise, cold ENSO episodes are likely to be related to seasonal deficit rainfall anomalies, cold land surface temperature anomalies, and increased lengths of the NEM season.

     
    more » « less
  5. This paper proposes and develops a new Newton-type algorithm to solve subdifferential inclusions defined by subgradients of extended real-valued prox-regular functions. The proposed algorithm is formulated in terms of the second order subdifferential of such functions that enjoy extensive calculus rules and can be efficiently computed for broad classes of extended real-valued functions. Based on this and on the metric regularity and subregularity properties of subgradient mappings, we establish verifiable conditions ensuring the well-posedness of the proposed algorithm and its local superlinear convergence. The obtained results are also new for the class of equations defined by continuously differentiable functions with Lipschitzian gradients ([Formula: see text] functions), which is the underlying case of our consideration. The developed algorithms for prox-regular functions and their extension to a structured class of composite functions are formulated in terms of proximal mappings and forward–backward envelopes. Besides numerous illustrative examples and comparison with known algorithms for [Formula: see text] functions and generalized equations, the paper presents applications of the proposed algorithms to regularized least square problems arising in statistics, machine learning, and related disciplines. Funding: Research of P. D. Khanh is funded by Ho Chi Minh City University of Education Foundation for Science and Technology [Grant CS.2022.19.20TD]. Research of B. Mordukhovich and V. T. Phat was partly supported by the U.S. National Science Foundation [Grants DMS-1808978 and DMS-2204519]. The research of B. Mordukhovich was also supported by the Air Force Office of Scientific Research [Grant 15RT0462] and the Australian Research Council under Discovery Project DP-190100555. This work was supported by the Air Force Office of Scientific Research [Grant 15RT0462]. 
    more » « less