• Journal of the Korean Society of Clothing and Textiles
• /
• v.31 no.8
• /
• pp.1157-1167
• /
• 2007

Internet communications have provoked new forms of online word-of-mouth(WOM) communication and it has become more powerful. At this point, this study analyses the effects of information characteristics(direction, consensus) of online WOM. Especially, quasi-experiment can systematically manipulate the direction and the consensus of online WOM information and it perceived the difference in the effects in this study. Female consumers who have purchased clothing at online shopping mall in past 6 months participated in the experiment by completing 4 type questionnaires(N=600). Data are analyzed using Cronbach's ${\alpha}$, t-test, one way ANOVA, two-way ANOVA, Duncan's multiple range test. The Results of this study are as follows: (1) The direction of online WOM information significantly influences consumer's reliability of information, attitude, and purchase intentions. These effects are more significant when negative WOM information than positive information and two-sided information was given. (2) Though there is the difference in reliability of information, the consensus of online WOM information does not have influences on consumer's attitude and purchase intentions. (3) Consumer's clothing involvement is related to WOM information searching. The highly involved consumer is more effected by online WOM information than the lowly one.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.14 no.4
• /
• pp.284-291
• /
• 2021

In this paper, we study the consensus problem for multi-agent systems with input saturations. The goal of consensus is to achieve a swarming behavior of multi-agent systems by reaching the agreement through information exchange. This paper considers agents modeled by first-order dynamics with input saturations. In order to guarantee the global convergence of the agents, it is assumed that the agents are stable. Moreover, considering the disturbances, we propose the PI based duplex control method to achieve the consensus. The proposed P controller and I controller are composed of different information network. Then, we investigate the conditions of the information networks and the control gains of P, I controllers to achieve the consensus applying the Lyapunov stability theorem and the Lasalle's Invariance Principle. Finally, we conduct the simulations to validate the theoretical results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.8
• /
• pp.4093-4107
• /
• 2019

Proof of Work (PoW) based blockchains have limitations in throughput, time consumption, and energy efficiency. In these systems, a miner will consume significant time and resources to obtain a reward for contributing to the blockchain. To overcome these limitations, recent research on blockchains are focused on accelerating the speed, scalability, and enhancing the security level. By enhancing specific procedures of blockchain system, the level of data integrity supported by the blockchain can become more robust, and efficient. In this paper, a new blockchain consensus model based on the Bryllite Consensus Protocol (BCP) is proposed to support a hyper-connected massively multiplayer online game (MMOG) ecosystem. The BCP scheme enables users to participate directly in new consensus processes through a Proof of Participation (PoP) algorithm. In this model, the consensus algorithm has a simpler form while maintaining high security level. In addition, because the BCP scheme gives users an equal chance to make a contribution to the blockchain, rewards are distributed in an equal fashion, which motivates user participation. The analysis of the proposed scheme is applied to the Bryllite consortium blockchain system (homed in Hong Kong), which is a new blockchain network developed for international game industries, gamers, and game events.

• 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.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.12
• /
• pp.99-104
• /
• 2021

Blockchain technology is a distributed ledger technology that shares the ledger between multiple nodes connected to a distributed network. The data managed through the existing central server is managed through the blockchain, and the transparency, accuracy, and integrity of the transaction data is increased, and the need for data management through the blockchain is increasing. In this paper, recognizing the need for trust-based data sharing between trust-based institutions in the financial industry, this paper describes the process of selecting leader nodes in Raft, a private blockchain consensus algorithm, as a way to increase data management efficiency through blockchain. A modified consensus algorithm is presented. The performance of the modified consensus algorithm and the general Raft consensus algorithm presented in this paper was compared and analyzed based on the transaction processing time, and it was confirmed that the efficiency of the consensus process was increased by applying the proposed consensus algorithm.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.5
• /
• pp.615-620
• /
• 2005

Sensor networks are usually composed of tens or thousands of tiny devices with limited resources. Because of their limited resources, there will often be some faulty nodes within the network. As nodes in some certain regions rely on each other to route the information gathered by different sensors to a base station (sink), the network should be able to detect a non-operational node in order to determine new paths for routing the information. Failure detection, which identifies the faulty nodes, is rather necessary in sensor networks and a very important research issue. The detection of a non-operational node can be performed using Consensus Algorithm with the purpose of achieving agreement about a node which is supposed to be faulty (non-operational). In this work, we discuss the application of a Consensus Algorithm to sensor node called 'mote'. Our experimental results show that it works efficiently for identifying faulty nodes in sensor networks.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.251-260
• /
• 2019

In order to ensure second-order multi-agent systems (MAS) realizing consensus more quickly in a limited time, a new protocol is proposed. In this new protocol, the gradient algorithm of the overall cost function is introduced in the original protocol to enhance the connection between adjacent agents and improve the moving speed of each agent in the MAS. Utilizing Lyapunov stability theory, graph theory and homogeneity theory, sufficient conditions and detailed proof for achieving a finite-time consensus of the MAS are given. Finally, MAS with three following agents and one leading agent is simulated. Moreover, the simulation results indicated that this new protocol could make the system more stable, more robust and convergence faster when compared with other protocols.

• 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.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.67-69
• /
• 2009

This paper deals with the consensus problem for multi-agent linear dynamic systems with parameter uncertainties. All the agents are identical high-order linear systems with parameter uncertainties and their state information is exchanged through a communication network. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems. A numerical example is presented to show the effectiveness of the proposed method.

• Proceedings of the IEEK Conference
• /
• 2009.05a
• /
• pp.88-90
• /
• 2009

This paper deals with the consensus problem for multi-agent linear dynamic systems with communication delay. All the agents are identical high-order linear systems and their state information is exchanged through a communication network with constant communication delay. It is shown that a consensus is achieved if there exists a feasible solution to a set of linear matrix inequalities obtained for a simultaneous stabilization problem for multiple systems with delay. A numerical example is presented to show the effectiveness of the proposed method.