Publication

N2O Decomposition over Fe-ZSM-5: A Systematic Study in the Generation of Active Sites

Publications associées (39)

Evaluation of the role of superoxide radical as chain carrier for the formation of hydroxyl radical during ozonation

Urs von Gunten, Yan Wang, Gang Yu

Superoxide radicals (O-2(center dot-)) have been suggested as an important chain carrier in the radical chain reaction that promotes ozone (O-3) decomposition to hydroxyl radicals ((OH)-O-center dot) during ozonation. However, due to the difficulty in meas ...
PERGAMON-ELSEVIER SCIENCE LTD2023

Duality and bicrystals on infinite binary matrices

Thomas Gerber

The set of finite binary matrices of a given size is known to carry a finite type AA bicrystal structure. We first review this classical construction, explain how it yields a short proof of the equality between Kostka polynomials and one-dimensional sums t ...
2023

espm: A Python library for the simulation of STEM-EDXS datasets

Cécile Hébert, Duncan Thomas Lindsay Alexander, Nathanaël Perraudin, Hui Chen

We present two open-source Python packages: "electron spectro-microscopy"(espm) and "electron microscopy tables"(emtables). The espm software enables the simulation of scanning transmission electron microscopy energy-dispersive X-ray spectroscopy datacubes ...
ELSEVIER2023

Where is the money ? A decomposition of monetary flows behind fossil fuels

François Maréchal, Jonas Schnidrig, Xiang Li, Raphaël Briguet

Transition from fossils to renewables is leading to radical societal changes. Shifting the capital from fossils to renewables is commonly accompanied with political concerns, such as energy autonomy, domestic employment etc. Despite a decreasing trend in r ...
DTU Construct2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...
2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...
2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...
2022

A Benders decomposition for maximum simulated likelihood estimation of advanced discrete choice models

Michel Bierlaire, Claudia Bongiovanni

In this paper, we formulate a mixed integer linear program (MILP) for the simulated maximum likelihood estimation (MLSE) problem and devise a Benders decomposition approach to speed up the solution process. This framework can be applied to any advanced dis ...
2022

SD-Pose: Semantic Decomposition for Cross-Domain 6D Object Pose Estimation

Mathieu Salzmann, Yinlin Hu, Zhigang Li

The current leading 6D object pose estimation methods rely heavily on annotated real data, which is highly costly to acquire. To overcome this, many works have proposed to introduce computer-generated synthetic data. However, bridging the gap between the s ...
ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE2021

A Structure Theorem for Level Sets of Multiplicative Functions and Applications

Florian Karl Richter

Given a level set E of an arbitrary multiplicative function f, we establish, by building on the fundamental work of Frantzikinakis and Host [14, 15], a structure theorem that gives a decomposition of 1E1_{E} into an almost periodic and a pseudo-random part ...
2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.