Papers.

The creation, distribution and use of linguistic data: the case of the linguistic data consortium

Transcriber: a free tool for segmenting, labeling and transcribing speech

Investigating a Concept-Based Tool to Enhance the Process of Curriculum Development: An Example for Healthcare Education

Prediction Intervals for Neural Networks via Nonlinear Regression

Standard methods for computing prediction intervals in nonlinear regression can be effectively applied to neural networks when the number of training points is large. However, simulations show that thses methods can generate unreliable prediction intervals on smaller data sets because when the network is trained to convergence. Stopping the training algorithm prior to convergence, to avoid over-fitting, reduces the effective number of parameters effectively, but can lead to prediction intervals that are too wide. We present an alternative approach to estimating prediction intervals which uses weight decay to fit the network and show that this method is effective on a wide range of problems. KEY WORDS: Nonparametric regression, smoothing, high-dimensional data, backpropagation. 1 Introduction Multilayer feedforward neural networks are flexible models that are widely used to model high-dimensional, nonlinear data. The models typically contain many parameters, sometimes as many or more p...

An Architecture for Efficient Document Clustering and Retrieval on a Dynamic Collection of Newspaper Texts

Searching

Fast searching on compressed text allowing errors

Lazy computation with exact real numbers

We provide a semantical framework for exact real arithmetic using linear fractional transformations on the extended real line. We present an extension of PCF with a real type which introduces an eventually breadth-first strategy for lazy evaluation of exact real numbers. In this language, we present the constant redundant if, rif, for defining functions by cases which, in contrast to parallel if (pif), overcomes the problem of undecidability of comparison of real numbers in finite time. We use the upper space of the one-point compactification of the real line to develop a denotational semantics for the lazy evaluation of real programs.

H/Direct: a binary foreign language interface for Haskell

H/Direct is a foreign-language interface for the purely functional language Haskell. Rather than rely on host-language type signatures, H/Direct compiles Interface Definition Language (IDL) to Haskell stub code that marshals data across the interface. This approach allows Haskell to call both C and COM, and allows a Haskell component to be wrapped in a C or COM interface. IDL is a complex language and language mappings for IDL are usually described informally. In contrast, we provide a relatively formal and precise definition of the mapping between Haskell and IDL.

Making the future safe for the past

We present GJ, a design that extends the Java programming language with generic types and methods. These are both explained and implemented by translation into the unextended language. The translation closely mimics the way generics are emulated by programmers: it erases all type parameters, maps type variables to their bounds, and inserts casts where needed. Some subtleties of the translation are caused by the handling of overriding.GJ increases expressiveness and safety: code utilizing generic libraries is no longer buried under a plethora of casts, and the corresponding casts inserted by the translation are guaranteed to not fail.GJ is designed to be fully backwards compatible with the current Java language, which simplifies the transition from non-generic to generic programming. In particular, one can retrofit existing library classes with generic interfaces without changing their code.An implementation of GJ has been written in GJ, and is freely available on the web.

Constructing community in cyberspace

Learning agents for uncertain environments (extended abstract)

Caching Multidimensional Queries Using Chunks

Caching has been proposed (and implemented) by OLAP systems in order to reduce response times for multidimensional queries. Previous work on such caching has considered table level caching and query level caching. Table level caching is more suitable for static schemes. On the other hand, query level caching can be used in dynamic schemes, but is too coarse for “large” query results. Query level caching has the further drawback for small query results in that it is only effective when a new query is subsumed by a previously cached query. In this paper, we propose caching small regions of the multidimensional space called “chunks”. Chunk-based caching allows fine granularity caching, and allows queries to partially reuse the results of previous queries with which they overlap. To facilitate the computation of chunks required by a query but missing from the cache, we propose a new organization for relational tables, which we call a “chunked file.” Our experiments show that for workloads that exhibit query locality, chunked caching combined with the chunked file organization performs better than query level caching. An unexpected benefit of the chunked file organization is that, due to its multidimensional clustering properties, it can significantly improve the performance of queries that “miss” the cache entirely as compared to traditional file organizations.

Excited state density distributions of H, C, C2, and CH by spatially resolved optical emission in a diamond depositing dc-arcjet reactor

Array-Based Evaluation of Multi-Dimensional Queries in Object-Relational Databases Systems

Building an Information System from the Web

Adaptive control of a class of second order nonlinear systems with convex/concave parametrization

A physically based nonlinear model of combustion instability and active control

Virtual database technology: Transforming the Internet into a Database

Much of the world's data lies outside relational databases-scattered across Web sites, file systems, nonrelational databases, and legacy applications. These data sources differ in the way they organize data, in the vocabulary they use, and in their data-access or query mechanisms. These differences make it difficult to combine data from multiple sources. Virtual database (VDB) technology makes external data sources act as an extension of an enterprise's relational database system. Using VDB technology, applications can make powerful queries of data scattered over a variety of sources. The VDB gathers, structures, and integrates the data from these sources, and gives the application programmer the appearance of a single, unified RDBMS.

Organizational Structure and the Role of Empowered Teams in U.S. Business Schools: An Empirical Assessment

Metaphrase: An Aid to the Clinical Conceptualization and Formalization of Patient Problems in Healthcare Enterprises

Monadic parsing in Haskell

This paper is a tutorial on defining recursive descent parsers in Haskell. In the spirit of one-stop shopping , the paper combines material from three areas into a single source. The three areas are functional parsers (Burge, 1975; Wadler, 1985; Hutton, 1992; Fokker, 1995), the use of monads to structure functional programs (Wadler, 1990, 1992a, 1992b), and the use of special syntax for monadic programs in Haskell (Jones, 1995; Peterson et al ., 1996). More specifically, the paper shows how to define monadic parsers using do notation in Haskell. Of course, recursive descent parsers defined by hand lack the efficiency of bottom-up parsers generated by machine (Aho et al ., 1986; Mogensen, 1993; Gill and Marlow, 1995). However, for many research applications, a simple recursive descent parser is perfectly sufficient. Moreover, while parser generators typically offer a fixed set of combinators for describing grammars, the method described here is completely extensible: parsers are first-class values, and we have the full power of Haskell available to define new combinators for special applications. The method is also an excellent illustration of the elegance of functional programming.

The call-by-need lambda calculus

We present a calculus that captures the operational semantics of call-by-need. The call-by-need lambda calculus is confluent, has a notion of standard reduction, and entails the same observational equivalence relation as the call-by-name calculus. The system can be formulated with or without explicit let bindings, admits useful notions of marking and developments, and has a straightforward operational interpretation.

Absolute concentration, temperature, and velocity measurements in a diamond depositing dc-arcjet reactor

Absolute radical concentration measurements and modeling of low-pressure CH4/O2/NO flames

How to "hear" visual disparities: real-time stereoscopic spatial depth analysis using temporal resonance

Analog computation for phase-based disparity estimation: continuous and discrete models

Fast two-dimensional approximate pattern matching

A statically safe alternative to virtual types

Load balancing in parallel molecular dynamics

Collaborative conversational interfaces

Reclustering techniques improve early vision feature maps

Similarity in Two-Dimensional Strings

Multiparadigm, multilingual interoperability: Experience with converse

Searching the World Wide Web: Challenges and Partial Solutions

Fringe analysis of synchronized parallel algorithms on 2–3 trees

Aspect-Oriented Programming in the Coyote Project

Metrics for cortical map organization and lateralization

Non-Gaussian signature of weak gravitational lensing in the CMB

Inflationary cosmologies predict Gaussian primordial fluctuations, but subsequent gravitational lensing of the CMB disturbs its Gaussianity. Knowledge of the specific signature of lensing is necessary to distinguish a lensed Gaussian sky from an intrinsically non-Gaussian one. In this paper we investigate the pattern of non-Gaussian features in the CMB resulting from gravitational lensing, both analytically and numerically. We describe the lensed CMB temperature distribution using the formalism of generating functionals and obtain the complete picture of emerging non-Gaussian effects. To test for the signature of lensing in practice, we propose a scale-dependent statistic based on cumulants of the CMB temperature, and we compute that statistic numerically for typical inflationary models. The effect is expected to be most significant at angular scales $\sim 10^\prime$ and its magnitude is within observational capabilities of future satellite missions.

Learning the Structure of Dynamic Probabilistic Networks

Dynamic probabilistic networks are a compact representation of complex stochastic processes. In this paper we examine how to learn the structure of a DPN from data. We extend structure scoring rules for standard probabilistic networks to the dynamic case, and show how to search for structure when some of the variables are hidden. Finally, we examine two applications where such a technology might be useful: predicting and classifying dynamic behaviors, and learning causal orderings in biological processes. We provide empirical results that demonstrate the applicability of our methods in both domains.

What Must a Vocabulary Editing Interface Offer

Towards a formal framework for linguistic annotations

Thinking in Java

The role of compositionality in standardized problem list generation

Speech Recognition with Dynamic Bayesian Networks

Searching the Web: Challenges and Partial Solutions (Invited Paper).

Resistance is Futile: The Web Will Assimilate Your Database

Probabilistic Inference in Belief Networks: Algorithms and Parallelism

Intelligent Scheduling

Implementing Java Computing: Sun on Architecture and Applications Deployment