Concept

Plus petit commun multiple

Publications associées (39)

An Algorithm for Odor Source Localization based on Source Term Estimation

Alcherio Martinoli, Ali Marjovi, Faezeh Rahbar

Finding sources of airborne chemicals with mobile sensing systems finds applications across the security, safety, domestic, medical, and environmental domains. In this paper, we present an algorithm based on source term estimation for odor source localizat ...

IEEE2019

Many touchings force many crossings

János Pach

Given n continuous open curves in the plane, we say that a pair is touching if they have finitely many interior points in common and at these points the first curve does not get from one side of the second curve to its other side. Otherwise, if the two cur ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Role of higher order plasmonic modes in one-dimensional nanogratings

Ershad Mohammadi, Foziyeh Sohrabi

By theoretically investigating the optical behavior of one-dimensional gold nanogratings using Fourier Modal Method, we have shown that both integer and non-integer multiples of surface plasmon polariton wavelengths should be taken into consideration in sp ...

SPRINGER2019

No Evidence for a Common Factor Underlying Visual Abilities in Healthy Older People

Michael Herzog, Aline Françoise Cretenoud, Aaron Michael Clarke

The world's population is aging at an increasing rate. Even in the absence of neurodegenerative disorders, healthy aging affects perception and cognition. In the context of cognition, common factors are well established. Much less is known about common fac ...

AMER PSYCHOLOGICAL ASSOC2019

Factors underlying visual illusions are illusion-specific but not feature-specific

Michael Herzog, Aline Françoise Cretenoud, Gregory Francis, Lukasz Grzeczkowski

Common factors are ubiquitous. For example, there is a common factor, g, for intelligence. In vision, there is much weaker evidence for such common factors. For example, visual illusion magnitudes correlate only weakly with each other. Here, we investigate ...

2019

Design and Performance Evaluation of an Infotaxis-Based Three-Dimensional Algorithm for Odor Source Localization

Alcherio Martinoli, Ali Marjovi, Faezeh Rahbar, Julian Ruddick

In this paper we tackle the problem of finding the source of a gaseous leak with a robot in a three-dimensional (3-D) physical space. The proposed method extends the operational range of the probabilistic Infotaxis algorithm [1] into 3-D and makes multiple ...

IEEE2018

About specific and general factors for visual illusions

Michael Herzog, Aline Françoise Cretenoud, Gregory Francis, Lukasz Grzeczkowski

Contrary to studies of audition and cognition, we previously did not find evidence for a general common factor for vision but for many very specific ones. For example, we found strong correlations between 19 versions of the Ebbinghaus illusion, which diffe ...

2018

How many factors are there in vision?

Michael Herzog, Aline Françoise Cretenoud, Gregory Francis, Lukasz Grzeczkowski

Common factors are ubiquitous in cognition, audition, and somato-sensation. Surprisingly, there seems to be no common factor in vision, i.e., visual tasks correlate very weakly with each other. Here, we show that there are likely many very specific factors ...

2017

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

Early-stage decision making approach for the selection of optimally integrated biorefinery processes

François Maréchal, Adriano Viana Ensinas, Shivom Sharma, Ayse Dilan Celebi

Lignocellulosic biorefineries are the best non-petroleum alternatives for a sustainable development. In the biorefinery process design, it is important to implement an algorithm that allows systematic generation, evaluation of energy conversion chains and ...

2017

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