Area Speed Flow Relationships: Ring-Radial Aggregation Using SATURN

This paper is one of a series of ITS working papers and technical notes describing the methodology and results of the EPSRC funded project "The definition of capacity in urban road networks : The role of area speed flow relationships". The objectives of the project were to investigate the interaction between vehicle-hours and vehicle-km within a network as the demand for travel increases; to develop improved area speed flow relationships; to use the relationships to explain the process by which networks reach capacity; and to assess the significance for the evaluation of road pricing policies. The approach used was to collect the vehicle-hours and the vehicle-km directly from a simulation model and thus create relationships between supply and demand in terms of veh-hours/hr and veh-km/hr demanded and also between times per trip and trips demanded. During the project two models were used. The first was a micro-simulation model called NEMIS. This model was used on hypothetical networks ranging from single link to a six by six grid and finally a ring-radial network. The networks were used to study the effects of changes in OD pattern and the effects of varying capacity on the resulting speed flow measures. The second model used was SATURN. This model was used to study the same ring-radial as before and a full SATURN model of Cambridge. The SATURN results were then taken one step further in that they were used to create an aggregate model of each network using SATURN in buffer only mode. The related papers discuss issues such as network aggregation. Note that the methodology and terminology was developed as the study progressed and that in particular the method varies between application of the two distinct models. The reader is directed to the attached appendix A for a full list of publications arising from this project

Area Speed Flow Relationships:The Effect of Varying Signal Capacity

This paper is one of a series of ITS working papers and technical notes describing the methodology and results of the EPSRC funded project "The definition of capacity in urban, road networks : The role of area speed flow relationships". The objectioes of the project were to investigate the interaction between vehicle-hours and vehicle-km within a network as the demand for travel increases; to develop improved area speed flow relationships; to use the relationships to explain the process by which networks reach capacity; and to assess the significance for the evaluation of road pricing policies. The approach used was to collect the vehicle-hours and the vehicle-km directly from a simulation model and thus create relationships between supply and demand in terms of veh-hours/hr and veh-km/hr demanded and also between times per trip and trips demanded. During the project two models were used. The first was a micro-simulation model called NEMIS. This model was used on hypothetical networks ranging from single link to a six by six grid and finally a ring-radial network. The networks were used to study the effects of changes in OD pattern and the effects of varying capacity on the resulting speed flow measures. The second model used was SATURN. This model was used to study the same ring-radial as before and a full SATURN model of Cambridge. The SATURN results were then taken one step further in that they were used to create an aggregate model of each network using SATURN in buffer only mode. The related papers discuss issues such as network aggregation. Note that the methodology and terminology was developed as the study progressed and that in particular the method varies between application of the two distinct models. The reader is directed to the attached appendix A for a full list of publications arising from this project

Subduction Zone by Emily McGiffin

Kelly Shepherd\u27s review of Subduction Zone by Emily McGiffin

On the Role of Hadamard Gates in Quantum Circuits

We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit simultaneously. In this model, we discuss complexity bounds (lower-bounding the number of global Hadamard operations) for common quantum algorithms : we illustrate upper bounds for Shor's Algorithm, and prove lower bounds for Grover's Algorithm. We also use our formalism to display a gate that is neither quantum-universal nor classically simulable, on the assumption that Integer Factoring is not in BPP.Comment: 16 pages, last section clarified, typos corrected, references added, minor rewordin

Four Myths About Why Women Aren't Getting the Top Jobs in Universities

Don't blame lack of ambition, or malign the headhunters. Universities themselves are keeping a lid on female promotio

The rise and rise of executive pay

Sue Shepherd reflects on what lies behind the increase in the salaries of vice chancellors and other executive team members over recent years and what this tells us about trends in management of universities today

undercurrent by Rita Wong

Review of Rita Wong\u27s undercurrent

As if a Raven by Yvonne Blomer

A review of As if a Raven by Yvonne Blomer