Search

Purpose: The purpose of the study was to evaluate the implementation and impact of a computer science-integrated math curriculum, the Beauty and Joy of Computing (BJC), combined with curriculum and professional development support for Computer Science Principles (CSP) teachers, funded by an Innovation and Research (EIR) grant. Methods: The study used a randomized controlled trial design where schools from the IDEA public schools were randomly assigned to use the BJC curriculum (treatment) or, the business as usual, Code.org (comparison). The study compared AP CSP test scores and student attitudes towards CSP between students in the treatment and comparison group. Results: The study found that the average AP CSP scores were low in both the treatment and comparison groups. About one-quarter of test takers (25%) earned a passing score of 3 or higher (compared to national average of 64%). The results of the analyses show that there were no statistically significant differences between the BJC and comparison groups. The study also showed that students in the treatment group responded more favorably on all student engagement in CSP constructs than comparison students, the size of the differences between the treatment and comparison condition were small and none were statistically significant. Implications: Since the evaluation examined student outcomes in the same year that the new curriculum was implemented for this first time, finding significant impacts on student outcomes may require more time. Nevertheless, the results of this evaluation inform IDEA staff, practitioners, and other researchers on the intervention's effectiveness, and they provide insights on how to improve curriculum use to further improve student outcomes.

Purpose: The purpose of the study was to evaluate the implementation and impact of the IDEA Public Schools' Mathematics Curriculum Redesign (MCR) effort, funded by an Innovation and Research (EIR) grant. Methods: The study used a quasi-experimental matching design to examine the effect of MCR on student achievement outcomes. The study compared outcomes between the two cohorts of students at IDEA Public Schools that piloted the MCR and matched cohorts of students in IDEA schools that had delayed implementation of MCR. Results:?The study found statistically significant differences in IDEA Geometry test scores (ES = 0.39) between treatment and comparison group students in Grade 9 and on AP Calculus exam scores between treatment and comparison group students in Grade 12 (ES = 0.57). The study also found that the MCR program met the evaluation threshold for fidelity of implementation for the two out of three key program components (development of redesigned math curriculum and teacher use of math curriculum) in some years. The program did not meet the evaluation threshold for fidelity of implementation for the third key program components (teacher training and professional development to use redesigned math curriculum) in any of the years. Implications:?Because curriculum development and implementation are ongoing and iterative, realizing all of the benefits is not immediate and may take more time to achieve desired results. Continuous improvement of the curriculum and consistent supports to teachers will contribute to continued benefits for teachers and students while moving toward reaching anticipated student outcomes.

Most selective colleges implemented test-optional admissions during the pandemic, making college entrance exam scores optional for applicants. We draw on descriptive, two-way fixed effects, and event study methods to examine variation in test-optional implementation during the pandemic and how implementation relates to selectivity and enrollment. For "test-optional" colleges during the pandemic, we found substantial variation in policy type (e.g., test optional, test free) and whether the policy extended to all applicants and scholarship consideration. Findings suggest test-optional implementation related to increases in Black student enrollment, mostly at moderately selective colleges and when policies extended to all applicants and scholarships. At highly selective colleges, findings suggest test-optional implementation related to an increase in applications but not consistent gains in enrollment.

Natural Language to Visualization (NL2Vis) seeks to convert natural-language descriptions into visual representations of given tables, empowering users to derive insights from large-scale data. Recent advancements in Large Language Models (LLMs) show promise in automating code generation to transform tabular data into accessible visualizations. However, they often struggle with complex queries that require reasoning across multiple tables. To address this limitation, we propose a collaborative agent workflow, termed nvAgent, for NL2Vis. Specifically, nvAgent comprises three agents: a processor agent for database processing and context filtering, a composer agent for planning visualization generation, and a validator agent for code translation and output verification. Comprehensive evaluations on the new VisEval benchmark demonstrate that nvAgent consistently surpasses state-of-the-art baselines, achieving a 7.88% improvement in single-table and a 9.23% improvement in multi-table scenarios. Qualitative analyses further highlight that nvAgent maintains nearly a 20% performance margin over previous models, underscoring its capacity to produce high-quality visual representations from complex, heterogeneous data sources.

Coordinating multiple agents to collaboratively maximize submodular functions in unpredictable environments is a critical task with numerous applications in machine learning, robot planning and control. The existing approaches, such as the OSG algorithm, are often hindered by their poor approximation guarantees and the rigid requirement for a fully connected communication graph. To address these challenges, we firstly present a $\textbf{MA-OSMA}$ algorithm, which employs the multi-linear extension to transfer the discrete submodular maximization problem into a continuous optimization, thereby allowing us to reduce the strict dependence on a complete graph through consensus techniques. Moreover, $\textbf{MA-OSMA}$ leverages a novel surrogate gradient to avoid sub-optimal stationary points. To eliminate the computationally intensive projection operations in $\textbf{MA-OSMA}$, we also introduce a projection-free $\textbf{MA-OSEA}$ algorithm, which effectively utilizes the KL divergence by mixing a uniform distribution. Theoretically, we confirm that both algorithms achieve a regret bound of $\widetilde{O}(\sqrt{\frac{C_{T}T}{1-\beta}})$ against a $(\frac{1-e^{-c}}{c})$-approximation to the best comparator in hindsight, where $C_{T}$ is the deviation of maximizer sequence, $\beta$ is the spectral gap of the network and $c$ is the joint curvature of submodular objectives. This result significantly improves the $(\frac{1}{1+c})$-approximation provided by the state-of-the-art OSG algorithm. Finally, we demonstrate the effectiveness of our proposed algorithms through simulation-based multi-target tracking., Comment: Accepted to ICLR 2025

The core-collapse supernova remnant (SNR) Cassiopeia A (Cas A) is one of the brightest galactic radio sources with an angular radius of $\sim$ 2.5 $\arcmin$. Although no extension of this source has been detected in the $\gamma$-ray band, using more than 1000 days of LHAASO data above $\sim 0.8$ TeV, we find that its spectrum is significantly softer than those obtained with Imaging Air Cherenkov Telescopes (IACTs) and its flux near $\sim 1$ TeV is about two times higher. In combination with analyses of more than 16 years of \textit{Fermi}-LAT data covering $0.1 \, \mathrm{GeV} - 1 \, \mathrm{TeV}$, we find that the spectrum above 30 GeV deviates significantly from a single power-law, and is best described by a smoothly broken power-law with a spectral index of $1.90 \pm 0.15_\mathrm{stat}$ ($3.41 \pm 0.19_\mathrm{stat}$) below (above) a break energy of $0.63 \pm 0.21_\mathrm{stat} \, \mathrm{TeV}$. Given differences in the angular resolution of LHAASO-WCDA and IACTs, TeV $\gamma$-ray emission detected with LHAASO may have a significant contribution from regions surrounding the SNR illuminated by particles accelerated earlier, which, however, are treated as background by IACTs. Detailed modelling can be used to constrain acceleration processes of TeV particles in the early stage of SNR evolution.

The Quantum Approximate Optimization Algorithm (QAOA) is a well-known hybrid quantum-classical algorithm for combinatorial optimization problems. Improving QAOA involves enhancing its approximation ratio while addressing practical constraints of Noisy Intermediate Scale Quantum (NISQ) devices, such as minimizing the number of two-qubit gates and reducing circuit depth. Although existing research has optimized designs for phase and mixer operators to improve performance, challenges remain, particularly concerning the excessive use of two-qubit gates in the construction of phase operators. To address these issues, we introduce a Dynamic Adaptive Phase Operator (DAPO) algorithm, which dynamically constructs phase operators based on the output of previous layers and neighborhood search approach, optimizing the problem Hamiltonian more efficiently. By using solutions generated by QAOA itself to simplify the problem Hamiltonian at each layer, the algorithm captures the problem's structural properties more effectively, progressively steering the solution closer to the optimal target. Experimental results on MaxCut and NAE3SAT problems show that DAPO achieves higher approximation ratios and significantly reduces two-qubit RZZ gates, especially in dense graphs. Compared to vanilla QAOA, DAPO uses only 66% of RZZ gates at the same depth while delivering better results, demonstrating its potential for efficient combinatorial optimization in the NISQ era.

The GPT-4 technical report from OpenAI suggests that model performance on specific tasks can be predicted prior to training, though methodologies remain unspecified. This approach is crucial for optimizing resource allocation and ensuring data alignment with target tasks. To achieve this vision, we focus on predicting performance on Closed-book Question Answering (CBQA) tasks, which are closely tied to pre-training data and knowledge retention. We address three major challenges: 1) mastering the entire pre-training process, especially data construction; 2) evaluating a model's knowledge retention; and 3) predicting task-specific knowledge retention using only information available prior to training. To tackle these challenges, we pre-train three large language models (i.e., 1.6B, 7B, and 13B) using 560k dollars and 520k GPU hours. We analyze the pre-training data with knowledge triples and assess knowledge retention using established methods. Additionally, we introduce the SMI metric, an information-theoretic measure that quantifies the relationship between pre-training data, model size, and task-specific knowledge retention. Our experiments reveal a strong linear correlation ($\text{R}^2 > 0.84$) between the SMI metric and the model's accuracy on CBQA tasks across models of varying sizes (i.e., 1.1B, 1.6B, 7B, and 13B). The dataset, model, and code are available at https://github.com/yuhui1038/SMI.

The first measurement of the $CP$ asymmetry of the decay rate ($A_{CP}$) and the $CP$ average ($\Sigma A_{\text{FB}}$) and $CP$ asymmetry ($\Delta A_{\text{FB}}$) of the forward-backward asymmetry in the muon system of $\mathit{\Lambda}^+_c\to p\mu^+\mu^-$ decays is reported. The measurement is performed using a data sample of proton-proton collisions, recorded by the LHCb experiment from 2016 to 2018 at a center-of-mass energy of 13$\text{ TeV}$, which corresponds to an integrated luminosity of 5.4$\text{ fb}^{-1}$. The asymmetries are measured in two regions of dimuon mass near the $\phi$-meson mass peak. The dimuon-mass integrated results are \begin{align*} A_{CP} &= (-1.1 \pm 4.0 \pm 0.5)\%,\\ \Sigma A_{\text{FB}} &= (\phantom{-}3.9 \pm 4.0 \pm 0.6)\%,\\ \Delta A_{\text{FB}} &= (\phantom{-}3.1 \pm 4.0 \pm 0.4)\%, \end{align*} where the first uncertainty is statistical and the second systematic. The results are consistent with the conservation of $CP$ symmetry and the Standard Model expectations., Comment: All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3473/ (LHCb public pages)

Large pretrained language models such as BERT suffer from slow inference and high memory usage, due to their huge size. Recent approaches to compressing BERT rely on iterative pruning and knowledge distillation, which, however, are often too complicated and computationally intensive. This paper proposes a novel semi-structured one-shot pruning method for BERT, called $\textit{Permutation and Grouping for BERT}$ (PGB), which achieves high compression efficiency and sparsity while preserving accuracy. To this end, PGB identifies important groups of individual weights by permutation and prunes all other weights as a structure in both multi-head attention and feed-forward layers. Furthermore, if no important group is formed in a particular layer, PGB drops the entire layer to produce an even more compact model. Our experimental results on BERT$_{\text{BASE}}$ demonstrate that PGB outperforms the state-of-the-art structured pruning methods in terms of computational cost and accuracy preservation.

By analyzing 7.93 $\rm fb^{-1}$ of $e^+e^-$ collision data collected at the center-of-mass energy of 3.773 GeV with the BESIII detector operated at the BEPCII collider, we report the observation of the semimuonic decays of $D^+\to \bar K_1(1270)^0\mu^+\nu_\mu$ and $D^0\to K_1(1270)^-\mu^+\nu_\mu$ with statistical significances of $12.5\sigma$ and $6.0\sigma$, respectively. Their decay branching fractions are determined to be ${\mathcal B}[D^{+}\to \bar{K}_1(1270)^0 \mu^{+}\nu_{\mu}]=(2.36\pm0.20^{+0.18}_{-0.27}\pm 0.48)\times10^{-3}$ and ${\mathcal B}[D^{0}\to K_1(1270)^{-} \mu^{+}\nu_{\mu}]=(0.78\pm0.11^{+0.05}_{-0.09}\pm 0.15)\times10^{-3}$, where the first and second uncertainties are statistical and systematic, respectively, and the third originates from the input branching fraction of $\bar K_{1}(1270)^0\to K^- \pi^+\pi^0$ or $K_1(1270)^-\to K^-\pi^+\pi^-$. Combining our branching fractions with the previous measurements of ${\mathcal B}[D^+\to \bar K_1(1270)^0e^+\nu_{e}]$ and ${\mathcal B}[D^0\to K_1(1270)^-e^+\nu_{e}]$, we determine the branching fraction ratios to be ${\mathcal B}[D^+\to \bar K_1(1270)^0\mu^+\nu_{\mu}]/{\mathcal B}[D^+\to \bar K_1(1270)^0e^+\nu_{e}]=1.03 \pm 0.14 \substack{+0.11\\-0.15}$ and ${\mathcal B}[D^0\to K_1(1270)^-\mu^+\nu_{\mu}]/{\mathcal B}[D^0\to K_1(1270)^-e^+\nu_{e}]=0.74\pm 0.13 \substack{+0.08\\-0.13}$. Using the branching fractions measured in this work and the world-average lifetimes of the $D^+$ and $D^0$ mesons, we determine the semimuonic partial decay width ratio to be $\Gamma [D^+\to \bar K_1(1270)^0 \mu^+\nu_\mu]/\Gamma [D^0\to K_1(1270)^- \mu^+\nu_\mu]=1.22\pm 0.10\substack{+0.06\\-0.09}$, which is consistent with unity as predicted by isospin conservation., Comment: 10 pages, 2 figures

The foundation model has heralded a new era in artificial intelligence, pretraining a single model to offer cross-domain transferability on different datasets. Graph neural networks excel at learning graph data, the omnipresent non-Euclidean structure, but often lack the generalization capacity. Hence, graph foundation model is drawing increasing attention, and recent efforts have been made to leverage Large Language Models. On the one hand, existing studies primarily focus on text-attributed graphs, while a wider range of real graphs do not contain fruitful textual attributes. On the other hand, the sequential graph description tailored for the Large Language Model neglects the structural complexity, which is a predominant characteristic of the graph. Such limitations motivate an important question: Can we go beyond Large Language Models, and pretrain a universal model to learn the structural knowledge for any graph? The answer in the language or vision domain is a shared vocabulary. We observe the fact that there also exist shared substructures underlying graph domain, and thereby open a new opportunity of graph foundation model with structural vocabulary. The key innovation is the discovery of a simple yet effective structural vocabulary of trees and cycles, and we explore its inherent connection to Riemannian geometry. Herein, we present a universal pretraining model, RiemannGFM. Concretely, we first construct a novel product bundle to incorporate the diverse geometries of the vocabulary. Then, on this constructed space, we stack Riemannian layers where the structural vocabulary, regardless of specific graph, is learned in Riemannian manifold offering cross-domain transferability. Extensive experiments show the effectiveness of RiemannGFM on a diversity of real graphs., Comment: Accepted by WWW25

Dynamic interacting system modeling is important for understanding and simulating real world systems. The system is typically described as a graph, where multiple objects dynamically interact with each other and evolve over time. In recent years, graph Ordinary Differential Equations (ODE) receive increasing research attentions. While achieving encouraging results, existing solutions prioritize the traditional Euclidean space, and neglect the intrinsic geometry of the system and physics laws, e.g., the principle of entropy increasing. The limitations above motivate us to rethink the system dynamics from a fresh perspective of Riemannian geometry, and pose a more realistic problem of physics-informed dynamic system modeling, considering the underlying geometry and physics law for the first time. In this paper, we present a novel physics-informed Riemannian graph ODE for a wide range of entropy-increasing dynamic systems (termed as Pioneer). In particular, we formulate a differential system on the Riemannian manifold, where a manifold-valued graph ODE is governed by the proposed constrained Ricci flow, and a manifold preserving Gyro-transform aware of system geometry. Theoretically, we report the provable entropy non-decreasing of our formulation, obeying the physics laws. Empirical results show the superiority of Pioneer on real datasets., Comment: Accepted by AAAI25

The resurgence of interest in Kondo insulators has been driven by two major mysteries: the presence of metallic surface states and the observation of quantum oscillations. To further explore these mysteries, it is crucial to investigate another similar system beyond the two existing ones, SmB$_6$ and YbB$_{12}$. Here, we address this by reporting on a Kondo insulator, U$_3$Bi$_4$Ni$_3$. Our transport measurements reveal that a surface state emerges below 250 K and dominates transport properties below 150 K, which is well above the temperature scale of SmB$_6$ and YbB$_{12}$. At low temperatures, the surface conductivity is about one order of magnitude higher than the bulk. The robustness of the surface state indicates that it is inherently protected. The similarities and differences between U$_3$Bi$_4$Ni$_3$ and the other two Kondo insulators will provide valuable insights into the nature of metallic surface states in Kondo insulators and their interplay with strong electron correlations., Comment: Accepted to Science Advances

Bilevel optimization is characterized by a two-level optimization structure, where the upper-level problem is constrained by optimal lower-level solutions, and such structures are prevalent in real-world problems. The constraint by optimal lower-level solutions poses significant challenges, especially in noisy, constrained, and derivative-free settings, as repeating lower-level optimizations is sample inefficient and predicted lower-level solutions may be suboptimal. We present BILevel Bayesian Optimization (BILBO), a novel Bayesian optimization algorithm for general bilevel problems with blackbox functions, which optimizes both upper- and lower-level problems simultaneously, without the repeated lower-level optimization required by existing methods. BILBO samples from confidence-bounds based trusted sets, which bounds the suboptimality on the lower level. Moreover, BILBO selects only one function query per iteration, where the function query selection strategy incorporates the uncertainty of estimated lower-level solutions and includes a conditional reassignment of the query to encourage exploration of the lower-level objective. The performance of BILBO is theoretically guaranteed with a sublinear regret bound for commonly used kernels and is empirically evaluated on several synthetic and real-world problems.

Code generation has largely improved development efficiency in the era of large language models (LLMs). With the ability to follow instructions, current LLMs can be prompted to generate code solutions given detailed descriptions in natural language. Many research efforts are being devoted to improving the correctness of LLM-generated code, and many benchmarks are proposed to evaluate the correctness comprehensively. Despite the focus on correctness, the time efficiency of LLM-generated code solutions is under-explored. Current correctness benchmarks are not suitable for time efficiency evaluation since their test cases cannot well distinguish the time efficiency of different code solutions. Besides, the current execution time measurement is not stable and comprehensive, threatening the validity of the time efficiency evaluation. To address the challenges in the time efficiency evaluation of code generation, we propose COFFE, a code generation benchmark for evaluating the time efficiency of LLM-generated code solutions. COFFE contains 398 and 358 problems for function-level and file-level code generation, respectively. To improve the distinguishability, we design a novel stressful test case generation approach with contracts and two new formats of test cases to improve the accuracy of generation. For the time evaluation metric, we propose efficienct@k based on CPU instruction count to ensure a stable and solid comparison between different solutions. We evaluate 14 popular LLMs on COFFE and identify four findings. Based on the findings, we draw some implications for LLM researchers and software practitioners to facilitate future research and usage of LLMs in code generation., Comment: This paper has been accepted by FSE 2025

Janus transition metal dichalcogenides (JTMDs) monolayers have emerged as a new paradigm to broaden the family of two-dimensional (2D) materials. Despite numerous theoretical predictions of JTMDs, their experimental realization remains scarce, most probably due to intrinsic structural fragility. We identify a dependence of the structural stability of 1H-phase JTMDs on the transition metal group, with Group-VIB-based monolayers exhibiting robust stability, as evidenced by the successful synthesized MoSSe and WSSe. The group-dependent stability arises from the competition between metal-ligand ionic bonding and ligand-ligand covalent bonding, as well as the high-energy d-electron orbital splitting. We propose an electron configuration that describes the interactions of electrons near the Fermi level to correlate the stability, and introduce an electron compensation strategy to stabilize certain unstable JTMDs systems. Guided by the electronic origin of stability, we predict a family of stable 2D Janus transition metal halides with intrinsic ferromagnetic valley properties. This work bridges the gap between electronic structure and stability predictions, and extends the design rules for synthesizing 2D Janus materials., Comment: 17 pages,6 figures

Large language models, employed as multiple agents that interact and collaborate with each other, have excelled at solving complex tasks. The agents are programmed with prompts that declare their functionality, along with the topologies that orchestrate interactions across agents. Designing prompts and topologies for multi-agent systems (MAS) is inherently complex. To automate the entire design process, we first conduct an in-depth analysis of the design space aiming to understand the factors behind building effective MAS. We reveal that prompts together with topologies play critical roles in enabling more effective MAS design. Based on the insights, we propose Multi-Agent System Search (MASS), a MAS optimization framework that efficiently exploits the complex MAS design space by interleaving its optimization stages, from local to global, from prompts to topologies, over three stages: 1) block-level (local) prompt optimization; 2) workflow topology optimization; 3) workflow-level (global) prompt optimization, where each stage is conditioned on the iteratively optimized prompts/topologies from former stages. We show that MASS-optimized multi-agent systems outperform a spectrum of existing alternatives by a substantial margin. Based on the MASS-found systems, we finally propose design principles behind building effective multi-agent systems., Comment: 11 pages, 7 figures, 1 table (30 pages, 9 figures, 5 tables including references and appendices)

Effective network planning and sensing in wireless networks require resource-intensive site surveys for data collection. An alternative is Radio-Frequency (RF) signal spatial propagation modeling, which computes received signals given transceiver positions in a scene (e.g.s a conference room). We identify a fundamental trade-off between scalability and fidelity in the state-of-the-art method. To address this issue, we explore leveraging 3D Gaussian Splatting (3DGS), an advanced technique for the image synthesis of 3D scenes in real-time from arbitrary camera poses. By integrating domain-specific insights, we design three components for adapting 3DGS to the RF domain, including Gaussian-based RF scene representation, gradient-guided RF attribute learning, and RF-customized CUDA for ray tracing. Building on them, we develop RFSPM, an end-to-end framework for scalable RF signal Spatial Propagation Modeling. We evaluate RFSPM in four field studies and two applications across RFID, BLE, LoRa, and 5G, covering diverse frequencies, antennas, signals, and scenes. The results show that RFSPM matches the fidelity of the state-of-the-art method while reducing data requirements, training GPU-hours, and inference latency by up to 9.8\,$\times$, 18.6\,$\times$, and 84.4\,$\times$, respectively.

We consider the thrust ($T$) distribution in electron-positron ($e^+e^-$) annihilation into hadrons and we perform the all-order resummation of the large logarithms of $1-T$ up to next-to-next-to-next-to-next-to-leading logarithmic (N$^4$LL) accuracy in QCD. We consistently combine resummed predictions with the known fixed-order results up to next-to-next-to-leading order (NNLO). All perturbative terms up to order $\alpha_S^3$ are included in our calculation which, thanks to a unitarity constraint, exactly reproduce after integration over the variable $T$ the next-to-next-to-next-to-leading order (N$^3$LO) result for the total cross section of $e^+e^-$ into hadrons. We resum the large logarithms in the Laplace-conjugated space and compare our results with those obtained with the analytic resummation formalism in the physical ($T$) space. We find that the differences in the spectra obtained with the two different formalisms are sizable. Non-perturbative corrections have been included through an analytic hadronization model depending on two free parameters. Finally, we present a comparison of our spectra with experimental data at the $Z$-boson mass ($m_Z$) energy, which enables us to extract the value of the QCD coupling $\alpha_S(m_Z^2)=0.1181 \pm 0.0018$ fully consistent with the world average., Comment: 16 pages, 2 figures. Minor corrections, added references, results unchanged. Version submitted to journal

The Hong-Ou-Mandel effect is a paradigmatic quantum phenomenon demonstrating the interference of two indistinguishable photons that are linearly coupled at a 50:50 beam splitter. Here, we transpose such a two-particle quantum interference effect to the nonlinear regime, when two single photons are impinging on a parametric down-conversion crystal. Formally, this transposition amounts to exchanging space and time variables, giving rise to an unknown form of timelike quantum interference. The two-photon component of the output state is a superposition of the incident photons being either transmitted or reborn, that is, replaced by indistinguishable substitutes due to their interaction with the nonlinear crystal. We experimentally demonstrate the suppression of the probability of detecting precisely one photon pair when the amplification gain is tuned to 2, which arises from the destructive interference between the transmitted and reborn photon pairs. This heretofore unobserved quantum manifestation of indistinguishability in time pushes nonlinear quantum interference towards a new regime with multiple photons. Hence, composing this effect with larger linear optical circuits should provide a tool to generate multimode quantum non-Gaussian states, which are essential resources for photonic quantum computers.

Synthetic Aperture Radar (SAR) and optical image registration is essential for remote sensing data fusion, with applications in military reconnaissance, environmental monitoring, and disaster management. However, challenges arise from differences in imaging mechanisms, geometric distortions, and radiometric properties between SAR and optical images. As image resolution increases, fine SAR textures become more significant, leading to alignment issues and 3D spatial discrepancies. Two major gaps exist: the lack of a publicly available multi-resolution, multi-scene registration dataset and the absence of systematic analysis of current methods. To address this, the MultiResSAR dataset was created, containing over 10k pairs of multi-source, multi-resolution, and multi-scene SAR and optical images. Sixteen state-of-the-art algorithms were tested. Results show no algorithm achieves 100% success, and performance decreases as resolution increases, with most failing on sub-meter data. XoFTR performs best among deep learning methods (40.58%), while RIFT performs best among traditional methods (66.51%). Future research should focus on noise suppression, 3D geometric fusion, cross-view transformation modeling, and deep learning optimization for robust registration of high-resolution SAR and optical images. The dataset is available at https://github.com/betterlll/Multi-Resolution-SAR-dataset-., Comment: 48 pages, 10 figures

Originally motivated by the (fold-)transversal related initialisation of logical surface code $|Y\rangle$ states from [arXiv:1603.02286, arXiv:2302.07395, arXiv:2302.12292], which was then explicitly extended to the fold-transversal $S$ gate implementation in [arXiv:2412.01391] for the rotated surface code, we employ ZX-calculus and Pauli web to understand the $|Y\rangle=S|+\rangle$ state transversal initialisation scheme.

Smoothness is crucial for attaining fast rates in first-order optimization. However, many optimization problems in modern machine learning involve non-smooth objectives. Recent studies relax the smoothness assumption by allowing the Lipschitz constant of the gradient to grow with respect to the gradient norm, which accommodates a broad range of objectives in practice. Despite this progress, existing generalizations of smoothness are restricted to Euclidean geometry with $\ell_2$-norm and only have theoretical guarantees for optimization in the Euclidean space. In this paper, we address this limitation by introducing a new $\ell*$-smoothness concept that measures the norm of Hessian in terms of a general norm and its dual, and establish convergence for mirror-descent-type algorithms, matching the rates under the classic smoothness. Notably, we propose a generalized self-bounding property that facilitates bounding the gradients via controlling suboptimality gaps, serving as a principal component for convergence analysis. Beyond deterministic optimization, we establish an anytime convergence for stochastic mirror descent based on a new bounded noise condition that encompasses the widely adopted bounded or affine noise assumptions., Comment: 59 pages, 2 figures

One-step shortcut diffusion models [Frans, Hafner, Levine and Abbeel, ICLR 2025] have shown potential in vision generation, but their reliance on first-order trajectory supervision is fundamentally limited. The Shortcut model's simplistic velocity-only approach fails to capture intrinsic manifold geometry, leading to erratic trajectories, poor geometric alignment, and instability-especially in high-curvature regions. These shortcomings stem from its inability to model mid-horizon dependencies or complex distributional features, leaving it ill-equipped for robust generative modeling. In this work, we introduce HOMO (High-Order Matching for One-Step Shortcut Diffusion), a game-changing framework that leverages high-order supervision to revolutionize distribution transportation. By incorporating acceleration, jerk, and beyond, HOMO not only fixes the flaws of the Shortcut model but also achieves unprecedented smoothness, stability, and geometric precision. Theoretically, we prove that HOMO's high-order supervision ensures superior approximation accuracy, outperforming first-order methods. Empirically, HOMO dominates in complex settings, particularly in high-curvature regions where the Shortcut model struggles. Our experiments show that HOMO delivers smoother trajectories and better distributional alignment, setting a new standard for one-step generative models.

Recent advances in long-context large language models (LLMs) have led to the emerging paradigm of many-shot in-context learning (ICL), where it is observed that scaling many more demonstrating examples beyond the conventional few-shot setup in the context can lead to performance benefits. However, despite its promise, it is unclear what aspects dominate the benefits and whether simply scaling to more examples is the most effective way of improving many-shot ICL. In this work, we first provide an analysis of the factors driving many-shot ICL, and we find that 1) many-shot performance can still be attributed to often a few disproportionately influential examples and 2) identifying such influential examples ("optimize") and using them as demonstrations to regenerate new examples ("generate") can lead to further improvements. Inspired by the findings, we propose BRIDGE, an algorithm that alternates between the optimize step with Bayesian optimization to discover the influential sets of examples and the generate step to reuse this set to expand the reasoning paths of the examples back to the many-shot regime automatically. On Gemini, Claude, and Mistral LLMs of different sizes, we show that BRIDGE to significant improvements across a diverse set of tasks, including symbolic reasoning, numerical reasoning, and code generation., Comment: Expanded version of the ICLR 2025 paper

It is widely accepted that spin-orbit coupling (SOC) generally locks spin and spatial degrees of freedom, as a result, the spin, despite being an axial vector, is fixed and cannot rotate independently, and the magnetic system should be described by magnetic space groups (MSGs). While as a new type of group, spin space groups (SSGs) have been introduced to approximately describe the symmetry of magnetic systems with negligible SOC, and received significant attention recently. In this work, we prove that in two cases of coplanar spin configurations, there are spin-only operations that strictly hold even with considerable Dzyaloshinskii-Moriya interaction (DMI), and the symmetry of their spin models could be described by the spin-coplanar SSG. In addition, we also find that for spin-collinear cases, regardless the strength of DMI, the magnon systems within the framework of linear spin wave theory (LSWT) also preserve the decoupled spin and spatial rotations, but the symmetry does not belong to the conventional definitions of collinear spin groups. Finally, we discuss the potential realization of these novel symmetries for magnetic candidate materials in rod, layer, and three-dimensional (3D) space groups. Our work extends the applicability of SSGs to magnetic materials with heavy elements, and provides new avenues for exploring novel physical phenomena in magnon topology and transport.

Paleoclimate records reveal a fuller range of natural climate variability than modern records and are essential for better understanding the modern climate change. However, most paleoclimate records are point-based proxies and lack the temporal resolution needed to analyze spatiotemporal changes in destructive extremes like tropical cyclones (TCs). Here we show that historical records by pre-industrial Chinese intellectuals help investigate long-term variability of TC landfalls in East Asia. Despite inherent limitations, these records show a landfalling TC climatology resembling modern observations in spatial-temporal distributions. Comparisons between the pre-industrial records (1776-1850), modern observations (1946-2020), and climate simulations reveal an earlier seasonal occurrence of modern TCs. However, the variations of seasonally aggregated landfall time show pronounced multi-century variations. The modern changes and multi-decade trends appear moderate compared to long-term variability in pre-industrial TC records, suggesting that an overreliance on modern data may lead to an underestimation of the full range of TC activity potentially arising from natural variability alone. Analyses of newly available climate data reveal associations between past landfalling TC activity and the large-scale climate variability of tropical ocean and extratropical land. These findings demonstrate the value of paleoclimate data for exploring natural variability in TC activity and inform the development of effective adaptation strategies for future climate change.

In multi-objective black-box optimization, the goal is typically to find solutions that optimize a set of T black-box objective functions, $f_1$, ..., $f_T$, simultaneously. Traditional approaches often seek a single Pareto-optimal set that balances trade-offs among all objectives. In this work, we introduce a novel problem setting that departs from this paradigm: finding a smaller set of K solutions, where K < T, that collectively "covers" the T objectives. A set of solutions is defined as "covering" if, for each objective $f_1$, ..., $f_T$, there is at least one good solution. A motivating example for this problem setting occurs in drug design. For example, we may have T pathogens and aim to identify a set of K < T antibiotics such that at least one antibiotic can be used to treat each pathogen. To address this problem, we propose Multi-Objective Coverage Bayesian Optimization (MOCOBO), a principled algorithm designed to efficiently find a covering set. We validate our approach through extensive experiments on challenging high-dimensional tasks, including applications in peptide and molecular design. Experiments demonstrate MOCOBO's ability to find high-performing covering sets of solutions. Additionally, we show that the small sets of K < T solutions found by MOCOBO can match or nearly match the performance of T individually optimized solutions for the same objectives. Our results highlight MOCOBO's potential to tackle complex multi-objective problems in domains where finding at least one high-performing solution for each objective is critical.

The evolution of large language models (LLMs) toward artificial superhuman intelligence (ASI) hinges on data reproduction, a cyclical process in which models generate, curate and retrain on novel data to refine capabilities. Current methods, however, risk getting stuck in a data reproduction trap: optimizing outputs within fixed human-generated distributions in a closed loop leads to stagnation, as models merely recombine existing knowledge rather than explore new frontiers. In this paper, we propose language games as a pathway to expanded data reproduction, breaking this cycle through three mechanisms: (1) \textit{role fluidity}, which enhances data diversity and coverage by enabling multi-agent systems to dynamically shift roles across tasks; (2) \textit{reward variety}, embedding multiple feedback criteria that can drive complex intelligent behaviors; and (3) \textit{rule plasticity}, iteratively evolving interaction constraints to foster learnability, thereby injecting continual novelty. By scaling language games into global sociotechnical ecosystems, human-AI co-evolution generates unbounded data streams that drive open-ended exploration. This framework redefines data reproduction not as a closed loop but as an engine for superhuman intelligence., Comment: This position paper argues that language games provide robust mechanism for achieving superhuman intelligence in large language models

Algorithms have played a central role in personalized recommendations on social media. However, they also present significant obstacles for content creators trying to predict and manage their audience reach. This issue is particularly challenging for marginalized groups seeking to maintain safe spaces. Our study explores how women on Xiaohongshu (rednote), a recommendation-driven social platform, proactively re-appropriate hashtags (e.g., #Baby Supplemental Food) by using them in posts unrelated to their literal meaning. The hashtags were strategically chosen from topics that would be uninteresting to the male audience they wanted to block. Through a mixed-methods approach, we analyzed the practice of hashtag re-appropriation based on 5,800 collected posts and interviewed 24 active users from diverse backgrounds to uncover users' motivations and reactions towards the re-appropriation. This practice highlights how users can reclaim agency over content distribution on recommendation-driven platforms, offering insights into self-governance within algorithmic-centered power structures.

Automatic crack segmentation is a cornerstone technology for intelligent visual perception modules in road safety maintenance and structural integrity systems. Existing deep learning models and ``pre-training + fine-tuning'' paradigms often face challenges of limited adaptability in resource-constrained environments and inadequate scalability across diverse data domains. To overcome these limitations, we propose FlexiCrackNet, a novel pipeline that seamlessly integrates traditional deep learning paradigms with the strengths of large-scale pre-trained models. At its core, FlexiCrackNet employs an encoder-decoder architecture to extract task-specific features. The lightweight EdgeSAM's CNN-based encoder is exclusively used as a generic feature extractor, decoupled from the fixed input size requirements of EdgeSAM. To harmonize general and domain-specific features, we introduce the information-Interaction gated attention mechanism (IGAM), which adaptively fuses multi-level features to enhance segmentation performance while mitigating irrelevant noise. This design enables the efficient transfer of general knowledge to crack segmentation tasks while ensuring adaptability to diverse input resolutions and resource-constrained environments. Experiments show that FlexiCrackNet outperforms state-of-the-art methods, excels in zero-shot generalization, computational efficiency, and segmentation robustness under challenging scenarios such as blurry inputs, complex backgrounds, and visually ambiguous artifacts. These advancements underscore the potential of FlexiCrackNet for real-world applications in automated crack detection and comprehensive structural health monitoring systems.

Most existing RGB-D semantic segmentation methods focus on the feature level fusion, including complex cross-modality and cross-scale fusion modules. However, these methods may cause misalignment problem in the feature fusion process and counter-intuitive patches in the segmentation results. Inspired by the popular pixel-node-pixel pipeline, we propose to 1) fuse features from two modalities in a late fusion style, during which the geometric feature injection is guided by texture feature prior; 2) employ Graph Neural Networks (GNNs) on the fused feature to alleviate the emergence of irregular patches by inferring patch relationship. At the 3D feature extraction stage, we argue that traditional CNNs are not efficient enough for depth maps. So, we encode depth map into normal map, after which CNNs can easily extract object surface tendencies.At projection matrix generation stage, we find the existence of Biased-Assignment and Ambiguous-Locality issues in the original pipeline. Therefore, we propose to 1) adopt the Kullback-Leibler Loss to ensure no missing important pixel features, which can be viewed as hard pixel mining process; 2) connect regions that are close to each other in the Euclidean space as well as in the semantic space with larger edge weights so that location informations can been considered. Extensive experiments on two public datasets, NYU-DepthV2 and SUN RGB-D, have shown that our approach can consistently boost the performance of RGB-D semantic segmentation task.

Wide-field surveys have markedly enhanced the discovery and study of solar system objects (SSOs). The 2.5-meter Wide Field Survey Telescope (WFST) represents the foremost facility dedicated to optical time-domain surveys in the northern hemisphere. To fully exploit WFST's capabilities for SSO detection, we have developed a heliocentric-orbiting objects processing system (HOPS) tailored for identifying these objects. This system integrates HelioLinC3D, an algorithm well suited for the WFST survey cadence, characterized by revisiting the same sky field twice on the majority of nights. In this paper, we outline the architecture and processing flow of our SSO processing system. The application of the system to the WFST pilot survey data collected between March and May 2024 demonstrates exceptional performance in terms of both temporal efficiency and completeness. A total of 658,489 observations encompassing 38,520 known asteroids have been documented, and 241 newly discovered asteroids have been assigned provisional designations. In particular, 27% of these new discoveries were achieved using merely two observations per night on three nights. The preliminary results not only illuminate the effectiveness of integrating HelioLinC3D within the SSO processing system, but also emphasize the considerable potential contributions of WFST to the field of solar system science., Comment: 23 pages, 6 figures, submitted to AAS journal

Semiconductor quantum dot spin qubits hold significant potential for scaling to millions of qubits for practical quantum computing applications, as their structure highly resembles the structure of conventional transistors. Since classical semiconductor manufacturing technology has reached an unprecedented level of maturity, reliably mass-producing CMOS chips with hundreds of billions of components, conventional wisdom dictates that leveraging CMOS technologies for quantum dot qubits can result in upscaled quantum processors with thousands or even millions of interconnected qubits. However, the interconnect requirements for quantum circuits are very different from those for classical circuits, where for each qubit individual control and readout wiring could be needed. Although significant developments have been demonstrated on small scale systems, qubit numbers remain limited, to a large extent due to the lack of scalable qubit interconnect schemes. Here, we present a trilinear quantum dot array that is simple in physical layout while allowing individual wiring to each quantum dot. By means of electron shuttling, the trilinear architecture provides qubit connectivity that is equivalent to or even surpasses that of 2D square lattice. Assuming the current qubit fidelities of small-scale devices can be extrapolated to large-scale arrays, medium-length shuttling arrays on the order of tens of microns would allow million-scale qubit systems, while maintaining manageable overheads. We also present a scalable control scheme, where the qubit chip is 3D-integrated with a low-power switch-based cryoCMOS circuit for parallel qubit operation with limited control inputs. As our trilinear quantum dot array is fully compatible with existing semiconductor technologies, this qubit architecture represents one possible framework for future research and development of large-scale spin qubit systems., Comment: 12 pages, 4 figures

In hours-long meeting scenarios, real-time speech stream often struggles with achieving accurate speaker diarization, commonly leading to speaker identification and speaker count errors. To address this challenge, we propose SCDiar, a system that operates on speech segments, split at the token level by a speaker change detection (SCD) module. Building on these segments, we introduce several enhancements to efficiently select the best available segment for each speaker. These improvements lead to significant gains across various benchmarks. Notably, on real-world meeting data involving more than ten participants, SCDiar outperforms previous systems by up to 53.6\% in accuracy, substantially narrowing the performance gap between online and offline systems., Comment: Accepted at ICASSP 2025

Systematic literature review is essential for evidence-based medicine, requiring comprehensive analysis of clinical trial publications. However, the application of artificial intelligence (AI) models for medical literature mining has been limited by insufficient training and evaluation across broad therapeutic areas and diverse tasks. Here, we present LEADS, an AI foundation model for study search, screening, and data extraction from medical literature. The model is trained on 633,759 instruction data points in LEADSInstruct, curated from 21,335 systematic reviews, 453,625 clinical trial publications, and 27,015 clinical trial registries. We showed that LEADS demonstrates consistent improvements over four cutting-edge generic large language models (LLMs) on six tasks. Furthermore, LEADS enhances expert workflows by providing supportive references following expert requests, streamlining processes while maintaining high-quality results. A study with 16 clinicians and medical researchers from 14 different institutions revealed that experts collaborating with LEADS achieved a recall of 0.81 compared to 0.77 experts working alone in study selection, with a time savings of 22.6%. In data extraction tasks, experts using LEADS achieved an accuracy of 0.85 versus 0.80 without using LEADS, alongside a 26.9% time savings. These findings highlight the potential of specialized medical literature foundation models to outperform generic models, delivering significant quality and efficiency benefits when integrated into expert workflows for medical literature mining.

Cyclic transitions between active and passive states are central to many natural and synthetic systems, ranging from light-driven active particles to animal migrations. Here, we investigate a minimal model of self-propelled Brownian particles undergoing cyclic transitions across three spatial zones: gain, loss, and neutral regions. Particles become active in the gain region, passive in the loss region, and retain their state in the neutral region. By analyzing the steady-state behavior as a function of particle number and the size of the loss region, we identify a threshold particle number, below and above which distinct structural changes are observed. Interestingly, below this threshold, increasing the particle number reduces the state-switching time (the time required for a particle to transition from active to passive and back to active). In contrast, above the threshold, further increases in particle number result in longer switching times. In the subthreshold regime, our analytical model predicts structural characteristics and switching dynamics that align well with simulations. Above the threshold, we observe an emergent spatial clustering, with particles transitioning from passive to active states in close proximity. These findings provide insights into the collective dynamics of cyclic processes between active and passive states across distinct spatial zones in active matter systems., Comment: 13 pages,9 figures

We investigate constrained online convex optimization, in which decisions must belong to a fixed and typically complicated domain, and are required to approximately satisfy additional time-varying constraints over the long term. In this setting, the commonly used projection operations are often computationally expensive or even intractable. To avoid the time-consuming operation, several projection-free methods have been proposed with an $\mathcal{O}(T^{3/4} \sqrt{\log T})$ regret bound and an $\mathcal{O}(T^{7/8})$ cumulative constraint violation (CCV) bound for general convex losses. In this paper, we improve this result and further establish \textit{novel} regret and CCV bounds when loss functions are strongly convex. The primary idea is to first construct a composite surrogate loss, involving the original loss and constraint functions, by utilizing the Lyapunov-based technique. Then, we propose a parameter-free variant of the classical projection-free method, namely online Frank-Wolfe (OFW), and run this new extension over the online-generated surrogate loss. Theoretically, for general convex losses, we achieve an $\mathcal{O}(T^{3/4})$ regret bound and an $\mathcal{O}(T^{3/4} \log T)$ CCV bound, both of which are order-wise tighter than existing results. For strongly convex losses, we establish new guarantees of an $\mathcal{O}(T^{2/3})$ regret bound and an $\mathcal{O}(T^{5/6})$ CCV bound. Moreover, we also extend our methods to a more challenging setting with bandit feedback, obtaining similar theoretical findings. Empirically, experiments on real-world datasets have demonstrated the effectiveness of our methods., Comment: Accepted by AAAI 2025

We investigate the cluster configurations in Li isotopes, which are described in the optimization of the multi-Slater determinants of the antisymmetrized molecular dynamics. Each Slater determinant in the superposition is determined simultaneously in the variation of the total energy. The configurations of the excited states are obtained by imposing the orthogonal condition to the ground-state configurations. In Li isotopes, various cluster configurations are confirmed and are related to the thresholds of the corresponding cluster emissions. For $^5$Li, we predict the $^3$He+$d$ clustering in the excited state as well as the mirror state of $^5$He with $^3$H+$d$. For $^{6-9}$Li, various combinations of the clusters are obtained in the ground and excited states, and the superposition of these basis states reproduces the observed energy spectra. For $^9$Li, we predict the linear-chain states consisting of various cluster configurations at 10--13 MeV of the excitation energy., Comment: 23 pages, 19 figures

Connected Autonomous Vehicles (CAVs) benefit from Vehicle-to-Everything (V2X) communication, which enables the exchange of sensor data to achieve Collaborative Perception (CP). To reduce cumulative errors in perception modules and mitigate the visual occlusion, this paper introduces a new task, Collaborative Joint Perception and Prediction (Co-P&P), and provides a conceptual framework for its implementation to improve motion prediction of surrounding objects, thereby enhancing vehicle awareness in complex traffic scenarios. The framework consists of two decoupled core modules, Collaborative Scene Completion (CSC) and Joint Perception and Prediction (P&P) module, which simplify practical deployment and enhance scalability. Additionally, we outline the challenges in Co-P&P and discuss future directions for this research area., Comment: 8 pages, 4 figures, accepted by conference VEHITS2025

We employ ZX-calculus and Pauli web to understand the $|Y\rangle$ state injection on the rotated surface code., Comment: Additional discussions added on post-selection

The committor functions are central to investigating rare but important events in molecular simulations. It is known that computing the committor function suffers from the curse of dimensionality. Recently, using neural networks to estimate the committor function has gained attention due to its potential for high-dimensional problems. Training neural networks to approximate the committor function needs to sample transition data from straightforward simulations of rare events, which is very inefficient. The scarcity of transition data makes it challenging to approximate the committor function. To address this problem, we propose an efficient framework to generate data points in the transition state region that helps train neural networks to approximate the committor function. We design a Deep Adaptive Sampling method for TRansition paths (DASTR), where deep generative models are employed to generate samples to capture the information of transitions effectively. In particular, we treat a non-negative function in the integrand of the loss functional as an unnormalized probability density function and approximate it with the deep generative model. The new samples from the deep generative model are located in the transition state region and fewer samples are located in the other region. This distribution provides effective samples for approximating the committor function and significantly improves the accuracy. We demonstrate the effectiveness of the proposed method through both simulations and realistic examples.

It is well known that the intrinsic anomalous Hall effect (AHE) arises from the integration of the non-zero Berry curvature (BC), conventionally observed in the Dirac/Weyl and nodal-line semimetals. Moreover, nodal surface semimetals are expected to exhibit more significant BC under the prevalence of degenerate points near the Fermi level. In this work, we report the detection of a giant AHE in the Kagome magnet Fe$_3$Ge with a two-dimensional (2D) nodal surface (NS) at $k_{z}=\pi$ plane, exhibiting an anomalous Hall conductivity (AHC) of 1500 $\Omega^{-1}$cm$^{-1}$ at 160 K, the highest among all reported Kagome topological materials. This finding suggests a new platform for searching large AHC materials and facilitates potential room-temperature applications in spintronic devices and quantum computing.

Computational pathology foundation models (CPathFMs) have emerged as a powerful approach for analyzing histopathological data, leveraging self-supervised learning to extract robust feature representations from unlabeled whole-slide images. These models, categorized into uni-modal and multi-modal frameworks, have demonstrated promise in automating complex pathology tasks such as segmentation, classification, and biomarker discovery. However, the development of CPathFMs presents significant challenges, such as limited data accessibility, high variability across datasets, the necessity for domain-specific adaptation, and the lack of standardized evaluation benchmarks. This survey provides a comprehensive review of CPathFMs in computational pathology, focusing on datasets, adaptation strategies, and evaluation tasks. We analyze key techniques, such as contrastive learning and multi-modal integration, and highlight existing gaps in current research. Finally, we explore future directions from four perspectives for advancing CPathFMs. This survey serves as a valuable resource for researchers, clinicians, and AI practitioners, guiding the advancement of CPathFMs toward robust and clinically applicable AI-driven pathology solutions.

In the quest for secure and reliable random number generation, Magnetic Tunnel Junctions (MTJs) have emerged as a promising technology due to their unique ability to exploit the stochastic nature of magnetization switching. This paper presents an engineering-oriented design of a drift-resilient MTJ-based True Random Number Generator (TRNG) utilizing a hybrid control strategy. We address the critical issue of switching probability drift, which can compromise the randomness and bias the output of MTJ-based TRNGs. Our approach combines a self-stabilization strategy, which dynamically adjusts the driving voltage based on real-time feedback, with pulse width modulation to enhance control over the switching probability. Through comprehensive experimental and simulation results, we demonstrate significant improvements in the stability, uniformity, and quality of the random numbers generated. The proposed system offers flexibility and adaptability for diverse applications, making it a reliable solution for high-quality randomness in cryptography, secure communications, and beyond., Comment: 11 pages, 5 figures

Ensuring a stable power supply in rural areas relies heavily on effective inspection of power equipment, particularly transmission lines (TLs). However, detecting TLs from aerial imagery can be challenging when dealing with misalignments between visible light (RGB) and infrared (IR) images, as well as mismatched high- and low-level features in convolutional networks. To address these limitations, we propose a novel Hierarchical Multi-Modal Enhancement Network (HMMEN) that integrates RGB and IR data for robust and accurate TL detection. Our method introduces two key components: (1) a Mutual Multi-Modal Enhanced Block (MMEB), which fuses and enhances hierarchical RGB and IR feature maps in a coarse-to-fine manner, and (2) a Feature Alignment Block (FAB) that corrects misalignments between decoder outputs and IR feature maps by leveraging deformable convolutions. We employ MobileNet-based encoders for both RGB and IR inputs to accommodate edge-computing constraints and reduce computational overhead. Experimental results on diverse weather and lighting conditionsfog, night, snow, and daytimedemonstrate the superiority and robustness of our approach compared to state-of-the-art methods, resulting in fewer false positives, enhanced boundary delineation, and better overall detection performance. This framework thus shows promise for practical large-scale power line inspections with unmanned aerial vehicles.

The Wide Field Survey Telescope (WFST) is a dedicated photometric surveying facility built jointly by the University of Science and Technology of China (USTC) and the Purple Mountain Observatory (PMO). Since many of its scientific objectives rely on near-real-time data for effective analysis, prompt processing of WFST images is of great significance. To meet this need, we adapted the Rubin Observatory Legacy Survey of Space and Time (LSST) science pipelines to handle the data collected by WFST. This paper presents the complete data processing workflow, from ingestion of raw images to the distribution of alerts, and details the primary data products generated by our pipeline. Researchers using data processed by this pipeline can refer to this document to fully understand the data processing procedures., Comment: 20 pages, 2 figures

The first evidence for the decay $B^-\rightarrow D^{**0}\tau^-\overline{\nu_{\tau}}$ is obtained using proton-proton collision data collected by the LHCb experiment, corresponding to an integrated luminosity of 9 fb$^{-1}$ , at centre-of-mass energies of 7, 8 and 13 Tev. Here, the $D^{**0}$ meson represents any of the three excited charm mesons $D_{1}(2420)^{0}$, $D_{2}^{*}(2460)^{0}$, and $D_{1}^{'}(2400)^{0}$. The $B^-\rightarrow D^{**0}\tau^-\overline{\nu_{\tau}}$ signal is measured with a significance of 3.5 $\sigma$, including systematic uncertainties. The combined branching fraction $BR(B^-\rightarrow D^{**0}_{1,2}\tau^-\overline{\nu_{\tau}})\times BR(D^{**0}_{1,2}\rightarrow D^{*+}\pi^-)$, where $D^{**0}_{1,2}$ denotes both $D_{1}(2420)^{0}$ and $D_{2}^{*}(2460)^{0}$ contributions, is measured to be $(0.051\pm0.013(stat)\pm 0.006(syst)\pm 0.009(\rm{ext}) )\%$, where the last uncertainty reflects that of the branching fraction of the normalisation channel $B^-\rightarrow D^{**0}_{1,2}D_s^{(*)-}$. The ratio between the tauonic and muonic semileptonic $B$ decays, with the latter taken from world average values, is also determined and found to be ${\cal R}(D^{**0}_{1,2})=0.13\pm0.03(stat)\pm0.01(syst)\pm0.02\,(\rm{ext})$., Comment: All figures and tables, along with machine-readable versions and any supplementary material and additional information, are available at https://lbfence.cern.ch/alcm/public/analysis/full-details/3300/ (LHCb public pages)