Search NASASearch

SEARCH · Search NASA

Results for “Negative binomial distribution”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

Charged-particle multiplicity distributions over a wide pseudorapidity range in p–Pb collisions at $\sqrt{s_{NN}}$ = 5.02 TeV

This paper presents the primary charged-particle multiplicity distributions in proton–lead collisions at a centre-of-mass energy per nucleon–nucleon collision of $\sqrt{s_{NN}}$ = 5.02 TeV. The distributions are reported for non-single diffractive collisions in different pseudorapidity ranges. The measurements are performed using the combined information from the Silicon Pixel Detector and the Forward Multiplicity Detector of ALICE. The multiplicity distributions are parametrised with a double negative binomial distribution function which provides satisfactory descriptions of the distributions for all the studied pseudorapidity intervals. The data are compared to models and analyzed quantitatively, evaluating the first four moments (mean, standard deviation, skewness, and kurtosis). The shape evolution of the measured multiplicity distributions is studied in terms of KNO variables and it is found that none of the considered models reproduces the measurements. This paper also reports on the average charged-particle multiplicity, normalised by the average number of participating nucleon pairs, as a function of the collision energy. The multiplicity results are then compared to measurements made in proton–proton and nucleus–nucleus collisions across a wide range of collision energies.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS

Modeling information flow in a computer processor with a multi-stage queuing model

In this paper, we introduce a nonlinear stochastic model to describe the propagation of information inside a computer processor. In this model, a computational task is divided into stages, and information can flow from one stage to another. The model is formulated as a spatially-extended, continuous-time Markov chain where space represents different stages. This model is equivalent to a spatially-extended version of the M/M/s queue. The main modeling feature is the throttling function which describes the processor slowdown when the amount of information falls below a certain threshold. We derive the stationary distribution for this stochastic model and develop a closure for a deterministic ODE system that approximates the evolution of the mean and variance of the stochastic model. In conclusion, we demonstrate the validity of the closure with numerical simulations.

97 MATHEMATICS AND COMPUTING