This paper investigates the queueing process of a bulk service queueing system under Bernoulli schedule. It also generalizes some known scenarios concerning the choice of service and re-service types. The queueing process is studied both in discrete time and in continuous time. Performance measures are derived and used to implement an optimal management policy of the system.

We use a variant of a discrete time exclusion process, studied by Yaguchi 7], to construct a Markov random eld which is K but not Bernoulli. Instead of having all the particles in the exclusion process indistinguishable, this system has two diierent types of particles.

In 1977, Keane and Smorodinsky [9] showed that there exists a finitary homomorphism from any finite-alphabet Bernoulli process to any other finite-alphabet Bernoulli process of strictly lower entropy. In 1996, Serafin [17] proved the existence of a finitary homomorphism with finite expected coding length. In this paper, we construct such a homomorphism in which the coding length has exponential...

The Bernoulli–Barnes polynomials are defined as a natural multidimensional extension of 21 the classical Bernoulli polynomials. Many of the properties of the Bernoulli polynomials 22 admit extensions to this new family. A specific expression involving the Bernoulli–Barnes 23 polynomials has recently appeared in the context of self-dual sequences. The work pre24 sented here provides a proof of t...

The authors analyse a discrete-time based finite queueing model with deterministic service times and a Markov modulated batch Bernoulli process (MMBBP) as a bursty input traffic model in order to investigate the performance of a double threshold based dynamic bandwidth allocation scheme for IP traffic on ATM networks. It is assumed that the segmentation processing time devoted to each cell requ...

ergodic theory : Bernoulli shifts. There is a class of transformations that play a central role in ergodic theory, namely the Bernoulli shifts. The reason for this is partly because they are in a certain sense the simplest examples of measure-preserving transformations and partly because of their role in applications. Definition of Bernoulli shifts. If we are given positive numbers Pu ' ' ' » P...

In this paper we discuss loosely Bernoulli for Zd actions. In particular, we prove that extensions of zero entropy, ergodic, loosely Bernoulli Zd actions are also loosely Bernoulli.

We consider a type of dependent percolation introduced in [2], where it is shown that certain “enhancements” of independent (Bernoulli) percolation, called essential, make the percolation critical probability strictly smaller. In this paper we first prove that, for two-dimensional enhancements with a natural monotonicity property, being essential is also a necessary condition to shift the criti...