Sorting algorithms based on successive merging of ordered subsequences are widely used, due to their efficiency and to their intrinsically parallelizable structure. Among them, the merge–sort algorithm emerges indisputably as the most prominent method. In this paper we present a variant of merge–sort that proceeds through arbitrary merges between pairs of quasi-ordered subsequences, no matter w...

On wave-influenced river deltas, wave-driven sediment redistribution affects progradation, and therefore avulsions, while avulsions change where is delivered to the coastline, affecting coastline shape. Coastline shape, in turn, rates patterns. Here we use a numerical model investigate how asymmetry of wave climates delta avulsion behaviors, which are coupled with shape evolution. Increasing wa...

Navigation algorithms have shown to be important in many practical applications. In an unknown or constantly changing environment, D* Lite, a classic dynamic algorithm, replans a shortest path in an efficient manner. However, if there are multiple shortest paths, the D* Lite algorithm arbitrarily selects one. When it comes to a density-unbalanced terrain, the shortest paths with the same cost m...

This paper shows how switched-current filters can be derived from passive filters obtained by the unbalancing of doubly terminated LC lattice structures. The process is similar to what would be done for the simulation of more conventional ladder structures, but the use of lattice prototypes allows the realization in an almost physically symmetrical structure. A comparation of sensitivity charac...

Reactive power in balanced and unbalanced lines constitutes the main problem that is examined in this article. We will describe a balanced line as a line with differential input and output signals. Unbalanced lines, such as the SWER scheme, have to cope with the reactive power problem. However, this problem does not exist in the one wire balanced B-Line scheme. In addition, various methods of g...

Cost-based unbalanced R-trees (CUR-trees) are a costfunction based data structure for spatial data. CUR-trees are constructed specifically to improve the evaluation of intersection queries, the most basic selection query in an Rtree. A CUR-tree is built taking into account a given query distribution for the queries and a cost model for their execution. Depending on the expected frequency of acc...