Results 171 to 180 of about 3,485 (230)

Mapping the temporal landscape of breast cancer using epigenetic entropy. [PDF]

open access: yesCommun Biol
Monyak DL   +7 more
europepmc   +1 more source

Bladder Cancer Burden in the USA: Population Scenarios for 2040. [PDF]

open access: yesEur Urol Open Sci
Jalal H   +13 more
europepmc   +1 more source

The Effects of Mindfulness on Brain Network Dynamics Following an Acute Stressor in a Population of Drinking Adults. [PDF]

open access: yesBrain Sci
O'Donnell SM   +6 more
europepmc   +1 more source

Energy-efficient wireless sensor network for urban groundwater level monitoring using machine learning and sink mobility. [PDF]

open access: yesSci Rep
Manchanda R   +8 more
europepmc   +1 more source

Sojourn Time Distribution in Fluid Queues

open access: yes, 2019
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

open access: yes, 2008
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

Sojourn time distribution in a MAP/M/1 processor-sharing queue

Operations Research Letters, 2003
The 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

open access: yesJournal of the ACM, 1993
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

Home - About - Disclaimer - Privacy