• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.49 no.3
• /
• pp.145-156
• /
• 2000

In this paper, we propose a new methodology which includes the optimal design procedure of Polynomial Neural Networks(PNN) structure for model identification of complex and nonlinear system. The proposed PNN algorithm is based on GMDA(Group Method of Data handling) method and its structure is similar to Neural Networks. But the structure of PNN is not fixed like in conventional Neural Networks and can be generated. The each node of PNN structure uses several types of high-order polynomial such as linear, quadratic and cubic, and is connected as various kinds of multi-variable inputs. In other words, the PNN uses high-order polynomial as extended type besides quadratic polynomial used in GMDH, and the number of input of its node in each layer depends on that of variables used in the polynomial. The design procedure to obtain an optimal model structure utilizing PNN algorithm is shown in each stage. The study is illustrated with the aid of pH neutralization process data besides representative time series data for gas furnace process used widely for performance comparison, and shows that the proposed PNN algorithm can produce the model with higher accuracy than previous other works. And performance index related to approximation and prediction capabilities of model is evaluated and also discussed.

• Journal of the Korean Mathematical Society
• /
• v.46 no.1
• /
• pp.1-12
• /
• 2009

Motivated by XTR cryptosystem which is based on an irreducible polynomial $x^3-cx^2+c^px-1$ over $F_{p^2}$, we study polynomials of the form $F(c,x)=x^3-cx^2+c^qx-1$ over $F_{p^2}$ with $q=p^m$. In this paper, we establish a one to one correspondence between the set of such polynomials and a certain set of cubic polynomials over $F_q$. Our approach is rather theoretical and provides an efficient method to generate irreducible polynomials over $F_{p^2}$.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.86-89
• /
• 2000

In this paper, we consider a fuzzy system representation for polynomials of two variables. The representation we use is an exact transformation of the corresponding cubic spline interpolation function. We examine some of the properties of their fuzzy rule tables md prove that the rule table is symmetric or antisymmetric depending on whether the polynomial is symmetric or antisymmetric. A few examples are included to verify our proof. These results not only provide some insights on properties of the cubic spline interpolation coefficients but also provide some help in setting up fuzzy rule tables for functions of two variables.

• Communications of Mathematical Education
• /
• v.22 no.4
• /
• pp.505-514
• /
• 2008

In this paper we study on derivation of formulas for roots of quadratic equation, cubic equation, and quartic equation through method analogy. Our argument is based on the norm form of polynomial. We also present some mathematical content knowledge related with main discussion of this article.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.3
• /
• pp.758-765
• /
• 1999

Shape-preserving property is the important method that controls the complex free form curve/surface. Interpolation method for the existed Shape-Preservation had problems that it has needed the minimization of a curvature-related functions for calculating single-valued data. Solving this problem, in this paper, it proposed to the algorithm of generalizing C piecewise parametric cubic that has shape-preserving property for both Single-value data and Multivalue data. When there are the arbitrary tangents and two data, including shape-preserving property, this proposed method gets piecewise parametric cubic polynomial by checking the relation between the shape-preserving property and then calculates efficiently the control points using that. Also, it controls the initial shape using curvature distribution on curve segments.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.1 no.1
• /
• pp.75-82
• /
• 1997

An algorithm for computing the cubic spline interpolation coefficients for polynomials is presented in this paper. The matrix equation involved is solved analytically so that numerical inversion of the coefficient matrix is not required. For $f(t)=t^m$, a set of constants along with the degree of polynomial m are used to compute the coefficients so that they satisfy the interpolation constraints but not necessarily the derivative constraints. Then, another matrix equation is solved analytically to take care of the derivative constraints. The results are combined linearly to obtain the unique solution of the original matrix equation. This algorithm is tested and verified numerically for various examples.

• The KIPS Transactions:PartB
• /
• v.10B no.4
• /
• pp.373-380
• /
• 2003

Most of low cost digital cameras reveal relatively high lens distortion. The purpose of this research is to compensate the degradation of image quality due to the geometrical distortion of a lens system. The proposed method consists of two stages : calculation of a lens distortion coefficient by a simplified version of Tsai´s camera calibration and subsequent image warping of the original distorted image to remove geometrical distortion based on the calculated lens distortion coefficient. In the lens distortion coefficient calculation stage, a practical method for handling scale factor ratio and image center is proposed, after which its feasibility is shown by measuring the performance of distortion correction using a quantitative image quality measure. On the other hand, in order to apply image warping via inverse spatial mapping using the result of the lens distortion coefficient calculation stage, a cubic polynomial derived from an adopted radial distortion lens model must be solved. In this paper, for the purpose of real-time operation, which is essential for embedding into an information device, an approximated solution to the cubic polynomial is proposed in the form of a solution to a quadratic equation. In the experiment, potential for real-time implementation and equivalence in performance as compared with that from cubic polynomial solution are shown.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.11
• /
• pp.144-153
• /
• 2007

In order to generate the input data for rapid prototyping, a new approach which is based on the implicit surface interpolation method is presented. In the method a surface is reconstructed by creating smooth implicit surface from unorganized cloud of points through which the surface should pass. In the method an implicit surface is defined by the adaptive local shape functions including quadratic polynomial function, cubic polynomial function and RBF(Radial Basis Function). By the reconstruction of a surface, various types of error in raw STL file including degenerated triangles, undesirable holes with complex shapes and overlaps between triangles can be eliminated automatically. In order to get the slicing data for rapid prototyping an efficient intersection algorithm between implicit surface and plane is developed. For the direct usage for rapid prototyping, a robust transformation algorithm for the generation of complete STL data of solid type is also suggested.

• Journal of applied mathematics & informatics
• /
• v.5 no.2
• /
• pp.507-516
• /
• 1998

In this study we are concerned with the problem of ap-proximating a locally unique solution of an equation on a Banach space. A semilocal convergence theorem is given for the Super-Halley method in Banach spaces. Earlier results have shown that the order of convergence is four for a certain class of operators [4] [5] [8] These results were not given in affine invariant form and made use of a real quadratic majorizing polynomial. Here we provide our re-sults in affine invariant form showing that the order of convergence is at least four. In cases that it is exactly four the rate of convergence is improved. We achieve these results by using a cubic majorizing polynomial. Some numerical examples are given to show that our error bounds are better than earlier ones.

• Phonetics and Speech Sciences
• /
• v.9 no.3
• /
• pp.17-23
• /
• 2017

The present study investigates the effect of Accentual Phrase on F0 using a subset of large-scale corpus of Seoul Korean. Four syllable words which were neither preceded nor followed by silent pauses were presumed to be canonical exemplars of Accentual Phrases in Korean. These four syllable words were extracted from female speakers' speech samples. Growth curve analyses, combination of regression and polynomial curve fitting, were applied to the four syllable words. Four syllable words were divided into four groups depending on the categorical status of the initial segment: voiceless obstruents, voiced obstruents, sonorants, and vowels. Results of growth curve analyses indicate that initial segment types have an effect on the F0 (in semitone) in the nucleus of the initial syllable, and the cubic polynomial term revealed that some of the medial low tones in the 4 syllable words may be guided by the principle of contrast maximization, while others may be governed by the principle of ease of articulation.