HDTenEightyP/NetNews huggingface dataset:
From: chare@unilabs.uucp (Chris Hare)
Subject:  AT&T hardware wanted
Summary: hardware wanted
Organization: None: Just Me, Chris Hare
Distribution: ont
Date: Mon, 27 Jul 1992 21:09:13 GMT

Hey out there!

If there is anyone who has a working AT&T 7300 or 3b1 that they want to get
rid of (preferably for nothing), then let me know.  Depending upon where it
and you are, I'll cover the shipping.  I'd also like whatever software you
have for it.

Both of these machines were shipped with OS, DS, and TP tools, so I'd like
a complete licence.  I may be in the market for a couple of them, so any
and all donations will be gladly received.

Please reply by e-mail with a way of contacting you via land-line, or you
cn call me at work (613) 238-1050.

Thanks.

Chris Hare
-- 
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Chris Hare				UUCP : uunet.ca!choreo!unilabs!chare
SCO Authorized Instructor		Choreo Systems Inc., Ottawa Canada
*** STANDARD DISCLAIMER APPLIES ***	DOMAIN: chare@choreo.ca
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.waterloo.edu (wlrush)
Subject: THEORY SEMINAR NOTE DIFFERENT DAY
Keywords: Jon Sorenson, Dept. Comp. Sci., Butler Univ.
Organization: University of Waterloo
Distribution: ont
Date: Fri, 24 Jul 1992 12:35:59 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

THEORY SEMINAR

   - Monday, July 27, 1992   *** NOTE DIFFERENT DAY ***

Jon   Sorenson,   Dept.  of  Computer  Science,  Butler
University, will speak on "GCD Algorithms"

TIME:                 11:30 a.m. - 12:30 p.m.

ROOM:                 DC 1304

ABSTRACT

The  greatest common divisor, or GCD, of the integers u
and v is the largest integer d such that d divides both
u  and  v.   In  this talk, we will discuss 6 different
algorithms for computing GCDs.

The  first  two algorithms, the Euclidean algorithm and
the  least-remainder  Euclidean algorithm, are hundreds
of  years  old  and yet are still considered reasonable
                                                2
algorithms by modern standards.  Both run in O(n ) time
on n-bit inputs.

The  second  two  algorithms, the binary and left-shift
binary GCD algorithms, exploit the binary nature of the
modern  digital computer.  These algorithms also run in
   2
O(n )  time.   However,  on  most  machines, the binary
algorithms    routinely    outperform   the   classical
algorithms.

The  last  two  algorithms,  the  right- and left-shift
k-ary  GCD  algorithms,  are  new.  They generalize the
                               2
binary  algorithms and have O(n /logn) running times if
k is chosen carefully.

We  will  conclude  by  comparing implementation timing
results for all six algorithms.

Newsgroups: ont.events
From: Kaizhong Zhang <kzhang@csd.uwo.ca>
Subject: Colloq. next Thursday (Aug. 6, 1992)
Organization: Relayed-by-Sendmail
Date: Tue, 28 Jul 1992 19:34:05 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@uwo.ca, tague@uwo.ca, undergrads@gaul.csd.uwo.ca,
        uwo.csd@uwo.ca, uwo.general@uwo.ca, wy@apmaths.uwo.ca,
        zakaria@csd.uwo.ca


                           Dr. Valtteri Niemi

                           University of Turku\\
                                 Finland

		             will speak on

                        Generalized Gauss codes


                            A B S T R A C T


   Consider a closed oriented curve in the plane. 
Furthermore, assume  all points where  the curve touches 
itself are crossing points  and the curve crosses itself 
exactly once at each crossing point. Now label the crossing 
points by 1, ..., n.  A word, obtained by picking up each 
label that is passed while going one round along the curve, 
is called Gauss code.

  The notion has recently been generalized.  We study 
some generalizations and  introduce a new one where labels 
of distinct crossing points need not be distinct.  The new 
concept can be viewed as an object in formal language theory. 
Indeed, in the new framework  arbitrarily long codes over 
fixed finite alphabet exist.

   We present results and open problems on new codes and 
languages formed by them.

{\bf DATE}: Thursday, August 6, 1992.\\
{\bf TIME}: 2:00 pm\\
{\bf PLACE}: Middlesex College, Room 354\\
Coffee and cookies will be served after the colloquium in room 300
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Paul Beame, Thursday 23 July 1992: THEORY
Date: 21 Jul 92 18:47:15 GMT


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

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

                                  THEORY
                LP266, at 2:00 p.m., Thursday 23 July 1992

                                Paul Beame
                         University of Washington

       "Randomized versus Nondeterministic Communication Complexity"

The two-party communication complexity of Boolean functions has been
studied extensively because of its connections with VLSI and its (more
recently discovered) connections with the depth of Boolean circuits.  It
also provides a nice arena in which to study the relationships between
determinism, nondeterminism and randomization.  In this model,
nondeterminism and randomization are provably more efficient than
determinism.  The question we consider is if randomization is always as
efficient as nondeterminism.  We show that the popular `static' methods for
obtaining lower bounds for randomized algorithms cannot resolve this
question.  Using more recent `dynamic' methods we exhibit a Boolean
function $f$ with nondeterministic and co-nondeterministic complexities $O(

Joint work with Joan Lawry.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: edith@cs.toronto.edu (Edith Fraser)
Subject: Paul Beame, Thursday 23 July 1992: THEORY
Date: 21 Jul 92 19:21:55 GMT


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

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

                                  THEORY
                LP266, at 2:00 p.m., Thursday 23 July 1992

                                Paul Beame
            Dept. of Computer Science, University of Washington

       "Randomized versus Nondeterministic Communication Complexity"

The two-party communication complexity of Boolean functions has been
studied extensively because of its connections with VLSI and its (more
recently discovered) connections with the depth of Boolean circuits.  It
also provides a nice arena in which to study the relationships between
determinism, nondeterminism and randomization.  In this model,
nondeterminism and randomization are provably more efficient than
determinism.  The question we consider is if randomization is always as
efficient as nondeterminism.  We show that the popular `static' methods for
obtaining lower bounds for randomized algorithms cannot resolve this
question.  Using more recent `dynamic' methods we exhibit a Boolean
function f with nondeterministic and co-nondeterministic complexities O(log
n) and epsilon-error randomized complexity Omega(log^2 n), for 0 leq
epsilon < 1/2.

Joint work with Joan Lawry.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: MASTER'S THESIS PRESENTATION
Keywords: E. Fink, graduate student, Dept. Comp. Sci., Univ. Waterloo
Organization: University of Waterloo
Distribution: ont
Date: Fri, 31 Jul 1992 18:13:25 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

MASTER'S THESIS PRESENTATION

                    -Tuesday, August 4, 1992

Eugene  Fink,  graduate student, Dept. Comp. Sci., will
speak on "Justified plans and ordered hierarchies"

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

ROOM:                 DC 1331

ABSTRACT

Artificial  Intelligence  Planning  is  concerned  with
algorithms  for  finding ways to achieve a desired goal
starting  from some initial state. Given an initial and
goal  state described by sets of literals, and a set of
simple  steps,  a  planning  algorithm  has  to  find a
sequence  of steps that leads from the initial state to
the goal state.

We consider two methods for improving the efficiency of
planning  algorithms.  One  of the methods is to assign
some  level  of criticality to each literal. A planning
algorithm  may  first find an outline of a desired plan
that  achieves  only  critical  goal literals. Then the
plan  is  refined  by inserting steps that achieve less
critical  literals.  This  subdivision  of the original
problem  into smaller subproblems sometimes leads to an
exponential time saving.

The  other method is to divide the results of each step
into primary results and side results and to use a step
only  based  on its primary results. This method allows
us  to  reduce the branching factor while searching for
steps that achieve a goal.

We describe algorithms that determine the criticalities
of  literals  and  choose the primary effects among all
effects  of  the  operators. Then we show how these two
techniques   may   be  used  together  to  improve  the
efficiency of planning.

Newsgroups: ont.events
From: Kaizhong Zhang <kzhang@csd.uwo.ca>
Subject: Colloq. tomorrow at 2:00pm
Organization: Relayed-by-Sendmail
Date: Mon, 20 Jul 1992 22:57:52 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@uwo.ca, tague@uwo.ca, undergrads@gaul.csd.uwo.ca,
        uwo.csd@uwo.ca, uwo.general@uwo.ca, wy@apmaths.uwo.ca,
        zakaria@csd.uwo.ca

SPEAKER: Carl-Johan Seger, UBC.
TITLE: Formal Hardware Verification 
DATE: Tuesday, July 21, 1992
TIME: 2:00 pm
PLACE: Middlesex College, Room 354


                          Carl-Johan Seger

                     University of British Columbia



		             will speak on

                      Formal Hardware Verification 


                            A B S T R A C T


As digital systems become more complex, traditional methods
of  validating  a design by simulation become unreliable. In
particular, the introduction of  aggressive  pipelining  and
concurrently-operating subsystems makes it increasingly dif-
ficult to  anticipate  the  many  very  subtle  interactions
between  logically  unrelated  system  activities. Thus, the
``quality'' of the validation achieved by traditional  simu-
lation  is  rapidly  deteriorating  as  the  VLSI technology
progresses. The goal of formal verification is  to  overcome
this  weakness  by  proving  that  a  circuit  will meet its
specification under all possible operating conditions.

There are three main approaches to formal  HW verification:
theorem proving, model checking, and symbolic simulation. In
this talk we will first breifly outline all three.  We  then
show  how these methods can be combined to achieve verifica-
tion results that are hard, or even impossible,  to  achieve
with any single one of the approaches.  We will focus on the
Voss  symbolic  simulation  based  verification  tool  being
developed  at  UBC  and  describe  current  ongoing  work on
developing a ``mathematical'' interface with the HOL  higher
order logic theorem prover.
\vspace{3mm}

DATE: Tuesday, July 21, 1992
TIME: 2:00 pm
PLACE: Middlesex College, Room 354
Coffee and cookies will be served after the colloquium in room 300
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.uwaterloo.ca ()
Subject: ICR Presents a Colloquium on "Image Processing Research at the Univer-  sity of Porto", on Wednesday, August 5/92 at 3:30 pm. in DC 1302.
Keywords: Speaker:  Dr. Aurelio J. Campilho, Faculty of Engineering, University  of Porto, Portugal.
Organization: University of Waterloo
Distribution: ont
Date: Wed, 29 Jul 1992 20:26:35 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                    Presents a Colloquium on

      Image Processing Research at the University of Porto



by:     Dr. Aurelio J. Campilho

of:     Faculty of Engineering
        University of Porto
        Portugal



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



Abstract:

The activities of the Image Processing Group at the University of
Porto spread out over several fields, addressing both theoretical
and practical aspects of Image Processing and Analysis.  Analysis
of medical images, quantitative image analysis, visual inspection
and computer vision are some of the current activities.  In  this
talk,  I  will  give an overview of such activities.  Special em-
phasis will be on the  methodologies  followed  in  two  specific
fields:   analysis  of ophthalmic images; three dimensional image
acquisition and segmentation.

In the first  field,  the  approaches  used  for  lossless  image
compression  using  hierarchical  multiresolution methods and for
image registration and analysis aiming at the  patient  follow-up
will be described.

In the second field, a 3-D data acquisition system  based  on  an
intensity  ratio depth sensor and a 3-D segmentation method using
both range and intensity information will be presented.



Everyone welcome.  Refreshments served.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: MASTER'S ESSAY PRESENTATION
Keywords: R. Fedorowicz, graduate student, Dept. Comp. Sci., Univ.
Organization: University of Waterloo
Distribution: ont
Date: Fri, 31 Jul 1992 18:11:49 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

MASTER'S ESSAY PRESENTATION

                    -Friday, August 7, 1992

Richard Fedorowicz, graduate student, Dept. Comp. Sci.,
Univ.  of  Waterloo  will  speak  on  ``Object Oriented
Representation of Geographic Information''.

TIME:                 11:00 a.m. - 12:00 noon

ROOM:                 DC 1331

ABSTRACT

The field of geographic information systems has largely
ignored    object-oriented    technology.     We   have
investigated  this  option  and  developed  an  object-
oriented  schema  for  a GIS.  The schema is capable of
representing  both  physical  and  logical information.
This  allows the schema to support applications such as
finding  optimal  routes  in  a  street network.  These
types  of  applications have been neglected in previous
research efforts.

We will first examine a couple of recent GISs that have
appeared  in the literature.  Then, we will present our
schema  and  discuss  a  sample application that can be
built on top of it.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: MASTER'S ESSAY PRESENTATION
Keywords: S. Suarga, grad student, Dept. Comp. Sci., Univ. Waterloo 
Organization: University of Waterloo
Distribution: ont
Date: Fri, 31 Jul 1992 18:10:01 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

MASTER'S ESSAY PRESENTATION

                    -Friday, August 7, 1992

S. Suarga, graduate student, Dept. Comp. Sci., Univ. of
Waterloo  will  speak on ``An Implementation of a Stiff
ODE Solver in MAPLE.''

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

ROOM:                 DC 1304

ABSTRACT

An  Integrator  for  solving  a  ``Stiff  Initial Value
Problem  of  an  Ordinary  Differential  Equation''  is
implemented  in  MAPLE using the ``theta method''.  The
Theta  method  is  an  implicit  one-step integrator of
order  2  if  THETA approx. 0.5  and  order  1  if THETA approx. 1.0. 
This implementation  used  a  THETA value between 0.55 and 0.78.
It  was tested on standard stiff ODE tests and compared
to some known Stiff ODE Solvers.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.waterloo.edu (wlrush)
Subject: MASTER'S ESSAY PRESENTATION
Keywords: D. Dueck, graduate student, Dept. Comp. Sci., Univ. Waterloo
Organization: University of Waterloo
Distribution: ont
Date: Fri, 24 Jul 1992 12:34:22 GMT

DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

MASTER'S ESSAY PRESENTATION

                    -Wednesday, July 29, 1992

David  Dueck, graduate student, Dept. Comp. Sci., Univ.
Waterloo, will speak on "Distributed Garbage Collection
Made Easy".

TIME:                 11:00 a.m. - 12:00 p.m.

ROOM:                 DC 3552D (Shoshin Lab)

ABSTRACT

Garbage  collection  provides  the run-time system of a
programming  language with the ability to automatically
reclaim the memory no longer being used by an executing
program.   Since  the  late  fifties and early sixties,
much   research   has  been  devoted  to  the  task  of
developing  efficient garbage collection algorithms for
both single processor and multiprocessor architectures.
Distributed   solutions   to  garbage  collection  have
evolved  from  these early algorithms and, as a result,
much of the literature fails to clearly distinguish the
desirable  characteristics  of  these solutions.  These
characteristics  are  that the garbage collector should
collect  all  garbage,  including  distributed  cycles,
present  in  the  system, rely on as little centralized
control  as possible, have minimal communication costs,
disturb   the  mutator  (user  program)  as  little  as
possible, and be fault tolerant.  Based on a literature
survey   of  the  topic,  we  discuss  these  desirable
characteristics  and  outline the design decisions they
imply.   Some  possible  areas for future research will
also be discussed.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.waterloo.edu ()
Subject: ICR Presents a Seminar on "Decision Construction Set (DCS)", on Tues.,  July 28, 1992, at 2:00 pm, in DC 1304.
Keywords: Speaker: Mr. Richard M. Helms, IBM Canada Lab., Image Systems Centre,  North York, Ontario.
Organization: University of Waterloo
Distribution: ont
Date: Wed, 22 Jul 1992 18:47:33 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                      Presents a Seminar on

                 Decision Construction Set (DCS)


by:     Mr. Richard M. Helms

of:     IBM Canada Laboratory
        Image Systems Centre
        North York, Ontario


Date:   Tuesday, July 28, 1992  
Time:	2:00 p.m.
Place:  William G. Davis Computer Research Centre, Room 1304


Abstract:

Decision Construction Set (DCS) is a qualitative decision support
system.   The  goals  of the system are to:  1) Give structure to
the decision making process; 2) Document the  factors  that  went
into  the  decision;  3) Help organize the various aspects of the
issue to aid in the decision making process; 4) Prepare output in
a format that is practical for the user; 5) Serves as a reference
tool.

So far systems that support  problem  formulation  and  solutions
findings  are  either  AI with narrow application domains or pro-
grams that deal with easily quantifiable problems.  DCS is non of
the above.  It is not a computer tool that makes decisions.  It's
a system that acts as a decision aid.  DCS does not  analyze  the
input  data.   DCS  only records it in an organized way, based on
IBIS theory, to make it easier for the user to make the decision.
It  is a tool to enhance and facilitate the cognitive process in-
volved in making a decision.  This talk describes the theory  and
structure of the system.

Biography:

Mr. Helms joined IBM in 1976.  He is currently part of the Toron-
to  Image  Systems  Centre,  where  he  is  a  Senior Development
Analyst.  Since joining IBM, Mr. Helms  has  worked  in  Canadian
marketing in both sales and support roles.  He joined the IBM Ca-
nada Laboratory in 1982 where he  co-founded  the  Toronto  Image
Systems  Centre.  In 1988, he became the Lead Image Architect for
IBM.  In 1990, Mr. Helms joined the Centre for  Advanced  Studies
and  doing research in CSCW.  Mr. Helms received his B.A. in pure
mathematics from Clarion University,  Clarion,  Pennsylvania,  in
1971. Mr. Helms can be reached at helms@torolab2.vnet.ibm.com.


Everyone welcome.  Refreshments served.

Newsgroups: ont.test
From: chrisk@revcan.rct.ca (Chris King)
Subject: my test
Organization: Revenue Canada, Taxation; Office Communications Division
Distribution: ont
Date: Wed, 22 Jul 1992 15:52:20 GMT

kaiser...
-- 
 <>			\<>	 <>				<>__o
<#\	Christopher	//\	<)(\	chrisk@revcan.rct.ca	/\\
/ >	King		))	 ||	(613)952-1043		 < \
~ ~			~~	 ~~				 ~ ~
Newsgroups: ont.test
From: chare@unilabs.uucp (Chris Hare)
Subject: Re: Test 2 - Fm SYNAPSE
Organization: None: Just Me, Chris Hare
Date: Sun, 26 Jul 1992 19:00:45 GMT

Yup.

your tests are making it.


-- 
+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
Chris Hare				UUCP : uunet.ca!choreo!unilabs!chare
SCO Authorized Instructor		Choreo Systems Inc., Ottawa Canada
*** STANDARD DISCLAIMER APPLIES ***	DOMAIN: chare@choreo.ca
From: jim@sco.COM (Jim Sullivan)
Newsgroups: ont.jobs
Subject: C++ Programmers/Contract Positions
Date: 23 Jul 92 17:20:08 GMT
Organization: SCO Canada, Inc.

Please do not respond via e-mail, I'm posting this for a friend:

He requires some C++ programmers for some contract work.  Contract would
be for approximately one year.  Please contact David Savel at 681 8395
-- 
Jim Sullivan				
SCO Canada, Inc. Toronto, Ontario	"If you poke the Pillsbury
jim@scocan.sco.com, ...!uunet!scocan!jim Doughboy, he giggles"
416 922 1937 (8397 for fax)		 - me on an off day.
Newsgroups: ont.jobs,can.jobs,comp.windows.ms.programmer
From: tbray@watdragon.uwaterloo.ca (Tim Bray)
Subject: Windows programmer sought
Organization: University of Waterloo
Date: Thu, 30 Jul 1992 16:50:02 GMT

Open Text Corporation is a fast-growing and profitable player in the
full-text and text-database markets.  We have a prestigious list of
customers, including famous names in Canada, the U.S.A., Europe, and Asia.

Our products are based entirely on a client-server model of computing.
Increasingly, the clients are personal computers running Microsoft Windows.
We have undertaken to develop a variety of client and server modules for
execution in the Windows environment.

We have an immediate opening for a software engineer to lead the design and
implementation of these modules.  The prerequisites are high programming
proficiency and demonstrated ability to deliver results in the Windows
environment.  Experience with LAN technology and with Unix would also be
desirable.

Open Text's business success has been based on the fact that our technology
offers both a variety of features and a level of performance that are
unequalled by the competition.  To maintain this lead, it is necessary that
we hire only the best, that we provide highly competitive compensation, and
that we demand technical excellence on a routine basis.

Open Text is a small, fast-moving, enjoyable place to work.  We are located
in Waterloo, Ontario.

Responses should be directed to myself.  Because of my travel schedule,
e-mail is not a reliable way to reach me.  Please send responses by mail or
FAX, or contact me by phone.

Cheers, Tim Bray
 Senior Vice President, Technology

Open Text Corporation:
 Suite 550, 180 King St. S., Waterloo, Ontario, N2J 1P8
 Phone 519-571-7111, FAX 519-571-9092
Newsgroups: ont.jobs