Application of Advanced Stated Preference Design Methodology

This paper demonstrates the application of the design methodology developed in the Advanced Stated Preference Design project to stated preference experiments. The paper considers binary response experimental designs of two, three and four variables. In addition the special case of a two variable design with an alternative specific constant is also considered. Alternative optimality criteria are discussed. The paper concludes with recommendations on how to apply the design methodolog

Cycle-to-cycle control of swing phase of paraplegic gait induced by surface electrical stimulation

Parameterised swing phase of gait in paraplegics was obtained using surface electrical stimulation of the hip flexors, hamstrings and quadriceps; the hip flexors were stimulated to obtain a desired hip angle range, the hamstrings to provide foot clearance in the forward swing, and the quadriceps to acquire knee extension at the end of the swing phase. We report on two main aspects; optimisation of the initial stimulation parameters, and parameter adaption (control). The initial stimulation patterns were experimentally optimised in two paraplegic subjects using a controlled stand device, resulting in an initial satisfactory swinging motion in both subjects. Intersubject differences appeared in the mechanical output (torque joint) per muscle group. During a prolonged open-loop controlled trial with the optimised but unregulated stimulation onsets and burst duration for the three muscle groups, the hip angle range per cycle initially increased above the desired value and subsequently decreased below it. The mechanical performance of the hamstrings and quadriceps remained relatively unaffected. A cycle-to-cycle controller was then designed, operating on the basis of the hip angle ranges obtained in previous swings. This controller successfully adapted the burst duration of the hip flexors to maintain the desired hip angle range

Scheduling Optimisations for SPIN to Minimise Buffer Requirements in Synchronous Data Flow

Synchronous Data flow (SDF) graphs have a simple and elegant semantics (essentially linear algebra) which makes SDF graphs eminently suitable as a vehicle for studying scheduling optimisations. We extend related work on using SPIN to experiment with scheduling optimisations aimed at minimising buffer requirements.We show that for a benchmark of commonly used case studies the performance of our SPIN based scheduler is comparable to that of state of the art research tools. The key to success is using the semantics of SDF to prove when using (even unsound and/or incomplete) optimisations are justified. The main benefit of our approach lies in gaining deep insight in the optimisations at relatively low cost

GRIDCC: Real-time workflow system

The Grid is a concept which allows the sharing of resources between distributed communities, allowing each to progress towards potentially different goals. As adoption of the Grid increases so are the activities that people wish to conduct through it. The GRIDCC project is a European Union funded project addressing the issues of integrating instruments into the Grid. This increases the requirement of workflows and Quality of Service upon these workflows as many of these instruments have real-time requirements. In this paper we present the workflow management service within the GRIDCC project which is tasked with optimising the workflows and ensuring that they meet the pre-defined QoS requirements specified upon them

DeltaTree: A Practical Locality-aware Concurrent Search Tree

As other fundamental programming abstractions in energy-efficient computing, search trees are expected to support both high parallelism and data locality. However, existing highly-concurrent search trees such as red-black trees and AVL trees do not consider data locality while existing locality-aware search trees such as those based on the van Emde Boas layout (vEB-based trees), poorly support concurrent (update) operations. This paper presents DeltaTree, a practical locality-aware concurrent search tree that combines both locality-optimisation techniques from vEB-based trees and concurrency-optimisation techniques from non-blocking highly-concurrent search trees. DeltaTree is a $k$-ary leaf-oriented tree of DeltaNodes in which each DeltaNode is a size-fixed tree-container with the van Emde Boas layout. The expected memory transfer costs of DeltaTree's Search, Insert, and Delete operations are $O(\log_B N)$, where $N, B$ are the tree size and the unknown memory block size in the ideal cache model, respectively. DeltaTree's Search operation is wait-free, providing prioritised lanes for Search operations, the dominant operation in search trees. Its Insert and {\em Delete} operations are non-blocking to other Search, Insert, and Delete operations, but they may be occasionally blocked by maintenance operations that are sometimes triggered to keep DeltaTree in good shape. Our experimental evaluation using the latest implementation of AVL, red-black, and speculation friendly trees from the Synchrobench benchmark has shown that DeltaTree is up to 5 times faster than all of the three concurrent search trees for searching operations and up to 1.6 times faster for update operations when the update contention is not too high