Open Access Repositories: Recent submissions
Now showing items 1941-1960 of 4204
-
Stochastic Digital Circuits for Probabilistic Inference
(2008-11-24)We introduce combinational stochastic logic, an abstraction that generalizes deterministic digital circuit design (based on Boolean logic gates) to the probabilistic setting. We show how this logic can be combined with ...
-
Modeling Computational Security in Long-Lived Systems, Version 2
(2008-11-22)For many cryptographic protocols, security relies on the assumption that adversarial entities have limited computational power. This type of security degrades progressively over the lifetime of a protocol. However, some ...
-
Resilient Mechanisms For Truly Combinatorial Auctions
(2008-11-13)Dominant-strategy truthfulness is traditionally considered the best possible solution concept in mechanism design, as it enables one to predict with confidence which strategies INDEPENDENT players will actually choose. ...
-
MOOS-IvP Autonomy Tools Users Manual
(2008-11-11)This document describes seven common MOOS-IvP autonomy tools. The uHelmScope application provides a run-time scoping window into the state of an active IvP Helm executing its mission. The pMarineViewer application is a ...
-
Energy Scalability of On-Chip Interconnection Networks in Multicore Architectures
(2008-11-11)On-chip interconnection networks (OCNs) such as point-to-point networks and buses form the communication backbone in systems-on-a-chip, multicore processors, and tiled processors. OCNs can consume significant portions of ...
-
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. ...
-
One Video Stream to Serve Diverse Receivers
(2008-10-18)The fundamental problem of wireless video multicast is to scalably serve multiple receivers which may have very different channel characteristics. Ideally, one would like to broadcast a single stream that allows each ...
-
Adaptive Kernel Methods Using the Balancing Principle
(2008-10-16)The regularization parameter choice is a fundamental problem in supervised learning since the performance of most algorithms crucially depends on the choice of one or more of such parameters. In particular a main theoretical ...
-
Modular Generation and Customization
(2008-10-10)Modularity and flexibility can conflict in multi-language systems. For example, the templates commonly used to generate web pages must be manually updated when the database schema changes. Modularity can be improved by ...
-
The Case for a Factored Operating System (fos)
(2008-10-08)The next decade will afford us computer chips with 1,000 - 10,000 cores on a single piece of silicon. Contemporary operating systems have been designed to operate on a single core or small number of cores and hence are not ...
-
New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies)
(2008-10-08)Following Micali and Valiant [MV07.a], a mechanism is resilient if it achieves its objective without any problem of (1) equilibrium selection and (2) player collusion. To advance resilient mechanism design,We put forward ...
-
ZigZag Decoding: Combating Hidden Terminals In Wireless Networks
(2008-10-01)This paper presents ZigZag, an 802.11 receiver design that combats hidden terminals. ZigZag's core contribution is a new form of interference cancellation that exploits asynchrony across successive collisions. Specifically, ...
-
Refactoring Sequential Java Code for Concurrency via Concurrent Libraries
(2008-09-30)Parallelizing existing sequential programs to run efficiently on multicores is hard. The Java 5 packagejava.util.concurrent (j.u.c.) supports writing concurrent programs: much of the complexity of writing threads-safe and ...
-
Rank Priors for Continuous Non-Linear Dimensionality Reduction
(2008-09-26)Non-linear dimensionality reduction methods are powerful techniques to deal with high-dimensional datasets. However, they often are susceptible to local minima and perform poorly when initialized far from the global optimum, ...
-
Stochastic Combinatorial Optimization with Risk
(2008-09-13)We consider general combinatorial optimization problems that can be formulated as minimizing the weight of a feasible solution wT x over an arbitrary feasible set. For these problems we describe a broad class of corresponding ...
-
Automatic Creation of SQL Injection and Cross-Site Scripting Attacks
(2008-09-10)We present a technique for finding security vulnerabilitiesin Web applications. SQL Injection (SQLI) and cross-sitescripting (XSS) attacks are widespread forms of attackin which the attacker crafts the input to the application ...
-
How do programs become more concurrent? A story of program transformations
(2008-09-05)For several decades, programmers have relied onMooreâ s Law to improve the performance of their softwareapplications. From now on, programmers need to programthe multi-cores if they want to deliver efficient code. Inthe ...
-
Style Translation for Human Motion (Supplemental Material)
(2005-08-01)Style translation is the process of transforming an input motion into a new style while preserving its original content. This problem is motivated by the needs of interactive applications, which require rapid processing ...
-
Interactive Simulation of Stylized Human Locomotion
(2008-08-01)Animating natural human motion in dynamic environments is difficult because of complex geometric and physical interactions. Simulation provides an automatic solution to parts of this problem, but it needs control systems ...
-
Mini-Robot Group User's Guide Part 1: The 11/45 System
(MIT Artificial Intelligence Laboratory, 1978-06)This USER'S GUIDE is in two parts. Part 1 describes the facilities of the mini-robot group 11/45 and the software available to persons using those facilities. It is intended for those writing their own programs to be run ...
