• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1707-1718
• /
• 1996

Given a signal net N=s, 1,...,n to be the set of nodes, with s the source and the remaining nodes sinks, an MRDPT (minimum-cost rectilinear Steiner distance -preserving tree) has the property that the length of every source to sink path is equal to the rectilinear distance between the source and sink. The minimum- cost rectilinear Steiner distance-preserving tree minimizes the total wore length while maintaining minimal source to sink length. Recently, some heuristic algorithms have been proposed for the problem offending the MRDPT. In this paper, we investigate an optimal structure on the MRDPT and present a theoretical breakthrough which shows that the min-cost flow formulation leads to an efficient O(n2logm)2) time algorithm. A more practical extension is also in vestigated along with interesting open problems.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2005.10a
• /
• pp.5-10
• /
• 2005

T.S. HANBADA will navigate to maintain the adequate distance between own ship and other ships safely for about 17 hours on the about 2 kts. On the above situation, M broadcasting station requires to maintain the distance from 100m to 500m between ships. This paper aims to calculate the minimum safe distance between ships, the distance is assessed by using ES Model which is a quantitative model for evaluating the difficulty of shiphandling. After marine traffic flow simulation, minimum safe distance for HANBADA on the 2kts is about 260m based ES value. On this paper, the result was compared about its distance to the actual navigating distance.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.32 no.4
• /
• pp.363-371
• /
• 1996

The Steering and Sailing Rules of International Regulations for Preventing Collisions at Sea now in use direct the best aid - action to avoid collision by the stand - on vessel. But these rules do not refer to the safety relative distance between two vessels when she should take such action. In this paper, the author analyzed the ship's collision avoiding actions from the viewpoint of ship motions and worked out mathematical formulas to calculate the relative distances necessary for taking action to avoid collision. Figuring out the values of maneuvering indices through experiments of 11 actual ships of small, medium, large and mammoth size, the author applied these values to the calculating formulas and calculated the minimum relative distances. The main results are as follows: 1. It was confIrmed that the stand - on vessel should keep the greatest relative distance for taking best aid - action to avoid collision when the cross angle of course was $90^{\circ}$ and near it(70-$90^{\circ}$ ). 2. When the cross angle of course was $90^{\circ}$ , the minimum relative distance of small vessel(GT: 160-650tons) was found to be more than about 6.8 times of her own length, and those of medium(GT : 2,300-3,500tons), large(GT : 22,OOO-62,OOOtons) and mammoth(GT : 91,000-139,000tons) vessels were found to be more than about 9.0 times, about 5.4 times and about 6.8 times of their own lengths. 3. It was confIrmed that collision danger was greater when crossing angle was obtuse than in an acute angle, therefore greater relative distance was to be kept by the stand - on vessel for taking best aid - action to avoid collision in the case of the obtuse angle. 4. In every vessels, in the case of $90^{\circ}$ cross angle of course the safety minimum relative distance was found to be more than about 9.0 times of their own lengths.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.8
• /
• pp.385-393
• /
• 2008

The best coverage problem is finding a path whose worst distance to the sensor-set is the best among all paths. Instead, if the user stays close to its nearest two sensors, then the stability of the wireless connection may be guaranteed. So we consider the problem of finding a second best coverage path; given the sensor set U, a starting point s and a target point t, find a path whose worst distance to the second closest sensor is minimized. This paper presents an O(n logn) -time algorithm to find such a path. We also give experimental evidence showing that the connection to the sensor-set along a second best coverage path is more stable than that along the best coverage path.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.457-462
• /
• 2007

사용자가 가능한 센서 가까이에서 이동하는 문제를 최단거리유지문제라 하며, 무선 연결의 안정성을 높이기 위해서 두 개의 센서로부터 가까이에 위치하여 사용자가 움직이는 이동경로를 차선최단거리유지이동경로라고 한다. 이 논문에서는 주어진 센서들의 집합 U와 시작점 s, 끝점 t가 주어질 때, s에서 t까지 이르는 경로로서, 가장 가까운 두 개의 센서까지의 거리가 최소인 차선최단거리유지이동경로를 찾는 $O((c^2n+e)log(c^2n))$-시간 알고리즘을 제시한다. 여기서 c는 집합 U의 하나의 사이트가 갖는 최대 보로노이 선분의 개수이다.

• Journal of Energy Engineering
• /
• v.24 no.2
• /
• pp.17-21
• /
• 2015

Restriction orifices in the feed and bleed circuit of nuclear power plant are designed using computer program capable of handling multiple hole cascade orifice assembly. Single hole stages of orifice assembly are alternated with multihole stages where necessary. The distance between stages is such that it allows full pressure recovery. The minimum static pressure is higher than vapor pressure at the operating temperature so that cavitation does not occur. Piping sizes are reviewed and increased if necessary to improve rigidity.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.589-592
• /
• 2001

본 논문에서는 고속 필기 한글 주소 인식을 위한 낱자 인식기를 제안한다. 인식 대상은 우편번호 여섯 자리에 할당된 주소에 출현 빈도가 높은 필기 한글 469 자이다. 제안된 방법은 낱자 인식 기법을 채택하고 있으며, 인식률과 처리속도를 향상시키기 위하여 2 단계 인식 전략을 채택하였다. 인식기로는 다층퍼셉트론, 최소거리분류기, Subspace 방법을 고려한다. 다층퍼셉트론은 비교적 높은 인식률과 처리속도를 보유하지만 출력값이 확률이 아님으로써 후처리를 필요로 하는 시스템에서 사용하기 어렵다. 최소거리분류기는 간단한 알고리즘으로 처리속도가 높고 확률을 출력하는 장점을 갖지만 인식률이 낮아 활용되기 어렵다. 또한 Subspace 방법은 인식률이 높고 확률을 출력하지만 처리속도가 매우 느리다는 단점이 있다. 따라서 제안방법에서는 처리속도가 높은 인식기 - 다층퍼셉트론, 최소거리분류기 - 를 사용하여 선인식을 수행한 후, 이 결과를 활용하여 인식 대상을 제한한 후 Subspace 방법을 사용하여 정확하게 인식하는 전략을 도입함으로써, 높은 인식결과를 유지하면서 처리속도를 높이고 후처리에 적합하도록 하였다. PE92 데이터베이스를 사용하여 실험한 결과 제안방법이 한글 469 자에 대하여 비교적 높은 인식률과 처리속도를 갖음을 알 수 있었다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.424-426
• /
• 2002

효과적인 볼륨렌더링을 위해서는 빠른 속도와 고화질이라는 두 가지 조건을 모두 충족시켜야 한다. 기존에 사용된 광선추적법은 화질이 좋은 반면에 실시간 렌더링을 하기에는 한계가 있었다. 공간 도약법은 빈 공간에 대한 샘플링을 생략함으로써 렌더링 속도를 향상시킬 수 있으나 관측조건에 따라 성능이 저하되는 문제가 있다. 본 논문에서는 기존의 공간 도약법을 개선하여 관측조건과 무관하게 고화질을 유지하면서 속도를 향상시키는 방법을 제안한다. 여기서는 뷰 평면을 균일한 격자로 분할하고 각 격자내에서 가장 가까운 객체의 표면까지의 거리를 구한 후 그 위치부터 공간 도약함으로써 속도를 향상시킨다.

• Information and Communications Magazine
• /
• v.20 no.5
• /
• pp.635-644
• /
• 2003

유비쿼터스 컴퓨팅 환경에서만 볼 수 있는 보안문제를 가용성, 인증성, 익명성 관점에서 살펴보았다. 이 분야의 보안기술은 기존의 방법과 여러 면에서 다르다. 무선 애드학 네트워크 또는 센서 네트워크의 예에서 보는 것처럼 제한된 계산 성능과 메모리, 전력소모를 최소화히기 위한 통달거리 제한 및 아이들 상태 유지, 온라인 서버가 존재하지 않으므로 인해 발생하는 집중형 기술 구현이 불가능한 한계로 인해 새로운 이슈들이 등장하고 있다. 이런 문제들과 해결책 일부를 소개한다.

• Journal of Navigation and Port Research
• /
• v.29 no.10 s.106
• /
• pp.833-838
• /
• 2005

This paper is to investigate the minimum safe distance between T/S Hanbada and a group of vessels participating in the event hosted by M broadcasting station who asked T/S Hanbada to keep a distance from $100m{\sim}500m$. The minimum safe distance was assessed by using ES Model which evaluates quantitatively the difficulty of shiphandling, and the simulation of marine traffic flow. As a result the minimum safe distance of T/S Hanbada moving at a speed of 2 knots turns out about 260m and is compared with the actual value.