* comp.os.plan9 call for votes
@ 1995-07-14 4:23 Scott
0 siblings, 0 replies; only message in thread
From: Scott @ 1995-07-14 4:23 UTC (permalink / raw)
I see that the CFV for comp.os.plan9 has been posted to news.groups,
and didn't see a reminder posted here, so this is it.
| From: handler@sub-rosa.com (Michael Handler)
| Subject: CFV: comp.os.plan9 moderated
| Date: 12 Jul 1995 23:24:45 -0000
|
| FIRST CALL FOR VOTES (of 2)
| moderated group comp.os.plan9
|
| Newsgroups line:
| comp.os.plan9 Plan 9 from Bell Labs.
|
| Votes must be received by 23:59:59 UTC, 2 Aug 1995.
|
| This vote is being conducted by a neutral third party. For voting
| questions only contact Michael Handler <handler@sub-rosa.com>. For
| questions about the proposed group contact Jim Davis
| <jdavis@cs.arizona.edu>.
|
| RATIONALE
|
| Plan 9 is a computing system developed at the Computing Science
| Research Center of AT&T Bell Laboratories. First released in 1990,
| Plan 9 contains many innovative ideas but is robust enough for
| production use. There is an active Plan 9 mailing list with several
| hundred readers.
|
| Past releases of Plan 9 could only be licensed by universities. The
| next release will be available to anyone, and run on a wide range of
| PCs. This will make running Plan 9 an option for many Usenet readers.
|
| A Plan 9 newsgroup would let Plan 9 users help each other, and let
| anyone interested in current operating system practice learn about
| Plan 9.
|
| CHARTER
|
| comp.os.plan9 is a moderated newsgroup for discussion of the Plan 9
| operating system from Bell Labs. It's a forum to ask questions and
| share information about installing, administering, and using Plan 9
| systems. The newsgroup will be bidirectionally gatewayed with the
| Plan 9 mailing list <9fans@cse.psu.edu>
|
| MODERATORS & MODERATION POLICY
|
| Icarus Sparry <ccsis@bath.ac.uk> has volunteered to be moderator; Tim
| Goodwin <tim@pipex.net> has volunteered to be backup moderator. Both
| are participants on the Plan 9 mailing list. Moderation is intended
| to keep discussion on charter topics, which we hope will encourage the
| Plan 9 developers to participate.
|
| MAILING LISTS AND GATEWAYS
|
| comp.os.plan9 will be bidirectionally gatewayed with the mailing list
| <9fans@cse.psu.edu>.
|
| DISTRIBUTION
|
| This Call For Votes (CFV) has been crossposted to the following newsgroups:
|
| news.announce.newgroups, news.groups, comp.os.research, comp.os.misc
|
| After this Call For Votes (CFV) appears in <news.announce.newsgroups>, it
| will be sent to the following mailing lists:
|
| * Plan 9 mailing list <9fans@cse.psu.edu>
|
| HOW TO VOTE
|
| One vote counted per person, no more than one per account. Attempts at
| ballot box stuffing or vote fraud will not be treated lightly.
|
| **************************************************************************
| *** IMPORTANT: Email addresses, names, and votes of all voters will be ***
| *** published in the final voting results list. UVV voting is not done ***
| *** by secret ballot. If you don't like this policy, don't vote. ***
| **************************************************************************
|
| Send email to: <plan9-vote@sub-rosa.com>
| Just replying should work if you are not reading this on a mailing list.
|
| Your mail message should contain ONE (and only ONE) of the following
| statements:
|
| I vote YES on comp.os.plan9
| I vote NO on comp.os.plan9
| I vote ABSTAIN on comp.os.plan9
| I CANCEL my vote on comp.os.plan9
|
| If you vote ABSTAIN, your vote will be registered and will be shown in
| the final results posting, but it will not affect the outcome of the vote.
| It is intended as a form of symbolic protest, nothing more.
|
| If you CANCEL your vote, all records of your vote will be purged from the
| active results file, and your name and address will not be listed in the
| final results posting.
|
| ABSTAIN and CANCEL are nearly the same thing -- the only difference is,
| with ABSTAIN, your name and address are still listed in the final listing.
|
| If you later change your mind you may vote again. Only your last valid
| vote will count and will be published in the final results posting.
|
| Anything else may be rejected by the automatic vote counting program. The
| votetaker will respond to your received ballots with a personal
| acknowledgement by mail -- if you do not receive one within several days,
| try again. It's your responsibility to make sure your vote is registered
| correctly.
|
| After the final results are posted to <news.announce.newgroups>, there
| will then be a five-day period during which the published vote list may be
| corrected and any irregularities addressed.
|
| OFFICIAL SOURCES OF THE CFV
|
| The only official sources of this CFV are:
| * The copy which was crossposted to <news.announce.newgroups>
| * Any copies which were sent to mailing lists by the votetaker (and *only*
| the votetaker)
| * One received from the votetaker's automated mailserver
|
| To obtain a copy of the CFV from the votetaker's mailserver, send an
| email message to <plan9-cfv@sub-rosa.com>. This is an automated function,
| so it does not matter what you say in the message.
|
| IMPORTANT: If you give anyone copies of the CFV, the copies must be whole
| and unmodified. Distributing pre-filled in ballots or modified copies of
| this CFV is considered voting fraud. If this occurs on a large scale or
| causes voting problems or irregularities, the vote may be canceled.
|
| When in doubt, ask the votetaker.
| --
| Michael Handler <handler@sub-rosa.com> Usenet Volunteer Votetakers (UVV)
| Usenet Volunteer Votetakers WWW page: <URL:http://www.amdahl.com/ext/uvv>
^ permalink raw reply [flat|nested] only message in thread
only message in thread, other threads:[~1995-07-14 4:23 UTC | newest]
Thread overview: (only message) (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
1995-07-14 4:23 comp.os.plan9 call for votes Scott
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox;
as well as URLs for NNTP newsgroup(s).