• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.10a
• /
• pp.27-37
• /
• 2005

The rectilinear Steiner tree problem (RSTP) is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. The RSTP is known to be NP-complete. The RSTP has received a lot of attention in the literature and heuristic and optimal algorithms have been proposed, A key performance measure of the algorithm for the RSTP is the reduction rate that is achieved by the difference between the objective value of the RSTP and that of the MST without Steiner points. A hybrid evolution strategy on RSTP based upon the Prim algorithm was presented. The computational results show that the evolution strategy is better than the previously proposed other heuristic. The average reduction rate of solutions from the evolution strategy is about 11%, which is almost similar to that of optimal solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.589-598
• /
• 2006

The rectilinear Steiner tree problem is to find a minimum-length rectilinear interconnection of a set of terminals in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set Steiner points. A hybrid evolutionary algorithm is introduced based upon the Prim algorithm. The Prim algorithm for the fitness evaluation requires heavy calculation time. The fitness value of parents is inherited to their child and the fitness value of child is estimated by the inherited structure of tree. We introduce four alternative evolutionary algorithms, Experiment result shows that the calculation time is reduced to 25% without loosing the solution quality by using the fitness estimation.

• Journal of the Korean Mathematical Society
• /
• v.43 no.2
• /
• pp.373-382
• /
• 2006

In this paper, we prove that the topological entropy of a sequence of equi-continuous monotone maps $f_{1,\infty}={f_i}\;\infty\limits_{i=1}$on circles is $h(f_{1,\infty})={\frac{lim\;sup}{n{\rightarrow}\infty}}\;\frac 1 n \;log\;{\prod}\limits_{i=1}^n|deg\;f_i|$. As applications, we give the estimation of the entropies for some skew products on annular and torus. We also show that a diffeomorphism f on a smooth 2-dimensional closed manifold and its extension on the unit tangent bundle have the same entropy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.1056-1064
• /
• 2003

The Euclidean steiner tree problem (ESTP) is to find a minimum-length euclidean interconnection of a set of points in the plane. It is well known that the solution to this problem will be the minimal spanning tree (MST) on some set steiner points, and the ESTP is NP-complete. The ESTP has received a lot of attention in the literature, and heuristic and optimal algorithms have been proposed. In real field, heuristic algorithms for ESTP are popular. A key performance measure of the algorithm for the ESTP is the reduction rate that is achieved by the difference between the objective value of the ESTP and that of the MST without steiner points. In recent survey for ESTP, the best heuristic algorithm showed around $3.14\%$ reduction in the performance measure. We present a evolution programming (EP) for ESTP based upon the Prim algorithm for the MST problem. The computational results show that the EP can generate better results than already known heuristic algorithms.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.435-440
• /
• 2006

Let G be a simple graph with vertex set V(G) and edge set E(G). A subset S of E(G) is called an edge cover of G if the subgraph induced by S is a spanning subgraph of G. The maximum number of edge covers which form a partition of E(G) is called edge covering chromatic number of G, denoted by X'c(G). It is known that for any graph G with minimum degree ${\delta},\;{\delta}-1{\le}X'c(G){\le}{\delta}$. If $X'c(G) ={\delta}$, then G is called a graph of CI class, otherwise G is called a graph of CII class. It is easy to prove that the problem of deciding whether a given graph is of CI class or CII class is NP-complete. In this paper, we consider the classification of nearly bipartite graph and give some sufficient conditions for a nearly bipartite graph to be of CI class.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.4
• /
• pp.1033-1043
• /
• 1998

In this paper, we present an improved multicasting path assignment algorithm based on the minimum cost spanning tree. In the method presented in this paper, a multicasting path is assigned preferentially when a node to be received is found among the next degree nodes of the searching node in the multicasting path assignment of the constrained steiner tree (CST). If nodes of the legacy group exist between nodes of the new group, a new path among the nodes of new group is assigned as long as the nodes may be excluded from the new multicasting path assignment taking into consideration characteristics of nodes in the legacy group. In assigning the multicasting path additionally, where the source and destination nodes which can be set for the new multicasting path exist in the domain of identical network (local area network) and conditions for degree constraint are satisfied, a method of producing and assigning a new multicasting path is used. The results of comparison of CST with MCSTOP, MCSTOp algorithm enhanced performance capabilities about the communication cost, the propagation delay, and the computation time for the multicasting assignment paths more than CST algorithm. Further to this, research activities need study for the application of the international standard protocol(multicasting path assignment technology in the multipoint communication service (MCS) of the ITU-T T.120).

• Asian-Australasian Journal of Animal Sciences
• /
• v.21 no.5
• /
• pp.617-623
• /
• 2008

A fine-mapping method exploiting linkage disequilibrium was used to detect quantitative trait loci (QTL) on the X chromosome affecting milk production, body conformation and productivity traits. The pedigree comprised 22 paternal half-sib families of Black-and-White Holstein bulls in the Netherlands in a grand-daughter design for a total of 955 sons. Twenty-five microsatellite markers were genotyped to construct a linkage map on the chromosome X spanning 170 Haldane cM with an average inter-marker distance of 7.1 cM. A covariance matrix including elements about identical-by-descent probabilities between haplotypes regarding QTL allele effects was incorporated into the animal model, and a restricted maximum-likelihood method was applied for the presence of QTL using the LDVCM program. Significance thresholds were obtained by permuting haplotypes to phenotypes and by using a false discovery rate procedure. Seven QTL responsible for conformation types (teat length, rump width, rear leg set, angularity and fore udder attachment), behavior (temperament) and a mixture of production and health (durable prestation) were detected at the suggestive level. Some QTL affecting teat length, rump width, durable prestation and rear leg set had small numbers of haplotype clusters, which may indicate good classification of alleles for causal genes or markers that are tightly associated with the causal mutation. However, higher maker density is required to better refine the QTL position and to better characterize functionally distinct haplotypes which will provide information to find causal genes for the traits.

• 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.

• 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.