Concept

Théorie des ensembles approximatifs

Publications associées (449)

On the boundedness of n-folds with κ(X) = n - 1

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. ...

European Mathematical Soc-Ems2024

Hitting with Probability One for Stochastic Heat Equations with Additive Noise

Robert Dalang, Fei Pu

We study the hitting probabilities of the solution to a system of d stochastic heat equations with additive noise subject to Dirichlet boundary conditions. We show that for any bounded Borel set with positive (d-6)\documentclass[12pt]{minimal} \usepackage{ ...

Springer/Plenum Publishers2024

Dynamical system approach to navigation around obstacles

Aude Billard, Aradhana Nayak

In this article, we propose a dynamical system to avoid obstacles which are star shaped and simultaneously converge to a goal. The convergence is almost-global in a domain and the stationary points are identified explicitly. Our approach is based on the id ...

2024

An objective skill assessment framework for microsurgical anastomosis based on ALI scores

Aude Billard, Kunpeng Yao, Soheil Gholami, Torstein Ragnar Meling, Anaëlle Olivia Marie Manon

IntroductionThe current assessment and standardization of microsurgical skills are subjective, posing challenges in reliable skill evaluation. We aim to address these limitations by developing a quantitative and objective framework for accurately assessing ...

Vienna2024

Reducing uncertainties in response predictions of earthquake-damaged masonry buildings using data from image-based inspection

Ian Smith, Katrin Beyer, Bryan German Pantoja Rosero, Mathias Christian Haindl Carvallo

Image information about the state of a building after an earthquake, which can be collected without endangering the post-earthquake reconnaissance activities, can be used to reduce uncertainties in response predictions for future seismic events. This paper ...

Springer2024

Thick points of the planar GFF are totally disconnected for all & gamma;=6 0*

Juhan Aru

We prove that the set of-y-thick points of a planar Gaussian free field (GFF) with Dirichlet boundary conditions is a.s. totally disconnected for all-y =6 0. Our proof relies on the coupling between a GFF and the nested CLE4. In particular, we show that th ...

INST MATHEMATICAL STATISTICS-IMS2023

The first Grushin eigenvalue on cartesian product domains

Joachim Stubbe, Luigi Provenzano, Paolo Luzzini

In this paper, we consider the first eigenvalue.1(O) of the Grushin operator.G :=.x1 + |x1|2s.x2 with Dirichlet boundary conditions on a bounded domain O of Rd = R d1+ d2. We prove that.1(O) admits a unique minimizer in the class of domains with prescribed ...

WALTER DE GRUYTER GMBH2023

Present design of the Steering Mirror Assembly (SMA) for ITER ECHUL

Timothy Goodman, René Chavan, Anastasia Xydou

In the ITER Tokamak, four Electron Cyclotron Heating Upper Launchers (ECHUL) are needed to control plasma instabilities at the rational surfaces, most importantly the q = 3/2 and q = 2/1 neoclassical tearing modes (NTMs). Each ECHUL is equipped with a set ...

ELSEVIER SCIENCE SA2023

State of the Art in Dense Monocular Non-Rigid 3D Reconstruction

Pascal Fua

3D reconstruction of deformable (or non-rigid) scenes from a set of monocular 2D image observations is a long-standing and actively researched area of computer vision and graphics. It is an ill-posed inverse problem, since-without additional prior assumpti ...

WILEY2023

Microstrip patch antennas with broad beamwidth

Ismael Vico Triviño

Microstrip antennas offer a broad set of advantages such as low profile, light weight, easy fabrication and low cost. As these are desirable or even critical for a broad range of applications, there has been a large interest for these antennas in the anten ...

EPFL2023

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.

Connectez-vous pour utiliser Chat avec Graph Search