Concept

Nonviolent Communication

Related publications (53)

Communication-based Leashing of Real Flying Robots

Dario Floreano, Jean-Christophe Zufferey, Sabine Hauert, Severin Leven

Aerial robots are often required to remain within the communication range of a base station on the ground to exchange commands, sensor data or as a safety mechanism. For this purpose, we propose a minimal control strategy for steering flying robots using o ...

2010

Expanding the Size of Organometallic Nanostructures: A Hexanuclear (Cymene)Ru Cylinder with a Length of more than 3 nm

Rosario Scopelliti, Kay Severin

Coordination cages based on organometallic half-sandwich complexes are of interest, because they can display unique structures and host properties. This communication describes the synthesis and structure of a cylindrical nanostructure containing six (p-cy ...

2009

Innovations Diffusion: A Spatial Sampling Scheme for Distributed Estimation and Detection

Ali H. Sayed

We consider a wireless network with distributed processing capabilities for estimation or detection applications. Due to limited communication resources, the network selects only a subset of sensor measurements for estimation or detection as long as the re ...

IEEE2009

Segregation in swarms of mobile robots based on the Brazil nut effect

Francesco Mondada, Stéphane Magnenat, Roderich Gross

We study a simple algorithm inspired by the Brazil nut effect for achieving segregation in a swarm of mobile robots. The algorithm lets each robot mimic a particle of a certain size and broadcast this information locally. The motion of each particle is con ...

IEEE Computer Society Press2009

Rethinking the Design of Distributed Stream Processing Systems

Karl Aberer, Ali Salehi

In this paper, we present a novel architecture to support large scale stream processing services in a widely distributed environment. The proposed system, COSMOS, distinguishes itself by its loose coupling and communication efficiency. To exploit the shari ...

IEEE Computer Society2008

Multiple Heterogeneous Ant Colonies with Information Exchange

Arash Arami, Bijan Rahimzadeh Rofoee

The method of multiple heterogeneous ant colonies with information exchange (MHACIE) is presented in this paper with emphasis on the speed of finding the optimal solution and the corresponding computational complexity. The proposed method which is inspired ...

2008

The Collective Memory of Amnesic Processes

Rachid Guerraoui, Bastian Pochon, James Pugh, Ron Levy

This paper considers the problem of robustly emulating a shared atomic memory over a distributed message passing system where processes can fail by crashing and possibly recover. We revisit the notion of atomicity in the crash-recovery context and introduc ...

2008

Modeling and validating the performance of atomic broadcast algorithms in high-latency networks

André Schiper, Nils Richard Ekwall

The performance of consensus and atomic broadcast algorithms using failure detectors is often affected by a trade-off between the number of communication steps and the number of messages needed to reach a decision. In this paper, we model the performance o ...

Springer2007

Gossiping in a Multi-Channel Radio Network (An Oblivious Approach to Coping With Malicious Interference)

Rachid Guerraoui, Seth Gilbert

We study oblivious deterministic gossip algorithms for multi-channel radio networks with a malicious adversary. In a multi-channel network, each of the n processes in the system must choose, in each round, one of the c channels of the system on which to pa ...

Springer2007

Broadcast, relay and feedback in Gaussian channels

Sibi Raj Bhaskaran Pillai

Network information theory explores the fundamental data transport limits over communication networks. Broadcasting and relaying are two natural models arising in communication contexts where multiple users share a common communication medium. Number of re ...

EPFL2007

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.