Publication

A dynamic network loading model for anisotropic and congested pedestrian flows

Publications associées (36)

Global, Passive Detection of Connection Tampering

Louis-Henri Manuel Jakob Merino

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...
New York2023

An automatized signal timing detection at signalized intersections with detailed vehicle trajectory data

Nikolaos Geroliminis, Emmanouil Barmpounakis, Jasso Espadaler Clapés

Signalized intersections are a fundamental part of urban networks. Their understanding is crucial to identify congestion patterns, queues, delays, and safety issues in local and network level. In this work, we analyze multimodal vehicle trajectories and pr ...
2022

The influence of trip length distribution on urban traffic in network-level models

Mikhail Murashkin

Modeling urban traffic on the level of network is a wide research area oriented to the development of ITS. In this thesis properties of models based on MFD (Macroscopic Fundamental Diagram) are studied. The idea behind MFD is to say that the state of the t ...
EPFL2021

Dynamic Quantification of the Effect of Traffic Congestion on a Multilayer Network

The paper “Dynamic efficiency in multilayer transportation networks” (Bellocchi, Geroliminis, 2018) [1] introduced new performance measures to quantify dynamically the effect of traffic congestion in a multilayer network. Based on these measures, we explor ...
2020

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

Risk Perception and Epidemics in Complex Computer Networks

Emanuele Massaro

We present a self-organised method for quickly obtaining the epidemic threshold of infective processes on networks. Starting from simple percolation models, we introduce the possibility that the effective infection probability is affected by the perception ...
IEEE2018

Synthesis of single and interplant non-isothermal water networks

François Maréchal, Maziar Kermani

This paper addresses the synthesis problem of non-isothermal water networks using a mathematical programming approach. A heat-integrated water network superstructure and its corresponding mixed integer nonlinear programming (MINLP) model is proposed for th ...
2017

Analytical transport network theory to guide the design of 3-D microstructural networks in energy materials: Part 1. Flow without reactions

Arata Nakajo

We present a fully analytical, heuristic model the "Analytical Transport Network Model" for steady-state, diffusive, potential flow through a 3-D network. Employing a combination of graph theory, linear algebra, and geometry, the model explicitly relates a ...
Elsevier Science Bv2017

On the Complexity of Scheduling in Half-Duplex Diamond Networks

Christina Fragouli, Ayfer Özgür Aydin, Siddhartha Brahma

We consider an n-relay Gaussian diamond network where a source communicates to a destination with the help of n half-duplex relays. Achieving rates close to the capacity of this network requires to employ all the n relays under an optimal transmit/receive ...
Ieee-Inst Electrical Electronics Engineers Inc2016

A dynamic network loading model for anisotropic and congested pedestrian flows

Michel Bierlaire, Marija Nikolic, Flurin Silvan Hänseler, Gael Lederrey

A macroscopic loading model for multi-directional, time-varying and congested pedestrian flows is proposed in this paper. Walkable space is represented by a network of streams that are each associated with an area in which they interact. To describe this i ...
2015

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.