A fundamental problem that confronts peer-to-peer applications is the efficient location of the node that stores a desired data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key

Abstract. We study new types of geometric query problems defined as follows: given a geometric set P, preprocess it such that given a query point q, the location of the largest circle that does not contain any member of P, but contains q can be reported efficiently. The geometric sets we consider

Wireless Sensor Networks have been proposed for a multitude of location-dependent applications. For such systems, the cost and limitations of hardware on sensing nodes prevent the use of range-based localization schemes that depend on absolute point-to-point distance estimates. Because coarse

target, or that the measurement Is false. nally, it is desirable for an algorithm to be recursive so Target states are estimated from each such da*a-as.soclatloo hypothesis that all the previous data do not have to be reprocessed using a 1C~InlQnfilter. As mere measurements are received, the probabill

a two-dimensional Cartesian histogram gridas a world model. This world model is updated continuously with range data sampled by on-board range sensors. The VFH method subsequently employs a two-stage data-reduction process in order to compute the desired control commands for the vehicle

Abstract — The problem of establishing if it is possible to reach the desired location keeping all features in the field of view and following a straight line is considered. The proposed approach is based on the polynomial parameterization of the camera path and allows one to find the path

We describe an information seeking assistant for the world wide web. This agent, called WebWatcher, interactively helps users locate desired information by employing learned knowledge about which hyperlinks are likely to lead to the target information. Our primary focus to date has been on two

Please specify source: Have you ever applied for work with or been employed by Sodexo Inc., Sodexo Marriott Services, Marriott Management Services, Sodexo USA or Wood Dining Services? Yes No If yes, when and where? If previously employed, please answer the following: Supervisor s Name, Title, and Phone #: Reason for Leaving: If applying for a management position, are you willing to relocate? Yes No If yes, please specify where: PERSONAL Are you over 18 years of age? Yes No If no, give date of birth Do you have unrestricted authorization to work in the United States? Yes No If no, what is your current visa status and when does your visa status expire? Visa status: Expiration Date: Have you ever been convicted of a crime? Yes No Record (Note: If you are applying for a position in Massachusetts, you should not answer this question when you first complete your application. You may be instructed to respond at a later point in the hiring process. If you are, please indicate the date of your response: _____/_____/____ _) Please review the attached state disclosure limitations before responding. All applicants may answer No Record if a conviction has been sealed, pardoned, expunged, annulled, statutorily eradicated or dismissed upon condition of probation. A conviction will not necessarily disqualify you from employment with Sodexo. If yes, please provide date, place and nature of conviction(s): Are there any restrictions on the hours or days you are able to work? Yes No If yes, please explain:

-power algorithms were also recently proposed. We define a new power-cost metric based on the combination of both node's lifetime and distance based power metrics. We investigate some properties of power adjusted transmissions, and show that, if additional nodes can be placed at desired locations between two

claims are made: (1) A very important function of desk organization is to remind the user of things to do, not just to help the user find desired information. Failing to support this function may seriously impair the usefulness of electronic office systems, and explicitly facilitating it may provide