Publications associées (48)

Memoryless Worker-Task Assignment with Polylogarithmic Switching Cost

Adam Teodor Polak

We study the basic problem of assigning memoryless workers to tasks with dynamically changing demands. Given a set of w workers and a multiset T ⊆ [t] of |T| = w tasks, a memoryless worker-task assignment function is any function ϕ that assigns the workers ...
Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik2022

Lignin First: Confirming the Role of the Metal Catalyst in Reductive Fractionation

Paul Joseph Dyson, Gabor Laurenczy, Zhaofu Fei, Antoine Philippe Van Muyden, Lu Chen, Ning Yan, Xinjiang Cui

Rhodium nanoparticles embedded on the interior of hollow porous carbon nanospheres, able to sieve monomers from polymers, were used to confirm the precise role of metal catalysts in the reductive catalytic fractionation of lignin. The study provides clear ...
AMER CHEMICAL SOC2021

Real-Time Self-Collision Avoidance in Joint Space for Humanoid Robots

Aude Billard, Mikhail Koptev, Nadia Barbara Figueroa Fernandez

In this letter, we propose a real-time self-collision avoidance approach for whole-body humanoid robot control. To achieve this, we learn the feasible regions of control in the humanoid's joint space as smooth self-collision boundary functions. Collision-f ...
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Three-Dimensional Optical Diffraction Tomography With Lippmann-Schwinger Model

Michaël Unser, Demetri Psaltis, Emmanuel Emilien Louis Soubies, Joowon Lim, Ahmed Ayoub

A broad class of imaging modalities involve the resolution of an inverse-scattering problem. Among them, three-dimensional optical diffraction tomography (ODT) comes with its own challenges. These include a limited range of views, a large size of the sampl ...
2020

A stability theory beyond the co-rotational setting for critical wave maps blow up

Joachim Krieger, Shuang Miao

We exhibit non-equivariant perturbations of the blowup solutions constructed in [18] for energy critical wave maps into S2\mathbb{S}^2. Our admissible class of perturbations is an open set in some sufficiently smooth topology and vanishes near the light co ...
2020

Lens aberration compensation in interference microscopy

Yves Bellouard, Jakub Drs

Emergence of products that feature functional surfaces with complex geometries, such as freeform optics in consumer electronics and augmented reality and virtual reality, requires high-accuracy non-contact surface measurement. However, large discrepancies ...
2020

Polynomial Jump-Diffusion Models

Damir Filipovic, Martin Larsson

We develop a comprehensive mathematical framework for polynomial jump-diffusions in a semimartingale context, which nest affine jump-diffusions and have broad applications in finance. We show that the polynomial property is preserved under polynomial trans ...
2020

Treatment of long-range interactions arising in the Enskog-Vlasov description of dense fluids

Mohammadhossein Gorji, Mohsen Sadr

The kinetic theory of rarefied gases and numerical schemes based on the Boltzmann equation, have evolved to the cornerstone of non-equilibrium gas dynamics. However, their counterparts in the dense regime remain rather exotic for practical non-continuum sc ...
2019

Global Solutions To Stochastic Reaction-Diffusion Equations With Super-Linear Drift And Multiplicative Noise

Robert Dalang, Davar Khoshnevisan

Let xi(t, x) denote space-time white noise and consider a reaction-diffusion equation of the form (t, x) = 1/2u ''(t, x) + b(u(t, x)) + sigma(u(t,x))xi(t,x) on R+ x [0, 1], with homogeneous Dirichlet boundary conditions and suitable initial d ...
INST MATHEMATICAL STATISTICS2019

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.