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.
We present a trustworthy connection between the Leon verification system and the Isabelle proof assistant. Leon is a system for verifying functional Scala programs. It uses a variety of automated theorem provers (ATPs) to check verification conditions (VCs ...
The Advanced Proton Driven Plasma Wakefield Acceleration Experiment (AWAKE) aims at studying plasma wakefield generation and electron acceleration driven by proton bunches. It is a proof-of-principle R&D experiment at CERN and the world's first proton driv ...
The aim of this short note is twofold. First, we give a sketch of the proof of a recent result proved by the authors in the paper [7] concerning existence and uniqueness of renormalized solutions of continuity equations with unbounded damping coefficient. ...
An ongoing issue in vascular medicine is the measure of the blood flow. Catheterization remains the gold standard measurement method, although non-invasive techniques are an area of intense research. We hereby present a computational method for real-time m ...
Summary form only given. Single photon detectors allow us to work with the weakest signals such as auto-fluorescent biological sources. In combination with time gated operation mode, an array of detectors can be used as Fluorescence Lifetime Imaging system ...
A monotone cylindrical graph is a topological graph drawn on an open cylinder with an infinite vertical axis satisfying the condition that every vertical line intersects every edge at most once. It is called simple if any pair of its edges have at most one ...
For a graph G, let nu(s)(G) be the strong matching number of G. We prove the sharp bound nu(s)(G) >= n(G)/9 for every graph G of maximum degree at most 4 and without isolated vertices that does not contain a certain blown-up 5-cycle as a component. This re ...
We prove that Hausel’s formula for the number of rational points of a Nakajima quiver variety over a finite field also holds in a suitable localization of the Grothendieck ring of varieties. In order to generalize the arithmetic harmonic analysis in his pr ...
Dynamic functional connectivity (dFC) measured by functional magnetic resonance imaging (fMRI) shows evidence of large-scale networks with highly dynamic (re) configurations. We propose a novel approach to extract traces of human brain function by the cons ...
Cloaking using complementary media was suggested by Lai et al. in [8]. The study of this problem faces two difficulties. Firstly, this problem is unstable since the equations describing the phenomenon have sign changing coefficients, hence the ellipticity ...