ON SOME PROBLEMS IN THE THEORY OF PARTICLE COUNTING AND THE INFINITELY MANY SERVER QUEUE
Technical Report
·
OSTI ID:4114010
The renewal theoretic approach to particle counting is summarized, together with a shorter proof of Pyke's formula for the time distribution between successive registrations. Takacs' methods were used to solve the problem in which the dead-time is allowed to have Erlangr distribution (r) 1), rather than the exponential distribution. The distributions used are maxim distributions, the maximum of m exponential distributions each with parameter mu . After determining the number of impulses present in the type II counter (the queue size problem), the problem of particle counting is considered. (auth)
- Research Organization:
- Columbia Univ., New York
- NSA Number:
- NSA-18-012532
- OSTI ID:
- 4114010
- Report Number(s):
- AD-407819
- Country of Publication:
- United States
- Language:
- English
Similar Records
ON SOME PROBLEMS IN THE THEORY OF PARTICLE COUNTING AND QUEUES WITH INFINITELY MANY SERVERS
Theory of particle detection and multiplicity counting with dead time effects
Dead-time problems
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1962
·
OSTI ID:4066538
Theory of particle detection and multiplicity counting with dead time effects
Conference
·
Mon Jul 01 00:00:00 EDT 2013
·
OSTI ID:22212731
Dead-time problems
Journal Article
·
Sun Dec 31 23:00:00 EST 1972
· Nucl. Instrum. Methods, v. 112, no. 1-2, pp. 47-57
·
OSTI ID:4406963