arXiv subjects

Zheng Yan

Publications and source records attributed to Zheng Yan.

At least 91 records · Page 5Linked to original sources

arXiv2025

Voltage Profile-Driven Physical Layer Authentication for RIS-aided Backscattering Tag-to-Tag Networks

Backscattering tag-to-tag networks (BTTNs) are emerging passive radio frequency identification (RFID) systems that facilitate direct communication between tags using an external RF field and play a pivotal role in ubiquitous Internet of Things (IoT) applications. Despite their potential, BTTNs face significant security vulnerabilities, which remain their primary concern to enable reliable communication. Existing authentication schemes in backscatter communication (BC) systems, which mainly focus on tag-to-reader or reader-to-tag scenarios, are unsuitable for BTTNs due to the ultra-low power constraints and limited computational capabilities of the tags, leaving the challenge of secure tag-to-tag authentication largely unexplored. To bridge this gap, this paper proposes a physical layer authentication (PLA) scheme, where a Talker tag (TT) and a Listener tag (LT) can authenticate each other in the presence of an adversary, only leveraging the unique output voltage profile of the energy harvesting and the envelope detector circuits embedded in their power and demodulation units. This allows for efficient authentication of BTTN tags without additional computational overhead. In addition, since the low spectral efficiency and limited coverage range in BTTNs hinder PLA performance, we propose integrating an indoor reconfigurable intelligent surface (RIS) into the system to enhance authentication accuracy and enable successful authentication over longer distances. Security analysis and simulation results indicate that our scheme is robust against various attack vectors and achieves acceptable performance across various experimental settings. Additionally, the results indicate that using RIS significantly enhances PLA performance in terms of accuracy and robustness, especially at longer distances compared to traditional BTTN scenarios without RIS.

cs.CR↗

arXiv2025

Physical Layer Security in FAS-aided Wireless Powered NOMA Systems

The rapid evolution of communication technologies and the emergence of sixth-generation (6G) networks have introduced unprecedented opportunities for ultra-reliable, low-latency, and energy-efficient communication. However, the integration of advanced technologies like non-orthogonal multiple access (NOMA) and wireless powered communication networks (WPCNs) brings significant challenges, particularly in terms of energy constraints and security vulnerabilities. Traditional antenna systems and orthogonal multiple access schemes struggle to meet the increasing demands for performance and security in such environments. To address this gap, this paper investigates the impact of emerging fluid antenna systems (FAS) on the performance of physical layer security (PLS) in WPCNs. Specifically, we consider a scenario in which a transmitter, powered by a power beacon via an energy link, transmits confidential messages to legitimate FAS-aided users over information links while an external eavesdropper attempts to decode the transmitted signals. Additionally, users leverage the NOMA scheme, where the far user may also act as an internal eavesdropper. For the proposed model, we first derive the distributions of the equivalent channels at each node and subsequently obtain compact expressions for the secrecy outage probability (SOP) and average secrecy capacity (ASC), using the Gaussian quadrature methods. Our results reveal that incorporating the FAS for NOMA users, instead of the TAS, enhances the performance of the proposed secure WPCN.

cs.IT↗

arXiv2024

A Two-Stage AI-Powered Motif Mining Method for Efficient Power System Topological Analysis

Graph motif, defined as the microstructure that appears repeatedly in a large graph, reveals important topological characteristics of the large graph and has gained increasing attention in power system analysis regarding reliability, vulnerability and resiliency. However, searching motifs within the large-scale power system is extremely computationally challenging and even infeasible, which undermines the value of motif analysis in practice. In this paper, we introduce a two-stage AI-powered motif mining method to enable efficient and wide-range motif analysis in power systems. In the first stage, a representation learning method with specially designed network structure and loss function is proposed to achieve ordered embedding for the power system topology, simplifying the subgraph isomorphic problem into a vector comparison problem. In the second stage, under the guidance of the ordered embedding space, a greedy-search-based motif growing algorithm is introduced to quickly obtain the motifs without traversal searching. A case study based on a power system database including 61 circuit models demonstrates the effectiveness of the proposed method.

eess.SY↗

arXiv2024

Accessing Excitation of Many-body Systems via Single-Mode Approximation within Quantum Monte Carlo Simulations

We extend the single-mode Approximation (SMA) into quantum Monte Carlo simulations to provides an efficient and fast method to obtain the dynamical dispersion of quantum many-body systems. Based on stochastic series expansion (SSE) and its projector algorithms, the SMA + SSE method can simply extract the dispersion of the dynamical dispersion in the long wave-length limit and the upper bound of the dispersion elsewhere, without external calculations and high technique barriers. Meanwhile, numerical analytic continuation methods require the fine data of imaginary time correlations and complex programming. Therefore, our method can approach the excitation dispersion of large systems, e.g., we take the two-dimensional Heisenberg model on a $512 \times 512$ square lattice. We demonstrate the effectiveness and efficiency of our method with high precision via additional examples. We also demonstrate that SMA combined with SSE goes beyond spin-wave theory with numerical results. We further illustrate that SMA is able to extract useful information in strongly correlated systems with competing states.

cond-mat.str-el↗

arXiv2024

Modeling, Prediction and Risk Management of Distribution System Voltages with Non-Gaussian Probability Distributions

High renewable energy penetration into power distribution systems causes a substantial risk of exceeding voltage security limits, which needs to be accurately assessed and properly managed. However, the existing methods usually rely on the joint probability models of power generation and loads provided by probabilistic prediction to quantify the voltage risks, where inaccurate prediction results could lead to over or under estimated risks. This paper proposes an uncertain voltage component (UVC) prediction method for assessing and managing voltage risks. First, we define the UVC to evaluate voltage variations caused by the uncertainties associated with power generation and loads. Second, we propose a Gaussian mixture model-based probabilistic UVC prediction method to depict the non-Gaussian distribution of voltage variations. Then, we derive the voltage risk indices, including value-at-risk (VaR) and conditional value-at-risk (CVaR), based on the probabilistic UVC prediction model. Third, we investigate the mechanism of UVC-based voltage risk management and establish the voltage risk management problems, which are reformulated into linear programming or mixed-integer linear programming for convenient solutions. The proposed method is tested on power distribution systems with actual photovoltaic power and load data and compared with those considering probabilistic prediction of nodal power injections. Numerical results show that the proposed method is computationally efficient in assessing voltage risks and outperforms existing methods in managing voltage risks. The deviation of voltage risks obtained by the proposed method is only 15% of that by the methods based on probabilistic prediction of nodal power injections.

eess.SY↗

arXiv2024

Reweight-annealing method for evaluating the partition function via quantum Monte Carlo calculations

Efficient and accurate algorithm for partition function, free energy and thermal entropy calculations is of great significance in statistical physics and quantum many-body physics. Here we present an unbiased but low-technical-barrier algorithm within the quantum Monte Carlo framework, which has exceptionally high accuracy and no systemic error. Compared with the conventional specific heat integral method and Wang-Landau sampling algorithm, our method can obtain a much more accurate result of the sub-leading coefficient of the entropy. This method can be widely used in both classical and quantum Monte Carlo simulations and is easy to be parallelized on computer.

cond-mat.stat-mech↗

arXiv2024

Sudden change in entanglement Hamiltonian: Phase diagram of an Ising entanglement Hamiltonian

The form of the entanglement Hamiltonian varies with the parameters of the original system. Whether there is a singularity is the key problem for demonstrating/negating the universality of the relation between the entanglement spectrum and edge energy spectrum. We carefully study the phase diagram of a 1D Ising entanglement Hamiltonian as an example to clarify the long-standing controversy of the general relation between the entanglement Hamiltonian and original Hamiltonian. Interestingly, even if the singularities indeed exist, the Li-Haldane-Poilblanc conjecture, i.e., the general relation between the entanglement spectrum and edge energy spectrum, seemingly still holds.

cond-mat.str-el↗

arXiv2024

Long or Short or Both? An Exploration on Lookback Time Windows of Behavioral Features in Product Search Ranking

Customer shopping behavioral features are core to product search ranking models in eCommerce. In this paper, we investigate the effect of lookback time windows when aggregating these features at the (query, product) level over history. By studying the pros and cons of using long and short time windows, we propose a novel approach to integrating these historical behavioral features of different time windows. In particular, we address the criticality of using query-level vertical signals in ranking models to effectively aggregate all information from different behavioral features. Anecdotal evidence for the proposed approach is also provided using live product search traffic on Walmart.com.

cs.IR↗

arXiv2024

Towards More Relevant Product Search Ranking Via Large Language Models: An Empirical Study

Training Learning-to-Rank models for e-commerce product search ranking can be challenging due to the lack of a gold standard of ranking relevance. In this paper, we decompose ranking relevance into content-based and engagement-based aspects, and we propose to leverage Large Language Models (LLMs) for both label and feature generation in model training, primarily aiming to improve the model's predictive capability for content-based relevance. Additionally, we introduce different sigmoid transformations on the LLM outputs to polarize relevance scores in labeling, enhancing the model's ability to balance content-based and engagement-based relevances and thus prioritize highly relevant items overall. Comprehensive online tests and offline evaluations are also conducted for the proposed design. Our work sheds light on advanced strategies for integrating LLMs into e-commerce product search ranking model training, offering a pathway to more effective and balanced models with improved ranking relevance.

cs.IR↗

arXiv2024

Defining a universal sign to strictly probe a phase transition

The mystery of the infamous sign problem in quantum Monte Carlo simulations mightily restricts applications of the method in fermionic and frustrated systems. A recent work [Science 375, 418 (2022)] made a remarkable breakthrough in the sign problem by pointing out that the sign can be used to probe phase transition. In this work, we proposed a general argument based on the definition of the sign that is related to the difference in free energy between the original and reference systems to clarify that the sign problem and phase transition cannot always be strictly related. The sign can exactly probe phase transition only if the free energy in the reference system is flat under variable parameters, which is almost impossible to design. Generally speaking, the conclusion that the sign can probe phase transition is survivorship bias without universality. To solve this problem, we define a modified sign that excludes the influence of the reference system, which can probe the phase transition strictly. The work gives an unbiased solution for detecting phase transition by the new modified sign.

cond-mat.stat-mech↗

arXiv2024

Surface phase transitions in a (1+1)-dimensional $SU(2)_1$ conformal field theory boundary coupled to a (2+1)-dimensional $Z_2$ bulk

We design a (2+1))-dimensional [(2+1)D] quantum spin model in which spin-1/2 ladders are coupled through antiferromagnetic Ising interactions. The model hosts a quantum phase transition in the (2+1)D $Z_2$ universality class from the Haldane phase to the antiferromagnetic Ising ordered phase. We focus on studying the surface properties of three different surface configurations when the Ising couplings are tuned. Different behaviors are found on different surfaces. We find ordinary and two different extraordinary surface critical behaviors (SCBs) at the bulk critical point. The ordinary SCBs belong to the surface universality class of the classical 3D Ising bulk transition. One extraordinary SCBs is induced by the topological properties of the Haldane phase. Another extraordinary SCBs at the bulk critical point is induced by an unconventional surface phase transition where the surface develops an Ising order before the bulk. This surface transition is realized by coupling a (1+1)-dimensional [(1+1)D] $SU(2)_1$ CFT boundary to a (2+1)D bulk with $Z_2$ symmetry. We find that the transition is neither a (1+1)D $Z_2$ transition, expected based on symmetry consideration, nor a Kosterlitz-Thouless-like transition, violating the previous theoretical prediction. This new surface phase transition and related extraordinary SCBs deserve further analytical and numerical exploration.

cond-mat.str-el↗

arXiv2024

Secure Backscatter Communications Through RIS: Modeling and Performance

Backscatter communication (BC) has emerged as a pivotal wireless communication paradigm owing to its low-power and cost-effective characteristics. However, BC faces various challenges from its low signal detection rate to its security vulnerabilities. Recently, reconfigurable intelligent surfaces (RIS) have surfaced as a transformative technology addressing power and communication performance issues in BC. However, the potential of RIS in addressing the security challenges of BC remains uncharted. This paper investigates the secrecy performance of RIS-aided BC, where all channels are distributed according to the Fisher-Snedecor $\mathcal{F}$ distribution. Specifically, we consider a RIS with $N$ reflecting elements to help a backscatter device (BD) establish a smart environment and enhance the secrecy performance in BC. Due to the nature of BC systems, our analysis considers two possible scenarios (i) in the absence of direct links and (ii) in the presence of direct links. In both cases, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at both a legitimate receiver and an eavesdropper. Then, to analyze the secrecy performance, we further derive analytical expressions of the average secrecy capacity (ASC) and secrecy outage probability (SOP) for both mentioned scenarios. In addition, regarding the importance of system behavior in a high SNR regime, we provide an asymptotic analysis of the SOP and ASC. Eventually, the Monte-Carlo simulation is used to validate the analytical results, revealing that utilizing RIS can greatly improve the secrecy performance of the BC system relative to traditional BC setups that do not incorporate RIS.

cs.IT↗

arXiv2024

Physical Layer Mutual Authentication in RIS-Aided Monostatic Backscatter Communications: A Dual-Edged Analysis

Backscatter communication (BC) emerges as a pivotal technology for ultra-low-power energy harvesting applications, but its practical deployment is often hampered by notable security vulnerabilities. Physical layer authentication (PLA) offers a promising solution for securing BC by leveraging the unique characteristics of the communication medium. However, existing PLA approaches often fall short due to limited signal strength in practical BC scenarios and performance deterioration with increasing distance between the tag and the reader. Moreover, achieving mutual authentication has been largely neglected in current PLA schemes, given the passive nature of tags and their limited computational and energy resources. This paper introduces a reconfigurable intelligent surfaces (RIS)-aided PLA scheme based on the physical features of received signals at legitimate endpoints through cascade links in monostatic BC (MBC) systems. By considering a RIS operating in its near-optimal conditions between a tag and a reader, the proposed PLA leverages the RIS-enhanced power delivery detected by the tag's energy detector and the optimized received signal strength (RSS) at the reader's signal processing unit, addressing the conventional challenges of mutual authentication, low PLA performance, and limited secure coverage area inherent in BC systems. Through theoretical analysis and extensive simulations, we show that as long as RIS is controlled by a trusted party in the network, it can boost the authentication performance across different system settings and strengthen the security features. Additionally, we analyze to explore the potential security threats when the RIS is compromised by an adversary, assessing its impact on the system's PLA performance and secrecy capacity, providing a comprehensive understanding of the security implications for RIS-aided MBC under such circumstances.

cs.IT↗

arXiv2024

Exploring the topological sector optimization on quantum computers

Optimization problems are the core challenge in many fields of science and engineering, yet general and effective methods are scarce for searching optimal solutions. Quantum computing has been envisioned to help solve such problems, for example, the quantum annealing (QA) method based on adiabatic evolution has been extensively explored and successfully implemented on quantum simulators such as D-wave's annealers and some Rydberg arrays. In this work, we investigate topological sector optimization (TSO) problem, which attracts particular interests in the quantum many-body physics community. We reveal that the topology induced by frustration in the spin model is an intrinsic obstruction for QA and other traditional methods to approach the ground state. We demonstrate that the optimization difficulties of TSO problem are not restricted to the gaplessness, but are also due to the topological nature which are often ignored for the analysis of optimization problems before. To solve TSO problems, we utilize quantum imaginary time evolution (QITE) with a possible realization on quantum computers, which exploits the property of quantum superposition to explore the full Hilbert space and can thus address optimization problems of topological nature. We report the performance of different quantum optimization algorithms on TSO problems and demonstrate that their capability to address optimization problems are distinct even when considering the quantum computational resources required for practical QITE implementations.

quant-ph↗

arXiv2024

RIS-Aided Backscattering Tag-to-Tag Networks: Performance Analysis

Backscattering tag-to-tag networks (BTTNs) represent a passive radio frequency identification (RFID) system that enables direct communication between tags within an external radio frequency (RF) field. However, low spectral efficiency and short-range communication capabilities, along with the ultra-low power nature of the tags, create significant challenges for reliable and practical applications of BTTNs. To address these challenges, this paper introduces integrating an indoor reconfigurable intelligent surface (RIS) into BTTN and studying RIS's impact on the system's performance. To that end, we first derive compact analytical expressions of the probability density function (PDF) and cumulative distribution function (CDF) for the received signal-to-noise ratio (SNR) at the receiver tag by exploiting the moment matching technique. Then, based on the derived PDF and CDF, we further derive analytical expressions of outage probability (OP), bit error rate (BER), and average capacity (AC) rate. Eventually, the Monte Carlo simulation is used to validate the accuracy of the analytical results, revealing that utilizing RIS can greatly improve the performance of BTTNs in terms of AC, BER, OP, and coverage region relative to traditional BTTNs setups that do not incorporate RIS.

cs.IT↗

arXiv2024

On Performance of FAS-aided Wireless Powered NOMA Communication Systems

This paper studies the performance of a wireless powered communication network (WPCN) under the non-orthogonal multiple access (NOMA) scheme, where users take advantage of an emerging fluid antenna system (FAS). More precisely, we consider a scenario where a transmitter is powered by a remote power beacon (PB) to send information to the planar NOMA FAS-equipped users through Rayleigh fading channels. After introducing the distribution of the equivalent channel coefficients to the users, we derive compact analytical expressions for the outage probability (OP) in order to evaluate the system performance. Additionally, we present asymptotic OP in the high signal-to-noise ratio (SNR) regime. Eventually, results reveal that deploying the FAS with only one activated port in NOMA users can significantly enhance the WPCN performance compared with using traditional antenna systems (TAS).

cs.IT↗

arXiv2024

A Neural-Network-Embedded Equivalent Circuit Model for Lithium-ion Battery State Estimation

Equivalent Circuit Model(ECM)has been widelyused in battery modeling and state estimation because of itssimplicity, stability and interpretability.However, ECM maygenerate large estimation errors in extreme working conditionssuch as freezing environmenttemperature andcomplexcharging/discharging behaviors,in whichscenariostheelectrochemical characteristics of the battery become extremelycomplex and nonlinear.In this paper,we propose a hybridbattery model by embeddingneural networks as 'virtualelectronic components' into the classical ECM to enhance themodel nonlinear-fitting ability and adaptability. First, thestructure of the proposed hybrid model is introduced, where theembedded neural networks are targeted to fit the residuals of theclassical ECM,Second, an iterative offline training strategy isdesigned to train the hybrid model by merging the battery statespace equation into the neural network loss function. Last, thebattery online state of charge (SOC)estimation is achieved basedon the proposed hybrid model to demonstrate its applicationvalue,Simulation results based on a real-world battery datasetshow that the proposed hybrid model can achieve 29%-64%error reduction for $OC estimation under different operatingconditions at varying environment temperatures.

eess.SP↗

arXiv2024

Unsupervised and Interpretable Synthesizing for Electrical Time Series Based on Information Maximizing Generative Adversarial Nets

Generating synthetic data has become a popular alternative solution to deal with the difficulties in accessing and sharing field measurement data in power systems. However, to make the generation results controllable, existing methods (e.g. Conditional Generative Adversarial Nets, cGAN) require labeled dataset to train the model, which is demanding in practice because many field measurement data lacks descriptive labels. In this paper, we introduce the Information Maximizing Generative Adversarial Nets (infoGAN) to achieve interpretable feature extraction and controllable synthetic data generation based on the unlabeled electrical time series dataset. Features with clear physical meanings can be automatically extracted by maximizing the mutual information between the input latent code and the classifier output of infoGAN. Then the extracted features are used to control the generation results similar to a vanilla cGAN framework. Case study is based on the time series datasets of power load and renewable energy output. Results demonstrate that infoGAN can extract both discrete and continuous features with clear physical meanings, as well as generating realistic synthetic time series that satisfy given features.

eess.SP↗