ZWZhaoyang Wang

Zhaoyang Wang

*This is an algorithmically generated author record based on publicly available information.

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:


Latest Publications

  • Open Access

    The Optimal Allocation Strategy of Computing Power Network Resources

    by Hanyu Wang, Xiaolei Gu, Wen Lu, Zhonglin Ye, Zhaoyang Wang

  • Open Access

    Multivariate Anomaly Detection Based on Spatio-Temporal Graph Structure Perception

    by Zhaoyang Wang, Guirong Song, Zhonglin Ye, Yuhui Zheng, Haixing Zhao

    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

    Extremely Optimal Graph Research for Network Reliability

    by Zhaoyang Wang, Zhonglin Ye

    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 Ω(n,m) 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 p∈[0,1], then the two-terminal reliability, denoted by R2(G,P)), 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 Ω(n,m) 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 m=n(n−1))2−2 and m=n(n−1))2−3, 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 n(n−1)2−⌊n−22⌋≤m≤n(n−1))2−1 by applying the Pólya counting principle.