Tootfinder

As @pluralistic writes here, “the American right is a brittle coalition:”
https://pluralistic.net/2024/07/14/fracture-lines/
We imagine the right as monolithic at our peril. Reply guys love, love, love to lecture me about how These People are all the same. Here’s the thing: they are not, and imagining they are is self-defeating. The right has been •incredibly• effective at finding fracture points on the left and jamming a crowbar into them. It’s time we did the same.
4/

250 Magnetic Tunnel Junctions-Based Probabilistic Ising Machine
Shuhan Yang, Andrea Grimaldi, Youwei Bao, Eleonora Raimondo, Jia Si, Giovanni Finocchio, Hyunsoo Yang
https://arxiv.org/abs/2506.14590

250 Magnetic Tunnel Junctions-Based Probabilistic Ising Machine
In combinatorial optimization, probabilistic Ising machines (PIMs) have gained significant attention for their acceleration of Monte Carlo sampling with the potential to reduce time-to-solution in finding approximate ground states. However, to be viable in real applications, further improvements in scalability and energy efficiency are necessary. One of the promising paths toward achieving this objective is the development of a co-design approach combining different technology layers including …

Isometric-Universal Graphs for Trees
Edgar Baucher, Fran\c{c}ois Dross, Cyril Gavoille
https://arxiv.org/abs/2506.11704 https://arxiv…

Isometric-Universal Graphs for Trees
We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isometric-universal graph with the minimum number of vertices for two given trees. We prove that this problem can be solved in time $O(n^{5/2}\log{n})$. We extend this result to forests instead of trees, and propose an algorithm with running time $O(n^{7/2}\log{n})$. As a key ingredient, we show that a smallest isometric-un…

Unfortunately & conversely, this (below) is the same framing tech bros (and parts of the population) are finding so attractive to anthropomorphize LLMs: These are not machines, and them making mistakes is normal and expected... At the same time, the other card being played (by politics, military & law enforcement) is that AI-driven insights and decision making are _already_ considered superior, infallible and unchallengeable... in the middle of this two pronged rhetoric is the fate o…

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Saeed Hashemi, Genchang Peng, Mehrdad Nourani, Omar Nofal, Jay Harvey
https://arxiv.org/abs/2506.09255

AI-Driven SEEG Channel Ranking for Epileptogenic Zone Localization
Stereo-electroencephalography (SEEG) is an invasive technique to implant depth electrodes and collect data for pre-surgery evaluation. Visual inspection of signals recorded from hundreds of channels is time consuming and inefficient. We propose a machine learning approach to rank the impactful channels by incorporating clinician's selection and computational finding. A classification model using XGBoost is trained to learn the discriminative features of each channel during ictal periods. Then, …

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

Efficient Fermi-Hubbard model ground-state preparation by coupling to a classical reservoir in the instantaneous-response limit
Preparing the ground state of the Fermi-Hubbard model is challenging, in part due to the exponentially large Hilbert space, which complicates efficiently finding a path from an initial state to the ground state using the variational principle. In this work, we propose an approach for ground state preparation of interacting models by involving a classical reservoir, simplified to the instantaneous-response limit, which can be described using a Hamiltonian formalism. The resulting time evolution …

Searching for sub-TeV IceCube neutrinos correlated to sub-threshold GW events
Tista Mukherjee (for the IceCube collaboration)
https://arxiv.org/abs/2506.09694

Searching for sub-TeV IceCube neutrinos correlated to sub-threshold GW events
The IceCube Neutrino Observatory is active in multi-messenger follow-ups of Gravitational Wave (GW) events. Since the release of the Gravitational Wave Transient Catalogue (GWTC)-2.1 by the LIGO-Virgo-KAGRA (LVK) collaboration, sub-threshold GW candidates have been made publicly available. However, they were not followed up in real-time to search for neutrino counterparts. For a deeper understanding of these sub-threshold candidates, archival searches are essential. Finding evidence for a neutr…

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

Finding Interest Needle in Popularity Haystack: Improving Retrieval by Modeling Item Exposure
Recommender systems operate in closed feedback loops, where user interactions reinforce popularity bias, leading to over-recommendation of already popular items while under-exposing niche or novel content. Existing bias mitigation methods, such as Inverse Propensity Scoring (IPS) and Off-Policy Correction (OPC), primarily operate at the ranking stage or during training, lacking explicit real-time control over exposure dynamics. In this work, we introduce an exposure-aware retrieval scoring appr…

WordPress may be run by… that guy, but it still has a massive user base. They all need better accessibility documentation.
@… wants to improve it, but needs sponsors:
https://

Mergers of galaxies
Sugata Kaviraj
https://arxiv.org/abs/2506.09136 https://arxiv.org/pdf/2506.09136…

Mergers of galaxies
The evolution of our Universe is strongly influenced by the attractive force of gravity. A key aspect of this evolution, therefore, is the merging of galaxies. Here, we explore the role of mergers in shaping the properties of massive galaxies over cosmic time. Observational methods of finding mergers include identifying galaxy pairs in close proximity, visual inspection of galaxy images to identify signatures of mergers (e.g. tidal features) and using morphological parameters such as Asymmetry …

Self-Supervised Spatial Correspondence Across Modalities
Ayush Shrivastava, Andrew Owens
https://arxiv.org/abs/2506.03148 https://arx…

Self-Supervised Spatial Correspondence Across Modalities
We present a method for finding cross-modal space-time correspondences. Given two images from different visual modalities, such as an RGB image and a depth map, our model identifies which pairs of pixels correspond to the same physical points in the scene. To solve this problem, we extend the contrastive random walk framework to simultaneously learn cycle-consistent feature representations for both cross-modal and intra-modal matching. The resulting model is simple and has no explicit photo-con…

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

Solving Multiagent Path Finding on Highly Centralized Networks
The Mutliagent Path Finding (MAPF) problem consists of identifying the trajectories that a set of agents should follow inside a given network in order to reach their desired destinations as soon as possible, but without colliding with each other. We aim to minimize the maximum time any agent takes to reach their goal, ensuring optimal path length. In this work, we complement a recent thread of results that aim to systematically study the algorithmic behavior of this problem, through the paramet…

Strain dependent viscous response describes the mechanics of cohesionless soft granular materials
Chandan Shakya, Luca Placidi, Anil Misra, Lars Kool, Anke Lindner, Jasper van der Gucht, Joshua A. Dijksman
https://arxiv.org/abs/2506.08855

Strain dependent viscous response describes the mechanics of cohesionless soft granular materials
Granular materials are ubiquitous in nature and are used extensively in daily life and in industry. The modeling of these materials remains challenging; therefore, finding models with acceptable predictive accuracy that at the same time also reflect the complexity of the granular dynamics is a central research theme in the field. Soft particle packings present additional modeling challenges, as it has become clear that soft particles also have particle-level relaxation timescales that affect th…

On Deterministically Finding an Element of High Order Modulo a Composite
Ziv Oznovich, Ben Lee Volk
https://arxiv.org/abs/2506.07668 https://

On Deterministically Finding an Element of High Order Modulo a Composite
We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial factor of $N$. Our algorithm improves upon an algorithm of Hittmeir (arXiv:1608.08766), who designed a similar algorithm under the stronger assumption $D \ge N^{2/5}$. Hittmeir's algorithm played a crucial role in the recent breakthrough deterministic integer f…

This https://arxiv.org/abs/2202.13250 has been replaced.
link: https://scholar.google.com/scholar?q=a

TabID: Automatic Identification and Tabulation of Subproblems in Constraint Models
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint (referred to as tabulation). Finding subproblems to tabulate is traditionally a manual and time-intensive process, even for expert modellers. This paper presents TabID, an entirely automated method to identify promising subproblems for tabulation in constraint programming. We introduce a diverse set of heuristics designed to identify promising candidates for tabulation, aiming t…

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

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansio…

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

Finding $d$-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and $H$-Free Graphs
The $d$-Cut problem is to decide if a graph has an edge cut such that each vertex has at most $d$ neighbours at the opposite side of the cut. If $d=1$, we obtain the intensively studied Matching Cut problem. The $d$-Cut problem has been studied as well, but a systematic study for special graph classes was lacking. We initiate such a study and consider classes of bounded diameter, bounded radius and $H$-free graphs. We prove that for all $d\geq 2$, $d$-Cut is polynomial-time solvable for graphs …

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

Scalable Differentially Private Bayesian Optimization
In recent years, there has been much work on scaling Bayesian Optimization to high-dimensional problems, for example hyperparameter tuning in large machine learning models. These scalable methods have been successful, finding high objective values much more quickly than traditional global Bayesian Optimization or random search-based methods. At the same time, these large models often use sensitive data, but preservation of Differential Privacy has not scaled alongside these modern Bayesian Opti…

Two-Sided Manipulation Games in Stable Matching Markets
Hadi Hosseini, Grzegorz Lisowski, Shraddha Pathak
https://arxiv.org/abs/2506.00554 https://

Two-Sided Manipulation Games in Stable Matching Markets
The Deferred Acceptance (DA) algorithm is an elegant procedure for finding a stable matching in two-sided matching markets. It ensures that no pair of agents prefers each other to their matched partners. In this work, we initiate the study of two-sided manipulations in matching markets as non-cooperative games. We introduce the accomplice manipulation game, where a man misreports to help a specific woman obtain a better partner, whenever possible. We provide a polynomial time algorithm for find…

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

Finding the nonnegative minimal solutions of Cauchy PDEs in a volatility-stabilized market
The strong relative arbitrage problem in Stochastic Portfolio Theory seeks an investment strategy that almost surely outperforms a benchmark portfolio at the end of a given time horizon. The highest relative return in relative arbitrage opportunities is characterized by the smallest nonnegative continuous solution of a Cauchy problem for a partial differential equation (PDE). However, solving this type of PDE poses analytical and numerical challenges, due to the high dimensionality and its non-…

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

Towards Resilient and Sustainable Global Industrial Systems: An Evolutionary-Based Approach
This paper presents a new complex optimization problem in the field of automatic design of advanced industrial systems and proposes a hybrid optimization approach to solve the problem. The problem is multi-objective as it aims at finding solutions that minimize CO2 emissions, transportation time, and costs. The optimization approach combines an evolutionary algorithm and classical mathematical programming to design resilient and sustainable global manufacturing networks. Further, it makes use o…

This https://arxiv.org/abs/2409.19434 has been replaced.
link: https://scholar.google.com/scholar?q=a

Energy-Efficient Computation with DVFS using Deep Reinforcement Learning for Multi-Task Systems in Edge Computing
Finding an optimal energy-efficient policy that is adaptable to underlying edge devices while meeting deadlines for tasks has always been challenging. This research studies generalized systems with multi-task, multi-deadline scenarios with reinforcement learning-based DVFS for energy saving for periodic soft real-time applications on edge devices. This work addresses the limitation of previous work that models a periodic system as a single task and single-deadline scenario, which is too simplif…

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
Jan Mikula (Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague), Miroslav Kulich (Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague)

Optimizing Mesh to Improve the Triangular Expansion Algorithm for Computing Visibility Regions
This paper addresses the problem of improving the query performance of the triangular expansion algorithm (TEA) for computing visibility regions by finding the most advantageous instance of the triangular mesh, the preprocessing structure. The TEA recursively traverses the mesh while keeping track of the visible region, the set of all points visible from a query point in a polygonal world. We show that the measured query time is approximately proportional to the number of triangle edge expansio…

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

Towards Resilient and Sustainable Global Industrial Systems: An Evolutionary-Based Approach
This paper presents a new complex optimization problem in the field of automatic design of advanced industrial systems and proposes a hybrid optimization approach to solve the problem. The problem is multi-objective as it aims at finding solutions that minimize CO2 emissions, transportation time, and costs. The optimization approach combines an evolutionary algorithm and classical mathematical programming to design resilient and sustainable global manufacturing networks. Further, it makes use o…