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

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.219-228
• /
• 2004

Confidence interval estimators for proportions using normal approximation have been commonly used for coverage analysis of simulation output even though alternative approximate estimators of confidence intervals for proportions were proposed. This is -because the normal approximation was easier to use in practice than the other approximate estimators. Computing technology has no problem with dealing these alternative estimators. Recently, one of the approximation methods for coverage analysis which is based on arcsin transformation has been used for estimating proportion and for controlling the required precision in [12]. In this paper, we compare three approximate interval estimators, based on a normal distribution approximation, an arcsin transformation and an F-distribution approximation, of a single proportion. Three estimators were applied to sequential coverage analysis of steady-state means, in simulations of the M/M/1/$\infty$ and W/D/l/$\infty$ queueing systems on a single processor and multiple processors.

• The Korean Journal of Applied Statistics
• /
• v.20 no.2
• /
• pp.257-266
• /
• 2007

It is known that Agresti-Coull approach is an effective tool for the construction of confidence intervals for various problems related to binomial proportions. However, the Agrest-Coull approach often produces a conservative confidence interval. In this note, confidence intervals based on a Bayesian approach are proposed for a linear function of independent binomial proportions. It is shown that the Bayesian confidence interval slightly outperforms the confidence interval based on Agresti-Coull approach in average sense.

• The Korean Journal of Applied Statistics
• /
• v.22 no.4
• /
• pp.793-804
• /
• 2009

The hypotheses of difference, ratio and odds ratio between two proportions are used for the non-inferiority trial. The approximate unconditional test suggested by Kang and Chen (2000) based on difference and ratio have the potential problem against the failure rate. When the sample size is small, the type I errors of the asymptotic test using the normal approximation suggested by Chen et al. (2000) tends to exceed the nominal level. Therefore, we propose the approximate unconditional test based on odds ratio and compare the test with the asymptotic test. And we compare the three hypotheses used in the approximate unconditional tests of two proportions with respect to the type I errors and power.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.509-518
• /
• 2009

In this paper, a mechanism that produces an approximation edges minimum spanning tree swiftly using virtual nodes called portals dividing given edges into same distance sub-edges. The approximation edges minimum spanning tree can be used in many useful areas as connecting communication lines, road networks and railroad systems. For 3000 random input edges, when portal distance is 0.3, tree building time decreased 29.74% while the length of the produced tree increased 1.8% comparing with optimal edge minimum spanning tree in our experiment. When portal distance is 0.75, tree building time decreased 39.96% while the tree length increased 2.96%. The result shows this mechanism might be well applied to the applications that may allow a little length overhead, but should produce an edge connecting tree in short time. And the proposed mechanism can produce an approximation edge minimum spanning tree focusing on tree length or on building time to meet user requests by adjusting portal distance or portal discard ratio as parameter.

• The Korean Journal of Applied Statistics
• /
• v.19 no.1
• /
• pp.171-181
• /
• 2006

The Wald confidence interval has been considered as a standard method for the difference of proportions. However, the erratic behavior of the coverage probability of the Wald confidence interval is recognized in various literatures. Various alternatives have been proposed. Among them, Agresti-Caffo confidence interval has gained the reputation because of its simplicity and fairly good performance in terms of coverage probability. It is known however, that the Agresti-Caffo confidence interval is conservative. In this note, a confidence interval is developed using the weighted Polya posterior which was employed to obtain a confidence interval for the binomial proportion in Lee(2005). The resulting confidence interval is simple and effective in various respects such as the closeness of the average coverage probability to the nominal confidence level, the average expected length and the mean absolute error of the coverage probability. Practically it can be used for the interval estimation of the difference of proportions for any sample sizes and parameter values.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.5
• /
• pp.96-103
• /
• 1999

본 논문에서는 sliding-DFT(SDFT)를 계수의 유한 비트 근사구현에 기초하여 실시간 구현하는 기법을 제시하고, 이의 오차영향을 해석하였다. 오차의 영향을 오차전력과 신호전력비율(noise-to-signal power ratio : NSR)로 하여 이를 해석적으로 유도하였다. 가우스 렌덤신호 및 사람의 수면 EEG 신호를 대상으로 수행한 시뮬레이션 결과가 해석식과 잘 일치하는 것을 보임으로써 본 연구에서 얻은 해석식을 확인하였다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10A
• /
• pp.1566-1575
• /
• 2000

This paper studies mismatched scalar quantization of a generalized gamma source by a quantizer that is optimally (in the mean square error sense) designed for another generalized gamma source. Specifically, it considers variance-mismatched quantization which occurs when the variance of the source to be quantized differs from tat of the designed-for source. The main result is the two distortion formulas derived from Bennett's integral. The first formula is an approximation expression that uses the outermost threshold of an optimum scalar quantizer, and the second formula, in turn, uses an approximation formula for this outermost threshold. Numerical results are obtained for Laplacian sources, which are example of a generalized gamma source, and comparisons are made between actual mismatched distortions and the two formulas. These numerical results show that the two formulas become more accurate, as the number of quantization points gets larger and the ratio of the source variance to that of the designed-for source gets bigger. For example, the formulas are within 2~4% of the actual distortion for approximately 64 quantization points or more. In conclusion, the proposed approximation formulas are considered to have contribution as closed formulas and for their accuracy.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.272-279
• /
• 2000

When the multiple video sources are together transmitted through the channel of fixed bandwidth, the efficiently joint bandwidth allocation is necessary. This paper presents the joint bandwidth allocation method to keep the constant picture duality ratio among the video sources. We first find an approximated model of distortion and bitrate for the multiplexing system of multiple sources. Then we obtain the bitrate for each source to have constant distortion ratio among the sources by using the approximated model parameters for simple implementation. It is shown by simulation that the proposed bandwidth allocation can keep almost constant picture quality ratio among the sources in comparison to an independent bandwidth allocation method.

• Journal of the Korean School Mathematics Society
• /
• v.5 no.1
• /
• pp.147-155
• /
• 2002

Jim Libby(2000)는 임의의 M&M 밀크 쵸코렛 봉지에서 꺼낸 것을 다시 집어넣지 않고 3개의 쵸코렛을 꺼낼 때 같은 색이 나올 확률을 계산하는 방법의 논문을 썼다. Libby는 그의 논문에서 갈색, 노랑, 빨강, 주황, 초록, 파랑의 6개 색의 M&M 밀크 쵸코렛들이 똑같은 비율로 분포되었다고 가정하였다. 그러나 실제로 M&M 쵸코렛의 여섯 가지 색깔의 확률분포는 똑같은 비율이 아니다. M&M회사는 홈페이지(http://www.m-ms.com/cai/mms/faq.html)를 통해 실제적인 6개 색의 M&M 밀크 쵸코렛들의 분포는 갈색이 30%, 노랑과 빨간색이 각각 20% 주황, 초록과 파랑은 각각 10%의 분포라고 밝히고 있다. 이 논문에서 우리는 Libby가 생각하였던 문제를 실제적인 6개 색의 M&M 밀크 쵸코렛들의 확률 분표에 의거하여 다시 생각해보며, 또한 3개의 쵸코렛대신 n개의 쵸코렛을 꺼낸다고 가정하여 더욱 일반적인 결론을 유도한다. 또한 유도한 이 정확한 확률 공식과 근사 공식을 활동을 통해 점검하고 학생들이 주도적으로 지금까지 배워온 이론들을 점검할 수 있게 하였다. 활동을 시작하기 전에 정확한 확률 공식과 근사 공식과의 관계를 설명하고 기본적인 확률과 통계의 개념을 다시 정립할 수 있도록 하였다. Piaget가 '지식이란 학습자에 의해 능동적으로 구성되는 것이지 환경으로부터 수동적으로 받아들이는 것은 아니다'라고 했듯이, 활동을 통한 학습은 학생들을 능동적으로 만들기 때문에 학생들이 지식을 구성해 갈 수 있다. 활동을 간단히 소개하면 다음과 같다. 활동I에서는 초코렛을 세어서 근사 확률을 추정하는 방법이 소개된다. 어떻게 매개변수가 두 공식에 관련이 되는지를 측정하고 두 공식을 사용하여 정확한 확률과 근사 확률을 계산하여 비교해본다. 각 조원들과 이 세 과정에서 무엇을 배웠나 토론하고 다른 조들과 배운 것을 나눈다. 활동II는 두 과정으로 나누어진다. 첫 번 과정은 각 그룹의 한 학생이 주어진 쵸코렛 봉지에서 3개의 쵸코렛을 꺼낸다. 다른 학생은 표 3에 나온 결과를 기록한다. 계속하여 20번씩 한다. 다시 학생을 바꾸어 20번 계속한다. 같은 색깔의 쵸코렛이 나온 확률은 계산하기 위한 간단한 실험이고 두 번째 과정은 각 조가 웹사이트나 선생님으로부터 제공받은 프로그램을 다운로드 받아 하는 시뮬레이션이다. 이 실험 후에 학생들이 이 두 활동을 통해 무엇을 배웠는지 토론해보고 또 두 활동을 비교해 볼 수 있다. 마지막으로 M&M 쵸코렛을 먹는 것으로 활동을 마칠 수 있을 것이다. 활동 II에 나오는 두 시뮬레이션은 학생들이 수학 이론의 힘을 깨달을 뿐 아니라 수학 교실에서 큰 재미를 느끼게 될 것이다. 이 논문에서 그래픽 계산기로 할 수 있는 프로그램을 소개하였다.