Code for LOLCAT Method (Variant of Gillespie Algorithm) (2009)
This code and data is publicly listed code for the LOLCAT Method developed by Sagar Indurkhya and Jacob Beal, in the paper: "Reaction factoring and bipartite update graphs accelerate the Gillespie...
Jacob Beal, Jonathan Bachrach, Dan Vickery, Mark Tobenkin
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Selfhealing gradients are a frequently used building block for distributed self-healing...
Predictive Modelling for Fisheries Management in the Colombian Amazon (2008)
A group of Colombian indigenous communities and Amacayacu National Park are cooperating to make regulations for sustainable use of their shared natural resources, especially the fish populations. To...
Cognitive Security for Personal Devices (2008)
Greenstadt, Rachel, Beal, Jacob
Humans should be able to think of computers as extensions of their body, as craftsmen do with their tools. Current security models, however, are too unlike those used in human minds---for example,...
Cognitive Security for Personal Devices (2008)
Greenstadt, Rachel, Beal, Jacob
Humans should be able to think of computers as extensions of their body, as craftsmen do with their tools. Current security models, however, are too unlike those used in human minds---for example,...
The Development of a Small Autonomous . . . (2008)
Jacob Beal, Carl Blaurock, Kieth Bonawitz, Kyrilian Dyer, Paul Elliott, Paul Eremenko, ...
An interdisciplinary group of MIT undergraduates has engaged in the design and construction of a small autonomous aerial robot based on a helicopter platform to achieve the objectives of a...
Leveraging Learning and Language Via Communication Bootstrapping (2007)
In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication...
A Robust Amorphous Hierarchy from Nodes Persistent (2007)
For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a...
Fast Self-Healing Gradients (2007)
Beal, Jacob, Bachrach, Jonathan, Vickery, Dan, Tobenkin, Mark
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing...
Fast Self-Healing Gradients (2007)
Beal, Jacob, Bachrach, Jonathan, Vickery, Dan, Tobenkin, Mark
We present CRF-Gradient, a self-healing gradient algorithm that provably reconfigures in O(diameter) time. Self-healing gradients are a frequently used building block for distributed self-healing...
Constraint and Restoring Force (2007)
Beal, Jacob, Bachrach, Jonathan, Tobenkin, Mark
Long-lived sensor network applications must be able to self-repair and adapt to changing demands. We introduce a new approach for doing so: Constraint and Restoring Force. CRF is a physics-inspired...
Constraint and Restoring Force (2007)
Beal, Jacob, Bachrach, Jonathan, Tobenkin, Mark
Long-lived sensor network applications must be able to self-repair and adapt to changing demands. We introduce a new approach for doing so: Constraint and Restoring Force. CRF is a physics-inspired...
Continuous Space-Time Semantics Allow Adaptive Program Execution (2007)
Bachrach, Jonathan, Beal, Jacob, Fujiwara, Takeshi
A spatial computer is a collection of devices filling spacewhose ability to interact is strongly dependent on theirproximity. Previously, we have showed that programmingsuch a computer as a...
Continuous Space-Time Semantics Allow Adaptive Program Execution (2007)
Bachrach, Jonathan, Beal, Jacob, Fujiwara, Takeshi
A spatial computer is a collection of devices filling spacewhose ability to interact is strongly dependent on theirproximity. Previously, we have showed that programmingsuch a computer as a...
Developmental Cost for Models of Intelligence (2007)
We can evaluate models of natural intelligence, as well as theirindividual components, by using a model of hardware and developmentcosts, ignoring almost all the details of biology. The basic...
Developmental Cost for Models of Intelligence (2007)
We can evaluate models of natural intelligence, as well as theirindividual components, by using a model of hardware and developmentcosts, ignoring almost all the details of biology. The basic...
Principles for Engineered Emergence (slides) (2007)
Principles for Engineered EmergenceIt is difficult to establish engineering control over the behavior ofaggregates of unreliable devices with complicated interactionpatterns. I take a linguistic view...
Principles for Engineered Emergence (slides) (2007)
Principles for Engineered EmergenceIt is difficult to establish engineering control over the behavior ofaggregates of unreliable devices with complicated interactionpatterns. I take a linguistic view...
Building Spatial Computers (2007)
Bachrach, Jonathan, Beal, Jacob
Programmability is a major challenge in spatial computing, anaggregate control problem found in domains such as sensor networks,swarm robotics, and modular robotics. We address this challenge witha...
Building Spatial Computers (2007)
Bachrach, Jonathan, Beal, Jacob
Programmability is a major challenge in spatial computing, anaggregate control problem found in domains such as sensor networks,swarm robotics, and modular robotics. We address this challenge witha...
Abelson, Hal, Beal, Jacob, Sussman, Gerald Jay
The goal of amorphous computing is to identify organizationalprinciples and create programming technologies for obtainingintentional, pre-specified behavior from the cooperation of myriadunreliable...
Abelson, Hal, Beal, Jacob, Sussman, Gerald Jay
The goal of amorphous computing is to identify organizationalprinciples and create programming technologies for obtainingintentional, pre-specified behavior from the cooperation of myriadunreliable...
Building spatial computers (2007)
Spatial computing is an increasingly prevalent mode of computing, in which a program runs on a collection of devices spread through space whose ability to interact is strongly dependent on their...
Continuous space-time semantics allow adaptive program execution (2007)
Jonathan Bachrach, Jonathan Bachrach, Jacob Beal, Jacob Beal, Takeshi Fujiwara, Takeshi Fujiwara
A spatial computer is a collection of devices filling space whose ability to interact is strongly dependent on their proximity. Previously, we have showed that programming such a computer as a...
Bachrach, Jonathan, Beal, Jacob
Many programming domains involve the manipulation of values distributed through a manifold - examples include sensor networks, smart materials, and biofilms. This paper describes a programming...
Beal, Jacob, Bachrach, Jonathan
Many programming domains involve the manipulation of values distributed through a manifoldââ¬âexamples include sensor networks, smart materials, and biofilms. This paper describes a...
Bachrach, Jonathan, Beal, Jacob
Many programming domains involve the manipulation of values distributed through a manifold - examples include sensor networks, smart materials, and biofilms. This paper describes a programming...
Programming a Sensor Network as an Amorphous Medium (2006)
Bachrach, Jonathan, Beal, Jacob
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...
Programming a Sensor Network as an Amorphous Medium (2006)
Bachrach, Jonathan, Beal, Jacob
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...
What the Assassin's Guild Taught Me About Distributed Computing (2006)
Distributed computing and live-action roleplaying share many of thesame fundamental problems, as live-action roleplaying games commonly include simulations carried out by their players.Games run by...
What the Assassin's Guild Taught Me About Distributed Computing (2006)
Distributed computing and live-action roleplaying share many of thesame fundamental problems, as live-action roleplaying games commonly include simulations carried out by their players.Games run by...
CogSci to AI: It's the Brainware, Stupid! (2006)
Current modularization techniques fail when applied to hard AI problems.But cognitive science shows that the mind has modules specialized for particular functions.Unlike current engineered modules,...
Infrastructure for Engineered Emergence on Sensor/Actuator Networks (2006)
Beal, Jacob, Bachrach, Jonathan
The ability to control emergent phenomena depends on decomposingthem into aspects susceptible to independent engineering. Forspatial self-managing systems, the amorphous-medium abstraction lets...
Infrastructure for Engineered Emergence on Sensor/Actuator Networks (2006)
Beal, Jacob, Bachrach, Jonathan
The ability to control emergent phenomena depends on decomposingthem into aspects susceptible to independent engineering. Forspatial self-managing systems, the amorphous-medium abstraction lets...
CogSci to AI: It's the Brainware, Stupid! (2006)
Current modularization techniques fail when applied to hard AI problems.But cognitive science shows that the mind has modules specialized for particular functions.Unlike current engineered modules,...
Programming a sensor network as an amorphous medium (2006)
In many sensor network applications, the network is deployed to approximate a physical space. The network itself is not of interest: rather, we are interested in measuring the properties of the space...
pieces developed by others into one place and starting the process of integration. Previous work with amorphous medium languages, described in [5] and [4] proposes the amorphous medium abstraction...
Infrastructure for engineered emergence in sensor/actuator networks (2006)
Our ability to control emergent phenomena depends on decomposing them into aspects susceptible to independent engineering. The amorphous medium abstraction separates what behavior is desired on a...
Infrastructure for engineered emergence in sensor/actuator networks (2006)
Our ability to control emergent phenomena depends on decomposing them into aspects susceptible to independent engineering. The amorphous medium abstraction separates what behavior is desired on a...
Infrastructure for engineered emergence in sensor/actuator networks (2006)
Jacob Beal, Jonathan Bachrach, Technology Computer
The ability to control emergent phenomena depends on decomposing them into aspects susceptible to independent engineering. For spatial self-managing systems, the amorphous-medium abstraction lets you...
Amorphous Medium Language (2005)
Programming reliable behavior on a large mesh network composed of unreliable parts is difficult. Amorphous Medium Language addresses this problem by abstracting robustness and networking issues away...
Amorphous Medium Language (2005)
Programming reliable behavior on a large mesh network composed of unreliable parts is difficult. Amorphous Medium Language addresses this problem by abstracting robustness and networking issues away...
Learning From Snapshot Examples (2005)
Examples are a powerful tool for teaching both humans and computers.In order to learn from examples, however, a student must first extractthe examples from its stream of perception. Snapshot learning...
Learning From Snapshot Examples (2005)
Examples are a powerful tool for teaching both humans and computers.In order to learn from examples, however, a student must first extractthe examples from its stream of perception. Snapshot learning...
Biologically-Inspired Robust Spatial Programming (2005)
Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable...
Biologically-Inspired Robust Spatial Programming (2005)
Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable...
Biologically-inspired robust spatial programming (2005)
Inspired by the robustness and flexibility of biological systems, we are developing linguistic and programming tools to allow us to program spatial systems populated by vast numbers of unreliable...
Learning From Snapshot Examples (2005)
Examples are a powerful tool for teaching both humans and computers. In order to learn from examples, however, a student must first extract the examples from its stream of perception. Snapshot...
Programming an Amorphous Computational Medium (2004)
Amorphous computing considers the problem of controllingmillions of spatially distributed unreliable devices which communicateonly with nearby neighbors. To program such a system, we need a...
Programming an Amorphous Computational Medium (2004)
Amorphous computing considers the problem of controllingmillions of spatially distributed unreliable devices which communicateonly with nearby neighbors. To program such a system, we need a...
Programming an amorphous computational medium (2004)
Abstract. Amorphous computing considers the problem of controlling millions of spatially distributed unreliable devices which communicate only with nearby neighbors. To program such a system, we need...
RamboNodes for the Metropolitan Ad Hoc Network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
RamboNodes for the Metropolitan Ad Hoc Network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
RamboNodes for the Metropolitan Ad Hoc Network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
RamboNodes for the Metropolitan Ad Hoc Network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
Near-Optimal Distributed Failure Circumscription (2003)
Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a...
Near-Optimal Distributed Failure Circumscription (2003)
Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a...
Near-Optimal Distributed Failure Circumscription (2003)
Small failures should only disrupt a small part of a network. One wayto do this is by marking the surrounding area as untrustworthy ---circumscribing the failure. This can be done with a...
Near-Optimal Distributed Failure Circumscription (2003)
Small failures should only disrupt a small part of a network. One way to do this is by marking the surrounding area as untrustworthy --- circumscribing the failure. This can be done with a...
A Robust Amorphous Hierarchy from Persistent Nodes (2003)
For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a...
A Robust Amorphous Hierarchy from Persistent Nodes (2003)
For a very large network deployed in space with only nearby nodes able to talk to each other, we want to do tasks like robust routing and data storage. One way to organize the network is via a...
Persistent Nodes for Reliable Memory in Geographically Local Networks (2003)
A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in...
Persistent Nodes for Reliable Memory in Geographically Local Networks (2003)
A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in...
Leveraging Learning and Language Via Communication Bootstrapping (2003)
In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication...
Leveraging Learning and Language Via Communication Bootstrapping (2003)
In a Communication Bootstrapping system, peer components with different perceptual worlds invent symbols and syntax based on correlations between their percepts. I propose that Communication...
Persistent nodes for reliable memory in geographically local networks (2003)
A Persistent Node is a redundant distributed mechanism for storing a key/value pair reliably in a geographically local network. In this paper, I develop a method of establishing Persistent Nodes in...
RamboNodes for the metropolitan ad hoc network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network. It depends on localized regions of data storage that move in response to changing conditions. For...
RamboNodes for the metropolitan ad hoc network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
RamboNodes for the metropolitan ad hoc network (2003)
We present an algorithm to store data robustly in a large, geographically distributed network by means of localized regions of data storage that move in response to changing conditions. For example,...
Amorphous Infrastructure for Language Implementation (2002)
We propose a method for the robust implementation of simple graphical automataon an amorphous computer. This infrastructure is applied to the implementationof purely functional programming languages....
Amorphous Infrastructure for Language Implementation (2002)
We propose a method for the robust implementation of simple graphical automataon an amorphous computer. This infrastructure is applied to the implementationof purely functional programming languages....
Leaderless Distributed Hierarchy Formation (2002)
I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors...
Leaderless Distributed Hierarchy Formation (2002)
I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors...
Generating Communications Systems Through Shared Context (2002)
In a distributed model of intelligence, peer components need to communicate with one another. I present a system which enables two agents connected by a thick twisted bundle of wires to bootstrap a...
Generating Communications Systems Through Shared Context (2002)
In a distributed model of intelligence, peer components need to communicate with one another. I present a system which enables two agents connected by a thick twisted bundle of wires to bootstrap a...
Leaderless Distributed Hierarchy Formation (2002)
I present a system for robust leaderless organization of an amorphous network into hierarchical clusters. This system, which assumes that nodes are spatially embedded and can only talk to neighbors...
An Algorithm for Bootstrapping Communications (2002)
Introduction Neuroscience has postulated that the brain has many \organs" | internal subdivisions which specialize in one area. If we accept this view, then we need some sort of mechanism to...
An Algorithm for Bootstrapping Communications (2001)
I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time....
An Algorithm for Bootstrapping Communications (2001)
I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time....
An Algorithm for Bootstrapping Communications (2001)
I present an algorithm which allows two agents to generate a simple language based only on observations of a shared environment. Vocabulary and roles for the language are learned in linear time....