Papers.

The K-Component Architecture Meta-model for Self-Adaptive Software

System Checkpointing Using Reflection and Program Analysis

Flexible Comparison of Conceptual Graphs*

A Comparison of Classifiers for Real-Time Eye Detection

New and faster filters for multiple approximate string matching

Null Energy Condition Violations in Eternal Inflation

The usual scenario of ``eternal inflation'' involves an approximately de Sitter spacetime undergoing upward fluctuations of the local expansion rate $H$. This spacetime requires frequent violations of the Null Energy Condition (NEC). We investigate the fluctuations of the energy-momentum tensor of the scalar field in de Sitter space as a possible source of such violations. We find that fluctuations of the energy-momentum tensor smeared in space and time are well-defined and may provide the NEC violations. Our results for slow-roll inflation are consistent with the standard calculations of inflationary density fluctuations. In the diffusive regime where quantum fluctuations dominate the slow-roll evolution, the magnitude of smeared energy-momentum tensor fluctuations is large enough to create frequent NEC violations.

Web-based, Micro-terminology Development: The MMHCC Experience

Un método de agrupamiento de grafos conceptuales para minería de texto.

Treemap Visualizations of Newsgroups

Tonal Complexes and Tonal Alignment

The semantic web as Perfection seeking: a view from drug terminology

The Java HotSpot Server Compiler

The Creation and Use of a Reference Terminology for Inter-agency Computer-based Patient Records: The GCPR RTM Demonstration Project

Singing Voice Synthesis Combining Excitation plus Resonance and Sinusoidal plus Residual Models

Rethinking interaction: the solution for high-quality MT?

Our focus is on high-quality (HQ) translation, the worldwide demand for which continues to increase exponentially and now far exceeds the capacity of the translation profession to satisfy it. The paper argues for interactive MT as the route to high-quality translation.

Relating Web Structure, User Search Behavior.

Professional Java Server Programming J2EE, 1.3 Edition

Multi-author Wrox reference on the J2EE 1.3 platform: servlets, JSP, EJB 2.0, JMS, JDBC, transactions, web services and enterprise application design.

Power-Aware Video Decoding

Planning and Scheduling for Fleets of Earth Observing Satellites

We address the problem of scheduling observations for a collection of Earth Observing Satellites. This scheduling task is a difficult optimization problem, involving multiple satellites, hundreds of requests, constraints on when and how to service each request, and resources such as instruments, recording devices, transmitters, and ground stations. High-fidelity models are required to ensure the validity of schedules. At the same time, the size and complexity of the problem makes it unlikely that systematic search methods will be able to produce good solutions in a reasonable amount of time. This paper presents an approach to solving the Earth Observing Satellite scheduling problem that involves: 1) modeling of the problem using a constraint-based language, 2) a stochastic greedy search algorithm for finding solutions, and 3) heuristics based on a generalized contention measure for guiding the search.

Parsec: direct style monadic parser combinators for the real world

Despite the long list of publications on parser combinators, there does
\nnot yet exist a monadic parser combinator library that is applicable in real
\nworld situations. In particular naive implementations of parser combinators
\nare likely to suffer from space leaks and are often unable to report
\nprecise error messages in case of parse errors. The Parsec parser combinator
\nlibrary described in this paper, utilizes a novel implementation
\ntechnique for space and time e±cient parser combinators that in case of
\na parse error, report both the position of the error as well as all grammar
\nproductions that would have been legal at that point in the input.

Multiagent Planning with Factored MDPs

Matchsimile: A Flexible Approximate Matching Tool for Personal Names Searching.

Let's Design Everything Again: Thoughts on Computing and Its Teaching

Iterative combinatorial auctions: achieving economic and computational efficiency

A fundamental problem in building open distributed systems is to design mechanisms that compute optimal system-wide solutions despite the self-interest of individual users and computational agents. Classic game-theoretic solutions are often prohibitively expensive computationally. For example, the Generalized Vickrey Auction (GVA) is an efficient and strategy-proof solution to the combinatorial allocation problem (CAP), in which agents demand bundles of items, but every agent must reveal its value for all possible bundles and the auctioneer must solve a sequence of NP-hard optimization problems to compute the outcome. I propose iBundle, an iterative combinatorial auction in which agents can bid for combinations of items and adjust their bids in response to bids from other agents. iBundle computes the efficient allocation in the CAP when agents follow myopic best-response bidding strategies, bidding for the bundle(s) that maximize their surplus taking the current prices as fixed. iBundle solves problems without complete information revelation from agents and terminates in competitive equilibrium. Moreover, an agent can follow a myopic best-response strategy with approximate values on bundles, for example with lower- and upper-bounds. My approach to iterative mechanism design decomposes the problem into two parts. First, I use linear programming theory to develop an efficient iterative auction under the assumption that agents will follow a myopic best-response bidding strategy. Second, I extend the approach to also compute Vickrey payments at the end of the auction. This makes myopic best-response a sequentially-rational strategy for agents in equilibrium, inheriting many of the useful game-theoretic properties of the GVA. iBundle implements a primal-dual algorithm, C...

Interactive Poster: Treemap Visualizations of Newsgroups

Integration of Search Engines with User Interfaces.

Indexing methods for approximate string matching

Flexible Comparison of Conceptual GraphsWork done under partial support of CONACyT, CGEPI-IPN, and SNI, Mexico

Flexible comparison of conceptual graphs

Explaining the Brain to a Computer

Diseñamos todo de nuevo: reflexiones sobre la Computación y su enseñanza: reflexiones sobre la Computación y su enseñanza

Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data

Búsquedas en espacios métricos: posibles optimizaciones al Geometric Near-neighbor Access Tree

Automatic conflict resolution to integrate relational schema.

Issues in Corpus Creation and Distribution: The Evolution of the Linguistic Data Consortium

Large, Multilingual, Broadcast News Corpora for Cooperative Research in Topic Detection and Tracking: The TDT-2 and TDT-3 Corpus Efforts

ATLAS: A Flexible and Extensible Architecture for Linguistic Annotation

Breath hydrogen testing identifies patients with diabetic gastroparesis

In-fiber strain characterization of fiber-optic connector assemblies by Bragg grating sensors

Flow characterization of a diamond-depositing dc arcjet by laser-induced fluorescence

A Computational Model of Lateralization and Asymmetries in Cortical Maps

The Jalapeño virtual machine

Some social implications of ubiquitous wireless networks

Conversation trees and threaded chats

Fast and flexible word searching on compressed text

Efficient clustering of high-dimensional data sets with application to reference matching

Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques for clustering when the dataset has either (1) a limited number of clusters, (2) a low feature dimensionality, or (3) a small number of data points. However, there has been much less work on methods of efficiently clustering datasets that are large in all three ways at once---for example, having millions of data points that exist in many thousands of dimensions representing many thousands of clusters. We present a new technique for clustering these large, high-dimensional datasets. The key idea involves using a cheap, approximate distance measure to efficiently divide the data into overlapping subsets we call canopies. Then clustering is performed by measuring exact distances only between points that occur in a common canopy. Using canopies, large clustering problems that were formerly impossible become practical. U...

A portable sampling-based profiler for Java virtual machines

A proof of the security of quantum key distribution (extended abstract)

We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities, and the full power allowed by the rules of classical and quantum physics. A key created that way can then be used to transmit secure messages such that their security is also unaffected in the future.

The social life of small graphical chat spaces

Implicit parameters: dynamic scoping with static types

This paper introduces a language feature, called implicit parameters, that provides dynamically scoped variables within a statically-typed Hindley-Milner framework. Implicit parameters are lexically distinct from regular identifiers, and are bound by a special with construct whose scope is dynamic, rather than static as with let. Implicit parameters are treated by the type system as parameters that are not explicitly declared, but are inferred from their use.