• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.436-439
• /
• 2010

본 논문에서는 Ubiquitous Computing 환경 하에서 이종 시스템 간의 통합을 위한 데이터 관리 기법 모델을 제안하였다. 이종 시스템 간의 통합이 이루어지면 방대한 양의 데이터를 모든 시스템이 공유해야 하기 때문에 무분별한 데이터의 중복과 저장으로 인해 프로세스의 데이터 처리 성능 및 데이터 무결성을 보장받지 못 하는 등의 문제점이 발생한다. 이를 보완하기 위해 Minimal cost Spanning tree의 원리를 적용하여 시스템 통합에 따른 데이터 처리 및 무결성 문제 해결을 위한 메커니즘을 제시하고자 한다.

• Food Science and Biotechnology
• /
• v.27 no.6
• /
• pp.1755-1760
• /
• 2018

The objective of this study was to perform genetic diversity analysis of 13 strains isolated from South Korean foods by multilocus sequence typing (MLST). For typing, seven housekeeping loci (atpA, dnaA, dnaK, gyrB, pheS, pyrG, and rpoA) were selected, amplified and analyzed. Fifty-one polymorphic sites varying from 1 to 22 in each species were identified. Thirteen sequence types were generated with allele numbers ranged from 2 to 10. The overall relationship between strains was assessed by unweighted pair group method with arithmetic mean dendrogram and minimum spanning tree. In addition, combined spits tree analysis revealed intragenic recombination. No clear relationship was observed between the isolation sources and strains. The developed MLST scheme enhanced our knowledge of the population diversity of Leu. citreum strains and will be used further for the selection of industrially important strain.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.9
• /
• pp.46-53
• /
• 2007

The link-fault recovery in the normal Ethernet bridged networks has relied on the Spanning Tree Protocol(STP) or Rapid STP. However, STP can not offer fast error recovery which is needed real-time services such as aircraft. In this paper, we compare automatic protection switching(APS) providing fault-tolerant function in the BcN back bone system with Avionic Full Duplex Switched Ethernet(AFDX) which is recently equipped in the A380 for Airbone Databuses. Also, we propose a link-bypass scheme for improving fault-tolerant performance of the AFDX by connecting switches and bypass fault section when a fault is originated on the link. For comparing and verifying the performance of proposed scheme, we simulated Ethernet, AFDX, APS and proposed AFDX with link-bypass scheme using NS-2. The proposed AFDX with link-bypass scheme can be applied to aircrafts, BcN backbone networks and industrial automatic networks.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.5
• /
• pp.1-7
• /
• 2009

When constructing various mobile networks including sensor networks, the problem of finding the layout or graph to interconnect the terminals or nodes of the network may come up. Providing a common scheme that can be applied to the kind of problems, and formulating the bounds of the run time and the result of the algorithm from the scheme, one may evaluate precisely the plan of constructing analogous network systems. This paper, dealing with EMST(Euclidean Minimum Spanning Tree) that represents such problems, provides the scheme for constructing EMST by parallel processing over distributed environments, and the ground for determining the maximum difference of the layout or the graph produced from the scheme: the difference from EMST. In addition, it provides the upper bound of the run time of the algorithm from the scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1370-1376
• /
• 2000

Consider the problem to updata breadth-First Spanning Tree in response to topology change of the network. The paper proposes an efficient distributed algorithm that solves such a problem after several processors and links are added and deleted. Its message complexity and its ideal-time complexity are O(p√q+q+a+n') respectively, where n' is the number fo processors in the network after the topology change, a is the number of added links, p is the total number of links in the biconnected component (of the network before the topology change) including the detected links or added links, and q is the total number of processors in the biconnected component (of the network before the topology change) including the deleted links or added links, and q is the total number of processors in the biconnected component including the deleted links or added links.

• Journal of KIISE
• /
• v.44 no.11
• /
• pp.1236-1243
• /
• 2017

In this paper, we propose a novel way of producing keyword networks, named LSI-based ClusterTextRank, which extracts significant key words from a set of clusters with a mutual information metric, and constructs an association network using latent semantic indexing (LSI). The proposed method reduces the dimension of documents through LSI, decomposes documents into multiple clusters through k-means clustering, and expresses the words within each cluster as a maximal spanning tree graph. The significant key words are identified by evaluating their mutual information within clusters. Then, the method calculates the similarities between the extracted key words using the term-concept matrix, and the results are represented as a keyword association network. To evaluate the performance of the proposed method, we used travel-related blog data and showed that the proposed method outperforms the existing TextRank algorithm by about 14% in terms of accuracy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.964-972
• /
• 2009

Wireless mesh network (WMN) is emerging a future core technology to resolve many problems derived from exist wireless networks by employing multi-interface and multi-channel. Ability to utilize multiple channels in WMNs substantially increases the effective bandwidth available to wireless network nodes. However, minimum interference channel assignment algorithms are required to use the effective bandwidth in multi-channel environments. This paper proposes a cluster-based minimum interference channel assignment (MI-CA) algorithm to improve the performance of WMN. The MI-CA algorithm is consists of Inter-Cluster and Intra-Cluster Intrchannel assignment between clusters and in the internal clusters, respectively. The Inter-Cluster channel assignment assigns a barebone channel to cluster heads and border nodes based on minimum spanning tree (MST) and the Intra-Cluster channel assignment minimizes channel interference by reassigning ortasgonal channels between cluster mespann. Our simheation results show that MI-CA can improve the performance of WMNs by minimizing channel interference.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.11
• /
• pp.135-143
• /
• 1990

A new over-the-cell routing system is proposed in this paper. The proposed system efficiently reduces not only the channel density but also the routing density in cell region. Generally, the over-the-cell system consists of three phases. Namely, over-the-cell routing, terminal selection and channel routing. In this paper, to select the nets to be routed over the cells, weights are assigned on the intersection graph considering both the channel density and the intersection relations among other nets. When selected nets are blocked by feedthroughs or metal layers for internal logic, they are routed by maze algorithm. Also, in order to reduce channel density, the terminals to be routed in a channel are selected using the minimum weight spanning tree. Channel routing is carried out with a channel router of HAN-LACAD_G. The effectiveness of the over-the-cell routing system is shown by the experiments with benchmark data and its application to the gate array layout system.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.46 no.6
• /
• pp.1-8
• /
• 2009

Detecting entry and exit zones in a view covered by multiple cameras is an essential step to determine the topology of the camera setup, which is critical for achieving and sustaining the accuracy and efficiency of multi-camera surveillance system. In this paper, a graph theoretic clustering method is proposed to detect zones using data points which correspond to entry and exit events of objects in the camera view. The minimum spanning tree (MST) is constructed by associating the data points. Then a set of well-formed clusters is sought by removing inconsistent edges of the MST, based on the concepts of the cluster balance and the cluster density defined in the paper. Experimental results suggest that the proposed method is effective, even for sparsely elongated clusters which could be problematic for expectation-maximization (EM). In addition, comparing to the EM-based approaches, the number of data required to obtain stable outcome is relatively small, hence shorter learning period.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.4
• /
• pp.787-794
• /
• 2018

The various natural disasters such as floods and localized heavy rains are increasing due to the global warming. If a natural disaster can be detected and analyzed in advance and more effectively, it can prevent enormous damage of natural disasters. Recent development in visual sensor technologies has encouraged various studies on monitoring environments including rivers. In this paper, we propose a method to detect water regions from river images which can be exploited for river surveillance systems using video sensor networks. In the proposed method, we first segment a river image finely using the minimum spanning tree algorithm. Then, the seed regions for the river region and the background region are set by using the preliminary information, and each seed region is expanded by merging similar regions to segment the water region from the image. Experimental results show that the proposed method separates the water region from a river image easier and accurately.