Experimental evidence of accelerated energy transfer in turbulence

We investigate the vorticity dynamics in a turbulent vortex using scattering of acoustic waves. Two ultrasonic beams are adjusted to probe simultaneously two spatial scales in a given volume of the flow, thus allowing a dual channel recording of the dynamics of coherent vorticity structures. Our results show that this allows to measure the average energy transfer time between different spatial length scales, and that such transfer goes faster at smaller scales.Comment: 5 pages, 5 figure

Automating Security Analysis: Symbolic Equivalence of Constraint Systems

We consider security properties of cryptographic protocols, that are either trace properties (such as confidentiality or authenticity) or equivalence properties (such as anonymity or strong secrecy). Infinite sets of possible traces are symbolically represented using deducibility constraints. We give a new algorithm that decides the trace equivalence for the traces that are represented using such constraints, in the case of signatures, symmetric and asymmetric encryptions. Our algorithm is implemented and performs well on typical benchmarks. This is the first implemented algorithm, deciding symbolic trace equivalence

Incorporação das propriedades rotâmeros e ocupância em métodos de análise estrutural de proteínas.

Conformação das cadeias laterais (rotâmeros); Dupla ocupância; Java Protein Dossier.bitstream/CNPTIA/9893/1/comuntec34.pdfAcesso em: 30 maio 2008

Curvatura da superfície de proteínas no Java Protein Dossier.

Definição de superfície. Cálculo dos valores de curvatura com SurfRace.bitstream/CNPTIA/9897/1/comuntec38.pdfAcesso em: 30 maio 2008

Cophylogeny reconstruction via an approximate bayesian computation

Despite an increasingly vast literature on cophylogenetic reconstructions for studying host-parasite associations, understanding the common evolutionary history of such systems remains a problem that is far from being solved. Most algorithms for host-parasite reconciliation use an event-based model, where the events include in general (a subset of) cospeciation, duplication, loss, and host switch. All known parsimonious event-based methods then assign a cost to each type of event in order to find a reconstruction of minimum cost. The main problem with this approach is that the cost of the events strongly influences the reconciliation obtained. Some earlier approaches attempt to avoid this problem by finding a Pareto set of solutions and hence by considering event costs under some minimization constraints. To deal with this problem, we developed an algorithm, called Coala, for estimating the frequency of the events based on an approximate Bayesian computation approach. The benefits of this method are 2-fold: (i) it provides more confidence in the set of costs to be used in a reconciliation, and (ii) it allows estimation of the frequency of the events in cases where the data set consists of trees with a large number of taxa. We evaluate our method on simulated and on biological data sets. We show that in both cases, for the same pair of host and parasite trees, different sets of frequencies for the events lead to equally probable solutions. Moreover, often these solutions differ greatly in terms of the number of inferred events. It appears crucial to take this into account before attempting any further biological interpretation of such reconciliations. More generally, we also show that the set of frequencies can vary widely depending on the input host and parasite trees. Indiscriminately applying a standard vector of costs may thus not be a good strategy

Cassis: detection of genomic rearrangement breakpoints

Summary: Genomes undergo large structural changes that alter their organization. The chromosomal regions affected by these rearrangements are called breakpoints, while those which have not been rearranged are called synteny blocks. Lemaitre et al. presented a new method to precisely delimit rearrangement breakpoints in a genome by comparison with the genome of a related species. Receiving as input a list of one2one orthologous genes found in the genomes of two species, the method builds a set of reliable and non-overlapping synteny blocks and refines the regions that are not contained into them. Through the alignment of each breakpoint sequence against its specific orthologous sequences in the other species, we can look for weak similarities inside the breakpoint, thus extending the synteny blocks and narrowing the breakpoints. The identification of the narrowed breakpoints relies on a segmentation algorithm and is statistically assessed. Here, we present the package Cassis that implements this method of precise detection of genomic rearrangement breakpoints

Apresentação gráfica de parâmetros protéicos utilizando o Java Protein Dossier.

Parâmetros apresentados pelo JPD. Sequência de resíduos. Contatos. Contatos internos. Contatos na interface. Estrutura secundária. Dupla ocupância. Fator de temperatura. Entropia relativa. Confiabilidade. Acessibilidade de resíduos. Ângulos de torsão. Potencial eletrostático. Curvatura na superfície. Hidrofobicidade. Analisando com maior detalhes os parâmetros apresentados.bitstream/CNPTIA/9899/1/comuntec40.pdfAcesso em: 30 maio 2008

Análise do grau de conservação de resíduos em proteínas com estrutura 3D resolvida utilizando o SMS.

HSSP e entropia relativa. Módulos do SMS para análise de conservação. Discussão e trabalhos futuros.bitstream/CNPTIA/9896/1/comuntec37.pdfAcesso em: 30 maio 2008