Method, apparatus and computer program product for locating a source of diffusion in a network
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
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 ...
This research focuses on emerging technologies in the European air traffic management (ATM), specifically investigating technology adoption by the main stakeholders. The European ATM consists of a highly fragmented aviation infrastructure, built and manage ...
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 ...
Human voluntary movement stems from the coordinated activations in space and time of many musculoskeletal segments. However, the current methodological approaches to study human movement are still limited to the evaluation of the synergies among a few body ...
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 ...
Braided rivers form some of the most fascinating fluvial patterns found on Earth. They are identifiable by their unique morphology of complex networks of intertwined channels that spread across wide floodplains. Detailed knowledge of their dynamics is need ...
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 ...
A macroscopic loading model for multi-directional, time-varying and congested pedestrian flows is proposed. Walkable space is represented by a network of streams that are each associated with an area in which they interact. To describe this interaction, a ...
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 ...
Based on the recent compute-and-forward technique [1], a novel communication strategy is proposed under which functions of the channel state information are forwarded along the network. Those functions are chosen such that on the one hand, they can be effi ...
