• Kyungpook Mathematical Journal
• /
• v.28 no.2
• /
• pp.185-196
• /
• 1988

We study existence of polynomial integrating factors and solutions F(x, y)=c of first order nonlinear differential equations. We characterize the homogeneous case, and give algorithms for finding existence of and a basis for polynomial solutions of linear difference and differential equations and rational solutions or linear differential equations with polynomial coefficients. We relate singularities to nature of the solution. Solution of differential equations in closed form to some degree might be called more an art than a science: The investigator can try a number of methods and for a number of classes of equations these methods always work. In particular integrating factors are tricky to find. An analogous but simpler situation exists for integrating inclosed form, where for instance there exists a criterion for when an exponential integral can be found in closed form. In this paper we make a beginning in several directions on these problems, for 2 variable ordinary differential equations. The case of exact differentials reduces immediately to quadrature. The next step is perhaps that of a polynomial integrating factor, our main study. Here we are able to provide necessary conditions based on related homogeneous equations which probably suffice to decide existence in most cases. As part of our investigations we provide complete algorithms for existence of and finding a basis for polynomial solutions of linear differential and difference equations with polynomial coefficients, also rational solutions for such differential equations. Our goal would be a method for decidability of whether any differential equation Mdx+Mdy=0 with polynomial M, N has algebraic solutions(or an undecidability proof). We reduce the question of all solutions algebraic to singularities but have not yet found a definite procedure to find their type. We begin with general results on the set of all polynomial solutions and integrating factors. Consider a differential equation Mdx+Ndy where M, N are nonreal polynomials in x, y with no common factor. When does there exist an integrating factor u which is (i) polynomial (ii) rational? In case (i) the solution F(x, y)=c will be a polynomial. We assume all functions here are complex analytic polynomial in some open set.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2876-2878
• /
• 2005

In this paper, we propose Genetic Algorithms(GAs)-based Optimal Polynomial Neural Networks(PNN). The proposed algorithm is based on Group Method of Data Handling(GMDH) method and its structure is similar to feedforward 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 modified quadratic, and is connected as various kinds of multi-variable inputs. The conventional PNN depends on experience of a designer that select No. of input variable, input variable and polynomial type. Therefore it is very difficult a organizing of optimized network. The proposed algorithm identified and selected No. of input variable, input variable and polynomial type by using Genetic Algorithms(GAs). In the sequel the proposed model shows not only superior results to the existing models, but also pliability in organizing of optimal network. The study is illustrated with the ACI Distance Relay Data for application to power systems.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.297-300
• /
• 2005

In this study, we proposed genetically optimized self-organizing fuzzy polynomial neural network based on information granulation and evolutionary algorithm (gdSOFPNN), develop a comprehensive design methodology involving mechanisms of genetic optimization. The proposed gdSOFPNN gives rise to a structural Iy and parametrically optimized network through an optimal parameters design available within FPN (viz. the number of input variables, the order of the polynomial, input variables, the number of membership functions, and the apexes of membership function). Here, with the aid of the information granulation, we determine the initial location (apexes) of membership functions and initial values of polynomial function being used in the premised and consequence part of the fuzzy rules respectively. The performance of the proposed gdSOFPNN is quantified through experimentation that exploits standard data already used in fuzzy modeling.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.346-348
• /
• 2004

In this rarer, we introduce a new Fuzzy Polynomial Neural Networks (FPNNs)-like structure whose neuron is based on the Fuzzy Set-based Fuzzy Inference System (FS-FIS) and is different from that of FPNNs based on the Fuzzy relation-based Fuzzy Inference System (FR-FIS) and discuss the ability of the new FPNNs-like structurenamed Fuzzy Set-based Polynomial Neural Networks (FSPNN). The premise parts of their fuzzy rules are not identical, while the consequent parts of the both Networks (such as FPNN and FSPNN) are identical. This difference results from the angle of a viewpoint of partition of input space of system. In other word, from a point of view of FS-FIS, the input variables are mutually independent under input space of system, while from a viewpoint of FR-FIS they are related each other. In considering the structures of FPNN-like networks such as FPNN and FSPNN, they are almost similar. Therefore they have the same shortcomings as well as the same virtues on structural side. The proposed design procedure for networks' architecture involves the selection of appropriate nodes with specific local characteristics such as the number of input variables, the order of the polynomial that is constant, linear, quadratic, or modified quadratic functions being viewed as the consequent part of fuzzy rules, and a collection of the specific subset of input variables. On the parameter optimization phase, we adopt Information Granulation (IG) based on HCM clustering algorithm and a standard least square method-based learning. Through the consecutive process of such structural and parametric optimization, an optimized and flexible fuzzy neural network is generated in a dynamic fashion. To evaluate the performance of the genetically optimized FSPNN (gFSPNN), the model is experimented with using gas furnace process dataset.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.321-331
• /
• 2003

Experimental software datasets describing software projects in terms of their complexity and development time have been the subject of intensive modeling. A number of various modeling methodologies and modeling designs have been proposed including such approaches as neural networks, fuzzy, and fuzzy neural network models. In this study, we introduce the concept of the Rule-based fuzzy polynomial neural networks (RFPNN) as a hybrid modeling architecture and discuss its comprehensive design methodology. The development of the RFPNN dwells on the technologies of Computational Intelligence (CI), namely fuzzy sets, neural networks, and genetic algorithms. The architecture of the RFPNN results from a synergistic usage of RFNN and PNN. RFNN contribute to the formation of the premise part of the rule-based structure of the RFPNN. The consequence part of the RFPNN is designed using PNN. We discuss two kinds of RFPNN architectures and propose a comprehensive learning algorithm. In particular, it is shown that this network exhibits a dynamic structure. The experimental results include well-known software data such as the NASA dataset concerning software cost estimation and the one describing software modules of the Medical Imaging System (MIS).

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.846-851
• /
• 2005

In this paper, we propose Genetic Algorithms(GAs)-based Optimized Polynomial Neural Networks(PNN). The proposed algorithm is based on Group Method of Data Handling(GMDH) method and its structure is similar to feedforward Neural Networks. But the structure of PNN is not fixed like in conventional neural networks and can be generated in a dynamic manner. As each node of PNN structure, we use several types of high-order polynomial such as linear, quadratic and modified quadratic, and it is connected as various kinds of multi-variable inputs. The conventional PNN depends on the experience of a designer that select the number of input variables, input variable and polynomial type. Therefore it is very difficult to organize optimized network. The proposed algorithm leads to identify and select the number of input variables, input variable and polynomial type by using Genetic Algorithms(GAs). The aggregate performance index with weighting factor is proposed as well. The study is illustrated with tile NOx omission process data of gas turbine power plant for application to nonlinear process. In the sequel the proposed model shows not only superb predictability but also high accuracy in comparison to the existing intelligent models.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.3
• /
• pp.145-151
• /
• 2003

This study focuses on the hardware implementation of fast and low-complexity multiplier over GF(2$^{m}$ ). Finite field multiplication can be realized in two steps: polynomial multiplication and modular reduction using the irreducible polynomial and we will treat both operation, separately. Polynomial multiplicative operation in this Paper is based on the Permestzi's algorithm, and irreducible polynomial is defined AOP. The realization of the proposed GF(2$^{m}$ ) multipleker-based multiplier scheme is compared to existing multiplier designs in terms of circuit complexity and operation delay time. Proposed multiplier obtained have low circuit complexity and delay time, and the interconnections of the circuit are regular, well-suited for VLSI realization.

• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.675-677
• /
• 1998

In this paper, we propose the fuzzy inference algorithm with multi-layer structure. MFIS(Multi-layer Fuzzy Inference System) uses PNN(Polynomial Neural networks) structure and the fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Hendling), and uses several types of polynomials such as linear, quadratic and cubic, as well as the biquadratic polynomial used in the GMDH. In the fuzzy inference method, the simplified and regression polynomial inference methods are used. Here, the regression polynomial inference is based on consequence of fuzzy rules with the polynomial equations such as linear, quadratic and cubic equation. Each node of the MFIS is defined as fuzzy rules and its structure is a kind of neuro-fuzzy structure. We use the training and testing data set to obtain a balance between the approximation and the generalization of process model. Several numerical examples are used to evaluate the performance of the our proposed model.

• Proceedings of the KSRS Conference
• /
• 2002.10a
• /
• pp.518-523
• /
• 2002

Nowadays the Rational Function Model (RFM), an abstract sensor model, is substituting physical sensor models for highly complicated imaging geometry. But RFM is algorithm to be required many Ground Control Points (GCP). In case of RFM of the third order, At least forty GCP are required far RFM generation. The purpose of this study is to research more efficient algorithm on GCP and accurate algorithm similar to RFM. The Polynomial Camera Model is relatively accurate and requires a little GCP in comparisons of RFM. This paper introduces how to generate Polynomial Camera Model and fundamental algorithms for construction of 3-D topographic data using the Polynomial Camera Model information in the Kompsat stereo pair and describes how to generate the 3-D ground coordinates by manual matching. Finally we tried to extract height information for the whole image area with the stereo matching technique based on the correlation.

• Journal of Nuclear Fuel Cycle and Waste Technology(JNFCWT)
• /
• v.19 no.4
• /
• pp.447-457
• /
• 2021

Graphite Isotope Ratio Method (GIRM) can be used to estimate plutonium production in a graphite-moderated reactor. This study presents verification results for the GIRM combined with a 3-D polynomial regression function to estimate cumulative plutonium production in a graphite-moderated reactor. Using the 3-D Monte-Carlo method, verification was done by comparing the cumulative plutonium production with the GIRM. The GIRM can estimate plutonium production for specific sampling points using a function that is based on an isotope ratio of impurity elements. In this study, the ¹⁰B/¹¹B isotope ratio was chosen and calculated for sampling points. Then, 3-D polynomial regression was used to derive a function that represents a whole core cumulative plutonium production map. To verify the accuracy of the GIRM with polynomial regression, the reference value of plutonium production was calculated using a Monte-Carlo code, MCS, up to 4250 days of depletion. Moreover, the amount of plutonium produced in certain axial layers and fuel pins at 1250, 2250, and 3250 days of depletion was obtained and used for additional verification. As a result, the difference in the total cumulative plutonium production based on the MCS and GIRM results was found below 3.1% with regard to the root mean square (RMS) error.