• 제목/요약/키워드: Polynomial equation

Search Result 401, Processing Time 0.036 seconds

Fuzzy Polynomial Neural Networks with Fuzzy Activation Node (퍼지 활성 노드를 가진 퍼지 다항식 뉴럴 네트워크)

  • Park, Ho-Sung;Kim, Dong-Won;Oh, Sung-Kwun
    • Proceedings of the KIEE Conference
    • /
    • 2000.07d
    • /
    • 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.

  • PDF

An Efficient Rectification Algorithm for Spaceborne SAR Imagery Using Polynomial Model

  • Kim, Man-Jo
    • Korean Journal of Remote Sensing
    • /
    • v.19 no.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.

Monitoring on Characteristics of Soybean Flour Hydrolyzed by Various Proteolytic Conditions (콩분말의 단백질 가수분해 조건에 따른 특성 모니터링)

  • Jeong Kyo-Ho;Seo Ji-Hyung;Kim Jeong-Hoon;Kim Kwang-Soo;Jeong Yong-Jin
    • Food Science and Preservation
    • /
    • v.13 no.1
    • /
    • pp.71-76
    • /
    • 2006
  • We monitored the characteristics of soybean hydrolysate prepared under various hydrolysis condition using response surface methodology. The yield was affected by protease content but 1be effect of hydrolysis time to yield gradually increased at over $0.4\%$ of protease, while the $R^2$ of polynomial equation was 0.978 (p<0.01). The soluble solid enlarged by increase of both variables and the $R^2$ of polynomial equation was 0.954 (p<0.01). The degree of hydrolysis was affected by protease content at low (under $0.4\%$) protease and maximized at $0.57\%$ protease and 5.49 hrs. The $R^2$ of polynomial equation for the degree of hydrolysis was 0.916 (P<0.05). The calcium intolerance capacity showed similar pattern like yield but the effect of hydrolysis time was rapidly increased at over $0.4\%$ protease. The $R^2$ of polynomial equation for calcium intolerance capacity was 0.932 (p<0.05). The total phenolic compounds increased in proportion to protease content and hydrolysis time, while the $R^2$ of polynomial equation was 0.920 (p<0.05). According to the results of this study, the optimal conditions for soybean hydrolysis were predicted to be $0.51\~0.66\%$ of protease and $6.5\~9.0\;hrs$, and the predicted values and actual values of each response variable were similar to each other when the hydrolysis was performed at a random point within the optimal range.

An Effective Auto-Focusing Method for Curved Panel Inspection System (곡면 패널 검사를 위한 효율적인 오토 포커싱 방법)

  • Lee, Hwang-Ju;Park, Tae-Hyoung
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.66 no.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.

Design of an Area-efficient DCME Algorithm for High-speed Reed-Solomon Decoder (고속 Reed-Solomon 복호기를 위한 면적 효율적인 DCME 알고리즘 설계)

  • Kang, Sung Jin
    • Journal of the Semiconductor & Display Technology
    • /
    • v.13 no.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.

GLOBAL ATTRACTOR FOR A SEMILINEAR PSEUDOPARABOLIC EQUATION WITH INFINITE DELAY

  • Thanh, Dang Thi Phuong
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.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.

A PARTICULAR SOLUTION OF THE EINSTEIN'S EQUATION IN EVEN-DIMENSIONAL UFT Xn

  • Lee, Jong Woo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.23 no.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$.

SKEW-SYMMETRIC SOLVENT FOR SOLVING A POLYNOMIAL EIGENVALUE PROBLEM

  • Han, Yin-Huan;Kim, Hyun-Min
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.26 no.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.

SOLVING A MATRIX POLYNOMIAL BY NEWTON'S METHOD

  • Han, Yin-Huan;Kim, Hyun-Min
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.14 no.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.