Yao Li

Dr. Yao Li


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

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

Representative Publications

View All Publications
4 February 2021 in IEEE Transactions on Circuits and Systems II: Express Briefs
Verified
Journal Article
Closed access
YLYao Li
Yao Li
SZShanying Zhu
Shanying Zhu
CCCailian Chen
Cailian Chen
XGXinping Guan
Xinping Guan
Security issues of cyber-physical systems have become a timely and hot topic in recent years. In this brief, we investigate the power-constrained optimal denial-of-service (DoS) attack strategy with multiple power levels on state estimation over infinite-time horizon. We start from the two-level case and explicitly derive out the basic form of optimal attack strategy. In order to handle the intractability brought about by the larger number of levels, we develop an equivalent property for general multi-level cases that the multi-level scheduling can be viewed as a feasible combination of several sub-schedules with a designed stochastic-triggered manner, which provides a necessary condition of optimal solution. Moreover, based on the practical communication model, we give the condition under which the optimal schedule can be uniquely and explicitly determined for the two-pick strategy. Numerical simulations are accomplished to verify the effectiveness of our proposed methods.

11 December 2024 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
RSRui Song
Rui Song
SGSenhui Gao
Senhui Gao
YLYao Li
Yao Li

14 July 2021 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
YLYao Li
Yao Li
SZShanying Zhu
Shanying Zhu
CCCailian Chen
Cailian Chen
XGXinping Guan
Xinping Guan
In this article, we consider the power scheduling problem of the multihop transmission with limited power resources. For a discrete-time linear time-invariant process, we consider a more practical scenario where the forward-error-correcting (FEC) coding scheme is utilized. An approximate communication model is introduced to formulate the nonanalytical relationship between the consumption of power and the successful-decoding-probability. For the single-hop transmission, we propose an analytical method to figure out the optimal offline scheduling for the finite-time case and the optimal periodic schedule for the infinite-time case. We consider the process and terminal errors simultaneously, and explicitly discuss how different values of parameters affect the optimality. Moreover, we extend our conclusions to the multihop case. In order to deal with the difficulty and complexity brought by the multihop scenario, a novel method based on the equivalent-scheduling matrix (ESM) is proposed to describe the accumulated effects through the multihop transmission. Meanwhile, explicit solutions of the multihop case are provided for finite- and infinite-time cases, respectively. Numerical examples are provided to demonstrate the effectiveness of the proposed methods.

24 October 2016
Verified
Conference Paper
Closed access
YLYao Li
Yao Li
TZTiankui Zhang
Tiankui Zhang
XXXiaogeng Xu
Xiaogeng Xu
ZZZhimin Zeng
Zhimin Zeng
YLYinlong Liu
Yinlong Liu
Content Centric Networking (CCN) is one of the candidate future Internet architectures that give favorable promises in networks. In-network caching as one of its key functions, has been studied extensively to achieve less content access delay and to reduce traffic load. However, current caching schemes mostly suffer from a poor utilization of cache space; since many content replicas are replaced without being hit by coming requests. As the limited cache space in networks, less popular contents have much less replicas than the popular ones, and the requests for them will cause considerable delay. In this paper, a content popularity and node level matched based probability caching strategy (MPC) is proposed to maximize the cache utilization and to improve the content diversity in networks simultaneously. We first evaluate the caching property of nodes along the delivery path by utilizing multi-parameters, and classify nodes into levels according to their caching property. Then, we assign contents to the nodes with their matched level, which balances the proportion of contents with different popularities in the network. Simulation results demonstrate that the proposed strategy can achieve less content access delay, higher cache hit ratio, and richer content diversity.

20 August 2021 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
YLYao Li
Yao Li
SZShanying Zhu
Shanying Zhu
CCCailian Chen
Cailian Chen
XGXinping Guan
Xinping Guan
In this article, the scheduling problem over a delayed network is investigated. Different from the existing literature, we propose a hybrid stochastic model which incorporates both delay and packet loss. Based on this proposed model, an energy-efficient co-design problem is considered under power-limited scenarios. A global optimal offline solution is presented explicitly. Aided by arriving information feedback, we propose an online schedule based on an absolute threshold. The optimality of our proposed schemes and thresholds selection is theoretically analyzed. Meanwhile, we have extended the conclusions of the single-system case to the multisystem case. Optimal strategies from both offline and online perspectives are provided with rigorous proof, respectively. The stability condition is given for the estimator to converge in an infinite-time horizon. The comparisons between offline and online strategies are proved the global superiority of the online strategy to the offline one. Numerical simulations have validated the correctness and superiority of our proposed algorithms.

23 December 2024 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
WLWei Liu
Wei Liu
CCCailian Chen
Cailian Chen
YLYao Li
Yao Li
XBXuehan Bai
Xuehan Bai
BZBaocong Zhang
Baocong Zhang
XGXinping Guan
Xinping Guan
The prediction of sintering quality indicators is essential for the automation of the ironmaking process. However, various challenges, including variable time delays and relatively weak correlations, present difficulties in achieving precise modeling of the sintering process. To address these challenges, we introduce a novel method based on the nonuniform time delay embedding technique for predicting sintering quality indicators. First, we construct input variables with different compensated time delays. Second, we develop a low-dimensional approximation of the joint mutual information criterion to search the optimal variables and time delays. This approach effectively leverages valuable information from process variables while minimizing irrelevant information. Next, we implement a hybrid modeling technique that combines extreme gradient boosting and support vector regression to predict sintering quality indicators, allowing for adaptation to various operating conditions. Finally, we validate the effectiveness of our proposed method using real production data, specifically focusing on FeO content.