In this paper, five clustering techniques (k-means, ISODATA, merging, splitting and mean shift techniques) used for colour image segmentation are presented. Two heuristic evaluation methods (cluster validity measure VM and quality function Q) are applied. We show that evaluation functions VM and Q can be very helpful in search of best segmentation results. The best results came from k-means, me...

This paper investigates power splitting for fullduplex relay networks with wireless information and energy transfer. By applying power splitting as a relay transceiver architecture, the full duplex information relaying can be powered by energy harvested from the source-emitted radio frequency signal. In order to minimize outage probability, power splitting ratios have been dynamically optimized...

This paper concerns the modelling of Internet packet traffic. In previous work we showed that a Bartlett–Lewis point process, as a model of packet arrivals on backbone links, enjoys strong physical backing and can predict key features. It is based on the surprising empirical observation that flows can often be considered independent for the purpose of modelling packet arrival times. We extend t...

The processes of merging and splitting dilute-gas Bose-Einstein condensates are studied in the nonadiabatic, high-density regime. Rich dynamics are found. Depending on the experimental parameters, uniform soliton trains containing more than ten solitons or the formation of a high-density bulge as well as dispersive shock waves are observed experimentally within merged BECs. Our numerical simula...

Two-dimensional Euler equations have been solved on an unstructured grid. An upwind finite volume scheme, based on Roes flux difference splitting method, is used to discretize the equations. Using advancing front method, an initial Delaunay triangulation has been made. The adaptation procedure involves mesh enrichment coarsening in regions of flow with high low gradients of flow properties, acc...

We study various operations for splitting, partitioning, projecting and merging streams of data. These operations are motivated by their use in dataflow programming and stream processing languages. We use the framework of stream calculus and stream circuits for defining and proving properties of such operations using behavioural differential equations and coinduction proof principles. As a feat...

Most clustering algorithms become ineffective when provided with unsuitable parameters or applied to datasets which are composed of clusters with diverse shapes, sizes, and densities. To alleviate these deficiencies, we propose a novel split-and-merge hierarchical clustering method in which a minimum spanning tree (MST) and an MST-based graph are employed to guide the splitting and merging proc...