Concept

Preuve de travail

Publications associées (118)

Full-wafer fabrication by nanostencil lithography of micro/nanomechanical mass sensors monolithically integrated with CMOS

Jürgen Brugger, Marc Antonius Friedrich van den Boogaart

Wafer-scale nanostencil lithography (nSL) is used to define several types of silicon mechanical resonators, whose dimensions range from 20 μm down to 200 nm, monolithically integrated with CMOS circuits. We demonstrate the simultaneous patterning by nSL of ...

2008

Strategy To Tether Organometallic Ruthenium-Arene Anticancer Compounds to Recombinant Human Serum Albumin

Paul Joseph Dyson, Wee Han Ang, Elisa Daldini

In order to utilize macromols. for drug targeting and delivery, a strategy to tether organometallic ruthenium-arene drugs to carrier protein mols. was developed. The approach involves the design of a drug fragment capable of conjugating to linker mols. on ...

2007

Model Checking of Consensus Algorithms

André Schiper

We show for the first time that standard model checking allows one to completely verify asynchronous algorithms for solving consensus, a fundamental problem in fault-tolerant distributed computing. Model checking is a powerful verification methodology base ...

2006

Short 2-Move Undeniable Signatures

Serge Vaudenay, Jean Monnerat

Attempting to reach a minimal number of moves in cryptographic protocols is a quite classical issue. Besides the theoretical interests, minimizing the number of moves can clearly facilitate practical implementations in environments with communication const ...

2006

The BCI Competition III: Validating Alternative Approaches to Actual BCI Problems

José del Rocio Millán Ruiz

A Brain-Computer Interface (BCI) is a system that allows its users to control external devices with brain activity. Although the proof-of-concept was given decades ago, the reliable translation of user intent into device control commands is still a major c ...

2006

Of Malicious Motes and Suspicious Sensors: On the Efficiency of Malicious Interference in Wireless Networks

Rachid Guerraoui, Seth Gilbert

How efficiently can a malicious device disrupt a single-hop wireless network? Imagine two honest players attempting to exchange information in the presence of a malicious adversary that can disrupt communication by jamming or overwriting messages. Assume t ...

2006

Average consensus problems in networks of agents with delayed communications

Giancarlo Ferrari Trecate

The present paper is devoted to the study of average consensus problems for undirected networks of dynamic agents having communication delays. The accent is put here on the study of the time-delays inﬂuence: both constant and time-varying delays are consid ...

2005

Average consensus problems in networks of agents with delayed communications

Giancarlo Ferrari Trecate

2005

Token-based Atomic Broadcast using Unreliable Failure Detectors

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, i.e., none ...

2004

Token-based Atomic Broadcast using Unreliable Failure Detectors

André Schiper, Nils Richard Ekwall

2004

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