• Journal of Multimedia Information System
• /
• v.5 no.1
• /
• pp.63-66
• /
• 2018

In this work, the smoothing and the interpolation basis splines are analyzed. As well as the possibility of using the spectral properties of the basis splines for digital signal processing are shown. This takes into account the fact that basic splines represent finite, piecewise polynomial functions defined on compact media.

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.291-300
• /
• 2020

This type of polynomial is a generating function that substitutes e^λt for e^t in the denominator of the generating function for the Bernoulli polynomial, but polynomials by using this generating function has interesting properties involving the location of the roots. We define these generation functions and observe the properties of the generation functions.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.765-780
• /
• 2023

In this paper, we explore the uniqueness property between the transcendental meromorphic functions and differential polynomial. With the notion of weighted sharing, we generalised the many previous results on uniqueness property. Here we discussed the uniqueness of [P(f)(αf^m + β)^s]^(k) - η(z) and [P(g)(αg^m + β)^s]^(k) - η(z). Meanwhile, we generalised the result of Harina P. waghamore and Rajeshwari S[1].

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.6
• /
• pp.235-240
• /
• 2002

This paper presents a new method for estimating the block pulse series coefficients by using the Lagrange's second order interpolation polynomial. Block pulse functions have been used in a variety of fields such as the analysis and controller design of the systems. When the block pulse functions are used, it is necessary to find the more exact value of the block pulse series coefficients. But these coefficients have been estimated by the mean of the adjacent discrete values, and the result is not sufficient when the values are changing extremely. In this paper, the method for improving the accuracy of the block pulse series coefficients by using the Lagrange's second order interpolation polynomial is presented.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.2
• /
• pp.79-89
• /
• 2003

A research about finding a new electricity load model that is sensitive to the price of electricity is conducted. This new model i5 polynomial type price sensitive electricity consumption model, while former electricity consumption models have exponential terms or statistic terms. The pattern of electricity consumption of each electricity using devices were identified first, then the proportion of the devices at buses or nodes are investigated, finally weighted sum of electricity consumption and the proportion makes the load model or consumption model of electricity at one bus or node. This new model is easy to use in the simulations or calculations of the electricity consumption, because the arithmetic of functions with polynomial terms are easy compared to the functions with transcendental terms.

• Bulletin of the Korean Mathematical Society
• /
• v.46 no.4
• /
• pp.701-712
• /
• 2009

In this paper, we study the simultaneous approximation to functions in $C^m$[0, 1] by neural networks with a squashing function and the complexity related to the simultaneous approximation using a Bernstein polynomial and the modulus of continuity. Our proofs are constructive.

• Communications for Statistical Applications and Methods
• /
• v.2 no.2
• /
• pp.376-386
• /
• 1995

Designs for polynomial approximation to the unknown response function are considered. Optimality criteria are monotone functions of the mean squared error matrix of the least squares estimator. They correspond to the classical A-, D-, G- and Q-optimalities. Optimal first order designs are chosen from the invariant designs and then compared with optimal second order designs.

• Kyungpook Mathematical Journal
• /
• v.55 no.3
• /
• pp.653-666
• /
• 2015

With the notion of weighted sharing of values we study the uniqueness of meromorphic functions when certain nonlinear differential polynomials share a nonzero polynomial. Our results improve some recent results including that of a present first author.

• Journal of the Korea Safety Management & Science
• /
• v.3 no.4
• /
• pp.91-101
• /
• 2001

This paper is to develop replacement models under minimal repair with exponential polynomial wavelet failure rate function. Wavelets have good time-frequency localization, fast algorithms and parsimonious representation. Also this study is presented along with numerical examples using sensitivity analysis for exponential polynomial trigonometric failure rate function.