Fish community structure along a conservation gradient in Bodoquena Plateau streams, central West of Brazil.

Aim: To investigate whether composition and structure of stream ichthyofauna vary along the conservation gradient in the Bodoquena Plateau; Methods: Standardized sampling was performed in nine stream stretches (three references, three in the pasture, and three in urban areas), each 80 m long, in April, May and June/08; Results: A quantity of 8,102 individuals representing 36 species was collected. There were no significant differences with respect to absolute species richness among stretches. Urban stretches were more similar to each other than the other two groups, both regarding species composition and abundance. A set of six species was considered an indicator of reference stretches, whereas two were of pasture stretches and four of urban stretches. Poecilia reticulata and Corydoras aeneus, occurring only in urban stretches, were unique in showing the maximum values in the indicator species analysis; Conclusions: Results indicate changes in the ichthyofauna with urbanized surrounding water courses. The presence and abundance of Poecilia reticulata and Corydoras aeneus may indicate the quality loss of these environments.

An adapted thermal-gradient block for the germination of photoblastic seeds

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

On the dissimilarity between the algorithms for computing the symmetric energy-momentum tensor in ordinary field theory and general relativity

The recipe used to compute the symmetric energy-momentum tensor in the framework of ordinary field theory bears little resemblance to that used in the context of general relativity, if any. We show that if one stal ts fi om the field equations instead of the Lagrangian density, one obtains a unified algorithm for computing the symmetric energy-momentum tensor in the sense that it can be used for both usual field theory and general relativity.

Analytical attitude propagation with non-singular variables and gravity gradient torque for spin stabilized satellite

An analytical approach for the spin stabilized satellite attitude propagation is presented using the non-singular canonical variables to describe the rotational motion. Two sets of variables were introduced for Fukushima in 1994 by a canonical transformation and they are useful when the angle between z-satellite axis of a coordinate system fixed in artificial satellite and the rotational angular momentum vector is zero or when the angle between Z-equatorial axis and rotation angular momentum vector is zero. Analytical solutions for rotational motion equations and torque-free motion are discussed in terms of the elliptic functions and by the application of some simplification to get an approximated solution. These solutions are compared with a numerical solution and the results show a good agreement for many rotation periods. When the mean Hamiltonian associated with the gravity gradient torque is included, an analytical solution is obtained by the application of the successive approximations' method for the satellite in an elliptical orbit. These solutions show that the magnitude of the rotation angular moment is not affected by the gravity gradient torque but this torque causes linear and periodic variations in the angular variables, long and short periodic variations in Z-equatorial component of the rotation angular moment and short periodic variations in x-satellite component of the rotation angular moment. The goal of this analysis is to emphasize the geometrical and physical meaning of the non-singular variables and to validate the approximated analytical solution for the rotational motion without elliptic functions for a non-symmetrical satellite. The analysis can be applied for spin stabilized satellite and in this case the general solution and the approximated solution are coincidence. Then the results can be used in analysis of the space mission of the Brazilian Satellites. (C) 2007 COSPAR. Published by Elsevier Ltd. All rights reserved.

Analysis of heuristic algorithms for the transportation model in static and multistage planning in network expansion systems

The usefulness of the application of heuristic algorithms in the transportation model, first proposed by Garver, is analysed in relation to planning for the expansion of transmission systems. The formulation of the mathematical model and the solution techniques proposed in the specialised literature are analysed in detail. Starting with the constructive heuristic algorithm proposed by Garver, an extension is made to the problem of multistage planning for transmission systems. The quality of the solutions found by heuristic algorithms for the transportation model is analysed, as are applications in problems of planning transmission systems.

Stability analysis of the attitude of artificial satellites subject to gravity gradient torque

Using a canonical formulation, the stability of the rotational motion of artificial satellites is analyzed considering perturbations due to the gravity gradient torque. Here Andoyer's variables are used to describe the rotational motion. One of the approaches that allow the analysis of the stability of Hamiltonian systems needs the reduction of the Hamiltonian to a normal form. Firstly equilibrium points are found. Using generalized coordinates, the Hamiltonian is expanded in the neighborhood of the linearly stable equilibrium points. In a next step a canonical linear transformation is used to diagonalize the matrix associated to the linear part of the system. The quadratic part of the Hamiltonian is normalized. Based in a Lie-Hori algorithm a semi-analytic process for normalization is applied and the Hamiltonian is normalized up to the fourth order. Once the Hamiltonian is normalized up to order four, the analysis of stability of the equilibrium point is performed using the theorem of Kovalev and Savichenko. This semi-analytical approach was applied considering some data sets of hypothetical satellites. For the considered satellites it was observed few cases of stable motion. This work contributes for space missions where the maintenance of spacecraft attitude stability is required.

A cost optimization-based design of precast concrete floors using genetic algorithms

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

Genetic Algorithms (Binary and Real Codes) for the Optimisation of a Fermentation Process for Butanol Production

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

Using traditional heuristic algorithms on an initial genetic algorithm population applied to the transmission expansion planning problem

This paper analyses the impact of choosing good initial populations for genetic algorithms regarding convergence speed and final solution quality. Test problems were taken from complex electricity distribution network expansion planning. Constructive heuristic algorithms were used to generate good initial populations, particularly those used in resolving transmission network expansion planning. The results were compared to those found by a genetic algorithm with random initial populations. The results showed that an efficiently generated initial population led to better solutions being found in less time when applied to low complexity electricity distribution networks and better quality solutions for highly complex networks when compared to a genetic algorithm using random initial populations.

Use of Pyrosequencing and Denaturing Gradient Gel Electrophoresis to Examine the Effects of Probiotics and Essential Oil Blends on Digestive Microflora in Broilers Under Mixed Eimeria Infection

A protective digestive microflora helps prevent and reduce broiler infection and colonization by enteropathogens. In the current experiment, broilers fed diets supplemented with probiotics and essential oil (EO) blends were infected with a standard mixed Eimeria spp. to determine effects of performance enhancers on ileal and cecal microbial communities (MCs). Eight treatment groups included four controls (uninfected-unmedicated [UU], unmedicated-infected, the antibiotic BMD plus the ionophore Coban as positive control, and the ionophore as negative control), and four treatments (probiotics BC-30 and Calsporin; and EO, Crina Poultry Plus, and Crina PoultryAF). Day-old broilers were raised to 14 days in floor pens on used litter and then were moved to Petersime batteries and inoculated at 15 days with mixed Eimeria spp. Ileal and cecal samples were collected at 14 days and 7 days postinfection. Digesta DNA was subjected to pyrosequencing for sequencing of individual cecal bacteria and denaturing gradient gel electrophoresis (DGGE) for determination of changes in ileal and cecal MC according to percentage similarity coefficient (%SC). Pyrosequencing is very sensitive detecting shifts in individual bacterial sequences, whereas DGGE is able to detect gross shifts in entire MC. These combined techniques offer versatility toward identifying feed additive and mild Eimeria infection modulation of broiler MC. Pyrosequencing detected 147 bacterial species sequences. Additionally, pyrosequencing revealed the presence of relatively low levels of the potential human enteropathogens Campylobacter sp. and four Shigella spp. as well as the potential poultry pathogen Clostridiun perfringens. Pre- and postinfection changes in ileal (56%SC) and cecal (78.5%SC) DGGE profiles resulted from the coccidia infection and with increased broiler age. Probiotics and EO changed MC from those seen in UU ilea and ceca. Results potentially reflect the performance enhancement above expectations in comparison to broilers not given the probiotics or the specific EO blends as feed supplements.

Influence of the resonance in a gravity-gradient stabilized satellite

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

Electric power systems transient stability analysis by neural networks

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

Algorithms for network piecewise-linear programs: A comparative study

Piecewise-Linear Programming (PLP) is an important area of Mathematical Programming and concerns the minimisation of a convex separable piecewise-linear objective function, subject to linear constraints. In this paper a subarea of PLP called Network Piecewise-Linear Programming (NPLP) is explored. The paper presents four specialised algorithms for NPLP: (Strongly Feasible) Primal Simplex, Dual Method, Out-of-Kilter and (Strongly Polynomial) Cost-Scaling and their relative efficiency is studied. A statistically designed experiment is used to perform a computational comparison of the algorithms. The response variable observed in the experiment is the CPU time to solve randomly generated network piecewise-linear problems classified according to problem class (Transportation, Transshipment and Circulation), problem size, extent of capacitation, and number of breakpoints per arc. Results and conclusions on performance of the algorithms are reported.