879 resultados para Reflective Logic
Resumo:
The present study aimed to determine whether Cryptosporidium oocysts were present in stools from captive snakes at Fundacao Parque Zoo logic (Zoological Park Foundation) in Sno Paulo, Brazil. Two collections were performed; the first in July 2008 and the second in February 2009. Fecal samples were collected from 74 enclosures that housed 101 individuals of 23 snake species. The stool specimens collected from 16 out of the 74 enclosures (21.6%) contained Cryptosporidium spp. oocysts; all of them were confirmed as Cryptosporidium serpent is, using molecular techniques. Only in three (18.7%) out of the 16 enclosures with positive samples were there animals with clinical signs compatible with infection by C. serpentis, such as regurgitation and significant progressive weight loss. From the results, it was concluded that diagnostic examinations need to be performed periodically, even on clinically healthy animals, as a preventive measure.
Resumo:
An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.
Resumo:
A 4-wheel is a simple graph on 5 vertices with 8 edges, formed by taking a 4-cycle and joining a fifth vertex (the centre of the 4-wheel) to each of the other four vertices. A lambda -fold 4-wheel system of order n is an edge-disjoint decomposition of the complete multigraph lambdaK(n) into 4-wheels. Here, with five isolated possible exceptions when lambda = 2, we give necessary and sufficient conditions for a lambda -fold 4-wheel system of order n to be transformed into a lambda -fold Ccyde system of order n by removing the centre vertex from each 4-wheel, and its four adjacent edges (retaining the 4-cycle wheel rim), and reassembling these edges adjacent to wheel centres into 4-cycles.
Resumo:
Let Sk denote the complete bipartite graph K-1k and let e,, denote the ii-cube. We prove that the obvious necessary conditions for the existence of an S-k-decomposition of Q(n) are sufficient.
Resumo:
A new completely integrable model of strongly correlated electrons is proposed which describes two competitive interactions: one is the correlated one-particle hopping, the other is the Hubbard-like interaction. The integrability follows from the fact that the Hamiltonian is derivable from a one-parameter family of commuting transfer matrices. The Bethe ansatz equations are derived by algebraic Bethe ansatz method.