- Start Date:
July 27, 2001
- Event Start Time:
12:00 PM
- Event End Time:
1:00 PM
- Organizers:
Kia Dalili
- Seminar Series:
REU Seminar
- Presenter(s):
John Gimbel - University of Alaska
- Event Location:
CoRE 301
- Abstract:
A problem arises in the design of parallel processors. These are sets of small computers, known as processors, which are wired together in a variety of ways. The problem, which will be presented, is identicle to the following. Suppose we wish to put motion detectors in a house. These detectors are expensive and we wish to buy as few as possible. If a detector is placed in a room, it can detect the presence of a person in that room or any adjacent room. Detectors are wired to a security office. Given the information from the processors alone, we wish to uniquely locate the presence of an intruder. In what manner do we place our detectors? We will focus our attention on two questions. When is such an arrangement possible and when it is possible, what bounds exist on the number of detectors?
