Search

A class of acyclic digraphs $\mathscr{C}$ is linearly unavoidable if there exists a constant $c$ such that every digraph $D\in \mathscr{C}$ is contained in all tournaments of order $c\cdot |V(D)|$. The class of all acyclic digraphs is not linearly avoidable, and Fox, He, and Widgerson recently showed that this is not even the case for acyclic digraphs with bounded maximum degree. On the positive side, Thomason and H\"aggkvist proved that the class of oriented trees is linearly unavoidable. In this work, we generalize this result to acyclic digraphs obtained from an oriented tree by adding at most $k$ vertices, and $k$-blow-ups of oriented trees, for every fixed integer $k$. More precisely, we show that if $D$ is obtained from an oriented tree $F$ of order $n$ by adding $k$ universal vertices, then $D$ is contained in every tournament of order $2\cdot 3^{(k+1)(2k+1)} \cdot n$; and if $D$ is obtained from $F$ by replacing each vertex $u$ by an independent set $X_u$ of size $k$ and every arc $uv$ by all possible arcs from $X_u$ to $X_v$, then $D$ is contained in every tournament of order $2^{10+18k}k \cdot n$.

We present measurements of the microlensing optical depth and event rate toward the Galactic bulge using the dataset from the 2006--2014 MOA-II survey, which covers 22 bulge fields spanning ~42 deg^2 between -5 deg < l < 10 deg and -7 deg < b < -1 deg. In the central region with |l|<5 deg, we estimate an optical depth of {\tau} = [1.75+-0.04]*10^-6exp[(0.34+-0.02)(3 deg-|b|)] and an event rate of {\Gamma} = [16.08+-0.28]*10^-6exp[(0.44+-0.02)(3 deg-|b|)] star^-1 year^-1 using a sample consisting of 3525 microlensing events, with Einstein radius crossing times of tE < 760 days and source star magnitude of IsWe confirm our results are consistent with the latest measurements from OGLE-IV 8 year dataset (Mr\'oz et al. 2019). We find our result is inconsistent with a prediction based on Galactic models, especially in the central region with |b|<3 deg. These results can be used to improve the Galactic bulge model, and more central regions can be further elucidated by future microlensing experiments, such as The PRime-focus Infrared Microlensing Experiment (PRIME) and Nancy Grace Roman Space Telescope.

Earth remains the only known example of a planet with technology, and future projections of Earth's trajectory provide a basis and motivation for approaching the search for extraterrestrial technospheres. Conventional approaches toward projecting Earth's technosphere include applications of the Kardashev scale, which suggest the possibility that energy-intensive civilizations may expand to harness the entire energy output available to their planet, host star, or even the entire galaxy. In this study, we argue that the Kardashev scale is better understood as a "luminosity limit" that describes the maximum capacity for a civilization to harvest luminous stellar energy across a given spatial domain, and we note that thermodynamic efficiency will always keep a luminosity-limited technosphere from actually reaching this theoretical limit. We suggest the possibility that an advanced technosphere might evolve beyond this luminosity limit to draw its energy directly from harvesting stellar mass, and we also discuss possible trajectories that could exist between Earth today and such hypothetical "stellivores." We develop a framework to describe trajectories for long-lived technospheres that optimize their growth strategies between exploration and exploitation, unlike Earth today. We note that analyses of compact accreting stars could provide ways to test the stellivore hypothesis, and we more broadly suggest an expansion of technosignature search strategies beyond those that reside exactly at the luminosity limit., Comment: Submitted to Acta Astronautica

Uncloneable encryption is a cryptographic primitive which encrypts a classical message into a quantum ciphertext, such that two quantum adversaries are limited in their capacity of being able to simultaneously decrypt, given the key and quantum side-information produced from the ciphertext. Since its initial proposal and scheme in the random oracle model by Broadbent and Lord [TQC 2020], uncloneable encryption has developed into an important primitive at the foundation of quantum uncloneability for cryptographic primitives. Despite sustained efforts, however, the question of unconditional uncloneable encryption (and in particular of the simplest case, called an uncloneable bit) has remained elusive. Here, we propose a candidate for the unconditional uncloneable bit problem, and provide strong evidence that the adversary's success probability in the related security game converges quadratically as ${1}/{2}+{1}/{(2\sqrt{K})}$, where $K$ represents the number of keys and ${1}/{2}$ is trivially achievable. We prove this bound's validity for $K$ ranging from $2$ to $7$ and demonstrate the validity up to $K = 17$ using computations based on the NPA hierarchy. We furthemore provide compelling heuristic evidence towards the general case. In addition, we prove an asymptotic upper bound of ${5}/{8}$ and give a numerical upper bound of $\sim 0.5980$, which to our knowledge is the best-known value in the unconditional model.

Air pollution is a pressing environmental risk to public health, particularly in cities where population density and pollution levels are high. Traditional methods for exposure analysis often rely on census data, but recent studies highlight the impact of daily mobility on individuals' exposure. Here, we develop a methodology to determine unprecedented pedestrian exposure estimates at the city scale by combining sidewalk pedestrian flows with high-resolution (25 m x 25 m) NO2 data from bias-corrected predictions of the air quality system CALIOPE-Urban. Applied to Barcelona (Spain) for the year 2019, we show that pedestrian flow and NO2 levels exhibit negligible temporal correlation. While short-term (hourly) exposure is driven by pedestrian mobility, long-term (monthly) exposure is dominated by NO2 patterns. We identify strong spatial gradients of exposure, highlighting the importance for high-resolution solutions at the sidewalks scale. Finally, we determine that exposure mitigation strategies should consider different citizen subgroups based on their mobility and preferred routes, as significant differences were found between residential and pedestrian exposure. Our results provide exposure indicators designed for city planners and policymakers, helping to prioritize mitigation measures where and when they are most needed.

Reinforcement learning (RL) is a promising approach for aligning large language models (LLMs) knowledge with sequential decision-making tasks. However, few studies have thoroughly investigated the impact on LLM agents capabilities of fine-tuning them with RL in a specific environment. In this paper, we propose a novel framework to analyze the sensitivity of LLMs to prompt formulations following RL training in a textual environment. Our findings reveal that the performance of LLMs degrades when faced with prompt formulations different from those used during the RL training phase. Besides, we analyze the source of this sensitivity by examining the model's internal representations and salient tokens. Finally, we propose to use a contrastive loss to mitigate this sensitivity and improve the robustness and generalization capabilities of LLMs.

The spatial distribution of spurious dots in SiMOS single-electron transistors (SETs), fabricated on an industrial 300 mm process line, has been statistically analyzed. To have a deeper understanding of the origin of these spurious dots, we analyzed SETs with three different oxide thicknesses: 8 nm, 12 nm and 20 nm. By combining spurious dot triangulation cryo-measurement with simulations of strain, gate bias, and location of the electron wave function, we demonstrate that most spurious dots are formed through the combined effects of strain and gate bias, leading to variations in the conduction band energy. Despite the similar thermal expansion coefficients of polycrystalline silicon gates and single-crystalline silicon substrates, strain remains a crucial factor in spurious dots formation. This learning can be use to optimize the device design and the oxide thickness, to reduce the density of spurious dot while keeping quantum dot tunability., Comment: 10 pages, 9 figures

The Zirconium (Z = 40) isotopic chain has attracted interest for more than four decades. The abrupt lowering of the energy of the first $2^+$ state and the increase in the transition strength B(E2; $2_1^\rightarrow 0_1^+$ going from $^{98}$Zr to $^{100}$Zr has been the first example of "quantum phase transition" in nuclear shapes, which has few equivalents in the nuclear chart. Although a multitude of experiments have been performed to measure nuclear properties related to nuclear shapes and collectivity in the region, none of the measured lifetimes were obtained using the Recoil Distance Doppler Shift method in the $\gamma\gamma$-coincidence mode where a gate on the direct feeding transition of the state of interest allows a strict control of systematical errors. This work reports the results of lifetime measurements for the first yrast excited states in $^{98-104}$Zr carried out to extract reduced transition probabilities. The new lifetime values in $\gamma\gamma$-coincidence and $\gamma$-single mode are compared with the results of former experiments. Recent predictions of the Interacting Boson Model with Configuration Mixing, the Symmetry Conserving Configuration Mixing model based on the Hartree-Fock-Bogoliubov approach and the Monte Carlo Shell Model are presented and compared with the experimental data.

Fabrication of quantum processors in advanced 300 mm wafer-scale complementary metal-oxide-semiconductor (CMOS) foundries provides a unique scaling pathway towards commercially viable quantum computing with potentially millions of qubits on a single chip. Here, we show precise qubit operation of a silicon two-qubit device made in a 300 mm semiconductor processing line. The key metrics including single- and two-qubit control fidelities exceed 99% and state preparation and measurement fidelity exceeds 99.9%, as evidenced by gate set tomography (GST). We report coherence and lifetimes up to $T_\mathrm{2}^{\mathrm{*}} = 30.4$ $\mu$s, $T_\mathrm{2}^{\mathrm{Hahn}} = 803$ $\mu$s, and $T_1 = 6.3$ s. Crucially, the dominant operational errors originate from residual nuclear spin carrying isotopes, solvable with further isotopic purification, rather than charge noise arising from the dielectric environment. Our results answer the longstanding question whether the favourable properties including high-fidelity operation and long coherence times can be preserved when transitioning from a tailored academic to an industrial semiconductor fabrication technology., Comment: 10 pages, 4 figures, 4 extended data figures

Privacy and regulatory constraints make data generation vital to advancing machine learning without relying on real-world datasets. A leading approach for tabular data generation is the Forest Flow (FF) method, which combines Flow Matching with XGBoost. Despite its good performance, FF is slow and makes errors when treating categorical variables as one-hot continuous features. It is also highly sensitive to small changes in the initial conditions of the ordinary differential equation (ODE). To overcome these limitations, we develop Heterogeneous Sequential Feature Forest Flow (HS3F). Our method generates data sequentially (feature-by-feature), reducing the dependency on noisy initial conditions through the additional information from previously generated features. Furthermore, it generates categorical variables using multinomial sampling (from an XGBoost classifier) instead of flow matching, improving generation speed. We also use a Runge-Kutta 4th order (Rg4) ODE solver for improved performance over the Euler solver used in FF. Our experiments with 25 datasets reveal that HS3F produces higher quality and more diverse synthetic data than FF, especially for categorical variables. It also generates data 21-27 times faster for datasets with $\geq20%$ categorical variables. HS3F further demonstrates enhanced robustness to affine transformation in flow ODE initial conditions compared to FF. This study not only validates the HS3F but also unveils promising new strategies to advance generative models.

We report the existence of hydrostatic equilibrium states for a composite body made of two rigidly rotating, homogeneous layers bounded by spheroidal surfaces, where the core has a prolate shape. These new configurations require an oblate envelope that spins faster than the core. No solution with a prolate envelope is found. For some parameters, the prolate core can even be at rest. Numerical experiments based on the self-consistent field method support this result in the case of heterogeneous layers with polytropic equations of state. The possible cancellation of the first gravitational moment, $J_2$, is discussed., Comment: Accepted for publication in A&A. 7 pages, 4 figures, 4 tables

Labor plays a major, albeit largely unrecognized role in the development of artificial intelligence. Machine learning algorithms are predicated on data-intensive processes that rely on humans to execute repetitive and difficult-to-automate, but no less essential, tasks such as labeling images, sorting items in lists, recording voice samples, and transcribing audio files. Online platforms and networks of subcontractors recruit data workers to execute such tasks in the shadow of AI production, often in lower-income countries with long-standing traditions of informality and lessregulated labor markets. This study unveils the resulting complexities by comparing the working conditions and the profiles of data workers in Venezuela, Brazil, Madagascar, and as an example of a richer country, France. By leveraging original data collected over the years 2018-2023 via a mixed-method design, we highlight how the cross-country supply chains that link data workers to core AI production sites are reminiscent of colonial relationships, maintain historical economic dependencies, and generate inequalities that compound with those inherited from the past. The results also point to the importance of less-researched, non-English speaking countries to understand key features of the production of AI solutions at planetary scale., Comment: Jack Qiu, Shinjoung Yeo, Richard Maxwell. The Handbook of Digital Labor, Wiley Blackwell, In press, ISBN10: 1119981808

The diagnosis of diabetic retinopathy, which relies on fundus images, faces challenges in achieving transparency and interpretability when using a global classification approach. However, segmentation-based databases are significantly more expensive to acquire and combining them is often problematic. This paper introduces a novel method, termed adversarial style conversion, to address the lack of standardization in annotation styles across diverse databases. By training a single architecture on combined databases, the model spontaneously modifies its segmentation style depending on the input, demonstrating the ability to convert among different labeling styles. The proposed methodology adds a linear probe to detect dataset origin based on encoder features and employs adversarial attacks to condition the model's segmentation style. Results indicate significant qualitative and quantitative through dataset combination, offering avenues for improved model generalization, uncertainty estimation and continuous interpolation between annotation styles. Our approach enables training a segmentation model with diverse databases while controlling and leveraging annotation styles for improved retinopathy diagnosis., Comment: preprint

The past years have seen Large Language Models (LLMs) strive not only as generative models but also as agents solving textual sequential decision-making tasks. When facing complex environments where their zero-shot abilities are insufficient, recent work showed online Reinforcement Learning (RL) could be used for the LLM agent to discover and learn efficient strategies interactively. However, most prior work sticks to on-policy algorithms, which greatly reduces the scope of methods such agents could use for both exploration and exploitation, such as experience replay and hindsight relabeling. Yet, such methods may be key for LLM learning agents, and in particular when designing autonomous intrinsically motivated agents sampling and pursuing their own goals (i.e. autotelic agents). This paper presents and studies an adaptation of Soft Actor-Critic and hindsight relabeling to LLM agents. Our method not only paves the path towards autotelic LLM agents that learn online but can also outperform on-policy methods in more classic multi-goal RL environments.

We study numerically the nonintegrable dynamics of coherent, solitonic, nonlinear waves, in a spatially nonlocal nonlinear Schrodinger equation relevant to realistic modelling of optical systems: the Schrodinger-Helmholtz equation. We observe a single oscillating, coherent solitary wave emerging from a variety of initial conditions. Using the direct scattering transform of the (integrable) cubic nonlinear Schrodinger equation, we find that this structure is a bound state, comprising of a primary and secondary soliton whose amplitudes oscillate out of phase. We interpret this as the solitons periodically exchanging mass. We observe this bound state self-organising from a state of incoherent turbulence, and from solitonic structures launched into the system. When a single (primary) solitonic structure is launched, a resonance process between it and waves in the system generates the secondary soliton, resulting in the bound state. Further, when two solitons are initially launched, we show that they can merge if their phases are synchronised when they collide. When the system is launched from a turbulent state comprised of many initial solitons, we propose that the bound state formation is preceded a sequence of binary collisions, in which the mass is transferred on average from the weak soliton to the strong one, with occasional soliton mergers. Both processes lead to increasingly stronger and fewer dominant solitons. The final state -- a solitary double-solitonic bound state surrounded by weakly nonlinear waves -- is robust and ubiquitous. We propose that for nonlocal media, it is a more typical statistical attractor than a single-soliton attractor suggested in previous literature., Comment: 13 figures

Temporal logics are a powerful tool to specify properties of computational systems. For concurrent programs, Higher Dimensional Automata (HDA) are a very expressive model of non-interleaving concurrency. HDA recognize languages of partially ordered multisets, or pomsets. Recent work has shown that Monadic Second Order (MSO) logic is as expressive as HDA for pomset languages. In this paper, we investigate the class of pomset languages that are definable in First Order (FO) logic. As expected, this is a strict subclass of MSO-definable languages. In the case of words, Kamp's theorem states that FO is as expressive as Linear Temporal Logic (LTL). Our aim is to prove a variant of Kamp's theorem for pomset languages. Thus, we define a temporal logic called Sparse Pomset Temporal Logic (SPTL), and show that it is equivalent to FO, when there is no autoconcurrency., Comment: 18 pages + references + 2 pages appendix, submitted to FoSSaCS 2025

The Leaf Area Index (LAI) is a critical parameter to understand ecosystem health and vegetation dynamics. In this paper, we propose a novel method for pixel-wise LAI prediction by leveraging the complementary information from Sentinel 1 radar data and Sentinel 2 multi-spectral data at multiple timestamps. Our approach uses a deep neural network based on multiple U-nets tailored specifically to this task. To handle the complexity of the different input modalities, it is comprised of several modules that are pre-trained separately to represent all input data in a common latent space. Then, we fine-tune them end-to-end with a common decoder that also takes into account seasonality, which we find to play an important role. Our method achieved 0.06 RMSE and 0.93 R2 score on publicly available data. We make our contributions available at https://github.com/valentingol/LeafNothingBehind for future works to further improve on our current progress.

We investigate the theoretical performances of the Partial Least Square (PLS) algorithm in a high dimensional context. We provide upper bounds on the risk in prediction for the statistical linear model when considering the PLS estimator. Our bounds are non-asymptotic and are expressed in terms of the number of observations, the noise level, the properties of the design matrix, and the number of considered PLS components. In particular, we exhibit some scenarios where the variability of the PLS may explode and prove that we can get round of these situations by introducing a Ridge regularization step. These theoretical findings are illustrated by some numerical simulations.

With the large amount of data generated every day, public sentiment is a key factor for various fields, including marketing, politics, and social research. Understanding the public sentiment about different topics can provide valuable insights. However, most traditional approaches for sentiment analysis often depend on supervised learning, which requires a significant amount of labeled data. This makes it both expensive and time-consuming to implement. This project introduces an approach using unsupervised learning techniques, particularly Affinity Propagation (AP) clustering, to analyze sentiment. AP clustering groups text data based on natural patterns, without needing predefined cluster numbers. The paper compares AP with K-means clustering, using TF-IDF Vectorization for text representation and Principal Component Analysis (PCA) for dimensionality reduction. To enhance performance, AP is combined with Agglomerative Hierarchical Clustering. This hybrid method refines clusters further, capturing both global and local sentiment structures more effectively. The effectiveness of these methods is evaluated using the Silhouette Score, Calinski-Harabasz Score, and Davies-Bouldin Index. Results show that AP with Agglomerative Hierarchical Clustering significantly outperforms K-means. This research contributes to Natural Language Processing (NLP) by proposing a scalable and efficient unsupervised learning framework for sentiment analysis, highlighting the significant societal impact of advanced AI techniques in analyzing public sentiment without the need for extensive labeled data.

The development of Electronic Health Records summarization systems has revolutionized patient data management. Previous research advanced this field by adapting Large Language Models for clinical tasks, using diverse datasets to generate general EHR summaries. However, clinicians often require specific, focused summaries for quicker insights. This project builds on prior work by creating a system that generates clinician-preferred, focused summaries, improving EHR summarization for more efficient patient care. The proposed system leverages the Google Flan-T5 model to generate tailored EHR summaries based on clinician-specified topics. The approach involved fine-tuning the Flan-T5 model on an EHR question-answering dataset formatted in the Stanford Question Answering Dataset (SQuAD) style, which is a large-scale reading comprehension dataset with questions and answers. Fine-tuning utilized the Seq2SeqTrainer from the Hugging Face Transformers library with optimized hyperparameters. Key evaluation metrics demonstrated promising results: the system achieved an Exact Match (EM) score of 81.81%. ROUGE (Recall-Oriented Understudy for Gisting Evaluation) metrics showed strong performance, with ROUGE-1 at 96.03%, ROUGE-2 at 86.67%, and ROUGE-L at 96.10%. Additionally, the Bilingual Evaluation Understudy (BLEU) score was 63%, reflecting the model's coherence in generating summaries. By enhancing EHR summarization through LLMs, this project supports digital transformation efforts in healthcare, streamlining workflows, and enabling more personalized patient care.

Diffusion models have emerged as highly effective techniques for inpainting, however, they remain constrained by slow sampling rates. While recent advances have enhanced generation quality, they have also increased sampling time, thereby limiting scalability in real-world applications. We investigate the generative sampling process of diffusion-based inpainting models and observe that these models make minimal use of the input condition during the initial sampling steps. As a result, the sampling trajectory deviates from the data manifold, requiring complex synchronization mechanisms to realign the generation process. To address this, we propose Time-aware Diffusion Paint (TD-Paint), a novel approach that adapts the diffusion process by modeling variable noise levels at the pixel level. This technique allows the model to efficiently use known pixel values from the start, guiding the generation process toward the target manifold. By embedding this information early in the diffusion process, TD-Paint significantly accelerates sampling without compromising image quality. Unlike conventional diffusion-based inpainting models, which require a dedicated architecture or an expensive generation loop, TD-Paint achieves faster sampling times without architectural modifications. Experimental results across three datasets show that TD-Paint outperforms state-of-the-art diffusion models while maintaining lower complexity.

The training data for many Large Language Models (LLMs) is contaminated with test data. This means that public benchmarks used to assess LLMs are compromised, suggesting a performance gap between benchmark scores and actual capabilities. Ideally, a private holdout set could be used to accurately verify scores. Unfortunately, such datasets do not exist for most benchmarks, and post-hoc construction of sufficiently similar datasets is non-trivial. To address these issues, we introduce a systematic methodology for (i) retrospectively constructing a holdout dataset for a target dataset, (ii) demonstrating the statistical indistinguishability of this retro-holdout dataset, and (iii) comparing LLMs on the two datasets to quantify the performance gap due to the dataset's public availability. Applying these methods to TruthfulQA, we construct and release Retro-Misconceptions, on which we evaluate twenty LLMs and find that some have inflated scores by as much as 16 percentage points. Our results demonstrate that public benchmark scores do not always accurately assess model properties, and underscore the importance of improved data practices in the field.

We present an analysis of adaptive optics (AO) images from the Keck-I telescope of the microlensing event MOA-2011-BLG-262. The original discovery paper by Bennett et al. 2014 reports two distinct possibilities for the lens system; a nearby gas giant lens with an exomoon companion or a very low mass star with a planetary companion in the galactic bulge. The $\sim$10 year baseline between the microlensing event and the Keck follow-up observations allows us to detect the faint candidate lens host (star) at $K = 22.3$ mag and confirm the distant lens system interpretation. The combination of the host star brightness and light curve parameters yields host star and planet masses of $M_{\rm host} = 0.19 \pm 0.03M_{\odot}$ and $m_p = 28.92 \pm 4.75M_{\oplus}$ at a distance of $D_L = 7.49 \pm 0.91\,$kpc. We perform a multi-epoch cross reference to \textit{Gaia} DR3 and measure a transverse velocity for the candidate lens system of $v_L = 541.31 \pm 65.75$ km s$^{-1}$. We conclude this event consists of the highest velocity exoplanet system detected to date, and also the lowest mass microlensing host star with a confirmed mass measurement. The high-velocity nature of the lens system can be definitively confirmed with an additional epoch of high-resolution imaging at any time now. The methods outlined in this work demonstrate that the \textit{Roman} Galactic Exoplanet Survey (RGES) will be able to securely measure low-mass host stars in the bulge., Comment: 21 pages, 6 figures, 4 tables, submitted to AJ

Humanoid robotics faces significant challenges in achieving stable locomotion and recovering from falls in dynamic environments. Traditional methods, such as Model Predictive Control (MPC) and Key Frame Based (KFB) routines, either require extensive fine-tuning or lack real-time adaptability. This paper introduces FRASA, a Deep Reinforcement Learning (DRL) agent that integrates fall recovery and stand up strategies into a unified framework. Leveraging the Cross-Q algorithm, FRASA significantly reduces training time and offers a versatile recovery strategy that adapts to unpredictable disturbances. Comparative tests on Sigmaban humanoid robots demonstrate FRASA superior performance against the KFB method deployed in the RoboCup 2023 by the Rhoban Team, world champion of the KidSize League.

Let F be a field. We investigate the greatest possible dimension t_n(F) for a vector space of n-by-n matrices with entries in F and in which every element is triangularizable over the ground field F. It is obvious that t_n(F) is greater than or equal to n(n+1)/2, and we prove that equality holds if and only if F is not quadratically closed or n=1, excluding finite fields with characteristic 2. If F is infinite and not quadratically closed, we give an explicit description of the solutions with the critical dimension t_n(F), reducing the problem to the one of deciding for which integers k between 2 and n all k-by-k symmetric matrices over F are triangularizable., Comment: 35 pages

We are developing a single-ion optical clock based on a surface-electrode (SE) trap that we will operate with $^{171}$Yb$^+$ ions on the electric quadrupole transition at 435.5 nm. We present heating rate measurements performed with a prototype SE trap. We also introduce a new, micro-fabricated SE trapping chip using silicon on insulator technology. Electric tests were performed under ultra-high vacuum using a testing chip, including breakdown voltages measurements and flashover detection. We present suitable trapping parameters for this chip, as well as a road-map for improving its design., Comment: 10 pages, 6 figures

Vision-Language Models (VLMs) are powerful tools for processing and understanding text and images. We study the processing of visual tokens in the language model component of LLaVA, a prominent VLM. Our approach focuses on analyzing the localization of object information, the evolution of visual token representations across layers, and the mechanism of integrating visual information for predictions. Through ablation studies, we demonstrated that object identification accuracy drops by over 70\% when object-specific tokens are removed. We observed that visual token representations become increasingly interpretable in the vocabulary space across layers, suggesting an alignment with textual tokens corresponding to image content. Finally, we found that the model extracts object information from these refined representations at the last token position for prediction, mirroring the process in text-only language models for factual association tasks. These findings provide crucial insights into how VLMs process and integrate visual information, bridging the gap between our understanding of language and vision models, and paving the way for more interpretable and controllable multimodal systems.

A Physics-Augmented Neural network is trained to model a hyperelastic behavior. The dataset used for the training, validation, and test are displacement-force couples obtained from two experiments on a rubber-like material. One experiment was dedicated for the test, to assess the capacity of the model to generalize on unseen loadings and geometries. The trained AI model outperforms a standard Neo Hookean model identified on the same data. Particular attention is paid to the mechanical data information contained in the different datasets., Comment: Photomechanics - IDICs, Oct 2024, Clermont - Ferrand, France

This technical report introduces a Named Clinical Entity Recognition Benchmark for evaluating language models in healthcare, addressing the crucial natural language processing (NLP) task of extracting structured information from clinical narratives to support applications like automated coding, clinical trial cohort identification, and clinical decision support. The leaderboard provides a standardized platform for assessing diverse language models, including encoder and decoder architectures, on their ability to identify and classify clinical entities across multiple medical domains. A curated collection of openly available clinical datasets is utilized, encompassing entities such as diseases, symptoms, medications, procedures, and laboratory measurements. Importantly, these entities are standardized according to the Observational Medical Outcomes Partnership (OMOP) Common Data Model, ensuring consistency and interoperability across different healthcare systems and datasets, and a comprehensive evaluation of model performance. Performance of models is primarily assessed using the F1-score, and it is complemented by various assessment modes to provide comprehensive insights into model performance. The report also includes a brief analysis of models evaluated to date, highlighting observed trends and limitations. By establishing this benchmarking framework, the leaderboard aims to promote transparency, facilitate comparative analyses, and drive innovation in clinical entity recognition tasks, addressing the need for robust evaluation methods in healthcare NLP., Comment: Technical Report

The possibility of observing correlation-driven charge migration has been a driving force behind theoretical and experimental developments in the field of attosecond molecular science since its inception. Despite significant accomplishments, the unambiguous experimental observation of this quantum beating remains elusive. In this work, we present a method to selectively trigger such dynamics using molecules predicted to exhibit long-lived electron coherence. We show that these dynamics can be selectively triggered using infrared multi-photon ionization and probed using the spacial resolution of X-ray free-electron laser, proposing a promising experimental scheme to study these pivotal dynamics. Additionally, we demonstrate that real-time time-dependent density-functional theory can describe correlation-driven charge migration resulting from a hole mixing structure involving the HOMO of a molecule.

In this article, we establish a "Gehring lemma" for a real function satisfying a reverse H\"older inequality on all "kinetic cylinders" contained in a large one: it asserts that the integrability degree of the function improves under such an assumption. The kinetic cylinders are derived from the non-commutative group of invariances of the Kolmogorov equation. Our contributions here are (1) the extension of Gehring's Lemma to this kinetic (hypoelliptic) scaling used to generate the cylinders, (2) the localisation of the lemma in this hypoelliptic context (using ideas from the elliptic theory), (3) the streamlining of a short and quantitative proof. We then use this lemma to establish that the velocity gradient of weak solutions to linear kinetic equations of Fokker-Planck type with rough coefficients have Lebesgue integrability strictly greater than two, while the natural energy estimate merely ensures that it is square integrable. Our argument here is new but relies on Poincar\'e-type inequalities established in previous works.

We report the synthesis of a new functional molecule, a quater-tiophene based surfactant, which can both adsorb at the water / gas interface (surface active molecule) and aggregates through pi-pi stacking interactions. We assess then the ability of this molecule to create these functionalities at interfaces. This interfacial functional aggregation, characterized here in situ for the first time, is probed thanks to Langmuir trough experiments and spectrometric ellipsometry. These results open some new routes for the design of new water based opto-electronic devices., Comment: 17 pages, 14 figures

To refine formal methods for concurrent systems, there are several ways of enriching classical operational semantics of process calculi. One can enable the auditing and undoing of past synchronisations thanks to communication keys, thus easing the study of true concurrency as a by-product. Alternatively, proof labels embed information about the origins of actions in transition labels, facilitating syntactic analysis. Enriching proof labels with keys enables a theory of the relations on transitions and on events based on their labels only. We offer for the first time separate definitions of dependence relation and independence relation, and prove their complementarity on connected transitions instead of postulating it. Leveraging the recent axiomatic approach to reversibility, we prove the canonicity of these relations and provide additional tools to study the relationships between e.g., concurrency and causality on transitions and events. Finally, we make precise the subtle relationship between bisimulations based on both forward and backward transitions, on key ordering, and on dependency preservation, providing a direct definition of History Preserving bisimulation for CCS.

This article addresses the overlooked but crucial role of the Haar measure in solid mechanics, a concept well-established in mathematical literature but frequently misunderstood by mechanicians. The aim is to provide practical insights and methodologies for the application of the Haar measure in various mechanical scenarios. The article begins with an introduction to the Haar measure, underlying its significance and a theoretical foundation for its definition and formulas. Moving beyond mathematical abstraction, the core of the article relies on practical applications, including the computation of the Haar measure for the orthogonal transformations of the 2D and 3D space under several commonly used parametrisations, an application about invariant theory in mechanics and sampling on a group orbit. These applications are presented with practical examples, enabling mechanicians to integrate the Haar measure into their research seamlessly. The article caters to a broad audience, with sections designed for both introductory comprehension and in-depth exploration. Our goal is to equip mechanicians with a valuable tool, bridging the gap between mathematical theory and practical applications in the field of mechanics.

We propose a fully discrete finite volume scheme for the standard Fokker-Planck equation. The space discretization relies on the well-known square-root approximation, which falls into the framework of two-point flux approximations. Our time discretization is novel and relies on a tailored nonlinear mid-point rule, designed to accurately capture the dissipative structure of the model. We establish well-posedness for the scheme, positivity of the solutions, as well as a fully discrete energy-dissipation inequality mimicking the continuous one. We then prove the rigorous convergence of the scheme under mildly restrictive conditions on the unstructured grids, which can be easily satisfied in practice. Numerical simulations show that our scheme is second order accurate both in time and space, and that one can solve the discrete nonlinear systems arising at each time step using Newton's method with low computational cost.

To obtain the highest confidence on the correction of numerical simulation programs for the resolution of Partial Differential Equations (PDEs), one has to formalize the mathematical notions and results that allow to establish the soundness of the approach. The finite element method is one of the popular tools for the numerical resolution of a wide range of PDEs. The purpose of this document is to provide the formal proof community with very detailed pen-and-paper proofs for the construction of the Lagrange finite elements of any degree on simplices in positive dimension.

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)

Ultra-short-period exoplanets like K2-141 b likely have magma oceans on their dayside, which play a critical role in redistributing heat within the planet. This could lead to a warm nightside surface, measurable by the James Webb Space Telescope, offering insights into the planet's structure. Accurate models of properties like viscosity, which can vary by orders of magnitude, are essential for such studies. We present a new model for predicting molten magma viscosity, applicable in diverse scenarios, including magma oceans on lava planets. Using a database of 28,898 viscosity measurements on phospho-alumino-silicate melts, spanning superliquidus to undercooled temperatures and pressures up to 30 GPa, we trained a greybox artificial neural network, refined by a Gaussian process. This model achieves high predictive accuracy (RMSE $\approx 0.4 \log_{10}$ Pa$\cdot$s) and can handle compositions from SiO$_2$ to multicomponent magmatic and industrial glasses, accounting for pressure effects up to 30 GPa for compositions such as peridotite. Applying this model, we calculated the viscosity of K2-141 b's magma ocean under different compositions. Phase diagram calculations suggest that the dayside is fully molten, with extreme temperatures primarily controlling viscosity. A tenuous atmosphere (0.1 bar) might exist around a 40{\deg} radius from the substellar point. At higher longitudes, atmospheric pressure drops, and by 90{\deg}, magma viscosity rapidly increases as solidification occurs. The nightside surface is likely solid, but previously estimated surface temperatures above 400 K imply a partly molten mantle, feeding geothermal flux through vertical convection., Comment: 19 pages, 9 figures, 2 tables

We introduce the notion of a weak A2 space (or wA2-space), which generalises spaces satisfying Todor\v{c}evi\'c's axioms A1-A4 and countable vector spaces. We show that in any Polish weak A2 space, analytic sets are Kastanas Ramsey, and discuss the relationship between Kastanas Ramsey sets and sets in the projective hierarchy. We also show that in all spaces satisfying A1-A4, every subset of $\cal{R}$ is Kastanas Ramsey iff Ramsey, generalising the recent result by Cano and Di Prisco. Finally, we show that in the setting of Gowers wA2-spaces, Kastanas Ramsey sets and strategically Ramsey sets coincide, providing a connection between the recent studies on topological Ramsey spaces and countable vector spaces., Comment: 26 pages

We use a double-duality argument to give a new proof of Dieudonn\'e's theorem on spaces of singular matrices. The argument connects the situation to the structure of spaces of operators with rank at most $1$, and works best over algebraically closed fields., Comment: 12 pages

Quantum trajectories are Markov processes describing the evolution of a quantum system subject to indirect measurements. They can be viewed as place dependent iterated function systems or the result of products of dependent and non identically distributed random matrices. In this article, we establish a complete classification of their invariant measures. The classification is done in two steps. First, we prove a Markov process on some linear subspaces called dark subspaces, defined in (Maassen, K\"ummerer 2006), admits a unique invariant measure. Second, we study the process inside the dark subspaces. Using a notion of minimal family of isometries from a reference space to dark subspaces, we prove a set of measures indexed by orbits of a unitary group is the set of ergodic measures of quantum trajectories., Comment: 54 pages, 6 figures

Despite a significant proportion of the Earth being covered in water, exploration of what lies below has been limited due to the challenges and difficulties inherent in the process. Current state of the art robots such as Remotely Operated Vehicles (ROVs) and Autonomous Underwater Vehicles (AUVs) are bulky, rigid and unable to conform to their environment. Soft robotics offers solutions to this issue. Fluid-actuated eversion or growing robots, in particular, are a good example. While current eversion robots have found many applications on land, their inherent properties make them particularly well suited to underwater environments. An important factor when considering underwater eversion robots is the establishment of a suitable steering mechanism that can enable the robot to change direction as required. This project proposes a design for an eversion robot that is capable of steering while underwater, through the use of bending pouches, a design commonly seen in the literature on land-based eversion robots. These bending pouches contract to enable directional change. Similar to their land-based counterparts, the underwater eversion robot uses the same fluid in the medium it operates in to achieve extension and bending but also to additionally aid in neutral buoyancy. The actuation method of bending pouches meant that robots needed to fully extend before steering was possible. Three robots, with the same design and dimensions were constructed from polyethylene tubes and tested. Our research shows that although the soft eversion robot design in this paper was not capable of consistently generating the same amounts of bending for the inflation volume, it still achieved suitable bending at a range of inflation volumes and was observed to bend to a maximum angle of 68 degrees at 2000 ml, which is in line with the bending angles reported for land-based eversion robots in the literature.

The performance of software systems remains a persistent concern in the field of software engineering. While traditional metrics like binary size and execution time have long been focal points for developers, the power consumption concern has gained significant attention, adding a layer of complexity to performance evaluation. Configurable software systems, with their potential for numerous configurations, further complicate this evaluation process. In this experience paper, we examine the impact of configurations on performance, specifically focusing on the web stack generator JHipster. Our goal is to understand how configuration choices within JHipster influence the performance of the generated system. We undertake an exhaustive analysis of JHipster by examining its configurations and their effects on system performance. Additionally, we explore individual configuration options to gauge their specific influence on performance. Through this process, we develop a comprehensive performance model for JHipster, enabling us to automate the identification of configurations that optimize specific performance metrics. In particular, we identify configurations that demonstrate near-optimal performance across multiple indicators and report on significant correlations between configuration choices within JHipster and the performance of generated systems.

The BICEP3 and BICEP Array polarimeters are small-aperture refracting telescopes located at the South Pole designed to measure primordial gravitational wave signatures in the Cosmic Microwave Background (CMB) polarization, predicted by inflation. Constraining the inflationary signal requires not only excellent sensitivity, but also careful control of instrumental systematics. Both instruments use antenna-coupled orthogonally polarized detector pairs, and the polarized sky signal is reconstructed by taking the difference in each detector pair. As a result, the differential response between detectors within a pair becomes an important systematic effect we must control. Additionally, mapping the intensity and polarization response in regions away from the main beam can inform how sidelobe levels affect CMB measurements. Extensive calibration measurements are taken in situ every austral summer for control of instrumental systematics and instrument characterisation. In this work, we detail the set of beam calibration measurements that we conduct on the BICEP receivers, from deep measurements of main beam response to polarized beam response and sidelobe mapping. We discuss the impact of these measurements for instrumental systematics studies and design choices for future CMB receivers., Comment: 13 pages, 7 figures, 1 table, Proceedings paper SPIE 2024

Memory disaggregation is an emerging data center architecture that improves resource utilization and scalability. Replication is key to ensure the fault tolerance of applications, but replicating shared data in disaggregated memory is hard. We propose SWARM (Swift WAit-free Replication in disaggregated Memory), the first replication scheme for in-disaggregated-memory shared objects to provide (1) single-roundtrip reads and writes in the common case, (2) strong consistency (linearizability), and (3) strong liveness (wait-freedom). SWARM makes two independent contributions. The first is Safe-Guess, a novel wait-free replication protocol with single-roundtrip operations. The second is In-n-Out, a novel technique to provide conditional atomic update and atomic retrieval of large buffers in disaggregated memory in one roundtrip. Using SWARM, we build SWARM-KV, a low-latency, strongly consistent and highly available disaggregated key-value store. We evaluate SWARM-KV and find that it has marginal latency overhead compared to an unreplicated key-value store, and that it offers much lower latency and better availability than FUSEE, a state-of-the-art replicated disaggregated key-value store., Comment: To appear in the proceedings of SOSP '24

We discuss in this article the creation and organization of a national core facility for bioimage analysis, based on a distributed team. F-BIAS federates bioimage analysts across France and relies on them to deliver services to the researchers of this territory. The main challenge in implementing this structure is to provide significant scientific value to its members, thereby encouraging their active participation and persuading their respective host teams to support their involvement. F-BIAS accomplished this by creating a professional network that mitigates the negative effects of isolation experienced by its members, who are often the sole bioimage analyst within their local teams, and fosters the development of their technical skills. In a second phase we capitalized on F-BIAS to create a virtual, remotely-operating core facility for bioimage analysis, offering consultations and collaborative project services to the scientific community of France. The services are organized so that they also contribute to the technical proficiency of the analysts. To promote the creation of similar structures, we present and discuss here the organization of this nationally distributed bioimage analysis service core, highlighting successes and challenges.

Large Language Models (LLMs) have demonstrated significant potential in transforming clinical applications. In this study, we investigate the efficacy of four techniques in adapting LLMs for clinical use-cases: continuous pretraining, instruct fine-tuning, NEFTune, and prompt engineering. We employ these methods on Mistral 7B and Mixtral 8x7B models, leveraging a large-scale clinical pretraining dataset of 50 billion tokens and an instruct fine-tuning dataset of 500 million tokens. Our evaluation across various clinical tasks reveals the impact of each technique. While continuous pretraining beyond 250 billion tokens yields marginal improvements on its own, it establishes a strong foundation for instruct fine-tuning. Notably, NEFTune, designed primarily to enhance generation quality, surprisingly demonstrates additional gains on our benchmark. Complex prompt engineering methods further enhance performance. These findings show the importance of tailoring fine-tuning strategies and exploring innovative techniques to optimize LLM performance in the clinical domain.

The in-vivo identification of the kidney stone types during an ureteroscopy would be a major medical advance in urology, as it could reduce the time of the tedious renal calculi extraction process, while diminishing infection risks. Furthermore, such an automated procedure would make possible to prescribe anti-recurrence treatments immediately. Nowadays, only few experienced urologists are able to recognize the kidney stone types in the images of the videos displayed on a screen during the endoscopy. Thus, several deep learning (DL) models have recently been proposed to automatically recognize the kidney stone types using ureteroscopic images. However, these DL models are of black box nature whicl limits their applicability in clinical settings. This contribution proposes a case-based reasoning DL model which uses prototypical parts (PPs) and generates local and global descriptors. The PPs encode for each class (i.e., kidney stone type) visual feature information (hue, saturation, intensity and textures) similar to that used by biologists. The PPs are optimally generated due a new loss function used during the model training. Moreover, the local and global descriptors of PPs allow to explain the decisions ("what" information, "where in the images") in an understandable way for biologists and urologists. The proposed DL model has been tested on a database including images of the six most widespread kidney stone types. The overall average classification accuracy was 90.37. When comparing this results with that of the eight other DL models of the kidney stone state-of-the-art, it can be seen that the valuable gain in explanability was not reached at the expense of accuracy which was even slightly increased with respect to that (88.2) of the best method of the literature. These promising and interpretable results also encourage urologists to put their trust in AI-based solutions., Comment: Paper submitted to Artificial Intelligence in Medicine. (AIIM), Elsevier

The study of interactions between biomimetic membranes and micron-sized particles serves as a fundamental cornerstone for understanding various biological processes. Here, we aim at controlling the engulfment of microparticles in absence of any externally applied force. We investigate systems involving particles and lipid vesicles, where interactions are primarily mediated by electrostatics. Our attention is directed towards dissipative phenomena at the micron and nano scales occurring between a vesicle membrane and a particle, highlighting the influence of the particle penetration depth and the impact of substructures on particle friction. Our work is complemented by hydrodynamic simulations considering the impacts of the shape of the membrane wrapping the particle and the water gap separating the lipid bilayer membrane and the particle on the translational particle drag. Lastly, we explore a system of aqueous microdroplets in oil, stabilized by a single lipid layer and compare the friction experienced by a particle in contact with this monolayer to the friction observed for particles wrapped by lipid bilayers. Surprisingly, the particle drag is higher on the lipid monolayer than the bilayer, which can be explained by introducing a drag contribution due to the partial wetting dynamics of the particle at the monolayer interface.