Mapping the temporal landscape of breast cancer using epigenetic entropy. [PDF]
Monyak DL +7 more
europepmc +1 more source
Bladder Cancer Burden in the USA: Population Scenarios for 2040. [PDF]
Jalal H +13 more
europepmc +1 more source
Hobby engagement, disability transitions, and life expectancy: a multinational longitudinal study. [PDF]
Liu Q, Yang F.
europepmc +1 more source
The Effects of Mindfulness on Brain Network Dynamics Following an Acute Stressor in a Population of Drinking Adults. [PDF]
O'Donnell SM +6 more
europepmc +1 more source
Impact of Limited Sample Size and Follow-up on Partitioned Survival and Multistate Modeling-Based Health Economic Models: A Simulation Study. [PDF]
Beca JM +3 more
europepmc +1 more source
Energy-efficient wireless sensor network for urban groundwater level monitoring using machine learning and sink mobility. [PDF]
Manchanda R +8 more
europepmc +1 more source
Sojourn Time Distribution in Fluid Queues
We consider a fluid flow model with infinite buffer. We compute the Laplace-Stieltjes transform of the sojourn time proceeding in two steps. We first compute the stationary distribution of the buffer at arrival instants, using a change of clock. Secondly, we compute the transform of the time spent to empty the buffer. Numerical examples of sojourn time
Eleonora Deiana +2 more
openaire +3 more sources
Exact Sojourn Time Distribution in an Online IPTV Recording System
In this paper we analytically derive the sojourn time of a user accessing an online IPTV recording service. Basically, the system consists of a server (or server farm) and the bandwidth at which a user can download recorded files depends on the number of other concurrently downloading users.
Tobias Hoßfeld +2 more
openaire +4 more sources
Related searches:
Sojourn time distribution in a MAP/M/1 processor-sharing queue
Operations Research Letters, 2003The authors investigate the sojourn time distribution of a MAP/M/1 queueing system with processor-sharing discipline. The numerical work shows that the solution is numerically tractable. In particular, the effect of the inter-arrival times on the sojourn time distribution is numerically investigated.
Hiroyuki Masuyama, Tetsuya Takine
exaly +2 more sources
On the sojourn time distribution in a finite capacity processor shared queue
We consider a processor shared M/M/1 queue that can accommodate at most a finite number K of customers. Using singular perturbation techniques, we construct asymptotic approximations to the distribution of a customer's sojourn time.
Charles Knessl
openaire +3 more sources

