CACM logo

February 2009 (Vol. 52, No. 2)
Inspiring Women in Computing

Table of Contents

DEPARTMENT: Policy letter

USACM's Policy Role

ACM members have a professional duty to ensure that the public comprehends and benefits from advances in computing.

Page 5

DEPARTMENT: Letters to the editor

DEPARTMENT: CACM online

The Dot-Org Difference

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 …

Page 10

COLUMN: News

Photography's Bright Future

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.

Pages 11-13

Making Sense of Sensors

Researchers are recognizing the potential of position sensors to help them overcome the limitations of traditional user interfaces.

Pages 14-15

The First Internet President

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.

Pages 16-18

SIGGRAPH Debuts in Asia

ACM's premier computer graphics conference hosts its first-ever graphics event in Asia, with a more global focus.

Page 19

COLUMN: Viewpoints

Economic and Business Dimensions: The Extent of Globalization of Software Innovation

Will the software development laboratories follow the production mills?

Pages 20-22

Human Computing Skills: Rethinking the K-12 Experience : rethinking the K-12 experience

Establishing the fundamentals of computational thinking is essential to improving computer science education.

Pages 23-25

International Communications Tapped for Intelligence-Gathering

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 …

Pages 26-28

Inside Risks: U.S. Election After-Math

Recounting problems still associated with election integrity, transparency, and accountability.

Page 29

Point/Counterpoint: Network Neutrality Nuances

A discussion of divergent paths to unrestricted access of content and applications via the Internet.

Pages 31-37

COLUMN: Practice

Parallel Programming with Transactional Memory

While still primarily a research project, transactional memory shows promise for making parallel programming easier.

Pages 38-43

Improving Performance on the Internet

Given the Internet's bottlenecks, how can we build fast, scalable, content-delivery systems?

Pages 44-51

SECTION: Contributed articles

Toward 2W, Beyond Web 2.0

2W is a result of the exponentially growing Web building on itself to move from a Web of content to a Web of applications.

Pages 52-59

Compiler Research: The Next 50 Years

Four recommendations address the major challenges to keeping compilers and high-level languages vibrant.

Pages 60-67

SECTION: Review articles

Women in Computing - Take 2

What strategies can employers and educators use to successfully recruit, retain, and inspire women in computing? 

Pages 68-76

SECTION: Research highlights

Technical Perspective: Tools for Information to Flow Securely and Swift-ly

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 …

Page 78

Building Secure Web Applications With Automatic Partitioning

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. …

Pages 79-87

Technical Perspective: The Complexity of Computing Nash Equilibrium

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 …

Page 88

The Complexity of Computing a Nash Equilibrium

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 …

Pages 89-97

COLUMN: Last byte

Puzzled: Will My Algorithm Terminate?

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 …

Page 104

SECTION: Virtual extension

For Sale by Owner Online: who gets the saved commission?

Pages 110-114

Oracle, Where Shall I Submit My Papers?

Pages 115-118

Automatically Profiling the Author of an Anonymous Text

Pages 119-123

Shadow Systems: the good, the bad and the ugly

Pages 124-129

Why File Sharing Networks are Dangerous?

Pages 134-138

Technical Opinion: Multitasking With Laptops During Meetings

Pages 139-141

About Communications | Join ACM External Link | Renew External Link | Subscribe External Link | Sign In | For Authors | For Advertisers External Link | Privacy | Site Map | Help | Contact Us | Mobile Site

Copyright © 2012 by the ACM. All rights reserved.