HDTenEightyP/NetNews huggingface dataset:
From: marc@meadow.uucp (Marc Riehm)
Subject: Re: Health warning: Bon Ami
Keywords: warning, addiction, bon ami
Reply-To: marc@meadow.UUCP (Marc Riehm)
Organization: Amdahl Canada Ltd., Software Development Center
Date: Wed, 8 Apr 92 16:10:48 GMT

In article <1992Apr1.192738.6825@helios.physics.utoronto.ca> dooley@helios.physics.utoronto.ca (Kevin Dooley) writes:
>In article <8215@bnr-rsc.UUCP> readnews@environ.gov.ca writes:
>>
>>   ****************************************************************
>>   **                     HEALTH    BULLETIN                     **
>>   ****************************************************************
>> 
>> 
>>                 !!!!!  WORKPLACE  SAFETY  WARNING  !!!!!
>>
>> 
>>    Results of an independent study have substantiated reports of
>>    possible addictive properties of BON AMI Industrial Glass
>>    Cleaner.
>>  
>Specifically what substances in this product are we talking about?
>Are these chemicals present in any other products?  Was this a bad
>batch or a problem with the recipe?  Why was adequate testing not
>carried out before this product was introduced to the market?  What
>sort of testing was done to identify this product as harmful?  When
>you say "possible addictive properties" do you mean that it is possible
>that addictive substances are contained in this product or do you
>mean that substances which are possibly addictive are contained in
>this product?  If it is the latter, has the harmful property been
>conclusively demonstrated?  How?
>		Kevin

Recently I heard about similar problems with a glass cleaner, but I can't
remember the brand, so I don't know if it is the same one as in the above
posting.  I heard that laboratory tests with lab rats were performed.  An
automatic dispenser of the cleaning solution was put into the cage with the
rats.  The rats had to learn to push a button to dispense the cleaner.  Two
observations implying addiction were made: (1) within 2-3 days, the rats
learned to push the button, and did so very regularly;  (2) after about
one week, the rats exhibited delinquent tendencies (they trashed their cage).

--Marc Riehm.

p.s. What was the date on the original article?
implying addiction were notice3d
cleaner
But, what I heard was tha
I heard about the problem with this cleaner.  The tests involved laboratory
rats being placed into a cage with a can of 
Xref: sparky ont.general:677 can.general:2090
From: sysmark@helios.physics.utoronto.ca (Mark Bartelt)
Newsgroups: ont.general,can.general
Subject: Re: Health warning: Bon Ami
Keywords: warning, addiction, bon ami
Date: 9 Apr 92 10:00:54 GMT
Reply-To: mark@cita.toronto.edu
Organization: University of Toronto Physics/Astronomy/CITA

Marc Riehm writes:

[ coherent paragraph, suddenly followed by ... ]

| p.s. What was the date on the original article?
| implying addiction were notice3d
| cleaner
| But, what I heard was tha
| I heard about the problem with this cleaner.  The tests involved laboratory
| rats being placed into a cage with a can of 

Jeez, Marc, what brand of glass cleaner have *you* been sniffing?  ;-)

Mark Bartelt                                                    416/978-5619
Canadian Institute for                                 mark@cita.toronto.edu
Theoretical Astrophysics                               mark@cita.utoronto.ca

"Clothes not busy being worn are busy drying."    -    Dylan, on laundry day
Newsgroups: ont.sf-lovers
From: db@diana.ocunix.on.ca (D. Bruce)
Subject: CAN-CON May 22-24
Organization: db Software, Nepean Ont.
Distribution: ont
Date: Fri, 10 Apr 1992 01:35:10 GMT

On May 22-24, CAN-CON: The Conference on Canadian Content
in Speculative Literature is being held at the Market Square
Holiday Inn. Our Featured Guests include Guy Gavriel Kay , co-editor
of J. R. Tolkien's The Silmarillian, author of Tigana and
the Fionavar Tapestry; Donald Kingsbury, who wrote Moon Goddess
and Son, Courtship Rite, and "The Survivor", part of the New York
Times Bestseller Man-Kzin Wars IV; and Jeff Green, author, producer
and star of the award winning science fiction radio plays,
"Spaxter" and "Flash". CAN-CON will appeal to those who read or write
Science Fiction and Fantasy. Some of the activities will include;
Readings, Workshops, Panels, Dealer's room and art display, a 24 hour
hospitality suite, and other entertainment.
Tickets (In Ottawa) are available at the following locations:
Empire Books on Bank St and Lincoln Heights Galleria,
The House of Speculative Fiction on Fourth Ave.,
and The Occult Shop on Bank near the Queensway.

Call (613) 726-9097 and ask for Judith for more information.

-- 
D. Bruce				db@diana.ocunix.on.ca
29 Vanson Ave. Nepean			Hilarious or witty
613-225-9920				cute saying. (under construction)
Newsgroups: ont.singles
From: chk@alias.com (C. Harald Koch)
Subject: Re: Seriously...
Organization: Alias Research, Inc., Toronto ON Canada
Date: Wed, 8 Apr 1992 21:55:02 GMT

And of course, "Marriage is the leading cause of divorce".
--
"Procrastination is just    | C. Harald Koch  Alias Research, Inc. Toronto, ON
another technique for       | chk@alias.com                (work-related mail)
planning ahead!"            | chk@gpu.utcs.utoronto.ca     (permanent address)
          - Steve Sergeant  | VE3TLA@VE3OY.#SCON.ON.CA.NA            (AMPRNet)
Newsgroups: ont.singles
From: idfriedm@hertz.waterloo.edu (id friedman)
Subject: quote
Organization: University of Waterloo
Distribution: ont
Date: Mon, 6 Apr 1992 21:34:15 GMT


From the Globe + Mail ( my version) "Marriage is an institution which allows
one spouse to help the othre spouse cope with the major problems in life
which he/she did not have when they were single"

Ishay
From: "joel abram" <joel.abram@canrem.com>
Newsgroups: ont.singles
Subject: word search
Date: 15 Apr 92 07:54:33 EST
Reply-To: "joel abram" <joel.abram@canrem.com>
Distribution: ont
Organization: Canada Remote Systems

Wanted: a word.

I'm in search of a word, really 3 words however I know two of them and
the third of has escaped me.

I'm looking for 3 words that end in GRY.

1. anGRY
2. hunGRY
3. ?

I'm looking for that third word, does anyone have any idea, I've lookked
in atleast a megabyte worth of computer spell checkers and have come up
with nothing, I've even searched in my pocket wordfinder and came up
with nothing.

Joel..
--
Canada Remote Systems  - Toronto, Ontario/Detroit, MI
World's Largest PCBOARD System - 416-629-7000/629-7044
From: andras@alzabo.ocunix.on.ca (Andras Kovacs)
Newsgroups: ont.singles
Subject: Re: Seriously...
Date: 6 Apr 92 14:00:41 GMT
Reply-To: andras@alzabo.UUCP (Andras Kovacs)
Organization: Brian's XENIXlings, Ottawa, Canada

In article <702481833.13869@zooid.guild.org> ron@zooid.guild.org (Secret Mud) writes:
>From: math4104@nexus.yorku.ca (V.W)
>>
>>Not a bad idea. Is there a married woman looking for married man?
>>
>
>"The bond of wedlock are so heavy that it takes two to carry them, sometimes
>three."

  "Marriage is an association to solve problems which wouldn't even exist
without it."

  Andras (married :-) )
-- 
Andras Kovacs                  My friend thinks I'm too gullible...
andras@alzabo.ocunix.on.ca      ...yeah, I believe him!
Nepean, Ont., Canada
Newsgroups: ont.singles
From: cs911030@ariel.yorku.ca (STAVROS TSOKOS)
Subject: Re: quote
Organization: York University, Toronto, Canada
Distribution: ont
Date: Tue, 7 Apr 1992 00:57:17 GMT

In article <1992Apr6.213415.15352@watserv1.waterloo.edu> idfriedm@hertz.waterloo.edu (id friedman) writes:
>
>From the Globe + Mail ( my version) "Marriage is an institution which allows
>one spouse to help the othre spouse cope with the major problems in life
>which he/she did not have when they were single"
>
>Ishay

The following from a 1920's newspaper:

"Marriage is an institution.
 Love is blind.
 Therefore, Marriage is an institution for the blind."

Steve
From: bli@uwovax.uwo.ca
Newsgroups: ont.singles
Subject: test
Date: 12 Apr 92 22:29:15 EST

Single clun on UWO.

This is a tese.
From: tom@alias.com (Tom Burns)
Subject: Quicktime at next Toronto Local SIGGRAPH meeting
Keywords: Apple SIGGRAPH Prisms
Organization: Alias Research Inc., Toronto ON Canada
Distribution: ont
Date: Thu, 16 Apr 1992 16:28:52 GMT

Artists, developers, users and devotees of computer graphics are
invited to attend Toronto SIGGRAPH's general meetings, held the third
Tuesday evening of each month, usually at the Planetarium.

Topic:  Apple Computer presents QuickTime 
Date:   8:00 PM, Tuesday, Apr 21, 1992
Place:  McLaughlin Planetarium lecture room; 100 Queen's Park (Museum Subway)

The next SIGGRAPH general membership meeting will feature an in-depth
presentation of QuickTime, Apple's multimedia system extensions.
Willie Powell, national system engineer for Apple Canada will
demonstrate QuickTime video windows, digital sound, and JPEG image
compression.  He will also demonstrate how QuickTime can be used in a
variety of applications, including data visualisation, computer-based
training, presentations, word processing, spreadsheets and multimedia.

Save $25 off admission to seminars at MULTIMEDIA '92 with SIGGRAPH
coupon available at this meeting.  MULTIMEDIA '92 June 3 - 6, 1992 at
the Metro Convention Centre. Call 1- 416-660-2491 for 24-page colour
catalogue.

SIGGRAPH is also pleased to announce that Side Effects Software, Inc.
developers of PRISMS software  and Silicon Graphics  manufacturers of
Iris Computers  will host another demonstration in early June.  That
date will be announced shortly.

This is a free event, open to all interested parties.  Membership for
RSVP events, the newsletter and library is $36.  See you there!

PS. We welcome submissions, articles, cartoons, etc for our bi-monthly
newsletter.  Please fax to 362-4696 or email to <tom@alias.com>

--
Tom Burns, aka "The Video Guy" at:  | "Ebben ne'andro lontana" - La Wally
Alias Research Inc. (416) 362-9181  |  Fax: (416) 362-4696	
110 Richmond St E, Toronto M5C 1P1  |  INTERNET: tom@alias.com
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.waterloo.edu (wlrush)
Subject: SYMBOLIC COMPUTATION SEMINAR
Keywords: Mark Mutrie, graduate student, Dept. Comp. Sci.
Organization: University of Waterloo
Distribution: ont
Date: Thu, 16 Apr 1992 13:44:49 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

SYMBOLIC COMPUTATION SEMINAR

                    -Tuesday, April 21, 1992

Mark  Mutrie,  graduate student, Dept. Comp. Sci., will
speak on ``Symbolic Methods for Elliptic Integration''.

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

ROOM:                 DC 1304

ABSTRACT

It   is   known   that  elliptic  integrals  cannot  be
represented  in  a  closed  form  using only elementary
functions.  Hence, these integrals cannot be determined
by  the  Risch  integration  algorithm.  However, it is
possible  to  reduce  any elliptic integral to a normal
form  that  uses  three  canonical  basis  functions in
addition   to   elementary   functions.   The  Legendre
elliptic  integrals F, E and - provide one example of a
                    -  -     -
canonical  basis.   Reducing  to normal form provides a
simple  mechanism  for  recognizing  when  two elliptic
integrals are equivalent.

Legendre's  F,  E  and  -  functions  can  be evaluated
            -   -       -
numerically    using   efficient   methods   based   on
arithmetic-geometric   means.    Hence,   reducing   an
elliptic  integral  to  normal  form and evaluating the
normal   form   provides  one  method  for  numerically
computing  these  integrals.   This method is generally
more   more  efficient  than  applying  straightforward
numerical  quadrature techniques.  Numerical quadrature
methods  can  also fail when poles in the integrand are
encountered.

Existing  techniques for reduction to normal form along
with  any subsequent numerical evaluation have a number
of  limitations.   In  particular, they rely heavily on
the  computation  of, and subsequent manipulation with,
numerically   determined   roots   of   polynomials  of
arbitrary degree.  As such, this approach does not lead
directly  to  a  practical symbolic method for handling
elliptic integrals.

We describe our recent work on developing algorithms to
compute  elliptic  integrals.   We have adapted methods
used   by  Hermite  and  combined  them  with  our  own
innovations  to  establish algorithms that are suitable
for  computer  algebra  systems.   In  particular,  our
methods  allows us to represent an elliptic integral in
an  exact,  closed,  normal form in terms of Legendre's
basis integrals.  Our methods also have advantages when
numerical   evaluation   of  an  elliptic  integral  is
desired.  This  algorithm  implemented and incorporated
into Maple's integration procedure.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.ai
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Stan Matwin, Thursday 23 April 1992: AI
Date: 13 Apr 92 15:39:57 GMT


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

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

                                    AI
               GB119, at 11:00 a.m., Thursday 23 April 1992

                                Stan Matwin
           Department of Computer Science, University of Ottawa

           "Applications of Machine Learning to Software Reuse"

Software reuse is generally understood as the reapplication of the various
kinds of knowledge which were gathered during the development of one
software system to the development of another.  Composition and generation
are its two main approaches.  In composition-based reuse, existing software
components are retrieved, adapted and incorporated in the new system.  We
believe that tools to retrieve and adapt software must focus on knowledge-
based understanding (explanation), generalization and indexing to be
effective.  These three techniques have been exhaustively studied by the
machine learning (ML) community in general, and we at the University of
Ottawa have used them in a number of learning programs.  In a current
project we are prototyping several systems using selected ML approaches:
explanation-based and case-based learning, inductive learning and inductive
logic programming.  Our prototype systems address different aspects of
reuse, in particular the 'automatic' and 'manual' (browsing) retrieval of
old cases which are similar to a new one. The talk will describe some of
these systems and will argue that ML and AI in general could and should
contribute to software reuse.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Michael Fellows, Monday 20 April 1992: COMBINATORICS
Date: 13 Apr 92 16:10:01 GMT


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

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

                               COMBINATORICS
                 GB248, at 3:00 p.m., Monday 20 April 1992

                              Michael Fellows
                          University of Victoria

        "A Completeness Theory for Fixed-Parameter Intractability"

For many fixed-parameter problems that are trivially solvable in
polynomial-time, such as k-Dominating Set, essentially no better algorithm
is presently known than one which tries all possible solutions.  Other
problems, such as order testing in the minor order and many applications of
the Robertson-Seymour theory, exhibit fixed-parameter tractability: for
each fixed k the problem is solvable in time bounded by a polynomial of
degree c, where c is a constant independent of k.

A completeness theory for parameterized complexity behavior is presented,
based on circuit-defined complexity classes.  A number of natural problems,
including k-Dominating Set, k-Independent Set, and order testing in the
subgraph order, are shown to be complete for various levels of a hierarchy
that reflects, intuitively, increasing difficulty of solution-checking.
Some surprising properties of this hierarchy, including the precise
relationship of monotone and non-monotone circuit-defined classes, will be
described.

The theory appears to be applicable to a wide range of natural problems,
and to provide a framework for the investigation of a number of issues that
are analogs of well-studied questions concerning other models of
tractability.

At this point, we have completed a series of 3 papers, with more in
preparation.  The main results so far include: fundamental analogs of
Cook's theorem for the parameterized complexity setting, completeness
results for a wide variety of natural problems, an analog of Ladner's
theorem based on 0'' priority arguments, completeness results for
parameterized analogs of Pspace for problems such as whether a Geography
game can be won in at most k moves.  (Some of the later papers are joint
work with Karl Abrahamson and Ted Slaman.)
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.systems
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Barbara Liskov, Tuesday 14 April 1992: SYSTEMS
Date: 6 Apr 92 17:49:46 GMT


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

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

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

                              Barbara Liskov
                   Massachusetts Institute of Technology

                "Thor: An Object-Oriented Database System"

This talk describes a new object-oriented database system called Thor.
Thor is intended to be used in heterogeneous distributed systems to allow
programs written in different programming languages to share objects in a
convenient manner.  Thor  objects are persistent in spite of failures,  are
highly likely to be accessible whenever they are needed, and can be
structured to reflect the kinds of information of interest to users.  Thor
combines the advantages of the object-oriented approach with those of
relational databases: Users can store and manipulate objects that capture
the semantics of their applications, and can also access  objects via
queries.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.waterloo.edu ()
Subject: ICR Presents a Special Lecture on "Data Connectivity: Only Half the     Solution", on Thursday, April 16, 1992 at 10: 30 a.m. in DC 1302.
Keywords: Speaker:  Marjorie Templeton, Data Integration, Inc., Los Angeles, CA.
Organization: University of Waterloo
Distribution: ont
Date: Tue, 7 Apr 1992 14:38:45 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                  Presents a Special Lecture on


          "Data Connectivity:  Only Half the Solution"


                       Marjorie Templeton


                     Data Integration, Inc.
                     Los Angeles, California


                    Thursday, April 16, 1992
                           10:30 a.m.
      William G. Davis Computer Research Centre, Room 1302



ABSTRACT

The 80s were the decade of networking.   Now  we  are  addressing
problems  of  data  and  application level connectivity.  This is
necessary but not sufficient  for  enterprise  data  access.   It
fails  to  address  the problems of understanding the contents of
the data in different databases and of combining data  where  the
same  data  elements  are  represented  differently  in different
databases.

Important issues in  developing a federated  schema  of  multiple
databases  are:  1)  Description  of  the  contents  of  existing
databases, 2) Developing  a  standard  view  across  heterogenous
databases,  3)  Resolution  of  data  element  differences across
databases, 4) Recognition and handling  of  replicated  data,  5)
Dealing  with  functional differences in DBMSs.  Examples will be
drawn from InterViso.   InterViso  accesses  data  from  multiple
autonomous  databases  and  integrates  the  data  into  a single
report.   InterViso   provides   language,   schema,   and   data
translation as well as database location transparency.  This sets
it apart from the SQL gateway systems which   provide  only  DBMS
interface and location transparency.

An important component of InterViso is a data  dictionary  (DD/D)
that contains structural and semantic information about the data.
Before InterViso can run,  a  DD/D  Builder  program  is  run  to
develop the data model and to store it in the DD/D.



Biography

Mrs. Templeton is the founder and president of  Data  Integration
Inc.   which  develops  products for access to and integration of
data from preexisting  databases.   She  was  formerly  a  branch
manager  at System Development Corporation, which was acquired by
Unisys, where she was the chief architect of Mermaid, one of  the
first federated database systems.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.dbois
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Sundarajarao Sudarshan, Wednesday 15 April 1992: DATABASE
Date: 6 Apr 92 17:55:39 GMT


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

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

                                 DATABASE
               GB221, at 11:00 a.m., Wednesday 15 April 1992

                          Sundarajarao Sudarshan
                          University of Wisconsin

         "Optimizing Bottom-Up Evaluation for Deductive Databases"

In this talk we describe some results on the optimization of bottom-up
evaluation.  We start with a brief introduction to our model of bottom-up
evaluation of queries on deductive databases.  We then describe a technique
to rewrite and evaluate queries that use aggregate operations such as "min"
and "max".  This technique is of particular use when computing shortest-
path queries.  In the last part of the talk, we present some results
concerning bottom-up evaluation of programs that generate facts containing
variables.  Such facts are useful for specifying patterns or constraints on
facts, and to represent (possibly infinite) sets of facts in a concise
manner.  We first summarize some results on optimization of bottom-up
evaluation for such programs.  These optimization techniques lead to
significant speedups for some classes of programs. We then present a
comparison of bottom-up evaluation (using some of the above optimization
techniques) with the evaluation technique used by Prolog.  This comparison
extends earlier work that compared top-down and bottom-up evaluation.  We
discuss the benefits of bottom-up evaluation, as well as its drawbacks for
certain classes of programs.  Overcoming these drawbacks is an interesting
area for future research.