Texture density discrimination is more precise than number discrimination. [PDF]
Durgin FH +3 more
europepmc +1 more source
Quantifying the honey bee dance floor: A data-driven method for defining and comparing waggle dance regions. [PDF]
Van Nest BN +4 more
europepmc +1 more source
Macroscopic Market Making Games
ABSTRACT Building on the macroscopic market making framework as a control problem, this paper investigates its extension to stochastic games. In the context of price competition, each agent is benchmarked against the best quote offered by the others. We begin with the linear case.
Ivan Guo, Shijia Jin
wiley +1 more source
Tight Bounds for Joint Distribution Functions of Order Statistics Under <i>k</i>-Independence. [PDF]
Okolewski A, Blazejczyk-Okolewska B.
europepmc +1 more source
ABSTRACT The proliferation of AI‐generated building footprints in OpenStreetMap (OSM) has transformed crowdsourced mapping, yet the geometric characteristics associated with different digitization methods remain poorly understood. This study presents a comprehensive morphometric analysis of more than 9 million building footprints across 15 ...
Abdulkadir Memduhoğlu
wiley +1 more source
SarcGraph for High-Throughput Regional Analysis of Sarcomere Organization and Contractile Function in 2D Cardiac Muscle Bundles. [PDF]
Mohammadzadeh S +5 more
europepmc +1 more source
Quasibounded solutions to the complex Monge–Ampère equation
Abstract We study the Dirichlet problem for the complex Monge–Ampère operator on B‐regular domains in Cn$\mathbb {C}^n$, allowing boundary data that is singular or unbounded. We extend the concept of pluri‐quasibounded functions on the domain to functions on the boundary, defined by the existence of plurisuperharmonic majorants that dominate their ...
Mårten Nilsson
wiley +1 more source
High-Pressure Synthesis of the First Thermodynamically Stable Silver Nitride, AgN5. [PDF]
Liang A +12 more
europepmc +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Out-of-home activities motivating older adults' participation in the community. [PDF]
Lin SH +5 more
europepmc +1 more source

