- Location:
- DC1304
- Time:
- 12:30 PM
- Chair:
- Thomas Pflaum
1. Adoption of the Agenda - additions or deletions
2. Coffee Hour
- Coffee hour this week:
- Any volunteers?
-
- Coffee hour next week:
- Any volunteers?
3. Next meeting
- Date:
- April 24, 1996
- Location:
- DC 1304
- Time:
- 12:30 PM
- Chair:
- Randall Reid
- Technical presentation:
-
Michael McCool
4. Forthcoming
- Chairs:
-
- Navid Sadikali
- Balasingham Balakumaran
- Richard Bartels
- Tech Presenters:
-
- Dan Milgram
- Thomas Pflaum
- Randall Reid
5. Technical Presentation
- Presenter:
-
Leo Chan
- Title:
- Animation 96
- Abstract:
-
-
The making of Geronimo.
6. General Discussion Items
- A reminder that next term we will be having the CGL lab meeting at 1:30 on
Wednesdays, tentatively. Anne needs to book the room, so get back to
her ASAP if you have a conflict.
7. Action List
8. Director's Meeting
9. Seminars
The Institute for Computer Research (ICR) and
the Department of Systems Design Engineering
Present a Joint Seminar on
"Learning to Recognize 3-D Objects"
by: Dr. David G. Lowe
of: Department of Computer Science
University of British Columbia
Vancouver, British Columbia
Abstract:
Many potential applications of computer vision depend upon the
ability to recognize objects and track their location over time.
Existing methods for matching 3-D object models to images have
been quite successful for small numbers of rigid objects, but fu-
ture improvements in visual recognition will require methods for
automatically learning models of appearance from images. This
talk will provide an overview of several ways in which statisti-
cal learning methods can improve the reliability and efficiency
of visual recognition. A new learning method called Variable-
kernel Similarity Metric (VSM) learning will be briefly
described.
Date: Friday, April 19, 1996
Time: 3:30 p.m.
Place: William G. Davis Computer Research Centre, Room 1302
COMPUTER SCIENCE SEMINAR
-Monday, April 22, 1996
Sheila McIlraith, Dept. Comp. Sci., University of
Toronto, will speak on ``Incorporating Actions into
Diagnostic Problem Solving''.
TIME: 11:00 a.m. - 12:00 noon
ROOM: DC 1302
ABSTRACT
Society is utilizing increasingly complex physical
devices to perform a variety of tasks which are central
to our daily lives. As with any physical system, these
devices can and do malfunction, resulting in diagnosis
problems of such enormous complexity that they often
confound human reasoning. Indeed, computers are
essential to the diagnosis, testing, and repair of many
modern-day complex devices and natural systems.
Most physical devices operate within and are affected
by the dynamics of their environment. Events occur in
the world which alter the state and behaviour of a
device. Furthermore, for the majority of devices,
testing and repair require the performance of a
sequence of actions which may change the state of the
device or the world around it. Execution of these
actions may be precluded by candidate diagnoses or by
certain states of the world. Clearly, action is
integral to diagnostic problem solving, and yet there
has been little formal study of the role of action in
diagnostic problem solving.
In this talk we present contributions towards a logical
characterization of diagnosis, testing, and repair in
the context of a theory of action. We define a
situation calculus framework for diagnostic problem
solving. Using this framework we provide a
characterization of diagnosis, testing and repair for
behaviourally static systems whose state and behaviour
are affected by external events, and which require
world-altering actions to achieve tests and repair. By
formulating these notions in terms of the situation
calculus, we are able to formally address some
fundamental knowledge representation and reasoning
issues in diagnostic problem solving. The results of
this research are relevant to a number of different
application areas including active vision, agent-based
computing, business process re-engineering and user
modeling.
THEORY SEMINAR
-Wednesday, April 24, 1996
Yuan Ma, Stanford University, will speak on "Optimal
Fault-Tolerant Sorting Networks''.
TIME: 2:30-3:30 p.m. *NOTE TIME*
ROOM: DC 1304
ABSTRACT
Sorting networks have been intensively studied for
several decades, and they have proved to be very useful
for a variety of applications, including circuit
switching and packet routing. With the rapid advance of
computer technologies, the study of the fault-tolerance
properties of sorting networks has gained increasing
importance since the presence of faulty elements is
inevitable in any large system.
In this talk, I will present optimal networks and
parallel algorithms for sorting that work correctly
even when each comparator/comparison is independently
faulty with a constant probability. These results
settle several long-standing open questions in the
literature. Both theoretical and simulation results
will be presented.
Some of the results are joint work with Tom Leighton
and Greg Plaxton.
MASTER'S THESIS PRESENTATION
-Friday, April 26, 1996
Ngai-Hung Jimmy Ng, graduate student, Dept. Comp.
Sci., Univ. of Waterloo, will speak on ``Efficient
Intersection Algorithms for Geometric Objects''.
TIME: 1:30-2:30 p.m.
ROOM: DC 3540
ABSTRACT
Recently, the importance of a Spatial Database
Management System (SDBMS) is being recognized. A SDBMS
is a database management system which allows us to
retrieve and manipulate geometric data. QL/G, a query
language for SDBMS, is being developed at the
University of Waterloo. One major contribution of QL/G
will be the design of a number of geometric operators.
These geometric operators are designed for manipulating
geometric objects.
One proposed geometric operator, namely intersection
operator, will be of interest throughout this thesis.
This proposed intersection operator is a generic binary
operator which can be applied on any two geometric
objects. The design and implementation of a number of
efficient intersection algorithms will cover the entire
thesis. The main goal is to make the intersection
operator generic and complete. Other than that, the
robust design of the algorithms allows us to modify and
obtain other geometric operators easily.
MASTER'S THESIS PRESENTATION
-Tuesday, April 23, 1996
Piotr Przybylski, graduate student, Dept. Comp. Sci.,
Univ. Waterloo will speak on ``A Type Based
Implementation for a Language with Distributed Scope''.
TIME: 1:00-2:00 p.m.
ROOM: DC 3301
ABSTRACT
Remote execution is the concept of sending code over
the network to be executed at a remote site. Recently,
much attention has been given to languages supporting
remote execution, such as Java, Telescript and Obliq.
We present the implementation of a language that
combines remote execution and distributed scoping with
parametric polymorphism and strong typing. As support
for code distribution, our implementation uses runtime
type information, and it is the first polymorphic
language using this method. The presented approach
extends the concept of transmitting code and data with
the transmission of type information between address
spaces.
10. Lab Cleanup (until 1:30 or 5 minutes)
Meeting Minutes