Browse
Submit Data
Databases
API
Help

Dataset Information

20 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Trust-based fault detection and robust fault-tolerant control of uncertain cyber-physical systems against time-delay injection attacks.

ABSTRACT: Control systems need to be able to operate under uncertainty and especially under attacks. To address such challenges, this paper formulates the solution of robust control for uncertain systems under time-varying and unknown time-delay attacks in cyber-physical systems (CPSs). A novel control method able to deal with thwart time-delay attacks on closed-loop control systems is proposed. Using a descriptor model and an appropriate Lyapunov functional, sufficient conditions for closed-loop stability are derived based on linear matrix inequalities (LMIs). A design procedure is proposed to obtain an optimal state feedback control gain such that the uncertain system can be resistant under an injection time-delay attack with variable delay. Furthermore, various fault detection frameworks are proposed by following the dynamics of the measured data at the system's input and output using statistical analysis such as correlation analysis and K-L (Kullback-Leibler) divergence criteria to detect attack's existence and to prevent possible instability. Finally, an example is provided to evaluate the proposed design method's effectiveness.

SUBMITTER: Baromand S

PROVIDER: S-EPMC8220189 | biostudies-literature |

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Similar Datasets

Stability criteria on delay-dependent robust stability for uncertain neutral stochastic nonlinear systems with time-delay.

Project description:This work mainly studies the robust stability analysis and design of a controller for uncertain neutral stochastic nonlinear systems with time-delay. Using a modified Lyapunov–Krasovskii functional and the free-weighting matrices technique, we establish some new delay-dependent criteria in terms of linear matrix inequality (LMI). The innovative point of this work is that we generalize the robust stability analysis of nonlinear stochastic time-delay systems to the uncertain neutral stochastic systems. Due to the added derivative term of time-delay, the proposed scheme can be applied more widely. Finally, numerical examples are provided to validate the derived results.

| S-EPMC6208627 | biostudies-other

Detecting security attacks in cyber-physical systems: a comparison of Mule and WSO2 intelligent IoT architectures.

Project description:The Internet of Things (IoT) paradigm keeps growing, and many different IoT devices, such as smartphones and smart appliances, are extensively used in smart industries and smart cities. The benefits of this paradigm are obvious, but these IoT environments have brought with them new challenges, such as detecting and combating cybersecurity attacks against cyber-physical systems. This paper addresses the real-time detection of security attacks in these IoT systems through the combined used of Machine Learning (ML) techniques and Complex Event Processing (CEP). In this regard, in the past we proposed an intelligent architecture that integrates ML with CEP, and which permits the definition of event patterns for the real-time detection of not only specific IoT security attacks, but also novel attacks that have not previously been defined. Our current concern, and the main objective of this paper, is to ensure that the architecture is not necessarily linked to specific vendor technologies and that it can be implemented with other vendor technologies while maintaining its correct functionality. We also set out to evaluate and compare the performance and benefits of alternative implementations. This is why the proposed architecture has been implemented by using technologies from different vendors: firstly, the Mule Enterprise Service Bus (ESB) together with the Esper CEP engine; and secondly, the WSO2 ESB with the Siddhi CEP engine. Both implementations have been tested in terms of performance and stress, and they are compared and discussed in this paper. The results obtained demonstrate that both implementations are suitable and effective, but also that there are notable differences between them: the Mule-based architecture is faster when the architecture makes use of two message broker topics and compares different types of events, while the WSO2-based one is faster when there is a single topic and one event type, and the system has a heavy workload.

| S-EPMC8627230 | biostudies-literature

A novel N-input voting algorithm for X-by-wire fault-tolerant systems.

Project description:Voting is an important operation in multichannel computation paradigm and realization of ultrareliable and real-time control systems that arbitrates among the results of N redundant variants. These systems include N-modular redundant (NMR) hardware systems and diversely designed software systems based on N-version programming (NVP). Depending on the characteristics of the application and the type of selected voter, the voting algorithms can be implemented for either hardware or software systems. In this paper, a novel voting algorithm is introduced for real-time fault-tolerant control systems, appropriate for applications in which N is large. Then, its behavior has been software implemented in different scenarios of error-injection on the system inputs. The results of analyzed evaluations through plots and statistical computations have demonstrated that this novel algorithm does not have the limitations of some popular voting algorithms such as median and weighted; moreover, it is able to significantly increase the reliability and availability of the system in the best case to 2489.7% and 626.74%, respectively, and in the worst case to 3.84% and 1.55%, respectively.

| S-EPMC4216716 | biostudies-other

Fault-tolerant almost exact state transmission.

Project description:We show that a category of one-dimensional XY-type models may enable high-fidelity quantum state transmissions, regardless of details of coupling configurations. This observation leads to a fault-tolerant design of a state transmission setup. The setup is fault-tolerant, with specified thresholds, against engineering failures of coupling configurations, fabrication imperfections or defects, and even time-dependent noises. We propose an experimental implementation of the fault-tolerant scheme using hard-core bosons in one-dimensional optical lattices.

| S-EPMC3816291 | biostudies-other

Cluster-Fault Tolerant Routing in a Torus.

Project description:The number of Internet-connected devices grows very rapidly, with even fears of running out of available IP addresses. It is clear that the number of sensors follows this trend, thus inducing large sensor networks. It is insightful to make the comparison with the huge number of processors of modern supercomputers. In such large networks, the problem of node faults necessarily arises, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. Furthermore, thanks to its advantageous topological properties, the torus interconnection network has been adopted by the major supercomputer manufacturers of the recent years, thus proving its applicability. Acknowledging and embracing these two technological and industrial aspects, we propose in this paper a node-to-node routing algorithm in an n-dimensional k-ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. The described algorithm selects a fault-free path of length at most n ( 2 k + ? k / 2 ? - 2 ) with an O ( n 2 k 2 | F | ) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters.

| S-EPMC7309173 | biostudies-literature

Optical demonstration of quantum fault-tolerant threshold.

Project description:A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable to the output of a higher probability of correct logical qubits under the presence of errors. However, strict requirements to encode qubits and operators render the implementation of a full fault-tolerant computation challenging even for the achievable noisy intermediate-scale quantum technology. Especially the threshold for fault-tolerant computation still lacks experimental verification. Here, based on an all-optical setup, we experimentally demonstrate the existence of the threshold for the fault-tolerant protocol. Four physical qubits are represented as the spatial modes of two entangled photons, which are used to encode two logical qubits. The experimental results clearly show that when the error rate is below the threshold, the probability of correct output in the circuit, formed with fault-tolerant gates, is higher than that in the corresponding non-encoded circuit. In contrast, when the error rate is above the threshold, no advantage is observed in the fault-tolerant implementation. The developed high-accuracy optical system may provide a reliable platform to investigate error propagation in more complex circuits with fault-tolerant gates.

| S-EPMC9256730 | biostudies-literature

Improved Dynamic Graph Learning through Fault-Tolerant Sparsification

Project description:Graph sparsification has been used to improve the computational cost of learning over graphs, e.g., Laplacian-regularized estimation, graph semisupervised learning (SSL) and spectral clustering (SC). However, when graphs vary over time, repeated sparsification requires polynomial order computational cost per update. We propose a new type of graph sparsification namely fault-tolerant (FT) sparsification to significantly reduce the cost to only a constant. Then the computational cost of subsequent graph learning tasks can be significantly improved with limited loss in their accuracy. In particular, we give theoretical analysis to upper bound the loss in the accuracy of the subsequent Laplacian-regularized estimation, graph SSL and SC, due to the FT sparsification. In addition, FT spectral sparsification can be generalized to FT cut sparsification, for cut-based graph learning. Extensive experiments have confirmed the computational efficiencies and accuracies of the proposed methods for learning on dynamic graphs.

| S-EPMC9270720 | biostudies-literature

Hydrogel tapes for fault-tolerant strong wet adhesion.

Project description:Fast and strong bio-adhesives are in high demand for many biomedical applications, including closing wounds in surgeries, fixing implantable devices, and haemostasis. However, most strong bio-adhesives rely on the instant formation of irreversible covalent crosslinks to provide strong surface binding. Repositioning misplaced adhesives during surgical operations may cause severe secondary damage to tissues. Here, we report hydrogel tapes that can form strong physical interactions with tissues in seconds and gradually form covalent bonds in hours. This timescale-dependent adhesion mechanism allows instant and robust wet adhesion to be combined with fault-tolerant convenient surgical operations. Specifically, inspired by the catechol chemistry discovered in mussel foot proteins, we develop an electrical oxidation approach to controllably oxidize catechol to catecholquinone, which reacts slowly with amino groups on the tissue surface. We demonstrate that the tapes show fast and reversible adhesion at the initial stage and ultrastrong adhesion after the formation of covalent linkages over hours for various tissues and electronic devices. Given that the hydrogel tapes are biocompatible, easy to use, and robust for bio-adhesion, we anticipate that they may find broad biomedical and clinical applications.

| S-EPMC8660897 | biostudies-literature

Robust MPC for polytopic uncertain systems via a high-rate network with the round-robin scheduling

Project description:This article is concerned with the robust model predictive control (RMPC) problem for polytopic uncertain systems under the round-robin (RR) scheduling in the high-rate communication channel. From a set of sensors to the controller, several sensors transmit the data to the remote controller via a shared high-rate communication network, data collision might happen if these sensors start transmissions at the same time. For the sake of preventing data collision in the high-rate communication channel, a communication scheduling known as RR is used to arrange the data transmission order, where only one node with token is allowed to send data at each transmission instant. In accordance with the token-dependent Lyapunov-like approach, the aim of the problem addressed is to design a set of controllers in the framework of RMPC such that the asymptotical stability of the closed-loop system is guaranteed. By taking the effect of the underlying RR scheduling in the high-rate communication channel into consideration, sufficient conditions are obtained by solving a terminal constraint set of an auxiliary optimization problem. In addition, an algorithm including both off-line and online parts is provided to find a sub-optimal solution. Finally, two simulation examples are used to demonstrate the usefulness and effectiveness of the proposed RMPC strategy.

| S-EPMC10280437 | biostudies-literature

Data driven discovery of cyber physical systems.

Project description:Cyber-physical systems embed software into the physical world. They appear in a wide range of applications such as smart grids, robotics, and intelligent manufacturing. Cyber-physical systems have proved resistant to modeling due to their intrinsic complexity arising from the combination of physical and cyber components and the interaction between them. This study proposes a general framework for discovering cyber-physical systems directly from data. The framework involves the identification of physical systems as well as the inference of transition logics. It has been applied successfully to a number of real-world examples. The novel framework seeks to understand the underlying mechanism of cyber-physical systems as well as make predictions concerning their state trajectories based on the discovered models. Such information has been proven essential for the assessment of the performance of cyber-physical systems; it can potentially help debug in the implementation procedure and guide the redesign to achieve the required performance.

| S-EPMC6814766 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data