• 대한수학회보
• /
• 제60권6호
• /
• pp.1651-1672
• /
• 2023

In 2010, Li-Ye [13, Theorem 0.1] proved that P(ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), Γ"(z)) ≢ 0 in ℂ, where m is a non-negative integer, and P(u₀, u₁, . . . , u_m, v₀, v₁, v₂) is any non-trivial polynomial in its arguments with coefficients in the field ℂ. Later on, Li-Ye [15, Theorem 1] proved that P(z, Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z), ζ(z)) ≢ 0 in z ∈ ℂ for any non-trivial distinguished polynomial P(z, u₀, u₁, . . ., u_n, v) with coefficients in a set L_δ of the zero function and a class of nonzero functions f from ℂ to ℂ ∪ {∞} (cf. [15, Definition 1]). In this paper, we prove that P(z, ζ(z), ζ'(z), . . . , ζ^(m)(z), Γ(z), Γ'(z), . . . , Γ⁽ⁿ⁾(z)) ≢ 0 in z ∈ ℂ, where m and n are two non-negative integers, and P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is any non-trivial polynomial in the m + n + 2 variables u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n with coefficients being meromorphic functions of order less than one, and the polynomial P(z, u₀, u₁, . . . , u_m, v₀, v₁, . . . , v_n) is a distinguished polynomial in the n + 1 variables v₀, v₁, . . . , v_n. The question studied in this paper is concerning the conjecture of Markus from [16]. The main results obtained in this paper also extend the corresponding results from Li-Ye [12] and improve the corresponding results from Chen-Wang [5] and Wang-Li-Liu-Li [23], respectively.

• Journal of applied mathematics & informatics
• /
• 제36권5_6호
• /
• pp.397-409
• /
• 2018

The aim of this research note is to evaluate two generalized integrals involving the product of generalized Bessel function and Jacobi polynomial by employing the result of Obhettinger [2]. Also, by mean of the main results, we have established an interesting relation in between $Kamp{\acute{e}}$ de $F{\acute{e}}riet$ and Srivastava and Daoust functions. Some interesting special cases of our main results are also indicated.

• Korean Journal of Mathematics
• /
• 제27권4호
• /
• pp.899-927
• /
• 2019

In this paper we establish some results depending on the comparative growth properties of composite entire and meromorphic functions using relative (p, q)-th order and relative (p, q)-th lower order where p, q are any two positive integers and that of a special type of differential polynomial generated by one of the factors.

• 호남수학학술지
• /
• 제29권4호
• /
• pp.535-542
• /
• 2007

In this paper, for each natural number n, we construct a polynomial $p_n$(x) of degree n so that $p_n(x)\;\leq\;p_{n+1}(x)\;\leq\;e^x$ for $x\;\geq\;-1$. These polynomials are optimal in the sense that if p(x) is a polynomial of degree n with $p_{n-l}(x)\;\leq\;p(x)\;\leq\;e^x$, then $p(x)\;\leq\;p_n(x)$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.337-339
• /
• 2004

In this paper, we discuss optimal design of Fuzzy Polynomial Neural Networks by means of Genetic Algorithms(GAs). Proceeding the layer, this model creates the optimal network architecture through the selection and the elimination of nodes by itself. So, there is characteristic of flexibility. We use a triangle and a Gaussian-like membership function in premise part of rules and design the consequent structure by constant and regression polynomial (linear, quadratic and modified quadratic) function between input and output variables. GAs is applied to improve the performance with optimal input variables and number of input variables and order. To evaluate the performance of the GAs-based FPNNs, the models are experimented with the use of Medical Imaging System(MIS) data.

• 응용통계연구
• /
• 제22권6호
• /
• pp.1345-1353
• /
• 2009

We introduce a simple methodology, so-called generalized gamma-polynomial approximation, based on moment-matching technique to approximate survival and hazard functions in the context of parametric survival analysis. We use the generalized gamma-polynomial approximation to approximate the density and distribution functions of convolutions and finite mixtures of random variables, from which the approximated survival and hazard functions are obtained. This technique provides very accurate approximation to the target functions, in addition to their being computationally efficient and easy to implement. In addition, the generalized gamma-polynomial approximations are very stable in middle range of the target distributions, whereas saddlepoint approximations are often unstable in a neighborhood of the mean.

• 대한원격탐사학회지
• /
• 제19권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.

• Journal of information and communication convergence engineering
• /
• 제16권3호
• /
• pp.166-172
• /
• 2018

A pseudo-random sequence generated by using a primitive polynomial, trace function, and Legendre symbol has been researched in our previous work. Our previous sequence has some interesting features such as period, autocorrelation, and linear complexity. A pseudo-random sequence widely used in cryptography. However, from the aspect of the practical use in cryptographic systems sequence needs to generate swiftly. Our previous sequence generated by utilizing a primitive polynomial, however, finding a primitive polynomial requires high calculating cost when the degree or the characteristic is large. It’s a shortcoming of our previous work. The main contribution of this work is to find some relation between the generated sequence and irreducible polynomials. The purpose of this relationship is to generate the same sequence without utilizing a primitive polynomial. From the experimental observation, it is found that there are (p - 1)/2 kinds of polynomial, which generates the same sequence. In addition, some of these polynomials are non-primitive polynomial. In this paper, these relationships between the sequence and the polynomials are shown by some examples. Furthermore, these relationships are proven theoretically also.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권7호
• /
• pp.3690-3713
• /
• 2019

According to the main group key management schemes logical key hierarchy (LKH), exclusion basis systems (EBS) and other group key schemes are limited in network structure, collusion attack, high energy consumption, and the single point of failure, this paper presents a group key management scheme for wireless sensor networks based on Lagrange interpolation polynomial characteristic (AGKMS). That Chinese remainder theorem is turned into a Lagrange interpolation polynomial based on the function property of Chinese remainder theorem firstly. And then the base station (BS) generates a Lagrange interpolation polynomial function f(x) and turns it to be a mix-function f(x)' based on the key information m(i) of node i. In the end, node i can obtain the group key K by receiving the message f(m(i))' from the cluster head node j. The analysis results of safety performance show that AGKMS has good network security, key independence, anti-capture, low storage cost, low computation cost, and good scalability.

• 충청수학회지
• /
• 제22권2호
• /
• pp.201-209
• /
• 2009

In this paper, we prove the stability of the functional equation $$\sum_{i=0}^3_3C_i(-1)^{3-i}f(ix+y)=0$$ in the sense of Th.M.Rassias on the punctured domain. Also, we investigate the superstability of the functional equation.