814 resultados para bat algorithm
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
In this paper, to solve the reconfiguration problem of radial distribution systems a scatter search, which is a metaheuristic-based algorithm, is proposed. In the codification process of this algorithm a structure called node-depth representation is used. It then, via the operators and from the electrical power system point of view, results finding only radial topologies. In order to show the effectiveness, usefulness, and the efficiency of the proposed method, a commonly used test system, 135-bus, and a practical system, a part of Sao Paulo state's distribution network, 7052 bus, are conducted. Results confirm the efficiency of the proposed algorithm that can find high quality solutions satisfying all the physical and operational constraints of the problem.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
A self-learning simulated annealing algorithm is developed by combining the characteristics of simulated annealing and domain elimination methods. The algorithm is validated by using a standard mathematical function and by optimizing the end region of a practical power transformer. The numerical results show that the CPU time required by the proposed method is about one third of that using conventional simulated annealing algorithm.
Resumo:
Tick-borne relapsing fever in western North America is a zoonosis caused by spirochetes in the genus Borrelia that are transmitted by argasid ticks of the genus Ornithodoros (1). Human disease occurs in many focal areas and is associated with infections of Borrelia hermsii, B. turicatae, and possibly B. parkeri (2,3). Although the ecologic parameters that maintain B. hermsii and B. turicatae differ, human infections usually occur in rustic cabins (B. hermsii) and caves (B. turicatae) inhabited by ticks and their terrestrial vertebrate hosts (1). Recently, Gill et al. (4) provided evidence that the argasid bat tick, Carios kelleyi, feeds upon humans. Subsequently, Loftis et al. (5) used PCR analysis and DNA sequencing to detect in C. kelleyi an unidentifi ed Borrelia species that was closely related to B. turicatae and B. parkeri.
Resumo:
Active machine learning algorithms are used when large numbers of unlabeled examples are available and getting labels for them is costly (e.g. requiring consulting a human expert). Many conventional active learning algorithms focus on refining the decision boundary, at the expense of exploring new regions that the current hypothesis misclassifies. We propose a new active learning algorithm that balances such exploration with refining of the decision boundary by dynamically adjusting the probability to explore at each step. Our experimental results demonstrate improved performance on data sets that require extensive exploration while remaining competitive on data sets that do not. Our algorithm also shows significant tolerance of noise.
Resumo:
Two of the five subspecies of the western big-eared bat, Corynorhinus townsendii, are listed as federally endangered with the remaining three being of conservation concern. Knowing the degree of connectivity among populations would aid in the establishment of sound conservation and management plans for this taxon. For this purpose, we have developed and characterized eight polymorphic microsatellite markers.
Resumo:
We developed and characterized 15 microsatellite markers for Rafinesque’s big-eared bat, Corynorhinus rafinesquii. In a population from Tennessee, the number of alleles per locus ranged from three to 13 and observed heterozygosities were 0.35 to 0.97 per locus. These loci will provide appropriate variability for estimation of population connectivity, demographic parameters, and genetic diversity for this species of concern.
Resumo:
Plans and instructions for building a “Two-chamber Rocket Box” bat-house to accommodate large numbers (>200) of bats. See further: http://www.batcon.org/educatorsK/pdfs/fof_bathouse.pdf
Resumo:
Two new records of Tadarida brasiliensis mexicana are reported from Nebraska. The literature records of this taxon from the central United States are summarized. In this region of North America, these bats occupy a “natal range” where the species carries on regular reproductive activities and the populations are relatively stable, including California, Arizona, New Mexico, Texas, and Oklahoma. To the north of the natal range of T. b. mexicana is a “pioneering zone” where, under favorable conditions, the species is capable of reproducing and conducting its normal activities. The pioneering zone of the Mexican free-tailed bat includes Barber and Comanche counties in Kansas and as far north as Mesa and Saguache counties in southwestern Colorado. Finally, to the north of the pioneering zone, there is a much larger area that is proposed as the “exploring zone” in which only a few individuals of the species are found. Reproductive activities do not occur on any regular basis in the exploring zone, which encompasses the remainder of Colorado and Kansas as well as the states of Wyoming, Nebraska, Iowa, Illinois, Missouri, and southeastern South Dakota.
Resumo:
The irregular shape packing problem is approached. The container has a fixed width and an open dimension to be minimized. The proposed algorithm constructively creates the solution using an ordered list of items and a placement heuristic. Simulated annealing is the adopted metaheuristic to solve the optimization problem. A two-level algorithm is used to minimize the open dimension of the container. To ensure feasible layouts, the concept of collision free region is used. A collision free region represents all possible translations for an item to be placed and may be degenerated. For a moving item, the proposed placement heuristic detects the presence of exact fits (when the item is fully constrained by its surroundings) and exact slides (when the item position is constrained in all but one direction). The relevance of these positions is analyzed and a new placement heuristic is proposed. Computational comparisons on benchmark problems show that the proposed algorithm generated highly competitive solutions. Moreover, our algorithm updated some best known results. (C) 2012 Elsevier Ltd. All rights reserved.