We consider a variation of Construction A of lattices from linear codes based on two classes of number fields, totally real and CM Galois number fields. We propose a generic construction with explicit generator and Gram matrices, then focus on modular and unimodular lattices, obtained in the particular cases of totally real, respectively, imaginary, quadratic fields. Our motivation comes from c...

A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing described by M. Dichtl at FSE’07 [4] is introduced. A general formula for non linear corrector, determining the bias and the minimal entropy of the output of a function is given. Finally, a concrete and efficient construction of po...

We present some first steps in the more general setting of the interpretation of dependent type theory in Ludics. The framework is the following: a (Martin-Löf) type A is represented by a behaviour (which corresponds to a formula) in such a way that canonical elements of A are interpreted in a set that is principal for the behaviour, where principal means in some way a minimal generator. We int...

The enzyme xanthine oxidase has been implicated as a generator of toxic oxygen metabolites that contribute to ischemic injury. Because substantial species variability has been demonstrated and because there are minimal human data available, the relevance of xanthine oxidase to human heart damage has been in doubt. We report the absence of xanthine oxidase activity in nine human heart biopsy spe...

Following suggestions of Nekrasov and Siegel, a non-minimal set of fields are added to the pure spinor formalism for the superstring. Twistedˆc = 3 N=2 generators are then constructed where the pure spinor BRST operator is the fermionic spin-one generator, and the formalism is interpreted as a critical topological string. Three applications of this topological string theory include the super-Po...

This lecture introduces the Jordan canonical form of a matrix — we prove that every square matrix is equivalent to a (essentially) unique Jordan matrix and we give a method to derive the latter. We also introduce the notion of minimal polynomial and we point out how to obtain it from the Jordan canonical form. Finally, we make an encounter with companion matrices. 1 Jordan form and an applicati...

This paper1 describes a novel approach to the task of realization ranking, i.e. the choice among competing paraphrases for a given input semantics, as produced by a generation system. We also introduce a notion of symmetric treebanks, which we define as the combination of (a) a set of pairings of surface forms and associated semantics plus (b) the sets of alternative analyses for the surface fo...

In this document, we present a dynamic treatment of feature propagation expressed within the Object-Oriented Parallel Logic Programming framework (in Parlog++). This approach avoids large quantity of useless and linguistically unmotivated lexical data processing and feature percolation. The basic principle of this treatment is based on the idea that a parser for a given language, together with ...

a cheaper design. Since an LC-oscillator topology is mandatory to achieve a minimal current draw, the reduction of the number of coils has to be done in the LNA, the mixer and the quadrature generator. In this work, starting from the LNA-Mixer and VCO (LMV) cell topology [2], a single-coil low-power receiver shares the bias current among all the RF blocks of the analog front-end. The receiver p...

The Feynman diagram generator FeynArts and the computer algebra program FormCalc allow for an automatic computation of 2→ 2 and 2→ 3 scattering processes in High Energy Physics. We have extended this package by four new kinematical routines and adapted one existing routine in order to accomodate also twoand three-body decays of massive particles. This makes it possible to compute automatically ...