• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.11
• /
• pp.2477-2487
• /
• 1997

In this paepr, we propose a dynamic multicast routin algorithm for constructing the delay-constrained minimal spanning tree in the VP-based ATM networks, in which we consider the effiiciency enen in the case wheree the destination dynamically joins/departs the multicast connection. For constructing the delay-constrained spanning tree, we frist generate a reduced network consisting of only VCX nodes from a given ATM network, originally consisting of VPX/VCX nodes. Then, we obtain the delay-constrained spanning tree with a minimal tree cost on the reduced network by using our proposed heuristic algorithm. Through numerical examples, we show that our dynamic multicast routing algorithm can provide an efficient usage of network resources when the membership nodes frequently changes during the lifetime of a multicast connection. We also demonstrate the more cost-saving can be expected in dense networks when applyingour proposed algorithm.

• Journal of the Economic Geographical Society of Korea
• /
• v.17 no.2
• /
• pp.280-295
• /
• 2014

This paper analyzes the topological structure of housing market networks with an application of minimal spanning tree method into apartment sales markets in the Capital Region over the period 2003.7-2014.3. The characteristics of topological network structure gained from this application to some extent share with those found in equity markets, although there are some differences in their intensities and degrees, involving a hierarchical structure in networks, an existence of communities or modules in networks, a contagious diffusion of log-return rate across nodes over time, an existence of correlation breakdown due to the time-dependent structure of networks and so on. These findings could be partially attributed to the facts that apartments as a quasi-financial asset have been strongly overwhelmed by speculative motives over the period investigated and they can be regarded as a housing commodity with the highest level of liquidity in Korea.

• The Korean Journal of Applied Statistics
• /
• v.22 no.2
• /
• pp.415-424
• /
• 2009

As one of the unsupervised learning neural network methods, self-organizing maps(SOM) are applied to various fields. It reduces the dimension of multidimensional data by representing observations on the low dimensional manifold. On the other hand, the minimal spanning tree(MST) of a graph that achieves the most economic subset of edges connecting all components by a single open loop. In this study, we apply the MST technique to SOM with subnodes. We propose SOM's with embedded MST and a distance measure for optimum choice of the size and shape of the map. We demonstrate the method with Fisher's Iris data and a real gene expression data. Simulated data sets are also analyzed to check the validity of the proposed method.

• Journal of Communications and Networks
• /
• v.11 no.5
• /
• pp.500-508
• /
• 2009

We have designed an algorithm for a problem in multicast communication. The problem is to construct a multicast tree while minimizing its cost, which is known to be NP-complete. Our algorithm, which employs new concepts defined as potential cost and spanning cost, generates a multicast tree more efficiently than the well-known heuristic called Takahashi and Matsuyama (TM) [1] in terms of tree cost. The time complexity of our algorithm is O($kn^2$) for an n-node network with k members in the multicast group and is comparable to the TM. Our empirical performance evaluation comparing the proposed algorithm with TM shows that the enhancement is up to 1.25%~4.23% for each best case.

• The Plant Pathology Journal
• /
• v.38 no.5
• /
• pp.541-549
• /
• 2022

Potato late blight caused by Phytophthora infestans is a destructive disease in Korea. To elucidate the genomic variation of the mitochondrial (mt) genome, we assembled its complete mt genome and compared its sequence among different haplotypes. The mt genome sequences of four Korean P. infestans isolates were revealed by Illumina HiSeq. The size of the circular mt genome of the four major genotypes, KR_1_A1, KR_2_A2, SIB-1, and US-11, was 39,872, 39,836, 39,872, and 39,840 bp, respectively. All genotypes contained the same 61 genes in the same order, comprising two RNA-encoding genes, 16 ribosomal genes, 25 transfer RNA, 17 genes encoding electron transport and ATP synthesis, 11 open reading frames of unknown function, and one protein import-related gene, tatC. The coding region comprised 91% of the genome, and GC content was 22.3%. The haplotypes were further analyzed based on sequence polymorphism at two hypervariable regions (HVRi), carrying a 2 kb insertion/deletion sequence, and HVRii, carrying 36 bp variable number tandem repeats (VNTRs). All four genotypes carried the 2 kb insertion/deletion sequence in HVRi, whereas HVRii had two VNTRs in KR_1_A1 and SIB-1 but three VNTRs in US-11 and KR_2_A2. Minimal spanning network and phylogenetic analysis based on 5,814 bp of mtDNA sequences from five loci, KR_1_A1 and SIB-1 were classified as IIa-6 haplotype, and isolates KR_1_A2 and US-11 as haplotypes IIa-5 and IIb-2, respectively. mtDNA sequences of KR_1_A1 and SIB-1 shared 100% sequence identity, and both were 99.9% similar to those of KR_2_A2 and US-11.