arXiv subjects

Yan Jiang

Publications and source records attributed to Yan Jiang.

At least 55 records · Page 3Linked to original sources

arXiv2026

Frequency Shaping Control for Oscillation Damping in Weakly-Connected Power Network: A Root Locus Method

Frequency control following a contingency event is of vital concern in power system operations. Leveraging inverter-based resources, it is not hard to shape the center of inertia (COI) frequency nicely. However, under weak grid conditions, it becomes insufficient to solely shape the COI frequency since this aggregate signal fails to reveal the inter-area oscillations. In this manuscript, we advocate for foolproof fine-tuning rules for \emph{frequency shaping control} (FS) based on a systematic analysis of damping ratio and decay rate of inter-area oscillations to simultaneously meet specified metrics for frequency security and oscillatory stability. To this end, building on a modal decomposition, we simplify the oscillation damping problem into a pole-placement task for a set of scalar subsystems, which can be efficiently solved by only investigating the root locus of a scalar subsystem associated with the main mode, while FS inherently guarantees a Nadir-less COI frequency response. Through our proposed root-locus-based oscillatory stability analysis, we derive closed-form expressions for the minimum damping ratio and decay rate among inter-area oscillations in terms of networked system and control parameters under FS. Moreover, we propose useful tuning guidelines for FS which need only simple calculations or visualized tuning to not only shape the COI frequency into a first-order response that converges to a steady-state value within the allowed range but also ensure a satisfactory damping ratio and decay rate of inter-area oscillations following disturbances. As for the common virtual inertia control (VI), although similar oscillatory stability analysis becomes intractable, one can still glean some insights via the root locus method. Numerical simulations validate the proposed tuning for FS as well as the superiority of FS over VI in exponential convergence rate.

eess.SY↗

arXiv2026

Sub-wavelength resonances in two-dimensional multi-layer elastic media

In this paper, we focus on the sub-wavelength resonances in two-dimensional elastic media characterized by high contrasts in both Lamé parameters and density. Our contributions are fourfold. First, it is proved that the operator $\hat{\mathbf{S}}_{\partial D}^ω$, which serves as a leading order approximation to $\mathbf{S}_{\partial D}^ω$ as $ω\rightarrow0$, is invertible in the space $\mathcal{L}(L^{2}\left(\partial D)^{2},H^{1}(\partial D)^{2}\right)$. Second, based on layer potential techniques in combination with asymptotic analysis, we derive an original formula for the leading-order terms of sub-wavelength resonance frequencies, which are controlled by the determinant of the $3N \times 3N$ matrices. Specifically, there are $3N$ resonance frequencies within an $N$-nested layer structure. In addition, the scattering field exhibits an enhancement coefficient on the order of $\mathcal{O}(ω^{-2})$ as the incident frequency $ω$ approaches the resonance frequency. Third, by applying spectral properties to solve the corresponding eigenvalue problem, we compute the quantitative expressions for sub-wavelength resonance frequencies within a disk. Finally, some numerical experiments are provided to illustrate theoretical results and demonstrate the existence of the sub-wavelength resonance modes.

math.AP↗

arXiv2026

Inverse Spectral Problem With Low Regularity Refractive Index

This article investigates the unique determination of a radial refractive index n from spectral data. First, we demonstrate that for piecewise twice continuously differentiable functions, n is not uniquely determined by the special transmission eigenvalues associated with radially symmetric eigenfunctions. Subsequently we prove that if n \in M is twice continuously differentiable functions(or continuously differentiable functions with Lipschitz continuous derivative), then n is uniquely determined on [0,1] by all special transmission eigenvalues when supplemented by partial a priori information on the refractive index.

math.AP↗

arXiv2025

Multi-Focused Video Group Activities Hashing

With the explosive growth of video data in various complex scenarios, quickly retrieving group activities has become an urgent problem. However, many tasks can only retrieve videos focusing on an entire video, not the activity granularity. To solve this problem, we propose a new STVH (spatiotemporal interleaved video hashing) technique for the first time. Through a unified framework, the STVH simultaneously models individual object dynamics and group interactions, capturing the spatiotemporal evolution on both group visual features and positional features. Moreover, in real-life video retrieval scenarios, it may sometimes require activity features, while at other times, it may require visual features of objects. We then further propose a novel M-STVH (multi-focused spatiotemporal video hashing) as an enhanced version to handle this difficult task. The advanced method incorporates hierarchical feature integration through multi-focused representation learning, allowing the model to jointly focus on activity semantics features and object visual features. We conducted comparative experiments on publicly available datasets, and both STVH and M-STVH can achieve excellent results.

cs.CV↗

arXiv2025

Rota-Baxter operators on braces, post-braces and the Yang-Baxter equation

Combining the notions of braces and relative Rota-Baxter operators on groups in connection with the Yang-Baxter equation and a factorization theorem of Lie groups from integrable systems, relative Rota-Baxter operators on braces and post-braces are introduced. A relative Rota-Baxter operator on a brace naturally induces a post-brace, and conversely, every post-brace determines a relative Rota-Baxter operator on its sub-adjacent brace. Furthermore, a post-brace yields two Drinfel'd-isomorphic solutions to the Yang-Baxter equation. As a special case, {\it enhanced} relative Rota-Baxter operators give rise to matched pairs of braces. Focusing on enhanced Rota-Baxter operators on two-sided braces, a corresponding factorization theorem is established. Examples are provided from the two-sided brace associated with the three-dimensional Heisenberg Lie algebra.

math-ph↗

arXiv2025

F.A.C.U.L.: Language-Based Interaction with AI Companions in Gaming

In cooperative video games, traditional AI companions are deployed to assist players, who control them using hotkeys or command wheels to issue predefined commands such as ``attack'', ``defend'', or ``retreat''. Despite their simplicity, these methods, which lack target specificity, limit players' ability to give complex tactical instructions and hinder immersive gameplay experiences. To address this problem, we propose the FPS AI Companion who Understands Language (F.A.C.U.L.), the first real-time AI system that enables players to communicate and collaborate with AI companions using natural language. By integrating natural language processing with a confidence-based framework, F.A.C.U.L. efficiently decomposes complex commands and interprets player intent. It also employs a dynamic entity retrieval method for environmental awareness, aligning human intentions with decision-making. Unlike traditional rule-based systems, our method supports real-time language interactions, enabling players to issue complex commands such as ``clear the second floor'', ``take cover behind that tree'', or ``retreat to the river''. The system provides real-time behavioral responses and vocal feedback, ensuring seamless tactical collaboration. Using the popular FPS game \textit{Arena Breakout: Infinite} as a case study, we present comparisons demonstrating the efficacy of our approach and discuss the advantages and limitations of AI companions based on real-world user feedback.

cs.HC↗

arXiv2025

A Wave Front Tracking Scheme for Flux Reconstruction in $2\times 2$ Hyperbolic Conservation Laws

This paper introduces a novel wave front tracking framework for reconstructing unknown flux functions in $2\times 2$ hyperbolic conservation laws, extending beyond the well-studied scalar case. By analyzing Riemann solutions at fixed observation times, we develop explicit reconstruction formulas that handle arbitrary combinations of shock and rarefaction waves through a unified equivalent shock concept. Our method constructs piecewise quadratic $C^1$ flux approximations with rigorous convergence guarantees: the approximation errors decrease quadratically with the discretization parameters for function values and linearly for derivatives under $C^{1,1}$ regularity, with enhanced cubic and quadratic convergence respectively under $C^3$ regularity. Applications to the isentropic Euler equations and the mathematically equivalent p-system in compressible fluid dynamics demonstrate the method's capability to identify complete equations of state from limited dynamic measurements, providing a systematic approach to a fundamental inverse problem in continuum mechanics.

math.AP↗

arXiv2025

Overview of CHIP 2025 Shared Task 2: Discharge Medication Recommendation for Metabolic Diseases Based on Chinese Electronic Health Records

Discharge medication recommendation plays a critical role in ensuring treatment continuity, preventing readmission, and improving long-term management for patients with chronic metabolic diseases. This paper present an overview of the CHIP 2025 Shared Task 2 competition, which aimed to develop state-of-the-art approaches for automatically recommending appro-priate discharge medications using real-world Chinese EHR data. For this task, we constructed CDrugRed, a high-quality dataset consisting of 5,894 de-identified hospitalization records from 3,190 patients in China. This task is challenging due to multi-label nature of medication recommendation, het-erogeneous clinical text, and patient-specific variability in treatment plans. A total of 526 teams registered, with 167 and 95 teams submitting valid results to the Phase A and Phase B leaderboards, respectively. The top-performing team achieved the highest overall performance on the final test set, with a Jaccard score of 0.5102, F1 score of 0.6267, demonstrating the potential of advanced large language model (LLM)-based ensemble systems. These re-sults highlight both the promise and remaining challenges of applying LLMs to medication recommendation in Chinese EHRs. The post-evaluation phase remains open at https://tianchi.aliyun.com/competition/entrance/532411/.

cs.CL↗

arXiv2025

Mixture-of-Experts Operator Transformer for Large-Scale PDE Pre-Training

Pre-training has proven effective in addressing data scarcity and performance limitations in solving PDE problems with neural operators. However, challenges remain due to the heterogeneity of PDE datasets in equation types, which leads to high errors in mixed training. Additionally, dense pre-training models that scale parameters by increasing network width or depth incur significant inference costs. To tackle these challenges, we propose a novel Mixture-of-Experts Pre-training Operator Transformer (MoE-POT), a sparse-activated architecture that scales parameters efficiently while controlling inference costs. Specifically, our model adopts a layer-wise router-gating network to dynamically select 4 routed experts from 16 expert networks during inference, enabling the model to focus on equation-specific features. Meanwhile, we also integrate 2 shared experts, aiming to capture common properties of PDE and reduce redundancy among routed experts. The final output is computed as the weighted average of the results from all activated experts. We pre-train models with parameters from 30M to 0.5B on 6 public PDE datasets. Our model with 90M activated parameters achieves up to a 40% reduction in zero-shot error compared with existing models with 120M activated parameters. Additionally, we conduct interpretability analysis, showing that dataset types can be inferred from router-gating network decisions, which validates the rationality and effectiveness of the MoE architecture.

cs.LG↗

arXiv2025

MagicPortrait: Temporally Consistent Face Reenactment with 3D Geometric Guidance

In this study, we propose a method for video face reenactment that integrates a 3D face parametric model into a latent diffusion framework, aiming to improve shape consistency and motion control in existing video-based face generation approaches. Our approach employs the FLAME (Faces Learned with an Articulated Model and Expressions) model as the 3D face parametric representation, providing a unified framework for modeling face expressions and head pose. This not only enables precise extraction of motion features from driving videos, but also contributes to the faithful preservation of face shape and geometry. Specifically, we enhance the latent diffusion model with rich 3D expression and detailed pose information by incorporating depth maps, normal maps, and rendering maps derived from FLAME sequences. These maps serve as motion guidance and are encoded into the denoising UNet through a specifically designed Geometric Guidance Encoder (GGE). A multi-layer feature fusion module with integrated self-attention mechanisms is used to combine facial appearance and motion latent features within the spatial domain. By utilizing the 3D face parametric model as motion guidance, our method enables parametric alignment of face identity between the reference image and the motion captured from the driving video. Experimental results on benchmark datasets show that our method excels at generating high-quality face animations with precise expression and head pose variation modeling. In addition, it demonstrates strong generalization performance on out-of-domain images. Code is publicly available at https://github.com/weimengting/MagicPortrait.

cs.CV↗

arXiv2025

Does Homophily Help in Robust Test-time Node Classification?

Homophily, the tendency of nodes from the same class to connect, is a fundamental property of real-world graphs, underpinning structural and semantic patterns in domains such as citation networks and social networks. Existing methods exploit homophily through designing homophily-aware GNN architectures or graph structure learning strategies, yet they primarily focus on GNN learning with training graphs. However, in real-world scenarios, test graphs often suffer from data quality issues and distribution shifts, such as domain shifts across users from different regions in social networks and temporal evolution shifts in citation network graphs collected over varying time periods. These factors significantly compromise the pre-trained model's robustness, resulting in degraded test-time performance. With empirical observations and theoretical analysis, we reveal that transforming the test graph structure by increasing homophily in homophilic graphs or decreasing it in heterophilic graphs can significantly improve the robustness and performance of pre-trained GNNs on node classifications, without requiring model training or update. Motivated by these insights, a novel test-time graph structural transformation method grounded in homophily, named GrapHoST, is proposed. Specifically, a homophily predictor is developed to discriminate test edges, facilitating adaptive test-time graph structural transformation by the confidence of predicted homophily scores. Extensive experiments on nine benchmark datasets under a range of test-time data quality issues demonstrate that GrapHoST consistently achieves state-of-the-art performance, with improvements of up to 10.92%. Our code has been released at https://github.com/YanJiangJerry/GrapHoST.

cs.LG↗

arXiv2025

Attentive Convolution: Unifying the Expressivity of Self-Attention with Convolutional Efficiency

Self-attention (SA) has become the cornerstone of modern vision backbones for its powerful expressivity over traditional Convolutions (Conv). However, its quadratic complexity remains a critical bottleneck for practical applications. Given that Conv offers linear complexity and strong visual priors, continuing efforts have been made to promote the renaissance of Conv. However, a persistent performance chasm remains, highlighting that these modernizations have not yet captured the intrinsic expressivity that defines SA. In this paper, we re-examine the design of the CNNs, directed by a key question: what principles give SA its edge over Conv? As a result, we reveal two fundamental insights that challenge the long-standing design intuitions in prior research (e.g., Receptive field). The two findings are: (1) \textit{Adaptive routing}: SA dynamically regulates positional information flow according to semantic content, whereas Conv employs static kernels uniformly across all positions. (2) \textit{Lateral inhibition}: SA induces score competition among token weighting, effectively suppressing redundancy and sharpening representations, whereas Conv filters lack such inhibitory dynamics and exhibit considerable redundancy. Based on this, we propose \textit{Attentive Convolution} (ATConv), a principled reformulation of the convolutional operator that intrinsically injects these principles. Interestingly, with only $3\times3$ kernels, ATConv consistently outperforms various SA mechanisms in fundamental vision tasks. Building on ATConv, we introduce AttNet, a CNN family that can attain \textbf{84.4\%} ImageNet-1K Top-1 accuracy with only 27M parameters. In diffusion-based image generation, replacing all SA with the proposed $3\times 3$ ATConv in SiT-XL/2 reduces ImageNet FID by 0.15 in 400k steps with faster sampling. Code is available at: github.com/price112/Attentive-Convolution.

cs.CV↗

arXiv2025

CO in MASsive Spirals (CO-MASS): an IRAM 30m CO emission line survey of the CGM-MASS sample

There exist extremely massive spiral galaxies in isolated environments, with stellar masses several times that of the Milky Way, yet their star formation rates (SFRs) are comparable to or even lower than that of the Milky Way. In this paper, we investigate the molecular gas properties of such galaxies to better understand the origin of their low SFRs. We present IRAM 30m CO observations of five extremely massive spirals from the CGM-MASS sample. We compare their star formation efficiencies (SFEs) with the Kennicutt-Schmidt relation and find that these massive spirals generally exhibit low efficiency in converting molecular gas into stars. We further compare their molecular gas masses with their atomic gas and stellar masses, and also include the CHANG-ES sample galaxies observed with the IRAM 30m telescope in a similar manner for comparison. Our sample galaxies show low efficiency in converting atomic to molecular gas and have lower molecular gas fractions, suggesting that their suppressed star formation stems from both limited gas supply and inefficient star formation. Considering potential cold gas sources in massive spirals, we argue that their current reservoirs likely originate from past starburst or merger events rather than ongoing accretion in present isolated environments. Finally, we examine the location of these galaxies on the baryonic Tully-Fisher relation, finding them baryon-deficient and deviating from the trend of lower-mass galaxies. This suggests either a significant undetected baryonic component or a flattening/turnover of the relation at the high-mass end, consistent with the stellar mass-halo mass relation.

astro-ph.GA↗

arXiv2025

A Unified Biomedical Named Entity Recognition Framework with Large Language Models

Accurate recognition of biomedical named entities is critical for medical information extraction and knowledge discovery. However, existing methods often struggle with nested entities, entity boundary ambiguity, and cross-lingual generalization. In this paper, we propose a unified Biomedical Named Entity Recognition (BioNER) framework based on Large Language Models (LLMs). We first reformulate BioNER as a text generation task and design a symbolic tagging strategy to jointly handle both flat and nested entities with explicit boundary annotation. To enhance multilingual and multi-task generalization, we perform bilingual joint fine-tuning across multiple Chinese and English datasets. Additionally, we introduce a contrastive learning-based entity selector that filters incorrect or spurious predictions by leveraging boundary-sensitive positive and negative samples. Experimental results on four benchmark datasets and two unseen corpora show that our method achieves state-of-the-art performance and robust zero-shot generalization across languages. The source codes are freely available at https://github.com/dreamer-tx/LLMNER.

cs.CL↗

arXiv2025

Demonstration of quantum error detection in a silicon quantum processor

Quantum error detection is essential in realizing large-scale universal quantum computation, especially for quantum error correction (QEC). However, key elements for FTQC have yet to be realized in silicon qubits. Here, we demonstrate quantum error detection on a donor-based silicon quantum processor comprising four-nuclear spin qubits and one electron spin as an auxiliary qubit. The entanglement capability of this system is validated through the establishment of two-qubit Bell state entanglement between the nuclear spins and the generation of a four-qubit Greenberger-Horne-Zeilinger (GHZ) state, achieving a GHZ state fidelity of 88.5(2.3)%. Furthermore, by executing a four-qubit error detection circuit with the stabilizers, we successfully detect arbitrary single-qubit errors. The encoded Bell state entanglement information is recovered by performing the Pauli-frame update (PFU) via postprocessing. Based on the detected errors, we identify strongly biased noise in our system. Our results mark a significant advance toward FTQC in silicon spin qubits.

quant-ph↗

arXiv2025

Game-Oriented ASR Error Correction via RAG-Enhanced LLM

With the rise of multiplayer online games, real-time voice communication is essential for team coordination. However, general ASR systems struggle with gaming-specific challenges like short phrases, rapid speech, jargon, and noise, leading to frequent errors. To address this, we propose the GO-AEC framework, which integrates large language models, Retrieval-Augmented Generation (RAG), and a data augmentation strategy using LLMs and TTS. GO-AEC includes data augmentation, N-best hypothesis-based correction, and a dynamic game knowledge base. Experiments show GO-AEC reduces character error rate by 6.22% and sentence error rate by 29.71%, significantly improving ASR accuracy in gaming scenarios.

cs.AI↗

arXiv2025

Hyperspectral Mamba for Hyperspectral Object Tracking

Hyperspectral object tracking holds great promise due to the rich spectral information and fine-grained material distinctions in hyperspectral images, which are beneficial in challenging scenarios. While existing hyperspectral trackers have made progress by either transforming hyperspectral data into false-color images or incorporating modality fusion strategies, they often fail to capture the intrinsic spectral information, temporal dependencies, and cross-depth interactions. To address these limitations, a new hyperspectral object tracking network equipped with Mamba (HyMamba), is proposed. It unifies spectral, cross-depth, and temporal modeling through state space modules (SSMs). The core of HyMamba lies in the Spectral State Integration (SSI) module, which enables progressive refinement and propagation of spectral features with cross-depth and temporal spectral information. Embedded within each SSI, the Hyperspectral Mamba (HSM) module is introduced to learn spatial and spectral information synchronously via three directional scanning SSMs. Based on SSI and HSM, HyMamba constructs joint features from false-color and hyperspectral inputs, and enhances them through interaction with original spectral features extracted from raw hyperspectral images. Extensive experiments conducted on seven benchmark datasets demonstrate that HyMamba achieves state-of-the-art performance. For instance, it achieves 73.0\% of the AUC score and 96.3\% of the DP@20 score on the HOTC2020 dataset. The code will be released at https://github.com/lgao001/HyMamba.

cs.CV↗

arXiv2025

SoK: Understanding the Fundamentals and Implications of Sensor Out-of-band Vulnerabilities

Sensors are fundamental to cyber-physical systems (CPS), enabling perception and control by transducing physical stimuli into digital measurements. However, despite growing research on physical attacks on sensors, our understanding of sensor hardware vulnerabilities remains fragmented due to the ad-hoc nature of this field. Moreover, the infinite attack signal space further complicates threat abstraction and defense. To address this gap, we propose a systematization framework, termed sensor out-of-band (OOB) vulnerabilities, that for the first time provides a comprehensive abstraction for sensor attack surfaces based on underlying physical principles. We adopt a bottom-up systematization methodology that analyzes OOB vulnerabilities across three levels. At the component level, we identify the physical principles and limitations that contribute to OOB vulnerabilities. At the sensor level, we categorize known attacks and evaluate their practicality. At the system level, we analyze how CPS features such as sensor fusion, closed-loop control, and intelligent perception impact the exposure and mitigation of OOB threats. Our findings offer a foundational understanding of sensor hardware security and provide guidance and future directions for sensor designers, security researchers, and system developers aiming to build more secure sensors and CPS.

cs.CR↗