Concept

Index of dispersion

Publications associées (33)

Certification of Bottleneck Task Assignment With Shortest Path Criteria

Minimising the longest travel distance for a group of mobile robots with interchangeable goals requires knowledge of the shortest length paths between all robots and goal destinations. Determining the exact length of the shortest paths in an environment wi ...

2023

Wideband integrated bioaerosol sensor (WIBS) excited, fluorescent, and hyper-fluorescent particle number concentrations and normalized size distributions (dN/dlogDp) measured in the Swiss container during MOSAiC 2019/2020

Julia Schmale, Ivo Fabio Beck, Alireza Moallemi, Margarida Teles Nogueira Rolo

These datasets contain the total particle number concentrations and normalized size distributions (dN/dlogDp) of excited, fluorescent, and hyper-fluorescent particles of sizes 0.5 to 20 μm (optical diameter). The normalized size distribution datasets are s ...

EPFL Infoscience2023

Optimal Matching of Random Parts

Thomas Alois Weber

This paper examines the minimization of the cost for an expected random production output, given an assembly of finished goods from two random inputs, matched in two categories. We describe the optimal input portfolio, first using the standard normal appro ...

2022

Level statistics of the one-dimensional ionic Hubbard model

In this paper we analyze the spectral level statistics of the one-dimensional ionic Hubbard model, the Hubbard model with an alternating on-site potential. In particular, we focus on the statistics of the gap ratios between consecutive energy levels. This ...

2022

Sifting through the Noise: Universal First-Order Methods for Stochastic Variational Inequalities

Volkan Cevher, Kimon Antonakopoulos, Thomas Michaelsen Pethick, Ali Kavis

We examine a flexible algorithmic framework for solving monotone variational inequalities in the presence of randomness and uncertainty. The proposed template encompasses a wide range of popular first-order methods, including dual averaging, dual extrapola ...

2021

A Current Propagation Type Return Stroke Model Consistent with the Leader Charge Distribution

Marcos Rubinstein, Farhad Rachidi-Haeri

We describe a current propagation type return stroke model which is consistent with the estimated distribution of the charge on the leader channel. The model takes into account the dispersion of the return stroke current along the return stroke channel. Th ...

2021

Unbiased Monte Carlo cluster updates with autoregressive neural networks

Giuseppe Carleo, Riccardo Rossi, Dian Wu

Efficient sampling of complex high-dimensional probability distributions is a central task in computational science. Machine learning methods like autoregressive neural networks, used with Markov chain Monte Carlo sampling, provide good approximations to s ...

AMER PHYSICAL SOC2021

Theoretical minimum uncertainty of single-molecule localizations using a single-photon avalanche diode array

Edoardo Charbon, Claudio Bruschini, Paul Mos, Arin Can Ülkü, Daniel Fan

Single-photon avalanche diode (SPAD) arrays can be used for single-molecule localization microscopy (SMLM) because of their high frame rate and lack of readout noise. SPAD arrays have a binary frame output, which means photon arrivals should be described a ...

OPTICAL SOC AMER2021

Fast ion transport phenomena in turbulent toroidal plasmas

Fabian Manke

In the field of plasma physics, suprathermal ions are encountered e.g. in astrophysical jets, the solar wind, as well as fusion plasmas, where they originate from neutral beam injection or fusion reactions. One aspect of shared interest with astrophysical ...

EPFL2020

Risk assessment of pedestrian crossings: a stochastic video-based analysis

Adrien Nicolet

Although pedestrian crossings are supposed to guarantee safety, accidents are still frequent. Prior to implementing any measures to address this issue, the safety of the pedestrian crossing must be assessed. Various indices estimating the safety of pedestr ...

2020

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