Yu Zheng

Yu Zheng

Auto-generated profile, based on publicly available information

Yu Zheng

Department of Electrical and Computer Engineering, Florida State University, Tallahassee, Florida, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
4 May 2023 in Control Engineering Practice
Verified
Journal Article
Closed access
YZYu Zheng
Yu Zheng
SMSridhar Babu Mudhangulla
Sridhar Babu Mudhangulla
OAOlugbenga Moses Anubi
Olugbenga Moses Anubi

20 January 2026 in ACM Transactions on Cyber-Physical Systems
Verified
Journal Article
Open access
YZYu Zheng
Yu Zheng
SVSatish Vedula
Satish Vedula
AOAYOBAMI OLAJUBE
AYOBAMI OLAJUBE
OAOlugbenga Anubi
Olugbenga Anubi
Cyber-physical systems (CPS) are highly susceptible to malicious attacks due to their complex dynamics and interconnectivity. A comprehensive understanding of their vulnerabilities is essential for designing effective resilience measures. This article presents a data-driven attack generative system for evaluating the vulnerability of CPS. The proposed approach formulates the vulnerability assessment problem as determining the feasibility of a specific attack set based on two boundary functions that represent the effectiveness and stealthiness of attacks. The attack generative model is trained using a custom loss function, with two universal approximators designed to learn the effectiveness and stealthiness functions simultaneously. Theoretical results for successful generation and asymptotic convergence of the resulting training algorithm are given. The proposed approach is evaluated via numerical simulation of an IEEE 14-bus system and gas pipeline systems, demonstrating its viability in learning how to attack nonlinear CPS and identify potential vulnerabilities.

14 October 2025 in SIAM Journal on Control and Optimization
Verified
Journal Article
Closed access
YZYu Zheng
Yu Zheng
OAOlugbenga Moses Anubi
Olugbenga Moses Anubi
WDWarren E. Dixon
Warren E. Dixon
Resilient state recovery of cyber-physical systems has attracted much research attention due to the unique challenges posed by the tight coupling between communication, computation, and the underlying physics of such systems. By modeling attacks as additive adversary signals to a sparse subset of measurements, this resilient recovery problem can be formulated as an error correction problem. To achieve exact state recovery, most existing results require less than [Formula: see text] of the measurement nodes to be compromised, which limits the resiliency of the estimators. In this paper, we show that observer resiliency can be further improved by incorporating data-driven prior information. We provide an analytical bridge between the precision of prior information and the resiliency of the estimator. By quantifying the relationship between the estimation error of the weighted [Formula: see text] observer and the precision of the support prior, this quantified relationship provides guidance for the estimator’s weight design to achieve optimal resiliency. Several numerical simulations and an application case study are presented to validate the theoretical claims.

29 April 2020 in arXiv
Verified
Preprint
Open access
PDF file
YLYaqiong Li
Yaqiong Li
XFXuhui Fan
Xuhui Fan
LCLing Chen
Ling Chen
BLBin Li
Bin Li
ZYZheng Yu
Zheng Yu
SSScott A. Sisson
Scott A. Sisson
The Dirichlet Belief Network~(DirBN) has been recently proposed as a promising approach in learning interpretable deep latent representations for objects. In this work, we leverage its interpretable modelling architecture and propose a deep dynamic probabilistic framework -- the Recurrent Dirichlet Belief Network~(Recurrent-DBN) -- to study interpretable hidden structures from dynamic relational data. The proposed Recurrent-DBN has the following merits: (1) it infers interpretable and organised hierarchical latent structures for objects within and across time steps; (2) it enables recurrent long-term temporal dependence modelling, which outperforms the one-order Markov descriptions in most of the dynamic probabilistic frameworks. In addition, we develop a new inference strategy, which first upward-and-backward propagates latent counts and then downward-and-forward samples variables, to enable efficient Gibbs sampling for the Recurrent-DBN. We apply the Recurrent-DBN to dynamic relational data problems. The extensive experiment results on real-world data validate the advantages of the Recurrent-DBN over the state-of-the-art models in interpretable latent structure discovery and improved link prediction performance.