• The KIPS Transactions:PartA
• /
• v.17A no.5
• /
• pp.213-220
• /
• 2010

In this paper, a mechanism connecting all input edges with minimum length through Steiner tree is proposed. Edges are convertible into communication lines, roads, railroads or trace of moving object. Proposed mechanism could be applied to connect these edges with minimum cost. In our experiments where input edge number and maximum connections per edge are used as input parameters, our mechanism made connection length decrease average 6.8%, while building time for a connecting solution increase average 192.0% comparing with the method using minimum spanning tree. The result shows our mechanism might be well applied to the applications where connecting cost is more important than building time for a connecting solution.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.1
• /
• pp.61-71
• /
• 2003

Interconnect test for highly integrated environments like SoC, becomes more important as the complexity of a circuit increases. This importance is from two facts, test time and complete diagnosis. Since the interconnect test between IPs is based on the scan technology such as IEEE1149.1 and IEEE P1500, it takes long test time to apply test vectors serially through a long scan chain. Complete diagnosis is another important issue because a defect on interconnects are shown as a defect on a chip. But generally, interconnect test algorithms that need the short test time can not do complete diagnosis and algorithms that perform complete diagnosis need long test time. A new interconnect test algorithm is developed. The new algorithm can provide a complete diagnosis for all faults with shorter test length compared to the previous algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• The Korean Journal of Applied Statistics
• /
• v.36 no.5
• /
• pp.399-413
• /
• 2023

Recently, monitoring and detecting anomalies in social networks have become an interesting research topic. In this study, we investigate the detection of abnormal changes in a network modeled by the DCSBM (degree corrected stochastic block model), which reflects the propensity of both individuals and communities. To this end, we propose three methods for anomaly detection in the DCSBM networks: One method for monitoring the entire network, and two methods for dividing and monitoring the network in consideration of communities. To compare these anomaly detection methods, we design and perform simulations. The simulation results show that the method for monitoring networks divided by communities has good performance.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.05a
• /
• pp.223-226
• /
• 2008

인터넷 기술의 발달로 인해 온라인상에서도 사회연결망이 나타나고 있다. 블로그 월드는 대표적인 온라인 사회연결망이다. 블로그 월드의 구성원인 블로거는 정보를 생성할 수도 있고, 정보를 얻기 위하여 다른 블로거와 명시적 관계를 맺을 수도 있으며, 이러한 관계를 통해 온라인 사회연결망인 블로그연결망을 구성한다. 사회 연결망 이론에서는 사회 연결망에서 정보의 파급이 구성원간의 관계를 통하여 이루어진다고 한다. 그러나 블로그 연결망과 실제 블로그 월드에서 발생한 정보 파급 이력을 비교 관찰해 보면, 사회연결망 이론과 달리 관계가 존재하지 않는 구성원 사이에서 정보 파급이 일어난다. 또한, 정보의 파급이 폭발적으로 일어나는 현상도 존재한다. 본 논문에서는 이러한 두 현상이 서로 연관이 있음을 밝히고, 이러한 현상을 일으키는 원인을 규명하는 분석방법을 제안한다. 제안하는 분석방법은 다음과 같다. 우선, 관계가 존재하지 않는 구성원 간에 정보 파급 현상을 유발할 수 있는 후보원인들을 모두 도출한다. 다음으로, 폭발적인 정보 파급 현상을 보이는 정보의 집단을 데이터 마이닝의 클러스터링 기술을 이용하여 도출한다. 도출된 정보의 집단과 후보 원인간의 상관관계를 데이터 마이닝의 특성분석 방법을 이용하여 구한다. 블로그 월드는 구성원과 그 사이의 관계, 정보 파급 이력에 대한 데이터를 모두 저장하고 있다. 본 논문은 실제 블로그 월드의 데이터를 이용하여 블로그 월드에서 정보의 폭발적 파급을 유발하는 원인들을 규명하고 그 원인들이 가지는 특징을 설명하였다.

• Journal of the Korea institute for structural maintenance and inspection
• /
• v.12 no.5
• /
• pp.152-160
• /
• 2008

Since wall system apartment used the shear wall as main lateral resistance member, installation of openings which causing section loss of walls may cause significant problem to structure. Also, there are few studies for inducing coupling beam or slabs which are occurred by installing openings. Therefore, this study planned isolated 2-story shear walls which are reduced three half-scale specimen to find out walls behavior characteristic. The test results showed that strength reduction caused by loss of effective section of walls and different result of stiffness and energy dissipation regarding to the coupling beam and coupling slabs.

• The Journal of Korean Association of Computer Education
• /
• v.17 no.2
• /
• pp.115-124
• /
• 2014

Hypercube and star graph are widely known as interconnection network. The embedding of an interconnection network is a mapping of a network G into other network H. The possibility of embedding interconnection network G into H with a low cost, has an advantage of efficient algorithms usage in network H, which was developed in network G. In this paper, we provide an embedding algorithm between HCN and HON. HCN(n,n) can be embedded into HON($C_{n+1},C_{n+1}$) with dilation 3 and HON($C_d,C_d$) can be embedded into HCN(2d-1,2d-1) with dilation O(d). Also, star graph can be embedded to half pancake's value of dilation 11, expansion 1, and average dilation 8. Thus, the result means that various algorithms designed for HCN and Star graph can be efficiently executed on HON and half pancake, respectively.

• The Journal of the Korea Contents Association
• /
• v.20 no.6
• /
• pp.187-196
• /
• 2020

This study attempted to examine the structural characteristics of the social network of nursing units by dividing them into a job-related advice network and a friendship network, and to analyze the relationship between nurse organizational commitment and intent to leave. The subjects were 420 nurses working in 4 hospitals and 30 nursing units. Data were analyzed using UCINET 6.0, SPSS 20.0 and HLM 7.0. In job-related advice networks, degree centrality of head nurse contributed to organizational commitment. Network density contributed to intent to leave. In friendship networks, closeness centrality of head nurses and betweenness centrality of charge nurse contributed to organizational commitment. Density and betweenness centrality of charge nurses contributed to intent to leave. Accordingly, it is necessary to foster good relationships between nurses and to develop various types of strategies for building effective networks.

• The Journal of the Korea Contents Association
• /
• v.9 no.12
• /
• pp.77-85
• /
• 2009

As the multimedia technology has become in popular, many software packages that are for using those multimedia contents have also been developed. Directshow is a media framework which makes the development of such multimedia software simple, quick and regular process. In the Directshow, data are processed through the connections between filters. In general, Filtergraph is utilized to be set as 'Intelligent Connection' for filter connection. However, when we use this 'Intelligent Connection' option, they can show non-expected results or fail to connect with filter's pins together. So in this paper, we propose non-necessary filter cut-off method for connecting only just wanted filters. There are two methods such as inner filter cut-off method and outer filter one. The inner filter cut-off method is good at connection's compatibility and able to quickly connect with each other filter. But in the outer filter cut-off method, filter source is not necessary and connection is exactly done with other filter. In the end, we propose Directshow based filter cut-off model which compose of wanted filter connection and minimize error probability, through mixing up the advantages of two filter cut-off methods.

• Journal of the Korean Geotechnical Society
• /
• v.29 no.10
• /
• pp.5-18
• /
• 2013

The differential settlement between the foundations causes the critical damage on the transmission tower constructed in soft ground. Connected-pile foundation for transmission tower structures is an option to prevent the differential settlement. It consists of main foundations and connection beams that are placed between the individual foundations at each corner of tower. In this study, 24 model pile load tests were conducted at a construction site in jeonlabuk-do to investigate the effects of the connection beams on transmission tower foundation. In model tests, various load conditions and connection beam conditions were considered. As the test results, the displacements of connected-pile foundation differed in accordance with load directions. The settlements of connected-pile foundation decreased with the increased stiffness of connection beams, lateral load capacity decreased in accordance with load height, and the lateral load capacity on the failure criteria was similar regardless of load direction.