Meeting Agenda Meeting Agenda
COMPUTER SCIENCE SEMINAR
-Thursday, March 21, 1996
Gail Murphy, Dept. Comp. Sci. & Eng., Univ. of
Washington, will speak on ``Lightweight Structural
Summarization as an Aid to Software Evolution''.
TIME: 4:00-5:00 p.m.
ROOM: DC 1302
ABSTRACT
All too often, changes to software systems lead to
budget and schedule overruns. This occurs in part
because software engineers lack up-to-date information
about the structure of the systems they are changing.
This talk describes a new approach to quickly and
easily providing engineers with the desired structural
information. In this approach, structural information
extracted from a system's artifacts is summarized in
the context of a high-level model chosen by the
engineer as suitable for reasoning about the planned
modification. I will discuss two new techniques
developed as part of this approach. The software
--------
reflexion model technique permits an engineer to use a
--------- -----
high-level model as a lens through which to view the
structure of the system's source code. The lexical
-------
source model extraction technique facilitates the
------ ----- ----------
scanning and analysis of system artifacts for
structural information that is difficult or impossible
to extract using existing techniques. Each of these
techniques is lightweight: the engineer is able to
balance the cost and time of applying the technique
with the completeness and accuracy of the desired
summarization. In addition to describing the
techniques, I will discuss the validation of the
research, focusing on a case study of an experimental
reengineering of Microsoft Excel.
THEORY SEMINAR
-Wednesday, March 20, 1996
Alex Lopez-Ortiz, graduate student, Dept. Comp. Sci.,
Univ. Waterloo, will speak on ``On-line Searching in
Star Polygons''.
TIME: 3:30-4:30 p.m.
ROOM: DC 1304
ABSTRACT
One of the main problems in robotics is to find a path
from the current location of the robot to a given
target, often in cases when the robot has only a
partial knowledge of its surroundings.
In this talk, we study the case of searches inside a
region defined by a star polygon under the competitive
ratio framework. More specifically, a search strategy
is called c-competitive if the path traveled by the
robot to find the target is at most c times longer than
a shortest path. The ratio c is called the competitive
ratio of the strategy.
I will present upper and lower bounds for searches for
a target in a star polygon. These results are the first
constant competitive strategies for a family of
polygons regardless of the location of the target and
the initial position of the robot.
Also, we argue that for rectilinear G-street polygons,
knowledge of the location of the target does not
improve the competitive ratio in the worst case.
Monday, March 25, 1996
ICR Evening Lecture Series
``Computer Simulation of the Migration
of Toxic Chemicals in Groundwater''
Edward Sudicky, Waterloo Centre for Groundwater Research,
Earth Sciences, University of Waterloo
8:00 p.m.; DC1302
Tuesday, March 26, 1996
Microsoft Satellite TV Telecasts W96
Windows NT Advanced Technical Workshops
``Interoperability: Connectivity is a Basic Right"
registration with J.Webster, ICR
12:00 noon - 1:00 p.m.; DC1304
Thursday, March 28, 1996
Computer Science Seminar
``Implementing Global Memory Management in a Workstation Cluster''
Michael J. Feeley, Computer Science & Engineering, Univ. of Washington
4:00 - 5:00 p.m.; DC1302
How harmony soothed the angry Ikonas spirit.