In this paper we address the problem of merging qualitative constraints networks (QCNs). We propose a rational merging procedure for QCNs. It is based on translations of QCNs into propositional formulas, and take advantage of propositional merging operators.

Rao and Georgeff’s BDICTL logic is a popular specification and verification language for cognitive agent systems, in which desires and goals are unified into a single motivational attitude. In this paper desires and goals are distinguished to specify the merging of desires into goals, an important process in several agent systems such as Broersen et al.’s BOID system. We therefore introduce a B...

VC merging allows many routes to be mapped to the same VC label, thereby providing a scalable mapping method that can support thousands of edge routers. VC merging requires reassembly buffers so that cells belonging to different packets intended for the same destination do not interleave with each other. This document investigates the impact of VC merging on the additional buffer required for t...

VC merging allows many routes to be mapped to the same VC label, thereby providing a scalable mapping method that can support thousands of edge routers. VC merging requires reassembly buffers so that cells belonging to different packets intended for the same destination do not interleave with each other. This document investigates the impact of VC merging on the additional buffer required for t...

This paper deals with "on the fly" segmentation on sliding images. We describe a quality control industrial application for which that type of image analysis is an elegant solution. Local and global merging techniques on the region adjacency graph are discussed. Only local merging allows us to process an uncompletely known graph. Global merging on the entire graph and "on the fly" local merging...

Region merging methods consist of improving an initial segmentation by merging some pairs of neighboring regions. In a graph, merging two regions is not straightforward. The perfect fusion graphs defined in a previous paper verify all the properties requested by region merging algorithms. In this paper, we present a theorem which states that, in any dimension, the perfect fusion grids introduce...

Different methods have been proposed for merging multiple and potentially conflicting informations. Sum-based operators offer a natural method for merging commensurable prioritized belief bases. Their popularity is due to the fact that they satisfy the majority property and they adopt a non cautious attitude in deriving plausible conclusions. This paper analyses the sum-based merging operator w...

Decision support systems based on computerized Clinical Protocols (CP) and Clinical Practice Guidelines (CPG) fall short when dealing with patient co-morbidites, as this demands the concurrent merging of multiple CP/CPG. We present an ontology-based approach for the merging of CPG and CP at two levels–i.e. knowledge modeling level and knowledge execution level. We have developed specialized ont...

For the implementation of multipoint-to-point connections in ATM, various approaches exist, each with its own advantages and disadvantages. VP-based methods require unique sender identi cation but they do not require reassembly in merging points. In contrast, VC-based methods do not require unique sender identi cation but they do require reassembly in merging points. It is likely that VC mergin...

In order to provide a highly formalized ontology merging of hierarchical information modeling for distributed management, the Extenics-based approach is introduced to formalize ontology merging of both Management Information Base (MIB) models and MIB instances. The aim of this paper is then to utilize ontology merging at the meta-schema level based on concept lattices to generate semantic model...