Related publications (200)

Scattering Map for the Vlasov–Poisson System

Klaus Martin Widmayer

We construct (modified) scattering operators for the Vlasov–Poisson system in three dimensions, mapping small asymptotic dynamics as t→−∞ to asymptotic dynamics as t→+∞. The main novelty is the construction of modified wave operators, but we also obtain a ...
2021

A unifying framework for form-finding and topology-finding of tensegrity structures

Yafeng Wang

This paper presents a unifying framework for the form-finding and topology-finding of tensegrity structures. The novel computational framework is based on rank-constrained linear matrix inequalities. For form-finding, given the topology (i.e., member conne ...
PERGAMON-ELSEVIER SCIENCE LTD2021

Learning-Augmented Dynamic Power Management with Multiple States via New Ski Rental Bounds

Adam Teodor Polak, Marek Elias

We study the online problem of minimizing power consumption in systems with multiple power-saving states. During idle periods of unknown lengths, an algorithm has to choose between power-saving states of different energy consumption and wake-up costs. We d ...
2021

Railway timetable rescheduling with capacity constraint

Benoit Pahud

The increasing demand for travelling forces railway operators to use their network at maximum capacity. When unforeseen events occur, the time needed to make the proper adjustments before reaching a gridlocked state is too short. The timetable rescheduling ...
2021

Symplectic dynamical low rank approximation of wave equations with random parameters

Fabio Nobile, Eleonora Musharbash, Eva Vidlicková

In this paper we propose a dynamical low-rank strategy for the approximation of second order wave equations with random parameters. The governing equation is rewritten in Hamiltonian form and the approximate solution is expanded over a set of 2S dynamical ...
2020

On the Complexity of Modulo-q Arguments and the Chevalley - Warning Theorem

Mika Tapani Göös

We study the search problem class PPA_q defined as a modulo-q analog of the well-known polynomial parity argument class PPA introduced by Papadimitriou (JCSS 1994). Our first result shows that this class can be characterized in terms of PPA_p for prime p. ...
Schloss Dagstuhl - Leibniz-Zentrum für Informatik2020

Specular Manifold Sampling for Rendering High-Frequency Caustics and Glints

Wenzel Alban Jakob, Tizian Lucien Zeltner

Scattering from specular surfaces produces complex optical effects that are frequently encountered in realistic scenes: intricate caustics due to focused reflection, multiple refraction, and high-frequency glints from specular microstructure. Yet, despite ...
ASSOC COMPUTING MACHINERY2020

Reduction of the sign problem near T=0 in quantum Monte Carlo simulations

Frédéric Mila, Jonathan D'Emidio

Building on a recent investigation of the Shastry-Sutherland model [S. Wessel et al., Phys. Rev. B 98, 174432 (2018)], we develop a general strategy to eliminate the Monte Carlo sign problem near the zero-temperature limit in frustrated quantum spin models ...
AMER PHYSICAL SOC2020

Ridesourcing Systems - Simulated Annealing Algorithm for Solving the Matching and Dispatching Problem in Dynamic Large-Scale Settings

Lynn Fayed

Ridesourcing services are gaining gradual hypes with the advancements in mobile internet and technology. The objective of these services is to mainly match and dispatch operating vehicles to waiting requests within a very short duration. The expectations t ...
2020

Which form of the molecular Hamiltonian is the most suitable for simulating the nonadiabatic quantum dynamics at a conical intersection?

Jiri Vanicek, Seonghoon Choi

Choosing an appropriate representation of the molecular Hamiltonian is one of the challenges faced by simulations of the nonadiabatic quantum dynamics around a conical intersection. The adiabatic, exact quasidiabatic, and strictly diabatic representations ...
2020

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.