Concept

Communication non violente

Publications associées (53)

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

Modelling and refining site-specific radiation damage in SAD/MAD phasing

Site-specific radiation damage on anomalously scattering sites can be used to generate additional phase information in standard single- or multi-wavelength anomalous diffraction (SAD or MAD) experiments. In this approach the data are kept unmerged, down to ...

2007

Fragmented Membrane MEM Bulk Lateral Resonators with nano-gaps on 1.5 mu m SOI

Mihai Adrian Ionescu, Daniel Grogg, Marco Mazza, Nicoleta-Diana Ciressan

The design, fabrication and experimental investigation of 21MHz MEM Bulk Lateral Resonators (BLR) on 1.5 mu m Silicon-On-Insulator (SOI) Fragmented Membranes with 100nm air-gaps are reported(#). Quality factors as high as 33'000 are measured under vacuum a ...

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

A Spatial Sampling Scheme Based on Innovations Diffusion in Sensor Networks

Ali H. Sayed

This paper considers an estimation network of many distributed sensors with a certain correlation structure. Due to limited communication resources, the network selects only a subset of sensor measurements for estimation as long as the resulting fidelity i ...

IEEE2007

Considerations on the design of cut-and-cover tunnels

Aurelio Muttoni, Laurent Vulliet, Vincent Labiouse, Sylvain Plumey

The communication shows an alternative for introducing soil-structure interaction in the analysis of cut-and-cover tunnels. An uncoupled method is illustrated through two examples representative of the situations found in practice. The main features of eac ...

ELU-ULS 2006 - Symposium international sur les états limites ultimes des ouvrages géotechniques2006

Improving Fast Paxos: being optimistic with no overhead

André Schiper

The paper addresses the cost of consensus algorithms. It has been shown that in the best case, consensus can be solved in two communication steps with f < n/2, and in one communication step with f < n/3 (f is the maximum number of faulty processes). This l ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

The paper presents a primary-backup protocol to manage replicated in-memory database systems (IMDBs). The protocol exploits two features of IMDBs: coarse-grain concurrency control and deferred disk writes. Primary crashes are quickly detected by backups an ...

2006

A Primary-Backup Protocol for In-Memory Database Replication

Rodrigo Malta Schmidt, Fernando Pedone

2006

Comparing Atomic Broadcast Algorithms in High Latency Networks

André Schiper, Nils Richard Ekwall

Since the introduction of the concept of failure detectors, several consensus and atomic broadcast algorithms based on these detectors have been published. The performance of these algorithms is often affected by a trade-off between the number of communica ...

2006

Optimistic Algorithms for Partial Database Replication

Nicolas Schiper, Rodrigo Malta Schmidt, Fernando Pedone

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which req ...

2006

Multicoordinated Paxos

Rodrigo Malta Schmidt, Fernando Pedone

Classic Paxos is a round-based distributed consensus algorithm. Normally, proposals are sent to the round leader and decided in two communication steps more. Fast Paxos extends Classic Paxos by allowing also fast rounds, in which a decision can be learned ...

2006