There are two traditional concurrency models among the source code management (SCM) systems: lock and merge models. The lock model prevents the concurrent modification on the same files, but the merge model allows the parallel editing, and performs a merge to reconcile the changes. A three-way merge engine is a usual part of SCM systems, some of them attempt to auto-merge the files, but sometim...

Merge trees are topological descriptors of scalar functions. They record how the subsets of the domain where the function value does not exceed a given threshold are connected. We define a distance between merge trees, called an interleaving distance, and prove the stability of these trees, with respect to this distance, to perturbations of the functions that define them. We show that the inter...

We deene a new language that naturally satisses the requirements of concurrency support, modularity, and declarativity. Although some classes of existing languages already cover a subset of this requirements , there is no example of a programming language entirely fullll-ing them. We propose to merge three programming paradigms, Multiple Tu-ple Spaces, Object Orientation, and Logic Programming,...

Our research is motivated by the ubiquitous availability of multiprocessor computers and the observation that available Web Ontology Language (OWL) reasoners only make use of a single processor. This becomes rather frustrating for users working in ontology development, especially if their ontologies are complex and require long processing times using these OWL reasoners. We present a novel algo...

the optimization model for evaluating regional and global effects of greenhouse gases reductionpolicies named merge is an actively usable tool for studying some aspects of the problem of climate change.it is first of all destined for the quantitative estimation of emission trajectories and results of applyingabatement measures. in the paper, the emphasis is on the adaptation of the integrated a...