At the merging point, vehicles on the main road must reduce their velocity to avoid slow merging vehicles from a branch road, which leads to a traffic jam. Some researchers point out the effectiveness of a zipper merging pattern for improving the traffic near the merging point. In this study, the authors discuss the effectiveness of a zipper merging pattern using cellular automata simulation. F...

This paper proposes a novel approach to merging DL-Lite ontologies by utilising an alternative semantic characterisation instead of classical DL models. The new merging process consists of two operators (TBox merging and ABox merging). These operators satisfy several desirable properties for merging, which in turn demonstrates the suitability of the new approach to DL-Lite merging. It is shown ...

this paper presents, a hybrid method, low-resolution and high-resolution, for persian page segmentation. in the low-resolution page segmentation, a pyramidal image structure is constructed for multiscale analysis and segments document image to a set of regions. by high-resolution page segmentation, by connected components analysis, each region is segmented to homogeneous regions and identifying...

This paper deals with Chinese, English and Japanese multilingual information retrieval. Several merging strategies, including raw-score merging, round-robin merging, normalized-score merging, and normalizedby-top-k merging, were investigated. Experimental results show that centralized approach is better than distributed approach. In distributed approach, normalized-by-top-k with consideration o...

This paper deals with Chinese, English and Japanese multilingual information retrieval (MLIR). Merging problem in distributed MLIR is studied. The prediction of retrieval effectiveness is used to determine the merging weight of each intermediate run. The translation penalty and collection weight are considered to improve merging performance. Several merging strategies are experimented. Experime...

When aggregating information from a group of agents, accepting the pieces of information shared by all agents is a natural requirement. In this paper, we investigate such a unanimity condition in the setting of propositional merging. We discuss two interpretations of the unanimity condition. We show that the first interpretation is captured by existing postulates for merging. But the second int...

We present a declarative framework for belief set merging tasks over (possibly heterogeneous) knowledge bases, where belief sets are sets of literals. The framework is designed generically for flexible deployment to a range of applications, and allows to specify complex merging tasks in tree-structured merging plans, whose leaves are the possible belief sets of the knowledge bases that are proc...

In this paper, we compare merging operators in possibilistic logic. We first propose an approach to evaluating the discriminating power of a merging operator. After that, we analyze the computational complexity of existing possibilistic merging operators. Finally, we consider the compatibility of possibilistic merging operators with propositional merging operators.

Belief merging is an important but difficult problem in Artificial Intelligence, especially when sources of information are pervaded with uncertainty. Many merging operators have been proposed to deal with this problem in possibilistic logic, a weighted logic which is powerful for handling inconsistency and dealing with uncertainty. They often result in a possibilistic knowledge base which is a...