We present a deterministic oblivious LIFO (Stack), FIFO, double-ended and double-ended priority queue as well as an oblivious mergesort and quicksort algorithm. Our techniques and ideas include concatenating queues end-to-end, size balancing of multiple arrays, several multi-level partitionings of an array. Our queues are the first to enable executions of pop and push operations without any cha...

In the late 1960s Don Knuth asked which permutations could be sorted by various data structures. For a simple stack, he proved that permutations avoiding the pattern 312 can be so sorted, and further, that the number of such permutations of length n is given by Cn, the n th Catalan number. Knuth went on to pose the same question about other data structures that are widely used in sorting operat...

This work proposes a signal-based fault location method combining both time and frequency-domain features. The is based on the Traveling Wave (TW) detection analysis, only employs 100 microseconds of data around TW time-of-arrival to measuring location. Time-domain features are extracted using Mathematical Morphology, while obtained Stationary Wavelet Transform. IEEE 34 nodes system selected fo...