Applying Stochastic Algorithms to a Locomotive Scheduling Problem

This paper addresses a problem common to all railway networks. Given a fixed train timetable and locomotives (or other forms of traction) of various types, each train must be allocated a locomotive. This paper examines the use of stochastic algorithms for such a problem. Two types of algorithm are used—a simple ‘local improvement’ method, performed successively from randomly chosen starting points, and a ‘simulated annealing’ approach. Both are found to give considerably better results than a deterministic method in current use, and the annealing approach is probably the better stochastic method.     

Die Bestimmung des Harzes in Seifen und Fetten

Ohne Zusammenfassung     

Dynamic programming in cricket: optimizing batting order for a sticky wicket

In cricket, a rain-affected pitch can make batting more difficult than normal. Several other conditions such as poor light or an initially lively pitch, may also result in difficulties for the batsmen. In this note, we refer to all of them as ‘sticky wickets’. On sticky wickets, lower order batsmen are often sent into ‘hold the fort’ until conditions improve. In this paper, a stochastic dynamic programming model is used to examine the appropriateness of this policy. The model suggests that the tactic is often optimal when the sticky wicket persists until the end of the day's play, but not often when the sticky wicket is transitory. In some circumstances, it is worthwhile, on a normal wicket near the end of the day, to send in a lower order batsman to hold the fort (a night watchman): when the wicket is sticky, this tactic is even more worthwhile.     

NMR protocol for on-line Brix determination

Water suppression by diffusive attenuation was used to measure Brix in intact cellular tissue of apple and strawberry. Given the signal-to-noise ratio, the correlation for apple was established without repeated acquisition, so this protocol should also be useful for rapid, on-line measurements at low spectrometer frequencies. Water suppression by theT ₁-Null method fails with cellular tissue because of the considerable variation in the longitudinal relaxation times of vacuolar and cytoplasmic water.     

Learning to See: Making Sense of the Mathematics of Change in Middle School

In this article, we will describe the results of a study of 6th grade students learning about the mathematics of change. The students in this study worked with software environments for the computer and the graphing calculator that included a simulation of a moving elevator, linked to a graph of its velocity vs. time. We will describe how the students and their teacher negotiated the mathematical meanings of these representations, in interaction with the software and other representational tools available in the classroom. The class developed ways of selectively attending to specific features of stacks of centimeter cubes, hand-drawn graphs, and graphs (labeled velocity vs. time) on the computer screen. In addition, the class became adept at imagining the motions that corresponded to various velocity vs. time graphs. In this article, we describe this development as a process of learning to see mathematical representations of motion. The main question this article addresses is: How do students learn to see mathematical representations in ways that are consistent with the discipline of mathematics? This revised version was published online in July 2006 with corrections to the Cover Date.     

The critical group from a cryptographic perspective

The critical group of a graph is an abelian group that arisesin several contexts, and there are some similarities with thegroups that are used in cryptography. We construct a familyof graphs with critical groups that are cyclic, and discussthe associated computational problems using algorithms basedon the theory of ‘chip-firing’.