We give a priority queue that guarantees the worstcase cost of Θ(1) per minimum finding, insertion, and decrease; and the worst-case cost of Θ(lg n) with at most lg n + O( √ lg n) element comparisons per deletion. Here, n denotes the number of elements stored in the data structure prior to the operation in question, and lg n is a shorthand for max {1, log2 n}. In contrast to a run-relaxed heap,...

In the faulty-memory RAM model, the content of memory cells can get corrupted at any time during the execution of an algorithm, and a constant number of uncorruptible registers are available. A resilient data structure in this model works correctly on the set of uncorrupted values. In this paper we introduce a resilient priority queue. The deletemin operation of a resilient priority queue retur...

We give a priority queue that achieves the same amortized bounds as Fibonacci heaps. Namely, find-min requires O(1) worst-case time, insert, meld and decrease-key require O(1) amortized time, and delete-min requires O(log n) amortized time. Our structure is simple and promises an efficient practical behavior when compared to other known Fibonacci-like heaps. The main idea behind our constructio...

We show how to implement a bounded time queue for two different processes. The time queue is a variant of a priority queue with elements from a discrete universe. The bounded time queue has elements from a discrete bounded universe. One process has time constraints and may only spend constant worst case time on each operation while the other process may spend more time. The time constrained pro...

In this paper, we proposed a method on the tradeoff between packet transmission speed and battery life in wireless sensor networks (WSN). The data obtained by sensor nodes comprised various types of information with various levels of importance. A misjudgment of the priority of packets according to the importance of data may delay the transmission of important information. The energy consumed b...

In this paper we describe an on-line solution for avoiding the occurrence of both algorithmic and kinematic singularities in task-priority based kinematic controllers of robotic manipulators. The proposed approach uses a secondary task correction and a successive task projection in order to maintain the measure of manipulability of the correspondent space augmentation approach over a minimum va...

We introduce the rank-pairing heap, a heap (priority queue) implementation that combines the asymptotic efficiency of Fibonacci heaps with much of the simplicity of pairing heaps. Unlike all other heap implementations that match the bounds of Fibonacci heaps, our structure needs only one cut and no other structural changes per key decrease; the trees representing the heap can evolve to have arb...

In this work we use Branch-and-Bound (BB) to efficiently detect objects with deformable part models. Instead of evaluating the classifier score exhaustively over image locations and scales, we use BB to focus on promising image locations. The core problem is to compute bounds that accommodate part deformations; for this we adapt the Dual Trees data structure [7] to our problem. We evaluate our ...

In this paper, analysis of non-preemptive priority queues with multiple servers and multiple priority classes is presented. It is assumed that the service times – for all priority classes – are identically and exponentially distributed to simplify the complexity of the residual service time mathematical expression to an extent will enable calculating the average customer waiting time. The paper...

Background To date, research on priority-setting for new vaccines has not adequately explored the influence of the global, national and sub-national levels of decision-making or contextual issues such as political pressure and stakeholder influence and power. Using Kapiriri and Martin’s conceptual framework, this paper evaluates priority setting for new vaccines in Uganda at national and sub-na...