• 한국시스템다이내믹스연구
• /
• 제1권2호
• /
• pp.61-89
• /
• 2000

The purpose of this study is first, to find out what factors affect the cooperation and trust within the functions in the policy implementation network and in what mechanism these factors interact, second to investigate the whys to manage trust and cooperation successfully in the dynamic situation such as the network setting. For these purpose, this study reviews the concept and characteristics of policy implementation organizations, second, extracts the various factors affecting trust and cooperation in the network situation, third applies and analyzes the relationship among factors to system dynamics model based on the game theory. The results of this study could be summarized as follows: It was found that the utility change within the participants by persuasion ＆ mutual understanding and change of rule would be leading to success in policy implementation network. Also bureaucratic management such as power enforcement does not have any good impact in the managing network. In this study, system simulation method tried to analyze the hypothesis. Quantitative and case analyses were not accompanied and analysis was limited to two-person game theory. So there is some doubt this results could be generalized to actual situation which is N-person game.

• Journal of Information Technology Applications and Management
• /
• 제24권1호
• /
• pp.169-185
• /
• 2017

This study proposes a novel recommendation algorithm that reflects the results from trust/distrust network analysis as a solution to enhance prediction accuracy of recommender systems. The recommendation algorithm of our study is based on memory-based collaborative filtering (CF), which is the most popular recommendation algorithm. But, unlike conventional CF, our proposed algorithm considers not only the correlation of the rating patterns between users, but also the results from trust/distrust relationship network analysis (e.g. who are the most trusted/distrusted users?, whom are the target user trust or distrust?) when calculating the similarity between users. To validate the performance of the proposed algorithm, we applied it to a real-world dataset that contained the trust/distrust relationships among users as well as their numeric ratings on movies. As a result, we found that the proposed algorithm outperformed the conventional CF with statistical significance. Also, we found that distrust relationship was more important than trust relationship in measuring similarities between users. This implies that we need to be more careful about negative relationship rather than positive one when tracking and managing social relationships among users.

• 한국프랜차이즈경영연구
• /
• 제10권1호
• /
• pp.19-32
• /
• 2019

Purpose - Since the opening of Korea's distribution market, the domestic network marketing market has been continuing to grow. In this context, research on network marketing independent operators, which plays the most important role in the network marketing industry, is insufficient. This study was to identify the effects of Independent Operator's Company Selection Attributions on the Economic and Non-Economic Satisfaction, Trust, and Recommendation. The results will provide strategic direction, theoretical and practical implications for companies and operators in the network marketing industry. Research design, data, and methodology - In order to verify the research hypotheses, the data were collected from Independent Operators of Network marketing industry using questionnaires. The pretest was conducted from January 8 to 19, 2018, and the main survey was conducted from February 1 to 28. A total of 210 questionnaires, of which 193 copies were collected. The data were analyzed with SPSS 21.0. and AMOS 21.0. Results - The results are as follows; product competitiveness and system competitiveness have significant effects on economic satisfaction and non-economic satisfaction. Economic and non-economic satisfaction have significant effects on business trust. Economic and non-economic satisfaction did not influence recommendation intention directly, but influence it indirectly. Business trust has a significant effect on business recommendation intention. Conclusions - After starting network marketing business as an independent operator, the competitiveness of the company is meaningless, and product competitiveness and system competitiveness are important factors for economic and non-economic satisfaction. Therefore, network marketing companies and independent operators should prioritize product competitiveness and system competitiveness between business development. The findings show that trust in the business is very important for active business Recommendation to others. Therefore, network marketing firms and independent operators need to make efforts to meet economic and non-economic satisfaction, which have a significant impact on business trust.

• 한국병원경영학회지
• /
• 제20권3호
• /
• pp.1-12
• /
• 2015

The objective of this study is to analyze the effects of brand authenticity on brand trust and the effect of brand trust on brand loyalty in case of network franchise dental clinics. To achieve this objective, 300 dental customers were surveyed in Seoul and Gyeonggi province. Of these, 267 respondents were used for the analysis. The research results show that communication authenticity, advertising truthfulness, employee authenticity had positive effect on brand trust. and brand trust have positive effect on brand loyalty.

• 한국경영과학회지
• /
• 제40권4호
• /
• pp.1-18
• /
• 2015

This paper proposes relational capability as a main driver of constructing inter-organizational collaboration networks. Based on social network theory and relational view literature, three components of relational capability are constructed and implemented by an agent-based model. The components include organizational capability, structural capability, and trust between a partner and a focal firm. These three components are updated by two micro mechanisms: structural mechanism and relational mechanism. Structural mechanism is a feedback loop in which the relational capability increases structural capability and vice versa. Relational mechanism is a learning-by-doing process in which a focal firm experiences success or failure of collaboration and the experience increases or decreases cumulative trust in a partner firm. Result of agent-based simulation shows that a collaboration network emerges through interactions of firm's relational capabilities and the characteristics of emerged networks vary with the contribution of structural capability and trust to relational capability. Specifically, in case structural capability contributes more to relational capability, the average degree centrality and collaboration proportion increases as time passes and enters into an equilibrium state. In that case, almost every firms participated in the network collaborates each other so that the emerged network becomes highly cohesive. In case trust contributes more to relational capability, the results are reversed. In an equilibrium state, the balance of contribution between structural capability and trust makes an emerged network larger and maximizes average degree centrality of the network.

• 한국콘텐츠학회논문지
• /
• 제21권3호
• /
• pp.68-79
• /
• 2021

소셜 사물 인터넷(SIoT)에서 차량들이 다양한 정보를 생성하고 이를 다른 차량과 공유하고 피드백을 주고 받는 소셜 행위가 이루어진다. 차량 간에 신뢰성 있는 정보를 공유하기 위해서는 차량의 신뢰성을 판별하는 것이 중요하다. 본 논문에서는 차량들 간에 신뢰성 있는 정보를 공유하기 위한 차량 신뢰도 계산 기법을 제안한다. 제안하는 기법은 차량 간 소셜 행위에 기반한 사용자 평판과 네트워크 신뢰도를 고려하여 차량 신뢰도를 판별한다. 차량은 점수 부여, 무시, 재배포 등의 행위를 선택할 수 있으며 이에 따라 사용자 평판이 계산된다. 네트워크 신뢰도를 계산하기 위해 다른 차량과의 거리와 패킷 전송률을 이용한다. 사용자 평판과 네트워크 신뢰도를 이용하여 지역 신뢰도가 계산된다. 이때, 전달되는 데이터의 중복 배포를 방지한다. RSU(Road Side Unit)의 데이터를 활용하여 지역적인 데이터의 한계를 극복하고 전역적인 데이터를 활용하여 보다 더 정확한 차량 신뢰도 계산이 가능하다. 다양한 성능평가를 통해 제안하는 기법이 기존 기법에 비해서 성능이 우수함을 보인다.

• International Journal of Computer Science & Network Security
• /
• 제23권11호
• /
• pp.149-161
• /
• 2023

Internet of Things (IoT) is a relatively new concept that has gained immense popularity in a short period of time due to its wide applicability in making human life more convenient and automated. As an illustration: the development of smart homes, smart cities, etc. However, it is also accompanied by a substantial number of risks and flaws. IoT makes use of low-powered devices, so secure, less time-consuming and energy-intensive transmission (routing) of messages due to the limited availability of energy is one of the many and most significant concerns for IoT developers. The following paper presents a trust-based routing scenario for the Internet of Things (IoT) that exploits the past transmission record from the cupcarbon simulator's log files. Artificial Neural Network is used to quantify knowledge of trust, calculate the value of trust, and share this information with other network devices. As a human behavioural pattern, trust provides a superior method for making routing decisions. If there is a tie in the trust values and no other path is available, the remaining battery power is used to break the tie and make a forwarding decision; this is also seen as a more efficient use of the available resources. The proposed algorithm is observed to have superior energy consumption and routing decisions compared to conventional routing algorithms, and it improves the communication pattern.

• International Journal of Computer Science & Network Security
• /
• 제24권9호
• /
• pp.111-118
• /
• 2024

The concept of social stratification and hierarchy among human dates back to the origin of human race. Presently, the growing reputation of social networks has given us with an opportunity to analyze these well-studied phenomena over different networks at different scales. Generally, a social network could be defined as a collection of actors and their interactions. In this work, we concern ourselves with a particular type of social networks, known as trust networks. In this type of networks, there is an explicit show of trust (positive interaction) or distrust (negative interaction) among the actors. In other words, an actor can designate others as friends or foes. Trust networks are typically modeled as signed networks. A signed network is a directed graph in which the edges carry an edge weight of +1 (indicating trust) or -1 (indicating distrust). Examples of signed networks include the Slashdot Zoo network, the Epinions network and the Wikipedia adminship election network. In a social network, actors tend to connect with each other on the basis of their perceived social hierarchy. The emergence of such a hierarchy within a social community shows the manner in which authority manifests in the community. In the case of signed networks, the concept of social hierarchy can be interpreted as the emergence of a tree-like structure comprising of actors in a top-down fashion in the order of their ranks, describing a specific parent-child relationship, viz. child trusts parent. However, owing to the presence of positive as well as negative interactions in signed networks, deriving such "trust hierarchies" is a non-trivial challenge. We argue that traditional notions (of unsigned networks) are insufficient to derive hierarchies that are latent within signed networks In order to build hierarchies in signed networks, we look at two interpretations of trust namely presence of trust (or "good") and lack of distrust (or "not bad"). In order to develop a hierarchy signifying both trust and distrust effectively, the above interpretations are combined together for calculating the overall trustworthiness (termed as deserve) of actors. The actors are then arranged in a hierarchical fashion based on these aggregate deserve values, according to the following hypothesis: actor v is assigned as a child of actor u if: (i) v trusts u, and (ii) u has a higher deserve value than v. We describe this hypothesis with additional qualifiers in this thesis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권11호
• /
• pp.5437-5454
• /
• 2016

A Wireless Sensor Network (WSN) is composed of several sensor nodes which are severely restricted to energy and memory. Energy is the lifeblood of sensors and thus energy conservation is a critical necessity of WSN. This paper proposes a clustering algorithm namely Energy Efficient Trustworthy Clustering algorithm (EETCA), which focuses on three phases such as chief node election, chief node recycling process and bi-level trust computation. The chief node election is achieved by Dempster-Shafer theory based on trust. In the second phase, the selected chief node is recycled with respect to the current available energy. The final phase is concerned with the computation of bi-level trust, which is triggered for every time interval. This is to check the trustworthiness of the participating nodes. The nodes below the fixed trust threshold are blocked, so as to ensure trustworthiness. The system consumes lesser energy, as all the nodes behave normally and unwanted energy consumption is completely weeded out. The experimental results of EETCA are satisfactory in terms of reduced energy consumption and prolonged lifetime of the network.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2021년도 추계학술대회
• /
• pp.461-463
• /
• 2021

최근 네트워크 확장 및 클라우드 인프라 확장, 재택근무로 인한 원격접속의 증가로 외부의 접근뿐만이 아니라 내부에서의 접근을 경계해야 할 필요성이 증가하고 있다. 이로 인해 제로 트러스트라는 새로운 네트워크 보안 모델이 주목받고 있다. 본 논문에서는 제로 트러스트의 개념을 간단히 소개하고 다양한 기업환경에 따른 제로 트러스트 적용 전략에 대해 살펴보고자 한다.