Computer Science and Artificial Intelligence Lab (CSAIL): Recent submissions

Now showing items 381-400 of 2625

  • New Resiliency in Truly Combinatorial Auctions (and Implementation in Surviving Strategies) 

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

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

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

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

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

    Michael Ernst; Program Analysis (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 

    Michael Ernst; Program Analysis (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) 

    Jovan Popovic; Computer Graphics (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 

    Jovan Popovic; Computer Graphics (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 

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

  • Using Message Passing Instead of the GOTO Construct 

    Unknown author (MIT Artificial Intelligence Laboratory, 1978-04)
    This paper advocates a programming methodology using message passing. Efficient programs are derived for fast exponentiation, merging ordered sequences, and path existence determination in a directed graph. The problems ...

  • Computer Detection of Bent Fingers in Lead Bonding Frames 

    Unknown author (MIT Artificial Intelligence Laboratory, 1976-01)
    In the production of logic circuits in dual inline packages, various tedious assembly line tasks are performed by human operators using microscopes or television enlargements. One boring and difficult task is the detection ...

  • The Fundamental Eel Equations 

    Unknown author (MIT Artificial Intelligence Laboratory, 1975-12)
    Details of the kinematics, statics, and dynamics of a particularly simple form of locomotory system are developed to demonstrate the importance of understanding the behavior of the mechanical system interposed between the ...

  • The Intersection Problem 

    Unknown author (MIT Artificial Intelligence Laboratory, 1975-11)
    This paper is intended as a supplement to AI MEMO 331, "A System for Representing and Using Real-World Knowledge". It is an attempt to redefine and clarify what I now believe the central theme of the research to be. Briefly, ...

  • One System for Two Tasks: A Commonsense Algorithm Memory that Solves Problems and Comprehends Language 

    Unknown author (MIT Artificial Intelligence Laboratory, 1975-11)
    Plan synthesis and language comprehension, or more generally, the act of discovering how one perception relates to others, are two sides of the same coin, because they both rely on a knowledge of cause and effect - algorithmic ...

  • On Solving The Findspace Problem, or How to Find Out Where Things Aren't .... 

    Unknown author (MIT Artificial Intelligence Laboratory, 1973-03-29)

  • Garbage Collection in a Very Large Address Space 

    Unknown author (MIT Artificial Intelligence Laboratory, 1975-09)
    The address space is broken into areas that can be garbage collected separately. An area is analogous to a file on current systems. Each process has a local computation area for its stack and temporary storage that is ...

  • Assigning Hierarchical Descriptions to Visual Assemblies of Blocks with Occlusion 

    Unknown author (MIT Artificial Intelligence Laboratory, 1975-10)
    This memo describes a program for parsing simple two-dimensional piles of blocks into plausible nested subassemblies. Each subassembly must be one of a few types known to the program, such as stack, tower, or arch. Each ...

  • Application of Data Flow Computation to the Shaded Image Problem 

    Unknown author (MIT Artificial Intelligence Laboratory, 1978-05)
    This paper presents a method of producing shaded images of terrain at an extremely fast rate by exploiting parallelism. The architecture of the Data Flow Computer is explained along with an appropriate "program" to compute ...

  • What is Delaying the Manipulator Revolution? 

    Unknown author (MIT Artificial Intelligence Laboratory, 1978-02)
    Despite two decades of work on mechanical manipulators and their associated controls, we do not see wide-spread application of these devices to many of the tasks to which they seem so obviously suited. Somehow, a variety ...