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.

Investigating the potential of thecamoebians (testate amoebae) as bio-indicators of impact of oil sands mining operations on freshwater environments in Northeastern Alberta, Canada

Thecamoebian (testate amoeba) species diversity and assemblages in reclamation wetlands and lakes in northeastern Alberta respond to chemical and physical parameters associated with oil sands extraction. Ecosystems more impacted by OSPM (oil sands process-affected material) contain sparse, low-diversity populations dominated by centropyxid taxa and Arcella vulgaris. More abundant and diverse thecamoebian populations rich in difflugiid species characterize environments with lower OSPM concentrations. These shelled protists respond quickly to environmental change, allowing year-to-year variations in OSPM impact to be recorded. Their fossil record thus provides corporations with interests in the Athabasca Oil Sands with a potential means of measuring the progression of highlyimpacted aquatic environments to more natural wetlands. Development of this metric required investigation of controls on their fossil assemblage (e.g. seasonal variability, fossilization potential) and their biogeographic distribution, not only in the constructed lakes and wetlands on the oil sands leases, but also in natural environments across Alberta.

Bio-inspired optimization & sampling technique for side-chain packing in MCCE

The prediction of proteins' conformation helps to understand their exhibited functions, allows for modeling and allows for the possible synthesis of the studied protein. Our research is focused on a sub-problem of protein folding known as side-chain packing. Its computational complexity has been proven to be NP-Hard. The motivation behind our study is to offer the scientific community a means to obtain faster conformation approximations for small to large proteins over currently available methods. As the size of proteins increases, current techniques become unusable due to the exponential nature of the problem. We investigated the capabilities of a hybrid genetic algorithm / simulated annealing technique to predict the low-energy conformational states of various sized proteins and to generate statistical distributions of the studied proteins' molecular ensemble for pKa predictions. Our algorithm produced errors to experimental results within .acceptable margins and offered considerable speed up depending on the protein and on the rotameric states' resolution used.

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.

ORGANOSILICON BIOTECHNOLOGY: A BIO-INSPIRED APPROACH TO THE HYDROLYSIS OF ALKOXYSILANES and THE LIPASE-CATALYZED SYNTHESIS OF SILOXANE-CONTAINING POLYESTERS AND POLYAMIDES

The first part of this thesis studied the capacity of amino acids and enzymes to catalyze the hydrolysis and condensation of tetraethoxysilane and phenyltrimethoxysilane. Selected amino acids were shown to accelerate the hydrolysis and condensation of tetraethoxysilane under ambient temperature, pressure and at neutral pH (pH 7±0.02). The nature of the side chain of the amino acid was important in promoting hydrolysis and condensation. Several proteases were shown to have a capacity to hydrolyze tri- and tet-ra- alkoxysilanes under the same mild reaction conditions. The second part of this thesis employed an immobilized Candida antarctica lipase B (Novozym-435, N435) to produce siloxane-containing polyesters, polyamides, and polyester amides under solvent-free conditions. Enzymatic activity was shown to be temperature dependent, increasing until enzyme denaturation became the dominant pro-cess, which typically occurred between 120-130ᵒC. The residual activity of N435 was, on average, greater than 90%, when used in the synthesis of disiloxane-containing polyesters, regardless of the polymerization temperature except at the very highest temperatures, 140-150ᵒC. A study of the thermal tolerance of N435 determined that, over ten reaction cycles, there was a decrease in the initial rate of polymerization with each consecutive use of the catalyst. No change in the degree of monomer conversion after a 24 hour reaction cycle was found.

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.

Sloppy Joe's Bar, Season 1933

A drink manual for the establishment Sloppy Joe's Bar in Havana, Cuba. The manual is pocket size and contains 40 pages of drink recipes. The first few pages describe the bar in Havana, Cuba along with a brief biography of Jose Abeal (Sloppy Joe).

Metal Bar - P. C. Band, Toronto, Ontario

Metal bar, 2 cm x 6 1/2 cm, with the words "P.C. Band, Toronto, Ontario" engraved on it.

Diploma (vellum) from the Bar of Lower Canada to Edward Bradley Parkin of Quebec

Diploma (vellum) from the Bar of Lower Canada to Edward Bradley Parkin of Quebec conferring upon him the right of practicing as an Advocate, Barrister, Attorney, Solicitor and Proctor-at-Law in all courts in Lower Canada, June 4, 1866.