Concept

Suite géométrique

Publications associées (39)

Divertor detachment and reattachment with mixed impurity seeding on ASDEX Upgrade

Using newly developed spectroscopic models to measure the divertor concentration of Ne and Ar, it is shown that the experimental detachment threshold on ASDEX Upgrade with Ar-only and mixtures of Ar+N or Ne+N scales as expected in comparison with an analyt ...

IOP Publishing Ltd2023

Rankin-Selberg coefficients in large arithmetic progressions

Philippe Michel, Yongxiao Lin

Let (?(f) (n))(n=1) be the Hecke eigenvalues of either a holomorphic Hecke eigencuspform or a Hecke-Maass cusp form f. We prove that, for any fixed ? > 0, under the Ramanujan-Petersson conjecture for GL(2) Maass forms, the Rankin-Selberg coefficients (?(f) ...

SCIENCE PRESS2023

Robots' Motion Planning in Human Crowds by Acceleration Obstacles

Aude Billard, Diego Felipe Paez Granados, David Julian Gonon

We study the Acceleration Obstacle (AO) as a concept to enable a robot's navigation in human crowds. The AO's geometric properties are analyzed and a direct sampling-free algorithm is proposed to approximate its boundary by linear constraints. The resultin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

From Trees to Barcodes and Back Again:A Combinatorial, Probabilistic and Geometric Study of a Topological Inverse Problem

Adélie Eliane Garin

In this thesis, we investigate the inverse problem of trees and barcodes from a combinatorial, geometric, probabilistic and statistical point of view.Computing the persistent homology of a merge tree yields a barcode B. Reconstructing a tree from B involve ...

EPFL2022

A decomposition of multicorrelation sequences for commuting transformations along primes

Florian Karl Richter

A decomposition of multicorrelation sequences for commuting transformations along primes, Discrete Analysis 2021:4, 27 pp. Szemerédi's theorem asserts that for every positive integer

k

and every

\delta>0

there exists

n

such that every subset of ${1, ...

2021

Wasserstein Adversarial Regularization for learning with label noise

Devis Tuia, Sylvain Lobry, Nicolas Courty

Noisy labels often occur in vision datasets, especially when they are obtained from crowdsourcing or Web scraping. We propose a new regularization method, which enables learning robust classifiers in presence of noisy data. To achieve this goal, we propose ...

2021

Rethinking protein aggregation and drug discovery in neurodegenerative diseases: Why we need to embrace complexity?

Hilal Lashuel

More than a century has passed since pathological protein aggregates were first identified in the brains of patients with neurodegenerative diseases (NDDs). Yet, we still do not have effective therapies to treat or slow the progression of these devastating ...

2021

On arithmetic progressions in symmetric sets in finite field model

Jan Hazla

We consider two problems regarding arithmetic progressions in symmetric sets in the finite field (product space) model. First, we show that a symmetric set S subset of Z(q)(n) containing vertical bar S vertical bar = mu . q(n) elements must contain at leas ...

ELECTRONIC JOURNAL OF COMBINATORICS2020

The Role of Reynolds Number Effect and Tip Leakage in Compressor Geometry Scaling at Low Turbulent Reynolds Numbers

Jürg Alexander Schiffmann, Markus Diehl, Christoph Schreiber

In compressor design, a convenient way to save time is to scale an existing geometry to required specifications, rather than developing a new design. The approach works well when scaling compressors of similar size at high Reynolds numbers but becomes more ...

2020

Analysis of volumetric mass transfer coefficient (k(L)a) in small- (250 mL) to large-scale (2500 L) orbitally shaken bioreactors

Florian Maria Wurm, David Hacker, Likuan Zhu

In this study, the combination of dimensional analysis (DA) and analysis of variance (ANOVA) was used to predict the volumetric mass transfer coefficient (k(L)a) values under different operating conditions for orbitally shaken bioreactors (OSRs) with diffe ...

SPRINGER HEIDELBERG2020

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