Crescimento alométrico dos componentes da carcaça de cordeiros Texel × Ile de France confinados do desmame aos 35kg de peso vivo

Foi avaliado o crescimento alométrico de ossos, músculos e gordura, e das regiões da carcaça de cordeiros Texel × Ile de France, terminados em confinamento. Vinte cordeiros, machos não-castrados, foram desmamados aos 42 dias de idade (15,9 ± 2,1kg de peso vivo) e confinados em baias individuais recebendo alimentação ad libitum. Destes, cinco foram abatidos 10 dias após o desmame e, os remanescentes, aos 25, 30 ou 35kg de peso vivo. Para determinação do crescimento alométrico dos cortes e tecidos foi utilizada a equação exponencial Y = aXb, transformada logaritmicamente em um modelo linear. Observou-se crescimento precoce (b = 0,89) da paleta, ao passo que a perna, a costela e o pescoço apresentaram crescimento isogônico (b = 1,00, 1,03 e 1,11, respectivamente), ou seja, equivalente ao da carcaça. O aumento do peso da carcaça implicou em redução da taxa de crescimento de ossos e músculos (b = 0,60 e 0,92, respectivamente) e aumento da taxa de crescimento da gordura (b = 1,78). O crescimento muscular foi diferenciado nas distintas regiões da carcaça, sendo isogônico na paleta (b = 0,98) e na perna (b = 0,99) e precoce na costela (b = 0,90) e no pescoço (b = 0,79). Recomenda-se que o abate de cordeiros Texel × Ile de France seja realizado com, no máximo, 30kg de peso vivo.

Características de produção e qualidade nutricional de genótipos de capim- colonião colhidos em três estádios de maturidade

Objetivou- se verificar a existência de variação genética entre cultivares de capim- colonião quanto ao efeito da maturidade sobre a composição química e a digestibilidade, e classificar os genótipos de acordo com características produtivas e de qualidade nutricional. Utilizou- se o delineamento de blocos ao acaso, com parcelas subdivididas e três repetições, considerando parcelas as datas de corte e subparcelas, os genótipos. A produção de MS diferiu entre os genótipos somente aos 90 dias de crescimento, mas a porcentagem de folhas, colmos e material morto variou tanto aos 60 como aos 90 dias de crescimento. Ao contrário do observado para as folhas, a composição química e a digestibilidade do colmo apresentou grande variabilidade entre os genótipos. O colmo apresentou concentrações mais elevadas de FDN, FDA e lignina e menores valores de PB em comparação às folhas. Apresentou ainda maior digestibilidade da MS aos 60 dias de crescimento e maior digestibilidade da FDN aos 30 e 60 dias de crescimento. No agrupamento dos cultivares, os genótipos PM39 e PM47 foram apontados como os mais promissores no programa de melhoramento, por apresentarem alta produtividade e alta qualidade nutricional. A maturidade pouco afeta a digestibilidade de folhas em comparação ao colmo. Quando a participação de colmo no total de massa seca aumenta, esse componente passa a ser o limitador da qualidade de plantas forrageiras. Portanto, programas de melhoramento devem considerar, além da relação folha:colmo, também a digestibilidade in vitro da FDN do colmo na seleção de genótipos.

Níveis de lisina digestível para frangos de corte machos no período de 37 a 49 dias de idade

Foram utilizados 1.015 frangos de corte machos, linhagem Ross, dos 37 aos 49 dias de idade, para avaliar os efeitos de diferentes níveis de lisina digestível nas dietas experimentais. O delineamento experimental foi inteiramente casualizado, com 5 níveis de lisina digestível (0,90; 0,95; 1,00; 1,05; 1,10%), cada um com 7 repetições e 29 aves por unidade experimental. Utilizaram-se dietas isoenergéticas com 3.250 de kcal de EM/kg e isoprotéicas, com 18% de PB, à base de milho e farelo de soja. Foram avaliados o ganho de peso, o consumo de ração, a conversão alimentar, as características de carcaça, o rendimento de cortes, a composição e a deposição de nutrientes corporais. Os níveis de lisina digestível influenciaram, entre as características de desempenho, apenas a conversão alimentar, que melhorou de forma linear de acordo com níveis de lisina da ração. Das características de carcaça e rendimento de cortes, apenas gordura abdominal aumentou de forma quadrática conforme os níveis de lisina. Os níveis de lisina digestível tiveram efeito quadrático no teor da matéria mineral da carcaça, mas não influenciaram a composição química das vísceras e do sangue. Observou-se, contudo, tendência a aumento linear na deposição de proteína da carcaça e do corpo vazio com o aumento no nível de lisina digestível. Os resultados de desempenho indicam que o nível de lisina digestível da ração de frangos de corte machos no período de 37 a 49 dias de idade deve ser igual ou superior a 1,10%.

Características de carcaça de ovelhas de descarte das raças Ideal e Texel terminadas em dois sistemas de alimentação

Avaliaram-se as características de carcaça de ovelhas de descarte das raças Ideal e Texel terminadas em dois sistemas de alimentação. Utilizaram-se 20 ovelhas (10 da raça Ideal e 10 da raça Texel) aleatoriamente distribuídas de acordo com o grupo genético em dois manejos alimentares (confinamento e pastagem cultivada). Os abates foram realizados quando os animais atingiram 3,5 pontos de condição corporal. Os pesos de carcaça quente (PCQ) e de carcaça fria (PCF) e os rendimentos de carcaça quente (RCQ) e de carcaça fria (RCF) das ovelhas Texel foram maiores que os das ovelhas Ideal: 27,85 e 19,04 kg; 27,08 e 18,43 kg; 47,25 e 45,20% e 45,95 e 43,72%, respectivamente. O peso dos cortes perna, paleta, pescoço e costela e os pesos de músculos, ossos e gordura da perna dos animais da raça Texel foram superiores aos obtidos na raça Ideal. Quando avaliadas em porcentagem do peso corporal, no entanto, essas características não diferiram entre as duas raças. O manejo alimentar não influenciou as características de carcaça de ovelhas de descarte. Ovelhas Texel apresentam cortes maiores que os de ovelhas Ideal.

The Brain as a Distributed Intelligent Processing System: An EEG Study

Background: Various neuroimaging studies, both structural and functional, have provided support for the proposal that a distributed brain network is likely to be the neural basis of intelligence. The theory of Distributed Intelligent Processing Systems (DIPS), first developed in the field of Artificial Intelligence, was proposed to adequately model distributed neural intelligent processing. In addition, the neural efficiency hypothesis suggests that individuals with higher intelligence display more focused cortical activation during cognitive performance, resulting in lower total brain activation when compared with individuals who have lower intelligence. This may be understood as a property of the DIPS. Methodology and Principal Findings: In our study, a new EEG brain mapping technique, based on the neural efficiency hypothesis and the notion of the brain as a Distributed Intelligence Processing System, was used to investigate the correlations between IQ evaluated with WAIS (Whechsler Adult Intelligence Scale) and WISC (Wechsler Intelligence Scale for Children), and the brain activity associated with visual and verbal processing, in order to test the validity of a distributed neural basis for intelligence. Conclusion: The present results support these claims and the neural efficiency hypothesis.

Complete Genome Sequence of Mycoplasma suis and Insights into Its Biology and Adaption to an Erythrocyte Niche

Mycoplasma suis, the causative agent of porcine infectious anemia, has never been cultured in vitro and mechanisms by which it causes disease are poorly understood. Thus, the objective herein was to use whole genome sequencing and analysis of M. suis to define pathogenicity mechanisms and biochemical pathways. M. suis was harvested from the blood of an experimentally infected pig. Following DNA extraction and construction of a paired end library, whole-genome sequencing was performed using GS-FLX (454) and Titanium chemistry. Reads on paired-end constructs were assembled using GS De Novo Assembler and gaps closed by primer walking; assembly was validated by PFGE. Glimmer and Manatee Annotation Engine were used to predict and annotate protein-coding sequences (CDS). The M. suis genome consists of a single, 742,431 bp chromosome with low G+C content of 31.1%. A total of 844 CDS, 3 single copies, unlinked rRNA genes and 32 tRNAs were identified. Gene homologies and GC skew graph show that M. suis has a typical Mollicutes oriC. The predicted metabolic pathway is concise, showing evidence of adaptation to blood environment. M. suis is a glycolytic species, obtaining energy through sugars fermentation and ATP-synthase. The pentose-phosphate pathway, metabolism of cofactors and vitamins, pyruvate dehydrogenase and NAD(+) kinase are missing. Thus, ribose, NADH, NADPH and coenzyme A are possibly essential for its growth. M. suis can generate purines from hypoxanthine, which is secreted by RBCs, and cytidine nucleotides from uracil. Toxins orthologs were not identified. We suggest that M. suis may cause disease by scavenging and competing for host nutrients, leading to decreased life-span of RBCs. In summary, genome analysis shows that M. suis is dependent on host cell metabolism and this characteristic is likely to be linked to its pathogenicity. The prediction of essential nutrients will aid the development of in vitro cultivation systems.

Numerical evidence against a conjecture on the cover time of planar graphs

We investigate a conjecture on the cover times of planar graphs by means of large Monte Carlo simulations. The conjecture states that the cover time tau (G(N)) of a planar graph G(N) of N vertices and maximal degree d is lower bounded by tau (G(N)) >= C(d)N(lnN)(2) with C(d) = (d/4 pi) tan(pi/d), with equality holding for some geometries. We tested this conjecture on the regular honeycomb (d = 3), regular square (d = 4), regular elongated triangular (d = 5), and regular triangular (d = 6) lattices, as well as on the nonregular Union Jack lattice (d(min) = 4, d(max) = 8). Indeed, the Monte Carlo data suggest that the rigorous lower bound may hold as an equality for most of these lattices, with an interesting issue in the case of the Union Jack lattice. The data for the honeycomb lattice, however, violate the bound with the conjectured constant. The empirical probability distribution function of the cover time for the square lattice is also briefly presented, since very little is known about cover time probability distribution functions in general.

Detection of exotic massive hadrons in ultrahigh energy cosmic ray telescopes

We investigate the detection of exotic massive strongly interacting hadrons (uhecrons) in ultrahigh energy cosmic ray telescopes. The conclusion is that experiments such as the Pierre Auger Observatory have the potential to detect these particles. It is shown that uhecron showers have clear distinctive features when compared to proton and nuclear showers. The simulation of uhecron air showers, and its detection and reconstruction by fluorescence telescopes, is described. We determine basic cuts in observables that will separate uhecrons from the cosmic ray bulk, assuming this is composed by protons. If these are composed by a heavier nucleus, the separation will be much improved. We also discuss photon induced showers. The complementarity between uhecron detection in accelerator experiments is discussed.

Connectivity and dynamics of neuronal networks as defined by the shape of individual neurons

Biological neuronal networks constitute a special class of dynamical systems, as they are formed by individual geometrical components, namely the neurons. In the existing literature, relatively little attention has been given to the influence of neuron shape on the overall connectivity and dynamics of the emerging networks. The current work addresses this issue by considering simplified neuronal shapes consisting of circular regions (soma/axons) with spokes (dendrites). Networks are grown by placing these patterns randomly in the two-dimensional (2D) plane and establishing connections whenever a piece of dendrite falls inside an axon. Several topological and dynamical properties of the resulting graph are measured, including the degree distribution, clustering coefficients, symmetry of connections, size of the largest connected component, as well as three hierarchical measurements of the local topology. By varying the number of processes of the individual basic patterns, we can quantify relationships between the individual neuronal shape and the topological and dynamical features of the networks. Integrate-and-fire dynamics on these networks is also investigated with respect to transient activation from a source node, indicating that long-range connections play an important role in the propagation of avalanches.

Directed Abelian algebras and their application to stochastic models

With each directed acyclic graph (this includes some D-dimensional lattices) one can associate some Abelian algebras that we call directed Abelian algebras (DAAs). On each site of the graph one attaches a generator of the algebra. These algebras depend on several parameters and are semisimple. Using any DAA, one can define a family of Hamiltonians which give the continuous time evolution of a stochastic process. The calculation of the spectra and ground-state wave functions (stationary state probability distributions) is an easy algebraic exercise. If one considers D-dimensional lattices and chooses Hamiltonians linear in the generators, in finite-size scaling the Hamiltonian spectrum is gapless with a critical dynamic exponent z=D. One possible application of the DAA is to sandpile models. In the paper we present this application, considering one- and two-dimensional lattices. In the one-dimensional case, when the DAA conserves the number of particles, the avalanches belong to the random walker universality class (critical exponent sigma(tau)=3/2). We study the local density of particles inside large avalanches, showing a depletion of particles at the source of the avalanche and an enrichment at its end. In two dimensions we did extensive Monte-Carlo simulations and found sigma(tau)=1.780 +/- 0.005.

4-{2-[4-(Dimethylamino)phenyl]ethylidene}benzonitrile

In the crystal of the title compound, C(17)H(16)N(2), molecules are linked by C-H center dot center dot center dot N hydrogen bonds, forming rings of graph-set motifs R(2)(1) (6) and R(2)(2) (10). The title molecule is close to planar, with a dihedral angle between the aromatic rings of 0.6 (1)degrees. Torsion angles confirm a conformational trans structure.

N-(4-chlorophenyl)maleimide

In the title compound, C10H6ClNO2, the dihedral angle between the benzene and maleimide rings is 47.54 (9)degrees. Molecules form centrosymmetric dimers through C-H center dot center dot center dot O hydrogen bonds, resulting in rings of graph- set motif R2 2(8) and chains in the [100] direction. Molecules are also linked by C-H center dot center dot center dot Cl hydrogen bonds along [001]. In this same direction, molecules are connected to other neighbouring molecules by C-H center dot center dot center dot O hydrogen bonds, forming edge- fused R-4(4)(24) rings.

On the k-restricted structure ratio in planar and outerplanar graphs

A planar k-restricted structure is a simple graph whose blocks are planar and each has at most k vertices. Planar k-restricted structures are used by approximation algorithms for Maximum Weight Planar Subgraph, which motivates this work. The planar k-restricted ratio is the infimum, over simple planar graphs H, of the ratio of the number of edges in a maximum k-restricted structure subgraph of H to the number edges of H. We prove that, as k tends to infinity, the planar k-restricted ratio tends to 1/2. The same result holds for the weighted version. Our results are based on analyzing the analogous ratios for outerplanar and weighted outerplanar graphs. Here both ratios tend to 1 as k goes to infinity, and we provide good estimates of the rates of convergence, showing that they differ in the weighted from the unweighted case.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.