A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
We provide the first perfect sampling algorithm for a Generalized Jackson Network of FIFO queues under arbitrary topology and non-Markovian assumptions on the input of the network. ... We assume (in addition to stability) that the interarrival and service times of customers have finite moment generating function in a neighborhood of the origin, and the interarrival times have unbounded ... INTRODUCTION We present the first perfect sampling algorithm (i.e. unbiased sampling also known as exact simulation) for the steady-state of so-called Generalized Jackson Networks (GJNs). ...arXiv:1601.05499v2 fatcat:f6knq2inb5drfnn6moyghcymuq
We also provide bounds on the sampling time of this new perfect sampling algorithm for acyclic or hyperstable networks. ... We consider open Jackson networks with losses with mixed finite and infinite queues and analyze the efficiency of sampling from their exact stationary distribution. ... Comparison with the classical perfect sampler As discussed earlier, our new algorithm allows for perfect sampling of Jackson networks with finite and infinite buffers. ...doi:10.1007/s11134-015-9436-z fatcat:l4hex6gfhfe5thizrbbaam52i4
We have applied Belief networks to SNP variation in the human APOE gene and plasma apolipoprotein E levels from two samples: 702 African-Americans from Jackson, MS, and 854 non-Hispanic whites from Rochester ... Twenty variable sites in the APOE gene were genotyped in both samples. In Jackson, MS, SNPs 4036 and 4075 were identified to influence plasma apoE levels. ... This work was supported in part by grants from the National Heart Lung and Blood Institute and the Institute of General Medical Sciences. ...doi:10.1089/cmb.2005.12.1 pmid:15725730 pmcid:PMC1201451 fatcat:on675oouj5fwfegj3jrjdy4b34
In this paper, we study a sample performance function of a closed Jackson queueing network; specifically, the time required by a server to serve a finite number of customers. ... Bent Natvig (N-OSLO) 90c:60059 60K25 90B22 Cao, Xi-Ren (1-HRV) A sample performance function of closed Jackson queueing networks. Oper. Res. 3% (1988), no. 1, 128-136. ...
Information (data) exchange in social networks is usually costly, so to make reliable statistical decisions, people need to trade off the benefits and costs of information acquisition. ... finite population network can make "good" inference. ... Acknowledgments Jianqing Fan research is supported by NSF grant DMS-1206464 and the National Institute of General Medical Sciences of NIH through Grant Number R01-GM072611. ...doi:10.1080/01621459.2014.893885 pmid:27076691 pmcid:PMC4827608 fatcat:hepcusakd5b37a7bgjmbuf6g7i
In this paper, we develop a new simulation algorithm that generates unbiased gradient estimators for the steady-state workload of a stochastic fluid network, with respect to the throughput rate of each ... Our algorithm is based on the perfect sampling algorithm developed in Blanchet and Chen (2014), and the infinitesimal perturbation analysis (IPA) method. ... generated Chen by the perfect sampling algorithm (Blanchet and Chen 2014) . ...doi:10.1109/wsc.2014.7019923 dblp:conf/wsc/Chen14 fatcat:pqhysozmebdstol7thlwe27m4a
The domain is a network of UNIX* cycle servers, and the task is to predict properties of the state of the network from partial descriptions of the state. ... All of the calculi performed better than human subjects, so unbiased access to sample experience is apparently of value. 2. ... "jackson" was logged-on too. In the general case, which includes twenty snapshots, "jackson" was logged-on four times. ...arXiv:1304.2368v1 fatcat:uwjxjibdhfdtjigyzmg2zy3xkq
Thus, the objective of this study was to assess the ability of the artificial neural network (ANN) to predict mid-morning G using extensive remote sensing and meteorological reanalysis data over a broad ... The Jackson et al. (1987) and Bastiaanssen (1995) G prediction models were calibrated using the flux tower data for quadratic errors minimization. ... Conflicts of Interest: The authors declare no conflict of interest. Remote Sens. 2021, 13, 2337 ...doi:10.3390/rs13122337 fatcat:kyeuytjgejbyhnxei74tikdk6u
Our conditions for the occurrence of finite population learning and perfect learning in communication networks are very tractable and transparent. ... It also enables meaningful comparative statics regarding the effectiveness of information aggregation in networks. ... relax the assumption of full observation network topology and study Bayesian observational learning with sampling of past actions. ...arXiv:1212.2893v1 fatcat:ztrbq2jk4vdyvjasav2isyp76e
(generalized Bayesian network) paradigm. ... Ramanujam, Command and control for congestion pricing of general multi- modal transportation networks (185-195); M. R. Zamani and L. Y. ...
Abstract There are various importance sampling schemes to estimate rare event probabilities in Markovian systems such as Markovian reliability models and Jackson networks. ... In this work, we present a general state dependent importance sampling method which partitions the state space and applies the cross-entropy method to each partition. ... Figure 4 : 4 Jackson Network with 5 queues. Figure 5 : 5 Jackson Network with 3 queues. ...doi:10.2139/ssrn.1480678 fatcat:ntsha2ihmzc4havpomfyi2ppke
Abstract There are various importance sampling schemes to estimate rare event probabilities in Markovian systems such as Markovian reliability models and Jackson networks. ... In this work, we present a general state dependent importance sampling method which partitions the state space and applies the cross-entropy method to each partition. ... Figure 4 : 4 Jackson Network with 5 queues. Figure 5 : 5 Jackson Network with 3 queues. ...doi:10.1016/j.ejor.2010.07.002 fatcat:5infwjulvzf5pirnc7hk6ymtaa
Starting points are general functional limit theorems showing that joint weak con- vergence of extremal processes with non-random sample size and normalized random sample size indexes implies weak convergence ... In a classical open, K-node, Jackson queueing network in which each node has a single server with exponential service times, the customers are routed by Markov routing probabilities, indepen- dent of the ...
Network scale up (NSU) is a novel approach to estimate parameters in hard to reach populations through asking people the number of individuals they know in their active social network. ... Based on NSU, participants were asked about if they know any people on their social network who suffered from breast, ovarian/cervical, prostate, and bladder cancers, if yes, they should enumerate them ... Acknowledgements We would like to thank the Kerman University of Medical Sciences which accepted the financial support of this study (No.91/131). ...doi:10.7314/apjcp.2015.16.8.3273 fatcat:spl6v5rlzredjak5qufxsmmoxi
The Dublin Review
‘Take part of his general description of the country as a sample of his style :— The natural scenery of Dalmatia is as singular as its geographical formation, and is in the strongest contrast to that of ... an intricate network of natural breakwaters and penetrate into countless havens of matchless security. ...
« Previous Showing results 1 — 15 out of 22,676 results