Concept

Repère log-log

Publications associées (18)

The hunt for the Karman 'constant' revisited

The log law of the wall, joining the inner, near-wall mean velocity profile (MVP) in wall-bounded turbulent flows to the outer region, has been a permanent fixture of turbulence research for over hundred years, but there is still no general agreement on th ...

CAMBRIDGE UNIV PRESS2023

Influence of the shear stress on fine sediment exchanges with the substrate using UVP measurements

Giovanni De Cesare, Romain Maxime Dubuis

The dynamic of fine sediment in rivers is closely related to the interactions between fine particles, the riverbed and the flow conditions. The accumulation of fine sediment in the riverbed reduces vertical water exchanges and can have detrimental effects ...

2023

Positivity Of The Cm Line Bundle For K-Stable Log Fanos

We prove the bigness of the Chow-Mumford line bundle associated to a Q-Gorenstein family of log Fano varieties of maximal variation with uniformly K-stable general geometric fibers. This result generalizes a theorem of Codogni and Patakfalvi to the logarit ...

2022

PoGaIN: Poisson-Gaussian Image Noise Modeling From Paired Samples

Sabine Süsstrunk, Majed El Helou, Kaan Okumus

Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here, we study the case when paired noisy and noise-free samples are accessible. N ...

2022

Reconstructing the base field from imaginary multiplicative chaos

Juhan Aru, Janne Matias Junnila

We show that the imaginary multiplicative chaos exp(i beta Gamma) determines the gradient of the underlying field Gamma for all log-correlated Gaussian fields with covariance of the form -log|x-y|+g(x,y) with mild regularity conditions on g, for all d >= 2 ...

WILEY2021

Partition and Code: learning how to compress graphs

Michael Bronstein, Andreas Loukas, Nikolaos Karalias, Georgios Bouritsas

Can we use machine learning to compress graph data? The absence of ordering in graphs poses a significant challenge to conventional compression algorithms, limiting their attainable gains as well as their ability to discover relevant patterns. On the other ...

2021

A model of urban scaling laws based on distance dependent interactions

João Vitor Meirelles de Miranda

Socio-economic related properties of a city grow faster than a linear relationship with the population, in a log–log plot, the so-called superlinear scaling. Conversely, the larger a city, the more efficient it is in the use of its infrastructure, leading ...

2017

Revisiting the Generality of the Rank-based Human Mobility Model

Daniel Gatica-Perez, Darshan Santani

Location-based social networks, in addition to revealing users' online social network, also informs users' actual movements in the offline physical world. Due to this, they have recently been used in large-scale mobility and urban studies. In this paper, u ...

2013

Scaling body size fluctuations

Andrea Rinaldo, Andrea Giometto, Francesco Carrara, Amos Maritan, Florian Altermatt

The size of an organism matters for its metabolic, growth, mortality, and other vital rates. Scale-free community size spectra (i.e., size distributions regardless of species) are routinely observed in natural ecosystems and are the product of intra- and i ...

National Academy of Sciences2013

A new boundary condition for large-eddy simulation of boundary-layer flow over surface roughness transitions

Fernando Porté Agel, Mahdi Abkar

Large-eddy simulations are performed to evaluate the performance of the surface boundary condition downwind of a rough-to-smooth surface transition. Two types of boundary conditions are tested: (1) The standard formulation based on local application of the ...

Taylor & Francis2012

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