• Journal of applied mathematics & informatics
• /
• v.6 no.3
• /
• pp.851-858
• /
• 1999

A new problem of the theory of finite automata (Rabin-Scott's automata) is considered. So called basis automaton for the given regular language l is defined. this automaton is unique for the given L, it is defined by two au-tomata of canonical form: for L and for its inverse language LR. Some properties of basis automata are considered. Such properties make these automata most convenient for using in some special tasks dealing with the given regular language.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.10a
• /
• pp.61-65
• /
• 2006

This paper describes a recent development on the divergence free basis function based on a hermite stream function. The well-known cavity problem has been used to compare the accuracy and the convergence of the present method with those of a modified residual method known as one of the stabilized finite element methods. The comparison showed the present method performs better in the accuracy and convergence.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.411-414
• /
• 2006

This paper describes a recent development on the divergence free basis function based on a hermite stream function. The well-known cavity problem has been used to compare the accuracy and the convergence of the present method with those of a modified residual method known as one of the stabilized finite e1ement methods. The comparison showed the present method performs better in the accuracy and convergence.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 1991.11a
• /
• pp.49-57
• /
• 1991

Several variants of the Diffie-Hellman public key distribution are examined, and a simple and relatively secure public key distribution protocol is introduced. Using a normal basis of GF(2$^{m}$ ), this protocol is implemented, and simulated in software. A program is developed, whereby a normal basis is effectively searched for fast multiplication in GF(2$^{m}$ ).

• Journal of the Korean Mathematical Society
• /
• v.47 no.1
• /
• pp.41-62
• /
• 2010

In this article, we discuss a Grobner basis algorithm related to the stability of algebraic varieties in the sense of Geometric Invariant Theory. We implement the algorithm with Macaulay 2 and use it to prove the stability of certain curves that play an important role in the log minimal model program for the moduli space of curves.

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

In this paper, we propose an adaptive controller using RBFN(radial basis function network) for robot manipulators The structure of the proposed controller consists of a RBFN and VSC-1 ike control. RBFN is used in order to approximate かon system, and VSC-like control to guarantee robustness On the basis of the Lyapunov stability theorem, we guarantee the stability for the total system. And the learning law of RBFN is established by the Lyapunov method, Finally, we apply the proposed controller to tracking control for a 2 link SCARA type robot manipulator.

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

Highly nonlinear dynamical systems are easily identified using neural networks. When disturbances are included in the learning data set Int system modeling, modeling process will be poorly performed. Since the radial basis functions in the radial basis function network(RBFN) are centered at the points specified by the weights, RBF networks are robust for approximating the process including the narrow-band disturbances deviating significantly from the regular signals. To exclude(filter) these disturbances, a robust algorithm for system identification, based on the RBFN, is proposed. The performance of system identification excluding disturbances is investigated and compared with the one including disturbances.

• Journal of the Korean Data and Information Science Society
• /
• v.19 no.4
• /
• pp.1465-1476
• /
• 2008

In recent years wavelet methods have been focused on block shrinkage or thresholding approaches to accounting for the sparseness of the wavelet representation for an unknown function. The block shrinkage or thresholding methods have been developed in both of classical methods and Bayesian methods. In this paper, we propose a Bayesian approach to selecting wavelet basis functions at each resolution level without MCMC procedure. Simulation study and an application are shown.

• Communications for Statistical Applications and Methods
• /
• v.15 no.3
• /
• pp.379-386
• /
• 2008

In this paper, the choice of a primary resolution and wavelet basis functions are introduced under random or irregular design points of which the sample size is free of a power of two. Most wavelet methods have used the number of the points as the primary resolution. However, it turns out that a proper primary resolution is much affected by the shape of an unknown function. The proposed methods are illustrated by some simulations.

• The Pure and Applied Mathematics
• /
• v.17 no.4
• /
• pp.321-332
• /
• 2010

In this paper, we experiment image warping and morphing. In image warping, we use radial basis functions : Thin Plate Spline, Multi-quadratic and Gaussian. Then we obtain the fact that Thin Plate Spline interpolation of the displacement with reverse mapping is the efficient means of image warping. Reflecting the result of image warping, we generate two examples of image morphing.