Concept

Authentification unique

Publications associées (24)

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

Hydrologic controls on basin- scale distribution of benthic invertebrates

Andrea Rinaldo, Tom Ian Battin, Enrico Bertuzzo, Serena Ceola

Streamflow variability is a major determinant of basin-scale distributions of benthic invertebrates. Here we present a novel procedure based on a probabilistic approach aiming at a spatially explicit quantitative assessment of benthic invertebrate abundanc ...

American Geophysical Union2014

Modeling of Inductive Contactless Energy Transfer Systems

Pascal Meyer

In the domain of electronic devices and especially desktop peripherals, there is an industrial trend which consists in removing the cables that pollute our domestic and professional environments. In this sense, wireless communication protocols are already ...

EPFL2012

The Inconvenient Truth about Web Certificates

Jean-Pierre Hubaux, Julien Freudiger, Nevena Vratonjic, Vincent Bindschaedler

HTTPS is the de facto standard for securing Internet communications. Although it is widely deployed, the security provided with HTTPS in practice is dubious. HTTPS may fail to provide security for multiple reasons, mostly due to certificate-based authentic ...

2011

A Fault-Tolerant Token-Based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last 20 years. Token-based algorithms represent a large class of these algorithms. Interestingly, all the token-based atomic broadcast algorithms rely on a group membership service and none of the ...

2011

Implementation of a reconfigurable parasitic antenna for beam-space BPSK transmissions

Julien Perruisseau-Carrier

A successful approach for designing a compact reconfigurable antenna system using a single active and two parasitic reactance-loaded dipoles is proposed. The switched parasitic antenna (SPA) operates at 2.6 GHz using PIN diode technology. It is designed to ...

2010

Trustful Cumulus Clouds

Rachid Guerraoui, Maysam Yabandeh

Cloud computing offers an appealing business model and it is tempting for companies to delegate their IT services to the cloud. Yet, a company might ﬁnd it risky to do so for sensible services and to depend entirely on a single provider, which can be vulne ...

2010

A Fault-Tolerant Token based Atomic Broadcast Algorithm

André Schiper, Nils Richard Ekwall

Many atomic broadcast algorithms have been published in the last twenty years. Token based algorithms represent a large class of these algorithms. Interestingly, all the token based atomic broadcast algorithms rely on a group membership service and none of ...

2010

Approximation for Problems in Multi-User Information Theory

Soheil Mohajerzefreh

The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...

EPFL2010

On Cooperative Wireless Network Secrecy

Emre Telatar, Suhas Diggavi, Etienne Perron

Given that wireless communication occurs in a shared and inherently broadcast medium, the transmissions are vulnerable to undesired eavesdropping. This occurs even when a point-to-point communication is sought, and hence a fundamental question is whether w ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2009

Multiuser successive refinement and multiple description coding

Suhas Diggavi, Jun Chen

In this correspondence, we consider the multiuser successive refinement (MSR) problem, where the users are connected to a central server via links with different noiseless capacities, and each user wishes to reconstruct in a successive-refinement fashion. ...

2008