HDTenEightyP/NetNews huggingface dataset:
From: POKORNY@rzmain.rz.uni-ulm.de (POKORNY DAN)
Subject: Statistical software for Macintosh ?
Organization: University of Ulm, Germany
Date: Thu, 17 Dec 1992 14:41:06 GMT
X-News-Reader: VMS NEWS 1.24

Statistical software for Mac - who can advise?
We are searching for a good statistical software for Macintosh.

Our criteria:
- statistical quality
- wide range of statistics, including multivariate and exploratory analysis
- nice *and* theoretically correct graphic facilities
- satisfying for a statistician
- easy to use for empirical researchers,
  the system should have typical Mac-facilities
- suitability for educational purposes,
  help-facilties as to statistical functions
  (statistics for medical post-graduate students)

Two possible considered candidates are MacSYSTAT and STATISTICA.

I have obtained a MacSYSTAT 5.3-version for a free trial and my first
experiences are very positive as to the above mentioned criteria.
A colleague asked me about STATISTICA, but I have no experience with it
and it was not possible to obtain a demo version.

I would be very glad for comments/advices from anybody, who has experience
with SYSTAT and/or STATISTICA (and/or what else) on MacIntosh.

Thanks in advance !

Dan Pokorny
Dept. Psychotherapy, Univ. of Ulm
e-mail   pokorny@rzmain.rz.uni-ulm.de
Newsgroups: sci.math.stat
From: dan@krider.concord.wvnet.edu (Dan Krider)
Subject: ROC?
Organization: Concord College, Athens, WV, USA
Date: Fri, 18 Dec 1992 17:46:34 GMT

Receiver operating characteristic (ROC) curves are a part of decision  
theory and are used in medical science. Can anyone tell me why it is  
called this (ROC)?
From: yan-dicky@cs.yale.edu (Dicky Yan)
Newsgroups: sci.math.stat
Subject: Re: shortest chain on a sphere / shortest around the world trip
Date: 13 Dec 1992 23:01:25 -0500
Organization: Yale University Computer Science Dept., New Haven, CT 06520-2158
Distribution: world
NNTP-Posting-Host: dolphin.zoo.cs.yale.edu

In article <13DEC199216365553@cc.utah.edu> lallu@cc.utah.edu (Upmanu Lall, Civil Eng) writes:
>Does anyone know if this is a solved problem ?
> It seems like it ought to be.
>There are n arbitrary locations on the surface of the earth, each of which must
>be visited
>once and only once, starting from any one of them.
>At the end of the trip one is back at the starting point.
>It seems to me that the choice of the starting point does not matter,
>i.e. there is a unique shortest chain, and you should be able to find it
>irrespective of where you start on it.
>>?Is this assertion correct ?
>Is there an algorithm for determining the shortest path efficiently,
>and the second shortest, etc ?
>I recall from a network optimization class taken 2 decades ago, that
>a chain network is the dual problem to a flow network
>Can this be used to setup the problem such that one could
>establich whether the primal or the dual is easier to solve, and to then solve
>the problem ?
>Distances are Euclidean on the sphere (or the Earth). LAts and Longs of the
>points are known , and the number of locations is also known a priori (i.e.
>this is not a stochastic process).
>
>Any references, or suggestions to bodies of literature shall be appreciated.
>Determinitic  or Monte Carlo techniques would be fine.
>
>
>Thanks very much for your help
>Please respond to
>ulall@pub.uwrl.usu.edu

The problem you have described is called the "Traveling Salesman Problem".
It is a fairly well known problem in operations research and theoretical
computer science. There is a vast amount of literature on it.
You should be able to find references to it in a lot of textbooks on
O.R., algorithms, and perhaps other CS theory books.
The problem can come in different flavors. The one you described is
the symmetric traveling salesman. In the unsymmetric traveling
salesman problem the distance going from point A to point B may be
different from that going from point B to point A.

It is fairly well known that TSP is a hard problem. (It is called
NP-complete. In brief, it means if you can solve this problem
with an algorithm that runs in polynomial time, you will be able
to solve a large number of other difficult problems efficiently.
But so far, no human being has found such an algorithm (that runs
in polynomial time.)). Although no polynomial time algorithm is
known, a lot of heuristics and approximation solutions are known.
(I am not sure whether for the particular metic you have
described the problem is also NP-complete. I guess it is.)

If you post the question in the newsgroup "comp.theory", a lot of
people should be able to give you referenes on this problem.
I am not familiar with reference papers in research journals,
but my text book has mentioned some known (old) results for this
problem. If you need them, let me known.

Hope this helps.
Dicky Yan.
From: sunidh@m.njit.edu (Sunil Dhar)
Newsgroups: sci.math.stat
Subject: Robust Statistics
Date: 11 Dec 92 22:54:27 GMT
Reply-To: sunidh@m.njit.edu (Sunil Dhar)
Organization: New Jersey Institute of Technology


Dear Colleagues:
		Could you please give me reference for books that show how
to compute breakdown point for an estimator easily. Here, the estimator
could also be a random vector. Thanking you all in advance.

Sunil K. Dhar.
NJIT
Xref: sparky sci.math.stat:2630 sci.math.num-analysis:3618
From: shein@nima.berkeley.edu (Soren Hein)
Newsgroups: sci.math.stat,sci.math.num-analysis
Subject: Double decorrelation
Date: 17 Dec 1992 15:54:24 GMT
Organization: U.C. Berkeley -- ERL
Distribution: world
NNTP-Posting-Host: nima.berkeley.edu

Here is one of those problems that appears to be simple, but 
apparently isn't:

Given a matrix X (M by N) of stochastic variables, find two matrices 
A (M by M) and B (N by N) such that for the transformed matrix

        Y = A X B,  

we have

        E[Y Y^T] = I_M
        E[Y^T Y] = I_N

where E[.] denotes expectation, ^T denotes transposition, and I_M and
I_N are identity matrices of size M by M and N by N, respectively.

/Soren
shein@robotics.berkeley.edu

(Needless to say, this is not a homework problem etc.)
From: davej@psc.lsa.umich.edu (David A Jaeger)
Newsgroups: sci.math.stat
Subject: Re: Durbin-Watson Statistic
Date: 17 Dec 1992 18:08:32 GMT
Organization: University of Michigan - College of Literature, Science, and TheArts
Distribution: world
NNTP-Posting-Host: malthus.psc.lsa.umich.edu
X-Newsreader: TIN [version 1.1 PL8]

Peter Bruhn (bruhn@exaib) wrote:
: In article <1992Dec14.193057.27625@anasaz> from [Mon, 14 Dec 1992 19:30:57 GMT] you wrote:
:  > 
:  > Does anyone have a program to compute the Durbin-Watson test statistic?
:  > Thank you.

: Rats does compute the Durbin-Watson test statistic.

So does SAS, SHAZAM, LIMDEP, TSP, just about any other econometrics
package...

=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
David A. Jaeger               :   in person: Room 58A
Statistical Consultant        :   phone:     (313) 998-7140
Population Studies Center     :   fax:       (313) 998-7415
1225 South University Ave.    :   Internet:  David.Jaeger@umich.edu
Ann Arbor, MI  48104-2590     :   BITNET:    USERECAN@UMICHUM
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
"Stepwise regression is a tool of the devil."
             -- Gary McClelland, on sci.math.stat, Tue, 15 Dec 1992
=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=-=
Newsgroups: sci.math.stat
From: R0264@vmcms.csuohio.edu
Subject: Question on Balanced Random Sequences
Organization: CSU
Date: Wed, 16 Dec 1992 18:15:42 GMT

      For ANOVA design applications I want info about one-dimensional
sequences of trials on each of which a single treatment is administered.
The parameters are m (number of distinct treatments), n (treatment n-gram
length), and f (frequency of occurrence of each of the m**n possible
distinct n-grams).  The constrain in the randomization is that there be
f*m**n (using Fortran notation for mult. & expon.) trials in the main
sequence, in addition to a preamble of length n-1 on which observations
of the dependent variable are not used.   The purpose is for testing
for carryover effects from previous treatments as well as direct effects
of treatments on current trials.  The simplest cases of f=1 and n=1
give ordinary random permutations of the m treatments, but the tests
envisioned for carryover effects require n > 1.
   I already have a way of generating plenty of these sequences, but
have not been able to prove whether or not the method is biased relative
to the complete sample spaces whose sizes I don't even know, except that
they are quite large in most cases of interest.
   Randomized-block and latin-square theory is too restrictive, though
Williams (1949,1950, Austr. J. Sci. Res.) and Cox (1958,p.276) used
modified latin squares for a few simple special cases.
   I know a little more about these sequences than is appropriate to
expound here, but suspect that someone must know a lot more than I do.
suggestions or references to books and journal articles would be welcome
via return posting or e-mail.
                 Phil Emerson
                 Cleveland State University
Newsgroups: sci.math.stat
From: erik@misty.anasazi.com (Erik Schoenfeld)
Subject: Durbin-Watson Statistic
Organization: Anasazi, Inc.  Phoenix, Arizona USA
Date: Fri, 18 Dec 1992 16:14:41 GMT
Originator: erik@misty

>>> Does anyone have a program to compute the Durbin-Watson test statistic?

>> Rats does compute the Durbin-Watson test statistic.

> So does SAS, SHAZAM, LIMDEP, TSP, just about any other econometrics
> package...

Thank you for your answers, but I'd like to rephrase the question:

Does anyone have source code to compute the Durbin-Watson test statistic?
Any popular high-level language will do. Thanks again.
From: laydin@solar.usc.edu (Levent Aydin)
Newsgroups: sci.math.stat
Subject: Distribution of being the max of a finite collection
Date: 17 Dec 1992 09:54:43 -0800
Organization: University of Southern California, Los Angeles, CA
Distribution: world
NNTP-Posting-Host: solar.usc.edu


	Hello everyone;
	
Let x_1(u), ... , x_n(u) be a collection of independent Gaussian random 
variables with means m_1, ... , m_n and variances v_1, ... ,v_n.What is the
probability of x_1(u) being the maximum of the rest of them?
It is easy to write the answer down formally but I need a closed form solution or
a tight approximation, that I can easily evaluate numerically.
If any of you know the answer or a good reference it will graetly be
appreciated.I know it is a netiquette no no but I have to say this: Please
respond personally at laydin@solar.usc.edu .


	Thank you very much...


						L  E  V  E  N  T

Newsgroups: sci.math.stat
From: ritley@uimrl2.mrl.uiuc.edu ()
Subject: Fitting Data and Fitting Integrals
Reply-To: ritley@uiucmrl.bitnet ()
Organization: Materials Research Lab
Date: Thu, 17 Dec 1992 13:37:47 GMT


I am trying to determine the coefficients of a nonlinear
function which fit a probability distribution (x,P(x)). The
distribution P(x) is a set of data points (usually several
thousand) generated by a computer model and thus contains
noise. 

I have discovered that it is not only possibly to fit the
function directly to the data, but also it is possible to
fit the integral of the function to the integral of the
data.  In fact, the integral of the data can be a smoother
function. 

I would like to know if examining the "fitted integral" in
this way can be a useful technique for determining the
"best-fit" coefficients.  Although one must be careful about
what one means by "best-fit" and "goodness of fit", it seems
to me that examining both the function and its integral
might give more information than by examining the function
alone.  For example, it is conceivable that the data set as
well as its integral may both have physical meaning.
However, it is also conceivable that the integral of the
data contains less information than the data itself.

I have no background in statistics and thus any
help/comments/suggestions/pointers-to-the-literature would
be _greatly_ appreciated! 


Newsgroups: sci.math.stat
From: cfk6u@fermi.clas.Virginia.EDU (Charles F. Kramer)
Subject: Looking for 'data visualization' software
Organization: University of Virginia
Distribution: usa
Date: Sat, 19 Dec 1992 22:17:58 GMT

This article was probably generated by a buggy news reader.
Newsgroups: sci.math.stat
From: mcclella@yertle.Colorado.EDU (Gary McClelland)
Subject: Re: Levels of Measurement?
Organization: University of Colorado, Boulder
Date: Fri, 18 Dec 1992 19:33:35 GMT

<U53076@uicvm.uic.edu> writes:

>   Let me first apologize for boring you with such a mundane question.   Anyway
>I am in a dispute about levels of measurement and the appropriate statistics to
>use when dealing with data at the ordinal level.  I'd like to compare performan
>ce on a communication task across two different contexts.  In both cases,
>competence is measured on an ordinal scale, for simplicity's sake, 1, 2, 3.  It
>has been my practice in the past to compute a Pearson product-moment correlatio
>n between the two tasks and to use the resulting r as an indication of the
>degree to which performance is consistent across tasks.  I recently was told
>that this was an inappropriate test cause I was only at the ordinal level.  But
>my references (see esp. Glass & Hopkins, 1984; Heermann & Braskamp, 1970) say
>that the whole levels of measurement question has ben blown out of proportion,
>and that the sort of usage I describe is just fine.  What do you think?

I agree that the levels of measurement question has been blown
out of proportion, but you can easily avoid the whole issue in
your case.  A Pearson product-moment correlation computed on
ranks is also known as a Spearman-rho rank-order correlation.  So
just call your statistic a Spearman rho and everyone should be
happy; you'll be happy because you don't have to recalculate
anything.

gary mcclelland
univ of colorado
mcclella@yertle.colorado.edu
Newsgroups: sci.math,sci.math.num-analysis
From: kerr@ux1.cso.uiuc.edu (Stan Kerr)
Subject: Pi et al to > 10**8 digits?
Summary: Someone wants a LOT of digits for Pi et al
Keywords: pi e digits numerical constants
Organization: University of Illinois at Urbana
Date: Mon, 14 Dec 1992 14:25:26 GMT

I'm inquiring for a person here whether there are places we can find
stored values of Pi and perhaps other well known constants to a very 
large number of digits of accuracy, large meaning more than 10 million
and preferrably at least 100 million digits. We know already of the
1.25 million digit value of Pi stored at wuarchive.wustl.edu.
-- 

Stan Kerr    
Computing & Communications Services Office, U of Illinois/Urbana
Phone: 217-333-5217  Email: stankerr@uiuc.edu   
Newsgroups: sci.math
From: bs@gauss.mitre.org (Robert D. Silverman)
Subject: Re: need proof:  (1 + 1/n)^n ==> e
Organization: Research Computer Facility, MITRE Corporation, Bedford, MA
Date: Wed, 16 Dec 1992 01:20:59 GMT

In article <1glr2qINN2vg@usenet.INS.CWRU.Edu> fau@po.CWRU.Edu (Francis A. Uy) writes:
:
:I can't believe I forgot the proof of this one.
: Subject line says it all.


Expand (1+1/n)^n  by the Binomial Theorem; let n --> infinity

or:

y = (1+1/n)^n

log y = n log(1+1/n) =  log(1 + 1/n)/(1/n); use L'hospitals rule.

--
Bob Silverman
These are my opinions and not MITRE's.
Mitre Corporation, Bedford, MA 01730
"You can lead a horse's ass to knowledge, but you can't make him think"
Newsgroups: sci.math,sci.physics,sci.bio,sci.chem,misc.education
From: gjm11@cus.cam.ac.uk (G.J. McCaughan)
Subject: Re: TIME HAS INERTIA - BASS JEALOUS AND INSECURE-ABIAN VALIDATED
Organization: U of Cambridge, England
Date: Mon, 14 Dec 1992 02:51:28 GMT

In article <Bz81F4.Lqt@quake.sylmar.ca.us> brian@quake.sylmar.ca.us (Brian K. Yoder) writes:

>A similar problem exists for physicists who consider light to be a wave (or
>a wave and something else too).  Waving is something an entity does, not a
>thing in itself.  There can no more be a wave traveling through space than
>there can be a room with some "jumping" going on outside of any entities which
>are doing the jumping.

Nonsense. A wave is something with certain mathematical properties.
If the values of some measurable something, examined throughout
space, look like (say) sin(Ar+t) [t=time, r=distance from some point]
then it is perfectly in order to describe this as a wave travelling
through space.

To be sure, this is an extension of the use of the term "wave" to describe
lumps of (say) water wobbling about, or hands waving. So what?

-- 
Gareth McCaughan     Dept. of Pure Mathematics & Mathematical Statistics,
gjm11@cus.cam.ac.uk  Cambridge University, England.    [Research student]
Newsgroups: sci.math
Subject: Re: TIME HAS INERTIA - BASS JEALOUS AND INSECURE-ABIAN VALIDATED
From: a_rubin@dsg4.dse.beckman.com (Arthur Rubin)
Date: 14 Dec 92 23:03:35 GMT
 <klclauss.4.723351158@mentor.cc.purdue.edu>   
 <1992Dec11.024139.12143@dmp.csiro.au> 
 <1992Dec12.195654.7419@murdoch.acc.Virginia.EDU>12-12-92 <abian.724200923@pv343f.vincent.iastate.edu>
Organization: Beckman Instruments, Inc.

Note: Newsgroup line reduced to possibly relevant newsgroups.

In <abian.724200923@pv343f.vincent.iastate.edu> abian@iastate.edu (Alexander Abian) writes:

>FLAGRANT MANIFESTATION OF JEALOUSY AND INSECURITY BY C.R. BASS 
>PATHETIC METHODS FOR GAINING A FEELING OF SECURITY. BASS  PROVES (A3) 

>    TIME HAS INERTIA is validated - C.R. Bass is discredited as a
                         ^------ by whom?
>jealous, putting down envious person who gets his feeling of security
>by most pathetic means of eminating arrows of hate, sarcasm, enmity,
>hostility and antipathy.  
>    

I say (probably for the first time) - if your theory is a legitimate
theory, it has some predictive power.  Make a specific falsifiable
prediction.  Otherwise, stay out of the "sci" groups -- sci.math,
sci.physics, sci.chem. sci.bio, etc.

...

>(A2)   TIME HAS INERTIA (i.e. TIME IS MATTER)  AND SOME ENERGY IS 
>       IRRETRIEVABLY DISSIPATEED TO MOVE TIME FORWARD

>AND NONE OF THE  existing theories is capable to explain the puzzling
>loss of energy and that (A2) revolutionized both GR and QM.
>  

WHAT PUZZLING LOSS OF ENERGY?  (I hate to the bogosity index of this
thread, but all caps seems appropriate.)

--
Arthur L. Rubin: a_rubin@dsg4.dse.beckman.com (work) Beckman Instruments/Brea
216-5888@mcimail.com 70707.453@compuserve.com arthur@pnet01.cts.com (personal)
My opinions are my own, and do not represent those of my employer.
My interaction with our news system is unstable; please mail anything important.
Newsgroups: sci.math,rec.puzzles
From: keving@cory.Berkeley.EDU (Kevin Gong)
Subject: Re: Game of pentominos
Organization: University of California, at Berkeley
Date: Fri, 18 Dec 1992 19:02:33 GMT

In article <1992Dec18.153642.6932@odin.diku.dk> torbenm@diku.dk (Torben AEgidius Mogensen) writes:
>umatf071@unibi.hrz.uni-bielefeld.de (sio) writes:
>...
>Does this mean that a company produces a game based on the 29 possible
>figures made from 5 cubes? If so, do they have copyright to the actual
>shape of the pieces? I find it doubtful that such a claim would hold,
>as the shapes are of mathematical nature and thus not copyrightable.
>Any rules for the game will be copyrightable though.

Well, I don't know about pentacubes, but "pentomino" is a registered
trademark of Solomon Golomb!  That seems sort of strange to me, but hey,
I guess he invented the word.

 - kevin
From: cxm7@po.CWRU.Edu (Colin Mclarty)
Newsgroups: sci.math
Subject: Grothendieck, and Algebraic Geometry
Date: 19 Dec 92 17:29:49 GMT
Reply-To: cxm7@po.CWRU.Edu (Colin Mclarty)
Organization: Case Western Reserve University, Cleveland, OH (USA)
NNTP-Posting-Host: slc5.ins.cwru.edu


	Does anyone know of a published summary of Grothendieck's
work--I mean in the nature of a scientific biography?  The only
thing like that I know is Mumford and Tate's discussion of
Grothendieck and Deligne in _Science_ _202_ (1978) a propos of
Deligne's Fields Medal.  I have also read the later parts of his 
_Recoltes et Semailles_ (a sort of autobiography distributed by
the math dept. at Montpellier) and would appreciate it if anyone 
could let me see a copy of the first two parts which seem to be
unavailable.

	I'm not looking for introductions to the substance of 
his work.  Those are available.  I want to see summary and 
evaluation.

	Algebraic geometry seems to have a very strong boom-and-bust
cycle and I have gotten the impression that there was move away
from it in the wake of the Grothendieck-Deligne work.  Falting's
theorem shows that's not entirely true.  But I have heard that 
Mumford said he was leaving the field because it had gotten 
over-developed or something like that.  I would appreciate any
anecdotes on this point, and any references to published material.

Thanks,

Colin McLarty
Xref: sparky sci.math:17075 rec.puzzles:7989
From: mouse@thunder.mcrcim.mcgill.edu (der Mouse)
Newsgroups: sci.math,rec.puzzles
Subject: Re: Marilyn Vos Savant's error?
Keywords: savant
Date: 17 Dec 92 04:10:22 GMT
Organization: McGill Research Centre for Intelligent Machines

In article <1992Dec15.055832.26324@galois.mit.edu>, jbaez@riesz.mit.edu (John C. Baez) writes:

> 1)  You draw 4 cards from a well-shuffled standard deck.  You turn
>     one over and it's an ace.  What's the probability that they are
>     all aces?

There are 4! C(52,4) = 52!/48! = 6497400 sets of 4 cards you could
draw, counting different orders as different.  In one case in 13 you'll
turn up an ace, for a total of 499800, while in only 24 cases are they
all aces.  The answer to this question is therefore 24/499800, which is
1 in 20825, or, to 20 places from dc, .00004801920768307322.

> 2)   You draw 4 cards from a well-shuffled standard deck.  You turn
>      one over and it's the ace of hearts.  What's the probability
>      that they are all aces?

Of the 6497400 sets of 4 cards, in one case in 52 will you see the ace
of hearts, for a total of 124950.  Again, 24 are all aces.  The answer
is thus 24/124950, or 12/62475, about .00019207683073229291.  This is
roughly four times as large as the previous answer.

> [reworded]

> 1)  You draw 4 cards from a well-shuffled standard deck.  Given that
>     one is an ace, what's the probability that they are all aces?

Of those 6497400 cases, "one is an ace" in 1827480 (most easily
computed by counting the 4669920 ways of selecting four cards from the
non-aces in the deck, meaning that the other 6497400-4669920=1827480
involve aces).  Again, in 24 cases they're all aces.  The probability
this time is 24/1827480, about .00001313283866307702, slightly more
than a quarter of the first answer.

> 2)   You draw 4 cards from a well-shuffled standard deck.  Given that
>      one is the ace of hearts, what's the probability that they are
>      all aces?

"[O]ne is the ace of hearts" in 6497400-5997600=499800 cases.  The
probability here is the same as in the very first question I answered
in this post, 24/499800, about .00004801920768307322.

					der Mouse

			    mouse@larry.mcrcim.mcgill.edu
Newsgroups: sci.math,sci.physics,sci.bio,sci.chem,misc.education