نتایج جستجو برای: binomial nodes

تعداد نتایج: 141690  

2012
MARTIN ZEINER

We introduce a family of q-analogues of the binomial distribution, which generalises the Stieltjes-Wigert-, Rogers-Szegö-, and Kemp-distribution. Basic properties of this familiy are provided and several convergence results involving the classical binomial, Poisson, discrete normal distribution, and a family of q-analogues of the Poisson distribution are established. These results generalise co...

Journal: :Mathematical and Computer Modelling 2011
Mohammad Masjed-Jamei Gradimir V. Milovanovic M. A. Jafari

a f (x)w(x) dx = n − k=0 wkf (xk) + Rn+1[f ], where w(x) is a weight function, {xk}k=0 are integration nodes, {wk} n k=0 are the corresponding weight coefficients, and Rn+1[f ] denotes the error term. During the past decades, various kinds of formulae of the above type have been developed. In this paper, we introduce a type of interpolatory quadrature, whose nodes are geometrically distributed ...

2017
Joona Karjalainen Lasse Leskelä

Binomial random intersection graphs can be used as parsimonious statistical models of large and sparse networks, with one parameter for the average degree and another for transitivity, the tendency of neighbours of a node to be connected. This paper discusses the estimation of these parameters from a single observed instance of the graph, using moment estimators based on observed degrees and fr...

2006
Peter Sanders Jesper Larsson Träff

We describe and experimentally compare three theoretically well-known algorithms for the parallel prefix (or scan, in MPI terms) operation, and give a presumably novel, doubly-pipelined implementation of the in-order binary tree parallel prefix algorithm. Bidirectional interconnects can benefit from this implementation. We present results from a 32 node AMD Cluster with Myrinet 2000 and a 72-no...

2013
Lina Battestilli Stefanka Chukova

We develop an analytical method for calculating the burst loss probabilities in a tandem Optical Burst Switched (OBS) network with a bursty arrival process, depicted by an Interrupted Poison Process (IPP). The OBS network is modelled as a tandem network of loss nodes which is analyzed using single-node decomposition, whereby each node is studied in isolation as an IPP/M/W/W. For this, we need t...

Journal: :archives of breast cancer 0
mahdi aghili department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran parisa seifi department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran farshid farhan department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran ahmad reza sebzari department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran ehsan mohamadi department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran vahid vaezzadeh department of radiation oncology, radiation oncology research center, cancer institute, tehran university of medical sciences, tehran, iran

background: the axillary and supraclavicular nodal volume treatment results in improvement of local control and survival after breast conserving surgery (bcs) or modified radical mastectomy (mrm). studies on the depth of these nodes have questioned the consistent use of standard fields for all patients. this study was done to assess the dose delivery to these lymph nodes with conventional treat...

2010
Francisco Cribari-Neto Nancy Lopes Garcia Klaus L. P. Vasconcellos

We show that the inverse moments of a binomial random variable are such that

Journal: :Proceedings. Biological sciences 2003
Emma Sernland Ola Olsson Noél M A Holmgren

Individuals may join groups for several reasons, one of which is the possibility of sharing information about the quality of a foraging area. Sharing information in a patch-foraging scenario gives each group member an opportunity to make a more accurate estimate of the quality of the patch. In this paper we present a mathematical model in which we study the effect of group size on patch-leaving...

1989
Luc Devroye

We consider uniform random walks on finite graphs with n nodes. When the hitting times are symmetric, the expected covering time is at least 89 log n O(n log log n) uniformly over all such graphs. We also obtain bounds for the covering times in terms of the eigenvalues of the transition matrix of the Markov chain. For distance-regular graphs, a general lower bound of ( n 1 ) l o g n is obtained...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید