• Journal for History of Mathematics
• /
• v.18 no.3
• /
• pp.107-117
• /
• 2005

In this paper, we introduce linear approximate Henstock integral equations that is slightly different from linear Henstock integral equations, and we also offer an example which shows that some integral equation has a solution in the sense of the approximate Henstock integral but does not have any solutions in the sense of the Henstock integral. Furthermore, we investigate the existence and uniqueness of solution of the approximate Henstock integral equation.

• The Korean Journal of Applied Statistics
• /
• v.29 no.4
• /
• pp.571-579
• /
• 2016

Most of studies related to the distributions of quadratic forms are conducted under the assumption of multivariate normal distribution. In this paper, we suggested an approximation to the distribution of quadratic forms based on multivariate skew-normal distribution as alternatives for multivariate normal distribution. Saddlepoint approximations are considered and the accuracy of the approximations are verified through simulation studies.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.182-184
• /
• 2018

본 논문에서는 HDR 영상 신호의 고속 광전변환을 위한 파라미터 룩업 테이블 기반 구간 선형 근사 방법을 제안한다. 제안하는 방법은 고속화하기 위한 광전변환함수의 입력 값의 범위를 다수개의 구간으로 나누고 각 구간마다 별도의 선형 근사함수를 구하여 광전변환함수를 근사하고 각 구간별로 필요한 선형 근사함수의 파라미터를 룩업 테이블에 미리 저장하고 사용함으로써 보다 빠른 근사 값 계산이 가능하다. 제안한 방법의 성능 평가를 위해 MPEG 에서 제공하는 참조 소프트웨어인 HDRTools 를 기반으로 실험을 수행했고 이를 통해 참조 소프트웨어에 구현되어 있는 기존의 고속화 방법과 비교하여 더 적은 연산 수를 가지며 평균 24% 빠른 처리속도와 약 0.05dB 의 평균 PSNR 손실을 보임을 확인하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.1
• /
• pp.16-21
• /
• 2002

Repetitive strings have been studied in such diverse fields as molecular biology data compression etc. Some important regularities that have been studied are perods, covers seeds and squares. A natural extension of the repetition problems is to allow errors. Among the four notions above aproximate squares and approximate periodes have been studied. In this paper, we introduce the notion of approximate covers which is an approximate version of covers. Given two strings P(｜P｜=m) and T(｜T｜=n) we propose and algorithm with finds the minimum distance t such that P is a t-approximate cover of T. The algorithm take O(m,n) time for the edit distance and $O(mn^2)$ time of finding a string which is an approximate cover of T is minimum distance is NP-complete.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.760-766
• /
• 2017

Repetitive strings have been studied in diverse fields such as data compression, bioinformatics and so on. Recently, two problems of approximate periods of strings over integer alphabets were introduced, finding minimum ${\delta}-approximate$ periods and finding minimum ${\gamma}-approximate$ periods. Both problems can be solved in $O(n^2)$ time when n is the length of the string. In this paper, we present two parallel algorithms for solving the above two problems in O(n) time using $O(n^2)$ threads, respectively. The experimental results show that our parallel algorithms for finding minimum ${\delta}-approximate$ (resp. ${\gamma}-approximate$) periods run approximately 19.7 (resp. 40.08) times faster than the sequential algorithms when n = 10,000.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.6
• /
• pp.1211-1219
• /
• 2013

Recently, the usage of skew-normal distribution, instead of classical normal distribution, is rising up in many statistical theories and applications. In this paper, we deal with saddlepoint approximation for the distribution function of sample mean of skew-normal distribution. Comparing to normal approximation, saddlepoint approximation provides very accurate results in small sample sizes as well as for large or moderate sample sizes. Saddlepoint approximations related to the skew-normal distribution, suggested in this paper, can be used as a approximate approach to the classical method of Gupta and Chen (2001) and Chen et al. (2004) which need very complicate calculations. Through simulation study, we verified the accuracy of the suggested approximation and applied the approximation to Robert's (1966) twin data.

• The Korean Journal of Applied Statistics
• /
• v.29 no.1
• /
• pp.181-192
• /
• 2016

We consider several methods to approximate option prices with correction terms to the Black-Scholes option price. These methods are able to compute option prices from various risk-neutral distributions using relatively small data and simple computation. In this paper, we compare the performance of Edgeworth expansion, A-type and C-type Gram-Charlier expansions, a method of using Normal inverse gaussian distribution, and an asymptotic method of using nonlinear regression through simulation experiments and real KOSPI200 option data. We assume the variance gamma model in the simulation experiment, which has a closed-form solution for the option price among the pure jump $L{\acute{e}}vy$ processes. As a result, we found that methods to approximate an option price directly from the approximate price formula are better than methods to approximate option prices through the approximate risk-neutral density function. The method to approximate option prices by nonlinear regression showed relatively better performance among those compared.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.34 no.11
• /
• pp.1603-1611
• /
• 2010

The comparative study of regression-model-based approximate optimization techniques used in the strength design of an automotive knuckle component that will be under bump and brake loading conditions is carried out. The design problem is formulated such that the cross-sectional sizing variables are determined by minimizing the weight of the knuckle component that is subjected to stresses, deformations, and vibration frequency constraints. The techniques used in the comparative study are sequential approximate optimization (SAO), sequential two-point diagonal quadratic approximate optimization (STDQAO), and approximate optimization based on enhanced moving least squares method (MLSM), such as CF (constraint feasible)-MLSM and Post-MLSM. Commercial process integration and design optimization (PIDO) tools are utilized for the application of SAO and STDQAO. The enhanced MLSM-based approximate optimization techniques are newly developed to ensure constraint feasibility. The results of the approximate optimization techniques are compared with those of actual non-approximate optimization to evaluate their numerical performances.

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