Many methods for numerically inverting transforms require values of the transform at complex arguments. However, in some applications, the transforms are only characterized implicitly via functional equations. This is illustrated by the busy-period distribution in the M / G / 1 queue. In this paper we provide conditions for iterative methods to converge for complex arguments. Moreover, we show ...

The paper analyzes the sensitivity of two unit system for parameters uses Regenerative Point Graphical Technique (RPGT). Taking failure and repair rates constant. A state diagram depicting transition is drawn. Expressions path probabilities mean sojourn times, time to failure, availability system, busy period server, expected number server’s visits are derived using RPGT. Sensitive analysis don...

A prospective study was carried out to establish the time lost from work due to corneal foreign body injury. Data were collected over a 5 month period on a total of 504 patients attending a busy district hospital eye casualty department. The median time lost through injury was 4 hours and 148 patients (30%) took no time off work. Corneal foreign bodies are known to be painful injuries but in sp...

We consider compound geometric approximation for a nonnegative, integervalued random variable W . The bound we give is straightforward but relies on having a lower bound on the failure rate of W . Applications are presented to M/G/1 queuing systems, for which we state explicit bounds in approximations for the number of customers in the system and the number of customers served during a busy per...

We derive several algorithms for the busy period distribution of the canonical Markovian fluid flow model. One of them is similar to the Latouche–Ramaswami algorithm for quasi-birth–death models and is shown to be quadratically convergent. These algorithms significantly increase the efficiency of the matrix-geometric procedures developed earlier by the authors for the transient and steady-state...

Three fast mutual exclusion algorithms using read-modify-write and atomic read/write registers are presented in a sequence, with an improvement from one to the next. The last algorithm is shown to be optimal in minimizing the number of remote memory accesses required in a resource busy period. Remote memory access is the key factor of memory access bottleneck in large shared-memory multiprocess...

Consider an M/G/1 production line in which a production item is failed with some probability and is then repaired. We consider three repair disciplines depending on whether the failed item is repaired immediately or first stockpiled and repaired after all customers in the main queue are served or the stockpile reaches a specified threshold. For each discipline, we find the probability generatin...

We construct quasiconformal mappings in Euclidean spaces by integration of a discontinuous kernel against doubling measures with suitable decay. The differentials of mappings that arise in this way satisfy an isotropic form of the doubling condition. We prove that this isotropic doubling condition is satisfied by the distance functions of certain fractal sets. Finally, we construct an isotropic...

The emerging vehicular networks are targeted to provide efficient communications between mobile vehicles and fixed roadside units (RSU), and support mobile multimedia applications and safety services with diverse quality of service (QoS) requirements. In this paper, we propose a busy tone based medium access control (MAC) protocol with enhanced QoS provisioning for life critical safety services...

The authors present the central capacity sharing (CCS) model and derive equations describing its behaviors to explain results from dual-task situations. The predictions of the CCS model are contrasted with those of the central bottleneck model. The CCS model predicts all of the hallmark effects of the psychological refractory period (PRP) pardigm: -1 slope of the PRP effect at short stimulus on...