2 resultados para Cycle length

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


Relevância:

60.00% 60.00%

Publicador:

Resumo:

Parity rate, gonotrophic cycle length, and density of a Culex quinquefasciatus female population was estimated at the Parque Ecologico do Tiete (PET), Sao Paulo, Brazil. Adult Cx. quinquefasciatus females were collected from vegetation along the edges of a polluted drainage canal with the use of a battery-powered backpack aspirator from September to November 2005 and from February to April 2006. We examined 255 Cx. quinquefasciatus ovaries to establish the parity rate of 0.22 and determined the gonotrophic cycle length under laboratory conditions to be 3 and 4 days. From these data, we calculated the Cx. quinquefasciatus survival rate to be 0.60 and 0.68 per day. Density of the Cx. quinquefasciatus female (5.71 females per m(2)) was estimated based on a population size of 28,810 individuals divided by the sampled area of 5,040 m(2). Results of all experiments indicate medium survivorship and high density of the Cx. quinquefasciatus female population. This species is epidemiologically relevant in the PET area and should be a target of the vector control program of Sao Paulo municipality.

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.