Letter to the Editor: 1H, 15N, and 13C chemical shift assignments of the resuscitation promoting factor domain of Rv1009 from Mycobacterium tuberculosis

International audienceNo abstract availabl

Moments of unconditional logarithmically concave vectors

We derive two-sided bounds for moments of linear combinations of coordinates od unconditional log-concave vectors. We also investigate how well moments of such combinations may be approximated by moments of Gaussian random variables.Comment: 14 page

Transference Principles for Log-Sobolev and Spectral-Gap with Applications to Conservative Spin Systems

We obtain new principles for transferring log-Sobolev and Spectral-Gap inequalities from a source metric-measure space to a target one, when the curvature of the target space is bounded from below. As our main application, we obtain explicit estimates for the log-Sobolev and Spectral-Gap constants of various conservative spin system models, consisting of non-interacting and weakly-interacting particles, constrained to conserve the mean-spin. When the self-interaction is a perturbation of a strongly convex potential, this partially recovers and partially extends previous results of Caputo, Chafa\"{\i}, Grunewald, Landim, Lu, Menz, Otto, Panizo, Villani, Westdickenberg and Yau. When the self-interaction is only assumed to be (non-strongly) convex, as in the case of the two-sided exponential measure, we obtain sharp estimates on the system's spectral-gap as a function of the mean-spin, independently of the size of the system.Comment: 57 page

Study of the optimal conditions for NV- center formation in type 1b diamond, using photoluminescence and positron annihilation spectroscopies

We studied the parameters to optimize the production of negatively-charged nitrogen-vacancy color centers (NV-) in type~1b single crystal diamond using proton irradiation followed by thermal annealing under vacuum. Several samples were treated under different irradiation and annealing conditions and characterized by slow positron beam Doppler-broadening and photoluminescence (PL) spectroscopies. At high proton fluences another complex vacancy defect appears limiting the formation of NV-. Concentrations as high as 2.3 x 10^18 cm^-3 of NV- have been estimated from PL measurements. Furthermore, we inferred the trapping coefficient of positrons by NV-. This study brings insight into the production of a high concentration of NV- in diamond, which is of utmost importance in ultra-sensitive magnetometry and quantum hybrid systems applications

Strong Coupling of a Spin Ensemble to a Superconducting Resonator

We report the realization of a quantum circuit in which an ensemble of electronic spins is coupled to a frequency tunable superconducting resonator. The spins are Nitrogen-Vacancy centers in a diamond crystal. The achievement of strong coupling is manifested by the appearance of a vacuum Rabi splitting in the transmission spectrum of the resonator when its frequency is tuned through the NV center electron spin resonance.Comment: 4 pages, 3 figure

Hypercontractive measures, Talagrand's inequality, and influences

We survey several Talagrand type inequalities and their application to influences with the tool of hypercontractivity for both discrete and continuous, and product and non-product models. The approach covers similarly by a simple interpolation the framework of geometric influences recently developed by N. Keller, E. Mossel and A. Sen. Geometric Brascamp-Lieb decompositions are also considered in this context

A formally verified compiler back-end

This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well

Stochastic Invariants for Probabilistic Termination

Termination is one of the basic liveness properties, and we study the termination problem for probabilistic programs with real-valued variables. Previous works focused on the qualitative problem that asks whether an input program terminates with probability~1 (almost-sure termination). A powerful approach for this qualitative problem is the notion of ranking supermartingales with respect to a given set of invariants. The quantitative problem (probabilistic termination) asks for bounds on the termination probability. A fundamental and conceptual drawback of the existing approaches to address probabilistic termination is that even though the supermartingales consider the probabilistic behavior of the programs, the invariants are obtained completely ignoring the probabilistic aspect. In this work we address the probabilistic termination problem for linear-arithmetic probabilistic programs with nondeterminism. We define the notion of {\em stochastic invariants}, which are constraints along with a probability bound that the constraints hold. We introduce a concept of {\em repulsing supermartingales}. First, we show that repulsing supermartingales can be used to obtain bounds on the probability of the stochastic invariants. Second, we show the effectiveness of repulsing supermartingales in the following three ways: (1)~With a combination of ranking and repulsing supermartingales we can compute lower bounds on the probability of termination; (2)~repulsing supermartingales provide witnesses for refutation of almost-sure termination; and (3)~with a combination of ranking and repulsing supermartingales we can establish persistence properties of probabilistic programs. We also present results on related computational problems and an experimental evaluation of our approach on academic examples.Comment: Full version of a paper published at POPL 2017. 20 page