High-speed polynomial basis multipliers over GF(2(m)) for special pentanomial.

Efficient hardware implementations of arithmetic operations in the Galois field are highly desirable for several applications, such as coding theory, computer algebra and cryptography. Among these operations, multiplication is of special interest because it is considered the most important building block. Therefore, high-speed algorithms and hardware architectures for computing multiplication are highly required. In this paper, bit-parallel polynomial basis multipliers over the binary field GF(2(m)) generated using type II irreducible pentanomials are considered. The multiplier here presented has the lowest time complexity known to date for similar multipliers based on this type of irreducible pentanomials.

Diui Thome Aquinatis ... Scriptu[m] 2m [i.e.secundum] luculentissimum angelico concinnatum ingenio ad summam sacre fidei tutelam artificibus expressum typis precipuis annotammentis insignitum omnique mendo repurgatum inserto textu magri adiectisque regestis tabularibus

Mode of access: Internet.

Direct support, general support and depot maintenance manual, including repair parts and special tools lists for engine, with container, turbosupercharged, diesel, fuel injection, 90-degree "V" type, air cooled, 12-cylinder, assembly; models AVDS-1790-2M (2815-856-4996), AVDS-1790-2A and AVDS-1790-2AM (2815-856-9005).

Includes indexes.

Large-scale molecular dynamics simulations of HLA-A*0201 complexed with a tumor-specific antigenic peptide:can the α3 and β2m domains be neglected?

Large-scale massively parallel molecular dynamics (MD) simulations of the human class I major histo-compatibility complex (MHC) protein HLA-A*0201 bound to a decameric tumor-specific antigenic peptide GVY-DGREHTV were performed using a scalable MD code on high-performance computing platforms. Such computational capabilities put us in reach of simulations of various scales and complexities. The supercomputing resources available Large-scale massively parallel molecular dynamics (MD) simulations of the human class I major histocompatibility complex (MHC) protein HLA-A*0201 bound to a decameric tumor-specific antigenic peptide GVYDGREHTV were performed using a scalable MD code on high-performance computing platforms. Such computational capabilities put us in reach of simulations of various scales and complexities. The supercomputing resources available for this study allow us to compare directly differences in the behavior of very large molecular models; in this case, the entire extracellular portion of the peptide–MHC complex vs. the isolated peptide binding domain. Comparison of the results from the partial and the whole system simulations indicates that the peptide is less tightly bound in the partial system than in the whole system. From a detailed study of conformations, solvent-accessible surface area, the nature of the water network structure, and the binding energies, we conclude that, when considering the conformation of the α1–α2 domain, the α3 and β2m domains cannot be neglected. © 2004 Wiley Periodicals, Inc. J Comput Chem 25: 1803–1813, 2004

Some MDS Codes over Gf(64) Connected with the Binary Doubly-Even [72,36,16] Code

* The author is supported by a Return Fellowship from the Alexander von Humboldt Foundation.

Some new Results for Additive Self-Dual Codes over GF(4)

* Supported by COMBSTRU Research Training Network HPRN-CT-2002-00278 and the Bulgarian National Science Foundation under Grant MM-1304/03.

Efficient Computing of some Vector Operations over GF(3) and GF(4)

The problem of efficient computing of the affine vector operations (addition of two vectors and multiplication of a vector by a scalar over GF (q)), and also the weight of a given vector, is important for many problems in coding theory, cryptography, VLSI technology etc. In this paper we propose a new way of representing vectors over GF (3) and GF (4) and we describe an efficient performance of these affine operations. Computing weights of binary vectors is also discussed.

Determinação de CD, PB, e TL em água produzida por HR-CS GF AAS após extração em ponto nuvem

Produced water is a major problem associated with the crude oil extraction activity. The monitoring of the levels of metals in the waste is constant and requires the use of sensitive analytical techniques. However, the determination of trace elements can often require a pre-concentration step. The objective of this study was to develop a simple and rapid analytical method for the extraction and pre-concentration based on extraction phenomenon cloud point for the determination of Cd, Pb and Tl in produced water samples by spectrometry of high resolution Absorption source continues and atomization graphite furnace. The Box Behnken design was used to obtain the optimal condition of extraction of analytes. The factors were evaluated: concentration of complexing agent (o,o-dietilditilfosfato ammonium, DDTP), the concentration of hydrochloric acid and concentration of surfactant (Triton X -114). The optimal condition obtained through extraction was: 0,6% m v-1 DDTP, HCl 0,3 mol L-1 and 0,2% m v-1 of Triton X - 114 for Pb; 0,7% m v-1 DDTP, HCl 0,8 mol L-1 and 0,2% m v-1 Triton X-114 for Cd. For Tl was evidenced that best extraction condition occurs with no DDTP, the extraction conditions were HCl 1,0 mol L-1 e 1,0% m v-1 de Triton X - 114. The limits of detection for the proposed method were 0,005 µg L-1 , 0,03 µg L-1 and 0,09 µg L-1 to Cd, Pb and Tl, Respectively. Enrichment factors Were greater than 10 times. The method was applied to the water produced in the Potiguar basin, and addition and recovery tests were performed, and values were between 81% and 120%. The precision was expressed with relative standard deviation (RSD) is less than 5%