Type-alpha DPLs

This paper introduces Denotational Proof Languages (DPLs). DPLs are languages for presenting, discovering, and checking formal proofs. In particular, in this paper we discus type-alpha DPLs---a simple class of DPLs for which termination is guaranteed and proof checking can be performed in time linear in the size of the proof. Type-alpha DPLs allow for lucid proof presentation and for efficient proof checking, but not for proof search. Type-omega DPLs allow for search as well as simple presentation and checking, but termination is no longer guaranteed and proof checking may diverge. We do not study type-omega DPLs here. We start by listing some common characteristics of DPLs. We then illustrate with a particularly simple example: a toy type-alpha DPL called PAR, for deducing parities. We present the abstract syntax of PAR, followed by two different kinds of formal semantics: evaluation and denotational. We then relate the two semantics and show how proof checking becomes tantamount to evaluation. We proceed to develop the proof theory of PAR, formulating and studying certain key notions such as observational equivalence that pervade all DPLs. We then present NDL, a type-alpha DPL for classical zero-order natural deduction. Our presentation of NDL mirrors that of PAR, showing how every basic concept that was introduced in PAR resurfaces in NDL. We present sample proofs of several well-known tautologies of propositional logic that demonstrate our thesis that DPL proofs are readable, writable, and concise. Next we contrast DPLs to typed logics based on the Curry-Howard isomorphism, and discuss the distinction between pure and augmented DPLs. Finally we consider the issue of implementing DPLs, presenting an implementation of PAR in SML and one in Athena, and end with some concluding remarks.

Planning and Teaching Compliant Motion Strategies

This thesis presents a new high level robot programming system. The programming system can be used to construct strategies consisting of compliant motions, in which a moving robot slides along obstacles in its environment. The programming system is referred to as high level because the user is spared of many robot-level details, such as the specification of conditional tests, motion termination conditions, and compliance parameters. Instead, the user specifies task-level information, including a geometric model of the robot and its environment. The user may also have to specify some suggested motions. There are two main system components. The first component is an interactive teaching system which accepts motion commands from a user and attempts to build a compliant motion strategy using the specified motions as building blocks. The second component is an autonomous compliant motion planner, which is intended to spare the user from dealing with "simple" problems. The planner simplifies the representation of the environment by decomposing the configuration space of the robot into a finite state space, whose states are vertices, edges, faces, and combinations thereof. States are inked to each other by arcs, which represent reliable compliant motions. Using best first search, states are expanded until a strategy is found from the start state to a global state. This component represents one of the first implemented compliant motion planners. The programming system has been implemented on a Symbolics 3600 computer, and tested on several examples. One of the resulting compliant motion strategies was successfully executed on an IBM 7565 robot manipulator.

Investigating the evolution and stability of a resource limited artificial immune system.

Timmis J and Neal M J. Investigating the evolution and stability of a resource limited artificial immune system. In Proceedings of GECCO - special workshop on artificial immune systems, pages 40-41. AAAI press, 2000.

Blood and urinary abnormalities induced during and after 24-hour continuous running: A case report

In this reported clinical case, a healthy and well-trained male subject [aged 37 years, maximal oxygen uptake (V[Combining Dot Above]O2max) 64 mL·kg·min] ran for 23 hours and 35 minutes covering 160 km (6.7 km/h average running speed). The analysis of hematological and biochemical parameters 3 days before the event, just after termination of exercise, and after 24 and 48 hours of recovery revealed important changes on muscle and liver function, and hemolysis. The analysis of urine sediments showed an increment of red and white blood cells filtrations, compatible with transient nephritis. After 48 hours, most of these alterations were recovered. Physicians and health professionals who monitor such athletic events should be aware that these athletes could exhibit transient symptoms compatible with severe pathologies and diseases, although the genesis of these blood and urinary abnormalities are attributable to transient physiological adaptations rather to pathological status.

Career transitions in sport: European perspectives

Wylleman, P., Alfermann, D., Lavallee, D. (2004). Career transitions in sport: European perspectives. Psychology of Sport and Exercise, 5 (1), 7-20 RAE2008

The effect of a life development intervention on sports career transition adjustment

Lavallee, D. (2005). The effect of a life development intervention on sports career transition adjustment. The Sport Psychologist. 19(2), pp.193-202 RAE2008

An investigation of potential users of career transition services in the United Kingdom

North, J., Lavallee, D., An investigation of potential users of career transition services in the United Kingdom, Psychology of Sport and Exercise, Vol. 5, No. 1. (January 2004), pp. 77-84. RAE2008

New Notions of Reduction and Non-Semantic Proofs of β-Strong Normalization in Typed λ-Calculi

Two new notions of reduction for terms of the λ-calculus are introduced and the question of whether a λ-term is beta-strongly normalizing is reduced to the question of whether a λ-term is merely normalizing under one of the new notions of reduction. This leads to a new way to prove beta-strong normalization for typed λ-calculi. Instead of the usual semantic proof style based on Girard's "candidats de réductibilité'', termination can be proved using a decreasing metric over a well-founded ordering in a style more common in the field of term rewriting. This new proof method is applied to the simply-typed λ-calculus and the system of intersection types.

An Admission Control Paradigm for Real-time Databases

We propose and evaluate an admission control paradigm for RTDBS, in which a transaction is submitted to the system as a pair of processes: a primary task, and a recovery block. The execution requirements of the primary task are not known a priori, whereas those of the recovery block are known a priori. Upon the submission of a transaction, an Admission Control Mechanism is employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its recovery block is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. We describe a number of admission control strategies and contrast (through simulations) their relative performance.

Concurrency Admission Control Management in ACCORD

We propose and evaluate admission control mechanisms for ACCORD, an Admission Control and Capacity Overload management Real-time Database framework-an architecture and a transaction model-for hard deadline RTDB systems. The system architecture consists of admission control and scheduling components which provide early notification of failure to submitted transactions that are deemed not valuable or incapable of completing on time. In particular, our Concurrency Admission Control Manager (CACM) ensures that transactions which are admitted do not overburden the system by requiring a level of concurrency that is not sustainable. The transaction model consists of two components: a primary task and a compensating task. The execution requirements of the primary task are not known a priori, whereas those of the compensating task are known a priori. Upon the submission of a transaction, the Admission Control Mechanisms are employed to decide whether to admit or reject that transaction. Once admitted, a transaction is guaranteed to finish executing before its deadline. A transaction is considered to have finished executing if exactly one of two things occur: Either its primary task is completed (successful commitment), or its compensating task is completed (safe termination). Committed transactions bring a profit to the system, whereas a terminated transaction brings no profit. The goal of the admission control and scheduling protocols (e.g., concurrency control, I/O scheduling, memory management) employed in the system is to maximize system profit. In that respect, we describe a number of concurrency admission control strategies and contrast (through simulations) their relative performance.

Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations

We present a procedure to infer a typing for an arbitrary λ-term M in an intersection-type system that translates into exactly the call-by-name (resp., call-by-value) evaluation of M. Our framework is the recently developed System E which augments intersection types with expansion variables. The inferred typing for M is obtained by setting up a unification problem involving both type variables and expansion variables, which we solve with a confluent rewrite system. The inference procedure is compositional in the sense that typings for different program components can be inferred in any order, and without knowledge of the definition of other program components. Using expansion variables lets us achieve a compositional inference procedure easily. Termination of the procedure is generally undecidable. The procedure terminates and returns a typing if the input M is normalizing according to call-by-name (resp., call-by-value). The inferred typing is exact in the sense that the exact call-by-name (resp., call-by-value) behaviour of M can be obtained by a (polynomial) transformation of the typing. The inferred typing is also principal in the sense that any other typing that translates the call-by-name (resp., call-by-value) evaluation of M can be obtained from the inferred typing for M using a substitution-based transformation.

Involvement of incipient hydrous oxide species in electrocatalysis at some metal electrode surfaces

In this thesis a novel theory of electrocatalysis at metal (especially noble metal)/solution interfaces was developed based on the assumption of metal adatom/incipient hydrous oxide cyclic redox transitions. Adatoms are considered as metastable, low coverage species that oxidise in-situ at potentials of often significantly cathodic to the regular metal/metal oxide transition. Because the adatom coverage is so low the electrochemical or spectroscopic response for oxidation is frequently overlooked; however, the product of such oxidation, referred to here as incipient hydrous oxide seems to be the important mediator in a wide variety of electrocatalytically demanding oxidation processes. Conversely, electrocatalytically demanding reductions apparently occur only at adatom sites at the metal/solution interface - such reactions generally occur only at potentials below, i.e. more cathodic than, the adatom/hydrous oxide transition. It was established that while silver in base oxidises in a regular manner (forming initially OHads species) at potentials above 1.0 V (RHE), there is a minor redox transition at much lower potentials, ca. o.35 v (RHE). The latter process is assumed to an adatom/hydrous oxide transition and the low coverage Ag(l) hydrous oxide (or hydroxide) species was shown to trigger or mediate the oxidation of aldehydes, e. g. HCHO. The results of a study of this system were shown to be in good agreement with a kinetic model based on the above assumptions; the similarity between this type of behaviour and enzyme-catalysed processes - both systems involve interfacial active sites - was pointed out. Similar behaviour was established for gold where both Au(l) and Au(lll) hydrous oxide mediators were shown to be the effective oxidants for different organic species. One of the most active electrocatalytic materials known at the present time is platinum. While the classical view of this high activity is based on the concept of activated chemisorption (and the important role of the latter is not discounted here) a vital role is attributed to the adatom/hydrous oxide transition. It was suggested that the well known intermediate (or anomalous) peak in the hydrogen region of the cyclic voltanmogram for platinum region is in fact due to an adatom/hydrous oxide transition. Using potential stepping procedures to minimise the effect of deactivating (COads) species, it was shown that the onset (anodic sweep) and termination (cathodic sweep) potential for the oxidation of a wide variety of organics coincided with the potential for the intermediate peak. The converse was also shown to apply; sluggish reduction reactions, that involve interaction with metal adatoms, occur at significant rates only in the region below the hydrous oxide/adatom transition.

Digital signal processing and artificial intelligence for the automated classification of food allergy

As a by-product of the ‘information revolution’ which is currently unfolding, lifetimes of man (and indeed computer) hours are being allocated for the automated and intelligent interpretation of data. This is particularly true in medical and clinical settings, where research into machine-assisted diagnosis of physiological conditions gains momentum daily. Of the conditions which have been addressed, however, automated classification of allergy has not been investigated, even though the numbers of allergic persons are rising, and undiagnosed allergies are most likely to elicit fatal consequences. On the basis of the observations of allergists who conduct oral food challenges (OFCs), activity-based analyses of allergy tests were performed. Algorithms were investigated and validated by a pilot study which verified that accelerometer-based inquiry of human movements is particularly well-suited for objective appraisal of activity. However, when these analyses were applied to OFCs, accelerometer-based investigations were found to provide very poor separation between allergic and non-allergic persons, and it was concluded that the avenues explored in this thesis are inadequate for the classification of allergy. Heart rate variability (HRV) analysis is known to provide very significant diagnostic information for many conditions. Owing to this, electrocardiograms (ECGs) were recorded during OFCs for the purpose of assessing the effect that allergy induces on HRV features. It was found that with appropriate analysis, excellent separation between allergic and nonallergic subjects can be obtained. These results were, however, obtained with manual QRS annotations, and these are not a viable methodology for real-time diagnostic applications. Even so, this was the first work which has categorically correlated changes in HRV features to the onset of allergic events, and manual annotations yield undeniable affirmation of this. Fostered by the successful results which were obtained with manual classifications, automatic QRS detection algorithms were investigated to facilitate the fully automated classification of allergy. The results which were obtained by this process are very promising. Most importantly, the work that is presented in this thesis did not obtain any false positive classifications. This is a most desirable result for OFC classification, as it allows complete confidence to be attributed to classifications of allergy. Furthermore, these results could be particularly advantageous in clinical settings, as machine-based classification can detect the onset of allergy which can allow for early termination of OFCs. Consequently, machine-based monitoring of OFCs has in this work been shown to possess the capacity to significantly and safely advance the current state of clinical art of allergy diagnosis

First principles simulation of amorphous silicon bulk, interfaces, and nanowires for photovoltaics

Amorphous silicon has become the material of choice for many technologies, with major applications in large area electronics: displays, image sensing and thin film photovoltaic cells. This technology development has occurred because amorphous silicon is a thin film semiconductor that can be deposited on large, low cost substrates using low temperature. In this thesis, classical molecular dynamics and first principles DFT calculations have been performed to generate structural models of amorphous and hydrogenated amorphous silicon and interfaces of amorphous and crystalline silicon, with the ultimate aim of understanding the photovoltaic properties of core-shell crystalline amorphous Si nanowire structures. We have shown, unexpectedly, from the simulations, that our understanding of hydrogenated bulk a-Si needs to be revisited, with our robust finding that when fully saturated with hydrogen, bulk a-Si exhibits a constant optical energy gap, irrespective of the hydrogen concentration in the sample. Unsaturated a-Si:H, with a lower than optimum hydrogen content, shows a smaller optical gap, that increases with hydrogen content until saturation is reached. The mobility gaps obtained from an analysis of the electronic states show similar behavior. We also obtained that the optical and mobility gaps show a volcano curve as the H content is varied from 7% (undersaturation) to 18% (mild oversaturation). In the case of mild over saturation, the mid-gap states arise exclusively from an increase in the density of strained Si-Si bonds. Analysis of our structures shows the extra H atoms in this case form a bridge between neighboring silicon atoms which increases the corresponding Si-Si distance and promotes bond length disorder in the sample. That has the potential to enhance the Staebler-Wronski effect. Planar interface models of amorphous-crystalline silicon have been generated in Si (100), (110) and (111) surfaces. The interface models are characterized by structure, RDF, electronic density of states and optical absorption spectrum. We find that the least stable (100) surface will result in the formation of the thickest amorphous silicon layer, while the most stable (110) surface forms the smallest amorphous region. We calculated for the first time band offsets of a-Si:H/c-Si heterojunctions from first principles and examined the influence of different surface orientations and amorphous layer thickness on the offsets and implications for device performance. The band offsets depend on the amorphous layer thickness and increase with thickness. By controlling the amorphous layer thickness we can potentially optimise the solar cell parameters. Finally, we have successfully generated different amorphous layer thickness of the a-Si/c-Si and a-Si:H/c-Si 5 nm nanowires from heat and quench. We perform structural analysis of the a-Si-/c-Si nanowires. The RDF, Si-Si bond length distributions, and the coordination number distributions of amorphous regions of the nanowires reproduce similar behaviour compared to bulk amorphous silicon. In the final part of this thesis we examine different surface terminating chemical groups, -H, - OH and –NH2 in (001) GeNW. Our work shows that the diameter of Ge nanowires and the nature of surface terminating groups both play a significant role in both the magnitude and the nature of the nanowire band gaps, allowing tuning of the band gap by up to 1.1 eV. We also show for the first time how the nanowire diameter and surface termination shifts the absorption edge in the Ge nanowires to longer wavelengths. Thus, the combination of nanowire diameter and surface chemistry can be effectively utilised to tune the band gaps and thus light absorption properties of small diameter Ge nanowires.

Safety and efficacy of rivastigmine in adolescents with Down syndrome: long-term follow-up.

Following the completion of a 20-week, open-label study of the safety and efficacy of liquid rivastigmine for adolescents with Down syndrome, 5 of the 10 adolescents in the clinical trial continued long-term rivastigmine therapy and 5 did not. After an average period of 38 months, all 10 subjects returned for a follow-up assessment to determine the safety and efficacy of long-term rivastigmine use. Rivastigmine was well tolerated and overall health appeared to be unaffected by long-term rivastigmine use. Performance change on cognitive and language measures administered at the termination of the open-label clinical trial was compared between the two groups. No between-group difference in median performance change across the long-term period was found, suggesting that the long-term use of rivastigmine does not improve cognitive and language performance. However, two subjects demonstrated remarkable improvement in adaptive function over the long-term period. Both subjects had received long-term rivastigmine therapy. The discussion addresses the challenge of assessing cognitive change in clinical trials using adolescents with Down syndrome as subjects and the use of group versus individual data to evaluate the relevance of medication effects.