An analysis of Gipps' car-following model of highway traffic

A mathematical analysis of Gipps's (1981) car?following model is performed. This model is of practical importance as it powers the UK Transport Research Laboratory highway simulation package SISTM. Uniform flow solutions and a speed–headway function are derived under simplifying conditions. A linear stability analysis of uniform flow is then performed, and stable and unstable regimes are identified. Finally, some numerical simulations for a variety of parameter regimes are presented. <br/

Automatic pump Patent

Automatically reciprocating, high pressure pump for use in spacecraft cryogenic propellant

Structural matching by discrete relaxation

This paper describes a Bayesian framework for performing relational graph matching by discrete relaxation. Our basic aim is to draw on this framework to provide a comparative evaluation of a number of contrasting approaches to relational matching. Broadly speaking there are two main aspects to this study. Firstly we locus on the issue of how relational inexactness may be quantified. We illustrate that several popular relational distance measures can be recovered as specific limiting cases of the Bayesian consistency measure. The second aspect of our comparison concerns the way in which structural inexactness is controlled. We investigate three different realizations ai the matching process which draw on contrasting control models. The main conclusion of our study is that the active process of graph-editing outperforms the alternatives in terms of its ability to effectively control a large population of contaminating clutter

Anagram-free Graph Colouring

An anagram is a word of the form $WP$ where $W$ is a non-empty word and $P$ is a permutation of $W$. We study anagram-free graph colouring and give bounds on the chromatic number. Alon et al. (2002) asked whether anagram-free chromatic number is bounded by a function of the maximum degree. We answer this question in the negative by constructing graphs with maximum degree 3 and unbounded anagram-free chromatic number. We also prove upper and lower bounds on the anagram-free chromatic number of trees in terms of their radius and pathwidth. Finally, we explore extensions to edge colouring and $k$-anagram-free colouring.Comment: Version 2: Changed 'abelian square' to 'anagram' for consistency with 'Anagram-free colourings of graphs' by Kam\v{c}ev, {\L}uczak, and Sudakov. Minor changes based on referee feedbac