Xiaohong Guan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaohong Guan has a total of 439 co-authors. Here are the top co-authors by number of shared publications:
- Pinghui Wang
Xi'an Jiaotong University, Xi'an, China
37 shared publications - Zhanbo Xu
MOE KLINNS Laboratory, Systems Engineering Institute, Xian Jiaotong University, Xian, China
27 shared publications - Qing-Shan Jia
Center for Intelligent and Networked Systems (CFINS), Department of Automation, Beijing National Research Center for Information Science and Technology (BNRist), Tsinghua University, Beijing, China
22 shared publications - Jiang Wu
MOE KLINNS Lab, Xian Jiaotong University, Xian, China
19 shared publications - Junzhou Zhao
MOE Key Laboratory for Intelligent Networks and Network Security, Xian Jiaotong University, Xian, China
18 shared publications - Meng Zhang
School of Cyber Science and Engineering, Xian Jiaotong University, Xian, China
18 shared publications
Latest Publications
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 15079-15088
PrismDM: An Accurate and Efficient Framework for Privacy-Preserving Diffusion Model Sampling
- 9 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 15079-15088
Open AccessPrismDM: An Accurate and Efficient Framework for Privacy-Preserving Diffusion Model Sampling
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4306-4318
Historical-Data-Free and System-Independent Training: A Neural Network-Assisted Improved Lagrangian Relaxation Method for Large-Scale Security-Constrained Unit Commitment
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4306-4318
Historical-Data-Free and System-Independent Training: A Neural Network-Assisted Improved Lagrangian Relaxation Method for Large-Scale Security-Constrained Unit Commitment
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5448-5459
A Unified Virtual Battery Modeling Framework for Flexibility Characterization of Building HVAC Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (6) , 5448-5459
A Unified Virtual Battery Modeling Framework for Flexibility Characterization of Building HVAC Systems
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4083-4095
A Bad Data Identification Method Based on Optimal Weight-Tuning for Power System State Estimation
The weighted least squares (WLS) method has been widely used in power systems for state estimation (SE), but in the presence of gross errors, the results of WLS SE can be significantly biased. While various bad data identification (BDI) methods exist, identifying multiple bad data for SE is still challenging, especially when bad data located at leverage points can disproportionately corrupt SE accuracy. This paper proposes an Optimal-Weighted Least Squares State Estimation (OWLS-SE) method with an optimal weight-tuning strategy to address these challenges. The impact of bad data at leverage points on estimation errors is first mathematically demonstrated through a theoretical upper bound of the SE relative error. Then, the optimal dynamic weights are developed to minimize this error bound by quantifying leverage point impacts and integrating them into a multi-objective optimization framework. The proposed OWLS-SE achieves simultaneous SE and BDI within a single optimization model, eliminating conventional two-stage processing. Numerical experiments on the 6- bus system, IEEE 30-, 118- bus systems, and the 2869- bus PEGASE system demonstrate that OWLS-SE achieves superior BDI and SE accuracy with robust performance even when multiple gross errors occur at leverage points, while maintaining computational efficiency comparable to the simplest WLS method.
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Systems
- Vol. 41 (6) , 4083-4095
A Bad Data Identification Method Based on Optimal Weight-Tuning for Power System State Estimation
The weighted least squares (WLS) method has been widely used in power systems for state estimation (SE), but in the presence of gross errors, the results of WLS SE can be significantly biased. While various bad data identification (BDI) methods exist, identifying multiple bad data for SE is still challenging, especially when bad data located at leverage points can disproportionately corrupt SE accuracy. This paper proposes an Optimal-Weighted Least Squares State Estimation (OWLS-SE) method with an optimal weight-tuning strategy to address these challenges. The impact of bad data at leverage points on estimation errors is first mathematically demonstrated through a theoretical upper bound of the SE relative error. Then, the optimal dynamic weights are developed to minimize this error bound by quantifying leverage point impacts and integrating them into a multi-objective optimization framework. The proposed OWLS-SE achieves simultaneous SE and BDI within a single optimization model, eliminating conventional two-stage processing. Numerical experiments on the 6- bus system, IEEE 30-, 118- bus systems, and the 2869- bus PEGASE system demonstrate that OWLS-SE achieves superior BDI and SE accuracy with robust performance even when multiple gross errors occur at leverage points, while maintaining computational efficiency comparable to the simplest WLS method.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11428-11444
AirMask: Enabling Air-to-Air Masking of Wireless Traffic Fingerprints in WiFi-Based IoT Environments
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Dependable and Secure Computing
- Vol. 23 (5) , 11428-11444
AirMask: Enabling Air-to-Air Masking of Wireless Traffic Fingerprints in WiFi-Based IoT Environments
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (5) , 4568-4584
IGNN: An Inference Graph Neural Network for Data Sensitivity Assessment Considering Data Inference Leakage in Cyber-Physical Power Grid
Modern Cyber-Physical Power Grids (CPPG) rely heavily on fine-grained data exchange, yet they face the concealed threat of Data Inference Leakage (DIL), where attackers infer sensitive parameters from seemingly non-sensitive data. Existing risk assessment methods typically focus on direct cyber-attacks or employ static binary classifications, failing to capture the dynamic risk propagation caused by complex physical and statistical data couplings. To address this, this paper proposes a unified data sensitivity assessment framework based on a novel Inference Graph Neural Network (IGNN). We first construct an inference relation graph that integrates both model-driven and data-driven correlations. An analytic hierarchy process (AHP) model is constructed to calibrate the intrinsic sensitivity baseline. Subsequently, a novel inference-weighted Graph Attention Network (GAT) is developed to quantify the final sensitivity by aggregating the risk propagating through the inference pathways. Experiments on IEEE 30-, 57-bus, ACTIV 200-bus, and case 1354-pegase systems demonstrate that the proposed method effectively quantifies data sensitivity and identifies high-risk data susceptible to DIL, exhibiting strong robustness across different system scales. Quantitative results indicate that the high-sensitivity data identified by our method yield a highly threatening inference accuracy of up to 0.9145, significantly outperforming GCN-based and rule-based benchmarks.
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Smart Grid
- Vol. 17 (5) , 4568-4584
IGNN: An Inference Graph Neural Network for Data Sensitivity Assessment Considering Data Inference Leakage in Cyber-Physical Power Grid
Modern Cyber-Physical Power Grids (CPPG) rely heavily on fine-grained data exchange, yet they face the concealed threat of Data Inference Leakage (DIL), where attackers infer sensitive parameters from seemingly non-sensitive data. Existing risk assessment methods typically focus on direct cyber-attacks or employ static binary classifications, failing to capture the dynamic risk propagation caused by complex physical and statistical data couplings. To address this, this paper proposes a unified data sensitivity assessment framework based on a novel Inference Graph Neural Network (IGNN). We first construct an inference relation graph that integrates both model-driven and data-driven correlations. An analytic hierarchy process (AHP) model is constructed to calibrate the intrinsic sensitivity baseline. Subsequently, a novel inference-weighted Graph Attention Network (GAT) is developed to quantify the final sensitivity by aggregating the risk propagating through the inference pathways. Experiments on IEEE 30-, 57-bus, ACTIV 200-bus, and case 1354-pegase systems demonstrate that the proposed method effectively quantifies data sensitivity and identifies high-risk data susceptible to DIL, exhibiting strong robustness across different system scales. Quantitative results indicate that the high-sensitivity data identified by our method yield a highly threatening inference accuracy of up to 0.9145, significantly outperforming GCN-based and rule-based benchmarks.
- 25 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Learning to optimize via positive momentum natural evolution strategies
- 25 August 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
Learning to optimize via positive momentum natural evolution strategies
- 19 August 2026
- Published by Elsevier in Journal of Building Engineering
- Vol. 130
Thermal comfort prediction with limited local data utilizing heterogeneous external sources via federated learning
- 19 August 2026
- Published by Elsevier in Journal of Building Engineering
- Vol. 130
Thermal comfort prediction with limited local data utilizing heterogeneous external sources via federated learning
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 17 (3) , 2571-2586
Cost Efficient Operation of a Hydrogen Enabled Zero-Carbon Multi-Energy System
- 1 July 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Sustainable Energy
- Vol. 17 (3) , 2571-2586
Cost Efficient Operation of a Hydrogen Enabled Zero-Carbon Multi-Energy System
- Open Access
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 1312-1334
AccessRefinery: Fast Mining Concise Access Control Intents on Public Cloud
Modern cloud applications heavily rely on Identity and Access Management (IAM) services to enforce flexible access control over their data. However, the flexibility comes at a cost: IAM policies are often complex and prone to misconfigurations, leading to risks of data exposure. There is an increasing need to mine a compact set of intents that describe what the policies collectively try to achieve, thereby enabling operators to better understand their policies. However, existing tools on mining access control intent have two limitations: (1) the mining process is slow and even times out on some complex policies; (2) the mined intents are excessive in number and thus still hard to understand. To overcome these, this paper presents AccessRefinery , which can speed up the mining process while reducing the number of intents. The key idea for the speedup is to reduce the redundancy of the multi-round SMT solving, by preprocessing the constraints into bit-vector constraints. For intent reduction, AccessRefinery computes a compact set of intents that can cover the mined intents, by solving a min-set-cover problem. Experiments based on real and synthetic datasets show that AccessRefinery achieves a ∼10–100 × speedup in intent mining, and reduces the number of intents by up to ∼10 ×.
- 30 June 2026
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Software Engineering
- Vol. 3 (FSE) , 1312-1334
Open AccessAccessRefinery: Fast Mining Concise Access Control Intents on Public Cloud
Modern cloud applications heavily rely on Identity and Access Management (IAM) services to enforce flexible access control over their data. However, the flexibility comes at a cost: IAM policies are often complex and prone to misconfigurations, leading to risks of data exposure. There is an increasing need to mine a compact set of intents that describe what the policies collectively try to achieve, thereby enabling operators to better understand their policies. However, existing tools on mining access control intent have two limitations: (1) the mining process is slow and even times out on some complex policies; (2) the mined intents are excessive in number and thus still hard to understand. To overcome these, this paper presents AccessRefinery , which can speed up the mining process while reducing the number of intents. The key idea for the speedup is to reduce the redundancy of the multi-round SMT solving, by preprocessing the constraints into bit-vector constraints. For intent reduction, AccessRefinery computes a compact set of intents that can cover the mined intents, by solving a min-set-cover problem. Experiments based on real and synthetic datasets show that AccessRefinery achieves a ∼10–100 × speedup in intent mining, and reduces the number of intents by up to ∼10 ×.