• 유통과학연구
• /
• 제15권2호
• /
• pp.7-14
• /
• 2017

Purpose - This study attempts to extend the research in responsible luxury by identifying contexts where Corporate Social Responsibility (CSR) can promote luxury brands' evaluation. It contributes to the literature on consumer responses to CSR, and to responsible luxury in particular and demonstrates how dispositional consensus and luxury-CSR information of luxury brands affects consumers' evaluation of brand. Research design, data, and methodology - An experiment was conducted to test the relationship between brand evaluation and responsible luxury brands' CSR information using collected data through a survey in a large university of South Korea. Study conditions were manipulated with various product types to analyze the relationship in different product domains. Results - When consensus regarding sincere and altruistic motive of companies for CSR activity is high, the perceived fit between luxury brand and the type of CSR has no effect on brand evaluation. But, in case of lower consensus regarding the benevolent company motives, higher fit enhances evaluation than lower fit. Conclusions - In using consensus as a guiding factor to choose the type of charity with favorably view, the level of irrespective fit can help luxury firms to enjoy the benefits of better image. In case of low consensus donating to charities that are closely related to the brands' product or area of business seems to be fruitful.

• ETRI Journal
• /
• 제42권6호
• /
• pp.872-885
• /
• 2020

Distributed consensus requires the consent of more than half of the congress to produce irreversible results, and the performance of the consensus algorithm deteriorates with the increase in the number of nodes. This problem can be addressed by delegating the agreement to a few selected nodes. Since the selected nodes must comply with the Byzantine node ratio criteria required by the algorithm, the result selected by any decentralized node cannot be trusted. However, some trusted nodes monopolize the consensus node selection process, thereby breaking decentralization and causing a trilemma. Therefore, a consensus node selection algorithm is required that can construct a congress that can withstand Byzantine faults with the decentralized method. In this paper, an algorithm based on the Byzantine agreement among decentralized agents to facilitate agreement between decentralization nodes is proposed. It selects a group of random consensus nodes per block by applying the proposed proof of nonce algorithm. By controlling the percentage of Byzantine included in the selected nodes, it solves the trilemma when an arbitrary node selects the consensus nodes.

• 산업경영시스템학회지
• /
• 제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.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권3호
• /
• pp.135-139
• /
• 2009

여러 문자열들을 비교하여 유사성 또는 거리(오차)를 계산하는 문제는 패턴매칭, 웹검색 바이오인포매틱스, 컴퓨터 보안 등 다양한 응용 분야와의 연관성으로 인해 활발히 연구되어 왔다. 주어진 문자열 집합 내의 여러 문자열들의 거리를 비교하기 위해 주어진 집합 내의 모든 문자열들을 대표하는 한 문자열(대표문자열)을 찾는 방법이 있다. 대표문자열 방법은 주어진 문자열 집합과 가장 유사한 한 문자열을 찾는 방법으로 주로 이용되는 목적함수는 거리반경과 거리합이 있다. 거리반경은 집합 내의 문자열들과 특정 문자열과의 거리들의 최대값으로 정의되며, 모든 문자열들 중에서 최소의 거리반경을 만드는 문자열을 주어진 문자열 집합에 대한 거리반경기반 대표문자열이라 한다. 거리합은 집합 내의 문자열들과 특정 문자열과의 거리들의 합으로 정의되며, 모든 문자열들 중에서 최소의 거리합을 만드는 문자열을 주어진 문자열집합에 대한 거리합기반 대표문자열이라 한다. 본 논문에서는 메트릭 거리함수에 대해 거리반경기반 대표문자열 문제가 NP-완전임을 증명한다.

• 융합보안논문지
• /
• 제20권1호
• /
• pp.3-8
• /
• 2020

블록체인은 중앙 집중 시스템 형태에서 벗어난 탈중앙화 형태의 데이터 관리를 통하여 데이터 투명성과 보안성을 높일 수 있다. 블록체인 플랫폼 중 허가형 블록체인은 신뢰기반의 허가된 노드만이 분산 네트워크에 참여할 수 있다. 허가형 블록체인의 특징을 고려하였을 때 합의 알고리즘 선정을 위한 조건으로 네트워크 통신 속도 및 거래내역의 최종성 합의, 안정성 등의 고려가 필요하다. 허가형 블록체인 환경의 합의 알고리즘은 PoA, PBFT, Raft 등 다양하지만 합의 알고리즘 선정을 위한 다양한 평가요소가 존재하지 않는다. 본 논문에서는 허가형 블록체인의 각 합의 알고리즘의 특징을 분석하고 네트워크를 구성하는 사용자 환경의 특징을 고려한 효율적 합의 알고리즘 선정을 위하여 다양한 성능평가항목을 제안하였다. 제안한 성능평가항목은 신뢰를 전제로 한 노드 간 네트워크 속도, 안정성, 최종성 합의의 적합성 등을 고려할 수 있으며 이를 통하여 보다 효율적인 블록체인 네트워크 환경을 구성할 수 있다.

• 한국컴퓨터정보학회논문지
• /
• 제26권12호
• /
• pp.99-104
• /
• 2021

블록체인 기술은 분산 네트워크에 연결된 다수의 노드 간 원장을 공유하는 분산 원장기술이다. 기존 중앙 서버를 통하여 관리되던 데이터들이 블록체인을 통하여 관리되며 거래 데이터에 대한 투명성과 정확성 및 무결성이 높아지며 블록체인을 통한 데이터관리의 필요성이 높아지고 있다. 본 논문에서는 금융업에서 신뢰 기반의 기관 간 신뢰 기반의 데이터 공유가 필요하다는 점을 인지하고 블록체인을 통한 데이터관리 효율성 증대를 높이는 방법으로 프라이빗 블록체인 합의 알고리즘인 Raft의 리더 노드 선출과정의 처리 과정을 수정한 합의 알고리즘을 제시하였다. 본 논문에서 제시한 수정 합의 알고리즘과 일반적인 Raft 합의 알고리즘에 대하여 트랜잭션 처리시간을 기준으로 성능을 비교·분석하였으며 제안한 합의 알고리즘 적용을 통하여 합의 과정의 효율성이 높아짐을 확인하였다.

• 제어로봇시스템학회논문지
• /
• 제20권5호
• /
• pp.526-532
• /
• 2014

In this paper, we present and analyze a LQ (Linear Quadratic) inverse optimal state-consensus protocol for continuous-time multi-agent systems with undirected graph topology. By Lyapunov analysis of the state-consensus error dynamics, we show the sufficient conditions on the algebraic connectivity of the graph to guarantee LQ inverse optimality and closed-loop stability. A more relaxed stability condition is also provided in terms of the algebraic connectivity. Finally, a formation control protocol for multiple mobile robots is proposed based on the target LQ inverse optimal consensus protocol, and the simulation results are provided to verify the performance of the proposed LQ inverse formation control method.

• Asia pacific journal of information systems
• /
• 제15권4호
• /
• pp.27-60
• /
• 2005

The purpose of this study is to call attention to the consensus of stakeholders of corporate e-Learning system for the sake of its success. We identified the critical success factors(contents, technical features, management, and organizational support) as major components of corporate e-Learning systems and questioned whether stakeholders' consensus on the importance of these components facilitates the successful implementation of these components. We also questioned whether the influence of these components on user satisfaction could be moderated by contextual factors. Based on empirical testing of 18 e-Learning user companies, we verified that the consensus of stakeholders regarding the importance of content, technological features, and organizational support has a positive influence on the perceived quality of these factors in their e-Learning systems, which in turn is positively related to user satisfaction. The learning subjects and learning style did significantly moderate the influences of these perceived qualities on user satisfaction.

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

• 제어로봇시스템학회논문지
• /
• 제21권5호
• /
• pp.434-441
• /
• 2015

In this paper, we propose an inverse optimal distributed protocol for the formation and velocity consensus of nonholonomic mobile robots. The communication among mobile robots is described by a simple undirected graph, and the mobile robots' kinematics are considered. The group of mobile robots driven by the proposed protocols asymptotically achieves the desired formation and group velocity in an inverse optimal fashion. The design of the protocols is based on dynamic feedback linearization and the proposed linear quadratic (LQ) inverse optimal second-order consensus protocol. A numerical simulation is given to verify the effectiveness of the proposed scheme.