The paper deals with a stochastic organization model described by a generalized Poisson input process and given probabilities of entering individuals obtaining certain attributes in this organization. The distribution of attributes at any given instant is derived. Examples illustrate the application of obtained results.

The problem discussed is that of determining optimal release rates for finite dams when the release rate may take one of two values and specific costs are involved in increasing and decreasing this release rate. From another point of view, this is a problem of controlling the output simply by switching on and off. A diffusion model is suggested and by considering a family of plausible output policies an optima procedure, which minimises the long-term average cost of operating the dam, is established. Various properties of this output policy are given.

Let {Xk: k ≧ 1} be a sequence of independent, identically distributed random variables with EX1 = μ < 0. Form the random walk {Sn: n ≧ 0} by setting S0 = 0, Sn = X1 + … + Xn, n ≧ 1. Let T denote the hitting time of the set (–∞, 0] by the random walk. The principal result in this paper is to show (under appropriate conditions on the distribution of X1) that Sn, conditioned on T > n converges weakly to a limit random variable, S∗, and to find the Laplace transform of the distribution of S∗. We also investigate a collection of random walks with mean μ < 0 and conditional limits S∗ (μ), and show that S∗ (μ), properly normalized, converges to a gamma distribution of second order as μ ↗ 0. These results have applications to the GI/G/1 queue, collective risk theory, and the gambler's ruin problem.

Some approximate results for infinite capacity storage systems in which the input rate follows a birth and death process are given in this paper. In particular, an immigration-emigration process and an Ehrenfest process are considered. The almost-null-recurrent content distribution is derived when the demand rate is constant. Further, an approximation for the content distribution during a period of excessive over-supply is obtained for the cases of constant demand and demand proportional to the content.

In this paper, we establish that if an interarrival time exceeds a service time with a positive probability then the queueing system GI/G/s with a finite waiting room always has proper limiting distributions for its characteristics such as queue length, waiting time and the remaining service times of the customers being served. The result remains valid if we consider a GI/G/s system with bounded waiting times. A technique is also given to establish that for a system with Poisson arrivals the limiting distributions of the queueing characteristics at an epoch of arrival and at an arbitrary epoch are identical.

Earlier work by Hadidi and Conolly and contemporary work by the author point to the great operational advantages of state-dependent queueing models. Let pin (t) be the state probabilities and p∗in the corresponding L.T.'s relative to the single server birth-and-death queueing process with parameters λn = λ/(n + 1), n ≥ 0, μn = μ, n ≥ 1. We have obtained an exact formulation of p∗i0, p∗in (n ≥ 1) being determined recursively. An exact expression for p10(t) is given in the case of low traffic intensities, and this has been approximated efficiently. Numerical evaluations show that the steady-state is reached very rapidly.

Queues with several servers are examined here, in which arrivals are assumed to form a renewal sequence and successive service times to be mutually independent and independent of the arrival times. The first-come-first-served queue discipline only is considered. An asymptotic formula for the equilibrium waiting time distribution is obtained under conditions of heavy traffic.

This paper considers a finite dam with independently and identically distributed (i.i.d.) inputs occurring in a Poisson process; the special cases where the inputs are (i) deterministic and (ii) negative exponentially distributed are considered in detail. The instantaneous release trate is proportional to the content, i.e., there is an exponential fall in conten except when inputs occur. This model may arise in several other situations such as a geiger counter or integrated shot noise. The distribution of the number of inputs, and of the time, to first overflowing is obtained in terms of generating functions; in Case (i) the solution is obtained through recurrence relations involving iterated integrals which can be evaluated numerically, and in Case (ii) using a series solution of a second order differential equation. Numerical results, in particular for the first two moments, are obtained for various values of the parameters of the model, and compared with a large number of simulations. Some remarks are also made about the infinite dam.

This paper considers a dam of infinite capacity with a discrete-valued stationary input process and a unit release whenever possible. It is shown how, by suitable manipulations of the equation governing the dam content process, the stationary distribution of the dam being empty can be obtained, as also can (with a few additional assumptions) the expected value of the dam content in the stationary case. Results obtained are applied to particular cases of input — independent and identical, Markov, Bivariate Markov and moving-average.

The virtual waiting time process, W(t), in the M/G/1 queue is investigated under the condition that the initial busy period terminates but has not done so by time n ≥ t. It is demonstrated that, as n → ∞, W(t), suitably scaled and normed, converges to the unsigned Brownian excursion process or a modification of that process depending whether ρ ≠ 1 or ρ = 1, where ρ is the traffic intensity.

A stochastic model of a finite dam in which the epochs of input form a renewal process is considered. It is assumed that the quantities of input at different epochs and the inter-input times are two independent families of random variables whose characteristic functions are rational functions. The release rate is equal to unity. An imbedding equation is set up for the probability frequency governing the water level in the first wet period and the resulting equation is solved by Laplace transform technique. Explicit expressions relating to the moments of the random variables representing the number of occasions in which the dam becomes empty as well as the total duration of the dry period in any arbitrary interval of time are indicated for negative exponentially distributed inter-input times.

In a random sample of n pairs (Xr, Yr), r = 1, 2, …, n, drawn from a bivariate normal distribution, let Xr:n be the rth order statistic among the Xr and let Y[r:n] be the Y-variate paired with Xr:n. The Y[r:n], which we call concomitants of the order statistics, arise most naturally in selection procedures based on the Xr:n. It is shown that asymptotically the k quantities k fixed, are independent, identically distributed variates. In addition, putting Rt,n for the number of integers j for which , the asymptotic distribution and all moments of n–1Rt, n are determined for t such that t/n → λ with 0 < λ < 1.

In many endemic areas the level of infection of malaria exhibits a regular cycle. A stochastic model is formulated to describe endemic malaria and is used to justify a set of deterministic equations. The model incorporates the properties peculiar to malaria, i.e., in endemic areas malaria is not usually fatal and an individual can be and usually is reinfected. The theory of small oscillations is applied to the deterministic equations, and under the assumption of stable populations of hosts and vectors an expression is obtained for the period of oscillation of the infection.

Experiments involving random enzymatic or radioactive multiple cutting of single strands in double stranded DNA will occasionally cut it at pairs of positions on opposite strands that are within about 12 base pairs. In this case the DNA may unravel and come apart. The distribution of closest opposing breaks as a function of λ, the incidence of breaks per unit length, is obtained and graphs of the probability of critical distances as functions of λ are plotted. It is shown that for very large λ the distance between closest opposite breaks is approximately exponential with parameter ½λ2.

A general class of single server queueing models is formulated. They distinguish between two factors that may influence the duration of service times: variability in the service requirements of customers, and variability (over time) in the service output of the server. Accordingly, we assume that the demands for service of successive customers form a sequence of independent, identically distributed random variables and that the amount of service produced by a busy server in a time interval is determined by the increment of a process with stationary independent increments over that interval. The results include the distribution of the busy period and the limiting distribution of the queue length. We also investigate the potential waiting process which is an extension of virtual waiting time process in existing queueing models.

We consider a transportation system consisting of a linear network of N + 1 terminals served by S vehicles of fixed capacity. Customers arrive stochastically at terminal i, 1 ≦ i ≦ N, seeking transportation to some terminal j, 0 ≦ j ≦ i − 1, and are served as empty units of vehicle capacity become available at i. The vehicle fleet is partitioned into N service groups, with vehicles in the ith group stopping at terminals i, i − 1,···,0. Travel times between terminals and idle times at terminals are stochastic and are independent of the customer arrival processes. Functional central limit theorems are proved for random functions induced by processes of interest, including customer queue size processes. The results are of most interest in cases where the system is unstable. This occurs whenever, at some terminal, the rate of customer arrivals is at least as great as the rate at which vehicle capacity is made available.

The recurrent epidemic model has hitherto proved mathematically intractable. It is shown here that by imposing the mild condition that the source of new susceptibles is initially of a constant size M for M sufficiently large that there is zero probability of more than M new susceptibles being added to the population in the course of the epidemic, then state probabilities for the stochastic recurrent epidemic model can be found.

A simple birth-death model of particle fluctuations is studied where at each discrete time a birth and/or death may occur. We show that if the probability of a birth does not depend on the number of particles present and if births and deaths are independent, then the times between successive deaths are independent geometrically distributed random variables, which is false in the general case. Since the above properties of the times between successive neuron firings have been observed in nerve cells, the model proposed in [2] obtains added credence.

This paper establishes stochastic bounds for the phasal departure times of a heterogeneous-server queue with a recurrent input and Erlang service times. The multi-server queue is bounded by a simple GI/E/1 queue. When the shape parameters of the Erlang service-time distributions of different servers are the same, these relations yield two-sided bounds for customer waiting times and the queue length, which can in turn be used with known results for single-server queues to obtain characterizations of steady-state distributions and heavy-traffic approximations.

A diffusion model for the M/G/1 queue due to D. P. Gaver is used to obtain an approximation for the density function of the busy period. The approximation has the same mean and variance as the exact density function, and can be given explicitly when the service time is constant, or has a negative exponential or gamma distribution, or is a mixture of these types.