• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권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.

• 대한수학회지
• /
• 제46권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}$.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2000년도 춘계학술대회 학술발표 논문집
• /
• 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.

• 한국수학교육학회지시리즈E:수학교육논문집
• /
• 제22권4호
• /
• pp.505-514
• /
• 2008

방정식의 가해성 탐구는 수학사의 중요한 연구주제의 하나였으며, 삼차방정식과 사차방정식의 일반적인 해법은 교사양성기관의 현대대수학 교과에서 다루는 중요한 내용이다. 본 연구에서는 norm형식의 개념을 바탕으로 이차방정식의 근의 공식에 대한 방법유추를 통해 삼차방정식의 근의 공식을 유도하고, 삼차방정식의 근의 공식에 대한 방법유추를 통해 사차방정식의 근의 공식을 유도하였다.

• 한국정보처리학회논문지
• /
• 제6권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
• /
• 제1권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.

• 정보처리학회논문지B
• /
• 제10B권4호
• /
• pp.373-380
• /
• 2003

대부분의 저가형 디지털 카메라에 사용되는 광학계의 경우 상대적으로 심한 렌즈 왜곡을 보이고 있다. 본 연구의 목적은 렌즈의 기하학적 왜곡에 의한 영상 품질의 저하를 보정하려는 것으로 Tsai의 카메라 캘리브레이션 방법을 단순화한 렌즈 왜곡 변수 계산 방법 및 계산된 렌즈 왜곡 변수를 이용하여 왜곡된 원영상을 이미지 워핑을 통해 보정하는 방법을 제안한다. 렌즈 왜곡 변수 계산 단계에서는 카메라 캘리브레이션 과정의 단순화를 위해 scale factor ratio 및 이미지 센터를 처리하는 실질적인 방식에 대해 보고하며 정량적인 이미지 품질 척도를 이용하여 왜곡보정 효과를 측정함으로써 제안된 방법의 타당성을 보인다. 한편, 렌즈 왜곡 변수 계산 단계에서의 결과를 바탕으로 이미지 워핑을 적용하기 위해 역공간 매핑 방식을 적용하는 경우 본 연구에서 적용된 방사상 렌즈 왜곡 모델의 정확한 해를 구하기 위해서는 3차 방정식의 해를 구하여야 한다. 본 논문에서는 정보기기로의 내장형 구현에 필수적인 실시간 처리를 목적으로 2차 방정식으로의 근사화 방법을 제안한다. 실험을 통하여 제안된 근사화 방법의 실시간 구현 가능성을 보이며 아울러 3차 방정식의 해를 이용한 이미지 워핑의 경우와 성능이 동등함을 보인다.

• 한국정밀공학회지
• /
• 제24권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
• /
• 제5권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.

• 말소리와 음성과학
• /
• 제9권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.