On Poset Merging∗

A Data Structure for Content-based Routing

In this paper, we formally define a useful data structure for content-based routing and event delivery. The poset (partially ordered set)-derived forest data structure is induced by the partial order created by the covering relation between event filters. Two extensions of the basic data structure are discussed: colored forests and the weakly merging forest. We give performance figures for the ...

Effect of Merging Angle on Turbulent Mixing Layers

Using Order in Distributed Computing

We survey applications of the theory of partial orders to distributed computing. A distributed computation is a poset on the set of events based on the observable happened-before relation. Online chain decomposition of posets has applications in timestamping events with vectors such that the vectors preserve the partial order. The lower bounds on the dimension of these vectors use the dimension...

Map-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots

In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...

An analysis of merging effects on academic culture

Since the merging of organizations and institutions has undeniable effects on them, and appropriate action is needed in this regard. The present research selected the merging of Shahid-Abbaspour University in Shahid-Beheshti University as a case study to identify the effects of this action. This study, in terms of purpose and method, is applied and descriptive-survey, respectively.  The general...