Monotonicity, interlacing and electrostatic interpretation of zeros of exceptional Jacobi polynomials

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

Stieltjes functions and discrete classical orthogonal polynomials

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

Goppa codes through polynomials of B[X;(1/2^2)Z_0] and its decoding principle

In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm. This algorithm corrects all errors up to the Hamming weight $t\leq 2r$, i.e., whose minimum Hamming distance is $2^{2}r+1$.

A decoding procedure which improves code rate and error corrections

Corresponding to $C_{0}[n,n-r]$, a binary cyclic code generated by a primitive irreducible polynomial $p(X)\in \mathbb{F}_{2}[X]$ of degree $r=2b$, where $b\in \mathbb{Z}^{+}$, we can constitute a binary cyclic code $C[(n+1)^{3^{k}}-1,(n+1)^{3^{k}}-1-3^{k}r]$, which is generated by primitive irreducible generalized polynomial $p(X^{\frac{1}{3^{k}}})\in \mathbb{F}_{2}[X;\frac{1}{3^{k}}\mathbb{Z}_{0}]$ with degree $3^{k}r$, where $k\in \mathbb{Z}^{+}$. This new code $C$ improves the code rate and has error corrections capability higher than $C_{0}$. The purpose of this study is to establish a decoding procedure for $C_{0}$ by using $C$ in such a way that one can obtain an improved code rate and error-correcting capabilities for $C_{0}$.

Szegö polynomials: quadrature rules on the unit circle and on [-1, 1]

We consider some of the relations that exist between real Szegö polynomials and certain para-orthogonal polynomials defined on the unit circle, which are again related to certain orthogonal polynomials on [-1, 1] through the transformation x = (z1/2+z1/2)/2. Using these relations we study the interpolatory quadrature rule based on the zeros of polynomials which are linear combinations of the orthogonal polynomials on [-1, 1]. In the case of any symmetric quadrature rule on [-1, 1], its associated quadrature rule on the unit circle is also given.

Comparative study between powers of sigmoid functions, MLP-backpropagation and polynomials in function approximation problems

Function approximation is a very important task in environments where the computation has to be based on extracting information from data samples in real world processes. So, the development of new mathematical model is a very important activity to guarantee the evolution of the function approximation area. In this sense, we will present the Polynomials Powers of Sigmoid (PPS) as a linear neural network. In this paper, we will introduce one series of practical results for the Polynomials Powers of Sigmoid, where we will show some advantages of the use of the powers of sigmiod functions in relationship the traditional MLP-Backpropagation and Polynomials in functions approximation problems.

Effects of sex and age on genotype x environment interaction for beef cattle body weight studied using reaction norm models

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

Breeding value accuracy estimates for growth traits using random regression and multi-trait models in Nelore cattle

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

Genetic parameter estimates for live weight and daily live weight gain obtained for Nellore bulls in a test station using different models

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

Genetic parameters for test-day yield of milk, fat and protein in buffaloes estimated by random regression models

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

On the zeros of polynomials: An extension of the Enestrom-Kakeya theorem

This paper presents an extension of the Enestrom-Kakeya theorem concerning the roots of a polynomial that arises from the analysis of the stability of Brown (K, L) methods. The generalization relates to relaxing one of the inequalities on the coefficients of the polynomial. Two results concerning the zeros of polynomials will be proved, one of them providing a partial answer to a conjecture by Meneguette (1994)[6]. (C) 2011 Elsevier B.V. All rights reserved.

A combination of implicit and adaptative upwind tools for the numerical solution of incompressible free surface flows

This paper is concerned with the numerical solutions of time dependent two-dimensional incompressible flows. By using the primitive variables of velocity and pressure, the Navier-Stokes and mass conservation equations are solved by a semi-implicit finite difference projection method. A new bounded higher order upwind convection scheme is employed to deal with the non-linear (advective) terms. The procedure is an adaptation of the GENSMAC (J. Comput. Phys. 1994; 110: 171-186) methodology for calculating confined and free surface fluid flows at both low and high Reynolds numbers. The calculations were performed by using the 2D version of the Freeflow simulation system (J. Comp. Visual. Science 2000; 2:199-210). In order to demonstrate the capabilities of the numerical method, various test cases are presented. These are the fully developed flow in a channel, the flow over a backward facing step, the die-swell problem, the broken dam flow, and an impinging jet onto a flat plate. The numerical results compare favourably with the experimental data and the analytical solutions. Copyright (c) 2006 John Wiley & Sons, Ltd.

Toxoplasma gondii and Leptospira spp. infection in free-ranging armadillos

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