We explicitly model entanglement in quantum processes by treating entanglement as a kind of parallelism. We introduce a shadow constant quantum operation and a so-called entanglement merge into quantum process algebra qACP. The transition rules of the shadow constant quantum operation and entanglement merge are designed. We also do a sound and complete axiomatization modulo the so-called quantu...

Methodologies for modeling ramp driver acceleration-deceleration and gap acceptance behavior during freeway merge maneuvers are presented. This study serves an important purpose by pointing to the limitations of current freeway merge models which treat the ramp driver acceleration-deceleration and gap acceptance behavior as deterministic phenomena. In addition, the interdependence of freeway me...

This paper presents an unconventional approach for work-zone bottleneck traffic control through integrating the dynamic late merge with a merge metering via wireless communication at the downstream taper area of a work zone, termed as Dynamic Merge Metering Traffic Control System (DMM-Tracs). The architecture and communication system for the DMM-Tracs, including system components, communication...

Norris, McQueen & Cutler claim that all known speech recognition data can be accounted for with their autonomous model, “Merge.” But this claim is doubly misleading. (1) Although speech recognition is autonomous in their view, the Merge model is not. (2) The body of data which the Merge model accounts for, is not, in their view, speech recognition

How and why humans can create and understand an infinite number of novel sentence remains a linguistic mystery, especially given the number and diversity of languages. Despite the apparent complexity of the problem, Generative linguists claim that the answer can be reduced to a single, simply defined and simply implemented function, Merge (Chomsky, 1995). Merge takes two syntactic objects (e.g....

We explore theoretical foundations of the Merge operation. Merge functions as a kind of “recursive union” over similarly structured XML documents to produce a new XML document, and can be used for creating aggregates over streams of XML fragments. We describe the Merge operation and show that Merge is in fact the join operation of an upper semi-lattice of conformant documents. Our work relies o...

The k-merge problem, given a collection of k, (2 k n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is to propose simple and intuitive work-time optimal algorithms for the k-merge problem on two PRAM models. Specifically, our k-merge algorithms perform O(n log k) work and run in O(logn) time on the EREW-PRAM and in O(log l...

This paper considers the problem of reusing synchronization constraints for concurrent objects with asynchronous method calls. Our approach extends the Creol language with a specialized composition operator expressing synchronized merge. The use of synchronized merge allows synchronization classes to be added and combined with general purpose classes by means of multiple inheritance. The paper ...

This paper proposes a refinement of the PS-Merge merging operator, which is an alternative merging approach that employs the notion of partial satisfiability rather than the usual distance measures. Our approach will add to PS-Merge a mechanism to deal with a kind of priority based on the quantity of information of the agents. We will refer to the new operator as Pr-Merge. We will also analyze ...

Usually, segmentation algorithms implementing the split and merge operations are restricted to a split stage followed by a merge stage. In this paper, we present a new split and merge algorithm combining alternatively split and merge operations at each recursive step. This algorithm is based on a data structure encoding topological maps in a discrete plane. The topogical maps of an image are de...