Papers.

Standardized problem list generation, utilizing the Mayo canonical vocabulary embedded within the Unified Medical Language System

Reinforcement Learning with Hierarchies of Machines

Preface to the Special Issue on the 1995 Latin American Theoretical Informatics Symposium.

On the Eeectiveness of Memory-based Methods in Machine Learning 5

Object Identification in a Bayesian Context

Metaphrase: Achieving Formalized EMR Problem Lists from Informal Input

Inside the Java Virtual Machine

Henk: a typed intermediate language

There is growing interst in the use of richly-typed intermediate languages in sophisticated compilers for higher-order, typed source languages. these intermediate languages are typically stratified, involving terms, types, and kinds. As the sophistication of the type system increases, these three levels begin to look more and more similar, so an attractive approach is to use a single syntax, and a single data type in the compiler, to represent all three. The theory of so-called pure type systems makes precisely such an identification. This paper describes Henk, a new typed intermediate language based closely on a particular pure type system, the lambda cube. On the way we giv a tutorial introduction to the lambda cube.

Fringe analysis for parallel MacroSplit insertion algorithms in 2--3 trees

Exact real computer arithmetic

Domain Specific Languages for ad hoc Distributed Applications

Design and Implementation of Parallel Java with Global Object Space

Cubing Algorithms, Storage Estimation, and Storage and Processing Alternatives for OLAP

Adaptive software

Quantitative Detection of CH Radicals by Laser-Induced Fluorescence in Arcjets and Flames

Visualization of large answers in text databases

Visualization of large answers in text databases

Integrating contents and structure in text retrieval

Putting type annotations to work

We study an extension of the Hindley/Milner system with explicit type scheme annotations and type declarations. The system can express polymorphic function arguments, user-defined data types with abstract components, and structure types with polymorphic fields. More generally, all programs of the polymorphic lambda calculus can be encoded by a translation between typing derivations. We show that type reconstruction in this system can be reduced to the decidable problem of first-order unification under a mixed prefix.

Fast text searching for regular expressions or automaton searching on tries

Data structures

The Dangers of Replication and a Solution

Update anywhere-anytime-anyway transactional replication has unstable behavior as the workload scales up. A ten-fold increase in nodes and traffic gives a thousand-fold increase in deadlocks or reconciliations.

VISUAL DEBUGGING AND AUTOMATIC ANIMATION OF C PROGRAMS

Let's talk: extending the Web to support collaboration

Conformal invariance in 2-dimensional discrete field theory

A discretized massless wave equation in two dimensions, on an appropriately chosen square lattice, exactly reproduces the solutions of the corresponding continuous equations. We show that the reason for this exact solution property is the discrete analog of conformal invariance present in the model, and find more general field theories on a two-dimensional lattice that exactly solve their continuous limit equations. These theories describe in general non-linearly coupled bosonic and fermionic fields and are similar to the Wess-Zumino-Witten model.

Probability Distribution for $Ω$ in Open-universe Inflation

The problem of making predictions in eternally inflating universe that thermalizes by bubble nucleation is considered. A recently introduced regularization procedure is applied to find the probability distribution for the ensemble of thermalized bubbles. The resulting probabilities are shown to be independent of the choice of the time parametrization. This formalism is applied to models of open ``hybrid'' inflation with $Ω<1$. Depending on the parameters of the model, the probability distribution for $Ω$ is found to have a peak either very close to $Ω=1$, or at an intermediate value of $Ω$ in the range $0.03\lesssim Ω<1$.

Managing the virtual commons

A Poor Precedent

Bounded disorder: The effect of the index

The user interface as document: SGML and distributed applications

Hierarchies of indices for text searching

A framework to animate string algorithms

Fast and practical approximate string matching

Optimal Composition of Real-Time Systems

A unified view to string matching algorithms

AccessNova: Broadband networks and multimedia services experiments in Chile

Structured dagger: A coordination language for Message-Driven Programming

A parallel algorithm for depth perception from radial optical flow fields

A faster algorithm for approximate string matching

Towards a Scalable Parallel Object Database — the Bulk Synchronous Parallel Approach

Toward reusable software components at the point of care

Techniques for visualizing urban growth using a temporal GIS database

Suggesting Structural Enhancements to SNOMED International

Storage Estimation for Multidimensional Aggregates in the Presence of Hierarchies

Runtime Performance Analysis of the M-to-N Scheduling Model

Puzzle pieces defined: locating common packing units in tertiary protein contacts

Introduces a method for locating recurring packing units ("puzzle pieces") in tertiary protein contacts, using interdigitating side-chain packing patterns to define and cluster common structural motifs across protein structures.

Object-Oriented Implementation of the NAS Parallel Benchmarks using Charm++

Mobile Access to Oncology Knowledge

MEME-II supports the cooperative management of terminology

Exploiting the Metathesaurus Update Model