THE first account of this disease was published in 1903 by Selter of Solengin, who called it trophodermatoneurosis, but not until Dr. Swift of Australia described it was it recognised as a clinical entity. Since then numerous descriptions have appeared, including that of Feer, a German paediatrician. Several names are still current, e.g., erythrcedema, acrodynia, dermato-polyneuritis, while in ...

Jonathan Osorio's book is about the loss of political power and control, not at the shallow level exemplified by the recent Democratic "loss" of the governorship to the Republicans, but one far more disastrous. Dismemberment is the name he puts to it. This powerful metaphor captures the destructive impact on Native Hawaiians when their traditional forms of social relations and ways of life were...

We explore the possibility of evaluating single-rule Datalog programs eeciently and with logarithmic work space by a natural extension of the Floyd-Warshall algorithm for transitive closure. We characterize exactly the single rule chain programs that can be so evaluated: they are rather modest generalizations of the transitive closure. The proof relies on an interesting language-theoretic conce...

There is growing interest in the use of loss contracts that offer performance incentives as upfront payments that employees can lose. Standard behavioral models predict a tradeoff in the use of loss contracts: employees will work harder under loss contracts than under gain contracts; but, anticipating loss aversion, they will prefer gain contracts to loss contracts. In a series of experiments, ...

There are several applications in VLSI technology that require high-speed shortest-path computations. The shortest path is a path between two nodes (or points) in a graph such that the sum of the weights of its constituent edges is minimum. Floyd-Warshall algorithm provides fastest computation of shortest path between all pair of nodes present in the graph. With rapid advances in VLSI technolog...

Shortest path algorithms finds applications in large real world domains. All pair shortest path (APSP) and single source shortest path (SSSP) both have their special applications domains. All though every SSSP can be applied for all vertices to calculate APSP. But APSP cant. In this paper heterogeneous implementation of Floyd warshalls algorithm and Dijkstra’s algorithm is compared on dense gra...