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.

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.

Geographical distribution of vampire bat-related cattle rabies in Brazil

Seventy-seven rabies virus (RV) isolates originating from Brazilian cattle were genetically characterized. Partial nucleoprotein gene sequences of these isolates were phylogenetically and geographically analyzed. Cattle isolates, which clustered with the vampire bat-related RV group, were further subdivided into nine genetic subgroups. These subgroups were distributed widely in lowland regions, with some subgroups separated from each other by mountain ranges. In addition, separation of the groups in mountainous regions was correlated with altitude. These results indicate that cattle rabies is derived from several regionally-defined variants, which suggests that its geographical distribution is related to that of the vampire bat population.

Modified Chebyshev algorithm: some applications

Two applications of the modified Chebyshev algorithm are considered. The first application deals with the generation of orthogonal polynomials associated with a weight function having singularities on or near the end points of the interval of orthogonality. The other application involves the generation of real Szego polynomials.

Branch and bound algorithm for transmission system expansion planning using a transportation model

A method for optimal transmission network expansion planning is presented. The transmission network is modelled as a transportation network. The problem is solved using hierarchical Benders decomposition in which the problem is decomposed into master and slave subproblems. The master subproblem models the investment decisions and is solved using a branch-and-bound algorithm. The slave subproblem models the network operation and is solved using a specialised linear program. Several alternative implementations of the branch-and-bound algorithm have been rested. Special characteristics of the transmission expansion problem have been taken into consideration in these implementations. The methods have been tested on various test systems available in the literature.

Specialised branch-and-bound algorithm for transmission network expansion planning

An algorithm is presented that finds the optimal plan long-term transmission for till cases studied, including relatively large and complex networks. The knowledge of optimal plans is becoming more important in the emerging competitive environment, to which the correct economic signals have to be sent to all participants. The paper presents a new specialised branch-and-bound algorithm for transmission network expansion planning. Optimality is obtained at a cost, however: that is the use of a transportation model for representing the transmission network, in this model only the Kirchhoff current law is taken into account (the second law being relaxed). The expansion problem then becomes an integer linear program (ILP) which is solved by the proposed branch-and-bound method without any further approximations. To control combinatorial explosion the branch- and bound algorithm is specialised using specific knowledge about the problem for both the selection of candidate problems and the selection of the next variable to be used for branching. Special constraints are also used to reduce the gap between the optimal integer solution (ILP program) and the solution obtained by relaxing the integrality constraints (LP program). Tests have been performed with small, medium and large networks available in the literature.

Attraction of the fruit-eating bat Carollia perspicillata to Piper gaudichaudianum essential oil

We performed field tests using mimetic Piper fruits with and without essential oil extracted through hydrodistillation from Piper gaudichaudianum ripe fruits in order to evaluate the role of odor in Carollia perspicillata attraction and capture in mist-nets. During the field tests, 26 C. perspicillata were captured, 21 (80.7%) in nets with the essential oil of P. gaudichaudianum and five (19.3%) in nets without oil. Other bat species, Artibeus spp. ( 67), which is specialized on fruits of Moraceae, and Sturnira lilium ( 10), specialized on those of Solanaceae, were also captured, but they exhibited no significant preference for nets with or without oil. We conclude that odor is pre-eminent over visual cues in food location by C. perspicillata in a field situation. Based on the result, we propose the extraction and use of essential oils of chiropterochoric fruits as a useful approach to improve autoecological studies on fruit-eating bats and to promote tropical forest restoration through the attraction of frugivorous bats to degraded areas.

Efficient linear programming algorithm for the transmission network expansion planning problem

The transmission network planning problem is a non-linear integer mixed programming problem (NLIMP). Most of the algorithms used to solve this problem use a linear programming subroutine (LP) to solve LP problems resulting from planning algorithms. Sometimes the resolution of these LPs represents a major computational effort. The particularity of these LPs in the optimal solution is that only some inequality constraints are binding. This task transforms the LP into an equivalent problem with only one equality constraint (the power flow equation) and many inequality constraints, and uses a dual simplex algorithm and a relaxation strategy to solve the LPs. The optimisation process is started with only one equality constraint and, in each step, the most unfeasible constraint is added. The logic used is similar to a proposal for electric systems operation planning. The results show a higher performance of the algorithm when compared to primal simplex methods.

IDENTIFICATION OF COMMON FRAGILE SITES IN CHROMOSOMES OF 2 SPECIES OF BAT (CHIROPTERA, MAMMALIA)

In the karyotypes of the bat species Molossus ater and M molossus, spontaneous and bromodeoxyuridine (BrdU)- or aphidicolin (APC)-sensitive fragile sites were located. Four chromosome regions harbored APC-sensitive fragile sites: 1q9 and 8q4 in both M ater and M molossus, 3q3 in M ater, and 1p7 in M molossus. The fragile sites in 1q9 and 8q4 were also observed without induction in M molossus. BrdU-sensitive fragile sites were not detected. Despite observations in several other species, the fragile sites detected in Molossus are not coincident with the breakpoints involved in the chromosome rearrangements occurring in the evolution of 7 species of the Molossidae family.

An alternative approach to solve convergence problems in the backpropagation algorithm

The multilayer perceptron network has become one of the most used in the solution of a wide variety of problems. The training process is based on the supervised method where the inputs are presented to the neural network and the output is compared with a desired value. However, the algorithm presents convergence problems when the desired output of the network has small slope in the discrete time samples or the output is a quasi-constant value. The proposal of this paper is presenting an alternative approach to solve this convergence problem with a pre-conditioning method of the desired output data set before the training process and a post-conditioning when the generalization results are obtained. Simulations results are presented in order to validate the proposed approach.

A SIMPLE AND FAST PROCEDURE TO GROW BAT FIBROBLASTS FROM LUNG BIOPSIES FOR CYTOGENETIC STUDIES

A fast, simple, and inexpensive procedure to establish fibroblast culture from bat lungs is presented. Explants plated following mechanical disaggregation provide good quality preparations for cytogenetics studies in about one week. Cultures established with this procedure may also be used for other biological studies.

Simple orbit determination using GPS based on a least-squares algorithm employing sequential givens rotations

A low-cost computer procedure to determine the orbit of an artificial satellite by using short arc data from an onboard GPS receiver is proposed. Pseudoranges are used as measurements to estimate the orbit via recursive least squares method. The algorithm applies orthogonal Givens rotations for solving recursive and sequential orbit determination problems. To assess the procedure, it was applied to the TOPEX/POSEIDON satellite for data batches of one orbital period (approximately two hours), and force modelling, due to the full JGM-2 gravity field model, was considered. When compared with the reference Precision Orbit Ephemeris (POE) of JPL/NASA, the results have indicated that precision better than 9 m is easily obtained, even when short batches of data are used. Copyright (c) 2007.