• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권4호
• /
• pp.1389-1408
• /
• 2021

Proof-of-Work (PoW) is the first and still most common consensus protocol in blockchain. But it is costly and energy intensive, aiming at addressing these problems, we propose a consensus algorithm named Proof-of-Work-and-Block-Compression (PoW-BC). PoW-BC is an improvement of PoW to compress blocks and adjust consensus parameters. The algorithm is designed to encourage the reduction of block size, which improves transmission efficiency and reduces disk space for storing blocks. The transaction optimization model and block compression model are proposed to compress block data with a smaller compression ratio and less compression/ decompression duration. Block compression ratio is used to adjust mining difficulty and transaction count of PoW-BC consensus protocol according to the consensus parameters adjustment model. Through experiment and analysis, it shows that PoW-BC improves transaction throughput, and reduces block interval and energy consumption.

• 대기
• /
• 제28권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.

• 한국초등과학교육학회지:초등과학교육
• /
• 제43권1호
• /
• pp.201-217
• /
• 2024

이 연구는 2012년 제1차 PCK 서밋에서 제안된 교사의 전문지식 및 기능 모델(합의 모델)과 2016년 제2차 PCK 서밋에서 제안된 수정된 합의 모델의 복합적 관점에 근거하여 2012년부터 2023년까지 국내 KCI 등재 학술지에 출판된 초등교사의 과학 PCK 연구 논문 11편을 심층 분석 및 재해석하여 초등교사의 과학 PCK 개념화를 위한 시론적 고찰을 수행하였다. 연구 결과, 국내 문헌에서 초등교사의 과학 PCK는 주로 Magnusson et al.(1999)의 PCK 요소에 근거하여 교사의 전문지식 기초를 분석하여 도출되었으며, 주제 수준 또는 교과 수준에서 '실행된 PCK' 또는 '개인적 PCK'로 분석된 경우가 많았다. 또한, 정서적 요인을 반영한 개인적 PCK 연구는 수정된 합의 모델의 관점에서 볼 때 '집합적 PCK'의 특성을 일부 포함하였다. 초등교사의 과학 PCK는 교사 개인의 경험에서 분석되는 실행된 PCK뿐만 아니라 전문가의 관점에서 규정된 집합적 PCK 및 개인적 PCK를 종합적으로 고려하여 개념화하는 것이 필요함을 제안하였다.

• 제어로봇시스템학회논문지
• /
• 제19권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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권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.

• 대한수학회지
• /
• 제61권3호
• /
• pp.565-602
• /
• 2024

We study the collective behaviors of two second-order nonlinear consensus models with a bonding force, namely the Kuramoto model and the Cucker-Smale model with inter-particle bonding force. The proposed models contain feedback control terms which induce collision avoidance and emergent consensus dynamics in a suitable framework. Through the cooperative interplays between feedback controls, initial state configuration tends to an ordered configuration asymptotically under suitable frameworks which are formulated in terms of system parameters and initial configurations. For a two-particle system on the real line, we show that the relative state tends to the preassigned value asymptotically, and we also provide several numerical examples to analyze the possible nonlinear dynamics of the proposed models, and compare them with analytical results.

• Journal of the Korean Physical Society
• /
• 제73권10호
• /
• pp.1406-1409
• /
• 2018

We have frequently encountered the rapid changes that prevalent opinion of the social community is toppled by a new and opposite opinion against the pre-exiting one. To understand this interesting process, mean-field model with infinite-interaction range has been mostly considered in previous studies S. A. Marvel et al., Phys. Rev. Lett. 110, 118702 (2012). However, the mean-field interaction range is lack of reality in the sense that any individual cannot interact with all of the others in the community. Based on it, in the present work, we consider a simple model of opinion consensus so-called basic model on the low-dimensional lattices (d = 1, 2) with finite interaction range. The model consists of four types of subpopulations with different opinions: A, B, AB, and the zealot of A denoted by $A_c$, following the basic model shown in the work by S. A. Marvel et al.. Comparing with their work, we consider the finite range of the interaction, and particularly reconstruct the lattice structure by adding new links when the two individuals have the distance < ${\sigma}$. We explore how the interaction range ${\sigma}$ affects the opinion consensus process on the reconstructed lattice structure. We find that the critical fraction of population for $A_c$ required for the opinion consensus on A shows different behaviors in the small and large interaction ranges. Especially, the critical fraction for $A_c$ increases with the size of ${\sigma}$ in the region of small interaction range, which is counter-intuitive: When the interaction range is increased, not only the number of nodes affected by $A_c$ but also that affected by B grows, which is believed to cause the increasing behavior of the critical fraction for $A_c$. We also present the difference of dynamic process to the opinion consensus between the regions of small and large interaction ranges.

• 산업경영시스템학회지
• /
• 제45권1호
• /
• pp.1-9
• /
• 2022

The PoN (Proof of Nonce) distributed consensus algorithm basically uses a non-competitive consensus method that can guarantee an equal opportunity for all nodes to participate in the block generation process, and this method was expected to resolve the first trilemma of the blockchain, called the decentralization problem. However, the decentralization performance of the PoN distributed consensus algorithm can be greatly affected by the network transaction transmission delay characteristics of the nodes composing the block chain system. In particular, in the consensus process, differences in network node performance may significantly affect the composition of the congress and committee on a first-come, first-served basis. Therefore, in this paper, we presented a problem by analyzing the decentralization performance of the PoN distributed consensus algorithm, and suggested a fairness control algorithm using a learning-based probabilistic acceptance rule to improve it. In addition, we verified the superiority of the proposed algorithm by conducting a numerical experiment, while considering the block chain systems composed of various heterogeneous characteristic systems with different network transmission delay.

• 제어로봇시스템학회논문지
• /
• 제17권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.

• 기본간호학회지
• /
• 제12권2호
• /
• pp.162-170
• /
• 2005

Purpose: This study was conducted to develop a curriculum model for fundamentals of nursing at the graduate level which reflects a consensus of educators and the students in Korean nursing society. Method: A survey was used with three groups to identify consensus on a curriculum model for fundamentals of nursing at the graduate level; 42 educators in fundamentals of nursing, 11 nurse educators whose major was not fundamentals of nursing and 70 nurses with a bachelor degree in nursing. Results: Consensus on a curriculum model at the graduate level were delineated from analysis of the survey, Based on these results, a curriculum model fur fundamentals of nursing at the graduate level is outlined: As one major area of nursing, fundamentals of nursing focuses on nursing practice based on basic human needs. Thus main focus of the curriculum for fundamentals of nursing at the graduate level is research performance and theory development on nursing interventions to meet basic human needs in clinical settings. Conclusions: A curriculum model for fundamentals of nursing at the graduate level suggests that its application may have a positive impact on development of distinct knowledge body for fundamentals of nursing that will differentiate the content of education for undergraduate and graduate levels of nursing. However, the suggestion for the curriculum model needs to be refined and developed for application.