• Your Trusted Usenet Provider
  • Secure, Private, Unlimited

Newsgroups Main » Newsgroups Directory » Computers - Non-OS » Graphics, design and publishing

Algorithms ( comp.graphics.algorithms )
 
From [email protected] Fri May 28 16:16:58 1993
Path: uunet!bounce-back
From: [email protected] (Steve Hollasch)
Newsgroups: news.announce.newgroups,news.groups,comp.graphics,comp.graphics.animation,comp.graphics.visualization,comp.programming,rec.games.programmer
Subject: RFD: comp.graphics.algorithms
Followup-To: news.groups
Date: 27 May 1993 17:28:42 -0400
Organization: Kubota Pacific Computer, Inc.
Lines: 142
Sender: [email protected]
Approved: [email protected]
Message-ID: <[email protected]>
NNTP-Posting-Host: rodan.uu.net
Xref: uunet news.announce.newgroups:3623 news.groups:72904 comp.graphics:40075 comp.graphics.animation:3442 comp.graphics.visualization:3642 comp.programming:5057 rec.games.programmer:13042

Rationale For a New Computer Graphics Newsgroup
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Over the past few years, comp.graphics has grown from a rather elite
group of programmers & researchers into a diverse collection of people who
approach computer graphics from many different angles.  For some, computer
graphics is a career.  For some, it's a hobby.  For others, it's an
intermediate step toward a related goal.  Currently, the majority of
computer graphics articles cover image formats, the use of rendering programs,
the configuration of general purpose graphics hardware, and so on.  In my
view, this is at is should be; comp.graphics has evolved into a forum of many
diverse voices, and its name suggests no restrictions of content.

    Unfortunately, this diversity has also come with a price, most notably
the absence of many original and productive contributors, due to the quantity
of articles relating to every possible facet of computer graphics.  In
addition, comp.graphics has begun to move away from the original purpose of
exchanging ideas on computer graphics algorithms, programming, and research.

    For these reasons I propose the creation of comp.graphics.algorithms.


comp.graphics.research and Newsgroup Moderation
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Several years ago, the moderated newsgroup comp.graphics.research was
created to address many of these issues.  Unfortunately, due to an
inconsistent (and often absent) moderator, this group is currently a
lifeless appendage to the comp.graphics hierarchy.  Due to usenet
guidelines, there is no established method to replace a moderator except
that the moderator publicly step down and hand the mantle to somebody else.
In addition, we can't hold a vote for a group with the same name (but with
a different moderator); many sites would just ignore the newgroup request.

    In my view, the inherent time-lag and previous experience with moderated
newsgroups lead me to believe that the disadvantages of moderation outweigh
the disadvantages of mis-posted articles.  As such, I propose that
comp.graphics.algorithms be unmoderated.


Rationale for The Name "comp.graphics.algorithms"
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    The proposed charter of this group will follow, but obviously is related
to the choice of the name.  I will try to outline why I have chosen this
name (and implied purpose) over others:

        comp.graphics.2d
        comp.graphics.3d
            In many cases, the distinction between 2D graphics and 3D
            graphics is as trivial as an extra degree of freedom.  Some
            topics in the 2D realm are really topics related to 3D
            rendering, such as scan conversion, area computation, polygon
            classification, and so on.  Also, many 2D methods yield useful
            insights into solutions for related 3D problems.  In my opinion,
            the distinction is more often blurred than not.

        comp.graphics.rendering
            This also has the disadvantage of blurred boundaries.  It
            _seems_ to imply the display of 3D scenes, but rendering
            technically also includes such activities as printing PostScript
            files, plotting 2D data, or even constructive geometry.  This in
            itself is not a fatal flaw, but it's easy to see that this group
            would most likely be dedicated to those who are interested in
            _using_ PD, shareware, or commercial renderers, rather than
            those who are most interested in writing, researching or
            developing such renderers.

        comp.graphics.raytracing
        comp.graphics.radiosity
        comp.graphics.pencil-and-eraser
            Groups of such narrow focus are destined to fall by the wayside
            as they wane in popularity or are superceded by better (or more
            vogue) rendering techniques.  Of course, the distinctions
            between rendering techniques are also becoming more blurred of
            late (where does ray-casting go?).

        comp.graphics.research
            I found the name to be a bit elitist - I welcome (and have found
            useful) contributions from academia, industry, and hobbyists
            alike.  The name research suggests discussion of new areas of
            computer graphics rather than old.  However, I hope that
            cg.algorithms would welcome discussions of old algorithms as
            well as current research.  I also do not wish to exclude those
            who are new to computer graphics programming and algorithms.
            Finally, the name is taken (and dead).

        comp.graphics.satire
        comp.graphics.personal-ads
        comp.graphics.calculator
        comp.grpahics.pointer-bitmaps
            These are newsgroups whose time has not yet come.
    
    One other issue regarding the name.  Previous proposals have targeted
various subjects (PC computers, image formats) as the topic of new groups,
in an efforts to winnow out "undesirable" topics.  I believe that this is a
mistake for several reasons.

    First, those who blindly post articles without researching newsgroups
will inevitably target comp.graphics over a more restricted domain, such as
comp.graphics.hardware.ibm.compatible.vga.  When in doubt, they'll chose the
more general newsgroup.

    Secondly, I believe that it's a mistake to use comp.graphics.*
newsgroups to define what comp.graphics is NOT.  Rather, let comp.graphics
remain the generic catch-all of topics, while subgroups delimit more
specific forums of discussion.


Proposed Charter for comp.graphics.algorithms
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

        The comp.graphics.algorithms newsgroup is intended as a forum
        for the discussion of the algorithms used in the process of
        generating computer graphics.  These algorithms may be recently
        proposed in published journals or papers, old or previously
        known algorithms, or hacks used incidental to the process of
        computer graphics.  The scope of these algorithms may range
        from an efficient way to multiply matrices, all the way to a
        global illumination method incorporating raytracing, radiosity,
        infinite spectrum modeling, and perhaps even mirrored balls and
        lime jello.

        It is hoped that this group will serve as a forum for programmers
        and researchers to exchange ideas and ask questions on recent
        papers or current research related to computer graphics.
    

So Now What?
~~~~~~~~~~~

    This RFD (request for discussion) is posted in order to begin discussion
for this proposal.  Everything above this line is open to debate, including
the name and charter of the proposed newsgroup.  According to the guidelines
for newsgroup creation, discussion will continue for up to 30 days.  If, at
the end of the 30 days, consensus is not reached among the proponents of the
group, we should take the discussion off-line to try to address the failings
of the proposal (or to scuttle the idea altogether).
-- 
______________________________________________________________________________
Steve Hollasch                                   Kubota Pacific Computer, Inc.
[email protected]                                 Santa Clara, California

From [email protected] Wed Jun 23 21:12:37 1993
Path: uunet!bounce-back
From: [email protected] (Steve Hollasch)
Newsgroups: news.announce.newgroups,news.groups,comp.graphics,comp.graphics.animation,comp.graphics.visualization,comp.programming,rec.games.programmer
Subject: CFV: comp.graphics.algorithms
Followup-To: poster
Date: 21 Jun 1993 11:52:52 -0400
Organization: Kubota Pacific Computer, Inc.
Lines: 154
Sender: [email protected]
Approved: [email protected]
Message-ID: <[email protected]>
NNTP-Posting-Host: rodan.uu.net
Xref: uunet news.announce.newgroups:3714 news.groups:74652 comp.graphics:40956 comp.graphics.animation:3795 comp.graphics.visualization:3774 comp.programming:5346 rec.games.programmer:13505

                   * * *  C A L L   F O R   V O T E S  * * *

Summary
~~~~~~~
    
    This is a call for votes for the new newsgroup comp.graphics.algorithms.
If you've already read the proposal in the Request For Discussion post, and
already know how you want to vote, here are the directions:

        To vote YES, send your yes vote to "[email protected]".
        To vote NO,  send your no  vote to "[email protected]".

        DO NOT send votes to my e-mail account; these will be ignored.
        DO NOT post notes to the net; these will be ignored.

        To comment on the group or the vote, or to ask questions, you reach
        me via e-mail at "[email protected]".

    You should receive an e-mail acknowledgement of your vote as soon as we
receive it.  I will post a list of received votes every ten days to
news.groups.

    The voting period will run for 30 days, from 21 June, 1993,
through 21 July, 1993, 23:59 UTC.  The requirements for newsgroup
creation stipulate that after the voting is finished, 2/3 of the votes
must be in favor of the group, and there must be 100 more yes votes
than no votes.

Rationale For a New Computer Graphics Newsgroup
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Over the past few years, comp.graphics has grown from a rather elite group
of programmers & researchers into a diverse collection of people who approach
computer graphics from many different angles.  For some, computer graphics is
a career.  For some, it's a hobby.  For others, it's an intermediate step
toward a related goal.  Currently, the majority of computer graphics articles
cover image formats, the use of rendering programs, the configuration of
general purpose graphics hardware, and so on.  In my view, this is at is
should be; comp.graphics has evolved into a forum of many diverse voices, and
its name suggests no restrictions of content.

    Unfortunately, this diversity has also come with a price, most notably the
absence of many original and productive contributors, due to the quantity of
articles relating to every possible facet of computer graphics.  In addition,
comp.graphics has begun to move away from the original purpose of exchanging
ideas on computer graphics algorithms, programming, and research.

    For these reasons I propose the creation of comp.graphics.algorithms.


comp.graphics.research and Newsgroup Moderation
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    Several years ago, the moderated newsgroup comp.graphics.research was
created to address some of these issues.  Unfortunately, traffic in this
group has fallen to zero due to problems with moderation.  In addition, the
charter and name of the newsgroup suggest a different collection of topics
than c.g.algorithms (see below for the reasons I've chosen the name
c.g.algorithms).

    In my view, the inherent time-lag of and previous experience with moderated
newsgroups lead me to believe that the disadvantages of moderation outweigh
the disadvantages of mis-posted articles.  For this reason, I propose that
comp.graphics.algorithms be unmoderated.


Rationale for The Name "comp.graphics.algorithms"
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

    The proposed charter of this group will follow, but obviously is related
to the choice of the name.  I will try to outline why I have chosen this name
(and implied purpose) over others:

        comp.graphics.2d
        comp.graphics.3d
            In many cases, the distinction between 2D graphics and 3D graphics
            is as trivial as an extra degree of freedom.  Some topics in the
            2D realm are really topics related to 3D rendering, such as scan
            conversion, area computation, polygon classification, and so on.
            Also, many 2D methods yield useful insights into solutions for
            related 3D problems.  In my opinion, the distinction is more often
            blurred than not.

        comp.graphics.rendering
            This also has the disadvantage of blurred boundaries.  It _seems_
            to imply the display of 3D scenes, but rendering technically also
            includes such activities as printing PostScript files, plotting 2D
            data, or even constructive geometry.  This in itself is not a
            fatal flaw, but it's easy to see that this group would most likely
            be dedicated to those who are interested in _using_ PD, shareware,
            or commercial renderers, rather than those who are most interested
            in writing, researching or developing such renderers.

        comp.graphics.raytracing
        comp.graphics.radiosity
        comp.graphics.pencil-and-eraser
            Groups of such narrow focus are destined to fall by the wayside as
            they wane in popularity or are superceded by better (or more
            vogue) rendering techniques.  Of course, the distinctions between
            rendering techniques are also becoming more blurred of late (where
            does ray-casting go?).

        comp.graphics.research
            I found the name to be a bit elitist - I welcome (and have found
            useful) contributions from academia, industry, and hobbyists
            alike.  The name research suggests discussion of new areas of
            computer graphics rather than old.  However, I hope that
            cg.algorithms would welcome discussions of old algorithms as well
            as current research.  I also do not wish to exclude those who are
            new to computer graphics programming and algorithms.  Finally, the
            name is taken (and dead).

        comp.graphics.satire
        comp.graphics.personal-ads
        comp.graphics.calculator
        comp.grpahics.pointer-bitmaps
            These are newsgroups whose time has not yet come.
    
    One other issue regarding the name.  Previous proposals have targeted
various subjects (PC computers, image formats) as the topic of new groups, in
an efforts to winnow out "undesirable" topics.  I believe that this is a
mistake for several reasons.

    First, those who blindly post articles without researching newsgroups will
inevitably target comp.graphics over a more restricted domain, such as
comp.graphics.hardware.ibm.compatible.vga.  When in doubt, they'll chose the
more general newsgroup.

    Secondly, I believe that it's a mistake to use comp.graphics.* newsgroups
to define what comp.graphics is NOT.  Rather, let comp.graphics remain the
generic catch-all of topics, while subgroups delimit more specific forums of
discussion.


Proposed Charter for comp.graphics.algorithms
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

        comp.graphics.algorithms is an unmoderated newsgroup intended
        as a forum for the discussion of the algorithms used in the
        process of generating computer graphics.  These algorithms may
        be recently proposed in published journals or papers, old or
        previously known algorithms, or hacks used incidental to the
        process of computer graphics.  The scope of these algorithms
        may range from an efficient way to multiply matrices, all the
        way to a global illumination method incorporating raytracing,
        radiosity, infinite spectrum modeling, and perhaps even
        mirrored balls and lime jello.

        It is hoped that this group will serve as a forum for programmers
        and researchers to exchange ideas and ask questions on recent
        papers or current research related to computer graphics.
-- 
Steve Hollasch                                   Kubota Pacific Computer, Inc.
[email protected]                                 Santa Clara, California

From [email protected] Mon Jul 26 12:22:48 1993
Path: uunet!bounce-back
From: [email protected] (Steve Hollasch)
Newsgroups: news.announce.newgroups,news.groups,comp.graphics,comp.graphics.animation,comp.graphics.visualization,comp.programming,rec.games.programmer
Subject: RESULT: comp.graphics.algorithms passes 286:4
Followup-To: news.groups
Date: 26 Jul 1993 11:54:11 -0400
Organization: Kubota Pacific Computer, Inc.
Lines: 319
Sender: [email protected]
Approved: [email protected]
Message-ID: <[email protected]>
NNTP-Posting-Host: rodan.uu.net
Xref: uunet news.announce.newgroups:3879 news.groups:77523 comp.graphics:42342 comp.graphics.animation:4231 comp.graphics.visualization:3985 comp.programming:5762 rec.games.programmer:14375

    Barring any astounding turn of events, comp.graphics.algorithms passes,
with 286 votes in favor of the group, and 4 votes opposed to the group.  This
yields a margin of 282 votes (100 needed to pass), and a majority of 98.6%
(66.7% needed to pass).

    If you participated in the vote, please consult the following list to
ensure that your vote was correctly recorded.

    A period of five days from the time this article is posted will allow for
public examination of the vote results to ensure that there weren't any errors
or abuses on the part of either voters or the vote takers.  If, after the five
days have expired, the result remains in favor of this newsgroup, this
newsgroup will be newgrouped.

    Comments or questions can be directed to [email protected]  This group
will probably be created while we're all at SIGGRAPH, but at least we'll have
a nice present waiting for us when we return!  =^)


No Votes
~~~~~~~
[email protected]  (Eric J. Olson)
[email protected]  (Gregory Gulik)
[email protected]  (Julian Macassey)
[email protected]  (Malcolm Austin)


Yes Votes
~~~~~~~~
"MALCOLM SOUTER"@robert-gordon.ac.uk
[email protected]  (Agata Opalach-Szwerbel)
[email protected]  (Ryan King)
[email protected]  (Andrew C Aitchison)
[email protected]  (Jason Smith)
[email protected] (Peter Schramm)
[email protected]  (Jesus Eugenio S nchez Pe~a)
[email protected]  (Andre Lehovich)
[email protected]  (Alan Coopersmith)
[email protected]  (Alex ANTUNES)
[email protected]  (Alex Kiernan)
[email protected]  (Mike Arras)
[email protected]  (Anthony R Wuersch)
[email protected]  (Anson Tsao)
[email protected]
[email protected]  (Ranjan Bagchi)
[email protected]  (Marco Riedel)
[email protected]  (Stan Barton)
[email protected]  (George Burgyan)
[email protected]  (Bill Carson)
[email protected]  (The Ray)
[email protected]  (J. Kintscher)
[email protected]  (Andre Beck)
[email protected]  (David Beckman)
[email protected]  (Robert F. Benningfield)
[email protected]
[email protected]  (Brian E Smith)
[email protected]  (Bill Barhydt)
[email protected]  (John Howe)
[email protected]  (Blair MacIntyre)
[email protected]  (Bob Pendleton)
[email protected]  (Mark Bolstad)
[email protected]  (Christopher A. Bongaarts)
[email protected]  (Mark Botta)
[email protected]  (Heddy Boubaker)
[email protected]  (Brian E. Paul)
[email protected]  (Bjorn Reese)
[email protected]  (Brian Rowe)
[email protected]  (Peter Brown)
[email protected]
[email protected]  (Brian W. Hook)
[email protected]  (Dr V Callaghan)
[email protected]
[email protected]  (Gary G. Cannon)
[email protected]  (Ron Capelli)
[email protected]  (Christopher Brian Cox)
[email protected]
[email protected]
[email protected]
[email protected]  (Chris Hecker)
[email protected]
[email protected]  (Dave Shroder)
[email protected]  (Christian Longshore Claiborn)
[email protected]  (Clement Gray Taylor)
[email protected]  (S J Anderson)
[email protected]  (David Nettleton)
[email protected]  (Stefan Sundstr|m)
[email protected]  (Svante Str|mvall)
[email protected]  (Gerald Dalley)
[email protected]  (David C. Browne" )
[email protected]  (Degrande_Samuel)
[email protected]  (Francisco X DeJesus)
[email protected]  ( Robert DeMillo )
[email protected]  (Derek Jean-Baptiste)
[email protected]  (Devon Miller)
[email protected]  (HAWKINS DALE KRIS )
[email protected]  (David Hoelzer)
[email protected]  (Dan Moen)
[email protected]
[email protected]  (Doug Moore)
[email protected]  (Ram Natarajan)
[email protected]  (David Seal)
[email protected]  (Hermann Dunkel)
[email protected]  (Erik Brisson)
[email protected]  (Ed Sarlls)
[email protected]  (Edmund Stephen-Smith)
edsr!jem@uunet.UU.NET  (John E. Mendenhall)
EGG@dstos3.dsto.gov.au
elh@polygon.portable.com
eliotf@holst.tamri.com  (Eliot Feibush)
ENNS@sask.usask.ca
Eric.Lafortune@cs.kuleuven.ac.be  (Eric Lafortune)
erich@eye.com  (Eric Haines)
esger@reks.uia.ac.be  (Geert Raes)
et@CS.HUJI.AC.IL  (EYAL TELER)
eugene@nas.nasa.gov  (Eugene N. Miya)
exco@ligiahp.univ-lyon1.fr  (Thierry EXCOFFIER           )
faehnd@vptt.ch
faramir@cs.tu-berlin.de  (J\*orn Schulze)
ferdinan@oeinck.waterland.wlink.nl  (Ferdinand Oeinck)
fmsystm!nightfly!matt@uhura.neoucom.EDU  (Matt Emerson)
fortiejf@sidoci.qc.ca
FREDI@aster.si  (Alfred Anzlovar)
froument@lifl.fr
FSSPR@acad3.alaska.edu  (Hardcore Alaskan)
gatenby@v2.mcc.ac.uk  (Neil Gatenby, CGU, University of Manchester)
geigel@seasva.gwu.edu  (Joseph M. Geigel)
gf@scs.leeds.ac.uk
giorgos@cs.rochester.edu
gl10+@andrew.cmu.edu  (Gregory A. Landrum)
gondwana@basalt.mit.edu  (Matthias Georg Imhof)
gplace@su5v.ess.harris.com  (Gene Place)
gpwilhel@silver.ucs.indiana.edu  (gregory paul wilhelm)
grahamd@eaps.sussex.ac.uk  (Graham Dunnett)
grau@tnt.uni-hannover.de  (Oliver Grau)
gspear+@cmu.edu  (Geoffrey Spear)
gudukbay@epsilon.eecs.nwu.edu  (Ugur Gudukbay)
guy@wmsg02.wm.estec.esa.nl  (Guy Brooker)
gwydion@gnu.ai.mit.edu
hagmanti@cps.msu.edu
hall@itd.nrl.navy.mil
hans@dialis.hacktic.nl  (Hans Marks)
hartman@uLogic.netcom.com
hinker@acl.lanl.gov  (Paul J. Hinker)
hoberoi@limerick.cbs.umn.edu  (Himanshu Oberoi)
hschouga@neumann.une.edu.au  (Hasse Schougaard)
hucaby@mri.uky.edu  (David Hucaby)
hunuf@lut.ac.uk  (MERLIN)
i-bds@microsoft.com  (David Shoemaker (B.E.S.T.))
Jacqueline.Duquesne@sophia.inria.fr  (Jacqueline Duquesne )
jamest@cee.hw.ac.uk  (James Tough)
jarevalo@moises.ls.fi.upm.es  (Javier Arevalo Baeza)
jbalgley@BBN.COM
jbf@mbunix.mitre.org  (Barney Frazer)
jc@slim.gmd.de  (Juergen Christoffel)
jdstone@destin.dazixco.ingr.com  (Jon Stone)
jduhamel@advent.com  (Joseph Duhamel)
jeffh@BRL.MIL  (Jeff Hanes (BVLD/ASB))
jepler@nyx.cs.du.edu  (Jeff Epler)
jet@nas.nasa.gov  (J. Eric Townsend)
jim@garden.brs.ento.csiro.au  (Jim Hanan)
jjhoward@ucssun1.sdsu.edu  (Jerald Howard)
jkwlee@csd.hku.hk
jlilley@csn.org  (John Lilley)
johng@oce.orst.edu  (John A. Gregor)
johnston@viewport.com  (Scott E. Johnston)
johny@cogs.susx.ac.uk  (Lord Yak Da Hairy)
jojaste@undergrad.math.uwaterloo.ca  (James Ojaste)
jon@research.canon.oz.au  (Jon Windle)
jonas-y@isy.liu.se  (Jonas Yngvesson)
jonas@beor.informatik.rwth-aachen.de  (Josef Nelissen)
jttobias@rdxsun64.aud.alcatel.com  (Jason T. Tobias)
jwest@kraft.apdev.cs.mci.com  (Jim_West)
jwl8k@sycamore.cs.virginia.edu
k044477@hobbes.kzoo.edu  (Jamie R. McCarthy)
kaba@wintermute.north.de  (Kai Bartels)
kac@ux6.lbl.gov  (Kevin Campbell)
kds@phy.duke.edu  (Stokes Kevin)
keith@pioneer.arc.nasa.gov  (Stephan Keith FFD)
kek@palissandre.enpc.fr  (Khalil El KHOURY)
kevan@Harston.CV.COM  (Kevan Heydon)
Kevin.Wu@Eng.Sun.COM  (Kevin Wu)
kjohns@osprey.sim.es.com  (Kyle Johns)
knox@aplexus.jhuapl.edu  (Eric Knox)
kotuliak@elf.stuba.cs  (Martin Kotuliak)
ks6b+@andrew.cmu.edu  (Korntham Sathirakul)
kvng@csn.org  (Kevin Gross)
kyriazis@rdrc.rpi.edu
l15d@zfn.uni-bremen.de  (Martin Schr"oder)
laforte@info.polymtl.ca  (Christian Laforte)
lawrence@combdyn.com  (Lawrence *The Dreamer* Chen)
leban831@uidaho.edu  (Fred Leban)
lefer@lifl.fr
lefevere@lifl.fr
leus@rpi.edu  (Sheua-Wan Leu)
lex@interfhq.hacktic.nl  (Lex van der Sluijs)
lilley@uk.ac.mcc.cgu.v5  (Chris Lilley, Computer Graphics Unit)
ljr@beach.cis.ufl.edu  (Lawrence Rounds)
lmg@eagle.natinst.com  (Luis Gomes)
loffit@wam.umd.edu  (Roman Candle)
loofbour@cis.ohio-state.edu  (Nathan Loofbourrow)
luigi@crs4.it  (Luigi Filippini)
M.J.A.M.vanGerwen@research.ptt.nl  (Emile van Gerwen)
ma9tn@ss1.bath.ac.uk  (T Nettleship)
majid-fazal@MATH.YALE.EDU  (Fazal Majid)
malloy@nprdc.navy.mil  (Sean Malloy)
martel@issy.cnet.fr  (Pierre MARTEL)
martin@eola.cs.ucf.edu  (Glenn Martin)
MARTIN@qut.edu.au
marvinl@amber.rc.arizona.edu  (Marvin Landis)
masc1396@ucssun1.sdsu.edu  (Avoid normal situations.)
matteson@netcom.com  (Richard Matteson)
matveyev@desert.ihep.su  (Matveyev)
mayoff@ccwf.cc.utexas.edu  (rob)
mcodogno@nyx.cs.du.edu  (Maurizio Codogno)
meriaux@lifl.fr  (Michel Meriaux)
mgroen@marge.mikom.csir.co.za  (Michael Groenewald)
mhatz@nyx.cs.du.edu  (Mike Hatz)
michael@dsndata.kpc.com  (Michael Cornelius )
michaelr@spider.co.uk  (Michael S. A. Robb)
michaels@vsl.com.AU  (Michael Snoswell)
millerc@stu.beloit.edu  (Caleb Miller)
milun@cs.Buffalo.EDU  (Davin Milun)
mitch@roissy.csd.uwm.edu  (Mitch Blank Sr)
mo18g19@ecume.cict.fr  (mo18g19)
moccozet@cui.unige.ch  (Moccozet Laurent)
moeller@informatik.uni-hildesheim.de  (Steffen Moeller)
mossap@essex.ac.uk  (Moss A D)
mpdillon@halcyon.halcyon.com  (Michael Dillon)
muir@idiom.berkeley.ca.us  (David Muir Sharnoff)
neri@hobbes.nrl.navy.mil  (jesse neri)
nethack@hebron.connected.com  (James Johnson)
nic@informatik.uni-rostock.de  (Nico Guenther)
nick@cs.unc.edu  (Nick England)
nystrom@ludwig.psc.edu  (N.A. Nystrom)
obz@Kodak.COM  (Orest Zborowski)
ole!parksoft!dave@nwnexus.wa.com  (Dave Hendrix)
Olivier.Arsac@sophia.inria.fr  (Olivier Arsac)
pauld@umbc.edu  (Mr. Paul Danckaert (ACS))
paynowsk@ct.picker.com  (PAYNOWSKI)
pes@cs.hut.fi  (Pekka Siltanen)
pete@sst.icl.co.uk  (Pete Bevin)
peterb@dcs.qmw.ac.uk
petrin@mdata.fi  (Petri Nordlund)
petrot@masi.ibp.fr  (Frederic PETROT)
pevans@sanjuan.UVic.CA  (Patricia Evans)
Phil.Richards@prg.oxford.ac.uk
Philip.Dutre@cs.kuleuven.ac.be  (Phil Dutre)
pjunold@daimi.aau.dk  (Peter Joachim Unold)
pmchoi@cs.ust.hk  (Sam P. M. Choi)
pmh@cs.brown.edu  (Philip M. Hubbard)
psmith%pieman@pieman.compserv.utas.edu.au (Paul Jeffrey Smith)
quintro!wls@lll-winken.llnl.gov  (Warren L. Schroeder)
Raj.Subramani@newcastle.ac.uk  (Raj Subramani )
ram@soft25.acri.fr  (Raphael Manfredi)
reed-d@cis.ohio-state.edu  (David Reed)
rgacek@wam.umd.edu  (Randall A. Gacek)
rick@crick.ssctr.bcm.tmc.edu  (Richard H. Miller)
rieger@iue.tuwien.ac.at
rif@Athena.MIT.EDU
rll@fizban.iol.unh.edu  (Robert L. Lamothe)
rob@rjck.oau.org  (Robert J.C. Kyanko)
robert@alkymi.unit.no  (Robert Schmidt)
roberts@brahms.amd.com  (Dave Roberts)
rogerb@eiffel.demon.co.uk  (Roger Browne)
rokne@cpsc.ucalgary.ca  (Jon Rokne)
root@ilfb03.tuwien.ac.at  (Gerhard Schneider)
roy@eckerd.edu  (Jonathan Roy)
rschmitt@lehman.com  (Robert Schmitt)
rsilton@coolpro.melpar.esys.com  (Rick Silton)
rww@c3.PLA.CA.US  (Richard W. Webb)
salad@eskimo.com  (Trevor Lewis)
saty@ntc.togliatti.su  (Sergey A. TsYbanov)
savage@dg-rtp.dg.com  (Ed Savage)
scd@cs.brown.edu  (Steven C. Dollins)
schaf901@uidaho.edu  (Schafer Jeffrey)
SCHEIRICH@EIGCL1.una.ac.at
seg@world.std.com  (Andrew J Agoos)
shan@techops.cray.com  (Sharan Kalwani)
shenoy@iastate.edu  (The Destroyer)
SIEBER%CFRUNI51.BITNET@CEARN.cern.ch
spanky@wam.umd.edu  (Yoda)
spebcg@thor.cardiff.ac.uk  (BMO)
speer@alumni.cs.colorado.edu  (Rick Speer)
spl@pitstop.UCSD.EDU  (Steve Lamont)
spl@se.houston.geoquest.slb.com
sriram@Austin.slcs.slb.com
srmaster@hocm.nhlbi.nih.gov  (Stephen R. Master)
ST2C3@Jetson.UH.EDU
ST34B@Jetson.UH.EDU
stark@frenet.informatik.uni-dortmund.de  (Michael Stark)
Stefan.Farestam@cerfacs.fr
streit@iam.unibe.ch  (Christoph Streit)
stu@valinor.mythical.com  (Stu Labovitz)
sward+@cmu.edu  (David Reeve Sward)
syndrome@email.teaser.com  (Yannick DAUBY)
synge@mist.wv.tek.com  (James Synge)
s_ledoux@csc32.enet.dec.com  (Scott LeDoux -- 592-4953)
t890449@patan.fi.upm.es  (Marcos Sagrado Strik)
talluri@indra.csc.ti.com  (Raj Talluri)
teo@CS.Stanford.EDU  (Patrick ChengSan Teo)
thompson%melupl.UUCP@mathcs.emory.edu  (Ken Thompson)
TSCHANNE%CFRUNI51.BITNET@CEARN.cern.ch
UC512052@MIZZOU1.missouri.edu
uchida@smc.univie.ac.at  (Mark-Rene Uchida)
ulbricht@u.washington.edu  (Craig Ulbricht)
uma@archone.tamu.edu  (Umakanth Thumrugoti)
uselton@nas.nasa.gov  (Samuel P. Uselton)
vazquez@iqm.unicamp.br  (Pedro Vazquez)
was%miranda@garwein.hai.siemens.co.at  (Wolfgang Anton Sommerer)
wdawe@internex.io.org  (Wayne Dawe)
weinhous@alpha.hahnemann.edu  (Martin S. Weinhous Ph.D.)
Wierse@rus.uni-stuttgart.de  (Andreas Wierse)
wilson@blaze.cs.jhu.edu
winter@pegasus.cs.uni-sb.de  (Stefan Winterstein)
yarbrou@uis-1.UnitedIS.COM
-- 
______________________________________________________________________________
Steve Hollasch                                   Kubota Pacific Computer, Inc.
hollasch@kpc.com                                 Santa Clara, California

 
USENET FACT: Flaming
Flaming is the hostile interaction between multiple Usenet users.