• East Asian mathematical journal
• /
• v.40 no.3
• /
• pp.329-339
• /
• 2024

In the work we generate arithmetic matrix P^(c,b,a) of (cx² + bx+a)ⁿ from a Pascal matrix P^(1,1). We extend an identity P^(1,1))O^(1,1) = P^(1,1,1) with an obtuse matrix O^(1,1) to k degree polynomials. For the purpose we study P^(1,1)kO^(1,1) and find generating polynomials of O^(1,1)k.

• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.267-276
• /
• 2012

Bagai et al. (1989) proposed a distribution-free test for stochastic ordering in the competing risk model, and recently Murakami (2009) utilized a standard saddlepoint approximation to provide tail probabilities for the Bagai statistic under finite sample sizes. In the present paper, we consider the Gaussian-polynomial approximation proposed in Ha and Provost (2007) and compare it to the saddlepoint approximation in terms of approximating the percentiles of the Bagai statistic. We make numerical comparisons of these approximations for moderate sample sizes as was done in Murakami (2009). From the numerical results, it was observed that the Gaussianpolynomial approximation provides comparable or greater accuracy in the tail probabilities than the saddlepoint approximation. Unlike saddlepoint approximation, the Gaussian-polynomial approximation provides a simple explicit representation of the approximated density function. We also discuss the details of computations.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.4
• /
• pp.1149-1156
• /
• 2016

In this paper, we introduce the degenerate Carlitz q-Bernoulli numbers and polynomials and give some interesting identities and properties of these numbers and polynomials which are derived from the generating functions and p-adic integral equations.

• East Asian mathematical journal
• /
• v.30 no.2
• /
• pp.93-121
• /
• 2014

In this paper we study generating and proving methods of symmetric inequalities. We analyze various literatures related with proofs of symmetric inequalities. As a result, we can describe generating method of symmetric inequalities, and suggest some symmetric inequalities that are generated by using parameterization to elementary symmetric polynomials. And we are able to classify some proving methods, and show proofs of symmetric inequalities.

• Honam Mathematical Journal
• /
• v.46 no.3
• /
• pp.407-427
• /
• 2024

The purpose of this article is to bring together the Horadam numbers and 3-parameter generalized quaternions, which are a general form of the quaternion algebra according to 3-parameters. With this purpose, we introduce and examine a new type of quite big special numbers system, which is called Horadam 3-parameter generalized quaternions (shortly, Horadam 3PGQs), and special cases of them. Besides, we compute both some new equations and classical well-known equations such as; Binet formulas, generating function, exponential generating function, Poisson generating function, sum formulas, Cassini identity, polar representation, and matrix equation. Furthermore, this article concludes by presenting the determinant, characteristic polynomial, characteristic equation, eigenvalues, and eigenvectors in relation to the matrix representation of Horadam 3PGQ.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.2
• /
• pp.48-54
• /
• 2014

For the element ${\alpha}{\in}GF(p^n)$, two kinds of bases are known. One is a conventional polynomial basis of the form $\{1,{\alpha},{\alpha}^2,{\cdots},{\alpha}^{n-1}\}$, and the other is a normal basis of the form $\{{\alpha},{\alpha}^p,{\alpha}^{p^2},{\cdots},{\alpha}^{p^{n-1}}\}$. In this paper we consider the method of generating normal bases which construct the finite field $GF(p^n)$, as an n-dimensional extension of the finite field GF(p). And we analyze the code sequence generating algorithm and derive the implementation functions of code sequence generator based on the normal bases. We find the normal polynomials of degrees, n=5 and n=7, which can generate normal bases respectively, design, and construct the code sequence generators based on these normal bases. Finally, we produce two code sequence groups(n=5, n=7) by using Simulink, and analyze the characteristics of the autocorrelation function, $R_{i,i}(\tau)$, and crosscorrelation function, $R_{i,j}(\tau)$, $i{\neq}j$ between two different code sequences. Based on these results, we confirm that the analysis of generating algorithms and the design and implementation of the code sequence generators based on normal bases are correct.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.12
• /
• pp.1772-1781
• /
• 2017

In this study, the design methodology for alleviating the overfitting problem of Polynomial Neural Networks(PNN) is realized with the aid of two kinds techniques such as L2 regularization and Sum of Squared Coefficients (SSC). The PNN is widely used as a kind of mathematical modeling methods such as the identification of linear system by input/output data and the regression analysis modeling method for prediction problem. PNN is an algorithm that obtains preferred network structure by generating consecutive layers as well as nodes by using a multivariate polynomial subexpression. It has much fewer nodes and more flexible adaptability than existing neural network algorithms. However, such algorithms lead to overfitting problems due to noise sensitivity as well as excessive trainning while generation of successive network layers. To alleviate such overfitting problem and also effectively design its ensuing deep network structure, two techniques are introduced. That is we use the two techniques of both SSC(Sum of Squared Coefficients) and $L_2$ regularization for consecutive generation of each layer's nodes as well as each layer in order to construct the deep PNN structure. The technique of $L_2$ regularization is used for the minimum coefficient estimation by adding penalty term to cost function. $L_2$ regularization is a kind of representative methods of reducing the influence of noise by flattening the solution space and also lessening coefficient size. The technique for the SSC is implemented for the minimization of Sum of Squared Coefficients of polynomial instead of using the square of errors. In the sequel, the overfitting problem of the deep PNN structure is stabilized by the proposed method. This study leads to the possibility of deep network structure design as well as big data processing and also the superiority of the network performance through experiments is shown.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2003.10a
• /
• pp.417-422
• /
• 2003

The KOMPSAT-2 MSC(Multi-Spectral Camera), with high spatial resolution, is currently under development and will be launched in the end of 2004. A sensor model relates a 3-D ground position to the corresponding 2-D image position and describes the imaging geometry that is necessary to reconstruct the physical imaging process. The Rational Function Model (RFM) has been considered as a generic sensor model. form. The RFM is technically applicable to all types of sensors such as frame, pushbroom, whiskbroom and SAR etc. With the increasing availability of the new generation imaging sensors, accurate and fast rectification of digital imagery using a generic sensor model becomes of great interest to the user community. This paper describes the procedure to generation of the RPC (Rational Polynomial Coefficients) for KOMPSAT-2 MSC.

• Journal of the Korean Mathematical Society
• /
• v.54 no.4
• /
• pp.1243-1264
• /
• 2017

In this paper, we introduce w-Catalan polynomials as a generalization of Catalan polynomials and derive fourteen basic identities of symmetry in three variables related to w-Catalan polynomials and analogues of alternating power sums. In addition, specializations of one of the variables as one give us new and interesting identities of symmetry even for two variables. The derivations of identities are based on the p-adic integral expression for the generating function of the w-Catalan polynomials and the quotient of p-adic integrals for that of the analogues of the alternating power sums.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.1
• /
• pp.150-156
• /
• 1993

This paper studies an Authentication sheme which is used polynomial equation over GF(2n)for reducing time to authenticate sender and his message in secret data communication. Also in order to maintain strong secrecy, this scheme use interactive Zero-knowledge proof protocol for generating information of sender's authentication via unprotected communication channel.