DEPARTMENT: Policy letter
ACM members have a professional duty to ensure that the public comprehends and benefits from advances in computing.
Eugene H. Spafford
Page 5
DEPARTMENT: Letters to the editor
E-voting can be as secure and confidential as paper-based voting, as discussed in "The U.S. Should Ban Paperless Electronic Voting Machines" (Oct. 2008). However, to work properly …
CACM Staff
Pages 8-9
DEPARTMENT: CACM online
One of the first things you'll notice about the new
Communications Web site (
cacm.acm.org) is that it has different content than the monthly magazine. A distinctive …
David Roman
Page 10
COLUMN: News
Researchers working in computational photography are using computer vision, computer graphics, and applied optics to bring a vast array of new capabilities to digital cameras.
Kirk L. Kroeker
Pages 11-13
Researchers are recognizing the potential of position sensors to help them overcome the limitations of traditional user interfaces.
Alex Wright
Pages 14-15
Barack Obama's presidential campaign utilized the Internet and information technology unlike any previous political campaign. How politicians and the public interact will never be the same.
Samuel Greengard
Pages 16-18
ACM's premier computer graphics conference hosts its first-ever graphics event in Asia, with a more global focus.
Kirk L. Kroeker
Page 19
COLUMN: Viewpoints
Will the software development laboratories follow the production mills?
Ashish Arora, Matej Drev, Chris Forman
Pages 20-22
Establishing the fundamentals of computational thinking is essential to improving computer science education.
George H. L. Fletcher, James J. Lu
Pages 23-25
Governments concerned with national-security threats use the Internet to gather intelligence from communications traffic that transits local facilities. This surveillance is expanding — to the detriment of communications privacy …
Kristina Irion
Pages 26-28
Recounting problems still associated with election integrity, transparency, and accountability.
Peter G. Neumann
Page 29
A discussion of divergent paths to unrestricted access of content and applications via the Internet.
Barbara van Schewick, David Farber
Pages 31-37
COLUMN: Practice
While still primarily a research project, transactional memory shows promise for making parallel programming easier.
Ulrich Drepper
Pages 38-43
Given the Internet's bottlenecks, how can we build fast, scalable, content-delivery systems?
Tom Leighton
Pages 44-51
SECTION: Contributed articles
2W is a result of the exponentially growing Web building on itself to move from a Web of content to a Web of applications.
T. V. Raman
Pages 52-59
Four recommendations address the major challenges to keeping compilers and high-level languages vibrant.
Mary Hall, David Padua, Keshav Pingali
Pages 60-67
SECTION: Review articles
What strategies can employers and educators use to successfully recruit, retain, and inspire women in computing?
Maria Klawe, Telle Whitney, Caroline Simard
Pages 68-76
SECTION: Research highlights
Back in the old days of the Web (before 1995), Web browsers were fairly simple devices. The server's Web interface was simple enough that an auditor could at least look at it and reason about its security. Today, it's a different …
Dan Wallach
Page 78
Swift is a new, principled approach to building Web applications that are
secure by construction. Swift automatically partitions application code while providing assurance that the resulting placement is secure and efficient. …
Stephen Chong, Jed Liu, Andrew C. Myers, Xin Qi, K. Vikram, Lantian Zheng, Xin Zheng
Pages 79-87
Computer science and game theory go back to the same individual, John von Neumann, and both subjects deal with the mathematization of rational decision making. Yet, for many …
Ehud Kalai
Page 88
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 cannot be applied to the rare problems where "every instance …
Constantinos Daskalakis, Paul W. Goldberg, Christos H. Papadimitriou
Pages 89-97
COLUMN: Last byte
Welcome to three new challenging mathematical puzzles. Solutions to the first two will be published next month; the third is as yet unsolved. In them all, I concentrate on algorithm termination, outlining some simple procedures …
Peter Winkler
Page 104
SECTION: Virtual extension
Pamela E. Carter, Gina Green
Pages 105-109
Xiao-Bai Li, Luvai Motiwalla
Pages 110-114
Ergin Elmacioglu, Dongwon Lee
Pages 115-118
Shlomo Argamon, Moshe Koppel, James W. Pennebaker, Jonathan Schler
Pages 119-123
Sandy Behrens
Pages 124-129
Arik Ragowsky, David Gefen
Pages 130-133
M. Eric Johnson, Dan McGuire, Nicholas D. Willey
Pages 134-138
Raquel Benbunan-Fich, Gregory E. Truman
Pages 139-141