GmcA Is a Putative Glucose-Methanol-Choline Oxidoreductase Required for the Induction of Asexual Development in Aspergillus nidulans

18 p.

Invariant-free deduction systems for temporal logic

In this thesis we propose a new approach to deduction methods for temporal logic. Our proposal is based on an inductive definition of eventualities that is different from the usual one. On the basis of this non-customary inductive definition for eventualities, we first provide dual systems of tableaux and sequents for Propositional Linear-time Temporal Logic (PLTL). Then, we adapt the deductive approach introduced by means of these dual tableau and sequent systems to the resolution framework and we present a clausal temporal resolution method for PLTL. Finally, we make use of this new clausal temporal resolution method for establishing logical foundations for declarative temporal logic programming languages. The key element in the deduction systems for temporal logic is to deal with eventualities and hidden invariants that may prevent the fulfillment of eventualities. Different ways of addressing this issue can be found in the works on deduction systems for temporal logic. Traditional tableau systems for temporal logic generate an auxiliary graph in a first pass.Then, in a second pass, unsatisfiable nodes are pruned. In particular, the second pass must check whether the eventualities are fulfilled. The one-pass tableau calculus introduced by S. Schwendimann requires an additional handling of information in order to detect cyclic branches that contain unfulfilled eventualities. Regarding traditional sequent calculi for temporal logic, the issue of eventualities and hidden invariants is tackled by making use of a kind of inference rules (mainly, invariant-based rules or infinitary rules) that complicates their automation. A remarkable consequence of using either a two-pass approach based on auxiliary graphs or aone-pass approach that requires an additional handling of information in the tableau framework, and either invariant-based rules or infinitary rules in the sequent framework, is that temporal logic fails to carry out the classical correspondence between tableaux and sequents. In this thesis, we first provide a one-pass tableau method TTM that instead of a graph obtains a cyclic tree to decide whether a set of PLTL-formulas is satisfiable. In TTM tableaux are classical-like. For unsatisfiable sets of formulas, TTM produces tableaux whose leaves contain a formula and its negation. In the case of satisfiable sets of formulas, TTM builds tableaux where each fully expanded open branch characterizes a collection of models for the set of formulas in the root. The tableau method TTM is complete and yields a decision procedure for PLTL. This tableau method is directly associated to a one-sided sequent calculus called TTC. Since TTM is free from all the structural rules that hinder the mechanization of deduction, e.g. weakening and contraction, then the resulting sequent calculus TTC is also free from this kind of structural rules. In particular, TTC is free of any kind of cut, including invariant-based cut. From the deduction system TTC, we obtain a two-sided sequent calculus GTC that preserves all these good freeness properties and is finitary, sound and complete for PLTL. Therefore, we show that the classical correspondence between tableaux and sequent calculi can be extended to temporal logic. The most fruitful approach in the literature on resolution methods for temporal logic, which was started with the seminal paper of M. Fisher, deals with PLTL and requires to generate invariants for performing resolution on eventualities. In this thesis, we present a new approach to resolution for PLTL. The main novelty of our approach is that we do not generate invariants for performing resolution on eventualities. Our method is based on the dual methods of tableaux and sequents for PLTL mentioned above. Our resolution method involves translation into a clausal normal form that is a direct extension of classical CNF. We first show that any PLTL-formula can be transformed into this clausal normal form. Then, we present our temporal resolution method, called TRS-resolution, that extends classical propositional resolution. Finally, we prove that TRS-resolution is sound and complete. In fact, it finishes for any input formula deciding its satisfiability, hence it gives rise to a new decision procedure for PLTL. In the field of temporal logic programming, the declarative proposals that provide a completeness result do not allow eventualities, whereas the proposals that follow the imperative future approach either restrict the use of eventualities or deal with them by calculating an upper bound based on the small model property for PLTL. In the latter, when the length of a derivation reaches the upper bound, the derivation is given up and backtracking is used to try another possible derivation. In this thesis we present a declarative propositional temporal logic programming language, called TeDiLog, that is a combination of the temporal and disjunctive paradigms in Logic Programming. We establish the logical foundations of our proposal by formally defining operational and logical semantics for TeDiLog and by proving their equivalence. Since TeDiLog is, syntactically, a sublanguage of PLTL, the logical semantics of TeDiLog is supported by PLTL logical consequence. The operational semantics of TeDiLog is based on TRS-resolution. TeDiLog allows both eventualities and always-formulas to occur in clause heads and also in clause bodies. To the best of our knowledge, TeDiLog is the first declarative temporal logic programming language that achieves this high degree of expressiveness. Since the tableau method presented in this thesis is able to detect that the fulfillment of an eventuality is prevented by a hidden invariant without checking for it by means of an extra process, since our finitary sequent calculi do not include invariant-based rules and since our resolution method dispenses with invariant generation, we say that our deduction methods are invariant-free.

Effective and Robust Generalized Predictive Speed Control of Induction Motor

14 p.

Alkene selenenylation: A comprehensive analysis of relative reactivities, stereochemistry and asymmetric induction, and their comparisons with sulfenylation

A broad perspective of various factors influencing alkene selenenylation has been developed by concurrent detailed analysis of key experimental and theoretical data, such as asymmetric induction, stereochemistry, relative reactivities, and comparison with that of alkene sulfenylation. Alkyl group branching a to the double bond was shown to have the greatest effect on alkene reactivity and the stereochemical outcome of corresponding addition reactions. This is in sharp contrast with other additions to alkenes, which depend more on the degree of substitution on C=C or upon substituent electronic effects. Electronic and steric effects influencing asymmetric induction, stereochemistry, regiochemistry, and relative reactivities in the addition of PhSeOTf to alkenes are compared and contrasted with those of PhSCl.

Sliding mode position control for real-time control of induction motors

A sliding mode position control for high-performance real-time applications of induction motors in developed in this work. The design also incorporates a simple flux estimator in order to avoid the flux sensors. Then, the proposed control scheme presents a low computational cost and therefore can be implemented easily in a real-time applications using a low cost DSP-processor. The stability analysis of the controller under parameter uncertainties and load disturbances in provided using Lyapunov stability theory. Finally, simulated and experimental results show that the proposed controller with the proposed observer provides a good trajectory tracking and that this scheme is robust with respect to plant parameter variations and external load disturbances.

A robust position control for induction machines

ICEM 2010

Uncertain Information Structures and Backward Induction

In everyday economic interactions, it is not clear whether sequential choices are visible or not to other participants: agents might be deluded about opponents'capacity to acquire,interpret or keep track of data, or might simply unexpectedly forget what they previously observed (but not chose). Following this idea, this paper drops the assumption that the information structure of extensive-form games is commonly known; that is, it introduces uncertainty into players' capacity to observe each others' past choices. Using this approach, our main result provides the following epistemic characterisation: if players (i) are rational,(ii) have strong belief in both opponents' rationality and opponents' capacity to observe others' choices, and (iii) have common belief in both opponents' future rationality and op-ponents' future capacity to observe others' choices, then the backward induction outcome obtains. Consequently, we do not require perfect information, and players observing each others' choices is often irrelevant from a strategic point of view. The analysis extends {from generic games with perfect information to games with not necessarily perfect information{the work by Battigalli and Siniscalchi (2002) and Perea (2014), who provide different sufficient epistemic conditions for the backward induction outcome.

A Real-Time Sliding Mode Control for a Wind Energy System Based on a Doubly Fed Induction Generator

In this paper, a real time sliding mode control scheme for a variable speed wind turbine that incorporates a doubly feed induction generator is described. In this design, the so-called vector control theory is applied, in order to simplify the system electrical equations. The proposed control scheme involves a low computational cost and therefore can be implemented in real-time applications using a low cost Digital Signal Processor (DSP). The stability analysis of the proposed sliding mode controller under disturbances and parameter uncertainties is provided using the Lyapunov stability theory. A new experimental platform has been designed and constructed in order to analyze the real-time performance of the proposed controller in a real system. Finally, the experimental validation carried out in the experimental platform shows; on the one hand that the proposed controller provides high-performance dynamic characteristics, and on the other hand that this scheme is robust with respect to the uncertainties that usually appear in the real systems.