• The Korean Journal of Applied Statistics
• /
• v.22 no.6
• /
• pp.1345-1353
• /
• 2009

We introduce a simple methodology, so-called generalized gamma-polynomial approximation, based on moment-matching technique to approximate survival and hazard functions in the context of parametric survival analysis. We use the generalized gamma-polynomial approximation to approximate the density and distribution functions of convolutions and finite mixtures of random variables, from which the approximated survival and hazard functions are obtained. This technique provides very accurate approximation to the target functions, in addition to their being computationally efficient and easy to implement. In addition, the generalized gamma-polynomial approximations are very stable in middle range of the target distributions, whereas saddlepoint approximations are often unstable in a neighborhood of the mean.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.11
• /
• pp.118-124
• /
• 1995

In the paper, we have proposed a new technique to determine the initial billet for the forged products using a function approximation in neural network. A three-layer neural network is used and a back propagation algorithm is employed to train the network. An optimal billet which satisfied the forming limitation, minimum of incomplete filling in the die cavity, load and energy as well as more uniform distribution of effective strain, is determined by applying the ability of function approximation of the neural network. The amount of incomplete filling in the die, load and forming energy as well as effective strain are measured by the rigid-plastic finite element method. This new technique is applied to find the optimal billet size for the axisymmetric rib-web product in hot forging. This would reduce the number of finite element simulation for determining the optimal billet of forging products, further it is usefully adopted to physical modeling for the forging design

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.202-208
• /
• 2015

In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.6
• /
• pp.1867-1873
• /
• 2000

Function approximation from a set of input-output pairs has numerous applications in scientific and engineering areas. Support vector machine (SVM) is a new and very promising classification, regression and function approximation technique developed by Vapnik and his group at AT&TG Bell Laboratories. However, it has failed to establish itself as common machine learning tool. This is partly due to the fact that this is not easy to implement, and its standard implementation requires the use of optimization package for quadratic programming (QP). In this appear we present simple iterative Kernel Adatron (KA) algorithm for function approximation and compare it with standard SVM algorithm using QP.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.31 no.4
• /
• pp.490-495
• /
• 2007

This research aims to examine accuracy and efficiency of the first four moments corresponding to mean, standard deviation, skewness, and kurtosis, which are estimated by a function approximation moment method (FAMM). In FAMM, the moments are estimated from an approximating quadratic function of a system response function. The function approximation is performed on a specially selected experimental region for accuracy, and the number of function evaluations is taken equal to that of the unknown coefficients for efficiency. For this purpose, three error-minimizing conditions are utilized and corresponding canonical experimental regions constructed accordingly. An interpolation function is then obtained using a D-optimal design and then the first four moments of it are obtained as the estimates for the system response function. In order to verify accuracy and efficiency of FAMM, several non-linear examples are considered including a polynomial of order 4, an exponential function, and a rational function. The moments calculated from various coefficients of variation show very good accuracy and efficiency in comparison with those from analytic integration or the Monte Carlo simulation and the experimental design technique proposed by Taguchi and updated by D'Errico and Zaino.

• The Korean Journal of Applied Statistics
• /
• v.24 no.6
• /
• pp.1161-1168
• /
• 2011

The approximation for the distribution functions of nonparametric test statistics is a significant step in statistical inference. A rank sum test for dispersions proposed by Ansari and Bradley (1960), which is widely used to distinguish the variation between two populations, has been considered as one of the most popular nonparametric statistics. In this paper, the statistical tables for the distribution of the nonparametric Ansari-Bradley statistic is produced by use of polynomially adjusted normal approximation as a semi parametric density approximation technique. Polynomial adjustment can significantly improve approximation precision from normal approximation. The normal-polynomial density approximation for Ansari-Bradley statistic under finite sample sizes is utilized to provide the statistical table for various combination of its sample sizes. In order to find the optimal degree of polynomial adjustment of the proposed technique, the sum of squared probability mass function(PMF) difference between the exact distribution and its approximant is measured. It was observed that the approximation utilizing only two more moments of Ansari-Bradley statistic (in addition to the first two moments for normal approximation provide) more accurate approximations for various combinations of parameters. For instance, four degree polynomially adjusted normal approximant is about 117 times more accurate than normal approximation with respect to the sum of the squared PMF difference.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.462-462
• /
• 2000

In this paper, genetic algorithm (GA) is the technique to search for the optimal structures (i,e., the kind of neural network, the number of hidden neuron, ..) of the neural networks which are used approximating a given nonlinear function, In this paper, we used multi layer feed-forward neural network. The decision method of synapse weights of each neuron in each generation used back-propagation method. In this study, we simulated nonlinear function approximation in the temperature control system.

• Kyungpook Mathematical Journal
• /
• v.58 no.3
• /
• pp.453-462
• /
• 2018

In this paper, we present a symbolic formulation of the error obtained due to an approximation of a given function by the mixed-interpolating function. Using the proposed symbolic method, we compute the error evaluation operator as well as the error estimation at any arbitrary point. We also present an algorithm to compute an approximation of a function by the mixed interpolation technique in terms of projector operator. Certain examples are presented to illustrate the proposed algorithm. Maple implementation of the proposed algorithm is discussed with sample computations.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.10
• /
• pp.1014-1021
• /
• 2008

This paper proposes an intelligent sliding mode control method for robotic systems with the unknown bound of model uncertainties. In our control structure, the unknown bound of model uncertainties is used as the gain of the sliding controller. Then, we employ the function approximation technique to estimate the unknown nonlinear function including the width of boundary layer and the uncertainty bound of robotic systems. The adaptation laws for all parameters of the self-recurrent wavelet neural network and those for the reconstruction error compensator are derived from the Lyapunov stability theorem, which are used for an on-line control of robotic systems with model uncertainties and external disturbances. Accordingly, the proposed method can not only overcome the chattering phenomenon in the control effort but also have the robustness regardless of model uncertainties and external disturbances. Finally, simulation results for the five-link biped robot are included to illustrate the effectiveness of the proposed method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.2
• /
• pp.174-180
• /
• 2012

This paper proposes a decentralized adaptive output-feedback controller design for nonlinear interconnected systems with unknown time delays. The interaction terms with unknown delays are related to all states of subsystems. The time-delayed functions are compensated by using appropriate Lyapunov-Krasovskii functionals and function approximation technique. The observer dynamic surface design technique is employed to design the proposed memoryless local controller for each subsystem. In addition, we prove that all signals in the closed-loop system are semiglobally uniformly bounded and control errors converge to an adjustable neighborhood of the origin.