Learn More
We consider the most basic visibility-based pursuit-evasion problem defined as follows: Given a polygonal region, a searcher with 360 vision, and an unpredictable intruder that is arbitrarily faster than the searcher, plan the motion of the searcher so as to see the intruder. In this paper, we present simple necessary and sufficient conditions for a polygon(More)
The 1-searcher is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P with a specified boundary point d, is it possible for a 1-searcher to eventually see a mobile intruder that is arbitrarily faster than(More)
Fibulin-3 (FBLN-3) has been postulated to be either a tumor suppressor or promoter depending on the cell type, and hypermethylation of the FBLN-3 promoter is often associated with human disease, especially cancer. We report that the promoter region of the FBLN-3 was significantly methylated (>95%) in some pancreatic cancer cell lines and thus FBLN-3 was(More)
The 1-searcher is a mobile guard whose visibility is limited to a ray emanating from his position, where the direction of the ray can be changed continuously with bounded angular rotation speed. Given a polygonal region P with a speciied boundary point d, is it possible for a 1-searcher to eventually see a mobile intruder that is arbitrarily faster than the(More)
Let B be a point robot moving in the plane, whose path is constrained to forward motions with curvature at most 1, and let X denote a sequence of n points. Let s be the length of the shortest curvature-constrained path for B that visits the points of X in the given order. We show that if the points of X are given on-line and the robot has to respond to each(More)
We consider the online competitiveness for scheduling a set of communication jobs (best described in terms of a weighted graph where nodes denote the communication agents and edges denote communication jobs and three weights associated with each edge denote its length, release time, and deadline, respectively), where each node can only send or receive one(More)