An optimized pseudorandom generator using packed matrices

Most cryptographic services and information security protocols require a dependable source of random data; pseudorandom generators are convenient and efficient for this application working as one of the basic foundation blocks on which to build the required security infrastructure. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security by using word packed matrices and modifying key scheduling and bit extraction schemes. The resulting generator is then successfully compared to world class standards.

Análisis de las relaciones morfología-propiedades en nanocompuestos basados en matrices de copolímeros de bloque

El objetivo principal de la presente investigación ha sido desarrollar una nueva clase de materiales nanocompuestos orgánicos-inorgánicos basados en la capacidad de los copolímeros de bloque de auto-organizarse promoviendo la dispersión de nanopartículas, así como relacionar las diferentes morfologías obtenidas con las propiedades finales de los nanocompuestos. Para generar la nanoestructuración de estos nanocompuestos basados en copolímeros de bloque, como el poli(estireno-b-isopreno-b-estireno) (SIS) y el poli(estireno-b-butadieno-b-estireno) (SBS) en nanopartículas de plata, se han utilizado los conceptos de compatibilización y confinamiento. Es decir, las nanopartículas inorgánicas se confinaron en una sola fase del copolímero de bloque mediante tratamientos superficiales y su funcionalización física. En particular, se utilizaron surfactantes (el cloruro de tetrametilamonio, TMAC, y el dodecanotiol, DT) para favorecer la interacción entre las nanopartículas inorgánicas y la matriz polimérica. Teniendo en cuenta los cálculos teóricos de los parámetros de solubilidad obtenidos mediante la teoría de Hoftizer-Van Krevelen, y la electronegatividad propia de los diferentes elementos, los dos surfactantes elegidos tienen una muy buena compatibilidad con el bloque de estireno favoreciendo la localización de las nanopartículas de plata en este bloque.

Comparison of methods for the determination of total available residual chlorine in various sample matrices /

Bibliography: p. 28-29.

Vente de matrices d'imprimerie

Detached from France. Comité des travaux historiques et scientifiques. Section d'archéologie. Bulletin archéologique. 1889.

A parallel QR-algorithm for tridiagonal symmetric matrices /

"NSF-OCA-GJ-36936-000008."

Test matrices I,

"Supported in part by the Atomic Energy Commission under Grant U.S. AEC AT(11-1)1469."

On the roots of matrices.

Reprinted from the American journal of mathematics, v.14.

Muestras de los nuevos punzones y matrices para la letra de imprenta executados por orden de S.M. y de su caudal destinado a la dotacion de su Real Biblioteca.

Palau,

Theory of matrices.

Mode of access: Internet.

Thermal characterization of polyester-melamine coating matrices prepared under nonisothermal conditions

Thermal analysis methods (differential scanning calorimetry, thermogravimetric analysis, and dynamic mechanical thermal analysis) were used to characterize the nature of polyester-melamine coating matrices prepared under nonisothermal, high-temperature, rapid-cure conditions. The results were interpreted in terms of the formation of two interpenetrating networks with different glass-transition temperatures (a cocondensed polyester-melamine network and a self-condensed melamine-melamine network), a phenomenon not generally seen in chemically similar, isothermally cured matrices. The self-condensed network manifested at high melamine levels, but the relative concentrations of the two networks were critically dependent on the cure conditions. The optimal cure (defined in terms of the attainment of a peak metal temperature) was achieved at different oven temperatures and different oven dwell times, and so the actual energy absorbed varied over a wide range. Careful control of the energy absorption, by the selection of appropriate cure conditions, controlled the relative concentrations of the two networks and, therefore, the flexibility and hardness of the resultant coatings. (C) 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Cbem 41: 1603-1621, 2003.

Wurst: a protein threading server with a structural scoring function, sequence profiles and optimized substitution matrices

Wurst is a protein threading program with an emphasis on high quality sequence to structure alignments (http://www.zbh.uni-hamburg.de/wurst). Submitted sequences are aligned to each of about 3000 templates with a conventional dynamic programming algorithm, but using a score function with sophisticated structure and sequence terms. The structure terms are a log-odds probability of sequence to structure fragment compatibility, obtained from a Bayesian classification procedure. A simplex optimization was used to optimize the sequence-based terms for the goal of alignment and model quality and to balance the sequence and structural contributions against each other. Both sequence and structural terms operate with sequence profiles.

QRT: A Qr-based tridiagonalization algorithm for nonsymmetric matrices

The stable similarity reduction of a nonsymmetric square matrix to tridiagonal form has been a long-standing problem in numerical linear algebra. The biorthogonal Lanczos process is in principle a candidate method for this task, but in practice it is confined to sparse matrices and is restarted periodically because roundoff errors affect its three-term recurrence scheme and degrade the biorthogonality after a few steps. This adds to its vulnerability to serious breakdowns or near-breakdowns, the handling of which involves recovery strategies such as the look-ahead technique, which needs a careful implementation to produce a block-tridiagonal form with unpredictable block sizes. Other candidate methods, geared generally towards full matrices, rely on elementary similarity transformations that are prone to numerical instabilities. Such concomitant difficulties have hampered finding a satisfactory solution to the problem for either sparse or full matrices. This study focuses primarily on full matrices. After outlining earlier tridiagonalization algorithms from within a general framework, we present a new elimination technique combining orthogonal similarity transformations that are stable. We also discuss heuristics to circumvent breakdowns. Applications of this study include eigenvalue calculation and the approximation of matrix functions.

A study of the effects of postcure treatments on polyester-melamine coating matrices

The effect of postcure high energy (gamma), ultraviolet (UV) and thermal treatment on the properties of polyester-melamine clearcoats of a range of compositions has been investigated. Two initial cure conditions were used, of which one was '' optimally '' cured and the other undercured. It was found that postcure treatments, particularly gamma and UV, led to coatings of similar mechanical and thermal properties irrespective of initial cure, although the change in properties on postcure treatment was greater for the under-cured samples. The results were interpreted in terms of the effect of the treatments on the structure of the crosslinked matrices. The study suggests the possibility of the development of a dual-cure process for polyester-melamines, whereby cure optimization and property improvement can be achieved. This could also be used to '' correct '' for small variations in thermal cure levels brought about by adventitious online fluctuations in cure oven conditions.