P2P architecture appears to fit for enterprise backup. In contrast to dedicated backup servers, nowadays a standard solution, making backups directly on organization’s workstations should be cheaper (as existing hardware is used) and more efficient (as there is no single bottleneck server). However, non-dedicated machines cause other challenges. Update propagation algorithms must take into acco...

The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the entire network G(V; E) to participate in each pulse of the synchronization process. As a result, the communication overhead of existing synchro-niz...

This report is the outcome of a review of community surveys, media articles and research literature relating to the links between intensification and social issues, both in New Zealand and internationally. The project is part of the Auckland Sustainable Cities Programme (Urban Form Design and Development work strand) which is a partnership between central government and local authorities. To re...

In this paper we propose an overview of a project aiming at building an audio-visual laughter synthesis system. The same approach is followed for acoustic and visual synthesis. First a database has been built to have synchronous audio and 3D visual landmarks tracking data. Then this data has been used to build HMM models of acoustic laughter and visual laughter separately. Visual laughter model...

r esum e. Le d eveloppement des langages orient es objets concurrents a souuert de l'ab-sence d'un support formel f ed erateur d edi e a la d eenition de leur s emantique. C'est une des raisons pour lesquelles nous essayons de trouver une fondation s emantique minimale pour d eenir les abstractions des langages orient es objets. Nous avons montr e pr ec edemment l'int er^ et du-calcul a cet ega...

The problem of synchronizing a network of identical processors that work synchronously at discrete steps is studied. Processors are arranged as an array of m rows and n columns and can exchange each other only one bit of information. We give algorithms which synchronize square arrays of (n n) processors and give some general constructions to synchronize arrays of (m n) processors. Algorithms ar...