• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.1025-1028
• /
• 1998

Hardware to implement the parallelized Floating-point rounding algorithm is described. For parallelized additions, we propose an addition module which has carry selection logic to generate two results accoring to the input valuse. A multiplication module for parallelized multiplications is also proposed to generate Sum and Carry bits as intermediate results. Since these modules process data in IEEE standard Floatingpoint double precision format, they are designed for 53-bit significands including hidden bits. Multiplication module is designed with a Booth multiplier and an array multiplier.

• Communications for Statistical Applications and Methods
• /
• v.5 no.2
• /
• pp.353-359
• /
• 1998

Factorial designs with two-level factors represent the smallest factorial experiments. The system of notation and confounding and fractional factorial schemes developed for the $2^N$system are found in standard textbooks of experimental designs. Just as in the $2^N$ system, the general confounding and fractional factorial schemes are possible in $3^N,5^N$, .... , and $\rho^N$ where $\rho$ is a prime number. Hence, we have the $\rho^N$ system. In this article, the author proposes a new algorithm for constructing fractional factorial plans in the $\rho^N$ system.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1245-1256
• /
• 2011

In this paper, we proposed a regularization interior point method for semidefinite programming with free variables which can be taken as an extension of the algorithm for standard semidefinite programming. Since an inexact search direction at each iteration is used, the computation of the designed algorithm is much less compared with the existing solution methods. The convergence analysis of the method is established under weak conditions.

• Communications for Statistical Applications and Methods
• /
• v.10 no.3
• /
• pp.845-857
• /
• 2003

We explore the use of genetic programming to evolve decision trees directly for classification problems with both discrete and continuous predictors. We demonstrate that the derived hypotheses of standard algorithms can substantially deviated from the optimum. This deviation is partly due to their top-down style procedures. The performance of the system is measured on a set of real and simulated data sets and compared with the performance of well-known algorithms like CHAID, CART, C5.0, and QUEST. Proposed algorithm seems to be effective in handling problems caused by top-down style procedures of existing algorithms.

• Vacuum Magazine
• /
• v.2 no.3
• /
• pp.4-10
• /
• 2015

We developed a real-time three-polarizer spectroscopic ellipsometer based on a new data acquisition algorithm and a general data reduction (the process of extracting the ellipsometric sample parameters from the Fourier coefficients). The data acquisition algorithm measures Fourier coefficients of radiant flux waveform accurately and precisely. The general data reduction is introduced to represent the analytic functions of the standard uncertainties of the ellipsometric sample parameters, and the extracted theoretical values closely agree with the corresponding experimental data. Our approach can be used for optimization of measurement conditions, instrumentation, simulation, standardization, laboratory accreditation, and metrology.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.917-920
• /
• 1998

In this paper, we propose a modified elman neural network structure for nonlinear system identification. The proposed structure is that all of network output feed back into hidden units and output units. Learning algorithm is standard back-propagation algorithm. The simulation showed the effectiveness of using the modified elman neural network structure in the nonlinear system identification.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.791-792
• /
• 2008

We present a new algorithm for VLC table prediction in H.264 context-based adaptive variable length coding (CAVLC). Using both the correlation of coding modes and the statistics of the mode distribution in intra and inter frames, we can predict an appropriate VLC table of the given $4{\times}4$ block. Experimental results demonstrate that the proposed algorithm reduces the bit rate about 0.97% on average, compared to the H.264/AVC standard.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.1091-1094
• /
• 1999

In this paper, we propose new algorithms to construct video object planes(VOP’s) for MPEG-4. VOP’s allow the new video standard MPEG-4 to enable content-based funtionalities. A comprehensive review summarizes some of the most important VOP’s generation techniques that have been proposed. The proposed algorithm use segmentation technique as labeling and motion estimation as three-step search algorithm(TSS). It is improved by a labeling technique that distinguishes background and object from a frame.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.150-158
• /
• 1998

This paper describes the classification of remotely sensed image data using fuzzy neural network, whose algorithm was obtained by replacing real numbers used for inputs and outputs in the standard back propagation algorithm with fuzzy numbers. In the proposed method, fuzzy patterns, generated based on the histogram ofeach category for the training data, are put into the fuzzy neural network with real numbers. The results show that the generalization and appoximation are better than that ofthe conventional network in determining the complex boundary of patterns.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.2
• /
• pp.83-96
• /
• 2011

This work proposes a binomial method for pricing the cliquet options, which provide a guaranteed minimum annual return. The proposed binomial tree algorithm simplifies the standard binomial approach, which is problematic for cliquet options in the computational point of view, or other recent methods, which may be of intricate algorithm or require pre- or post-processing computations. Our method is simple, efficient and reliable in a Black-Scholes framework with constant interest rates and volatilities.