Browsing CSAIL Technical Reports (July 1, 2003 - present) by Title

Now showing items 675-694 of 775

    • SWIFT: A Narrowband-Friendly Cognitive Wideband Network 

      Sodini, Charles; Edalat, Farinaz; Katabi, Dina; Kushman, Nate; Rahul, Hariharan (2008-08-17)
      Wideband technologies in the unlicensed spectrum can satisfy the ever-increasing demands for wireless bandwidth created by emerging rich media applications. The key challenge for such systems, however, is to allow narrowband ...

    • Symbolic Execution for (Almost) Free: Hijacking an Existing Implementation to Perform Symbolic Execution 

      Near, Joseph P.; Jackson, Daniel (2014-04-22)
      Symbolic execution of a language is traditionally achieved by replacing the language s interpreter with an entirely new interpreter. This may be an unnecessary burden, and it is tempting instead to try to use as much of ...

    • Synthesis of Randomized Accuracy-Aware Map-Fold Programs 

      Misailovic, Sasa; Rinard, Martin (2013-12-29)
      We present Syndy, a technique for automatically synthesizing randomized map/fold computations that trade accuracy for performance. Given a specification of a fully accurate computation, Syndy automatically synthesizes ...

    • Systematic Conformational Search with Constraint Satisfaction 

      Tucker-Kellogg, Lisa (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 ...

    • Systematic Removal of Nondeterminism for Code Generation in I/O Automata 

      Vaziri, Mandana; Tauber, Joshua A.; Tsai, Michael J.; Lynch, Nancy (2004-07-19)
      The Input/Output (I/O) automaton model developed by Lynch and Tuttle models components in asynchronous concurrentsystems as labeled transition systems. IOA is a precise language for describing I/O automata and for stating ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2009.)
      Modeling frameworks such as Probabilistic I/O Automata (PIOA) and Markov Decision Processes permit both probabilistic and nondeterministic choices. In order to use these frameworks to express claims about probabilities of ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-31)
      In the Probabilistic I/O Automata (PIOA) framework, nondeterministicchoices are resolved using perfect-information schedulers,which are similar to history-dependent policies for Markov decision processes(MDPs). These ...

    • Task-Structured Probabilistic I/O Automata 

      Canetti,, Ran; Cheung,, Ling; Kaynar,, Dilsun; Liskov,, Moses; Lynch,, Nancy; e.a. (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 ...

    • tBurton: A Divide and Conquer Temporal Planner 

      Wang, David; Williams, Brian C. (2014-10-24)
      Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices while meeting deadlines and achieving durative goals. For example, a planner for ...

    • Team MIT Urban Challenge Technical Report 

      Leonard, John; Barrett, David; How, Jonathan; Teller, Seth; Antone, Matt; e.a. (2007-12-14)
      This technical report describes Team MIT’s approach to theDARPA Urban Challenge. We have developed a novel strategy forusing many inexpensive sensors, mounted on the vehicle periphery,and calibrated with a new cross-­modal ...

    • Temporally Scalable Visual SLAM using a Reduced Pose Graph 

      Johannsson, Hordur; Kaess, Michael; Fallon, Maurice; Leonard, John J. (2012-05-25)
      In this paper, we demonstrate a system for temporally scalable visual SLAM using a reduced pose graph representation. Unlike previous visual SLAM approaches that use keyframes, our approach continually uses new measurements ...

    • The Tensor Algebra Compiler 

      Kjolstad, Fredrik; Kamil, Shoaib; Chou, Stephen; Lugato, David; Amarasinghe, Saman (2017-02-17)
      Tensor and linear algebra is pervasive in data analytics and the physical sciences. Often the tensors, matrices or even vectors are sparse. Computing expressions involving a mix of sparse and dense tensors, matrices and ...

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

      Jon, Doyle; Kohane, Isaac; Long, William; Szolovits, Peter (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.

    • The Design of a Relational Engine 

      Torlak, Emina; Jackson, Daniel (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, ...

    • The Interval Programming Model for Multi-objective Decision Making 

      Benjamin, Michael R. (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 Psychophysiology of Risk Processing and Decision Making at a Regional Stock Exchange 

      Perry, John C. (2007-06-12)
      A longstanding controversy in philosophy is whether decision-making isgoverned by reason or emotion. I study the role of physiologicalresponses in the decision-making process within the realm of financialmarkets, where ...

    • The Quorum Deployment Problem 

      Gilbert, Seth; Malewicz, Grzegorz (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 ...

    • The Satisfiability Threshold of Random 3-SAT Is at Least 3.52 

      Hajiaghayi, MohammadTaghi; Sorkin, Gregory B. (2003-11-20)
      We prove that a random 3-SAT instance with clause-to-variable densityless than 3.52 is satisfiable with high probability.The proof comes through an algorithm which selects (and sets) a variabledepending on its degree and ...

    • The Security Power of the Ballot Box 

      Lepinski, Matt; Izmalkov, Sergei (2005-02-02)
      We show that any function F can be securely evaluated by a protocolwith ballots and a ballot box. That is, N mutually suspicious players,each player possessing a secret input, can use ballots and a ballotbox to jointly ...

    • The Symmetriad: A Journey of Discovery Through the Land of the Polychora 

      Radul, Alexey (2005)
      I devised and implemented a method for constructing regular andsemiregular geometric objects in n-dimensional Euclidean space.Given a finite reflection group (a Coxeter group) G, there is a standard way to give G a group ...