Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 021
AIList Digest Thursday, 23 Feb 1984 Volume 2 : Issue 21
Today's Topics:
Waveform Analysis - EEG/EKG Request,
Laws of Form - Comment,
Review - Commercial NL Review in High Technology,
Humor - The Adventures of Joe Lisp,
Seminars - Computational Discovery & Robotic Planning & Physiological
Reasoning & Logic Programming & Mathematical Expert System
----------------------------------------------------------------------
Date: Tue, 21 Feb 84 22:29:05 EST
From: G B Reilly <reilly@udel-relay.arpa>
Subject: EEG/EKG Scoring
Has anyone done any work on automatic scoring and interpretation of EEG or
EKG outputs?
Brendan Reilly
[There has been a great deal of work in these areas. Good sources are
the IEEE pattern recognition or pattern recognition and image processing
conferences, IEEE Trans. on Pattern Analysis and Machine Intelligence,
IEEE Trans. on Computers, and the Pattern Recognition journal. There
have also been some conferences on medical pattern recognition. Can
anyone suggest a bibliography, special issue, or book on these subjects?
Have there been any AI (as opposed to PR) approaches to waveform diagnosis?
-- KIL]
------------------------------
Date: 19-Feb-84 02:14 PST
From: Kirk Kelley <KIRK.TYM@OFFICE-2>
Subject: G. Spencer-Brown and the Laws of Form
I know of someone who talked with G. on the telephone about six years
ago somewhere in Northern California. My friend developed a quantum
logic for expressing paradoxes, and some forms of schyzophrenia, among
other things. Puts fuzzy set theory to shame. Anyway, he wanted to
get together with G. to discuss his own work and what he perceived in
the Laws of Form as very fundamental problems in generality due to
over-simplicity. G. refused to meet without being paid fifty or so
dollars per hour.
Others say that the LoF's misleading notation masks the absence of any
significant proofs. They observe that the notation uses whitespace as
an implicit operator, something that becomes obvious in an attempt to
parse it when represented as character strings in a computer.
I became interested in the Laws of Form when it first came out as it
promised to be quite an elegant solution to the most obscure proofs of
Whitehead and Russell's Principia Mathematica. The LoF carried to
perfection a very similar simplification I attempted while studying
the same logical foundations of mathematics. One does not get too far
into the proofs before getting the distinct feeling that there has GOT
to be a better way.
It would be interesting to see an attempt to express the essence of
Go:del's sentence in the LoF notation.
-- kirk
------------------------------
Date: Fri 17 Feb 84 10:57:18-PST
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Commercial NL Review in High Technology
The February issue of High Technology has a short article on
natural language interfaces (to databases, mainly). The article
and business outlook section mention four NL systems currently
on the market, led by AIC's Intellect ($70,000, IBM mainframes),
Frey Associate's Themis ($24,000, DEC VAX-11), and Cognitive
System's interface. (The fourth is not named, but some OEMs and
licensees of the first two are given.) The article says that
four more systems are expected out this year, and discusses
Symantec's system ($400-$600, IBM PC with 256 Kbytes and hard disk)
and Cal Tech's ASK (HP9836 micro, licensed to HP and DEC).
------------------------------
Date: Tue, 14 Feb 84 11:21:09 EST
From: Kris Hammond <Hammond@YALE>
Subject: *AI-LUNCH*
[Forwarded from a Yale bboard by Shrager@CMU-PSY-A.]
THE ADVENTURES OF JOE LISP, T MAN
Brought to you by: *AI-LUNCH*, its hot, its cold, its more than
a lunch...
This week's episode:
The Case of the Bogus Expert
Part I
It was late on a Tuesday and I was dead in my seat from nearly an
hour of grueling mail reading and idle chit-chat with random passers
by. The only light in my office was the soft glow from my CRT,
the only sound was the pain wracked rattle of an over-heated disk.
It was raining out, but the steady staccato rhythm that beat its
way into the skulls of others was held back by the cold concrete
slabs of my windowless walls. I like not having windows, but that's
another story.
I didn't hear her come in, but when the scent of her perfume hit
me, my head swung faster than a Winchester. She was wearing My-Sin,
a perfume with the smell of an expert, but that wasn't what impressed
me. What hit me was her contours. She had a body with all the
right variables. She wore a dress with a single closure that barely
hid the dynamic scoping of what was underneath. Sure I saw her
as an object, but I guess I'm just object oriented. It's the kind
of operator I am.
After she sat down and began to tell her story I realized that her
sophisticated look was just cover. She was a green kid, still wet
behind the ears. In fact she was wet all over. As I said, it was
raining outside. It's an easy inference.
It seems the kid's step-father had disappeared. He had been a
medical specialist, diagnosis and prescription, but one day he
started making wild claims about knowledge and planning and then
he vanished. I had heard of this kind before. Some were
specialists. Some in medicine, some in geology, but all were the
same kind of guy. I looked the girl in the eye and asked the one
question she didn't want to hear, "He's rule-based, isn't he?".
She turned her head away and that was all the answer I needed. His
kind were cold, unfeeling, unchanging, but she still loved him and
wanted him back again.
Once I got a full picture of the guy I was sure that I knew where
to find him, California. It was the haven for his way of thinking
and acting. I was sure that he had been swept up by the EXPERTS.
They were a cult that had grown up in the past few years, promising
fast and easy enlightenment. What they didn't tell you was that
the price was your ability to understand itself. He was there,
as sure as I was a T Man.
I knew of at least one operative in California who could be trusted,
and I knew that I had to talk to him before I could do any further
planning. I reached for the phone and gave him a call.
The conversation was short and sweet. He had resource conflicts
and couldn't give me a hand right now. I assumed that it had to
be more complex than that and almost said that resource conflicts
aren't that easy to identify, but I had no time to waste on in
fighting while the real enemy was still at large. Before he hung
up, he suggested that I pick up a radar detector if I was planning
on driving out and asked if I could grab a half-gallon of milk for
him on the way. I agreed to the favor, thanked him for his advice
and wished him luck on his tan...
That's all for now kids. Tune in next week for the part two of:
The Case of the Bogus Expert
Starring
JOE LISP, T MAN
And remember kids, Wednesdays are *AI-LUNCH* days and 11:45 is the
*AI-LUNCH* time. And kids, if you send in 3 box tops from *AI-LUNCH*
you can get a JOE LISP magic decoder ring. This is the same ring
that saved JOE LISP only two episodes ago and is capable of parsing
from surface to deep structure in less than 15 transformations.
Its part plastic, part metal and all bogus, so order now.
------------------------------
Date: 17 February 1984 11:55 EST
From: Kenneth Byrd Story <STORY @ MIT-MC>
Subject: Computational Discovery of Mathamatical Laws
[Forwarded from the MIT-MC bboard by Laws@SRI-AI.]
TITLE: "The Computational Discovery of Mathematical Laws: Experiments in Bin
Packing"
SPEAKER: Dr. Jon Bentley, Bell Laboratories, Murray Hill
DATE: Wednesday, February 22, 1984
TIME: 3:30pm Refreshments
4:15pm Lecture
PLACE: Bldg. 2-338
Bin packing is a typical NP-complete problem that arises in many applications.
This talk describes experiments on two simple bin packing heuristics (First Fit
and First Fit Decreasing) which show that they perform extremely well on
randomly generated data. On some natural classes of inputs, for instance, the
First Fit Decreasing heuristic finds an optimal solution more often than not.
The data leads to several startling conjectures; some have been proved, while
others remain open problems. Although the details concern the particular
problem of bin packing, the theme of this talk is more general: how should
computer scientists use simulation programs to discover mathematical laws?
(This work was performed jointly with D.S. Johnson, F.T. Leighton and C.A.
McGeoch. Tom Leighton will give a talk on March 12 describing proofs of some
of the conjectures spawned by this work.)
HOST: Professor Tom Leighton
THIS SEMINAR IS JOINTLY SPONSORED BY THE COMBINATORICS SEMINAR & THE THEORY OF
COMPUTATION SEMINAR
------------------------------
Date: 17 Feb 1984 15:14 EST (Fri)
From: "Daniel S. Weld" <WELD%MIT-OZ@MIT-MC.ARPA>
Subject: Revolving Seminar
[Forwarded from the MIT-OZ bboard by SASW@MIT-MC.]
[I am uncertain as to the interest of AIList readers in robotics,
VLSI and CAD/CAM design, graphics, and other CS-related topics. My
current policy is to pass along material relating to planning and
high-level reasoning. Readers with strong opinions for or against
such topics should write to AIList-Request@SRI-AI. -- KIL]
AUTOMATIC SYNTHESIS OF FINE-MOTION STRATEGIES FOR ROBOTS
Tomas Lozano Perez
The use of force-based compliant motions enables robots to carry out
tasks in the presence of significant sensing and control errors. It
is quite difficult, however, to discover a strategy of such motions to
achieve a task. Furthermore, the choice of motions is quite sensitive
to details of geometry and to error characteristics. As a result,
each new task presents a brand new and difficult problem. These
factors motivate the need for automatic synthesis for compliant
motions. In this talk I will describe a formal approach to the
synthesis of compliant motion strategies from geometric description of
assembly operations.
(This is joint work [no pun intended -- KIL] with Matt Mason of CMU
and Russ Taylor of IBM)
------------------------------
Date: Fri 17 Feb 84 09:02:29-PST
From: Sharon Bergman <SHARON@SU-SCORE.ARPA>
Subject: Ph.D. Oral
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
PH.D. ORAL
USE OF ARTIFICIAL INTELLIGENCE
AND SIMPLE MATHEMATICS
TO ANALYZE A PHYSIOLOGICAL MODEL
JOHN C. KUNZ, STANFORD/INTELLIGENETICS
23 FEBRUARY 1984
MARGARET JACKS HALL, RM. 146, 2:30-3:30 PM
The objective of this research is to demonstrate a methodology for design
and use of a physiological model in a computer program that suggests medical
decisions. This methodology uses a physiological model based on first
principles and facts of physiology and anatomy. The model includes inference
rules for analysis of causal relations between physiological events. The model
is used to analyze physiological behavior, identify the effects of
abnormalities, identify appropriate therapies, and predict the results of
therapy. This methodology integrates heuristic knowledge traditionally used in
artificial intelligence programs with mathematical knowledge traditionally used
in mathematical modeling programs. A vocabulary for representing a
physiological model is proposed.
------------------------------
Date: Tue 21 Feb 84 10:47:50-PST
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: ANNOUNCEMENT
[Forwarded from the Stanford SIGLUNCH distribution by Laws@SRI-AI.]
Thursday, February 23, 1984
Professor Kenneth Kahn
Upssala University
will give a talk:
"Logic Programming and Partial Evaluation as Steps Toward
Efficient Generic Programming"
at: Bldg. 200, (History Building), Room 107, 12 NOON
PROLOG and extensions to it embedded in LM PROLOG will be presented as
a means of describing programs that can be used in many ways. Partial
evaluation is a process that automatically produces efficient,
specialized versions of programs. Two partial evaluators, one for
LISP and one for PROLOG, will be presented as a means for winning back
efficiency that was sacrificed for generality. Partial evaluation
will also be presented as a means of generating compilers.
------------------------------
Date: 21 Feb 84 15:27:53 EST
From: DSMITH@RUTGERS.ARPA
Subject: Rutger's University Computer Science Colloquium
[Forwarded from the Rutgers bboard by Laws@SRI-AI.]
COLLOQUIUM
Department of Computer Science
SPEAKER: John Cannon
Dept. of Math
University of Sydney
Syndey, AUSTRIA
TITLE: "DESIGN AND IMPLEMENTATION OF A PROGRAMMING
LANGUAGE/EXPERT SYSTEMS FOR MODERN ALGEBRA"
Abstract
Over the past 25 years a substantial body of algorithms has been
devised for computing structural information about graphs. In order
to make these techniques more generally available, I have undertaken
the development of a system for group theory and related areas of
algebra. The system consists of a high-level language (having a
Pascal-like syntax) supported by an extensive library. In that the
system attempts to plan, at a high level, the most economical solution
to a problem, it has some of the attributes of an expert system. This
talk will concentrate on (a) the problems of designing appropriate
syntax for algebra and, (b) the implementation of a language professor
which attempts to construct a model of the mathematical microworld
with which it is dealing.
DATE: Friday, February 24, 1984
TIME: 2:50 p.m.
PLACE: Hill Center - Room 705
* Coffee served at 2:30 p.m. *
------------------------------
End of AIList Digest
********************
