Open Access Repositories: Recent submissions

Now showing items 2621-2640 of 4204

  • A Stream Algorithm for the SVD 

    Unknown author (2003-10-22)
    We present a stream algorithm for the Singular-Value Decomposition (SVD) of anM X N matrix A. Our algorithm trades speed of numerical convergence for parallelism,and derives from a one-sided, cyclic-by-rows Hestenes SVD. ...

  • Updatable Zero-Knowledge Sets 

    Unknown author (2003-10-14)
    We build on the work of Micali, Rabin, and Killian [4] to introduce zero-knowledge sets and databases that may be updated in a desirable way. In particular, in order to make an update the owner of the set must publish a ...

  • A Correctness Proof for a Byzantine-Fault-Tolerant Read/Write Atomic Memory with Dynamic Replica Membership 

    Unknown author (2003-09-25)
    We prove correctness of a Byzantine-fault-tolerant replication algorithm for a read/writeatomic memory that supports a dynamic replica set.

  • Investigating shape representation in area V4 with HMAX: Orientation and Grating selectivities 

    Unknown author (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 ...

  • Exploiting Vector Parallelism in Software Pipelined Loops 

    Unknown author (2005-06-03)
    An emerging trend in processor design is the incorporation of short vector instructions into the ISA. In fact, vector extensions have appeared in most general-purpose microprocessors. To utilize these instructions, ...

  • Dynamic Input/Output Automata: A Formal Model for Dynamic Systems 

    Unknown author (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 ...

  • On Our Experience with Modular Pluggable Analyses 

    Unknown author (2004-10-04)
    We present a technique that enables the focused applicationof multiple analyses to di erent modules in thesame program. In our approach, each module encapsulatesone or more data structures and uses membershipin abstract ...

  • Pyramid Match Kernels: Discriminative Classification with Sets of Image Features 

    Unknown author (2005-03-17)
    Discriminative learning is challenging when examples are setsof local image features, and the sets vary in cardinality and lackany sort of meaningful ordering. Kernel-based classificationmethods can learn complex decision ...

  • Systematic Conformational Search with Constraint Satisfaction 

    Unknown author (2004-10-01)
    Throughout biological, chemical, and pharmaceutical research,conformational searches are used to explore the possiblethree-dimensional configurations of molecules. This thesis describesa new systematic method for ...

  • Automatic Software Upgrades for Distributed Systems (PhD thesis) 

    Unknown author (2005-10-06)
    Upgrading the software of long-lived, highly-available distributedsystems is difficult. It is not possible to upgrade all the nodes in asystem at once, since some nodes may be unavailable and halting thesystem for an ...

  • Selectivity of Local Field Potentials in Macaque Inferior Temporal Cortex 

    Unknown author (2004-09-21)
    While single neurons in inferior temporal (IT) cortex show differential responses to distinct complex stimuli, little is known about the responses of populations of neurons in IT. We recorded single electrode data, including ...

  • The Interval Programming Model for Multi-objective Decision Making 

    Unknown author (2004-09-27)
    The interval programming model (IvP) is a mathematical programmingmodel for representing and solving multi-objective optimizationproblems. The central characteristic of the model is the use ofpiecewise linearly defined ...

  • The Quorum Deployment Problem 

    Unknown author (2004-10-29)
    Quorum systems are commonly used to maintain the consistency of replicated data in adistributed system. Much research has been devoted to developing quorum systems with good theoreticalproperties, such as fault tolerance ...

  • Eclat: Automatic Generation and Classification of Test Inputs 

    Unknown author (2004-10-14)
    This paper describes a technique that helps a test engineerselect, from a large set of randomly generated testinputs, a small subset likely to reveal faults in the softwareunder test. The technique takes a program or ...

  • The Architecture of MAITA: A Tool for Monitoring, Analysis, and Interpretation 

    Unknown author (2004-05-18)
    This report describes the aims, functions, and organization of the MAITAsystem for knowledge-based construction, adaptation, and control of networks of monitoringprocesses.

  • Implementing Asynchronous Distributed Systems Using the IOA Toolkit 

    Unknown author (2004-10-06)
    This document is a report about the capabilities and performance of the IOA Toolkit, and in particularthe tools that provide support for implementing and running distributed systems (checker,composer, code generator). The ...

  • Predictive identification of alternative events conserved in human and mouse 

    Unknown author (2004-09-30)
    Alternative pre-messenger RNA splicing affects a majority of human genes and plays important roles in development and disease. Alternative splicing (AS) events conserved since the divergence of human and mouse are likely ...

  • A Reliable Broadcast Scheme for Sensor Networks 

    Unknown author (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 ...

  • On The Boolean Algebra of Shape Analysis Constraints 

    Unknown author (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 ...

  • Permutation Tests for Classification 

    Unknown author (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 ...