On the number of critical periods for planar polynomial systems

In this paper we get some lower bounds for the number of critical periods of families of centers which are perturbations of the linear one. We give a method which lets us prove that there are planar polynomial centers of degree l with at least 2[(l - 2)/2] critical periods as well as study concrete families of potential, reversible and Lienard centers. This last case is studied in more detail and we prove that the number of critical periods obtained with our approach does not. increases with the order of the perturbation. (C) 2007 Elsevier Ltd. All rights reserved.

An extremal nonnegative sine polynomial

For any positive integer n, the sine polynomials that are nonnegative in [0, π] and which have the maximal derivative at the origin are determined in an explicit form. Associated cosine polynomials Kn (θ) are constructed in such a way that {Kn(θ)} is a summability kernel. Thus, for each Pi 1 ≤ P ≤ ∞ and for any 27π-periodic function f ∈ Lp [-π, π], the sequence of convolutions Kn * f is proved to converge to f in Lp[-ππ]. The pointwise and almost everywhere convergences are also consequences of our construction.

Landau and Kolmogoroff type polynomial inequalities II

Let 0 < j < m ≤ n. Kolmogoroff type inequalities of the form ∥f(j)∥2 ≤ A∥f(m)∥ 2 + B∥f∥2 which hold for algebraic polynomials of degree n are established. Here the norm is defined by ∫ f2(x)dμ(x), where dμ(x) is any distribution associated with the Jacobi, Laguerre or Bessel orthogonal polynomials. In particular we characterize completely the positive constants A and B, for which the Landau weighted polynomial inequalities ∥f′∥ 2 ≤ A∥f″∥2 + B∥f∥ 2 hold. © Dynamic Publishers, Inc.

Fractional polynomial response surface models

Second-order polynomial models have been used extensively to approximate the relationship between a response variable and several continuous factors. However, sometimes polynomial models do not adequately describe the important features of the response surface. This article describes the use of fractional polynomial models. It is shown how the models can be fitted, an appropriate model selected, and inference conducted. Polynomial and fractional polynomial models are fitted to two published datasets, illustrating that sometimes the fractional polynomial can give as good a fit to the data and much more plausible behavior between the design points than the polynomial model. © 2005 American Statistical Association and the International Biometric Society.

Encoding through generalized polynomial codes

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Classification of masses in mammographic image using wavelet domain features and polynomial classifier

Breast cancer is the most common cancer among women. In CAD systems, several studies have investigated the use of wavelet transform as a multiresolution analysis tool for texture analysis and could be interpreted as inputs to a classifier. In classification, polynomial classifier has been used due to the advantages of providing only one model for optimal separation of classes and to consider this as the solution of the problem. In this paper, a system is proposed for texture analysis and classification of lesions in mammographic images. Multiresolution analysis features were extracted from the region of interest of a given image. These features were computed based on three different wavelet functions, Daubechies 8, Symlet 8 and bi-orthogonal 3.7. For classification, we used the polynomial classification algorithm to define the mammogram images as normal or abnormal. We also made a comparison with other artificial intelligence algorithms (Decision Tree, SVM, K-NN). A Receiver Operating Characteristics (ROC) curve is used to evaluate the performance of the proposed system. Our system is evaluated using 360 digitized mammograms from DDSM database and the result shows that the algorithm has an area under the ROC curve Az of 0.98 ± 0.03. The performance of the polynomial classifier has proved to be better in comparison to other classification algorithms. © 2013 Elsevier Ltd. All rights reserved.

Limit Cycles for a Class of Continuous and Discontinuous Cubic Polynomial Differential Systems

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Darboux invariants for planar polynomial differential systems having an invariant conic

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Limit cycles of cubic polynomial differential systems with rational first integrals of degree 2

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

A new transmission model in cognitive radio based on cyclic generalized polynomial codes for bandwidth reduction

The frequency spectrums are inefficiently utilized and cognitive radio has been proposed for full utilization of these spectrums. The central idea of cognitive radio is to allow the secondary user to use the spectrum concurrently with the primary user with the compulsion of minimum interference. However, designing a model with minimum interference is a challenging task. In this paper, a transmission model based on cyclic generalized polynomial codes discussed in [2] and [15], is proposed for the improvement in utilization of spectrum. The proposed model assures a non interference data transmission of the primary and secondary users. Furthermore, analytical results are presented to show that the proposed model utilizes spectrum more efficiently as compared to traditional models.

A note on the integral trace form in cyclotomic fields

Let m >= 3 be an integer, zeta(m) is an element of C a primitive mth root of unity, and K-m the cyclotomic field Q(zeta(m)). An explicit description of the integral trace form Tr-Km/Q(x (x) over bar)vertical bar Z[zeta(m)] where (x) over bar is the complex conjugate of x is presented. In the case where m is prime, a procedure for finding the minimum of the form subject to x being a nonzero element of a certain Z- module in Z[zeta(m)] is presented.

Normal Forms for Polynomial Differential Systems in R-3 Having an Invariant Quadric and a Darboux Invariant

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Learning kernels for support vector machines with polynomial powers of sigmoid

In the pattern recognition research field, Support Vector Machines (SVM) have been an effectiveness tool for classification purposes, being successively employed in many applications. The SVM input data is transformed into a high dimensional space using some kernel functions where linear separation is more likely. However, there are some computational drawbacks associated to SVM. One of them is the computational burden required to find out the more adequate parameters for the kernel mapping considering each non-linearly separable input data space, which reflects the performance of SVM. This paper introduces the Polynomial Powers of Sigmoid for SVM kernel mapping, and it shows their advantages over well-known kernel functions using real and synthetic datasets.

STABLE PIECEWISE POLYNOMIAL VECTOR FIELDS

Let N = {y > 0} and S = {y < 0} be the semi-planes of R-2 having as common boundary the line D = {y = 0}. Let X and Y be polynomial vector fields defined in N and S, respectively, leading to a discontinuous piecewise polynomial vector field Z = (X, Y). This work pursues the stability and the transition analysis of solutions of Z between N and S, started by Filippov (1988) and Kozlova (1984) and reformulated by Sotomayor-Teixeira (1995) in terms of the regularization method. This method consists in analyzing a one parameter family of continuous vector fields Z(epsilon), defined by averaging X and Y. This family approaches Z when the parameter goes to zero. The results of Sotomayor-Teixeira and Sotomayor-Machado (2002) providing conditions on (X, Y) for the regularized vector fields to be structurally stable on planar compact connected regions are extended to discontinuous piecewise polynomial vector fields on R-2. Pertinent genericity results for vector fields satisfying the above stability conditions are also extended to the present case. A procedure for the study of discontinuous piecewise vector fields at infinity through a compactification is proposed here.

Polynomial and Poisson dependence in free Poisson algebras and free Poisson fields

We prove that any two Poisson dependent elements in a free Poisson algebra and a free Poisson field of characteristic zero are algebraically dependent, thus answering positively a question from Makar-Limanov and Umirbaev (2007) [8]. We apply this result to give a new proof of the tameness of automorphisms for free Poisson algebras of rank two (see Makar-Limanov and Umirbaev (2011) [9], Makar-Limanov et al. (2009) [10]). (C) 2011 Elsevier Inc. All rights reserved.