Moon Palace I

Moon Palace I takes its title from the novel “Moon Palace” by Paul Auster and is loosely influenced by the following quotation from the novel: "I had jumped off the edge, and then, at the very last moment, something reached out and caught me in midair. That something is what I define as love. It is the one thing that can stop a man from falling, the one thing powerful enough to negate the laws of gravity." (Auster has authorised reproduction of the quotation) The opening pitches of moon palace I were composed while sitting at the piano exploring the sound of my tinnitus/inner ringing. From an initial rather delicate, graceful presentation of these pitches, the music intensifies rhythmically and dynamically, becoming more aggressive, emphasising the invasive quality inherent in tinnitus. A study at any one time of the pitches and rhythms present in my tinnitus can yield interesting results, the relationship between the sounds heard in each ear sometimes producing unison pitches or clashing dissonances. However, for all the fascination and intrigue, tinnitus can be relentless and disturbing, interrupting concentration and hindering sleep. Moon Palace I is an exploration of these two opposing elements. Laurina Sableviciute gave the first performance at St John's Church, Edinburgh, May 2006. It has also been performed by Tricia Dawn Williams at the Manoel Theatre, Valletta, Malta, November 2011.

Time-dependent Hyperstar algorithm for robust vehicle navigation in time-dependent stochastic road networks.

The vehicle navigation problem studied in Bell (2009) is revisited and a time-dependent reverse Hyperstar algorithm is presented. This minimises the expected time of arrival at the destination, and all intermediate nodes, where expectation is based on a pessimistic (or risk-averse) view of unknown link delays. This may also be regarded as a hyperpath version of the Chabini and Lan (2002) algorithm, which itself is a time-dependent A* algorithm. Links are assigned undelayed travel times and maximum delays, both of which are potentially functions of the time of arrival at the respective link. The driver seeks probabilities for link use that minimise his/her maximum exposure to delay on the approach to each node, leading to the determination of the pessimistic expected time of arrival. Since the context considered is vehicle navigation where the driver is not making repeated trips, the probability of link use may be interpreted as a measure of link attractiveness, so a link with a zero probability of use is unattractive while a link with a probability of use equal to one will have no attractive alternatives. A solution algorithm is presented and proven to solve the problem provided the node potentials are feasible and a FIFO condition applies for undelayed link travel times. The paper concludes with a numerical example.