Open Access Repositories: Recent submissions

Now showing items 2381-2400 of 4204

  • Quantitative Information-Flow Tracking for C and Related Languages 

    Unknown author (2006-11-17)
    We present a new approach for tracking programs' use of data througharbitrary calculations, to determine how much information about secretinputs is revealed by public outputs. Using a fine-grained dynamicbit-tracking ...

  • A Fast Approximation of the Bilateral Filter using a Signal Processing Approach 

    Unknown author (2006-11-09)
    The bilateral filter is a nonlinear filter that smoothes a signal while preserving strong edges. It has demonstrated great effectiveness for a variety of problems in computer vision and computer graphics, and fast versions ...

  • On the Adaptive Real-Time Detection of Fast-Propagating Network Worms 

    Unknown author (2006-11-10)
    We present two light-weight worm detection algorithms thatoffer significant advantages over fixed-threshold methods.The first algorithm, RBS (rate-based sequential hypothesis testing)aims at the large class of worms that ...

  • On Using First-Order Theorem Provers in the Jahob Data Structure Verification System 

    Unknown author (2006-11-09)
    This paper presents our integration of efficient resolution-based theorem provers into the Jahob data structure verification system. Our experimental results show that this approach enables Jahob to automatically ...

  • Analogical Retrieval via Intermediate Features: The Goldilocks Hypothesis 

    Unknown author (2006-11-07)
    Analogical reasoning has been implicated in many important cognitive processes, such as learning, categorization, planning, and understanding natural language. Therefore, to obtain a full understanding of these processes, ...

  • Implementing Atomic Data through Indirect Learning in Dynamic Network 

    Unknown author (2006-10-12)
    Developing middleware services for dynamic distributed systems, e.g., ad-hoc networks, is a challenging task given that suchservices must deal with communicating devices that may join and leave the system, and fail or ...

  • Programming a Sensor Network as an Amorphous Medium 

    Unknown author (2006-06)
    In many sensor network applications, the network is deployedto approximate a physical space. The network itself is not ofinterest: rather, we are interested in measuring the propertiesof the space it fills, and of establishing ...

  • The Design of a Relational Engine 

    Unknown author (2006-09-29)
    The key design challenges in the construction of a SAT-based relational engine are described, and novel techniques are proposed to address them. An efficient engine must have a mechanism for specifying partial solutions, ...

  • Adaptation for Regularization Operators in Learning Theory 

    Unknown author (2006-09-10)
    We consider learning algorithms induced by regularization methods in the regression setting. We show that previously obtained error bounds for these algorithms using a-priori choices of the regularization parameter, can ...

  • Optimal Rates for Regularization Operators in Learning Theory 

    Unknown author (2006-09-10)
    We develop some new error bounds for learning algorithms induced by regularization methods in the regression setting. The "hardness" of the problem is characterized in terms of the parameters r and s, the first related ...

  • Ubiquitous Memory Introspection (Preliminary Manuscript) 

    Unknown author (2006-09-25)
    Modern memory systems play a critical role in the performance ofapplications, but a detailed understanding of the application behaviorin the memory system is not trivial to attain. It requires timeconsuming simulations of ...

  • RingScalar: A Complexity-Effective Out-of-Order Superscalar Microarchitecture 

    Unknown author (2006-09-18)
    RingScalar is a complexity-effective microarchitecture for out-of-order superscalar processors, that reduces the area, latency, and power of all major structures in the instruction flow. The design divides an N-way ...

  • Combined static and dynamic mutability analysis 

    Unknown author (2006-09-17)
    Knowing which method parameters may be mutated during a method'sexecution is useful for many software engineering tasks. We presentan approach to discovering parameter immutability, in which severallightweight, scalable ...

  • Virtual Monotonic Counters and Count-Limited Objects using a TPM without a Trusted OS (Extended Version) 

    Unknown author (2006-09-11)
    A trusted monotonic counter is a valuable primitive thatenables a wide variety of highly scalable offlineand decentralized applications that would otherwise be prone to replay attacks, including offline payment, e-wallets, ...

  • Refactoring for parameterizing Java classes 

    Unknown author (2006-09-05)
    Type safety and expressiveness of many existing Java libraries and theirclient applications would improve, if the libraries were upgraded to definegeneric classes. Efficient and accurate tools exist to assist clientapplications ...

  • Task-Structured Probabilistic I/O Automata 

    Unknown author (2006-09-05)
    Modeling frameworks such as Probabilistic I/O Automata (PIOA) andMarkov Decision Processes permit both probabilistic andnondeterministic choices. In order to use such frameworks to express claims about probabilities of ...

  • Javari: Adding Reference Immutability to Java 

    Unknown author (2006-09-05)
    This paper describes a programming language, Javari, that is capable of expressing and enforcing immutability constraints. The specific constraint expressed is that the abstract state of the object to which an immutable ...

  • Random Lens Imaging 

    Unknown author (2006-09-02)
    We call a random lens one for which the function relating the input light ray to the output sensor location is pseudo-random. Imaging systems with random lensescan expand the space of possible camera designs, allowing new ...

  • Finding the needles in the haystack: Generating legal test inputs for object-oriented programs 

    Unknown author (2006-08-31)
    A test input for an object-oriented program typically consists of asequence of method calls that use the API defined by the programunder test. Generating legal test inputs can be challenging because,for some programs, the ...

  • Learning with Online Constraints: Shifting Concepts and Active Learning 

    Unknown author (2006-09-01)
    Many practical problems such as forecasting, real-time decisionmaking, streaming data applications, and resource-constrainedlearning, can be modeled as learning with online constraints. Thisthesis is concerned with analyzing ...