HDTenEightyP/NetNews huggingface dataset:
From: hugh@kink.PhaedraV.On.Ca (Hugh D. Gamble)
Newsgroups: ont.singles
Subject: Re: HELLO??
Date: Sun, 08 Nov 1992 16:50:35 EST
Distribution: world
Organization: Phaedra V

In article <19.2875.uupcb@synapse.org>, Doug Hewko writes:

> If nobody objects, what is the difference between a "newsgroup" and a 
> "conference"? And how could someone tell the difference by reading 
> messages in a message packet?  (I find it natural to call everything 
> that has messages in it a conference... )

The main difference is that "newsgroup" is a stupid, misleading name
that really means "conference" at least in the case of ont.singles.
The name is part of the historical baggage of usenet. Some newsgroups
are "moderated" by an editor or actually carry news rather than
chit-chat and the name "newsgroup" fits them a little better.

If you make the egregious error of calling a usenet group a
conference, hordes of "real computer" snobs will know you are a PC
(IBM, Amiga, etc.) weenie and tell you pointedly that you are in a
"newsgroup" not a "conference" and that the difference is that in a
newsgroup your message goes all over the world and costs billions of
dollars (which has some truth, both for usenet and BBS networks, but
is usually irrelevant).

You can tell if something comes from a usenet group by looking at the
message headers. Then you should call the conference a newsgroup to a)
avoid confusing people who can't connect the 2 different terms, and b)
to avoid heaps of unwarranted abuse from idiots who are just looking
for someone to pick on.

Ok, that's our history lesson for today. :-)

-- 
# Hugh D. Gamble  UUCP: hugh@kink.UUCP  Domain: hugh@kink.PhaedraV.On.Ca     %
# AMIX: HGAMBLE  bix: hgamble  voice: +1 416 267 6159                        %
#    "I'll just tell them you eat good pussy."                               %
# -- Gennifer Flowers talking to President Elect Bill Clinton                %
From: doug.hewko@synapse.org (Doug Hewko) 
Newsgroups: ont.singles
Subject: Re: HELLO??
Date: 4 Nov 92 13:24:00 GMT
Distribution: world
Organization: SYNAPSE BBS - GATINEAU, QUEBEC - 819-561-4321
Reply-To: doug.hewko@synapse.org (Doug Hewko) 

From: doug.hewko@synapse.isis.org

AM.In article <2.2875.uupcb@synapse.org> doug.hewko@synapse.org (Doug Hewko)  writes:
>Is there anyone else out there?

AM.Lots of us.  Any more questions?

Wow! There are people here! I'm amazed.  Uh, before I say anything I 
shouldn't can anyone clarify exactly what this conference is for and 
about?  Over here it is listed as "ont.singles", but I found that does 
not mean much.  Case in point, there is another conference with the 
name personals (forgot the prefix), which one would conclude it is for 
personal ads.  It is not.  That conference is about multiple 
personality disorders.  My guesses on this conference is that it is a 
singles forum (likely a support group thingy) which is transmitted 
across Ontario. 

               Doug
---
 . 1st 1.01 #574 . Government expands to absorb revenue and then some. (Wicker)
                                                                                                               
Xref: sparky ont.events:538 wny.events:20 wny.seminar:55 comp.ai:4205
From: rapaport@acsu.buffalo.edu (William J. Rapaport)
Newsgroups: ont.events,sunyab.cs.general,sunyab.announce.events,wny.events,wny.seminar,comp.ai
Subject: BUFFALO COMP. SCI. COLLOQ -- HULL -- TEXT RECOGNITION
Date: 9 Nov 92 16:04:51 GMT
Article-I.D.: acsu.BxGI5s.71G
Organization: State University of New York at Buffalo/Comp Sci


                         UNIVERSITY AT BUFFALO
                      State University of New York

                     DEPARTMENT OF COMPUTER SCIENCE

                               Colloquium


                            JONATHAN J. HULL

       Center of Excellence for Document Analysis and Recognition
                     Department of Computer Science
                State University of New York at Buffalo


       LANGUAGE-LEVEL CONTEXTUAL CONSTRAINTS IN TEXT RECOGNITION

  The use of constraints derived from the language in which  a  document
  is  written  to  improve  the recognition of the text contained within
  that document is explored.  These constraints span a range from graph-
  ical context to the syntax and semantics of the underlying text.  This
  talk surveys several techniques that have recently been developed  for
  utilizing language-level contextual information to improve the perfor-
  mance of a word recognition method.

  An algorithm that uses patterns of word repetitions within a  document
  to  recognize  function and content words is discussed.  Another tech-
  nique that employs an information retrieval method to improve the per-
  formance  of a word recognition algorithm by matching partial recogni-
  tion results to a free text database is explored.  Also, a hidden Mar-
  kov  model  that  uses  statistics about the co-occurrence of part-of-
  speech tags to improve recognition performance is presented.

                    Place:  20 Knox, Amherst Campus
                   Date:  Thursday, November 12, 1992
                      Time:  3:30 P.M. - 4:45 P.M.

     Refreshments will be served in 224 Bell Hall, after the talk.
                   For further information, contact:
    Dr. William J. Rapaport, (716) 645-3193, rapaport@cs.buffalo.edu
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.uwaterloo.ca ()
Subject: ICR Presents a Seminar on "The Computer Virus: Worker or Villain", on   Monday, November 16, 1992 at 2:30 pm in DC 1304.
Keywords: Speaker:  Professor George Davida, Dept. of Elec. Eng. and Computer    Science, University of Wisconsin.
Organization: University of Waterloo
Distribution: ont
Date: Mon, 9 Nov 1992 20:01:36 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                      Presents a Seminar on

             The Computer Virus:  Worker or Villain



by:     Professor George Davida

of:     Department of Electrical Engineering 
	and Computer Science

        University of Wisconsin
	Milwaukee, Wisconsin


Date:   Monday, November 16, 1992   
Time: 	2:30 pm.
Place:  William G. Davis Computer Research Centre, Room 1304


Abstract

Methods of defending against viruses are  considered.   In  addi-
tion,  the  very  properties  of  a computer virus that make it a
threat to computer systems are considered in the  design  of  new
virus-like programs that can do useful work on behalf of a user.



Everyone welcome.  Refreshments served.
Newsgroups: ont.events,uw.talks,uw.cs.grad
From: ylkingsb@icr.uwaterloo.ca ()
Subject: ICR Presents a Colloquium on "Hypermeshes: Optical Interconnection Net- works for Parallel Computing", on Wednesday, November 18, 1992 at 3:30 pm. in   DC 1302.
Keywords: Speaker:  Dr. Ted Szymanski, Dept. of Elec. Eng., McGill University.
Organization: University of Waterloo
Distribution: ont
Date: Mon, 9 Nov 1992 20:03:34 GMT



                   The University of Waterloo
                      200 University Avenue
                        Waterloo, Ontario


           The Institute for Computer Research (ICR)

                    Presents a Colloquium on

  Hypermeshes:  Optical Interconnection Networks for Parallel Computing



by:     Dr. Ted Szymanski

of:     Department of Electrical Engineering
        McGill University
        Montreal, Quebec


Date:   Wednesday, November 18, 1992  
Time:	3:30 pm.
Place:  William G. Davis Computer Research Centre, Room 1302



Abstract

Advances in optical technology will make optical  interconnection
networks both feasible and practical.  Many proposed optical net-
works lack dedicated point-to-point edges and hence  they  cannot
be  formally modelled as graphs.  A class optical networks called
"hypermeshes"  is  proposed.  These  networks  can  be   formally
modelled  as orthogonal hypergraphs, where all nodes are arranged
in n-dimensional space, where all nodes aligned along a dimension
belong  to a hypergraph "net", and where every net represents ac-
cess to a distributed optical switch.  Hypermeshes have asymptot-
ically optimal net cost, link cost and diameter, while simultane-
ously preserving the nearest neighbor property of the  hypercube.
Hypermeshes also have  a permutation capability and embedding ca-
pability comparable to the hypercube.  In this talk, the class of
hypermeshes  is  defined and characterized, a comparative evalua-
tion with other network architectures is performed, and some  ef-
ficient optical implementations are proposed.



Everyone is welcome.  Refreshments served.
Newsgroups: ont.events
From: cs3ea3cd@maccs.dcss.mcmaster.ca (Abrams       J)
Subject: Re: PERCEPTION: Nov 6, NIALL
Organization: Department of Computer Science, McMaster University
Distribution: ont
Date: Fri, 6 Nov 1992 18:07:42 GMT

In article <1992Nov5.193628.27143@psych.toronto.edu> sekuler@psych.toronto.edu (Allison Sekuler) writes:
>
>  "PROJECTIVE PROPERTIES AND THE MENTAL ROTATION EFFECT."
>
>              3 pm, Friday, November 6, 1992  
>  Room 317, 1 Spadina Crescent, St. George Campus, U of T
>
>All are welcome. Donut holes will be provided.
                  ----- -----

Donut Holes!  We will be there!



-- 
Jonathan H. Abrams - McMaster University, Canada 

cs3ea3cd@maccs.dcss.mcmcaster.ca
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Nicolai Vorobjov, 3 December 1992: THEORY
Date: 11 Nov 92 16:22:50 GMT


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

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

                                  THEORY
                   SF1105, at 3:00 p.m., 3 December 1992

                             Nicolai Vorobjov
                                MSI Cornell

                         "COMPLEXITY OF COMPUTING
              TOPOLOGICAL PROPERTIES OF A SEMIALGEBRAIC SET"

In the last few years, some new effective algorithms have been developed
for basic computational problems in real algebraic geometry. The complexity
of the algorithms is singly-exponential in the number of variables, in
contrast to thepreviously known doubly-exponential upper time bounds. A
survey of these methods will be given with a more detailed description of
the most advanced of them: an algorithm for finding all connected
components of a semialgebraic set and a procedure for computing the
combinatorial type of a cell-decomposition of a smooth real algebraic
hypersurface.

Newsgroups: ont.events
From: sekuler@psych.toronto.edu (Allison Sekuler)
Subject: PERCEPTION (Perspectives from Russia)
Organization: Department of Psychology, University of Toronto
Distribution: ont
Date: Sun, 8 Nov 1992 23:36:22 GMT

(NOTE: Boris Velichkovsky is visiting the U of T from Moscow
State University. He is giving a series of talks about psychology 
in Russia (past and present). This week's talk emphasizes PERCEPTION.
If you want info about the rest of the talk series contact
craik@psych.toronto.edu)



                        University of Toronto
                       Department of Psychology

                               REMINDER



                        BORIS M. VELICHKOVSKY 
                will give the third talk in his series


 `Towards a meaningful cognitive science:  Some perspectives from the 
                        (former) Soviet Union'


                "MICROSTRUCTURE OF VISUAL PERCEPTION"


                        TUESDAY, NOVEMBER  10th

                    Room 4043, Sidney Smith Lounge
               University of Toronto, St. George Campus


                         Time: 4 - 5:30 p.m.


                             All Welcome
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.dbois
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Chaitanya K. Baru, Thursday 19 November 1992: DATABASE
Date: 6 Nov 92 21:21:12 GMT


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

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

                                 DATABASE
              SF1105, at 2:00 p.m., Thursday 19 November 1992

                             Chaitanya K. Baru
                             IBM Toronto Labs

       "Data Placement in Shared-Nothing Parallel Database Systems"

In this talk, we will address the issue of data placement in multicomputer
database systems and discuss the optimization of the placement of database
tables across the nodes of a scalable, shared-nothing parallel computer
system.  Two important issues in data placement are (i) finding the
appropriate number of nodes across which a given database table is to be
partitioned and (ii) assigning the table partitions to specific nodes in
the system.  Past work has not addressed all aspects of the declustering
and assignment problems.  The data placement problem is formulated as an
optimization problem using the notion of a database placement state.  We
present several algorithms that employ this formulation to solve the
declustering and assignment problems in data placement.  Experimental
results using different complex query and mixed workloads for a given
database, are also presented.  The results indicate that data placement can
critically affect the performance--both, response time as well as
throughput--of a parallel database system.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.ai
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Tim Finin, Thursday 19 November 1992: AI
Date: 6 Nov 92 19:58:35 GMT


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

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

                                    AI
              GB221, at 11:00 a.m., Thursday 19 November 1992

                                 Tim Finin
   Computer Science Department, University of Maryland Baltimore County

                    "A Knowledge Query and Manipulation
             Language for Intelligent Agent Interoperability"

This talk will present an overview of the DARPA Knowledge Sharing Effort
with a special emphasis on the development of KQML, a language and protocol
intended to support interoperability among intelligent agents in a
distributed application.

The overall goal of the effort is to develop the technical infrastructure
to support the sharing of knowledge among systems.  Four specific areas are
being investigated: (i) mechanisms for translation between knowledge bases
represented in different languages; (ii) common versions of representation
and reasoning languages and modules; (iii) languages and protocols for
run-time communication between separate knowledge-based modules; and (iv)
libraries of ``ontologies'', i.e., pre-fabricated foundations for
application-specific KBs in a particular topic area.

The concepts and prototype systems are being explored in two current
research initiatives. The first is part of the DARPA/Rome Planning
Initiative, and involves the collaboration and cooperation of a collection
of planning, scheduling, resource control, and temporal reasoning programs.
The second is the Palo Alto Collaborative Testbed, and involves
metropolitan-area communication among software, circuit, power, sensor, and
mechanical CAD systems.
Newsgroups: ont.events,ut.dcs.general,ut.dcs.seminars
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Mary Shaw, 8 December 1992: COLLOQUIUM
Date: 11 Nov 92 16:34:26 GMT


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

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

                                COLLOQUIUM
                  SF1105, at 11:00 a.m., 8 December 1992

                                 Mary Shaw
                        Carnegie Mellon University

         "Heterogeneous Design Idioms for Software Architectures"

Software designers use a variety of structural patterns to specify system
architectures.  These patterns, or idioms, are currently used informally
and imprecisely.  Nevertheless, they provide a useful, broadly shared
vocabulary.  In practice, a given design often relies on several patterns.
This talk reviews some common architectural idioms, shows several ways in
which they are used heterogeneously, describes deficiencies of current
module interconnection languages, and discusses the  benefits of making
these idioms and their combinations more explicit and precise.

Mary Shaw: Mary Shaw is a Professor of Computer Science at Carnegie Mellon
University.  Her research interests are in programming systems and software
engineering, particularly abstraction techniques and language tools for
developing and evaluating software.
Newsgroups: ont.events,ut.dcs.general,ut.dcs.seminars
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Andries van Dam, Tuesday 24 November 1992: COLLOQUIUM
Date: 11 Nov 92 15:55:20 GMT


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

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

                                COLLOQUIUM
              SF1105, at 11:00 a.m., Tuesday 24 November 1992

                              Andries van Dam
                             Brown University

                           " Escaping Flatland "

Now that the computer industry and its large body of users are finally
accepting the twenty-year-old Xerox PARC User Interface technology as
popularized by the Mac and subsequently promulgated through various UNIX
toolkits and Windows 3.0., isn't it finally  time to move on? These GUI's
were based on low power (monochrome) bitmap graphics workstations, yet
today we have available platforms with an order of magnitude (or more)
compute power, high resolution color graphics, 3D graphics accelerators,
and a variety of input devices with more degrees of freedom than the mouse.
Let us not limit our UI vision with minor extensions of the popular 2D
metaphors of the past and present, but instead, explore the use of
promising new technologies, such as gesture recognition, speech and image
handling, 3D realtime animation, and virtual reality.

Andries van Dam: Andries van Dam is a professor of Computer Science at
Brown University where he has also been Chairman of the Department. He has
been working for over 20 years on systems for creating and reading
Relectronic books.S  He helped to found Computer Graphics and Image
Processing, ACM Transactions on Graphics , and ACM's SIGGRAPH.  He is the
co-author of Fundamentals of Interactive Computer Graphics and its
successor, Computer Graphics:  Principles and Practice.  His awards include
the Society for Information Display's RSpecial Recognition Award,S; the
IEEE Centennial Medal; the State of Rhode Island Governor's Science and
Technology Award; the National Computer Graphics Association's Academic
Award; and the SIGGRAPH Steven A. Coons Award.  In May 1992, Brown
University named him to the L. Herbert Ballou University Professor Chair.

Newsgroups: ont.events,uw.talks,uw.cs.grad
From: wlrush@jeeves.uwaterloo.ca (wlrush)
Subject: DISTRIBUTED SYSTEMS SEMINAR
Keywords: Prof. and Dr. J. Schaeffer, Dept. Comp. Sci., Univ. Alberta
Organization: University of Waterloo
Distribution: ont
Date: Fri, 6 Nov 1992 15:44:44 GMT


DEPARTMENT OF COMPUTER SCIENCE
UNIVERSITY OF WATERLOO
SEMINAR ACTIVITIES

DISTRIBUTED SYSTEMS SEMINAR

                    -Friday, November 13, 1992

Professor and Dr. J. Schaeffer, Dept. Comp. Sci., Univ.
of  Alberta,  will  speak on "Enterprise: A Programming
Environment for Developing Distributed Applications".

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

ROOM:                 DC 1302

ABSTRACT

Workstation environments have been in use for more than
a   decade   now.   Although  a network of workstations
together   represents   considerable  computing  power,
single  users   often  cannot   utilize  this power for
their  applications.   By  combining  the  resources
available  on  a  network,   the   user   can  create a
supercomputer  that  is  flexible  to the user's needs,
expandable   as   more   resources  are  required,  and
adaptable     to    the       changing      technology.
Unfortunately,    writing parallel/distributed software
is  often  perceived  as  a  complicated endeavor.  A
tool  is  needed to bridge the perceived complexity gap
between distributed and sequential software.

Enterprise is a programming environment for  designing,
coding,  debugging,  testing, monitoring, profiling and
executing   programs   in   a  distributed  hardware
environment.   Enterprise   code  looks  like  familiar
sequential   code;   the   parallelism   is   expressed
graphically.   High-level parallelization  techniques
are   represented   by  different  graphical icons.  By
manipulating  icons,  the user  can  quickly  alter the
parallelization   in   the   program,  usually  without
changing  the  source  code.   The system automatically
inserts  the   code  necessary to handle communication,
synchronization and fault tolerance, allowing the rapid
construction  of   correct   distributed   programs.
This bridges the complexity gap between distributed and
sequential    software.     Enterprise   supports  load
balancing,  limited process migration, and dynamic dis-
tribution  of  work  in   environments   with  changing
resource utilization.
Newsgroups: ont.events,ut.dcs.seminars,ut.dcs.theory
From: veronica@cs.toronto.edu (Veronica Archibald)
Subject: Shuhong Gao, Thursday 26 November 1992: THEORY
Date: 11 Nov 92 15:02:10 GMT


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

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

                                  THEORY
              SF1105, at 3:00 p.m., Thursday 26 November 1992

                                Shuhong Gao
                          University of Waterloo

                         " Optimal Normal Bases "

    The concept of optimal normal bases was introduced by Mullin,
Onyszchuk, Vanstone and Wilson in an attemp to efficiently implement finite
field arithmetic in hardware or software. Let F_q be a finite field of q
elements and n a positive integer. A basis N = (a_0, a_1, ... ,a_n) for
F_q^n over F_q is called a normal basis if a_i= a^{q^i} for some a in
F_q^n. For a normal basis N, it is easy to see that the n  expressions a_0
* a_i represented in the basis N itself have at least 2n-1 nonzero terms.
If there are exactly 2n-1 nonzero terms then N is called optimal.
    Mullin et al constructed two families of optimal normal bases and,
based oncomputer search results,conjectured that they are essentially all
the optimal normal bases in finite fields. In this talk I will show how all
the optimal normal bases can be determined, thus confirming their
conjecture.
    Joint work with Henrik W. Lenstra, Jr.
From: dryan@sgi1 (Dan Ryan)
Newsgroups: ont.events
Subject: For Sale: Tron Video Arcade Game
Date: 7 Nov 1992 17:07:34 GMT
Organization: Department of Mathematics & Statistics, Univ. of Guelph
NNTP-Posting-Host: sgi1.mathstat.uoguelph.ca
X-Newsreader: TIN [version 1.1 PL6]

My friend has a TRON Video Arcade Game, in good working order, for sale.
He is asking $300 for it.  
The machine is located in Guelph, Ontario

If you are interested, contact me by e-mail (MTHRYAN@VM.UOGUELPH.CA) and 
I will pass on the message.

Dan Ryan