Spin-related phenomena in magnetic and spin-orbit couppled bose-einstein condensates

129 p.

Triel Bonds, pi-Hole-pi-Electrons Interactions in Complexes of Boron and Aluminium Trihalides and Trihydrides with Acetylene and Ethylene

MP2/aug-cc-pVTZ calculations were performed on complexes of aluminium and boron trihydrides and trihalides with acetylene and ethylene. These complexes are linked through triel bonds where the triel center (B or Al) is characterized by the Lewis acid properties through its -hole region while -electrons of C2H2 or C2H4 molecule play the role of the Lewis base. Some of these interactions possess characteristics of covalent bonds, i.e., the Al--electrons links as well as the interaction in the BH3-C2H2 complex. The triel--electrons interactions are classified sometimes as the 3c-2e bonds. In the case of boron trihydrides, these interactions are often the preliminary stages of the hydroboration reaction. The Quantum Theory of Atoms in Molecules as well as the Natural Bond Orbitals approach are applied here to characterize the -hole--electrons interactions.

Admissible Hierachic Sets

In this paper we present a solution concept for abstract systems called the admissible hierarchic set. The solution we propose is a refinement of the hierarchic solution, a generalization of the von Neumann and Morgenstern solution. For finite abstract systems we show that the admissible hierarchic sets and the von Neumann and Morgenstern stable sets are the only outcomes of a coalition formation procedure (Wilson, 1972 and Roth, 1984). For coalitional games we prove that the core is either a vN&M stable set or an admissible hierarchic set.

An Approach to the stability of international environmental agreements: the absorbing sets solution

We study international environmental negotiations when agreements between countries can not be binding. A problem with this kind of negotiations is that countries have incentives for free-riding from such agreements. We develope a notion of equilibrium based on the assumption that countries can create and dissolve agreements in their seeking of a larger welfare. This approach leads to a larger degree of cooperation compared to models based on the internal-external stability approach.

The von Neumann-Morgenstern stable sets for 2x2 games

We analyze the von Neumann and Morgenstern stable sets for the mixed extension of 2 2 games when only single profitable deviations are allowed. We show that the games without a strict Nash equilibrium have a unique vN&M stable set and otherwise they have infinite sets.

Structural Basis for Feed-Forward Transcriptional Regulation of Membrane Lipid Homeostasis in Staphylococcus aureus

11 p.

Kontabilitate plan orokor berriaren kontzeptu-esparrua

[EU] Kontabilitate Plan Orokorrak aldaketa sakon bat izan du. Aldaketa horien artean lehena, kontabilitatearen oinarria den Kontzeptu-Esparrua da. Kontabilitatearen Kontzeptu-Esparruak, kontabilitatearen oinarriak ezartzen ditu. Bertan adierazten dira kontabilitatearen helburua zein den, hori lortzeko betebeharrak, printzipioak, osagaiak eta erregistro eta balioespen irizpideak. Lehen zati hau ondo ulertzen ez bada, kontabilitateak zentzurik ez daukala esan genezake.

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.

A detailed investigation of classification methods for vowel speech imagery recognition

Accurate and fast decoding of speech imagery from electroencephalographic (EEG) data could serve as a basis for a new generation of brain computer interfaces (BCIs), more portable and easier to use. However, decoding of speech imagery from EEG is a hard problem due to many factors. In this paper we focus on the analysis of the classification step of speech imagery decoding for a three-class vowel speech imagery recognition problem. We empirically show that different classification subtasks may require different classifiers for accurately decoding and obtain a classification accuracy that improves the best results previously published. We further investigate the relationship between the classifiers and different sets of features selected by the common spatial patterns method. Our results indicate that further improvement on BCIs based on speech imagery could be achieved by carefully selecting an appropriate combination of classifiers for the subtasks involved.

Parametric Study of the Device Angle Dependency of a Single Vortex Generator on a Flat Plate

Ponencia presentada en el 10th World Congress on Computational Mechanics (WCCM 2012), Sao Paulo (Brazil).Publicados los abstracts en documento con ISBN: 978-85-86686-69-6.

Design and synthesis of quasi-diastereomeric molecules with unchanging central, regenerating axial and switchable helical chirality via cleavage and formation of Ni(II)–O and Ni(II)–N coordination bonds

9 p.

Should EFL Teachers Present Vocabulary in Semantically Related Sets?

[EN] Teaching vocabulary in semantically related sets is common practice among EFL teachers. The present study tests the effectiveness of this method by comparing it to the alternative technique: presenting vocabulary in an unrelated way. In the study two intact classes of Spanish learners of English in high-school were presented with a set of unrelated and related words and were then asked to complete a post-test to measure the impact of both techniques on learning. The results indicate that, while both techniques successfully help the learners to acquire new words, presenting words in unrelated sets seems to be more effective.

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.

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical

Leukemia-Associated Mutations in Nucleophosmin Alter Recognition by CRM1: Molecular Basis of Aberrant Transport

Nucleophosmin (NPM) is a nucleocytoplasmic shuttling protein, normally enriched in nucleoli, that performs several activities related to cell growth. NPM mutations are characteristic of a subtype of acute myeloid leukemia (AML), where mutant NPM seems to play an oncogenic role. AML-associated NPM mutants exhibit altered subcellular traffic, being aberrantly located in the cytoplasm of leukoblasts. Exacerbated export of AML variants of NPM is mediated by the nuclear export receptor CRM1, and due, in part, to a mutationally acquired novel nuclear export signal (NES). To gain insight on the molecular basis of NPM transport in physiological and pathological conditions, we have evaluated the export efficiency of NPM in cells, and present new data indicating that, in normal conditions, wild type NPM is weakly exported by CRM1. On the other hand, we have found that AML-associated NPM mutants efficiently form complexes with CRM1HA (a mutant CRM1 with higher affinity for NESs), and we have quantitatively analyzed CRM1HA interaction with the NES motifs of these mutants, using fluorescence anisotropy and isothermal titration calorimetry. We have observed that the affinity of CRM1HA for these NESs is similar, which may help to explain the transport properties of the mutants. We also describe NPM recognition by the import machinery. Our combined cellular and biophysical studies shed further light on the determinants of NPM traffic, and how it is dramatically altered by AML-related mutations.