Longitudinal acceleration comfort is one of the essential metrics used to evaluate the ride comfort of train. The aim of this study was to investigate the effectiveness of using hand grip force as a correlate of longitudinal acceleration comfort of rapid transit trains. In the paper, a motion simulation system was set up and a two-stage experiment was designed to investigate the role of the gri...

This paper is the second in a series of two papers presenting recent developments concerning the interaction between aspectual classes of predicates and the semantics of aspectual for-phrases. Aspectual for-phrases must modify predicates which are homogeneous meaning that the predicate spreads appropriately to subintervals. For eventive predicates the relevant notion of homogeneity should be a ...

We present techniques for incrementally managing schedules in domains where activities accrue quality as a function of the time and resources allocated to them and the goal is to maximize the overall quality of actions executed over time. The scheduling problem of interest is both over-subscribed and dynamic; there is generally more to do than is possible within imposed deadlines, and opportuni...

Incremental search algorithms, such as Generalized FringeRetrieving A* and D* Lite, reuse search trees from previous searches to speed up the current search and thus often find cost-minimal paths for series of similar search problems faster than by solving each search problem from scratch. However, existing incremental search algorithms have limitations. For example, D* Lite is slow on moving t...

The motivation for this work is derived from the current interest in speeding up development schedules. A key implication of the shift to more rapid development methods is the growing emphasis on fixed time and fixed effort delivered during such projects. However there appears to be little work that addresses the impacts of dealing with bound effort levels. The result of binding time and effort...

In an earlier paper, we described a data structure, called support graph, for efficient incremental evaluation of tabled logic programs. The support graph records the dependencies between answers in the tables, and is crucial for efficiently propagating the changes to the tables when facts are deleted. Incremental computation with support graphs are hundreds of times faster than from-scratch ev...

This technical report presents DD* Lite, an efficient incremental search algorithm for problems that can capitalize on state dominance. Dominance relationships between nodes are used to prune graphs in search algorithms. Thus, exploiting state dominance relationships can considerably speed up search problems in large state spaces, such as mobile robot path planning considering uncertainty, time...

Checkpointing is an important mechanism for limiting crash recovery times. This paper describes a new checkpointing algorithm that was implemented in Oracle 8.0. This algorithm efJiciently JWS buffers which need to be written for checkpointing and easily scales to very large buffer cache sizes: it has been tested with buffer caches as large as six million buffers. Based on this algorithm, we ha...