Relação do perímetro escrotal com a média de peso do grupo contemporâneo para estimação de um modelo de ajuste

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

Higher order turän inequalities

The celebrated Turân inequalities P 2 n(x)-P n-x(x)P n+1(x) ≥ 0, x ε[-1,1], n ≥ 1, where P n(x) denotes the Legendre polynomial of degree n, are extended to inequalities for sums of products of four classical orthogonal polynomials. The proof is based on an extension of the inequalities γ 2 n - γ n-1γ n+1 ≥ 0, n ≥ 1, which hold for the Maclaurin coefficients of the real entire function ψ in the Laguerre-Pölya class, ψ(x) = ∑ ∞ n=0 γ nx n / n!. ©1998 American Mathematical Society.

Efeitos Ambientais sobre Ganho de Peso no Período do Nascimento ao Desmame em Bovinos da Raça Nelore

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

Fatores de Correção para Ganho de Peso Médio Diário no Período do Nascimento ao Desmame em Bovinos da Raça Nelore

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

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Inversely symmetric interpolatory quadrature rules

We consider interpolatory quadrature rules with nodes and weights satisfying symmetric properties in terms of the division operator. Information concerning these quadrature rules is obtained using a transformation that exists between these rules and classical symmetric interpolatory quadrature rules. In particular, we study those interpolatory quadrature rules with two fixed nodes. We obtain specific examples of such quadrature rules.

Variational studies and replica symmetry breaking in the generalization problem of the binary perceptron

We analyze the average performance of a general class of learning algorithms for the nondeterministic polynomial time complete problem of rule extraction by a binary perceptron. The examples are generated by a rule implemented by a teacher network of similar architecture. A variational approach is used in trying to identify the potential energy that leads to the largest generalization in the thermodynamic limit. We restrict our search to algorithms that always satisfy the binary constraints. A replica symmetric ansatz leads to a learning algorithm which presents a phase transition in violation of an information theoretical bound. Stability analysis shows that this is due to a failure of the replica symmetric ansatz and the first step of replica symmetry breaking (RSB) is studied. The variational method does not determine a unique potential but it allows construction of a class with a unique minimum within each first order valley. Members of this class improve on the performance of Gibbs algorithm but fail to reach the Bayesian limit in the low generalization phase. They even fail to reach the performance of the best binary, an optimal clipping of the barycenter of version space. We find a trade-off between a good low performance and early onset of perfect generalization. Although the RSB may be locally stable we discuss the possibility that it fails to be the correct saddle point globally. ©2000 The American Physical Society.

Lamé differential equations and electrostatics

The problem of existence and uniqueness of polynomial solutions of the Lamé differential equation A(x)y″ + 2B(x)y′ + C(x)y = 0, where A(x),B(x) and C(x) are polynomials of degree p + 1,p and p - 1, is under discussion. We concentrate on the case when A(x) has only real zeros aj and, in contrast to a classical result of Heine and Stieltjes which concerns the case of positive coefficients rj in the partial fraction decomposition B(x)/A(x) = ∑j p=0 rj/(x - aj), we allow the presence of both positive and negative coefficients rj. The corresponding electrostatic interpretation of the zeros of the solution y(x) as points of equilibrium in an electrostatic field generated by charges rj at aj is given. As an application we prove that the zeros of the Gegenbauer-Laurent polynomials are the points of unique equilibrium in a field generated by two positive and two negative charges. © 2000 American Mathematical Society.

Analytical functions for the calculation of hyperspherical potential curves of atomic systems

We present angular basis functions for the Schrödinger equation of two-electron systems in hyperspherical coordinates. By using the hyperspherical adiabatic approach, the wave functions of two-electron systems are expanded in analytical functions, which generalizes the Jacobi polynomials. We show that these functions, obtained by selecting the diagonal terms of the angular equation, allow efficient diagonalization of the Hamiltonian for all values of the hyperspherical radius. The method is applied to the determination of the 1S e energy levels of the Li + and we show that the precision can be improved in a systematic and controllable way. ©2000 The American Physical Society.

Gaussian extended cubature formulae for polyharmonic functions

The purpose of this paper is to show certain links between univariate interpolation by algebraic polynomials and the representation of polyharmonic functions. This allows us to construct cubature formulae for multivariate functions having highest order of precision with respect to the class of polyharmonic functions. We obtain a Gauss type cubature formula that uses ℳ values of linear functional (integrals over hyperspheres) and is exact for all 2ℳ-harmonic functions, and consequently, for all algebraic polynomials of n variables of degree 4ℳ - 1.

Variational calculation of positronium-helium-atom scattering length

A basis-set calculation scheme for S-waves Ps-He elastic scattering below the lowest inelastic threshold was formulated using a variational expression for the transition matrix. The scheme was illustrated numerically by calculating the scattering length in the electronic doublet state: a=1.0±0.1 a.u.

Estimates of covariance functions for growth from birth to 630 days of age in Nelore cattle

Weight records of Brazilian Nelore cattle, from birth to 630 d of age, recorded every 3 mo, were analyzed using random regression models. Independent variables were Legendre polynomials of age at recording. The model of analysis included contemporary groups as fixed effects and age of dam as a linear and quadratic covariable. Mean trends were modeled through a cubic regression on orthogonal polynomials of age. Up to four sets of random regression coefficients were fitted for animals' direct and maternal, additive genetic, and permanent environmental effects. Changes in measurement error variances with age were modeled through a variance function. Orders of polyno-mial fit from three to six were considered, resulting in up to 77 parameters to be estimated. Models fitting random regressions modeled the pattern of variances in the data adequately, with estimates similar to those from corresponding univariate analysis. Direct heritability estimates decreased after birth and tended to be lowest at ages at which maternal effect estimates tended to be highest. Maternal heritability estimates increased after birth to a peak around 110 to 120 d of age and decreased thereafter. Additive genetic direct correlation estimates between weights at standard ages (birth, weaning, yearling, and final weight) were moderate to high and maternal genetic and environmental correlations were consistently high. © 2001 American Society of Animal Science. All rights reserved.

On the two point Padé table for a distribution

Some additional recurrence relations for the denominator polynomials of two point Padé approximants are derived. An example in which the coefficients of one of the two series, from which the Padé approximants are derived, are moments of a distribution is considered. For this example, properties of the denominator polynomials, and their zeros, are described.

Revendo os códigos hamming e CRC para tratar com erros na transmissão de dados

This article has the purpose to review the main codes used to detect and correct errors in data communication specifically in the computer's network. The Hamming's code and the Ciclic Redundancy Code (CRC) are presented as the focus of this article as well as CRC hardware implementation. Each code is reviewed in details in order to fill the gaps in the literature and to make it accessible to the computer science and engineering students as well as to anyone who may be interested in learning the technique to treat error in data communication.

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.