Publications de Patrick Thiran

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.

Preface Analyzing and representing multidimensional quantitative and qualitative data: Demographic study of the Rhône valley. The domestic consumption of the Canadian families Value Maps: Finding Value in Markets that are Expensive Data Mining and Knowledge Discovery with Emergent Self-Organizing Feature Maps for Multivariate Time Series From Aggregation Operators to Soft Learning Vector Quantization and Clustering Algorithms Active Learning in Self-Organizing Maps Point Prototype Generation and Class

A single failure in a communication network may trigger many alarms. When the communication network uses optical fibres as transmission medium and increases its capacity by using Wavelength Division Multiplexing (WDM), the number of alarms and the difficulty to locate the failure are considerably higher. In this case, a single failure may interrupt several channels which causes a large information loss. We propose an Alarm Filtering Algorithm (AFA) for the fault management of an optical network that support

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that randomly scattered nodes can achieve, with high probability, the ...

Inferring the source of a diffusion in a large network of agents is a difficult but feasible task, if a few agents act as sensors revealing the time at which they got hit by the diffusion. One of the main limitations of current source identification algori ...

We study an approach to quality-of-service (QoS) that offers end-users the choice between two service classes defined according to their level of transmission protection. The fully protected (FP) class offers end-users a guarantee of survivability in the case of a single-link; all FP traffic is protected using a 1:1 protection scheme at the WDM layer. The second class of service, called Best-Effort Protected (BEP), is not protected; instead restoration at the IP layer is provided. The FP service class mimic

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum tolerable delay d and maximum buffer size q, the optimal regulator that generates the output traffic conforming to a subadditive envelope f and minimizes the number of discarded packets is a concatenation of the g-clipper with g(t) = min[f(t+d), f(t)+q] and

Most users of online services have unique behavioral or usage patterns. These behavioral patterns can be used to identify and track users by using only the observed patterns in the behavior. We study the task of identifying users from statistics of their behavioral patterns. Specifically, we focus on the setting in which we are given histograms of users’ data collected in two different experiments. In the first dataset, we assume that the users’ identities are anonymized or hidden and in the second dataset

Systems-on-Chip (SoC) design involves several challenges, stemming from the extreme miniaturization of the physical features and from the large number of devices and wires on a chip. Since most SoCs are used within embedded systems, specific concerns are i ...

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Failure location in transparent optical networks is difficult because of the large amount of alarms that a failure can trigger and because of corrupted alarms. One problem that network operators often face is how to set the thresholds in monitoring devices. Setting the thresholds low results in false alarms, whereas setting them high presents the risk of missing a significant degradation in network performance because of missing alarms. In this work, we study the time complexity of the failure location prob

It has recently been shown that flexible channelization, whereby wireless stations adapt their spectrum bands on a per-frame basis, is feasible in practice. In this paper, we propose TF-CSMA/CA, an algorithm for flexible channelization that schedules packe ...

We propose an Alarm Filtering Algorithm (AFA) for the fault management of an optical network that supports multiple failures and works in the presence of passive elements, that is, network elements which may fail but never generate an alarm (e.g. optical fibres). The algorithm provides a list of components whose failure explain the observed alarms. It avoids the use of failure probabilities, which are difficult to estimate, and does not need a global knowledge of the network topology. Moreover it also toler

Several technologies, such as WiFi, Ethernet and power-line communications (PLC), can be used to build residential and enterprise networks. These technologies often co-exist; most networks use WiFi, and buildings are readily equipped with electrical wires ...

Wireless multi-hop local area networks use in general scheduling schemes that assume the network capacity to be known. Indeed in most of the throughput-optimal algorithms the sources are assumed to send at a rate within the capacity region. However, measur ...

We study the problem of identifying the source of a stochastic diffusion process spreading on a graph based on the arrival times of the diffusion at a few queried nodes. In a graph

G=(V,E)

, an unknown source node

v^* \in V

is drawn uniformly at random, ...

We characterize the fairness of decentralized medium access control protocols based on CSMA/CA, such as IEEE 802.11, in large multi-hop wireless networks. In particular, we show that the widely observed unfairness of the protocol in small network topologie ...

Identifying causal effects is a key problem of interest across many disciplines. The two long-standing approaches to estimate causal effects are observational and experimental (randomized) studies. Observational studies can suffer from unmeasured confounding, which may render the causal effects unidentifiable. On the other hand, direct experiments on the target variable may be too costly or even infeasible to conduct. A middle ground between these two approaches is to estimate the causal effect of interest

The throughput of wireless networks is known to scale poorly when the number of users grows. The rate at which an arbitrary pair of nodes can communicate must decrease to zero as the number of users tends to infinity, under various assumptions. One of them is the requirement that the network is fully connected: the computed rate must hold for any pair of nodes of the network. We show that this requirement can be responsible for the lack of throughput scalability. We consider a two-dimensional network of ext

Patrick Thiran

Chattez avec Graph Search

Kohonen Self-Organizing Map with quantized weights

Fault Localization at the WDM layer

Fault Localization at the WDM Layer

Closing the gap in the capacity of random wireless networks via percolation theory

Source identification via contact tracing in the presence of asymptomatic patients

Controlled Use of Excess Backbone Bandwidth for Providing New Services in IP-Over-WDM Networks

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Where You Are is Who You Are: User Identification by Matching Statistics

On the throughput scaling of wireless relay networks

A Robust Self-calibrating Transmission Scheme for On-Chip Networks

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Failure Location in Transparent Optical Networks: The Asymmetry Between False and Missing Alarms

CSMA/CA in Time and Frequency Domains

Fault Localization at the WDM Layer

EMPoWER Hybrid Networks: Exploiting Multiple Paths over Wireless and ElectRical Mediums

Wireless Multi-hop Networks Beyond Capacity

The power of adaptivity in source identification with time queries on the path

On the Fairness of Large CSMA Networks

Fast Proxy Experiment Design for Causal Effect Identification

Information theoretic bounds on the throughput scaling of wireless relay networks