Copy Link
Add to Bookmark
Report
IRList Digest Volume 3 Number 18
IRList Digest Thursday, 9 July 1987 Volume 3 : Issue 18
Today's Topics:
Query - Stemming
- Online HAI
Discussion - Representation of dictionary information
Announcement - ISI Grapher
- Preliminary program Visual Languages '87
News addresses are ARPANET: fox@vtopus.cs.vt.edu BITNET: foxea@vtvax3.bitnet
CSNET: fox@vt UUCPNET: seismo!vtisr1!irlistrq
----------------------------------------------------------------------
Date: Sun, 28 Jun 87 14:54:01 EDT
From: Michael Hawley <mike@MEDIA-LAB.MEDIA.MIT.EDU>
Subject: IR query
I'm looking for reasonable stemming algorithms -- one good one,
for English, to reduce a given word form to a canonical base form,
would be great. An inflection generator would also be wonderful
(something to cast a word in some other functional form,
e.g., plural, past tense, whatever).
Any leads appreciated -
Michael Hawley
mike@media-lab.mit.edu
[Note: I expect donna@nlm-vax.arpa is a good place to start. - Ed]
------------------------------
Date: Mon, 29 Jun 87 14:14:09 EDT
From: Bruce Nevin <bnevin@cch.bbn.com>
Subject: online HAI
Is the machine-readable text of the _Handbook of Artificial Intelligence_
available on line by ftp? I saw your mention of it in IRList 3.16
(last Friday's digest).
[Note: I have it online but had to obtain tapes after getting
permission of publisher and authors. Also, I am not yet on
ARPAnet (but am supposed to be in about a month!). - Ed]
------------------------------
Date: Thu, 4 Jun 87 11:51:16 edt
From: amsler@flash.bellcore.com (Robert Amsler)
Subject: representation of dictionary information
. . .
I am concerned now with the representation of dictionary information
by whomever wants to use dictionaries and in making sure that
whatever format is developed meets all users needs.
Personally, I am involved in correcting a lot of errors in the Seventh
Collegiate and improving its format for easier extraction of linguistic
data as well as extending the format to other dictionaries.
Generally, all formats tend to have more in common with each other than
with the original book--as long as they didn't discard information.
Thus, while two formats may look radically different, they tend to
be algorithmically derivable whereas the original work may lack
information and require extensive manual labor to get formatted.
So, I'd welcome news of your format.
[Note: We have put the Collins dictionary into a set of Prolog
relations. Alas, we have spent an enormous amount of time making
manual corrections, but the end is in sight! We (Martha Evens of IIT,
along with J. Terry Nutter and I at Virginia Tech) are starting a new
project soon to build an enormous semantic network from several
dictionaries merged together, with hopes that it will be of service to
many others, and would welcome comments from you and others regarding
how to "meet all users needs". - Ed]
Bob Amsler
------------------------------
Date: Sat, 13 Jun 87 16:35 EDT
From: Gabriel Robins <gabriel@vaxa.isi.edu>
Subject: The ISI Grapher
[Excerpted from NL-KR which in turn excerpted from AIList - Ed]
Greetings,
Due to the considerable interest drawn by the ISI Grapher so far, I am
posting this abstract summarizing its function and current status. Interested
parties may obtain further information by directly sending EMail to
"gabriel@vaxa.isi.edu" or by writing to:
Gabriel Robins
Intelligent Systems Division
Information Sciences Institute
4676 Admiralty Way
Marina Del Rey, Ca 90292-6695
If you want documentation in hardcopy, please include your U.S. Mail address.
Gabe
The ISI Grapher
June, 1987
Gabriel Robins
Intelligent Systems Division
Information Sciences Institute
The ISI Grapher is a set of functions that convert an arbitrary graph
structure (or relation) into an equivalent pictorial representation and
displays the resulting diagram. Nodes and edges in the graph become boxes and
lines on the workstation screen, and the user may then interact with the
Grapher in various ways via the mouse and the keyboard.
The fundamental motivation which gave birth to the ISI Grapher is the
observation that graphs are very basic and common structures, and the belief
that the ability to quickly display, manipulate, and browse through graphs may
greatly enhance the productivity of a researcher, both quantitatively and
qualitatively. This seems especially true in knowledge representation and
natural language research.
The ISI Grapher is both powerful and versatile, allowing an
application-builder to easily build other tools on top of it. The ISI NIKL
Browser is an example of one such tool. The salient features of the ISI
Grapher are its portability, speed, versatility, and extensibility. Several
additional applications were already built on top of the ISI Grapher,
providing the ability to graph lists, flavors, packages, divisors, functions,
and Common-Loops classes.
Several basic Grapher operations may be user-controlled via the specification
of alternate functions for performing these tasks. These operations include
the drawing of nodes and edges, the selection of fonts, the determination of
print-names, pretty-printing, and highlighting operations. Standard
definitions are already provided for these operations and are used by default
if the application-builder does not override them by specifying his own
custom-tailored functions for performing the same tasks.
The ISI Grapher now spans about 100 pages of CommonLisp code. The 120-page
ISI Grapher manual is available; this manual describes the general ideas, the
interface, the application-builder's back-end, the algorithms, the
implementation, and the data structures. The ISI Grapher presently runs on
both Symbolics (6 & 7) and TI Explorer workstations.
If you are interested in more information, the sources themselves, or just
the documentation/manual, please feel free to forward your U.S. Mail address to
"gabriel@vaxa.isi.edu" or write to "Gabriel Robins, c/o Information Sciences
Institute, 4676 Admiralty Way, Marina Del Rey, Ca 90292-6695."
------------------------------
Date: Tue 23 Jun 87 16:45:40
From: Roland Hjerppe <seismo!enea!liuida.UUCP!rhj>
Subject: Prel. Program Visual Languages 1987
CALL FOR PARTICIPATION
1987 WORKSHOP ON VISUAL LANGUAGES
August 19-21, 1987
Linkoping, Sweden
Program Declaration:
The workshop is concentrated on theory, methodology and applications
of visual languages, including languagaes that have a heavy visual
component as well as languages designed for operating on visual
objects.
Areas related to visual languages, such as: Man-Machine Interface,
Office Automation, Computer Hardware, Knowledge Based Systems are also
of interest if the visual language is in focus.
PRELIMINARY PROGRAM
Wednesday August 19, 1987
09.00 Welcome address
Sven Erlander
Rector of the University of Linkoping
09.20 Key-note-address
Werner Schneider, University of Uppsala
10.10 Coffee break
10.40 Session 1. Icon Formalization
Co-chairmen: S. K. Chang and Nan Shu
Icon Purity - Toward a Formal Theory of Icons
Shi-Kuo Chang, G. Tortora*, Bing Yu and A. Guercio*
University of Pittsburgh, *University of Salerno
Visual Representaion in the Game of Adumbration
Steven L. Tanimoto
University of Washington
Approach to Standardize Icons
K. Furuya, S. Tayama, E. Kutsuwada and K. Matsumura
Toshiba Corporation
12.10 Lunch
13.30 Session 2: Visual Programming
Co-chairmen: Clarence Ellis and Ch. Krysander
Animation of Algorithms without Programming
A. Hyrskykari and K.-J. Raiha
University of Tampere
Visual Programming of Program Visualizations
A Gestural Interface for Animating Algorithms
Robert Duisberg
Tektronix, Inc
Software Design Capture
Don Petersen
MCC
Generalized Halstead Metrics for Iconic Programming?
Ephraim P. Glinert and Craig D. Smith*
Rensselaer Polytechnic Institute, *AT & T Bell Labs
15.00 Coffee break
15.30 Session 3: Sheet Languages
Co-chairmen: E. Glinert and W. Schneider
A Spreadsheet-Based Visual Language for Freehand
Sketching of Complex Motions
J. Michael Moshell, Charles E. Huges, Lee Lacy, Rick Lewis
University of Central Florida and
David N. Blower
Naval Training Systems Center
Forms: Expanding the Visualness of Sheet Languages
Allen L. Ambler
University of Kansas
Description Based Icon Design
P. Mussio, M. Padula* and M. Protti
University of Milan, *C.N.R. S.I.A.M.
18.30 Cocktail Party at the CS Dept. of University of Linkoping
Thursday August 20 1987
09.00 Session 4: Applications
Co-chairmen: S. Levialdi and G. Borgefors
Animation Using Behaviour Functions
Timothy C. Lethbridge and Colin Ware
University of New Brunswick
An Extended Visual Programming Synthesizer for
Computer Aided Instruction Applications
K. Y. Cheng, M. S. Hwu and C. C. Hsu
National Taiwan University
Visual Programming of Graphical User Interfaces
Gurminder Singh and Mark Green
University of Alberta
10.15 Coffee break
10.45 Session 5: Information Retrieval Applications
Co-chairmen: Robert R. Korfhage and Roland Hjerppe
A Pictorial Representation of Data in an
Information Retrieval Environment
Donald B. Crouch
Tulane University
A Graphical Tool for Structuring and Understanding
Quantiative Decision Models
Charles Wiecha and Max Henrion
Carnegie-Mellon University
QPF - A Versatile Query Language Based on ADTS
Tao Chen and Jian-Kang Wu
University of Science and Technology of China
Methodologies and Applications of Visual languages for
Information Services
S. C. Chan, I. F. Chang, T. S. Chua, K. C. Chu,
A. B. H. Kang, K. C. Kwok, C. K. Law, J. L. Lim,
K. T. Loh, H. B. Low, A. D. Narasimhalu,
T. M. Ng, and W. H. Wong,
National University of Singapore
12.15 Lunch
13.30 Session 6: Panel: Visual Grammars: Consistency and Desirability
Chairman and Moderator: Erland Jungert
National Defence Research Institute, Sweden
Panelists:
S. K. Chang, Univ. of Pittsburg
S. L. Tanimoto, Univ. of Washington
M. Tauber, Univ. of Paderborn
14.45 Coffee break
15.15 Session 7: Visual Data Structures
Co-chairmen: Tadao Ichikawa and G. Tortora
Specification of Visual Representations of Petri Nets
A. T. Berztiss
University of Pittsburgh
A Rapid Prototyping of Real-Time Software Using Petri Nets
Tadashi Ae and Reiji Aibara
University of Hiroshima
A Visual Programming Environment for Hierarchical
Data Structures
Sandra Loosemore
University of Utah
18.00 Buses from Ekoxen and Stora Hotellet depart
for the Conference dinnner.
Friday August 21
09.00 Session 8: Panel on Visual Human-Machine Interfaces
Chairman and Moderator Stefano Levialdi
University of Rome
10.30 Coffee break
11.00 Session 9: Visual Languages and Systems
Co-chairmen: Steven L. Tanimoto and T. Ae
From Modern Alchemy to a New Renaissance
Kim Fairchild and Eric Gullichsen
MCC
Simulacrum: A System Behavior Example Editor
David Bridgeland
MCC
Icon Driven Troubleshooting
L. Cinque, M. Crisplodi and S. Levialdi*
SELENIA s.p.a. *University of Rome
Visual Specification of Security Constraints
J. D. Tygar and Jeannette M. Wing
Carnegie Mellon University
12.30 Lunch
14.00 Session 10: Visual Programming Languages
Co-chairmen: P. Mussio and S. Hagglund
An Environment for HI-VISUAL Iconic Programming
M. Hirakawa, S. Iwata, I. Yosimoto, M. Tanaka and T. Ichikawa
University of Hiroshima
ALEX - An Alexical Programming Language
D. Kozen, T. Teitelbaum, W. Chen,
J. Field, W. Pugh and B. Vander Zanden
Cornell University
A Visual Environment for the Design of Distributed Systems
Michael Graf
MCC
15.30 Closing session
CONFERENCE ORGANISATION
Sponsors:
Univ. of Linkoping, Dept. of Computer and Information Science
Univ. of Pittsburg, Dept. of Information Science
In cooperation with:
IEEE-CS
With support from:
FOA3, National Defense Research Institute, Linkoping
FFV Elektronik AB, Linkoping
SSI, Swedish Society for Information Processing,
Local Chapter of Linkoping
Conference Chairman:
Prof. Robert Korfhage, Dept. of Information Science,
Univ. of Pittsburg, Pittsburg, PA 15260, U.S.A.
Program Chairman:
Erland Jungert, FOA3, Box 1165, S-581 11 Linkoping Sweden
Organizers:
Roland Hjerppe, Christian Krysander, Dept. of Computer and Information
Science, Univ. of Linkoping, S-581 83 Linkoping, Sweden
UUCP:RHJ@LIUIDA, ARPA:RHJ%LIUIDA.UUCP@SEISMO
Conference Secretary:
Ingrid Nyman, Telephone +46 13 281148 (not during July)
ADVANCE REGISTRATION FORM, VisLang87
Aug. 19-21, 1987
Linkoping, SWEDEN
Name:
Company/Organisation:
Address:
City/State/ZIP:
Country:
**************************************************************************
WORKSHOP FEE
Workshop fee including proceedings, refreshments and banquet.
Early registration before June 25, 1987 SEK 1700/person ...............
Registration from June 25, 1987 SEK 2100/person ...............
(IEEE-CS members will receive repayment of SEK 65.00 ($10.00) at
registration)
Please note that the number of delegates are limited.
HOTEL RESERVATION
Hotel reservations and payment should be received before June 25, 1987,
otherwise hotel room cannot be guaranteed.
Please reserve for me/us from August ..... to August .....
Hotel Ekoxen single room SEK 730/night ......
double room SEK 880/night ......
Stora Hotellet single room SEK 625/night ......
double room SEK 725/night ......
Baltic Hotel single room SEK 550/night ......
double room SEK 680/night ......
Total Hotel cost .......
Grand Total (Fee + Hotel) SEK ...............
Please enclose a commercial check made payable to VisLang 87,
Linkoping University, SWEDEN.
Send to:
Workshop on Visual Language
Ingrid Nyman
Center of Technology Transfer
Linkoping University
S-581 83 Linkoping
SWEDEN
Welcome!
------------------------------
END OF IRList Digest
********************
