Papers.

Static and dynamic analysis of the Internet's susceptibility to faults and attacks

Assessing Test-Driven Development at IBM

Speaker independent phonetic transcription of fluent speech for large vocabulary speech recognition

Atria: cooperative agent-based recovery in a communications network

Abstract — Today's dynamic battlefield environment requires rapid reconfiguration and reorganization of warfighter assets, communication links, and computing resources in response to enemy attacks. The extent to which supporting operations can take place autonomously, and thus more rapidly, could be critical to neutralizing future enemy threats. This paper describes a software system developed at The Aerospace Corporation called Automated Threat Response using Intelligent Agents (ATRIA). ATRIA agents detect signals indicating an enemy theater ballistic missile attack and then automatically gather strategic data, generate internal plans, and task surveillance and strike resources to track and destroy the missiles. The agents discover and access data and resources distributed across a dynamic, wide area network. In earlier reported

What precision electroweak physics says about the SU(6) / Sp(6) little Higgs

Scalar dark matter from theory space

Little Higgs and custodial SU(2)

Creation of massive particles in a tunneling universe

We examine the particle production during tunneling in quantum cosmology. We consider a minisuperspace model with a massive, conformally coupled scalar field and a uniform radiation background. In this model, we construct a semiclassical wave function describing a small recollapsing universe and a nucleated inflating universe (``tunneling from something''). We find that the quantum states of the scalar field in both the initial and the nucleated universe are close to the adiabatic vacuum, the number of created particles is small, and their backreaction on the metric is negligible. We show that the use of the semiclassical approximation is justified for this wave function. Our results imply that the creation of the universe from nothing can be understood as a limit of tunneling from a small recollapsing universe.

Explaining Biology to Computers

Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks

Fringe analysis of synchronized parallel insertion algorithms in 2–3 Trees

Optimal binary search trees with costs depending on the access paths

PowerPoint: shot with its own bullets.

Geometry of minimum spanning trees on scale-free networks

Information retrieval in the Web: beyond current search engines

A Nominal Theory of Objects with Dependent Types

A Three Level Search Engine Index Based in Query Log Distribution

Measures and Maps of Usenet

Combinatorial Pattern Matching

Computing the Incomplete Gamma Function to Arbitrary Precision

Uniform Approximations for Transcendental Functions

An Interface Model for Parallel Components

Postmortem Object Type Identification

This paper presents a novel technique for the automatic type identification of arbitrary memory objects from a memory dump. Our motivating application is debugging memory corruption problems in optimized, production systems — a problem domain largely unserved by extant methodologies. We describe our algorithm as applicable to any typed language, and we discuss it with respect to the formidable obstacles posed by C. We describe the heuristics that we have developed to overcome these difficulties and achieve effective type identification on C-based systems. We further describe the implementation of our heuristics on one Cbased system — the Solaris operating system kernel — and describe the extensions that we have added to the Solaris postmortem debugger to allow for postmortem type identification. We show that our implementation yields a sufficiently high rate of type identification to be useful for debugging memory corruption problems. Finally, we discuss some of the novel automated debugging mechanisms that can be layered upon postmortem type identification.

XML retrieval

Use Cases as Aspects - An Approach to Software Composition

UBICUIDAD Y USABILIDAD EN LA WEB

TransType2 - a new paradigm for translation automation

The aim of TransType2 (TT2) is to develop a new kind of Computer-Assisted Translation system. The innovative solution proposed by TT2 is to embed a data driven Machine Translation engine within an interactive translation environment, combining the CAT and MT paradigms.

The Role of Aspect-Oriented Programming in OMG's Model-Driven Architecture

TelegraphCQ: Continuous Dataflow Processing for an Uncertain World

TelegraphCQ: An Architectural Status Report

Supporting UPA and restriction on an extension of XML Schema

Statistical Relational Learning for Link Prediction

Link prediction is a complex, inherently relational, task. Be it in the domain of scientific citations, social networks or hypertext links, the underlying data are extremely noisy and the characteristics useful for prediction are not readily available in a "flat" file format, but rather involve complex relationships among objects. In this paper, we propose the application of our methodology for Statistical Relational Learning to building link prediction models. We propose an integrated approach to building regression models from data stored in relational databases in which potential predictors are generated by structured search of the space of queries to the database, and then tested for inclusion in a logistic regression. We present experimental results for the task of predicting citations made in scientific literature using relational data taken from CiteSeer. This data includes the citation graph, authorship and publication venues of papers, as well as their word content.

Seneschal: classification and analysis in supervised mixture-modelling

Proceedings of the 14th annual conference on Combinatorial pattern matching

Power Management for Portable Devices

Morphological Effects on Default Stress in Novel Russian Words

Metadata Management in the Celebrate European Learning Network

Max-Margin Markov Networks

Mastering Enterprise JavaBeans (OpenAlex indexes the 2003 Japanese translation, Shoeisha)

Guide to designing, implementing and deploying EJB solutions - session and entity beans, message-driven beans, transactions, persistence and enterprise architecture patterns.

Integrating pharmacokinetics knowledge into a drug ontology: as an extension to support pharmacogenomics

Fundamentals of SVG Programming

Facilitating Agent Navigation Using DSM - High Level Designs

Evolution of the Web Structure.

Efficiently Inducing Features of Conditional Random Fields

Combinatorial Pattern Matching, 14th Annual Symposium, CPM 2003, Morelia, Michoc~A¡n, Mexico, June 25-27, 2003, Proceedings

Color Gamut Characterization Via Ray Tracing for Device Profile Generation.

Color gamut characterization is an essential step in the ICC profile generation for imaging devices. It is also needed as part of evaluation and comparison of image quality achievable by different imaging systems. A novel technique is presented for characterizing the color gamut of an imaging device via ray tracing in the CIELAB color space. Initially, the convex hull of the set of measurement points is computed in the device space. Each of the resulting simplices in the convex hull structure has a set of CIELAB data triples associated with its vertices. The local convex hull is computed for each of those sets separately in CIELAB. The convex hull triangles are then subjected to a ray tracing procedure aimed at approximating the maximum achievable chroma for a set of pairs of L and hue angle values. For the purpose of the device profile generation, this set is derived from the set of grid points in the PCS (profile connection space) that have to be mapped to the device space. It is shown that the new method characterizes the gamut surface and volume better than the conventional technique based on computing the global convex hull of the measurement data points in CIELAB.

AURA: A mobile platform for object and location annotation

Assessing Test-Driven Development at IBM

In a software development group of IBM Retail Store Solutions, we built a non-trivial software system based on a stable standard specification using a disciplined, rigorous unit testing and build approach based on the test-driven development (TDD) practice. Using this practice, we reduced our defect rate by about 50 percent compared to a similar system that was built using an ad-hoc unit testing approach. The project completed on time with minimal development productivity impact. Additionally, the suite of automated unit test cases created via TDD is a reusable and extendable asset that will continue to improve quality over the lifetime of the software system. The test suite will be the basis for quality checks and will serve as a quality contract between all members of the team. 1

AspectJ in Action: Practical Aspect-Oriented Programming

Artificial intelligence - a modern approach, 2nd Edition