Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 109
AIList Digest Wednesday, 22 Aug 1984 Volume 2 : Issue 109
Today's Topics:
Administrivia - Late Mailing,
Man-Machine Interface - Ebstein/Turing Tests,
Psychology - APA Acronym & Personality Tests,
Applications - CLARIFY: On-Line Guide for Revising Technical Prose,
Seminars - Mechanisms for Learning & Medical Knowledge Acquisition
& Functional Languages and Parallel Computers,
Conference - National ACM'84 Meeting
----------------------------------------------------------------------
Date: 25 Aug 84 1800 PDT
From: Kenneth I. Laws <Laws@SRI-AI>
Subject: Late Mailing
This issue, # 109, is being mailed after issue # 110 due my accidentally
deleting the file instead of sending it out. Fortunately the SRI systems
staff was able to recover a copy. I apologize for not getting the seminar
notices out in reasonable time. -- KIL
------------------------------
Date: 21 Aug 84 1136 PDT
From: Peter Blicher <PB@SU-AI.ARPA>
Subject: ebstein/turing tests
As I continue to deal with bureaucracies and uninterested workers, it is
becoming clearer that the Turing test will soon be passed, but not because
of any improvement in technology.
------------------------------
Date: 20 Aug 1984 00:01:00 EDT
From: Richard F. Hartung <HARTUNG@USC-ISI.ARPA>
Subject: What APA stands for.
APA stands for both American Psychological Association and American
Psychiatric Association, two separate organizations
A friend who attends all these things tells me that the Psychological
org is meeting in Toronto this year (in about a week) and met their last in
1981 or 1980. In 1982 it was in Washington D.C. Although he doesn't
remember off hand where the Psychiatric org. met in 82, this was probably
the meeting refered to in the last AILIST (conclusion by default).
Michael Moran
Lockheed Advanced Software Laboratory
------------------------------
Date: Sat 4 Aug 84 18:52:04-PDT
From: Stuart McLure Cracraft <G.MCLURE@SU-SCORE.ARPA>
Subject: Re: Any online Personality Tests?
[Forwarded from the Stanford bboard by Laws@SRI-AI. This is
in response to Stanford query about on-line personality tests.]
The book you want is
PLEASE UNDERSTAND ME (absurdly chosen title)
by David Keirsey and Marilyn Bates
It contains a 70-question instrument, the Keirsey Temprament Sorter,
based on the psychological typology developed by Carl Jung and
others (Myers-Briggs). The Myers-Briggs instrument which is the
true instrument is not available to the general public. Distribution
of it is limited to psychology grad students and psychologists/psychiatrists.
The Keirsey test is the best substitute I've found.
[...]
Several psychologists I have spoken with indicate the Jung typology
tests such as the Myers-Briggs and Keirsey are gaining recognition
as extremely deep tests. Although I have no formal degree in
psychology, I feel that the Jung typology is vastly more deep than
the Rorschach, Minnesota Multi-Phasic, and California Psychological
inventories.
The Myers-Briggs was eschewed by earlier researchers and is only
recently over-coming its "bad" reputation. The correlations between
personality types and profession, marriage, partners, etc are
very significant.
To me, the Jung typology is the most profound psychological work
done in this century by anyone.
Stuart
------------------------------
Date: Wed 15 Aug 84 12:01:49-PDT
From: C.S./Math Library <LIBRARY@SU-SCORE.ARPA>
Subject: CLARIFY: Rand's On-Line Guide for Revising Technical Prose
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
CLARIFY: Rand's On-Line Guide for Revising Technical Prose
Rand Report: N-2037-RC by M.E.Vaianan, N.Z.Shapiro and M.L.LaCasse 1983
This note describes the development and testing of CLARIFY, a computerized
writing aid designed to assist writers in revising technical prose. CLARIFY
is not a traditional readability formula; its design reflects research on how
English speakers understand sentences. CLARIFY flags sentences that have
certain patterns of nominalizations, prepositional phrases, and forms of the
verb to be. The choice of these features reflects research which suggests
that the dominant strategy employed by English speakers in interpreting
sentences is to assume a subject-verb-object (SVO) structure. The features
that CLARIFY flags are good surrogate indicators that a sentence does not have
an SVO structure, and therefore, that the initial interpretive strategy will
be unsuccessful. In developing CLARIFY, the authors tested various patterns
of these features, and obtained user comments about the system's usefulness
and effectiveness. Like all computerized writing aids, CLARIFY hs
limitations, which are discussed in the note. CLARIFY is in general use at
the Rand Corp. where it is also continuing to be tested 55pp**
**From Selected Rand Abstracts
Rand publications are located in the Green Library.
H. Llull
------------------------------
Date: 08/14/84 12:35:48
From: ROSIE
Subject: Seminar - Mechanisms for Learning
[Forwarded from the MIT bboard by SASW@MIT-MC.]
DATE: Thursday, August 16, 1984
PLACE: NE43-7th Floor Playroom
MECHANISMS FOR LEARNING
Kamesh Ramakrishna
Ohio State University, Columbus, Ohio
A number of different mechanisms for machine learning have been
proposed, though the definition of "learning" itself has not been
particularly clear. We show that many proposed learning mechanisms
can be placed into two classes and that mechanisms within each class
are reducible to each other. These two classes correspond roughly to
the "knowledge acquisition" and "skill refinement" classes proposed by
Mitchell, Carbonell, and Michalski; however, (and more interestingly)
they correspond to the two different levels of knowledge-based
processor architecture proposed by Newell in "The Knowledge Level".
The knowledge acquisition type learners appear to be at the
Symbol/Program level. This observation lets us integrate this
approach to machine learning with the taxonomy of problem-solving
types proposed by Chandrasekaran et al., leading to the hope of an
integrated knowledge-level approach to both problem-solving and
learning.
With appropriate restrictions placed on the functioning of the
learning mechanisms, we show that the two classes also differ in the
fundamental learning problem that they solve. We identify some
learning problems that are not solved by either class -- identifying
some possible future directions for research.
HOST: Prof. Ramesh Patil
------------------------------
Date: Tue 21 Aug 84 09:17:27-PDT
From: Juanita Mullen <MULLEN@SUMEX-AIM.ARPA>
Subject: Seminar - Medical Knowledge Acquisition
[Forwarded from the Stanford SIGLUNCH distribution by Laws@SRI-AI.]
RIPLUNCH
SPEAKER: Larry Fagan, Joan Differding, and Mark Musen
Medical Computer Science Group
TOPIC OPAL: Practical Knowledge Acquisition for ONCOCIN
DATE: Friday, August 24, 1984
LOCATION: Chemistry Gazebo, between Physical & Organic Chemistry
TIME: 12:05
We will discuss our design of the ONCOCIN knowledge acquisition
framework named OPAL. ONCOCIN is designed to assist physicians with
the management of cancer treatment plans. A number of these treatment
plans, called protocols, have been entered into the ONCOCIN system
using low level tools. We have recently built a protocol oriented
knowledge acquisition system designed directly for the cancer
specialist (oncologist). The OPAL knowledge acquisition subsystem is
graphically based and represents our analysis of the common components
of cancer treatment plans.
------------------------------
Date: Tue 21 Aug 84 11:11:30-EDT
From: Pamela Sedell <MAP@MIT-XX.ARPA>
Subject: Seminar - Functional Languages and Parallel Computers
[Forwarded from the MIT bboard by SASW@MIT-MC.]
"Functional Languages and Parallel Computers"
John Hughes
Oxford University Computing Laboratory
Programming Research Group, Oxford
Friday, August 24, 1984
NE43-512, 2:15
We introduce functional programming and show how "real programs"
such as simple operating systems can be written functionally. We
also explain why functional languages are particularly useful for
programming parallel computers. We have discovered that the
relationship between functional languages and parallel computers
is closer than previously suspected: functional languages actually
require a parallel implementation if they are to use memory efficiently.
We introduce two simple constructs which allow the functional programmer
to exert close control over memory requirements, and give a number of
examples to illustrate them in use. The new constructs can also be
used to implement "non-deterministic unmerge".
------------------------------
Date: 13 Aug 84 10:08:19-PDT (Mon)
From: hplabs!hao!ames!eugene @ Ucb-Vax.arpa
Subject: National ACM'84 meeting San Franciso, CA
Article-I.D.: ames.472
I am posting the following as a request of Lew Bornmann of the ACM'84
publicity committee. Please mail any requests for information to:
bornmann@ames-nas-gw [or bornmann%ames-nas-gw@su-score]
=======================================================================
ACM-84: The Fifth Generation Challenge
What: ACM-84, the Association for Computing Machinery's 1984 Annual
Conference.
When: October 8 to 10, 1984, with an "Early Bird" reception on Sunday,
October 7.
Where: At the San Francisco Hilton and Tower, Mason and O'Farrell Streets,
San Francisco
Theme: The Fifth Generation Challenge
The Conference will examine:
The Impact of the Fifth Generation.
Specifically, the effect that Fifth Generation computers
will have over the next decade on society, industry, the
professions, and computer science.
The Building Blocks of the Fifth Generation.
An examination of current developments, new techniques, and
new products which will take computing into the 1990s.
The Character of Integration...
in the Fifth Generation. How the Fifth Generation building
blocks will fit together, and the impact of integration.
The technical conference program will complemented by:
o Professional Development Seminars.
o An exhibit program.
o An educators' program.
o A computer chess championship.
Social events will include a "Themes of San Francisco" gala evening and an
awards luncheon.
Special travel arrangements have been made with Corporate Travel Services of
Sunnyvale, Ca. These include discounted air fares and pre- and
post-conference tours. (CTS toll-free phone number: 800/851-3478; in
California: call 408/734-9990 collect.)
Advance Registration Fees:
$110.00 ACM Members
$150.00 Non-ACM Members
Accommodations: Blocks of rooms for ACM-84 have been reserved. Please
contact the Hilton directly for reservations. When calling, specify ACM-84
for reduced rates.
Director of Front Office Operations
San Francisco Hilton Tower
Mason and O'Farrell Streets
San Francisco, Ca. 94102
(415)771-1400
Room rates:
Singles begin at $67
Double begin at $87
For any additional information, contact:
(415)948-6306
------------------------------
End of AIList Digest
********************
