Iain M. MacPhee
Durham University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Iain M. MacPhee.
Annals of Applied Probability | 2007
Iain M. MacPhee; Mikhail Menshikov; Dimitri Petritis; Serguei Popov
We study a model of a polling system i.e.\ a collection of
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability | 2008
Pauline Coolen-Schrijner; Frank P. A. Coolen; Iain M. MacPhee
d
European Journal of Operational Research | 2013
Ahmad M. Aboalkhair; Frank P. A. Coolen; Iain M. MacPhee
queues with a single server that switches from queue to queue. The service time distribution and arrival rates change randomly every time a queue is emptied. This model is mapped to a mathematically equivalent model of a random walk with random choice of transition probabilities, a model which is of independent interest. All our results are obtained using methods from the constructive theory of Markov chains. We determine conditions for the existence of polynomial moments of hitting times for the random walk. An unusual phenomenon of thickness of the region of null recurrence for both the random walk and the queueing model is also proved.
Proceedings of the Institution of Mechanical Engineers, Part O: Journal of Risk and Reliability | 2009
Iain M. MacPhee; Frank P. A. Coolen; Ahmad M. Aboalkhair
This paper presents lower and upper probabilities for the reliability of k-out-of-m systems, which include series and parallel systems, and of series systems with independent k i -out-of-m i subsystems, for which optimal redundancy allocation is also presented in case of zero-failure testing. First, attention is restricted to k-out-of-m systems with exchangeable components. The lower and upper probabilities for successful functioning of the system are based on the nonparametric predictive inferential (NPI) approach for Bernoulli data. In this approach, it is assumed that test data are available on the components, and that the future components to be used in the system are exchangeable with these. Thereafter, systems are considered that consist of a series of independent subsystems, with subsystem i a k i -out-of-m i system consisting of exchangeable components. For such systems, an algorithm for optimal redundancy allocation after zero-failure testing is presented. A particularly attractive feature of NPI in reliability, with lower and upper probabilities, is that data containing zero failures can be dealt with in an attractive manner.
Annals of Applied Probability | 2006
Mikhail Menshikov; Iain M. MacPhee; Serguei Popov; Stanislav Volkov
Nonparametric Predictive Inference (NPI) for system reliability reflects the dependence of reliabilities of similar components due to limited knowledge from testing. NPI has recently been presented for reliability of a single voting system consisting of multiple types of components. The components are all assumed to play the same role within the system, but with regard to their reliability components of different types are assumed to be independent. The information from tests is available per type of component. This paper presents NPI for systems with subsystems in a series structure, where all subsystems are voting systems and components of the same type can be in different subsystems. As NPI uses only few modelling assumptions, system reliability is quantified by lower and upper probabilities, reflecting the limited information in the test data. The results are illustrated by examples, which also illustrate important aspects of redundancy and diversity for system reliability.
Annals of Applied Probability | 2008
Iain M. MacPhee; Mikhail Menshikov; Dimitri Petritis; Serguei Popov
In a recent paper, Coolen-Schrijner, Coolen, and MacPhee [
Journal of Theoretical Probability | 2013
Iain M. MacPhee; Mikhail Menshikov; Andrew R. Wade
We consider an exhaustive polling system with three nodes in its transient regime under a switching rule of generalized greedy type. We show that, for the system with Poisson arrivals and service times with finite second moment, the sequence of nodes visited by the server is eventually periodic almost surely. To do this, we construct a dynamical system, the triangle process, which we show has eventually periodic trajectories for almost all sets of parameters and in this case we show that the stochastic trajectories follow the deterministic ones a.s. We also show there are infinitely many sets of parameters where the triangle process has aperiodic trajectories and in such cases trajectories of the stochastic model are aperiodic with positive probability.
Bernoulli | 2010
Iain M. MacPhee; Mikhail Menshikov; Stanislav Volkov; Andrew R. Wade
We consider a polling model with multiple stations, each with Poisson arrivals and a queue of infinite capacity. The service regime is exhaustive and there is Jacksonian feedback of served customers. What is new here is that when the server comes to a station it chooses the service rate and the feedback parameters at random; these remain valid during the whole stay of the server at that station. We give criteria for recurrence, transience and existence of the
Reliability Engineering & System Safety | 2014
Ahmad M. Aboalkhair; Frank P. A. Coolen; Iain M. MacPhee
s
Stochastic Models | 2012
Iain M. MacPhee; Mikhail Menshikov; Marina Vachkovskaia
th moment of the return time to the empty state for this model. This paper generalizes the model, when only two stations accept arriving jobs, which was considered in [Ann. Appl. Probab. 17 (2007) 1447--1473]. Our results are stated in terms of Lyapunov exponents for random matrices. From the recurrence criteria it can be seen that the polling model with parameter regeneration can exhibit the unusual phenomenon of null recurrence over a thick region of parameter space.