Fine structure of the boundary tissue of the seminiferous tubuli of the vampire bat (Desmodus rotundus, G.; Microchiroptera).

Structurally the boundary tissue of the vampire bat seminiferous tubuli showed 2 to 5 layers of connective tissue in which elongated contractile cells and lamellar and/or fibrillar collagen were noticed. This boundary tissue forms the seminiferous tubular lamina propria. Its structure was more complex around the seminiferous tubuli near the Capsula testicularis than between the adjacent and contiguous tubuli into the testicular lobuli. The whole ultrastructural organization of the seminiferous lamina propria was described here.

Another prefiltering algorithm for adaptive IIR filtering

An algorithm for adaptive IIR filtering that uses prefiltering structure in direct form is presented. This structure has an estimation error that is a linear function of the coefficients. This property greatly simplifies the derivation of gradient-based algorithms. Computer simulations show that the proposed structure improves convergence speed.

Combining genetic algorithm and simulated annealing: A molecular geometry optimization study

We introduce a new hybrid approach to determine the ground state geometry of molecular systems. Firstly, we compared the ability of genetic algorithm (GA) and simulated annealing (SA) to find the lowest energy geometry of silicon clusters with six and 10 atoms. This comparison showed that GA exhibits fast initial convergence, but its performance deteriorates as it approaches the desired global extreme. Interestingly, SA showed a complementary convergence pattern, in addition to high accuracy. Our new procedure combines selected features from GA and SA to achieve weak dependence on initial parameters, parallel search strategy, fast convergence and high accuracy. This hybrid algorithm outperforms GA and SA by one order of magnitude for small silicon clusters (Si6 and Si10). Next, we applied the hybrid method to study the geometry of a 20-atom silicon cluster. It was able to find an original geometry, apparently lower in energy than those previously described in literature. In principle, our procedure can be applied successfully to any molecular system. © 1998 Elsevier Science B.V.

Bat community in a cave from eastern Brazil, including a new record of Lionycteris (Phyllostomidae, Glossophaginae)

A cave bat community from a semiarid region in eastern Brazil was studied during the dry season. A high diversity was observed, with thirteen species recorded. Except for Micronycteris minuta and Lionycteris spurrelli, these bats were also found in other Brazilian karstic areas. The commonest species were the hematophague Desmodus rotundus, the omnivore Carollia perspicillata, and the insectivore Natalus stramineus. The bats formed itinerant colonies, moving frequently inside the cave. L. spurrelli was previously known from Amazonia, usually associated with evergreen forests. The present record extends its range 1600 km to the south. A disjunct distribution explains some morphological differentiation between Amazonia and Olhos d'Agua cave populations. The latter may be a relict of former continuous forest vegetation, which has been fragmented after the climatic optimum. Dispersion through the Cerrado forest gallery is also possible.

Algorithm for computing the propagator for higher derivative gravity theories

A simple algorithm for computing the propagator for higher derivative gravity theories based on the Barnes-Rivers operators is presented. The prescription is used, among other things, to obtain the propagator for quadratic gravity in an unconventional gauge. We also find the propagator for both gravity and quadratic gravity in an interesting gauge recently baptized the Einstein gauge [Hitzer and Dehnen, Int. J. Theor. Phys. 36 (1997), 559].

VAr planning using genetic algorithm and linear programming

A combined methodology consisting of successive linear programming (SLP) and a simple genetic algorithm (SGA) solves the reactive planning problem. The problem is divided into operating and planning subproblems; the operating subproblem, which is a nonlinear, ill-conditioned and nonconvex problem, consists of determining the voltage control and the adjustment of reactive sources. The planning subproblem consists of obtaining the optimal reactive source expansion considering operational, economical and physical characteristics of the system. SLP solves the optimal reactive dispatch problem related to real variables, while SGA is used to determine the necessary adjustments of both the binary and discrete variables existing in the modelling problem. Once the set of candidate busbars has been defined, the program implemented gives the location and size of the reactive sources needed, if any, to maintain the operating and security constraints.

A constructive heuristic algorithm to Short Term Transmission Network Expansion Planning

In this paper a method for solving the Short Term Transmission Network Expansion Planning (STTNEP) problem is presented. The STTNEP is a very complex mixed integer nonlinear programming problem that presents a combinatorial explosion in the search space. In this work we present a constructive heuristic algorithm to find a solution of the STTNEP of excellent quality. In each step of the algorithm a sensitivity index is used to add a circuit (transmission line or transformer) to the system. This sensitivity index is obtained solving the STTNEP problem considering as a continuous variable the number of circuits to be added (relaxed problem). The relaxed problem is a large and complex nonlinear programming and was solved through an interior points method that uses a combination of the multiple predictor corrector and multiple centrality corrections methods, both belonging to the family of higher order interior points method (HOIPM). Tests were carried out using a modified Carver system and the results presented show the good performance of both the constructive heuristic algorithm to solve the STTNEP problem and the HOIPM used in each step.

Defects location in power systems components through a dedicated genetic algorithm

In this work the problem of defects location in power systems is formulated through a binary linear programming (BLP) model based on alarms historical database of control and protection devices from the system control center, sets theory of minimal coverage (AI) and protection philosophy adopted by the electric utility. In this model, circuit breaker operations are compared to their expected states in a strictly mathematical manner. For solving this BLP problem, which presents a great number of decision variables, a dedicated Genetic Algorithm (GA), is proposed. Control parameters of the GA, such as crossing over and mutation rates, population size, iterations number and population diversification, are calibrated in order to obtain efficiency and robustness. Results for a test system found in literature, are presented and discussed. © 2004 IEEE.

PMUs optimized allocation using a tabu search algorithm for fault location in electric power distribution system

Phasor Measurement Units (PMUs) optimized allocation allows control, monitoring and accurate operation of electric power distribution systems, improving reliability and service quality. Good quality and considerable results are obtained for transmission systems using fault location techniques based on voltage measurements. Based on these techniques and performing PMUs optimized allocation it is possible to develop an electric power distribution system fault locator, which provides accurate results. The PMUs allocation problem presents combinatorial features related to devices number that can be allocated, and also probably places for allocation. Tabu search algorithm is the proposed technique to carry out PMUs allocation. This technique applied in a 141 buses real-life distribution urban feeder improved significantly the fault location results. © 2004 IEEE.

A branch-and-bound algorithm for the multi-stage transmission expansion planning

This work presents a branch-and-bound algorithm to solve the multi-stage transmission expansion planning problem. The well known transportation model is employed, nevertheless the algorithm can be extended to hybrid models or to more complex ones such as the DC model. Tests with a realistic power system were carried out in order to show the performance of the algorithm for the expansion plan executed for different time frames. © 2005 IEEE.

Genetic algorithm of chu and beasley for static and multistage transmission expansion planning

In this paper the genetic algorithm of Chu and Beasley (GACB) is applied to solve the static and multistage transmission expansion planning problem. The characteristics of the GACB, and some modifications that were done, to efficiently solve the problem described above are also presented. Results using some known systems show that the GACB is very efficient. To validate the GACB, we compare the results achieved using it with the results using other meta-heuristics like tabu-search, simulated annealing, extended genetic algorithm and hibrid algorithms. © 2006 IEEE.

A unique intraorbital osseous structure in the large fruit-eating bat (Artibeus lituratus)

Objective: To describe the normal bony orbital structure of the large fruit-eating bat (Artibeus lituratus) with emphasis on a unique intraorbital bony structure previously not described in the literature. Procedures: The bony anatomy of the orbital cavity was studied on dissected skulls of large fruit-eating bats. The anatomic description of a unique intraorbital spine was made while studying the bony orbit of macerated skulls. Additional observations were made on dissected formalin-fixed whole heads. Both procedures were performed under a stereo dissecting microscope, using ×2-4-magnification. A histologic analysis of soft tissues surrounding this cylindrical bony structure was performed using cross and longitudinal oblique sections from decalcified whole heads, which had been fixed in formalin. Additionally, biometric measurements and a histomorphometric analysis were performed. Results and conclusions: An intraorbital cylindrical osseous structure measuring 3.96 ± 0.68 mm in length and 155.62 ± 14.03 μm in diameter was observed in the large fruit-eating bat (A. lituratus), creating a unique orbital structural design among mammals. We suggest the name optic spine of the alisphenoid bone. The anatomic, biometric and histologic characterization of this element might contribute to a further understanding of the dynamics of bat vision and the sort of factors that influenced evolution of the visual system of microbats. The authors hope that the documentation of this distinctive anatomic feature will also expand the debate about the phylogenetic analysis of the relationship among bat species in the near future. © 2007 American College of Veterinary Ophthalmologists.

Risk-assessment algorithm and recommendations for venous thromboembolism prophylaxis in medical patients

The risk for venous thromboembolism (VTE) in medical patients is high, but risk assessment is rarely performed because there is not yet a good method to identify candidates for prophylaxis. Purpose: To perform a systematic review about VTE risk factors (RFs) in hospitalized medical patients and generate recommendations (RECs) for prophylaxis that can be implemented into practice. Data sources: A multidisciplinary group of experts from 12 Brazilian Medical Societies searched MEDLINE, Cochrane, and LILACS. Study selection: Two experts independently classified the evidence for each RF by its scientific quality in a standardized manner. A risk-assessment algorithm was created based on the results of the review. Data synthesis: Several VTE RFs have enough evidence to support RECs for prophylaxis in hospitalized medical patients (eg, increasing age, heart failure, and stroke). Other factors are considered adjuncts of risk (eg, varices, obesity, and infections). According to the algorithm, hospitalized medical patients ≥40 years-old with decreased mobility, and ≥1 RFs should receive chemoprophylaxis with heparin, provided they don't have contraindications. High prophylactic doses of unfractionated heparin or low-molecular-weight-heparin must be administered and maintained for 6-14 days. Conclusions: A multidisciplinary group generated evidence-based RECs and an easy-to-use algorithm to facilitate VTE prophylaxis in medical patients. © 2007 Rocha et al, publisher and licensee Dove Medical Press Ltd.

Reconfiguration of distribution systems by a modified genetic algorithm

In this paper a genetic algorithm based reconfiguration method is proposed to minimize the real power losses of distribution systems. The main innovation of this research work is that new types of crossover and mutation operators are proposed, such that the best possible results are obtained, with an acceptable computational effort. The crossover and mutation operators were developed so as to take advantage of the particular characteristics of distribution systems (as the radial topology). Simulation results indicate that the proposed method is very efficient, being able to find excellent configurations, with low computational effort, especially for larger systems. ©2007 IEEE.