Driver detection and recognition of lineside signals and signs at different approach speeds

A study was carried out using simulation to investigate driver responses to lineside signals and signs at various approach speeds. The objectives of the study were: (1) to find out whether train speed would significantly affect signal/sign reading; (2) to examine at which point certain types of signs or signals could be detected or recognised, and (3) to determine a speed cut-off level above which certain types of signs or signals are no longer recognisable or detectable. Fifty-seven train drivers from 12 Train Operating Companies in the UK participated in the trials. Twenty different types of lineside signs and ten types of signals were tested under six different approach speeds ranging from 100 to 350 km/h (62–218 mph). Driver performance measures were ‘time remaining to the signal/sign’ at the point of detection or recognition, and reading error rate. The results showed a significant influence of train speed on driver responses to lineside signals/signs and demonstrated a non-linear relationship between driver responses to signals/signs and approach speed. This has been used to estimate a maximum approach speed limit within which a specific signal or sign can be correctly detected or recognised. The findings and implications of the study are discussed in the paper.     

Synthesis of sliding-mode controllers for nonlinear systems via extended linearization

In this article, a general synthesis method is proposed for the design of discontinuous feedback strategies leading to asymptotically stabilizing sliding regimes. The method is applicable to the class of nonlinear dynamical systems possessing constant equilibrium points. A family of nonlinear stabilizing sliding manifolds, parametrized by generic desired equilibrium point, is specified on the basis of the extended linearization approach. Some examples including simulations are presented for illustrative purposes. Editor: S. Zak     

The generation effect is no artifact: Generating makes words distinctive.

The generation effect occurs if people remember items they complete from fragments better than complete items they read. Four experiments investigate two questions. When does the effect occur, and why does it do so? Targets generated in related contexts are recognized better than read targets, and they are recalled better with the contexts as cues; the contexts are recognized equally well, and the relation between the context and target is not enhanced by generation. Furthermore, generated items exceed items read in pure lists even when read ones from the mixed list are no worse than the controls. The generation effect is real; it is not an artifact. However, there is nothing special about generation. Generating is a type of encoding, and like any other type of encoding, its effects are maximal on tests that require subjects to do again whatever they did at study. Generating makes targets distinctive by contrasting them with other relatives of the context, and, as a result, the targets enjoy benefits in later discriminations within their family. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Periodic dynamics of coupled cell networks I: rigid patterns of synchrony and phase relations

It has recently been proved by Golubitsky and coworkers that in any network of coupled dynamical systems, the possible 'rigid' patterns of synchrony of hyperbolic equilibria are determined by purely combinatorial properties of the network, known as 'balanced equivalence relations'. A pattern is 'rigid' if it persists under small 'admissible' perturbations of the differential equation — ones that respect the network structure. We discuss a natural generalisation of these ideas to time-periodic states, and motivate two basic conjectures, the Rigid Synchrony Conjecture and the Rigid Phase Conjecture. These conjectures state that for rigid hyperbolic time-periodic patterns, cells with synchronous dynamics must have synchronous input cells, and cells with phase-related dynamics must have input cells that have the same phase relations. We provide evidence supporting the two conjectures, by proving them for a special class of periodic orbits, which we call 'tame', under strong assumptions on the network architecture and the symmetries of the periodic state. The discussion takes place in the formal setting of coupled cell networks. We prove that rigid patterns of synchrony are balanced, together with the analogous result for rigid patterns of phase relations. The assumption on the network architecture simplifies the geometry of admissible vector fields, while tameness rules out patterns with non-trivial local or multilocal symmetry. The main idea is to perturb an admissible vector field in a way that retains sufficient control over the associated perturbed periodic orbit. We present two techniques for constructing these perturbations, both using a general theorem on groupoid-symmetrisation of vector fields, which has independent interest. In particular we introduce a method of 'patching' that makes local changes to an admissible vector field. Having established these results for all-to-all coupled networks and tame periodic orbits we prove more general versions that require these assumptions only on a suitable quotient network. These conditions are weaker and encompass a larger class of networks and periodic orbits. We give an example to show that rigidity cannot be relaxed to hyperbolicity. We also prove, without any technical assumptions, that rigidly synchronous or phase-related cells must be input-isomorphic, a necessary precondition for the two conjectures to hold.     

Wake and aerodynamics loads in multiple bodies—application to turbomachinery blade rows

Two-dimensional, unsteady flow around bodies of complex geometry (or multiple bodies) at high Reynolds number is simulated using the vortex method. This method is modified to take into account the sub-grid scale phenomena through a second order velocity structure function model adapted to the Lagrangian scheme. The dynamics of the body wake is computed using the convection-diffusion splitting algorithm; the convection process is carried out with a Lagrangian Adams-Bashforth time-marching scheme and the diffusion process is simulated using the random walk method. The pressure distribution is obtained using an integral equation derived from the pressure Poisson equation, which was first developed for a single body. Results for the numerical simulation around a linear cascade of airfoils are presented. As the flow is periodic in the y direction, the discrete vortex shedding need only be considered for a reference airfoil. The flow characteristics around the NACA 65-410 series airfoils are calculated and comparisons are made with results available in the literature.     

Bedload Transport in Alluvial Channels

Hydraulic, sediment, land-use, and rock-erosivity data of 22 alluvial streams were used to evaluate conditions of bedload transport and the performance of selected bedload-transport equations. Transport categories of transport-limited (TL), partially transport-limited (PTL), and supply-limited (SL) were identified by a semiquantitative approach that considers hydraulic constraints on sediment movement and the processes that control sediment availability at the basin scale. Equations by Parker et al. in 1982, Schoklitsch in 1962, and Meyer-Peter and Muller in 1948 adequately predicted sediment transport in channels with TL condition, whereas the equations of Bagnold in 1980, and Schoklitsch, in 1962, performed well for PTL and SL conditions. Overall, the equation of Schoklitsch predicted well the measured bedload data for eight of 22 streams, and the Bagnold equation predicted the measured data in seven streams.