Bernstein polynomial estimation provides a robust nonparametric technique for approximating both density and distribution functions. Based on the properties of Bernstein polynomials, which uniformly ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

The purposes in this Research Area are to spur innovation in basic science and to construct a new paradigm for materials science that contributes to more affluent daily life and social infrastructure, ...

We discuss the dynamic and structural properties of polynomial semigroups, a natural extension of iteration theory to random (walk) dynamics, where the semigroup G of complex polynomials (under the ...

Abstract: Reassigned operation is a technique to improve the representation quality of time-varying signals in the time-frequency domain. This paper presents the arbitrary higher-order reassigned ...

Polynomials and power functions are the foundation for modelling non-linear relationships. Polynomial functions such as quadratic, cubic and quartic model variables raised to exponents of different ...

Abstract: This article presents an expanded form of time-to-go polynomial guidance (TPG), which generalizes constant-gain TPG to accommodate arbitrary time-varying functions. The proposed guidance law ...

ABSTRACT: This paper mainly studies some properties of skew polynomial ring related to Morita invariance, Armendariz and (quasi)-Baer. First, we show that skew polynomial ring has no Morita invariance ...