• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.23-30
• /
• 2002

본 연구는 추가제약이 있는 최소 신장나무 문제(Constrained Minimum Spanning Tree : CMST문제)에 대한 유사다항시간 알고리듬 및 근사 해법 개발에 관한 것이다. CMST문제는 NP-hard문제임이 이미 증명되었으며, 이후 이 문제에 대해서는 근사해법 개발이 주된 관심이 되어왔다 [Ravi and Goemans 96]는 다항시간 근사 해법(PTAS)을 이미 개발하였고, [Marathe et at 98]은 가능해(feasible solution)는 아니지만, 앞으로 서술할 $(1+1/\varepsilon,\;+\epsilon)$사해를 구하는 완전다항시간 근사해법 (FPTAS)을 제시하였다. 이와는 달리 [Papa. and Yan, 00]는 파레토 근사 최적해를 구하는 FPTAS를 제시하였는데, 본 연구는 이들의 연구에서 주로 의존하고 있는 행렬-나무 정리(Tree-Matrix Theorem)를 보다 일반화하여, CMST문제에 대한 유사다항시간 알고리듬과 $(1+\varepsilon,\;1+\epsilon)$근사해를 구하는 FPTAS를 제시할 것이다.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.48 no.5
• /
• pp.64-73
• /
• 2011

The problem of Euclidean minimum spanning tree (EMST) is to connect given nodes in a plane with minimum cost. There are many algorithms for the polynomial time problem as EMST. However, for numerous nodes, the algorithms consume an enormous amount of time to find an optimal solution. In this paper, an approximation scheme using a polynomial time approximation scheme (PTAS) algorithm with dividing and parallel processing for the problem is suggested. This scheme enables to construct a large, approximate EMST within a short duration. Although initially devised for the non-polynomial problem, we employ naive PTAS to construct a vast EMST with dynamic programming. In an experiment, the approximate EMST constructed by the proposed scheme with 15,000 input terminal nodes and 16 partition cells shows 89% and 99% saving in execution time for the serial processing and parallel processing methods, respectively. Therefore, our scheme can be applied to obtain an approximate EMST quickly for numerous input terminal nodes.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.8
• /
• pp.74-80
• /
• 2001

Because of ocean waves, swell, steering corrections, etc, the hydrophones of a towed array will not live along a straight line. However the degradation of bearing estimation performance occurs when beamforming is carried out on the hydrophone outputs of an acoustic towed array which is not straight. So it is required to estimate the shape of the array for the improved beamformer output. In this paper, an iterative array shape estimation technique is presented, which is based on the use of the least squares polynomial fitting to the data from heading sensors. The estimation error and the influence of deformations on the performance of the conventional beamformer output are investigated. Finally, the suggested method is applied to the real system in order to investigate the applicability.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.7_8
• /
• pp.387-396
• /
• 2003

This paper provides an approximation algorithm for STP-MSP(Steiner Tree Problem with minimum number of Steiner Points).Because it seems to be impossible to have a PTAS(Polynomial Time Approximation Schemes), which gives the near optimal solutions, for the problem, the algorithm of this paper is an alternative that has the approximation ratio 2 with $n^{O(1)}$ run time. The importance of this paper is the potential to solve other related unsolved problems. The idea of this paper is to distribute the error allowance over the problem instance so that we may reduce the run time to polynomial bound out of infinitely many cases. There are earlier works[1,2] that show the approximations that have practical run times with the ratio of bigger than 2, but this paper shows the existence of a poly time approximation algorithm with the ratio 2.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.2 s.14
• /
• pp.57-66
• /
• 2005

The Interconnecting Highways problem is an abstract of many practical Layout Design problems in the areas of VLSI design, the optical and wired network design, and the planning for the road constructions. For the road constructions, the shortest-length road layouts that interconnect existing positions will provide many more economic benefits than others. That is, finding new road layouts to interconnect existing roads and cities over a wide area is an important issue. This paper addresses an approximation scheme that finds near optimal road layouts for the Interconnecting Highways problem which is NP-hard. As long as computational resources are provided, the near optimality can be acquired asymptotically. This implies that the result of the scheme can be regarded as the optimal solution for the problem in practice. While other approximation schemes can be made for the problem, this proposed scheme provides a big merit that the algorithm designed by this scheme fits well to given problem instances.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.2 s.25
• /
• pp.20-25
• /
• 2006

Low frequency towed line array with high array gain and beam resolution is a long range surveillance sensor for anti-submarine warfare. The beam characteristics is however deteriorated due to the distorted line array sensor caused by low towing speed, wind, current, and towing ship maneuvering. An adaptive beamforming method is utilized in this paper to enhance the distorted line array beam performance by estimating and compensating the nonlinear array shape. A polynomial curve fitting in the least square sense is used to estimate the array shape iteratively with the distributed heading sensors data along the array. Real time array shape estimation and nonlinear array beam calculation is applied to a very long towed line array sensor system and the beam performance is evaluated and compared to the linear beamformer for the simulation and sea trial data.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.39 no.4
• /
• pp.314-320
• /
• 2011

In this work, optimization of two-stage shock absorption system for lunar lander has been carried out. Because of complexity of impact phenomena of shock absorption system, a 1-D constitutive model is proposed to describe the behavior of shock absorption system. Quadratic polynomial regression meta-model is constructed by using a commercial software ABAQUS with the proposed 1-D constitutive model, and sequential approximate optimization of two-stage shock absorption system has been carried out along with the constructed meta-model. Through the optimization, it is verified that landing impact force on lunar lander can be considerably reduced by changing the cell size and foil thickness of honeycomb structure in two-stage shock absorption system.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.4
• /
• pp.255-262
• /
• 2020

In modern passive sonar systems, a towed array sensor is used to minimize the effects of own ship noise and to get a higher SNR. The thin and long towed array sensor can be guided in a non-linear form according to the maneuvering of tow-ship. If this change of the array shape is not considered, the performance of beamformer may deteriorate. In order to properly beamform the elements in the array, an accurate estimate of the array shape is required. Various techniques exist for estimating the shape of the linear array. In the case of a method using a heading sensor, the estimation performance may be degraded due to the effect of heading sensor noise. As means of removing this potential error, weighted polynomial fitting technique for estimating array shape is developed here. In order to evaluate the performance of proposed method, we conducted computer simulation. From the experiments, it was confirmed that the proposed method is more robust to noise than the conventional method.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2007.05a
• /
• pp.103-108
• /
• 2007

다항지수 신뢰도 함수(multinomial-exponential reliability function ; MERF) 는 소프트웨어의 고장/수정 공정을 세밀하게 수행하는 중에 개발되는 관계에 있다. 후에 MERF는 좀더 매우 단순화한 지수 신뢰도 함수(exponential reliability function ; EARF)로 근사화되는 공정을 거치게 된다. 이는 MERF의 특성을 대부분 가지고 있어서 두 개의 함수가 하나의 신뢰도 함수로 단일화되도록 한다. 신뢰도 모델 MERF/EARF는 소프트웨어 고장 공정을 NHPP로, 수정공정을 다항분포로 고려한다. 이 모텔은 두 개의 공정 모두가 통계적 독립인 것으로 간주한다. 본 논문에서는 모델의 이론적인 기준, 수학적 특성, 소프트웨어 신뢰도에의 응용을 검토한다. 이는 물리적 인 시스템을 검사하고 유지보수하는 선도적인 모델응용이다. 본 논문에는 소프트웨어 신뢰도 분석에 응용하는 하나의 수치 예를 포함한다.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.313-315
• /
• 2007

본 논문에서는 서로 다른 주문들의 일부를 일괄적으로 처리할 수 있을 때, 최소 개수의 작업 단위로 모든 주문을 처리하는 문제를 다룬다. 무향그래프와 배치 크기 $\lambda$로 표현되는 이 문제의 일반적인 경우는 NP-hard이며, 그래프가 나무와 interval 그래프 일 때 다항 시간 안에 최적해를 찾을 수 있음이 증명되어 있다. 본 논문에서는 LP 완화 기법을 이용한 근사알고리즘과 LP 완화를 통한 최적해의 분석을 제시한다.