DEPARTMENT:
Departments
Incentivizing Reproducibility
It is rare for research studies in computing to be reproduced. This seems odd, since we have an advantage over science done in wet labs. There is no reason for us not to be leaders in practices that enable audit and reuse when …
Ronald F. Boisvert
Page 5
'We're Going Backward!'
The Greeks and the Romans carved letters in stone and these are still eminently readable over 2,000 years later. Newer media have not been around as long but I think it is arguable that the more recent media do not have the resilience …
Vinton G. Cerf
Page 7
DEPARTMENT:
[email protected]
Adding Art to STEM
Perry R. Cook considers the career path that led him to STEAM.
Perry R. Cook
Pages 8-9
COLUMN:
News
Optical Fibers Getting Full
Exploring ways to push more data through a fiber one-tenth the thickness of the average human hair.
Don Monroe
Pages 10-12
Bringing Holography to Light
While 3D technologies that make headlines are not truly holographic, holographic techniques are furthering advances in important applications such as biomedical imaging.
Marina Krakovsky
Pages 13-15
Battling Algorithmic Bias
How do we ensure algorithms treat us fairly?
Keith Kirkpatrick
Pages 16-17
COLUMN:
Technology strategy and management
The Puzzle of Japanese Innovation and Entrepreneurship
Exploring how Japan's unique mixture of social, educational, and corporate practices influence entrepreneurial activity.
Michael A. Cusumano
Pages 18-20
COLUMN:
Global computing
Mobile Computing and Political Transformation
Connecting increased mobile phone usage with political and market liberalization.
Michael L. Best
Pages 21-23
COLUMN:
Kode vicious
Cloud Calipers
Naming the next generation and remembering that the cloud is just other people's computers.
George V. Neville-Neil
Pages 24-25
COLUMN:
Inside risks
Risks of Automation: A Cautionary Total-System Perspective of Our Cyberfuture
Where automation is inevitable, let's do it right.
Peter G. Neumann
Pages 26-30
COLUMN:
Viewpoint
Universities and Computer Science in the European Crisis of Refugees
Considering the role of universities in promoting tolerance as well as education.
Kathrin Conrad, Nysret Musliu, Reinhard Pichler, Hannes Werthner
Pages 31-33
SECTION:
Practice
Idle-Time Garbage-Collection Scheduling
Taking advantage of idleness to reduce dropped frames and memory consumption.
Ulan Degenbaev, Jochen Eisinger, Manfred Ernst, Ross Mcilroy, Hannes Payer
Pages 34-39
Fresh Starts
Just because you have been doing it the same way doesn't mean you are doing it the right way.
Kate Matsudaira
Pages 40-41
Dynamics of Change: Why Reactivity Matters
Tame the dynamics of change by centralizing each concern in its own module.
Andre Medeiros
Pages 42-46
SECTION:
Contributed articles
Rethinking Security For Internet Routing
Combine simple whitelisting technology, notably prefix filtering, in most BGP-speaking routers with weaker cryptographic protocols.
Robert Lychev, Michael Schapira, Sharon Goldberg
Pages 48-57
Ethical Considerations in Network Measurement Papers
The most important consideration is how the collection of measurements may affect a person's well-being.
Craig Partridge, Mark Allman
Pages 58-64
SECTION:
Review articles
A Brief Chronology of Medical Device Security
With the implantation of software-driven devices comes unique privacy and security threats to the human body.
A. J. Burns, M. Eric Johnson, Peter Honeyman
Pages 66-72
SECTION:
Research highlights
Technical Perspective: Naiad
"Incremental, Iterative Data Processing with Timely Dataflow" describes Naiad, which combines three classes of dataflow systems, supporting high-throughput batch processing queries, low-latency data stream queries, and iterative …
Johannes Gehrke
Page 74
Incremental, Iterative Data Processing with Timely Dataflow
We describe the timely dataflow model for distributed computation and its implementation in the Naiad system.
Derek G. Murray, Frank McSherry, Michael Isard, Rebecca Isaacs, Paul Barham, Martin Abadi
Pages 75-83
Technical Perspective: The Power of Parallelizing Computations
"Efficient Parallelization Using Rank Convergence in Dynamic Programming Algorithms" shows how some instances of dynamic programming can be effectively parallelized by taking advantage of the algebraic properties of the underlying …
James Larus
Page 84
Efficient Parallelization Using Rank Convergence in Dynamic Programming Algorithms
This paper proposes an efficient parallel algorithm for an important class of dynamic programming problems that includes Viterbi, Needleman-Wunsch, Smith-Waterman, and Longest Common Subsequence.
Saeed Maleki, Madanlal Musuvathi, Todd Mytkowicz
Pages 85-92
COLUMN:
Last byte
Find Me Quickly
In this cooperative game, two players want to meet each other in a graph as quickly as possible.
Dennis Shasha
Page 96