5 resultados para Minimum Description Length

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

90.00% 90.00%

Publicador:

Resumo:

We assess the effect of the choice of spanwise periodic length on simulations of the flow around a fixed circular cylinder. The Reynolds number is set to 400 because, at this value, both lift coefficient and shedding frequency show significant drop due to three-dimensional flow structures. From the analysis of the three-dimensionalities of the wake and of the integral quantities such as Strouhal number, RMS of lift coefficient and energy contained in the three-dimensional portion of the flow we obtain an estimate of the minimum spanwise length to satisfactorily represent the flow. Furthermore, we observe a distinct wake behavior when the spanwise length is approximately the mode B instability wavelength. (C) 2011 Elsevier Ltd. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Morphological descriptions of the 4 instars of the ghost-ant Tapinoma melanocephalum Fabricius are presented along with illustrations and comparisons with other species of the same genus. Instars were similar, differing only in body length. The analyzed larvae presented many characteristics in common with other Tapinoma Forster larvae, such as: dolichoderoid body and mandibles, 9 pairs of spiracles, the presence of a terminal boss, and scarce body and head setae, all simple and short. We observed the following differences from other previous descriptions: the presence of a subapical mandibular tooth, setaceous sensilla on the medial anterior surface of the labrum, and fewer sensilla on maxillary and labial palps.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

A correlated many-body basis function is used to describe the (4)He trimer and small helium clusters ((4)HeN) with N = 4-9. A realistic helium dimer potential is adopted. The ground state results of the (4)He dimer and trimer are in close agreement with earlier findings. But no evidence is found for the existence of Efimov state in the trimer for the actual (4)He-(4)He interaction. However, decreasing the potential strength we calculate several excited states of the trimer which exhibit Efimov character. We also solve for excited state energies of these clusters which are in good agreement with Monte Carlo hyperspherical description. (C) 2011 American Institute of Physics. [doi:10.1063/1.3583365]

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Trypanosoma rangeli infects several mammalian orders but has never confidently been described in Chiroptera, which are commonly parasitized by many trypanosome species. Here, we described trypanosomes from bats captured in Central Brazil identified as T rangeli,.T. dionisii, T cruzimarinkellei and T cruzi. Two isolates, Tra643 from Platyrrhinus lineatus and Tra1719 from Artibeus plamirostris were identified as T rangeli by morphological, biological and molecular methods, and confirmed by phylogenetic analyses. Analysis using SSU rDNA sequences clustered these bat trypanosomes together with T rangeli from other hosts, and separated them from other trypanosomes from bats. Genotyping based on length and sequence polymorphism of PCR-amplified intergenic spliced-leader gene sequences assigned Tra1719 to the lineage A whereas Tra643 was shown to be a new genotype and was assigned to the new lineage E. To our knowledge, these two isolates are the earliest T rangeli from bats and the first isolates from Central Brazil molecularly characterized. Rhodnius stali captured for this study was found infected by T rangeli and T cruzi. (c) 2008 Elsevier B.V. All rights reserved.

Relevância:

30.00% 30.00%

Publicador:

Resumo:

Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The weight of C is Sigma(k)(i=1) vertical bar C(i)vertical bar. The minimum cycle cover problem is the following: given a strongly connected mixed graph M without bridges, find a cycle cover of M with weight as small as possible. The Chinese postman problem is: given a strongly connected mixed graph M, find a minimum length closed walk using all edges and arcs of M. These problems are NP-hard. We show that they can be solved in polynomial time if M has bounded tree-width. (C) 2008 Elsevier B.V. All rights reserved.