Results 141 to 150 of about 3,482,591 (285)
On self-circumferences in Minkowski planes
Extracta Mathematicae, 2019 This paper contains results on self-circumferences of convex figures in the frameworks of norms and (more general) also of gauges. Let δ(n) denote the self-circumference of a regular polygon with n sides in a normed plane.
Mostafa Ghandehari, Horst Martini
doaj
Predicting intra-abdominal hypertension using anthropometric measurements and machine learning
Scientific ReportsAlmost one in four critically ill patients suffer from intra-abdominal hypertension (IAH). Currently, the gold standard for measuring intra-abdominal pressure (IAP) is via the bladder.
Salar Tayebi +9 more
doaj +1 more source
The Effect of Transformations on the Approximation of Univariate (Convex) Functions with Applications to Pareto Curves [PDF]
In the literature, methods for the construction of piecewise linear upper and lower bounds for the approximation of univariate convex functions have been proposed.We study the effect of the use of increasing convex or increasing concave transformations ...
Siem, A.Y.D. +2 more
core
Core equivalence theorems for infinite convex games [PDF]
, 1996 We show that the core of a continuous convex game on a measurable space of players is a von Neumann-Morgenstern stable set. We also extend the definition of the Mas-Colell bargaining set to games with a measurable space of players, and show that for ...
Shitovitz, Benyamin +3 more
core
Advanced Intelligent Discovery, EarlyView.This article investigates how persistent homology, persistent Laplacians, and persistent commutative algebra reveal complementary geometric, topological, and algebraic invariants or signatures of real‐world data. By analyzing shapes, synthetic complexes, fullerenes, and biomolecules, the article shows how these mathematical frameworks enhance ...
Yiming Ren, Guo‐Wei Wei
wiley +1 more source
Max-convex decompositions for cooperative TU games [PDF]
We show that any cooperative TU game is the maximum of a finite collection of convex games. This max-convex decomposition can be refined by using convex games with nonnegative dividends for all coalitions of at least two players.
Francesc Llerena +1 more
core
Explaining the Origin of Negative Poisson's Ratio in Amorphous Networks With Machine Learning
Advanced Intelligent Discovery, EarlyView.This review summarizes how machine learning (ML) breaks the “vicious cycle” in designing auxetic amorphous networks. By transitioning from traditional “black‐box” optimization to an interpretable “AI‐Physics” closed‐loop paradigm, ML is shown to not only discover highly optimized structures—such as all‐convex polygon networks—but also unveil hidden ...
Shengyu Lu, Xiangying Shen
wiley +1 more source
Refining ensemble N-representability of one-body density matrices from partial information
New Journal of PhysicsThe N -representability problem places fundamental constraints on reduced density matrices (RDMs) that originate from physical many-fermion quantum states.
Julia Liebert +4 more
doaj +1 more source
A Comprehensive Comparative Study of Active Learning Schemes for Nanophotonics Design
Advanced Intelligent Discovery, EarlyView.Active learning (AL) strategies are benchmarked for the binary design of planar multilayer nanophotonic structures. Factorization machines combined with quantum annealing (QA) become effective as dimensionality increases. Hybrid QA provides the strongest results for 100‐layer problems, highlighting the importance of optimization method selection in ...
Serang Jung +10 more
wiley +1 more source