Search

Floquet systems are periodically driven systems. In this framework, the system Hamiltonian and associated spectra of interest are modified, giving rise to new quantum phases of matter and nonequilibrium dynamics without static counterparts. Here we experimentally demonstrate a self-induced Floquet system in the interacting Rydberg gas. This originates from the photoionization of thermal Rydberg gases in a static magnetic field. Importantly, by leveraging the Rydberg electromagnetically induced transparency spectrum, we probe the nonequilibrium dynamics in the bistable regime and identify the emergence of a discrete time crystalline phase. Our work fills the experimental gap in the understanding the relation of multistability and dissipative discrete time crystalline phase. In this regard, it constitutes a highly controlled platform for exploring exotic nonequilibrium physics in dissipative interacting systems., Comment: 6 pages, 4 figures

The measurement of cosmic rays at energies exceeding 100 TeV per nucleon is crucial for enhancing the understanding of high-energy particle propagation and acceleration models in the Galaxy. HERD is a space-borne calorimetric experiment that aims to extend the current direct measurements of cosmic rays to unexplored energies. The payload is scheduled to be installed on the Chinese Space Station in 2027. The primary peculiarity of the instrument is its capability to measure particles coming from all directions, with the main detector being a deep, homogeneous, 3D calorimeter. The active elements are read out using two independent systems: one based on wavelength shifter fibers coupled to CMOS cameras, and the other based on photo-diodes read-out with custom front-end electronics. A large calorimeter prototype was tested in 2023 during an extensive beam test campaign at CERN. In this paper, the performance of the calorimeter for high-energy electron beams, as obtained from the photo-diode system data, is presented. The prototype demonstrated excellent performance, e.g., an energy resolution better than 1% for electrons at 250 GeV. A comparison between beam test data and Monte Carlo simulation data is also presented.

We present the Qwen2-VL Series, an advanced upgrade of the previous Qwen-VL models that redefines the conventional predetermined-resolution approach in visual processing. Qwen2-VL introduces the Naive Dynamic Resolution mechanism, which enables the model to dynamically process images of varying resolutions into different numbers of visual tokens. This approach allows the model to generate more efficient and accurate visual representations, closely aligning with human perceptual processes. The model also integrates Multimodal Rotary Position Embedding (M-RoPE), facilitating the effective fusion of positional information across text, images, and videos. We employ a unified paradigm for processing both images and videos, enhancing the model's visual perception capabilities. To explore the potential of large multimodal models, Qwen2-VL investigates the scaling laws for large vision-language models (LVLMs). By scaling both the model size-with versions at 2B, 8B, and 72B parameters-and the amount of training data, the Qwen2-VL Series achieves highly competitive performance. Notably, the Qwen2-VL-72B model achieves results comparable to leading models such as GPT-4o and Claude3.5-Sonnet across various multimodal benchmarks, outperforming other generalist models. Code is available at https://github.com/QwenLM/Qwen2-VL ., Comment: Code is available at https://github.com/QwenLM/Qwen2-VL. arXiv admin note: text overlap with arXiv:2408.15262 by other authors

A finite element model consisting of a conducting filament with or without a gap was used to reproduce behavior of TaO$_x$-based resistive switching devices. The specific goal was to explore the range of possible filament parameters such a filament diameter, composition, gap width, and composition to reproduce the conductance and shape of I-V while keeping the maximum temperature within acceptable range allowing for ion motion and preventing melting. The model solving heat and charge transport produced a good agreement with experimental data for the oxygen content in the filament below TaO$_{1.3}$, the filament diameter range between 6 and 22 nm, and the gap oxygen content between TaO$_{1.7}$ and TaO$_{1.85}$. Gap width was not limited on either low or high sides by the criteria considered in this report. The obtained filament composition corresponds to oxygen deficiency an order of magnitude higher than one estimated by other modelling efforts. This was in a large part due to use of recent experimental values of conductivity as a function of composition and temperature. Our modelling results imply that a large fraction of atoms leaves and/or accumulates within the filament to produce large relative concentration change. This, in turn, necessitates inclusion of strain energy in the filament formation modelling. In addition, the results reproduce non-linear I-V without the necessity of assuming the Poole-Frenkel type of electrical conduction or presence of a barrier at the oxide/metal interface., Comment: 31 pages, 7 figures

In this paper, we consider a class of affined Anosov mappings with quasi-periodic forces, and show that there is a unique positive integer $m$, which only depends on the system, such that the exponential growth rate of the cardinality of invariant tori of degree $m$ is equal to the topological entropy.

Backscatter communication (BC) becomes a promising energy-efficient solution for future wireless sensor networks (WSNs). Unmanned aerial vehicles (UAVs) enable flexible data collection from remote backscatter devices (BDs), yet conventional UAVs rely on omni-directional fixed-position antennas (FPAs), limiting channel gain and prolonging data collection time. To address this issue, we consider equipping a UAV with a directional movable antenna (MA) with high directivity and flexibility. The MA enhances channel gain by precisely aiming its main lobe at each BD, focusing transmission power for efficient communication. Our goal is to minimize the total data collection time by jointly optimizing the UAV's trajectory and the MA's orientation. We develop a deep reinforcement learning (DRL)-based strategy using the azimuth angle and distance between the UAV and each BD to simplify the agent's observation space. To ensure stability during training, we adopt Soft Actor-Critic (SAC) algorithm that balances exploration with reward maximization for efficient and reliable learning. Simulation results demonstrate that our proposed MA-equipped UAV with SAC outperforms both FPA-equipped UAVs and other RL methods, achieving significant reductions in both data collection time and energy consumption.

Learning models of dynamical systems with external inputs, that may be, for example, nonsmooth or piecewise, is crucial for studying complex phenomena and predicting future state evolution, which is essential for applications such as safety guarantees and decision-making. In this work, we introduce \emph{Input Concomitant Neural ODEs (ICODEs)}, which incorporate precise real-time input information into the learning process of the models, rather than treating the inputs as hidden parameters to be learned. The sufficient conditions to ensure the model's contraction property are provided to guarantee that system trajectories of the trained model converge to a fixed point, regardless of initial conditions across different training processes. We validate our method through experiments on several representative real dynamics: Single-link robot, DC-to-DC converter, motion dynamics of a rigid body, Rabinovich-Fabrikant equation, Glycolytic-glycogenolytic pathway model, and heat conduction equation. The experimental results demonstrate that our proposed ICODEs efficiently learn the ground truth systems, achieving superior prediction performance under both typical and atypical inputs. This work offers a valuable class of neural ODE models for understanding physical systems with explicit external input information, with potential promising applications in fields such as physics and robotics.

This paper introduces VisionPAD, a novel self-supervised pre-training paradigm designed for vision-centric algorithms in autonomous driving. In contrast to previous approaches that employ neural rendering with explicit depth supervision, VisionPAD utilizes more efficient 3D Gaussian Splatting to reconstruct multi-view representations using only images as supervision. Specifically, we introduce a self-supervised method for voxel velocity estimation. By warping voxels to adjacent frames and supervising the rendered outputs, the model effectively learns motion cues in the sequential data. Furthermore, we adopt a multi-frame photometric consistency approach to enhance geometric perception. It projects adjacent frames to the current frame based on rendered depths and relative poses, boosting the 3D geometric representation through pure image supervision. Extensive experiments on autonomous driving datasets demonstrate that VisionPAD significantly improves performance in 3D object detection, occupancy prediction and map segmentation, surpassing state-of-the-art pre-training strategies by a considerable margin.

This paper presents an a priori error analysis of the Deep Mixed Residual method (MIM) for solving high-order elliptic equations with non-homogeneous boundary conditions, including Dirichlet, Neumann, and Robin conditions. We examine MIM with two types of loss functions, referred to as first-order and second-order least squares systems. By providing boundedness and coercivity analysis, we leverage C\'{e}a's Lemma to decompose the total error into the approximation, generalization, and optimization errors. Utilizing the Barron space theory and Rademacher complexity, an a priori error is derived regarding the training samples and network size that are exempt from the curse of dimensionality. Our results reveal that MIM significantly reduces the regularity requirements for activation functions compared to the deep Ritz method, implying the effectiveness of MIM in solving high-order equations., Comment: 40 pages, none figures

Explaining the decision-making processes of Artificial Intelligence (AI) models is crucial for addressing their "black box" nature, particularly in tasks like image classification. Traditional eXplainable AI (XAI) methods typically rely on unimodal explanations, either visual or textual, each with inherent limitations. Visual explanations highlight key regions but often lack rationale, while textual explanations provide context without spatial grounding. Further, both explanation types can be inconsistent or incomplete, limiting their reliability. To address these challenges, we propose a novel Multimodal Explanation-Guided Learning (MEGL) framework that leverages both visual and textual explanations to enhance model interpretability and improve classification performance. Our Saliency-Driven Textual Grounding (SDTG) approach integrates spatial information from visual explanations into textual rationales, providing spatially grounded and contextually rich explanations. Additionally, we introduce Textual Supervision on Visual Explanations to align visual explanations with textual rationales, even in cases where ground truth visual annotations are missing. A Visual Explanation Distribution Consistency loss further reinforces visual coherence by aligning the generated visual explanations with dataset-level patterns, enabling the model to effectively learn from incomplete multimodal supervision. We validate MEGL on two new datasets, Object-ME and Action-ME, for image classification with multimodal explanations. Experimental results demonstrate that MEGL outperforms previous approaches in prediction accuracy and explanation quality across both visual and textual domains. Our code will be made available upon the acceptance of the paper.

Large language models are trained on massive scrapes of the web, as required by current scaling laws. Most progress is made for English, given its abundance of high-quality pretraining data. For most other languages, however, such high quality pretraining data is unavailable. In this work, we study how to boost pretrained model performance in a data constrained target language by enlisting data from an auxiliary language for which high quality data is available. We study this by quantifying the performance gap between training with data in a data-rich auxiliary language compared with training in the target language, exploring the benefits of translation systems, studying the limitations of model scaling for data constrained languages, and proposing new methods for upsampling data from the auxiliary language. Our results show that stronger auxiliary datasets result in performance gains without modification to the model or training objective for close languages, and, in particular, that performance gains due to the development of more information-rich English pretraining datasets can extend to targeted language settings with limited data., Comment: 22 pages, 14 figures, 15 tables

We calculate the leading-twist light-cone distribution amplitudes of the light $\Lambda$ baryon using lattice methods within the framework of large momentum effective theory. Our numerical computations are conducted employing $N_f=2+1$ stout smeared clover fermions and a Symanzik gauge action on a lattice with spacing $a=0.077\;\rm{fm}$, and a pion mass of 303 MeV. To approach the large momentum regime, we simulate the equal-time correlations with the hadron momentum $P^z = \{2.52, 3.02, 3.52\}$ GeV. By investigating the potential analytic characteristics of the baryon quasi-distribution amplitude in coordinate space, we validate these findings through our lattice calculations. After renormalization and extrapolation, we present results for the three-dimensional distribution of momentum fractions for the two light quarks. Based on these findings the paper briefly discusses the phenomenological impact on weak decays of $\Lambda_b$, and outlines potential systematic uncertainties that can be improved in the future. This work lays the theoretical foundation for accessing baryon LCDAs from lattice QCD.

Large Multimodal Models (LMMs) exhibit impressive performance across various multimodal tasks. However, their effectiveness in cross-cultural contexts remains limited due to the predominantly Western-centric nature of most data and models. Conversely, multi-agent models have shown significant capability in solving complex tasks. Our study evaluates the collective performance of LMMs in a multi-agent interaction setting for the novel task of cultural image captioning. Our contributions are as follows: (1) We introduce MosAIC, a Multi-Agent framework to enhance cross-cultural Image Captioning using LMMs with distinct cultural personas; (2) We provide a dataset of culturally enriched image captions in English for images from China, India, and Romania across three datasets: GeoDE, GD-VCR, CVQA; (3) We propose a culture-adaptable metric for evaluating cultural information within image captions; and (4) We show that the multi-agent interaction outperforms single-agent models across different metrics, and offer valuable insights for future research. Our dataset and models can be accessed at https://github.com/MichiganNLP/MosAIC.

Using $e^+e^-$ collision data corresponding to an integrated luminosity of 19 fb$^{-1}$ collected by the BESIII detector at center-of-mass energies ranging from 4.13 to 4.70 GeV, we report the first evidence for a new excited $\Omega^{-}$ hyperon, the $\Omega^*(2109)^{-}$, through the process $e^+ e^- \to \Omega^*(2109)^{-} \bar{\Omega}^{+} +c.c.$ with a significance of 3.7 $\sigma$. The mass and width of $\Omega^*(2109)^{-}$ are measured to be $2108.8 \pm 5.5_{\rm stat} \pm 1.5_{\rm syst} {\rm MeV}/c^{2}$ and $21.6 \pm 17.7_{\rm stat} \pm 9.4_{\rm syst} {\rm MeV}$, respectively. We also present evidence for production of the $\Omega^*(2012)^{-}$ in the process $e^+ e^- \to \Omega^*(2012)^{-} \bar{\Omega}^{+} +c.c.$ with a significance of 3.7 $\sigma$., Comment: 8 pages, 2 figures

Differential privacy (DP) has recently been introduced into episodic reinforcement learning (RL) to formally address user privacy concerns in personalized services. Previous work mainly focuses on two trust models of DP: the central model, where a central agent is responsible for protecting users' sensitive data, and the (stronger) local model, where the protection occurs directly on the user side. However, they either require a trusted central agent or incur a significantly higher privacy cost, making it unsuitable for many scenarios. This work introduces a trust model stronger than the central model but with a lower privacy cost than the local model, leveraging the emerging \emph{shuffle} model of privacy. We present the first generic algorithm for episodic RL under the shuffle model, where a trusted shuffler randomly permutes a batch of users' data before sending it to the central agent. We then instantiate the algorithm using our proposed shuffle Privatizer, relying on a shuffle private binary summation mechanism. Our analysis shows that the algorithm achieves a near-optimal regret bound comparable to that of the centralized model and significantly outperforms the local model in terms of privacy cost.

Modern AI- and Data-intensive software systems rely heavily on data science and machine learning libraries that provide essential algorithmic implementations and computational frameworks. These libraries expose complex APIs whose correct usage has to follow constraints among multiple interdependent parameters. Developers using these APIs are expected to learn about the constraints through the provided documentations and any discrepancy may lead to unexpected behaviors. However, maintaining correct and consistent multi-parameter constraints in API documentations remains a significant challenge for API compatibility and reliability. To address this challenge, we propose MPDetector, for detecting inconsistencies between code and documentation, specifically focusing on multi-parameter constraints. MPDetector identifies these constraints at the code level by exploring execution paths through symbolic execution and further extracts corresponding constraints from documentation using large language models (LLMs). We propose a customized fuzzy constraint logic to reconcile the unpredictability of LLM outputs and detects logical inconsistencies between the code and documentation constraints. We collected and constructed two datasets from four popular data science libraries and evaluated MPDetector on them. The results demonstrate that MPDetector can effectively detect inconsistency issues with the precision of 92.8%. We further reported 14 detected inconsistency issues to the library developers, who have confirmed 11 issues at the time of writing.

Complex numbers are widely used in quantum physics and are indispensable components for describing quantum systems and their dynamical behavior. The resource theory of imaginarity has been built recently, enabling a systematic research of complex numbers in quantum information theory. In this work, we develop two theoretical methods for quantifying imaginarity, motivated by recent progress within resource theories of entanglement and coherence. We provide quantifiers of imaginarity by the convex roof construction and quantifiers of the imaginarity by the least imaginarity of the input pure states under real operations. We also apply these tools to study the state conversion problem in resource theory of imaginarity., Comment: 8 pages, 1 figure, 49 references

Vortex information of scalar pair production in circularly polarized field is investigated in the multiphoton regime. We find that vortex orientation is related to the intrinsic orbital angular momentum of created particles associating with the helicity of absorbed photons, while the magnitude of the orbital angular momentum, i.e., the topology charge is determined by the number of absorbed photons. Moreover, the properties of particle creation and vortices formation can be understood by analyzing the pair production process in quasiparticle representation. This study provides new insights into the angular momentum transfer from field to particle in the scalar pair production process. It is expected that there are similar findings about vortex features for different spin alignment in electron-positron pair production in strong fields via the topology charge as a new freedom., Comment: 7 pages, 4 figures

Soft metals like lithium and sodium play a critical role in battery technology owing to their high energy density. Texture formation by grain selection growth of soft metals during electrochemical processes is a crucial factor affecting power and safety. Developing a framework to understand and control grain growth is a multifaceted challenge. Here, a general thermodynamic theory and phase-field model are formulated to study grain selection growth of soft metals. Our study focuses on the interplay between surface energy and atomic mobility-related intrinsic strain energy in grain selection growth. Differences in grain selection growth arise from the anisotropy in surface energy and diffusion barrier of soft metal atoms. Our findings highlight the kinetic limitations of solid-state Li metal batteries, which originate from load stress-induced surface energy anisotropy. These insights lead to the development of an amorphous LixSi1-x (0.50

Text-to-image diffusion models (DMs) develop at an unprecedented pace, supported by thorough theoretical exploration and empirical analysis. Unfortunately, the discrepancy between DMs and autoregressive models (ARMs) complicates the path toward achieving the goal of unified vision and language generation. Recently, the masked generative Transformer (MGT) serves as a promising intermediary between DM and ARM by predicting randomly masked image tokens (i.e., masked image modeling), combining the efficiency of DM with the discrete token nature of ARM. However, we find that the comprehensive analyses regarding the inference for MGT are virtually non-existent, and thus we aim to present positive design choices to fill this gap. We modify and re-design a set of DM-based inference techniques for MGT and further elucidate their performance on MGT. We also discuss the approach to correcting token's distribution to enhance inference. Extensive experiments and empirical analyses lead to concrete and effective design choices, and these design choices can be merged to achieve further performance gains. For instance, in terms of enhanced inference, we achieve winning rates of approximately 70% compared to vanilla sampling on HPS v2 with the recent SOTA MGT Meissonic. Our contributions have the potential to further enhance the capabilities and future development of MGTs.

The practical applications of Wasserstein distances (WDs) are constrained by their sample and computational complexities. Sliced-Wasserstein distances (SWDs) provide a workaround by projecting distributions onto one-dimensional subspaces, leveraging the more efficient, closed-form WDs for one-dimensional distributions. However, in high dimensions, most random projections become uninformative due to the concentration of measure phenomenon. Although several SWD variants have been proposed to focus on \textit{informative} slices, they often introduce additional complexity, numerical instability, and compromise desirable theoretical (metric) properties of SWD. Amidst the growing literature that focuses on directly modifying the slicing distribution, which often face challenges, we revisit the classical Sliced-Wasserstein and propose instead to rescale the 1D Wasserstein to make all slices equally informative. Importantly, we show that with an appropriate data assumption and notion of \textit{slice informativeness}, rescaling for all individual slices simplifies to \textbf{a single global scaling factor} on the SWD. This, in turn, translates to the standard learning rate search for gradient-based learning in common machine learning workflows. We perform extensive experiments across various machine learning tasks showing that the classical SWD, when properly configured, can often match or surpass the performance of more complex variants. We then answer the following question: "Is Sliced-Wasserstein all you need for common learning tasks?"

In this paper, we consider the classic fair division problem of allocating $m$ divisible items to $n$ agents with linear valuations over the items. We define novel notions of fair shares from the perspective of individual agents via the cake-cutting process. These shares generalize the notion of proportionality by taking into account the valuations of other agents via constraints capturing envy. We study what fraction (approximation) of these shares are achievable in the worst case, and present tight and non-trivial approximation bounds as a function of $n$ and $m$. In particular, we show a tight approximation bound of $\Theta(\sqrt{n})$ for various notions of such shares. We show this bound via a novel application of dual fitting, which may be of independent interest. We also present a bound of $O(m^{2/3})$ for a strict notion of share, with an almost matching lower bound. We further develop weaker notions of shares whose approximation bounds interpolate smoothly between proportionality and the shares described above. We finally present empirical results showing that our definitions lead to more reasonable shares than the standard fair share notion of proportionality.

The task of partial scene text retrieval involves localizing and searching for text instances that are the same or similar to a given query text from an image gallery. However, existing methods can only handle text-line instances, leaving the problem of searching for partial patches within these text-line instances unsolved due to a lack of patch annotations in the training data. To address this issue, we propose a network that can simultaneously retrieve both text-line instances and their partial patches. Our method embeds the two types of data (query text and scene text instances) into a shared feature space and measures their cross-modal similarities. To handle partial patches, our proposed approach adopts a Multiple Instance Learning (MIL) approach to learn their similarities with query text, without requiring extra annotations. However, constructing bags, which is a standard step of conventional MIL approaches, can introduce numerous noisy samples for training, and lower inference speed. To address this issue, we propose a Ranking MIL (RankMIL) approach to adaptively filter those noisy samples. Additionally, we present a Dynamic Partial Match Algorithm (DPMA) that can directly search for the target partial patch from a text-line instance during the inference stage, without requiring bags. This greatly improves the search efficiency and the performance of retrieving partial patches. The source code and dataset are available at https://github.com/lanfeng4659/PSTR., Comment: Accepted on TPAMI

Seamless forecasting that produces warning information at continuum timescales based on only one system is a long-standing pursuit for weather-climate service. While the rapid advancement of deep learning has induced revolutionary changes in classical forecasting field, current efforts are still focused on building separate AI models for weather and climate forecasts. To explore the seamless forecasting ability based on one AI model, we propose FengWu-Weather to Subseasonal (FengWu-W2S), which builds on the FengWu global weather forecast model and incorporates an ocean-atmosphere-land coupling structure along with a diverse perturbation strategy. FengWu-W2S can generate 6-hourly atmosphere forecasts extending up to 42 days through an autoregressive and seamless manner. Our hindcast results demonstrate that FengWu-W2S reliably predicts atmospheric conditions out to 3-6 weeks ahead, enhancing predictive capabilities for global surface air temperature, precipitation, geopotential height and intraseasonal signals such as the Madden-Julian Oscillation (MJO) and North Atlantic Oscillation (NAO). Moreover, our ablation experiments on forecast error growth from daily to seasonal timescales reveal potential pathways for developing AI-based integrated system for seamless weather-climate forecasting in the future., Comment: 23 pages,8 figures

This paper studies the sharp testable implications of an additive random utility model with a discrete multi-valued treatment and a discrete multi-valued instrument, in which each value of the instrument only weakly increases the utility of one choice. Borrowing the terminology used in randomized experiments, we call such a setting an encouragement design. We derive inequalities in terms of the conditional choice probabilities that characterize when the distribution of the observed data is consistent with such a model. Through a novel constructive argument, we further show these inequalities are sharp in the sense that any distribution of the observed data that satisfies these inequalities is generated by this additive random utility model.

Text-to-image diffusion model is a popular paradigm that synthesizes personalized images by providing a text prompt and a random Gaussian noise. While people observe that some noises are ``golden noises'' that can achieve better text-image alignment and higher human preference than others, we still lack a machine learning framework to obtain those golden noises. To learn golden noises for diffusion sampling, we mainly make three contributions in this paper. First, we identify a new concept termed the \textit{noise prompt}, which aims at turning a random Gaussian noise into a golden noise by adding a small desirable perturbation derived from the text prompt. Following the concept, we first formulate the \textit{noise prompt learning} framework that systematically learns ``prompted'' golden noise associated with a text prompt for diffusion models. Second, we design a noise prompt data collection pipeline and collect a large-scale \textit{noise prompt dataset}~(NPD) that contains 100k pairs of random noises and golden noises with the associated text prompts. With the prepared NPD as the training dataset, we trained a small \textit{noise prompt network}~(NPNet) that can directly learn to transform a random noise into a golden noise. The learned golden noise perturbation can be considered as a kind of prompt for noise, as it is rich in semantic information and tailored to the given text prompt. Third, our extensive experiments demonstrate the impressive effectiveness and generalization of NPNet on improving the quality of synthesized images across various diffusion models, including SDXL, DreamShaper-xl-v2-turbo, and Hunyuan-DiT. Moreover, NPNet is a small and efficient controller that acts as a plug-and-play module with very limited additional inference and computational costs, as it just provides a golden noise instead of a random noise without accessing the original pipeline.

In this article, we study the quench dynamics of the binary bond disordered Heisenberg spin chain. First, we develop a new algorithm, the ancilla TEBD method, which combines the purification technique and the time-evolving block decimation (TEBD) algorithm to study the entanglement dynamics of binary bonded disordered spin chains. With the support of exact diagonalization (ED), we calculate the multifaractal dimension of the binary bond disordered Heisenberg spin model and study its dependence on the strength of the disorder potential; we find that the multifaractal dimension shows no critical behavior which rules out the existence of the many body localization transition. Then, we reproduce the long time scaling of the von Neumann entropy at the time scale that is beyond the reach of typical TEBD and time dependent density matrix renormalization group (tDMRG) algorithms. Based on the numerical analysis, we propose that such a long time scaling is due to the competition of the spin interaction and the disorder which can be seen as a new mechanism for the generating of long time scale entropy dynamics. At last, we numerically proved the existence of the transient Mpemba effect in the bond disordered Heisenberg chain.

DarkSHINE is a newly proposed fixed-target experiment initiative to search for the invisible decay of Dark Photon via missing energy/momentum signatures, based on the high repetition rate electron beam to be deployed/delivered by the Shanghai High repetition rate XFEL and Extreme light facility (SHINE). This report elaborates the baseline design of DarkSHINE experiment by introducing the physics goals, experimental setups, details of each sub-detector system technical designs, signal and backgground modelings, expected search sensitivities and future prospects, which mark an important step towards the further prototyping and technical demonstrations.

In this paper we investigate the integrable boundary state in ABJM theory. We find an integrability condition for the two-site integrable matrix product state (MPS) similar to the KT-relation. We also construct a class of non-trivial MPSs from the projected K-matrices.

We investigate the effect of top Al2O3 interlayer thickness on the memory window (MW) of Si channel ferroelectric field-effect transistors (Si-FeFETs) with TiN/Al$_2$O$_3$/Hf$_{0.5}$Zr$_{0.5}$O$_2$/SiO$_x$/Si (MIFIS) gate structure. We find that the MW first increases and then remains almost constant with the increasing thickness of the top Al2O3. The phenomenon is attributed to the lower electric field of the ferroelectric Hf$_{0.5}$Zr$_{0.5}$O$_2$ in the MIFIS structure with a thicker top Al2O3 after a program operation. The lower electric field makes the charges trapped at the top Al2O3/Hf0.5Zr0.5O$_2$ interface, which are injected from the metal gate, cannot be retained. Furthermore, we study the effect of the top Al$_2$O$_3$ interlayer thickness on the reliability (endurance characteristics and retention characteristics). We find that the MIFIS structure with a thicker top Al$_2$O$_3$ interlayer has poorer retention and endurance characteristics. Our work is helpful in deeply understanding the effect of top interlayer thickness on the MW and reliability of Si-FeFETs with MIFIS gate stacks., Comment: 7 pages, 12 figures

Radioactive nuclei with lifetimes on the order of millions of years can reveal the formation history of the Sun and active nucleosynthesis occurring at the time and place of its birth. Among such nuclei whose decay signatures are found in the oldest meteorites, $^{205}$Pb is a powerful example, as it is produced exclusively by slow neutron captures (the s process), with most being synthesized in asymptotic giant branch (AGB) stars. However, making accurate abundance predictions for $^{205}$Pb has so far been impossible because the weak decay rates of $^{205}$Pb and $^{205}$Tl are very uncertain at stellar temperatures. To constrain these decay rates, we measured for the first time the bound-state $\beta^-$ decay of fully ionized $^{205}$Tl$^{81+}$, an exotic decay mode that only occurs in highly charged ions. The measured half-life is 4.7 times longer than the previous theoretical estimate and our 10% experimental uncertainty has eliminated the main nuclear-physics limitation. With new, experimentally backed decay rates, we used AGB stellar models to calculate $^{205}$Pb yields. Propagating those yields with basic galactic chemical evolution (GCE) and comparing with the $^{205}$Pb/$^{204}$Pb ratio from meteorites, we determined the isolation time of solar material inside its parent molecular cloud. We find positive isolation times that are consistent with the other s-process short-lived radioactive nuclei found in the early Solar System. Our results reaffirm the site of the Sun's birth as a long-lived, giant molecular cloud and support the use of the $^{205}$Pb--$^{205}$Tl decay system as a chronometer in the early Solar System., Comment: 21 pages and 11 figures/tables. Published in Nature (2024)

Using 7.93 ${\rm fb^{-1}}$ of $e^+e^-$ collision data collected at a center-of-mass energy of 3.773 ${\rm GeV}$ with the BESIII detector, we present an analysis of the decay $D^{0} \to \eta \pi^- e^+ \nu_{e}$. The branching fraction of the decay $D^{0} \to a_{0}(980)^{-} e^+ \nu_{e}$ with $a_{0}(980)^{-} \to \eta \pi^{-}$ is measured to be $(0.86\pm0.17_{\text{stat}}\pm0.05_{\text{syst}})\times 10^{-4}$. The decay dynamics of this process is studied with a single-pole parameterization of the hadronic form factor and the Flatt\'e formula describing the $a_0(980)$ line shape in the differential decay rate. The product of the form factor $f^{ a_0}_{+}(0)$ and the Cabibbo-Kobayashi-Maskawa matrix element $|V_{cd}|$ is determined for the first time with the result $f^{ a_0}_+(0)|V_{cd}|=0.126\pm0.013_{\rm stat}\pm0.003_{\rm syst}$.

Clinical rationales play a pivotal role in accurate disease diagnosis; however, many models predominantly use discriminative methods and overlook the importance of generating supportive rationales. Rationale distillation is a process that transfers knowledge from large language models (LLMs) to smaller language models (SLMs), thereby enhancing the latter's ability to break down complex tasks. Despite its benefits, rationale distillation alone is inadequate for addressing domain knowledge limitations in tasks requiring specialized expertise, such as disease diagnosis. Effectively embedding domain knowledge in SLMs poses a significant challenge. While current LLMs are primarily geared toward processing textual data, multimodal LLMs that incorporate time series data, especially electronic health records (EHRs), are still evolving. To tackle these limitations, we introduce ClinRaGen, an SLM optimized for multimodal rationale generation in disease diagnosis. ClinRaGen incorporates a unique knowledge-augmented attention mechanism to merge domain knowledge with time series EHR data, utilizing a stepwise rationale distillation strategy to produce both textual and time series-based clinical rationales. Our evaluations show that ClinRaGen markedly improves the SLM's capability to interpret multimodal EHR data and generate accurate clinical rationales, supporting more reliable disease diagnosis, advancing LLM applications in healthcare, and narrowing the performance divide between LLMs and SLMs., Comment: 11 pages. 4 figures

Music generation has progressed significantly, especially in the domain of audio generation. However, generating symbolic music that is both long-structured and expressive remains a significant challenge. In this paper, we propose PerceiverS (Segmentation and Scale), a novel architecture designed to address this issue by leveraging both Effective Segmentation and Multi-Scale attention mechanisms. Our approach enhances symbolic music generation by simultaneously learning long-term structural dependencies and short-term expressive details. By combining cross-attention and self-attention in a Multi-Scale setting, PerceiverS captures long-range musical structure while preserving performance nuances. The proposed model, evaluated on datasets like Maestro, demonstrates improvements in generating coherent and diverse music with both structural consistency and expressive variation. The project demos and the generated music samples can be accessed through the link: https://perceivers.github.io.

Next to the $\pi^0$ pole, $\eta$ and $\eta'$ intermediate states give rise to the leading singularities of the hadronic light-by-light tensor, resulting in sizable contributions to the anomalous magnetic moment of the muon $a_\mu$. The strength of the poles is determined by the respective transition form factors (TFFs) to two (virtual) photons. We present a calculation of these TFFs that implements a number of low- and high-energy constraints, including the $\eta^{(\prime)}\to\gamma\gamma$ decay widths, $\eta^{(\prime)}\to\pi^+\pi^-\gamma$ spectra, chiral symmetry for the $\eta^{(\prime)}\to2(\pi^+\pi^-)$ amplitudes, vector-meson couplings, and asymptotic limits. Crucially, we investigate the role of the leading left-hand singularity generated by the exchange of the $a_2$ tensor meson, yielding, for the first time, an estimate of the associated factorization-breaking corrections. Our final results, $a_\mu^{\eta\text{-pole}}=14.7(9)\times 10^{-11}$ and $a_\mu^{\eta'\text{-pole}}=13.5(7)\times 10^{-11}$, conclude a dedicated effort to evaluate the pseudoscalar-pole contributions to hadronic light-by-light scattering using dispersion relations, amounting to a combined $a_\mu^{\text{PS-poles}}=91.2^{+2.9}_{-2.4}\times 10^{-11}$., Comment: 8 pages, 3 figures

Time-varying media break the temporal translation symmetry of wave propagation in materials, enabling advanced wave manipulations. However, this novel phenomenon has been rarely explored in magnonic systems due to the significant challenge of achieving a sudden and prominent change in magnon dispersion within materials. Here, we drive a ferrimagnet with periodic pump pulses to construct time-varying strong coupling between two magnon modes. We observe a change in the beats of Rabi-like oscillations near the pulse edges, indicating the time-varying strong magnon coupling and the formation of time interfaces. Using a frequency comb spectroscopy technique developed in this work, we characterize the frequency conversion of magnon modes induced by the time-varying strong coupling effect. Moreover, we construct time slits with adjacent time interfaces and demonstrate, for the first time, the double-slit time diffraction of magnon modes. The frequency spacing of the multiplied magnon modes inversely correlates with the separation between two time slits, analogous to the well-known Yang's double-slit experiment. These findings rely solely on the time-varying strong magnon coupling, independent of device reconfiguration. Our results open avenues for applications such as all-magnetic mixers or on-chip GHz sources.

Molecular docking enables virtual screening of compound libraries to identify potential ligands that target proteins of interest, a crucial step in drug development; however, as the size of the compound library increases, the computational complexity of traditional docking models increases. Deep learning algorithms can provide data-driven research and development models to increase the speed of the docking process. Unfortunately, few models can achieve superior screening performance compared to that of traditional models. Therefore, a novel deep learning-based docking approach named Dockformer is introduced in this study. Dockformer leverages multimodal information to capture the geometric topology and structural knowledge of molecules and can directly generate binding conformations with the corresponding confidence measures in an end-to-end manner. The experimental results show that Dockformer achieves success rates of 90.53\% and 82.71\% on the PDBbind core set and PoseBusters benchmarks, respectively, and more than a 100-fold increase in the inference process speed, outperforming almost all state-of-the-art docking methods. In addition, the ability of Dockformer to identify the main protease inhibitors of coronaviruses is demonstrated in a real-world virtual screening scenario. Considering its high docking accuracy and screening efficiency, Dockformer can be regarded as a powerful and robust tool in the field of drug design., Comment: 14 pages, 10 figures

Most existing DOA estimation methods assume ideal source incident angles with minimal noise. Moreover, directly using pre-estimated angles to calculate weighted coefficients can lead to performance loss. Thus, a green multi-modal (MM) fusion DOA framework is proposed to realize a more practical, low-cost and high time-efficiency DOA estimation for a H$^2$AD array. Firstly, two more efficient clustering methods, global maximum cos\_similarity clustering (GMaxCS) and global minimum distance clustering (GMinD), are presented to infer more precise true solutions from the candidate solution sets. Based on this, an iteration weighted fusion (IWF)-based method is introduced to iteratively update weighted fusion coefficients and the clustering center of the true solution classes by using the estimated values. Particularly, the coarse DOA calculated by fully digital (FD) subarray, serves as the initial cluster center. The above process yields two methods called MM-IWF-GMaxCS and MM-IWF-GMinD. To further provide a higher-accuracy DOA estimation, a fusion network (fusionNet) is proposed to aggregate the inferred two-part true angles and thus generates two effective approaches called MM-fusionNet-GMaxCS and MM-fusionNet-GMinD. The simulation outcomes show the proposed four approaches can achieve the ideal DOA performance and the CRLB. Meanwhile, proposed MM-fusionNet-GMaxCS and MM-fusionNet-GMinD exhibit superior DOA performance compared to MM-IWF-GMaxCS and MM-IWF-GMinD, especially in extremely-low SNR range.

Weather radar data synthesis can fill in data for areas where ground observations are missing. Existing methods often employ reconstruction-based approaches with MSE loss to reconstruct radar data from satellite observation. However, such methods lead to over-smoothing, which hinders the generation of high-frequency details or high-value observation areas associated with convective weather. To address this issue, we propose a two-stage diffusion-based method called DiffSR. We first pre-train a reconstruction model on global-scale data to obtain radar estimation and then synthesize radar reflectivity by combining radar estimation results with satellite data as conditions for the diffusion model. Extensive experiments show that our method achieves state-of-the-art (SOTA) results, demonstrating the ability to generate high-frequency details and high-value areas.

Extreme weather events have led to long-duration outages in the distribution system (DS), necessitating novel approaches to blackstart and restore the system. Existing blackstart solutions utilize blackstart units to establish multiple microgrids, sequentially energize non-blackstart units, and restore loads. However, these approaches often result in isolated microgrids. In DER-aided blackstart, the continuous operation of these microgrids is uncertain due to the finite energy capacity of commonly used blackstart units, such as battery energy storage (BES)-based grid-forming inverters (GFMIs). To address this issue, this article proposes a holistic blackstart and restoration framework that incorporates synchronization between microgrids and the entire DS with the transmission grid (TG). To support synchronization, we leveraged virtual synchronous generator-based control for GFMIs to estimate their frequency response to load pick-up events using only initial/final quasi-steady-state points. Subsequently, a synchronization switching condition was developed to model synchronizing switches, aligning them seamlessly with a linearized branch flow problem. Finally, we designed a bottom-up blackstart and restoration framework that considers the switching structure of the DS, energizing/synchronizing switches, DERs with grid-following inverters, and BES-based GFMIs with frequency security constraints. The proposed framework is validated in IEEE-123-bus system, considering cases with two and four GFMIs under various TG recovery instants.

The rapid evolution of artificial intelligence, particularly large language models, presents unprecedented opportunities for materials science research. We proposed and developed an AI materials scientist named MatPilot, which has shown encouraging abilities in the discovery of new materials. The core strength of MatPilot is its natural language interactive human-machine collaboration, which augments the research capabilities of human scientist teams through a multi-agent system. MatPilot integrates unique cognitive abilities, extensive accumulated experience, and ongoing curiosity of human-beings with the AI agents' capabilities of advanced abstraction, complex knowledge storage and high-dimensional information processing. It could generate scientific hypotheses and experimental schemes, and employ predictive models and optimization algorithms to drive an automated experimental platform for experiments. It turns out that our system demonstrates capabilities for efficient validation, continuous learning, and iterative optimization.

Machine learning models deployed in open-world scenarios often encounter unfamiliar conditions and perform poorly in unanticipated situations. As AI systems advance and find application in safety-critical domains, effectively handling out-of-distribution (OOD) data is crucial to building open-world learning systems. In this work, we introduce ALOE, a novel active learning algorithm for open-world environments designed to enhance model adaptation by incorporating new OOD classes via a two-stage approach. First, diversity sampling selects a representative set of examples, followed by energy-based OOD detection to prioritize likely unknown classes for annotation. This strategy accelerates class discovery and learning, even under constrained annotation budgets. Evaluations on three long-tailed image classification benchmarks demonstrate that ALOE outperforms traditional active learning baselines, effectively expanding known categories while balancing annotation cost. Our findings reveal a crucial tradeoff between enhancing known-class performance and discovering new classes, setting the stage for future advancements in open-world machine learning.

Efficient comparison of spherical probability distributions becomes important in fields such as computer vision, geosciences, and medicine. Sliced optimal transport distances, such as spherical and stereographic spherical sliced Wasserstein distances, have recently been developed to address this need. These methods reduce the computational burden of optimal transport by slicing hyperspheres into one-dimensional projections, i.e., lines or circles. Concurrently, linear optimal transport has been proposed to embed distributions into \( L^2 \) spaces, where the \( L^2 \) distance approximates the optimal transport distance, thereby simplifying comparisons across multiple distributions. In this work, we introduce the Linear Spherical Sliced Optimal Transport (LSSOT) framework, which utilizes slicing to embed spherical distributions into \( L^2 \) spaces while preserving their intrinsic geometry, offering a computationally efficient metric for spherical probability measures. We establish the metricity of LSSOT and demonstrate its superior computational efficiency in applications such as cortical surface registration, 3D point cloud interpolation via gradient flow, and shape embedding. Our results demonstrate the significant computational benefits and high accuracy of LSSOT in these applications.

Feature space is an environment where data points are vectorized to represent the original dataset. Reconstructing a good feature space is essential to augment the AI power of data, improve model generalization, and increase the availability of downstream ML models. Existing literature, such as feature transformation and feature selection, is labor-intensive (e.g., heavy reliance on empirical experience) and mostly designed for tabular data. Moreover, these methods regard data samples as independent, which ignores the unique topological structure when applied to graph data, thus resulting in a suboptimal reconstruction feature space. Can we consider the topological information to automatically reconstruct feature space for graph data without heavy experiential knowledge? To fill this gap, we leverage topology-aware reinforcement learning to automate and optimize feature space reconstruction for graph data. Our approach combines the extraction of core subgraphs to capture essential structural information with a graph neural network (GNN) to encode topological features and reduce computing complexity. Then we introduce three reinforcement agents within a hierarchical structure to systematically generate meaningful features through an iterative process, effectively reconstructing the feature space. This framework provides a principled solution for attributed graph feature space reconstruction. The extensive experiments demonstrate the effectiveness and efficiency of including topological awareness.

The Earth's weather system encompasses intricate weather data modalities and diverse weather understanding tasks, which hold significant value to human life. Existing data-driven models focus on single weather understanding tasks (e.g., weather forecasting). Although these models have achieved promising results, they fail to tackle various complex tasks within a single and unified model. Moreover, the paradigm that relies on limited real observations for a single scenario hinders the model's performance upper bound. In response to these limitations, we draw inspiration from the in-context learning paradigm employed in state-of-the-art visual foundation models and large language models. In this paper, we introduce the first generalist weather foundation model (WeatherGFM), designed to address a wide spectrum of weather understanding tasks in a unified manner. More specifically, we initially unify the representation and definition of the diverse weather understanding tasks. Subsequently, we devised weather prompt formats to manage different weather data modalities, namely single, multiple, and temporal modalities. Finally, we adopt a visual prompting question-answering paradigm for the training of unified weather understanding tasks. Extensive experiments indicate that our WeatherGFM can effectively handle up to ten weather understanding tasks, including weather forecasting, super-resolution, weather image translation, and post-processing. Our method also showcases generalization ability on unseen tasks.

Sensing-assisted communication is critical to enhance the system efficiency in integrated sensing and communication (ISAC) systems. However, most existing literature focuses on large-scale channel sensing, without considering the impacts of small-scale channel aging. In this paper, we investigate a dual-scale channel estimation framework for sensing-assisted communication, where both large-scale channel sensing and small-scale channel aging are considered. By modeling the channel aging effect with block fading and incorporating CRB (Cram\'er-Rao bound)-based sensing errors, we optimize both the time duration of large-scale detection and the frequency of small-scale update within each subframe to maximize the achievable rate while satisfying sensing requirements. Since the formulated optimization problem is non-convex, we propose a two-dimensional search-based optimization algorithm to obtain the optimal solution. Simulation results demonstrate the superiority of our proposed optimal design over three counterparts., Comment: 9 pages, 4 figures, conference

In a setting with a multi-valued outcome, treatment and instrument, this paper considers the problem of inference for a general class of treatment effect parameters. The class of parameters considered are those that can be expressed as the expectation of a function of the response type conditional on a generalized principal stratum. Here, the response type simply refers to the vector of potential outcomes and potential treatments, and a generalized principal stratum is a set of possible values for the response type. In addition to instrument exogeneity, the main substantive restriction imposed rules out certain values for the response types in the sense that they are assumed to occur with probability zero. It is shown through a series of examples that this framework includes a wide variety of parameters and assumptions that have been considered in the previous literature. A key result in our analysis is a characterization of the identified set for such parameters under these assumptions in terms of existence of a non-negative solution to linear systems of equations with a special structure. We propose methods for inference exploiting this special structure and recent results in Fang et al. (2023).

With the introduction of transformer-based models for vision and language tasks, such as LLaVA and Chameleon, there has been renewed interest in the discrete tokenized representation of images. These models often treat image patches as discrete tokens, analogous to words in natural language, learning joint alignments between visual and human languages. However, little is known about the statistical behavior of these visual languages - whether they follow similar frequency distributions, grammatical structures, or topologies as natural languages. In this paper, we take a natural-language-centric approach to analyzing discrete visual languages and uncover striking similarities and fundamental differences. We demonstrate that, although visual languages adhere to Zipfian distributions, higher token innovation drives greater entropy and lower compression, with tokens predominantly representing object parts, indicating intermediate granularity. We also show that visual languages lack cohesive grammatical structures, leading to higher perplexity and weaker hierarchical organization compared to natural languages. Finally, we demonstrate that, while vision models align more closely with natural languages than other models, this alignment remains significantly weaker than the cohesion found within natural languages. Through these experiments, we demonstrate how understanding the statistical properties of discrete visual languages can inform the design of more effective computer vision models.