For domains in R d \mathbb {R}^d , d ≥ 2 d\geq 2 , we prove universal upper and lower bounds on the product of the bottom of the spectrum for the Laplacian to the power p > 0 p>0 and the supremum over all starting points of the p p -moments of the exit time of Brownian motion. It is shown that the lower bound is sharp for integer values of p p and that for p ≥ 1 p \geq 1 , the upper bound is asymptotically sharp as d → ∞ d\to \infty . For all p > 0 p>0 , we prove the existence of an extremal domain among the class of domains that are convex and symmetric with respect to all coordinate axes. For this class of domains we conjecture that the cube is extremal.
more »
« less
Superresolution of three point-sources assisted with machine learning
We demonstrate super-resolved localization of three point sources with the assistance of a machine learning model that is based on the decomposition of the source signal into Hermite Gaussian modes. High fidelity of over 80% is achieved.
more »
« less
- Award ID(s):
- 2316878
- PAR ID:
- 10626896
- Publisher / Repository:
- Optica Publishing Group
- Date Published:
- ISBN:
- 978-1-957171-95-1
- Page Range / eLocation ID:
- JTu4A.47
- Format(s):
- Medium: X
- Location:
- Denver, Colorado
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
<p>The data was downloaded and captured through MBSE online learning modules. Deidentified learners' activities within the modules, such as clickstreams and assignments, were captured in the data/</p> <p>• All files here are student submissions to one or more of the modules in the MBSE program.</p> <p>• All user data has either been removed or redacted from the submission.</p> <p>• “Andrew Hurt” is not a student and none of these files came from him. He is the person who did the redaction.</p> <p>• The naming structure of the files is as follows: [Module number]-[Module Offering Date]-[Submission Number]-[Part Number of Submission]. Example: M5-040422-S1-Part3. This file is from Module 5, which was offered on April 4, 2022, it is submission 1, and part 3 of submission 1.</p> <p>• Note that submissions within or between modules are not necessarily connected to specific students. So “Submission 1” from module 5 is not the same user as “Submission 1” from module 6.</p> <p>• Not all submissions have multiple parts.</p> <p>• No .mdzip files (proprietary MagicDraw software files) have been included in this list.</p> <p>• If a module or folder in the module is missing content from a particular offering, it is because either no one submitted anything or because the file was a .mdzip file and was not downloaded.</p> <p> </p>more » « less
-
We present an elementary proof of a well-known theorem of Cheeger which states that if a metric-measure space \(X\) supports a \(p\)-Poincaré inequality, then the \(N^{1,p}(X)\) Sobolev space is reflexive and separable whenever \(p\in (1,\infty)\). We also prove separability of the space when \(p=1\). Our proof is based on a straightforward construction of an equivalent norm on \(N^{1,p}(X)\), \(p\in [1,\infty)\), that is uniformly convex when \(p\in (1,\infty)\). Finally, we explicitly construct a functional that is pointwise comparable to the minimal \(p\)-weak upper gradient, when \(p\in (1,\infty)\).more » « less
-
Abstract ChemMLis an open machine learning (ML) and informatics program suite that is designed to support and advance the data‐driven research paradigm that is currently emerging in the chemical and materials domain.ChemMLallows its users to perform various data science tasks and execute ML workflows that are adapted specifically for the chemical and materials context. Key features are automation, general‐purpose utility, versatility, and user‐friendliness in order to make the application of modern data science a viable and widely accessible proposition in the broader chemistry and materials community.ChemMLis also designed to facilitate methodological innovation, and it is one of the cornerstones of the software ecosystem for data‐driven in silico research. This article is categorized under:Software > Simulation MethodsComputer and Information Science > ChemoinformaticsStructure and Mechanism > Computational Materials ScienceSoftware > Molecular Modelingmore » « less
-
The pentagram map takes a planar polygon $$P$$ to a polygon $P'$ whose vertices are the intersection points of consecutive shortest diagonals of $$P$$ . This map is known to interact nicely with Poncelet polygons, that is, polygons which are simultaneously inscribed in a conic and circumscribed about a conic. A theorem of Schwartz states that if $$P$$ is a Poncelet polygon, then the image of $$P$$ under the pentagram map is projectively equivalent to $$P$$ . In the present paper, we show that in the convex case this property characterizes Poncelet polygons: if a convex polygon is projectively equivalent to its pentagram image, then it is Poncelet. The proof is based on the theory of commuting difference operators, as well as on properties of real elliptic curves and theta functions.more » « less
An official website of the United States government

