The traditional problems of facility location are defined statically; a set (or multiset) of n points is given as input, corresponding to the positions of clients, and a solution is returned consisting of set of k points, corresponding to the positions of facilities, that optimizes some objective function of the input set. In the k-centre problem, the objective is to select k points for locatin...

In a machining process, since the geometric accuracy of a manufacturing workpiece mainly relies on the relative position of workpiece to the machining tool, fixtures are needed to locate the workpiece. The clear concept of locating correctness is presented based on Venn diagram and a general algorithm is proposed to determine the locator number and layout. On one hand, the theoretical and pract...

If is a connected graph, the distance between two vertices G  , d u v   , u v V G  G is the length of a shortest path between them. Let be an ordered set of vertices of and let v be a vertex of . The representation  1 2 = , , , k W w w w   G   r v W of v with respect to is the -tuple W k         1 2 , , d v w  , , , k d v w d v w , . If distinct vertices of have distinct repr...

Short amino acid sequence patterns, called motifs, play an important role in molecular biology research. While a number of tools for locating motifs in sequence databases have been developed, no existing tool performs fast enough to allow interactive searching of entire databases. Interactive searching enables biologists to explore the effects of changes to a motif on the set of sequences match...

This paper addresses the problem of reliably fitting an orientated model to video data of laboratory mice assays by specifically locating semi-invariant points on an extracted outline. In the case of mice, the rapid changes in direction and shape often lead to failure when using explicit models. Here we employ a standard background subtraction algorithm in order to derive contour information fr...

The wormhole attack is a severe threat to wireless sensor networks. Most existing countermeasures for detecting and locating wormhole links either require extra hardware or are too complex for the inherently capability-constrained sensor nodes. Actually, wormhole links can enormously change the original sensor network topology. In this paper, we introduce the HCA4DW mechanism for detecting and ...