Embeddings of rearrangement invariant spaces that are not strictly singular

We give partial answers to the following conjecture: the natural embedding of a rearrangement invariant space E into L_1([0,1]) is strictly singular if and only if G does not embed into E continuously, where G is the closure of the simple functions in the Orlicz space L_Phi with Phi(x) = exp(x^2)-1.Comment: Also available at http://www.math.missouri.edu/~stephen/preprint

Human-human haptic collaboration in cyclical Fitts' tasks

Understanding how humans assist each other in haptic interaction teams could lead to improved robotic aids to solo human dextrous manipulation. Inspired by experiments reported in Reed et al. (2004), which suggested two-person haptically interacting teams could achieve a lower movement time (MT) than individuals for discrete aiming movements of specified accuracy, we report that two-person teams (dyads) can also achieve lower MT for cyclical, continuous aiming movements. We propose a model, called endpoint compromise, for how the intended endpoints of both subjects' motion combine during haptic interaction; it predicts a ratio of /spl radic/2 between slopes of MT fits for individuals and dyads. This slope ratio prediction is supported by our data

Planning Graph Heuristics for Belief Space Search

Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To place previous work in context and extend work on heuristics for conditional planning, we provide a formal basis for distance estimates between belief states. We give a definition for the distance between belief states that relies on aggregating underlying state distance measures. We give several techniques to aggregate state distances and their associated properties. Many existing heuristics exhibit a subset of the properties, but in order to provide a standardized comparison we present several generalizations of planning graph heuristics that are used in a single planner. We compliment our belief state distance estimate framework by also investigating efficient planning graph data structures that incorporate BDDs to compute the most effective heuristics. We developed two planners to serve as test-beds for our investigation. The first, CAltAlt, is a conformant regression planner that uses A* search. The second, POND, is a conditional progression planner that uses AO* search. We show the relative effectiveness of our heuristic techniques within these planners. We also compare the performance of these planners with several state of the art approaches in conditional planning

Analytical study of catalytic reactors for hydrazine decomposition. One and two dimensional steady-state programs, computer programs manual

Programs manual for one-dimensional and two- dimensional steady state models of catalyzed hydrazine decomposition reaction chamber

Space and planetary environment criteria guidelines for use in space vehicle development, 1982 revision, volume 2

Jupiter, satellites of Jupiter, Saturn, Uranus, Neptune, Pluto, asteroids, comets, and interplanetary dust are considered

Perturbations of C*-algebraic invariants

Kadison and Kastler introduced a metric on the set of all C*-algebras on a fixed Hilbert space. In this paper structural properties of C*-algebras which are close in this metric are examined. Our main result is that the property of having a positive answer to Kadison’s similarity problem transfers to close C*-algebras. In establishing this result we answer questions about closeness of commutants and tensor products when one algebra satisfies the similarity property. We also examine K-theory and traces of close C*-algebras, showing that sufficiently close algebras have isomorphic Elliott invariants when one algebra has the similarity property

Nurse telephone triage in out of hours primary care: a pilot study

No description supplie