• 전력전자학회:학술대회논문집
• /
• 전력전자학회 2005년도 전력전자학술대회 논문집
• /
• pp.624-627
• /
• 2005

This paper presents a new data classification method using the Robbins Monro stochastic approximation algorithm k-nearest neighbor and distribution analysis. To cluster the data set, we decide the centroid of the test data set using k-nearest neighbor algorithm and the local area of data set. To decide each class of the data, the Robbins Monro stochastic approximation algorithm is applied to the decided local area of the data set. To evaluate the performance, the proposed classification method is compared to the conventional fuzzy c-mean method and k-nn algorithm. The simulation results show that the proposed method is more accurate than fuzzy c-mean method, k-nn algorithm and discriminant analysis algorithm.

• 한국CDE학회논문집
• /
• 제17권4호
• /
• pp.282-293
• /
• 2012

This paper presents an error-bounded B-spline fitting technique to approximate unorganized data within a prescribed error tolerance. The proposed approach includes two main steps: leastsquares minimization and error-bounded approximation. A B-spline hypervolume is first described as a data representation model, which includes its mathematical definition and the data structure for implementation. Then we present the least-squares minimization technique for the generation of an approximate B-spline model from the given data set, which provides a unique solution to the problem: overdetermined, underdetermined, or ill-conditioned problem. We also explain an algorithm for the error-bounded approximation which recursively refines the initial base model obtained from the least-squares minimization until the Euclidean distance between the model and the given data is within the given error tolerance. The proposed approach is demonstrated with some examples to show its usefulness and a good possibility for various applications.

• 센서학회지
• /
• 제28권4호
• /
• pp.240-245
• /
• 2019

Phase interpolation is widely adopted in frequency synthesizers and clock-and-data recovery systems to produce an intermediate phase from two existing phases. The intermediate phase is typically generated by combining two input phases with different weights. Unfortunately, this results in non-uniform phase steps. Alternatively, the intermediate phase can be generated by successive approximation, where the interpolated phase at each approximation stage is obtained using the same weight for the two intermediate phases. As a proof of concept, this study presents a 2-GHz 8-bit successive approximation digital-to-phase converter that is designed using 65-nm CMOS technology. The converter receives an 8-phase clock signal as input, and the most significant bit (MSB) section selects four phases to create two sinusoidal waveforms using a harmonic rejection filter. The remaining least significant bit (LSB) section applies the successive approximation to generate the required intermediate phase. Monte-Carlo simulations show that the proposed converter exhibits 0.46-LSB integral nonlinearity and 0.31-LSB differential nonlinearity with a power consumption of 3.12 mW from a 1.2-V supply voltage.

• Journal of the Korean Data and Information Science Society
• /
• 제24권6호
• /
• pp.1211-1219
• /
• 2013

최근 많은 통계 이론과 응용 문제에 정규분포의 대안으로 왜정규분포에 대한 활용이 높아지고 있다. 본 논문에서는 왜정규분포에 기반한 표본평균의 분포함수에 대한 안장점근사를 다루었다. 안장점근사는 기존의 정규근사에 비해 매우 뛰어난 정확성을 보일 뿐 아니라, 소표본에서도 정확한 근사결과를 제공한다. 본 논문에서 제시한 왜정규분포에 관련된 안장점근사는 복잡한 계산이 요구되는 기존의 Gupta와 Chen (2001)과 Chen 등 (2004)에 대한 근사적 방법으로 사용될 수 있다. 모의실험을 통해 표본평균의 분포함수에 대한 제안된 안장점근사의 정확도를 확인하고, 실제 자료에 대한 응용으로 Roberts (1966)의 쌍둥이 자료의 분석에 적용하였다.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2004년도 봄 학술발표회 논문집
• /
• pp.275-283
• /
• 2004

The paper describes the integrated design system using MDO and approximation technique. In MDO related research, final target is an integrated and automated MDO framework systems. However, in order to construct the integrated design system, the prerequisite condition is how much save computational cost because of iterative process in optimization design and lots of data information in CAD/CAE integration. Therefore, this paper presents that an efficient approximation method, Adaptive Approximation, is a competent strategy via MDO framework systems.

• International Journal of CAD/CAM
• /
• 제13권1호
• /
• pp.1-11
• /
• 2013

Just by adjusting the control points iteratively, progressive iterative approximation (PIA) presents an intuitive and straightforward scheme such that the resulting limit curve (surface) can interpolate the original data points. In order to obtain more flexibility, adjusting only a subset of the control points, a new method called local progressive iterative approximation (LPIA) has also been proposed. But to this day, there are two problems about PIA and LPIA: (1) Only an approximation process is discussed, but the accurate convergence curves (surfaces) are not given. (2) In order to obtain an interpolating curve (surface) with high accuracy, recursion computations are needed time after time, which result in a large workload. To overcome these limitations, this paper gives an explicit matrix expression of the control points of the limit curve (surface) by the PIA or LPIA method, and proves that the column vector consisting of the control points of the PIA's limit curve (or surface) can be obtained by multiplying the column vector consisting of the original data points on the left by the inverse matrix of the collocation matrix (or the Kronecker product of the collocation matrices in two direction) of the blending basis at the parametric values chosen by the original data points. Analogously, the control points of the LPIA's limit curve (or surface) can also be calculated by one-step. Furthermore, the $G^1$ joining conditions between two adjacent limit curves obtained from two neighboring data points sets are derived. Finally, a simple LPIA method is given to make the given tangential conditions at the endpoints can be satisfied by the limit curve.

• Journal of the Korean Data and Information Science Society
• /
• 제9권2호
• /
• pp.255-262
• /
• 1998

In this paper, we study the saddlepoint approximations for the ratio of independent random variables. In Section 2, we derive the saddlepoint approximation to the probability density function. In Section 3, we represent a numerical example which shows that the errors are small even for small sample size.

• Journal of the Korean Data and Information Science Society
• /
• 제15권4호
• /
• pp.879-889
• /
• 2004

This paper gives an approximation to the distribution function of the .rst passage time of stock price when volatility of stock price is modeled by a function of Ornstein-Uhlenbeck process. It also shows how to obtain the error of the approximation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권1호
• /
• pp.81-98
• /
• 2013

Since Probabilistic Latent Semantic Analysis (PLSA) and Latent Dirichlet Allocation (LDA) were introduced, many revised or extended topic models have appeared. Due to the intractable likelihood of these models, training any topic model requires to use some approximation algorithm such as variational approximation, Laplace approximation, or Markov chain Monte Carlo (MCMC). Although these approximation algorithms perform well, training a topic model is still computationally expensive given the large amount of data it requires. In this paper, we propose a new method, called non-simultaneous sampling deactivation, for efficient approximation of parameters in a topic model. While each random variable is normally sampled or obtained by a single predefined burn-in period in the traditional approximation algorithms, our new method is based on the observation that the random variable nodes in one topic model have all different periods of convergence. During the iterative approximation process, the proposed method allows each random variable node to be terminated or deactivated when it is converged. Therefore, compared to the traditional approximation ways in which usually every node is deactivated concurrently, the proposed method achieves the inference efficiency in terms of time and memory. We do not propose a new approximation algorithm, but a new process applicable to the existing approximation algorithms. Through experiments, we show the time and memory efficiency of the method, and discuss about the tradeoff between the efficiency of the approximation process and the parameter consistency.

• 지구물리와물리탐사
• /
• 제7권1호
• /
• pp.51-55
• /
• 2004

This paper presents a fast and stable imaging scheme using the localized nonlinear (LN) approximation of integral equation (IE) solutions for inverting electromagnetic data obtained in a crosswell survey. The medium is assumed to be cylindrically symmetric about a source borehole, and to maintain the symmetry a vertical magnetic dipole is used as a source. To find an optimum balance between data fitting and smoothness constraint, we introduce an automatic selection scheme for a Lagrange multiplier, which is sought at each iteration with a least misfit criterion. In this selection scheme, the IE algorithm is quite attractive for saving computing time because Green's functions, whose calculation is a most time-consuming part in IE methods, are repeatedly re-usable throughout the inversion process. The inversion scheme using the LN approximation has been tested to show its stability and efficiency, using both synthetic and field data. The inverted image derived from the field data, collected in a pilot experiment of water-flood monitoring in an oil field, is successfully compared with that derived by a 2.5-dimensional inversion scheme.