The increasing use of computers for saving valuable data imposes stringent reliability constraints on storage systems. Reliability improvement via use of redundancy is a common practice. As the disk capacity improves, advanced techniques such as disk scrubbing are being employed to proactively fix latent sector errors. These techniques utilize the disk idle time for reliability improvement. How...

<p>Spectrum sensing in cognitive radio (CR) is a critical process as it directly influences the accuracy of detection. Noise uncertainty affects reliability detecting vacant holes spectrum, thus limiting access that spectrum by secondary users (SUs). In such uncertain environment; SUs sense received power primary user (PU) independently with different measures signal-to-noise ratio (SNR)....

This paper considers the single machine scheduling problem with linear earliness and quadratic tardiness costs. The research on the version with inserted idle time focused on an exact approach, while several heuristics had already been proposed for the version with no idle time. These heuristics were then the basis for the development of new heuristic procedures for the version with idle time. ...

This paper addresses an important question of how to achieve an appropriate and nearly uniform work-load for an under-utilized staff in a waiting line situation by scheduling an appropriate amount of supplementary work during the idle time. We present an M/G/1 queue with a special server’s vacation policy to model this situation. In this system, after serving all arriving customers, the server...

In monetary models in which agents are subject to trading shocks there is typically an ex-post inefficiency in that some agents are holding idle balances while others are cash constrained. This inefficiency creates a role for financial intermediaries, such as banks, who accept nominal deposits and make nominal loans. We show that in general financial intermediation improves the allocation and t...

Distributed systems frequently have large numbers of idle computers and workstations. If we could make use of these, then considerable computing power could be harnessed at low cost. We analyze such systems using Brownian motion with drift to model the execution of a program distributed over the idle computers in a network of idle and busy processors, determining how the use of these “transient...