• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.7-14
• /
• 2011

Infinite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rate per fault (hazard function). This infinite non-homogeneous Poisson process is model which reflects the possibility of introducing new faults when correcting or modifying the software. In this paper, polynomial hazard function have been proposed, which can efficiency application for software reliability. Algorithm for estimating the parameters used to maximum likelihood estimator and bisection method. Model selection based on mean square error and the coefficient of determination for the sake of efficient model were employed. In numerical example, log power time model of the existing model in this area and the polynomial hazard function model were compared using failure interval time. Because polynomial hazard function model is more efficient in terms of reliability, polynomial hazard function model as an alternative to the existing model also were able to confirm that can use in this area.

• Communications of the Korean Mathematical Society
• /
• v.29 no.2
• /
• pp.379-385
• /
• 2014

For a bandlimited function with polynomial growth on the real line, we derive a nonuniform sampling expansion using a special bandlimited function which has polynomial decay on the real line. The series converges uniformly on any compact subsets of the real line.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.1
• /
• pp.135-142
• /
• 2012

In this paper, we proposed a new architecture called radial basis function-based polynomial neural networks classifier that consists of heterogeneous neural networks such as radial basis function neural networks and polynomial neural networks. The underlying architecture of the proposed model equals to polynomial neural networks(PNNs) while polynomial neurons in PNNs are composed of Fuzzy-c means-based radial basis function neural networks(FCM-based RBFNNs) instead of the conventional polynomial function. We consider PNNs to find the optimal local models and use RBFNNs to cover the high dimensionality problems. Also, in the hidden layer of RBFNNs, FCM algorithm is used to produce some clusters based on the similarity of given dataset. The proposed model depends on some parameters such as the number of input variables in PNNs, the number of clusters and fuzzification coefficient in FCM and polynomial type in RBFNNs. A multiobjective particle swarm optimization using crowding distance (MoPSO-CD) is exploited in order to carry out both structural and parametric optimization of the proposed networks. MoPSO is introduced for not only the performance of model but also complexity and interpretability. The usefulness of the proposed model as a classifier is evaluated with the aid of some benchmark datasets such as iris and liver.

• Journal of the Korean Mathematical Society
• /
• v.50 no.3
• /
• pp.509-527
• /
• 2013

A Krawtchouk polynomial is introduced as the classical Mac-Williams identity, which can be expressed in weight-enumerator-free form of a linear code and its dual code over a Hamming scheme. In this paper we find a new explicit expression for the $p$-number and the $q$-number, which are more generalized notions of the Krawtchouk polynomial in the P-polynomial schemes by using an extended version of a discrete Green's function. As corollaries, we obtain a new expression of the Krawtchouk polynomial over the Hamming scheme and the Eberlein polynomial over the Johnson scheme. Furthermore, we find another version of the MacWilliams identity over a Hamming scheme.

• Communications of the Korean Mathematical Society
• /
• v.33 no.3
• /
• pp.799-808
• /
• 2018

In the paper we consider the uniqueness of a meromorphic function and a linear differential polynomial when they share a small function.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.286-286
• /
• 2000

We consider a negative unity feedback control system in which Che PIO, PI, PD or P controller and a transfer function having only poles are in cascade, We define the notion of the structural polynomial which means that there exists a subdomain of the coefficient space in which the polynomial is Hurwitz (left half plane stable) polynomial. We obtain the necessary and sufficient condition of the structure of the transfer function of which the characteristic polynomial is a structural polynomial, In addition, this paper present another necessary and sufficient condition for the existence of a constant gain controller with which the characteristic polynomial is structurally stable, For the structurally stabilizable P controller, it is allowed that the transfer function may not to all pole plants.

• Korean Journal of Mathematics
• /
• v.30 no.2
• /
• pp.249-261
• /
• 2022

Let f be a non-constant meromorphic function in the open complex plane ℂ. In this paper we prove under certain essential conditions that R(f) and P[f], rational function and differential polynomial of f respectively, share a small function of f and obtain a conclusion related to Brück conjecture. We give some examples in support to our result.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.4
• /
• pp.862-870
• /
• 2011

In this paper, we introduce a new topology of Radial Basis Function-based Polynomial Neural Networks (RPNN) that is based on a genetically optimized multi-layer perceptron with Radial Polynomial Neurons (RPNs). This study offers a comprehensive design methodology involving mechanisms of optimization algorithms, especially Fuzzy C-Means (FCM) clustering method and Particle Swarm Optimization (PSO) algorithms. In contrast to the typical architectures encountered in Polynomial Neural Networks (PNNs), our main objective is to develop a design strategy of RPNNs as follows : (a) The architecture of the proposed network consists of Radial Polynomial Neurons (RPNs). In here, the RPN is fully reflective of the structure encountered in numeric data which are granulated with the aid of Fuzzy C-Means (FCM) clustering method. The RPN dwells on the concepts of a collection of radial basis function and the function-based nonlinear (polynomial) processing. (b) The PSO-based design procedure being applied at each layer of RPNN leads to the selection of preferred nodes of the network (RPNs) whose local characteristics (such as the number of input variables, a collection of the specific subset of input variables, the order of the polynomial, and the number of clusters as well as a fuzzification coefficient in the FCM clustering) can be easily adjusted. The performance of the RPNN is quantified through the experimentation where we use a number of modeling benchmarks - NOx emission process data of gas turbine power plant and learning machine data(Automobile Miles Per Gallon Data) already experimented with in fuzzy or neurofuzzy modeling. A comparative analysis reveals that the proposed RPNN exhibits higher accuracy and superb predictive capability in comparison to some previous models available in the literature.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.6
• /
• pp.105-110
• /
• 2005

The linearized polynomial fan be regarded as a generalization of the identity function so that the inverse of the linearized polynomial is a generalization of e inverse function. Since the inverse function has so many good cryptographic properties, the inverse of the linearized polynomial is also a candidate of good Boolean functions. In particular, a construction method of vector resilient functions with high algebraic degree was proposed at Crypto 2001. But the analysis about the algebraic degree of the inverse of the linearized Polynomial. Hence we correct the inexact result and give the exact maximal algebraic degree.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.251-268
• /
• 1996

In this paper, a higher-order feedforward neural network called ridge polynomial network (RPN) which shows good approximation capability for nonlnear continuous functions defined on compact subsets in multi-dimensional Euclidean spaces, is presented. This network provides more efficient and regular structure as compared to ordinary higher-order feedforward networks based on Gabor-Kolmogrov polynomial expansions, while maintating their fast learning property. the ridge polynomial network is a generalization of the pi-sigma network (PSN) and uses a specialform of ridge polynomials. It is shown that any multivariate polynomial can be exactly represented in this form, and thus realized by a RPN. The approximation capability of the RPNs for arbitrary continuous functions is shown by this representation theorem and the classical weierstrass polynomial approximation theorem. The RPN provides a natural mechanism for incremental function approximation based on learning algorithm of the PSN. Simulation results on several applications such as multivariate function approximation and pattern classification assert nonlinear approximation capability of the RPN.