Merging and splitting source code artifacts is a common activity during the lifespan of a software system; as developers rethink the essential structure of a system or plan for a new evolutionary direction, so must they be able to reorganize the design artifacts at various abstraction levels as seems appropriate. However, while the raw effects of such changes may be plainly evident in the new a...

Recent studies of high-quality, highresolution traffic have demonstrated these traffics exhibit self-similarity, which has implications for design, control and analysis of high-speed networks. Merging and splitting are basic networking operations and should be studied before we analyze the performance of the whole high speed networks. In this paper, we give the necessary and sufficient conditio...

mA new simple and computationally efficient approach to image segmentation via recursive region splitting and merging is presented. Unlike other techniques the criterion for splitting is based on a generalization of a two-class gradient relaxation method and merging uses a test for mean gray level equivalency for adjacent regions. The technique is illustrated by providing results for both synth...

The main objective of this project is to develop an energy efficient clustering algorithm with splitting and merging. Energy efficiency is one of the most important issues for WSNs, because the battery of each wireless sensor node cannot be recharged or replaced. The proposed system uses an energy-efficient self-organized clustering model with splitting and merging (EECSM). Which performs clust...

Program slicing is a well understood concept in the imperative paradigm, but so far there has been little work on program slicing in the context of functional languages. This paper describes a program slicing technique for Haskell that takes tuple-returning functions apart (called splitting); the converse of this is also described (called merging). The slicer is implemented as a transformation ...

This paper describes a novel method developed for the segmentation of sedimentary grains in electron microscopy images. The algorithm utilizes the approach of region splitting and merging. In the splitting stage, the marker-based watershed segmentation is used. In the merging phase, the typical characteristics of grains in electron microscopy images are exploited for proposing special metrics, ...

Information about objects that split or merge is often generated dynamically as a by-product of computation or in the observation of real-world behavior. Visualization tools for such processes must not only reveal temporal patterns and spatial organization but should also accommodate on-the-fly generation of split-merge information. This paper develops a formal structure for split-merge process...