• Kyungpook Mathematical Journal
• /
• v.58 no.1
• /
• pp.183-202
• /
• 2018

${\Delta}-moves$ are closely related with a Vassiliev invariant of degree 2. For classical knots, M. Okada showed that the second coefficients of the Conway polynomials of two knots differ by 1 if the two knots are related by a single ${\Delta}-move$. The first author extended the Okada's result for virtual knots by using a Vassiliev invariant of virtual knots of type 2 which is induced from the Kauffman polynomial of a virtual knot. The arrow polynomial is a generalization of the Kauffman polynomial. We will generalize this result by using Vassiliev invariants of type 2 induced from the arrow polynomial of a virtual knot and give a lower bound for the number of ${\Delta}-moves$ transforming $K_1$ to $K_2$ if two virtual knots $K_1$ and $K_2$ are related by a finite sequence of ${\Delta}-moves$.

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

In this paper, a new design methodology named FNNN(Fuzzy Polynomial Neural Network) algorithm is proposed to identify the structure and parameters of fuzzy model using PNN(Polynomial Neural Network) structure and a fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Handling), and uses several types of polynomials such as linear, quadratic and modified quadratic besides the biquadratic polynomial used in the GMDH. 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. Each node of the FPNN is defined as fuzzy rules and its structure is a kind of neuro-fuzzy architecture Several numerical example are used to evaluate the performance of out proposed model. Also we used the training data and testing data set to obtain a balance between the approximation and generalization of proposed model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.11a
• /
• pp.483-487
• /
• 2005

We introduce a new architecture of hetero-hybridized feed-forward neural networks composed of fuzzy set-based polynomial neural networks (FSPNN) and polynomial neural networks (PM) that are based on a genetically optimized multi-layer perceptron and develop their comprehensive design methodology involving mechanisms of genetic optimization and Information Granulation. The construction of Information Granulation based HFSPNN (IG-HFSPNN) exploits fundamental technologies of Computational Intelligence(Cl), namely fuzzy sets, neural networks, and genetic algorithms(GAs) and Information Granulation. The architecture of the resulting genetically optimized Information Granulation based HFSPNN (namely IG-gHFSPNN) results from a synergistic usage of the hybrid system generated by combining new fuzzy set based polynomial neurons (FPNs)-based Fuzzy Neural Networks(PM) with polynomial neurons (PNs)-based Polynomial Neural Networks(PM). The design of the conventional genetically optimized HFPNN exploits the extended Group Method of Data Handling(GMDH) with some essential parameters of the network being tuned by using Genetie Algorithms throughout the overall development process. However, the new proposed IG-HFSPNN adopts a new method called as Information Granulation to deal with Information Granules which are included in the real system, and a new type of fuzzy polynomial neuron called as fuzzy set based polynomial neuron. The performance of the IG-gHFPNN is quantified through experimentation.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.12-14
• /
• 2005

In this paper, we propose a new architecture of Self-Organizing Fuzzy Polynomial Neural Networks(SOFPNN) by means of genetically optimized fuzzy polynomial neuron(FPN) and discuss its comprehensive design methodology involving mechanisms of genetic optimization, especially genetic algorithms(GAs). The conventional SOFPNNs hinges on an extended Group Method of Data Handling(GMDH) and exploits a fixed fuzzy inference type in each FPN of the SOFPNN as well as considers a fixed number of input nodes located in each layer. The design procedure applied in the construction of each layer of a SOFPNN deals with its structural optimization involving the selection of preferred nodes (or FPNs) with specific local characteristics (such as the number of input variables, the order of the polynomial of the consequent part of fuzzy rules, a collection of the specific subset of input variables, and the number of membership function) and addresses specific aspects of parametric optimization. Therefore, the proposed SOFPNN gives rise to a structurally optimized structure and comes with a substantial level of flexibility in comparison to the one we encounter in conventional SOFPNNs. To evaluate the performance of the genetically optimized SOFPNN, the model is experimented with using two time series data(gas furnace and chaotic time series).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.639-647
• /
• 2011

In this paper, we introduce a design methodology of data-centroid Radial Basis Function neural networks with extended polynomial function. The two underlying design mechanisms of such networks involve K-means clustering method and Particle Swarm Optimization(PSO). The proposed algorithm is based on K-means clustering method for efficient processing of data and the optimization of model was carried out using PSO. In this paper, as the connection weight of RBF neural networks, we are able to use four types of polynomials such as simplified, linear, quadratic, and modified quadratic. Using K-means clustering, the center values of Gaussian function as activation function are selected. And the PSO-based RBF neural networks results in a structurally optimized structure and comes with a higher level of flexibility than the one encountered in the conventional RBF neural networks. The PSO-based design procedure being applied at each node of RBF neural networks leads to the selection of preferred parameters with specific local characteristics (such as the number of input variables, a specific set of input variables, and the distribution constant value in activation function) available within the RBF neural networks. To evaluate the performance of the proposed data-centroid RBF neural network with extended polynomial function, the model is experimented with using the nonlinear process data(2-Dimensional synthetic data and Mackey-Glass time series process data) and the Machine Learning dataset(NOx emission process data in gas turbine plant, Automobile Miles per Gallon(MPG) data, and Boston housing data). For the characteristic analysis of the given entire dataset with non-linearity as well as the efficient construction and evaluation of the dynamic network model, the partition of the given entire dataset distinguishes between two cases of Division I(training dataset and testing dataset) and Division II(training dataset, validation dataset, and testing dataset). A comparative analysis shows that the proposed RBF neural networks produces model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Korean Journal of Mathematics
• /
• v.29 no.4
• /
• pp.775-784
• /
• 2021

For the polynomial P(z) of degree n and having all its zeros in |z| ≤ k, k ≥ 1, Jain [6] proved that $${{\max\limits_{{\mid}z{\mid}=1}}\;{\mid}P^{\prime}(z){\mid}{\geq}n\;{\frac{{\mid}c_0{\mid}+{\mid}c_n{\mid}k^{n+1}}{{\mid}c_0{\mid}(1+k^{n+1})+{\mid}c_n{\mid}(k^{n+1}+k^{2n})}\;{\max\limits_{{\mid}z{\mid}=1}}\;{\mid}P(z){\mid}$$. In this paper, we extend above inequality to its integral analogous and there by obtain more results which extended the already proved results to integral analogous.

• 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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.2
• /
• pp.398-406
• /
• 2011

In this paper, we introduce a new architecture of PSO-based Polynomial Neural Networks (PNN) and discuss its comprehensive design methodology. The conventional PNN is based on a extended Group Method of Data Handling (GMDH) method, and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons located in each layer through a growth process of the network. Moreover it does not guarantee that the conventional PNN generated through learning results in the optimal network architecture. The PSO-based PNN results in a structurally optimized structure and comes with a higher level of flexibility that the one encountered in the conventional PNN. The PSO-based design procedure being applied at each layer of PNN leads to the selection of preferred PNs with specific local characteristics (such as the number of input variables, input variables, and the order of the polynomial) available within the PNN. In the sequel, two general optimization mechanisms of the PSO-based PNN are explored: the structural optimization is realized via PSO whereas in case of the parametric optimization we proceed with a standard least square method-based learning. To evaluate the performance of the PSO-based PNN, the model is experimented with using Gas furnace process data, and pH neutralization process data. For the characteristic analysis of the given entire data with non-linearity and the construction of efficient model, the given entire system data is partitioned into two type such as Division I(Training dataset and Testing dataset) and Division II(Training dataset, Validation dataset, and Testing dataset). A comparative analysis shows that the proposed PSO-based PNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• Tunnel and Underground Space
• /
• v.6 no.1
• /
• pp.69-74
• /
• 1996

High temperature confined compressive tests for thermomechanical failure criteria were carried out for Iksan and Whandeung granites. Authors suggested new polynomial type failure coefficient functions by which conventional Hoek-Brown failure criteria was extended to thermomechanical one. Obtained results are as follow; 1) Failure coefficients, m and s of Hoek and Brown's empirical failure criteria were decreased as temperature increased. 2) Theoretically calculated values by suggested equations and experimented ones by confined compressive test were well coincided.

• Kyungpook Mathematical Journal
• /
• v.54 no.4
• /
• pp.639-653
• /
• 2014

In [9], Kauffman introduced virtual knot theory and generalized many classical knot invariants to virtual ones. For example, he extended the Jones polynomials $V_K(t)$ of classical links to the f-polynomials $f_K(A)$ of virtual links by using bracket polynomials. In [4], M. Goussarov, M. Polyak and O. Viro introduced finite type invariants of virtual knots. In this paper, we give a necessary condition for a virtual knot invariant to be of finite type by using $t(a_1,{\cdots},a_m)$-sequences of virtual knots. Then we show that the higher derivatives $f_K^{(n)}(a)$ of the f-polynomial $f_K(A)$ of a virtual knot K at any point a are not of finite type unless $n{\leq}1$ and a = 1.