Concept

Flow network

Related publications (26)

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

We develop an algorithm to solve the bottleneck assignment problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on one com ...

Ieee-Inst Electrical Electronics Engineers Inc2024

The Strong Integral Input-to-State Stability Property in Dynamical Flow Networks

Nils Gustav Nilsson

Dynamical flow networks serve as macroscopic models for, e.g., transportation networks, queuing networks, and distribution networks. While the flow dynamics in such networks follow the conservation of mass on the links, the outflow from each link is often ...

Ieee-Inst Electrical Electronics Engineers Inc2024

Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information

Isabel Haasler

Incidents where water networks are contaminated with microorganisms or pollutants can result in a large number of infected or ill persons, and it is therefore important to quickly detect, localize and estimate the spread and source of the contamination. In ...

Elsevier2023

Graph neural networks for dynamic modeling of roller bearings

Olga Fink, Vinay Sharma

Machine learning has paved the way for the real-time monitoring of complex infrastructure and industrial systems. However, purely data-driven methods have not been able to learn the underlying dynamics and generalize them to operating conditions that have ...

PHM Society2023

Discovering Influencers in Opinion Formation Over Social Graphs

Ali H. Sayed, Mert Kayaalp, Valentina Shumovskaia

The adaptive social learning paradigm helps model how networked agents are able to form opinions on a state of nature and track its drifts in a changing environment. In this framework, the agents repeatedly update their beliefs based on private observation ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

Efficient and Accurate Handling of Periodic Flows in Time-Sensitive Networks

Jean-Yves Le Boudec, Seyed Mohammadhossein Tabatabaee

Total Flow Analysis (TFA) is a method for the worst-case analysis of time-sensitive networks. It uses service curve characterizations of the network nodes and arrival curves of flows at their sources; for tractability, the latter are often taken to be line ...

2023

Flow Time Scheduling and Prefix Beck-Fiala

Ola Nils Anders Svensson, Lars Rohwedder

We relate discrepancy theory with the classic scheduling problems of minimizing max flow time and total flow time on unrelated machines. Specifically, we give a general reduction that allows us to transfer discrepancy bounds in the prefix Beck-Fiala (bound ...

ASSOC COMPUTING MACHINERY2022

CFD simulations of hydraulic short-circuits in junctions, application to the Grand’Maison power plant

François Avellan, Cécile Münch-Alligné

In the framework of the XFLEX HYDRO H2020 European Project, the pumped-storage power plant of Grand'Maison (France), owned by Electricité De France, focuses on the implementation of the hydraulic short-circuit (HSC) operating mode. This mode increases the ...

2022

WEBGRAPH: Capturing Advertising and Tracking Information Flows for Robust Blocking

Carmela González Troncoso, Sandra Deepthy Siby

Users rely on ad and tracker blocking tools to protect their privacy. Unfortunately, existing ad and tracker blocking tools are susceptible to mutable advertising and tracking content. In this paper, we first demonstrate that a state-of-the-art ad and trac ...

USENIX ASSOC2022

Large-scale traffic signal control and multimodal network design

Dimitrios Tsitsokas

Traffic congestion constitutes one of the most frequent, yet challenging, problems to address in the urban space. Caused by the concentration of population, whose mobility needs surpass the serving capacity of urban networks, congestion cannot be resolved ...

EPFL2022

Robust P2P Personalized Learning

Rachid Guerraoui

Decentralized machine learning over peer-to-peer networks is very appealing for it enables to learn personalized models without sharing users data, nor relying on any central server. Peers can improve upon their locally trained model across a network graph ...

IEEE2020

Memory Efficient Max Flow for Multi-Label Submodular MRFs

Mathieu Salzmann

Multi-label submodular Markov Random Fields (MRFs) have been shown to be solvable using max-flow based on an encoding of the labels proposed by Ishikawa, in which each variable X-i is represented by l nodes (where l is the number of labels) arranged in a c ...

2019

Numerical Approximation Of Orthogonal Maps

Marco Picasso, Alexandre Caboussat, Dimitrios Gourzoulidis

Orthogonal maps are the solutions of the mathematical model of paper-folding, also called the origami problem. They consist of a system of first-order fully nonlinear equations involving the gradient of the solution. The Dirichlet problem for orthogonal ma ...

2019

Weighted Matchings via Unweighted Augmentations

Ola Nils Anders Svensson, Slobodan Mitrovic, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Sagar Sudhir Kale

We design a generic method to reduce the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the massively pa ...

ASSOC COMPUTING MACHINERY2019

Extrapolating Paths with Graph Neural Networks

Andreas Loukas, Jean-Baptiste Francis Marie Juliette Cordonnier

We consider the problem of path inference: given a path prefix, i.e., a partially observed sequence of nodes in a graph, we want to predict which nodes are in the missing suffix. In particular, we focus on natural paths occurring as a by-product of the int ...

IJCAI, Inc.2019

Percolation and Internet Science

Emanuele Massaro

Percolation, in its most general interpretation, refers to the “flow” of something (a physical agent, data or information) in a network, possibly accompanied by some nonlinear dynamical processes on the network nodes (sometimes denoted reaction–diffusion s ...

2019

Traffic Receipts for Network Transparency

Pavlos Nikolopoulos

Today's Internet is not transparent: when packets get lost or delayed, there is typically no information about where the problem occurred, hence no information about who is responsible. This results in Internet service providers (ISPs) offering service lev ...

EPFL2018

Localizing the Source of an Epidemic Using Few Observations

Brunella Marta Spinelli

Localizing the source of an epidemic is a crucial task in many contexts, including the detection of malicious users in social networks and the identification of patient zeros of disease outbreaks. The difficulty of this task lies in the strict limitation ...

EPFL2018

GEOTEXTILE

Lyesse Laloui, Dimitrios Terzis

The present invention concerns a geosynthetic element (1) for a geotechnical engineering application. The geosynthetic element (1) comprises: bacteria carriers (3) for carrying bacteria arranged to be propagated from the geosynthetic element (1) to a surro ...

2018

New Algorithmic Paradigms for Discrete Problems using Dynamical Systems and Polynomials

Damian Mateusz Straszak

Optimization is a fundamental tool in modern science. Numerous important tasks in biology, economy, physics and computer science can be cast as optimization problems. Consider the example of machine learning: recent advances have shown that even the most s ...

EPFL2018

Related publications (26)