Copy Link
Add to Bookmark
Report

AIList Digest Volume 8 Issue 138

eZine's profile picture
Published in 
AIList Digest
 · 11 months ago

AIList Digest            Tuesday, 13 Dec 1988     Volume 8 : Issue 138 

Queries:

Learning an Arbitrary Non-Linear Function
Qualitative Reasoning on Diagnostics
Help Porting Steamer
Back-propogation question
go-moku game information
Chess?
MAKELINK function in "Artificial Intelligence Programming"
Reinforcement Schemes for Learning Automata
Benchmarks on LISP machines vs. work stations.
Bipedal Robotic Motion: design & references.
OPS5 OPS83
Naive Physics
SCHEME for pc/ac -- return address correction

Responses:
Robotic Language
Articles on "expert applications in network management"
"Iterative Deeping" reference wanted

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

Date: 1 Dec 88 16:01:43 GMT
From: att!cbnews!elk@bloom-beacon.mit.edu (Edwin L. King)
Subject: Learning an Arbitrary Non-Linear Function

A while ago, someone mentioned using learning algorithms to
learn an arbitrary non-linear function instead of neural networks.
I was wonderring, does anyone have any good references on
machine learning?

Thanks.
--
Ed King He may act a little erratic. Regeneration
scrambles the brain cells a bit.
elk@cbnews -- Cho-Gi

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

Date: 5 Dec 88 02:17:04 GMT
From: l66@psuvm.bitnet
Subject: Qualitative Reasoning on Diagnostics

I am interested in Qualitative Reasoning on Diagnostics. It is very helpful if
I can look at any program written for that purpose.(LISP or PROLOG)
PLEASE, send information to L66@PSUVM.BITNET
Thanks for your help.

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

Date: Mon, 5 Dec 88 11:33 EST
From: <RITA%VTCS1.BITNET@VTVM1.CC.VT.EDU>
Subject: Help Porting Steamer


Help needed in porting steamer (interactive graphics package)
from symbolics 36XX machine to the TI Explorer LISP machine.

Anyone who has already ported this software or is currently
working on porting it to the TI Explorer - Please contact:

Dr. John W. Roach
Dept. of Computer Science
Virginia Tech
Blacksburg, VA 24061

Tel. No: (703) 961-5368

roach@vtcs1.cs.vt.edu

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

Date: 5 Dec 88 17:23:18 GMT
From: reiter@endor.harvard.edu (Ehud Reiter)
Subject: Back-propogation question

Is anyone aware of any empirical comparisons of back-propogation to
other algorithms for learning classifications from examples (e.g.
decision trees, exemplar learning)? The only such article I've seen is
Stanfill&Waltz's article in Dec 86 CACM, which claims that
"memory-based reasoning" (a.k.a. exemplar learning) does better than
back-prop at learning word pronunciations. I'd be very interested in
finding articles which look at other learning tasks, or articles which
compare back-prop to decision-tree learners.

The question I'm interested in is whether there is any evidence that
back-prop has better performance than other algorithms for learning
classifications from examples. This is a pure engineering question -
I'm interested in what works best on a computer, not in what people do.

Thanks.

Ehud Reiter
reiter@harvard (ARPA,BITNET,UUCP)
reiter@harvard.harvard.EDU (new ARPA)

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

Date: Mon, 5 Dec 88 17:50:17 EST
From: mg@Princeton.EDU (Michael Golan)
Subject: go-moku game information

Hello !
I am doing a term-project based on the go-moku game (five in a raw). Any
information about an evaluation function or playing strategy will be
greatly appreciated.
Thank you
Michael Golan
Princeton University

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

Date: Tue, 06 Dec 88 13:27:28 CST
From: C484739%UMCVMB.BITNET@MITVMA.MIT.EDU
Subject: Chess?

I am looking for a Chess program written in C? If any has the source for Belle
I would appreciate that.
Thanks
Bryan Koen

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

Date: Wed, 07 Dec 88 13:26:37
From: ZZZO%DHVRRZN1.BITNET@CUNYVM.CUNY.EDU

Date: 7 December 1988, 13:23:17 MEZ
From: Wolfgang Zocher (0511) 762-3684 ZZZO at DHVRRZN1
To: AILIST at AI.AI.MIT
Subject: New Magazine: Lisp and Symbolic Computation

Does anybody know where this new magazine is available|

Wolfgang Zocher (ZZZO (It's an Oh) at DHVRRZN1.BITNET)
Regionales Rechenzentrum Hannover FRG

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

Date: Thu, 08 Dec 88 11:17:18 -0500
From: howell%community-chest.mitre.org@gateway.mitre.org
Subject: MAKELINK function in "Artificial Intelligence Programming"

In the second edition of the book "Artificial Intelligence Programming"
(Charniak, Riesbeck, McDermott, & Mehan), the function MAKE-LINK is
used in some code in Chapter 12, with the explanation that it was
defined in Chapter 11. I can't find it anywhere else in the book. The
index references the function only once, at the point in Chapter 12
that I mentioned. Can anyone provide me with a pointer to the function
definition?

Thanks for any help,

Chuck Howell
The MITRE Corporation, Mail Stop W418
7525 Colshire Drive, McLean, VA 22102
NET: howell@mitre.arpa or
howell@community-chest.mitre.org

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

Date: Thu, 08 Dec 88 13:26:07 CST
From: Don Meredith <DMEREDI3%UA1VM.BITNET@MITVMA.MIT.EDU>
Subject: Reinforcement Schemes for Learning Automata


I am in desperate need of some literature on reinforcement schemes
for learning automata and weight changing algorithms for neural
networks. You can send any information to DMEREDI3@UA1VM or to the
following address:


Don Meredith
1049 Taylorwood Circle
Tuscaloosa, AL 35405


Thanks,

Don Meredith

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

Date: 9 Dec 88 21:10:56 GMT
From: cwjcc!hal!nic.MR.NET!tank!tartarus.uchicago.edu!kris@ohio-state.
arpa
Subject: Benchmarks on LISP machines vs. work stations.

I am looking at a choice between three basic alternatives:

Running Common Lisp on Apollo 3500s ---
TI Explorers and/or Micro-explorers ---
Symbolics ---

We're in an environment that is weighted heavily towards SUNs and
Apollos, so there is a trade-off in terms of startup time and support
for any movement towards dedicated LISP machines. What I am looking
for is any benchmark comparisons, discussion of the advantages of the
Symbolics and Explorer envionrments as well as any horror/success
stories that people have with both machines.

Also, how are the Symbolics and TI environments for other functions
besides lisp hacking? How well do they integrate with SUNs? Apollos?

Thanks in advance,

Kristian Hammond
kris@tartarus.uchicago.edu

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

Date: Sat, 10 Dec 88 14:07 EST
From: V113H2F9@ubvmsc.cc.buffalo.edu
Subject: Bipedal Robotic Motion: design & references.


I am currently involved with a project at the State University
of New York at Buffalo (Dept. of Electrical & Computer Engineering)
concerning the development of a working bipedal robot mechanism.
I would be very grateful for any input regarding other designs
actually built or under construction -- and/or literature
references regarding the same.

Many thanks for your attention!

Cordially,

Robyn Rebecca Bates
V113H2F9@UBVMS.BITNET

"The spirit of Susan Calvin is remembered."

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

Date: 11 Dec 88 06:25:11 GMT
From: sun.soe.clarkson.edu!k500@tcgould.tn.cornell.edu (collins
anthony g)
Subject: OPS5 OPS83


I am looking for information on how to obtain Ops5 and Ops83 languages.
Are they available on microcomputers ?
Are there any other languages which can substitute for any of these ?
The application is in an expert system for tutoring.
I already know of Lisp and Prolog.

Arun
ps Please send Email

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

Date: 11 Dec 88 13:45:09 GMT
From: mcvax!ukc!mupsy!liv-cs!ian@uunet.uu.net
Subject: Naive Physics (request)

I have been trying to trace a paper by Patrick J. Hayes for ages now, but nobody
seems to have heard of it, and our library can't trace it --- can anybody help ?
The reference I have, comes from the bibliography of Hayes's ``Naive Physics
Manifesto'' and says:

Naive Physics: Ontology of Liquids. Working Paper 35, Institute
for Semantic and Cognitive Studies, Geneva (1978).

I also seem to remember seeing the reference in French somewhere, but I can't
remember where! Please reply to my e-mail address as I will be away for a couple
of weeks, and will not be able to read NEWS.

Thanx in advance,
+---------------------------------------------+--------------------------------+
| Ian Finch | Life is like a sewer ... what |
+---------------------------------------------+ you get out of it depends on |
| Janet: ian@uk.ac.liv.cs.mva | what you put into it. |
| Inter: ian%mva.cs.liv.ac.uk@cunyvm.cuny.edu | |
| UUCP : ...!mcvax!ukc!mupsy!liv-cs!ian | - Tom Lehrer |
+---------------------------------------------+--------------------------------+

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

Date: 12 Dec 88 16:11:00 EST
From: "ARTIC::SUKENIK" <sukenik%artic.decnet@alexandria-emh2.army.mil>
Subject: SCHEME for pc/ac -- return address correction

I am looking around for a SCHEME for a pc/at clone. Any suggestions, war
stories, references, and/or pointers much appreciated.

Thanks in advance.

Hillel Sukenik sukenik@alexandria-emh2.army.mil w(202)274-9322

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

Date: 5 Dec 88 17:16:08 GMT
From: jbn@glacier.stanford.edu (John B. Nagle)
Reply-to: glacier!jbn@labrea.stanford.edu (John B. Nagle)
Subject: Re: Robotic Language


There are a number of commercial robotic languages, such as VAL
(Unimate) and AML (IBM). They are all terrible. They tend to be
interpreters for BASIC-like programming languages with extra statements and
data types thrown in to cope with geometry and machine control.


John Nagle

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

Date: 5 Dec 88 19:03:00 EST
From: Dick (R.D.) Peacocke <RICHARD%BNR.CA@MITVMA.MIT.EDU>
Subject: Articles on "expert applications in network management"

> Date: 24 Nov 88 00:07:37 GMT
> From: ukma!mailrus!ncar!dinl!ericson@ohio-state.arpa (E C Ericson)
> Subject: Articles on "Expert Applications in Network Management"
>
> Help I'm in need of articles or references to articles dealing with the
> use of expert systems for network management. Specifically, I'm need of
> articles describing:
>
> 1) General expert applications to net management
> 2) Expert applications for configuration management
> 3) Expert applications for fault management
> 4) Expert applications for performance management
> 5) Expert applications for security management
> 6) Expert applications for accounting management
>


There is a special issue of IEEE Journal on Selected Areas in
Communications, June '88, on the topic of "Knowledge-Based Systems
for Communications". The first article is "Expert Systems in
Network Management - the 2nd Revolution".
There are some good papers in the issue (including
a coauthor's and mine!)

Dick Peacocke
Computing Research Laboratory
Bell-Northern Research

NETNORTH, BITNET: richard@bnr.CA PHONE: (613) 765-2629
ENVOY BNR.COCOS TO: Dick (R.D.) Peacocke <1524865>
UUCP: ...utzoo!bnr-vpa!bnr-di!dick

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

Date: Tue, 06 Dec 88 17:45:08 -0800
From: Ira Baxter <baxter@argentine.ICS.UCI.EDU>
Subject: Re: "Iterative Deeping" reference wanted


The earliest reference I found on iterative deepening is in
J. J. Scott, "A Chess Playing Program", Machine Intelligence 4,
1969, p. 255. I initially didn't recognize it until I had
formulated a procedure I call "Recursive Iterative Deepening",
described in an unpublished paper of mine called "Variations on
Iterative Deepening Tree Search" (ASE project, University of
California at Irvine, 1986).

IDB
(714) 856-6693 ICS Dept/ UC Irvine, Irvine CA 92717

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

End of AIList Digest
********************

← previous
next →
loading
sending ...
New to Neperos ? Sign Up for free
download Neperos App from Google Play
install Neperos as PWA

Let's discover also

Recent Articles

Recent Comments

Neperos cookies
This website uses cookies to store your preferences and improve the service. Cookies authorization will allow me and / or my partners to process personal data such as browsing behaviour.

By pressing OK you agree to the Terms of Service and acknowledge the Privacy Policy

By pressing REJECT you will be able to continue to use Neperos (like read articles or write comments) but some important cookies will not be set. This may affect certain features and functions of the platform.
OK
REJECT