Copy Link
Add to Bookmark
Report

AIList Digest Volume 6 Issue 046

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

AIList Digest             Friday, 4 Mar 1988       Volume 6 : Issue 46 

Today's Topics:
Queries - Chemical Reasoning & Connectionist Simulator &
AAAI Address & Journal and Seminar Information &
Contrasting Human and Computer Learning &
Neural Networks and Vision & Sequence-Comparison Algorithms &
Most-Parallel Planning,
Funding - Robotics Application

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

Date: Sun, 28 Feb 88 00:19:08 EST
From: Raul.Valdes-Perez@B.GP.CS.CMU.EDU
Subject: Request for information

I am involved with a new project here at CMU that will
examine scientific theory formation and testing in an
underdeveloped branch of synthetic chemistry. The first
stage involves both experiment planning and modification
to a current qualitative theory based on the experimental
result.

We are very interested in first becoming acquainted with
any cognitive-psychological study of chemical reasoning,
preferably that of chemists rather than novices. Can any
reader point out some references to such work? Thank you.

Raul Valdes-Perez (valdes@b.gp.cs.cmu.edu)

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

Date: 3 Mar 88 14:11:20 GMT
From: jem97@leah.albany.edu (Jim Mower)
Subject: Re: AIList V6 #38 - Applications, Neuromorphic Tools,
Nanotechnology


In article <8802221732.AA14122@beowulf.UCSD.EDU>, heirich@cs (Alan Heirich)
writes:
> * The Rochester Connectionist Simulator, available from the Computer Science
> Department of the University of Rochester. A modifiable package, written
> in C...


Could someone from U of R post an article or send me a note concerning
the intent and capabilities of the Simulator? Alan
mentioned that the simulator was being offered for a nominal fee. How
does one go about ordering a copy? Thanks.

Jim Mower, Dept. of Geography and Planning
University at Albany
jem97@leah.albany.edu (internet)
jem97@albny1vx (bitnet)

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

Date: Tue, 01 Mar 88 09:01 EST
From: WURST%UCONNVM.BITNET@MITVMA.MIT.EDU
Subject: Publications information request...

I am interested in joining the AAAI, and subscribing to their
journal, but I cannot find an address or membership/subscription
information. I checked our library, but they do not subscribe to
it. Would someone please send me the address, and any other
information (cost, etc...) that I need to join/subscribe? Thanks.
Also, I would be interested in knowing about any other journals
which apply to the field of AI. Please email any information that
you have to me directly. Once again, thank you.

[The AAAI information can be obtained from
AAAI-OFFICE@SUMEX.STANFORD.EDU . -- KIL]

----------
Karl R. Wurst
Computer Science and Engineering, U-155 BITNET: WURST@UCONNVM
University of Connecticut CSNET : WURST@UCONN
Storrs, CT 06268

"If A = B and B = C, then A = C, except where void or prohibited by law."

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

Date: Wed, 02 Mar 88 12:40 EST
From: WURST%UCONNVM.BITNET@MITVMA.MIT.EDU
Subject: Seminar information...

I accidentally deleted a recent AILIST containing a announcement
about a seminar on temporal logic. Could someone please send me a
copy of the announcement? I believe that the seminar was being given
at BBN, but I am not sure. Thank you.

----------
Karl R. Wurst
Computer Science and Engineering, U-155 BITNET: WURST@UCONNVM
University of Connecticut CSNET : WURST@UCONN
Storrs, CT 06268

"Progress might have been alright once, but it's gone on too long."
--Ogden Nash

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

Date: Wed, 2 Mar 88 11:11:07 PST
From: woodson@ernie.Berkeley.EDU (Chas Woodson)
Subject: contrasting human and computer learning

I seem to recall discussion about a course comparing and contrasting learning
in humans and learning in machines. Can you direct me to that discussion?
Thanks.

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

Date: 27 Feb 88 23:21:53 GMT
From: parvis@pyr.gatech.edu (FULLNAME)
Subject: neural networks and vision


I'm looking for some interesting research in the field of neural network
applications in vision, particularly in using neural network simulation to
process images. I am already familiar with the work of Kohonen (face
recognition), Fukushima (neocognitron), Marr (stereo parallax).
Concrete implementations: UCLA PUNNS, PABLO, BOSS and ISCON.

1. Any additional practical approach s.a. neural simulation programs for
image processing and
2. Any approach to image understanding (object recognition and identification
in contrast to feature extraction from images) by using a neural network
modell is of interest.

I appreciate any response. Thanks, Parvis.

----
Parvis Avini
parvis@gitpyr.gatech.edu
U.S.Mail:
Georgia Institute of Technology
P.O. BOX 34331
Atlanta, GA 30332

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

Date: Thu 3 Mar 88 07:07:04-PST
From: June Bossinger <BOSSINGER@BIONET-20.ARPA>
Subject: Sequence algorithms

Can anyone suggest some good references where parallel computers have
been used to do sequence comparisons (especially comparisons of either
algorithms or machines)?

June Bossinger
bossinger@BIONET-20.arpa

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

Date: Wed 2 Mar 88 15:49:26-PST
From: Nabil Kartam <KARTAM@Sushi.Stanford.EDU>
Subject: Most parallel plan using AI-techniques

I am investigating the utility of AI-techniques in the Project Planning
domain. I have studied in depth most papers about AI-planners such as
STRIPS, NOAH, NONLIN, and SIPE. During this year, I have been using SIPE
to plan different construction projects. I would like to share some of my
experience with concern researchers and hopefully get some answers for some
questions.

I dicover that SIPE is unable to provide the most parallel network and would
like to know whether you think NOAH or NONLIN will be able to do so.
e.g. suppose we have the following (B1 and B2 are specific beams ;
C1, C2, and C3 are specific columns )

The preconditions of building B1 are building C1 and building C2
The preconditions of building B2 are building C2 and building C3

if our goal is to build B1 and B2, then the plan should be:

---- ----
| C1 |------------------------->| B1 |
---- / ----
/
/
---- /
| C2 |\
---- \
\
\
---- \ ----
| C3 |------------------------->| B2 |
---- ----

However, the plan obtained by SIPE looks like this:

---- ---- ---- ----
| C1 |---------->| B1 |------| C3 |--------->| B2 |
---- / ---- ---- ----
/
/
---- /
| C2 |
----

Although this plan is logically correct, it is not the most parallel plan.
There is no reason why the column C3 should start after B1. In fact, C3 should
be scheduled without any preconditions.
I know that David Wilkins is working to solve this problem in his planner, but
I would like to know whether you think this is a hard or simple problem and
whether there is any planner that could produce the most parallel plan.

Thanks,

Nabil Kartam
Construction Eng.&Mgt
Stanford University
kartam@sushi

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

Date: 1 Mar 88 18:51:47 GMT
From: sunybcs!rapaport@AMES.ARC.NASA.GOV (William J. Rapaport)
Subject: Funding for robotics applications

I have been contacted by a fellow in the construction industry who is
seeking to fund research in robotics applications for construction.

Two typical problems are:

(1) developing a robot that can distribute and finish concrete masonry
(2) developing a robot that can lay 8" masonry blocks.

The research would be a commercial undertaking, with no military
applications, to result in a product to be distributed primarily in the
southeastern US.

Inquiries may be directed to:

Mr. John S. Sherman
9801 Collins Ave.
Bal Harbour, FL 33154

(305) 866-4400

or to me at:
William J. Rapaport
Assistant Professor

Dept. of Computer Science||internet: rapaport@cs.buffalo.edu
SUNY Buffalo ||bitnet: rapaport@sunybcs.bitnet
Buffalo, NY 14260 ||uucp: {ames,boulder,decvax,rutgers}!sunybcs!rapaport
(716) 636-3193, 3180 ||

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

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