Search

In this paper, we present a realisation of an on chip atomic clock using a cold cloud of Rubidium 87 atoms. This clock is based on a Ramsey interferometer with a Ramsey time around 600 ms. This is realized with large lab temperature drift during the measurement (few degrees per day) and without magnetic field shielding. We review the experimental implementation of this clock and give a full study of the known noises present in this atomic clock., Comment: 17 pages, 11 figures

''Positive geometries'' are a class of semi-algebraic domains which admit a unique ''canonical form'': a logarithmic form whose residues match the boundary structure of the domain. The study of such geometries is motivated by recent progress in particle physics, where the corresponding canonical forms are interpreted as the integrands of scattering amplitudes. We recast these concepts in the language of mixed Hodge theory, and identify ''genus zero pairs'' of complex algebraic varieties as a natural and general framework for the study of positive geometries and their canonical forms. In this framework, we prove some basic properties of canonical forms which have previously been proved or conjectured in the literature. We give many examples and study in detail the case of arrangements of hyperplanes and convex polytopes., Comment: 51 pages, 11 figures

Computer-Aided Design (CAD) models are typically constructed by sequentially drawing parametric sketches and applying CAD operations to obtain a 3D model. The problem of 3D CAD reverse engineering consists of reconstructing the sketch and CAD operation sequences from 3D representations such as point clouds. In this paper, we address this challenge through novel contributions across three levels: CAD sequence representation, network design, and dataset. In particular, we represent CAD sketch-extrude sequences as Python code. The proposed CAD-Recode translates a point cloud into Python code that, when executed, reconstructs the CAD model. Taking advantage of the exposure of pre-trained Large Language Models (LLMs) to Python code, we leverage a relatively small LLM as a decoder for CAD-Recode and combine it with a lightweight point cloud projector. CAD-Recode is trained solely on a proposed synthetic dataset of one million diverse CAD sequences. CAD-Recode significantly outperforms existing methods across three datasets while requiring fewer input points. Notably, it achieves 10 times lower mean Chamfer distance than state-of-the-art methods on DeepCAD and Fusion360 datasets. Furthermore, we show that our CAD Python code output is interpretable by off-the-shelf LLMs, enabling CAD editing and CAD-specific question answering from point clouds.

Eradicating extreme poverty and inequality are the key leverage points to achieve the seventeen Sustainable Development goals. Yet, the reduction in extreme poverty and inequality are vulnerable to shocks such as the pandemic and climate change. We find that that these vulnerabilities emerge from the interaction between individual and institutional mechanisms. Individual characteristics like risk aversion, attention, and saving propensity can lead to sub-optimal diversification and low capital accumulation. These individual drivers are reinforced by institutional mechanisms such as lack of financial inclusion, access to technology, and economic segregation, leading to persistent inequality and poverty traps. Our experiments demonstrate that addressing above factors yields 'double dividend' - reducing poverty and inequality within-and-between communities and create positive feedback that can withstand shocks.

The design of fast reactors burning MOX fuels requires accurate capture and fission cross sections. For the particular case of neutron capture on 242Pu, the NEA recommends that an accuracy of 8-12% should be achieved in the fast energy region (2 keV-500 keV) compared to their estimation of 35% for the current uncertainty. Integral irradiation experiments suggest that the evaluated cross section of the JEFF-3.1 library overestimates the 242Pu(n,{\gamma}) cross section by 14% in the range between 1 keV and 1 MeV. In addition, the last measurement at LANSCE reported a systematic reduction of 20-30% in the 1-40 keV range relative to the evaluated libraries and previous data sets. In the present work this cross section has been determined up to 600 keV in order to solve the mentioned discrepancies. A 242Pu target of 95(4) mg enriched to 99.959% was irradiated at the n TOF-EAR1 facility at CERN. The capture cross section of 242Pu has been obtained between 1 and 600 keV with a systematic uncertainty (dominated by background subtraction) between 8 and 12%, reducing the current uncertainties of 35% and achieving the accuracy requested by the NEA in a large energy range. The shape of the cross section has been analyzed in terms of average resonance parameters using the FITACS code as implemented in SAMMY, yielding results compatible with our recent analysis of the resolved resonance region.The results are in good agreement with the data of Wisshak and K\"appeler and on average 10-14% below JEFF-3.2 from 1 to 250 keV, which helps to achieve consistency between integral experiments and cross section data. At higher energies our results show a reasonable agreement within uncertainties with both ENDF/B-VII.1 and JEFF-3.2. Our results indicate that the last experiment from DANCE underestimates the capture cross section of 242Pu by as much as 40% above a few keV., Comment: 20 pages, 19 figures, submitted to Phys. Rev. C

Inspired by the success of generative image models, recent work on learned image compression increasingly focuses on better probabilistic models of the natural image distribution, leading to excellent image quality. This, however, comes at the expense of a computational complexity that is several orders of magnitude higher than today's commercial codecs, and thus prohibitive for most practical applications. With this paper, we demonstrate that by focusing on modeling visual perception rather than the data distribution, we can achieve a very good trade-off between visual quality and bit rate similar to "generative" compression models such as HiFiC, while requiring less than 1% of the multiply-accumulate operations (MACs) for decompression. We do this by optimizing C3, an overfitted image codec, for Wasserstein Distortion (WD), and evaluating the image reconstructions with a human rater study. The study also reveals that WD outperforms other perceptual quality metrics such as LPIPS, DISTS, and MS-SSIM, both as an optimization objective and as a predictor of human ratings, achieving over 94% Pearson correlation with Elo scores., Comment: 13 pages, 9 figures. Submitted to CVPR 2025

Challenging neutron-capture cross-section measurements of small cross sections and samples with a very limited number of atoms require high-flux time-of-flight facilities. In turn, such facilities need innovative detection setups that are fast, have low sensitivity to neutrons, can quickly recover from the so-called $\gamma$-flash, and offer the highest possible detection sensitivity. In this paper, we present several steps toward such advanced systems. Specifically, we describe the performance of a high-sensitivity experimental setup at CERN n\_TOF EAR2. It consists of nine sTED detector modules in a compact cylindrical configuration, two conventional used large-volume C$_{6}$D$_{6}$ detectors, and one LaCl$_{3}$(Ce) detector. The performance of these detection systems is compared using $^{93}$Nb($n$,$\gamma$) data. We also developed a detailed \textsc{Geant4} Monte Carlo model of the experimental EAR2 setup, which allows for a better understanding of the detector features, including their efficiency determination. This Monte Carlo model has been used for further optimization, thus leading to a new conceptual design of a $\gamma$ detector array, STAR, based on a deuterated-stilbene crystal array. Finally, the suitability of deuterated-stilbene crystals for the future STAR array is investigaged experimentally utilizing a small stilbene-d12 prototype. The results suggest a similar or superior performance of STAR with respect to other setups based on liquid-scintillators, and allow for additional features such as neutron-gamma discrimination and a higher level of customization capability.

Hidden Markov models (HMMs) are a versatile statistical framework commonly used in ecology to characterize behavioural patterns from animal movement data. In HMMs, the observed data depend on a finite number of underlying hidden states, generally interpreted as the animal's unobserved behaviour. The number of states is a crucial parameter, controlling the trade-off between ecological interpretability of behaviours (fewer states) and the goodness of fit of the model (more states). Selecting the number of states, commonly referred to as order selection, is notoriously challenging. Common model selection metrics, such as AIC and BIC, often perform poorly in determining the number of states, particularly when models are misspecified. Building on existing methods for HMMs and mixture models, we propose a double penalized likelihood maximum estimate (DPMLE) for the simultaneous estimation of the number of states and parameters of non-stationary HMMs. The DPMLE differs from traditional information criteria by using two penalty functions on the stationary probabilities and state-dependent parameters. For non-stationary HMMs, forward and backward probabilities are used to approximate stationary probabilities. Using a simulation study that includes scenarios with additional complexity in the data, we compare the performance of our method with that of AIC and BIC. We also illustrate how the DPMLE differs from AIC and BIC using narwhal (Monodon monoceros) movement data. The proposed method outperformed AIC and BIC in identifying the correct number of states under model misspecification. Furthermore, its capacity to handle non-stationary dynamics allowed for more realistic modeling of complex movement data, offering deeper insights into narwhal behaviour. Our method is a powerful tool for order selection in non-stationary HMMs, with potential applications extending beyond the field of ecology., Comment: Double-spaced, 35 pages, 5 figures

In the context of particle therapy monitoring, we are developing a gamma-ray detector to determine the ion range in vivo from the measurement of particle time-of-flight. For this application, a beam monitor capable to tag in time the incident ion with a time resolution below 235 ps FWHM (100 ps rms) is required to provide a start signal for the acquisition. We have therefore developed a dedicated detector based on a fast organic scintillator (EJ-204) of 25x25x1 mm3 coupled to four SiPM strips that allow measuring the particle incident position by scintillation light sharing. The prototype was characterised with single protons of energies between 63 and 225 MeV at the MEDICYC and ProteusONE facilities of the Antoine Lacassagne proton therapy centre in Nice. We obtained a time resolution of 120 ps FWHM at 63 MeV, and a spatial resolution of ~2 mm rms for single particles. Two identical detectors also allowed to measure the MEDICYC proton energy with 0.3% accuracy.

The onset of neural induction in the anterior ectoderm of ascidian embryos is regulated at the extracellular level by FGF signaling molecules, which control the acquisition of neural fate through the activation of the ERK pathway. Among the anterior ectoderm cells exposed to FGF, only a fraction will acquire neural fate. The selection of neural precursors depends on the quasi-invariant geometry of the embryo, which imposes upon each ectoderm cell a precise area of cell surface contact with underlying FGF-expressing (mesendoderm) cells. Here, we investigate information transmission between FGF and activated ERK and how this depends on the geometry of the system. Optimizing information transmission with the constraint that the total FGF-emitting surface area is restricted, as in the embryo, we find that the surface contacts with FGF that maximize information transmission are close to those observed experimentally. This information optimal solution is compatible with the anterior ectoderm cells having different areas of cell surface exposure to FGF, allowing the embryo to use cell surface areas as a regulatory mechanism for differentiating the outcome of cells that sense a constant FGF concentration.

This paper introduces a novel magnetic navigation system for cardiac ablation. The system is formed from two key elements: a magnetic ablation catheter consisting of a chain of spherical permanent magnets; and an actuation system comprised of two cart-mounted permanent magnets undergoing pure rotation. The catheter design enables a large magnetic content with the goal of minimizing the footprint of the actuation system for easier integration with the clinical workflow. We present a quasi-static model of the catheter, the design of the actuation units, and their control modalities. Experimental validation shows that we can use small rotating magnets (119mm diameter) to reach cardiac ablation targets while generating clinically-relevant forces. Catheter control using a joystick is compared with manual catheter control. blue While total task completion time is similar, smoother navigation is observed using the proposed robotic system. We also demonstrate that the ball chain can ablate heart tissue and generate lesions comparable to the current clinical ablation catheters., Comment: in IEEE Transactions on Medical Robotics and Bionics, 2024

Shape sensing of medical continuum robots is important both for closed-loop control as well as for enabling the clinician to visualize the robot inside the body. There is a need for inexpensive, but accurate shape sensing technologies. This paper proposes the use of magnetic ball chains as a means of generating shape-specific magnetic fields that can be detected by an external array of Hall effect sensors. Such a ball chain, encased in a flexible polymer sleeve, could be inserted inside the lumen of any continuum robot to provide real-time shape feedback. The sleeve could be removed, as needed, during the procedure to enable use of the entire lumen. To investigate this approach, a shape-sensing model for a steerable catheter tip is derived and an observability and sensitivity analysis are presented. Experiments show maximum estimation errors of 7.1% and mean of 2.9% of the tip position with respect to total length.

Spin-based semiconductor qubits hold promise for scalable quantum computing, yet they require reliable autonomous calibration procedures. This study presents an experimental demonstration of online single-dot charge autotuning using a convolutional neural network integrated into a closed-loop calibration system. The autotuning algorithm explores the gates' voltage space to localize charge transition lines, thereby isolating the one-electron regime without human intervention. In 20 experimental runs on a device cooled to 25mK, the method achieved a success rate of 95% in locating the target electron regime, highlighting the robustness of this method against noise and distribution shifts from the offline training set. Each tuning run lasted an average of 2 hours and 9 minutes, primarily due to the limited speed of the current measurement. This work validates the feasibility of machine learning-driven real-time charge autotuning for quantum dot devices, advancing the development toward the control of large qubit arrays., Comment: 6 pages (main) + 5 pages (supplementary)

It is well known that the golden ratio $\phi$ is the ''most irrational'' number in the sense that its best rational approximations $s/t$ have error $\sim 1/(\sqrt{5} t^2)$ and this constant $\sqrt{5}$ is as low as possible. Given a prime $p$, how can we characterize the reals $x$ such that $x$ and $p x$ are both ''very irrational''? This is tantamount to finding the lowest point of the $p$-Lagrange spectrum $\mathcal{L}_p$ as previously defined by the third author. We describe an algorithm using Raney transducers that computes $\min \mathcal{L}_p$ if it terminates, which we conjecture it always does. We verify that $\min \mathcal{L}_p$ is the square root of a rational number for primes $p < 2000$. Mysteriously, the highest values of $\min \mathcal{L}_p$ occur for the Heegner primes $67$, $3$, and $163$, and for all $p$, the continued fractions of the corresponding very irrational numbers $x$ and $p x$ are in one of three symmetric relations.

Large language models (LLMs) show remarkable potential to act as computer agents, enhancing human productivity and software accessibility in multi-modal tasks that require planning and reasoning. However, measuring agent performance in realistic environments remains a challenge since: (i) most benchmarks are limited to specific modalities or domains (e.g. text-only, web navigation, Q&A, coding) and (ii) full benchmark evaluations are slow (on order of magnitude of days) given the multi-step sequential nature of tasks. To address these challenges, we introduce the Windows Agent Arena: a reproducible, general environment focusing exclusively on the Windows operating system (OS) where agents can operate freely within a real Windows OS and use the same wide range of applications, tools, and web browsers available to human users when solving tasks. We adapt the OSWorld framework (Xie et al., 2024) to create 150+ diverse Windows tasks across representative domains that require agent abilities in planning, screen understanding, and tool usage. Our benchmark is scalable and can be seamlessly parallelized in Azure for a full benchmark evaluation in as little as 20 minutes. To demonstrate Windows Agent Arena's capabilities, we also introduce a new multi-modal agent, Navi. Our agent achieves a success rate of 19.5% in the Windows domain, compared to 74.5% performance of an unassisted human. Navi also demonstrates strong performance on another popular web-based benchmark, Mind2Web. We offer extensive quantitative and qualitative analysis of Navi's performance, and provide insights into the opportunities for future research in agent development and data generation using Windows Agent Arena. Webpage: https://microsoft.github.io/WindowsAgentArena Code: https://github.com/microsoft/WindowsAgentArena

The overuse of antibiotics has become a major global concern due to its role in diminishing treatment effectiveness and positively selecting antibiotic-resistant bacterial strains. This issue is particularly important in the beef cattle sector, where Bovine Respiratory Diseases (BRD) impose significant economic and welfare burdens. BRD are complex, multifactorial conditions primarily affecting young calves and feedlot cattle, caused by a combination of viral and bacterial pathogens, environmental factors, and stressors. Despite efforts to reduce antimicrobial use (AMU), the cattle production system remains heavily reliant on antibiotics to control BRD, often through the implementation of collective treatments to prevent outbreaks. This study aimed at evaluating the impact of various treatment practices on the spread of BRD, specifically focusing on criteria for implementing collective treatments. Using a mechanistic stochastic model, we simulated the spread of \textit{Mannheimia haemolytica} in a multi-pen fattening operation under sixteen different scenarios, considering pen composition, individual risk levels, and treatment strategies. Our findings suggest that an alternative criterion for collective treatments based on the speed of the disease spread, could reduce BRD incidence and AMU more effectively than conventional methods. This research highlights the importance of responsible treatment practices and the potential benefits of novel criteria for collective treatment strategies in improving animal health. Moreover, it emphasizes the need for transparency on the exposure to risk factors along the production chain., Comment: 22 pages, 10 figures

We develop the theory of ``virtual morphisms'' in logarithmic algebraic geometry, introduced by Howell. It allows one to give algebro-geometric meaning to various useful maps of topological spaces that do not correspond to morphisms of (log) schemes in the classical sense, while retaining functoriality of key constructions. In particular, we explain how virtual morphisms provide a natural categorical home for Deligne's theory of tangential basepoints: the latter are simply the virtual morphisms from a point. We also extend Howell's results on the functoriality of Betti and de Rham cohomology. Using this framework, we lift the topological operad of little $2$-disks to an operad in log schemes over the integers, whose virtual points are isomorphism classes of stable marked curves of genus zero equipped with a tangential basepoint. The gluing of such curves along marked points is performed using virtual morphisms that transport tangential basepoints around the curves. This builds on Vaintrob's analogous construction for framed little disks, for which the classical notion of morphism in logarithmic geometry sufficed. In this way, we obtain a direct algebro-geometric proof of the formality of the little disks operad, following the strategy envisioned by Beilinson. Furthermore, Bar-Natan's parenthesized braids naturally appear as the fundamental groupoids of our moduli spaces, with all virtual basepoints defined over the integers., Comment: 55 pages, 4 figures, comments welcome

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Unconstrained Binary Optimization (QUBO) problems. However, the existing quantum processing units (QPUs) are relatively small, and canonical mappings of QUBO via the Ising model require one qubit per variable, rendering direct large-scale optimization infeasible. In classical optimization, a general strategy for addressing many large-scale problems is via multilevel/multigrid methods, where the large target problem is iteratively coarsened, and the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentally test how existing QPUs perform as a sub-solver within such a multilevel strategy. We combine and extend (via additional classical processing) the recent Noise-Directed Adaptive Remapping (NDAR) and Quantum Relax $\&$ Round (QRR) algorithms. We first demonstrate the effectiveness of our heuristic extensions on Rigetti's transmon device Ankaa-2. We find approximate solutions to $10$ instances of fully connected $82$-qubit Sherrington-Kirkpatrick graphs with random integer-valued coefficients obtaining normalized approximation ratios (ARs) in the range $\sim 0.98-1.0$, and the same class with real-valued coefficients (ARs $\sim 0.94-1.0$). Then, we implement the extended NDAR and QRR algorithms as subsolvers in the multilevel algorithm for $6$ large-scale graphs with at most $\sim 27,000$ variables. The QPU (with classical post-processing steps) is used to find approximate solutions to dozens of problems, at most $82$-qubit, which are iteratively used to construct the global solution. We observe that quantum optimization results are competitive regarding the quality of solutions compared to classical heuristics used as subsolvers within the multilevel approach., Comment: 7+3 pages; 6+0 figures; 2+0 tables; comments and suggestions are welcome!

Quantum optimization solvers typically rely on one-variable-to-one-qubit mapping. However, the low qubit count on current quantum computers is a major obstacle in competing against classical methods. Here, we develop a qubit-efficient algorithm that overcomes this limitation by mapping a candidate bit string solution to an entangled wave function of fewer qubits. We propose a variational quantum circuit generalizing the quantum approximate optimization ansatz (QAOA). Extremizing the ansatz for Sherrington-Kirkpatrick spin glass problems, we show valuable properties such as the concentration of ansatz parameters and derive performance guarantees. This approach could benefit near-term intermediate-scale and future fault-tolerant small-scale quantum devices., Comment: 4 pages, 4 figures + 8 pages of supplementary material

3D reverse engineering, in which a CAD model is inferred given a 3D scan of a physical object, is a research direction that offers many promising practical applications. This paper proposes TransCAD, an end-to-end transformer-based architecture that predicts the CAD sequence from a point cloud. TransCAD leverages the structure of CAD sequences by using a hierarchical learning strategy. A loop refiner is also introduced to regress sketch primitive parameters. Rigorous experimentation on the DeepCAD and Fusion360 datasets show that TransCAD achieves state-of-the-art results. The result analysis is supported with a proposed metric for CAD sequence, the mean Average Precision of CAD Sequence, that addresses the limitations of existing metrics.

The $^{246}$Cm(n,$\gamma$) and $^{248}$Cm(n,$\gamma$) cross-sections have been measured at the Experimental Area 2 (EAR2) of the n_TOF facility at CERN with three C$_6$D$_6$ detectors. This measurement is part of a collective effort to improve the capture cross-section data for Minor Actinides (MAs), which are required to estimate the production and transmutation rates of these isotopes in light water reactors and innovative reactor systems. In particular, the neutron capture in $^{246}$Cm and $^{248}$Cm open the path for the formation of other Cm isotopes and heavier elements such as Bk and Cf and the knowledge of (n,$\gamma$) cross-sections of these Cm isotopes plays an important role in the transport, transmutation and storage of the spent nuclear fuel. The reactions $^{246}$Cm(n,$\gamma$) and $^{248}$Cm(n,$\gamma$) have been the two first capture measurements analyzed at n_TOF EAR2. Until this experiment and two recent measurements performed at J-PARC, there was only one set of data of the capture cross-sections of $^{246}$Cm and $^{248}$Cm, that was obtained in 1969 in an underground nuclear explosion experiment. In the measurement at n_TOF a total of 13 resonances of $^{246}$Cm between 4 and 400 eV and 5 of $^{248}$Cm between 7 and 100 eV have been identified and fitted. The radiative kernels obtained for $^{246}$Cm are compatible with JENDL-5, but some of them are not with JENDL-4, which has been adopted by JEFF-3.3 and ENDF/B-VIII.0. The radiative kernels obtained for the first three $^{248}$Cm resonances are compatible with JENDL-5, however, the other two are not compatible with any other evaluation and are 20% and 60% larger than JENDL-5.

We have developed a minimal model of a swimmer without body deformation based on force and torque dipoles which allows accurate 3D Navier-Stokes calculations. Our model can reproduce swimmer propulsion for a large range of Reynolds numbers, and generate wake vortices in the inertial regime, reminiscent of the flow generated by the flapping tails of real fish. We performed a numerical exploration of the model from low to high Reynolds numbers and obtained universal laws using scaling arguments. We collected data from a wide variety of micro-organisms, thereby extending the experimental data presented in (M. Gazzola et al., Nature Physics 10, 758, 2014). Our theoretical scaling laws compare very well with experimental data across the different regimes, from Stokes to turbulent flows. We believe that this model, due to its relatively simple design, will be very useful for obtaining numerical simulations of collective effects within fish schools composed of hundreds of individuals.

This study presents a machine-learning-based procedure to automate the charge tuning of semiconductor spin qubits with minimal human intervention, addressing one of the significant challenges in scaling up quantum dot technologies. This method exploits artificial neural networks to identify noisy transition lines in stability diagrams, guiding a robust exploration strategy leveraging neural networks' uncertainty estimations. Tested across three distinct offline experimental datasets representing different single quantum dot technologies, the approach achieves over 99% tuning success rate in optimal cases, where more than 10% of the success is directly attributable to uncertainty exploitation. The challenging constraints of small training sets containing high diagram-to-diagram variability allowed us to evaluate the capabilities and limits of the proposed procedure., Comment: 12 pages (main) + 14 pages (supplementary)