HDTenEightyP/NetNews huggingface dataset:
From: Mother Nature <gaea@zooid.guild.org>
Subject: Re: Response To Take Back The Night
Organization: The Zoo of Ids
Date: Tue, 13 Oct 1992 13:13:22 GMT

Note: I stuck a couple of articles in here because I thought they were both
relevant.


amdunn@mongrel.UUCP (Andrew M. Dunn) writes:
>Yes.  Men are told to get away from the marchers.  Even male members of
>the media have trouble getting near the march to photograph it for the
>newspaper, because they are _men_.

I really think that is so stupid. It's sexual discrimination, and while it's
been happening to women for centuries, it isn't going make it any better to
start discriminating against males.

***

>From: merce@xenitec.on.ca (Jim Mercer)
>Subject: Re: Response To Take Back The Night
>Date: 11 Oct 92 17:49:17 GMT
>
>things like "No man has the right to hit a woman".
>well no one has the right to hit anyone.

I agree with your second statement, however on the whole, men are stronger
than women, and can do more damage when they hit. Most men can overpower the
strongest woman.

>why are they painting all men as neanderthal beings with no sense of right
>or wrong?

They're stupid? :)

>when the "White Ribbon" campaign hit our place of work (The Law Society),
>men were expected to wear a white ribbon, symbolizing that they were keeping
>their arms down.  to me it was a symbol that said "i am a man, i am 
>genetically predisposed to beating women" and i refused to wear one.
>
>there were some women there who could not understand my reasoning, and
>basically said the "all men are potentially violent" thing.
>
>i almost went down to human resources and filed a sexual harrasment complaint.
>
>i didn't, because that is a pretty serious thing, but if it happens to me 
>again, i will.

You should. As someone who has a close personal relationship with a very
non-violent man, I KNOW that some men have absolutely NO capacity for
violence, and many may have the capacity, but would never use it. My boyfriend
(we live together) is _so_ non-violent that he won't watch cop shows, horror
movies, or even most sports. He is not a wimp, he's just a very gentle and
caring man, and that sort of stuff turns him right off. In fact, in the few
times we've gotten into serious arguements, _I_ was the one who hit him! I
didn't do much damage (I don't think :) but he never ever once tried to hit me
back.  

---
Gaea (Mother Nature)                     gaea@zooid.guild.org
ZOOiD Online, Toronto, Canada            (416) 322-7876
Newsgroups: ont.general,sci.electronics,rec.ham-radio
From: sp@u36.kwnet.on.ca (Sean P Goggin)
Subject: Printed Circuit Boards, Maker Wanted.
Organization: U36 Research
Date: Fri, 9 Oct 1992 04:00:40 GMT
Distribution: ont

I'm looking for someone to make a small quantity of 
printed circuit boards of professional quality.( < 10 )

Size is 7.5 x 13 cm G10 1.5 mm thick, double sided.

Any leads would be welcomed.

Thanks,

	Sean.

Sean P. Goggin
251, Bridge Street West, Waterloo, Ontario, Canada N2K 1L1
Voice +1 519 746 7535 Fax +1 519 747 2933 
email sp@bbi.kwnet.on.ca;sp@u36.uucp        N 43 29' 30" W 80 30' 15"
Newsgroups: ont.general
From: dominic@skaro.genie.uottawa.ca (Dominic Richens)
Subject: Re: Printed Circuit Boards, Maker Wanted.
Originator: dominic@shamin.genie.uottawa.ca
Reply-To: dominic@shamin.genie.uottawa.ca
Organization: MCRLab - University of Ottawa
Date: Wed, 14 Oct 92 17:55:07 GMT


In rec.radio.amateur.misc, sp@u36.kwnet.on.ca (Sean P Goggin) writes:

>I'm looking for someone to make a small quantity of 
>printed circuit boards of professional quality.( < 10 )

>Size is 7.5 x 13 cm G10 1.5 mm thick, double sided.

In Ottawa, we get ours done at:

Brock Circuits Inc.
101 Schneider Rd, 
Kanata ON,
K2K 1Y3 (613) 591-7321

We supply them with the masks (printouts) from an epson printer, as produced
by some PCB layout software, and they make the double sided board.  Pretty
cheap too, about 30$/board in quantities of one (15x30cm).

dominic

-- 
!@$^&*)($#$@!@#$^&*()_+_)(*&^$#@!$^&*()_+)(*&^$#@$^&*+_(*&^$#@#^&*()&*$#@(*&+_$!
 Dominic Richens  :  dominic@shamin.genie.uottawa.ca  :  Tel. (613) 564 9911 
      MCRLab, Dept of Elec Eng, University of Ottawa, K1N 6N5, CANADA   
"You construct intricate rituals which allow you to touch the skin of other men"
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.dbois
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Michael Stonebraker, Tuesday 20 October 1992: DATABASE
Date: 16 Oct 92 19:50:46 GMT


           Department of Computer Science, University of Toronto
         (MS = Medical Sciences Building, 1 King's College Circle)

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

                                 DATABASE
              MS4171, at 10:00 a.m., Tuesday 20 October 1992

                            Michael Stonebraker
                     University of California-Berkley

                   " SEQUOIA 2000 LARGE CAPACITY OBJECT
                SERVERS TO SUPPORT GLOBAL CHANGE RESEARCH"

Better data management is crucial to the success of scientific
investigations of Global Change.  Achieving the goals of the U.S.  Global
Change Research Program will depend not only on improved measurement
systems, but also on improved data systems that will allow scientists to
manipulate the resulting large-scale data sets and climate system models,
as well as compare model results with observations.  New modes of research,
especially the synergistic interactions between observations and model-
based simulations, will require massive amounts of diverse data to be
stored, organized, accessed, distributed, visualized, and analyzed.  The
SEQUOIA 2000 project involves computer scientists and environmental
researchers at several UC campuses who are collaborating to address these
challenges.  Specific tasks in very large scale I/O systems, migrating file
systems, extensible data base management, repository management and
visualization are underway and will be described.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: THEORY SEMINAR
Keywords: J.S. Devitt, Univ. Sask., visiting U. of W.
Organization: University of Waterloo
Distribution: ont
Date: Thu, 8 Oct 1992 20:50:35 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

THEORY SEMINAR

                    -Wednesday, October 14, 1992

J.  S.  Devitt, University of Saskatchewan (visiting University of
Waterloo),   will   speak   on  "Algorithmic  issues  in  the
characterization of similarity solutions for systems of
partial differential equations"

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

ROOM:                 DC 1304

ABSTRACT

The  methods  commonly used to solve systems of partial
differential  equations  often  begin  by  looking  for
transformations  of the coordinate system for which the
original equations invariant.  Systematic computational
methods  exist  for  characterizing  certain  types  of
similarity   transformations.    One   common  approach
involves   constructing   and   applying   an  extended
differential  operator  while  another reformulates the
problem  in  the language of differential forms and the
construction of differential ideals.

The  liesymm  package  in  Maple  fully  automates  the
     -------  -------
Harrison-Estabrook   procedure   for  constructing  the
determining  equations  of  the  isometry  group.  This
approach   uses   Cartan's   formulation  in  terms  of
differential forms and requires algebraic manipulations
that  differ  signficantly  from  the world of rational
polynomial manipulation.

In  this  talk  we  will  investigate  some of the data
structures  and algorithms required to work effectively
in this environment.  While we will include an overview
of  the algebra involved the material will be presented
primarily  as  a  case  study  and  will  focus  on the
computational issues that arise.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.ai,ut.dcs.vision
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Peter A. Sandon, Tuesday 20 October 1992: VISION/AI
Date: 13 Oct 92 22:15:58 GMT


           Department of Computer Science, University of Toronto
            (LP = D. L. Pratt Building, 6 King's College Road)

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

                                 VISION/AI
               LP266, at 10:30 a.m., Tuesday 20 October 1992

                              Peter A. Sandon
                             Dartmouth College

            "Attention, Active Vision and Manipulator Control"

One function of visual attention is as a filter that selects a portion of
the visual field for enhanced detection and recognition processing.  A
second function of attention is to provide localization information, which
can be used in guiding motor activity.  A visual system in which the eyes
can be moved requires such localization information to guide eye movements.
Furthermore, the control of arm and hand movements for object manipulation
is simplified by attentional localization of the hand.  In a binocular
vision system, attentional selection can localize a target object in a 3-D
retinocentric coordinate frame.  The eye and arm motor systems can be
expressed in terms of this same retinocentric coordinate frame to simplify
the computations needed for controlling movement.  A number of simple
visuomotor behaviors have been developed and implemented, based on the
combination of active, attentional vision and the retinocentric,
differential kinematics of the motor systems.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: VLSI Seminar
Keywords: K. Stevens, Comp. Sci. Dept., Univ. Calgary
Organization: University of Waterloo
Distribution: ont
Date: Fri, 16 Oct 1992 17:48:41 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

VLSI SEMINAR

                    -Friday, October 23, 1992

K.  Stevens, Computer Science Department, University of
Calgary,  (formerly  HP  Laboratories,  Palo Alto) will
speak   on  "Synthesis  of  Asynchronous  Finite  State
Machines".

TIME:                 10:30 a.m. - 11:30 a.m.

ROOM:                 DC 1304

ABSTRACT

A  tool  called MEAT has been designed to automatically
synthesize   transistor-   level   self-timed   control
circuits.  MEAT has been used to specify and synthesize
circuits  for  a  fully  self-timed  300,000 transistor
communication   coprocessor  called  the  Post  Office.
Designs  are  graphically  represented similar to Mealy
state  machines.  A  new limited form of multiple input
change  signalling  called  BURST-MODE  was introduced.
The primary goal of MEAT is to produce fast and compact
circuits.

The application and design of MEAT as an AFSM synthesis
tool  will  be  discussed,  as well as some experiences
using it to design the large Post Office chip.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: THEORY SEMINAR
Keywords: N. Bshouty, Univ. Calgary
Organization: University of Waterloo
Distribution: ont
Date: Fri, 16 Oct 1992 12:00:41 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

THEORY SEMINAR

                    - Wednesday, October 21, 1992

Nader  Bshouty,  University  of  Calgary, will speak on
"Learning from Counterexamples"

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

ROOM:                 DC 1304

ABSTRACT

We  show  negative  and positive results for sequential
and  parallel  learning  of classes of boolean formulas
from     assignments     (membership    queries)    and
counterexamples (equivalence queries).

Can  we learn a class C quickly in parallel (i.e., C is
NC-learnable)   when   polynomial  sequential  learning
algorithms exist for C (i.e., C is P-learnable) ?

We will show that P-learnable not =   NC-learnable.

Newsgroups: ont.events
From: Kaizhong Zhang <kzhang@csd.uwo.ca>
Subject: Colloq. Friday, Oct. 23, 1992
Organization: Relayed-by-Sendmail
Date: Fri, 9 Oct 1992 19:46:14 GMT
To: 42131_3665@uwovax.uwo.ca, KIRBY@VAXR.SSCL.UWO.CA, allcs@csd.uwo.ca,
        brenda@engrg.uwo.ca, creider@csd.uwo.ca, dawes@uwovax.uwo.ca,
        eagleson@uwovax.uwo.ca, elmarag@uwovax.uwo.ca, grads@csd.uwo.ca,
        hugh@engrg.uwo.ca, jjiang@uwovax.uwo.ca, m.kinnucan@uwo.ca,
        ont.events@newshost.uwo.ca, tague@uwo.ca, undergrads@gaul.csd.uwo.ca,
        uwo.general@newshost.uwo.ca, wy@apmaths.uwo.ca, zakaria@csd.uwo.ca

          The University of Western Ontario
            Department of Computer Science

                    COLLOQUIUM

Speaker: Zvi M. Kedem, Courant Institute
Title:   Coping with Asynchrony in Parallel Systems
Time:    Friday, 23, 1992, at 2:00pm
Place:   MC 320
Abstract:
  High-level parallel programming languages are designed to present a
  simple virtual machine model to the programmer.  This allows the
  programmer to focus on the essentials of the correctness and
  efficiency of programs, and thereby improves productivity. However,
  engineering constraints do not always allow these idealized
  abstractions to be directly implemented in practice.  A natural
  approach to bridging this gap is via mechanisms for automatically
  transforming the parallel algorithms or programs designed in the
  (idealized) high-level language to execute correctly on machines that
  can be actually realized in practice.
  
  In this talk, we will describe program transformations that provide a
  basis for the compilation of (ideal) {\it synchronous\/} programs to
  run efficiently on {\it asynchronous\/} parallel machines with shared
  memory.  In addition to being correct and efficient, the transformed
  programs have the important property that they are {\it responsive\/}.
  Essentially, responsive computations always make progress on the
  asynchronous target machine without waiting for slow or failed
  processors to complete their work.  Therefore, responsive executions
  are {\it fault-tolerant\/} in the following strong sense: the
  computation will terminate correctly even if processors fail
  arbitrarily often during the computation, as long as at least one
  processor is executing correctly at any time.  No implicit assumptions
  about the relative speeds of processors, or about synchronization
  primitives built into the target machines, are required for our
  methods to work.  By using randomization, we can guarantee that the
  executions on the asynchronous targets are guaranteed to require small
  overhead in space and work.

  This is joint work with Krishna Palem, Michael Rabin, and Arvind
  Raghunathan.
Newsgroups: ont.events
From: Kaizhong Zhang <kzhang@csd.uwo.ca>
Subject: Colloq. Thursday, Oct. 15, 1992
Organization: Relayed-by-Sendmail
Date: Tue, 13 Oct 1992 16:42:54 GMT
To: 42131_3665@uwovax.uwo.ca, KIRBY@VAXR.SSCL.UWO.CA, allcs@csd.uwo.ca,
        brenda@engrg.uwo.ca, creider@csd.uwo.ca, dawes@uwovax.uwo.ca,
        eagleson@uwovax.uwo.ca, elmarag@uwovax.uwo.ca, grads@csd.uwo.ca,
        hugh@engrg.uwo.ca, jjiang@uwovax.uwo.ca, m.kinnucan@uwo.ca,
        ont.events@newshost.uwo.ca, tague@uwo.ca, undergrads@gaul.csd.uwo.ca,
        uwo.general@newshost.uwo.ca, wy@apmaths.uwo.ca, zakaria@csd.uwo.ca

          The University of Western Ontario
            Department of Computer Science

                    COLLOQUIUM

Title:   EXTRACTING PROCEDURAL KNOWLEDGE FROM SOFTWARE SYSTEMS USING
         INDUCTIVE LEARNING IN THE PM SYSTEM
Speaker: Professor Robert G. Reynold, Wayne State University,
Time:    Thursday, Oct. 15, at 2:00pm
Place:   MC 320
Abstract:
       Biggerstaff and Richter suggest that there are four fundamental
subtasks associated with implementing software reuse: finding reusable
components, understanding these components, modifying these components
for a new application,and composing components. Basili and others have
proposed similar schemes.  In the PM project each of these problems is
reexpressed as a problem in machine learning.  First, the system needs
to acquire knowledge from the user  that describes the what is done in
each phase.  This knowledge is stored in an associated knowledge base.
Second,  this knowledge is applied to new systems  in order to support
the users domain  dependent  resue activities.   The current prototype
operationalizes the first two subtasks,  the finding and understanding
of candidates for reuse.   Examples of how the system can extract such
procedural knowledge from existing resue libraries are given.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: Software Engineering Seminar
Keywords: A. Heaton, Jupiter Consortium
Organization: University of Waterloo
Distribution: ont
Date: Wed, 7 Oct 1992 19:01:07 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

SOFTWARE ENGINEERING SEMINAR

                    -Friday, October 9, 1992

Anne  Heaton,  Jupiter  Consortium,  U.K. will speak on
"Continuing Education in Software Engineering."

TIME:                 10:30-11:30 a.m.

ROOM:                 DC 1304

ABSTRACT

Jupiter is an industry-university consortium offering a
modular  Master's Program in Software Engineering.  The
program    is   specifically   designed   for   working
professionals.

Anne  Heaton  will  give  an  overview  of  the Jupiter
Consortium  and  the  Master's  Program  which  will be
followed by an open discussion.

Newsgroups: ont.events
From: Kaizhong Zhang <kzhang@csd.uwo.ca>
Subject: Colloq. Wednsday, Oct. 14, 1992
Organization: Relayed-by-Sendmail
Date: Tue, 13 Oct 1992 16:42:03 GMT
To: 42131_3665@uwovax.uwo.ca, KIRBY@VAXR.SSCL.UWO.CA, allcs@csd.uwo.ca,
        brenda@engrg.uwo.ca, creider@csd.uwo.ca, dawes@uwovax.uwo.ca,
        eagleson@uwovax.uwo.ca, elmarag@uwovax.uwo.ca, grads@csd.uwo.ca,
        hugh@engrg.uwo.ca, jjiang@uwovax.uwo.ca, m.kinnucan@uwo.ca,
        ont.events@newshost.uwo.ca, tague@uwo.ca, undergrads@gaul.csd.uwo.ca,
        uwo.general@newshost.uwo.ca, wy@apmaths.uwo.ca, zakaria@csd.uwo.ca

          The University of Western Ontario
            Department of Computer Science

                    COLLOQUIUM


Speaker: Professor Charles Ling, Western Ontario
Title:   Answering Connectionist Challenge
         A symbolic model for learning Past Tenses of English Verbs
Time:    Wednesday, October 14, 1992, at 2:00pm
Place:   MC 320
Abstract:
Are Artificial Neural Networks (ANNs) more adequate models for
``complicated'' human learning tasks than symbolic learning methods?
What kind of tasks can be better learned and generalized
by using ANNs or symbolic methods?
We give some answers to these questions, and study a benchmark task
-- the learning of past tenses of English verbs. Connectionist models
have been claimed to be successful in solving this learning task.
MacWhinney and Leinbach (1991) pose a challenge claiming that no
symbolic methods can perform as well as their connectionist model.
We design a general purpose Symbolic Pattern Associator (SPA)
based on ID3 (see Quinlan (1986)) that can learn and generalize
from any patterns.
In comparison to the connectionist models, the SPA is able to
generalize much better to the past tenses of unseen regular and
irregular verbs. The SPA's performance is also more psychologically
realistic in many aspects. In addition, the SPA is able to represent
the acquired knowledge in production rules which are meaningful to
human observers, and which allow further generalization and integration
into other learning modules. On the other hand, the connectionist models
leave the acquired knowledge in a mysterious black-box.

This represents collaborative work with Steve Cherwen and Marin Marinov.

MacWhinney and Leinbach (1991). Implementations are not conceptualizations:
Revising the verb model. In Cognition, volume 40. Pages 121 - 157. 1991

Quinlan (1986). Induction of decision trees. In Machine Learning,
Volume 1. Pages 81 - 106. 1986.
Newsgroups: ont.events
From: sekuler@psych.toronto.edu (Allison Sekuler)
Subject: PERCEPTION
Organization: Department of Psychology, University of Toronto
Distribution: ont
Date: Tue, 13 Oct 92 21:36:57 GMT


              * RESEARCH GROUP IN PERCEPTION *


        
                      MARLENE BEHRMANN
   Rotman Institute and the Dept. of Psychology, U of T 

  
  "ATTENTION PROCESSING AND SPATIAL FRAMES OF REFERENCE:
     EVIDENCE FROM PATIENTS WITH HEMISPATIAL NEGLECT."


              3 pm, Friday, October 16, 1992  
  Room 317, 1 Spadina Crescent, St. George Campus, U of T





All are welcome. Donut holes will be provided.
For more information, contact Allison Sekuler at:
978-1537 or sekuler@psych.toronto.edu

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: SCIENTIFIC COMPUTATION SEMINAR
Keywords: Youcef Saad, Univ. MInnesota, Dept. Comp. Sci.
Organization: University of Waterloo
Distribution: ont
Date: Wed, 14 Oct 1992 21:27:10 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

SCIENTIFIC COMPUTATION SEMINAR

                    -Thursday, October 15, 1992

Youcef  Saad, University of Minnesota, Dept of Computer
Science   -  4-192  EE/CS  Bldg.,  200  Union  St.  SE,
Minneapolis, MN, saad@cs.umn.edu will speak on "ILUM: a
masively   parallel   multi-elimination  incomplete  LU
factorization".

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

ROOM:                 DC 1304

ABSTRACT

Proconditioned  Krylov subspace  techniques are rapidly
gaining  ground against  direct solvers in the solution
of   large   sparse   linear   systems   arising   from
3-dimensional  models.  When implementing these methods
on  parallel   machines    one  faces  the   difficulty
that    the   standard  preconditioners    are    often
sequential   and   can   cause  serious bottlenecks. In
this  talk  we will consider several different  ways of
circumventing    the   difficulty.   A   new   approach
called    ILUM   which   allows   a   high   degree  of
parallelism   is  presented.   This  approach is formed
and the process  is recursively repeated a  few  times.
In  order  to avoid  a large  amount of  fill-in during
this  elimination process, a dropping strategy is added
thus   providing   an  incomplete factorization similar
to  ILUT  and   other   strategies  introduced  in  the
literature.  A  few  preliminary  numerical experiments
will be presented.

Newsgroups: ont.events