Browsing CSAIL Technical Reports (July 1, 2003 - present) by Issue Date
Now showing items 1-20 of 775
-
Recursively invoking Linnaeus: A Taxonomy for Naming Systems
(2002-03-01)Naming is a central element of a distributed or network system design. Appropriate design choices are central. This paper explores a taxonomy of naming systems, and engineering tradeoffs as an aid to the namespace designer. ... -
Amorphous Infrastructure for Language Implementation
(2002-12-10)We propose a method for the robust implementation of simple graphical automataon an amorphous computer. This infrastructure is applied to the implementationof purely functional programming languages. Specifically, it is ... -
Compact Representations for Fast Nonrigid Registration of Medical Images
(2003-07-04)We develop efficient techniques for the non-rigid registration of medical images by using representations that adapt to the anatomy found in such images. Images of anatomical structures typically have uniform intensity ... -
On the Max-Flow Min-Cut Ratio for Directed Multicommodity Flows
(2003-07-05)We give a pure combinatorial problem whose solution determines max-flow min-cut ratio for directed multicommodity flows. In addition, this combinatorial problem has applications in improving the approximation factor of ... -
New Algorithms for Load Balancing in Peer-to-Peer Systems
(2003-07-16)Load balancing is a critical issue for the efficient operation of peer-to-peer networks. We give new protocols for several scenarios, whose provable performance guarantees are within a constant factor of optimal. First, ... -
Selecting Refining and Evaluating Properties for Program Analysis
(2003-07-21)This research proposes and evaluates techniques for selectingpredicates for conditional program properties—thatis, implications such as p ) q whose consequent must betrue whenever the predicate is true. Conditional ... -
Secure Program Execution Via Dynamic Information Flow Tracking
(2003-07-21)We present a simple architectural mechanism called dynamicinformation flow tracking that can significantly improve thesecurity of computing systems with negligible performanceoverhead. Dynamic information flow tracking ... -
Dynamic Input/Output Automata: A Formal Model for Dynamic Systems
(2003-07-26)We present a mathematical state-machine model, the Dynamic I/O Automaton (DIOA) model, for defining and analyzing dynamic systems of interacting components. The systems we consider are dynamic in two senses: (1) components ... -
Marriage, Honesty, and Stability
(2003-07-28)Many centralized two-sided markets form a matching between participantsby running a stable marriage algorithm. It is a well-knownfact that no matching mechanism based on a stable marriage algorithmcan guarantee truthfulness ... -
Representation and Detection of Shapes in Images
(2003-08-08)We present a set of techniques that can be used to represent anddetect shapes in images. Our methods revolve around a particularshape representation based on the description of objects usingtriangulated polygons. This ... -
A Reliable Broadcast Scheme for Sensor Networks
(2003-08-11)In this short technical report, we present a simple yet effective reliable broadcast protocol for sensor networks. This protocol disseminates packets throughout the sensor network by flooding and recovers from losses ... -
Near-Optimal Distributed Failure Circumscription
(2003-08-11)Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a distributedalgorithm using ... -
Dissociated Dipoles: Image representation via non-local comparisons
(2003-08-13)A fundamental question in visual neuroscience is how to represent image structure. The most common representational schemes rely on differential operators that compare adjacent image regions. While well-suited to encoding ... -
On The Boolean Algebra of Shape Analysis Constraints
(2003-08-22)Shape analysis is a promising technique for statically verifyingand extracting properties of programs that manipulatecomplex data structures. We introduce a new characterizationof constraints that arise in parametric ... -
Direction Estimation of Pedestrian from Images
(2003-08-27)The capability of estimating the walking direction of people would be useful in many applications such as those involving autonomous cars and robots.We introduce an approach for estimating the walking direction of people ... -
The Theory of Timed I/O Automata
(2003-08-27)Revised version -- November 23, 2004.This paper presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems. -
Permutation Tests for Classification
(2003-08-28)We introduce and explore an approach to estimating statisticalsignificance of classification accuracy, which is particularly usefulin scientific applications of machine learning where highdimensionality of the data and the ... -
Fluorescence Assay for Polymerase Arrival Rates
(2003-08-31)To engineer complex synthetic biological systems will require modulardesign, assembly, and characterization strategies. The RNApolymerase arrival rate (PAR) is defined to be the rate that RNApolymerases arrive at a specified ... -
Learning object segmentation from video data
(2003-09-08)This memo describes the initial results of a project to create aself-supervised algorithm for learning object segmentation from videodata. Developmental psychology and computational experience havedemonstrated that the ... -
Investigating shape representation in area V4 with HMAX: Orientation and Grating selectivities
(2003-09-08)The question of how shape is represented is of central interest to understanding visual processing in cortex. While tuning properties of the cells in early part of the ventral visual stream, thought to be responsible for ...
