The infared optical properties of Sr2RuO4 and SmTiO3 including an object-oriented resistivity interface /

The perovskite crystal structure is host to many different materials from insulating to superconducting providing a diverse range of intrinsic character and complexity. A better fundamental description of these materials in terms of their electronic, optical and magnetic properties undoubtedly precedes an effective realization of their application potential. SmTiOa, a distorted perovskite has a strongly localized electronic structure and undergoes an antiferromagnetic transition at 50 K in its nominally stoichiometric form. Sr2Ru04 is a layered perovskite superconductor (ie. Tc % 1 K) bearing the same structure as the high-tem|>erature superconductor La2_xSrrCu04. Polarized reflectance measurements were carried out on both of these materials revealing several interesting features in the far-infrared range of the spectrum. In the case of SmTiOa, although insulating, evidence indicates the presence of a finite background optical conductivity. As the temperature is lowered through the ordering temperature a resonance feature appears to narrow and strengthen near 120 cm~^ A nearby phonon mode appears to also couple to this magnetic transition as revealed by a growing asymmetry in the optica] conductivity. Experiments on a doped sample with a greater itinerant character and lower Neel temperature = 40 K also indicate the presence of this strongly temperature dependent mode even at twice the ordering temperature. Although the mode appears to be sensitive to the magnetic transition it is unclear whether a magnon assignment is appropriate. At very least, evidence suggests an interesting interaction between magnetic and electronic excitations. Although Sr2Ru04 is highly anisotropic it is metallic in three-dimensions at low temperatures and reveals its coherent transport in an inter-plane Drude-like component to the highest temperatures measured (ie. 90 K). An extended Drude analysis is used to probe the frequency dependent scattering character revealing a peak in both the mass enhancement and scattering rate near 80 cm~* and 100 cm~* respectively. All of these experimental observations appear relatively consistent with a Fermi-liquid picture of charge transport. To supplement the optical measurements a resistivity station was set up with an event driven object oriented user interface. The program controls a Keithley Current Source, HP Nano-Voltmeter and Switching Unit as well as a LakeShore Temperature Controller in order to obtain a plot of the Resistivity as a function of temperature. The system allows for resistivity measurements ranging from 4 K to 290 K using an external probe or between 0.4 K to 295 K using a Helium - 3 Cryostat. Several materials of known resistivity have confirmed the system to be robust and capable of measuring metallic samples distinguishing features of several fiQ-cm.

Manipulation of adenovirus early region 1 rescue plasmids by homologous recombination in Saccharomyces cerevisiae

The manipulation of large (>10 kb) plasmid systems amplifies problems common to traditional cloning strategies. Unique or rare restriction enzyme recognition sequences are uncommon and very rarely located in opportunistic locations. Making site-specific deletions and insertions in larger plasmids consequently leads to multiple step cloning strategies that are often limited by time-consuming, low efficiency linker insertions or blunt-end cloning strategies. Manipulation ofthe adenovirus genome and the genomes ofother viruses as bacterial plasmids are systems that typify such situations. Recombinational cloning techniques based on homologous recombination in Saccharomyces cerevisiae that circumvent many ofthese common problems have been developed. However, these techniques are rarely realistic options for such large plasmid systems due to the above mentioned difficulties associated with the addition ofrequired yeast DNA replication, partitioning and selectable marker sequences. To determine ifrecombinational cloning techniques could be modified to simplify the manipulation of such a large plasmid system, a recombinational cloning system for the creation of human adenovirus EI-deletion rescue plasmids was developed. Here we report for the first time that the 1,456 bp TRP1/ARS fragment ofYRp7 is alone sufficient to foster successful recombinational cloning without additional partitioning sequences, using only slight modifications of existing protocols. In addition, we describe conditions for efficient recombinational cloning involving simultaneous deletion of large segments ofDNA (>4.2 kb) and insertion of donor fragment DNA using only a single non-unique restriction site. The discovery that recombinational cloning can foster large deletions has been used to develop a novel recombiliational cloillng technique, selectable inarker 'kilockouf" recombinational cloning, that uses deletion of a yeast selectable marker coupled with simultaneous negative and positive selection to reduce background transformants to undetectable levels. The modification of existing protocols as described in this report facilitates the use of recombinational cloning strategies that are otherwise difficult or impractical for use with large plasmid systems. Improvement of general recombinational cloning strategies and strategies specific to the manipulation ofthe adenovirus genome are considered in light of data presented herein.

Sexual selections in the northern fall field cricket, Gryllus pennsylvanicus: a manipulation of the adult sex ratio

The operational sex ratio has long been considered an important constraint on the structure of mating systems. The effects of an experimentally manipulated sex ratio on mating behavior and selection were investigated in a polygynous species, Gryllus pennsylvanicus, where the potential exists for spatial/temporal fluctuations in sex ratio of field populations. Four different sex ratios (males: females, 5:0, 5:2, 5:5, 5:10) were investigated. Observations were conducted in late summer over two field seasons, from 2400 h , to 1000 h EST. Several male characters thought to be associated with male reproduc.tive success were studied: calling duration, searching distance, weight, fighting behavior, courtship frequency, and mating success. Variance in male mating success was used as the indicator for the opportunity for sexual selection. Total selection was estimated as the univariate regression coefficient between relative fitness and the character of interest, while direct selection was estimated as standardized partial regression coefficients generated from a multiple regression of relative fitness on each character. The opportunity for sexual selection was highest at 5:2 and lowest at 5:10. The frequency of fighting behavior was highest at 5:2 and 5:5. Fighting ability (% wins) was determined to be an important correlate of male body weight. Direct selection for increased male body weight was detected at 5:2, while total selection for body weight was seen at 5:5. Selection on male body weight was not detected at 5: 10. Calling duration decreased as sex ratio became more female-biased. Total and direct selection were detected for increased calling at 5:2, only total selection for calling was seen at 5:5, whereas direct selection against calling was detected at 5: 10. Searching distance also decreased as sex ratio became more female-biased, however no form of selection was detected for searching at any of the sex ratios. Data are discussed in terms of sexual selection on male reproductive tactics, the mating system and maintenance of genetic variation in male reproductive behavior.

Winâ Foy : functional object-oriented programming language

This thesis will introduce a new strongly typed programming language utilizing Self types, named Win--*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a programming language is based on deficiencies found in programming languages that support both Self types and subtyping. Subtyping is a concept that is taken for granted by most software engineers programming in object-oriented languages. Subtyping supports subsumption but it does not support the inheritance of binary methods. Binary methods contain an argument of type Self, the same type as the object itself, in a contravariant position, i.e. as a parameter. There are several arguments in favour of introducing Self types into a programming language (11. This rationale led to the development of a relation that has become known as matching [4, 5). The matching relation does not support subsumption, however, it does support the inheritance of binary methods. Two forms of matching have been proposed (lJ. Specifically, these relations are known as higher-order matching and I-bound matching. Previous research on these relations indicates that the higher-order matching relation is both reflexive and transitive whereas the f-bound matching is reflexive but not transitive (7]. The higher-order matching relation provides significant flexibility regarding inheritance of methods that utilize or return values of the same type. This flexibility, in certain situations, can restrict the programmer from defining specific classes and methods which are based on constant values [21J. For this reason, the type This is used as a second reference to the type of the object that cannot, contrary to Self, be specialized in subclasses. F-bound matching allows a programmer to define a function that will work for all types of A', a subtype of an upper bound function of type A, with the result type being dependent on A'. The use of parametric polymorphism in f-bound matching provides a connection to subtyping in object-oriented languages. This thesis will contain two main sections. Firstly, significant details concerning deficiencies of the subtype relation and the need to introduce higher-order and f-bound matching relations into programming languages will be explored. Secondly, a new programming language named Win--*Foy Functional Object-Oriented Programming Language has been created, along with a suitable user interface, in order to facilitate experimentation by programmers regarding the matching relation. The construction of the programming language and the user interface will be explained in detail.

Equational Reasoning about Object-Oriented Programs

Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process is a programming language that provides powerful abstraction mechanisms combined with intensive reuse of code. In this thesis we present a strongly typed functional object-oriented programming language. This language features type operators of arbitrary kind corresponding to so-called type protocols. Sub classing and inheritance is based on higher-order matching, i.e., utilizes type protocols as basic tool for reuse of code. We define the operational and axiomatic semantics of this language formally. The latter is the basis of the interactive proof assistant VOOP (Verified Object-Oriented Programs) that allows the user to prove equational properties of programs interactively.

Real-Time Automatic Object Classification and Tracking using Genetic Programming and NVIDIA R CUDA TM

Genetic Programming (GP) is a widely used methodology for solving various computational problems. GP's problem solving ability is usually hindered by its long execution times. In this thesis, GP is applied toward real-time computer vision. In particular, object classification and tracking using a parallel GP system is discussed. First, a study of suitable GP languages for object classification is presented. Two main GP approaches for visual pattern classification, namely the block-classifiers and the pixel-classifiers, were studied. Results showed that the pixel-classifiers generally performed better. Using these results, a suitable language was selected for the real-time implementation. Synthetic video data was used in the experiments. The goal of the experiments was to evolve a unique classifier for each texture pattern that existed in the video. The experiments revealed that the system was capable of correctly tracking the textures in the video. The performance of the system was on-par with real-time requirements.

Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks

Complex networks are systems of entities that are interconnected through meaningful relationships. The result of the relations between entities forms a structure that has a statistical complexity that is not formed by random chance. In the study of complex networks, many graph models have been proposed to model the behaviours observed. However, constructing graph models manually is tedious and problematic. Many of the models proposed in the literature have been cited as having inaccuracies with respect to the complex networks they represent. However, recently, an approach that automates the inference of graph models was proposed by Bailey [10] The proposed methodology employs genetic programming (GP) to produce graph models that approximate various properties of an exemplary graph of a targeted complex network. However, there is a great deal already known about complex networks, in general, and often specific knowledge is held about the network being modelled. The knowledge, albeit incomplete, is important in constructing a graph model. However it is difficult to incorporate such knowledge using existing GP techniques. Thus, this thesis proposes a novel GP system which can incorporate incomplete expert knowledge that assists in the evolution of a graph model. Inspired by existing graph models, an abstract graph model was developed to serve as an embryo for inferring graph models of some complex networks. The GP system and abstract model were used to reproduce well-known graph models. The results indicated that the system was able to evolve models that produced networks that had structural similarities to the networks generated by the respective target models.