DOCSLIB.ORG

Communications of the Acm

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Communications of the Acm COMMUNICATIONS CACM.ACM.ORG OF THEACM 11/2017 VOL.60 NO.11 Reconfigurable Cambits Association for Computing Machinery Previous A.M. Turing Award Recipients 1966 A.J. Perlis 1967 Maurice Wilkes 1968 R.W. Hamming 1969 Marvin Minsky 1970 J.H. Wilkinson 1971 John McCarthy 1972 E.W. Dijkstra 1973 Charles Bachman 1974 Donald Knuth 1975 Allen Newell 1975 Herbert Simon 1976 Michael Rabin 1976 Dana Scott 1977 John Backus 1978 Robert Floyd 1979 Kenneth Iverson 1980 C.A.R Hoare ACM A.M. TURING AWARD 1981 Edgar Codd 1982 Stephen Cook 1983 Ken Thompson NOMINATIONS SOLICITED 1983 Dennis Ritchie 1984 Niklaus Wirth Nominations are invited for the 2017 ACM A.M. Turing Award. 1985 Richard Karp 1986 John Hopcroft This is ACM’s oldest and most prestigious award and is given 1986 Robert Tarjan to recognize contributions of a technical nature which are of 1987 John Cocke 1988 Ivan Sutherland lasting and major technical importance to the computing field. 1989 William Kahan The award is accompanied by a prize of $1,000,000. 1990 Fernando Corbató 1991 Robin Milner Financial support for the award is provided by Google Inc. 1992 Butler Lampson 1993 Juris Hartmanis Nomination information and the online submission form 1993 Richard Stearns 1994 Edward Feigenbaum are available on: 1994 Raj Reddy http://amturing.acm.org/call_for_nominations.cfm 1995 Manuel Blum 1996 Amir Pnueli 1997 Douglas Engelbart Additional information on the Turing Laureates 1998 James Gray is available on: 1999 Frederick Brooks http://amturing.acm.org/byyear.cfm 2000 Andrew Yao 2001 Ole-Johan Dahl 2001 Kristen Nygaard The deadline for nominations/endorsements is 2002 Leonard Adleman January 15, 2018. 2002 Ronald Rivest 2002 Adi Shamir 2003 Alan Kay For additional information on ACM’s award program 2004 Vinton Cerf 2004 Robert Kahn please visit: www.acm.org/awards/ 2005 Peter Naur 2006 Frances E. Allen 2007 Edmund Clarke 2007 E. Allen Emerson 2007 Joseph Sifakis 2008 Barbara Liskov 2009 Charles P. Thacker 2010 Leslie G. Valiant 2011 Judea Pearl 2012 Shafi Goldwasser 2012 Silvio Micali 2013 Leslie Lamport 2014 Michael Stonebraker 2015 Whitfield Diffie 2015 Martin Hellman 2016 Sir Tim Berners-Lee CACM_2017_TuringSubmit_FP.indd 1 10/4/17 11:54 AM Introducing ACM Transactions on Human-Robot Interaction Now accepting submissions to ACM THRI In January 2018, the Journal of Human-Robot Interaction (JHRI) will become an ACM publication and be rebranded as the ACM Transactions on Human-Robot Interaction (THRI). Founded in 2012, the Journal of HRI has been serving as the premier peer-reviewed interdisciplinary journal in the eld. Since that time, the human-robot interaction eld has experienced substantial growth. Research ndings at the intersection of robotics, human-computer interaction, arti cial intelligence, haptics, and natural language processing have been responsible for important discoveries and breakthrough technologies across many industries. THRI now joins the ACM portfolio of highly respected journals. It will continue to be open access, fostering the widest possible readership of HRI research and information. All issues will be available on the ACM Digital Library. Editors-in-Chief Odest Chadwicke Jenkins of the University of Michigan and Selma Šabanović of Indiana University plan to expand the scope of the publication, adding a new section on mechanical HRI to the existing sections on computational, social/behavioral, and design-related scholarship in HRI. The inaugural issue of the rebranded ACM Transactions on Human-Robot Interaction is planned for March 2018. To submit, go to https://mc.manuscriptcentral.com/thri COMMUNICATIONS OF THE ACM Departments News Viewpoints 5 From the Co-Chairs of the ACM 20 Legally Speaking Student Research Competition Disgorging Profits in Highlights of the ACM Design Patent Cases Student Research Competition Does the recent U.S. Supreme Court By Laurie Williams and Doug Baldwin decision in the Apple v. Samsung case represent a quagmire? 6 Cerf’s Up By Pamela Samuelson Heidelberg Laureate Forum By Vinton G. Cerf 23 Computing Ethics Engaging the Ethics 7 Vardi’s Insights of Data Science in Practice Would Turing Have Won Seeking more common ground the Turing Award? between data scientists and By Moshe Y. Vardi their critics. 17 By Solon Barocas and danah boyd 8 Letters to the Editor They See What You See 12 A Block on the Old Chip 26 Education Block copolymers may Keeping the Machinery in 10 BLOG@CACM help transistors shrink Computing Education Opportunities for Women, to tinier dimensions. Incorporating intellectual and Minorities in Information Retrieval By Neil Savage developmental frameworks into Mei Kobayashi describes activities to a Scottish school curriculum. support diversity and inclusion at the 15 Censoring Sensors By Richard Connor, Quintin Cutts, annual meeting of the ACM Special Amid growing outcry over and Judy Robertson Interest Group on Information controversial online videos, Retrieval in Tokyo this summer. tech firms grapple with how best 29 Viewpoint to police online advertising. Pay What You Want as a Pricing 27 Calendar By Alex Wright Model for Open Access Publishing? Analyzing the “Pay What You Want” 100 Careers 17 Overcoming Disabilities business model for Brain-computer interfaces hold open access publishing. the promise of fully featured By Martin Spann, Lucas Stich, Last Byte replacements for body parts that and Klaus M. Schmidt don’t work or are missing. 112 Future Tense By Esther Shein 32 Viewpoint Butterfly Effect Social Agents: Bridging But, like the weather, what can Simulation and Engineering anyone do about it? Seeking better integration By Seth Shostak of two research communities. By Virginia Dignum Association for Computing Machinery Advancing Computing as a Science & Profession PHOTO BY BSIP/UIG VIA GETTY BY IMAGES PHOTO 2 COMMUNICATIONS OF THE ACM | NOVEMBER 2017 | VOL. 60 | NO. 11 11/2017 VOL. 60 NO. 11 Practice Contributed Articles Review Articles 44 54 68 36 Hootsuite: In Pursuit 54 Cambits: A Reconfigurable 68 Healthcare Robotics of Reactive Systems Camera System Healthcare robotics can provide A discussion with Edward Steel, Multiple computational cameras health and wellness support to Yanik Berube, Jonas Bonér, can be assembled from a common billions of people. Ken Britton, and Terry Coatta set of imaging components. By Laurel D. Riek By Makoto Odamaki and Shree K. Nayar 44 Breadth and Depth We all wear many hats, but make Watch the author discuss her work in this exclusive sure you have one that fits well. Watch the authors discuss Communications video. their work in this exclusive By Kate Matsudaira https://cacm.acm.org/ Communications video. videos/healthcare-robotics https://cacm.acm.org/ 46 Is There a Single Method for videos/cambits the Internet of Things? Research Highlights Essence can keep software 62 User Reviews of Top Mobile Apps development for the IoT in Apple and Google App Stores 80 Technical Perspective from becoming unwieldy. The varying review dynamics seen in Solving Imperfect Information Games By Ivar Jacobson, Ian Spence, different app stores can help guide By David Silver and Pan-Wei Ng future app development strategies. By Stuart McIlroy, Weiyi Shang, 81 Heads-Up Limit Hold’em Articles’ development led by Nasir Ali, and Ahmed E. Hassan Poker Is Solved queue.acm.org By Michael Bowling, Neil Burch, Michael Johanson, and Oskari Tammelin 89 Technical Perspective About the Cover: Exploring a Kingdom This month’s covers depict by Geodesic Measures a simple set of blocks that can be used to build By Marc Alexa a variety of cameras with very different functionalities. Four 90 The Heat Method for different Communications Distance Computation covers are circulating worldwide, each depicting By Keenan Crane, Clarisse Weischedel, a different “Cambit.” and Max Wardetzky Our thanks to Shree Nayar and Anne Fleming of Columbia University for hosting this photoshoot. L-TO-R IMAGES BY: LIGHTSPRING; ALEXANDER BERG; LAURA LEZZA/GETTY BERG; LAURA IMAGES ALEXANDER LIGHTSPRING; BY: IMAGES L-TO-R Covers by Alexander Berg. NOVEMBER 2017 | VOL. 60 | NO. 11 | COMMUNICATIONS OF THE ACM 3 COMMUNICATIONS OF THE ACM Trusted insights for computing’s leading professionals. Communications of the ACM is the leading monthly print and online magazine for the computing and information technology fields. Communications is recognized as the most trusted and knowledgeable source of industry information for today’s computing professional. Communications brings its readership in-depth coverage of emerging areas of computer science, new trends in information technology, and practical applications. Industry leaders use Communications as a platform to present and debate various technology implications, public policies, engineering challenges, and market trends. The prestige and unmatched reputation that Communications of the ACM enjoys today is built upon a 50-year commitment to high-quality editorial content and a steadfast dedication to advancing the arts, sciences, and applications of information technology. ACM, the world’s largest educational STAFF EDITORIAL BOARD ACM Copyright Notice and scientific computing society, delivers DIRECTOR OF PUBLICATIONS EDITOR-IN-CHIEF Copyright © 2017 by Association for resources that advance computing as a Scott E. Delman Andrew A. Chien Computing Machinery, Inc. (ACM). science and profession. ACM provides the cacm-publisher@cacm.acm.org eic@cacm.acm.org Permission to make digital or hard copies computing field’s premier Digital Library of part or all of this work for personal and serves its members and the computing Deputy to the Editor-in-Chief or classroom use is granted without Executive Editor profession with leading-edge publications, Lihan Chen fee provided that copies are not made Diane Crawford conferences, and career resources. cacm.deputy.to.eic@gmail.com or distributed for profit or commercial Managing Editor advantage and that copies bear this Thomas E. Lambert Executive Director and CEO SENIOR EDITOR notice and full citation on the first Senior Editor Bobby Schnabel Moshe Y. Vardi page. Copyright for components of this Andrew Rosenbloom Deputy Executive Director and COO work owned by others than ACM must Senior Editor/News Patricia Ryan NEWS be honored.
Load more

Recommended publications
  • Communication of Design Quarterly
    Volume 1 Issue 2 January 2013 Communication of Design Quarterly Published by the Association for Computing Machinery Special Interest Group for Design of Communication ISSN: 2166-1642 Contents....................................................................................................................................................................................1 Editorial.....................................................................................................................................................................................3 Notes from the Chair............................................................................................................................................................5 SIGDOC 2013 conference...................................................................................................................................................7 Uncovering Analogness and Digitalness in Interactive Media.............................................................................8 Development Framework Components as Commonplaces..............................................................................37 I See You’re Talking #HPV: Communication Pattersn in the #HPV Stream on Twitter...............................50 Communication Design Quarterly ACM SIGDOC (Special Interest Group Design of Communication) seeks to be the premier information source for industry, management, and academia in the multidisciplinary field of the design and communication of information. It contains a
    [Show full text]
  • Tarjan Transcript Final with Timestamps
    A.M. Turing Award Oral History Interview with Robert (Bob) Endre Tarjan by Roy Levin San Mateo, California July 12, 2017 Levin: My name is Roy Levin. Today is July 12th, 2017, and I’m in San Mateo, California at the home of Robert Tarjan, where I’ll be interviewing him for the ACM Turing Award Winners project. Good afternoon, Bob, and thanks for spending the time to talk to me today. Tarjan: You’re welcome. Levin: I’d like to start by talking about your early technical interests and where they came from. When do you first recall being interested in what we might call technical things? Tarjan: Well, the first thing I would say in that direction is my mom took me to the public library in Pomona, where I grew up, which opened up a huge world to me. I started reading science fiction books and stories. Originally, I wanted to be the first person on Mars, that was what I was thinking, and I got interested in astronomy, started reading a lot of science stuff. I got to junior high school and I had an amazing math teacher. His name was Mr. Wall. I had him two years, in the eighth and ninth grade. He was teaching the New Math to us before there was such a thing as “New Math.” He taught us Peano’s axioms and things like that. It was a wonderful thing for a kid like me who was really excited about science and mathematics and so on. The other thing that happened was I discovered Scientific American in the public library and started reading Martin Gardner’s columns on mathematical games and was completely fascinated.
    [Show full text]
  • Clarisse Sieckenius De Souza Academic Degrees Positions
    Clarisse de Souza’s Short CV (as of December 2014) Clarisse Sieckenius de Souza Born 23.09.57 in Bento Gonçalves, State of Rio Grande do Sul, Brazil Academic degrees PhD, Applied Linguistics – Computational Linguistics, PUC‐Rio, 1988. MA, Portuguese Language, PUC‐Rio, 1982. BA, Written, Consecutive and Simultaneous Translation (Portuguese, English, French), PUC‐Rio, 1979. Positions 1982-1988 Head of Natural Language Database Querying Systems Design Group at EMBRATEL (Brazilian Telecommunications Company) 1987-1988 Visiting Professor at the Department of Informatics, PUC-Rio 1988-2006 Assistant/Associate Professor at the Department of Informatics, PUC-Rio 1989 Visiting Researcher at Philips Research Labs, Surrey UK (2 months) – with Donia Scott Visiting Scholar at CSLI (Center for the Study of Language and Information), Stanford 1991-1992 University (6 months) – with Terry Winograd Visiting Researcher (for short Winter visits, 1-2 months) at the Computer Science 1998…2001 Department, University of Waterloo (Canada), as part of collaboration with Tom Carey Visiting Professor at the Information Systems Department, University of Maryland Baltimore County (4 months) – with Jenny Preece 2002 Full Professor at the Department of Informatics, PUC-Rio. 2006-to date Research areas Human‐computer interaction. Semiotics and HCI. HCI theories. End User Development. Computer‐Mediated Communication. Cultural Dimensions in HCI. Awards and Distinctions 2010: ACM SIGDOC Rigo Award, “for extraordinary contributions to the field of communication design”. (http://sigdoc.acm.org/awards/rigo‐award/) 2013: Inducted to ACM SIGCHI CHI Academy. (http://www.sigchi.org/about/awards/2013‐ sigchi‐awards‐1) 2014: IFIP TC13 Pioneer in Human‐Computer Interaction (award to be handed over at INTERACT 2015 in Bamberg, September 2015 http://interact2015.org/) PhD supervising Currently principal supervisor of 4 PhD projects and co-supervisor of 2 PhD projects.
    [Show full text]
  • Communications of the Acm
    COMMUNICATIONS CACM.ACM.ORG OF THEACM 11/2014 VOL.57 NO.11 Scene Understanding by Labeling Pixels Evolution of the Product Manager The Data on Diversity On Facebook, Most Ties Are Weak Keeping Online Reviews Honest Association for Computing Machinery tvx-full-page.pdf-newest.pdf 1 11/10/2013 12:03 3-5 JUNE, 2015 BRUSSELS, BELGIUM Course and Workshop C proposals by M 15 November 2014 Y CM Paper Submissions by MY 12 January 2015 CY CMY K Work in Progress, Demos, DC, & Industrial Submissions by 2 March 2015 Welcoming Submissions on Content Production Systems & Infrastructures Devices & Interaction Techniques Experience Design & Evaluation Media Studies Data Science & Recommendations Business Models & Marketing Innovative Concepts & Media Art TVX2015.COM INFO@TVX2015.COM ACM Books M MORGAN& CLAYPOOL &C PUBLISHERS Publish your next book in the ACM Digital Library ACM Books is a new series of advanced level books for the computer science community, published by ACM in collaboration with Morgan & Claypool Publishers. I’m pleased that ACM Books is directed by a volunteer organization headed by a dynamic, informed, energetic, visionary Editor-in-Chief (Tamer Özsu), working closely with a forward-looking publisher (Morgan and Claypool). —Richard Snodgrass, University of Arizona books.acm.org ACM Books ◆ will include books from across the entire spectrum of computer science subject matter and will appeal to computing practitioners, researchers, educators, and students. ◆ will publish graduate level texts; research monographs/overviews of established and emerging fields; practitioner-level professional books; and books devoted to the history and social impact of computing. ◆ will be quickly and attractively published as ebooks and print volumes at affordable prices, and widely distributed in both print and digital formats through booksellers and to libraries and individual ACM members via the ACM Digital Library platform.
    [Show full text]
  • Benchmarks for IP Forwarding Tables
    Reviewers James Abello Richard Cleve Vassos Hadzilacos Dimitris Achilioptas James Clippinger Jim Hafner Micah Adler Anne Condon Torben Hagerup Oswin Aichholzer Stephen Cook Armin Haken William Aiello Tom Cormen Shai Halevi Donald Aingworth Dan Dooly Eric Hansen Susanne Albers Oliver Duschka Refael Hassin Eric Allender Martin Dyer Johan Hastad Rajeev Alur Ran El-Yaniv Lisa Hellerstein Andris Ambainis David Eppstein Monika Henzinger Amihood Amir Jeff Erickson Tom Henzinger Artur Andrzejak Kousha Etessami Jeremy Horwitz Boris Aronov Will Evans Russell Impagliazzo Sanjeev Arora Guy Even Piotr Indyk Amotz Barnoy Ron Fagin Sandra Irani Yair Bartal Michalis Faloutsos Ken Jackson Julien Basch Martin Farach-Colton David Johnson Saugata Basu Uri Feige John Jozwiak Bob Beals Joan Feigenbaum Bala Kalyandasundaram Paul Beame Stefan Felsner Ming-Yang Kao Steve Bellantoni Faith Fich Haim Kaplan Micahel Ben-Or Andy Fingerhut Bruce Kapron Josh Benaloh Paul Fischer Michael Kaufmann Charles Bennett Lance Fortnow Michael Kearns Marshall Bern Steve Fortune Sanjeev Khanna Nikolaj Bjorner Alan Frieze Samir Khuller Johannes Blomer Anna Gal Joe Kilian Avrim Blum Naveen Garg Valerie King Dan Boneh Bernd Gartner Philip Klein Andrei Broder Rosario Gennaro Spyros Kontogiannis Nader Bshouty Ashish Goel Gilad Koren Adam Buchsbaum Michel Goemans Dexter Kozen Lynn Burroughs Leslie Goldberg Dina Kravets Ran Canetti Paul Goldberg S. Ravi Kumar Pei Cao Oded Goldreich Eyal Kushilevitz Moses Charikar John Gray Stephen Kwek Chandra Chekuri Dan Greene Larry Larmore Yi-Jen Chiang
    [Show full text]
  • United States Patent [19] [11] E Patent Number: Re
    United States Patent [19] [11] E Patent Number: Re. 33,629 Palmer et a1. [45] Reissued Date of Patent: Jul. 2, 1991 [54] NUMERIC DATA PROCESSOR 1973, IEEE Transactions on Computers vol. C-22, pp. [75] Inventors: John F. Palmer, Cambridge, Mass; 577-586. Bruce W. Ravenel, Nederland, Co1o.; Bulman, D. M. "Stack Computers: An Introduction," Ra? Nave, Haifa, Israel May 1977, Computer pp. 18-28. Siewiorek, Daniel H; Bell, C. Gordon; Newell, Allen, [73] Assignee: Intel Corporation, Santa Clara, Calif. “Computer Structures: Principles and Examples," 1977, [21] Appl. No.: 461,538 Chapter 29, pp. 470-485 McGraw-Hill Book Co. Palmer, John F., “The Intel Standard for Floatin [22] Filed: Jun. 1, 1990 g-Point Arithmetic,“ Nov. 8-11, 1977, IEEE COMP SAC 77 Proceedings, 107-112. Related US. Patent Documents Coonen, J. T., "Speci?cations for a Proposed Standard Reissue of: t for Floating-Point Arithmetic," Oct. 13, 1978, Mem. [64] Patent No.: 4,338,675 #USB/ERL M78172, pp. 1-32. Issued: Jul. 6, 1982 Pittman, T. and Stewart, R. G., “Microprocessor Stan Appl. No: 120.995 dards,” 1978, AFIPS Conference Proceedings, vol. 47, Filed: Feb. 13, 1980 pp. 935-938. “7094-11 System Support For Numerical Analysis,“ by [51] Int. Cl.-‘ ........................ .. G06F 7/48; G06F 9/00; William Kahan, Dept. of Computer Science, Univ. of G06F 11/00 Toronto, Aug. 1966, pp. 1-51. [52] US. Cl. .................................. .. 364/748; 364/737; “A Uni?ed Decimal Floating-Point Architecture For 364/745; 364/258 The Support of High-Level Languages,‘ by Frederic [58] Field of Search ............. .. 364/748, 745, 737, 736, N.
    [Show full text]
  • Faster Math Functions, Soundly
    Faster Math Functions, Soundly IAN BRIGGS, University of Utah, USA PAVEL PANCHEKHA, University of Utah, USA Standard library implementations of functions like sin and exp optimize for accuracy, not speed, because they are intended for general-purpose use. But applications tolerate inaccuracy from cancellation, rounding error, and singularities—sometimes even very high error—and many application could tolerate error in function implementations as well. This raises an intriguing possibility: speeding up numerical code by tuning standard function implementations. This paper thus introduces OpTuner, an automatic method for selecting the best implementation of mathematical functions at each use site. OpTuner assembles dozens of implementations for the standard mathematical functions from across the speed-accuracy spectrum. OpTuner then uses error Taylor series and integer linear programming to compute optimal assignments of function implementation to use site and presents the user with a speed-accuracy Pareto curve they can use to speed up their code. In a case study on the POV-Ray ray tracer, OpTuner speeds up a critical computation, leading to a whole program speedup of 9% with no change in the program output (whereas human efforts result in slower code and lower-quality output). On a broader study of 37 standard benchmarks, OpTuner matches 216 implementations to 89 use sites and demonstrates speed-ups of 107% for negligible decreases in accuracy and of up to 438% for error-tolerant applications. Additional Key Words and Phrases: Floating point, rounding error, performance, approximation theory, synthesis, optimization 1 INTRODUCTION Floating-point arithmetic is foundational for scientific, engineering, and mathematical software. This is because, while floating-point arithmetic is approximate, most applications tolerate minute errors [Piparo et al.
    [Show full text]
  • The Mother of All Demos
    UC Irvine Embodiment and Performativity Title The Mother of All Demos Permalink https://escholarship.org/uc/item/91v563kh Author Salamanca, Claudia Publication Date 2009-12-12 Peer reviewed eScholarship.org Powered by the California Digital Library University of California The Mother of All Demos Claudia Salamanca PhD Student, Rhetoric Department University of California Berkeley 1929 Fairview St. Apt B. Berkeley, CA, 94703 1 510 735 1061 csalamanca@berkeley.edu ABSTRACT guide situated at the mission control and from there he takes us This paper analyses the documentation of the special session into another location: a location that Levy calls the final frontier. delivered by Douglas Engelbart and William English on This description offered by Levy as well as the performance in December 9, 1968 at the Fall Computer Joint Conference in San itself, shows a movement in time and space. The name, “The Francisco. Mother of All Demos,” refers to a temporality under which all previous demos are subcategories of this performance. Furthermore, the name also points to a futurality that is constantly Categories and Subject Descriptors in production: all future demos are also included. What was A.0 [Conference Proceedings] delivered on December 9, 1968 captured the past but also our future. In order to explain this extended temporality, Engelbart’s General Terms demo needs to be addressed not only from the perspective of the Documentation, Performance, Theory. technological breakthroughs but also the modes in which they were delivered. This mode of futurality goes beyond the future simple tense continuously invoked by rhetorics of progress and Keywords technology. The purpose of this paper is to interrogate “The Demo, medium performance, fragmentation, technology, Mother of All Demos” as a performance, inquiring into what this augmentation system, condensation, space, body, mirror, session made and is still making possible.
    [Show full text]
  • Reducibility
    Reducibility t REDUCIBILITY AMONG COMBINATORIAL PROBLEMS Richard M. Karp University of California at Berkeley Abstract: A large class of computational problems involve the determination of properties of graphs, digraphs, integers, arrays of integers, finite families of finite sets, boolean formulas and elements of other countable domains. Through simple encodings from such domains into the set of words over a finite alphabet these problems can be converted into language recognition problems, and we can inquire into their computational complexity. It is reasonable to consider such a problem satisfactorily solved when an algorithm for its solution is found which terminates within a . number of steps bounded by a polynomial in the length of the input. We show that a large number of classic unsolved problems of cover- ing. matching, packing, routing, assignment and sequencing are equivalent, in the sense that either each of them possesses a polynomial-bounded algorithm or none of them does. 1. INTRODUCTION All the general methods presently known for computing the chromatic number of a graph, deciding whether a graph has a Hamilton circuit. or solving a system of linear inequalities in which the variables are constrained to be 0 or 1, require a combinatorial search for which the worst case time requirement grows exponentially with the length of the input. In this paper we give theorems which strongly suggest, but do not imply, that these problems, as well as many others, will remain intractable perpetually. t This research was partially supported by National Science Founda- tion Grant GJ-474. 85 R. E. Miller et al. (eds.), Complexity of Computer Computations © Plenum Press, New York 1972 86 RICHARD M.
    [Show full text]
  • Communicative Capital for Prosthetic Agents Patrick M
    This is an unpublished technical report undergoing peer review, not a final typeset article. First draft: July 23, 2016. Current Draft: November 9, 2017. Communicative Capital for Prosthetic Agents Patrick M. Pilarski 1;2∗, Richard S. Sutton 2, Kory W. Mathewson 1;2, Craig Sherstan 1;2, Adam S. R. Parker 1;2, and Ann L. Edwards 1;2 1Division of Physical Medicine and Rehabilitation, Department of Medicine, University of Alberta, Edmonton, AB, Canada 2Reinforcement Learning and Artificial intelligence Laboratory, Department of Computing Science, University of Alberta, Edmonton, AB, Canada Correspondence*: Patrick M. Pilarski, Division of Physical Medicine and Rehabilitation, Department of Medicine, 5-005 Katz Group Centre for Pharmacy and Health Research, University of Alberta, Edmonton, AB, Canada, T6G 2E1. pilarski@ualberta.ca ABSTRACT This work presents an overarching perspective on the role that machine intelligence can play in enhancing human abilities, especially those that have been diminished due to injury or illness. As a primary contribution, we develop the hypothesis that assistive devices, and specifically artificial arms and hands, can and should be viewed as agents in order for us to most effectively improve their collaboration with their human users. We believe that increased agency will enable more powerful interactions between human users and next generation prosthetic devices, especially when the sensorimotor space of the prosthetic technology greatly exceeds the conventional control and communication channels available to a prosthetic user. To more concretely examine an agency-based view on prosthetic devices, we propose a new schema for interpreting the capacity of a human-machine collaboration as a function of both the human’s and machine’s degrees of agency.
    [Show full text]
  • Annual Report
    ANNUAL REPORT 2019FISCAL YEAR ACM, the Association for Computing Machinery, is an international scientific and educational organization dedicated to advancing the arts, sciences, and applications of information technology. Letter from the President It’s been quite an eventful year and challenges posed by evolving technology. for ACM. While this annual Education has always been at the foundation of exercise allows us a moment ACM, as reflected in two recent curriculum efforts. First, “ACM’s mission to celebrate some of the many the ACM Task Force on Data Science issued “Comput- hinges on successes and achievements ing Competencies for Undergraduate Data Science Cur- creating a the Association has realized ricula.” The guidelines lay out the computing-specific over the past year, it is also an competencies that should be included when other community that opportunity to focus on new academic departments offer programs in data science encompasses and innovative ways to ensure at the undergraduate level. Second, building on the all who work in ACM remains a vibrant global success of our recent guidelines for 4-year cybersecu- the computing resource for the computing community. rity curricula, the ACM Committee for Computing Edu- ACM’s mission hinges on creating a community cation in Community Colleges created a related cur- and technology that encompasses all who work in the computing and riculum targeted at two-year programs, “Cybersecurity arena” technology arena. This year, ACM established a new Di- Curricular Guidance for Associate-Degree Programs.” versity and Inclusion Council to identify ways to create The following pages offer a sampling of the many environments that are welcoming to new perspectives ACM events and accomplishments that occurred over and will attract an even broader membership from the past fiscal year, none of which would have been around the world.
    [Show full text]
  • Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University
    Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University. Linda A. Cicero/Stanford News Service. Whitfield Diffie Martin E. Hellman ernment–private sector relations, and attracts billions of Whitfield Diffie, former chief security officer of Sun Mi- dollars in research and development,” said ACM President crosystems, and Martin E. Hellman, professor emeritus Alexander L. Wolf. “In 1976, Diffie and Hellman imagined of electrical engineering at Stanford University, have been a future where people would regularly communicate awarded the 2015 A. M. Turing Award of the Association through electronic networks and be vulnerable to having for Computing Machinery for their critical contributions their communications stolen or altered. Now, after nearly to modern cryptography. forty years, we see that their forecasts were remarkably Citation prescient.” The ability for two parties to use encryption to commu- “Public-key cryptography is fundamental for our indus- nicate privately over an otherwise insecure channel is try,” said Andrei Broder, Google Distinguished Scientist. fundamental for billions of people around the world. On “The ability to protect private data rests on protocols for a daily basis, individuals establish secure online connec- confirming an owner’s identity and for ensuring the integ- tions with banks, e-commerce sites, email servers, and the rity and confidentiality of communications. These widely cloud. Diffie and Hellman’s groundbreaking 1976 paper, used protocols were made possible through the ideas and “New Directions in Cryptography,” introduced the ideas of methods pioneered by Diffie and Hellman.” public-key cryptography and digital signatures, which are Cryptography is a practice that facilitates communi- the foundation for most regularly used security protocols cation between two parties so that the communication on the Internet today.
    [Show full text]