• 제어로봇시스템학회논문지
• /
• 제15권11호
• /
• pp.1137-1143
• /
• 2009

This paper presents the FPGA implementation of efficient algorithms for approximating exponential function based on floating point format data. The Taylor-Maclaurin expansion as a conventional approximation method becomes inefficient since high order expansion is required for the large number to satisfy the approximation error. A format converter is designed to convert fixed data format to floating data format, and then the real number is separated into two fields, an integer field and an exponent field to separately perform mathematic operations. A new assembly command is designed and added to previously developed command set to refer the math table. To test the proposed algorithm, assembly program has been developed. The program is downloaded into the Altera DSP KIT W/STRATIX II EP2S180N Board. Performances of the proposed method are compared with those of the Taylor-Maclaurin expansion.

• 전자공학회논문지A
• /
• 제29A권2호
• /
• pp.1-7
• /
• 1992

A consideration for image improvement under the Born approximation in the microwave diffraction tomography is suggested by using a projection function. The limiting factors in the degrading reconstructed image due to Born approximation are identified in terms of projection function and its modification is suggested to improve the degraded image based upon the Born approximation. In order to verify the proposed method, the reconstructed images are shown by computer simulation from the back-scattered data of angular and frequency diversity for squared dielectric cylinder with a various relative dielectric constant. From simulation results, it was shown that the proposed method can lead to a fairly good improved image for a severe degraded one irrespective of homogeneous and inhomogeneous dielectric object. In the future, the analysis on the limitation of this method should be considered and performed by means of more quantitative method.

• 응용통계연구
• /
• 제11권2호
• /
• pp.287-302
• /
• 1998

표본평균(sample mean)의 밀도함수(density function)와 분포함수(distribution function)에 대한 안부점 근사(saddlepoin\ulcorner approximation)는 Daniels(1954, 1987), Lugannani와 Rice(1980)등에 의하여 유도되었으며, 이 근사식들의 정확도는 대표본(large sample)의 경우는 물론 소표본(small sample)의 경우에도 매우 뛰어난 것으로 알려져 있다. 최근 Easton과 Ronchetti(1986)는 일반적 통계량(general statistics)의 밀도함수에 대한 안부점 근사법을 제안하였고, 분포함수에 대한 근사로는 밀도함수에 대한 안부점 근사식을 직접 수치적으로 적분하는 방법을 제안하였다. 본 논문에서는 일반적 통계량의 분포함수에 대한 안부점 근사법을 제안하고, 이를 표본분산(sample variance)과 스튜던트화 평균(studentizd mean)의 분포함수에 대한 근사에 적용하였다.

• Journal of the Korean Data and Information Science Society
• /
• 제14권2호
• /
• pp.279-287
• /
• 2003

In this paper we propose a local smoothing of the Nelson type estimator for the survival function based on an approximation by the Weibull distribution function. It appears that Mean Square Error and Bias of the smoothed estimator of the Nelson type survival function estimators are significantly smaller than that of the smoothed estimator of the Kaplan-Meier survival function estimator.

• 한국데이터정보과학회:학술대회논문집
• /
• 한국데이터정보과학회 2003년도 춘계학술대회
• /
• pp.109-119
• /
• 2003

In this paper we propose a local smoothing of the Nelson type estimator for the survival function based on an approximation by the Weibull distribution function. It appears that Mean Square Error and Bias of the smoothed estimator of the Nelson type survival function estimator is significantly smaller then that of the smoothed estimator of the Kaplan-Meier survival function estimator.

• Journal of Applied and Pure Mathematics
• /
• 제5권1_2호
• /
• pp.69-93
• /
• 2023

Here we give multivariate quantitative approximations of Banach space valued continuous multivariate functions on a box or ℝ^N, N ∈ ℕ, by the multivariate normalized, quasi-interpolation, Kantorovich type and quadrature type neural network operators. We treat also the case of approximation by iterated operators of the last four types. These approximations are derived by establishing multidimensional Jackson type inequalities involving the multivariate modulus of continuity of the engaged function or its high order Fréchet derivatives. Our multivariate operators are defined by using a multidimensional density function induced by a parametrized Gudermannian sigmoid function. The approximations are pointwise and uniform. The related feed-forward neural network is with one hidden layer.

• ETRI Journal
• /
• 제15권2호
• /
• pp.35-51
• /
• 1993

This paper presents function approximation based on nonparametric estimation. As an estimation model of function approximation, a three layered network composed of input, hidden and output layers is considered. The input and output layers have linear activation units while the hidden layer has nonlinear activation units or kernel functions which have the characteristics of bounds and locality. Using this type of network, a many-to-one function is synthesized over the domain of the input space by a number of kernel functions. In this network, we have to estimate the necessary number of kernel functions as well as the parameters associated with kernel functions. For this purpose, a new method of parameter estimation in which linear learning rule is applied between hidden and output layers while nonlinear (piecewise-linear) learning rule is applied between input and hidden layers, is considered. The linear learning rule updates the output weights between hidden and output layers based on the Linear Minimization of Mean Square Error (LMMSE) sense in the space of kernel functions while the nonlinear learning rule updates the parameters of kernel functions based on the gradient of the actual output of network with respect to the parameters (especially, the shape) of kernel functions. This approach of parameter adaptation provides near optimal values of the parameters associated with kernel functions in the sense of minimizing mean square error. As a result, the suggested nonparametric estimation provides an efficient way of function approximation from the view point of the number of kernel functions as well as learning speed.

• 한국지능시스템학회논문지
• /
• 제12권5호
• /
• pp.397-404
• /
• 2002

본 논문에서는 퍼지와 웨이브렛 변환의 다해상도 분해(MRA)를 가진 퍼지 개념을 이용한 웨이브렛 신경망을 제안하고, 또한 이 시스템을 이용하여 임의의 비선형 함수 학습 근사화를 개선하고자 한다. 여기에서 퍼지 개념은 벨(bell)형 퍼지 소속함수를 사용하였다. 그리고 웨이브렛의 구성은 단일 크기를 가지고 있으며, 퍼지 개념을 이용한 웨이브렛 신경망의 학습을 위해 역전파 알고리즘을 사용하였다. 웨이브렛 변환의 다해상도 분해, 벨형 퍼지 소속 함수 그리고 학습을 위한 역전파 알고리즘을 이용한 이 구조는 기존의 알고리즘보다 근사화 성능이 개선됨을 모의 실험을 통하여 1차원, 2차원 함수에서 확인하였다.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.741-754
• /
• 2002

In this paper we present an error bound for cubic spline approximation of conic section curve. We compare it to the error bound proposed by Floater [1]. The error estimating function proposed in this paper is sharper than Floater's at the mid-point of parameter, which means the overall error bound is sharper than Floater's if the estimating function has the maximum at the midpoint.

• 호남수학학술지
• /
• 제35권4호
• /
• pp.729-738
• /
• 2013

In this paper, we investigate a localized approximation of a continuously differentiable function by neural networks. To do this, we first approximate a continuously differentiable function by B-spline functions and then approximate B-spline functions by neural networks. Our proofs are constructive and we give numerical results to support our theory.