An experimental investigation of dechanneling in copper single crystals

This investigation comprises a comparison of experimental and theoretical dechanneling of MeV protons in copper single crystals. Dechanneling results when an ion's transverse energy increases to the value where the ion can undergo small impact parameter collisions with individual atoms. Depth dependent dechanneling rates were determined as functions of lattice temperature, ion beam energy and crystal axis orientation. Ion beam energies were IMeV and 2MeV,temperatures ranged from 35 K to 280 K and the experiment was carried out along both the (lOa) and <110) axes. Experimental data took the form of aligned and random Rutherford backscattered energy spectra. Dechanneling rates were extracted from these spectra using a single scattering theory that took explicit account of the different stopping powers experienced by channeled and dechanneled ions and also included a correction factor to take into account multiple scattering effects along the ion's trajectory. The assumption of statistical equilibrium and small angle scattering of the channeled ions allows a description of dechanneling in terms of the solution of a diffusion like equation which contains a so called diffusion function. The diffusion function is shown to be related to the increase in average transverse energy. Theoretical treatments of increase in average transverse energy due to collisions of projectiles with channel electrons and thermal perturbations in the lattice potential are reviewed. Using the diffusion equation and the electron density in the channel centre as a fitting parameter dechanneling rates are extracted. Excellent agreement between theory and experiment has been demonstrated. Electron densities determined in the fitting procedure appear to be realistic. The surface parameters show themselves to be good indicators of the quality of the crystal.

A Study of Ordered Gene Problems Featuring DNA Error Correction and DNA Fragment Assembly with a Variety of Heuristics, Genetic Algorithm Variations, and Dynamic Representations

Ordered gene problems are a very common classification of optimization problems. Because of their popularity countless algorithms have been developed in an attempt to find high quality solutions to the problems. It is also common to see many different types of problems reduced to ordered gene style problems as there are many popular heuristics and metaheuristics for them due to their popularity. Multiple ordered gene problems are studied, namely, the travelling salesman problem, bin packing problem, and graph colouring problem. In addition, two bioinformatics problems not traditionally seen as ordered gene problems are studied: DNA error correction and DNA fragment assembly. These problems are studied with multiple variations and combinations of heuristics and metaheuristics with two distinct types or representations. The majority of the algorithms are built around the Recentering- Restarting Genetic Algorithm. The algorithm variations were successful on all problems studied, and particularly for the two bioinformatics problems. For DNA Error Correction multiple cases were found with 100% of the codes being corrected. The algorithm variations were also able to beat all other state-of-the-art DNA Fragment Assemblers on 13 out of 16 benchmark problem instances.