Zhaoyang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Zhaoyang Wang has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Zhonglin Ye
School of Computer, Qinghai Normal University, Xining, Qinghai, China
3 shared publications - Guirong Song
School of Computer, Qinghai Normal University, Xining, Qinghai, China
1 shared publication Haixing Zhao
School of Computer, Qinghai Normal University, Xining, Qinghai, China
1 shared publication- Hanyu Wang
Department of Computer Science, Qinghai Normal University, Xining, Qinghai, China
1 shared publication - Wen Lu
College of Computer & State Key Laboratory of Tibetan Intelligent, Qinghai Normal University, Xining 810008, China
1 shared publication - Xiaolei Gu
Department of Public Security of Qinghai Province, Xining, Qinghai, China
1 shared publication
Latest Publications
- Open Access
- 3 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-14
The Optimal Allocation Strategy of Computing Power Network Resources
- 3 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 9-14
Open AccessThe Optimal Allocation Strategy of Computing Power Network Resources
- Open Access
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 21295-21311
Multivariate Anomaly Detection Based on Spatio-Temporal Graph Structure Perception
Multivariate anomaly detection is essential for ensuring stability in complex systems, where existing methods often fall short in addressing time-delay causal effects—the lag between anomaly occurrence and detection that allows systems to persist in faulty states, leading to escalated failures—and microscopic anomalies, subtle low-intensity deviations that evade capture due to insufficient modeling of nonlinear temporal dependencies and spatial structures. In this work, we introduce ST-GSP, a novel spatio-temporal graph structure perception model that constructs adaptive multivariate coupling networks via heuristic strategies integrating directed similarity measures and clustering algorithms, overcoming limitations of predefined graphs. By fusing convolutional long short-term memory (Conv-LSTM) networks with multichannel graph attention encoding layers, ST-GSP extracts deep spatio-temporal features to explicitly capture lagged causal effects and spatial couplings, while incorporating complex network structural measures such as degree centrality, betweenness centrality, closeness centrality, PageRank, and eigenvector centrality to quantify subtle structural deviations for enhanced microscopic anomaly perception. Reconstruction via variational autoencoders (VAE) combined with peak-over-threshold (POT) dynamic thresholding further bolsters robustness and real-time performance in noisy environments. Extensive experiments on six real-world datasets, including SMD, SMAP, MSL, ASD, SWaT and WADI, demonstrate ST-GSP’s superiority over benchmarks like MTAD-GAT, achieving average improvements of 5.2%, 4.8%, and 4.6% in precision, recall and F1-score, respectively, gaining AUCs of 0.9989 and 0.9986 on SMD and SMAP. This framework not only breaks bottlenecks in lag modeling and anomaly sensing but also provides a more robust, interpretable paradigm for multivariate time series anomaly detection in industrial IoT applications.
- 2 February 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 21295-21311
Open AccessMultivariate Anomaly Detection Based on Spatio-Temporal Graph Structure Perception
Multivariate anomaly detection is essential for ensuring stability in complex systems, where existing methods often fall short in addressing time-delay causal effects—the lag between anomaly occurrence and detection that allows systems to persist in faulty states, leading to escalated failures—and microscopic anomalies, subtle low-intensity deviations that evade capture due to insufficient modeling of nonlinear temporal dependencies and spatial structures. In this work, we introduce ST-GSP, a novel spatio-temporal graph structure perception model that constructs adaptive multivariate coupling networks via heuristic strategies integrating directed similarity measures and clustering algorithms, overcoming limitations of predefined graphs. By fusing convolutional long short-term memory (Conv-LSTM) networks with multichannel graph attention encoding layers, ST-GSP extracts deep spatio-temporal features to explicitly capture lagged causal effects and spatial couplings, while incorporating complex network structural measures such as degree centrality, betweenness centrality, closeness centrality, PageRank, and eigenvector centrality to quantify subtle structural deviations for enhanced microscopic anomaly perception. Reconstruction via variational autoencoders (VAE) combined with peak-over-threshold (POT) dynamic thresholding further bolsters robustness and real-time performance in noisy environments. Extensive experiments on six real-world datasets, including SMD, SMAP, MSL, ASD, SWaT and WADI, demonstrate ST-GSP’s superiority over benchmarks like MTAD-GAT, achieving average improvements of 5.2%, 4.8%, and 4.6% in precision, recall and F1-score, respectively, gaining AUCs of 0.9989 and 0.9986 on SMD and SMAP. This framework not only breaks bottlenecks in lag modeling and anomaly sensing but also provides a more robust, interpretable paradigm for multivariate time series anomaly detection in industrial IoT applications.
- Open Access
- 17 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (18) , 3000
Extremely Optimal Graph Research for Network Reliability
Network reliability refers to a probabilistic measure of a network system’s ability to maintain its intended service functionality within a specified time interval and under given operating conditions. Let be the set of all simple two-terminal networks on n vertices and m edges. If each edge operates independently with the same fixed probability , then the two-terminal reliability, denoted by , is the probability that there exists a path between two target vertices s and t. For a given number of vertices n and edges m, there are some graphs within that have higher reliability than others, and these are known as extremely optimal graphs. In this work, we determine the sets of extremely optimal graphs in two classes of two-terminal network with sizes and , consisting of 2 and 5 networks, respectively. Moreover, we identify one class of graphs obtained by deleting some edges among non-target vertices in the complete two-terminal graph, and we count the number of graphs of this class with size by applying the Pólya counting principle.- 17 September 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (18) , 3000
Open AccessExtremely Optimal Graph Research for Network Reliability
Network reliability refers to a probabilistic measure of a network system’s ability to maintain its intended service functionality within a specified time interval and under given operating conditions. Let be the set of all simple two-terminal networks on n vertices and m edges. If each edge operates independently with the same fixed probability , then the two-terminal reliability, denoted by , is the probability that there exists a path between two target vertices s and t. For a given number of vertices n and edges m, there are some graphs within that have higher reliability than others, and these are known as extremely optimal graphs. In this work, we determine the sets of extremely optimal graphs in two classes of two-terminal network with sizes and , consisting of 2 and 5 networks, respectively. Moreover, we identify one class of graphs obtained by deleting some edges among non-target vertices in the complete two-terminal graph, and we count the number of graphs of this class with size by applying the Pólya counting principle.