HDTenEightyP/NetNews huggingface dataset:
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Faith E. Fich, 1 October 1992: THEORY
Date: 28 Sep 92 13:51:39 GMT


           Department of Computer Science, University of Toronto
         (SF = Sandford Fleming Building, 10 King's College Road)

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

                                  THEORY
                   SF1105, at 3:00 p.m., 1 October 1992

                               Faith E. Fich
           Department of Computer Science, University of Toronto

                        "A Lower Bound on the Space
               Complexity of Randomized Wait-free Consensus"

Herlihy proved that, with atomic read/write registers, even two processes
cannot achieve wait-free consensus using a deterministic algorithm.
However, using randomization, $n$ processes can achieve wait-free
consensus.  In this talk, I will prove that $Omega(rt n)$ atomic read/write
registers (of unbounded size) are necessary to solve $n$-process consensus.
This is the only lower bound for randomized wait-free computation that is
known.

This work is joint with Maurice Herlihy and Nir Shavit.

Newsgroups: ont.events,sci.math.stat
From: ruth@utstat.uucp (Ruth Croxford)
Subject: York-Toronto Statistics Seminar - Muni Srivastava
Organization: U of Toronto Statistics
Distribution: ont
Date: Mon, 5 Oct 1992 19:12:57 GMT
Expires: 16-oct-1992

                       C O L L O Q U I U M

                     UNIVERSITY  OF  TORONTO
                   DEPARTMENT  OF  STATISTICS
                      100 St. George Street
                     Toronto, Canada M5S 1A1
                   YORK-TORONTO SEMINAR SERIES

TOPIC:         On-line Quality Control Procedures based on Random Walk Model
               and Integrated Moving Average Model of Order (0,1,1)

SPEAKER:       Professor M. Srivastava
               Department of Statistics, University of Toronto
DATE:          October 15, 1992  1:30 p.m.
PLACE:         Ross Building, York University,  Room S577

ABSTRACT:

     Taguchi et al.'s (1989) random walk model for an on-line
quality control procedure is re-examined and a more accurate
approximation of the long run average cost rate is provided.  An
approximate solution for the optimal parameters, the control
limit and the inspection interval, is also given.  Similar
results are also given for the integrated moving average model of
order (0,1,1).  These results correct and improve the results
given by Adams and Woodall (1989) and Box and Kramer (1992).
From: kzhang@csd.uwo.ca (Kaizhong Zhang)
Newsgroups: ont.events
Subject: Colloq. Wednesday, Oct. 14, 1992
Date: 28 Sep 92 14:18:37 GMT
Organization: Relayed-by-Sendmail
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:
Is artificial neural network (ANN) a better learning model for
``complicated'' tasks done in the human brain than traditional
symbolic methods? What kind of tasks can be learned and generalized
better/worse using ANN than symbolic methods?
We give some answers to these questions, and provide a
case study -- learning past tenses of English verbs --
that connectionist models have been claimed successful as a benchmark.
A challenge is posed by MacWhinney and Leinbach (1991)
suggesting 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 performances are 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; while the connectionist model leaves
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,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: THEORY SEMINAR
Keywords: Xiaolin Wu, Dept. Comp. Sci., Univ. Western Ont.
Organization: University of Waterloo
Distribution: ont
Date: Fri, 2 Oct 1992 13:51:03 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

THEORY SEMINAR

                    -Wednesday, Oct. 7, 1992

Xiaolin  Wu, Department of Computer Science, University
of   Western   Ontario   will  speak  on  "Optimal  Bit
Allocation".

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

ROOM:                 DC 1304

ABSTRACT

We  consider a fundamental problem in data compression:
how  to  encod random variables X , 1 <= i <= M, (X 's can be
                                 i           i
scalars  and/or  vectors),  with  B  bits  for  minimum
distortion.    For  each  X ,  we  design  its  optimal
                           i
quantizer  Q for different bit rates, and allocate B
            i
bits  to M quantizers Q , 1 <= i <= M, in such a way that the
                       i
total  distortion of these quantizers is minimized.  We
                    2
will  give  an  O(MB )  algorithm  to  compute  optimal
integer-constrained   bit  allocation,  and  a  pseudo-
polynomial  algorithm  for  optimal  bit  allocation in
general  setting.   We will also discuss how greedy bit
allocation   and   branch-and-bound  technique  can  be
combined  to  reduce  the  expected  time complexity of
optimal   bit   allocation   for  significantly  biased
distributions   of  X ,  which  is  a  common  case  in
                     i
practice.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Jose Fernandez, Thursday 15 October 1992: THEORY SEMINAR
Date: 5 Oct 92 18:35:52 GMT


           Department of Computer Science, University of Toronto
         (SF = Sandford Fleming Building, 10 King's College Road)

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

                              THEORY SEMINAR
              SF1105, at 3:00 p.m., Thursday 15 October 1992

                              Jose Fernandez
           Department of Computer Science, University of Toronto

                  "Some Computational Issues in Biology"

The nature of research in Modern Biology is becoming more and more
mathematically oriented.  In particular, some of the newer problems in
Molecular and Evolutionary Biology have an intrinsic computational nature.
This talk will bring up some of these computational problems.  We will
informally describe the problems of generation of Evolutionary Trees,
prediction of protein 3D structure, and string matching and database
searches in the biological context; we will concentrate in some more detail
on the problems involved in the Human Genome Project, the multi-billion
dollar project to map the whole human genetic sequence.

Disclaimer: This talk will be an informal introductory presentation of the
subject, meant for all computer scientists (not necessarily theoreticians).
It is based on my notes from the 2nd SIMS Tutorial on Genomic Analysis,
which was held last August at DIMACS (Rutgers University).
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.ai
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: James Pustejovsky, Thursday 15 October 1992: AI SEMINAR
Date: 5 Oct 92 18:41:13 GMT


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

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

                                AI SEMINAR
              GB221, at 11:00 a.m., Thursday 15 October 1992

                             James Pustejovsky
             Computer Science Department, Brandeis University

                          "Metonymy as Coercion"

Traditionally, semantic information in computational lexicons is limited to
notions such as selectional restrictions or domain-specific constraints,
encoded in a static representation.  This information is typically used in
NLP by a simple knowledge-manipulation mechanism limited to an ability to
match valences of structurally related words.  This holds for most current
views of metonymy and lexical ambiguity as well.  In this talk I will argue
against such enumerative theories of word senses and describe recent work
in generative lexicon theory that treats varieties of metonymy as cases of
type coercion.

This theory makes use of a knowledge-representation framework offering a
richer, more expressive vocabulary for lexical information.  In particular,
by performing specialized inference over the ways in which aspects of
knowledge structures of words in context can be composed, mutually
compatible and contextully relevant lexical components of words and phrases
are highlighted.  I discuss the relevance of this view of the lexicon, as
an explanatory device accounting for language creativity, as well as a
mechanism underlying the implementation of open-ended natural language
processing systems.  In particular, we demonstrate how lexical ambiguity
resolution---now an integral part of the same procedure that creates the
semantic interpretation of a sentence itself---becomes a process not of
selecting from a pre-determined set of senses, but of highlighting certain
lexical properties brought forth by, and relevant to, the current context.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.na
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: P. W. Sharp, 6 October 1992: NUMERICAL ANALYSIS
Date: 30 Sep 92 13:48:35 GMT


           Department of Computer Science, University of Toronto
         (SF = Sandford Fleming Building, 10 King's College Road)

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

                            NUMERICAL ANALYSIS
                   SF1105, at 11:00 a.m., 6 October 1992

                                P. W. Sharp
              Mathematics and Statistics, Queen's University

                                 Abstract

In the last twenty years, many automatic routines have been developed for
the numerical evaluation of one-dimensional definite integrals.  These
routines attempt to find an approximation to the integral that differs from
the true value by less than an amount specified by the user.

The preponderance of automatic routines has naturally led to the idea of
testing routines to see which ones are suitable for different types of
integrals. Two contrasting testing paradigms have been used: battery
testing and parameter testing. Battery testing involves measuring the
performance of the routines on a collection of integrals which display a
variety of properties. Parameter testing involves measuring the performance
on a family of similar integrals.

I will begin with a review of manual and automatic quadrature routines.
Then I will discuss the two testing paradigms and present a general view
that contains the paradigms as special cases. Next, I will describe Q1STAT,
a testing package I have developed. In the final part of the talk, I will
illustrate the use of Q1STAT.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.na
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Youcef Saad, Friday 16 October 1992: NUMERICAL ANALYSIS
Date: 5 Oct 92 19:49:24 GMT


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

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

                            NUMERICAL ANALYSIS
               LP266, at 10:00 a.m., Friday 16 October 1992

                                Youcef Saad
           Computer Science Department, University of Minnesota

                        "ILUM: a massively parallel
              multi-elimination incomplete LU factorization"

Preconditioned  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
circumventiong  the  difficulty.  A  new  approach  called  ILUM which
allows  a  high  degree of  parallelism  is presented.  This  approach
consists of  using  an `independent set ordering' to determine all the
unknowns  that can be eliminated simultaeously. Then a reduced  system 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,ut.dcs.seminars,ut.dcs.ai
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Christopher Brown, 8 October 1992: AI
Date: 28 Sep 92 19:48:39 GMT


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

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

                                    AI
                   GB221, at 11:00 a.m., 8 October 1992

                             Christopher Brown
          Department of Computer Science, University of Rochester

                      "A Goal-Oriented Vision System"

A brief historical review of the place of selective (or attentional)
mechanisms in machine vision is followed by illustrations of real-time
sensori-motor capabilities that current technology makes available fairly
easily.  A flexible  task-oriented vision system is described for use in
domains with predictable visual structure (e.g. anatomy, airports, table
settings, traffic).  in which a visual task is formalized as a question
about the scene.  Bayes nets represent a priori and dynamically-acquired
knowledge.  Decision theory, using benefit/cost ratios for visual actions,
provides a basis for choosing which visual action to perform next.  The
goal of the  system is to choose the sequence of visual actions that has
the maximum expected utility for answering the visual question.
Implemented on a parallel processor (eight-node SGI computer), the system
runs in simulation with dynamic scenes and with real data for  static
scenes.
From: kzhang@csd.uwo.ca (Kaizhong Zhang)
Newsgroups: ont.events
Subject: Colloq. on Wednesday, October 7, 1992
Date: 28 Sep 92 03:33:53 GMT
Organization: Relayed-by-Sendmail
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


          University of Western Ontario
          Department of Computer Science

                    COLLOQUIUM

Speaker: Professor Karel Culik II, South Carolina
Title:   Combining Weighted Finite Automata and Wavelets for 
         Image-Data Compression 
Time:    Wednesday, October 7, 1992, at 2:00pm
Place:   MC 320
Abstract:
In our last talk in London we discussed Mutual Recursive Function
Systems (MRFS),  a powerful tool for image design and generation.
We  give some  new examples of MRFS  and then  we will discuss
Weighted Finite Automata (WFA), a special case of MRFS.   We will
show  how to automatically synthesize  WFA generating functions
given by tables. We show WFA generating Daubechies's wavelets and
discuss how to combine WFA and wavelets for image-data compression.
Newsgroups: ont.events
From: sekuler@psych.toronto.edu (Allison Sekuler)
Subject: PERCEPTION (Oct 2)
Organization: Department of Psychology, University of Toronto
Distribution: ont
Date: Mon, 28 Sep 92 21:41:30 GMT


**RESEARCH GROUP IN PERCEPTION**

Friday, October 2, 1992   3pm in room 317 of 1 Spadina Crescent,
University of Toronto, St. George Campus


HIROSHI ONO (YORK UNIVERSITY)

"WILLIAM CHARLES WELLS AND BINOCULAR VISUAL DIRECTION:
A BICENTENNIAL TRIBUTE."

Abstract:
While the American Psychological Association is having its
centennial celebration this year, visual scientists can have a
bicentennial celebration of the publication of Wells's book in
1792.  The book, "An essay upon single vision with two eyes;
together with experiments and observations on several other
subjects in optics," formally states the principles of visual
direction 87 years before Hering, who is usually credited with
stating them.  Wheatstone praised Wells as an acute writer but
rejected his theory and perhaps because of this Wells's work
remains unrecognized.  In tribute to Wells, I will present my
published data collected while studying Hering's principles and
explain them in terms of Wells's propositions. and then compare
Wells's three propositions concerning localization of objects in
space to Hering's and recent statements of the principles of
visual direction.  Then, I will argue that we should now
recognized Wells for his pioneering work in vision.



Everyone is welcome to attend. Donut holes will be provided.

For more information, please contact Allison Sekuler at:
978-1537 or sekuler@psych.toronto.edu

Newsgroups: ont.test
From: derwin@mach1.wlu.ca (daryl erwin s)
Subject: Why this
Organization: Wilfrid Laurier University
Distribution: ont
Date: Thu, 1 Oct 1992 12:33:00 GMT

Dumb
Newsgroups: ont.test
From: derwin@mach2.wlu.ca (Daryl Erwin)
Subject: WLU Weekly Testing
Organization: Wilfrid Laurier University
Distribution: ont
Date: Tue, 29 Sep 1992 12:50:12 GMT

Testing on September29th at 8:49
-- 
Daryl Erwin                                     Net Address: derwin@mach2.WLU.CA
Computing Services                              Surface Mail: P4-1, Main Campus 
Wilfrid Laurier University, Waterloo, Ontario 
Bus:(519) 884-1970 x2910                                          ... Go Hawks!
From: tannerc@cu18.crl.aecl.ca  (Chris Tanner)
Newsgroups: ont.test
Subject: Test Message
Date: 26 Sep 1992 18:54:56 -0400
Organization: AECL-Research
Distribution: ont
NNTP-Posting-Host: cu18.crl.aecl.ca

I ma testing my copy of INN. Please ignore this.

Chris
-- 
Chris Tanner                  Email: tannerc@CU18.CRL.AECL.CA
AECL Research                 Phone: (613) 584-3311 X4053       
Chalk River, Ont.             FAX:   (613) 584-1082
Canada, K0J 1J0
From: rahrer@bnr.ca
Newsgroups: ont.test
Subject: testing 1,2,3
Summary: testing only
Keywords: test
Date: 1 Oct 92 20:18:38 GMT
Organization: Bell-Northern Research, Ottawa

this is a test of external postings, please ignore 
Newsgroups: ont.test
From: Darrrrrryl ERWIN@mach1.wlu.ca (daryl erwin s)
Subject: WLU nam test
Organization: Wilfrid Laurier University
Distribution: ont
Date: Wed, 30 Sep 1992 13:14:35 GMT

WHats my name
From: laub@Software.Mitel.COM (Boniface Lau)
Newsgroups: ont.test
Subject: test
Date: 26 Sep 92 18:17:33 GMT
Distribution: ont
Organization: Mitel. Kanata (Ontario). Canada.

asdf
asd
as
dfa
sfd
asdf
---
Boniface Lau    (613) 592-2122 ext. 3042    Boniface_Lau@Mitel.COM
Mitel Corp., 350 Legget Drive, Kanata, Ontario, Canada K2K 1X3

Spring scatters the petals of flowers
  that are not for the fruits of the future,
    but for the moment's whim.    -- Tagore
Newsgroups: ont.test
From: derwin@mach1.wlu.ca (daryl erwin s)
Subject: Testing name at wlu
Organization: Wilfrid Laurier University
Distribution: ont
Date: Wed, 30 Sep 1992 13:09:36 GMT

Whats my name -- is it right?
Newsgroups: ont.test
From: ccksb@trentu.ca (Ken Brown)
Subject: tu test
Reply-To: ccksb@trentu.ca (Ken Brown)
Organization: Trent University
Date: Tue, 6 Oct 1992 15:03:34 GMT


This is a test (of course)...

--
====================================================================
Ken Brown                                       voice: (705)748-1540
Trent University Computing & Telecommunications   fax: (705)748-1246
Peterborough, Ontario, Canada K9J 7B8     internet: kbrown@trentu.ca
From: tannerc@cu18.crl.aecl.ca  (Chris Tanner)
Newsgroups: ont.test
Subject: Test Message
Date: 26 Sep 1992 19:00:58 -0400
Organization: AECL-Research
Distribution: ont
NNTP-Posting-Host: cu18.crl.aecl.ca

This is a message to test my copy of INN. Please ignore it.

Chris
-- 
Chris Tanner                  Email: tannerc@CU18.CRL.AECL.CA
AECL Research                 Phone: (613) 584-3311 X4053       
Chalk River, Ont.             FAX:   (613) 584-1082
Canada, K0J 1J0
Newsgroups: ont.test
From: eastick@ramsey.cs.laurentian.ca (Doug Eastick)
Subject: zx
Organization: Dept. of Computer Science, Laurentian University, Sudbury, ON
Date: Thu, 1 Oct 1992 04:20:09 GMT

bsc
-- 
Doug Eastick -- Sudbury, Ontario
Newsgroups: ont.test
From: Darrrrrryl ERWIN@mach1.wlu.ca (daryl erwin s)
Subject: WLU editor
Organization: Wilfrid Laurier University
Distribution: ont
Date: Wed, 30 Sep 1992 13:15:30 GMT


Newsgroups: ont.test
From: yamane@nrccsb6 (Norm Yamane)
Subject: test from tin
Organization: National Research Council, Ottawa, Canada
X-Newsreader: Tin 1.1 PL5
Date: Wed, 30 Sep 92 12:30:22 GMT

Test posting from tin.

--
Norm Yamane M-60, Rm 221
yamane@nrccsb6.di.nrc.ca

National Research Council of Canada
From: marwood@hq.crad.dnd.ca (Gordon Marwood)
Newsgroups: ont.test
Subject: Test
Date: 4 Oct 92 22:36:36 GMT
Distribution: ont
Organization: Chief, Research & Development, National Defence

Test
Newsgroups: ont.jobs
From: tanya@jts.com (Tanya Forbom )
Subject: Customer Support Position
Organization: JTS Computer Systems Ltd.
Distribution: ont
Date: Tue, 29 Sep 1992 21:01:56 GMT

JTS Computer Systems is a producer of high performance document
image processing systems.  We are currently seeking individuals to 
support our Open Image product.


We offer a challenging work environment, with a comprehensive benefits 
package.  We are looking for good people with some or all of the following 
qualifications:

	- Excellent organizational, communications, and problem solving skills
	- Relational Database experience, Sybase or other SQL-based preferred
	- Unix, DOS
	- Networking
	- Unix system administration


Send resume to:

Tanya Forbom,
Customer Support,
JTS Computer Systems Ltd.,
4211 Yonge Street, Suite 620
Willowdale, Ontario,
M2P 2A9
1 416 512 8910
From: nigel@isgtec.com (Nigel Burnett)
Newsgroups: ont.jobs
Subject: Nigel Burnett's Resume **JOB WANTED**
Date: 3 Oct 92 23:24:03 GMT
Distribution: ont
Organization: ISG Technologies Inc., Mississauga Ontario


--
 "If somebody feels really good about who they are, they don't
  feel threatened by what other people are." - Dr. M. Rubenstein
Nigel Burnett:  business: 3030 Orlando Dr., Mississauga, Ont.,  416-672-2100
Send e-mail to nigel@isgtec.com, uunet.ca!isgtec!nigel, or nigel@isgtec.UUCP