The Five-Minute Rule 30 Years Later and Its Impact on the Storage Hierarchy
Tracing the evolution of the five-minute rule to help identify imminent changes in the design of data management engines.
Research and Advances
Advertisement
An Elementary Introduction to Kalman Filtering
Demystifying the uses of a powerful tool for uncertain information.
DeepXplore: Automated Whitebox Testing of Deep Learning Systems
We design, implement, and evaluate DeepXplore, the first white-box framework for systematically testing real-world deep learning systems.
Technical Perspective: The Scalability of CertiKOS
The authors of "Building Certified Concurrent OS Kernels" illustrate that formal verification can scale up to a moderate-size program (6,500 lines of C) that has substantial shared-memory concurrency.
Unlocking Data to Improve Public Policy
When properly secured, anonymized, and optimized for research, administrative data can be put to work to help government programs better serve those in need.
Sampling-Based Robot Motion Planning
To address the computational challenges that arise when planning for robotic systems, traditional CS algorithms, tools, and paradigms must be revisited.
Protein Design by Provable Algorithms
Protein design algorithms can leverage provable guarantees of accuracy to provide new insights and unique optimized molecules.
Consumer-Grade Fabrication and Its Potential to Revolutionize Accessibility
Digital fabrication technologies open new doors — and challenges — for real-world support.
Building Certified Concurrent OS Kernels
In this work, we present CertiKOS, a novel compositional framework for building verified concurrent OS kernels.
Technical Perspective: From Virtual Worlds to Digital Fabrication
The authors of "OpenFab" propose to revisit the processing pipeline that turns a 3D model into machine instructions in light of the solutions developed in computer graphics.
Alloy: A Language and Tool for Exploring Software Designs
Exploiting a simple, expressive logic based on relations to describe designs and automate their analysis.
Computational Sustainability: Computing for a Better World and a Sustainable Future
Computer and information scientists join forces with other fields to help solve societal and environmental challenges facing humanity, in pursuit of a sustainable future.
Metadata-Private Communication for the 99%
Sketching the underlying system needed to facilitate metadata-private communication for several applications with a large user base.
EarSketch: Engaging Broad Populations in Computing Through Music
EarSketch leverages the appeal of music to create a learning environment that allows students to be expressive with code.
OpenFab: A Programmable Pipeline for Multimaterial Fabrication
We present OpenFab, a programmable pipeline for synthesis of multimaterial 3D printed objects that is inspired by RenderMan and modern GPU pipelines.
Scaling Static Analyses at Facebook
Key lessons for designing static analysis tools deployed to find bugs in hundreds of millions of lines of code.
Embedded EthiCS: Integrating Ethics Across CS Education
A Harvard-based pilot program integrates class sessions on ethical reasoning into courses throughout its computer science curriculum.
Activity-Centric Computing Systems
The ability to build a construct that organizes work from different devices and information resources is as complex as it is invaluable.
Tracing the tangled web of unsolicited and undesired email and possible strategies for its demise.
Heavy Hitters via Cluster-Preserving Clustering
We develop a new algorithm for the turnstile heavy hitters problem in general turnstile streams, the EXPANDERSKETCH, which finds the approximate top-k items in a universe of size n using the same asymptotic O(k log n) words of memory and O(log n) update time as the COUNTMIN and COUNTSKETCH, but requiring only O(k poly(log n)) time to answer queries instead of the O(n log n) time of the other two. The notion of "approximation" is the same l2 sense as the COUNTSKETCH, which given known lower bounds is the strongest guarantee one can achieve in sublinear memory. Our main innovation is an efficient reduction from the heavy hitters problem to a clustering problem in which each heavy hitter is encoded as some form of noisy spectral cluster in a graph, and the goal is to identify every cluster.
Technical Perspective: The True Cost of Popularity
The main focus of "Heavy Hitters via Cluster-Preserving Clustering" by Kasper Green Larsen et al. is on building up sufficient information to allow a more effective search process.
Ways of Thinking in Informatics
An innovative, entry-level informatics course enables students to ponder CS problems in different ways, from different perspectives.
Used in the design of the Internet and Unix, the layered services of the hourglass model have enabled viral adoption and deployment scalability.
Unifying Logical and Statistical AI with Markov Logic
Markov logic can be used as a general framework for joining logical and statistical AI.
Shape the Future of Computing
ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.
Get InvolvedCommunications of the ACM (CACM) is now a fully Open Access publication.
By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.
Learn More