HDTenEightyP/NetNews huggingface dataset:
From: sam542@cdc835.cdc.polimi.it (Massimo e Jerry)
Subject: Bernard Lemarie
Date: Thu, 10 Sep 1992 13:09:04 GMT
Organization: C.d.C., Politecnico di Milano



Sorry to write to this newsgroup for personal use, but we have tried
several times to reach Bernard Lemarie by e-mail without obtaining any 
result.

So we'll be glad if he or someone who read this, can give us an address 
where is possible to write to him.

                                             Thank you

                                        
                                            
                               /*+-----------------------------------------+*/
                               /*+    Massimo Ferretti                     +*/
                               /*+    Gerardo Dilillo                      +*/
                               /*+                                         +*/ 
                               /*+    Politechnic of Milan, Italy          +*/ 
                               /*+                                         +*/ 
                               /*+    e-mail: sam542@cdc835.cdc.polimi.it  +*/
                               /*+                                         +*/
                               /*+-----------------------------------------+*/
From: nadar@ece.arizona.edu (Mariappan S. Nadar)
Newsgroups: comp.ai.neural-nets
Subject: Statistical Mechanics
Date: 14 Sep 92 21:54:46 GMT
Reply-To: nadar@ece.arizona.edu (Mariappan S. Nadar)
Distribution: world,local
Organization: University of Arizona Dept. of Electrical and Computer Engineering

Hello netters:

		Could someone provide me with references to 
review type articles on


		"Statistical Mechanics and Neural Networks"

		Thanks a lot
								
							Mariappan
Organization: Bar-Ilan University Computing Center, Israel
Date: Thu, 10 Sep 1992 00:27:26 IST
From: Victor Earl Aker <S24615@BARILVM.BITNET>
Newsgroups: comp.ai.neural-nets
Subject: who manufactures neural network chips?

  I have one more question. Are there any companies out there which manufacture
Neural NEtwork chips? I know of one company, Intel, and there chip was not
exactly what I was looking for. Are there any other manufacturers of these
chips? Thank you in advance.

Victor Aker
Second Year Student,
British Columbia Institute of Technology
(Alright, i'm in israel right now. I'm on holidays!)
Newsgroups: comp.ai.neural-nets
From: thibault@trantor.emba.uvm.edu (Scott A Thibault)
Subject: Evenly distributed categories for competetive learning?
Organization: University of Vermont, EMBA Computer Facility
Date: Mon, 14 Sep 1992 17:20:02 GMT


  I have a set of vectors that I'm categorizing using a competetive learning
neural net.  I'd like to have at least one vector in each category and have
them roughly evenly distirbuted.  Each output in the network represents a
category.  As anyone done something like this or have any ideas?

--Scott Thibault
University of Vermont
thibault@emba.uvm.edu
Newsgroups: comp.ai.neural-nets
From: arms@cs.UAlberta.CA (Bill Armstrong)
Subject: Re: function approximation with nets.
Organization: University of Alberta, Edmonton, Canada
Date: Mon, 14 Sep 1992 21:00:03 GMT

s8818037@spectrum.cs.unsw.oz.au (Matthew James Leayr) writes:

>	I was wondering how one would go about training a network to perform
>an operation such as conversion from x-y to polar coordinates. Do you simply
>present examples of the conversion to the net in the training data?

Sure.

 If so, 
>how well suited are neural networks to this sort of task? Could a NN be used
>to perform a log-polar coordinate transform?

Sure.  However, the result would be approximate and complicated to compute.
Compared to the simple exact results you can get with a calculator,
what's the point?

Actually, if you supposed that you needed to do some complicated
coordinate conversion like I believe one finds in quantum physics or
relativity, and you needed to do it very fast, but the computation of
the transformation is too slow, then you might use a neural net to
speed it up inside your supercomputer.  (My choice of course would be
to use an ALN to get the speed.)

Bill

--
***************************************************
Prof. William W. Armstrong, Computing Science Dept.
University of Alberta; Edmonton, Alberta, Canada T6G 2H1
arms@cs.ualberta.ca Tel(403)492 2374 FAX 492 1071
From: elsberry@beta.tricity.wsu.edu (Wesley Elsberry)
Newsgroups: comp.ai.neural-nets
Subject: Re: source code in "neural network pc-tools" book
Date: 15 Sep 92 17:38:06 GMT
Organization: Washington State University Tri-Cities, Richland

In article <1992Sep15.075329.29233@nntp.nta.no> styri@nta.no writes:
>I wrote:
>>
>> Yup, I've seen at least one copy of this code on the net (ftp archives).
>> However, the code is copyright protected if I'm not too wrong.
>
>Ooops! I was very wrong indeed. To quote the copyright notice:
>	"*** SHAREWARE ***
>	 You may distribute unmodified copies of the diskette or software.
>	 If you find the software of value, please send $20 or any amount,
>	 to :-
>		[Roy W. Dobbins old address deleted]"
>
>I'll make penance by putting the nnpct companion code on my ftp-archive
>asap. I hope I didn't create any inconvenience by my mistake.
>
>(No, you don't know my ftp archive address ... yet.)
>
>---
>Haakon Styri

Of course, you can get it *now* from the Central Neural System BBS at
509-627-6267 or the CNS mirror site at me.uta.edu:/pub/neural/annsim as
"nnpctool.lzh".

Wesley R. Elsberry
Sysop, Central Neural System BBS
From: wolff@crc.ricoh.com (Gregory J. Wolff)
Newsgroups: comp.ai.neural-nets
Subject: Paper available on Neuroprose archive: Stork.obs.ps.Z
Keywords: second derivatives, pruning, Hessian, neural-networks
Date: 14 Sep 92 16:15:26 GMT
Reply-To: wolff@crc.ricoh.com (Gregory J. Wolff)
Organization: RICOH California Research Center


The following paper has been placed on the neuroprose archive as 
stork.obs.ps.Z and is available via anonymous ftp (from
archive.cis.ohio-state.edu in the pub/neuroprose directory).
This paper will be presented at NIPS-92.

=========================================================================
  Second Order Derivatives for Network Pruning:  
            Optimal Brain Surgeon

Babak Hassibi and David G. Stork, Ricoh California Research Center

   ABSTRACT: We investigate the use of information from all second order
derivatives of the error function to perform network pruning (i.e.,
removing unimportant weights from a trained network) in order to improve
generalization and increase the speed of further training.  Our method,
Optimal Brain Surgeon (OBS), is significantly better than
magnitude-based methods, which can often remove the wrong weights.  OBS
also represents a major improvement over other methods, such as Optimal
Brain Damage [Le Cun, Denker and Solla, 1990], because ours uses the
full off-diagonal information of the Hessian matrix H.  Crucial to OBS
is a recursion relation for calculating H inverse from training data and
structural information of the net.  We illustrate OBS on standard
benchmark problems: the MONK's problems.  The most successful method in
a recent competition in machine learning [Thrun et al., 1991] was
backpropagation using weight decay, which yielded a network with 58
weights for one MONKs problem.  OBS requires only 14 weights for the
same performance accuracy.  On two other MONKs problems, our method
required only 38% and 10% of the weights found by magnitude-based pruning.

===========================================================================


Here is an example of how to retrieve this file:

gvax> ftp archive.cis.ohio-state.edu
Connected to archive.cis.ohio-state.edu.
220 archive.cis.ohio-state.edu FTP server ready.
Name: anonymous
331 Guest login ok, send ident as password.
Password:neuron@wherever
230 Guest login ok, access restrictions apply.
ftp> binary
200 Type set to I.
ftp> cd pub/neuroprose
250 CWD command successful.
ftp> get stork.obs.ps.Z
200 PORT command successful.
150 Opening BINARY mode data connection for stork.obs.ps.Z
226 Transfer complete.
100000 bytes sent in 3.14159 seconds
ftp> quit
221 Goodbye.
gvax> uncompress stork.obs.ps 
gvax> lpr stork.obs.ps


--
Gregory J. Wolff
Ricoh California Research Center
2882 SandHill Rd. Suite 115
Menlo Park, CA 94025-7022
wolff@crc.ricoh.com
(415) 496-5718
fax: (415) 854-8740
From: william@kub.nl (William Verkooijen)
Newsgroups: comp.ai.neural-nets
Subject: New book on NN
Date: 15 Sep 92 14:14:22 GMT
Organization: KUB, The Netherlands

Hi,

several people have contacted me to send them the exact reference of the
book mentioned in my previous posting to the net.
Therefore I shall post it to the net.

Artificial Neural Networks -Approximation and Learning Theory-
Edited by Halbert White
ISBN 1-55786-329-6
publication: August 1992
price: 40 pounds
320 pages

...In this collection, H.White and his colleagues present a rigorous
mathematical analysis of the approximation and learning capabilities
of the leading class of single hidden layer feedforward networks.
Drawing together work previously scattered in space and time, the book
gives a unified view of network learning not available in any other
single location, and forges fundamental links between network learning
and modern mathematical statistics.



William Verkooijen
E-mail: william@kub.nl
From: asif@sunlite.concordia.ca
Newsgroups: comp.ai.neural-nets
Subject: Neural Net in Communications
Keywords: Neural Nets, Communication
Date: 13 Sep 92 17:38:11 GMT
Reply-To: asif@sunlite.concordia.ca ()
Organization: Concordia University, Montreal Quebec
Originator: asif@luna


Hello :

I am looking for a small project to do in neural networks and I wanted 
to know if there are any communication applications I can use them in. 
Any references, please post or mail at above address

Thanks in advance

Asif
Newsgroups: comp.ai.nlang-know-rep
From: daniel@csgi64.dcs.leeds.ac.uk (D N Crow)
Subject: Re: AI Programing Language
Organization: School of Computer Studies, University of Leeds
Date: Tue, 15 Sep 1992 15:51:40 GMT
X-Posted-From: csgi64.leeds.ac.uk
NNTP-Posting-Host: sol.ctr.columbia.edu

In article <1992Sep15.133822.11154@mercury.unt.edu>, danny@ponder.csci.unt.edu (Danny Faught) writes:
> In article <1992Sep15.025411.19354@src.umd.edu> clin@eng.umd.edu (Charles C. Lin) writes:
> >In article <95957@bu.edu>, robrod@csa.bu.edu writes:
> >> 
> >> I am just starting to look at AI (I am a senior Undergraduate in CS).  I
> >> read that the new movement in AI programming was to move away from 
> >> Languages like LISP and Prolog and into Object oriented languages like 
> >> C++, Smaltalk, etc.  Is it worth studying LISP and Prolog anymore?
> >> What should someone concentrate on for AI programming?
> >> 
> [lines deleted]
> >...  C++ since OOPs seem to be getting more
> >popular and it's becoming more widely available. 
> 
> I know C well, and I've learned a little about C++.  It seems to me that
> C++ is better than C in terms of software engineering (though it 
> introduces some intricacies that may make the code more mysterious).
> But why is C++ and OOP in general supposed to be well-suited to AI
> applications?
> 

AI often involves modelling real world objects and phenomena. An object-
oriented approach is therefore often suitable.

> >
> >   For example, functional language folks will tell you that
> >languages such as ML, Miranda, and Haskell are the better
> >"functional" languages (and say that LISP isn't even one)
> >and that these languages are better for learning programming
> >than some language like C.  
> 
> I used ML briefly, and it seemed to be very similar to LISP except that
> the syntax was more palatable, i.e., no parentheses from hell.  I liked it.
> 
> -- 
> Danny Faught    danny@ponder.csci.unt.edu
> Save this sig - I'll be famous someday

I have just finished my PhD in AI/HCI, which involved writting a fairly
large scale Pascal AI program. This is basically a blackboard architecture
with several pattern recognition, machine learning and expert system
components. All implemented under VAX/VMS in VMS Pascal. The reasons for
this are largely historical. In retrospect, I would have used C++ given
a free choice.

The biggest advantage to using LISP/Prolog is the large amount of freely
available code that has been written in those languages that solves known
AI problems. I certainly had to re-implement several "wheels" as a result
of choosing Pascal. Having said that, the bulk of my code (in terms of
number of lines written) dealt with file handling and other i/o. For
this sort of task a procedural language like Pascal or C is at least as
well suited as Lisp or Prolog.

-- 
Dan Crow
daniel@scs.leeds.ac.uk
From: farach@dickens.rutgers.edu (Martin Farach)
Newsgroups: comp.ai
Subject: Re: Looking for anagram algorithms
Date: 13 Sep 92 16:01:38 GMT
Organization: /climax/u2/farach/.organization
In-reply-to: jperry@humpback.cs.ucla.edu's message of 12 Sep 92 21:49:54 GMT

In article <1992Sep12.214954.14623@cs.ucla.edu> jperry@humpback.cs.ucla.edu (John Perry) writes:

   my favorite two are still:


      Ronald Wilson Reagan = Insane Anglo Warlord

      and

      George Herbert Walker Bush = Huge Berserk Rebel Warthog



Or how about:

      Republican National Convention = Puritanical ban on innocent love


--
Martin Farach			farach@dimacs.rutgers.edu
Newsgroups: comp.ai
From: ckoning@cs.ruu.nl (Kees de Koning)
Subject: Wanted: experienced OPS5 programmers
Date: Thu, 10 Sep 1992 13:21:13 GMT
Organization: Utrecht University, Dept. of Computer Science

I am doing a research project on supporting OPS5 with a reason maintenance 
system. A reason maintenance system is a seperate module that keeps track
of the beliefs of a problem solver, in this case the OPS5 program. The idea
is to make knowledge representation (KR) easier and to split the KR from the 
control, as at the moment, control and knowledge are completely interwoven
in the production memory.

To give an idea what will be the result, consider some productions of the 
form

A ---> B 
B ---> remove A

When working memory contains A, this will result in a working memory
containing B. A reason maintenance system will prevent B from being 
believed (that is, remove it from working memory), as after removing A, 
there is no valid reason left to belief B. 
This is only one example of the implications.

The reason maintenance system is connected to the OPS5 language at the level
of the Rete network, thereby not bothering the programmer directly. 
However, the programming style needed for the new system will be quite dif-
ferent, I suppose. I am not an experienced OPS5 programmer, however, and 
thereby I cannot assess the implications of this change completely.

Therfore, I am looking for one or more experienced OPS5 programmers 
to interview; most likely in Holland, as interviewing is much easier 
face-to-face than via email, but this is only a preference.

It won't take to much time (about an hour or so), so if you are an exp.
OPS5 programmer, please contact me via email. Thanks a lot!

--
Kees the Koning 
Department of Computer Science, Utrecht University, Holland
e-mail: ckoning@cs.ruu.nl
Department of Philosophy, Utrecht University, Holland
e-mail: kees@phil.ruu.nl
From: mkant+@cs.cmu.edu (Mark Kantrowitz)
Subject: Re: AI Expert Magazine, any good?
Organization: School of Computer Science, Carnegie Mellon
Distribution: na
Date: Fri, 11 Sep 1992 02:51:34 GMT

In article <POESIO.92Sep10141749@cantaloupe.cs.rochester.edu> poesio@cs.rochester.edu (Massimo Poesio) writes:
>Just a word of caution. I subscribed to AI Expert two years ago, and the 
>magazine was indeed interesting. However, I only received five issues, 
>and then I didn't receive anything anymore. I contacted them at AAAI
>last year, and they said they were going to fix the problem, but nothing
>happened. (I got tired after that.) So, my advice is: be ready to fight.

I subscribed to them several years ago and they charged my credit card
twice. After two letters, they sent me a check for the extra charges
(for some reason they couldn't just credit my card), but a month later
stopped my subscription. Nothing worked to get them to restart it, so
I had my credit card company credit my account. A year later I decided
to try again, and haven't had any problems since.

--mark
From: joungwoo@mensa.usc.edu (John Kim)
Newsgroups: comp.ai
Subject: (Q) Ref on cognitive levels of problem solving
Date: 7 Sep 1992 16:16:18 -0700
Organization: University of Southern California, Los Angeles, CA
NNTP-Posting-Host: mensa.usc.edu
Summary: Looking for ref's on cognitive levels of problem solving
Keywords: cognitive levels, problem solving


	  Could someone kindly point me to references (in cognitive
psychology, artificial intelligence, etc.) that talk about cognitive levels
of problem solving? I may not be labeling the area of my question really
well, but I'm looking for references that will support the following
conjecture:

There are at least three levels of human problem solving. I will call them
associational, causal and "hypo-causal" levels. Roughly, the A-level is where
rule-based (i.e., "compiled" knowledge) reasoning happens, the C-Level is
where to resort to when A-level reasoning fails to give an answer and where
causal reasoning happens such as in these days' qualitative reasoning
programs, and the HC-Level is where you resort to when even C-level reasoning
fails to give an answer and where something "mysterious" happens.


      I hope you get a rough sketch of my questioning context from above
brief description. 

      Please don't point me to Rosenbloom et al.'s Soar material and J. R.
Anderson's work, as I already accessed them.

Thanks.

John

P.S. Please reply to me by email, since I don't regularly read this group.
I'll post the summary at the end of this month.
-- 
Joung-woo John Kim				joungwoo@mensa.usc.edu
Computer Science Dept.
University of Southern California, Los Angeles, CA 90089-0781

Newsgroups: comp.ai,comp.robotics,comp.ai.philosophy
From: ward@sun17.vlsi.uwaterloo.ca (Paul Ward)
Subject: Re: Turing Indistinguishability is a Scientific Criterion
Organization: University of Waterloo
Date: Mon, 7 Sep 1992 14:07:16 GMT

In article <1992Sep6.200121.4383@Princeton.EDU> harnad@phoenix.Princeton.EDU (Stevan Harnad) writes:

>It is arbitrary to
>ask for more from a machine than I ask from a person, just because it's
>a machine

This sentence caught my eye.  Why is it arbitrary to ask more from a machine 
than a person?  It would seem to me that throughout human history the entire
purpose of machines is that they enable us to do more.  Start with simple
examples:

If I can push a nail into the wall with my own hands, then why would I build
a hammer?

If I can pull a plough, then why would I make a tractor?

To get into the domain of computers; if I can perform 50 Gigaflops then
why would I need a Cray?

One does not make machines that merely duplicate human function - they must
do it better.  If you wish to create a thinking machine, then it must think
better than a human (otherwise, I can tell you of a lot simpler (and
_definitely_ more fun :-) method of creating thinking beings).

Of course, the only thing that puts us at the top of the evolutionary heap
seems to be the fact that we outthink everthing else on the planet.  So, if
you still want to create a thinking machine, be prepared to become No. 2.
Newsgroups: comp.ai
From: almond@statsci.com (Russell G. Almond)
Subject: Re: Legality of Expert Systems
Organization: Statistical Sciences, Inc., Seattle, WA USA
	<1992Sep11.163619.12477@msuinfo.cl.msu.edu>
Date: Mon, 14 Sep 1992 20:09:51 GMT


| >A related question is, at what point will a Physician or Hospital be 
| >successfully sued for FAILING to use an expert system which CLEARLY would
| >have PREVENTED the problem which followed. 

We were looking into this matter for a knowledge based system (KBS)
development project we were writing a proposal for.  The argument we
put forward (and I think the legal staff approved, but I'm not sure
they were ever consulted directly on this issue) was that the KBS
should be treated equivalently to a textbook.  That is, it is a
repository of information, and the physician is still responsible for
the correct application of that information.


One of the things I would definitely like to see, is an expert system
(especially a probabilistic one) used as a defense in malpractice
suits.  For example, we did not ___ [perform such a test, perform such
a procedure] because given the information we had, the probability
that such a test would be needed was low [ below ___].  I think this
might produce cost effective, as oppossed to cover you neither
regions, perscription and testing decisions.


			Russell Almond			   
Statistical Sciences, Inc.		U. Washington
1700 Westlake Ave., N Suite 500		Statistics, GN-22
Seattle, WA  98109			Seattle, WA  98195
(206) 283-8802				
almond@statsci.com			almond@stat.washington.edu

Disclaimer:  These ramblings are definitly my own opinions, and I might
even deny them if pressed vigourously enough.
From: kyre@reed.edu (Erik Gorka)
Newsgroups: comp.ai
Subject: Help on Psych NN or PDP Thesis
Date: 14 Sep 92 21:54:25 GMT
Distribution: usa
Organization: Reed Insane Asylum

I'm a psychology senior at Reed College, and I'm looking for help in doing a
Neural Net/PDP modelling thesis. What I need to know is available Mac/Unix based
applications that can be used to set up such systems, and/or available texts
that can teach how to create one using C or Pascal (I'm a good programmer, I
just haven't done much of this sort of programming before). Also, any good
texts whatsoever that deal with NN/PDP systems, especially in the areas of
perception/memory modelling.

Any help would be appreciated. I just need to find out what's available and
can be readily instituted using the resources provided by the college. Right
now the thesis proposal is loosely based, and will be modified by what
info I get.

Thank you very much.

Sincerely,
Erik Gorka (kyre@reed.edu)
-- 
* Everything that my fingers have typed is strictly the product of their own *
* demented imaginations.  -- Erik Gorka (kyre@reed.edu)			     *
From: triantos@acsu.buffalo.edu (Nick B Triantos)
Newsgroups: comp.ai
Subject: WANTED: An algorithm for collision detection
Date: 12 Sep 92 07:30:53 GMT
Distribution: comp
Organization: The University at Buffalo
Originator: triantos@autarch.acsu.buffalo.edu

Hi.  I hope that the AI world may be able to help me with this..  I've already
tried the graphics people, too.

I'm looking for an efficient algorithm for collision detection.  I will be
coding a program in C on a Macintosh, and need to be able to quickly detect
collisions between 2 - 75 arbitrary objects.  I will know their positions and
shapes, of course.  Pseudo-code, or straight code, or any references to good
articles would be most helpful.  Thanks in advance.

-Nick

--
Nick Triantos    internet: triantos@acsu.buffalo.edu
                 AOL:      Triantos
"Scientists tell us that the fastest animal on earth, with a top speed of
120 ft/sec, is a cow that has been dropped out of a helicopter." - Dave Barry
From: jkk@aiai.uucp (John Kingston)
Newsgroups: comp.ai
Subject: Anyone have proceedings of EKAW-92?
Date: 11 Sep 92 12:22:06 GMT
Reply-To: jkk@aiai.uucp (John Kingston)
Distribution: eunet
Organization: AIAI, University of Edinburgh, Scotland

Does anyone have the proceedings of the European Knowledge Acquisition
Workshop 92 (EKAW-92)? I'm trying to get the exact publication details of one
of the articles in it, for a bibliographic reference.

JK

John Kingston,                               | 
Knowledge Engineering Methods Group,         | The heart of the problem
AIAI, University of Edinburgh                | is the problem of the heart
E-mail jkk@aiai.ed.ac.uk, phone 031-650 2736 |