Downloads & Free Reading Options - Results

This work presents a variation of Naor's strategic observable model (1969), by adding a component of customer heterogeneity induced by the location of customers in relation to the server. Accordingly, customers incur a travel cost which depends linearly on the distance of the customer from the server. The arrival of customers with distances less than x is assumed to be a Poisson process with rate lambda(x)=int_0^x h(y)dy 0.

We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume that the arriving customers decide whether to join the system or balk, based on a natural reward-cost structure. We study the balking behavior of the customers and derive the corresponding Nash equilibrium strategies.

We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume that the arriving customers decide whether to join the system or balk, based on a natural reward-cost structure. We study the balking behavior of the customers and derive the corresponding Nash equilibrium strategies.

We consider a Markovian queue subject to Poisson generated catastrophes. Whenever a catastrophe occurs, all customers are forced to abandon the system, the server is rendered inoperative and an exponential repair time is set on. We assume that the arriving customers decide whether to join the system or balk, based on a natural reward-cost structure. We study the balking behavior of the customers and derive the corresponding Nash equilibrium strategies.

This paper considers a work-conserving FIFO single-server queue with multiple batch Markovian arrival streams governed by a continuous-time finite-state Markov chain. A particular feature of this queue is that service time distributions of customers may be different for different arrival streams. After briefly discussing the actual waiting time distributions of customers from respective arrival streams, we derive a formula for the vector generating function of the time-average joint queue length distribution in terms of the virtual waiting time distribution. Further assuming the discrete phase-type batch size distributions, we develop a numerically feasible procedure to compute the joint queue length distribution. Some numerical examples are provided also.

We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals and regularly varying service time distribution with index -\nu, it is shown that the waiting time distribution is also regularly varying, with index 1 -\nu, and the pre-factor is determined explicitly. Another contribution of the paper is the heavy-traffic analysis of the waiting time distribution in the M/G/1 case. We consider not only the case of finite service time variance, but also the case of regularly varying service time distribution with infinite variance.

We consider the single server queue with service in random order. For a large class of heavy-tailed service time distributions, we determine the asymptotic behavior of the waiting time distribution. For the special case of Poisson arrivals and regularly varying service time distribution with index -\nu, it is shown that the waiting time distribution is also regularly varying, with index 1 -\nu, and the pre-factor is determined explicitly. Another contribution of the paper is the heavy-traffic analysis of the waiting time distribution in the M/G/1 case. We consider not only the case of finite service time variance, but also the case of regularly varying service time distribution with infinite variance.

This paper studies the single-server queueing system in which no customer has to wait for a duration longer than a constant K. Using analytical method together with the property that the queueing process 'starts anew' probabilistically whenever an arriving customer initiates a busy period, we obtain various transient and stationary solutions for the system. (Author)

1Midnight

By Octavus Roy Cohen

The crime seemed to have lost itself in the sleety cold of the December midnight upon which it was committed. The trails were not blind--there were simply no trails. The circumstances baffled explanation--a lone woman entering an empty taxicab; a run to a distant point in the city; the discovery of the woman's disappearance, and in her stead the sight of the dead body of a prominent society man--that, and the further blind information that the suit-case which the woman had carried was the property of the man whose body was huddled horribly in the taxicab. (Summary from the text)

In this interesting autobiography we get a very candid look into the life of Rose Cohen, a Russian Jewish girl who immigrates from Russia to the Lower East Side of New York city with her family. From the deplorable conditions in the garment sweatshops, life in the tenements, the setbacks due to poor health and the slow weakening of the family's faith she provides us with a vivid insight into the hopes and frustrations of an immigrant Jewish family adapting to American life. (Celine Major)

3Theism or Atheism, The Great Alternative

By Chapman Cohen

A thought-provoking treatise from 20th century English freethinker, atheist and secularist writer, Chapman Cohen. Here, he lays out the development of the god-idea from primitive to modern times, and makes a compelling argument for atheism over theism or agnosticism. - Summary by J. M. Smallheer