A protocol study has been conducted which examines the strategies intermediate level programmers use along and the errors which are made when a small number of experimental problems written using the language C++ are maintained. An integrated compilation and editing environment has been developed which captures editing events, such as cursor movements, keystrokes and compilation attempts. Maint...

Plan-do compilation technique is a new, advanced compilation framework for eager data transfer on distributed-memory parallel architectures. The technique is especially eective for a recent breed of low-latency architectures by realizing a high-throughput low-latency communication scheme, pipelined sends. The compilation of high-level, plan-do style code into low-level, eager data transfer code...

{ Q1.1: What product model to apply? Most SCM tools are still based on les. It is highly desirable to support more sophisticated data models for representing typed objects, relationships, and attributes. { Q1.2: What version model to apply? E.g. choose a state-based versioning (variants and revisions) or a change-based versioning (conditional compilation with more liberal delta combinations)? T...

The reduced implicate trie, introduced in [11], is a data structure that may be used as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. Specifically, a query can be processed in time linear in the size of the query regardless of the size of the compiled knowledge base. The knowledge compilation paradigm typically as...

Synchronous Data Flow (SDF) is a popular model for analyzing workflows. It is well-known that self-timed scheduling, starting a task when all its prerequisites are satisfied, is throughput-optimal for SDF graphs. Just-in-time scheduling in the presence of deadlines has so far received little attention in the literature. We show that a feasible just-in-time schedule exists if and only if a feasi...

This paper describes the development of a data mining system that is to operate on NASA’s Information Power Grid (IPG). Mining agents will be staged to one or more processors on the IPG. There they will grow using just-intime acquision of new operations. They will mine data delivered using just-in-time delivery. Some initial experimental results are presented.

A~-This paper compares two implementation models for abstract data types: direct and indirect implementations. Direct implementations offer relatively cheap execution and expensive compilation costs while indirect implementations result in relatively expensive implementations and cheap compilation costs. These two models are both accommodated by Ada, and a small experiment compares their costs ...