Copy Link
Add to Bookmark
Report
AIList Digest Volume 4 Issue 097
AIList Digest Tuesday, 22 Apr 1986 Volume 4 : Issue 97
Today's Topics:
Bibliography - Recent Articles #7
----------------------------------------------------------------------
Date: WED, 10 JAN 84 17:02:23 CDT
From: E1AR0002%SMUVM1.BITNET@WISCVM.WISC.EDU
Subject: Recent Articles #7
%A H. Bernstein
%T Determining the Shape of a Convex n-sided Polygon by Using 2n+k Tactile
Probes
%R 125 R29
%D JUN 1984
%I New York University, Courant Institute, Department of Computer
Sciences
%K AI07 AI06
%A A. Tuzhilin
%A P. Spirakis
%T A Semantic Approach to Correctness of Concurrent Executions
%R 130
%D JUL 1984
%I New York University, Courant Institute, Department of Computer
Sciences
%K AA08
%A E. Davis
%T Shape and Function of Solid objects: Some Examples
%R 137
%D OCT 1984
%I New York University, Courant Institute, Department of Computer
Sciences
%A C. O'Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi Diagrams for Moving a Ladder: I Topological
Analysis
%R 139 R32
%D NOV 1984
%I New York University, Courant Institute, Department of Computer
Sciences
%A C. O Dunlaing
%A M. Sharir
%A C. Yap
%T Generalized Vornoi Diagrams for Moving a Ladder: II Efficient
Construction of the Diagram
%D NOV 1984
%R 140 R33
%I New York University, Courant Institute, Department of Computer
Sciences
%A M. Bastuscheck
%T Look Up Table Computation for A Ratio Image Depth Sensor
%R 141 R34
%D NOV 1984
%I New York University, Courant Institute, Department of Computer
Sciences
%A J. Schwartz
%A M. Sharir
%A A. Siegel
%T An Efficient Algorithm for Finding Connected Components of a Binary
Image
%R 154 R38
%D FEB 1985
%I New York University, Courant Institute, Department of Computer
Sciences
%K AI06
%A D. Cantone
%A A. Ferro
%A J. Schwartz
%T Decision Procedures for Elementary Sublanguages of Set Theory VI.
Multi-Level Syllogistic Extended by the Power Set Operator
%R 156
%D FEB 1985
%I New York University, Courant Institute, Department of Computer
Sciences
%K AI11
%A E. Kishon
%A X. D. Yang
%T A Video Camera Interface for High Speed Region Boundary Locations
%R 157 R40
%D FEB 1985
%I New York University, Courant Institute, Department of Computer
Sciences
%K AI06
%R 13
%A N. V. Findler
%A H. Klein
%A W. Gould
%A A. Kowal
%A J. Menig
%T (1) Studies on decision making using the game of poker;
(2) Computer experiments on the formation and optimization
of heuristic rules
%I Suny Buffalo Computer Science
%R 14
%A N. V. Findler
%A D. Chen
%T On the problems of time, retrieval of temporal
relations, causality and co-existence
%I Suny Buffalo Computer Science
%R 15
%A G. T. Herman
%A J. A. Jackowski
%T A decision procedure using discrete geometry
%I Suny Buffalo Computer Science
%K AI14
%R 20
%A N. V. Findler
%T Short note on a heuristic search strategy
%I Suny Buffalo Computer Science
%K AI03
%A N. V. Findler
%T Heuristic programmers and their gambling machines
%A H. Klein
%A A. Kowal
%A Z. Levine
%A J. Menig
%I SUNY Buffalo Computer Science
%K AI03
%R 72
%A G. T. Herman
%T A decision procedure using the geometry of convex sets
%A P. W. Aitchison
%I SUNY Buffalo Computer Science
%K AI14
%R 84
%A G. T. Herman
%A A. V. Lakshminarayanan
%A S. W. Rowland
%T The reconstruction of objects from shadowgraphs
with high contrasts
%D August 1974
%I SUNY Buffalo Computer Science
%K AI06
%R 91
%A G. T. Herman
%A A. Lent
%T A computer implementation of a Bayesian analysis of image
reconstruction
%D January 1975
%I SUNY Buffalo Computer Science
%K AI06
%R 92
%A A. V. Lakshminarayanan
%T Reconstruction from divergent ray data
%D January 1975
%I SUNY Buffalo Computer Science
%K AI06
%R 93
%T Iterative relaxation methods for image reconstruction
%A G. T. Herman
%A A. Lent
%A P. H. Lutz
%D July 1975
%I SUNY Buffalo Computer Science
%K AI06
%R 99
%A N. V. Findler
%T Studies in machine cognition using the game of Poker
%D June 1975
%I SUNY Buffalo Computer Science
%K AA17
%X A progress report is presented of our on-going research efforts
concerning human decision making under uncertainty and risk,
human problem solving and learning processes, on one hand,
and machine learning, large scale programming systems
and novel programming techniques, on the other.
%R 103
%A G. T. Herman
%T Quadratic optimization for image reconstruction, Part I
%A A. Lent
%I SUNY Buffalo Computer Science
%K AI06
%R 104
%A P. H. Lutz
%T Fourier image reconstruction incorporating
three simple interpolation techniques
%I SUNY Buffalo Computer Science
%K AI06
%R 110
%A T. L. Roy
%T A contribution to the Poker Project: The
development of and experience with a
Statistically Fair Player
%D May 1976
%I SUNY Buffalo Computer Science
%K AA17
%X This paper is a report on my efforts over the past
several months, in the development of a Player Function
for the Poker System, called the Statistically Fair Player.
%R 111
%A J. N. Shaw
%T Multi-Pierre, a learning robot system
%D May 1976
%I SUNY Buffalo Computer Science
%K AI07
%X The goal of this project is to simulate several robots
under partial human control,
and operating in a lifelike'' environment.
The robots have an overall goal of survival and an instinct''
to explore their environment.
The project is an extension of an existing system
which has a single organism functioning in a similar environment.
The environment consists of a flat terrain,
populated with three-dimensional objects of varying types,
sizes and shapes.
%R 115
%A T. W. Chen
%A N. V. Findler
%T Toward analogical reasoning in problem
solving by computers
%D December 1976
%K AA17
%I SUNY Buffalo Computer Science
%X We attempt in the present paper
to investigate Analogical
Reasoning (AR) detached from specific tasks and to formulate
its general principles so that it may become a component of
problem solving programs as much as the means-ends analysis
has been shown to be one in the literature on GPS.
%R 119
%A S. C. Shapiro
%T A Scrabble crossword game playing program
%I SUNY Buffalo Computer Science
%K AA17
%R 127
%A J. K. Cipolaro
%A N. V. Findler
%T MARSHA, the daughter of ELIZA \- a simple
program for information retrieval in
natural language
%I SUNY Buffalo Computer Science
%K AA02 AA14
%R 130
%T SNARK77: A programming system for the reconstruction
of pictures from projections
%A G. T. Herman
%A S. W. Rowland
%D January 1978
%I SUNY Buffalo Computer Science
%K AI06
%R 134
%T On the Bayesian approach to image reconstruction
%A G. T. Herman
%A H. Hurwitz
%A A. Lent
%A H. P. Lung
%D June 1978
%I SUNY Buffalo Computer Science
%K AI06
%R 141
%A N. V. Findler
%T A heuristic information retrievalsystem based on
associative networks
%D February 1978
%I SUNY Buffalo Computer Science
%K AI12 AA14
%R 145
%A E. Artzy
%T Boundary detection of internal organs in mini-computers
%I SUNY Buffalo Computer Science
%K AI06 AA01
%R 147
%A S. N. Srihari
%T On choosing measurements for invariant pattern recognition
%D September 1978
%I SUNY Buffalo Computer Science
%K AI06
%R 152
%A J. Case
%A S. Ngo\ Manuelle
%T Refinements of inductive inference
by Popperian machines
%I SUNY Buffalo Computer Science
%K AI04
%R 154
%A J. Case
%A C. H. Smith
%T Comparison of identification criteria
for mechanized inductive inference
%I SUNY Buffalo Computer Science
%K AI04
%R 155
%A C. H. Smith
%T Finite covers of inductive inference machines
%I SUNY Buffalo Computer Science
%K AI04
%R 164
%A D. P. McKay
%A S. C. Shapiro
%T MULTI \- a Lisp based multiprocessing system
%I SUNY Buffalo Computer Science
%K H03 T01
%R 169
%A E. M. Gurari
%A H. Wechsler
%T On the difficulties involved in the
segmentation of pictures
%I SUNY Buffalo Computer Science
%K AI0
%R 170
%A M. M. Yau
%A S. N. Srihari
%T Recursive generation of hierarchical
data structures for multidimensional digital images
%I SUNY Buffalo Computer Science
%K AI06
%R 171
%A A. S. Maida
%A S. C. Shapiro
%T Intensional concepts in propositional semantic networks
%I SUNY Buffalo Computer Science
%R 172
%A S. N. Srihari
%A J. J. Hull
%A R. Bo\o'z\(hc'inovi\o'c\(aa'
%T Representation of contextual knowledge
in word recognition
%I SUNY Buffalo Computer Science
%K AI02
%R 173
%A S. C. Shapiro
%T COCCI: a deductive semantic network
program for solving microbiology unknowns
%I SUNY Buffalo Computer Science
%K AA10
%R 174
%A J. E. S. P. Martins
%A D. P. McKay
%A S. C. Shapiro
%T Bi-directional inference
%I SUNY Buffalo Computer Science
%R 175
%A J. E. S. P. Martins
%A S. C. Shapiro
%T A belief revision system based on relevance
logic and heterarchical contexts
%I SUNY Buffalo Computer Science
%R 177
%A S. N. Srihari
%A M. E. Jernigan
%T Pattern recognition
%I SUNY Buffalo Computer Science
%K AI06
%R 178
%A K. J. Chen
%T Tradeoffs in machine inductive inference
%I SUNY Buffalo Computer Science
%K AI04
%R 179
%A J. G. Neal
%T A knowledge engineering approach to natural language understanding
%I SUNY Buffalo Computer Science
%K AI02
%R 183
%A R. K. Srihari
%T Combining path-based and node-based inference in SNePS
%I SUNY Buffalo Computer Science
%R 184
%A S. N. Srihari
%A J. J. Hull
%T Experiments in text recognition with binary
\fIn\fP-gram and Viterbi algorithms
%I SUNY Buffalo Computer Science
%R 186
%A H. Shubin
%T Inference and control in multiprocessing environments
%I SUNY Buffalo Computer Science
%K H03
%R 187
%A N. V. Findler
%T A preliminary report on a multi-level learning technique
using production systems
%I SUNY Buffalo Computer Science
%K AI04 AI01
%R 188
%A N. V. Findler
%A E. J. M. Morgado
%T Morph-fitting \- an effective technique of approximation
%I SUNY Buffalo Computer Science
%K AI02
%R 189
%A N. V. Findler
%A N. M. Mazur
%A B. B. McCall
%T A note on computing the asymptotic form of
a limited sequence of decision trees
%I SUNY Buffalo Computer Science
%R 190
%A N. V. Findler
%A J. E. Brown
%A R. Lo
%A H. Y. You
%T A module to estimate numerical values of
hidden variables for expert systems
%I SUNY Buffalo Computer Science
%K AI01
%R 192
%A S. N. Srihari
%A J. J. Hull
%A R. Choudhari
%T An algorithm for integrating
diverse knowledge sources in text recognition
%I SUNY Buffalo Computer Science
%K AI06
%R 193
%A G. L. Sicherman
%T The Advice-Taker/Inquirer
%I SUNY Buffalo Computer Science
%R 194
%A N. V. Findler
%T Toward a theory of strategies
%I SUNY Buffalo Computer Science
%R 195
%A S. Moriya
%T An algebraic structure theory
of rule sets, I: a formalization
of both production systems and decision tables
%I SUNY Buffalo Computer Science
%R 196
%A N. V. Findler
%T An overview of the Quasi-Optimizer system
%I SUNY Buffalo Computer Science
%R 197
%A N. V. Findler
%A G. L. Sicherman
%A B. B. McCall
%T A multi-strategy gaming environment
%I SUNY Buffalo Computer Science
%R 198
%A L. M. Tranchell
%T A SNePS implementation of KL-ONE
%I SUNY Buffalo Computer Science
%R 199
%A M. M. Yau
%T Generating quadtrees of cross-sections from octrees
%I SUNY Buffalo Computer Science
%R 202
%A G. L. Sicherman
%T Parsley 1.1: A general text parser in LISP
%D April 1983
%I SUNY Buffalo Computer Science
%X T01 AI02
%R 203
%A J. E. S. P. Martins
%D May 1983
%T Reasoning in multiple belief spaces
%I SUNY Buffalo Computer Science
%R 204
%A J. T. Nutter
%D October 1983
%T Default reasoning in A.I. systems
%I SUNY Buffalo Computer Science
%R 206
%A P. F. Kung
%A S. L. Hardt
%T Understanding `Circuit Stories;' or,
Using Micro PAM to explain VLSI systems
%D December 1983
%I SUNY Buffalo Computer Science
%K AA04
%R 207
%T Grinlib \- Grinnell graphics in Lisp
%A P. Schlossman
%A S. L. Hardt
%D 1983
%K T01
%R 208
%T Correcting and translating ill-formed ship messages
%A J. Rosenberg
%A M. E. Haefner
%A S. L. Hardt
%D January 1984
%I SUNY Buffalo Computer Science
%R 209
%T A step towards a friendly psychiatric diagnosis tool
%A P. Schlossman
%A G. K. Phillips
%A S. L. Hardt
%D April 1984
%I SUNY Buffalo Computer Science
%K AA01
%R 210
%T Developing a knowledge-based psychiatric
diagnostic tool: The investigation of opportunistic processing
%A M. E. Haefner
%A S. L. Hardt
%D February 1984
%I SUNY Buffalo Computer Science
%K AA01
%R 211
%T Naive physics and the physics of diffusion; or, When intuition fails
%A S. L. Hardt
%D June 1984
%I SUNY Buffalo Computer Science
%X AA16
%R 212
%T From CD to mandarin Chinese: The language generation project
%A M. Y. Lo
%A S. L. Hardt
%D August 1984
%I SUNY Buffalo Computer Science
%X The investigation reported here is centered on
the development of the Chinese language generator, SINO-MUMBLES.
This natural language generator takes as input a CD expression
and expresses its meaning in Mandarin Chinese.
The program is based on the English generator, MICRO-MUMBLE
and on an earlier version of the Chinese generator developed
in our project.
%R 213
%T Knowledge based parsing
%A J. G. Neal
%A S. C. Shapiro
%D May 1984
%I SUNY Buffalo Computer Science
%K AI02
%X An extremely significant feature of any Natural Language (NL)
is that it is its own meta-language.
One can use a NL to talk about the NL itself.
One can use a NL to tutor a non-native speaker, or other poor
language user, in the use of the same NL.
We have been exploring methods of knowledge
representation and NL Understanding (NLU) which would allow an
Artificial Intelligence (AI) system to play the role of
poor language user in this setting.
The AI system would have to understand NL utterances about how
the NL is used, and improve its NLU abilities according to this
instruction.
It would be an NLU system for which the domain being discusses
in NL is the NL itself.
%R 214
%T Optical character recognition
techniques in mail sorting: A review of algorithms
%A J. J. Hull
%A G. Krishnan
%A P. W. Palumbo
%A S. N. Srihari
%D June 1984
%I SUNY Buffalo Computer Science
%K AI06
%X A study of Optical Character Recognition
(OCR) techniques employed in automatic mail sorting equipment
is presented.
Methods and algorithms for image preprocessing,
character recognition, and contextual postprocessing
are discussed and compared.
The objective of this study is to provide a background
in the state-of-the-art of this equipment
as the first element in a search for techniques
to significantly improve the capabilites of postal address recognition.
%R 215
%T Belief representation and quasi-indicators
%A W. J. Rapaport
%D August 1984
%I SUNY Buffalo Computer Science
%K AI02
%X This thesis is a study in knowledge'' representation,
specifically, how to represent beliefs expressed by
sentences containing quasi-indicators.
An \fIindicator\fP is a personal or demonstrative pronoun
or adverb used to make a strictly demonstrative reference.
A \fIquasi-indicator\fP is an expression that occurs within
an intentional context and that represents a use of an indicator
by another speaker.
E.g., if John says, I am rich,'' then if \fIwe\fP say,
John believes that he himself is rich,'' our use of `he himself'
is quasi-indexical.
Quasi-indicators pose problems for natural-language
question-answering systems, since they cannot be
replaced by any co-referential noun phrases without changing
the meaning of the embedding sentence.
Therefore, the referent of the quasi-indicator must be represented
in such a way that no ivnalid co-referential claims are entailed.
%R 216
%T Searle's experiments with thought
%A W. J. Rapaport
%D November 1984
%I SUNY Buffalo Computer Science
%X A critique of several recent objections to John Searle's
Chinese Room argument against the possibility of strong AI
is presented.
The objections are found to miss the point,
and a stronger argument against Searle is presented,
based on a distinction between syntactic and semantic
understanding.
%R 217
%T Review of Lambert's \fIMeinong and the
Principle of Independence\fP
%A W. J. Rapaport
%D November 1984
%I SUNY Buffalo Computer Science
%K AI08
%X This is a critical study of Karel Lambert's
\fIMeinong and the Principle of Independence.\fP
Alexius Meinong was a turn-of-the-century philosopher
and psychologist who played a role in the early development
of analytic philosophy, phenomenology, and Gestalt psychology.
His theory of objects has become of increasing relevance
to intensionally-based semantics and, hence, ought to be
of interest to AI researchers in the field of knowledge
representation.
Lambert's book explores the relevance of Meinong's theory
to free logics.
%R 85-01
%T Recognition of off-line cursive handwriting:
A case of multi-level machine perception
%A R. M. Bo\o'z\(hc'inovi\o'c\(aa'
%D March 1985
%I SUNY Buffalo Computer Science
%K AI06
%X Cursive script recognition by computer (CSR)
is the problem of transforming language from
the form of cursive human handwriting to one of digital
text representation.
Off-line CSR involves elements of computer vision
at a low level of processing
andk those of language perception and understanding at
a higher level.
The problem is approached in this work
as a multi-level machine perception problem
in which an image of a cursive script word is transformed
through a hierarchy of representation levels.
Four distinct levels are employed,
based on descriptions that use pixels, chain codes, features
and letters, before the final
word level of representation is obtained.
%R 85-05
%A P. B. Van\ Verth
%T A system for automatic program grading
%D May 1985
%I SUNY Buffalo Computer Science
%K AA08 AA07
%X This doctoral dissertation presents an automated
system for grading program quality based upon a mathematical model
of program quality.
Our research investigates whether such a system
will perform at least as well as, and perhaps even do better than,
human graders.
%R 85-06
%A J. G. Neal
%T A knowledge-based approach to natural language understanding
%D May 1985
%I SUNY Buffalo Computer Science
%K AI01 AI02
%X In this thesis we present a language processing expert system
that we have implemented in the role of an educable cognitive
agent whose domain of expertise is language understanding
and whose discourse domain includes its own language knowledge.
We present a representation of language processing knowledge
and a core of knowledge, including a Kernel Language, which forms
the knowledge base for this AI system.
%R 85-07
%A S. L. Hardt
%A J. Rosenberg
%A M. E. Haefner
%A K. S. Arora
%T The three ERIK\-AMVER progress reports
%D July 1985
%I SUNY Buffalo Computer Science
%K AA18
%X This is a collection of three progress reports
submitted by our group
to the U. S. Coast Guard.
The reports chart the development of the ERIK
(Evaluating Reports using Integrated Knowledge) system.
The systems design and implementation were orchestrated
by Jay Rosenberg.
The final report as well as the manuals for the system
can be found elsewhere.
%R 85-08
%A S. L. Hardt
%A J. Rosenberg
%T The ERIK project: Final report and manuals
%D July 1985
%I SUNY Buffalo Computer Science
%K AA18 H02
%X The ERIK system is a computer program
that was developed to interpret ship reports for the
United States Coast Guard.
The system is now completed an installed in the Coast Guard's
AMVER Center on Governors Island.
It was running in a testing mode on a dedicated DEC VAX-11/730
system running VMS, from February to June 1985.
The final system will be running on a Symbolics Lisp Machine
in July 1985.
This report provides a brief description of the project, the system,
and user manuals.
The latter contains a detailed description of the theory
behind the system and the necessary
implementation and maintenance information.
%A S. N. Srihari
%A J. J. Hull
%A P. W. Palumbo
%A D. Niyogi
%A C. H. Wang
%T Address recognition techniques in mail sorting:
Research directions
%R 85-09
%D August 1985
%I SUNY Buffalo Computer Science
%K AI06 AI02
%X This report is a discussion of techniques of computer vision,
pattern recognition, and language processing
relevant to the problem of mail sorting as well as a presentation of the
results of preliminary experiments with several new techniques applied
to letter mail images.
------------------------------
End of AIList Digest
********************
