• Journal of information and communication convergence engineering
• /
• v.17 no.3
• /
• pp.167-173
• /
• 2019

This study investigates the problem of leader-following consensus for multi-agent systems with output saturations. This study assumes that the agents are described as a neutrally stable system, and the leader agent generates the bounded trajectory within the saturation level. Then, the objective of the leader-following consensus is to track the trajectory of the leader by exchanging information with neighbors. To solve this problem, we propose an observer-based distributed consensus algorithm. Then, we provide a consensus analysis by applying the Lyapunov stability theorem and LaSalle's invariance principle. The result shows that the agents achieve the leader-following consensus in a global sense. Moreover, we can achieve the consensus by choosing any positive control gain. Finally, we perform a numerical simulation to demonstrate the validity of the proposed algorithm.

• Journal of Information Processing Systems
• /
• v.14 no.1
• /
• pp.101-128
• /
• 2018

Thanks to its potential in many applications, Blockchain has recently been nominated as one of the technologies exciting intense attention. Blockchain has solved the problem of changing the original low-trust centralized ledger held by a single third-party, to a high-trust decentralized form held by different entities, or in other words, verifying nodes. The key contribution of the work of Blockchain is the consensus algorithm, which decides how agreement is made to append a new block between all nodes in the verifying network. Blockchain algorithms can be categorized into two main groups. The first group is proof-based consensus, which requires the nodes joining the verifying network to show that they are more qualified than the others to do the appending work. The second group is voting-based consensus, which requires nodes in the network to exchange their results of verifying a new block or transaction, before making the final decision. In this paper, we present a review of the Blockchain consensus algorithms that have been researched and that are being applied in some well-known applications at this time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.9
• /
• pp.857-862
• /
• 2011

This paper studies the output consensus problem for a class of heterogeneous linear multi-agent systems under a fixed directed communication network. The dynamics, as well as its dimension, of each agent can widely differ from the others, but all the agents are assumed to have the same transfer matrix. In addition, only the system outputs are constrained to be delivered through the network. Under these conditions, we show that the output consensus is reached by a group of identical controllers, which is designed to achieve the state consensus for the homogeneous multi-agent system obtained from the minimal realization of the transfer matrix. Finally, an example is given to demonstrate the proposed result.

• Atmosphere
• /
• v.28 no.3
• /
• pp.291-303
• /
• 2018

In this study, a new consensus technique for predicting tropical cyclone (TC) intensity in the western North Pacific was developed. The most important feature of the present consensus model is to select and combine the guidance numerical models with the best performance in the previous years based on various evaluation criteria and averaging methods. Specifically, the performance of the guidance models was evaluated using both the mean absolute error and the correlation coefficient for each forecast lead time, and the number of the numerical models used for the consensus model was not fixed. In averaging multiple models, both simple and weighted methods are used. These approaches are important because that the performance of the available guidance models differs according to forecast lead time and is changing every year. In particular, this study develops both a multi-consensus model (M-CON), which constructs the best consensus models with the lowest error for each forecast lead time, and a single best consensus model (S-CON) having the lowest 72-hour cumulative mean error, through on training process. The evaluation results of the selected consensus models for the training and forecast periods reveal that the M-CON and S-CON outperform the individual best-performance guidance models. In particular, the M-CON showed the best overall performance, having advantages in the early stages of prediction. This study finally suggests that forecaster needs to use the latest evaluation results of the guidance models every year rather than rely on the well-known accuracy of models for a long time to reduce prediction error.

• Korean Medical Education Review
• /
• v.15 no.3
• /
• pp.151-158
• /
• 2013

Patient safety is achieved through systematic improvement based on the knowledge and willingness of medical professionals. A systematic longitudinal curriculum for patient safety is essential to prepare medical students and professionals. The purpose of this article is to introduce our experience with a 'workshop for developing a patient safety curriculum' and to compare the results with previous studies. The workshop comprising 15 medical professors and patient safety experts met for 2 days. The Consensus Workshop method was applied, collecting opinions from all of the members and reaching consensus through the following stages: context, brainstorm, cluster, name, and resolve. The patient safety curriculum was developed by this method, covering patient safety topics and issues, and teaching and assessment methods. A total of 7 topics were extracted, 'activities for patient safety, concepts of patient safety, leadership and teamwork, error disclosure, self-management, patient education, policies.' Issues, teaching methods, and assessment methods were developed for each topic. The patient safety curriculum developed from the workshop was similar to previous curricula developed by other institutions and medical schools. The Consensus Workshop method proved to be an effective approach to developing a patient safety curriculum.

• Journal of IKEEE
• /
• v.19 no.4
• /
• pp.520-525
• /
• 2015

This paper investigates the consensus problem for high-order integrators with an arbitrary large communication delay. In order to solve this problem, new consensus controller with an additional design parameter that can eliminate the effect of a communication delay on the consensus problem is proposed. Also, it is proved that the proposed consensus controller can always solve the consensus problem of high-order integrators even in the presence of an arbitrarily large communication delay. Finally, an illustrative example is given in order to show the effectiveness of our design method.

• Communications for Statistical Applications and Methods
• /
• v.12 no.2
• /
• pp.335-348
• /
• 2005

The rapid development of microarray technologies enabled the monitoring of expression levels of thousands of genes simultaneously. Recently, the time course gene expression data are often measured to study dynamic biological systems and gene regulatory networks. For the data, biologists are attempting to group genes based on the temporal pattern of their expression levels. We apply the consensus clustering algorithm to a time course gene expression data in order to infer statistically meaningful information from the measurements. We evaluate each of consensus clustering and existing clustering methods with various validation measures. In this paper, we consider hierarchical clustering and Diana of existing methods, and consensus clustering with hierarchical clustering, Diana and mixed hierachical and Diana methods and evaluate their performances on a real micro array data set and two simulated data sets.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.617-621
• /
• 2012

This paper studies asymptotic consensus problem for linear multi-agent systems. We propose a distributed state feedback control algorithm for solving the problem under fixed and undirected network communication. In contrast with the conventional algorithms that use global information (e.g., graph connectivity), the proposed algorithm only uses local information from neighbors. The principle for achieving asymptotic consensus is that, for each agent, a distributed update law gradually increases the coupling gain of LQR-type feedback and thus, the overall stability of the multi-agent system is recovered by the gain margin of LQR.

• Journal of the Korean Magnetic Resonance Society
• /
• v.17 no.2
• /
• pp.76-80
• /
• 2013

The TCP domain is a DNA-binding domain present in plant transcription factors and has a similar structural feature to the bHTH motif of eukaryotic transcription factors. The imino proton exchange study has been performed for the DNA duplex containing the consensus DNA-binding site for the AtTCP11 transcription factor. The first two base pairs in the consensus 5'-GTGGG-3' sequence are relatively very unstable but lead to greater stabilization of the neighboring two G C base pairs. These unique dynamic features of the five base pairs in the consensus DNA sequence might play crucial roles in the effective DNA binding of the AtTCP11 protein.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.390-397
• /
• 2013

This paper presents a consensus algorithm for uMAS (uncertain Multi-Agent Systems). Unlike previous results in which only nominal models for agents are considered, it is assumed that the uncertain agent model belongs to a known polytope set. In the middle of deriving the proposed algorithm, a convex set is found which includes all uncertainties in the problem using convexity of the polytope set. This set plays an important role in designing the consensus algorithm for uMAS. Based on the set, a consensus condition for uMAS is proposed and the corresponding consensus design problem is solved using LMI (Linear Matrix Inequality). Simulation result shows that the proposed consensus algorithm successfully leads to consensus of the state of uMAS.