Distance-sensitivity guarantee in querying is a highly desirable property in wireless sensor networks as it limits the cost of executing a “query” operation to be within a constant factor of the distance to the nearest node that contains an answer. However, such a tight guarantee may require building an infrastructure for efficient resolution of queries, and the cost of maintaining this infrast...

In memory-based models of human sentence processing it is assumed that the completion of a dependency between a syntactic head and its dependents is a major source of processing difficulty in non-ambiguous sentences, and that this integration cost is a function of the distance between the two elements. However, it remains open how to measure the distance between two dependent elements. While ma...

Stochastic complexity (SC) has been employed as a cost function for solving binary clustering problem Shannon code length (CL-distance) has been previously applied for the purpose of classifying the data vectors during the clustering process. The CL-distance, however, is defined for a given (static) clustering only, and it does not take into account of the changes in the class distribution duri...

\1ode (also called \1AP\ estimation. mean esumation and median estimation are examined here to determine when they can be 'afely used to derive (posterior) cost mmimwng estimates. !These are all Bayes procedures. using the mode. mean. or median of the posterior distnbu· lion.) [t is found that modal estimation only returns cost m1mmizmg estimates when the cost function is 0L. [f the cost funcuo...

Continuing a line of work initiated in (Boyer et al., 2007), the generalisation of stochastic string distance to a stochastic tree distance is considered. We point out some hitherto overlooked necessary modifications to the Zhang/Shasha tree-distance algorithm for all-paths and viterbi variants of this stochastic tree distance. A strategy towards an EM cost-adaptation algorithm for the all-path...

Traveling Salesman Problem (TSP) is focused to construct the path with the lowest distance between different places (nodes), visiting every one once. This paper proposed an algorithm to solve TSP adding three aspects: time, cost and effort, where the effort is calculated multiplying time, distance and cost factors and dividing by the sum of them; the aim of this estimation is optimizing the bes...

We propose a new signed or unsigned Euclidean distance transformation algorithm, based on the local corrections of the well-known 4SED algorithm of Danielsson. Those corrections are only applied to a small neighborhood of a small subset of pixels from the image, which keeps the cost of the operation low. In contrast with all fast algorithms previously published, our algorithm produces perfect E...

THE EFFECTS OF RUNNING SPEED ON THE METABOLIC AND MECHANICAL ENERGY COSTS OF RUNNING. Chad Harris, Mark Debeliso, Kent J. Adams. JEPonline. 2003;6(3):28-37. This study assessed the influence of speed on the metabolic and the mechanical cost to run a given distance. Trained male runners (n=12) performed 2 treadmill run trials of 8 min duration at each of 6 speeds (range 2.33 to 4.0 m/s). Oxygen ...

In concatenative synthesis the join cost function can be related to the probability of a perceived discontinuity at the join. Therefore it is important that the distance measures in the cost function correlate highly with human perceived discontinuities. In this paper the results of a listening test on joins in two Norwegian long vowels: /A:/ and /e:/, is presented. Five spectral distance measu...

OBJECTIVE Air ambulances provide patients with timely access to referral centers. Nonemergent transfers are planned for efficient aircraft use. This study compares a novel flight planning optimization application to traditional planning methods. METHODS This prospective study compared real-world use of the application to traditional methods in a large air medical system. Each day was randomiz...