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.
In this note, we study certain sufficient conditions for a set of minimal klt pairs ( X, triangle) with kappa ( X, triangle) = dim( X ) - 1 to be bounded. ...
Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor loca ...
Chirok is software for a post-refinement test of the absolute structure. The software allows a user to calculate a distribution of the measure of chirality based on intensity quotients and linked to the Flack parameter. The distribution is fitted by a set ...
On ten loose handwritten folios dating back from April 1679, Leibniz gradually devised, in the course of three days, a full-blown theory of thought that nonetheless remained unpublished and still has received little attention from scholars. Conceiving of a ...
The present invention relates to a propulsion module (1) for generating wave-like motion in liquid. The propulsion module (1) comprises: a motor (7) for generating rotational motion; a set of conversion devices comprising a first conversion device (91) and ...
What are the barriers on the way to zero-emissions personal mobility (ZEM)? Based on the world cafe discussion with experts from the ETH domain, two main sets of barriers arise: a first set related to the difficulties of organising ZEM, a second set relate ...
We consider sets L = {l(1),..., l(n)} of n labeled lines in general position in R-3, and study the order types of point sets {p(1),..., p(n)} that stem from the intersections of the lines in L with (directed) planes Pi, not parallel to any line of L, that ...
In this paper we show that every set A ⊂ ℕ with positive density contains B + C for some pair B, C of infinite subsets of ℕ , settling a conjecture of Erdős. The proof features two different decompositions of an arbitrary bounded sequence into a structured ...
This is a set of 11 1-sheet guides, providing abridged notions, advice and references for quick and practical research data management: #01 Research Data: the basics #02 FAIR Data Principles #03 Cost of Research Data Management #04 File Formats #05 Metadat ...
It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...
