A new priority queue structure is introduced, for which the amortized time to insert a new element isO(1) while that for the minimumextraction is O(logK). K is the average, taken over all the deleted elements x, of the number of elements that are inserted during the lifespan of x and are still in the heap when x is removed. Several applications of our structure are mentioned.

A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...

AbstmctA direct application of commonly used synchronization primitives such as semaphores, monitors, or the Ada rendezvous can lead to uncontrolled priority inversion, a situation in which a higher priority job is blocked by lower priority jobs for an indefinite period of time. In this paper, we investigate two protocols belonging to the class of priority inheritance protocols, called the basi...

This paper provides a methodology for evaluating call blocking probability over packet-switched networks with Time-driven priority (TDP) [4][5] and obtained results. The approach presented in this work is novel, since call blocking is typically studied in the context of circuit-switched networks. TDP together with resource reservation enable real-time delivery of packets with no loss due to con...

Rateless codes over a binary erasure channel (BEC) provide successful transmission independent of the erasure probability. Luby Transform (LT) codes and raptor codes are examples of rateless codes over a BEC. For successful decoding, LT codes require either a large overhead at linear complexity, or capacity-approaching overheads with nonlinear complexity. When overhead is low at linear complexi...

Dynamic pricing schemes in telecommunication networks were traditionally employed to create users’ incentives in such a way that the overall utilization is improved and profits are maximized. However, such schemes create frustration to users, since there is no guarantee that they would get services at the anticipated prices. In this paper, we propose a pricing scheme for priority telephony syst...

In this paper we study a variation of the Dynamic Traveling Repairperson Problem (DTRP) in which there are two classes of demands; high priority, and low priority. In the problem, demands arrive in the environment randomly over time and assume a random location and on-site service requirement. A service vehicle must travel to each demand location and provide the required on-site service. The qu...

How to effectively approximate real-valued parameters with binary codes plays a central role in neural network binarization. In this work, we reveal an important fact that binarizing different layers has a widely-varied effect on the compression ratio of network and the loss of performance. Based on this fact, we propose a novel and flexible neural network binarization method by introducing the...

Authors are encouraged to submit new papers to INFORMS journals by means of a style file template, which includes the journal title. However, use of a template does not certify that the paper has been accepted for publication in the named journal. INFORMS journal templates are for the exclusive purpose of submitting to an INFORMS journal and should not be used to distribute the papers in print ...