Copy Link
Add to Bookmark
Report

AIList Digest Volume 1 Issue 068

eZine's profile picture
Published in 
AIList Digest
 · 15 Nov 2023

AIList Digest             Monday, 3 Oct 1983       Volume 1 : Issue 68 

Today's Topics:
Humor - Famous Flamer's School Credit,
Technology Transfer & Research Ownership,
AI Reports - IRD & NASA,
TV Coverage - Computer Chronicles,
Seminars - Ullman, Karp, Wirth, Mason,
Conferences - UTexas Symposium & IFIP Workshop
----------------------------------------------------------------------

Date: Mon 3 Oct 83 09:29:16-PDT From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: Famous Flamer's School -- Credit

The Famous Flamer's School was created by Jeff.Shrager@CMU-CS-A; my
apologies for not crediting him in the original article. If you
saved or distributed a copy, please add a note crediting Jeff.

-- Ken Laws

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

Date: Thu 29 Sep 83 17:58:29-PDT
From: David Rogers <DRogers@SUMEX-AIM.ARPA>
Subject: Alas, I must flame...

[ I hate to flame, but here's an issue that really got to me...]

From the call for papers for the "Artificial Intelligence and Machines":

AUTHORS PLEASE NOTE: A Public Release/Sensitivity Approval is necessary.
Authors from DOD, DOD contractors, and individuals whose work is government
funded must have their papers reviewed for public release and more
importantly sensitivity (i.e. an operations security review for sensitive
unclassified material) by the security office of their sponsoring agency.

How much AI work does *NOT* fall under one of the categories "Authors from
DOD, DOD contractors, and individuals whose work is government funded" ?
I read this to mean that essentially any government involvement with
research now leaves one open to goverment "protection".

At issue here is not the goverment duty to safeguard classified materials;
it is the intent of the government to limit distribution of non-military
basic research (alias "sensitive unclassified material"). This "we paid for
it, it's OURS (and the Russians can't have it)" mentality seems the rule now.

But isn't science supposed to be for the benefit of all mankind,
and not just another economic bargaining chip? I cannot help but to
be chilled by this divorce of science from a higher moral outlook.
Does it sound old fashioned to believe that scientific thought is
part of a common heritage, to be used to improve the lives of all? A
far as I can see, if all countries in the world follow the lead of
the US and USSR toward scientific protectionism, we scientists will
have allowed science to abandon its primary role toward learning
about ourselves and become a mere intellectual commodity.

David Rogers
DRogers@SUMEX-AIM.ARPA

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

Date: Fri 30 Sep 83 10:09:08-PDT
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: IRD Report


[Reprinted from IEEE Computer, Sep. 1983, p. 116.]


Rapid Growth Predicted for AI-Based System

Expert systems are now moving out of the research laboratory and into
the commercial marketplace, according to "Artificial Intelligence,"
a 167-page research report from International Resource Development.
Revenue from all AI hardware, software, and services will amount to
only $70 million this year but is expected to reach $8 billion
in the next 10 years.

Biomedical applications promise to be among the fastest growing
uses of AI, reducing the time and cost of diagnosing illnesses and
adding to the accuracy of diagnoses. AI-based systems can range
from "electronic encyclopedias," which physicians can use as
reference sources, to full-fledged "electronic consultants"
capable of taking a patient through an extensive series of diagnostic
tests and determining the patient's ailments with great precision.

"Two immediate results of better diagnostic procedures may be a
reduction in the number of unnecessary surgical procedures performed
on patients and a decrease in the average number of expensive tests
performed on patients," predicts Dave Ledecky of the IRD research
staff. He also notes that the AI technology may leave hospitals
half-empty, since some operations turn out to be unnecessary.
However, he expects no such dramatic result anytime soon, since
widespread medical application of AI technology isn't expected for
about five years.

The IRD report also describes the activities of several new companies
that are applying AI technology to medical systems. Helena Laboratories
in Beaumont, Texas, is shipping a densitometer/analyzer, which
includes a serum protein diagnostic program developed by Rutgers
University using AI technology. Still in the development stage
are the AI-based products of IntelliGenetics in Palo Alto,
California, which are based on work conducted at Stanford University
over the last 15 years.

Some larger, more established companies are also investing in AI
research and development. IBM is reported to have more than five
separate programs underway, while Schlumberger, Ltd., is
spending more than $5 million per year on AI research, much of
which is centered on the use of AI in oil exploration.

AI software may dominate the future computer industry, according to
the report, with an increasing percentage of applications
programming being performed in Lisp or other AI-based "natural"
languages.

Further details on the $1650 report are available from IRD,
30 High Street, Norwalk, CT 06851; (800) 243-5008,
Telex: 64 3452.

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

Date: Fri 30 Sep 83 10:16:43-PDT
From: Ken Laws <Laws@SRI-AI.ARPA>
Subject: NASA Report


[Reprinted from IEEE Spectrum, Oct. 1983, p. 78]


Overview Explains AI

A technical memorandum from the National Aeronautics and
Space Administration offers an overview of the core ingredients
of artificial intelligence. The volume is the first in a series
that is intended to cover both artificial intelligence and
robotics for interested engineers and managers.

The initial volume gives definitions and a short history entitled
"The rise, fall, and rebirth of AI" and then lists applications,
principal participants in current AI work, examples of the
state of the art, and future directions. Future volumes in AI
will cover application areas in more depth and will also cover
basic topics such as search-oriented problem-solving and
planning, knowledge representation, and computational logic.

The report is available from the National Technical Information
Service, Springfield, Va. 22161. Please ask for NASA Technical
Memorandum Number 85836.

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

Date: Thu 29 Sep 83 20:13:09-PDT
From: Ellie Engelmore <EENGELMORE@SUMEX-AIM>
Subject: TV documentary

[Reprinted from the SU-SCORE bboard.]


KCSM-TV Channel 60 is producing a series entitled "The Computer
Chronicles". This is a series of 30-minute programs intended to be a
serious look at the world of computers, a potential college-level
teaching device, and a genuine historical document. The first episode
in the series (with Don Parker discussing computer security) will be
broadcast this evening...Thursday, September 29...9pm.

The second portion of the series, to be broadcast 9 pm Thursday,
October 6, will be on the subject of Artificial Intelligence (with Ed
Feigenbaum).

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

Date: Thu 29 Sep 83 19:03:27-PDT
From: Andrei Broder <Broder@SU-SCORE.ARPA@SU-Score>
Subject: AFLB

[Reprinted from the SU-SCORE bboard.]


The "Algorithms for Lunch Bunch" (AFLB) is a weekly seminar in
analysis of algorithms held by the Stanford Computer Science
Department, every Thursday, at 12:30 p.m., in Margaret Jacks Hall, rm.
352.

At the first meeting this year, (Thursday, October 6) Prof. Jeffrey D.
Ullman, from Stanford, will talk on "A time-communication tradeoff"
Abstract follows.

Further information about the AFLB schedule is in the file
[SCORE]<broder>aflb.bboard .

If you want to get abstracts of the future talks, please send me a
message to put you on the AFLB mailing list. If you just want to know
the title of the next talk and the name of the speaker look at the
weekly Stanford CSD schedule that is (or should be) sent to every
bboard.
------------------------

10/6/83 - Prof. Jeffrey D. Ullman (Stanford):

"A time-communication tradeoff"

We examine how multiple processors could share the computation of a
collection of values whose dependencies are in the fom of a grid,
e.g., the estimation of nth derivatives. Two figures of merit are the
time t the shared computation takes and the amount of communication c,
i.e., the number of values that are either inputs or are computed by
one processor and used by another. We prove that no matter how we
share the responsibility for computing an n by n grid, the law ct =
OMEGA(n^3) must hold.

******** Time and place: Oct. 6, 12:30 pm in MJ352 (Bldg. 460) *******

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

Date: Thu 29 Sep 83 09:33:24-CDT
From: CS.GLORIA@UTEXAS-20.ARPA
Subject: Karp Colloquium, Oct. 13, 1983

[Reprinted from the UTexas-20 bboard.]


Richard M. Karp, University of California at Berkeley, will present a talk
entitled, "A Fast Parallel Algorithm for the Maximal Independent Set Problem"
on Thursday, October 13, 1983 at 3:30 p.m. in Painter Hall 4.42. Coffee
at 3 p.m. in PAI 3.24.
Abstract:
One approach to understanding the limits of parallel computation is to
search for problems for which the best parallel algorithm is not much faster
than the best sequential algorithm. We survey what is known about this
phenomenon and show that--contrary to a popular conjecture--the problem of
finding a maximal inependent set of vertices in a graph is highly amenable
to speed-up through parallel computation. We close by suggesting some new
candidates for non-parallelizable problems.

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

Date: Fri 30 Sep 83 21:39:45-PDT
From: Doug Lenat <LENAT@SU-SCORE.ARPA>
Subject: N. Wirth, Colloquium 10/4/83

[Reprinted from the SU-SCORE bboard.]


CS COLLOQUIUM: Niklaus Wirth will be giving the
opening colloquium of this quarter on Tuesday (Oct. 4),
at 4:15 in Terman Auditorium. His talk is titled
"Reminiscences and Reflections". Although there is
no official abstract, in discussing this talk with him
I learned that Reminiscences refer to his days here at
Stanford one generation ago, and Reflections are on
the current state of both software and hardware, including
his views on what's particularly good and bad in the
current research in each area. I am looking forward to
this talk, and invite all members of our department,
and all interested colleagues, to attend.

Professor Wirth's talk will be preceded by refreshments
served in the 3rd floor lounge (in Margaret Jacks Hall)
at 3:45. Those wishing to schedule an appointment with
Professor Wirth should contact ELYSE@SCORE.

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

Date: 30 Sep 83 1049 PDT
From: Carolyn Talcott <CLT@SU-AI>
Subject: SEMINAR IN LOGIC AND FOUNDATIONS

[Reprinted from the SU-SCORE bboard.]


Organizational and First Meeting

Time: Wednesday, Oct. 5, 4:15-5:30 PM

Place: Mathematics Dept. Faculty Lounge, 383N Stanford

Speaker: Ian Mason

Title: Undecidability of the metatheory of the propositional calculus.

Before the talk there will be a discussion of plans for the seminar
this fall.
S. Feferman


[PS - If you read this notice on a bboard and would like to be on the
distribution list send me a message. - CLT@SU-AI]

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

Date: Thu 29 Sep 83 14:24:36-CDT
From: Clive Dawson <CC.Clive@UTEXAS-20.ARPA>
Subject: Schedule for C.S. Dept. Centennial Symposium

[Reprinted from the UTexas-20 bboard.]


COMPUTING AND THE INFORMATION AGE

October 20 & 21, 1983

Joe C. Thompson Conference Center

Thursday, Oct. 20
-----------------

8:30 Welcoming address - A. G. Dale (UT Austin)
G. J. Fonken, VP for Acad. Affairs and Research

9:00 Justin Rattner (Intel)
"Directions in VLSI Architecture and Technology"

10:00 J. C. Browne (UT Austin)

10:15 Coffee Break

10:45 Mischa Schwartz (Columbia)
"Computer Communications Networks: Past, Present and Future"

11:45 Simon S. Lam (UT Austin)

12:00 Lunch

2:00 Herb Schwetman (Purdue)
"Computer Performance: Evaluation, Improvement, and Prediction"

3:00 K. Mani Chandy (UT Austin)

3:15 Coffee Break

3:45 William Wulf (Tartan Labs)
"The Evolution of Programming Languages"

4:45 Don Good (UT Austin)

Friday, October 21
------------------

8:30 Raj Reddy (CMU)
"Supercomputers for AI"

9:30 Woody Bledsoe (UT Austin)

9:45 Coffee Break

10:15 John McCarthy (Stanford)
"Some Expert Systems Require Common Sense"

11:15 Robert S. Boyer and J Strother Moore (UT Austin)

11:30 Lunch

1:30 Jeff Ullman (Stanford)
"A Brief History of Achievements in Theoretical Computer Science"

2:30 James Bitner (UT Austin)

2:45 Coffee Break

3:15 Cleve Moler (U. of New Mexico)
"Mathematical Software -- The First of the Computer Sciences"

4:15 Alan Cline (UT Austin)

4:30 Summary - K. Mani Chandy, Chairman, Dept. of Computer Sciences

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

Date: Sunday, 2 October 1983 17:49:13 EDT
From: Mario.Barbacci@CMU-CS-SPICE
Subject: Call For Participation -- IFIP Workshop

CALL FOR PARTICIPATION
IFIP Workshop on Hardware Supported Implementation of
Concurrent Languages in Distributed Systems
March 26-28, 1984, Bristol, U.K.

TOPICS:
- the impact of distributed computing languages and compilers on the
architecture of distributed systems.
- operating systems; centralized/decentralized control, process
communications and synchronization, security
- hardware design and interconnections
- hardware/software interrelation and trade offs
- modelling, measurements, and performance

Participation is by INVITATION ONLY, if you are interested in attending this
workshop write to the workshop chairman and include an abstract (1000 words
approx.) of your proposed contribution.

Deadline for Abstracts: November 15, 1983
Workshop Chairman: Professor G.L. Reijns
Chairman, IFIP Working Group 10.3
Delft University of Technology
P.O. Box 5031
2600 GA Delft
The Netherlands

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

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