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...

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...

Designingprivacypreserving authenticationprotocols for massively deployed Radio Frequency IDentification (RFID) systems is a real world challenge that have drawn significant attention from RFID community. This interest yields considerable amount of proposals targeting to overcome the main bottleneck (i.e. the exhaustive search over the list of all tag entries) which appears in the back-end data...

This paper presents a simple and easy implementable Least Mean Square (LMS) type approach for frequency estimation of three phase power system in an unbalanced condition. The proposed LMS type algorithm is based on a second order recursion for the complex voltage derived from Clarke's transformation which is proved in the paper. The proposed algorithm is real adaptive filter with real parameter...

Taylor et al. (1) claimed that New Caledonian crows are capable of reasoning about “hidden causal agents.” Their recorded increases in hide inspections and abandoned trials in the unknown causal agent (UCA) condition relative to the human causal agent (HCA) condition, which were used to infer the presence of “causal reasoning” ability, are, however, confounded by a fundamental methodological li...

A biased graph consists of a graph T and a subclass B of the polygons of T, such that no theta subgraph of T contains exactly two members of B. A subgraph is balanced when all its polygons belong to B. A vertex is a balancing vertex if deleting it leaves a balanced graph. We give a construction for unbalanced biased graphs having a balancing vertex and we show that an unbalanced biased graph ha...