Concept

Propriété

Publications associées (157)

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

CrystalBall: Predicting and Preventing Inconsistencies in Deployed Distributed Systems

Viktor Kuncak, Dejan Kostic, Maysam Yabandeh, Nikola Knezevic

We propose a new approach for developing and deploying distributed systems, in which nodes predict distributed consequences of their actions, and use this information to detect and avoid errors. Each node continuously runs a state exploration algorithm on ...

2008

Property (T) and rigidity for actions on Banach spaces

Nicolas Monod

We study property (T) and the fixed point property for actions on Lp and other Banach spaces. We show that property (T) holds when L2 is replaced by Lp (and even a subspace/quotient of Lp), and that in fact it is independent of 1 ≤ p < ∞. We show that the ...

2007

Amnesic Distributed Storage

Rachid Guerraoui

Distributed storage algorithms implement the abstraction of a shared register over distributed base objects. We study a specific class of storage algorithms, which we call amnesic: these have the pragmatic property that old values written in the implemente ...

2007

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007

Logical concepts in cryptography

Simon Kramer

This thesis is about a breadth-first exploration of logical concepts in cryptography and their linguistic abstraction and model-theoretic combination in a comprehensive logical system, called CPL (for Cryptographic Protocol Logic). We focus on two fundamen ...

EPFL2007

Boundedly generated groups with pseudocharacter(s)

Nicolas Monod

A note presenting the first examples of groups that are boundedly generated, have property (T) and have a one-dimensional space of pseudocharacters. ...

2006

Study and optimization of a linear piezoelectric actuator

Léon Alexandre Berger

Miniswys motor (property of Miniswys SA) is a piezoelectric, ultrasonic, linear motor intended to be integrated in an optical system for mobile phones. With the aim of continually optimizing their product, Miniswys SA has signed a collaboration agreement w ...

2006

The surface Laplacian operator of the potentials on a bounded volume conductor has a unique inverse

In the discussion on the use of the surface Laplacian (SL) of the distribution of bioelectric potentials on the body surface, the question remained open whether a complete specification of the SL of the potential over the surface bounding a volume conducto ...

2006

SMIL to MPEG-4 BIFS Conversion

Marco Mattavelli, Beilu Shao, Nicolas Scaringella, Neha Singh

Traditional media, such as text, image, audio and video, have long been the main media resources and granted full support of standard desktop tools and applications. Interactive rich multimedia documents, adding resources such as video or synthetic animati ...

IEEE Computer Society Press2006

Exploring eGovernance of the network industries

Matthias Finger, Pierre Rossel

Since the 1980s the network industries (post, telecom, electricity, air and rail transport, and water) worldwide are undergoing substantial transformations. These transformations have been triggered by institutional changes in both property regimes and coo ...

2006

From Liveness to Promptness

Liveness temporal properties state that something

good'' eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bound on the

wait time'' for an eventually to be fulfilled. That is,

F\theta

...

2007