Results 191 to 200 of about 9,050 (237)

Bidirectional transitions of frailty states among middle-aged and older adults: a longitudinal cohort analysis using a multi-state Markov model based on the China Health and Retirement Longitudinal Study. [PDF]

Innov Aging
Tong Y, Teng Y, Zhang Y, Huang C, Liao W, Wan B, Zong S, Zeng G.   +7 more
europepmc   +1 more source

Hepatocellular Carcinoma Surveillance and Survival in a Contemporary Asia-Pacific Cohort.

JAMA Netw Open
Lim RY, Koh B, Ng CH, Kulkarni AV, Liu K, Wijarnpreecha K, Kim BK, Muthiah MD, Lee SW, Zheng MH, Kawaguchi T, Takahashi H, Huang DQ, Liver Cancer Research Network.   +13 more
europepmc   +1 more source

Modelling dynamic transitions in neurological functional disability in patients with intracerebral haemorrhage: a prospective cohort study using a multistate Markov model. [PDF]

BMJ Open
Liu M, Yan Z, Lin S, Xu J, Huang S, Ma K, Zhou X, Song Y, Zeng H, Li H, Xie XX, Kang D, Lin S, Wu S.   +13 more
europepmc   +1 more source

Triple network dynamics and future alcohol consumption in adolescents. [PDF]

Alcohol Clin Exp Res (Hoboken)
McIntyre CC, Khodaei M, Lyday RG, Weiner JL, Laurienti PJ, Shappell HM.   +5 more
europepmc   +1 more source

Sojourn Time Distribution in Fluid Queues

, 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, Guy Latouche, Marie-Ange Remiche   +2 more
openaire   +3 more sources

Sojourn time approximations in queueing networks with feedback [PDF]

Performance Evaluation, 2006
This paper is motivated by the response-time analysis of distributed information systems, where transactions are handled by a sequence of front-end server and back-end server actions. We study sojourn times in an open queueing network with a single Processor Sharing (PS) node and an arbitrary number of M multi-server First-Come-First-Served (FCFS ...
B.M.M. Gijsen, R.D. van der Mei (Rob), P. Engelberts, J.L. van den Berg (Hans), K.M.C. van Wingerden (Karin)   +4 more
openaire   +6 more sources

Quantiles of Sojourn Times

, 2006
Fast response times and the satisfaction of response time quantile targets are important performance criteria for almost all transaction processing, computer-communication and other operational systems. However, response time quantiles tend to be difficult to obtain in stochastic models, even when the mean value of the response time has a relatively ...
Knottenbelt, W, Harrison, P
openaire   +2 more sources

Sojourn time asymptotics in a parking lot network

Mathematical Methods of Operations Research, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R.R. Egorova (Regina Robertovna), A.P. Zwart (Bert)   +1 more
openaire   +6 more sources

Sojourn times in queueing networks

, 1990
From a customer's point of view, the most important performance measure in a queueing network is his sojourn time. This paper presents a survey of sojourn time results in queueing networks. Particular attention is paid to product-form networks, for which exact expressions for the joint distribution of a customer's successive sojourn times along a quasi
Boxma, O.J., Daduna, H.
openaire   +2 more sources