Sparse pseudo‐random graphs are Hamiltonian

In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log⁵ n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003     

Reaction-diffusion problems in electrolysis

Supported in part by Schweizerischer Nationalfonds (20-25263.88) and European Community (Science Plan, Project Evolutionary Systems)     

Fractal dimension,attractors, and the boussinesq approximation in three dimensions

The Boussinesq approximation, where the viscosity depends polynomially on the shear rate, finds more and more frequent use in geological practice. In the paper, this modified Boussinesq approximation is investigated as a dynamical system for which the existence of a global attractor is proved. Finally, a new criterion for estimating the fractal dimension of invariant sets is formulated and its application to the problem under consideration is illustrated.     

Cores and retracts

Theretracts (idempotent, isotone self-maps) of an ordered set are naturally ordered as functions. In this note we characterize the possible ways that one retract can cover another one. This gives some insight into the structure of the ordered set of retracts and leads to a natural generalization of the core of an ordered set.Supported by NSERC Operating Grant 41702.     

Perturbation analysis of theGI/GI/1 queue

We examine a family ofGI/GI/1 queueing processes generated by a parametric family of service time distributions,F(x,), and we show that under suitable conditions the corresponding customer stationary expectation of the system time is twice continuously differentiable with respect to. Expressions for the derivatives are given which are suitable for single run derivative estimation. These results are extended to parameters of the interarrival time distribution and expressions for the corresponding second derivatives (as well as partial second derivatives involving both interarrivai and service time parameters) are also obtained. Finally, we present perturbation analysis algorithms based on these expressions along with simulation results demonstrating their performance.     

A critique of the disturbance theory of indeterminacy in quantum mechanics

Heisenberg'sgendanken experiments in quantum mechanics have given rise to a widespread belief that the indeterminacy relations holding for the variables of a quantal system can be explained quasiclassically in terms of a disturbance suffered by the system in interaction with a quantal measurement, or state preparation, agent. There are a number of criticisms of this doctrine in the literature, which are critically examined in this article and found to be ininconclusive, the chief error being the conflation of this disturbance with the projection postulate. We present a critique of the disturbance theory based on the fact that the required disturbance will in general depend on the interaction time of the system and state-preparer. This point is exploited in the construction of a spin-interaction model which acts as a counterexample to the disturbance doctrine, while remaining faithful to the spirit of Heisenberg'sgedanken experiments. Several consequences of this result are discussed.This work formed part of a thesis submitted by one of us (HRB) in partial fulfilment of the requirements for the degree of Doctor of Philosophy in the University of London.     

On the Discrete Hardy Inequality

Necessary and sufficient conditions for the boundedness of thediscrete Hardy operator of the form , from to when 0 < q < 1 <p , is given.     

Timetabling County Cricket Fixtures Using a Form of Tabu Search

This paper concerns a computer system which has been devised to timetable the county cricket matches in England. The context of the work is discussed and the many constraints and objectives described. Details of the solution method are given; it involves tabu search with a form of diversification dependent on the solution subcosts as well as the overall cost. Experiments are described which suggest that this type of diversification may have wide applicability to large, complex, multi-objective combinatorial problems.     

A Repeated Matching Heuristic for the Vehicle Routeing Problem

A new heuristic for the vehicle routeing problem which makes use of repeated matching is described. The numerical results are comparable to or better than the best published for most of the 14 benchmark problems commonly used to evaluate VRP heuristics.     

Composition of the Canadian Total Force: Issues and Findings for the Air Components

In 1987 the Canadian Department of National Defence enunciated the Total Force concept. The Total Force is comprised of Regular and Reserve components. The intention is to make maximum use of the Reserve to reduce defence expenditures and at the same time to ensure that military capability remains adequate to support national policy objectives. This paper discusses some of the governing parameters that affect the modelling of the composition of the Total Force and analyses the mix of regular and reserve forces. The interplay between the key factors and their marginal costs will be stressed. The models are employed to study two units in the Canadian Forces, a maintenance support unit and a tactical unit with high operational activity cost. The lessons drawn from these studies are highlighted.