Yishuai Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Yishuai Chen has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Yuchun Guo
Beijing Jiaotong University
9 shared publications Yuchun Guo
4 shared publications- Jingjing Yang
School of Information and Electronic Engineering, Beijing Jiaotong University, Beijing, China
3 shared publications - Naipeng Li
School of Electronics and Information Engineering, Beijing Jiaotong University, Beijing 100044, P. R. China
3 shared publications - Xiaoying Tan
Beijing Jiaotong University. Bejing, China
2 shared publications Baijun Shen
PPLive Inc. Shanghai, China
1 shared publication
Latest Publications
- 7 November 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 355
MoTIF: A multi-scale time–frequency interweaving framework for multivariate time series anomaly detection
- 7 November 2026
- Published by Elsevier in Knowledge-Based Systems
- Vol. 355
MoTIF: A multi-scale time–frequency interweaving framework for multivariate time series anomaly detection
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (21) , 33669-33677
A Risk-Aware Adaptive Visual Sensing Approach for Energy-Efficient Sentry System in Electric Vehicles
- 1 November 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Sensors Journal
- Vol. 26 (21) , 33669-33677
A Risk-Aware Adaptive Visual Sensing Approach for Energy-Efficient Sentry System in Electric Vehicles
- 21 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
SISSEL: Scale independent self-supervised representation learning for multivariate time series
- 21 March 2026
- Published by Elsevier in Information Fusion
- Vol. 133
SISSEL: Scale independent self-supervised representation learning for multivariate time series
- Open Access
- 1 December 2024
- Published by AlphaTech Systems LLC
- Vol. 1 (1) , 25-34
Trust but Verify: The xz-utils Backdoor (CVE-2024-3094) and the Foundations of Open-Source Software Supply-Chain Trust
Background: In March 2024, a multi-year social-engineering operation culminated in the injection of a sophisticated backdoor into xz/utils versions 5.6.0 and 5.6.1 (CVE-2024-3094, CVSS 10.0), reaching OpenSSH on rolling-release GNU/Linux distributions before a fortuitous performance anomaly led to its discovery and containment. Objective: This paper treats the xz-utils incident not as an anomaly to be patched but as a diagnostic event that exposes the load-bearing assumptions of trust in open-source software supply chains — and evaluates, stage by stage, whether the security instruments now in circulation would have prevented, detected, or contained it. Methods: We conduct a qualitative single-case study built exclusively from primary sources (the disclosure thread, the CVE record, distribution advisories, and the CISA alert), reconstruct the attack chain as a sequence of six trust transitions, and perform a counterfactual control analysis mapping six classes of supply-chain controls (maintainer-support programs, provenance attestation, reproducible builds, SBOM and binary analysis, runtime isolation, and coordinated response) against each stage. Results: No single instrument spans the full chain. Provenance attestation and reproducible builds would have raised the cost of the build-time activation stage dramatically; maintainer-support and criticality programs address the social-engineering stage that every technical control leaves untouched; runtime isolation (SELinux) actually prevented exploitation on some systems; and the coordinated response within hours demonstrated that recovery-side trust mechanisms are the field's most mature layer. We further show that SBOMs — the most-cited 2024 remedy — would not have detected this attack, and argue that trust in supply chains must be built on verifiable process evidence rather than identity or reputation. Conclusions: The xz-utils incident defines the research and policy agenda for supply-chain trust: fund maintainers of critical-but-invisible infrastructure, instrument trust transitions with verifiable process guarantees, and design for the adversary who behaves like an ideal contributor.
- 1 December 2024
- Published by AlphaTech Systems LLC
- Vol. 1 (1) , 25-34
Open AccessTrust but Verify: The xz-utils Backdoor (CVE-2024-3094) and the Foundations of Open-Source Software Supply-Chain Trust
Background: In March 2024, a multi-year social-engineering operation culminated in the injection of a sophisticated backdoor into xz/utils versions 5.6.0 and 5.6.1 (CVE-2024-3094, CVSS 10.0), reaching OpenSSH on rolling-release GNU/Linux distributions before a fortuitous performance anomaly led to its discovery and containment. Objective: This paper treats the xz-utils incident not as an anomaly to be patched but as a diagnostic event that exposes the load-bearing assumptions of trust in open-source software supply chains — and evaluates, stage by stage, whether the security instruments now in circulation would have prevented, detected, or contained it. Methods: We conduct a qualitative single-case study built exclusively from primary sources (the disclosure thread, the CVE record, distribution advisories, and the CISA alert), reconstruct the attack chain as a sequence of six trust transitions, and perform a counterfactual control analysis mapping six classes of supply-chain controls (maintainer-support programs, provenance attestation, reproducible builds, SBOM and binary analysis, runtime isolation, and coordinated response) against each stage. Results: No single instrument spans the full chain. Provenance attestation and reproducible builds would have raised the cost of the build-time activation stage dramatically; maintainer-support and criticality programs address the social-engineering stage that every technical control leaves untouched; runtime isolation (SELinux) actually prevented exploitation on some systems; and the coordinated response within hours demonstrated that recovery-side trust mechanisms are the field's most mature layer. We further show that SBOMs — the most-cited 2024 remedy — would not have detected this attack, and argue that trust in supply chains must be built on verifiable process evidence rather than identity or reputation. Conclusions: The xz-utils incident defines the research and policy agenda for supply-chain trust: fund maintainers of critical-but-invisible infrastructure, instrument trust transitions with verifiable process guarantees, and design for the adversary who behaves like an ideal contributor.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4255-4267
MicroNet: Operation Aware Root Cause Identification of Microservice System Anomalies
Microservice architecture has been widely adopted in large-scale applications. However, it also brings new challenges to ensuring reliable performance and maintenance due to the huge volume of data and complex dependencies of microservices. Existing approaches still suffer from the over-aggregation of data, interference from anomaly propagation, and ignoration of component differences. To solve these issues, this paper builds a root cause diagnosis framework at the operation granularity, named as MicroNet. Since operations are subfunctions of microservices, recorded as invocation purposes, we propose the operation-centric perspective, to realize fine-grained data aggregation and operation-level anomaly backtracking. We decompose the diagnosis task into four phases: dependency graph construction, anomaly detection, anomaly evaluation, and culprit location. To construct the invocation dependency accurately, we propose the concept of meta call, defined as the triple (caller, operation, callee), the smallest unit that can be aggregated. Based on the dependency graph, we quantify the operation’s abnormality by analyzing the operation execution process, to backtrack the propagated anomalies. Then, we customize a personalized PageRank algorithm to identify the root cause in which invocation latency and different invocation relationships are considered simultaneously. Our experimental evaluation on an open dataset shows that MicroNet can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 16 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Network and Service Management
- Vol. 21 (4) , 4255-4267
MicroNet: Operation Aware Root Cause Identification of Microservice System Anomalies
Microservice architecture has been widely adopted in large-scale applications. However, it also brings new challenges to ensuring reliable performance and maintenance due to the huge volume of data and complex dependencies of microservices. Existing approaches still suffer from the over-aggregation of data, interference from anomaly propagation, and ignoration of component differences. To solve these issues, this paper builds a root cause diagnosis framework at the operation granularity, named as MicroNet. Since operations are subfunctions of microservices, recorded as invocation purposes, we propose the operation-centric perspective, to realize fine-grained data aggregation and operation-level anomaly backtracking. We decompose the diagnosis task into four phases: dependency graph construction, anomaly detection, anomaly evaluation, and culprit location. To construct the invocation dependency accurately, we propose the concept of meta call, defined as the triple (caller, operation, callee), the smallest unit that can be aggregated. Based on the dependency graph, we quantify the operation’s abnormality by analyzing the operation execution process, to backtrack the propagated anomalies. Then, we customize a personalized PageRank algorithm to identify the root cause in which invocation latency and different invocation relationships are considered simultaneously. Our experimental evaluation on an open dataset shows that MicroNet can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- Open Access
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Hi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- 8 November 2023
- Published by MDPI AG in Applied Sciences
- Vol. 13 (22) , 12126
Open AccessHi-RCA: A Hierarchy Anomaly Diagnosis Framework Based on Causality and Correlation Analysis
Microservice architecture has been widely adopted by large-scale applications. Due to the huge amount of data and complex microservice dependency, it also poses new challenges in ensuring reliable performance and maintenance. Existing approaches still suffer from limitations of anomaly data, over-simplification of metric relationships, and lack of diagnosing interpretability. To solve these issues, this paper builds a hierarchy root cause diagnosis framework, named Hi-RCA. We propose a global perspective to characterize different abnormal symptoms, which focuses on changes in metrics’ causation and correlation. We decompose the diagnosis task into two phases: anomalous microservice location and anomalous reason diagnosis. In the first phase, we use Kalman filtering to quantify microservice abnormality based on the estimation error. In the second phase, we use causation analysis to identify anomalous metrics and generate anomaly knowledge graphs; by correlation analysis, we construct an anomaly propagation graph and explain the anomaly symptoms via graph comparison. Our experimental evaluation on an open dataset shows that Hi-RCA can effectively locate root causes with 90% mean average precision, outperforming state-of-the-art methods.
- Open Access
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 437-441
Microservice Anomaly Diagnosis with Graph Convolution Network Based on Implicit Microservice Dependency
- 17 March 2023
- Published by Association for Computing Machinery (ACM)
- p. 437-441
Open AccessMicroservice Anomaly Diagnosis with Graph Convolution Network Based on Implicit Microservice Dependency
- Open Access
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (06)
A LOAD BALANCE PERSONALIZED PATH FINDING WITH MULTIPLE-AGENT DEEP REINFORCEMENT LEARNING
Personalized path-finding allows a user to search for a travel path that can visit its several regions of interest (ROIs). Existing independent searching methods may bring many users to ROIs simultaneously, such as popular attractions in scenic, and thus induce traffic jams. Therefore, it is necessary to find a personalized travel path considering the load balance of traffic flow. However, it is challenging to ensure load balancing on the road and ROIs while allowing each user to visit their ROIs. In this paper, we propose a personalized path-finding method with a multi-agent path-finding (MAPF) framework. Based on the MAPF, it allows users to find the path independently, and we designed a reward to guide the agent simultaneously to navigate to the destination and ROIs for personalized travel. We also improve the architecture of MAPF to guide the agents in learning the load balance through a centralized value network. We evaluated the algorithm with up to 1024 agents on randomly generated road network graphs and compared it against state-of-the-art MAPF planners. We also trained the agent using imitation learning and validated our framework on real-world datasets. Experimental results show that our algorithm is efficient and better than the existing algorithms.
- 1 January 2023
- Published by World Scientific Pub Co Pte Ltd in Fractals
- Vol. 31 (06)
Open AccessA LOAD BALANCE PERSONALIZED PATH FINDING WITH MULTIPLE-AGENT DEEP REINFORCEMENT LEARNING
Personalized path-finding allows a user to search for a travel path that can visit its several regions of interest (ROIs). Existing independent searching methods may bring many users to ROIs simultaneously, such as popular attractions in scenic, and thus induce traffic jams. Therefore, it is necessary to find a personalized travel path considering the load balance of traffic flow. However, it is challenging to ensure load balancing on the road and ROIs while allowing each user to visit their ROIs. In this paper, we propose a personalized path-finding method with a multi-agent path-finding (MAPF) framework. Based on the MAPF, it allows users to find the path independently, and we designed a reward to guide the agent simultaneously to navigate to the destination and ROIs for personalized travel. We also improve the architecture of MAPF to guide the agents in learning the load balance through a centralized value network. We evaluated the algorithm with up to 1024 agents on randomly generated road network graphs and compared it against state-of-the-art MAPF planners. We also trained the agent using imitation learning and validated our framework on real-world datasets. Experimental results show that our algorithm is efficient and better than the existing algorithms.
- Open Access
- 23 March 2022
- Published by Hindawi Limited in Wireless Communications and Mobile Computing
- Vol. 2022, 1-16
A Partitioned DAG Distributed Ledger with Local Consistency for Vehicular Reputation Management
Vehicular reputation maintenance with distributed ledger is aimed at establishing trust among vehicles randomly meeting in a Vehicular Ad-hoc Network (VANET). It is, however, challenging in VANET, as congested areas in road networks, brought by traffic tides or accidents, challenge the ledger performance. Meanwhile, the reputation update is highly dependent on transaction consensus of the distributed ledger. To solve the problem, this paper proposes deploying directed acyclic graph- (DAG-) based distributed ledgers on vehicles, which use the vehicular distribution to adapt the unpredictable reputation update. Specifically, we first propose a partitioned DAG-based distributed ledger to manage vehicular reputation in partitioned VANET. Secondly, we introduce a novel reputation evaluation method to encourage vehicles to contribute to VANET interaction and ledger consensus maintenance, which can remedy the topology churn of the ledger network due to the mobility of VANET. Finally, we design a reputation update method based on the consistency of transactions in the partition to facilitate trust establishment. Experimental results on a real-world dataset show that the proposed ledger and reputation update method is effective and feasible in the large-scale dynamic VANET.
- 23 March 2022
- Published by Hindawi Limited in Wireless Communications and Mobile Computing
- Vol. 2022, 1-16
Open AccessA Partitioned DAG Distributed Ledger with Local Consistency for Vehicular Reputation Management
Vehicular reputation maintenance with distributed ledger is aimed at establishing trust among vehicles randomly meeting in a Vehicular Ad-hoc Network (VANET). It is, however, challenging in VANET, as congested areas in road networks, brought by traffic tides or accidents, challenge the ledger performance. Meanwhile, the reputation update is highly dependent on transaction consensus of the distributed ledger. To solve the problem, this paper proposes deploying directed acyclic graph- (DAG-) based distributed ledgers on vehicles, which use the vehicular distribution to adapt the unpredictable reputation update. Specifically, we first propose a partitioned DAG-based distributed ledger to manage vehicular reputation in partitioned VANET. Secondly, we introduce a novel reputation evaluation method to encourage vehicles to contribute to VANET interaction and ledger consensus maintenance, which can remedy the topology churn of the ledger network due to the mobility of VANET. Finally, we design a reputation update method based on the consistency of transactions in the partition to facilitate trust establishment. Experimental results on a real-world dataset show that the proposed ledger and reputation update method is effective and feasible in the large-scale dynamic VANET.
- Open Access
- 28 May 2020
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Learning Trajectory Routing with Graph Neural Networks
With the widespread application of vehicle GPS equipment, more and more trajectory data are becoming available. Traditional research on trajectory-based route planning uses trajectory data to build a weighted graph, and then obtains routes using classic graph theory-based search algorithms, which has difficulty in estimating multiple preferences. The Recurrent Graph Network (RGN) [1] is a graph neural network, which solves the shortest path problem as a classification problem, i.e., given arbitrary (source, destination) pair, classifying whether the nodes and edges in the graph should be labeled as "on the shortest path connecting the source and destination". Since the RGN model has non-linear feature representation ability and multiple feature fusion ability, this paper considers modifying it for the trajectory-based route planning. However, the actual trajectory data is highly sparse and non-uniform distributed, so that learning trajectory routing in large road networks is a few-shot learning task. To address the aforementioned challenges, this paper proposes the Long Short-Term Memory Graph Network (LSTM-GN) model. The LSTM-GN utilizes a deep LSTM-style message passing process to update various features including comprehensive node-level features, edge-level features and graph-level features, achieving trajectory routing patterns representation based on fewer samples. Additionally, the LSTM-GN needs to get over the difficulty of severe class imbalance and high computational complexity. This paper addresses the above challenges from two perspectives. Firstly, this paper proposes the subgraph filtering algorithms to narrow learning space. Secondly, this paper designs a dynamic weighted loss function to strengthen the positive class. This paper conducts experiments on the real-world trajectory dataset, and the main evaluation metric F1-score of LSTM-GN exceeds the RGN model by 19.18%.
- 28 May 2020
- Published by Association for Computing Machinery (ACM)
- p. 121-126
Open AccessLearning Trajectory Routing with Graph Neural Networks
With the widespread application of vehicle GPS equipment, more and more trajectory data are becoming available. Traditional research on trajectory-based route planning uses trajectory data to build a weighted graph, and then obtains routes using classic graph theory-based search algorithms, which has difficulty in estimating multiple preferences. The Recurrent Graph Network (RGN) [1] is a graph neural network, which solves the shortest path problem as a classification problem, i.e., given arbitrary (source, destination) pair, classifying whether the nodes and edges in the graph should be labeled as "on the shortest path connecting the source and destination". Since the RGN model has non-linear feature representation ability and multiple feature fusion ability, this paper considers modifying it for the trajectory-based route planning. However, the actual trajectory data is highly sparse and non-uniform distributed, so that learning trajectory routing in large road networks is a few-shot learning task. To address the aforementioned challenges, this paper proposes the Long Short-Term Memory Graph Network (LSTM-GN) model. The LSTM-GN utilizes a deep LSTM-style message passing process to update various features including comprehensive node-level features, edge-level features and graph-level features, achieving trajectory routing patterns representation based on fewer samples. Additionally, the LSTM-GN needs to get over the difficulty of severe class imbalance and high computational complexity. This paper addresses the above challenges from two perspectives. Firstly, this paper proposes the subgraph filtering algorithms to narrow learning space. Secondly, this paper designs a dynamic weighted loss function to strengthen the positive class. This paper conducts experiments on the real-world trajectory dataset, and the main evaluation metric F1-score of LSTM-GN exceeds the RGN model by 19.18%.