arXiv subjects

Yingjie Li

Publications and source records attributed to Yingjie Li.

At least 19 recordsLinked to original sources

arXiv2026

Star Formation in the H II Region Sh 2-205: 3D Morphology and Kinematics from Young Stars and Molecular Gas

Using Gaia astrometry of young stars combined with CO observations, we present the first systematic three-dimensional (3D) analysis of the structure, kinematics, and evolutionary history of the star-forming regions in the environs of the H II region Sh 2-205 (S205). S205 exhibits a complex morphology and coherent expansion on both global and subregional scales. We identify several O9-B1 stars and a 0.56 Myr old pulsar that are likely associated with the region. A momentum estimate suggests that feedback from these objects may account for the observed overall expansion. Trace-back analysis of the expansion, combined with color-magnitude diagram fitting for young star clusters, indicates at least two episodes of star formation. These results reveal a complex star-formation history of S205 and provide new insights into its 3D evolution.

astro-ph.GA↗

arXiv2026

Confucius4-TTS: Transcript-Free Cross-Lingual Zero-Shot TTS with a Learnable Speaker Encoder

Recent advances in zero-shot text-to-speech (TTS) have substantially improved speech quality and voice cloning fidelity. However, many zero-shot TTS systems still depend on audio prompt transcripts at inference time. This dependency limits cross-lingual voice cloning, since in-the-wild reference audio is often untranscribed. In this technical report, we present Confucius4-TTS, a multilingual zero-shot TTS system that supports 14 languages and performs both intra-lingual and cross-lingual reference cloning without requiring transcripts of audio prompts. Confucius4-TTS follows a two-stage architecture, consisting of text-to-semantic (T2S) and semantic-to-acoustic (S2A) modules. The LLM-based T2S module uses a learnable speaker encoder to extract timbre features from self-supervised speech representations, and the conditional flow-matching S2A module converts the predicted semantic tokens into mel-spectrograms. The same model also supports continuation cloning when a reference transcript is available. Confucius4-TTS is trained on large-scale multilingual speech data. It achieves high intelligibility and speaker similarity on public benchmarks. On the CV3-Eval cross-lingual benchmark, Confucius4-TTS obtains an average WER of 3.73% across six directions. On our internal cross-lingual set, it achieves the best average overall rank in human evaluation among recent open-source and commercial systems. We release code, model checkpoints, and demos at https://github.com/netease-youdao/Confucius4-TTS.

cs.SD↗

arXiv2026

Enhancing VLBI Capability with the SKA-Mid and the Jingdong 120-m Radio Telescope

The Jingdong Radio Telescope (JRT) is a 120-meter fully steerable radio telescope currently under construction in Jingdong County, Yunnan Province, China. Located at a relatively low latitude (24.5 degree), the JRT will enable observations of nearly 90% of the sky. Equipped with two broadband single-pixel receivers covering 1-8 GHz and 6-18 GHz, and a powerful digital backend, the telescope will support single-dish studies of various radio sources-particularly millisecond pulsars for enhancing the detection of nanohertz gravitational waves. In addition to single-dish capabilities, the JRT is expected to contribute approximately 800 hours annually to international Very Long Baseline Interferometry (VLBI) observations via a standard VLBI backend. When operating in conjunction with the phased-up SKA-Mid, the JRT will significantly enhance the technical and scientific capabilities of existing VLBI networks. This paper presents a comprehensive overview of the JRT's VLBI module and explores its potential to improve joint VLBI observations with current VLBI networks. Our analysis suggests that coordinated VLBI observations involving both the SKA-Mid and the JRT have the potential to significantly advance the field. For early sciences, we also highlight a few highly promising scientific cases, e.g. measuring the distance to PSR J0437-4715 with <1 ly accuracy and exploring jet formation with an event-horizon-scale resolution in M60*.

astro-ph.IM↗

arXiv2026

Mapping the Milky Way with Masers

SKA-VLBI is poised to revolutionize our understanding of the Galactic structure through its unprecedented astrometric precision and sensitivity. As a next-generation facility, it will answer long-standing questions about the Galactic structure by mapping its entire spiral structure in detail, spanning from the solar neighborhood, through the Galactic Center, to the far side of the Milky Way. Its access to the Southern sky will allow us to obtain more precise 3D parameters of the Galactic bar, reveal the nature of the 3-kpc Arm, and clarify the dynamical coupling between the bar and the spiral arms. By leveraging high-precision astrometry of numerous celestial objects with SKA-VLBI, the Galactic fundamental parameters such as the Solar motion and the Galactic rotation curve can be constrained more precisely. These advancements will not only elucidate the structure of our Milky Way, but also provide benchmarks for understanding barred spiral galaxies in general. Furthermore, they are important for advancing our knowledge of cosmological structure formation. The capabilities of SKA-VLBI will open a new era of high precision Galactic astrometry.

astro-ph.GA↗

arXiv2026

DualGuard: Dual-stream Large Language Model Watermarking Defense against Paraphrase and Spoofing Attack

With the rapid development of cloud-based services, large language models have become increasingly accessible through various web platforms. However, this accessibility has also led to growing risks of model abuse. LLM watermarking has emerged as an effective approach to mitigate such misuse and protect intellectual property. Existing watermarking algorithms, however, primarily focus on defending against paraphrase attacks while overlooking piggyback spoofing attacks, which can inject harmful content, compromise watermark reliability, and undermine trust in attribution. To address this limitation, we propose DualGuard, the first watermarking algorithm capable of defending against both paraphrase and spoofing attacks. DualGuard employs the adaptive dual-stream watermarking mechanism, in which two complementary watermark signals are dynamically injected based on the semantic content. This design enables DualGuard not only to detect but also to trace spoofing attacks, thereby ensuring reliable and trustworthy watermark detection. Extensive experiments conducted across multiple datasets and language models demonstrate that DualGuard achieves excellent detectability, robustness, traceability, and text quality, effectively advancing the state of LLM watermarking for real-world applications.

cs.CR↗

arXiv2026

All-Optical Segmentation via Diffractive Neural Networks for Autonomous Driving

Semantic segmentation and lane detection are crucial tasks in autonomous driving systems. Conventional approaches predominantly rely on deep neural networks (DNNs), which incur high energy costs due to extensive analog-to-digital conversions and large-scale image computations required for low-latency, real-time responses. Diffractive optical neural networks (DONNs) have shown promising advantages over conventional DNNs on digital or optoelectronic computing platforms in energy efficiency. By performing all-optical image processing via light diffraction at the speed of light, DONNs save computation energy costs while reducing the overhead associated with analog-to-digital conversions by all-optical encoding and computing. In this work, we propose a novel all-optical computing framework for RGB image segmentation and lane detection in autonomous driving applications. Our experimental results demonstrate the effectiveness of the DONN system for image segmentation on the CityScapes dataset. Additionally, we conduct case studies on lane detection using a customized indoor track dataset and simulated driving scenarios in CARLA, where we further evaluate the model's generalizability under diverse environmental conditions.

cs.CV↗

arXiv2026

HoloGraph: All-Optical Graph Learning via Light Diffraction

As a representative of next-generation device/circuit technology beyond CMOS, physics-based neural networks such as Diffractive Optical Neural Networks (DONNs) have demonstrated promising advantages in computational speed and energy efficiency. However, existing DONNs and other physics-based neural networks have mostly focused on exploring their machine intelligence, with limited studies in handling graph-structured tasks. Thus, we introduce HoloGraph, the first monolithic free-space all-optical graph neural network system. It proposes a novel, domain-specific message-passing mechanism with optical skip channels integrated into light propagation for the all-optical graph learning. HoloGraph enables light-speed optical message passing over graph structures with diffractive propagation and phase modulations. Our experimental results with HoloGraph, conducted using standard graph learning datasets Cora-ML and Citeseer, show competitive or even superior classification performance compared to conventional digital graph neural networks. Comprehensive ablation studies demonstrate the effectiveness of the proposed novel architecture and algorithmic methods.

cs.ET↗

arXiv2025

From Essence to Defense: Adaptive Semantic-aware Watermarking for Embedding-as-a-Service Copyright Protection

Benefiting from the superior capabilities of large language models in natural language understanding and generation, Embeddings-as-a-Service (EaaS) has emerged as a successful commercial paradigm on the web platform. However, prior studies have revealed that EaaS is vulnerable to imitation attacks. Existing methods protect the intellectual property of EaaS through watermarking techniques, but they all ignore the most important properties of embedding: semantics, resulting in limited harmlessness and stealthiness. To this end, we propose SemMark, a novel semantic-based watermarking paradigm for EaaS copyright protection. SemMark employs locality-sensitive hashing to partition the semantic space and inject semantic-aware watermarks into specific regions, ensuring that the watermark signals remain imperceptible and diverse. In addition, we introduce the adaptive watermark weight mechanism based on the local outlier factor to preserve the original embedding distribution. Furthermore, we propose Detect-Sampling and Dimensionality-Reduction attacks and construct four scenarios to evaluate the watermarking method. Extensive experiments are conducted on four popular NLP datasets, and SemMark achieves superior verifiability, diversity, stealthiness, and harmlessness.

cs.CR↗

arXiv2025

The Milky Way Imaging Scroll Painting Survey: Data Release 1

We present the first data release (DR1) of the Milky Way Imaging Scroll Painting (MWISP) survey, a mapping in the J=(1-0) transition lines of 12CO, 13CO, and C18O toward the northern Galactic plane during 2011-2022. The MWISP survey was conducted using the PMO 13.7 m telescope at a spatial resolution of approximately 50" and a velocity resolution of 0.16 km/s at 115 GHz. DR1 fully covered 2310 square degrees within the Galactic longitude (l) and latitude (b) range of 9.75 deg =< l =< 229.75 deg and |b| =< 5.25 deg. The surveyed area was divided into cell units of 30'x30' for practical purposes and On-The-Fly (OTF) mapping was performed toward each target cell unit. The data were regridded into a regular 3D datacube in l-b-V_LSR with a pixel size of 30" in l-b axes and 0.16 km/s in theV_LSR axis. The median rms noise is 0.47 K, 0.25 K, and 0.25 K for 12CO, 13CO, and C18O, respectively. The equivalent 3 sigma sensitivity in 12CO luminosity is approximately 0.23 K km/s, making MWISP the most sensitive survey of its kind. In this paper, we describe the survey data, including the calibration, data cleaning, data mosaic processes, and the data products. The final mosaicked data cubes contain about 3.33x10^7 spectra (pixels) for each CO isotopologue line. Color composite images, made from the intensities of the isotopologue lines, and some concise descriptions are provided. We constructed a molecular cloud catalog based on the mosaicked 12CO data cube using the clustering algorithm DBSCAN, detecting 103,517 molecular clouds, 10,790 of which exhibit 13CO emission and 304 of which show C18O emission. Based on the histogram of voxel brightness temperature, we estimated a total 12CO flux of 7.69+/-0.38x10^7 K km/s arcmin^2, 82% of which is captured by the DBSCAN algorithm. The data, together with the cloud sample, provide unique information on molecular gas in the northern Milky Way.

astro-ph.GA↗

arXiv2025

GROOT: Graph Edge Re-growth and Partitioning for the Verification of Large Designs in Logic Synthesis

Traditional verification methods in chip design are highly time-consuming and computationally demanding, especially for large scale circuits. Graph neural networks (GNNs) have gained popularity as a potential solution to improve verification efficiency. However, there lacks a joint framework that considers all chip design domain knowledge, graph theory, and GPU kernel designs. To address this challenge, we introduce GROOT, an algorithm and system co-design framework that contains chip design domain knowledge and redesigned GPU kernels, to improve verification efficiency. More specifically, we create node features utilizing the circuit node types and the polarity of the connections between the input edges to nodes in And-Inverter Graphs (AIGs). We utilize a graph partitioning algorithm to divide the large graphs into smaller sub-graphs for fast GPU processing and develop a graph edge re-growth algorithm to recover verification accuracy. We carefully profile the EDA graph workloads and observe the uniqueness of their polarized distribution of high degree (HD) nodes and low degree (LD) nodes. We redesign two GPU kernels (HD-kernel and LD-kernel), to fit the EDA graph learning workload on a single GPU. We compare the results with state-of-the-art (SOTA) methods: GAMORA, a GNN-based approach, and the traditional ABC framework. Results show that GROOT achieves a significant reduction in memory footprint (59.38 %), with high accuracy (99.96%) for a very large CSA multiplier, i.e. 1,024 bits with a batch size of 16, which consists of 134,103,040 nodes and 268,140,544 edges. We compare GROOT with GPU-based GPU Kernel designs SOTAs such as cuSPARSE, MergePath-SpMM, and GNNAdvisor. We achieve up to 1.104x, 5.796x, and 1.469x improvement in runtime, respectively.

cs.LG↗

arXiv2025

MoSa: Motion Generation with Scalable Autoregressive Modeling

We introduce MoSa, a novel hierarchical motion generation framework for text-driven 3D human motion generation that enhances the Vector Quantization-guided Generative Transformers (VQ-GT) paradigm through a coarse-to-fine scalable generation process. In MoSa, we propose a Multi-scale Token Preservation Strategy (MTPS) integrated into a hierarchical residual vector quantization variational autoencoder (RQ-VAE). MTPS employs interpolation at each hierarchical quantization to effectively retain coarse-to-fine multi-scale tokens. With this, the generative transformer supports Scalable Autoregressive (SAR) modeling, which predicts scale tokens, unlike traditional methods that predict only one token at each step. Consequently, MoSa requires only 10 inference steps, matching the number of RQ-VAE quantization layers. To address potential reconstruction degradation from frequent interpolation, we propose CAQ-VAE, a lightweight yet expressive convolution-attention hybrid VQ-VAE. CAQ-VAE enhances residual block design and incorporates attention mechanisms to better capture global dependencies. Extensive experiments show that MoSa achieves state-of-the-art generation quality and efficiency, outperforming prior methods in both fidelity and speed. On the Motion-X dataset, MoSa achieves an FID of 0.06 (versus MoMask's 0.20) while reducing inference time by 27 percent. Moreover, MoSa generalizes well to downstream tasks such as motion editing, requiring no additional fine-tuning. The code is available at https://mosa-web.github.io/MoSa-web

cs.CV↗

arXiv2025

Declarative Techniques for NL Queries over Heterogeneous Data

In many industrial settings, users wish to ask questions in natural language, the answers to which require assembling information from diverse structured data sources. With the advent of Large Language Models (LLMs), applications can now translate natural language questions into a set of API calls or database calls, execute them, and combine the results into an appropriate natural language response. However, these applications remain impractical in realistic industrial settings because they do not cope with the data source heterogeneity that typifies such environments. In this work, we simulate the heterogeneity of real industry settings by introducing two extensions of the popular Spider benchmark dataset that require a combination of database and API calls. Then, we introduce a declarative approach to handling such data heterogeneity and demonstrate that it copes with data source heterogeneity significantly better than state-of-the-art LLM-based agentic or imperative code generation systems. Our augmented benchmarks are available to the research community.

cs.DB↗

arXiv2025

Analyzing and Internalizing Complex Policy Documents for LLM Agents

Large Language Model (LLM)-based agentic systems rely on in-context policy documents encoding diverse business rules. As requirements grow, these documents expand rapidly, causing high computational overhead. This motivates developing internalization methods that embed policy documents into model priors while preserving performance. Prior prompt compression work targets generic prompts, but agentic policy documents span multiple complexity levels and require deeper reasoning, making internalization harder. We introduce CC-Gen, an agentic benchmark generator with Controllable Complexity across four levels, enabling systematic evaluation of agents' ability to handle complexity and offering a unified framework for assessing policy internalization. Our analysis shows that complex policy specifications governing workflows pose major reasoning challenges. Supporting internalization with gold user agent interaction trajectories containing chain-of-thought (CoT) annotations via supervised fine-tuning (SFT) is data-intensive and degrades sharply as policy complexity increases. To mitigate data and reasoning burdens, we propose Category-Aware Policy Continued Pretraining (CAP-CPT). Our automated pipeline parses policy documents to extract key specifications, grouping them into factual, behavioral, and conditional categories, and isolating complex conditions that drive workflow complexity. This guides targeted data synthesis and enables agents to internalize policy information through an autoregressive pretraining loss. Experiments show CAP-CPT improves SFT baselines in all settings, with up to 41% and 22% gains on Qwen-3-32B, achieving 97.3% prompt length reduction on CC-Gen and further enhancing tau-Bench with minimal SFT data.

cs.AI↗

arXiv2025

ZhiFangDanTai: Fine-tuning Graph-based Retrieval-Augmented Generation Model for Traditional Chinese Medicine Formula

Traditional Chinese Medicine (TCM) formulas play a significant role in treating epidemics and complex diseases. Existing models for TCM utilize traditional algorithms or deep learning techniques to analyze formula relationships, yet lack comprehensive results, such as complete formula compositions and detailed explanations. Although recent efforts have used TCM instruction datasets to fine-tune Large Language Models (LLMs) for explainable formula generation, existing datasets lack sufficient details, such as the roles of the formula's sovereign, minister, assistant, courier; efficacy; contraindications; tongue and pulse diagnosis-limiting the depth of model outputs. To address these challenges, we propose ZhiFangDanTai, a framework combining Graph-based Retrieval-Augmented Generation (GraphRAG) with LLM fine-tuning. ZhiFangDanTai uses GraphRAG to retrieve and synthesize structured TCM knowledge into concise summaries, while also constructing an enhanced instruction dataset to improve LLMs' ability to integrate retrieved information. Furthermore, we provide novel theoretical proofs demonstrating that integrating GraphRAG with fine-tuning techniques can reduce generalization error and hallucination rates in the TCM formula task. Experimental results on both collected and clinical datasets demonstrate that ZhiFangDanTai achieves significant improvements over state-of-the-art models. Our model is open-sourced at https://huggingface.co/tczzx6/ZhiFangDanTai1.0.

cs.CL↗

arXiv2025

Deterministic and Scalable Coupling of Single 4H-SiC Spin Defects into Bullseye Cavities

Silicon carbide (SiC) has attracted significant attention as a promising quantum material due to its ability to host long-lived, optically addressable color centers with solid-state photonic interfaces. The CMOS compatibility of 4H-SiCOI (silicon-carbide-on-insulator) makes it an ideal platform for integrated quantum photonic devices and circuits. However, the deterministic integration of single spin defects into high-performance photonic cavities on this platform has remained a key challenge. In this work, we demonstrate the deterministic and scalable coupling of both ensemble (PL4) and single PL6 spin defects into monolithic bullseye cavities on the 4H-SiCOI platform. By tuning the cavity resonance, we achieve a 40-fold enhancement of the zero-phonon line (ZPL) intensity from ensemble PL4 defects, corresponding to a Purcell factor of approximately 5.0. For deterministically coupled single PL6 defects, we observe a threefold increase in the saturated photon count rate, confirm single-photon emission, and demonstrate coherent control of the spin state through optically detected magnetic resonance (ODMR), resonant excitation, and Rabi oscillations. These advancements establish a viable pathway for developing scalable, high-performance SiC-based quantum photonic circuits.

quant-ph↗

arXiv2025

Differentiable Quadratic Optimization For The Maximum Independent Set Problem

Combinatorial Optimization (CO) addresses many important problems, including the challenging Maximum Independent Set (MIS) problem. Alongside exact and heuristic solvers, differentiable approaches have emerged, often using continuous relaxations of ReLU-based or quadratic objectives. Noting that an MIS in a graph is a Maximum Clique (MC) in its complement, we propose a new quadratic formulation for MIS by incorporating an MC term, improving convergence and exploration. We show that every maximal independent set corresponds to a local minimizer, derive conditions with respect to the MIS size, and characterize stationary points. To tackle the non-convexity of the objective, we propose optimizing several initializations in parallel using momentum-based gradient descent, complemented by an efficient MIS checking criterion derived from our theory. We dub our method as parallelized Clique-Informed Quadratic Optimization for MIS (pCQO-MIS). Our experimental results demonstrate the effectiveness of the proposed method compared to exact, heuristic, sampling, and data-centric approaches. Notably, our method avoids the out-of-distribution tuning and reliance on (un)labeled data required by data-centric methods, while achieving superior MIS sizes and competitive runtime relative to their inference time. Additionally, a key advantage of pCQO-MIS is that, unlike exact and heuristic solvers, the runtime scales only with the number of nodes in the graph, not the number of edges. Our code is available at the GitHub repository: https://github.com/ledenmat/pCQO-mis-benchmark/tree/refactor.

cs.DM↗

arXiv2025

PAFFA: Premeditated Actions For Fast Agents

Modern AI assistants have made significant progress in natural language understanding and tool-use, with emerging efforts to interact with Web interfaces. However, current approaches that heavily rely on repeated LLM-driven HTML parsing are computationally expensive and error-prone, particularly when handling dynamic web interfaces and multi-step tasks. We introduce PAFFA (Premeditated Actions For Fast Agents), a method that makes LLMs faster and more accurate in completing tasks on the internet using a novel inference-time technique that requires no task-specific training. PAFFA constructs an 'Action Library', leveraging the parametric knowledge of the base LLM to pre-compute browser interaction patterns that generalize across tasks. By strategically re-using LLM inference across tasks - either via 'Dist-Map' for task-agnostic identification of key interactive web elements, or 'Unravel' for first-encounter, stateful exploration of novel tasks/sites) - PAFFA drastically reduces inference time tokens by 87% while maintaining robust performance (achieving 0.57 vs. 0.50 step accuracy compared to baseline). Further, Unravel's ability to update its action library based on explorations allows generalization and adaptation to unseen websites. In sum, this work exhibits that LLM reasoning sequences can generalize across prompts, offering a way to scale inference-time techniques for internet-scale data with sublinear token count.

cs.AI↗

arXiv2025

Outflowing Gas in the Planetary Nebula K 3-54

As planetary nebulae (PNe) evolve, they develop slow and strong dust-driven stellar winds, making the joint study of dust and gas essential for understanding their nature. As a pilot investigation, we selected PN K 3-54 as our target, the only known PN in the Milky Way to exhibit infrared emission from both graphene (C$_{24}$) and fullerene (C$_{60}$). The gas is traced via molecular line emissions from $^{12}$CO, $^{13}$CO, and C$^{18}$O ($J = 1 \rightarrow 0$), observed using the 13.7 m telescope of the Purple Mountain Observatory. We investigate the dynamics of this PN and identify a bipolar outflow. Preliminary results suggest that the large dynamical timescale of the outflow and the weak shock environment may account for the simultaneous survival of C$_{24}$ and C$_{60}$ within and around PN K 3-54.

astro-ph.GA↗