Suppose that a fence needs to be protected (perpetually) by k mobile agents with maximum speeds v1, . . . , vk so that no point on the fence is left unattended for more than a given amount of time. The problem is to determine if this requirement can be met, and if so, to design a suitable patrolling schedule for the agents. Alternatively, one would like to find a schedule that minimizes the idl...

Epigenetic mechanisms may be important for a native species' response to rapid environmental change. Red Imported Fire Ants (Solenopsis invicta Santschi, 1916) were recently introduced to areas occupied by the Eastern Fence Lizard (Sceloporus undulatus Bosc & Daudin, 1801). Behavioral, morphological and physiological phenotypes of the Eastern Fence Lizard have changed following invasion, creati...

Non-volatile memory (NVM) promises fast, byte-addressable and durable storage, with raw access latencies in the same order of magnitude as DRAM. But in order to take advantage of the durability of NVM, programmers need to design persistent objects which maintain consistent state across system crashes and restarts. Concurrent implementations of persistent objects typically make heavy use of expe...

Abstract In this paper, the exact formulae for the Harary indices of join, disjunction, symmetric difference, strong product of graphs are obtained. Also, the Schultz and modified Schultz indices of join and strong product of graphs are computed. We apply some of our results to compute the Harary, Schultz and modified Schultz indices of fan graph, wheel graph, open fence and closed fence graphs.

We study a new search problem on the plane involving a robot and an immobile treasure, initially placed at distance 1 from each other. The length β of an arc (a fence) within the perimeter of the corresponding circle, as well as the promise that the treasure is outside the fence, is given as part of the input. The goal is to device movement trajectories so that the robot locates the treasure in...