HDTenEightyP/NetNews huggingface dataset:
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.graphics
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Michiele van de Panne, Tuesday 21 April 1992: GRAPHICS
Date: 13 Apr 92 16:30:00 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                 GRAPHICS
                GB119, at 3:00 p.m., Tuesday 21 April 1992

                           Michiele van de Panne
        Department of Electrical Engineering, University of Toronto

              "Reusable Control for Physical-Based Animation"

The use of physically-based models for generating animations can result in
highly-realistic motion.  However, giving an animator adequate control over
these models is very difficult.  For many interesting objects, this
requires the creation of suitable control model, in addition to simulating
the physics of motion. For example, the steering of a driver is important
in most animations of a moving car, and a physical model for the dynamics
of moving cars is of little use unless a control model for steering a car
is also available.

We present a method of capturing the behaviour of a dynamic system in a
graph.  Dynamic programming is then applied to the graph to generate a
control table, which contains a large family of optimal control solutions.
The control table captures a `skill' in a table of numbers.  The resulting
numerical solutions are found to compare closely with analytic optimal
solutions, where known.  Once computed, control tables permit real-time,
controlled, physically-based animation.

Results will be shown for several systems, including a truck that can park
itself from many different initial configurations, and a physically-based
model of a person capable of walking over variable terrain.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.systems
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Edgar Knapp, Tuesday 21 April 1992: SYSTEMS
Date: 13 Apr 92 15:35:09 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                  SYSTEMS
                GB119, at 2:00 p.m., Tuesday 21 April 1992

                                Edgar Knapp
                            University of Texas

           "Refinement as a Basis for Concurrent Program Design"

Program verification is difficult and expensive. This is especially true in
the presence of concurrency. Many concurrent systems must function
correctly and reliably. Verification can give us a degree of confidence in
the correctness and reliability of software systems that no other approach
can.

Experience has shown that a-posteriori verification---i.e. showing that a
given program meets a given specification---is impractical for all but the
smallest problems. Moreover, such methods are of no help to programmers who
face the task of developing the "given" program in the first place.

We therefore advocate development programs from specifications in a
stepwise manner, by refining specifications in a disciplined and scientific
fashion. The actual program text is derived only as the last step in
program design. Our work is based on the UNITY formalism by Chandy and
Misra. The advantages of our approach are:

 - It encompasses concurrent programs (with safety and progress
   assertions) as well as sequential ones.
 - It is compositional, i.e., it allows the decomposition of large
   problems into smaller ones that can be tackled independently.
 - Both algorithmic refinement (the realization of a particular
   implementation strategy) and data refinement (replacing one data
   structure by another one) are possible.
 - The verification process is broken into many small steps of
   manageable size.
 - By proving each refinement step correct we are assured that the
   program obtained at the end is correct as well.
 - The theory is sound and complete. Hence, failure to derive a
   program is due to either an unsatisfiable specification or a bad
   design decision, not to a weakness in our formalism.
 - It is well suited for the development of mechanical tools, such
   as an interactive proof assistant or (for finite state programs)
   a model checker.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Geng Lin, Thursday 16 April 1992: THEORY
Date: 6 Apr 92 18:05:04 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                  THEORY
                GB119, at 3:00 p.m., Thursday 16 April 1992

                                 Geng Lin
             Computer Science, University of British Columbia

                    "Fault-Tolerant Switching Networks"

Switching networks are used to support simultaneous (data, voice and image)
communication across multiprocessor parallel systems, distributed computer
systems, and telecommunication systems.  In this talk, we shall be
interested in switching networks that accomplish simultaneous communication
by means of disjoint paths of electrical links and switches (so called
circuit switching).  We shall consider fault-tolerant switching networks
under a random switch failure model. The measure of fault tolerance is the
probability of the network fulfilling its communication task.

Three switching networks of theoretical importance, non-blocking networks,
rearrangeable networks and superconcentrators, are studied.  We prove lower
bounds on the size (the number of switches) and depth (the largest number
of switches along a communication path) of such fault-tolerant networks.
And we explicitly construct such networks with optimal sizes and depths.
Optimal results on planar fault-tolerant switching networks are also
presented.

Xref: sparky ont.events:251 tor.general:512
From: johncw@aurora.physics.utoronto.ca (John Chee Wah)
Newsgroups: ont.events,tor.general
Subject: Toronto NeXT meeting
Date: 6 Apr 92 17:31:50 GMT
Distribution: ont
Organization: University of Toronto Physics/Astronomy/CITA


     The next NeXT meeting will be held on
     Thursday April 9, 1992   7 p.m.

     University of Toronto, 
     Room 118, McLennan Physical Laboratories, 
     60 St George Street (just north of College Street)
     Toronto

     Anyone is welcome to come.

     For more information contact: Pat Mcgowan (mcgowan@physics.utoronto.ca)
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.waterloo.edu ()
Subject: ICR Presents a Colloquium on "Generating and Solving Hard Satisfiabil-  ity Problems", April 15, 1992 at 3: 30 p.m. in DC 1302.
Keywords: Speaker:  Dr. Hector Levesque, Dept. of Computer Science, University   of Toronto
Organization: University of Waterloo
Distribution: ont
Date: Wed, 8 Apr 1992 15:05:32 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                    Presents a Colloquium on

       Generating and Solving Hard Satisfiability Problems



by      Dr. Hector Levesque

of      Department of Computer Science
        University of Toronto


Date:   Wednesday, April 15, 1992  
Time:	3:30 p.m.
Place:  William G. Davis Computer Research Centre, Room 1302



Abstract:

As a computational task, satisfiability  testing  is  of  special
concern  to  AI, despite the fact that it appears to be quite in-
tractable, even in a purely propositional setting.  A  number  of
ways  of  dealing  with this issue have been considered in AI and
elsewhere.  One option is to move away from sound, complete,  and
intolerably  slow procedures, and attempt to get a sense of where
a quick and dirty one would work correctly.  But doing  so  using
randomly  generated  test formulas is a tricky business.  We show
that if care is not taken, easy formulas will appear  to  predom-
inate.   This has led to some overly strong claims in the litera-
ture about handling very large formulas.  We  also  show  how  to
randomly  generate instances that are more challenging.  Finally,
we report results on how a new model-finding procedure  based  on
local  search  fares on these difficult test cases, as well as on
hand-crafted encodings of other problem instances.  This is joint
work  with  Bart  Selman of AT&T Bell Labs, and David Mitchell of
Simon Fraser University.
 

Everyone is welcome.  Refreshments served.
From: edith@cs.toronto.edu (Edith Fraser)
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.hci
Subject: Andrew Howes, Thursday 23 April 1992: HCI, GRAPHICS
Date: 13 Apr 92 16:14:43 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                               HCI, GRAPHICS
                GB119, at 2:00 p.m., Thursday 23 April 1992

                               Andrew Howes
                        MRC APU, Cambridge, England

    "Predicting Device Learnability with an Integrated Cognitive Model"

I will discuss a model of how people learn the task-action mapping
knowledge required to use complex devices.  The model is implemented in the
Soar problem solving architecture and it learns by being guided whilst
interacting with a simulation of the device.  It exhibits at least four
behavioural aspects of human behaviour:

(1)     It learns consistent interfaces with greater ease than
        inconsistent interfaces.

(2)     It learns interactive devices with greater ease than command
        oriented devices.

(3)     It becomes increasingly dependent upon locational knowledge.

(4)     It speeds-up with practice.

I will show how the models behaviour compares with empirical results of
human behaviour.
Newsgroups: ont.events
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.graphics
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Victor Klassen, Tuesday 14 April 1992: GRAPHICS
Date: 6 Apr 92 17:52:56 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                 GRAPHICS
                GB119, at 3:00 p.m., Tuesday 14 April 1992

                              Victor Klassen
                       Xerox Webster Research Center

           "Integer Forward Differencing of Cubic Spline Curves"

An incremental cubic interpolation is derived and analysed.  The algorithm
is based on Field's exact algorithm for drawing lines, modified for third
order forward differencing.  The tradeoff between overflow avoidance and
loss of precision has made forward differencing a method which, although
known to be fast, can be difficult to implement.  It is shown that there is
one particular family of curves that represents the worst case, in the
sense that if a member of this family can be drawn without overflow, then
any curve which fits in the bounding box of that curve can be.  From this
the limitations of the algorithm in terms of image address space and step
count are derived.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.waterloo.edu (wlrush)
Subject: MASTER'S THESIS PRESENTATION
Keywords: Simon Leung, graduate student, Dept. Comp. Sci., Univ. Waterloo
Organization: University of Waterloo
Distribution: ont
Date: Thu, 16 Apr 1992 13:46:30 GMT

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

MASTER'S THESIS PRESENTATION

                    -Thursday, April 23, 1992

Simon  Leung,  graduate student, Dept. Comp. Sci., will
speak  on  ``A  Query Algebra for a Complex Object Data
Model''.

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

ROOM:                 DC 1331

ABSTRACT

We first present a graph-based data model called SIMON.
SIMON's data definition language (DDL) allows a user to
specify complex object types in terms of a set of class
declarations. SIMON's storage definition language (SDL)
allows  the user to associate any number of indices for
any of the class declarations.

The  query  language  for SIMON is a  ``wide-spectrum''
algebra.   It is wide-spectrum in the sense that it may
be  used  to express both user level queries as well as
low-level  evaluation or access plans based on the user
defined indexing.

Next,  we  present a refinement calculus over the query
algebra  which  defines  when  one  algebraic  query is
subsumed by another. The calculus can be used to refine
a  user  query  in  a  stepwise  fashion to a low-level
access plan for the query.

Finally, we exhibit a translation from a subset of ANSI
standard SQL to our query algebra. This subset excludes
consideration  of GROUP-BY and HAVING clauses and null-
values,   but  properly  accounts  for  queries  having
duplicate solutions as well as the ORDER-BY clause.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.graphics
From: elf@dgp.toronto.edu (Eugene Fiume)
Subject: Re: Michiele van de Panne, Tuesday 21 April 1992: GRAPHICS
Organization: Department of Computer Science
Date: 14 Apr 92 11:29:41 GMT

Edith Fraser writes:
>
>                                 GRAPHICS
>                GB119, at 3:00 p.m., Tuesday 21 April 1992
>
>                           Michiele van de Panne

should be

                            Michiel van de Panne
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.waterloo.edu ()
Subject: ICR Presents a Colloquium on "Hierarchical Clustering: A Structure for  Scalable Multiprocessor Operating System Design", Wed., Apr. 22/92 at 3: 30 pm   in DC 1302.
Keywords: Speaker: Dr. Michael Stumm, Dept. of Electrical Engineering, Univ. of  Toronto
Organization: University of Waterloo
Distribution: ont
Date: Tue, 14 Apr 1992 15:08:12 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                    Presents a Colloquium on

       Hierarchical Clustering: A Structure for Scalable
             Multiprocessor Operating System Design



by      Dr. Michael Stumm

of      Department of Electrical Engineering
        University of Toronto


Date:   Wednesday, April 22, 1992   
Time:	3:30 p.m. 
Place:  William G. Davis Computer Research Centre, Room 1302


Abstract:

Much attention has been  directed  towards  designing  "scalable"
multiprocessor  hardware, capable of accommodating a large number
of processors, with the result that a number of such systems  ex-
ist.   Hector,  a scalable shared-memory machine designed and im-
plemented at the University of Toronto is  an  example.  However,
scalable  multiprocessor  hardware can only be cost effective for
general purpose usage if the operating system is as  scalable  as
the hardware.

In this talk we first give a brief overview of  the  Hector  mul-
tiprocessor and then propose a simple structuring technique based
on clustering for designing scalable shared-memory multiprocessor
operating  systems.   Clustering  has  a  number  of  advantages.
First, distributed systems principles are applied by distributing
and  replicating system services and data objects to increase lo-
cality,  increase   concurrency,   and   to   avoid   centralized
bottlenecks,  thus  making  the  system  scalable. However, since
there is tight coupling within a  cluster,  the  system  performs
well for local interactions. Second, a clustered system can easi-
ly be adapted to different hardware configurations and  architec-
tures  by  changing  the size of the clusters.  Third, clustering
maximizes locality which is key to good performance in large NUMA
systems.   Finally, clustering leads to a modular system composed
from easy-to-design and hence efficient building blocks.

Everyone is welcome.  Refreshments served.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.graphics
From: elf@dgp.toronto.edu (Eugene Fiume)
Subject: Re: Michiel van de Panne, Tuesday 21 April 1992: GRAPHICS
Organization: Department of Computer Science
Date: 15 Apr 92 13:43:42 GMT

Another typo.  Let's do it one more time.  It used to read

>
>           Department of Computer Science, University of Toronto
>              (GB = Galbraith Building, 35 St. George Street)
>
>       -------------------------------------------------------------
>
>                                 GRAPHICS
>                GB119, at 3:00 p.m., Tuesday 21 April 1992
>
>                           Michiele van de Panne
>        Department of Electrical Engineering, University of Toronto
>
>              "Reusable Control for Physical-Based Animation"
>

The last bit should instead read:



                                 GRAPHICS
                GB119, at 3:00 p.m., Tuesday 21 April 1992

                           Michiel van de Panne
        Department of Electrical Engineering, University of Toronto

              "Reusable Control for Physically-Based Animation"
From: edith@cs.toronto.edu (Edith Fraser)
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.hci,ut.dcs.graphics
Subject: Victor Klassen, Tuesday 14 April 1992: GRAPHICS
Date: 13 Apr 92 16:03:47 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                 GRAPHICS
GB248 (Please note location & time change), at 11:00 a.m., Tuesday 14 April 1992

                              Victor Klassen
                       Xerox Webster Research Center

           "Integar Forward Differencing of Cubic Spline Curves

(Please note the change in time and location)

An incremental cubic interpolation is derived and analysed.  The algorithm
is based on Field's exact algorithm for drawing lines, modified for third
order forward differencing.  The tradeoff between overflow avoidance and
loss of precision has made forward differencing a method which, although
known to be fast, can be difficult to implement.  It is shown that there is
one particular family of curves that represents the worst case, in the
sense that if a member of this family can be drawn without overflow, then
any curve which fits in the bounding box of that curve can be.  From this
the limitations of the algorithm in terms of image address space and step
count are derived.
From: edith@cs.toronto.edu (Edith Fraser)
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
Subject: Sundar Vishwanathan, Thursday 23 April 1992: THEORY
Date: 13 Apr 92 20:43:06 GMT


           Department of Computer Science, University of Toronto
              (GB = Galbraith Building, 35 St. George Street)

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

                                  THEORY
                GB119, at 3:00 p.m., Thursday 23 April 1992

                            Sundar Vishwanathan
                           University of Chicago

                    "Randomized Online Graph Coloring"

This talk will focus on coloring graphs in the online model.  In this model
a graph is presented a vertex at a time. When a new vertex is presented,
only the edges from this vertex to vertices already presented are revealed.
An online algorithm has to irrevocably assign a color to each vertex as
soon as it is presented.

The only known deterministic online graph coloring algorithm with a
sublinear performance function was found by Lov'asz, Saks and Trotter.  The
number of colors it uses may exceed the optimal number of colors by a
factor of n/(log^* n), and hence for graphs of chromatic number exceeding
log^* n, it is useless.  For graphs of small chromatic number, e.g. 3, it
performs better, but still very badly.

We show that randomization helps in coloring graphs online.  We present a
simple randomized online coloring algorithm with a much better performance
ratio.  For example, for 3-colorable graphs the expected number of colors
used is O(sqrt(n log n)).

All our algorithms run in polynomial time, and compare favorably with the
best known polynomial-time OFFLINE algorithms.

We also prove a lower bound of Omega({log n}^{k-1}) in the randomized
model on the performance ratio of every randomized online coloring
algorithm.  Our result even improves the best previously known bound for
deterministic algorithms: Omega( (log n/log log n)^{k-1} ), due to Noga
Alon.
From: harry@aeshq.UUCP (Harry Pulley)
Newsgroups: ont.test
Subject: test
Keywords: test
Date: 14 Apr 92 15:07:43 GMT
Distribution: ont
Organization: AES Headquarters, Environment Canada, Toronto, Canada

this is a test
-- 
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~Disclaimer: any          * It takes all kinds, *
~ Harry C. Pulley, IV %(:-{Q} ~resemblance between my   * and to each his own,*
~       harry@aeshq.UUCP      ~ideas and those of my    *this thought in mind,*
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~employer are coincidental*     I walk alone.   *
Newsgroups: ont.test
From: csday05@lagrange.waterloo.edu (CS Day 05)
Subject: testola
Organization: University of Waterloo
Distribution: na
Date: Mon, 13 Apr 1992 23:46:57 GMT

This is not a test.
From: u001@csx.cciw.ca (Clint Pulley)
Newsgroups: ont.test
Subject: Access test - replies requested
Date: 16 Apr 92 00:58:33 GMT
Distribution: ont
Organization: Canada Centre for Inland Waters

Testing netnews outgoing - a few email replies would be appreciated.
  

-- 
Clint Pulley <u001@csx.cciw.ca>      |  Canada Centre for Inland Waters
Head, Computer Services              |  867 Lakeshore Road, Burlington, Ontario
National Water Research Institute    |  Canada  L7R 4A6     (416) 336-4930
Environment Canada                   |  "Water is Life"
Newsgroups: ont.test
From: root@mcshub.dcss.mcmaster.ca (Operator)
Subject: testing
Organization: Department of Computer Science, McMaster University
Distribution: ont
Date: Tue, 14 Apr 1992 20:12:44 GMT

101010101010111101101010101001000001010101001010h010101010101e01010101011
011111101010100000l000101010p00101011010101m00101010101111110000e0101010!
From: luis@lsimages.uucp (Luis Lopes)
Newsgroups: ont.test
Subject: test
Date: 1 Apr 92 05:03:16 GMT
Organization: L.S.images, Toronto, Canada

Test of post from tin....not a too bad of a news reader...rn is a bit
to crude...but is best for modem use!
-- 
luis@lsimages.uucp           | If you set the clock back on a computer
acps3420@ryevm.ryerson.ca    | Does it go back in time?
Newsgroups: ont.test
From: u001@csx.cciw.ca (Clint Pulley)
Subject: Access Test
Organization: Canada Centre for Inland Waters
Distribution: ont
Date: Wed, 15 Apr 1992 20:27:51 GMT

Testing news access
-- 
Clint Pulley <u001@csx.cciw.ca>      |  Canada Centre for Inland Waters
Head, Computer Services              |  867 Lakeshore Road, Burlington, Ontario
National Water Research Institute    |  Canada  L7R 4A6     (416) 336-4930
Environment Canada                   |  "Water is Life"
Newsgroups: ont.test
From: <chang>@me.utoronto.ca
Subject: testing....
Organization: University of Toronto, Department of Mechanical Engineering
Distribution: ont.test
Date: 7 Apr 92 21:51:44 GMT




Newsgroups: ont.test
From: dan@maccs.dcss.mcmaster.ca (Dan Trottier)
Subject: secret message inside
Organization: Department of Computer Science, McMaster University
Distribution: tor
Date: Wed, 15 Apr 1992 18:30:54 GMT

curious?

dan
-- 
Dan Trottier                                       dan@maccs.dcss.McMaster.CA
Dept of Computer Science                       ...!uunet!utai!utgpu!maccs!dan
McMaster University                                      (416) 525-9140 x3444
Newsgroups: ont.jobs