Papers.

Counting on community in cyberspace

Domain specific embedded compilers

Domain-specific embedded languages (DSELs) expressed in higher-order, typed (HOT) languages provide a composable framework for domain-specific abstractions. Such a framework is of greater utility than a collection of stand-alone domain-specific languages. Usually, embedded domain specific languages are build on top of a set of domain specific primitive functions that are ultimately implemented using some form of foreign function call. We sketch a general design pattern/or embedding client-server style services into Haskell using a domain specific embedded compiler for the server's source language. In particular we apply this idea to implement Haskell/DB, a domain specific embdedded compiler that dynamically generates of SQL queries from monad comprehensions, which are then executed on an arbitrary ODBC database server.

Alternative interfaces for chat

Compositional pointer and escape analysis for Java programs

Calling hell from heaven and heaven from hell

The increasing popularity of component-based programming tools offer a big opportunity to designers of advanced programming languages, such as Haskell. If we can package our programs as COM objects, then it is easy to integrate them into applications written in other languages. In earlier work we described a preliminary integration of Haskell with Microsoft's Component Object Model (COM), focusing on how Haskell can create and invoke COM objects. This paper develops that work, concentrating on the mechanisms that support externally-callable Haskell functions, and the encapsulation of a Haskell program as a COM object. 1 Introduction "Component-based programming" is all the rage. It has come to mean an approach to software construction in which a program is an assembly software components, perhaps written in different languages, glued together by some common substrate [16]. The most widely used substrates are Microsoft's Component Object Model (COM), and the Common Object Request Broke...

The Jalapeño dynamic optimizing compiler for Java

A new high density and very low cost reprogrammable FPGA architecture

A new reprogrammable FPGA architecture is described which is specifically designed to be of very low cost. It covers a range of 35K to a million usable gates. In addition, it delivers high performance and it is synthesis efficient. This architecture is loosely based on an earlier reprogrammable Actel architecture named ES. By changing the structure of the interconnect and by making other improvements, we achieved an average cost reduction by a factor of three per usable gate. The first member of the family based on this architecture is fabricated on a 2.54 standard 0.25~ CMOS technology with a gate count of up to 130K which also includes 36K bits of two port RAM. The gate count of this part is verified in a fully automatic design flow starting from a high level description followed by synthesis, technology mapping, place and route, and timing extraction.

Information Technology Outside Health Care: What Does It Matter to Us?

On Universal and Fault-Tolerant Quantum Computing: A Novel Basis and a New Constructive Proof of Universality for Shor's Basis

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and /spl sigma//sub z//sup 1/4 /) and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of /spl pi/) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by P.W. Shor (1996) and A.Y. Kitaev (1997).

A model of lateralization and asymmetries in cortical maps

Using XML in relational database applications

Workshop Report on Integrating XML & Distributed Object Technologies

Adaptive control of nonlinearly parametrized systems with a triangular structure

TetraFusion: Information Discovery on the Internet

Effective noise in stochastic description of inflation

Stochastic description of inflationary spacetimes emulates the growth of vacuum fluctuations by an effective stochastic ``noise field'' which drives the dynamics of the volume-smoothed inflaton. We investigate statistical properties of this field and find its correlator to be a function of distance measured in units of the smoothing length. Our results apply for a wide class of smoothing window functions and are different from previous calculations by Starobinsky and others who used a sharp momentum cutoff. We also discuss the applicability of some approximate noise descriptions to simulations of stochastic inflation.

Predictability crisis in inflationary cosmology and its resolution

Models of inflationary cosmology can lead to variation of observable parameters ("constants of Nature") on extremely large scales. The question of making probabilistic predictions for today's observables in such models has been investigated in the literature. Because of the infinite thermalized volume resulting from eternal inflation, it has proven difficult to obtain a meaningful and unambiguous probability distribution for observables, in particular due to the gauge dependence. In the present paper, we further develop the gauge-invariant procedure proposed in a previous work for models with a continuous variation of "constants". The recipe uses an unbiased selection of a connected piece of the thermalized volume as sample for the probability distribution. To implement the procedure numerically, we develop two methods applicable to a reasonably wide class of models: one based on the Fokker-Planck equation of stochastic inflation, and the other based on direct simulation of inflationary spacetime. We present and compare results obtained using these methods.

Structure and organization of the human antimicrobial peptide LL-37 in phospholipid membranes: relevance to the molecular basis for its non-cell-selective activity

The antimicrobial peptide LL-37 belongs to the cathelicidin family and is the first amphipathic alpha-helical peptide isolated from human. LL-37 is considered to play an important role in the first line of defence against local infection and systemic invasion of pathogens at sites of inflammation and wounds. To gain insight into the mechanism of its non-cell-selective cytotoxicity, we synthesized and structurally and functionally characterized LL-37, its N-terminal truncated form FF-33, and their fluorescent derivatives.

Interhemispheric effects on map organization following simulated cortical lesions

Call-by-name, call-by-value, call-by-need and the linear lambda calculus

Girard described two translations of intuitionistic logic into linear logic, one where A→B maps to (!A)⊸B and another where it maps to !(A⊸B). We detail the action of these translations on terms and show that the first corresponds to a call-by-name calculus, while the second corresponds to call-by-value. We further show that if the target of the translation is taken to be an affine calculus, where! controls contraction but weakening is allowed everywhere, then the second translation corresponds to a call-by-need calculus, as recently defined by Ariola, Felleisen, Maraist, Odersky and Wadler. Thus the different calling mechanisms can be explained in terms of logical translations, bringing them into the scope of the Curry–Howard isomorphism. Our results extend neatly to translations of extensions for recursion in the call-by-name and call-by-value calculi, and in general to extensions for products and for the corresponding untyped systems.

Adaptive control of a class of nonlinear systems with convex/concave parameterization

Very fast and simple approximate string matching

Bounding the Expected Length of Longest Common Subsequences and Forests

Avoiding Algorithmic Obfuscation in a Message-Driven Parallel MD Code

A Lazy Model-Based Algorithm for On-Line Classification

Fast Multi-dimensional Approximate Pattern Matching

A New Indexing Method for Approximate String Matching

Benchmarks and Standards for the Evaluation of Parallel Job Schedulers

Comparing Logs and Models of Parallel Workloads Using the Co-plot Method

Using Reflection to Support Dynamic Adaptation of System Software: A Case Study Driven Evaluation

NAMD2: Greater Scalability for Parallel Molecular Dynamics

Type inference with constrained types

We present a general framework HM(X) for type systems with constraints. The framework stays in the tradition of the Hindley/Milner type system. Its type system instances are sound under a standard untyped compositional semantics. We can give a generic type inference algorithm for HM(X) so that, under sufficient conditions on X, type inference will always compute the principal type of a term. We discuss instances of the framework that deal with polymorphic records, equational theories, and subtypes. © 1999 John Wiley & Sons, Inc.

Annotation graphs as a framework for multidimensional linguistic data analysis

Visualizations of Collaborative Information for End-Users

Unifying Model-based and Reactive Programming within a Model-based Executive

Real-time model-based eduction has recently emerged as a vital component in Al’s tool box for developing highly au-tonomous reactive systems. Yet one of the current hurdles towards developing model-based reactive systems is the num-ber of methods imultaneously employed, and their corre-sponding melange of programming and modeling languages. This paper offers an important step towards unification of re-active and model-based programming, providing the capabil-ity to monitor mixed hardware/software systems. We intro-duce RMPL, a rich modeling language that combines prob-abilistic, constraint-based modeling with reactive program-ming constructs, while offering a simple semantics in terms of hidden state Markov processes. We introduce probabilis-tic, hierarchical constraint automata, which allow Markov processes to be expressed in a compact representation that preserves the modularity of RMPL programs. Finally, a model-based executive, called RBurton is described that ex-ploits this compact encoding to perform efficent simulation, belief state update and control sequence generation.

Tracking Many Objects with Many Sensors

The TDT-2 Text And Speech Corpus

The Frequency of Occurrence and Relative Abundance of Ohio Stream Fishes: 1979 Through 1995

Streaming Media Interfaces for Chat

SOFIA's Choice: Automating the Scheduling of Airborne Observations

This paper describes the problem of scheduling observations for an airborne telescope. Given a set of prioritized observations to choose from, and a wide range of complex constraints governing legitimate choices and orderings, how can we efficiently and effectively create a valid flight plan which supports high priority observations? This problem is quite different from scheduling problems which are routinely solved automatically in industry. For instance, the problem requires making choices which lead to other choices later, and contains many interacting complex constraints over both discrete and continuous variables. Furthermore, new types of constraints may be added as the fundamental problem changes. As a result of these features, this problem cannot be solved by traditional scheduling techniques. The problem resembles other problems in NASA and industry, from observation scheduling for rovers and other science instruments to vehicle routing. The remainder of the paper is organized as follows. In 2 we describe the observatory in order to provide some background. In 3 we describe the problem of scheduling a single flight. In 4 we compare flight planning and other scheduling problems and argue that traditional techniques are not sufficient to solve this problem. We also mention similar complex scheduling problems which may benefit from efforts to solve this problem. In 5 we describe an approach for solving this problem based on research into a similar problem, that of sched

Policy Invariance Under Reward Transformations: Theory and Application to Reward Shaping

Modern Information Retrieval

Mathematical Modeling of Lateralization and Asymmetries in Cortical Maps

Invisible Crowds in Cyberspace: Mapping the Social Structure of the Usenet

Internet X.509 Public Key Infrastructure Extending trust in non repudiation tokens in time

Dynamic Optimization through the use of Automatic Runtime Specialization

Desiderata for a clinical terminology server

BITS: a method for bilingual text search over the Web

Anticorrelation digital halftoning

A new class of digital halftoning algorithms is introduced. Anti-correlation digital halftoning (ACDH) combines the idea of a well-known dangerous game, Russian roulette, with the statistical approach to bilevel quantization of digital images. A representative of the class, serpentine anti-correlation digital halftoning, is described and compared to error diffusion, ordered dither, and other important digital halftoning techniques. Serpentine ACDH works very well. It causes fewer unpleasant correlated artifacts and less contouring than the benchmark algorithms. The quantization noise spectra associated with serpentine ACDH possess beneficial characteristics related to properties of the vision system. The term “violet noise” is proposed to describe quantization noise with stronger bias in favor of high-frequency components than that of blue noise. Novel techniques for color visualization of the noise spectra and the corresponding phase spectra are introduced, and the relative significance of the magnitudes and phases of the discrete Fourier transform of the quantization noise is studied. Unlike popular algorithms based on error diffusion, serpentine ACDH does not enhance edges. This should be good for its application to digital holography. A simple input preprocessing technique allows one to introduce edge enhancement if desired, while keeping it more isotropic than that of error diffusion. The relation between unwanted transient boundary effects and edge enhancement accompanying error diffusion is examined, and approaches to reduction of boundary effects are considered. Serpentine ACDH does not cause significant boundary effects. The average intensity representation by different algorithms is studied for constant input levels (serpentine ACDH does remarkably well). The results of subjective testing are compared to the predictions of the popular one-channel models of the vision system. Printing at high resolutions and its application to medical imaging are studied. A

Anti-Correlation Digital Halftoning by Generalized Russian Roulette.

Annotation Graphs: A Foundation for Integrating Tools, Formats and Corpora