Papers.

Concept, Code, Term and Word: Preserving the Distinctions

Combining analyses, combining optimizations

Categorization of free-text problem lists: an effective method of capturing clinical data

Approximate Probabilistic Inference in Belief Networks

Accessing oncology information at the point of care: experience using speech, pen, and 3-D interfaces with a knowledge server

A Language for Queries on Structure and Contents of Textual.

Lexicons for human language technology

Digitizing History

Provably Bounded-Optimal Agents

Since its inception, artificial intelligence has relied upon a theoretical foundation centred around perfect rationality as the desired property of intelligent systems. We argue, as others have done, that this foundation is inadequate because it imposes fundamentally unsatisfiable requirements. As a result, there has arisen a wide gap between theory and practice in AI, hindering progress in the field. We propose instead a property called bounded optimality. Roughly speaking, an agent is bounded-optimal if its program is a solution to the constrained optimization problem presented by its architecture and the task environment. We show how to construct agents with this property for a simple class of machine architectures in a broad class of real-time environments. We illustrate these results using a simple model of an automated mail sorting facility. We also define a weaker property, asymptotic bounded optimality (ABO), that generalizes the notion of optimality in classical complexity theory. We then construct universal ABO programs, i.e., programs that are ABO no matter what real-time constraints are applied. Universal ABO programs can be used as building blocks for more complex systems. We conclude with a discussion of the prospects for bounded optimality as a theoretical basis for AI, and relate it to similar trends in philosophy, economics, and game theory.

New development of APL technology of modelling

A compiler that can convert non-interactive APL*PLUS program into executable machine code has been developed.The compiler uses C++ as an intermediate language that makes the resulting code machine independent.Testing showed that compiled program runs about three times faster than original APL program.The report offers schema of compiler and possible fields of applications.

Polymorphic type inference and abstract data types

Many statically typed programming languages provide an abstract data type construct, such as the module in Modula-2. However, in most of these languages, implementations of abstract data types are not first-class values. Thus, they cannot be assigned to variables, passed as function parameters, or returned as function results. Several higher-order functional languages feature strong and static type systems, parametric polymorphism, algebraic data types, and explicit type variables. Most of them rely on Hindley-Milner type inference instead of requiring explicit type declarations for identifiers. Although some of these languages support abstract data types, it appears that none of them directly provides light-weight abstract data types whose implementations are first-class values. We show how to add significant expressive power to statically typed functional languages with explicit type variables by incorporating first-class abstract types as an extension of algebraic data types. Furthermore, we extend record types to allow abstract components. The components of such abstract records are selected using the dot notation. Following Mitchell and Plotkin, we formalize abstract types in terms of existentially quantified types. We give a syntactically sound and complete type inference algorithm and prove that our type system is semantically sound with respect to standard denotational semantics.

A critical look at some Ada features

The Position of the Canon Group: A Reality Check

Towards robust automatic traffic scene analysis in real-time

Detection of Particles Under Potential Barrier

We introduce a model detector which registers the passage of a particle through the detector location, without substantially perturbing the particle wave function. (The exact time of passage is not determined in such measurements.) We then show that our detector can operate in a classically forbidden region and register particles passing through a certain point under a potential barrier. We show that it should be possible to observe the particle's track under the barrier.

A Model for Integration of Knowledge-Based Components in Existing Process Control Systems

The role of the UMLS in ‘storing’ and ‘sharing’ across systems

Text-Based Intelligent Systems

On Boyer-Moore automata

Historical Overview

Computer Science 2

Analysis of bounded disorder

Proximity matching using fixed-queries trees

Fast String Matching with Mismatches

Recognizing Text Genres with Simple Metrics Using Discriminant Analysis

Proceedings of the 13th international conference on Computer science 2 : research and applications: research and applications

Materialization: A Powerful and Ubiquitous Abstraction Pattern

Integration of pen-based computer technology in clinical settings

Information Architecture and Agents

Formal properties of the Metathesaurus

Computer speech synthesis: its status and prospects

Commentary on Kaplan and Kay

The Phonetic Interpretation of Tone in Igbo

Constant Interaction-Time Scatter/Gather Browsing of Very Large Document Collections

Scheduling and rescheduling with iterative repair

Learning, Planning, and Scheduling: An Overview

An Architecture for the Integration of Industrial Artificial Intelligence Systems

Visual and Collaborative Tools for Software Engineering Education

Fast two-dimensional pattern matching

Representations of commonsense knowledge

The Model Theory of Concurrency

On efficient entreeings

Measuring Product Costs for Ratemaking: The United States Postal Service

Searching in the Plane

Transaction Processing and the Barbarian Hordes

Toward an interim standard for patient-centered knowledge-access

The UMLS Metathesaurus: representing different views of biomedical concepts

Speech-Driven, Patient-Centered Access to Three Oncology Knowledge Sources: How Might It Work?

Recognizing new medical knowledge computationally

Porting a Stochastic Part-of-Speech Tagger to Swedish