Optimistic synchronization is a method of synchronizing parallel and distributed computations without the use of blocking. When non-optimistic systems would block, optimistic synchronization mechanisms permit operations to go ahead. If such optimism causes improper synchronization, the mis-synchronized work is undone and the entire system restored to a consistent state. This paper discusses the...

A collaborative object represents a data type (such as a text document) designed to be shared by a group of dispersed users. The Operational Transformation (OT) is a coordination approach used for supporting optimistic replication for these objects. It allows the users to concurrently update the shared data and exchange their updates in any order since the convergence of all replicas, i.e. the ...

optimistic replicltion is m imparrrnt technique for achieving high avdability in distributed file systans. A key problem m optimistic rephtim is using d c b w l e d g e of objects to resolve co"mt updates from multiple partitions. In this paper, we describe how the Coda File System resolves pllrtitionsd updareg to updates is a simple yet efficient and powerful teclmique for directory resolution...

Optimistic replication is often viewed as essential for large scale systems and for supporting mobile computing. In optimistic replication, updates can be made concurrently to diierent le replicas, resulting in multiple versions of the le. To recover from these connicting updates, after-the fact connict resolution actions are required to recombine multiple versions into one. This paper deenes t...

Hairy cell leukemia (HCL), comprising 2% of all leukemias, is a chronic disorder characterized by mononuclear cells with prominent cytoplasmic projections. For years, patients with HCL underwent splenectomies and then interferon alpha for treatment, which provided high response rates but low percentages of complete remission. More recent treatments with 2-chlorodeoxyadenosine result in 85%-90% ...

We consider extending the AIXI agent by using multiple (or even a compact class of) priors. This has the benefit of weakening the conditions on the true environment that we need to prove asymptotic optimality. Furthermore, it decreases the arbitrariness of picking the prior or reference machine. We connect this to removing symmetry between accepting and rejecting bets in the rationality axiomat...