Meeting Agenda

Wednesday, June 11^th, 1997

Location:

DC 1304

Time:

13:30

Chair:

Tali Zvi

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour this week:

Mark Riddell

Coffee hour next week:

???

3. Next meeting

Date:

June 18^th, 1997

Location:

DC 1304

Time:

13:30

Chair:

Balasingham Balakumaran

Technical presentation:

Tali Zvi

4. Forthcoming

Chairs:

1. Richard Bartels (6/25)
2. John Beatty (7/2)
3. Ian Bell(7/9)

Tech Presenters:

1. Balasingham Balakumaran (6/25)
2. Richard Bartels (7/2)
3. John Beatty(7/9)

5. Technical Presentation

Presenter:

Teresa Yeung

Title:

Techniques for Facial Animation

Abstract:

Facial animation is now attracting more attention than ever before in its 25 years as an identifiable area of computer graphics. Faces are interesting and challenging because of our everyday familiarity with faces and facial expression as a major channel of communication between people. Considerable interest in the development of facial animation techniques have been renewed to evaluate facial expressions. In this presentation, some techniques for facial modeling and facial animation will be introduced.

6. General Discussion Items

7. Action List

8. Director's Meeting

9. Seminars

• A Distributed-Shared-Data System for Distributed Algorithms
  Craig Bruce, graduate student, Dept. Comp. Sci., Univ. Waterloo
  Wednesday, June 11, 1997
  3:30-4:30 p.m.
  DC 1304
  ABSTRACT
  Distributed Shared Data is one of two basic approaches to providing interprocess communication in a distributed system; the other approach is message passing. Since a distributed system has no physically shared memory, shared storage must be simulated, and data-coherency semantics must be enforced. The challenge is to do this efficiently and provide a convenient application interface. The twin challenge is to provide effective parallelism in an environment of a network of workstations with relatively high- latency/low-bandwidth communication compared to specialized parallel computing systems.
  This presentation will introduce the programming model of the system, which is based on managing arbitrary distributed dynamic data structures, and will discuss performance enhancements to the basic model. Performance results obtained from some sample applications will be described, together with the tuning techniques that were needed to obtain good performance.
  
  
• "Computer Chess: How Good are the Computers, and Why Has This Happened?
  Robert Hyatt, University of Southern Mississippi
  Wednesday, June 18, 1997
  9:30-10:30 a.m.
  DC 1350
  ABSTRACT
  Over the past 10 years, we've seen computers advance from the stage where they were called "fish" or "patzers" to the point that everyone is now considering them to be of International Master (or even Grandmaster) strength. What has caused this remarkable increase in playing strength?
  What about Deep Blue, which is clearly a super-Grandmaster type player now and just recently defeated World Champion (PCA) Garry Kasparov in a six game match? What makes this machine different?

10. Lab Cleanup (until 15:30 or 5 minutes)