Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yujiao Lv

dblp:259/5517 · DBLP profile ↗
← Back
3ranked-venue papers
3as first author
2since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorSecurity and privacy · 1 · 1 first-author · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 62% Embedded and real-time systems · 38%
Network and information security
1 paper
Cyber-physical and IoT security · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cyber-physical and IoT security
stealthy attack detection
0.612022
Resilient Distributed State Estimation Under Stealthy Attack · IEEE Trans. Inf. Forensics Secur. 2022
Distributed systems
consensus
0.612022
Resilient Distributed State Estimation Under Stealthy Attack · IEEE Trans. Inf. Forensics Secur. 2022
Embedded and real-time systems
cyber-physical systems
0.212022
Resilient Distributed State Estimation Under Stealthy Attack · IEEE Trans. Inf. Forensics Secur. 2022
Embedded and real-time systems › cyber-physical systems
resilient control
0.212022
Resilient Distributed State Estimation Under Stealthy Attack · IEEE Trans. Inf. Forensics Secur. 2022

Methods — techniques the papers use, named apart from their topics

state estimation error covariance analysis · 1.1kalman filtering · 1.1
YearPublicationVenuePosition
2023 A class of stealthy attacks on remote state estimation with intermittent observation
Yujiao Lv, Jianquan Lu, Yang Liu 0040, Lingzhong Zhang
Inf. Sci.1
2022 Resilient Distributed State Estimation Under Stealthy Attack
abstract
Network security issues are significant for cyber-physical systems while existing wireless networks are vulnerable to cyber-attacks. This paper proposes a novel detector for stealthy attacks in distributed consensus-based filtering, which has fewer objects to detect and thus can reduce the time consumption of the detector. Based on the proposed detector, we can analyze the estimated performance of the distributed estimator under a stealthy attack. The purpose of this study is to analyze the properties and performance of the estimator equipped with the proposed detector depending on the adversary’s available resources. First, we study the sufficient condition for distributed state estimation to be resilient based on the assumption that the adversary has sufficient resources. With limited adversary resources, the optimal Kalman gain can be obtained by minimizing state estimation error covariance. Furthermore, a sufficient condition is presented to guarantee the convergence of the estimation error covariance in the estimator equipped with the proposed detector. Finally, a simulation example is provided to demonstrate the effect of the detector on the distributed estimator.
Yujiao Lv, Jianquan Lu, Yang Liu 0040, Jungang Lou
IEEE Trans. Inf. Forensics Secur.1
2020 Edge-Based Fractional-Order Adaptive Strategies for Synchronization of Fractional-Order Coupled Networks With Reaction-Diffusion Terms
abstract
In this paper, spatial diffusions are introduced to fractional-order coupled networks and the problem of synchronization is investigated for fractional-order coupled neural networks with reaction-diffusion terms. First, a new fractional-order inequality is established based on the Caputo partial fractional derivative. To realize asymptotical synchronization, two types of adaptive coupling weights are considered, namely: 1) coupling weights only related to time and 2) coupling weights dependent on both time and space. For each type of coupling weights, based on local information of the node's dynamics, an edge-based fractional-order adaptive law and an edge-based fractional-order pinning adaptive scheme are proposed. Furthermore, some new analytical tools, including the method of contradiction, L'Hopital rule, and Barbalat lemma are developed to establish adaptive synchronization criteria of the addressed networks. Finally, an example with numerical simulations is provided to illustrate the validity and effectiveness of the theoretical results.
Yujiao Lv, Cheng Hu 0005, Juan Yu 0001, Haijun Jiang, Tingwen Huang
IEEE Trans. Cybern.1