The Q-D algorithm for transforming series expansions into a corresponding continued fraction: an extension to cope with zero coefficients

An algorithm for deriving a continued fraction that corresponds to two series expansions simultaneously, when there are zero coefficients in one or both series, is given. It is based on using the Q-D algorithm to derive the corresponding fraction for two related series, and then transforming it into the required continued fraction. Two examples are given. (C) 2003 Elsevier B.V. All rights reserved.

Characterization of generalized Bessel polynomials in terms of polynomial inequalities

Generalized Bessel polynomials (GBPs) are characterized as the extremal polynomials in certain inequalities in L-2 norm of Markov type. (C) 1998 Academic Press.

Multiscale Fractal Descriptors and Polynomial Classifier for Partial Pixels Identification in Regions of Interest of Mammographic Images

Computer systems are used to support breast cancer diagnosis, with decisions taken from measurements carried out in regions of interest (ROIs). We show that support decisions obtained from square or rectangular ROIs can to include background regions with different behavior of healthy or diseased tissues. In this study, the background regions were identified as Partial Pixels (PP), obtained with a multilevel method of segmentation based on maximum entropy. The behaviors of healthy, diseased and partial tissues were quantified by fractal dimension and multiscale lacunarity, calculated through signatures of textures. The separability of groups was achieved using a polynomial classifier. The polynomials have powerful approximation properties as classifiers to treat characteristics linearly separable or not. This proposed method allowed quantifying the ROIs investigated and demonstrated that different behaviors are obtained, with distinctions of 90% for images obtained in the Cranio-caudal (CC) and Mediolateral Oblique (MLO) views.

Using genetic algorithm to design protein sequence

In this work, genetic algorithms concepts along with a rotamer library for proteins side chains are used to optimize the tertiary structure of the hydrophobic core of Cytochrome b(562) starting from the known PDB structure of its backbone which is kept fixed while the side chains of the hydrophobic core are allowed to adopt the conformations present in the rotamer library. The atoms of the side chains forming the core interact via van der Waals energy. Besides the prediction of the native core structure, it is also suggested a set of different amino acid sequences for this core. Comparison between these new cores and the native are made in terms of their volumes, van der Waals energies values and the numbers of contacts made by the side chains forming the cores. This paper proves that genetic algorithms area efficient to design new sequence for the protein core. (C) 2007 Elsevier B.V. All rights reserved.

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.

On the reversible quadratic polynomial vector fields on S-2

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

STABLE PIECEWISE POLYNOMIAL VECTOR FIELDS

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

Relaxation algorithm to hyperbolic states in Gross-Pitaevskii equation

A new version of the relaxation algorithm is proposed in order to obtain the stationary ground-state solutions of nonlinear Schrodinger-type equations, including the hyperbolic solutions. In a first example, the method is applied to the three-dimensional Gross-Pitaevskii equation, describing a condensed atomic system with attractive two-body interaction in a non-symmetrical trap, to obtain results for the unstable branch. Next, the approach is also shown to be very reliable and easy to be implemented in a non-symmetrical case that we have bifurcation, with nonlinear cubic and quintic terms. (c) 2006 Elsevier B.V. All rights reserved.

Algorithm for probing the unitarity of topologically massive models

An uncomplicated and easy handling prescription that converts the task of checking the unitarity of massive, topologically massive, models into a straightforward algebraic exercise, is developed. The algorithm is used to test the unitarity of both topologically massive higher-derivative electromagnetism (TMHDE) and topologically massive higher-derivative gravity (TMHDG). The novel and amazing features of these effective field models are also discussed.

Approximate analytical states of a polynomial potential: an example of symmetry restoration

An approximate analytical expression for the first two eigenvalues of the Schrodinger equation for the potential V(x) = Ax(4) + Bx(2) is achieved by using the Symanzik scaling symmetry. A kind of symmetry restoration when one of the potential parameters changes conveniently is observed. (C) 2000 Published by Elsevier B.V. B.V. All rights reserved.

An improved tabu-based vector optimal algorithm for design optimizations of electromagnetic devices

This paper introduces an improved tabu-based vector optimal algorithm for multiobjective optimal designs of electromagnetic devices. The improvements include a division of the entire search process, a new method for fitness assignment, a novel scheme for the generation and selection of neighborhood solutions, and so forth. Numerical results on a mathematical function and an engineering multiobjective design problem demonstrate that the proposed method can produce virtually the exact Pareto front, in both parameter and objective spaces, even though the iteration number used by it is only about 70% of that required by its ancestor.

Constructive heuristic algorithm for the DC model in network transmission expansion planning

A novel constructive heuristic algorithm to the network expansion planning problem is presented the basic idea comes from Garver's work applied to the transportation model, nevertheless the proposed algorithm is for the DC model. Tests results with most known systems in the literature are carried out to show the efficiency of the method.

Row-column response surface designs

Factorial experiments are widely used in industry to investigate the effects of process factors on quality response variables. Many food processes, for example, are not only subject to variation between days, but also between different times of the day. Removing this variation using blocking factors leads to row-column designs. In this paper, an algorithm is described for constructing factorial row-column designs when the factors are quantitative, and the data are to be analysed by fitting a polynomial model. The row-column designs are constructed using an iterative interchange search, where interchanges that result in an improvement in the weighted mean of the efficiency factors corresponding to the parameters of interest are accepted. Some examples illustrating the performance of the algorithm are given.

Constructive heuristic algorithm in branch-and-bound structure applied to transmission network expansion planning

A constructive heuristic algorithm to solve the transmission system expansion planning problem is proposed with the aim of circumventing some critical problems of classical heuristic algorithms that employ relaxed mathematical models to calculate a sensitivity index that guides the circuit additions. The proposed heuristic algorithm is in a branch-and-bound algorithm structure, which can be used with any planning model, such as Transportation model, DC model, AC model or Hybrid models. Tests of the proposed algorithm are presented on real Brazilian systems.