Guha Balakrishnan, Mandy Korpusik, Amy Ousterhout May 11, 2014

Software usually exists in multiple versions. All these versions must evolve in parallel. We propose a programmerging system that helps the programmer to manage the evolution of all the versions, which is much needed in software development and maintenance environments. The system can either combine two programs together or it can combine changes to a base program together. The system consists ...

We present an in-memory, cross-platform, parallel reasoner for RDFS and RDFSPlus . Inferray uses carefully optimized hash-based join and sorting algorithms to perform parallel materialization. Designed to take advantage of the architecture of modern CPUs, Inferray exhibits a very good uses of cache and memory bandwidth. It offers state-of-theart performance on RDFS materialization, outperforms ...

This paper presents a model for controlling the evolution of documents concurrently developed by teams of authors. Optimistic check-out of revisions and alternatives, and hierarchic merge making use of default rules is presented. In particular the different situations occurring during a merge of parallel development lines and the benefit of storing the full evolution history is discussed.

The National Centre of Competence in Research on Climate aims at exploring the predictability, variability and risk of climate change. PSI is involved in this programme, using Integrated Assessment Models (IAM) to simulate policies for climate change mitigation under uncertainty. We report here selected results of the MERGE-(ETL) model with endogenous technological learning (ETL). The study pre...

Urge to merge erects filopodia rawling cells often produce both broad, flat lamellipodia and long, thin filopodia. Once formed, both structures appear to use an actin-treadmilling mechanism to extend themselves. During treadmilling, lamellipodia continuously nucleate new filaments, but filopodia continue to use the same filaments. So how does a cell form a filopodium in the first place? Svitkin...

It has been widely observed that different NLP applications require different sense granularities in order to best exploit word sense distinctions, and that for many applications WordNet senses are too fine-grained. In contrast to previously proposed automatic methods for sense clustering, we formulate sense merging as a supervised learning problem, exploiting human-labeled sense clusterings as...

We prove that general merge-and-shrink representations are strictly more powerful than linear ones by showing that there exist problem families that can be represented compactly with general merge-and-shrink representations but not with linear ones. We also give a precise bound that quantifies the necessary blowup incurred by conversions from general merge-and-shrink representations to linear r...