HDTenEightyP/NetNews huggingface dataset:
From: batra@tigger.cs.Colorado.EDU (sajeev batra)
Subject: some questions on PAC learning
Keywords: PAC  
Organization: University of Colorado, Boulder
Date: Sun, 11 Oct 1992 06:14:27 GMT



first, i would like to apologize if these questions have been asked 
before.

i am trying to learn about this  PAC (probably approximately correct)
learning concept.  What does it mean for something to be pac-learnable?

also, the term Vapnik-Chervonenkis (VC) dimension is thrown about 
quite often.  Where does this fit in?

and one more thing...  I have been trying to read Valiant's "Theory
of the Learnable" (Comm. of ACM, 1984, 1134-1142) paper.  I do not
understand it.  Could someone who has read it briefly summarize it at 
a level that i could comprehend (introductory level).  I have a small
background in neural nets and statistics.

posting or emailing comments would be good.  And please
try to make all points in an introductory level.

thank you.
sajeev.
From: colljz@solb1.essex.ac.uk (Coll J)
Newsgroups: comp.ai.neural-nets
Subject: REQUEST information on MANUFACTURING applications of neural nets
Date: 16 Oct 92 12:19:21 GMT
Reply-To: colljz@essex.ac.uk (Coll J)
Organization: University of Essex, Colchester, UK

Hi,

I'm interested in any applications of neural networks to manufacturing or retail environments which anybody may have come across/published papers on etc.  Of especial interest are any applications which involve forecasting.

Julian Nolan.
E-mail : colljz@uk.ac.essex.solb1
From: djasson@afterlife.ncsc.mil (Drew Asson)
Newsgroups: comp.ai.neural-nets
Subject: Explanation facilities reference
Date: 7 Oct 92 18:03:26 GMT
Distribution: usa
Organization: The Great Beyond


This is in reference to the post that I started a few days ago about
neural net explanation facilities.  I said that work was being done
at U. Washington, but I was wrong.  I was thinking of other work.  Sorry
about that.

The work I meant to refer to was done by Russ Eberhart (at APL at the time,
now at Research Triangle Inst.) and Roy Dobbins.  It used genetic algorithms
to help map out the decision surfaces and then used info gleened from that
to work on explanation facilities.  The paper was entitled "Designing Neural
Network Explanation Facilities using Genetic Algorithms." 

Another bit of work is on relational factors (described to me in a neural
net class as work with Japanese origins).  There were 2 factors with the
first being how is the j-th output node affected if the i-th input node is
set to 0.0?  The second factor had to do with seeing how each input effected
each output node.  These I have no reference for.



--
djasson@afterlife.ncsc.mil
From: menoldre@vtcc1.cc.vt.edu (SCOTT STAUFFER)
Newsgroups: comp.ai.neural-nets
Subject: Re: Hardware of neural network
Keywords: hardware
Date: 8 Oct 92 01:19:00 GMT
Organization: Virginia Tech, Blacksburg, Virginia
News-Software: VAX/VMS VNEWS 1.41

In article <u8013536.3@u8013536.cc.nctu.edu.tw>, u8013536@u8013536.cc.nctu.edu.tw (Yuanfu Liao) writes... 
>  Could anyone tell me some information about this and any product of neural 
>network ? Or Do anyone do the same thing as me ?
> 
INTEL has a chip called the i80170 it is a total analog neural network on 
a chip.  The chips themselves cost about 200 dollars but the environment
in which you have to train them costs a lot.  I sounds that this would
be much more than you need.  But FYI there are groups out there that
are using VLSI for neural networks.  It sounds like you are building a
mini computer to run your network.  Good luck.

Ron E Menold II
menoldre@vtcc1.cc.vt.edu
From: hallyb@globbo.enet.dec.com (John Hallyburton)
Newsgroups: comp.ai.neural-nets
Subject: Another source for historical economic data
Summary: Where to buy it, if you have the cash
Keywords: economic,historical
Date: 9 Oct 92 17:25:18 GMT
Organization: Twin Peaks Municipal Software Works


One source for economic data is:

Foundation for the Study of Cycles, Inc.
2600 Michelson Drive, Suite 1570
Irvine, CA 92715 714-261-7261 

Ask for their 1992-1993 Publications Catalog. 

They have lots of stuff, including a fair amount of economic data not available
anywhere else.  Some of their economic data series, and prices for nonmembers
(members save circa $25-$50) are: 

Item [y for yearly m for monthly etc., from-to] price

Business Failures, Liabilities [y,1857-]	$100
Consumer Price Index [y,1800-]/[m,1913-]	$150/$75
Incorporations, Number of [y,1916-]		$100
Foreclosures, [y,1926-]				$100
GNP [y,1869-]/[q,1946-]				$150/$75
Industrial Production [y,1860-]/[m,1913-]	$150/$75
M2 Money Supply [m,1948-]			$100
New Patents [y,1790-]				$150
Producer Price Index [y,1720-]/[m,1913-]	$150/$75
Retail Sales [y,1929]/[m,1947-]			$100/$75
Unemployment [m,1948-]				$75
Work Week, Average [w?,1945-]			$75

Other interesting items include:

Earthquakes in China [y,87-1881]		$150
Great Lakes Lake Levels [m,1860-]		$150
Nile River Floods [y,622-1962]			$150
Tchjevsky's Index of Mass Excitability 
			[y, 500BC-1922]		$200
Wheeler's Index of International and 
	Civil War battles [y, 600BC-]		$375

Plus various items from real estate, stock/commodity prices, interest rates.
All with a long-term view.  If you want, say, lots of recent stock or futures
data, then you should go with a retail data broker or other source.
All items come in ASCII format on small or large MS-DOS floppies.
--
						"The Smart Money was on Goliath"
						John Hallyburton 43 55'N 71 45'W
Newsgroups: comp.ai.nlang-know-rep
From: kewasiel@unix.amherst.edu (karen wasielewski)
Subject: looking for planning systems
Organization: Amherst College
X-Newsreader: TIN [version 1.1 PL6]
Date: Wed, 14 Oct 1992 06:29:04 GMT


hello,

i'm writing an undergraduate thesis on robot planning systems, and i'm 
looking for any free planning systems or other such goodies which may be 
floating about the internet.  i have already ftp'ed nonlin.  any help would 
be appreciated.
(e-mail preferably, thanks)

karen
--
kewasiel@cs.amherst.edu		 |
kewasiel@unix.amherst.edu	 |
kewasielewsk@amh.amherst.edu	 |
Newsgroups: comp.ai
From: robert@cs.UAlberta.CA (Robert Baron)
Subject: Re: need a nonlinear planner in C or prolog
Organization: University of Alberta, Edmonton, Canada
Distribution: na
Date: Tue, 13 Oct 1992 21:08:43 GMT

milan@bcsaic.boeing.com (Milan Richter) writes:

>In article <1992Oct6.230156.947@ads.com> marcel@ADS.COM (Marcel Schoppers) writes:
>>
>>Does anyone know of a public-domain, nonlinear planner written in C or C++
>>or prolog?

>what is a nonlinear planner?

>-- milan richter

One that does not enforce a total order on the actions of a plan
being constructed.

Robert Baron
From: G.Joly@cs.ucl.ac.uk (Gordon Joly)
Newsgroups: comp.ai
Subject: Re: How often are random word strings grammatical?
Date: 9 Oct 92 12:24:08 GMT


> From: TXN102@psuvm.psu.edu (phaedrus)
> 
> i would think the answer to this question would be:  inversely propor-
> tional to the complexity of the grammar.  i.e. random word strings
> have a better chance of being grammatically correct under a simpler
> grammar than they would under one with many convolutions.
> 
> this is my first post here, how'd i do?  :-)
> 
> Thi

You could try this book for starters:-

%T The Vastness of Natural Languages
%A D. Terence Langendoen
%A Paul M. Postal
%I Basil Blackwell
%C Oxford, UK and New York, NY.
%D 1984

They assert that NL is infinite, a thesis I disagree with. Ideas are
infinite (boundless), not langauges.

Gordon.


____

Gordon Joly      Phone  +44 71 387 7050 ext 3703      FAX  +44 71 387 1397
Internet: G.Joly@cs.ucl.ac.uk        UUCP: ...!{uunet,uknet}!ucl-cs!G.Joly
Computer Science, University College London, Gower Street, LONDON WC1E 6BT
Newsgroups: comp.ai,comp.ai.neural-nets,comp.ai.philosophy,sci.psychology
From: chalmers@bronze.ucs.indiana.edu (David Chalmers)
Subject: Re: Human intelligence vs. Machine intelligence
Organization: Indiana University
Date: Sun, 11 Oct 1992 21:39:44 GMT

In article <Bvypp5.98s@cs.bham.ac.uk> axs@cs.bham.ac.uk (Aaron Sloman) writes:

>Chris Malcolm's comment "nobody in the field is bothering to refute it"
>may be based on the perception that most people working in AI feel
>that the early reviews adequately demolished Penrose's position.
>My own opinion, after reading the book, was that there was quite a
>lot more to be said, both:
>(a) as to why the published criticisms of Penrose were partially or
>wholly unsuccessful (either because of technical errors or omissions
>or because they attacked a subtly different position from his)
>and
>(b) as to why Penrose really was mistaken concerning a number of issues.

For what it's worth, I think:

(1) That Penrose wrote a fascinating book about all kinds of
scientific issues;

(2) That he's very naive about AI (take a look at his comments about
a computer feeling pain via a "pain-meter" in the first chapter, for
instance);

(3) That there's only one substantive argument against AI in his
entire 466 page book, and that only takes up a page or two; and

(4) That this argument is essentially a rerun of Lucas's argument in
subtly different trappings, and fails for precisely the same reasons.

Points (2)-(4) were very surprising to me, when I read the book, as
I have the greatest respect for Penrose's mind.  When I was at Oxford
as a graduate student in mathematics a few years ago, I was in the
same department as him and in a closely related area (although I
worked with Michael Atiyah, not Penrose); Penrose's stature there
is enormous.  The only explanation I can find is that Penrose has
always been a very "intuitive" mathematician and physicist, thriving
in particular on his very deep geometric intuitions.  When he turned
his hand to another field, he came at it with the same intuitive
approach, but here his intuitions failed him.

-- 
Dave Chalmers                            (dave@cogsci.indiana.edu)      
Center for Research on Concepts and Cognition, Indiana University.
"It is not the least charm of a theory that it is refutable."
From: dowding@ai.sri.com (John Dowding)
Newsgroups: comp.ai
Subject: Re: How often are random word strings grammatical?
Date: 9 Oct 92 20:42:38 GMT
	<92282.183904TXN102@psuvm.psu.edu>
	<1992Oct9.133941.1@rulfsw.leidenuniv.nl>
Organization: SRI International, Menlo Park, CA
In-reply-to: vosse@rulfsw.leidenuniv.nl's message of 9 Oct 92 12:39:41 GMT


>In article <92282.183904TXN102@psuvm.psu.edu>, phaedrus <TXN102@psuvm.psu.edu> writes:
>> i would think the answer to this question would be:  inversely propor-
>> tional to the complexity of the grammar.  i.e. random word strings
>> have a better chance of being grammatically correct under a simpler
>> grammar than they would under one with many convolutions.
>
>Try again. In a very simple grammar such as
>S -> a
>the language over alphabet {a, ..., z} would contain only one word,
>but an infinite number of random strings.
>In a highly complex grammar, things might be totally different
>E.g. in a grammar that generates all strings of non-prime length
>over alphabet {i}, almostly every random string would be a word
>of the language.

I am afraid that my posting was misunderstood, I was specifically
interested in comparing grammars of a natural language with native
speakers intuitions.

One commonly used measure is coverage, which you find by collecting
a set of utterances that are judged grammatical, and determine what
percentage of them are recognized by your grammar.

My question was trying to get at the flip side of that,  how can you
measure native speakers intuitions on ungrammaticality.  One such way
might to be make up strings of words given a vocabulary, and ask both
the native speaker and your grammar for judgements, then compare their
answers.  

I believe that the helpfulness of this approach would depend on the
ratio of grammatical to ungrammatical strings in the set.  If
grammatical strings are too rare, then a simple minded approach of
rejecting everything might be indistinguishable from a comparatively
good grammar.
--
John Dowding
dowding@ai.sri.com
Newsgroups: comp.ai
From: lbkruij@cs.vu.nl (Kruijswijk LB)
Subject: ftp site for bitmaps of letters
Organization: Fac. Wiskunde & Informatica, VU, Amsterdam
Date: Thu, 8 Oct 1992 11:37:15 GMT

Hello,

Can somebody tell me if there exists a ftp-site with bitmaps of all kinds of
letters for experiments with neural-networks etc.

Thanks in advance,

L.B. Kruijswijk						lbkruij@cs.vu.nl
Newsgroups: comp.ai,comp.ai.neural-nets
From: rjb@duke.bby.oz.au (R.J.(George) Bissett)
Subject: Genetic Reinforcement Learning
Organization: Burdett, Buckeridge & Young, Melbourne, Australia
Date: Fri, 9 Oct 1992 02:24:12 GMT


Can anyone suggest where I might get information on the above subject?

It is my understanding that some publication on the subject written by
Whitley, Das, Dominic and Anderson from Colorado State University,
Fort Collins exists.

Thank you

R. J. (George) Bissett
No title at all
Burdett, Buckeridge & Young
2/405 Collins Street
Melbourne, Australia, 3000

Newsgroups: comp.ai
From: baustad@idt.unit.no (Jostein Baustad)
Subject: Re: Looking for Natural Language Glossary
Reply-To: baustad@idt.unit.no (Jostein Baustad)
Organization: The Norwegian Institue of Technology
Date: Fri, 9 Oct 92 14:26:10 GMT

In article <19704.2ad56e3e@ul.ie>, brehonyt@ul.ie writes:
|> 
|> Can anybody out there recommend a book which contains a complete
|> ( as far as possible ) glossary of Natural Language terms ?.
|> 
|> Thanks.
|> 
|> Tom Brehony.
|> Email  : brehonyt@ul.ie 

The book "A Dictionary of Linguistics and Phonetics" by David Crystal is pretty
good. It is organized as a dictionary alphabetically, but it contains a whole
lot of cross-referneces to related topics. I am a novice in this area and it has
at leat helped me a lot. Here's the info on it:

@book{crystal91,
   author = "David Crystal"
  ,title  = "A Dictionary of Linguistics and Phonetics"
  ,publisher= "Basil Blackwell"
  ,year   = 1991
  ,series = "The language library"
  ,edition= "3rd"
}

Hope this helps.

Jostein

-- 
*******************************************************************************
* Jostein Baustad                        * E-mail : baustad@idt.unit.no       *
* The Norwegian Institute of Technology  *          baustad@solan.unit.no     *
* Division of CS and Telematics          * "Reality is just a convenient      *
* Information and Knowledge Systems      *  measure for complexity."          *
*******************************************************************************
*             Queen's Park Rangers F.C. - SuperHoops !                        *
*******************************************************************************
Newsgroups: comp.ai
From: rickert@mp.cs.niu.edu (Neil Rickert)
Subject: Re: Human intelligence vs. Machine intelligence
Organization: Northern Illinois University
Date: Sun, 11 Oct 1992 13:08:28 GMT

In article <burt.718784794@aupair.cs.athabascau.ca> burt@aupair.cs.athabascau.ca (Burt Voorhees) writes:
>>     I find it interesting tht people who support what is called "strong AI"
>>   are now trying to get out of the Godel argument against this by saying
>>   that Godel's theorems only apply to consistent systems and it is clear
>>   that any machine which matches human capacities would have to be running
>>   on some sort of inconsistent system.

>  No, there were several postings sent to me e-mail by people in response
>to an earlier posting of mine here.  Each said that, well, we get away from
>Godel because we don't really need consistent systems since human
>intelligense is clearly inconsistent anyway.

This is hardly a way of "trying to get out of the Godel argument."  It
is more like a casual comment on why the Godel argument has nothing to
say on the matter of AI.

>                  Okay, it has a Godel proposition which we know is trud,
>but which can't be proved within the system.  We generate a bigger formal
>system which can prove this proposition.  Etc.  This gives an infinite
>regress with the structure, mathematically, of an inverse limit system.

I don't believe there is any evidence that this is a reasonable
interpretation of human intelligence.  More likely it uses heuristics
based on statistical correlations.  As such it is fallible ("to err is
human"), but is surely exempt from any application of Godel.  Why should
AI be any different?
Newsgroups: comp.ai
Subject: A question ...
From: sandra@trident.datasys.swri.edu (Sandra McCowan)
Date: 8 Oct 92 12:55:15 GMT
Organization: Southwest Research Institute, San Antonio, Texas
Keywords: generations


Hello all.  I have a favor to ask of you.  The president of my company sent me
to the task of gathering some more information on a talk he has to give next
week.  Anyway, the topic is AI, and we've seen references to it being the 5th
generation of computer technology.  My question is:  What are the first 4, and
what is the 6th (we've seen references to that, too)?

Thanks for the info.  Please email responses to:

71540.164@compuserve.com, as this is a friend's account.

-Michael
------------------------------------------------

Newsgroups: comp.ai
From: hackmann@ips.cs.tu-bs.de (Martin Hackmann)
Subject: Pattern Matching and Unification?
Organization: Inst. f. Informatik, TU Braunschweig, FRG
Date: Thu, 8 Oct 1992 13:31:47 GMT

For some term rewrite systems is a common pattern matching algorithm not
sufficient, since they only allow variables in the pattern term, but not
in the subject term. 

For the implementation of a narrowing algorithm I'm looking for a pattern 
matching algorithm which also allows variables in the subject term. The 
trivial method releases for all subterm of the subject term the unification 
with the pattern term.

I'm looking for an efficient method to this problem. I'm thinking about some 
kind of preprocessing of the patterns, so that the matching phase will raise 
up. 

Does anybody know such an algorithm or literature about this problem?

Thanks
M. Hackmann 
Newsgroups: comp.ai
From: kohl@gmdzi.gmd.de (Andy Kohl)
Subject: Re: looking for a public domain ES (the third way) shell in Lisp ...
Followup-To: comp.ai
Organization: GMD
Date: Mon, 12 Oct 1992 11:53:47 GMT

In article <kohl-091092105119@129.26.128.221>, kohl@gmdzi.gmd.de (Andy
Kohl) wrote:
> Here at GMD we have developed a development environment for expert systems
> called BABYLON. It provides frames (including multiple values, active
> values,..), rules (backward and forward), constraints, a prolog-like logic
> formalism, and a description language for diagnostic apllications. BABYLON
> is implemented in CommonLisp and ported to a wide range of hardware
> platforms. Cause of the object-oriented implementation style it is easy to
> extend and adapt BABYLON to your needs.
> A version for MacIntosh, including a window-based interface, is available
> in two ways. First, Apple ships it on a CD-ROM with their final version of
> MacIntosh Allegro Common Lisp version 2.0. The second and probably
> preferable way is to by the book "The AI Workbench BABYLON", which contains
> *full source code* of BABYLON and the stand-alone version for the Mac (so
> you need not MACL at all). The book descibes the use of BABYLON and its
> implementaion in very detail.
> 

in a reply Bing Liu asks

>    I wonder whether it is possible to get a soft copy of the system 
>through ftp. 
>
you are rigth. i*ve forgotten to mention the third way of getting BABYLON.
it is on our ftp-server named GMDZI.GMD.DE (129.26.8.90)
in the directory gmd/ai-research/Software/ there is a bin-hexed stuffit
archive of BABYLON. i don*t know what kind of documentation it contains.
get it and play with it ;-)

bye,
andy
__________________________________________________________________
Andy Kohl
Artificial Intelligence Research Division    e-mail: kohl@gmdzi.gmd.de
German National Research Center              phone:    +49-2241-142681
for Computer Science (GMD)                   fax:      +49-2241-142072
P.O. Box 1316
W-5205 Sankt Augustin 1     ( G E R M A N Y )
From: nikitas@ils.nwu.edu (Nikitas Sgouros)
Newsgroups: comp.ai
Subject: Email address of Dr. Tim Smithers
Date: 14 Oct 92 21:29:30 GMT
Article-I.D.: ils.1992Oct14.212930.5505
Organization: Institute for the Learning Sciences


Does anybody know the e-mail address of Dr. Tim Smithers at the Free University
in Brussels?

-------
Nikitas
Newsgroups: comp.ai
From: ginsberg@t.Stanford.EDU (Matthew L. Ginsberg)
Subject: graduate school at the University of Oregon
Organization: Computer Science Department, Stanford University
Date: Sat, 10 Oct 1992 02:08:24 GMT

If you're thinking about graduate school in AI and have nothing
against the west coast, how about the University of Oregon?

I'll be starting an AI lab there in the fall, with a strong focus on
knowledge representation, search, and other formal methods.  Probably
about five faculty, all high profile members of the AI research
community; we'll hope to work with a total of about ten students and
expect to have money available for student funding.  Some of the
students will be coming from our home institutions (Stanford, in my
case), but there should be some open slots as well.

If you're interested, please send me a message and I'll try to answer
any questions you may have -- about personnel (I'm not mentioning
names yet because they aren't final and I don't want to embarrass
anyone), Oregon (Eugene is a city of about 100,000, so there is
plenty of cultural stuff to do; the Oregon Cascades are very beautiful
with skiing, whitewater rafting and the Pacific all within easy reach)
or related topics.

Thanks!

						Matt Ginsberg
Newsgroups: comp.ai,comp.ai.edu,comp.ai.neural-nets
From: schultz@halley.est.3m.com (John C. Schultz)
Subject: Re: Has making a group for Genetic Algorithms been discussed?
In-reply-to: bjang@cs.ulowell.edu's message of 8 Oct 92 01:50:21 GMT
Organization: 3M Company, 3M Center, Minnesota, USA
	<1992Sep30.130016.28415@asl.dl.nec.com>
	<Bvs53x.D0B@ulowell.ulowell.edu>
Date: Fri, 9 Oct 92 19:17:46 GMT

There already is one, moderated and digestified.

Genetic Algorithms Digest   Tuesday, October 6 1992   Volume 6 : Issue 34

 - Send submissions to GA-List@AIC.NRL.NAVY.MIL
 - Send administrative requests to GA-List-Request@AIC.NRL.NAVY.MIL
 - anonymous ftp archive: FTP.AIC.NRL.NAVY.MIL (Info in /pub/galist/FTP)
--
   John C. Schultz   +1 (612) 733-4047   schultz@halley.serc.3m.com
   How to include the taste of Glendronach in a multi-media system?
Xref: sparky comp.ai:3931 sci.math.stat:2153
From: farzin@apollo3d.apollo3.ntt.JP (Farzin Mokhtarian)
Newsgroups: comp.ai,sci.engr.control
Subject: Re: Fuzzy Logic in Japan
Date: 10 Oct 92 08:49:18 GMT
	<84475@bcsaic.boeing.com> <1so.hkice@lab.ntt.jp>
	<Bvt916.BKu@dcs.ed.ac.uk>
Organization: none

In article <Bvt916.BKu@dcs.ed.ac.uk> yk@dcs.ed.ac.uk (Yoshiki Kinoshita) writes:

 @In article <1so.hkice@lab.ntt.jp> farzin@apollo3d.apollo3.ntt.JP (Farzin Mokhtarian) writes:
 @>Fuzzy logic was introduced to the world 27 years ago by Professor
 @>Lotfi Zadeh in his "Fuzzy Sets" paper published in Information
 @>Control magazine, though it is only recently that we've seen it
 @>applied across a broad range of products.
 @
 @I am not in this field, but as I understand, Professor Kokichi Tanaka
 @(who was gone about 10 years ago) did play a pioneering role in Fuzzy
 @set theory.
 @
 @Is it correct?  If it is, it's a bit strange no lines of an article
 @entitled "Fuzzy Logic IN JAPAN" mention this fact.
 @
 @Yoshiki.
 @--
 @visiting: Dept. of Computer Science, Univ. of Edinburgh, Edinburgh, Scotland;
 @from: Electrotechnical Laboratory, Tsukuba, Japan.

Those words were not written by me. They were quoted from an article in
the Japan Times. As for a possible role by a prof. Tanaka, I am not
aware of that.
    
  - Farzin Mokhtarian
    farzin@apollo3.ntt.jp
                       
Newsgroups: comp.ai