3 resultados para Fire engines

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the present study, mitochondrial (mt)DNA sequence data were used to examine the genetic structure of fire-eye antbirds (genus Pyriglena) along the Atlantic Forest and the predictions derived from the river hypothesis and from a Last Glacial Maximum Pleistocene refuge paleomodel were compared to explain the patterns of genetic variation observed in these populations. A total of 266 individuals from 45 populations were sampled over a latitudinal transect and a number of phylogeographical and population genetics analytical approaches were employed to address these questions. The pattern of mtDNA variation observed in fire-eye antbirds provides little support for the view that populations were isolated by the modern course of major Atlantic Forest rivers. Instead, the data provide stronger support for the predictions of the refuge model. These results add to the mounting evidence that climatic oscillations appear to have played a substantial role in shaping the phylogeographical structure and possibly the diversification of many taxa in this region. However, the results also illustrate the potential for more complex climatic history and historical changes in the geographical distribution of Atlantic Forest than envisioned by the refuge model. (c) 2012 The Linnean Society of London, Biological Journal of the Linnean Society, 2012, 105, 900824.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The transient and equilibrium properties of dynamics unfolding in complex systems can depend critically on specific topological features of the underlying interconnections. In this work, we investigate such a relationship with respect to the integrate-and-fire dynamics emanating from a source node and an extended network model that allows control of the small-world feature as well as the length of the long-range connections. A systematic approach to investigate the local and global correlations between structural and dynamical features of the networks was adopted that involved extensive simulations (one and a half million cases) so as to obtain two-dimensional correlation maps. Smooth, but diverse surfaces of correlation values were obtained in all cases. Regarding the global cases, it has been verified that the onset avalanche time (but not its intensity) can be accurately predicted from the structural features within specific regions of the map (i.e. networks with specific structural properties). The analysis at local level revealed that the dynamical features before the avalanches can also be accurately predicted from structural features. This is not possible for the dynamical features after the avalanches take place. This is so because the overall topology of the network predominates over the local topology around the source at the stationary state.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Field-Programmable Gate Arrays (FPGAs) are becoming increasingly important in embedded and high-performance computing systems. They allow performance levels close to the ones obtained with Application-Specific Integrated Circuits, while still keeping design and implementation flexibility. However, to efficiently program FPGAs, one needs the expertise of hardware developers in order to master hardware description languages (HDLs) such as VHDL or Verilog. Attempts to furnish a high-level compilation flow (e.g., from C programs) still have to address open issues before broader efficient results can be obtained. Bearing in mind an FPGA available resources, it has been developed LALP (Language for Aggressive Loop Pipelining), a novel language to program FPGA-based accelerators, and its compilation framework, including mapping capabilities. The main ideas behind LALP are to provide a higher abstraction level than HDLs, to exploit the intrinsic parallelism of hardware resources, and to allow the programmer to control execution stages whenever the compiler techniques are unable to generate efficient implementations. Those features are particularly useful to implement loop pipelining, a well regarded technique used to accelerate computations in several application domains. This paper describes LALP, and shows how it can be used to achieve high-performance computing solutions.