Concept

Automate fini

Publications associées (214)

Faster correlation attack on Bluetooth keystream generator E0

We study both distinguishing and key-recovery attacks against E0, the keystream generator used in Bluetooth by means of correlation. First, a powerful computation method of correlations is formulated by a recursive expression, which makes it easier to calc ...

2004

Measures of Diversity for Populations and Distances Between Individuals with Highly Reorganizable Genomes

Dario Floreano, Claudio Mattiussi, Markus Waibel

In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolutionary process. To this end, we introduce a measure of diversity for populations ...

2004

Propriétés hors-équilibre d'une paroi adiabatique

Séverine Pache

We study the evolution of a system composed of N non-interacting particles of mass m distributed in a cylinder of length L. The cylinder is separated into two parts by an adiabatic piston of a mass M ≫ m. The length of the cylinder is a fix paramete ...

EPFL2004

On the exponential convergence of matching pursuits in quasi-incoherent dictionaries

Pierre Vandergheynst, Rémi Gribonval

The purpose of this paper is to extend results by Villemoes about exponential convergence of Matching Pursuit with some structured dictionaries for simple functions in finite or infinite dimension. Our results are based on an extension of Tropps results ...

2004

Towards Flexible Finite-State-Machine-Based Protocol Composition

André Schiper, Sergio Mena, Nils Richard Ekwall, Stefan Pleisch

We propose a novel approach to the composition of group communication protocols. In this approach, components are modelled as finite state machines communicating via signals. We introduce two building blocks, called adaptor and adaplexor, that ease the dev ...

2004

A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms

Felix Gaertner

Self-stabilizing systems can automatically recover from arbitrary state perturbations in finite time. They are therefore well-suited for dynamic, failure prone environments. Spanning-tree construction in distributed systems is a fundamental task which form ...

2003

Atomic Probabilistic Broadcast

Patrick Eugster

Many applications, such as the dissemination of stock quote events, require reliable and totally ordered delivery of broadcast messages to a large number of processes. Recently, gossip-based broadcast algorithms have been praised as an interesting alternat ...

2003

Replicated Invocation

André Schiper, Stefan Pleisch, Arnas Kupsys

In today's systems, application are composed from various components that may be located on different machines. The components may have to collaborate in order to service a client request. More specifically, a client request to one component may trigger a ...

2003

Finite element method analysis of the coupling effect between superconducting filaments of different aspect ratio

Francesco Grilli, Yong Yang, Bertrand Dutoit

Using 3D finite element method (FEM) modelling, the present work investigates the coupling effect between two finite superconductors through a resistive matrix. This effect, related to the finite length of the conductors, is typically three-dimensional and ...

2003

Mining Specifications

James Richard Larus

Program verification is a promising approach to improving program quality, because it can search all possible program executions for specific errors. However, the need to formally describe correct behavior or errors is a major barrier to the widespread ado ...

ACM2002

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