• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05a
• /
• pp.367-370
• /
• 2003

과학자나 공학자들은 빛이나 소리와 같이 주기적인 특성을 갖는 현상을 연구하는 경우가 많다. Fourier 변환은 이러한 주기함수의 근사 함수를 구할 때 유용하게 이용되고 있다. 본 논문에서는 극좌표 표현되는 함수의 근사 함수를 구하는 문제를 다룬다 일반적으로 컴퓨터 상에 구현하기 위해서는 이산형 Fourier 급수전개를 이용하는데 지금까지는 근사 함수를 컴퓨터 상에서 구할 때 이산화 표본수를 경험에 의해 임의로 결정하여 이용하였으나 본 연구에서는 Fourier 변환의 성질을 이용하여 주어진 함수에 따라 필요한 이산화 표본 수를 자동적으로 결정하는 알고리즘을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.28-30
• /
• 2003

COMA셀룰라 시스템의 용량은 간섭의 양에 따라 결정되므로 이 간섭량을 정확히 계산해야 시스템 성능 평가를 정확히 할 수 있다. 본 논문은 COMA셀룰라 시스템의 역방향 타셀 간섭량을 계산하기 위해 Riemann-Zeta 함수를 이용하여 임의의 전파 감쇄 지수에도 적용할 수 있는 근사식을 제시하고 시abf레이션 결과와 비교하여 그 효용을 살펴 보았다. 제안된 근사식을 이용해 계산한 시스템 용량 상한식은 시뮬레이션을 통해 얻은 용량과 근사한 결과를 얻을 수 있었다. 제안된 타셀 간섭 근사식은 복합적인 전파 환경이 고려되어야 할 계층셀 시스템에서의 간섭 일 용량 계산과 알고리즘 검증에 유용하게 사용될 수 있을 것으로 생각된다.

• Survey Research
• /
• v.12 no.3
• /
• pp.49-62
• /
• 2011

In this paper we investigate design-based properties of both the ordinary least square estimator and the weighted least square estimator for regression coefficients in panel regression model. We derive formulas of approximate bias, variance and mean square error for the ordinary least square estimator and approximate variance for the weighted least square estimator after linearization of least square estimators. Also we compare their magnitudes each other numerically through a simulation study. We consider a three years data of Korean Welfare Panel Study as a finite population and take household income as a dependent variable and choose 7 exploratory variables related household as independent variables in panel regression model. Then we calculate approximate bias, variance, mean square error for the ordinary least square estimator and approximate variance for the weighted least square estimator based on several sample sizes from 50 to 1,000 by 50. Through the simulation study we found some tendencies as follows. First, the mean square error of the ordinary least square estimator is getting larger than the variance of the weighted least square estimator as sample sizes increase. Next, the magnitude of mean square error of the ordinary least square estimator is depending on the magnitude of the bias of the estimator, which is large when the bias is large. Finally, with regard to approximate variance, variances of the ordinary least square estimator are smaller than those of the weighted least square estimator in many cases in the simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.33 no.4
• /
• pp.232-237
• /
• 2014

A passive sonar of warship is composed of several directional or omni-directional sensors. In order to model the acoustic signal received into a warship sonar, the wave propagation modeling is usually required from arbitrary noise source to all sensors equipped to the sonar. However, the full calculation for all sensors is time-consuming and the performance of sonar simulator deteriorates. In this study, we suggest an asymptotic method to estimate the sonar signal arrived to sensors adjacent to the reference sensor, where it is assumed that all information of eigenrays is known. This method is developed using Taylor series for the time delay of eigenray and similar to Fraunhofer and Fresnel approximation for sonar aperture. To validate the proposed method, some numerical experiments are performed for the passive sonar. The approximation when the second-order term is kept is vastly superior. In addition, the error criterion for each approximation is provided with a practical example.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.7
• /
• pp.1-9
• /
• 1999

This paper presents an analytic 3rd order calculation methods, without simulations, for delay time of RC-class circuits which are conveniently used to on-chip interconnects. While the proposed method requires comparable evaluation time than the previous 2nd order calculation method, it ensures more accurate results than those of 2nd order method. The proposed analytic delay calculation method guarantees allowable error tolerances when compared to the results obtained from the AWE (Asymptotic Waveform Evaluation) technique and has better performance in evaluation time as well as numerical stability. The first algorithm of the proposed method requires 8 moments for the 3rd order approximation and yields more accurate delay time approximation. The second algorithm requires 6 moments for the 3rd order approximation and results in shorter evaluation time, the accuracy of which may be less than the first algorithm.

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

• Tunnel and Underground Space
• /
• v.28 no.5
• /
• pp.426-441
• /
• 2018

Recently, the generalized Hoek-Brown (GHB) failure criterion has been actively employed in various rock engineering calculations, but the analytical form of the corresponding Mohr failure envelope is not available, making it difficult to extend the application of the GHB criterion. In order to overcome this disadvantage, this study proposes a new method to express the tangential friction angle as an explicit function of normal stress by invoking the polynomial best-fitting to the relationship between normal stress and tangent friction angle implied in the GHB failure function. If this normal stress - tangential friction angle relationship is best-fitted with linear or quadratic polynomial function, it is possible to find the analytical root for tangential friction angle. Subsequently, incorporating the root into the relationship between shear stress and tangential friction angle accomplishes the derivation of the approximate Mohr envelope for the GHB criterion. It is demonstrated that the derived approximate Mohr failure envelopes are very accurate in the entire range of GSI value.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.937-942
• /
• 2009

In this paper, a continuous-time risk process in an insurance business is considered, where the premium rate is constant and the claim process forms a compound Poisson process. We say that a ruin occurs if the surplus of the risk process becomes negative. It is practically impossible to calculate analytically the ruin probability because the theoretical formula of the ruin probability contains the recursive convolutions and infinite sum. Hence, many authors have suggested approximation formulas of the ruin probability. We introduce a new approximation formula of the ruin probability which extends the well-known De Vylder's and exponential approximation formulas. We compare our approximation formula with the existing ones and show numerically that our approximation formula gives closer values to the true ruin probability in most cases.

• The KIPS Transactions:PartD
• /
• v.19D no.2
• /
• pp.151-160
• /
• 2012

Most of the distributed high-dimensional indexing structures provide a reasonable search performance especially when the dataset is uniformly distributed. However, in case when the dataset is clustered or skewed, the search performances gradually degrade as compared with the uniformly distributed dataset. We propose a method of improving the k-nearest neighbor search performance for the distributed vector approximation-tree based on the strongly clustered or skewed dataset. The basic idea is to compute volumes of the leaf nodes on the top-tree of a distributed vector approximation-tree and to assign different number of bits to them in order to assure an identification performance of vector approximation. In other words, it can be done by assigning more bits to the high-density clusters. We conducted experiments to compare the search performance with the distributed hybrid spill-tree and distributed vector approximation-tree by using the synthetic and real data sets. The experimental results show that our proposed scheme provides consistent results with significant performance improvements of the distributed vector approximation-tree for strongly clustered or skewed datasets.

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