• Information Systems Review
• /
• v.13 no.3
• /
• pp.141-163
• /
• 2011

The advancement of information technologies including the Internet has affected the way of social information processing as well as brought about the paradigm shift to the information society. Accordingly, it is very important to study the process of social information processing over the digital media through which social information is generated, distributed, and led to social consensus. In this study, we analyze the mechanism of social information processing, identify a process model of social consensus and institutionalization of the results, and finally propose a set of information processing characteristics on the internet media. We deploy the ethnographic approach to analyze the meaning of group behavior in the context of society to analyze two major events which happened in Korean society. The formation process of social consensus is found to consist of 5 steps: suggestion of social issues, selective reflection on public opinion, acceptance of the issues and diffusion, social consensus, and institutionalization and feedback. The key characteristics of information processing in the Internet is grouped into proactive response to an event, the changes in the role of opinion leader, the flexibility of proposal and analysis, greater scalability, relevance to consensus making, institutionalization and interaction. This study contributes to the literature by proposing a process model of social information processing which can be used as the basis for analyzing the social consensus making process from the social network perspective. In addition, this study suggests a new perspective where the utility of the Internet media can be understood from the social information processing so that other disciplines including politics, communications, and management can improve the decision making performance in utilizing the Internet media.

• Journal of Internet Computing and Services
• /
• v.21 no.1
• /
• pp.17-31
• /
• 2020

With the rapid development of block chain technology, attempts have been made to put the block chain technology into practical use in various fields such as finance and logistics, and also in the public sector where data integrity is very important. Defense Operations In addition, strengthening security and ensuring complete integrity of the command communication network is crucial for operational operation under the network-centered operational environment (NCOE). For this purpose, it is necessary to construct a command communication network applying the block chain network. However, the block chain technology up to now can not solve the security issues such as the 51% attack. In particular, the Practical Byzantine fault tolerance (PBFT) algorithm which is now widely used in blockchain, does not have a penalty factor for nodes that behave maliciously, and there is a problem of failure to make a consensus even if malicious nodes are more than 33% of all nodes. In this paper, we propose a Adaptive Consensus Bound PBFT (ACB-PBFT) algorithm that incorporates a penalty mechanism for anomalous behavior by combining the Trust model to improve the security of the PBFT, which is the main agreement algorithm of the blockchain.

• Journal of The Korean Association For Science Education
• /
• v.37 no.6
• /
• pp.1037-1049
• /
• 2017

The purpose of this study is to explore how the flow of discourse move and their reasoning process in dialogic argumentation during group modeling on excretion. Five groups of three to four students in the second grade of a middle school participated in the modeling practice of a Gifted Center. Analysis was conducted on argumentation during the modeling activity in which students should explain how the waste product (ammonia) leaves the body. It was found that there was a sequential argumentative process-tentative consensus, solving the uncertainty, and consensus. There were several discourse moves - 'claim' and 'counterclaim' in the stage of tentative consensus, 'query' and 'clarification of meaning' in the stage of solving the uncertainty, and 'change of claim' in the stage of consensus. Students participated in the dialogic argumentation by constructing argument collaboratively for reaching a consensus. Critical questioning in the stage of solving the uncertainty and reasoning in the stage of consensus were the impact factors of dialogic argumentation. By answering the critical questions, students changed their claims or suggested new claims by defending or rebutting previous claims. Students justified group claims with diverse argumentation scheme and scientific reasoning to reach a group consensus. These findings have implication for science educators who want to adopt dialogic argumentation in science classes.

• Journal of Science and Technology Studies
• /
• v.1 no.1 s.1
• /
• pp.123-153
• /
• 2001

This article addresses the 2nd Korean consensus conference on cloning that was held by the Korean National commission for UNESCO in 1999. Though previous perspectives recognized the conference as a new citizen's participatory institution. they do not consider that it contains the ideal of deliberative democracy. This article notes that the citizens participated directly and handled the important social agenda through debate in the consensus conference. The consensus conference is another democratic form derived from preference aggregating democracy in the sense that it basically depends on public judgement of the citizens. This consensus conference has the historical meaning because it is in fact the first experiment of deliberative democracy in Korea. 1) We examine the theoretical foundations of consensus conference. They are social constructionism of science, the tradition of societal debate, and deliberative democracy. 2) We explore what deliberative democracy is. It is different from aggregating preference democracy in the sense that it depends on public judgement rather than private preferences. 3) We investigate the features and meaning of deliberative democracy which has experiment on the conference. In the Consensus Conference it was observed that citizens changed their preferences and went forward to developing their view of community as a result of the process of deliberation. It can be said to confirm the significance of deliberative democracy. However, it is simultaneously an opportunity to clarify some problems of deliberative democracy. First of all, it shows that there were hierarchies within the citizens' panel as well as between the citizens' and the specialists' panels. Secondly, there are difficulties in expressing the value of life in argument or discourse. Also, we need the institutional efforts concerning future generations and nonhuman beings in the respect that cloning relates to them.

• Journal of the Institute of Convergence Signal Processing
• /
• v.24 no.2
• /
• pp.103-111
• /
• 2023

Consensus, that aims to converge the states of agents to the same states through information exchanges between agents, has been widely studied to control the multi-agent systems. In real systems, the measurement variables of each agent may be different, the loss of information across communication may occur, and the different networks for each state may need to be constructed for safety. Moreover, the input saturation and the disturbances in the system may cause instability. Therefore, this paper studies the PID(Proportional-Integral-Derivative)-based consensus control to achieve the swarm behavior of the multi-agent systems considering the heterogeneous state information, the input saturations, and the disturbances. Specifically, we consider the multiple follower agents and the single leader agent modeled by the second-order systems, and investigate the conditions to achieve the consensus based on the stability of the error system. It is confirmed that the proposed algorithm can achieve the consensus if only the connectivity of the position graph is guaranteed. Moreover, by extending the consensus algorithm, we study the formation control problem for the multi-agent systems. Finally, the validity of the proposed algorithm was verified through the simulations.

• Journal of KIISE:Software and Applications
• /
• v.30 no.5_6
• /
• pp.487-496
• /
• 2003

The promoter that plays a very important role in gene expression as a signal part has various binding sites for transcription factors. These binding sites are located on various parts in promoter region and have highly conserved consensus sequence patterns. This paper presents a new method for the consensus pattern search in promoter regions using genetic algorithm, which adopts the assumption of N-occurrence-per-dataset model of MEME algorithm and employs the advantage of Wataru method in determining the pattern length. Our method will be employed by genome researchers who try to predict the promoter region on anonymous DNA sequence and to find out the binding site for a specific transcription factor.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3815-3820
• /
• 2000

This paper is about the minimum requirements to solve the Election problem in asynchronous distributed systems. The focus of the paper is to find out what failure detector is the weakest one to solve the Election problem. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors and show that the Election problem is harder than the Consensus problem. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector. which is strictly stronger than the weakest failure detector that is needed to solve Consensus.

• The Korean Journal of Physiology and Pharmacology
• /
• v.22 no.1
• /
• pp.91-99
• /
• 2018

Protein phosphatase 1 (PP1) is involved in various signal transduction mechanisms as an extensive regulator. The PP1 catalytic subunit (PP1c) recognizes and binds to PP1-binding consensus residues (FxxR/KxR/K) in NBCe1-B. Consequently, we focused on identifying the function of the PP1-binding consensus residue, $^{922}FMDRLK^{927}$, in NBCe1-B. Using site-directed mutagenesis and co-immunoprecipitation assays, we revealed that in cases where the residues were substituted (F922A, R925A, and K927A) or deleted (deletion of amino acids 922-927), NBCe1-B mutants inhibited PP1 binding to NBCe1-B. Additionally, by recording the intracellular pH, we found that PP1-binding consensus residues in NBCe1-B were not only critical for NBCe1-B activity, but also relevant to its surface expression level. Therefore, we reported that NBCe1-B, as a substrate of PP1, contains these residues in the C-terminal region and that the direct interaction between NBCe1-B and PP1 is functionally critical in controlling the regulation of the ${HCO_3}^-$ transport. These results suggested that like IRBIT, PP1 was another novel regulator of ${HCO_3}^-$ secretion in several types of epithelia.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.35-40
• /
• 2003

In this paper, I raise an issue regarding the relationships between the Election problem and the Consensus problem in asynchronous systems with unreliable failure detectors. First, I describe our system model, and then define Leader Election. After then, I show that the Election problem is harder to resolve than the Consensus problem. Each correct process eventually gets into the state in which it considers only one process to be a leader. Therefore a Perfect Failure Detector is the weakest failure detector which is sufficient to solve the Election. In order to show that the Election problem is harder to resolve than the Consensus problem, I utilize the Reduction protocol in this paper.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.197-202
• /
• 2014

In order to operate multiple UAVs for multiple tasks efficiently, we need a task allocation algorithm with minimum cost, i.e.,total moving distance required to accomplish the whole mission. In this paper, we have proposed the MCBAA (Modified Consensus Based Auction Algorithm) which can be suitably applied to the operation of multiple UAVs. The key idea of proposed algorithm is to minimize sum of distance from current location of agents to location of tasks based on the conventional CBAA. Several simulation test performed on three UAV agents with multiple tasks demonstrates the overall efficiency both in time and total distance.