Search arXiv⌕ Search

arXiv subjects

Ping Zhang

Publications and source records attributed to Ping Zhang.

At least 91 records · Page 5Linked to original sources

Low-Altitude Wireless Networks: A Comprehensive Survey

The rapid development of the low-altitude economy has imposed unprecedented demands on wireless infrastructure to accommodate large-scale drone deployments and facilitate intelligent services in dynamic airspace environments. However, unlocking its full potential in practical applications presents significant challenges. Traditional aerial systems predominantly focus on air-ground communication services, often neglecting the integration of sensing, computation, control, and energy-delivering functions, which hinders the ability to meet diverse mission-critical demands. Besides, the absence of systematic low-altitude airspace planning and management exacerbates issues regarding dynamic interference in three-dimensional space, coverage instability, and scalability. To overcome these challenges, a comprehensive framework, termed low-altitude wireless network (LAWN), has emerged to seamlessly integrate communication, sensing, computation, control, and air traffic management into a unified design. This article provides a comprehensive overview of LAWN systems, introducing LAWN system fundamentals and the evolution of functional designs. Subsequently, we delve into performance evaluation metrics and review critical concerns surrounding privacy and security in the open-air network environment. Finally, we present the cutting-edge developments in airspace structuring and air traffic management, providing insights to facilitate the practical deployment of LAWNs.

eess.SP↗

Energy threshold in Smith-Purcell radiation

Smith Purcell radiation has emerged as a crucial platform for investigating light-matter interactions and developing compact, tunable light sources that span from microwaves to X-rays. In classical theory, it is believed that Cherenkov radiation exhibits an energy threshold for electrons, while Smith Purcell radiation is considered free of such a threshold. Although quantum theory suggests there is an emission cutoff in Smith-Purcell radiation, the behavior of this radiation near the threshold remains understudied. In this article, we address this gap by examining the behavior of Smith-Purcell radiation near the threshold from quantum perspectives. Specifically, we derive a quantum energy threshold based on energy-momentum conservation, providing a rigorous limit for the onset of Smith Purcell radiation. Furthermore, we find that around the threshold the incident electron emits a photon and subsequently reverses its direction of motion. Additionally, we establish a classical energy threshold below which the classical theory breakdown by applying the Duane Hunt limit to Smith Purcell radiation. Accordingly, quantum theory is required when the electron energy falls between the classical and quantum thresholds. Our findings enrich the understanding of Smith Purcell radiation and provide valuable insights for developing low energy driven and heralded quantum light sources.

physics.optics↗

CoRe-ECG: Advancing Self-Supervised Representation Learning for 12-Lead ECG via Contrastive and Reconstructive Synergy

Accurate interpretation of electrocardiogram (ECG) remains challenging due to the scarcity of labeled data and the high cost of expert annotation. Self-supervised learning (SSL) offers a promising solution by enabling models to learn expressive representations from unlabeled signals. Existing ECG SSL methods typically rely on either contrastive learning or reconstructive learning. However, each approach in isolation provides limited supervisory signals and suffers from additional limitations, including non-physiological distortions introduced by naive augmentations and trivial correlations across multiple leads that models may exploit as shortcuts. In this work, we propose CoRe-ECG, a unified contrastive and reconstructive pretraining paradigm that establishes a synergistic interaction between global semantic modeling and local structural learning. CoRe-ECG aligns global representations during reconstruction, enabling instance-level discriminative signals to guide local waveform recovery. To further enhance pretraining, we introduce Frequency Dynamic Augmentation (FDA) to adaptively perturb ECG signals based on their frequency-domain importance, and Spatio-Temporal Dual Masking (STDM) to break linear dependencies across leads, increasing the difficulty of reconstructive tasks. Our method achieves state-of-the-art performance across multiple downstream ECG datasets. Ablation studies further demonstrate the necessity and complementarity of each component. This approach provides a robust and physiologically meaningful representation learning framework for ECG analysis.

cs.AI↗

A generalized tetrad constraint for testing conditional independence given a latent variable

The tetrad constraint is widely used to test whether four observed variables are conditionally independent given a latent variable, based on the fact that if four observed variables following a linear model are mutually independent after conditioning on an unobserved variable, then products of covariances of any two different pairs of these four variables are equal. It is an important tool for discovering a latent common cause or distinguishing between alternative linear causal structures. However, the classical tetrad constraint fails in nonlinear models because the covariance of observed variables cannot capture nonlinear association. In this paper, we propose a generalized tetrad constraint, which establishes a testable implication for conditional independence given a latent variable in nonlinear and nonparametric models. In linear models, this constraint implies the classical tetrad constraint; in nonlinear models, it remains a necessary condition for conditional independence but the classical tetrad constraint no longer is. Based on this constraint, we further propose a formal test, which can control type I error and has power approaching unity under certain conditions. We illustrate the proposed approach via simulations and two real data applications on mental ability tests and on moral attitudes towards dishonesty.

stat.ME↗

Identifying the desert decision rule to assess and achieve fairness

We study fairness in decision-making when the data may encode systematic bias. Existing approaches typically impose fairness constraints while predicting the observed decision, which may itself be unfair. We propose a novel framework for characterising and addressing fairness issues by introducing the notion of desert decision, a latent variable representing the decision an individual rightfully deserves based on their actions, efforts, or abilities. This formulation shifts the prediction target from the potentially biased observed decision to the desert decision. We advocate achieving fair decision-making by predicting the desert decision and assessing unfairness by the discrepancy between desert and observed decisions. We establish nonparametric identification results under causally interpretable assumptions on the fairness of the desert decision and the unfairness mechanism of the observed decision. For estimation, we develop a sieve maximum likelihood estimator for the desert decision rule and an influence-function-based estimator for the degree of unfairness. Sensitivity analysis procedures are further proposed to assess robustness to violations of identifying assumptions. Our framework connects fairness with measurement error models, aligning predictive accuracy with fairness relative to an appropriate target, and providing a structural approach to modelling the unfairness mechanism.

stat.ME↗

Joint Sensing and Covert Communications in RIS-NOMA Systems

A reconfigurable intelligent surface (RIS)-assisted non-orthogonal multiple access (NOMA) system is investigated, where the transmitter (Alice) is a dual functional radar communication (DFRC) base station (BS) that aims to sense the location of a potential warden (Willie), while simultaneously transmitting public and covert signals to the legitimate users, Carol and Bob, respectively. Both cases of known and unknown Willie locations are considered. For the known-location case, assuming perfect channel state information (CSI) at Willie, a covert rate maximization is formulated with the joint optimization of active and passive beamforming, which is solved using successive convex approximation (SCA), penalty method, and semidefinite relaxation (SDR). For the unknown-location case, we propose to estimate Willie's location via radar sensing and develop a sensing-based imperfect CSI model. In particular, the CSI error uncertainty is bounded by the sensing accuracy, which is characterized by the Cramer-Rao bound (CRB). Subsequently, a robust communication rate maximization problem is formulated under the constraints on quality-of-service (QoS) of Carol, sensing accuracy, and covertness level. The Schur complement and S-procedure are employed to handle the non-convex constraints. Numerical results compare the system performance under the two cases, and demonstrate the significant covert performance superiority of the sensing-based imperfect CSI model and NOMA over the general norm-bounded imperfect CSI model and the orthogonal multiple access scheme. Furthermore, the dual yet contradictory effects of sensing on covert communications are revealed. It is also found that Alice primarily utilizes Carol's signal for sensing, while allocating almost all of Bob's signal for communication.

eess.SP↗

SemSteDiff: Generative Diffusion Model-based Coverless Semantic Steganography Communication

Semantic communication (SemCom), as a novel paradigm for future communication systems, has recently attracted much attention due to its superiority in communication efficiency. However, similar to traditional communication, it also suffers from eavesdropping threats. Intelligent eavesdroppers could launch advanced semantic analysis techniques to infer secret semantic information. Therefore, some researchers have designed Semantic Steganography Communication (SemSteCom) schemes to confuse semantic eavesdroppers. However, the state-of-the-art SemSteCom schemes for image transmission rely on the pre-selected cover image, which limits the generalization. To address this issue, we propose a Generative Diffusion Model-based Coverless Semantic Steganography Communication (SemSteDiff) scheme to hide secret images into generated stego images. The semantic related private and public keys enable legitimate receiver to decode secret images correctly while the eavesdropper without the completely correct key-pairs fail to obtain them. Simulation results demonstrate the effectiveness of the plug-and-play design in different Joint Source-Channel Coding (JSCC) frameworks. Results under different eavesdropping settings show that, when Signal-to-Noise Ratio (SNR) = 0 dB, the peak signal-to-noise ratio (PSNR) of the legitimate receiver is 4.14 dB higher than that of the eavesdropper.

eess.SP↗

Wireless communication empowers online scheduling of partially-observable transportation multi-robot systems in a smart factory

Achieving agile and reconfigurable production flows in smart factories depends on online multi-robot task assignment (MRTA), which requires online collision-free and congestion-free route scheduling of transportation multi-robot systems (T-MRS), e.g., collaborative automatic guided vehicles (AGVs). Due to the real-time operational requirements and dynamic interactions between T-MRS and production MRS, online scheduling under partial observability in dynamic factory environments remains a significant and under-explored challenge. This paper proposes a novel communication-enabled online scheduling framework that explicitly couples wireless machine-to-machine (M2M) networking with route scheduling, enabling AGVs to exchange intention information, e.g., planned routes, to overcome partial observations and assist complex computation of online scheduling. Specifically, we determine intelligent AGVs' intention and sensor data as new M2M traffic and tailor the retransmission-free multi-link transmission networking to meet real-time operation demands. This scheduling-oriented networking is then integrated with a simulated annealing-based MRTA scheme and a congestion-aware A*-based route scheduling method. The integrated communication and scheduling scheme allows AGVs to dynamically adjust collision-free and congestion-free routes with reduced computational overhead. Numerical experiments shows the impacts from wireless communication on the performance of T-MRS and suggest that the proposed integrated scheme significantly enhances scheduling efficiency compared to other baselines, even under high AGV load conditions and limited channel resources. Moreover, the results reveal that the scheduling-oriented wireless M2M communication design fundamentally differs from human-to-human communications, implying new technological opportunities in a wireless networked smart factory.

cs.LG↗

Towards Semantic-based Agent Communication Networks: Vision, Technologies, and Challenges

The International Telecommunication Union (ITU) identifies "Artificial Intelligence (AI) and Communication" as one of six key usage scenarios for 6G. Agentic AI, characterized by its ca-pabilities in multi-modal environmental sensing, complex task coordination, and continuous self-optimization, is anticipated to drive the evolution toward agent-based communication net-works. Semantic communication (SemCom), in turn, has emerged as a transformative paradigm that offers task-oriented efficiency, enhanced reliability in complex environments, and dynamic adaptation in resource allocation. However, comprehensive reviews that trace their technologi-cal evolution in the contexts of agent communications remain scarce. Addressing this gap, this paper systematically explores the role of semantics in agent communication networks. We first propose a novel architecture for semantic-based agent communication networks, structured into three layers, four entities, and four stages. Three wireless agent network layers define the logical structure and organization of entity interactions: the intention extraction and understanding layer, the semantic encoding and processing layer, and the distributed autonomy and collabora-tion layer. Across these layers, four AI agent entities, namely embodied agents, communication agents, network agents, and application agents, coexist and perform distinct tasks. Furthermore, four operational stages of semantic-enhanced agentic AI systems, namely perception, memory, reasoning, and action, form a cognitive cycle guiding agent behavior. Based on the proposed architecture, we provide a comprehensive review of the state-of-the-art on how semantics en-hance agent communication networks. Finally, we identify key challenges and present potential solutions to offer directional guidance for future research in this emerging field.

eess.SP↗

APEG: Adaptive Physical Layer Authentication with Channel Extrapolation and Generative AI

With the rapid advancement of 6G, identity authentication has become increasingly critical for ensuring wireless security. The lightweight and keyless Physical Layer Authentication (PLA) is regarded as an instrumental security measure in addition to traditional cryptography-based authentication methods. However, existing PLA schemes often struggle to adapt to dynamic radio environments. To overcome this limitation, we propose the Adaptive PLA with Channel Extrapolation and Generative AI (APEG), designed to enhance authentication robustness in dynamic scenarios. Leveraging Generative AI (GAI), the framework adaptively generates Channel State Information (CSI) fingerprints, thereby improving the precision of identity verification. To refine CSI fingerprint generation, we propose the Collaborator-Cleaned Masked Denoising Diffusion Probabilistic Model (CCMDM), which incorporates collaborator-provided fingerprints as conditional inputs for channel extrapolation. Additionally, we develop the Cross-Attention Denoising Diffusion Probabilistic Model (CADM), employing a cross-attention mechanism to align multi-scale channel fingerprint features, further enhancing generation accuracy. Simulation results demonstrate the superiority of the APEG framework over existing time-sequence-based PLA schemes in authentication performance. Notably, CCMDM exhibits a significant advantage in convergence speed, while CADM, compared with model-free, time-series, and VAE-based methods, achieves superior accuracy in CSI fingerprint generation. The code is available at https://github.com/xiqicheng192-del/APEG

eess.SP↗

Ellipticity-Controlled Bright-Dark Coherence Transition in Monolayer WSe2

The generation of exciton valley coherence typically requires linearly polarized (LP) light as an external coherent drive, whereas circularly polarized (CP) light fails to induce coherence. Here, we develop a unified, microscopically-grounded open-quantum-system framework within a five-level model incorporating bright-dark exciton interactions in monolayer WSe2, and demonstrate that the polarization ellipticity of the excitation field provides selective control over distinct exciton species contributing to valley coherence. Specifically, LP and CP excitations generate bright and dark coherence, respectively, with continuous ellipticity tuning enabling controlled transitions between these states. We further reveal dual magnetic advantages for manipulating dark coherence even in the absence of initial coherence: (i) an out-of-plane magnetic field suppresses coherence decay and (ii) an in-plane field enables its optical readout, with quantitatively realistic field strengths. These findings provide a powerful mechanism for accessing hidden dark states via ellipticity-driven coherence transfer, and establish a new pathway for harnessing bright-dark valley-coherence transitions in future quantum control.

cond-mat.mes-hall↗

ClinicalTrialsHub: Bridging Registries and Literature for Comprehensive Clinical Trial Access

We present ClinicalTrialsHub, an interactive search-focused platform that consolidates all data from ClinicalTrials.gov and augments it by automatically extracting and structuring trial-relevant information from PubMed research articles. Our system effectively increases access to structured clinical trial data by 83.8% compared to relying on ClinicalTrials.gov alone, with potential to make access easier for patients, clinicians, researchers, and policymakers, advancing evidence-based medicine. ClinicalTrialsHub uses large language models such as GPT-5.1 and Gemini-3-Pro to enhance accessibility. The platform automatically parses full-text research articles to extract structured trial information, translates user queries into structured database searches, and provides an attributed question-answering system that generates evidence-grounded answers linked to specific source sentences. We demonstrate its utility through a user study involving clinicians, clinical researchers, and PhD students of pharmaceutical sciences and nursing, and a systematic automatic evaluation of its information extraction and question answering capabilities.

cs.CL↗

Global well-posedness of 2-D incompressible anisitropic Navier-Stokes equations with variable density

We establish the global well-posedness for two-dimensional inhomogeneous, incompressible, anisotropic Navier-Stokes systems. Two specific models are analyzed: one with partial dissipation (referred to as (AINS)) and one with only horizontal dissipation (referred to as (HINS)), under the assumption that the initial density is bounded away from zero and infinity. For the (AINS) system posed in the whole plane $\mathbb{R}^2$, we prove the existence and uniqueness of global solutions for finite-energy initial data, employing time-weighted energy estimates and a duality argument. For the (HINS) system on the domain $\mathbb{T} \times \mathbb{R}$, global well-posedness is established for sufficiently small initial velocity and sufficiently small density variation. By exploiting the anisotropic dissipation structure, employing Poincaré-type inequalities to obtain exponential decay for the oscillatory part of the velocity field, and carefully balancing the growth of the density gradient, we overcome the principal analytical challenges.

math.AP↗

MMSpec: Benchmarking Speculative Decoding for Vision-Language Models

Vision-language models (VLMs) achieve strong performance on multimodal tasks but suffer from high inference latency due to large model sizes and long multimodal contexts. Speculative decoding has recently emerged as an effective acceleration technique, yet its behavior in VLMs remains insufficiently understood. We introduce MMSpec, the first benchmark for evaluating speculative decoding in vision-language models. MMSpec contains 600 multimodal samples across six task categories and integrates ten representative speculative decoding algorithms under a unified evaluation framework. Our study reveals three key findings: (1) methods designed for text-only LLMs degrade in multimodal scenarios, (2) vision awareness becomes increasingly important at larger batch sizes, and (3) throughput speedup alone does not reliably reflect latency performance. Motivated by these findings, we propose ViSkip, a plug-and-play speculative decoding method that dynamically adapts speculation to vision tokens and achieves state-of-the-art performance.

cs.CV↗

Generative Diffusion Models for Wireless Networks: Fundamental, Architecture, and State-of-the-Art

With the rapid development of Generative Artificial Intelligence (GAI) technology, Generative Diffusion Models (GDMs) have shown significant empowerment potential in the field of wireless networks due to advantages, such as noise resistance, training stability, controllability, and multimodal generation. Although there have been multiple studies focusing on GDMs for wireless networks, there is still a lack of comprehensive reviews on their technological evolution. Motivated by this, we systematically explore the application of GDMs in wireless networks. Firstly, we identify the core challenges of wireless networks and argue why GDMs are uniquely suited to address them. We then introduce the mathematical principles of GDMs and representative models. Furthermore, we organize our comprehensive review through a structured taxonomy that categorizes GDM-based schemes into the sensing, transmission, and Applications, complemented by a security plane. For each representative scheme, we analyze its innovative points, the role of GDMs, strengths, and weaknesses. Ultimately, we extract key challenges and provide potential solutions, with the aim of providing directional guidance for future research in this field.

eess.SP↗

Towards Native AI in 6G Standardization: The Roadmap of Semantic Communication

Semantic communication (SemCom) has emerged as a transformative paradigm for future 6G networks, offering task-oriented and meaning-aware transmission that fundamentally redefines traditional bit-centric design. Recognized by leading standardization bodies including the institute of electrical and electronics engineers (IEEE) and the international telecommunication union (ITU), and actively discussed within the 3rd generation partnership project (3GPP) working groups, SemCom is rapidly gaining traction as a foundational enabler for native-AI 6G. This paper presents a comprehensive overview of recent progress in SemCom from both academic and industrial perspectives, with a focus on its ongoing and upcoming standardization activities. We systematically examine advances in representative application scenarios, architectural design, semantic-traditional system compatibility, unified evaluation metrics, and validation methodologies. Furthermore, we highlight several key enabling technologies, such as joint source-channel coding (JSCC), SemCom-based multiple access (MA) technologies such as model division MA (MDMA), and semantic knowledge base (KB), that support the practical implementation of SemCom in standard-compliant systems. Additionally, we present a case study for channel state information (CSI) feedback, illustrating the concrete performance gains of SemCom under 3GPP-compliant fading channels. Finally, we discuss emerging challenges and research opportunities for incorporating semantic-native mechanisms into the evolving 6G standardization landscape, and provide forward-looking insights into its development and global adoption.

eess.SY↗

Sharp decay characterization for partially dissipative hyperbolic systems of balance laws

The partially dissipative systems that characterize many physical phenomena were first pointed out by Godunov (1961), then investigated by Friedrichs-Lax (1971) who introduced the convex entropy, and later by Shizuta-Kawashima (1984,1985) who initiated a simple sufficient criterion ensuring the global existence of smooth solutions and their large-time asymptotics. There has been remarkable progress in the past several decades, through various different attempts. However, the decay character theory for partially dissipative hyperbolic systems remains largely open, as the Fourier transform of Green's function is generally not explicit in multi-dimensions. In this paper, we provide a positive answer to the open question by means of the general $L^p$ energy method. Precisely, a new {\emph{effective quantity}} $Ψ(t,x)$ motivated by the compressible Euler system with damping is introduced, which enables us to capture leading diffusion profiles of the large-time behavior in the spirit of the Chapman-Enskog expansion. Consequently, we prove that the solutions approach the constant equilibrium state in the $\dot{\!B}^σ_{p,1}$-norm at the rate $t^{-(σ-σ_1)/2}$ as $t\rightarrow\infty$, and the corresponding norm of dissipative components decays at the enhanced rate $t^{-(σ-σ_1+1)/2}$, where the boundedness assumption in the $\dot{B}^{σ_1}_{p,\infty} (-d/p\leq σ_1<d/p-1$)-norm of the low frequencies of conservative components is not only sufficient, but also necessary to achieve those upper bounds of decay estimates. Furthermore, both upper and lower bounds for time-decay estimates are obtained if and only if the low-frequency part of $Ψ_0(x)$ (the initial effective quantity) is bounded in a non-trivial subset of $\dot{B}^{σ_1}_{p,\infty}$.

math.AP↗

Improving Convergence for Semi-Federated Learning: An Energy-Efficient Approach by Manipulating Over-the-Air Distortion

In this paper, we propose a hybrid learning framework that combines federated and split learning, termed semi-federated learning (SemiFL), in which over-the-air computation is utilized for gradient aggregation. A key idea is to strategically adjust the learning rate by manipulating over-the-air distortion for improving SemiFL's convergence. Specifically, we intentionally amplify amplitude distortion to increase the learning rate in the non-stable region, thereby accelerating convergence and reducing communication energy consumption. In the stable region, we suppress noise perturbation to maintain a small learning rate for improving SemiFL's final convergence. Theoretical results demonstrate the antagonistic effects of over-the-air distortion in different regions, under both independent and identically distributed (IID) and non-IID data settings. Then, we formulate two energy consumption minimization problems, one for each region, which implements a two-region mean square error threshold configuration scheme. Accordingly, we propose two resource allocation algorithms with closed-form solutions. Simulation results show that under different network and data distribution conditions, strategically manipulating over-the-air distortion can efficiently adjust the learning rate to improve SemiFL's convergence. Moreover, energy consumption can be reduced by using the proposed algorithms.

eess.SP↗