• Transactions of Materials Processing
• /
• v.25 no.3
• /
• pp.176-181
• /
• 2016

The exhaust tail pipe is the only visible part of the exhaust system on a vehicle. The conventional way to make the tail pipe is welding after stamping. There are various problems that occur during the stamping of stainless steel sheets such as scratching and local fracture. Problems during welding can also occur due to poor weldability. Tube hydroforming can be a solution, which eliminates these problems. The current study deals with the development of tube hydroforming for a vehicle tail pipe using finite element analysis for a free-feeding method. The current study focuses on the development of a proper load path for the tail pipe hydroforming and how bending influences the subsequent processing steps. The FE analysis results were compared with experimental results. This study shows the importance of bending and the necessity of considering bending when performing a tube hydroforming analysis.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.89-95
• /
• 2002

Global routing is to assign each net to routing regions to accomplish the required interconnections. The most popular algorithms for global routing inlcude maze routing algorithm, line-probe algorithm, shortest path based algorithm, and Steiner tree based algorithm. In this paper we propose weighted network heuristic(WNH) as a minimal Steiner tree search method in a routing graph and a genetic algorithm based on WNH for the global routing. We compare the genetic algorithm(GA) with simulated annealing(SA) by analyzing the results of each implementation.

• Journal of Internet Computing and Services
• /
• v.2 no.4
• /
• pp.11-24
• /
• 2001

XML documents found over internet are generally fairly irregular and hove no fixed schema, The SQL and OQL are not suitable for query processing in XML documents, So, there are many researches about schema extraction and query language for XML documents, We propose a schema extraction method using the frequency of label path in XML documents, Our proposed method produces multi-level schemas and those are useful for query processing.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.1-13
• /
• 1993

In this paper, the problems of the conventional special-purpose array processor such as the deficiency of flexibility have been investigated. Then, a new modified methodology has been suggested and applied to obtain the common solution of the three typical App algorithms like SP(Shortest Path), TC(Transitive Closure), and MST(Minimun Spanning Tree) among the various APP algorithms using the similar method to obtain the solution. In the newly proposed APP parallel algorithm, real-time Processing is possible, without the structure enhancement and the functional restriction. In addition, we design 2-demensional bit-parallel low-triangular systolic array processor and the 1-PE in detail. For its evaluation, we consider its computational complexity according to bit-processing method and describe relationship of total chip size and execution time. Therefore, the proposed processor obtains, on which a large data inputs in real-time, 3n-4 execution time which is optimal o(n) time complexity, o(n$^{2}$) space complexity which is the number of total gate and pipeline period rate is one.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.8
• /
• pp.2152-2162
• /
• 1997

We developed an approach to automatically synthesize time-stationary controllers for a given pipelined data path of Application Specific Integrated Circuits (ASICs). This work consists of automated production of control specifications and Finite State Machine (FSM) Optimization. A FSM controller is implemented by performing horizontal partitioning so as to minimize the total controller area. We compared our approach to published work on FSM generation and optimization, and the results indicate large savings in total controller area.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.818-833
• /
• 2017

This paper introduces a new algorithm that renders motion blur using triangular motion paths. A triangle occupies a set of pixels when moving from a position in the start of a frame to another position in the end of a frame. This is a motion path of a moving triangle. For a given pixel, we use a motion path of each moving triangle to find a range of time that this moving triangle is visible to the camera. Then, we sort visible time ranges in the depth-time dimensions and use bitwise operations to solve the occlusion problem. Thereafter, we compute an average color of each moving triangle based on its visible time range. Finally, we accumulate an average color of each moving triangle in the front-to-back order to produce the final pixel color. Thus, our algorithm performs shading after the visibility test and renders motion blur in real time.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.04a
• /
• pp.249-251
• /
• 2014

This paper proposes a channel diversity based load-balancing cross-layer routing scheme for Wireless Mesh Networks (WMNs). The proposed scheme deals with channel diversity phase and load balancing phase in WMNs. Channel diversity factor $metric_{ch-d}$ and load balancing factor $f_{load}$ are defined and employed cooperatively as a combined path selection policy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.264-267
• /
• 2012

늘어가는 자원의 사용과 데이터의 양에 따라 클라우드 시스템의 사용이 대두되고 있는 가운데, 클라우드 환경에서 가상 머신을 효율적으로 사용하는 방법에 대한 많은 기법이 제시되고 있다. 이 중 하나가 호스트 머신 메모리 사용의 오버커밋먼트를 방지하는 것인데 가상 머신들끼리 되도록 같은 파일을 메모리 사상해서 사용하자는 것이다. 이 때 사용한 mmap() 함수는 스토리지 스택을 사용하지 않고 I/O를 할 수 있는 등의 장점을 가지고 있지만 확장성이 떨어진다는 단점이 있다. 본 논문에서는 가상머신들이 mmap()을 사용해서 호스트 메모리를 접근할 때 발생하는 문제점을 짚어보고 이것을 해결할 수 있도록 새로운 mmap() I/O path를 제안한다. 개선된 mmap() I/O path는 수행시간을 40% 가량 향상 시켰다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.403-406
• /
• 2013

오버레이 멀티캐스트는 IP멀티캐스트에 비해 지연시간이나 대역폭 사용의 측면에 있어서 비효율적이다. 실시간 방송 서비스에서 사용자들에게 QoS를 보장하기 위해 오버레이 멀티캐스트의 이런 비효율성을 줄여야할 필요가 있다. 본 연구에서는 각 호스트들의 제한된 자원과 네트워크 환경을 고려하여 실시간 방송 서비스에 적합한 오버레이 멀티캐스트 트리를 구성하는 알고리즘을 제안하고 적용하여 시뮬레이션한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.248-249
• /
• 2013

This study presents a potential field method for path planning to goal with a mobile robot in unknown environment. The proposed algorithm allows mobile robot to navigate through static obstacles, and find the path in order to reach the target without collision. This algorithm provides the robot with the possibility to move from the initial position to the final position (target). Stage and Player simulator is used to perform the robot motion and implement the potential field algorithm in C/C++ for performance evaluation. Two-dimensional terrain model is used to simulate the ability of robot in motion planning without any collision.