Copy Link
Add to Bookmark
Report
AIList Digest Volume 2 Issue 023
AIList Digest Thursday, 1 Mar 1984 Volume 2 : Issue 23
Today's Topics:
Seminars - VLSI Knowledge Representation
& Machine Learning
& Computer as Musical Scratchpad
& Programming Language for Group Theory
& Algorithm Animation
Conference - Very Large Databases Call for Papers
----------------------------------------------------------------------
Date: Wed 22 Feb 84 16:36:20-PST
From: Joseph A. Goguen <GOGUEN@SRI-AI.ARPA>
Subject: Hierarchical Software Processor
[Forwarded by Laws@SRI-AI.]
An overview of HISP
by K. Futatsugi
Special Lecture at SRI, 27 February 1984
HISP (hierarchical software processor) is an experimental
language/system, which has been developed at ETL (Electrotechnical
Laboratory, Japan) by the author's group, for hierarchical software
development based on algebraic specification techniques.
In HISP, software development is simply modeled as the incremental
construction of a set of hierarchically structured clusters of
operators (modules). Each module is the constructed as a result of
applying one of the specific module building operations to the already
existing modules. This basic feature makes it possible to write
inherently hierarchical and modularized software.
This talk will inroduce HISP informally by the use of simple
examples. The present status of HISP implementation and future
possibilities will also be sketched.
------------------------------
Date: Thu 23 Feb 84 00:26:45-MST
From: Subra <Subrahmanyam@UTAH-20.ARPA>
Subject: Very High Level Silicon Compilation
[Forwarded by Laws@SRI-AI. This talk was presented at the SRI
Computer Science Laboratory.]
VERY HIGH LEVEL SILICON COMPILATION: THEORY AND PRACTICE
P.A.Subrahmanyam
Department of Computer Science
University of Utah
The possibility of implementing reasonably complex special purpose systems
directly in silicon using VLSI technologies has served to underline the need
for design methodologies that support the development of systems that have both
hardware and software components. It is important in the long run for
automated design aids that support such methodologies to be based on a uniform
set of principles -- ideally, on a unifying theoretical basis. In this
context, I have been investigating a general framework to support the analytic
and synthetic tasks of integrated system design. Two of the salient features of
this basis are:
- The formalism allows various levels of abstraction involved in the
software/hardware design process to be modelled. For example,
functional (behavioral), architectural (system and chip level),
symbolic layout, and electrical (switch-level)-- are explicitly
modelled as being typical of the levels of abstraction that human
"expert designers" work with.
- The formalism allows for explicit reasoning about behavioral,
spatial, temporal and performance criteria.
The talk will motivate the general problem, outline the conceptual and
theoretical basis, and discuss some of our preliminary empirical explorations
in building integrated software-hardware systems using these principles.
------------------------------
Date: 22 Feb 84 12:19:09 EST
From: Giovanni <Bresina@RUTGERS.ARPA>
Subject: Machine Learning Seminar
[Forwarded from the Rutgers bboard by Laws@SRI-AI.]
*** MACHINE LEARNING SEMINAR AND PIZZA LUNCHEON ***
Empirical Exploration of Problem Reformulation and Strategy Acquisition
Authors: N.S. Sridharan and J.L. Bresina
Location: Room 254, Hill Center, Busch Campus, Rutgers
Date: Wednesday, February 29, 1984
Time: Noon - 1:30 pm
Speaker: John L. Bresina
The problem solving ability of an AI program is critically dependent on the
nature of the symbolic formulation of the problem given to the program.
Improvement in performance of the problem solving program can be made by
improving the strategy of controlling and directing search but more importantly
by shifting the problem formulation to a more appropriate form.
The choice of the initial formulation is critical, since certain formulations
are more amenable to incremental reformulations than others. With this in
mind, an Extensible Problem Reduction method is developed that allows
incremental strategy construction. The class of problems of interest to us
requires dealing with interacting subgoals. A variety of reduction operator
types are introduced corresponding to different ways of handling the
interaction among subgoals. These reduction operators define a generalized
And/Or space including constraints on nodes with a correspondingly generalized
control structure for dealing with constraints and for combining solutions to
subgoals. We consider a modestly complex class of board puzzle problems and
demonstrate, by example, how reformulation of the problem can be carried out by
the construction and modification of reduction operators.
------------------------------
Date: 26 Feb 84 15:16:08 EST
From: BERMAN@RU-BLUE.ARPA
Subject: Seminar: The Computer as Musical Scratchpad
[Forwarded from the Rutgers bboard by Laws@SRI-AI.]
SEMINAR: THE COMPUTER AS MUSICAL SCRATCHPAD
Speaker: David Rothenburg, Inductive Inference, Inc.
Date: Monday, March 5, 1984
Place: CUNY Graduate Center, 33 West 42nd St., NYC
Room: 732
Time: 6:30 -- 7:30 p.m.
The composer can use a description language wherein only those
properties and relations (of and between protions of the musical
pattern) which he judges significant need be specified. Parameters of
these unspecified properties and relations are assigned at random. It
is intended that this description of the music be refined in response
to iterated auditions.
------------------------------
Date: Sun 26 Feb 84 17:06:23-CST
From: Bob Boyer <CL.BOYER@UTEXAS-20.ARPA>
Subject: A Programming Language for Group Theory (Dept. of Math)
[Forwarded from the UTexas-20 bboard by Laws@SRI-AI.]
DEPARTMENT OF MATHEMATICS COLLOQUIUM
A Programming Language for Group Theory
John Cannon
University of Sydney and Rutgers University
Monday, February 27, 4pm
The past 25 years has seen the emergence of a small but vigorous branch of
group theory which is concerned with the discovery and implementation of
algorithms for computing structural information about both finite and infinite
groups. These techniques have now reached the stage where they are finding
increasing use both in group theory research and in its applications. In order
to make these techniques more generally available, I have undertaken the
development of what in effect is an expert system for group theory.
Major components of the system include a high-level user language (having
a Pascal-like syntax) and an extensive library of group theory algorithms. The
system breaks new ground in that it permits efficient computation with a range
of different types of algebraic structures, sets, sequences, and mappings.
Although the system has only recently been released, already it has been
applied to problems in topology, algebraic number theory, geometry, graphs
theory, mathematical crystalography, solid state physics, numerical analysis
and computational complexity as well as to problems in group theory itself.
------------------------------
Date: 27 Feb 1984 2025-PST (Monday)
From: Forest Baskett <decwrl!baskett@Shasta>
Subject: EE380 - Wednesday, Feb. 29 - Sedgewick on Algorithm Animation
[Forwarded from the Stanford bboard by Laws@SRI-AI.]
EE380 - Computer Systems Seminar
Wednesday, February 29, 4:15 pm
Terman Auditorium
Algorithm Animation
Robert Sedgewick
Brown University
The central thesis of this talk is that it is possible to expose
fundamental characteristics of computer programs through the use of
dynamic (real-time) graphic displays, and that such algorithm animation
has the potential to be useful in several contexts. Recent research in
support of this thesis will be described, including the development of
a conceptual framework for the process of animation, the implementation
of a software environment on high-performance graphics-based
workstations supporting this activity, and the use of the system as a
principal medium of communication in teaching and research. In
particular, we have animated scores of numerical, sorting, searching,
string processing, geometric, and graph algorithms. Several examples
will be described in detail.
[Editorial remark: This is great stuff. - Forest]
------------------------------
Date: 23 Feb 84 16:32:24 PST (Thu)
From: Gerry Wilson <wilson@aids-unix>
Subject: Conference Call for Papers
CALL FOR PAPERS
================
10'th International Conference on
Very Large Data Bases
The tenth VLDB conference is dedicated to the identification and
encouragement of research, development, and application of
advanced technologies for management of large data bases. This
conference series provides an international forum for the promotion
of an understanding of current research; it facilitates the exchange
of experiences gained in the design, construction and use of data
bases; it encourages the discussion of ideas and future research
directions. In this anniversary year, a special focus is the
reflection upon lessons learned over the past ten years and the
implications for future research and development. Such lessons
provide the foundation for new work in the management of large
data bases, as well as the merging of data bases, artificial
intelligence, graphics, and software engineering technologies.
TOPICS:
Data Analysis and Design Intelligent Interfaces
Multiple Data Types User Models
Semantic Models Natural Language
Dictionaries Knowledge Bases
Graphics
Performance and Control
Data Representation Workstation Data Bases
Optimization Personal Data Mangement
Measurement Development Environments
Recovery Expert System Applications
Message Passing Designs
Security
Protection Real Time Systems
Semantic Integrity Process Control
Concurrency Manufacturing
Engineering Design
Huge Data Bases
Data Banks Implementation
Historical Logs Languages
Operating Systems
Multi-Technology Systems
Applications Distributed Data Bases
Office Automation Distribution Management
Financial Management Heterogeneous and Homogeneous
Crime Control Local Area Networks
CAD/CAM
Hardware
Data Base Machines
Associative Memory
Intelligent Peripherals
LOCATION: Singapore
DATES: August 29-31, 1984
TRAVEL SUPPORT: Funds will be available for partial support of most
participants.
HOW TO SUBMIT: Original full length (up to 5000 words) and short (up
to 1000 words) papers are sought on topics such as those above. Four
copies of the submission should be sent to the US Program Chairman:
Dr. Umeshwar Dayal
Computer Corporation of America
4 Cambridge Center
Cambridge, Mass. 02142
[Dayal@CCA-UNIX]
IMPORTANT DATES: Papers Due: March 15, 1984
Notification: May 15, 1984
Camera Ready Copy: June 20, 1984
For additional information contact the US Conference Chairman:
Gerald A. Wilson
Advanced Information & Decision Systems
201 San Antonio Circle
Suite 286
Mountain View, California 94040
[Wilson@AIDS]
------------------------------
End of AIList Digest
********************
