Papers.

NetLogo: A Simple Environment for Modeling Complexity

NCI Thesaurus: using science-based terminology to integrate cancer research results

Low emittance gun project based on field emission

LATTE: Location and Time Triggered Email

INTEGRATING CONTEXT FOR INFORMATION FUSION : AUTOMATING INTELLIGENCE PREPARATION OF THE BATTLEFIELD

Integrated Annotation for Biomedical Information Extraction

Independently Extensible Solutions to the Expression Problem

Abstract The expression problem is fundamental for the develop- ment of extensible software. Many (partial) solutions to this important problem have been proposed in the past. None of these approaches solves the problem of using different, independent extensions jointly. This paper pro- poses solutions to the expression problem that make it possible to combine independent extensions in a flexible, modular, and type-safe way. The solutions, formulated in the programming language Scala, are affected with only a small implementation overhead and are easy to imple- ment by hand. 1 The Expression Problem Since software evolves over time, it is essential for soft- ware systems to be extensible. But the development of extensible software poses many design and implemen- tation problems, especially, if extensions cannot be an- ticipated. The expression problem is probably the most fundamental one among these problems. It arises when recursively defined datatypes and operations on these types have to be extended simultaneously. The term ex- pression problem was originally coined by Phil Wadler in a post on the Java-Genericity mailing list [25], in which he also proposed a solution written in an extended version of Generic Java [3]. Only later it appeared that Wadler's solution could not be typed. For this paper, we paraphrase the problem in the fol- lowing way: Suppose we have a datatype which is defined by a set of cases and we have processors which operate on this datatype. There are primarily two directions along which we can extend such a system: * The extension of the datatype with new data vari-ants, * The addition of new processors. We require that processors handle only a finite number of data variants and thus do not provide defaults which could handle...

How Valuable is External Link Evidence When Searching Enterprise Webs?

Homogenization of Acoustic Wave Propagation in a Magnetorheological Fluid

Federated Search of Learning Object Repositories: the CeLeBraTe Approach

Exploiting Context for Biomedical Entity Recognition: From Syntax to the Web

Electron beam dynamics simulations for the low emittance gun

In the scope of the LEG Project at PSI [1][2] a field emitter array (FEA) cathode is being considered as an electron source. We present simulation results for a gun test stand performed with the code MAFIA [3] as well as report on the novel parallel 3D PIC code ”Capone” which will allow realistic simulation of particle emission from FEA cathodes with the required sub-micron resolution.

Dynamics of the Chilean Web Structure.

Dynamic Instrumentation of Production Systems

Classification of Stock Exchange News

Beyond “From” and “Received”: Social Sorting for Email Triage

An Overview of the Scala Programming Language

Scala fuses object-oriented and functional programming in a statically typed programming language. It is aimed at the construction of components and component systems. This paper gives an overview of the Scala language for readers who are familar with programming methods and programming language design.

An introduction to the BitTorrent Peer-to-Peer File-Sharing System

Achieving "source transparency" in the UMLS Metathesaurus

Achieving Extensibility and Reuse for XSLT 2.0 Stylesheets

A Two-Stage Algorithm for Support Vector Machines

A retroesophageal right subclavian artery originating from the left aortic arch -- a case report and review of the literature.

A Pervasive Application Rights Management Architecture (PARMA) based on ODRL

A Measurement Study of the BitTorrent Peer-to-Peer File-Sharing System

A Constrained Optimization Framework for Wireless Networking in Multi-Vehicle Applications

A case report of Noonan's syndrome with pulmonary valvar stenosis and coronary aneurysms.

Meta-learning orthographic and contextual models for language independent named entity recognition

Efficient Solution Algorithms for Factored MDPs

This paper addresses the problem of planning under uncertainty in large Markov Decision Processes (MDPs). Factored MDPs represent a complex state space using state variables and the transition model using a dynamic Bayesian network. This representation often allows an exponential reduction in the representation size of structured MDPs, but the complexity of exact solution algorithms for such MDPs can grow exponentially in the representation size. In this paper, we present two approximate solution algorithms that exploit structure in factored MDPs. Both use an approximate value function represented as a linear combination of basis functions, where each basis function involves only a small subset of the domain variables. A key contribution of this paper is that it shows how the basic operations of both algorithms can be performed efficiently in closed form, by exploiting both additive and context-specific structure in a factored MDP. A central element of our algorithms is a novel linear program decomposition technique, analogous to variable elimination in Bayesian networks, which reduces an exponentially large LP to a provably equivalent, polynomial-sized one. One algorithm uses approximate linear programming, and the second approximate dynamic programming. Our dynamic programming algorithm is novel in that it uses an approximation based on max-norm, a technique that more directly minimizes the terms that appear in error bounds for approximate MDP algorithms. We provide experimental results on problems with over 10^40 states, demonstrating a promising indication of the scalability of our approach, and compare our algorithm to an existing state-of-the-art approach, showing, in some problems, exponential gains in computation time.

Expertise identification using email communications

A common method for finding information in an organization is to use social networks---ask people, following referrals until someone with the right information is found. Another way is to automatically mine documents to determine who knows what. Email documents seem particularly well suited to this task of "expertise location", as people routinely communicate what they know. Moreover, because people explicitly direct email to one another, social networks are likely to be contained in the patterns of communication. Can these patterns be used to discover experts on particular topics? Is this approach better than mining message content alone? To find answers to these questions, two algorithms for determining expertise from email were compared: a content-based approach that takes account only of email text, and a graph-based ranking algorithm (HITS) that takes account both of text and communication patterns. An evaluation was done using email and explicit expertise ratings from two different organizations. The rankings given by each algorithm were compared to the explicit rankings with the precision and recall measures commonly used in information retrieval, as well as the d' measure commonly used in signal-detection theory. Results show that the graph-based algorithm performs better than the content-based algorithm at identifying experts in both cases, demonstrating that the graph-based algorithm effectively extracts more information than is found in content alone.

Standards for databases on the grid

Graph-based ranking algorithms for e-mail expertise analysis

In this paper we study graph--based ranking measures for the purpose of using them to rank email correspondents according to their degree of expertise on subjects of interest. While this complete expertise analysis consists of several steps, in this paper we focus on the analysis of digraphs whose nodes correspond to correspondents (people), whose edges correspond to the existence of email correspondence between the people corresponding to the nodes they connect and whose edge directions point from the member of the pair whose relative expertise has been estimated to be higher. We perform our analysis on both synthetic and real data and we introduce a new error measure for comparing ranked lists.

A theory of redo recovery

TelegraphCQ: continuous dataflow processing

A characterization of the sensitivity of query optimization to storage access cost parameters

Joeq

Checking and inferring local non-aliasing

What Are Web Services?

Session details: Web crawling and measurement

<title>Update on INCITS W1.1 standard for evaluating the color rendition of printing systems</title>

The color rendition <i>ad hoc</i> team of INCITS W1.1 is working to address issues related to color and tone reproduction for printed output and its perceptual impact on color image quality. The scope of the work includes accuracy of specified colors with emphasis on memory colors, color gamut, and the effective use of tone levels, including issues related to contouring. The team has identified three sub-attributes of color rendition: (1) color quantization -- defined as the ability to merge colors where needed, (2) color scale -- defined as the ability to distinguish color where needed, and (3) color fidelity -- defined as the ability to match colors. Visual definitions and descriptions of how these sub-attributes are perceived have been developed. The team is presently defining measurement methods for these, with the first of the sub-attributes considered being color quantization. More recently, the problem of measuring color fidelity has been undertaken. This presentation will briefly review the definitions and appearance of the proposed sub-attributes. The remainder of the discussion will focus on the progress to date of developing test targets and associated measurement methods to quantify the color quantization and color fidelity sub-attributes.

Novel Vehicle Stability Control Using Steer-by-Wire and Independent Four Wheel Torque Distribution

Application-directed voltage scaling

Parameter convergence in nonlinearly parameterized systems

The EC query language applied to old manuscripts

Spaghettis: an array based algorithm for similarity queries in metric spaces

The ADT proximity and text proximity problems

A fast algorithm on average for all-against-all sequence matching

Aspect-oriented programming will improve quality

Alternative Implementation Techniques for Web Text Visualization

A feasible low-power augmented-reality terminal

Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling

Distributed memory parallel systems such as the IBM SP2 execute jobs using variable partitioning. Scheduling jobs in FCFS order leads to severe fragmentation and utilization loss, which lead to the development of backfilling schedulers such as EASY. This paper presents a backfilling scheduler that improves EAST in two ways: It supports both user selected and administrative priorities, and guarantees a bounded wait time for all jobs. The scheduler gives each waiting job a slack, which determines how long it may have to wait before running: 'important' and 'heavy' jobs will have little slack in comparison with others. Experimental results show that the priority scheduler reduces the average wait time by about 15% relative to EASY in an equal priorities scenario, and is responsive to differential priorities as well.