From Tarski's Plank Problem to Simultaneous Approximation
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.
We consider a general class of SPDEs in mathbb{R}^d driven by a Gaussian spatially homogeneous noise which is white in time. We provide sufficient conditions on the coefficients and the spectral measure associated to the noise ensuring that the density of ...
We point out an interesting relation between transport in Hamiltonian dynamics and Floer homology. We generalize homoclinic Floer homology from R-2 and closed surfaces to two-dimensional cylinders. The relative symplectic action of two homoclinic points is ...
The exact formalism from B. Zotter to compute beam coupling impedances has been fully developed only in the case of an infinitely long circular beam pipe. For other two dimensional geometries, some form factors are known only in the ultrarelativistic case ...
We introduce a new discretization scheme for Maxwell equations in two space dimension. Inspired by the new paradigm of Isogeometric analysis introduced in Hughes et al. (2005) [16], we propose an algorithm based on the use of bivariate B-splines spaces sui ...
We consider the problem of determining the “closest”, or best Internet host to connect to, from a list of candidate servers. Most existing approaches rely on the use of metric, or more specifically Euclidean coordinates to infer network proximity. This is ...
In this paper we present modeling and control of a multicable suspended mechanism called the ‘2D SpiderCrane’. The use of cables, and thus avoiding conventional heavy components, makes such a mechanism suitable for working at high transfer speeds. The init ...
Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p ∈ P, the convex hull of Q∪{p} does not contain the origin in its interior.We also show that for non-emp ...
A new self-learning algorithm for accelerated dynamics, reconnaissance metadynamics, is proposed that is able to work with a very large number of collective coordinates. Acceleration of the dynamics is achieved by constructing a bias potential in terms of ...
Traditionally, spatial analysis of point pattern has been mostly focused on Euclidean space. As many human related phenomena take place on a network, the assumption of a continuous isotropic space fails to describe events which actually occur on a one-dime ...
