AAAI-20 Program/Exhibit Guide

Total Page:16

File Type:pdf, Size:1020Kb

AAAI-20 Program/Exhibit Guide AAAI-20 / IAAI-20 / EAAI-20 Conference Program New York Hilton Midtown New York, New York February 7–12, 2020 Thirty-Fourth AAAI Conference on Artificial Intelligence Thirty-Second Conference on Innovative Applications of Artificial Intelligence Tenth Symposium on Educational Advances in Artificial Intelligence Conference Highlights at a Glance MORNING AFTERNOON EVENING Friday, February 7 Tutorial Forum Tutorial Forum Student Welcome Reception Workshops Workshops AAAI/SIGAI DC AAAI/SIGAI DC Undergraduate Consortium Undergraduate Consortium AIES 2020 Conference AIES 2020 Conference AIES Opening Reception Saturday, February 8 Tutorial Forum Tutorial Forum AAAI Opening Reception Workshops Workshops AAAI/SIGAI DC AAAI/SIGAI DC EAAI Award Lecture: desJardins EAAI Technical Program AIES 2020 Conference AIES 2020 Conference Sunday, February 9 AAAI / IAAI Welcome / AAAI Awards Lunch with a Fellow AAAI Turing Award Event AAAI Presidential Address: Yolanda Gil Fellows Dinner AAAI Classic Paper Award Talk: Junker Senior Member Talks Poster / DemoSession 1 EAAI Invited Talk: Shapiro/ IAAI Technical Program Zimmermann-Niefield EAAI Technical Program Exhibits Exhibits Monday, February 10 Women’s Mentoring Breakfast Lunch with a Fellow IAAI RSE Award Lecture: Kautz AAAI Invited Talk: Billard AAAI/IAAI Technical Program AAAI-20 Debate IAAI Invited Talk: Cox Senior Member Talks Poster / Demo Session 2 Student Abstract Spotlights Sister Conference Track Sister Conference Track Exhibits Exhibits Tuesday, February 11 AAAI Conference Awards Lunch with a Fellow AI History Panel AAAI/IAAI Invited Talk: Song AAAI Invited Talk: Athey Poster / Demo Session 3 AAAI/IAAI Technical Program IAAI/IAAI Technical Program Games Night Exhibits Exhibits / AI Job Fair Wednesday, February 12 AAAI Invited Talk: Russell AAAI Technical Program AI in Practice Networking Event AAAI Community Meeting AI in Practice AI in Practice 2 CONFERENCE AT A GLANCE Contents Sponsoring Organizations AAAI Community Meeting / 5 Acknowledgments / 4 AAAI gratefully acknowledges the generous contributions of the following organizations and individuals to AAAI-20: AI History Panel / 7 AI in Practice / 12 Platinum Sponsors AI Job Fair / 14, 17 IBM Research AIES 2020 / 13 Sony Awards / 3–8 Gold Sponsors Childcare / 17 Amazon Conference at a Glance / 2 AI Journal Diversity and Inclusion / 6 Beijing Baidu Netcom Science Technology Co., Ltd Doctoral Consortium / 12 Bloomberg Google AI EAAI-20 Program / 13 Happy Elements Exhibition / 14–17 Superb AI Games Night / 14 Silver Sponsor IAAI-20 Program / 13 Apple Invited Talks / Panels / 9–11 Elsevier, Ltd Poster / Demo Sessions / 7 Tongdun Technology Registration / 17 Bronze Sponsors Senior Member, Blue Sky Program / 12 Alegion Social Events / 7 Dataminr Special Meetings / 5 Facebook Special Track: AI for Social Impact / 12 iMerit Sponsors / 3 Jane Street Microsoft Student Abstracts / 13 NLMatics Student Activities & Outreach / 11-14 Openstream Talk Length Key / 18 TheTake.AI Two Sigma Technical Program Overview / 18–22 United Technologies Research Center Turing Award Event / 10 USC/ISI Tutorial Forum / 8 Verisk Analytics Undergraduate Consortium / 13 Center for Artificial Intelligence Research, University of Tsukuba Visa Research Women’s Mentoring Breakfast / 14 Workshop Program / 11 General Sponsors ACM/SIGAI Awards CRA Computing Community Consortium (CCC) David E. Smith AAAI Special Awards and honors will be pre- sented Sunday, February 9, 8:00 – 8:30 AM, in the Grand Ballroom on the 3rd floor of the New York Hilton Midtown Hotel. AAAI-20 Awards will be presented on Tuesday, February 11, 8:00 – 8:30 ber of members who have made significant sus- Natasha Noy (Google, USA) AM in the same location. tained contributions to the field of artificial intel- Martha Palmer (University of Colorado Boulder, ligence, and who have attained unusual distinc- USA) 2020 AAAI Special Awards, Honors tion in the profession. AAAI is pleased to an- Dragomir Radev (Yale University, USA) AAAI Honors and Special Awards will be pre- nounce the ten newly elected Fellows for 2020, Thomas Schiex (Institut National de Recherche sented by Subbarao Kambhampati, Awards who will be honored during the annual Fellows pour l'Agriculture, l'Alimentation et l'Environ- Committee Chair and AAAI Past President, dinner on Sunday, February 9, 2020: nement, France) Sylvie Thiébaux (The Australian National Universi- Yolanda Gil, AAAI President, and Bart Selman, Yoshua Bengio (Université de Montréal, Canada) ty, Australia) AAAI President-Elect. Cynthia Breazeal (MIT Media Lab, USA) William T. Freeman (Massachusetts Institute of 2020 AAAI Fellows Recognition Technology and Google Research, USA) 2020 Senior Member Recognition Each year, the Association for the Advancement Yann LeCun (New York University, USA) AAAI is pleased to announce the newly elected of Artificial Intelligence recognizes a small num- Radhika Nagpal (Harvard University, USA) 2020 AAAI senior members, who are being rec- CONTENTS / SPONSORS / AWARDS 3 Acknowledgements The Association for the Advancement of Artificial Intelligence acknowledges and thanks the following individuals for their generous contribu- tions of time and energy to the successful creation and planning of the Thirty-Fourth AAAI Conference on Artificial Intelligence, the Thirty- Second Conference on Innovative Applications of Artificial Intelligence, and the Tenth Symposium on Educational Advances in Artificial In- telligence. (A complete listing of the AAAI-20 and IAAI-20 Program Committee members will appear on the conference website.) AAAI Conference Committee Chair Presentation Chair Peter Stone (University of Texas at Austin, USA) Eugene Freuder (University College Cork, Ireland) AAAI-20 General Chair Student Abstract Cochairs Francesca Rossi (IBM Research, USA) Bo An (Nanyang Technological University, Singapore) Nicola Gatti (Politecnico di Milano | Polimi, Italy) AAAI-20 Program Cochairs Vincent Conitzer (Duke University, USA) Doctoral Consortium Cochairs Fei Sha (Google Research and University of Southern California, USA) Laura Hiatt (Naval Research Laboratory, USA) Shiwali Mohan (PARC, USA) Workflow Chairs Haoming Li (Duke University, USA) Undergraduate Consortium Cochairs Yury Zemlyanskiy (University of Southern California, USA) Jim Boerkoel (Harvey Mudd College, USA) Mehmet Ergezer (Wentworth Institute of Technology, USA) AAAI-20 Special Track on AI for Social Impact Cochairs Fei Fang (Carnegie Mellon University, USA) Student Activities Cochairs Eric Sodomka (Facebook Research, USA) Sriraam Natarajan (University of Texas, Dallas, USA) Milind Tambe (Harvard University, USA) Nathan Sturtevant (University of Alberta, Canada) William Yeoh (New Mexico State University, USA) IAAI-20 Conference Chair and Cochair Ruchir Puri (IBM Research, USA) K-12 Student Outreach Cochairs Neil Yorke-Smith (TU Delft, Netherlands) Dave Touretzky (Carnegie Mellon University, USA) Christina Gardner-McCune (University of Florida, USA) EAAI-20 Symposium Cochairs Nate Derbinsky (Northeastern University, USA) AI in Practice Chair and Cochair Lisa Torrey (St. Lawrence University, USA) Evgeniy Gabrilovich (Google, USA) Ashish Jha (Harvard University, USA) Senior Member Track Cochairs Judy Goldsmith (University of Kentucky, USA) AAAI/ACM SIGAI Job Fair Cochairs Sven Koenig (University of Southern California, USA) John Dickerson (University of Maryland, USA) Michael Albert (University of Virginia, USA) Sister Conference Track Chair Thomas Schiex (French National Institute Diversity and Inclusion Chair for Agricultural Research, INRA, France) Maria Gini (University of Minnesota, USA) Demonstrations Cochairs Fundraising Cochairs Nicholas Mattei (Tulane University, USA) Barry O’Sullivan (University College Cork, Ireland) Kartik Talamadupula (IBM, USA) Pingzhong Tang (Tsinghua University, China) Tutorial Forum Cochairs AI History Panel Chair Pradeep Varakantham (Singapore Management University, Singapore) Amy Greenwald (Brown University, USA) K. Brent Venable (IHMC and Tulane University, USA) AI Debate Chair Workshop Program Cochairs Kevin Leyton-Brown (University of British Columbia, Canada) Min-Ling Zhang (Southeast University, China) Biplav Srivastava (IBM, USA) Volunteer Coordinator Victor Khaustov (The University of Aizu, Japan) ognized for their long-term participation in Biplav Srivastava (IBM Research, USA) QUICKXPLAIN: Preferred Explanations and Relax- ations for Over-Constrained Problems AAAI and their distinction in the field of artificial Pradeep Varakantham (Singapore Management Ulrich Junker intelligence. University, Singapore) For developing an influential approach for formal- Yigal Arens (USC Information Sciences Institute, Fusun Yaman (BBN Technologies, USA) izing and efficiently computing user-preferred fail- USA) ure explanations in over-constrained problems. Hankz Hankui Zhuo (Sun Yat-Sen University, China) Wingyan Chung (University of Central Florida, USA) The Classic Paper Award Talk, by Ulrich Junker, Yun Fu (Northeastern University, USA) 2020 AAAI Classic Paper Award will be held Sunday, February 9, at 9:30 AM in Re- Kobi Gal (Ben-Gurion University Israel and Univer- gent, 2nd floor. sity of Edinburgh, UK) The 2020 AAAI Classic Paper award honors the Nick Hawes (University of Oxford, UK) authors of the following paper deemed most in- 2020 Distinguished Service Award Lane Hemaspaandra (University of Rochester, USA) fluential from the Nineteenth National Confer- Henry Kautz (University of Rochester, USA) Balaraman Ravindran (Indian Institute of Technol- ence
Recommended publications
  • Using Game Theory for Los Angeles Airport Security
    Articles Using Game Theory for Los Angeles Airport Security James Pita, Manish Jain, Fernando Ordóñez, Christopher Portway, Milind Tambe, Craig Western, Praveen Paruchuri, and Sarit Kraus n Security at major locations of economic or political impor tance is a key concern around P the world, particularly given the threat of ter- rotecting national infrastructure such as airports, historical rorism. Limited security resources prevent full landmarks, or a location of political or economic importance is security coverage at all times, which allows a challenging task for police and security agencies around the adversaries to observe and exploit patterns in world, a challenge that is exacerbated by the threat of terrorism. selective patrolling or mon itoring; for exam- Such protection of important locations includes tasks such as ple, they can plan an attack avoiding existing monitoring all entrances or inbound roads and checking pa trols. Hence, randomized patrolling or monitoring is impor tant, but randomization inbound traffic. However, limited resources imply that it is typ- must provide distinct weights to dif ferent ically impossible to provide full security cover age at all times. actions based on their complex costs and Furthermore, adversaries can observe se curity arrangements benefits. To this end, this article describes a over time and exploit any predictable patterns to their advan- promising transition of the lat est in multia- tage. Randomizing schedules for pa trolling, checking, or moni- gent algorithms into a deployed application. toring is thus an important tool in the police arsenal to avoid In particular, it describes a software assistant the vulnerability that comes with predictability.
    [Show full text]
  • Rivest, Shamir, and Adleman Receive 2002 Turing Award, Volume 50
    Rivest, Shamir, and Adleman Receive 2002 Turing Award Cryptography and Information Se- curity Group. He received a B.A. in mathematics from Yale University and a Ph.D. in computer science from Stanford University. Shamir is the Borman Profes- sor in the Applied Mathematics Department of the Weizmann In- stitute of Science in Israel. He re- Ronald L. Rivest Adi Shamir Leonard M. Adleman ceived a B.S. in mathematics from Tel Aviv University and a Ph.D. in The Association for Computing Machinery (ACM) has computer science from the Weizmann Institute. named RONALD L. RIVEST, ADI SHAMIR, and LEONARD M. Adleman is the Distinguished Henry Salvatori ADLEMAN as winners of the 2002 A. M. Turing Award, Professor of Computer Science and Professor of considered the “Nobel Prize of Computing”, for Molecular Biology at the University of Southern their contributions to public key cryptography. California. He earned a B.S. in mathematics at the The Turing Award carries a $100,000 prize, with University of California, Berkeley, and a Ph.D. in funding provided by Intel Corporation. computer science, also at Berkeley. As researchers at the Massachusetts Institute of The ACM presented the Turing Award on June 7, Technology in 1977, the team developed the RSA 2003, in conjunction with the Federated Computing code, which has become the foundation for an en- Research Conference in San Diego, California. The tire generation of technology security products. It award was named for Alan M. Turing, the British mathematician who articulated the mathematical has also inspired important work in both theoret- foundation and limits of computing and who was a ical computer science and mathematics.
    [Show full text]
  • Welcome to AI Matters 5(1)
    AI MATTERS, VOLUME 5, ISSUE 1 5(1) 2019 Welcome to AI Matters 5(1) Amy McGovern, co-editor (University of Oklahoma; [email protected]) Iolanda Leite, co-editor (Royal Institute of Technology (KTH); [email protected]) DOI: 10.1145/3320254.3320255 Issue overview receiving the 2018 ACM A.M. Turing Award! Welcome to the first issue of the fifth vol- ume of the AI Matters Newsletter! This issue opens with some news on a new SIGAI Stu- Submit to AI Matters! dent Travel Scholarship where we aim to en- Thanks for reading! Don’t forget to send courage students from traditionally underrep- your ideas and future submissions to AI resented geographic locations to apply and at- Matters! We’re accepting articles and an- tend SIGAI supported events. We also sum- nouncements now for the next issue. De- marize the fourth AAAI/ACM SIGAI Job Fair, tails on the submission process are avail- which continues to grow with the increasing able at http://sigai.acm.org/aimatters. popularity of AI. In our interview series, Marion Neumann interviews Tom Dietterich, an Emer- itus Professor at Oregon State University and one of the pioneers in Machine Learning. Amy McGovern is co- In our regular columns, we have a summary editor of AI Matters. She of recent and upcoming AI conferences and is a Professor of com- events from Michael Rovatsos. Our educa- puter science at the Uni- tional column this issue is dedicated to “biduc- versity of Oklahoma and tive computing”, one of Prolog’s most distinc- an adjunct Professor of tive features.
    [Show full text]
  • Turing's Influence on Programming — Book Extract from “The Dawn of Software Engineering: from Turing to Dijkstra”
    Turing's Influence on Programming | Book extract from \The Dawn of Software Engineering: from Turing to Dijkstra" Edgar G. Daylight∗ Eindhoven University of Technology, The Netherlands [email protected] Abstract Turing's involvement with computer building was popularized in the 1970s and later. Most notable are the books by Brian Randell (1973), Andrew Hodges (1983), and Martin Davis (2000). A central question is whether John von Neumann was influenced by Turing's 1936 paper when he helped build the EDVAC machine, even though he never cited Turing's work. This question remains unsettled up till this day. As remarked by Charles Petzold, one standard history barely mentions Turing, while the other, written by a logician, makes Turing a key player. Contrast these observations then with the fact that Turing's 1936 paper was cited and heavily discussed in 1959 among computer programmers. In 1966, the first Turing award was given to a programmer, not a computer builder, as were several subsequent Turing awards. An historical investigation of Turing's influence on computing, presented here, shows that Turing's 1936 notion of universality became increasingly relevant among programmers during the 1950s. The central thesis of this paper states that Turing's in- fluence was felt more in programming after his death than in computer building during the 1940s. 1 Introduction Many people today are led to believe that Turing is the father of the computer, the father of our digital society, as also the following praise for Martin Davis's bestseller The Universal Computer: The Road from Leibniz to Turing1 suggests: At last, a book about the origin of the computer that goes to the heart of the story: the human struggle for logic and truth.
    [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]
  • 2021 ACM Awards Call for Nominations
    Turing Award The A. M. Turing Award is ACM's oldest and most prestigious award. It is presented annually to an individual or a group of individuals who have made lasting contributions of a technical nature to the computing community. The long-term influence of a candidate’s work is taken into consideration, but there should be a singular outstanding and trend-setting technical achievement that constitutes the claim of the award. The award is presented each June at the ACM Awards Banquet and is accompanied by a prize of $1,000,000 plus travel expenses to the banquet. Financial support for the award is provided by Google Inc. ACM Prize in Computing The ACM Prize in Computing recognizes an early to mid-career fundamental and innovative contribution in computing theory or practice that through, its impact, and broad implications, exemplifies the greatest achievements of the discipline. The candidate’s contribution should be relatively recent (typically within the last decade), but enough time should have passed to evaluate impact. While there are no specific requirements as to age or time since last degree requirements, the candidate typically would be approaching mid-career. The Prize carries a prize of $250,000. Financial support for the award is provided by Infosys Ltd. ACM Frances E. Allen Award for Outstanding Mentoring The Frances E. Allen Award for Outstanding Mentoring will be presented for the first time in 2021. This award will recognize individuals who have exemplified excellence and/or innovation in mentoring with particular attention to individuals who have shown outstanding leadership in promoting diversity, equity, and inclusion in computing.
    [Show full text]
  • Noam Hazon – CV
    Noam Hazon – CV Department of Computer Science 23/1 Yehuda Hanasi st. Ariel University Petah Tiqwa, Israel Ariel, Israel (972)-50-5404321 [email protected] https://www.ariel.ac.il/wp/noam-hazon/ Education Ph.D. 2007-2010 Bar Ilan University, Ramat Gan, Israel Department of Computer Science Research area: Artificial Intelligence, Multi Agent Systems Topic: Social Interaction under Uncertainty in Multi Agent Systems Advisors: Prof. Sarit Kraus and Prof. Yonatan Aumann M.Sc. 2004-2005 Bar Ilan University, Ramat Gan, Israel Department of Computer Science Graduated summa cum laude, with excellence Research area: Multi Robot Systems Topic: Robust and Efficient Multi Robot Coverage Thesis grade: 95 Advisor: Prof. Gal A. Kaminka B.Sc. 2001-2003 Bar Ilan University, Ramat Gan, Israel Department of Computer Science Graduated summa cum laude in Computer Science (extended), with excellence Work Experience Technical Senior Lecturer 2018-present Ariel University, Ariel, Israel Department of Computer Science Lecturer 2014-2017 Ariel University, Ariel, Israel Department of Computer Science Postdoctoral Fellow 2013 Bar Ilan University, Ramat Gan, Israel Department of Computer Science Member of the AIM Lab Hosted by: Prof. Sarit Kraus Postdoctoral Fellow 2011-2012 Carnegie Mellon University, Pittsburgh, Pennsylvania Robotics Institute Member of the Advanced Agent-Robotics Technology Lab Hosted by: Prof. Katia Sycara Software Engineer 2003-2006 Applied Materials Inc. Developing and programming infrastructure components for the inspection machine's operating system, using C++ (Windows) Teaching 2008-2010 Teaching Assistant, Bar Ilan University, Israel a. Introduction to Artificial Intelligence b. Computer structure 2006 Lecturer, The Jerusalem College of Technology, Israel Computer structure Honors, Scholarships and Awards 2020 Blue sky idea award (2nd place) at the AAAI-20 senior member presentation track (sponsored by CCC) 2017 Outstanding lecturer, Ariel University 2011 Finalist for Best Paper award, AAMAS-11 2008 Clore Foundation Scholarship for Ph.D.
    [Show full text]
  • Virginia Gold 212-626-0505 [email protected]
    Contact: Virginia Gold 212-626-0505 [email protected] ACM TURING AWARD GOES TO PIONEER WHO ADVANCED RELIABILITY AND CONSISTENCY OF COMPUTING SYSTEMS Microsoft’s Lamport Contributed to Theory and Practice of Building Distributed Computing Systems that Work as Intended NEW YORK, March 18, 2014 – ACM (Association for Computing Machinery) www.acm.org today named Leslie Lamport, a Principal Researcher at Microsoft Research, as the recipient of the 2013 ACM A.M. Turing Award for imposing clear, well-defined coherence on the seemingly chaotic behavior of distributed computing systems, in which several autonomous computers communicate with each other by passing messages. He devised important algorithms and developed formal modeling and verification protocols that improve the quality of real distributed systems. These contributions have resulted in improved correctness, performance, and reliability of computer systems. The ACM Turing Award, widely considered the “Nobel Prize in Computing,” carries a $250,000 prize, with financial support provided by Intel Corporation and Google Inc. ACM President Vint Cerf noted that “as an applied mathematician, Leslie Lamport had an extraordinary sense of how to apply mathematical tools to important practical problems. By finding useful ways to write specifications and prove correctness of realistic algorithms, assuring strong foundation for complex computing operations, he helped to move verification from an academic discipline to practical tool.” Lamport’s practical and widely used algorithms and tools have applications in security, cloud computing, embedded systems and database systems as well as mission-critical computer systems that rely on secure information sharing and interoperability to prevent failure. His notions of safety, where nothing bad happens, and liveness, where something good happens, contribute to the reliability and robustness of software and hardware engineering design.
    [Show full text]
  • Wirth All Poster V2
    COMPUTER DISTINGUISHED LECTURE SERIES SCIENCE by Prof. Niklaus Wirth, January 2015 DISTINGUISHED LECTURE 2015 LECTURE 1 “The Oberon System on a Field-Programmable 20 Gate Array (FPGA)” Tuesday RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU 16:00-17:30 Distinguished Speaker LUNCHEON (Industry) 22 FSC 501, Fong Shu Chuen Library, HSH Campus, HKBU Thursday 12:00-14:00 Enquiry LECTURE 2 (PUBLIC) Tel: (852) 3411-2385 Email: [email protected] “Computers and Computing in 23 the Early Years” Website: http://www.comp.hkbu.edu.hk Friday RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU 16:00-17:30 LECTURE 3 “The HDL Lola and its Translation to Verilog” 27 RRS905, Sir Run Run Shaw Building, HSH Campus, HKBU Tuesday 16:00-17:30 Biography The A.M. Turing Award, sometimes Niklaus Wirth was born in Winterthur, Switzerland, in 1934. He studied referred as the "Nobel Prize" of Computing, was electrical engineering at ETH (Federal Institute of Technology) in Zürich, graduated in named in honor of Alan Mathison Turing 1959, received an M.Sc. degree from Laval University in Quebec, and a Ph.D. from the (1912–1954) who made fundamental advances in computer architecture, algorithms, formalization of University of California at Berkeley in 1963. computing, and articial intelligence. It is the Wirth has been an Assistant Professor of Computer Science at Stanford annual prestigious technical award, given by the University (1963-67) and, after his return to Switzerland, a Professor of Informatics at Association for Computing Machinery, for major ETH from 1968 – 1999. His principal areas of contribution were programming contributions of lasting importance to computing.
    [Show full text]
  • A Debate on Teaching Computing Science
    Teaching Computing Science t the ACM Computer Science Conference last Strategic Defense Initiative. William Scherlis is February, Edsger Dijkstra gave an invited talk known for his articulate advocacy of formal methods called “On the Cruelty of Really Teaching in computer science. M. H. van Emden is known for Computing Science.” He challenged some of his contributions in programming languages and the basic assumptions on which our curricula philosophical insights into science. Jacques Cohen Aare based and provoked a lot of discussion. The edi- is known for his work with programming languages tors of Comwunications received several recommenda- and logic programming and is a member of the Edi- tions to publish his talk in these pages. His comments torial Panel of this magazine. Richard Hamming brought into the foreground some of the background received the Turing Award in 1968 and is well known of controversy that surrounds the issue of what be- for his work in communications and coding theory. longs in the core of a computer science curriculum. Richard M. Karp received the Turing Award in 1985 To give full airing to the controversy, we invited and is known for his contributions in the design of Dijkstra to engage in a debate with selected col- algorithms. Terry Winograd is well known for his leagues, each of whom would contribute a short early work in artificial intelligence and recent work critique of his position, with Dijkstra himself making in the principles of design. a closing statement. He graciously accepted this offer. I am grateful to these people for participating in We invited people from a variety of specialties, this debate and to Professor Dijkstra for creating the backgrounds, and interpretations to provide their opening.
    [Show full text]
  • Alan Mathison Turing and the Turing Award Winners
    Alan Turing and the Turing Award Winners A Short Journey Through the History of Computer TítuloScience do capítulo Luis Lamb, 22 June 2012 Slides by Luis C. Lamb Alan Mathison Turing A.M. Turing, 1951 Turing by Stephen Kettle, 2007 by Slides by Luis C. Lamb Assumptions • I assume knowlege of Computing as a Science. • I shall not talk about computing before Turing: Leibniz, Babbage, Boole, Gödel... • I shall not detail theorems or algorithms. • I shall apologize for omissions at the end of this presentation. • Comprehensive information about Turing can be found at http://www.mathcomp.leeds.ac.uk/turing2012/ • The full version of this talk is available upon request. Slides by Luis C. Lamb Alan Mathison Turing § Born 23 June 1912: 2 Warrington Crescent, Maida Vale, London W9 Google maps Slides by Luis C. Lamb Alan Mathison Turing: short biography • 1922: Attends Hazlehurst Preparatory School • ’26: Sherborne School Dorset • ’31: King’s College Cambridge, Maths (graduates in ‘34). • ’35: Elected to Fellowship of King’s College Cambridge • ’36: Publishes “On Computable Numbers, with an Application to the Entscheindungsproblem”, Journal of the London Math. Soc. • ’38: PhD Princeton (viva on 21 June) : “Systems of Logic Based on Ordinals”, supervised by Alonzo Church. • Letter to Philipp Hall: “I hope Hitler will not have invaded England before I come back.” • ’39 Joins Bletchley Park: designs the “Bombe”. • ’40: First Bombes are fully operational • ’41: Breaks the German Naval Enigma. • ’42-44: Several contibutions to war effort on codebreaking; secure speech devices; computing. • ’45: Automatic Computing Engine (ACE) Computer. Slides by Luis C.
    [Show full text]