• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.474-480
• /
• 2011

Most social networks have power-law distribution that is one of distinct properties in scale-free network. In contrast to social network character, people networks of the Goguryeo, Baekje, and Silla show dissemination network that is a narrow and deep-reaching style of information transmission. However, people network of three kingdoms that is integrated each national people reveals scale-free and hierarchical properties. Pattern of territory expansion and abridgment in Silla is distinct from those in Goguryeo and Baekje, indicating that the distinct pattern reflects a power for unification. Several patterns in national management and national development of the three kingdoms are also analyzed based on network. Our results provide new insight that is analyzed by network-based approaches but is not analyzed by historial approaches in history of three kingdoms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.668-671
• /
• 2015

이 논문은 대한민국의 주식시장에 상장한 기업의 지배구조 분석을 위해 대주주가 어떠한 형태로 주식을 보유하고 있는지에 대한 네트워크 분석이다. 분석대상은 주식시장에 상장한 기업과 그 기업의 주식의 대주주 데이터를 모두 수집하였다. 이를 기업과 대주주 행위자 간에 주식을 보유하고 있는 네트워크를 분석하여 그 보유형태의 의미를 파악하였다. 분석결과 네트워크 형태는 크게 '전체분석, 산업분석, 군집분석, 상장기업분석, 대주주분석, 계열사 분석' 여섯 가지이다. 네트워크 분석결과 주식시장은 전형적인 척도 없는 네트워크 형태를 나타내었으며 반면 그룹간의 계열사 네트워크는 전형적인 계층구조로써 좁은 세상 네트워크의 사례를 나타내었다. 따라서 투자 성향이 갖거나 대주주 간의 이해관계가 있거나 투자상품들이 포트폴리오로 조합원 경우 대주주 간의 네트워크가 밀집된 것을 확인할 수 있었다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.202-213
• /
• 2007

A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.476-484
• /
• 2012

Family member network of kings in Chosun dynasty shows scale free network properties as if most social networks do. One of distinct topological properties of the network is relatively high diameter that reflects dataset composed of the one generation continuously falling to next one. When k-core algorithm as a useful tool for obtaining a core network from the complex family member network was employed, it is possible to obtain hidden and valuable information from a complex network. Unfortunately, it is found that k-core algorithm is not useful tool for applying narrow and deep structural network. The family member network is composed of kings, queens, princes, and princesses. It is possible to separate sub-family members and to construct sub-family member networks such as queen-centered, prince-centered, and princess-centered networks. Sub-family member networks provide an useful and hidden information. These results provide new insight that is analyzed by network-based approaches for the family member of the kings in the Chosun dynasty.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.325-327
• /
• 2004

'생물정보학'이란 생물학적 데이터를 처리, 가공하여 정보를 얻어내는 연구 분야로 이 중 대사체학은 대사 경로 네트워크를 가시화하여 생명 활동을 이해하고자 하는 분야로, 대사 경로 내의 흐름을 한 눈에 알 수 있도록 가시화하여 보여 주는 도구가 반드시 필요하다 따라서 본 논문에서는 새로운 '대사 경로 드로잉 알고리즘'을 제안하였다. 대사 경로 그래프의 구조로는 이분 그래프를 이용하여 가독성을 높였으며. 이 그래프가 척도 없는(scale-free) 네트워크 구조라는 것과 구조적으로 환형, 계층적 선형 컴포넌트를 가진다는 것을 고려하여 사이즈가 큰 그래프도 적절하게 드로잉 하도록 하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.607-608
• /
• 2013

무선 애드훅 네트워크에서는 무선링크의 성능을 표현하는 다양한 품질 척도가 있다. 그것은 노드가 움직임이 없는 상태에서 주변 무선 상태를 반영한다. 하지만 해상 환경에서는 선박의 이동성 뿐만 아니라 바람과 파고에 의해 선박이 움직이는 특성이 있다. 따라서 선박에 위치한 안테나의 흔들림을 유발하여 신호의 수신을 불안정하게 만든다. 본 논문은 선체운동에 따른 무선 링크 성능을 분석한다. 이를 위해 자이로 센서를 이용하여 서로 다른 해상 환경에서 선체운동을 측정 및 분석하고, 하드웨어 및 소프트웨어에 의한 무선 링크 안정화 방안을 제시한다.

• The Journal of the Korea Contents Association
• /
• v.16 no.9
• /
• pp.127-135
• /
• 2016

We identified a competition network which has never been studied before and investigated the relationship between centrality of participants in singing competition and their winning percentage within the competition network. We collected competition data from 'Immortal Songs: Singing the Legend', which is a Korean television music competition program, and constructed a competition network. We calculated centrality and winning percentage and analyzed their relationship using correlation analysis, regression analysis, and visualization. There are four main findings in this research. First, a competition network is a scale-free network whose degree distribution follows a power law. Second, there is a logarithmic relationship between the count of competition and closeness. Third, winning percentage converges to approximately 60% for players who have participated in more than 20 competitions. Lastly, a strength of opponents affects approximately 23% of winning percentage for players with less than 20 competitions. The academic significance of this study is that we pioneered the definition of the competition network and applied social network analysis method. Another significant contribution of this paper is that we found explicit patterns between the centrality and winning percentage, suggesting ways to improve social relationship in competition network and to increase winning percentage.

• Korean Journal of Construction Engineering and Management
• /
• v.10 no.4
• /
• pp.151-164
• /
• 2009

Strategic alliances developed as formalized inter-organizational relationships are core vehicles to share information, resources and knowledge. The structural characteristics of strategic network constructed by strategic alliances have been important agenda in strategic management discipline. This paper has two folds in analysing the strategic network formulated by project level alliances in Korean construction industry. First, we investigate the strategic network using the tools and methods of social network analysis, such as centrality, cohesion, structural equivalence, and power law. Second, the performance of firms within networks are analysed longitudinally with panel data analysis. We have found that the strategic networks in this industry has scale-free characteristics, where the degree distribution fits the power law, and the vertically equivalent structure is clear. We also present that the performance of firms are continuously affected by the degree centrality of firms in this network for the last 10 years.

• The Journal of the Korea Contents Association
• /
• v.15 no.5
• /
• pp.582-591
• /
• 2015

Late-Koryeo people networks were constructed from four different history books that were written by various historic aspects in the period from king Kongmin to the final king of the Koryeo, Kongyang. All networks constructed in this study show scale free network properties as if most social networks do. Tajo-sillok preface is one of subjectively written history book that described personal history of the Lee Seong-gye and his ancestors. It is confirmed that the book is one of the most biased-written history books through network study. Jeong Do-jeon known as a Chosun dynasty projector is not greatly contributed for founding of a Chosun dynasty in network study and various historical documents as well. In this network study, we provide objective historical information in the historical situations of the late-Koryeo and during establishment procedure of Chosun dynasty. Hub nodes in network is denoted highly linked nodes, called degree. Stress centrality is a unit to measure positional importancy in the network. If we employ two factors, degree and stress centrality to determine hub node, it represents high connectivity and importancy as well. As comparing values of the degree and stress centrality, we elucidate more objective historical facts from late-Koryeo situations in this study. If we further develop and employ a new algorithm that is considered both degree and stress centrality, it is a very useful tool for determining hub node.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.07b
• /
• pp.250-252
• /
• 2005

기존의 레이아웃 알고리즘은 경로의 가독성과 속도 등에 주안점을 두어 개발되었다. 따라서 이러한 시스템의 경우 노드수가 증가할수록 에지 크로싱이 기하급수적으로 증가하는 문제가 있는데, genome scale에서의 대사 경로를 연구하기 위해서는 대사 경로 그래프 레이아웃 상에 나타나는 에지 크로싱을 줄이는 것이 시각화의 매우 중요한 부분이다. 대사 경로는 효소에 의한 화합물 간의 변화를 보여주는 네트워크로서, 대부분 척도 없는 네트워크 구조를 갖는다는 것이 알려져 있다. 이러한 대사 경로의 구조적 특징을 고려하여 에지 크로싱을 최소화하는 대사 경로 레이아웃 방법을 제안하고, 그 결과 노드수의 증가에 따른 에지 크로싱의 급격한 증가현상이 $37\~40\%$의 감소된 결과를 나타냈으며, 노드수가 증가하더라도 에지 크로싱이 오히려 감소하는 경우도 관찰되었다.