• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 하계학술대회 논문집 D
• /
• pp.2946-2948
• /
• 2000

In this paper, we proposed the Fuzzy Polynomial Neural Networks(FPNN) model with fuzzy activation node. The proposed FPNN structure is generated from the mutual combination of PNN(Polynomial Neural Networks) structure and fuzzy inference system. The premise of fuzzy inference rules defines by triangular and gaussian type membership function. The fuzzy inference method uses simplified and regression polynomial inference method which is based on the consequence of fuzzy rule expressed with a polynomial such as linear, quadratic and modified quadratic equation are used. The structure of FPNN is not fixed like in conventional Neural Networks and can be generated. The design procedure to obtain an optimal model structure utilizing FPNN algorithm is shown in each stage. Gas furnace time series data used to evaluate the performance of our proposed model.

• 대한원격탐사학회지
• /
• 제19권5호
• /
• pp.363-370
• /
• 2003

This paper describes a rectification procedure that relies on a polynomial model derived from the imaging geometry without loss of accuracy. By using polynomial model, one can effectively eliminate the iterative process to find an image pixel corresponding to each output grid point. With the imaging geometry and ephemeris data, a geo-location polynomial can be constructed from grid points that are produced by solving three equations simultaneously. And, in order to correct the local distortions induced by the geometry and terrain height, a distortion model has been incorporated in the procedure, which is a function of incidence angle and height at each pixel position. With this function, it is straightforward to calculate the pixel displacement due to distortions and then pixels are assigned to the output grid by re-sampling the displaced pixels. Most of the necessary information for the construction of polynomial model is available in the leader file and some can be derived from others. For validation, sample images of ERS-l PRI and Radarsat-l SGF have been processed by the proposed method and evaluated against ground truth acquired from 1:25,000 topography maps.

• 한국식품저장유통학회지
• /
• 제13권1호
• /
• pp.71-76
• /
• 2006

반응표면분석법을 이용하여 가수분해 조건에 콩 가수분해물의 품질 특성을 모니터링 하였다. 수율은 protease 농도에 크게 영향을 받았으며, $0.4\%$ 이상의 농도에서는 가수분해 시간의 영향이 점차 증가하였다. 수율에 대한 회귀식의 $R^2$는 0.978로서 $1\%$ 이내에서 유의성이 인정되었다 가용성고형분은 pretense첨가량과 가수분해시간의 영향이 모두 나타났으며, 회귀식의 $R^2$는 0.954로서 $1\%$ 이내에서 유의성이 인정되었다. 가수분해도는 pretense첨가량이 높을수록 증가하다가 최대점(pretense첨가량 $0.57\%$, 가수분해시간 5.49hrs) 이후에는 감소하는 경향이었으며, 회귀식의 $R^2$는 0.916으로 $5\%$ 이내에서 유의성이 인정되었다. 칼슘내인성은 protease첨가량의 영향이 크게 작용하였으나 $0.4\%$ 이상의 protease에서는 가수분해 시간의 영향이 급격히 증가하였으며, 회귀식의 $R^2$는 0.932로서 $5\%$ 이내에서 유의성이 인정되었다 총 페놀성 물질은 pretense첨가량과 가수분해 시간에 비례적으로 증가하였으며, 회귀식의 $R^2$는 0.920으로 $5\%$ 이내에서 유의성이 인정되었다. 이상의 결과 콩분말의 최적 가수분해조건은 protease첨가량 $0.51\~0.66\%$, 가수분해 시간 $6.5\~9.0\;hrs$의 조건으로 예측되었으며, 최적 조건으로 제조한 가수분해물의 실측치는 예측치와 유사하였다.

• 전기학회논문지
• /
• 제66권4호
• /
• pp.709-714
• /
• 2017

The curved panel is widely used for display of TVs and smart phones. This paper proposes a new auto-focusing method for curved panel inspection system. Since the distance between the camera and the panel varies with the curve position, the camera should change its focus at every inspection time. In order to reduce the focusing time, we propose an effective focusing method that considers the mathematical model of panel curve. The Lagrange polynomial equation is applied to modeling the panel curve. The foci of initial three points are used to get the curve equation, and the other foci are calculated automatically from the curve equation. The experiment result shows that the proposed method can reduce the focusing time.

• 반도체디스플레이기술학회지
• /
• 제13권4호
• /
• pp.7-13
• /
• 2014

In this paper, an area-efficient degree-computationless modified Euclidean (DCME) algorithm is presented and implemented for high-speed Reed-Solomon (RS) decoder. The DCME algorithm can be used to solve the key equation in Reed-Solomon decoder to get the error location polynomial and the error value polynomial. A pipelined recursive structure is adopted for reducing the area of key equation solver (KES) block with sacrifice of an amount of decoding latency. For comparisons, KES block for RS(255,239,8) decoder with the proposed architecture is implemented using Verilog HDL and synthesized using Synopsys design tool and 65nm CMOS technology. The synthesis results show that the proposed architecture can be implemented with less gate counts than other existing DCME architectures.

• East Asian mathematical journal
• /
• 제34권5호
• /
• pp.633-641
• /
• 2018

A viscoelastic wave equation in canonical form weakly nonlinear time dependent dissipation and source terms is investigated in this paper. And we establish a general decay result which is not necessarily of exponential or polynomial type.

• 대한수학회논문집
• /
• 제32권3호
• /
• pp.579-600
• /
• 2017

In this paper we consider a semilinear pseudoparabolic equation with polynomial nonlinearity and infinite delay. We first prove the existence and uniqueness of weak solutions by using the Galerkin method. Then, we prove the existence of a compact global attractor for the continuous semigroup associated to the equation. The existence and exponential stability of weak stationary solutions are also investigated.

• 충청수학회지
• /
• 제23권2호
• /
• pp.185-195
• /
• 2010

In the unified field theory(UFT), in order to find a solution of the Einstein's equation it is necessary and sufficient to study the torsion tensor. The main goal in the present paper is to obtain, using a given torsion tensor (3.1), the complete representation of a particular solution of the Einstein's equation in terms of the basic tensor $g_{{\lambda}{\nu}}$ in even-dimensional UFT $X_n$.

• 충청수학회지
• /
• 제26권2호
• /
• pp.275-285
• /
• 2013

In this paper a nonlinear matrix equation is considered which has the form $$P(X)=A_0X^m+A_1X^{m-1}+{\cdots}+A_{m-1}X+A_m=0$$ where X is an $n{\times}n$ unknown real matrix and $A_m$, $A_{m-1}$, ${\cdots}$, $A_0$ are $n{\times}n$ matrices with real elements. Newtons method is applied to find the skew-symmetric solvent of the matrix polynomial P(X). We also suggest an algorithm which converges the skew-symmetric solvent even if the Fr$\acute{e}$echet derivative of P(X) is singular.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.113-124
• /
• 2010

We consider matrix polynomial which has the form $P_1(X)=A_oX^m+A_1X^{m-1}+...+A_m=0$ where X and $A_i$ are $n{\times}n$ matrices with real elements. In this paper, we propose an iterative method for the symmetric and generalized centro-symmetric solution to the Newton step for solving the equation $P_1(X)$. Then we show that a symmetric and generalized centro-symmetric solvent of the matrix polynomial can be obtained by our Newton's method. Finally, we give some numerical experiments that confirm the theoretical results.