Periodic perturbations of quadratic planar polynomial vector fields

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

Hilbert space of curved βγ systems on quadric cones

We clarify the structure of the Hilbert space of curved βγ systems defined by a quadratic constraint. The constraint is studied using intrinsic and BRST methods, and their partition functions are shown to agree. The quantum BRST cohomology is non-empty only at ghost numbers 0 and 1, and there is a one-to-one mapping between these two sectors. In the intrinsic description, the ghost number 1 operators correspond to the ones that are not globally defined on the constrained surface. Extension of the results to the pure spinor superstring is discussed in a separate work.

A class of reversible quadratic polynomial vector fields on S-2

We study a class of quadratic reversible polynomial vector fields on S-2. We classify all the centers of this class of vector fields and we characterize its global phase portrait. (C) 2010 Elsevier B.V. All rights reserved.

Consistency of super-poincaré covariant superstring tree amplitudes

Using pure spinors, the superstring was recently quantized in a manifestly ten-dimensional super-Poincaré covariant manner and a covariant prescription was given for tree-level scattering amplitudes. In this paper, we prove that this prescription is cyclically symmetric and, for the scattering of an arbitrary number of massless bosons and up to four massless fermions, it agrees with the standard Ramond-Neveu-Schwarz prescription.

Influence of anatomical location on CT numbers in cone beam computed tomography

Objective: To assess the influence of anatomical location on computed tomography (CT) numbers in mid- and full field of view (FOV) cone beam computed tomography (CBCT) scans. Study Design: Polypropylene tubes with varying concentrations of dipotassium hydrogen phosphate (K2HPO4) solutions (50-1200 mg/mL) were imaged within the incisor, premolar, and molar dental sockets of a human skull phantom. CBCT scans were acquired using the NewTom 3G and NewTom 5G units. The CT numbers of the K2HPO 4 phantoms were measured, and the relationship between CT numbers and K2HPO4 concentration was examined. The measured CT numbers of the K2HPO4 phantoms were compared between anatomical sites. Results: At all six anatomical locations, there was a strong linear relationship between CT numbers and K2HPO4 concentration (R 2 > 0.93). However, the absolute CT numbers varied considerably with the anatomical location. Conclusion: The relationship between CT numbers and object density is not uniform through the dental arch on CBCT scans. © 2013 Elsevier Inc.

Estimation of a preference map of new consumers for spatial load forecasting simulation methods using a spatial analysis of points

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

On the Betti number of the union of two generic map images

Let f: M --> N and g: K --> N be generic differentiable maps of compact manifolds without boundary into a manifold such that their intersection satisfies a certain transversality condition. We show, under a certain cohomological condition, that if the images f(M) and g(K) intersect, then the (upsilon + 1)th Betti number of their union is strictly greater than the sum of their (upsilon + 1)th Betti numbers, where upsilon = dim M + dim K - dim N. This result is applied to the study of coincidence sets and fixed point sets. (C) 1999 Elsevier B.V. B.V. All rights reserved.

Time-periodic perturbation of a Lienard equation with an unbounded homoclinic loop

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

Inequalities for zeros of associated polynomials and derivatives of orthogonal polynomials

It is well known and easy to see that the zeros of both the associated polynomial and the derivative of an orthogonal polynomial p(n)(x) interlace with the zeros of p(n)(x) itself. The natural question of how these zeros interlace is under discussion. We give a sufficient condition for the mutual location of kth, 1 less than or equal to k less than or equal to n - 1, zeros of the associated polynomial and the derivative of an orthogonal polynomial in terms of inequalities for the corresponding Cotes numbers. Applications to the zeros of the associated polynomials and the derivatives of the classical orthogonal polynomials are provided. Various inequalities for zeros of higher order associated polynomials and higher order derivatives of orthogonal polynomials are proved. The results involve both classical and discrete orthogonal polynomials, where, in the discrete case, the differential operator is substituted by the difference operator. (C) 2001 IMACS. Published by Elsevier B.V. B.V. All rights reserved.

A refinement of the gauss-lucas theorem

The classical Gauss-Lucas Theorem states that all the critical points (zeros of the derivative) of a nonconstant polynomial p lie in the convex hull H of the zeros of p. It is proved that, actually, a subdomain of H contains the critical points of p. ©1998 American Mathematical Society.

Improving accuracy and speed of optimum-path forest classifier using combination of disjoint training subsets

The Optimum-Path Forest (OPF) classifier is a recent and promising method for pattern recognition, with a fast training algorithm and good accuracy results. Therefore, the investigation of a combining method for this kind of classifier can be important for many applications. In this paper we report a fast method to combine OPF-based classifiers trained with disjoint training subsets. Given a fixed number of subsets, the algorithm chooses random samples, without replacement, from the original training set. Each subset accuracy is improved by a learning procedure. The final decision is given by majority vote. Experiments with simulated and real data sets showed that the proposed combining method is more efficient and effective than naive approach provided some conditions. It was also showed that OPF training step runs faster for a series of small subsets than for the whole training set. The combining scheme was also designed to support parallel or distributed processing, speeding up the procedure even more. © 2011 Springer-Verlag.

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)

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)

Impact of obesity on autonomic modulation, heart rate and blood pressure in obese young people

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

Method of numerical correction of errors occasioned by delay of records during the monitoring of environmental variables of interest for animal production

As condições de ambiente térmico e aéreo, no interior de instalações para animais, alteram-se durante o dia, devido à influência do ambiente externo. Para que análises estatísticas e geoestatísticas sejam representativas, uma grande quantidade de pontos distribuídos espacialmente na área da instalação deve ser monitorada. Este trabalho propõe que a variação no tempo das variáveis ambientais de interesse para a produção animal, monitoradas no interior de instalações para animais, pode ser modelada com precisão a partir de registros discretos no tempo. O objetivo deste trabalho foi desenvolver um método numérico para corrigir as variações temporais dessas variáveis ambientais, transformando os dados para que tais observações independam do tempo gasto durante a aferição. O método proposto aproximou os valores registrados com retardos de tempo aos esperados no exato momento de interesse, caso os dados fossem medidos simultaneamente neste momento em todos os pontos distribuídos espacialmente. O modelo de correção numérica para variáveis ambientais foi validado para o parâmetro ambiental temperatura do ar, sendo que os valores corrigidos pelo método não diferiram pelo teste Tukey, a 5% de probabilidade dos valores reais registrados por meio de dataloggers.