HDTenEightyP/NetNews huggingface dataset:
From: harrell@timasb.enet.dec.com (Rick Harrell)
Subject: Re: Beginners Question: Walking Robots & NNs
Organization: Digital Equipment Corporation
Date: Sun, 13 Dec 1992 17:37:33 GMT


In article <1992Dec12.042020.6232@ucc.su.OZ.AU>, andy@extro.ucc.su.OZ.AU (Andrew Miehs) writes...
>I've read many articles recently (in SciAm and others) about insect-like robots
>which teach themselves how to walk, from scratch.
> 
>The articles didn't go very far into the theory of it, but it seems, to my 
>limited knowledge, that this would be an appropriate application for a neural
>net. I'm have recently been teaching myself about NNs and this problem
>intrigued me such that I'd love to try it out myself.
> 
>Does anyone know much about these 'creatures'? I am especially curious as to
>how they know whether their actions are "successful" and even how they can
>define what a "succefsful action" is.
> 
>I was thinking of working on a much simpler scale - a simple robot which had
>four independently motored wheels, whose on/off and forward/reverse motion
>could be controlled by a computer. It's objective, would be to find some
>transmitter, given intensity signals from four directional receivers (probably
>microphones & ultra-sonic sound).
> 
>Am I being hopelessly naive in believing that I could create a NN to solve
>such a problem? If not (i hope not) what approach would you recommend?
> 
>Malcolm Ryan (care of Andrew Miehs)
>Email replies to andy@extro.ucc.su.oz.au
>-- 
>+-------------------------------+---------------------------------------------+
>| Andrew Miehs                  |                                             |
>| Mail: andy@extro.ucc.su.oz.au |       $$$ THIS SPACE FOR RENT $$$           |
>| NB:   Don't call me andy!     |                                             |
From: HOLLENBE@ENDVM1.VNET.IBM.COM (Mike Hollenbeck)
Date: Tue, 15 Dec 92 14:03:58 EST
Newsgroups: comp.ai.neural-nets
Subject: seeking information on CASENET

In the book "Neural Network PC Tools - A Practical Guide", the authors
mention a CASE tool for nn development called CASENET.  I'd like to get
some more, up to date information on this tool.

Thanks,

Mike
From: visakan@eng.cam.ac.uk (Visakan Kadirkamanathan)
Newsgroups: comp.ai.neural-nets
Subject: Paper available
Date: 12 Dec 92 11:25:20 GMT
Organization: Cambridge University Engineering Department, UK

The following paper is available via ftp. It is placed in the Cambridge 
University ftp archive svr-ftp.eng.cam.ac.uk. The ftp instructions for 
retrieval follow the summary. 

The paper appeared In Proceedings of the Institute of Acoustics, Volume 14, 
Part 6, 1992.

------------------------------------------------------------------------------
	Application of an architecturally dynamic network for speech
			pattern classification


		Visakan Kadirkamanathan and Mahesan Niranjan


		 Cambridge University Engineering Department
			Cambridge CB2 1PZ, England



				SUMMARY

We have previously adopted a function estimation approach to the problem of 
sequential learning with neural networks and derived a network that grows with
increasing observations. This network is a single hidden layer Gaussian radial 
basis function (GaRBF) network with a single output unit. On receiving new 
observation, the network adds a new hidden unit or adapts the existing 
parameters by the Kalman filter.

In this paper, we extend the network to have multiple output units. By 
choosing to adapt only the linear coefficients (hidden - output layer 
weights), considerable memory savings can be achieved for the resulting Kalman 
filter than if the parameters of the basis functions were also adapted. 
Results for this network are presented for the Peterson-Barney vowel 
classification problem in which the 
observations are presented sequentially and only once. The performance is 
comparable to that achieved by some of the standard block estimation methods. 
This approach can also be viewed as an alternate method of arriving at an 
approximate complexity of the network required to solve a given problem, 
eliminating the need for an a priori selection of network size. 

------------------------------------------------------------------------------

FTP INSTRUCTIONS:

unix> ftp svr-ftp.eng.cam.ac.uk
Name: anonymous
Password: (your_userid@your_site)
ftp> cd reports
ftp> binary
ftp> get kadirkamanathan_ioa92.ps.Z
ftp> quit
unix> uncompress kadirkamanathan_ioa92.ps.Z
unix> 


Other related reports placed in the archive are:-
kadirkamanathan_tr111.ps
kadirkamanathan_icassp92.ps

------------------------------------------------------------------------------

--
Dr.Visakan Kadirkamanathan                    email: visakan@uk.ac.cam.eng
Cambridge University Engineering Department
Trumpington Street, Cambridge CB2 1PZ, UK.    Tel  : +44 223 332754
------------------------------------------------------------------------------
Newsgroups: comp.ai.neural-nets
From: B35@vm.urz.uni-heidelberg.de (Matthijs Kadijk)
Subject: Problem with Rochester Simulator on Sun3
Organization: University of Heidelberg, Germany
Date: Tue, 15 Dec 92 22:29:28 CET

 
I recently got version 4.2 of the Rochester Connectionist Simulator
and installed it on a Sun3/80 with SunOS 4.0.3. The installation procedure
(using cc) did not complain but the moment I tried to use makesim a strange
error message occured.
 
So my question: did anybody out there succesfully install RCS 4.2
on a configuration like mine ??? (N.B. I used cc not gcc)
 
Any hints on what went wrong are appreciated,
                                               Matthijs.
 
For sake of completeness  here the error message:
 
_edata: ld: user attempt to redefine loader-defined symbol
_end: user attempt to redefine loader-defined symbol
_etext: /lib/libc.a(des_crypt.o): multiply defined
Newsgroups: comp.ai.neural-nets
From: woods hole (hemant chikarmane (hemant@mbl.edu))
Subject: Re: NNs in chemistry or related fields
Organization: marine biological lab
Distribution: usa
Date: Wed, 16 Dec 92 19:14:47 GMT

In article <1992Dec15.231251.22493@mixcom.com>, daniel.offutt@mixcom.mixcom.com (daniel.offutt) writes:
> 
> Here are a few references on applications of neural nets in chemisty,
> biochemistry, etc.: 
> 
[deleted] 
> Elrod and Maggiora.
> Applications of Neural Networks in Chemistry.  1. Prediction of Electrophilic
> Aromatic Substitution Reactions.
> J. Chem. Inf. Comput. Sci. 1990, 30, 477-484.
> 
> Scientific American, 4/90, pp24-26.
> (Brief article on tertiary structure prediction.)
> -- 
> Dan Offutt
> 

Here are two more:

Weinstein et al. (1992) Neural computing in cancer drug development. Science
258: 447-451.  (16 October issue)

Uberbacher and Mural. (1991) Locating protein coding regions in human DNA 
sequences by a multiple-sensor-neural network approach  Proc. Natl. Acad. 
Sci 88:11261-11265.  (Describes the GRAIL software package)


Newsgroups: comp.ai.nlang-know-rep
From: ski@atc.boeing.com (Chris Kacoroski,none)
Subject: Looking for references on cognitive models
Keywords: cognitive models
Reply-To: ski@atc.boeing.com
Organization: Boeing - Product Manufacturing Knowledge Based Systems
Date: Fri, 18 Dec 1992 14:18:02 GMT

Hi,

I am interested in how people create, maintain, and use models of the world (specifically of actors in the world) to mediate their interactions with the world.  For example, when you interact with another person you create (or add to) your model of that person (e.g. that persons hobby is chess).  Later if you have a question on chess, you use your models to determine who to ask the question.  Appreciate any references in this area.  Thanks in advance.



Cheers,

Chris "ski" Kacoroski	"When we try to pick out anything by itself
ski@atc.boeing.com	 we find it connected to the entire universe"
							John Muir



Newsgroups: comp.ai
From: scip2012@nusunix1.nus.sg (WU JIANHUA)
Subject: WANTED: RULE SET OF SMALL EXPERT SYSTEM
Organization: National University of Singapore
X-Newsreader: TIN [version 1.1 PL6]
Date: Mon, 14 Dec 1992 08:33:28 GMT

[ Article crossposted from comp.ai.shells ]
[ Author was  ]
[ Posted on Mon, 14 Dec 1992 08:32:15 GMT ]

Hi,

I am looking for a set of rules for expert systems. It should be
consistent and associate with some uncertain information.

Can anyone give some hints? Many thanks in advance!


Cheers,
********************************************************************************
        **   **            Wu, Jianhua
       **   ** **  **   ** Dept. of Infomation Systems & Computer Science
      **   *** ** ** * **  National University of Singapore 
 **  **   **  ** ** * **   Singapore 0511
**  **   **  ** *******    E-Mail: WuJianHu@ISCS.NUS.SG, Scip2012@NUSUNIX.NUS.SG
****   ***  **  ** **      Phone : +65 7726136       Fax: +65 7794580
                        
Newsgroups: comp.ai
From: chip@ils.nwu.edu (Chip Cleary)
Subject: Re: Mechanization of creativity
Followup-To: comp.ai
Organization: The Institute for the Learning Sciences
Date: Mon, 14 Dec 1992 16:02:41 GMT

In article <1992Nov23.143350.1418@hellgate.utah.edu>,
tolman%asylum.cs.utah.edu@cs.utah.edu (Kenneth Tolman) wrote:
>   I am looking for references on papers specifically on mechanized 
> creativity.  Where might I find such?

Here's a book you might find useful:

  Explanation Patterns: Understanding Mechanically & Creatively
  Roger C. Schank
  Lawrence Erlbaum Associates, 1986

- Chip
Newsgroups: comp.ai
Subject: New magazine - Psyche
From: x91007@phillip.edu.au
Date: 15 Dec 92 00:02:55 EST
Organization: RMIT (Bundoora Campus)

Announcement: New Electronic Magazine 'Psyche'.

I am interested in starting up a electronic magazine 
exploring broad issues relating to consciousness and the 
mind. I hope to explore these issues in an interdisciplinary 
way - using approaches and insights from psychology, 
philosophy, anthropology, computer science and mathematics.

Examples of some of the general areas that Psyche will cover 
are: the mind-body problem; altered-states-of-consciousness; 
psychoactive drugs; shamanism; dream states; hypnosis; 
artificial intelligence; meditative states; ecstatic 
religious states; blindsight; language and mind. 

In an attempt to offer a grounding in some of the central 
themes of Psyche, major review articles of influential 
ideas/books/movements will also be solicited. Examples of 
what these might be are: John Searle's Chinese Room Problem; 
Daniel Dennett's book 'Consciousness Explained'; Gordon 
Wasson's theories regarding Soma; Roger Penrose's book 'The 
Emperor's New Mind'.

While Psyche will not be peer-reviewed this does not mean 
that it will become a haven for New Age/Lunatic Fringe ideas. 
I have just completed a BSc Honours majoring in psychology, 
and I am currently studying the way the brain codes the 
position of objects. I would like to balance by skills with 
others and so am particularly interested in getting in 
contact with people with backgrounds in either computer 
science, philosophy or anthropology to act as sub/co-editors.

While the date is obviously tentative I would like to get the 
first issue of Psyche out by March 1993. It will be produced 
in ASCII and hopefully postscript. As tends to be the nature 
of electronic journals clarity, rather than length, will be a 
critical factor in deciding which articles are accepted.

So if your interested in: helping, supplying copy, 
subscribing (at least for the first edition), or simply 
offering advice please contact me directly at the address 
below. In your reply please let me know where you read about 
Psyche.

Yours sincerely,
			 Patrick Wilken

x91007@phillip.edu.au 

Newsgroups: comp.ai
From: srctran@world.std.com (Gregory Aharonian)
Subject: Systems for reasoning about History
Organization: The World
Distribution: comp.ai
Date: Fri, 11 Dec 1992 20:37:37 GMT

   Does anyone know of any systems (or papers/books) for reasoning about
historical events?  I am interested in entering a lot of facts about
historical events, and being able to ask if there is some connection
between the two events, or if some event has more importance than other
events.

Greg Aharonian
Source Translation & Optimization
-- 
**************************************************************************
Greg Aharonian
Source Translation & Optimiztion
P.O. Box 404, Belmont, MA 02178
Newsgroups: comp.ai
From: lain@bert.eecs.uic.edu (Christopher Lain)
Subject: IJCAI93
Summary: IJCAI93 Announcement???
Organization: University of Illinois at Chicago
Date: Wed, 16 Dec 1992 21:00:50 GMT

I was wondering if someone could send to me the IJCAI93 announcement.
I seemed to have missed it or has it not been posted???
Thank you.

Chris Lain

lain@bert.eecs.uic.edu
.

Newsgroups: comp.ai
From: voz6@joyce.comp (Alunos de Jsr e Jpn)
Subject: Machine-learning SAGE LEX
Organization: /net/sara/user/p1311/voz6/.organization
Distribution: comp
Date: Thu, 17 Dec 1992 11:05:53 GMT


If anyone has anything about the SAGE or LEX system , please send it
to me.

Thank you.

Paulo Faria & Joao Filipe.
From: weber@charlie.iam.unibe.ch (Stephan Weber)
Subject: Reference
Reply-To: weber@iam.unibe.ch  
Organization: Dept. of Computer Science, University of Berne, Switzerland
Date: Fri, 18 Dec 1992 13:01:29 GMT

Hello

I am looking for the following reference:

Berstein S. (1987) DesigNet: An intelligent System for
Network Design and Modelling. ICC'87 Phoenix, Arizona.

I was looking in our library but couldn't any hints. Can 
anybody help me, in which book this article is published 
or what conference the ICC'87 in Phoenix was ?

Thanks for all reply

Stephan

*********************************************************
* Stephan Weber                                         *
* Institut fuer Informatik und angewandte Mathematik    *
* Universitaet Bern                                     *
* Laenggassstrasse 51                                   *
* CH - 3012 Bern                                        *
* Telephon:	..41 31 65 49 03                        *
* TeleFax	..41 31 65 39 65                        *
* eMail		weber@iam.unibe.ch                      *  
*********************************************************
*                                                       *
*    Why to be happy, if it goes also apathetic !!!!!   *
*                                                       *
*********************************************************
Xref: sparky comp.ai:4611 news.answers:4503
From: klaatu@rose.handy.co.kr (Kim)
Subject: About terminological KR systems..
Organization: HandySoft Institute of Technology, HandySoft Corp.
X-Newsreader: Tin 1.1 PL3
Date: Mon, 14 Dec 92 07:10:17 GMT

Hi,

I want to know the merits and the weakness of the terminological KR
systems like KL-TWO, KRYPTON. Is there any paper for this? Any comments
or private opinions will help me.
Thanks in advance.

Kim, Young-Hoon
klaatu@sorak.kaist.ac.kr
klaatu@rose.handy.co.kr
From: 881244y@dragon.acadiau.ca (Choon Lin Yeo)
Newsgroups: comp.ai
Subject: Questions on Concurrency Control for Knowledge Bases
Date: 20 Dec 92 18:35:02 GMT
Organization: Acadia University


Hi , 

	I have a few questions on the topic of CC methods for  
Knowledge Bases: 

1) What are the methods used for CC in the existing commercial  
   knowledge bases? Example of how they are applied in this context.  

2) Are Timestamp Ordering (TO) and Two Phase Locking protocols feasible  
   methods? 

3) Which of these methods give a better performance in the context of 
   knowledge base? 


I sincerely appreciate any input. Thanks in advance. 
I can be reached by e-mail: 881244y@dragon.acadiau.ca

-- 
			    _ _ 
------------------------ooo--U--ooo-------------------------------
* Acadia SUB Box 6732		Choon Lin, Yeo	
* Wolfville, Nova Scotia 	e-mail: yeo.choon.lin@acadiau.ca
Newsgroups: comp.ai.philosophy
From: colby@oahu.cs.ucla.edu (Kenneth Colby)
Subject: Searle's World and Computers
Keywords: Searle Realism Computers
Organization: UCLA, Computer Science Department
Date: Wed, 16 Dec 92 19:33:07 GMT



		  Searle's World and Computers

   In his new book The Rediscovery of the Mind, Searle has got some
 of it right. But he still seems baffled by computers. He confuses
 the listing of a program - what he calls "pure" symbols and syntax
 (they are not "pure" having been assigned meanings by the programmer)
 having no causal powers - with an up-and-running program, a causal
 agent whose "symbols" are now electromagnetic transmissions of their
 own structures and modifications of these structures. A process that
 can transmit or propagate its own structures is about as causal as you
 can get these days.

    Searle's foundational-assumptive mistake is to try to get by with a
 simple two-category carving of "features of the world" into "intrinsic"
 and "observer relative". For example, he claims (p.211) the expression
 "mass" names an intrinsic feature of the world. But "mass" is a
 highly theory-relative, partially human-mind dependent construct.
 Newtonian mass is not Einsteinian mass which is a function of velocity.

    How can we think or say anything about "reality" without it being
 partially mind-dependent and hence involve an interpretation we assign
 to our experience with whatever is "out there". As Wheeler in quantum
 mechanics says, "the it comes from the bit".

   Regarding Searle's comparison of brains and computers, of course
 the brain is not a computer if by "is" one means identity. The relation
 of a model to the "reality" being modeled is one of similarity, not
 strict identity, and similarity comes in respects and degrees. We take
 (interpret) brain functions to be similar to computational functions in
 some respects (functional homology) but not in other respects. Then we
 see where we can get representationally and interventionally with this
 interpretation. If it doesn't pan out, we try another one. Most of the
 working time in science and technology is spent finding out what does
 NOT work the way we think it does or want it to.

				    Ken Colby
			   Malibu Artifactual Intelligence Works
Newsgroups: comp.ai.philosophy
From: avrom@Csli.Stanford.EDU (Avrom Faderman)
Subject: Re: causal powers
Organization: Stanford University CSLI
Date: Tue, 15 Dec 1992 23:06:12 GMT


In article <724315603@sheol.UUCP> throopw@sheol.uucp (Wayne Throop) writes:

| it seems to me that a good way of looking at 
| what a program IS, is as a formal description of the causal powers 
| of a given process running on a computer.

I don't get much of Searle either, but in the interest of discussion, I'll 
take his side here.

A program CAN BE used as a description of causal powers, but it isn't 
necessarily.  For example, a program can be used to drive a robot;  this 
robot can pick things up, put them down, and throw them around.  IF the 
program is embedded in a robot, it describes these causal powers.

However, the same program can be used to drive a system like Winograd's 
SHRDLU--a simulated robot living in a simulated world.  In this role, 
the only causal powers that the program is describing are the powers 
to shuttle symbols back and forth in the computer and make certain blips 
appear on the screen.

| Of course, it may be that some "causal powers" that "meat" brains 
| have are not computable.  But that's more Penrose's argument than 
| Searle's.

Searle would answer that he doesn't claim simply that the causal powers 
of meat brains are not computable--rather he says that NO causal powers 
of ANY object are computable:  Computation is a formal process--the 
same computation can be used to describe any of many causal powers 
(for example, the same program describes both the workings of a Chinese 
speaker's brain, which has the power to produce a magnetic field, and the 
system of water pipes and valves in his response to the "Brain Simulator" 
reply, which doesn't).


As proof that I really don't agree with Searle, the following SIG is 
submitted for your approval. :-)
 
-- 
Avrom I. Faderman                  |  "...a sufferer is not one who hands
avrom@csli.stanford.edu            |    you his suffering, that you may 
Stanford University                |    touch it, weigh it, bite it like a
CSLI and Dept. of Philosophy       |    coin..."  -Stanislaw Lem
Newsgroups: comp.ai.philosophy
From: wagner@hp800.lasalle.edu (Jon Wagner)
Newsgroups: comp.ai.philosophy
Subject: The Complexity Required for intelligence
Keywords: complexity AI
Date: 14 Dec 92 18:26:54 GMT
Organization: LaSalle University, Philadelphia, PA


Here are come thoughts about the complexity of systems and AI.

Assume that a system can be modeled by a Turing machine, and define
the complexity of the system as 

	C(s) = some function 

Some special minimum values of C:

	C(self-awareness)	the least value of C such that self-awareness
				is possible.
	C(humans-brain)		the complexity of a human brain
	C(replication)		complexity required for the system to be
				able to create another system with
				greater or equal complexity

Some points to discuss:

	1) C(self-awareness) <= C(humans-brain)

	2) Is C(humans-brain) >= C(replication)?  Does this have any
		implications on whether we will ever create an intelligent 
		system?

	3) If C(humans-brain) < C(replication), then
		if C(human-society) >= C(replication)?


Jon Wagner                                              wagner@hp800.lasalle.edu--------------------------------------------------------------------------------
The answer to the Ultimate Question, of Life, the Universe, and Everything is
. . . 42.
			-- Life, the Universe, and Everything, Douglas Adams