Time-and event-driven communication process for networked control systems: A survey

Copyright © 2014 Lei Zou et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.In recent years, theoretical and practical research topics on networked control systems (NCSs) have gained an increasing interest from many researchers in a variety of disciplines owing to the extensive applications of NCSs in practice. In particular, an urgent need has arisen to understand the effects of communication processes on system performances. Sampling and protocol are two fundamental aspects of a communication process which have attracted a great deal of research attention. Most research focus has been on the analysis and control of dynamical behaviors under certain sampling procedures and communication protocols. In this paper, we aim to survey some recent advances on the analysis and synthesis issues of NCSs with different sampling procedures (time-and event-driven sampling) and protocols (static and dynamic protocols). First, these sampling procedures and protocols are introduced in detail according to their engineering backgrounds as well as dynamic natures. Then, the developments of the stabilization, control, and filtering problems are systematically reviewed and discussed in great detail. Finally, we conclude the paper by outlining future research challenges for analysis and synthesis problems of NCSs with different communication processes.This work was supported in part by the National Natural Science Foundation of China under Grants 61329301, 61374127, and 61374010, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

Consensus-based control for a network of diffusion PDEs with boundary local interaction

In this paper the problem of driving the state of a network of identical agents, modeled by boundary-controlled heat equations, towards a common steady-state profile is addressed. Decentralized consensus protocols are proposed to address two distinct problems. The first problem is that of steering the states of all agents towards the same constant steady-state profile which corresponds to the spatial average of the agents initial condition. A linear local interaction rule addressing this requirement is given. The second problem deals with the case where the controlled boundaries of the agents dynamics are corrupted by additive persistent disturbances. To achieve synchronization between agents, while completely rejecting the effect of the boundary disturbances, a nonlinear sliding-mode based consensus protocol is proposed. Performance of the proposed local interaction rules are analyzed by applying a Lyapunov-based approach. Simulation results are presented to support the effectiveness of the proposed algorithms

Randomized protocols for asynchronous consensus

The famous Fischer, Lynch, and Paterson impossibility proof shows that it is impossible to solve the consensus problem in a natural model of an asynchronous distributed system if even a single process can fail. Since its publication, two decades of work on fault-tolerant asynchronous consensus algorithms have evaded this impossibility result by using extended models that provide (a) randomization, (b) additional timing assumptions, (c) failure detectors, or (d) stronger synchronization mechanisms than are available in the basic model. Concentrating on the first of these approaches, we illustrate the history and structure of randomized asynchronous consensus protocols by giving detailed descriptions of several such protocols.Comment: 29 pages; survey paper written for PODC 20th anniversary issue of Distributed Computin

How to use the International Classification of Functioning, Disability and Health as a reference system for comparative evaluation and standardized reporting of rehabilitation interventions

Rehabilitation aims to optimize functioning of persons experiencing functioning limitations. As such the comparative evaluation of rehabilitation interventions relies on the analysis of the differences between the change in patient functioning after a specific rehabilitation intervention versus the change following another intervention. A robust health information reference system that can facilitate the comparative evaluation of changes in functioning in rehabilitation studies and the standardized reporting of rehabilitation interventions is the International Classification of Functioning, Disability and Health (ICF). The objective of this paper is to present recommendations that Cochrane Rehabilitation could adopt for using the ICF in rehabilitation studies by: 1) defining the functioning categories to be included in a rehabilitation study; 2) specifying selected functioning categories and selecting suitable data collection instruments; 3) examining aspects of functioning that have been documented in a study; 4) reporting functioning data collected with various data collection instruments; and 5) communicating results in an accessible, meaningful and easily understandable way. The authors provide examples of concrete studies that underscore these recommendations, whereby also em-phasizing the need for future research on the implementation of specific recommendations, e.g. in meta-analysis in systematic literature reviews. Furthermore, the paper outlines how the ICF can complement or be integrated in established Cochrane and rehabilitation research structures and methods, e.g. use of standard mean difference to compare cross-study data collected using different measures, in developing core outcome sets for rehabilitation, and the use of the PICO model. © 2019 EDIZIONI MINERVA MEDICA

Cloning and sequence analysis of cDNAs encoding the cytosolic precursors of subunits GapA and GapB of chloroplast glyceraldehyde-3-phosphate dehydrogenase from pea and spinach

Chloroplast glyceraldehyde-3-phosphate dehydrogenase (GAPDH) is composed of two different subunits, GapA and GapB. cDNA clones containing the entire coding sequences of the cytosolic precursors for GapA from pea and for GapB from pea and spinach have been identified, sequenced and the derived amino acid sequences have been compared to the corresponding sequences from tobacco, maize and mustard. These comparisons show that GapB differs from GapA in about 20% of its amino acid residues and by the presence of a flexible and negatively charged C-terminal extension, possibly responsible for the observed association of the enzyme with chloroplast envelopes in vitro. This C-terminal extension (29 or 30 residues) may be susceptible to proteolytic cleavage thereby leading to a conversion of chloroplast GAPDH isoenzyme I into isoenzyme II. Evolutionary rate comparisons at the amino acid sequence level show that chloroplast GapA and GapB evolve roughly two-fold slower than their cytosolic counterpart GapC. GapA and GapB transit peptides evolve about 10 times faster than the corresponding mature subunits. They are relatively long (68 and 83 residues for pea GapA and spinach GapB respectively) and share a similar amino acid framework with other chloroplast transit peptides