ACM has the responsibility to fulfill its mission to the fullest, not just for the sake of computing professionals but for society at large.
Yannis Ioannidis Page 5DEPARTMENT: Cerf's up
Designing experiences from an accessibility and inclusion perspective significantly expands creative possibilities and creates better solutions for everyone.
Federico Monaco Page 7DEPARTMENT: BLOG@CACM
Considering the challenges for universities to adapt their business models to changing student demands.
Carla E. Brodley Pages 20-22COLUMN: Kode Vicious
NSF's vision for the U.S. cyberinfrastructure ecosystem for science and engineering in the 21st century.
Manish Parashar, Amy Friedlander, Erwin Gianchandani, Margaret Martonosi Pages 30-32
A path forward for the ML community to address a stark disconnect.
Valerie Chen, Jeffrey Li, Joon Sik Kim, Gregory Plumb, Ameet Talwalkar Pages 43-50SECTION: Contributed articles
Some small companies are making crowdwork part of their formal business via teams that can complete multifaceted, complex tasks requiring specialized expertise.
Yihong Wang, Konstantinos Papangelis, Ioanna Lykourentzou, Vassilis-Javed Khan, Michael Saker, Yong Yue, Jonathan Grudin Pages 64-70SECTION: Review articles
Every five years, a group of the leading database researchers meet to reflect on their community's impact on the computing industry as well as examine current research challenges.
Daniel Abadi, Anastasia Ailamaki, David Andersen, Peter Bailis, Magdalena Balazinska, Philip A. Bernstein, Peter Boncz, Surajit Chaudhuri, Alvin Cheung, Anhai Doan, Luna Dong, Michael J. Franklin, Juliana Freire, Alon Halevy, Joseph M. Hellerstein, Stratos Idreos, Donald Kossmann, Tim Kraska, Sailesh Krishnamurthy, Volker Markl, Sergey Melnik, Tova Milo, C. Mohan, Thomas Neumann, Beng Chin Ooi, Fatma Ozcan, Jignesh Patel, Andrew Pavlo, Raluca Popa, Raghu Ramakrishnan, Christopher Re, Michael Stonebraker, Dan Suciu Pages 72-79SECTION: Research highlights
In "Sampling Near Neighbors in Search for Fairness," Aumüller et al. investigate a basic problem in similarity search called near neighbor in the context of fair data structures.
Qin Zhang Page 82
We propose several efficient data structures for the exact and approximate variants of the fair near neighbor problem.
Martin Aumüller, Sariel Har-Peled, Sepideh Mahabadi, Rasmus Pagh, Francesco Silvestri Pages 83-90
In "hXDP: Efficient Software Packet Processing on FPGA NICs," the authors offer an interesting solution to bridging the performance gap between the CPU and the home network.
Noa Zilberman Page 91
We present hXDP, a solution to run on FPGAs software packet processing tasks described with the eBPF technology and targeting the Linux's eXpress Data Path.
Marco Spaziani Brunella, Giacomo Belocchi, Marco Bonola, Salvatore Pontarelli, Giuseppe Siracusano, Giuseppe Bianchi, Aniello Cammarano, Alessandro Palumbo, Luca Petrucci, Roberto Bifulco Pages 92-100COLUMN: Last byte