DOCSLIB.ORG

Communications of the Acm

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

COMMUNICATIONS CACM.ACM.ORG OF THEACM 10/2015 VOL.58 NO.10 Discovering Genes Involved in Disease and the Mystery of Missing Heritability Crash Consistency Concerns Rise about AI Seeking Anonymity in an Internet Panopticon What Can Be Done about Gender Diversity in Computing? A Lot! 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 ACM A.M. TURING AWARD 1978 Robert Floyd 1979 Kenneth Iverson 1980 C.A.R Hoare NOMINATIONS SOLICITED 1981 Edgar Codd 1982 Stephen Cook Nominations are invited for the 2015 ACM A.M. Turing Award. 1983 Ken Thompson 1983 Dennis Ritchie This is ACM’s oldest and most prestigious award and is presented 1984 Niklaus Wirth annually for major contributions of lasting importance to computing. 1985 Richard Karp 1986 John Hopcroft Although the long-term influences of the nominee’s work are taken 1986 Robert Tarjan into consideration, there should be a particular outstanding and 1987 John Cocke 1988 Ivan Sutherland trendsetting technical achievement that constitutes the principal 1989 William Kahan claim to the award. The recipient presents an address at an ACM event 1990 Fernando Corbató 1991 Robin Milner that will be published in an ACM journal. The award is accompanied 1992 Butler Lampson by a prize of $1,000,000. Financial support for the award is provided 1993 Juris Hartmanis 1993 Richard Stearns by Google Inc. 1994 Edward Feigenbaum 1994 Raj Reddy Nomination information and the online submission form 1995 Manuel Blum 1996 Amir Pnueli are available on: 1997 Douglas Engelbart http://amturing.acm.org/call_for_nominations.cfm 1998 James Gray 1999 Frederick Brooks 2000 Andrew Yao Additional information on the Turing Laureates 2001 Ole-Johan Dahl is available on: 2001 Kristen Nygaard http://amturing.acm.org/byyear.cfm 2002 Leonard Adleman 2002 Ronald Rivest 2002 Adi Shamir The deadline for nominations/endorsements is 2003 Alan Kay November 30, 2015. 2004 Vinton Cerf 2004 Robert Kahn 2005 Peter Naur For additional information on ACM’s award program 2006 Frances E. Allen please visit: www.acm.org/awards/ 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 COMMUNICATIONS OF THE ACM Departments News Viewpoints 5 Editor’s Letter 24 Inside Risks What Can Be Done about Gender Keys Under Doormats Diversity in Computing? A Lot! Mandating insecurity by requiring By Moshe Y. Vardi government access to all data and communications. 7 Cerf’s Up By Peter G. Neumann et al. The Third Heidelberg Laureate Forum 27 Technology Strategy and Management By Vinton G. Cerf In Defense of IBM The ability to adjust to various 10 Letters to the Editor technical and business disruptions Ban ‘Naked’ Braces! has been essential to IBM’s success during the past century. 12 BLOG@CACM By Michael A. Cusumano The Morality of Online War; 15 the Fates of Data Analytics, HPC 29 Kode Vicious John Arquilla considers justifications 15 Scientists Update Views of Light Storming the Cubicle for warfare in the cyber realm, Experiment sheds new light Acquisitive redux. while Daniel Reed looks ahead at on wave-particle duality. By George V. Neville-Neil big data and exascale computing. By Gary Anthes 32 The Business of Software 33 Calendar 18 Automotive Systems Get Smarter Thinking Thoughts Automotive infotainment systems On brains and bytes. 98 Careers are driving changes to automobiles, By Phillip G. Armour and to driver behavior. By Samuel Greengard 35 Historical Reflections Last Byte Computing Is History 21 Cyber Policies on the Rise Reflections on the past 104 Future Tense A growing number of companies are to inform the future. Processional taking out cybersecurity insurance By Thomas J. Misa Information processing gives policies to protect themselves from spiritual meaning to life, for those the costs of data breaches. 38 Viewpoint who make it their life’s work. By Keith Kirkpatrick Rise of Concerns about AI: By William Sims Bainbridge Reflections and Directions Research, leadership, and communication about AI futures. By Thomas G. Dietterich and Eric J. Horvitz Watch the authors discuss their work in this exclusive Communications video. http://cacm.acm.org/ videos/rise-of-concerns- about-ai-reflections-and- directions 41 Viewpoint Life After MOOCs Online science education needs a new revolution. Association for Computing Machinery Advancing Computing as a Science & Profession By Phillip Compeau and Pavel A. Pevzner CARBONE/EPFL FABRIZIO BY IMAGE 2 COMMUNICATIONS OF THE ACM | OCTOBER 2015 | VOL. 58 | NO. 10 10/2015 VOL. 58 NO. 10 Practice Contributed Articles Review Articles 46 70 80 46 Crash Consistency 58 Seeking Anonymity 80 Discovering Genes Involved Rethinking the fundamental in an Internet Panopticon in Disease and the Mystery of abstractions of the file system. The Dissent system aims for a Missing Heritability By T.S. Pillai, V. Chidambaram, quantifiably secure, collective The challenge of missing heritability R. Alagappan, S. Al-Kiswany, approach to anonymous offers great contribution options for A.C. Arpaci-Dusseau, communication online. computer scientists. and R.H. Arpaci-Dusseau By Joan Feigenbaum and Bryan Ford By Eleazar Eskin Watch the author discuss 52 Dismantling the Barriers to Entry 70 Framing Sustainability as his work in this exclusive We have to choose to build a Web a Property of Software Quality Communications video. http://cacm.acm.org/ that is accessible to everyone. This framework addresses videos/discovering-genes- By Rich Harris the environmental dimension involved-in-disease- and-the-mystery-of- of software performance, as missing-heritability Articles’ development led by applied here by a paper mill queue.acm.org and a car-sharing service. Research Highlights By Patricia Lago, Sedef Akinli Koçak, Ivica Crnkovic, and 90 Technical Perspective Birgit Penzenstadler Not Just a Matrix Laboratory Anymore By Cleve Moler 91 Computing Numerically with Functions Instead of Numbers By Lloyd N. Trefethen About the Cover: Discovering the variants involved in human disease calls on computing scientists to lead the exploration of huge datasets. Eleazar Eskin examines the mystery of missing heritability (p. 80) Cover illustration by Charles Wiese; IMAGES BY CWA STUDIOS; CIENPIES DESIGN; CHARLES WIESE CHARLES DESIGN; CIENPIES STUDIOS; CWA BY IMAGES www.charleswiese.com. OCTOBER 2015 | VOL. 58 | NO. 10 | 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 Copyright © 2015 by Association for resources that advance computing as a DIRECTOR OF GROUP PUBLISHING EDITOR-IN-CHIEF Computing Machinery, Inc. (ACM). science and profession. ACM provides the Scott E. Delman Moshe Y. Vardi Permission to make digital or hard copies computing field’s premier Digital Library [email protected] [email protected] of part or all of this work for personal and serves its members and the computing or classroom use is granted without NEWS profession with leading-edge publications, Executive Editor fee provided that copies are not made Co-Chairs conferences, and career resources. Diane Crawford or distributed for profit or commercial William Pulleyblank and Marc Snir Managing Editor advantage and that copies bear this Board Members Acting Director and CEO and Thomas E. Lambert notice and full citation on the first Mei Kobayashi; Kurt Mehlhorn; Deputy Executive Director and COO Senior Editor page. Copyright for components of this Michael Mitzenmacher; Rajeev Rastogi Patricia Ryan Andrew Rosenbloom work owned by others than ACM must Director, Office of Information Systems Senior Editor/News VIEWPOINTS be honored. Abstracting with credit is Wayne Graves Larry Fisher Co-Chairs permitted. To copy otherwise, to republish, Director, Office of Financial Services Web Editor Tim Finin; Susanne E. Hambrusch; to post on servers, or to redistribute to Darren Ramdin David Roman John Leslie King lists, requires prior specific permission Director, Office of SIG Services Rights and Permissions Board Members and/or fee. Request permission to publish Donna Cappo Deborah Cotton William Aspray; Stefan Bechtold; from [email protected] or fax Director, Office of Publications Michael L. Best; Judith Bishop; (212) 869-0481.
Recommended publications
  • Communications of the Acm

    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 [email protected] 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.
  • Benchmarks for IP Forwarding Tables

    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
  • MODELING and ANALYSIS of MOBILE TELEPHONY PROTOCOLS by Chunyu Tang a DISSERTATION Submitted to the Faculty of the Stevens Instit

    MODELING and ANALYSIS of MOBILE TELEPHONY PROTOCOLS by Chunyu Tang a DISSERTATION Submitted to the Faculty of the Stevens Instit

    MODELING AND ANALYSIS OF MOBILE TELEPHONY PROTOCOLS by Chunyu Tang A DISSERTATION Submitted to the Faculty of the Stevens Institute of Technology in partial fulfillment of the requirements for the degree of DOCTOR OF PHILOSOPHY Chunyu Tang, Candidate ADVISORY COMMITTEE David A. Naumann, Chairman Date Yingying Chen Date Daniel Duchamp Date Susanne Wetzel Date STEVENS INSTITUTE OF TECHNOLOGY Castle Point on Hudson Hoboken, NJ 07030 2013 c 2013, Chunyu Tang. All rights reserved. iii MODELING AND ANALYSIS OF MOBILE TELEPHONY PROTOCOLS ABSTRACT The GSM (2G), UMTS (3G), and LTE (4G) mobile telephony protocols are all in active use, giving rise to a number of interoperation situations. This poses serious challenges in ensuring authentication and other security properties. Analyzing the security of all possible interoperation scenarios by hand is, at best, tedious under- taking. Model checking techniques provide an effective way to automatically find vulnerabilities in or to prove the security properties of security protocols. Although the specifications address the interoperation cases between GSM and UMTS and the switching and mapping of established security context between LTE and previous technologies, there is not a comprehensive specification of which are the possible interoperation cases. Nor is there comprehensive specification of the procedures to establish security context (authentication and short-term keys) in the various interoperation scenarios. We systematically enumerate the cases, classifying them as allowed, disallowed, or uncertain with rationale based on detailed analysis of the specifications. We identify the authentication and key agreement procedure for each of the possible cases. We formally model the pure GSM, UMTS, LTE authentication protocols, as well as all the interoperation scenarios; we analyze their security, in the symbolic model of cryptography, using the tool ProVerif.
  • Department of Computer Science

    Department of Computer Science

    i cl i ck ! MAGAZINE click MAGAZINE 2014, VOLUME II FIVE DECADES AS A DEPARTMENT. THOUSANDS OF REMARKABLE GRADUATES. 50COUNTLESS INNOVATIONS. Department of Computer Science click! Magazine is produced twice yearly for the friends of got your CS swag? CS @ ILLINOIS to showcase the innovations of our faculty and Commemorative 50-10 Anniversary students, the accomplishments of our alumni, and to inspire our t-shirts are available! partners and peers in the field of computer science. Department Head: Editorial Board: Rob A. Rutenbar Tom Moone Colin Robertson Associate Department Heads: Rob A. Rutenbar shop now! my.cs.illinois.edu/buy Gerald DeJong Michelle Wellens Jeff Erickson David Forsyth Writers: David Cunningham CS Alumni Advisory Board: Elizabeth Innes Alex R. Bratton (BS CE ’93) Mike Koon Ira R. Cohen (BS CS ’81) Rick Kubetz Vilas S. Dhar (BS CS ’04, BS LAS BioE ’04) Leanne Lucas William M. Dunn (BS CS ‘86, MS ‘87) Tom Moone Mary Jane Irwin (MS CS ’75, PhD ’77) Michelle Rice Jennifer A. Mozen (MS CS ’97) Colin Robertson Daniel L. Peterson (BS CS ’05) Laura Schmitt Peter L. Tannenwald (BS LAS Math & CS ’85) Michelle Wellens Jill C. Zmaczinsky (BS CS ’00) Design: Contact us: SURFACE 51 [email protected] 217-333-3426 Machines take me by surprise with great frequency. Alan Turing 2 CS @ ILLINOIS Department of Computer Science College of Engineering, College of Liberal Arts & Sciences University of Illinois at Urbana-Champaign shop now! my.cs.illinois.edu/buy click i MAGAZINE 2014, VOLUME II 2 Letter from the Head 4 ALUMNI NEWS 4 Alumni
  • Lipics-ISAAC-2020-42.Pdf (0.5

    Lipics-ISAAC-2020-42.Pdf (0.5

    Multiparty Selection Ke Chen Department of Computer Science, University of Wisconsin–Milwaukee, WI, USA [email protected] Adrian Dumitrescu Department of Computer Science, University of Wisconsin–Milwaukee, WI, USA [email protected] Abstract Given a sequence A of n numbers and an integer (target) parameter 1 ≤ i ≤ n, the (exact) selection problem is that of finding the i-th smallest element in A. An element is said to be (i, j)-mediocre if it is neither among the top i nor among the bottom j elements of S. The approximate selection problem is that of finding an (i, j)-mediocre element for some given i, j; as such, this variant allows the algorithm to return any element in a prescribed range. In the first part, we revisit the selection problem in the two-party model introduced by Andrew Yao (1979) and then extend our study of exact selection to the multiparty model. In the second part, we deduce some communication complexity benefits that arise in approximate selection. In particular, we present a deterministic protocol for finding an approximate median among k players. 2012 ACM Subject Classification Theory of computation Keywords and phrases approximate selection, mediocre element, comparison algorithm, i-th order statistic, tournaments, quantiles, communication complexity Digital Object Identifier 10.4230/LIPIcs.ISAAC.2020.42 1 Introduction Given a sequence A of n numbers and an integer (selection) parameter 1 ≤ i ≤ n, the selection problem asks to find the i-th smallest element in A. If the n elements are distinct, the i-th smallest is larger than i − 1 elements of A and smaller than the other n − i elements of A.
  • Diffie and Hellman Receive 2015 Turing Award Rod Searcey/Stanford University

    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.
  • The Changing Shape of the Computing World

    The Changing Shape of the Computing World

    Outside the Box — The Changing Shape of the Computing World Steve Cunningham Computer Science California State University Stanislaus Turlock, CA 95382 [email protected] http://www.cs.csustan.edu/~rsc Something happened to computing while many of us were busy practicing or teaching our craft, and computing is not quite the same thing we learned. We can ignore this change and others will take our place and teach about it, but they will not have the context and the skill to understand the technology behind it and to carry it forward to the success it should have. And if others carry that torch, computer science will be stunted because we didn't recognize and respond to the opportunity. What happened? Simply this—that Xerox and Apple and, yes, Microsoft opened up the box labeled “CAUTION: Computer Inside” and let the user into the computing picture. Users responded hesitantly but increasingly eagerly and now expect the computer to work for them instead of their working for the computer. Every application now in wide use, and any system that supports a general market, has evolved to meet that expectation. Any computing education that does not pay attention to the user’s role in computing is missing the most vibrant and exciting part of computing today. As it says at the top of this page, you are reading an editorial, not an academic paper. As an editorial, this note represents my personal passion and commitment to the user communication part of computing that the “official” computing establishment has long discounted, and I appreciate John Impagliazzo’s offer of this forum to make my case that computer science is missing the boat in not understanding the need to reshape computer science education to fill this void.
  • COT 5407:Introduction to Algorithms Author and Copyright: Giri Narasimhan Florida International University Lecture 1: August 28, 2007

    COT 5407:Introduction to Algorithms Author and Copyright: Giri Narasimhan Florida International University Lecture 1: August 28, 2007

    COT 5407:Introduction to Algorithms Author and Copyright: Giri Narasimhan Florida International University Lecture 1: August 28, 2007. 1 Introduction The field of algorithms is the bedrock on which all of computer science rests. Would you jump into a business project without understanding what is in store for you, without know- ing what business strategies are needed, without understanding the nature of the market, and without evaluating the competition and the availability of skilled available workforce? In the same way, you should not undertake writing a program without thinking out a strat- egy (algorithm), without theoretically evaluating its performance (algorithm analysis), and without knowing what resources you will need and you have available. While there are broad principles of algorithm design, one of the the best ways to learn how to be an expert at designing good algorithms is to do an extensive survey of “case studies”. It provides you with a storehouse of strategies that have been useful for solving other problems. When posed with a new problem, the first step is to “model” your problem appropriately and cast it as a problem (or a variant) that has been previously studied or that can be easily solved. Often the problem is rather complex. In such cases, it is necessary to use general problem-solving techniques that one usually employs in modular programming. This involves breaking down the problem into smaller and easier subproblems. For each subproblem, it helps to start with a skeleton solution which is then refined and elaborated upon in a stepwise manner. Once a strategy or algorithm has been designed, it is important to think about several issues: why is it correct? does is solve all instances of the problem? is it the best possible strategy given the resource limitations and constraints? if not, what are the limits or bounds on the amount of resources used? are improved solutions possible? 2 History of Algorithms It is important for you to know the giants of the field, and the shoulders on which we all stand in order to see far.
  • Jacob O. Wobbrock, Ph.D. Curriculum Vitae Professor, the Information School Wobbrock@Uw.Edu by Courtesy, Paul G

    Jacob O. Wobbrock, Ph.D. Curriculum Vitae Professor, the Information School [email protected] by Courtesy, Paul G

    20-Sept-2021 1 of 29 Jacob O. Wobbrock, Ph.D. Curriculum Vitae Professor, The Information School [email protected] By Courtesy, Paul G. Allen School of Computer Science & Engineering Homepage Director, ACE Lab Google Scholar Founding Co-Director, CREATE Center University of Washington Box 352840 Seattle, WA, USA 98195-2840 BIOGRAPHY______________________________________________________________________________________________ Jacob O. Wobbrock is a Professor of human-computer interaction (HCI) in The Information School, and, by courtesy, in the Paul G. Allen School of Computer Science & Engineering at the University of Washington, which U.S. News ranked the 8th best global university for 2021. Prof. Wobbrock’s work seeks to scientifically understand people’s experiences of computers and information, and to improve those experiences by inventing new interactive technologies, especially for people with disabilities. His specific research topics include input & interaction techniques, human performance measurement & modeling, HCI research & design methods, mobile computing, and accessible computing. Prof. Wobbrock has co-authored ~200 publications and 19 patents, receiving 25 paper awards, including 7 best papers and 8 honorable mentions from ACM CHI, the flagship conference in HCI. For his work in accessible computing, he received the 2017 SIGCHI Social Impact Award and the 2019 SIGACCESS ASSETS Paper Impact Award. He was named the #1 Most Influential Scholar in HCI by the citation-ranking system AMiner in 2018 and 2021, and was runner-up in 2020. He was also inducted into the prestigious CHI Academy in 2019. His work has been covered in The New York Times, The Washington Post, The Huffington Post, USA Today, and other outlets. He is the recipient of an NSF CAREER award and 7 other National Science Foundation grants.
  • Meredith Ringel Morris Meredith.Morris@Gmail.Com, Merrie@Google.Com Google Scholar Page

    Meredith Ringel Morris [email protected], [email protected] Google Scholar Page

    Meredith Ringel Morris [email protected], [email protected] http://merrie.info, Google Scholar page OVERVIEW I am an internationally-recognized expert in Human Computer Interaction (HCI), focusing on the design, development, and evaluation of collaborative, social, and accessible technologies, including working at the boundary of HCI and AI to develop responsible AI-based technologies that enhance the capabilities of all people. I am seeking opportunities to do world-changing research and/or lead a high-impact team at the intersection of HCI and AI, drawing on my unique expertise in collaborative and accessible computing to invent the next generation of inclusive technologies. Areas of expertise: gesture interfaces, collaborative technologies, social media, social search, Q&A systems, information retrieval, crowdsourcing, accessible and assistive technologies, digital inclusion, universal design, human-centered AI, responsible AI EDUCATION 2006 Ph.D. in Computer Science, Stanford University 2003 M.S. in Computer Science, Stanford University 2001 Sc.B. in Computer Science, Brown University (Magna Cum Laude) PROFESSIONAL EXPERIENCE 2021 - present Google Research Director and Principal Scientist, People + AI Research 2006 - 2021 Microsoft Research Sr. Principal Researcher and Research Manager • Founder and Research Manager of the Ability group (2018 – 2020) • Redmond Lab Leadership Team member (2020 - 2021) • Research Area Manager for Interaction, Accessibility, and Mixed Reality (2020 – 2021) 2001 – 2006 Stanford University Department
  • Bit Barrier: Secure Multiparty Computation with a Static Adversary

    Bit Barrier: Secure Multiparty Computation with a Static Adversary

    Breaking the O(nm) Bit Barrier: Secure Multiparty Computation with a Static Adversary Varsha Dani Valerie King Mahnush Mohavedi University of New Mexico University of Victoria University of New Mexico Jared Saia University of New Mexico Abstract We describe scalable algorithms for secure multiparty computation (SMPC). We assume a synchronous message passing communication model, but unlike most related work, we do not assume the existence of a broadcast channel. Our main result holds for the case where there are n players, of which a 1=3 − fraction are controlled by an adversary, for any positive constant.p We describe a SMPC algorithm forp this model that requires each player to send ~ n+m ~ n+m O( n + n) messages and perform O( n + n) computations to compute any function f, where m is the size of a circuit to compute f. We also consider a model where all players are selfish but rational. In this model, we describe a Nash equilibrium protocol that solve SMPC ~ n+m ~ n+m and requires each player to send O( n ) messages and perform O( n ) computations. These results significantly improve over past results for SMPC which require each player to send a number of bits and perform a number of computations that is θ(nm). 1 Introduction In 1982, Andrew Yao posed a problem that has significantly impacted the weltanschauung of computer security research [22]. Two millionaires want to determine who is wealthiest; however, neither wants to reveal any additional information about their wealth. Can we design a protocol to allow both millionaires to determine who is wealthiest? This problem is an example of the celebrated secure multiparty computation (SMPC) problem.
  • Dina Goldin · Scott A. Smolka · Peter Wegner (Eds.) Dina Goldin Scott A

    Dina Goldin · Scott A. Smolka · Peter Wegner (Eds.) Dina Goldin Scott A

    Dina Goldin · Scott A. Smolka · Peter Wegner (Eds.) Dina Goldin Scott A. Smolka Peter Wegner (Eds.) Interactive Computation The New Paradigm With 84 Figures 123 Editors Dina Goldin Scott A. Smolka Brown University State University of New York at Stony Brook Computer Science Department Department of Computer Science Providence, RI 02912 Stony Brook, NY 11794-4400 USA USA [email protected] [email protected] Peter Wegner Brown University Computer Science Department Providence, RI 02912 USA [email protected] Cover illustration: M.C. Escher’s „Whirlpools“ © 2006 The M.C. Escher Company-Holland. All rights reserved. www.mcescher.com Library of Congress Control Number: 2006932390 ACM Computing Classification (1998): F, D.1, H.1, H.5.2 ISBN-10 3-540-34666-X Springer Berlin Heidelberg New York ISBN-13 978-3-540-34666-1 Springer Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broad- casting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. Springer is a part of Springer Science+Business Media springer.com © Springer-Verlag Berlin Heidelberg 2006 The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant pro- tective laws and regulations and therefore free for general use.