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

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.691-694
• /
• 2000

기존 LAN 환경에서 인터넷을 이용한 멀티미디어 실시간 전송과 같은 QoS 보장형 서비스에 대한 요구가 증대되면서, 고속의 ATM 기술을 LAN에 적용하는 기술들이 등장하였다. LANE(LAN Emulation)은 그러한 기술 대안들 중에서 campus network와 enterprise network에 많이 보급되고 있는 기술이다. 그러나 이러한 급격한 LANE 도입에 비하여 이의 효과적인 운용에 대한 연구는 많지 않은 실정이다. 본 논문에서는 LANE을 도입한 campus network의 최적 운영방안에 대하여 논한다. Broadcast 데이터 트래픽 관리에서 발생하는 규모성(Scalability) 문제로 인하여 전체 LANE망은 여러 개의 ELAN으로 나뉘어 관리된다. 이 때 하나의 ELAN은 마치 단위 LAN로써, Broadcast 데이터의 전송범위를 제한한다. 즉, 서로 다른 ELAN에 속하는 노드간에는 Broadcast 방식으로 데이터를 전송할 수 없게 된다. 그런데, IPX 등을 사용하는 대화형 시뮬레이션 게임 등과 같은 응용프로그램에서는 Broadcast 방식이 이용되므로, 서로 다른 ELAN에 속하는 노드간의 데이터 전송은 불가능하게 되거나 별도의 복잡한 과정을 개입시켜야 하는 비용이 발생한다. 따라서 규모성 문제해결을 위한 ELAN 구성(configuration)에는 위와 같은 비용이 수반된다. 본 연구에서는 LANE망을 여러 개의 ELAN으로 분할하는 경우에 블로킹(blocking) 되는 Broadcast 트래픽 규모를 해당 ELAN 구성의 비용으로 간주한다. 이 경우에 규모성을 고려한 ELAN의 최적 구현방안(optimal configuration)은 ELAN 구성을 위한 기술적 제약하에서 블로킹되는 Broadcast 트래픽을 최소화시키는 문제로 요약된다. 이는 다시 그래프 분할문제(graph partition problem)의 변형된 형태로 모형화 될 수 있다. 본 논문에서는 이러한 사항들을 고려하여 제시된 수리적 모형을 대상으로, genetic algorithm을 이용하여 최적 ELAN 구성을 위한 여러 파라미터들의 효과를 살펴보고, 이러한 결과들이 LANE 운영과 관련하여 가지는 함축적인 의미를 고찰한다.

• Journal of Digital Contents Society
• /
• v.14 no.1
• /
• pp.1-5
• /
• 2013

In this paper a study of efficient CPLD low power algorithm is proposed. Proposed algorithm applicate graph partition method using DAG. Circuit representation DAG. Each nodes set up cost. The feasible cluster create according to components of CPLD. Created feasible cluster generate power consumption consider the number of OR-term, the number of input and the number of output. Implement a circuit as select FC having the minimum power consumption. Compared with experiment [9], and power consumption was decreased. The proposed algorithm is efficient. this paper, we proposed FPGA algorithm for consider the power consumption.

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.87-98
• /
• 2008

In company with the demand of powerful processing units for embedded systems, the method to develop embedded software is also required to support the demand in new approach. In order to improve the resource utilization and system performance, software modeling techniques have to consider the features of hardware architecture. This paper proposes a partitioning technique of UML-based software models, which focus the generation of the allocatable software components into multiprocessor architecture. Our partitioning technique, at first, transforms UML models to CBCFGs(Constraint-Based Control Flow Graphs), and then slices the CBCFGs with consideration of parallelism and data dependency. We believe that our proposition gives practical applicability in the areas of platform specific modeling and performance estimation in model-driven embedded software development.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.253-259
• /
• 2019

The wedding seating problem(WSP) is to finding a minimum loss of guest relations(sit together preference) with restricted seats of a table for complex guest relation network. The WSP is NP-hard because of the algorithm that can be find the optimal solution within polynomial-time is unknown yet. Therefore we can't solve the WSP not computer-assisted programming but by hand. This paper suggests min-cut rule theory that the two guests with maximum preference can't separate in other two tables because this is not obtains minimum loss of preference. As a result of various experimental, this algorithm obtains proper seating chart meet to the seats of a table constraints.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.147-147
• /
• 2021

A partition of water distribution network (WDN) into district metered areas (DMAs) brings the efficiency and efficacy for water network operation and management (O&M), especially in monitoring pressure and leakage. Traditionally, the DMA configurations (i.e., number, shape, and size of DMAs) are permanent and cannot be changed occasionally. This leads to changes in water quality and reduced network redundancy lowering network resilience against abnormal conditions such as water demand variability and mechanical failures. This study proposes a framework to automatically divide a WDN into dynamic DMA configurations, in which the DMA layouts can self-adapt in response to abnormal scenarios. To that aim, a complex graph theory is adopted to sectorize a WDN into multiscale DMA layouts. Then, different failure-based scenarios are investigated on the existing DMA layouts. Here, an optimization-based model is proposed to convert existing DMA layouts into dynamic layouts by considering existing valves and possibly placing new valves. The objective is to minimize the alteration of flow paths (i.e., flow direction and velocity in the pipes) while preserving the hydraulic performance of the network. The proposed method is tested on a real complex WDN for demonstration and validation of the approach.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.2
• /
• pp.16-27
• /
• 2011

Embryo is a very early stage of the development of multicellular organism such as animals and plants. It is an important research target for studying ontogeny because the fundamental body system of multicellular organism is determined during an embryo state. Researchers in the developmental biology have a large volume of embryo image databases for studying embryos and they frequently search for an embryo image efficiently from those databases. Thus, it is crucial to organize databases for their efficient search. Hierarchical clustering methods have been widely used for database organization. However, most of previous algorithms tend to produce a highly skewed tree as a result of clustering because they do not simultaneously consider both the size of a cluster and the number of objects within the cluster. The skewed tree requires much time to be traversed in users' search process. In this paper, we propose a method that effectively organizes a large volume of embryo image data in a balanced tree structure. We first represent embryo image data as a similarity-based graph. Next, we identify clusters by performing a graph partitioning algorithm repeatedly. We check constantly the size of a cluster and the number of objects, and partition clusters whose size is too large or whose number of objects is too high, which prevents clusters from growing too large or having too many objects. We show the superiority of the proposed method by extensive experiments. Moreover, we implement the visualization tool to help users quickly and easily navigate the embryo image database.

• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1126-1135
• /
• 2014

In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.2
• /
• pp.147-157
• /
• 2017

In recent years, Super-pixels have become very popular for use in computer vision applications. Super-pixel algorithm transforms pixels into perceptually feasible regions to reduce stiff features of grid pixel. In particular, super-pixels are useful to depth estimation, skeleton works, body labeling, and feature localization, etc. But, it is not easy to generate a good super-pixel partition for doing these tasks. Especially, super-pixels do not satisfy more meaningful features in view of the gestalt aspects such as non-sum, continuation, closure, perceptual constancy. In this paper, we suggest an advanced algorithm which combines simple linear iterative clustering with fuzzy clustering concepts. Simple linear iterative clustering technique has high adherence to image boundaries, speed, memory efficient than conventional methods. But, it does not suggest good compact and regular property to the super-pixel shapes in context of gestalt aspects. Fuzzy similarity measures provide a reasonable graph in view of bounded size and few neighbors. Thus, more compact and regular pixels are obtained, and can extract locally relevant features. Simulation shows that fuzzy similarity based super-pixel building represents natural features as the manner in which humans decompose images.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.84-86
• /
• 2008

The customer relation marketing in which companies can utilize to control and to get the filtered information efficiently has appeared. It is applying data mining to build the management that can even predict and recommend products to customers. In this paper, we proposed the adaptive customer relation management strategies using the association rules of data mining. The proposed method uses the association rules composes frequent customers with occurrence of candidate customer set creates the rules of associative customers. We analyzed the efficient feature of purchase customers using the hyper graph partition according to the lift of creative association rules. Therefore, we discovered strategies of the cross-selling and the up-selling about customers.