SearcharxivSearch

arXiv subjects

Sheng Yang

Publications and source records attributed to Sheng Yang.

At least 19 recordsLinked to original sources

Lightweight Soft X-ray Imager (LSXI) with glass-based coded mask

The coded mask technique has been widely used in X-ray and Gamma-ray imagers, especially in space astronomy. However, the traditional design of coded mask imagers usually has problems with large size and heavy weight. Here, we propose a novel design for a coded mask imager made of glass based on microchannel plate (MCP) technology, making it lightweight (within 1 kg), compact, and self-supporting, which is very suitable for space exploration satellites. The design is initially demonstrated by reconstructing encoded patterns from measurements at the X-ray beamline. Monte Carlo simulations of the module integrated into a 6U CubeSat are conducted to assess its in-orbit detector performance, including sensitivity and source localization.

astro-ph.IM

USR-Drive: Unified Driving Scene Representation via Joint Denoising of 3D Gaussians and Boxes

Spatial representation learning for autonomous driving aims to map raw visual signals into structured 3D scene representations, where object-centric bounding boxes and rendering-oriented 3D primitives (\eg, 3D Gaussians) serve as two distinct yet highly complementary levels for scene understanding. Existing methods typically treat dynamic reconstruction and instance-level perception as separate tasks, despite their shared goal of estimating the underlying 3D world state. As a result, dynamic reconstruction is under-constrained while 3D detection lacks geometric grounding. To address this gap, we propose USR-Drive, a unified conditional generative framework that, given only posed multi-view driving videos, jointly recovers dense dynamic geometry and instance-level object layouts within a shared scene representation. Specifically, USR-Drive represents dense Gaussian primitives and sparse 3D bounding boxes as two aligned latent token streams and jointly denoises them with a unified multi-modal diffusion Transformer. Unlike prior paradigms that use boxes as external conditions or predict them with detached modules, USR-Drive treats them as mutually constrained state variables with a Unified Positional Encoding (UPE) that aligns heterogeneous tokens within a shared metric spatiotemporal coordinate. Via such unified representation and generative framework, the two modalities reinforce each other: geometry supplies dense metric evidence for box prediction, while boxes provide instance-level structural priors that help preserve spatial consistency and reduce ambiguity in sequential 3D geometric representation. Our approach successfully delivers state-of-the-art results for both dynamic reconstruction and 3D detection on the nuScenes and VKitti datasets.

cs.CV

Rethinking Text-Based Image Retrieval in Specific Domain

Driven by the rapid advancement of vision-language representation learning, Text-based Image Retrieval (TBIR) has made notable progress. However, existing benchmarks are predominantly constructed on an exclusive single-match assumption between query and images. While effective in general scenarios, this assumption fails to reflect practical system performance in specific domains (e.g., surveillance), where a single query often corresponds to multiple relevant candidate images. To address this limitation, we design a Domain-Specific Multi-Match Text-based Image Retrieval (DSMM-TBIR) data engine. Leveraging this engine, we construct Security Multi-Match TBIR (SecMM-TBIR), a benchmark comprising 50k surveillance images with 200 comprehensive queries. Furthermore, we observe that vanilla contrastive learning in specific domains suffers from severe false negatives, forcing the model to push apart semantically similar pairs and thus degrading retrieval performance. We propose the Semantic-Aware Fine-Tuning (SAFT) framework to address semantic compression in specific domains, which incorporates Semantic-Aware Soft-Label Supervision (SASS) and Intra-modal Structural Distillation (ISD) to establish a promising paradigm for domain-specific TBIR tasks. Experiments across diverse CLIP-like models demonstrate that SAFT yields an average mAP@20 gain of 7.8 points on SecMM-TBIR over standard image-text contrastive (ITC) fine-tuning, while also improving general-domain performance. The entire benchmark will be released to facilitate further research.

cs.CV

Are gate-all-around 2D CFETs the optimal architecture for the A2 node and beyond?

As logic scaling enters the angstrom era, vertically stacked complementary field-effect transistors (CFETs) based on atomically thin two-dimensional (2D) semiconductors offer a potential route to extend device scaling beyond the A2 node. Here, we develop an A2-oriented 2D CFET integration flow with a CPP of 36 nm and Lg of 10 nm and present initial demonstrations of several key process modules. Despite their atomically thin channels, 2D GAA CFETs do not provide a contacted poly pitch scaling advantage over Si GAA CFETs at the A2 node, because contact formation constraints impose a similar minimum CPP of 36 nm. We also combine a critical assessment with a multiscale power-performance-area (PPA) evaluation framework spanning quantum transport simulations, compact-model generation, A2-targeted 2D CFET gate-all-around (GAA) integration-flow definition, parasitic extraction and circuit-level benchmarking. Our analysis, however, shows that the expected benefits of 2D GAA CFETs are strongly constrained by non-idealities, in particular high contact resistance and dominant layout-induced parasitic capacitances. Although architectural optimization can improve the Ieff/Ceff ratio, the associated rise in absolute capacitance limits circuit-level gains. Meaningful progress will require co-optimization of contacts, transport and parasitics, together with 2D-specific CFET architectures.

physics.app-ph

Mismatched Exponents for Deterministic and Randomised Noise-Guessing Decoding

We study both the deterministic and randomised variants of noise-guessing decoding in additive memoryless channels. The error and complexity exponents of such decoding schemes are analysed under mismatched decoding metrics, and then specialised to matched, $\alpha$-tilted, and universal decoding metrics. The $\alpha$-tilted metric is proportional to the $\alpha$-th power ($\alpha>0$) of the true noise distribution. In deterministic decoding, the tilting operation does not affect the performance: all these metrics are equivalent to the matched one ($\alpha=1$), and are optimal for both average error and complexity. On the other hand, in randomised decoding, the matched metric is not optimal for complexity exponents; we show that the decoder needs to tune the parameter $\alpha$ according to the code rate in order to simultaneously achieve both optimal exponents using a decoding metric in that family. Finally, a universal decoding metric based on the empirical entropy of the noise sequence achieves both optimal exponents, independently of the channel law and uniformly over code rates, for the deterministic and randomised variants.

cs.IT

Topological Tricritical Ising Universality Class in One Dimension

Quantum critical points can host symmetry-protected topological edge modes even when the bulk is gapless, giving rise to symmetry-enriched universality classes beyond the conventional Landau--Ginzburg--Wilson paradigm. Here we show that the tricritical Ising (TCI) critical point---described by a paradigmatic conformal field theory (CFT) with emergent supersymmetry---admits a topologically nontrivial, symmetry-enriched realization, which we term the topological TCI. We construct this critical point in the cluster O'Brien--Fendley spin chain by applying a symmetry-protected topological entangler to the original O'Brien--Fendley model. The two realizations therefore share the same bulk TCI CFT. Under open boundary conditions, however, the original model exhibits the free conformal boundary condition, whereas the cluster model exhibits a spontaneously fixed boundary condition: an infinitesimal boundary field can select one of the fixed boundary states, yielding spontaneous boundary magnetization. We further show that symmetry enrichment and boundary renormalization-group flow provide two physically distinct routes to the spontaneously fixed boundary condition. Whereas the free and spontaneously fixed boundary conditions of the original model can be interconverted by tuning a symmetry-preserving boundary term, no such conversion occurs for the cluster model along the boundary deformations studied here, even in the strong-deformation limit. Although they share the same conventional boundary CFT data, including the boundary operator content and boundary $g$-function, the two realizations of the spontaneously fixed boundary condition are distinguished by different time-reversal charges of the disorder field....

cond-mat.str-el

Evaluating the Robustness of Proof Autoformalization in Lean 4

Proof autoformalization aims to translate a mathematical informal proof written in natural language into a formal proof in a formal language such as Lean~4. Several works have developed LLM-based models for proof autoformalization. However, existing evaluations have typically focused on translating well-formed informal proofs from curated datasets. We argue that a robust proof autoformalizer must remain faithful even for informal proofs that diverge from these idealized ones, and we present the first study on the robustness of proof autoformalization models. We formulate two categories of perturbations and evaluate robustness under each: a global perturbation paraphrases the informal proof in a different style, under which the formalization should remain consistent; a local perturbation alters a value, symbol, or proof step, possibly in a counterfactual way, and a robust formalization should faithfully reflect the perturbation rather than reverting to the original one or inferring a different one on its own. We build a benchmark with both perturbations on miniF2F and MATH-500, and automatically measure how stable a proof autoformalization's correctness is under global perturbations and how faithfully its output reflects local perturbations. We evaluate seven recent models, all of which are sensitive to global perturbations and mostly fail to remain faithful under local perturbations. Code and data are available via https://github.com/ucr-rai/robust-proof-autoformalization.

cs.CL

Decadal pre-explosion activity and circumstellar interaction in a supernova

When a massive star explodes as a supernova, crucial information about its immediate environment is lost within hours. Here we report rapid optical observations from Lulin Observatory of the broad-lined Type Ic supernova SN 2026gzf, beginning 1.25 hours after Einstein Probe detected the X-ray transient EP260321a. Our data led to the discovery of the optical counterpart and showed a luminous blue first-day excess that cannot be reproduced by standard radioactive models. We find that interaction between the ejecta and $\approx 0.02$ M$_{\odot}$ of circumstellar material accounts for the early excess. Archival Panoramic Survey Telescope and Rapid Response System (Pan-STARRS) images show variability at the explosion site over the previous $\sim 12$ years, with the source brightening by a factor of $\sim 1.5$ in the final $\sim 3$ years before explosion, providing rare evidence for pre-explosion activity in a stripped-envelope progenitor system. The precursor brightening suggests enhanced eruptive mass loss during late-stage oxygen burning before core collapse, while an additional silicon-burning episode shortly before explosion may have created the compact nearby material responsible for the X-ray shock-breakout signal. SN 2026gzf therefore offers the first view of how a stripped progenitor modifies its immediate environment shortly before death, linking long-term precursor variability, circumstellar interaction and the explosion itself.

astro-ph.HE

Beyond Trajectory Rewards: Step-level Credit Assignment for Agentic Search via Graph Modeling

In Agentic Search, trajectory-level outcome rewards fail to quantify the behavioral contributions of individual steps, while existing step-level reward methods typically rely on costly tree sampling. We view world knowledge as a latent world graph and each IS task as search within a latent task graph, where effective steps should make graph progress toward the answer node. Based on this prior, we propose Graph-Distance Contribution Reward (GDCR), a step-level process reward that scores newly-retrieved and newly-cited entities by their distance to the answer node in a training-time Entity-Relation (ER) graph. We further propose Step Advantage Policy Optimization (SAPO), which converts GDCR into step-level advantages and combines them with trajectory-level outcome advantages. Experiments on four challenging benchmarks validate the effectiveness of our method.

cs.AI

GSMap: 2D Gaussians for Online HD Mapping

Accurate High-Definition (HD) map construction is critical for autonomous driving, yet existing methods face a fundamental trade-off: vectorization-based approaches preserve topology but struggle with geometric fidelity, while rasterization-based approaches enable precise geometric supervision but produce unstructured outputs. To bridge this gap, we propose GSMap, a novel framework that unifies both paradigms via a learnable 2D Gaussian representation. Each map element is modeled as an ordered sequence of 2D Gaussians, whose centers correspond to the vertices of the vectorized polyline/polygon. This formulation enables simultaneous optimization through: (1) Differentiable rasterization that enforces pixel-level geometric constraints, and (2) Topology-aware vectorization that maintains structural regularity. Experiments on both nuScenes and Argoverse2 demonstrate that our Gaussian-based representation effectively unifies geometric and topological learning, achieving significant performance improvements and demonstrating strong compatibility with existing HD mapping architectures. Code will be available at https://github.com/peakpang/GSMap

cs.CV

Second-Order Bilevel Optimization with Accelerated Convergence Rates

This paper studies second-order methods for nonconvex-strongly-convex bilevel optimization. We propose a novel fully second-order bilevel approximation method (FSBA) that achieves an iteration complexity of $\tilde{\mathcal{O}}(\epsilon^{-1.5})$ for finding the $(\epsilon, \mathcal{O}(\sqrt{\epsilon}))$ second-order stationary point of the hyper-objective function. Our results demonstrate that second-order methods can achieve an accelerated convergence rate than first-order methods in bilevel optimization. To address the heavy computational cost associated with the second-order oracle, we introduce a lazy variant of FSBA, called LFSBA, which reuses second-order information across several iterations. We prove that LFSBA exhibits better computational complexity than FSBA by a factor of $\sqrt{d}$, where $d$ is the dimension of the problem. We also apply a similar idea to nonconvex strongly-concave minimax optimization and propose the lazy minimax cubic-regularized Newton (LMCN) method with better computational complexity compared to existing second-order methods.

math.OC

EdgeFM: Efficient Edge Inference for Vision-Language Models

Vision-language models (VLMs) have demonstrated strong applicability in edge industrial applications, yet their deployment remains severely constrained by requirements for deterministic low latency and stable execution under resource limitations. Existing frameworks either rely on bloated general-purpose designs or force developers into opaque, hardware-specific closed-source ecosystems, leading to hardware lock-in limitation and poor cross-platform adaptability. Observing that modern AI agents can efficiently search and tune configurations to generate highly optimized low-level kernels for standard LLM operators, we propose EdgeFM, a lightweight, agent-driven VLM/LLM inference framework tailored for cross-platform industrial edge deployment. EdgeFM removes non-essential features to reduce single-request latency, and encapsulates agent-tuned kernel optimizations as a modular library of reusable skills. By allowing direct invocation of these skills rather than waiting for closed-source implementations, it effectively closes the performance gap long dominated by proprietary toolchains. The framework natively supports mainstream platforms including x86 and NVIDIA Orin SoCs, and represents the first end-to-end VLA deployment on the domestic Horizon Journey platform, enhancing cross-platform portability. In most cases, it yields clearly better inference performance than conventional vendor-specific toolchains, achieving up to 1.49 times speedup over TensorRT-Edge-LLM on the NVIDIA Orin platform. Experimental results show that EdgeFM delivers favorable end-to-end inference performance, providing an open-source, production-grade solution for diverse edge industrial scenarios.

cs.CV

GLM-5V-Turbo: Toward a Native Foundation Model for Multimodal Agents

We present GLM-5V-Turbo, a step toward native foundation models for multimodal agents. As foundation models are increasingly deployed in real environments, agentic capability depends not only on language reasoning, but also on the ability to perceive, interpret, and act over heterogeneous contexts such as images, videos, webpages, documents, GUIs. GLM-5V-Turbo is built around this objective: multimodal perception is integrated as a core component of reasoning, planning, tool use, and execution, rather than as an auxiliary interface to a language model. This report summarizes the main improvements behind GLM-5V-Turbo across model design, multimodal training, reinforcement learning, toolchain expansion, and integration with agent frameworks. These developments lead to strong performance in multimodal coding, visual tool use, and framework-based agentic tasks, while preserving competitive text-only coding capability. More importantly, our development process offers practical insights for building multimodal agents, highlighting the central role of multimodal perception, hierarchical optimization, and reliable end-to-end verification.

cs.CV

Design and preliminary performance study of the broad-band spectrometer detector for POLAR-2

POLAR-2, the successor of the POLAR experiment aboard China's Tiangong-2 space lab, is set to be deployed on the China Space Station. The POLAR-2 mission aims to conducting high-precision polarization measurements of high-energy transients with a primary focus on Gamma-Ray Bursts (GRBs), following POLAR's pioneering accurate polarization measurements of GRB prompt emission. One of the key advancements in POLAR-2 is the inclusion of a dedicated Broad-band Spectrometer Detector (BSD) instrument, designed to provide precise measurements of GRB location and spectral parameters, which are critical inputs for accurate polarization analysis of POLAR-2's dedicated High-energy Polarimetry Detector (HPD), which is made of plastic scintillator bars array. BSD employs a coded-aperture mask imaging technique and pixelated GAGG scintillation crystals, offering a wide half-coded field of view of ~132{\deg} x 125{\deg} and an operational energy range of 10-1000 keV. Simulation results indicate that the instrument can achieve a localization accuracy of approximately 1.5{\deg} for faint GRBs similar to GRB 170817A, satisfying the core requirements of GRB polarimetry with HPD. BSD also has moderate capability for GRB polarimetry, particularly at several hundred keV energy. This paper outlines the preliminary design of BSD and presents an overall evaluation of its expected scientific performance, based on extensive Monte Carlo simulations and preliminary ground-based calibration tests.

astro-ph.IM

GECAM discovery of a peculiar magnetar X-ray burst (MXB 221120) from SGR J1935+2154 associated with a fast radio burst

Fast radio bursts (FRBs) are enigmatic cosmic transients of millisecond duration observed in the radio band. The identification of FRB-associated magnetar X-ray bursts (MXBs) from galactic magnetar SGR J1935+2154 suggests that at least a fraction of FRBs can be produced from magnetar activity. However, the sample size of FRB-associated MXBs is still very small. Here we report a bright and peculiar FRB-associated MXB from SGR J1935+2154 detected by GECAM on November 20, 2022, dubbed MXB 221120. We find that both temporal and spectral properties of MXB 221120 exhibit distinctive features. Its light curve could be generally described by a single FRED function with superposition of several narrow pulses. Interestingly, we identify a possible QPO feature with center frequency of ~18 Hz in this MXB. The time-integrated spectrum is best fitted by a blackbody model with temperature (kT ) of 18.6 keV, rendering it the first thermal spectrum FRB-associated MXB from SGR J1935+2154. Compared to other MXBs with single emission episode, MXB 221120 has longer duration and higher blackbody temperature, making it an outlier in the burst sample. These results indicate that MXB 221120 may be produced by a special mechanism with extreme physical conditions.

astro-ph.HE

Comprehensive Measurement of Spectral Evolution in a GRB Flare: High Time-Resolution Insights into the "Double-Tracking" Phenomenon

The spectral evolution characteristics of the prompt emission in gamma-ray bursts (GRBs) have been extensively studied, but detailed investigations of spectral evolution in a GRB flare remain lacking. In this work, we present the first analysis of spectral parameter evolution in a GRB flare through high time-resolved spectral fitting of the Brightest Flare in GRB 221009A. We find that the $\alpha$-Flux, $E_p$-Flux, and $E_p$-$\alpha$ relationships during both the overall phase and the rise phase of flare can be well described by simple power-law model, showing positive correlations. Therefore, we conclude that Brightest Flare exhibits "Double-tracking" behavior. Since values of $\alpha$ do not exceed the synchrotron "death line" (-2/3), we explain this phenomenon using a magnetic dissipation synchrotron radiation model. In the decay phase of flare, the $E_p$-Flux and $E_p$-$\alpha$ correlations become notably flatter, with their power-law indices decreasing significantly compared to those in the rise phase. This may be due to the fact that the next flare begins to erupt before the Brightest Flare has completely ended, resulting in the combined effects of both two flares. Our study of spectral parameter relations of the Brightest Flare provides new insights into the radiation mechanisms of both GRB prompt emission and flares.

astro-ph.HE

A Telescope System for Charge and Position Measurement of High Energy Nuclei

A high-granularity telescope system with a large sensitive area and low material budget has been developed for high-energy heavy ion beam tests. The telescope consists of nine layers of silicon microstrip detectors (SSDs), whose performance was validated through a heavy ion beam test at the CERN SPS. A hybrid machine learning algorithm is proposed to address the challenges of nuclear charge measurement with SSDs. The system achieves a spatial resolution of $\mathcal{O}(1) \,$\SI{}{\micro\metre} and a charge resolution better than 0.16 charge units for nuclei from $Z = 1$ to $Z = 29$, with a sensitive area of $8 \times 8 \, \mathrm{cm}^2$. To the best of our knowledge, this represents the most precise charge and spatial resolution simultaneously achieved by a silicon telescope to date.

physics.ins-det

Beam Test Characterization of Silicon Microstrip Detector Flight-Model Ladders for the AMS-02 Upgrade

The AMS-02 experiment plans to install a new silicon microstrip tracker layer (Layer-0) on top of the existing detector, increasing the cosmic-ray acceptance by a factor of 3. Layer-0 employs a design in which multiple silicon microstrip detectors (SSDs) are connected in series to form long detector ladders. We present a detailed performance study of the flight-model ladders using a 350~GeV mixed hadron beam at the CERN SPS. The study focuses on the following aspects: (i) the performance of ladders with different numbers of SSDs, for which the intrinsic spatial resolution at normal incidence varies from $9.5~\mu\mathrm{m}$ to $11.4~\mu\mathrm{m}$ for ladders composed of 8 to 12 SSDs; (ii) the response consistency for particles impacting on the \emph{Head} and \emph{Tail} regions of the ladder; and (iii) the dependence of the detector performance on the particle incidence angle.

physics.ins-det