Dry impregnation in fluidized bed: Drying and calcination effect on nanoparticles dispersion and location in a porous support

The synthesis of metal nanoparticles dispersed inside the grains of a porous inorganic support was carried out by ‘‘dry impregnation’’ in a fluidized bed. The principle of this technique consists in the spraying of a solution containing a metal source into a hot fluidized bed of porous particles. The metal source can be of different nature such as metal salts, organometallic precursors or colloidal solutions. The experimental results obtained from iron oxide deposition on a porous silica gel as support, constitute the core of this article but others results concerning the deposition of rhodium from a colloidal suspension containing preformed rhodium nanoparticles are also described. More precisely, this study aims to understand the effect of the bed temperature during the impregnation step, the initial particle porosity and the calcination operating protocol on the metallic nanoparticles dispersion and location in the silica porous particles. The so-obtained products were characterized by various techniques in order to determine their morphology, their surface properties and the dispersion of the nanoparticles inside the support. The results showed that, under the chosen operating conditions, the deposit efficiency is close to 100% and the competition between the drying rate, depending on the process-related variables, and the capillary penetration rate, depending on the physicochemical-related variables, controls the deposit location. A quasi uniform deposit inside the support particles is observed for soft drying. The metal nanoparticles size is controlled by the pore mean diameter of the support as well as the calcination operating protocol

Computer-aided verification in mechanism design

In mechanism design, the gold standard solution concepts are dominant strategy incentive compatibility and Bayesian incentive compatibility. These solution concepts relieve the (possibly unsophisticated) bidders from the need to engage in complicated strategizing. While incentive properties are simple to state, their proofs are specific to the mechanism and can be quite complex. This raises two concerns. From a practical perspective, checking a complex proof can be a tedious process, often requiring experts knowledgeable in mechanism design. Furthermore, from a modeling perspective, if unsophisticated agents are unconvinced of incentive properties, they may strategize in unpredictable ways. To address both concerns, we explore techniques from computer-aided verification to construct formal proofs of incentive properties. Because formal proofs can be automatically checked, agents do not need to manually check the properties, or even understand the proof. To demonstrate, we present the verification of a sophisticated mechanism: the generic reduction from Bayesian incentive compatible mechanism design to algorithm design given by Hartline, Kleinberg, and Malekian. This mechanism presents new challenges for formal verification, including essential use of randomness from both the execution of the mechanism and from the prior type distributions. As an immediate consequence, our work also formalizes Bayesian incentive compatibility for the entire family of mechanisms derived via this reduction. Finally, as an intermediate step in our formalization, we provide the first formal verification of incentive compatibility for the celebrated Vickrey-Clarke-Groves mechanism

Computational Soundness for Dalvik Bytecode

Automatically analyzing information flow within Android applications that rely on cryptographic operations with their computational security guarantees imposes formidable challenges that existing approaches for understanding an app's behavior struggle to meet. These approaches do not distinguish cryptographic and non-cryptographic operations, and hence do not account for cryptographic protections: f(m) is considered sensitive for a sensitive message m irrespective of potential secrecy properties offered by a cryptographic operation f. These approaches consequently provide a safe approximation of the app's behavior, but they mistakenly classify a large fraction of apps as potentially insecure and consequently yield overly pessimistic results. In this paper, we show how cryptographic operations can be faithfully included into existing approaches for automated app analysis. To this end, we first show how cryptographic operations can be expressed as symbolic abstractions within the comprehensive Dalvik bytecode language. These abstractions are accessible to automated analysis, and they can be conveniently added to existing app analysis tools using minor changes in their semantics. Second, we show that our abstractions are faithful by providing the first computational soundness result for Dalvik bytecode, i.e., the absence of attacks against our symbolically abstracted program entails the absence of any attacks against a suitable cryptographic program realization. We cast our computational soundness result in the CoSP framework, which makes the result modular and composable.Comment: Technical report for the ACM CCS 2016 conference pape

Synthesis of Supported Catalysts by Dry Impregnation in Fluidized Bed

The synthesis of catalytic or not composite materials by dry impregnation in fluidized bed is described. This process can be carried out under mild conditions from solutions of organometallic precursors or colloidal solutions of preformed nanoparticles giving rise to reproducible metallic nanoparticles containing composite materials with a high reproducibility. The adequate choice of the reaction conditions makes possible to deposit uniformly the metal precursor within the porous matrix or on the support surface. When the ratio between the drying time and the capillary penetration time (tsec/tcap) is higher than 10, the impregnation under soft drying conditions leads to a homogeneous deposit inside the pores of the particles of support. The efficiency of the metal deposition is close to 100%, and the size of the formed metal nanoparticles is controlled by the pores diameter. Finally, some of the presented composite materials have been tested as catalysts: iron-based materials were used in carbon-nanotubes synthesis, while Pd and Rh composite materials have been investigated in hydrogenation reactions

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

Constructor subtyping

Constructor subtyping is a form of subtyping in which an inductive type A is viewed as a subtype of another inductive type B if B has more constructors than A. Its (potential) uses include proof assistants and functional programming languages. In this paper, we introduce and study the properties of a simply typed lambda-calculus with record types and datatypes, and which supports record subtyping and constructor subtyping. In the first part of the paper, we show that the calculus is confluent and strongly normalizing. In the second part of the paper, we show that the calculus admits a well-behaved theory of canonical inhabitants, provided one adopts expansive extensionality rules, including eta-expansion, surjective pairing, and a suitable expansion rule for datatypes. Finally, in the third part of the paper, we extend our calculus with unbounded recursion and show that confluence is preserved.(undefined

On continuation-passing transformations and expected cost analysis

We define a continuation-passing style (CPS) translation for a typed \u3bb-calculus with probabilistic choice, unbounded recursion, and a tick operator - for modeling cost. The target language is a (non-probabilistic) \u3bb-calculus, enriched with a type of extended positive reals and a fixpoint operator. We then show that applying the CPS transform of an expression M to the continuation \u3bb v. 0 yields the expected cost of M. We also introduce a formal system for higher-order logic, called EHOL, prove it sound, and show it can derive tight upper bounds on the expected cost of classic examples, including Coupon Collector and Random Walk. Moreover, we relate our translation to Kaminski et al.'s ert-calculus, showing that the latter can be recovered by applying our CPS translation to (a generalization of) the classic embedding of imperative programs into \u3bb-calculus. Finally, we prove that the CPS transform of an expression can also be used to compute pre-expectations and to reason about almost sure termination

Isoperimetry and stability of hyperplanes for product probability measures

International audienceWe investigate stationarity and stability of half-spaces as isoperimetric sets for product probability measures, considering the cases of coordinate and non-coordinate half-spaces. Moreover, we present several examples to which our results can be applied, with a particular emphasis on the logistic measure

Metallicity determination in gas-rich galaxies with semiempirical methods

A study of the precision of the semiempirical methods used in the determination of the chemical abundances in gas-rich galaxies is carried out. In order to do this the oxygen abundances of a total of 438 galaxies were determined using the electronic temperature, the $R_{23}$ and the P methods. The new calibration of the P method gives the smaller dispersion for the low and high metallicity regions, while the best numbers in the turnaround region are given by the $R_{23}$ method. We also found that the dispersion correlates with the metallicity. Finally, it can be said that all the semiempirical methods studied here are quite insensitive to metallicity with a value of $8.0\pm0.2$ dex for more than 50% of the total sample. \keywords{ISM: abundances; (ISM): H {\sc ii} regions}Comment: 26 pages, 9 figures and 2 tables. To appear at AJ, January 200