Molecular dynamics calculation of mean square displacement in alkali metals and rare gas solids and comparison with lattice dynamics

Molec ul ar dynamics calculations of the mean sq ua re displacement have been carried out for the alkali metals Na, K and Cs and for an fcc nearest neighbour Lennard-Jones model applicable to rare gas solids. The computations for the alkalis were done for several temperatures for temperature vol ume a swell as for the the ze r 0 pressure ze ro zero pressure volume corresponding to each temperature. In the fcc case, results were obtained for a wide range of both the temperature and density. Lattice dynamics calculations of the harmonic and the lowe s t order anharmonic (cubic and quartic) contributions to the mean square displacement were performed for the same potential models as in the molecular dynamics calculations. The Brillouin zone sums arising in the harmonic and the quartic terms were computed for very large numbers of points in q-space, and were extrapolated to obtain results ful converged with respect to the number of points in the Brillouin zone.An excellent agreement between the lattice dynamics results was observed molecular dynamics and in the case of all the alkali metals, e~ept for the zero pressure case of CSt where the difference is about 15 % near the melting temperature. It was concluded that for the alkalis, the lowest order perturbation theory works well even at temperat ures close to the melting temperat ure. For the fcc nearest neighbour model it was found that the number of particles (256) used for the molecular dynamics calculations, produces a result which is somewhere between 10 and 20 % smaller than the value converged with respect to the number of particles. However, the general temperature dependence of the mean square displacement is the same in molecular dynamics and lattice dynamics for all temperatures at the highest densities examined, while at higher volumes and high temperatures the results diverge. This indicates the importance of the higher order (eg. ~* ) perturbation theory contributions in these cases.

A29 NMR spin-lattice relaxation study of paramagnetics -doped orthosilictes

A ~si MAS NMR study of spin-lattice relaxation behaviour in paramagnetic-doped crystalline silicates was undertaken, using synthetic magnesium orthosilicate (forsterite) and synthetic zinc orthosilicate (willemite) doped with 0.1% to 20% of Co(II), Ni(II), or CU(II), as experimental systems. All of the samples studied exhibited a longitudinal magnetization return to the Boltzmann distribution of nuclear spin states which followed a stretched-exponential function of time: Y=exp [- (tjTn) n], Olattice relaxation time and paramagnetic dopant ion concentration, with Tni[M2+]i=Tnj[M2+]j for a given dopant and mineral. There are many cases where this correlation is not apparent, however, and this is attributed to the structural, phase, and ion distribution complexities inherent in many of these systems.

Bounds on edit metric codes with combinatorial DNA constraints

The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial constraints with respect to biological and chemical restrictions of DNA strands. The primary constraints that we consider are the reverse--complement constraint and the fixed GC--content constraint, as well as the basic edit distance constraint between codewords. We focus on exploring the theory underlying DNA codes and discuss several approaches to searching for optimal DNA codes. We use Conway's lexicode algorithm and an exhaustive search algorithm to produce provably optimal DNA codes for codes with small parameter values. And a genetic algorithm is proposed to search for some sub--optimal DNA codes with relatively large parameter values, where we can consider their sizes as reasonable lower bounds of DNA codes. Furthermore, we provide tables of bounds on sizes of DNA codes with length from 1 to 9 and minimum distance from 1 to 9.

Tintype of Girl Peering through Lattice [n.d.]

A young African American girl peers through a lattice window in an unknown photographer's studio in this small black and white tintype. The girl in the photo is unidentified. There are slight scratches on the surface of the tintype, which is cut in a hexagonal shape. This tintype was in the possession of Iris Sloman Bell, of St. Catharines, Ontario. The Sloman - Bell families have relatives who are descended from Black slaves from the United States."Tintypes were the invention of Prof. Hamilton Smith of Ohio. They begin as thin sheets of iron, covered with a layer of black paint. This serves as the base for the same iodized collodion coating and silver nitrate bath used in the ambrotype process. First made in 1856, millions were produced well into the twentieth century. When tintypes were finished in the same sorts of mats and cases used for ambrotypes, it can be almost impossible to distinguish which process was used without removing the image to examine the substrate." Source: American Museum of Photography http://www.photographymuseum.com/primer.html

Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes

Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest possible minimum distance for a given length and dimension. The existence of an extremal (72,36,16) Type II code is still open. Previous results show that the automorphism group of a putative code C with the aforementioned properties has order 5 or dividing 24. In this work, we present a method and the results of an exhaustive search showing that such a code C cannot admit an automorphism group Z6. In addition, we present so far unpublished construction of the extended Golay code by P. Becker. We generalize the notion and provide example of another Type II code that can be obtained in this fashion. Consequently, we relate Becker's construction to the construction of binary Type II codes from codes over GF(2^r) via the Gray map.

Construction of I-Deletion-Correcting Ternary Codes

Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and Levenshtein showed the Varshamov-Tenengolts codes are perfect binary one-deletion correcting codes in 1992. Tenegolts constructed T codes to handle the non-binary cases. However the T codes are neither optimal nor perfect, which means some progress can be established. Latterly, Bours showed that perfect deletion-correcting codes have a close relationship with design theory. By this approach, Wang and Yin constructed perfect 5-deletion correcting codes of length 7 for large alphabet size. For our research, we focus on how to extend or combinatorially construct large codes with longer length, few deletions and small but non-binary alphabet especially ternary. After a brief study, we discovered some properties of T codes and produced some large codes by 3 different ways of extending some existing good codes.

Lecons de droit criminel: contenant l'explication compléte des codes pénal et d'instruction criminelle

UANL

RDA et RCAA2 : un survol des différences entre les deux codes

Communication présentée au Premier Congrès des milieux documentaires du Québec le 12 novembre 2009, Palais des congrès de Montréal. Comprend une annexe comportant un exemple d'élément RDA, des exemples de notices RCAA2 et RDA en MARC 21 ainsi qu'une bibliographie.

Codes de conduite et droit d'association : une étude exploratoire du secteur du textile

Avec la globalisation de l’économie, l’entreprise traditionnelle est devenue un réseau global de producteurs liés par des contrats. À la suite de certains abus commis par les entreprises multinationales, notamment en ce qui concerne les droits fondamentaux des travailleurs, les entreprises et la société civile ont développé des mécanismes de régulation privés dont les codes de conduite privés. La présente étude cherche à déterminer quels pouvaient être les véritables destinataires des codes de conduite : les travailleurs du pays d’origine de l’entreprise (généralement situés dans un pays développé) ou les travailleurs des pays de production (généralement situés dans des pays en développement). À cette fin, le mémoire compare le contenu des codes de conduite de Nike, de Gap et de Levi-Strauss sur ce sujet avec les observations de l’Organisation internationale du travail pour les travailleurs des États-Unis, de l’Inde et du Bangladesh. Certains écarts entre les protections accordées par les codes et les besoins des travailleurs sont ainsi identifiés. Dans la dernière partie du mémoire, la question d’étude est élargie afin d’examiner si les codes ne seraient pas destinés à des personnes autres que les travailleurs, soient les consommateurs, les actionnaires ou l’entreprise elle-même.