Tootfinder

If you don't live in Georgia (or even in Athens), you may not know who Bill Paul was, but this obituary penned by his family gives some idea of how important he was to art in the state. The acquisitions he made for our collection and the exhibitions he organized truly opened the door for experimental and contemporary art. RIP. ❤️
https:…

Noted Athens artist Bill Paul dies at age 89
From the Lord & Stephens Funeral Home:William Dewitt "Bill" Paul, Jr., 89, of Athens, GA, passed away on Friday, May 3, 2024, following multiple extended illnesses. Born at home in the rural town of Wadley, GA, Bill spent his formative years amidst the charm of his family's general store and family farm, playing with and caring for farm animals and getting into trouble in elementary school for doodling on the bottoms of his shoes during nap time.Bill is preceded in death by his dear wife of 51 y

Matrix Multiplication Reductions
Ashish Gola (Simon Fraser University), Igor Shinkar (Simon Fraser University), Harsimran Singh (Simon Fraser University)
https://arxiv.org/abs/2404.08085

Matrix Multiplication Reductions
In this paper we study a worst case to average case reduction for the problem of matrix multiplication over finite fields. Suppose we have an efficient average case algorithm, that given two random matrices $A,B$ outputs a matrix that has a non-trivial correlation with their product $A \cdot B$. Can we transform it into a worst case algorithm, that outputs the correct answer for all inputs without incurring a significant overhead in the running time? We present two results in this direction. …

SimpliCity: Reconstructing Buildings with Simple Regularized 3D Models
Jean-Philippe Bauchet, Raphael Sulzer, Florent Lafarge, Yuliya Tarabalka
https://arxiv.org/abs/2404.08104

SimpliCity: Reconstructing Buildings with Simple Regularized 3D Models
Automatic methods for reconstructing buildings from airborne LiDAR point clouds focus on producing accurate 3D models in a fast and scalable manner, but they overlook the problem of delivering simple and regularized models to practitioners. As a result, output meshes often suffer from connectivity approximations around corners with either the presence of multiple vertices and tiny facets, or the necessity to break the planarity constraint on roof sections and facade components. We propose a 2D …

This https://arxiv.org/abs/2311.14145 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csRO_…

Multi-Agent Motion Planning with Bézier Curve Optimization under Kinodynamic Constraints
Multi-Agent Motion Planning (MAMP) is a problem that seeks collision-free dynamically-feasible trajectories for multiple moving agents in a known environment while minimizing their travel time. MAMP is closely related to the well-studied Multi-Agent Path-Finding (MAPF) problem. Recently, MAPF methods have achieved great success in finding collision-free paths for a substantial number of agents. However, those methods often overlook the kinodynamic constraints of the agents, assuming instantaneo…

Towards a generalized accessibility measure for transportation equity and efficiency
Rajat Verma, Mithun Debnath, Shagun Mittal, Satish V. Ukkusuri
https://arxiv.org/abs/2404.04985 https://arxiv.org/pdf/2404.04985
arXiv:2404.04985v1 Announce Type: new
Abstract: Locational measures of accessibility are widely used in urban and transportation planning to understand the impact of the transportation system on influencing people's access to places. However, there is a considerable lack of measurement standards and publicly available data. We propose a generalized measure of locational accessibility that has a comprehensible form for transportation planning analysis. This metric combines the cumulative opportunities approach with gravity-based measures and is capable of catering to multiple trip purposes, travel modes, cost thresholds, and scales of analysis. Using data from multiple publicly available datasets, this metric is computed by trip purpose and travel time threshold for all block groups in the United States, and the data is made publicly accessible. Further, case studies of three large metropolitan areas reveal substantial inefficiencies in transportation infrastructure, with the most inefficiency observed in sprawling and non-core urban areas, especially for bicycling. Subsequently, it is shown that targeted investment in facilities can contribute to a more equitable distribution of accessibility to essential shopping and service facilities. By assigning greater weights to socioeconomically disadvantaged neighborhoods, the proposed metric formally incorporates equity considerations into transportation planning, contributing to a more equitable distribution of accessibility to essential services and facilities.

JWST Photometric Time-Delay and Magnification Measurements for the Triply-Imaged Type Ia "Supernova H0pe" at z = 1.78
J. D. R. Pierel, B. L. Frye, M. Pascale, G. B. Caminha, W. Chen, S. Dhawan, D. Gilman, M. Grayling, S. Huber, P. Kelly, S. Thorp, N. Arendse, S. Birrer, M. Bronikowski, R. Canameras, D. Coe, S. H. Cohen, C. J. Conselice, S. P. Driver, J. C. J. Dsilva, M. Engesser, N. Foo, C. Gall, N. Garuda, C. Grillo, N. A. Grogin, J. Henderson, J. Hjorth, R. A. Jansen, J. Jo…

JWST Photometric Time-Delay and Magnification Measurements for the Triply-Imaged Type Ia "Supernova H0pe" at z = 1.78
Supernova (SN) H0pe is a gravitationally lensed, triply-imaged, Type Ia SN (SN Ia) discovered in James Webb Space Telescope imaging of the PLCK G165.7+67.0 cluster of galaxies. Well-observed multiply-imaged SNe provide a rare opportunity to constrain the Hubble constant ($H_0$), by measuring the relative time delay between the images and modeling the foreground mass distribution. SN H0pe is located at $z=1.783$, and is the first SN Ia with sufficient light curve sampling and long enough time de…

Towards a generalized accessibility measure for transportation equity and efficiency
Rajat Verma, Mithun Debnath, Shagun Mittal, Satish V. Ukkusuri
https://arxiv.org/abs/2404.04985 https://arxiv.org/pdf/2404.04985
arXiv:2404.04985v1 Announce Type: new
Abstract: Locational measures of accessibility are widely used in urban and transportation planning to understand the impact of the transportation system on influencing people's access to places. However, there is a considerable lack of measurement standards and publicly available data. We propose a generalized measure of locational accessibility that has a comprehensible form for transportation planning analysis. This metric combines the cumulative opportunities approach with gravity-based measures and is capable of catering to multiple trip purposes, travel modes, cost thresholds, and scales of analysis. Using data from multiple publicly available datasets, this metric is computed by trip purpose and travel time threshold for all block groups in the United States, and the data is made publicly accessible. Further, case studies of three large metropolitan areas reveal substantial inefficiencies in transportation infrastructure, with the most inefficiency observed in sprawling and non-core urban areas, especially for bicycling. Subsequently, it is shown that targeted investment in facilities can contribute to a more equitable distribution of accessibility to essential shopping and service facilities. By assigning greater weights to socioeconomically disadvantaged neighborhoods, the proposed metric formally incorporates equity considerations into transportation planning, contributing to a more equitable distribution of accessibility to essential services and facilities.

This https://arxiv.org/abs/2312.02435 has been replaced.
initial toot: https://mastoxiv.page/@arXiv_csDS_…

Embedding Probability Distributions into Low Dimensional $\ell_1$: Tree Ising Models via Truncated Metrics
Given an arbitrary set of high dimensional points in $\ell_1$, there are known negative results that preclude the possibility of always mapping them to a low dimensional $\ell_1$ space while preserving distances with small multiplicative distortion. This is in stark contrast with dimension reduction in Euclidean space ($\ell_2$) where such mappings are always possible. While the first non-trivial lower bounds for $\ell_1$ dimension reduction were established almost 20 years ago, there has been …

Optimal Planning for Timed Partial Order Specifications
Kandai Watanabe, Georgios Fainekos, Bardh Hoxha, Morteza Lahijanian, Hideki Okamoto, Sriram Sankaranarayanan
https://arxiv.org/abs/2405.00687

Optimal Planning for Timed Partial Order Specifications
This paper addresses the challenge of planning a sequence of tasks to be performed by multiple robots while minimizing the overall completion time subject to timing and precedence constraints. Our approach uses the Timed Partial Orders (TPO) model to specify these constraints. We translate this problem into a Traveling Salesman Problem (TSP) variant with timing and precedent constraints, and we solve it as a Mixed Integer Linear Programming (MILP) problem. Our contributions include a general pl…

Hypergraph Unreliability in Quasi-Polynomial Time
Ruoxu Cen, Jason Li, Debmalya Panigrahi
https://arxiv.org/abs/2403.18781 https://ar…

Hypergraph Unreliability in Quasi-Polynomial Time
The hypergraph unreliability problem asks for the probability that a hypergraph gets disconnected when every hyperedge fails independently with a given probability. For graphs, the unreliability problem has been studied over many decades, and multiple fully polynomial-time approximation schemes are known starting with the work of Karger (STOC 1995). In contrast, prior to this work, no non-trivial result was known for hypergraphs (of arbitrary rank). In this paper, we give quasi-polynomial tim…