On the distribution of search cost for the move-to-front rule
β Scribed by James Allen Fill; Lars Holst
- Publisher
- John Wiley and Sons
- Year
- 1996
- Tongue
- English
- Weight
- 393 KB
- Volume
- 8
- Category
- Article
- ISSN
- 1042-9832
No coin nor oath required. For personal study only.
β¦ Synopsis
A file of records, each with an associated request probability, is dynamically maintained as a serial list. Successive requests are mutually independent. The list is reordered according to the move-to-front (MTF) rule: The requested record is moved to the front of the list. We derive the stationary distribution of search cost (= depth of requested item) by embedding in Poisson processes and derive certain finite-time stochastic ordering results for the MTF chain so embedded. A connection with cache fault probabilities is discussed.
We also establish a Schur-concavity result for stationary expected search cost.
π SIMILAR VOLUMES
It is shown that for the thermodynamic description of microbial growth there does not exist complete equivalency between the "efficiency" and "Gibbs energy dissipation" approach. The reasons for this absence of equivalency are discussed, and it is argued that the "dissipation approach" has much more
## Abstract A fully automated anthrax smoke detector (ASD) has been developed and tested. The ASD is intended to serve as a cost effective frontβend monitor for anthrax surveillance systems. The principle of operation is based on measuring airborne endospore concentrations, where a sharp concentrat