HDTenEightyP/NetNews huggingface dataset:
From: phd99@seq1.keele.ac.uk (Asmodeus)
Newsgroups: rec.arts.sf.tv
Subject: Blake's 7 posting (was Re: Blake's 7 Ending)
Date: 4 Sep 92 11:21:11 GMT
Organization: University of Keele, England

From article <1992Sep3.095330.58593@cc.usu.edu>, by sll28@cc.usu.edu (Lorna Payne):
> 
> Justin, you know not what you have done!
> 
> While I,for one, quite enjoy seeing "Blake" posts, I know that many people
> do not.  Perhaps we can keep the debate short this time.

	Excellent point... NOT!

	This is rec.arts.sf.tv ?
	Blake's 7 is sf.tv ?
	So why shouldn't people post Blake's 7 articles to this
newsgroup? At least until there is a Blake's 7 newsgroup of its own (and
I am not volunteering!). This may be the eighteenth zillion time that
the B7 ending has been discussed, but that should not make any
difference at all:

	1) Maybe fresh blood will give fresh inspiration.
	2) Don't forget that whereas 75% of usenet readers may have been
here for the last eight discussions (or more!), the readership is
constantly changing - lets give them a chance.

	Usenet is for anyone and any subject - as long as they keep the
article to the right (or relevant) newsgroup, and use a sensible header
so that people can skip the news they don't want to read, then what is
the problem if a group of new(ish) readers want to rediscuss an old
thread? None.

	This isn't meant to be a flame, especially not a personal one
Lorna, but this kind of thing goes on all the time in lots of popular
newsgroups (movies, star trek etc.), and although I have used usenet for
a long time now, I don't mind if someone discusses things I have already
read to death - because once upon a time, I was in that position, as was
everyone. I sometimes read them, and sometimes just skip them - but lets
just be tolerant and let anyone discuss what they want. By all means, if
someone fails to post to the correct newsgroup, or maybe uses an
ambiguous header then maybe a bit of guidance could be directed.

	Discussion welcome - but don't bother flaming as that is just
plain silly and a true waste of space.
	Ralph.

-- 
      .
              [Believed to be the smallest .sig in the world]
Newsgroups: rec.arts.sf.tv
From: c8643631@cc.newcastle.edu.au (THE MAD DUCK)
Subject: Re: Yet Another Blake's 7 Question
Organization: University of Newcastle, AUSTRALIA
Date: Wed, 26 Aug 1992 01:06:16 GMT

In article <1992Aug24.134559.20692@ulowell.ulowell.edu>, oneill@cs.ulowell.edu (Brian 'Doc' O'Neill) writes:
> 
> In article <1992Aug22.142831.58328@cc.usu.edu>, slg7m@cc.usu.edu writes:
> |> I watched Blake's 7 a few times about a year ago.  At that time, there was a
> |> Blake and I believe there were even 7 crewmembers.  Since I've started watching
> |> it again, Blake is gone (presumably dead though Avor doesn't really believe
> |> it), 2 more of the original crew members have died, their fabulous ship is
> |> gone, which leaves them with 3 of the 7, ORAC and no Blake.
> 
> To tell you the truth, unless they counted Zen, they at most had 6. The
> "original" crew of the Liberator (after a few episodes) were Blake, Genna,
> Avon, Gan, Villa, and Cally. So, was Zen really considered one of the seven?
> 
> As far as "decimating" the crew, they really didn't have a choice, and the
> writers certainly couldn't forsee the future. The actor (forget) who played
> Gan wanted out shortly after the first season, and Gareth Thomas (Blake) and
  ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^

Actually, Gan (David Jackson) didn't want out but the producers decided that
one person needed to die and after considering a short list of possibles
(anyone except Jenna and Blake) they decided on Gan. Sad, really.
	
> the actress who played Genna (forget again) left after season 2. Gan was
> never replaced, Steven Pacey (Tarrant) filled in for Blake, and Dayna
> replaced Genna. Cally left after season 3, to be replaced by Soolin. Even
> Zen was replaced by Slave (I was saddened at the loss of Zen and his final
> words...).
> 
> =======================================================================
> Brian O'Neill - Systems Manager, Computer Science 	 (508) 934-3645
> University of Massachusetts at Lowell
> Internet: oneill@ulowell.edu		Moderator, comp.binaries.ibm.pc
From: lorenh@hpcvra.cv.hp.com (Loren Heisey)
Date: Wed, 26 Aug 1992 20:02:13 GMT
Subject: Eerie Indiana episode guide
Organization: Hewlett-Packard Co., Corvallis, OR, USA
Newsgroups: rec.arts.sf.tv

A group of us has been working on an expanded Eerie Indiana guide. The
guide now includes the cast, guest cast, writers, directors, synopsis,
some of the introductions that Marshall gives, part of the production
credits, some of the cast's other roles, air dates, commercial voice-
overs, some newspaper and magazine articles on the show, and some
other things.

The formatted ASCII text output of the expanded Eerie Indiana episode
guide is in the /tmp directory of ftp.coe.montana.edu as eerie.guide.
Before someone without ftp or email asks, at 54 pages it is probably
a bit long to post here.

Unless there is sufficient interest, the nroff/troff sources and the
formatted PostScript output (with graphic of the show's title screen)
will not be available until the maintainer of the site resumes adding
things to the site.

--
Loren Heisey
Internet: lorenh@hpcvra.cv.hp.com
UUCP    : {decwrl|rutgers|ucbvax}!hplabs!hp-pcd!lorenh
From: pjh@eng.cam.ac.uk (Philippa Hogben)
Newsgroups: rec.arts.sf.tv
Subject: Re: Blake's 7 again
Keywords: blake
Date: 28 Aug 92 15:53:05 GMT
Organization: cam.eng

enc369l@monu1.cc.monash.edu.au (Mr BDJ. Johnson) writes:

>Can someone tell me the number of episodes ? and maybe how many series etc.

4 series of 13 episodes each making 52 episodes (hey, I can do maths! 8-)  )

Philippa

--
Philippa Hogben   pjh@eng.cam.ac.uk  (Reverse if mailing from Janet)
Any mistakes are mine, all mnie.

I am not a .sig virus. I am a free bug. 
Newsgroups: rec.arts.sf.tv,rec.arts.tv
From: lskinner@emr1.emr.ca (Lauren Skinner)
Subject: Re: Looking for rec.arts.tv.fiction
Organization: Energy, Mines, and Resources, Ottawa
Date: Thu, 3 Sep 1992 14:28:33 GMT

In article <1992Sep2.110358.27249@ringer.cs.utsa.edu> lmathews@lonestar.utsa.edu
(Leanthony R. Mathews) writes:
>I'm looking for the a group to post fan written fiction that is NOT
>about Star Trek.  More like QL, Raven, even 90210.  Does such a group
>exist?
>I think this is a group we need. What do you think?

I agree!  I would also like to see some non-Trek fiction posted, especially
QUANTUM LEAP, RED DWARF, other Brit. stuff...
From: steppe@ccwf.cc.utexas.edu (Top Changwatchai)
Newsgroups: rec.puzzles
Subject: Re: riddle I remember reading as a kid
Date: 31 Aug 92 00:50:46 GMT
Organization: The University of Texas at Austin, Austin TX

In article <64901@cup.portal.com> Eric_J_Rainbolt@cup.portal.com writes:
>Here's an easy one.  I remember trying to figure this out when
>I was a kid.  I think it was in HighLight's Magazine.
>There was a villian, a farmer, and his daughter.  The farmer owed
>the villian lots of money, but he couldn't pay his debt.  They were all
>standing in a street loaded with white and black pebbles.  The villian said,
>"I will pick up two pebbles, a white and a black one, put it in my hat, and
>let your daughter choose.  If she pulls a black one, she is mine in payment
>of your debt, if she chosses white, she is free."  The nervous farmer, not
>to mention his daughter, agreed to the contract.  When the villian grabbed
>the stones from the ground, the daughter noticed that he picked up two
>black stones.  She knew if she refused to choose, the villian would win.
>What does she do?

She pulls out one of the stones (keeping it hidden from view), shows the black
one remaining in the hat, and says, "Since the black remains, I must have
picked the white, and I am free."

The villain then chortles nastily and says, "Well, since you're free, I won't
have to pay any money for you," and reaches for the girl.  A fight ensues,
then a chase, a dramatic death, and finally the villain is apprehended and
exiled and goes on to become a used car salesman.

I guess I'm just a romantic at heart.

Top
-- 
steppe@ccwf.cc.utexas.edu
"I'm gonna live forever or die trying."
marva.wisdom.weizmann.ac
 dany
Newsgroups: rec.puzzles
Subject: 2,3,4,5,6,7,8,9,10,?
From: dany@marva.wisdom.weizmann.ac.il (Nabutovsky Dan)
Date: Tue, 25 Aug 1992 12:05:33 GMT
Distribution: rec
Organization: Weizmann Institute of Science, Computation Center

   What is the next item in the serie:
 2, 3, 4, 5, 6, 7, 8, 9, 10, ?, ...

   (Not 11)

   Dan.
From: rstimets@silver.ucs.indiana.edu (robert and stimets)
Newsgroups: rec.puzzles
Subject: Re: penny hex symmetry <Solution/Spoiler?> - OOps!
Date: 2 Sep 92 19:26:40 GMT
Organization: Indiana University

In article <nfwyczd@rpi.edu> rogerj@aix.rpi.edu (Jeffrey C. Rogers) writes:
>rogerj@aix.rpi.edu (Jeffrey C. Rogers) writes:
>
>>Well, for sufficiently large numbers of pennies there is the trivial
>>solution:
>>      o           o
>>	 o o { ... } o o
>>	  o           o
>
>Oops, here folks. vi tricked me into thinking they were aligned, but alas,
>no.
>The picture should properly look like:
>
>	  o           o
>	 o o { ... } o o
>	  o           o
>
>Sorry for any confusion caused.
>
Not too much confusion, but more of a question: what are the three lines of
symmetry?  Vertical and horizontal are obvious, what else?

By the way, given the rule "each penny must have at least two neighbors,
we can answer "no", n=1 and n=2 being counterexamples.

RStimets
From: emru@CAM.ORG (Emru Townsend)
Newsgroups: rec.puzzles
Subject: Re: Adam and Eve puzzle
Date: 24 Aug 92 22:36:26 GMT
Distribution: rec
Organization: Communications Accessibles Montreal, Quebec Canada

In article <1502@rwja.umdnj.edu> bawagan@rwja.umdnj.edu (Hinayana Bawagan) writes:
>If this is an FAQ, please excuse me.
>
>     A scuba diver surfaced from the water and found himself in front of
>a cave.  He saw at its entrance the naked bodies of a man and a woman.  
>Immediately he concluded:  They're Adam and Eve.  WHY?

No navels.

==========================================================================
Emru Townsend        Fido: 1:167/133        emru@cam.org        BIX:switch
Q:  Do you know what the death rate around here is?    A:  One per person.
Newsgroups: rec.puzzles
From: rogerj@aix.rpi.edu (Jeffrey C. Rogers)
Subject: Re: penny hex symmetry <Solution/Spoiler?>
Date: Mon, 31 Aug 1992 17:50:36 GMT

naraht@drycas.club.cc.cmu.edu (Randolph J. Finder) writes:

>Is it always possible to put n pennies on a hexagonal grid so that the
>resulting shape has at least two lines of symmetry?

>To exclude the line of pennies the condition is added that all pennies must
>have at least two neighbors.

>Examples: for 6 pennies, make a triangle, it has three lines of symmetry.

>For 7 pennies. arrange 2-3-2, this has three lines of symmetry.

>For 8 pennies, arrange 3-2-2, this has two lines of symmetry.

Well, for sufficiently large numbers of pennies there is the trivial
solution:
      o           o
	 o o { ... } o o
	  o           o

There is a line of symmetry through the center, and one through the length
of the line. The minimum for this form is 8 pennies, with 0 pennies in the
braces ({...}). There are also degenerate forms of this solution, where the
two diamonds ovelap partially or completely (7 pennies and 4 pennies,
respectively). This solution meets the two neighbors condition, but is
really only an extension of the trivial straight line solution.

With a bit more thought, this basic idea can be expanded into more solutions
all involving straight lines (i.e., 3 lines of pennies will work for
multiples of 3) but this will work for any number of pennies >=8, anything
less can be proved by example (rather than induction)

Diversion
------------------------------------------------------------------------------
"I can see 'em                        | "Want me to create a diversion?"
   I can see 'em                      | 
	  Someone wake me when it's over" | rogerj@rpi.edu
------------------------------------------------------------------------------
From: iad@cogsci.ed.ac.uk (Ivan A Derzhanski)
Newsgroups: rec.puzzles
Subject: Re: Audible Puzzles or Nonsense Questions was  Re: Slaughter of the Innocents
Keywords: puzzle Bible New Testament
Date: 27 Aug 92 16:38:32 GMT
Organization: Centre for Cognitive Science, Edinburgh, UK

In article <12683@grayt> grayt@Software.Mitel.COM (Tom Gray) writes:
>Can anyone give more examples of audible puzzles like this that
>rely on the listener trying to make sense of a nonsense question?

Q: `How would a dumb man ask a sales assistant for a hammer?'
A: <bangs table with fist>
Q: `Good.  And how would a blind man ask for scissors?'
A: <imitates cutting with index and middle finger>

<drum roll>

Q: `Wait a minute.  Why must a _blind_ man use gestures?'

-- 
 `If ye hiv ears oan yer heid - then use them tae lissen.' (The Glasgow Gospel)
Ivan A Derzhanski   (iad@cogsci.ed.ac.uk;  iad@chaos.cs.brandeis.edu)
* Centre for Cognitive Science,  2 Buccleuch Place,  Edinburgh EH8 9LW,  UK
* Cowan House, Pollock Halls, 18 Holyrood Park Road, Edinburgh EH16 5BD, UK
Newsgroups: rec.puzzles
From: amdee@athena.mit.edu
Subject: Re: 2,3,4,5,6,7,8,9,10,?
Organization: Mass Inst Tech
Distribution: rec
Date: Wed, 26 Aug 1992 00:51:01 GMT

How about 12?
We can say this is the series of successive
integers starting with 2, but with no numbers
that have repeat digits (hence 11 is out)

Probably wrong, though.

--
Amdee

Ibe veelig o ick!
By node eez oll chtufd ub!
From: ncramer@bbn.com (Nichael Cramer)
Newsgroups: rec.puzzles
Subject: Re: Audible Puzzles or Nonsense Questions
Date: 27 Aug 1992 15:43:28 GMT
Organization: Bolt Beranek and Newman Inc., Cambridge MA
Reply-To: ncramer@labs-n.bbn.com (Nichael Cramer)
NNTP-Posting-Host: bbn.com
Keywords: puzzle

jkenton@world.std.com (Jeff Kenton) writes:
>>How do you pronounce the capital of Louisiana? New Orlins, or New Orleeens?
>In addition to the obvious problem, you will discover that
>natives tend to pronounce it Norlins.

OK, Jeff <snicker, snicker>, how about the capital of Kentucky:
Lew-ee-ville, or Lew-is-ville.

NICHAEL  
nichael@bbn.com  --                Bush/Gorbachev: One Down, One to Go
From: moon@mozart.llnl.gov (Steven Moon)
Newsgroups: rec.puzzles
Subject: Re: 30 questions
Date: 25 Aug 92 22:45:36 GMT
Organization: Lawrence Livermore National Laboratory

In article <1992Aug25.172646.1435@ole.cdac.com>, ssave@ole.cdac.com (Shailendra Save) writes:
|> 
|>   This is a typical 30 questions puzzle.  I have a number of them,
|> and I will start with one.  The aim of the puzzle is to find a
|> plausible story that will fit the scenario that I am going to put
|> to you.  You have 30 questions that you can ask, to which I will
|> only answer "Yes" or "No".  You have to find out what happened.
|> Please send me direct email, I will reply to you directly, so that
|> others' fun is not spoiled.  Internet should be fast enough. Besides,
|> you need time to think in-between. Please don't post any answers (with
|> or without "SPOILERS" subject headings on the net.)
|> Here goes:
|> 
|> 30 questions(Puzzle 1)
|> 
|>  A man walks into a bar. He asks for a glass of water.
|>  The bar-tender looks at him and gives him a glass of water.
|>  The bar-tender pulls out a gun and points at the man.
|>  The man smiles and leaves.
|>  What happened here?
|> 
|> 
|> 
|>  -Shailendra
|>  ssave@ole.cdac.com

Sorry, but the answer to this has already been given.  It was also mentioned that
Games magazine is having a contest of these types of puzzles.  I think that this is 
also in FAQ, but since I have not seen FAQ I can not be sure.  

Here is a 30 question puzzle I have not seen here.  Don't flame me if its in FAQ.

    John walks into his house and sees Jill dead on the floor.
    The house is empty except for Bill.
    Bill is sitting on the couch near Jill.
    John does not call the police.  Why? 


.Steve
From: moon@mozart.llnl.gov (Steven Moon)
Newsgroups: rec.puzzles
Subject: Re: Smurf problem
Date: 3 Sep 92 16:28:25 GMT
Article-I.D.: lll-wink.135310
Organization: Lawrence Livermore National Laboratory

In article <BtyuE9.JzM@usenet.ucs.indiana.edu>, rstimets@silver.ucs.indiana.edu (robert and stimets) writes:
|> In article <1992Sep1.150543.28977@hellgate.utah.edu> tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman) writes:
|> >Alright, so the mayor dude calls for all red hatted smurfs to stand up....
|> >Let's examine some possibilities....
|> >
|> >0) If no smurfs had red hats, the mayor would not have made the request
|> >
|> >1) If one smurf had a red hat, he would see no one else had red hats, so
|> >would have stood up on the first request.
|> >
|> >2) If two smurfs had red hats, on the first request they would have waited
|> >(for they would assume the other guy would stand up).  They might wait
|> >to see what the other guy did.... but since the commands came rather
|> >quickly they would have to wait for the next request.  After the next
|> >request, they would know that they too had a red hat, so would stand.
|> >
|> >Therefore, the number of request made equals the number of people standing.
|> >
|> >
|> 
|> Unfortunately, this would have to contradict the premise of the puzzle, that is:
|> The smurfs have no way of finding out which color hat they have on.
|> 
|> RStimets

I don't think that this solution does contradict the puzzle's premise.  
That is if the Smurfs are very intelligent and disciplined.  This is to say that
every request would be obeyed if it could.  Thus if the mayor asked for Smurfs 
with red hats to stand, the Smurfs would know that the request was made thus 
there was at least one Smurf with a red hat.  So if a particular Smurf, say Handy 
Smurf, saw no other Smurf with a red hat he would stand.  But if every one saw at
least one Smurf with a red hat on no one would stand.  So the mayor calls
again for Smurfs with red hats to stand.  The Smurfs now know that there are at least 
two red hatted Smurfs and so all those seeing only one red hat stand.  Maybe Farmer and
Papa Smurf. This, if my logic is correct, goes on until the mayor stops calling for
Smurfs with red hats to stand.
However, we all know that Smurfs are not very smart and very undisciplined.  So I would
say that a random number of them finally stand none of which have on red hats.
There are two, who don't stand, that have red hats on.

This problem is a variation of one I heard some time ago.
It is with three individuals each wearing one of five hats, three
brown two black.  They are standing in a line and can only see 
those in front of them.  The last in line can see the color of
the hats of the two in front of him.  The second in line can see
the only the one in front of him and the first in line can't see
anyones hat.  They can't talk or leave untill they are certain what
color hat they have on.  After a long time the person first in
line leaves.  What color hat does he have on.

.steve
From: jonwa@ida.liu.se (Jonas Wallgren)
Newsgroups: rec.puzzles
Subject: Re: Solitaire games
Date: 30 Aug 92 15:12:16 GMT
Organization: CIS Dept, Univ of Linkoping, Sweden

In article <1992Aug28.063728.20792@dde.dk> ct@dde.dk (Claus Tondering) writes:
>What do you do when you are bored?

Since I always use cross-ruled paper to write on, I very often design tilings
or nice symmetric or periodic patterns on the grid. The symmetry is not always
2- or 4-fold - I've found that the hexagon
(0,0)-(0,1)-(1,1.5)-(2,1)-(2,0)-(1,-.5)-(0,0) looks nearly regular, so the
symmetry is very often 6-fold.

Draw a horizontal line A units long. Continue on the diagonal up-left with a
line B units long. Then A units down. Then B units up-right. Etc...
Once I examined what different kinds of stars you get depending on the relation
between A and B. And since I forget the result, and don't archive my
unimportant notes, I come back to such themes now and then.

There are some puzzles on filling an m*n-rectangle with 1*2-rectangles. I
often fill a general hexagonal shape with rhombic tiles consisting of two
eqilateral triangles, and for example count the number of possibilities or
minimize the number of edges where two tiles meet such that their other edges
are parallel.

I do such scribbling not only when I'm waiting. When I sit at my desk at home
listening to the radio, or when I attend a lecture and listen to what is
presented but don't need to look at what is shown, then I may fill my pad with
such things - i.e. those not needing too much intelligence and concentration.

Sometimes I create some problems, often related to geometry, such as:

	A rectangular paper ABCD (AB<BC) is fold such that A touches C. The
	fold intersects BC in E and AD in F. What is the length/bredth-ratio of
	the paper if BE=EF?
-------------------------------------------------------------------------------
Jonas Wallgren                                 |                 jwc@ida.liu.se
Department of Computer and Information Science |
Linkoping University                           |-------------------------------
S-581 83  Linkoping                            |Everything that is systematized
Sweden                                         |becomes aesthetic --- B. Becher
-------------------------------------------------------------------------------
From: mitchell@cs.uchicago.edu (Mitchell Marks)
Newsgroups: rec.puzzles
Subject: Re: Audible Puzzles or Nonsense Questions was  Re: Slaughter of the Innocents
Date: 31 Aug 92 23:52:51 GMT
	<78714@ut-emx.uucp>
Reply-To: mitchell@cs.uchicago.edu
Organization: University of Chicago Computer Science

>>>>> "TC" == Top Changwatchai <steppe@ccwf.cc.utexas.edu> writes:

  TC> In article <12683@grayt> grayt@Software.Mitel.COM (Tom Gray) writes:

  TC> Another kind has to do with spelling or pronunciation: How do
  TC> you pronounce M-A-C-D-O-N-A-L-D?  How about M-A-C-B-E-T-H?  And
  TC> M-A-C-H-I-N-E?  (There's a tendency at this point to pronounce
  TC> the "hine" separately and with a long "i".)

I'm used to this one done as m-a-c-h-i-n-e-r-y.  Somehow MacHinery
seems like a plausible name, perhaps related to McInerney.

--
Mitch Marks    mitchell@cs.uchicago.edu
Barbara celarent darii ferio  baroco camestres cesare festino  bocardo
darapti datisi disamis felapton ferison  bramantip camenes dimaris
fesapo fresison
From: Edward_Lunny@mindlink.bc.ca (Edward Lunny)
Newsgroups: rec.puzzles
Subject: Re: 30 questions
Date: 29 Aug 92 14:53:18 GMT
Organization: MIND LINK! - British Columbia, Canada
Distribution: world

Hiccups- now cured,
I know about 6 of these, i'd be interested in other ones.
From: Peter.Wong@p2.f158.n633.z3.fidonet.org (Peter Wong)
Sender: acsnet@csource.oz.au
Newsgroups: rec.puzzles
Subject: Little Quiz
Date: Fri, 21 Aug 1992 23:05:02 +1000

hehheh Adrian I think the fig leaves give it away... BUT the real reason is that
they had no bellybuttons! - as they were created not born.

Hmm... Ok try this puzzle:

If a bottle containing 18 tablets, where 1.5 tablets were taken each day
(sampling without replacement)... .Oh sorry thats the same problem as my VCE RD
CAT topic... hehhehe maybe I should ask for help! 
 

 * Origin: .   .  . ..RAVENLOFT BBS [03-899-3247].. .  .   . (3:633/158.2)
From: DEANRE@bscf.uga.edu (ROBIN DEAN)
Newsgroups: rec.puzzles
Subject: 4 color atlas
Date: 1 Sep 92 18:10:38 GMT
Organization: University of Georgia, USA
X-News-Reader: VMS NEWS 1.20


     While I am fairly sure that this question has been posted I am
a relatively new netter so I have not seen it and have been curious
as to answer since 8th grade when I first saw it.  Any information would
be greatly appreciated.

     QUESTION:::

    Has it ever been proved that with only 4 colors any planar map
can be colored in such a way so that no two countries that touch
will have the same color?

     My math teacher presented our class with this problem back in
1977 and at that time he said it had not been either proven nor
disproven.  (Apparently at one time there was a reward for the person
who could find a map that needed 5 colors.)

    Thanks in advance,
    Rob
    Deanre@bscf.uga.edu