Tootfinder

"I just want my life back!"
New from Chuck Tingle. This Summer don't stray too far from the standards track, lest you be…
Pounded in the Ass By the RFC Process
https://mailarchive.ietf.org/arch/msg/dane/JPY1_4_KFznrh_sAPUvQc2ig9Cs/

A Careful Examination of Large Behavior Models for Multitask Dexterous Manipulation
TRI LBM Team, Jose Barreiros, Andrew Beaulieu, Aditya Bhat, Rick Cory, Eric Cousineau, Hongkai Dai, Ching-Hsin Fang, Kunimatsu Hashimoto, Muhammad Zubair Irshad, Masha Itkina, Naveen Kuppuswamy, Kuan-Hui Lee, Katherine Liu, Dale McConachie, Ian McMahon, Haruki Nishimura, Calder Phillips-Grafflin, Charles Richter, Paarth Shah, Krishnan Srinivasan, Blake Wulfe, Chen Xu, Mengchao Zhang, Alex Alspach, Maya …

A Careful Examination of Large Behavior Models for Multitask Dexterous Manipulation
Robot manipulation has seen tremendous progress in recent years, with imitation learning policies enabling successful performance of dexterous and hard-to-model tasks. Concurrently, scaling data and model size has led to the development of capable language and vision foundation models, motivating large-scale efforts to create general-purpose robot foundation models. While these models have garnered significant enthusiasm and investment, meaningful evaluation of real-world performance remains a …

Investigating the Robustness of Retrieval-Augmented Generation at the Query Level
Sezen Per\c{c}in, Xin Su, Qutub Sha Syed, Phillip Howard, Aleksei Kuvshinov, Leo Schwinn, Kay-Ulrich Scholl
https://arxiv.org/abs/2507.06956

Investigating the Robustness of Retrieval-Augmented Generation at the Query Level
Large language models (LLMs) are very costly and inefficient to update with new information. To address this limitation, retrieval-augmented generation (RAG) has been proposed as a solution that dynamically incorporates external knowledge during inference, improving factual consistency and reducing hallucinations. Despite its promise, RAG systems face practical challenges-most notably, a strong dependence on the quality of the input query for accurate retrieval. In this paper, we investigate th…

Replaced article(s) found for physics.geo-ph. https://arxiv.org/list/physics.geo-ph/new
[1/1]:
- Lie Group Theory of Multipole Moments and Shape of Stationary Rotating Fluid Bodies
Sergei M. Kopeikin (University of Missouri-Columbia, USA)

Cross-Dataset Semantic Segmentation Performance Analysis: Unifying NIST Point Cloud City Datasets for 3D Deep Learning
Alexander Nikitas Dimopoulos, Joseph Grasso
https://arxiv.org/abs/2508.00822

Cross-Dataset Semantic Segmentation Performance Analysis: Unifying NIST Point Cloud City Datasets for 3D Deep Learning
This study analyzes semantic segmentation performance across heterogeneously labeled point-cloud datasets relevant to public safety applications, including pre-incident planning systems derived from lidar scans. Using NIST's Point Cloud City dataset (Enfield and Memphis collections), we investigate challenges in unifying differently labeled 3D data. Our methodology employs a graded schema with the KPConv architecture, evaluating performance through IoU metrics on safety-relevant features. Resul…

First Contact: Data-driven Friction-Stir Process Control
James Koch, Ethan King, WoongJo Choi, Megan Ebers, David Garcia, Ken Ross, Keerti Kappagantula
https://arxiv.org/abs/2507.03177

First Contact: Data-driven Friction-Stir Process Control
This study validates the use of Neural Lumped Parameter Differential Equations for open-loop setpoint control of the plunge sequence in Friction Stir Processing (FSP). The approach integrates a data-driven framework with classical heat transfer techniques to predict tool temperatures, informing control strategies. By utilizing a trained Neural Lumped Parameter Differential Equation model, we translate theoretical predictions into practical set-point control, facilitating rapid attainment of des…

Fair Data Exchange with Constant-Time Proofs
Majid Khabbazian
https://arxiv.org/abs/2506.14944 https://arxiv.org/pdf/2506.14944

Fair Data Exchange with Constant-Time Proofs
The Fair Data Exchange (FDE) protocol introduced at CCS 2024 offers atomic pay-per-file transfers with constant-size proofs, but its prover and verifier runtimes still scale linearly with the file length n. We collapse these costs to essentially constant by viewing the file as a rate-1 Reed-Solomon (RS) codeword, extending it to a lower-rate RS code with constant redundancy, encrypting this extended vector, and then proving correctness for only a small random subset of the resulting ciphertexts…

Laser-Synthesized Amorphous PdSe$_{\mathrm{2-x}}$ Nanoparticles: A Defect-Rich Platform for High-Efficiency SERS, Photocatalysis, and Photothermal Conversion
Andrei Ushkov, Nadezhda Belozerova, Dmitriy Dyubo, Ilya Martynov, Alexander Syuy, Daniil Tselikov, Georgy Ermolaev, Sergey V. Bazhenov, Roman I. Romanov, Ivan Kruglov, Anton A. Popov, Alexander Chernov, Alexey D. Bolshakov, Sergey Novikov, Andrey A. Vyshnevyy, Aleksey Arsenin, Andrei V. Kabashin, Gleb I. Tselikov, Valentyn Volkov

Laser-Synthesized Amorphous PdSe$_{\mathrm{2-x}}$ Nanoparticles: A Defect-Rich Platform for High-Efficiency SERS, Photocatalysis, and Photothermal Conversion
The control of material properties at the atomic scale remains a central challenge in materials science. Transition metal dichalcogenides (TMDCs) offer remarkable electronic and optical properties, but their functionality is largely dictated by their stable crystalline phases. Here we demonstrate a single-step, ligand-free strategy using femtosecond laser ablation in liquid to transform crystalline, stoichiometric palladium diselenide (PdSe$_{\mathrm{2}}$) into highly stable, amorphous, and non…

Rund um den #Jordansprudel im #Audi!
Der Grund, warum er überhaupt so weit gekommen ist, sind die nicht wieder an Ort und Stelle verbrachten #Poller im Weg. Gerne werden die von Stadtwerken u…

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
Kartik Anand, Kabgyun Jeong, Junseo Lee
https://arxiv.org/abs/2506.19792

Collapses in quantum-classical probabilistically checkable proofs and the quantum polynomial hierarchy
We investigate structural properties of quantum proof systems by establishing collapse results that uncover simplifications in their complexity landscape. We extend classical results such as the Karp-Lipton theorem to quantum polynomial hierarchy with quantum proofs and establish uniqueness preservation for quantum-classical probabilistically checkable proof systems. Our main contributions are threefold. First, we prove that restricting quantum-classical PCP systems to uniqueness does not red…