46 resultados para Word Classes
Resumo:
Bit level systolic array structures for computing sums of products are studied in detail. It is shown that these can be sub-divided into two classes and that, within each class, architectures can be described in terms of a set of constraint equations. It is further demonstrated that high performance system level functions with attractive VLSI properties can be constructed by matching data flow geometries in bit level and word level architectures.
Resumo:
The skin secretion of the North American pickerel frog (Rana palustris) has long been known to have pronounced noxious/toxic properties and to be highly effective in defence against predators and against other sympatric amphibians. As it consists largely of a complex mixture of peptides, it has been subjected to systematic peptidomic study but there has been little focus on molecular cloning of peptide-encoding cDNAs and by deduction, the biosynthetic precursors that they encode. Here, we demonstrate that the cDNAs encoding the five major structural families of antimicrobial peptides can be elucidated by a single step “shotgun” cloning approach using a cDNA library constructed from the source material of the peptidomic studies—the defensive skin secretion itself. Using a degenerate primer pool designed to a highly conserved nucleic acid sequence 5' to the initiation codon of known antimicrobial peptide precursor transcripts, we amplified cDNA sequences representing five major classes of antimicrobial peptides, such as esculentins, brevinins, ranatuerins, palustrins and temporins. Bioinformatic comparisons of precursor open-reading frames and nucleic acid sequences revealed high degrees of structural similarities between analogous peptides of R. palustris and the Chinese bamboo odorous frog, Rana versabilis. This approach thus constitutes a robust technique that can be used either alone or ideally, in parallel with peptidomic analysis of skin secretion, to rapidly extract primary structural information on amphibian skin secretion peptides and their biosynthetic precursors.
Resumo:
The speedup provided by quantum algorithms with respect to their classical counterparts is at the origin of scientific interest in quantum computation. However, the fundamental reasons for such a speedup are not yet completely understood and deserve further attention. In this context, the classical simulation of quantum algorithms is a useful tool that can help us in gaining insight. Starting from the study of general conditions for classical simulation, we highlight several important differences between two nonequivalent classes of quantum algorithms. We investigate their performance under realistic conditions by quantitatively studying their resilience with respect to static noise. This latter refers to errors affecting the initial preparation of the register used to run an algorithm. We also compare the evolution of the entanglement involved in the different computational processes.