Issue des travaux sur la logique linéaire et l'analyse calculatoire de la logique classique, la notion de polarités semble jouer un rôle essentiel dans l'étude actuelle des systèmes logiques. La polarisation est une contrainte qui simplifie les objets tout en conservant une expressivité suffisante d'un point de vue informatique.<br /><br />L'objet de cette thèse est d'étudier et d'exploiter cette nouvelle structure afin en particulier de mettre à jour les relations entre la logique classique et la logique linéaire (LL). L'introduction des polarités dans LL permet de mieux appréhender ce vaste système et de prolonger le développement de différents outils trop complexes en l'absence de cette contrainte. Nous définissons ainsi, pour la logique linéaire polarisée (LLP), des réseaux de preuve intégrant les connecteurs additifs de manière satisfaisante, une sémantique des jeux polarisés qui réconcilie jeux et dualité, une géométrie de l'interaction parallèle et d'autres sémantiques dénotationnelles basées sur des notions connues (espaces de corrélation, catégories de contrôle).<br /><br />Il est important de montrer que malgré cette contrainte, LLP reste un système suffisamment expressif. Pour cela nous étudions en détail les traductions des différents systèmes de logique classique déterministe connus (LC, lambda-mu calcul, ...) aussi bien en appel par nom qu'en appel par valeur. De surcroît, les traductions obtenues pour ces systèmes sont plus simples que celles vers LL.<br /><br />Enfin la souplesse de ces traductions nous permet d'analyser plus finement certaines propriétés de la logique classique tout comme LL permet d'analyser la logique intuitionniste. On peut ainsi étudier un équivalent linéaire des CPS-traductions.

This work addresses the issues concerned with the provision of scalable video services over heterogeneous networks particularly with regards to dynamic adaptation and user’s acceptable quality of service. In order to provide and sustain an adaptive and network friendly multimedia communication service, a suite of techniques that achieved automatic scalability and adaptation are developed. These techniques are evaluated objectively and subjectively to assess the Quality of Service (QoS) provided to diverse users with variable constraints and dynamic resources. The research ensured the consideration of various levels of user acceptable QoS The techniques are further evaluated with view to establish their performance against state of the art scalable and non-scalable techniques. To further improve the adaptability of the designed techniques, several experiments and real time simulations are conducted with the aim of determining the optimum performance with various coding parameters and scenarios. The coding parameters and scenarios are evaluated and analyzed to determine their performance using various types of video content and formats. Several algorithms are developed to provide a dynamic adaptation of coding tools and parameters to specific video content type, format and bandwidth of transmission. Due to the nature of heterogeneous networks where channel conditions, terminals, users capabilities and preferences etc are unpredictably changing, hence limiting the adaptability of a specific technique adopted, a Dynamic Scalability Decision Making Algorithm (SADMA) is developed. The algorithm autonomously selects one of the designed scalability techniques basing its decision on the monitored and reported channel conditions. Experiments were conducted using a purpose-built heterogeneous network simulator and the network-aware selection of the scalability techniques is based on real time simulation results. A technique with a minimum delay, low bit-rate, low frame rate and low quality is adopted as a reactive measure to a predicted bad channel condition. If the use of the techniques is not favoured due to deteriorating channel conditions reported, a reduced layered stream or base layer is used. If the network status does not allow the use of the base layer, then the stream uses parameter identifiers with high efficiency to improve the scalability and adaptation of the video service. To further improve the flexibility and efficiency of the algorithm, a dynamic de-blocking filter and lambda value selection are analyzed and introduced in the algorithm. Various methods, interfaces and algorithms are defined for transcoding from one technique to another and extracting sub-streams when the network conditions do not allow for the transmission of the entire bit-stream.

No description available.

The research for this thesis has followed two main paths: the one of probability logics and the other of type systems and logical frameworks, bringing them together through interactive theorem proving. With the development of computer technology and the need to capture real-world dynamics, situations, and problems, reasoning under uncertainty has become one of the more important research topics of today, and one of the tools for formalizing this kind of knowledge are probability logics. Given that probability logics, serving as decision-making or decision-support systems, often form a basis for expert systems that find their application in fields such as game theory or medicine, their correct functioning is of great importance, and formal verification of their properties would add an additional level of security to the design process. On the other hand, in the field of logical frameworks and interactive theorem proving, attention has been directed towards a more natural way of encoding formal systems where derivation rules are subject to side conditions which are either rather difficult or impossible to encode naively, in the Edinburgh Logical Framework \LF or any other type-theory based Logical Framework, due to their inherent limitations, or to the fact that the formal systems in question need to access the derivation context, or the structure of the derivation itself, or other structures and mechanisms not available at the object level. The first part of the thesis deals with the development and formal verification of probability logics. First, we introduce a Probability Logic with Conditional Operators - LPCP, its syntax, semantics, and a sound and strongly-complete axiomatic system, featuring an infinitary inference rule. We prove the obtained formalism decidable, and extend it so as to represent evidence, making it the first propositional axiomatization of reasoning about evidence. Next, we show how to encode probability logics LQI and LQnI in the Proof Assistant Coq. Both of these logics extend classical logic with modal-like probability operators, and both feature an infinitary inference rule. LQI allows iterations of probability operators, while LQnI does not. We proceed to formally verify their key properties - soundness, strong completeness, and non-compactness. In this way, we formally justify the use of probabilistic SAT-solvers for the checking of consistency-related questions. In the second part of the thesis, we present LFP - a Logical Framework with External Predicates, by introducing a mechanism for locking and unlocking types and terms into LF, allowing the use of external oracles. We prove that LFP satisfies all of the main meta-theoretical properties (strong normalization, confluence, subject reduction, decidability of type checking). We develop a corresponding canonical framework, allowing for easy proofs of encoding adequacy. We provide a number of encodings - the simple untyped lambda-calculus with a Call-by-Value reduction strategy, the Design-by-Contract paradigm, a small imperative language with Hoare Logic, Modal Logics in Hilbert and Natural Deduction style, and Non-Commutative Linear Logic (encoded for the first time in an LF-like framework), illustrating that in LFP we can encode side-conditions on the application of rules elegantly, and achieve a separation between derivation and computation, resulting in cleaner and more readable proofs. We believe that the results presented in this thesis can serve as a foundation for fruitful future research. On the one hand, the obtained formal correctness proofs add an additional level of security when it comes to the construction of expert systems constructed using the verified logics, and pave way for further formal verification of other probability logics. On the other hand, there is room for further improvement, extensions, and deeper analysis of the LFP framework, as well as the building of a prototype interactive theorem prover based on LFP and discovering its place in the world of proof assistants.

On présente une Logique Probabiliste avec des Operateurs Conditionnels - LPCP, sa syntaxe, sémantique, axiomatisation correcte et fortement complète, comprenant une règle de déduction infinitaire. On prouve que LPCP est décidable, et on l'étend pour qu'il puisse représenter l'évidence, en créant ainsi la première axiomatisation propositionnelle du raisonnement basé sur l'évidence. On codifie les Logiques Probabilistes LPP1Q et LPPQ2 dans l'Assistant de Preuve Coq, et on vérifie formellement leurs propriétés principales: correction, complétude fort et non-compacité. Les deux logiques étendent la Logique Classique avec des opérateurs de probabilité, et présentent une règle de déduction infinitaire. LPPQ1 permet des itérations des opérateurs de probabilité, lorsque LPPQ2 ne le permet pas. On a formellement justifié l'utilisation des solveurs SAT probabilistes pour vérifier les questions liées à la cohérence. On présente LFP, un Cadre Logique avec Prédicats Externes, en introduisant un mécanisme pour bloquer et débloquer types et termes dans LF, en permettant l'utilisation d'oracles externes. On démontre que LFP satisfait tous les principales propriétés et on développe un cadre canonique correspondant, qui permet de prouver l'adéquation. On fournit diverses encodages - le λ-calcul non-typé avec la stratégie de réduction CBV, Programmation-par-Contrats, un langage impératif avec la Logique de Hoare, des Logiques Modales et la Logique Linéaire Non-Commutative, en montrant que en LFP on peut codifier aisément des side-conditions dans l'application des règles de typage et atteindre une séparation entre vérification et computation, en obtenant des preuves plus claires et lisibles.

L'objectif de cette thèse est de développer une théorie de types pour le λ-calcul linéaire-algébrique, une extension du λ-calcul motivé par l'informatique quantique. Cette extension algébrique comprend tous les termes du λ-calcul plus leurs combinaisons linéaires, donc si t et r sont des termes, α.t+β.r est aussi un terme, avec α et β des scalaires pris dans un anneau. L'idée principale et le défi de cette thèse était d'introduire un système de types où les types, de la même façon que les termes, constituent un espace vectoriel, permettant la mise en évidence de la structure de la forme normale d'un terme. Cette thèse présente le système Lineal , ainsi que trois systèmes intermédiaires, également intéressants en eux-même : Scalar, Additive et λCA, chacun avec leurs preuves de préservation de type et de normalisation forte.

Engine knock has long been a well recognized phenomenon in the automotive industry. Detecting engine knock opens up the possibility for an indirect feedback of the engine's internal combustion without installing a pressure transducer inside the cylinder. Knock detection has mainly been used for spark advance control, making it possible to control the engine close to its knock limit in search for the optimal ignition timing. This application has to a lesser extent been applied to lightweight two-stroke engines, which is the focus of this study. The investigation features a modern chainsaw engine whose knock characteristics were first determined with a pressure transducer. The structural vibrations originating from the engine knock are filtered out of the signal from a remote located accelerometer. The knock intensity is compared with the signal from the pressure transducer which shows a correlation with an accepted extent between the two sensors. Parameters that affect the knock intensity have also been investigated. These include engine temperature, different types of fuel and ignition timings.

Bacteriophage Lambda (λ) has played a historical role as an essential model contributing to our current understanding of molecular genetics. Lambda’s major capsid protein “gpD” occurs on each capsid at 405 to 420 copies per phage in homotrimeric form and functions to stabilize the head and likely to compact the genomic DNA. The interesting conformation of this protein allows for its exploitation through the genetic fusion of peptides or proteins to either the amino or carboxy terminal end of gpD, while retaining phage assembly functionality and viability. The lytic nature of λ and the conformation of gpD in capsid assembly makes this display system superior to other display options. Despite previous reports of λ as a phage display candidate, decorative control of the phage remains an elusive concept. The primary goal of this study was to design and construct a highly controllable head decoration system governed by two genetic conditional regulation systems; plasmid-mediated temperature sensitive repressor expression and bacterial conditional amber mutation suppression. The historical λ Dam15 conditional allele results in a truncated gpD fragment when translated in nonsuppressor, wild-type E. coli cells, resulting in unassembled, nonviable progeny. I sequenced the Dam15 allele, identifying an amber (UAG) translational stop at the 68th codon. Employing this mutant in combination with a newly created isogenic cellular background utilizing the amber suppressors SupD (Serine), SupE (Glutamine), SupF (Tyrosine) and Sup— (wild type), we sought to control the level of incorporation of undecorated gpD products. As a second dimension, I constructed two separate temperature-inducile plasmids whereby expression of either D or D::eGFP was governed by the λ strong λ CI[Ts]857 temperature-sensitive repressor and expressed from the λ PL strong promoter. Our aim was to measure the decoration of the λ capsid by a D::gfp fusion under varying conditions regulated by both temperature and presence of suppression. This was achieved utilizing this controllable system, enabling the measurement of a variable number of fusions per phage based on diverse genetic and physical environments without significantly compromising phage viability. Surprisingly, both SupE and SupF showed similar levels of Dam15 suppression, even though sequencing data indicated that only SupE could restore the native gpD sequence at amino acid 68 (Q). In contrast, SupD (S), conferred very weak levels of suppression, but imparted an environment for very high decoration of gpD::eGFP per capsid, even at lower (repressed) temperatures. The presence of albeit few wild-type gpD molecules allowed for an even greater display than that of the perceived “100%” decoration scenario provided by the nonsuppressor strain. It appears that the lack of wild-type gpD does not allow for the space required to display the maximum number of fusions and in turn creates an environment that affects both phage assembly and therefore phage viability. Finally, the use of Western blotting, confirmed the presence of gpD::eGFP fusion decoration by employing a polyclonal anti-eGFP antibody. The significance of this work relates to the unique structure of λ’s capsid and its ability to exploit gpD in the design of controlled expression, which is guiding future research examining the fusion of different therapeutic peptides and proteins. Furthermore this approach has important implications specifically for the design of novel vaccines and delivery vehicles for targeted gene therapy in which steric hindrance and avidity are important concerns. The execution of this project employed basic bacterial genetics, phage biology and molecular biology techniques in the construction of bacterial strains and plasmids and the characterization of the phage display system.

Errata sheet pasted opposite Table of Contents. / Includes bibliographies. / 142, [171] leaves : ill. ; 30 cm. / Title page, contents and abstract only. The complete thesis in print form is available from the University Library. / This thesis investigates the UV-induced inhibition of oriC initiation function and the nature of the phenotype of the mutant origin of replication of Escherichia coli, oriCc. The specific aims of this study are to delineate the source of the UV-induced trans-acting inhibition of oriC function, utilizing the phage vector [lambda]poriCc, and to demonstrate the oriCc allele as an enhanced DNA replication initiator from oriC. / Thesis (Ph.D.)--University of Adelaide, Dept. of Biochemistry, 1997?

Thesis (Ph. D.)--Ohio State University, 2007. / Title from first page of PDF file. Includes bibliographical references (p. 152-161).