CGL Meeting Agenda

Wednesday, October 29th, 1997


Location:
DC 1304
Time:
13:30
Chair:
Adarsh P. Mehta
:-)

1. Adoption of the Agenda - additions or deletions

2. Coffee Hour

Coffee hour this week:
Volunteer?
Coffee hour next week:
Volunteer?

3. Next meeting

Date:
November 5th, 1997
Location:
DC 1302 (next door)
Time:
13:30
Chair:
Dan Milgram (11/5) :-)

Technical presentation:
Mike Hammond (11/5)
:-(

4. Forthcoming

Chairs:

  1. Liddy Olds (11/12)
  2. :-)
  3. Paul Prescod (11/19)
  4. :-(
  5. Alberto Raposo (11/26)
  6. :-(
  7. Mark Riddell (12/3)
  8. :-)

Tech Presenters:

  1. Adarsh Mehta (11/12)
  2. :-)
  3. Dan Milgram (11/19)
  4. :-)
  5. Liddy Olds (11/26)
  6. :-)
  7. Paul Prescod (12/3)
  8. :-(

5. Technical Presentation

Marryat Ma:
:-(

Title:
Translating Pasted Features in the World Space

Abstract:
Surface pasting is a method used to add details to base surfaces to create more complex surfaces. Details can be translated across the base surface by manipulating the surfaces' domain spaces directly, or by specifying a translation in the world space. Leith Chan has developed a method for specifying world-space translation called "Projective Translation". Chan's method has several shortcomings, in that it displays unintuitive behaviour in certain situations. Two methods for overcoming the limitations in Chan's method will be proposed---one due to Bartels, and the other due to Mann. Finally, an improvement to Mann's method will be described, as well as the results of initial tests using the improved method.

6. General Discussion Items

7. Action List

Special note: the GI deadline for submitting papers is October 31st, the deadline for the Implicit Surfaces Workshop is November 20th, the Eurographics (EG'98) deadline is January 9th, the SIGGRAPH deadline is January 14th.

8. Director's Meeting

9. Seminars

                    DEPARTMENT OF COMPUTER SCIENCE
                    UNIVERSITY OF WATERLOO
                    SEMINAR ACTIVITIES

                    Computer Science Seminar

                                   - Thursday, November 6, 1997

Eric G. Manning, P.Eng., F.EIC, F.IEEE
President, Canadian Association for Computer Science,
Wighton Professor & Director
Parallel,   Networked   &   Distributed   Computing   &
Applications (PANDA) Group,
Departments  of  Computer  Science  and  Electrical and
Computer Engineering,
University of Victoria 

will speak on

``Computer Science, Software Engineering and Professional Engineering''

ROOM:          Davis Centre Room DC1304

TIME:          2:30 p.m. - 3:30 p.m.

ABSTRACT

We  review the history of software engineering and find
that  it  is  a  subdiscipline of computer science, and
that the term ``software engineering'' is the term used
globally to denote this subdiscipline.

We  touch on issues of public safety and protection for
mission-critical  systems, and review the organizations
of  computer  scientists  which  have  been  created to
address  these needs. We then consider embedded systems
in  general, noting that the successful and safe design
of  many  requires  both software engineering expertise
and    engineering    domain   expertise   (mechanical,
electrical,  nuclear,  ... engineering).  This leads us
directly  to  recommendations  for  mutually beneficial
co-operation    between    computer    scientists   and
Professional    Engineers,    in   education   and   in
professional practice.

------------------------------------------------------------

		    DEPARTMENT OF COMPUTER SCIENCE
		    UNIVERSITY OF WATERLOO
		    SEMINAR ACTIVITIES

		    SCIENTIFIC COMPUTATION SEMINAR

				- Monday, Nov. 10, 1997

Professor Emilio Spedicato, University of Bergamo, will
speak   on  ``ABS  methods  for  linear  equations  and
applications to optimization''.

TIME:                3:30-4:30 p.m.

ROOM:                DC 1304

ABSTRACT

We  present  the  main  properties  of  ABS methods for
solving  linear  algebraic  equations,  stressing their
unifying  approach  and  some  computationaladvantages.
Then  we  discuss  some  applications  to optimization,
e.g.:

-   derivation  of  the  general solution of the Quasi-
    Newton  equation  with  also sparsity  and symmetry
    conditions.  Existence  of  SSPD  formulas is shown
    following  a  natural imbedding of the problem in a
    class of problems with one extra variable

-   derivation   of   the  general  feasible  direction
    algorithm  for  linearly  constrained optimization.
    The  simplex  method and the interior point methods
    follow  as  special  cases  when the function to be
    minimized  is  linear.  The  reformulation  of  the
    simplex  method  in terms of the so called implicit
    LX method is given.

------------------------------------------------------------

10. Lab Cleanup (last one to help clean up is a rotten egg).