techreports-request@ut-sally.uucp (03/20/86)
From: ti-csl!smu!leff@im4u.UUCP (Laurence Leff) SUNY-Buffalo Computer Sci. TRs %R 1 %A R. H. Eckhouse,\ Jr. %T A high-level microprogramming language (MPL) %R 2 %A G. T. Herman %T Every finite sequential machine is linearly realizable %R 3 %A R. W. Baker %A G. T. Herman %T Simulation of organisms using a developmental model, I: basic description and an application to blue-green algae %R 4 %A Z. K. Mao %T Second-degree harmonic interpolation formulas with three points in two dimensions %R 5 %A R. F. Rosin %A G. Frieder %A R. H. Eckhouse,\ Jr. %T An environment for research in microprogramming and emulation %R 6 %A B. D. Shriver %T Interpolation formulas of Gauss type for approximate solution of the \fIn\fP-dimensional heat equation %R 7 %A G. T. Herman %T Closure properties of some families of languages associated with biological systems %R 8 %A H. Feliciangeli %A G. T. Herman %T Algorithms for producing grammars from sample derivations: a common problem of formal language theory and developmental biology %R 9 %A J. D. Wexler %T Generative teaching systems and data structures %R 10 %A G. T. Herman %T Models for cellular interactions in development without polarity of individual cells, II: Problems of synchronization and regulation %R 11 %A L. M. Uhler,\ Jr. %T Piecewise approximation for a fixed number of curve segments %R 12 %A R. Snyder %T A linking loader in a non-incrementing paged environment: an example in control store %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 %R 14 %A N. V. Findler %A D. Chen %T On the problems of time, retrieval of temporal relations, causality and co-existence %R 15 %A G. T. Herman %A J. A. Jackowski %T A decision procedure using discrete geometry %R 16 %A G. Frieder %T A procedural definition of emulation %R 17 %A A. E. C. Allan %A N. V. Findler %T Studies on the behavior of an organism in a hostile environment %R 18 %A B. O. Nash %T Reachability problems in vector addition systems %R 19 %A S. J. Cohen %T A virtual memory facility for emulation %R 20 %A N. V. Findler %T Short note on a heuristic search strategy in long-term memory networks %R 21 %A R. F. Rosin %A G. Frieder %T The role of microprogramming in the computer science curriculum %R 22 %A G. Rozenberg %T T0L systems and languages %R 23 %A G. T. Herman %A K. P. Lee %A J. van Leeuwen %A G. Rozenberg %T Unary developmental systems and languages %R 24 %A G. Rozenberg %T The equivalence problem for deterministic T0L-systems is undecidable %R 25 %A J. Mazur %A W. B. Gould %A R. T. Ahola %T GAME-1 specifications, user's guide and logic manual %R 26 %A G. T. Herman %T The syntactic inference problem as applied to biological systems %R 27 %A A. Walker %T An approach to English-language input for the time system of Findler and Chen %R 28 %A G. Rozenberg %T L-system with interactions: the hierarchy %R 29 %A G. Rozenberg %T Propagating L-systems with interactions %R 30 %A C. Luk %T Balanced ternary arithmetic via microprogramming %R 31 %A M. Lutz %A M. Manthey %T An overview of the Buffalo Stack Machine architecture %R 32 %A G. Frieder %T Ternary computers: why and how %R 33 %A M. Lutz %A M. Manthey %T A microprogrammed implementation of a block structured architecture %R 34 %A G. Frieder %A C. Luk %T Emulation of a balanced ternary arithmetic unit %R 35 %A G. Rozenberg %T D0L sequences %R 36 %A J. K. Rachlin %T A proposed scheme of microdiagnostics for a microprogrammed computer %R 37 %A G. Rozenberg %T Circularities in D0L sequences %R 38 %A R. F. Rosin %T Teaching \*(lqabout programming\*(rq %R 39 %A R. Dorin %T A viable host machine for research in emulation %R 40 %T <withdrawn> %R 41 %A G. T. Herman %T Characterization of unary developmental languages %A K. P. Lee %A J. van Leeuwen %A G. Rozenberg %R 42 %A G. T. Herman %T A biologically motivated extension of Algol-like languages %R 43 %A G. Rozenberg %T Some properties of the class of L-languages with interactions %R 44 %A G. Rozenberg %T Direct proofs of the undecidability of the equivalence problem %R 45 %A G. T. Herman %A A. Lent %A S. W. Rowland %T ART: mathematics and applications (a report on the mathematical foundations and on the applicability to real data of the algebraic reconstruction technique) %R 46 %A G. T. Herman %A H. K. Liu %T Daughter of CELIA %R 47 %A G. T. Herman %T On universal computer-constructors %R 48 %A G. Rozenberg %T Developmental systems of finite axiom sets, I %A K. P. Lee %R 49 %A G. Rozenberg %T Developmental systems of finite axiom sets, II %A K. P. Lee %R 50 %A G. Rozenberg %T On a machine model for developmental systems without interactions %R 51 %A S. W. Rowland %T SNARK, a general picture reconstruction framework %R 52 %A G. T. Herman %T Description of developmental languages using recurrence systems %A A. Lindenmayer %A G. Rozenberg %R 53 %A G. Rozenberg %T Extension of tabled 0C-systems and languages %R 54 %A G. T. Herman %T Three methods for reconstructing objects from X-rays: A comparative study %A S. W. Rowland %R 55 %A C. C. Wang %T On the chromatic number of a graph %R 56 %A G. T. Herman %T Abstract computing machines %R 57 %A C. C. Wang %T Note on the uniquely colorable graphs %A E. Artzy %R 58 %A E. Artzy %T K-base graphs and the Ramsey numbers \fIN\fP(3,\fIk\fP;2) %R 59 %A A. Bauer %T Does APL really need run-time checking? %A H. Saal %R 60 %A G. T. Herman %T Context-free languages in biological systems %A A. Walker %R 61 %A H. Saal %T A fast division technique for constant divisors %A E. Artzy %A J. A. Hinds %R 62 %A C. P. Huang %T Global convergence of the QR algorithm for normal matrices with various shifts and a Jacobi-type method for finding eigenvalues of an arbitrary matrix %R 63 %A G. T. Herman %T A relaxation method for reconstructing objects from noisy X-rays %R 64 %A W. H. Firestone %T FLUBbing on the Burroughs B1700 %R 65 %A N. V. Findler %T Heuristic programmers and their gambling machines %A H. Klein %A A. Kowal %A Z. Levine %A J. Menig %R 66 %A J. D. Wexler %T A design for describing (elementary) programming problem generators in an automatic teaching system %R 67 %A J. van Leeuwen %T An improved bound for detecting looping configurations in deterministic PDAs %A C. H. Smith %R 68 %A J. Case %T Effectively extending the set of acceptable inputs of programs %R 69 %A J. Case %T Sortability and extensibility of the graphs of r.e. partial and total orders %R 70 %A J. Case %T Enumeration-maximal r.e. sets %R 71 %A J. van Leeuwen %T A generalization of Parikh's Theorem in formal language theory %R 72 %A G. T. Herman %T A decision procedure using the geometry of convex sets %A P. W. Aitchison %R 73 %A L. D. Wittie %T A digital computer system for large brain cortex models %R 74 %A J. A. Hinds A design for the buddy system with arbitrary sequences of block sizes %R 75 %A G. T. Herman %T Simulation of organisms based on L-systems %A G. L. Schiff %R 76 %A A. Walker %T A queueing simulator in SLIP for a time-sharing computer %R 77 %A T. Furugori %T A memory model and simulation of memory processes for driving a car %R 78 %A N. V. Findler %A H. Viil %T A few steps towards computer lexicometry %D May 1974 %R 79 %A P. M. B. Vitanyi %T Stable string languages of Lindenmayer systems %A A. Walker %D May 1974 %R 80 %A P. J. Eberlein %T On the minimum number of comparisons necessary to find the median of \fIn\fR elements %D December 1973 %R 81 %A R. A. Belgard %D June 1974 %T An implementation of BLAISE on the Burroughs B1726 %R 82 %A G. T. Herman %A P. M. B. Vitanyi %D July 1974 %T Growth functions associated with biological development %R 83 %A J. Case %D July 1974 %T Pseudo-extensions of computable functions and making programs well-behaved on unintended inputs %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 %R 85 %A A. Walker %T Formal grammars and the stability of biological systems %D September 1974 %R 86 %T Computational complexity of r.e. total orders %A D. Moore %A J. Case %D September 1974 %R 87 %T The structures of the network definition language Nedlan; its use in defining networks in CAD using interactive computer graphics %A N. Marova\o'c\(aa' %D October 1974 %R 88 %A G. T. Herman %A A. Walker %D January 1975 %T On the stability of some biological schemes with cellular interactions %R 89 %A C. H. Smith %A L. D. Wittie %T Memory hardware for high speed job selection %D December 1974 %R 90 %T DESIGNART: Design and art; some ideas in computer aided 3D design and art %A N. Marovac %D December 1974 %R 91 %A G. T. Herman %A A. Lent %T A computer implementation of a Bayesian analysis of image reconstruction %D January 1975 %R 92 %A A. V. Lakshminarayanan %T Reconstruction from divergent ray data %D January 1975 %R 93 %T Iterative relaxation methods for image reconstruction %A G. T. Herman %A A. Lent %A P. H. Lutz %D July 1975 %R 94 %A J. Case %T Operator speed-up for universal machines %D April 1975 %R 95 %A A. V. Lakshminarayanan %A A. Lent %T Methods of least squares and SIRT in reconstruction %D July 1975 %R 96 %T SNARK75: A programming system for the reconstruction of objects from shadowgraphs %A G. T. Herman %A J. A. Hinds %A R. W. Peretti %A S. W. Rowland %D June 1975 %R 97 %T The computer implementation of three versions of the Radon Inversion Formula %A S. W. Rowland %D July 1975 %R 98 %T <withdrawn> %R 99 %A N. V. Findler %T Studies in machine cognition using the game of Poker %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. %D June 1975 %R 100 %A P. H. Lutz %T The BLAISE translator %A T. J. Mathieu %A R. W. Peretti %R 100 %A T. J. Mathieu %T The BLAISE translator (revised) %A P. H. Lutz %D December 1976 %X The purpose of this paper is to report on the BLAISE compiler project at the State University of New York at Buffalo. The task undertaken was to produce a translator from the BLAISE general purpose programming language to the BOLLIX assembly language for the BLAISE machine. %R 101 %A N. Marovac %T Theory and practice of network-oriented relational information base structure %D July 1975 %X This paper presents a view on some general structural quantitative and qualitative properties of networks, and illustrates how this view was transported to the organization of the information structure. %R 102 %A L. D. Wittie %T Communications in hierarchical mega-micro-computer networks %R 103 %A G. T. Herman %T Quadratic optimization for image reconstruction, Part I %A A. Lent %R 104 %A P. H. Lutz %T Fourier image reconstruction incorporating three simple interpolation techniques %R 105 %A L. D. Wittie %T Efficient message routing in mega-micro-computer networks %R 106 %A N. Gehani %T Units of measure: A new data attribute %R 107 %A A. Ralston %A J. Wagener %T Structured Fortran \- An evolution of standard Fortran %R 108 %A J. van Leeuwen %T One-way machines using a checking stack %R 109 %A L. D. Wittie %T A multi-micro computer communications switch %D October 1976 %X The MIcro-Computer Switch (MICS) forms the center of a star network of computing equipment in a research laboratory. The two processor version of MICS supports simultaneous duplex communications among 24 devices with a total throughput of 2700 bytes/second. It costs $4000. %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 %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 %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 112 %A J. van Leeuwen %T Re languages and Van Wijngaarden grammars %R 113 %A W. Stratton %T The development of data management systems %R 114 %A L. D. Wittie %T Resource utilization in a multi-micro-computer communications switch %R 115 %A T. W. Chen %A N. V. Findler %T Toward analogical reasoning in problem solving by computers %D December 1976 %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 116 %A G. T. Herman %A H. K. Liu %T A simple shading for computer displayed surfaces %R 117 %A N. V. Findler %T A similarity measure between two strings %R 118 %A P. H. Lutz %T User's manual for the programming language BLAISE version 1 %R 119 %A S. C. Shapiro %T A Scrabble crossword game playing program %R 120 %A E. I. Oviedo %T The syntactic definition of structured Fortran %R 121 %A N. Gehani %T On the implementation of generic procedures %R 122 %A G. T. Herman %A A. Lent %T Iterative quadratic optimization with application in diagnostic radiology %R 123 %A S. C. Shapiro %T Representing and locating deduction rules in a semantic network %R 124 %A D. A. Reed %T On FFT processors (software considerations) %R 125 %A L. G. James %T On FFT processors (hardware considerations) %R 126 %A L. D. Wittie %A A. M. Van\ Tilborg %T Control hierarchies for arbitrarily connected microcomputer networks %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 %R 128 %A P. H. Lutz %A D. E. Oldman %T FOIL, an intermediate language for FORTRAN %D March 1977 %R 129 %A G. T. Herman %T Correction for beam hardening in computed tomography %D June 1977 %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 %R 131 %T The Fortran assembler \- A guide to code generation for MCP %A C. J. Hughes %D June 1977 %R 132 %T Fortran VM \- A virtual memory system for a Fortran machine on the B1700 %A C. J. Hughes %D April 1977 %R 133 %T More about abstract data types %A N. Gehani %D July 1977 %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 %R 135 %A Y. Censor %T General conservative FK-spaces and an extended notion of connulity %D December 1977 %R 136 %T IGL \- An intermediate graphic language for device-independent graphics %A M. M. Yau %D December 1977 %R 137 %T Filter selection for fan-beam convolution reconstruction algorithm %A T. Chang %A G. T. Herman %D February 1978 %R 138 %T On modifications to the algebraic reconstruction techniques %A G. T. Herman %D February 1978 %R 139 %T Concise description of algorithms in SNARK77 %A G. T. Herman %D January 1978 %R 140 %T An axiomatic definition of pattern matching in SNOBOL4: Preliminary findings %A P. H. Lutz %A N. Gehani %D January 1978 %R 141 %A N. V. Findler %T A heuristic information retrievalsystem based on associative networks %D February 1978 %R 142 %A G. T. Herman %A H. K. Liu %T Three dimensional display of human organs from computed tomograms %D February 1978 %R 143 %T MICRONET: A reconfigurable microcomputer network for distributed systems research %A L. D. Wittie %D April 1978 %R 144 %A S. C. Shapiro %T The SNePS semantic network processing system %D May 1978 %R 145 %A E. Artzy %T Boundary detection of internal organs in mini-computers %R 146 %T <withdrawn> %R 147 %A S. N. Srihari %T On choosing measurements for invariant pattern recognition %D September 1978 %R 148 %T <withdrawn> %R 149 %T Optimal scheduling of task groups on tightly coupled multiprocessors %D December 1978 %A L. J. Miller %R 150 %A S. N. Srihari %T Majority vote classification of random binary vectors %R 151 %A S. N. Srihari %A L. J. White %A T. Snabb %T Identity conditions for nearest-neighbor and potential function classifiers %R 152 %A J. Case %A S. Ngo\ Manuelle %T Refinements of inductive inference by Popperian machines %R 153 %A S. C. Shapiro %T Numerical quantifiers and their use in reasoning with negative information %R 154 %A J. Case %A C. H. Smith %T Comparison of identification criteria for mechanized inductive inference %R 155 %A C. H. Smith %T Finite covers of inductive inference machines %R 156 %A L. D. Wittie %T A distributed operating system for a reconfigurable network computer %R 157 %A P. B. Van\ Verth %A L. D. Wittie %T LSI-11 Pascal compiler systems %R 158 %A L. D. Wittie %T Architectures for large networks of microcomputers %R 159 %T <withdrawn> %R 160 %A G. A. Riccardi %T The independence of control structures in abstract programming systems %R 161 %A A. Ralston %T Computer science, mathematics and the undergraduate curricula in both %R 162 %A S. N. Srihari %T Representation of three-dimensional digital images %R 163 %A G. Silberman %T Delayed-staging storage hierarchies and the active memory unit concept %R 164 %A D. P. McKay %A S. C. Shapiro %T MULTI \- a Lisp based multiprocessing system %R 165 %A J. E. S. P. Martins %T The Quasi-Optimizer, phase I %R 166 %A E. M. Gurari %T Decidable problems for powerful programs %R 167 %A E. M. Gurari %A O. H. Ibarra %T Two-way counter machines and diophantine equations %R 168 %A E. M. Gurari %A O. H. Ibarra %T Finite-valued transducers %R 169 %A E. M. Gurari %A H. Wechsler %T On the difficulties involved in the segmentation of pictures %R 170 %A M. M. Yau %A S. N. Srihari %T Recursive generation of hierarchical data structures for multidimensional digital images %R 171 %A A. S. Maida %A S. C. Shapiro %T Intensional concepts in propositional semantic networks %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 %R 173 %A S. C. Shapiro %T COCCI: a deductive semantic network program for solving microbiology unknowns %R 174 %A J. E. S. P. Martins %A D. P. McKay %A S. C. Shapiro %T Bi-directional inference %R 175 %A J. E. S. P. Martins %A S. C. Shapiro %T A belief revision system based on relevance logic and heterarchical contexts %R 176 %A P. M. Henderson %A L. D. Wittie %T Communication, power and packaging systems for the Micronet computer %R 177 %A S. N. Srihari %A M. E. Jernigan %T Pattern recognition %R 178 %A K. J. Chen %T Tradeoffs in machine inductive inference %R 179 %A J. G. Neal %T A knowledge engineering approach to natural language understanding %R 180 %T <withdrawn> %R 181 %A S. N. Srihari %A R. Bozinovic %T A string correction algorithm for cursive script recognition %R 182 %T <withdrawn> %R 183 %A R. K. Srihari %T Combining path-based and node-based inference in SNePS %R 184 %A S. N. Srihari %A J. J. Hull %T Experiments in text recognition with binary \fIn\fP-gram and Viterbi algorithms %R 185 %A S. N. Srihari %A M. M. Yau %T A hierarchical data structure for multidimensional digital images %R 186 %A H. Shubin %T Inference and control in multiprocessing environments %R 187 %A N. V. Findler %T A preliminary report on a multi-level learning technique using production systems %R 188 %A N. V. Findler %A E. J. M. Morgado %T Morph-fitting \- an effective technique of approximation %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 %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 %R 191 %T <withdrawn> %R 192 %A S. N. Srihari %A J. J. Hull %A R. Choudhari %T An algorithm for integrating diverse knowledge sources in text recognition %R 193 %A G. L. Sicherman %T The Advice-Taker/Inquirer %R 194 %A N. V. Findler %T Toward a theory of strategies %R 195 %A S. Moriya %T An algebraic structure theory of rule sets, I: a formalization of both production systems and decision tables %R 196 %A N. V. Findler %T An overview of the Quasi-Optimizer system %R 197 %A N. V. Findler %A G. L. Sicherman %A B. B. McCall %T A multi-strategy gaming environment %R 198 %A L. M. Tranchell %T A SNePS implementation of KL-ONE %R 199 %A M. M. Yau %T Generating quadtrees of cross-sections from octrees %R 200 %A S. N. Srihari %T Pyramid representations for solids %R 201 %A M. M. Yau %T Hierarchical representation of three-dimensional digital objects %R 202 %A G. L. Sicherman %T Parsley 1.1: A general text parser in LISP %D April 1983 %R 203 %A J. E. S. P. Martins %D May 1983 %T Reasoning in multiple belief spaces %R 204 %A J. T. Nutter %D October 1983 %T Default reasoning in A.I. systems %R 205 %A E. I. Oviedo %T Control flow, data flow and program complexity %D October 1983 %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 %R 207 %T Grinlib \- Grinnell graphics in Lisp %A P. Schlossman %A S. L. Hardt %D 1983 %R 208 %T Correcting and translating ill-formed ship messages %A J. Rosenberg %A M. E. Haefner %A S. L. Hardt %D January 1984 %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 %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 %R 211 %T Naive physics and the physics of diffusion; or, When intuition fails %A S. L. Hardt %D June 1984 %R 212 %T From CD to mandarin Chinese: The language generation project %A M. Y. Lo %A S. L. Hardt %D August 1984 %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 %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 %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 %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 %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 %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 %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 and 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-02 %A G. L. Sicherman %T The Qvi manual %D April 1985 %X Qvi is a screen editor for QMS Lasergrafix download fonts. This report describes Qvi and tells how to use it. %R 85-03 %A G. L. Sicherman %T Adapting Ditroff to a laser printer %D April 1985 %X Ditroff is a text processor that prepares proportionally spaced text for any suitably equipped device. This report tells how it was adapted to drive a Q.M.S.\& Lasergrafix'' 1200 printer, and describes the supporting software. %R 85-04 %A G. L. Sicherman %T The Buffalo font catalogue %D April 1985 %X This report shows the fonts available on the Department's Q.M.S. Lasergrafix'' 1200 printer. %R 85-05 %A P. B. Van\ Verth %T A system for automatic program grading %D May 1985 %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 %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 %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 %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 %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. %A M. A. Fulk %T A study of inductive inference machines %R 85-10 %D August 1985 %X Inductive inference machines (IIMs) model learning and scientific theory formation. We investigate IIMs that attempt to synthesize (in the limit) a program for a function as they receive data (in the form of input-output pairs) about that function. We show that a postdictively consistent IIM can be effectively replaced with a postdictively complete IIM that succeeds on all of the functions that the original did. We also investigate IIMs that attempt to synthesize (again in the limit) a program that enumerates an r.e. set as they receive data consisting of the elements of that set. Finally, we propose new criteria for success in inductive inference. %R 85-11 %A J. S. Royer %T A connotational theory of program structure %D September 1985 %R 85-12 %T Local symmetry computation for shape description %A G. W. Lee %A S. N. Srihari %D September 1985 %R 85-13 %T ROCS: A system for reading off-line cursive script %A R. M. Bo\o'z\(hc'inovi\o'c\(aa' %A S. N. Srihari %D September 1985