Abstract Infectious disease transmission from domestic sheep threatens the persistence of bighorn ( Ovis canadensis) populations throughout western North America. Quantifying spatial separation between 2 species is an essential component in assessing risk transmission. We present a analysis to evaluate infectious risks for endangered Sierra Nevada O. c. sierrae ; hereafter sheep). Our approach ...

This paper studies the distribution of good solutions for the traveling salesman problem (TSP) on a well-known 532-city instance that has been solved optimally by Padberg and Rinaldi 16]. For each of ve local search heuristics, solutions are obtained from 2,500 diierent random starting points. Comparisons of these solutions show that lower-cost solutions have a strong tendency to be both closer...

We generalize the Cost-Distance problem: Given a set of sites in -dimensional Euclidean space and a weighting over pairs of sites, construct a network that minimizes the cost (i.e. weight) of the network and the weighted distances between all pairs of sites. It turns out that the optimal solution can contain Steiner points as well as cycles. Furthermore, there are instances where crossings opti...

Several ways to estimate the position of a WirelessSensor-Network (WSN) node have been discussed in the past years. Unlike in outdoor solutions where the Global Positioning System (GPS) could be used in most applications, a general solution for indoor usage has not been found. The few existing indoor solutions on the market are highly specialized and rely on infrastructure or on very expensive ...

The purpose of this study was to measure the oxygen cost, energy expenditure, and heart rate of glideboarding at selected cadences and distance. The subjects were healthy males (N=30), 19 to 32 years old. They glideboarded at the cadences of 42, 48, and 54 bpm and distance of 1.73 m until steady rate was achieved. [Ten of t îe subjects repeated the protocol for test-retest reliability.^ The oxy...

Given an instance of the minimum cost flow problem, the corresponding inverse problem is to modify the arc costs as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. In this article, we study this inverse problem in that the modifications are measured by the weighted bottleneck-type Hamming distance. We present a new efficient algorithm ...