Autonomous helicopter flight is widely regarded to be a highly challenging control problem. As helicopters are highly unstable and exhibit complicated dynamical...Adam Coates, Pieter Abbeel, Andrew Y. Ng From Communications of the ACM | July 2009
In one scene from The Matrix, two leaders of the human resistance are trapped on the roof of a skyscraper. The only means of escape is by helicopter, which neither...Stuart Russell, Lawrence Saul From Communications of the ACM | July 2009
Modern computer systems are inherently nondeterministic due to a variety of events that occur during an execution. The lack of repeatability that arises from this...Derek R. Hower, Pablo Montesinos, Luis Ceze, Mark D. Hill, Josep Torrellas From Communications of the ACM | June 2009
Many Web sites embed third-party content in frames, relying on the browser's security policy to protect against malicious content. However, frames provide insufficient...Adam Barth, Collin Jackson, John C. Mitchell From Communications of the ACM | June 2009
The web has brought exciting new functionality while simultaneously requiring new mechanisms to make it secure. We've...Andrew Myers From Communications of the ACM | June 2009
In a thread-safe concurrent queue, consumers typically wait for producers to make data available. In a synchronous queue, producers similarly wait for consumers...William N. Scherer, Doug Lea, Michael L. Scott From Communications of the ACM | May 2009
The advent of multicore architectures has produced a Renaissance in the study of highly concurrent data structures.Maurice Herlihy From Communications of the ACM | May 2009
DRAM retains its contents for several seconds after power is lost. Although DRAM becomes less reliable when it is not refreshed, it is not immediately erased, and...J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum, Edward W. Felten From Communications of the ACM | May 2009
Many systems rely on keeping a master key secret. But technological progress can undermine old assumptions.Ross Anderson From Communications of the ACM | May 2009
In this paper, we examine the use of Flash storage in the server domain. Wear-out has the potential to limit the use of Flash in this domain. To seriously consider...David Roberts, Taeho Kgil, Trevor Mudge From Communications of the ACM | April 2009
Flash memory nowadays seems to be in every discussion about system architecture. Sure enough, flash memory boasts...Goetz Graefe From Communications of the ACM | April 2009
Relative fitness is a new approach to modeling the performance of storage devices. In contrast to a conventional model, which predicts the performance of an application's...Michael P. Mesnier, Matthew Wachs, Raja R. Sambasivan, Alice X. Zheng, Gregory R. Ganger From Communications of the ACM | April 2009
Large disk arrays are everywhere. When we shop at an Internet retailer, the product and account data come from a disk...Arif Merchant From Communications of the ACM | April 2009
We address the problem of specifying and detecting emergent behavior in networks of cardiac myocytes, spiral electric waves in particular, a precursor to atrial...Radu Grosu, Scott A. Smolka, Flavio Corradini, Anita Wasilewska, Emilia Entcheva, Ezio Bartocci From Communications of the ACM | March 2009
Alan Turing died in 1954 in his laboratory after eating a cyanide-laced apple. During his last years, Turing had become interested in bio-chemical systems. He had...Bud Mishra From Communications of the ACM | March 2009
Ever since the birth of coding theory almost 60 years ago, researchers have been pursuing the elusive goal of constructing the "best codes," whose encoding introduces...Venkatesan Guruswami, Atri Rudra From Communications of the ACM | March 2009
Error-correcting codes are the means by which we compensate for interference in communication, and are essential for the accurate transmission and storage of digital...Daniel A. Spielman From Communications of the ACM | March 2009
Traditionally, computational problems fall into two classes: those that have a polynomial-time algorithm and those that are NP-hard. However, the concept of NP-hardness...Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou From Communications of the ACM | February 2009
Computer science and game theory go back to the same individual, John von Neumann, and both subjects deal with the...Ehud Kalai From Communications of the ACM | February 2009