Heteroclinic connections between periodic orbits and resonance transitions in celestial mechanics

In this paper we apply dynamical systems techniques to the problem of heteroclinic connections and resonance transitions in the planar circular restricted three-body problem. These related phenomena have been of concern for some time in topics such as the capture of comets and asteroids and with the design of trajectories for space missions such as the Genesis Discovery Mission. The main new technical result in this paper is the numerical demonstration of the existence of a heteroclinic connection between pairs of periodic orbits: one around the libration point L1 and the other around L2, with the two periodic orbits having the same energy. This result is applied to the resonance transition problem and to the explicit numerical construction of interesting orbits with prescribed itineraries. The point of view developed in this paper is that the invariant manifold structures associated to L1 and L2 as well as the aforementioned heteroclinic connection are fundamental tools that can aid in understanding dynamical channels throughout the solar system as well as transport between the "interior" and "exterior" Hill's regions and other resonant phenomena

Task analysis for error identification: Theory, method and validation

This paper presents the underlying theory of Task Analysis for Error Identification. The aim is to illustrate the development of a method that has been proposed for the evaluation of prototypical designs from the perspective of predicting human error. The paper presents the method applied to representative examples. The methodology is considered in terms of the various validation studies that have been conducted, and is discussed in the light of a specific case study

The algorithmics of solitaire-like games

One-person solitaire-like games are explored with a view to using them in teaching algorithmic problem solving. The key to understanding solutions to such games is the identification of invariant properties of polynomial arithmetic. We demonstrate this via three case studies: solitaire itself, tiling problems and a novel class of one-person games. The known classification of states of the game of (peg) solitaire into 16 equivalence classes is used to introduce the relevance of polynomial arithmetic. Then we give a novel algebraic formulation of the solution to a class of tiling problems. Finally, we introduce an infinite class of challenging one-person games, which we call ``replacement-set games'', inspired by earlier work by Chen and Backhouse on the relation between cyclotomic polynomials and generalisations of the seven-trees-in-one type isomorphism. We present an algorithm to solve arbitrary instances of replacement-set games and we show various ways of constructing infinite (solvable) classes of replacement-set games