• International Journal of CAD/CAM
• /
• v.5 no.1
• /
• pp.1-10
• /
• 2005

A new approach based on vector field clustering for tool path optimization of 5-axis CNC machining is presented in this paper. The strategy of the approach is to produce an efficient tool path with respect to the optimal cutting direction vector field. The optimal cutting direction maximizes the machining strip width. We use the normalized cut clustering technique to partition the vector field into clusters. The spiral and the zigzag patterns are then applied to generate tool path on the clusters. The iso-scallop method is used for calculating the tool path. Finally, our numerical examples and real cutting experiment show that the tool path generated by the proposed method is more efficient than the tool path generated by the traditional iso-parametric method.

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

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of the Korean Mathematical Society
• /
• v.42 no.4
• /
• pp.847-856
• /
• 2005

M. Junger, G. Reinelt, and W. R. Pulleyblank asked the following questions ([2]). (1) Is it true that every simple planar 2-edge connected bipartite graph has a 3-partition in which each component consists of the edge set of a simple path? (2) Does every simple planar 2-edge connected graph have a 3-partition in which every component consists of the edge set of simple paths and triangles? The purpose of this paper is to provide a positive answer to the second question for simple outerplanar 2-vertex connected graphs and a positive answer to the first question for simple planar 2-edge connected bipartite graphs one set of whose bipartition has at most 4 vertices.

• Computers and Concrete
• /
• v.4 no.1
• /
• pp.67-82
• /
• 2007

The discrete crack-concept is applied to study the 3D propagation of tensile-dominated failure in plain concrete. To this end the Partition of Unity Finite Element Method (PUFEM) is utilized and the strong discontinuity approach is followed. A consistent linearized implementation of the PUFEM is combined with a predictor-corrector algorithm to track the crack path, which leads to a robust numerical description of concrete cracking. The proposed concept is applied to study concrete failure during the PCT3D test and the predicted numerical results are compared to experimental data. The proposed numerical concept provides a clear interface for constitutive models and allows an investigation of their impact on concrete cracking under 3D conditions, which is of significant scientific interests to interpret results from 3D experiments.

• Fire Science and Engineering
• /
• v.30 no.6
• /
• pp.71-77
• /
• 2016

The electrolyte of the capacitor in mobile phone chargers leaks to the power input terminal resulting in tracking on the PCB board to form a carbonized conductive path. As a result of structural analysis of the cause of the tracking, It occurred when the power input terminal and the PCB board were connected directly using the connector. The larger the amount of electrolyte leaked from the capacitor into the power input terminal, or the lower the height of the partition provided between the plug pins of the power input terminal, the higher the tracking occurrence rate. Accordingly, to lower the occurrence rate of tracking in the charger, it is necessary to provide a partition on the capacitor or increase the height of the partition provided on the power input terminal so that the leaked electrolyte does not flow to the power input terminal. In addition, the tracking occurrence rate will be reduced further if the shape of the PCB board touching ther power connection terminal is changed to ${\Pi}$.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.601-605
• /
• 1991

In this paper an approximate solution method for the large-scale Traveling Salesman Problem(TSP) is presented. The method start with the subdivision of the problem domain into a number of clusters by considering their geometries. The clusters have limited number of nodes so as to get local solutions. They are linked to give the least path which covers the whole domain and become TSPs with start- and end-node. The approximate local solutions in each cluster are obtained by using geometrical property of the cluster, and combined to give an overall-approximate solution for the large-scale TSP.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1999.04a
• /
• pp.122-126
• /
• 1999

시스템 레벨 PCB(Printed Circuit Board) 디자인은 최종적인 시스템 특성에 정확한 정보를 갖지 못하는 디자인 결정을 하기 위해 여러 가지 정보가 필요하다. 또한 분할 할 때 분할 시간과 방법은 매우 중요하고 합성 결과의 특성은 교환(tradeoffs)과 디자인 결정에 매우 민감하다. 그러므로 만일 디자인이 합성되고 단일 보드로 디자인된다 할지라도 후에 다중 보드로 분할 될 수 있다. 따라서 본 논문에서는 PCB회로 디자인의 제약구동 방법중 off-critical-path 분할기법을 사용한 휴리스틱(heuristic) 방법을 제안했고 교환 그래프 착색 알고리즘을 제안했다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.12B
• /
• pp.1066-1080
• /
• 2003

In this paper a scalable QoS routing scheme for distributed multimedia applications in a hierarchical wide area network is proposed. The problem of QoS routing is formulated as a multicriteria shortest path problem, known as NP-complete. The proposed hierarchical routing scheme consists of two phases. In Phase 1, every border node periodically pre-computes the QoS distance for the paths between every pair of border nodes in any level of domain hierarchy. This phase is independet of the QoS request from an application. In Phase II, distributed graph construction algorithm is performed to model the network as a graph by retrieving pre-computed QoS distances. The graph is constructed by the on-demand algorithm and contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. By using retrieval approach rather than advertising one, no global QoS state information exchange among nodes is needed. In this Phase, distributed partition algorithm for QoS routing problem is also performed, thus eliminating virtual links on the hierarchically complete path.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.287-299
• /
• 2000

In this paper, we classify multicast methods into three categories, i.e., tree-based, path-based, and hybrid-based multicasts, for a multicomputer employing the bidirectional torus network and wormhole routing. We propose the dynamic partition multicast routing (DPMR) as a path-based algorithm. As a hybrid-based algorithm, we suggest the hybrid multicast routing (HMR), which employs the tree-based approach in the first phase of routing and the path-based approach in the second phase. Performance is measured in terms of the average latency for various message length to compare three multicast routing algorithms. We also compare the performance of wormhole routing having variable buffer size with virtual cut-through switching. The message latency for each switching method is compared using the DPMR algorithm to evaluate the buffer size trade-off on the performance.