Tootfinder

Benchmarking Optimization Algorithms for Automated Calibration of Quantum Devices
Kevin Pack, Shai Machnes, Frank K. Wilhelm
https://arxiv.org/abs/2509.08555 https://

Benchmarking Optimization Algorithms for Automated Calibration of Quantum Devices
We present the results of a comprehensive study of optimization algorithms for the calibration of quantum devices. As part of our ongoing efforts to automate bring-up, tune-up, and system identification procedures, we investigate a broad range of optimizers within a simulated environment designed to closely mimic the challenges of real-world experimental conditions. Our benchmark includes widely used algorithms such as Nelder-Mead and the state-of-the-art Covariance Matrix Adaptation Evolution …

The LHCb Stripping Project: Sustainable Legacy Data Processing for High-Energy Physics
Nathan Grieser, Eduardo Rodrigues, Niladri Sahoo, Shuqi Sheng, Nicole Skidmore, Mark Smith
https://arxiv.org/abs/2509.05294

The LHCb Stripping Project: Sustainable Legacy Data Processing for High-Energy Physics
The LHCb Stripping project is a pivotal component of the experiment's data processing framework, designed to refine vast volumes of collision data into manageable samples for offline analysis. It ensures the re-analysis of Runs 1 and 2 legacy data, maintains the software stack, and executes (re-)Stripping campaigns. As the focus shifts toward newer data sets, the project continues to optimize infrastructure for both legacy and live data processing. This paper provides a comprehensive overview o…

Aus unserem Kiez der Woche. Etwas versteckt am Pankeweg auf Höhe Schönwalder Straße steht ein Gedenkstein für die Weddinger Partnerstadt Bottrop.
https://weddingweiser.de/zwei-glanzlose-partnerstaedte-des-wedding/

Rosen sind rot, Maskendeals grau,
Spahn sagt: »Ich wusste von nix, ganz genau!«
Die Villa war günstig, ganz ohne Verstand –

Süßer Laptop: Das ist mal eine originelle #Verpackung für #Schokolade. Zum Glück ist selbige nicht so alt wie das gezeigte User Interface MacOS 9 mit zeitgenössischer Website🙈
#Geschenk

Channel Estimation and Data Detection in DS-Spread Channels: A Unified Framework, Novel Algorithms, and Waveform Comparison
Niladri Halder, Chandra R. Murthy
https://arxiv.org/abs/2508.21373

Channel Estimation and Data Detection in DS-Spread Channels: A Unified Framework, Novel Algorithms, and Waveform Comparison
We present a unified receiver processing framework for communication over delay-scale (DS)-spread channels that arise in underwater acoustic (UWA) communications that addresses both channel estimation (CE) and data detection for different modulation waveforms, namely OFDM, OTFS, OCDM, and ODSS, through a common input--output relation. Using this framework, we conduct a fair and comprehensive comparative study of these waveforms under DS-spread UWA channels and similar receiver complexities. W…

Experimentally-Driven Analysis of Stability in Connected Vehicle Platooning: Insights and Control Strategies
Niladri Dutta, Elham Abolfazli, Themistoklis Charalambous
https://arxiv.org/abs/2507.23078

Experimentally-Driven Analysis of Stability in Connected Vehicle Platooning: Insights and Control Strategies
This paper presents the development of a tangible platform for demonstrating the practical implementation of cooperative adaptive cruise control (CACC) systems, an enhancement to the standard adaptive cruise control (ACC) concept by means of Vehicle-to-Everything (V2X) communication. It involves a detailed examination of existing longitudinal controllers and their performance in homogeneous vehicle platoons. Moreover, extensive tests are conducted using multiple autonomous experimental vehicle …

Reducing the complexity of computing the values of a Nash equilibrium
Debtoru Chatterjee, Girish Tiwari, Niladri Chatterjee
https://arxiv.org/abs/2507.22819 https://

Reducing the complexity of computing the values of a Nash equilibrium
The Colonel Blotto game, formulated by Emile Borel, involves players allocating limited resources to multiple battlefields simultaneously, with the winner being the one who allocates more resources to each battlefield. Computation of the Nash equilibrium, including of two person, zero sum, mixed strategy Colonel Blotto games have encountered issues of scalability and complexity owing to their PPAD completeness. This paper proposes an algorithm that computes the same value as the Nash equilibriu…

On random bipartite graphs evolving by degrees
Neeladri Maitra
https://arxiv.org/abs/2509.23943 https://arxiv.org/pdf/2509.23943

On random bipartite graphs evolving by degrees
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $α$ and $β$. The graph evolves starting from $B_0$, the empty graph (with only isolated vertices). Given $B_t$, a non-adjacent vertex pair $u \in {L}, v \in {R}$ is sampled with probability proportional to $(d_u(t)+α)(d_v(t)+β)$, and the edge $\{u,v\}$ is included to $…

Sharp Online Hardness for Large Balanced Independent Sets
Abhishek Dhawan, Eren C. K{\i}z{\i}lda\u{g}, Neeladri Maitra
https://arxiv.org/abs/2508.20785 https://

Sharp Online Hardness for Large Balanced Independent Sets
We study the algorithmic problem of finding large $γ$-balanced independent sets in dense random bipartite graphs; an independent set is $γ$-balanced if a $γ$ proportion of its vertices lie on one side of the bipartition. In the sparse regime, Perkins and Wang established tight bounds within the low-degree polynomial (LDP) framework, showing a factor-$1/(1-γ)$ statistical-computational gap via the Overlap Gap Property (OGP) framework tailored for stable algorithms. However, these techniques …