Publications associées à Frequency of exceedance

Catchment drainage network scaling laws found experimentally in overland flow morphologies

David Andrew Barry, Andrea Rinaldo, Paolo Perona, Mohsen Cheraghi

The scaling relation between the drainage area and stream length (Hack’s law), along with exceedance probabilities of drainage area, discharge and upstream flow network length are well known for channelized fluvial regions. We report here on a laboratory e ...

2018

Robust Bounds In Multivariate Extremes

Sebastian Engelke

Extreme value theory provides an asymptotically justified framework for estimation of exceedance probabilities in regions where few or no observations are available. For multivariate tail estimation, the strength of extremal dependence is crucial and it is ...

Institute of Mathematical Statistics2017

Scaling Characteristics of Rill Networks

David Andrew Barry, Seifeddine Jomaa, Mohsen Cheraghi

Sediment transport in overland flow interacts dynamically with the soil surface morphology, which is often assumed to be static. This assumption, although it limits the predictive capacity of models, is reasonable since the morphological evolution is diffi ...

2015

Modeling of facade leaching in urban catchments

David Andrew Barry, Luca Rossi, Sylvain Coutu, Dario Del Giudice

Building facades are protected from microbial attack by incorporation of biocides within them. Flow over facades leaches these biocides and transports them to the urban environment. A parsimonious water quantity/quality model applicable for engineered urba ...

American Geophysical Union2012

Considerations on rockfall hazard mapping based on trajectory modelling

Vincent Labiouse, Jacopo Maria Abbruzzese, Claire Sauthier

The paper presents first considerations about methodologies for local hazard mapping related to rockfalls. This work is being currently carried out at the Swiss Federal Institute of Technology of Lausanne (EPFL), and it concerns the ESR8 research position ...

2008

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.

Frequency of exceedance

Graph Chatbot

Chattez avec Graph Search