DOCSLIB.ORG

COMP 516 Research Methods in Computer Science Research Methods in Computer Science Lecture 3: Who Is Who in Computer Science Research

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
COMP 516 Research Methods in Computer Science Research Methods in Computer Science Lecture 3: Who Is Who in Computer Science Research COMP 516 COMP 516 Research Methods in Computer Science Research Methods in Computer Science Lecture 3: Who is Who in Computer Science Research Dominik Wojtczak Dominik Wojtczak Department of Computer Science University of Liverpool Department of Computer Science University of Liverpool 1 / 24 2 / 24 Prizes and Awards Alan M. Turing (1912-1954) Scientific achievement is often recognised by prizes and awards Conferences often give a best paper award, sometimes also a best “The father of modern computer science” student paper award In 1936 introduced Turing machines, as a thought Example: experiment about limits of mechanical computation ICALP Best Paper Prize (Track A, B, C) (Church-Turing thesis) For the best paper, as judged by the program committee Gives rise to the concept of Turing completeness and Professional organisations also give awards based on varying Turing reducibility criteria In 1939/40, Turing designed an electromechanical machine which Example: helped to break the german Enigma code British Computer Society Roger Needham Award His main contribution was an cryptanalytic machine which used Made annually for a distinguished research contribution in computer logic-based techniques science by a UK based researcher within ten years of their PhD In the 1950 paper ‘Computing machinery and intelligence’ Turing Arguably, the most prestigious award in Computer Science is the introduced an experiment, now called the Turing test A. M. Turing Award 2012 is the Alan Turing year! 3 / 24 4 / 24 Turing Award Turing Award Winners What contribution have the following people made? The A. M. Turing Award is given annually by the Association for Who among them has received the Turing Award? Computing Machinery to an individual selected for contributions of a technical nature made Frances E. Allen X Alan Kay X to the computing community. The contributions should be of lasting Leonard M. Adleman X Donald E. Knuth X and major technical importance to the computer field. Leonard Kleinrock 7 Robin Milner X Timothy J. Berners-Lee 7 John Nash 7 The Association for Computing Machinery (ACM) is a society for Vinton G. Cerf X Lawrence Page 7 computing founded in 1947. It is the largest and most prestigious Edmund Clarke X Alan J. Perlis X scientific and educational computing society, with more than 100,000 Edgar F. Codd X Amir Pnueli X members world-wide. Stephen A. Cook X Dennis M. Ritchie X Edsger W. Dijkstra X Ronald R. Rivest X Lawrence J. Ellison 7 Adi Shamir X Douglas Engelbart X Richard M. Stallman 7 Paul Erdos¨ 7 Ken Thompson X William H. Gates III 7 Leslie Valiant X James A. Gosling 7 Moshe Vardi 7 Stephen Hawking 7 5 / 24 X 6 / 24 The Ones Who Haven’t Made It (Yet) The Ones Who Haven’t Made It (Yet) Leonard Kleinrock One of the three inventors of packet-switched networks, along Lawrence Page with Paul Baran and Donald Davies in the early 1960’s Co-founder, together with Sergey Brin, of Google; developed the Timothy J. Berners-Lee PageRank algorithm in 1998 on which Google is based Together with Robert Cailliau invented the World Wide Web in Richard M. Stallman 1989 Software freedom activist, hacker, software developer; lauched Lawrence J. Ellison the GNU Project in 1983 Co-founder and CEO of the database software company Oracle Paul Erdos¨ William H. Gates III Hungarian mathematician, co-author of around 1525 articles Co-founder, together with Paul Allen, of Microsoft; held the together with 511 different collaborators. Worked on positions of CEO, chief software architect, and chairman combinatorics, graph theory, approximation theory, and James A. Gosling probability theory. Invented Java language in 1994; devised original design of Java John Nash and implemented its original compiler and virtual machine Nobel prize winner in economics, Nash equilibrium is a key Moshe Vardi concept in game theory. Algorithmic game theory is a very active Author of more than 400 papers in the field of logic in computer area of research in computer science. science and automatic program verification. 7 / 24 8 / 24 Alan J. Perlis Andrew Yao Andrew Chi-Chih Yao First recipient of the Turing award in 1966 For his influence in the area of advanced programming techniques and compiler Received the Turing award in 2000. construction. In recognition of his fundamental contributions One of the developers of the ALGOL programming language to the theory of computation, including the complexity-based theory of pseudorandom number generation, cryptography, and communication complexity. Yao’s principle: to establish a lower bound on the performance of randomized algorithms, it suffices to find an appropriate distribution of difficult inputs, and to prove that no deterministic algorithm can perform well against that distribution. 9 / 24 10 / 24 Frances E. Allen Vinton G. Cerf, Robert E. Kahn Received the Turing award in 2006 “For pioneering contributions to the theory and practice of optimizing compiler techniques that laid the foundation for modern optimizing compilers and automatic parallel execution.” Received the Turing award in 2004 First woman to receive the award ”For pioneering work on internetworking, including the design Her 1966 paper on ‘Program Optimization’ and a 1971 paper with John and implementation of the Internet’s basic communications Cocke provide the conceptual basis for the systematic analysis and protocols, TCP/IP, and for inspired leadership in networking.” transformation of computer programs Basis for modern machine- and language-independent program optimizers Led the design and implementation of the Transmission Control Protocol and Internet Protocol (TCP/IP) Lead an IBM project which developed the concept of program dependence graph, the primary structuring method used by most parallelizing compilers Basis for current internetworking 11 / 24 12 / 24 Alan Kay Leonard M. Adleman, Ronald R. Rivest, Adi Shamir Received the Turing award in 2003 ”For pioneering many of the ideas at the root of contemporary object-oriented programming languages, leading the team that developed Smalltalk, and for fundamental contributions to personal computing.” Received the Turing award in 2002 ”For their ingenious contribution for making public-key Development started in 1969, publicly available since 1980 cryptography useful in practice.” First complete dynamic object-oriented programming Created most widely used public-key cryptography system, RSA, in Influenced the design ofC ++ and Java 1977 Included a complete visual programming environment Clifford Cocks described an equivalent system in an internal GCHQ Envisaged to be part of a ‘user-centered’ approach to computing document in 1973, but it was never deployed and kept secret until 1997 13 / 24 14 / 24 Douglas Engelbart Amir Pnueli Received the Turing award in 1996 ”For seminal work introducing temporal logic into computing science and for outstanding Received the Turing award in 1997 contributions to program and system ”For an inspiring vision of the future of interactive verification.” computing and the invention of key technologies to help realize this vision.” Major breakthrough in the verification and certification of concurrent and reactive systems Vision of computer networked working environment Landmark 1977 paper ‘The Temporal Logic of Programs’ Instrumental in personal computer revolution. Invented: in Proc. 18th IEEE Symp. Found. of Comp. Sci., 1977, pp. 46–57. Computer mouse Focus: ongoing behaviour of programs (cf. input/output behaviour) Multiple on screen windows Linked hypermedia Easily specify qualitative progress properties of concurrent programs Shared screen teleconferencing and computer aided meetings Careful logic design enables automated verification of concurrent Online publishing programs Presented in 1968 as part of the ‘mother of all demos’ 15 / 24 16 / 24 Robin Milner Dennis M. Ritchie, Ken Thompson Received the Turing award in 1991 For three distinct and complete achievements: Received the Turing award in 1983 1 LCF, the mechanization of Scott’s Logic of For their development of generic operating Computable Functions, probably the first systems theory and specifically for the theoretically based yet practical tool for machine implementation of the Unix operating system. assisted proof construction; 2 ML, the first language to include polymorphic type Development of UNIX began in 1969 inference together with a type-safe exception-handling mechanism; Seminal paper from 1973 on ‘The UNIX Time-Sharing System’ at 3 CCS, a general theory of concurrency. the Fourth ACM Symposium on Operating Systems Principles In addition, he formulated and strongly advanced UNIX: first commercially important portable operating system full abstraction, the study of the relationship between operational and denotational semantics. Usable (almost without change) across a wide range of hardware from smartphones to supercomputers 17 / 24 18 / 24 Stephen A. Cook Edmund Clarke, Allen E. Emerson, Joseph Sifakis Received the Turing award in 1982 For his advancement of our understanding of the complexity of computation in a significant and profound way. Received the Turing award in 2007 For their role in developing Model-Checking into a highly Seminal paper ‘The Complexity of Theorem Proving Procedures’ at effective verification technology that is widely adopted in the 1971 ACM SIGACT Symposium on the Theory of Computing hardware and software industries. Laid the foundations for the theory of NP-completeness computation tree logic P 6= NP is still one of the most fundamental open problems symbolic model checking Starting
Load more

Recommended publications
  • Obituary: Amir Pnueli, 1941–2009 Krzysztof R. Apt and Lenore D. Zuck
    Obituary: Amir Pnueli, 1941–2009 Krzysztof R. Apt and Lenore D. Zuck Amir Pnueli was born in Nahalal, Israel, on April 22, 1941 and passed away in New York City on November 2, 2009 as a result of a brain hemorrhage. Amir founded the computer science department in Tel-Aviv University in 1973. In 1981 he joined the department of mathematical sciences at the Weiz- mann Institute of Science, where he spent most of his career and where he held the Estrin family chair. In recent years, Amir was a faculty member at New York University where he was a NYU Silver Professor. Throughout his career, in spite of an impressive list of achievements, Amir remained an extremely modest and selfless researcher. His unique combination of excellence and integrity has set the tone in the large community of researchers working on specification and verification of programs and systems, program semantics and automata theory. Amir was devoid of any arrogance and those who knew him as a young promising researcher were struck how he maintained his modesty throughout his career. Amir has been an active and extremely hard working researcher till the last moment. His sudden death left those who knew him in a state of shock and disbelief. For his achievements Amir received the 1996 ACM Turing Award. The citation reads: “For seminal work introducing temporal logic into computing science and for outstanding contributions to program and system verification.” Amir also received, for his contributions, the 2000 Israel Award in the area of exact sciences. More recently, in 2007, he shared the ACM Software System Award.
    [Show full text]
  • Pdf, 184.84 KB
    Nir Piterman, Associate Professor Coordinates Email: fi[email protected] Homepage: www.cs.le.ac.uk/people/np183 Phone: +44-XX-XXXX-XXXX Research Interests My research area is formal verification. I am especially interested in algorithms for model checking and design synthesis. A major part of my work is on the automata-theoretic approach to verification and especially to model checking. I am also working on applications of formal methods to biological modeling. Qualifications Oct. 2000 { Mar. 2005 Ph.D. in the Department of Computer Science and Applied Mathe- matics at the Weizmann Institute of Science, Rehovot, Israel. • Research Area: Formal Verification. • Thesis: Verification of Infinite-State Systems. • Supervisor: Prof. Amir Pnueli. Oct. 1998 { Oct. 2000 M.Sc. in the Department of Computer Science and Applied Mathe- matics at the Weizmann Institute of Science, Rehovot, Israel. • Research Area: Formal Verification. • Thesis: Extending Temporal Logic with !-Automata. • Supervisor: Prof. Amir Pnueli and Prof. Moshe Vardi. Oct. 1994 { June 1997 B.Sc. in Mathematics and Computer Science in the Hebrew Univer- sity, Jerusalem, Israel. Academic Employment Mar. 2019 { Present Senior Lecturer/Associate Professor in the Department of Com- puter Science and Engineering in University of Gothenburg. Oct. 2012 { Feb. 2019 Reader/Associate Professor in the Department of Informatics in University of Leicester. Oct. 2010 { Sep. 2012 Lecturer in the Department of Computer Science in University of Leicester. Aug. 2007 { Sep. 2010 Research Associate in the Department of Computing in Imperial College London. Host: Dr. Michael Huth Oct. 2004 { July 2007 PostDoc in the school of Computer and Communication Sciences at the Ecole Polytechnique F´ed´eralede Lausanne.
    [Show full text]
  • Efficient Algorithms with Asymmetric Read and Write Costs
    Efficient Algorithms with Asymmetric Read and Write Costs Guy E. Blelloch1, Jeremy T. Fineman2, Phillip B. Gibbons1, Yan Gu1, and Julian Shun3 1 Carnegie Mellon University 2 Georgetown University 3 University of California, Berkeley Abstract In several emerging technologies for computer memory (main memory), the cost of reading is significantly cheaper than the cost of writing. Such asymmetry in memory costs poses a fun- damentally different model from the RAM for algorithm design. In this paper we study lower and upper bounds for various problems under such asymmetric read and write costs. We con- sider both the case in which all but O(1) memory has asymmetric cost, and the case of a small cache of symmetric memory. We model both cases using the (M, ω)-ARAM, in which there is a small (symmetric) memory of size M and a large unbounded (asymmetric) memory, both random access, and where reading from the large memory has unit cost, but writing has cost ω 1. For FFT and sorting networks we show a lower bound cost of Ω(ωn logωM n), which indicates that it is not possible to achieve asymptotic improvements with cheaper reads when ω is bounded by a polynomial in M. Moreover, there is an asymptotic gap (of min(ω, log n)/ log(ωM)) between the cost of sorting networks and comparison sorting in the model. This contrasts with the RAM, and most other models, in which the asymptotic costs are the same. We also show a lower bound for computations on an n × n diamond DAG of Ω(ωn2/M) cost, which indicates no asymptotic improvement is achievable with fast reads.
    [Show full text]
  • Butler Lampson, Martin Abadi, Michael Burrows, Edward Wobber
    Outline • Chapter 19: Security (cont) • A Method for Obtaining Digital Signatures and Public-Key Cryptosystems Ronald L. Rivest, Adi Shamir, and Leonard M. Adleman. Communications of the ACM 21,2 (Feb. 1978) – RSA Algorithm – First practical public key crypto system • Authentication in Distributed Systems: Theory and Practice, Butler Lampson, Martin Abadi, Michael Burrows, Edward Wobber – Butler Lampson (MSR) - He was one of the designers of the SDS 940 time-sharing system, the Alto personal distributed computing system, the Xerox 9700 laser printer, two-phase commit protocols, the Autonet LAN, and several programming languages – Martin Abadi (Bell Labs) – Michael Burrows, Edward Wobber (DEC/Compaq/HP SRC) Oct-21-03 CSE 542: Operating Systems 1 Encryption • Properties of good encryption technique: – Relatively simple for authorized users to encrypt and decrypt data. – Encryption scheme depends not on the secrecy of the algorithm but on a parameter of the algorithm called the encryption key. – Extremely difficult for an intruder to determine the encryption key. Oct-21-03 CSE 542: Operating Systems 2 Strength • Strength of crypto system depends on the strengths of the keys • Computers get faster – keys have to become harder to keep up • If it takes more effort to break a code than is worth, it is okay – Transferring money from my bank to my credit card and Citibank transferring billions of dollars with another bank should not have the same key strength Oct-21-03 CSE 542: Operating Systems 3 Encryption methods • Symmetric cryptography – Sender and receiver know the secret key (apriori ) • Fast encryption, but key exchange should happen outside the system • Asymmetric cryptography – Each person maintains two keys, public and private • M ≡ PrivateKey(PublicKey(M)) • M ≡ PublicKey (PrivateKey(M)) – Public part is available to anyone, private part is only known to the sender – E.g.
    [Show full text]
  • QATAR ASW ONLINE SCRIPT V.8.0 Pages
    “DEXIGN THE FUTURE: Innovation for Exponential Times” ARNOLD WASSERMAN COMMENCEMENT ADDRESS VIRGINIA COMMONWEALTH UNIVERSITY IN QATAR 2 MAY 2016 مساء الخير .Good afternoon It is an honor to be invited to address you on this important day. Today you artists and designers graduate into the future. Do you think about the future? Of course you do. But how do you think about the future? Is the future tangible - or is it intangible ? Is it a subject for rational deliberation? Or is it an imagined fantasy that forever recedes before us? Is the future simply whatever happens to us next? Or is it something we deliberately create? Can we Dexign the Future? What I would like us to think about for the next few moments is how creative professionals like yourselves might think about the future. What I have to say applies as much to art as it does to design. Both are technologies of creative innovation. I will take the liberty here of calling it all design. My speech is also available online. There you can follow a number of links to what I will talk about here. The future you are graduating into is an exponential future. What that means is that everything is happening faster and at an accelerating rate. For example, human knowledge is doubling every 12 months. And that curve is accelerating. An IBM researcher foresees that within a few years knowledge will be doubling every 12 hours as we build out the internet of things globally. This acceleration of human knowledge implies that the primary skill of a knowledge worker like yourself is research, analysis and synthesis of the not-yet-known.
    [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]
  • Computational Learning Theory: New Models and Algorithms
    Computational Learning Theory: New Models and Algorithms by Robert Hal Sloan S.M. EECS, Massachusetts Institute of Technology (1986) B.S. Mathematics, Yale University (1983) Submitted to the Department- of Electrical Engineering and Computer Science in partial fulfillment of the requirements for the degree of Doctor of Philosophy at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 1989 @ Robert Hal Sloan, 1989. All rights reserved The author hereby grants to MIT permission to reproduce and to distribute copies of this thesis document in whole or in part. Signature of Author Department of Electrical Engineering and Computer Science May 23, 1989 Certified by Ronald L. Rivest Professor of Computer Science Thesis Supervisor Accepted by Arthur C. Smith Chairman, Departmental Committee on Graduate Students Abstract In the past several years, there has been a surge of interest in computational learning theory-the formal (as opposed to empirical) study of learning algorithms. One major cause for this interest was the model of probably approximately correct learning, or pac learning, introduced by Valiant in 1984. This thesis begins by presenting a new learning algorithm for a particular problem within that model: learning submodules of the free Z-module Zk. We prove that this algorithm achieves probable approximate correctness, and indeed, that it is within a log log factor of optimal in a related, but more stringent model of learning, on-line mistake bounded learning. We then proceed to examine the influence of noisy data on pac learning algorithms in general. Previously it has been shown that it is possible to tolerate large amounts of random classification noise, but only a very small amount of a very malicious sort of noise.
    [Show full text]
  • 2008 Annual Report
    2008 Annual Report NATIONAL ACADEMY OF ENGINEERING ENGINEERING THE FUTURE 1 Letter from the President 3 In Service to the Nation 3 Mission Statement 4 Program Reports 4 Engineering Education 4 Center for the Advancement of Scholarship on Engineering Education 6 Technological Literacy 6 Public Understanding of Engineering Developing Effective Messages Media Relations Public Relations Grand Challenges for Engineering 8 Center for Engineering, Ethics, and Society 9 Diversity in the Engineering Workforce Engineer Girl! Website Engineer Your Life Project Engineering Equity Extension Service 10 Frontiers of Engineering Armstrong Endowment for Young Engineers-Gilbreth Lectures 12 Engineering and Health Care 14 Technology and Peace Building 14 Technology for a Quieter America 15 America’s Energy Future 16 Terrorism and the Electric Power-Delivery System 16 U.S.-China Cooperation on Electricity from Renewables 17 U.S.-China Symposium on Science and Technology Strategic Policy 17 Offshoring of Engineering 18 Gathering Storm Still Frames the Policy Debate 20 2008 NAE Awards Recipients 22 2008 New Members and Foreign Associates 24 2008 NAE Anniversary Members 28 2008 Private Contributions 28 Einstein Society 28 Heritage Society 29 Golden Bridge Society 29 Catalyst Society 30 Rosette Society 30 Challenge Society 30 Charter Society 31 Other Individual Donors 34 The Presidents’ Circle 34 Corporations, Foundations, and Other Organizations 35 National Academy of Engineering Fund Financial Report 37 Report of Independent Certified Public Accountants 41 Notes to Financial Statements 53 Officers 53 Councillors 54 Staff 54 NAE Publications Letter from the President Engineering is critical to meeting the fundamental challenges facing the U.S. economy in the 21st century.
    [Show full text]
  • 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.
    [Show full text]
  • Simula Mother Tongue for a Generation of Nordic Programmers
    Simula! Mother Tongue! for a Generation of! Nordic Programmers! Yngve Sundblad HCI, CSC, KTH! ! KTH - CSC (School of Computer Science and Communication) Yngve Sundblad – Simula OctoberYngve 2010Sundblad! Inspired by Ole-Johan Dahl, 1931-2002, and Kristen Nygaard, 1926-2002" “From the cold waters of Norway comes Object-Oriented Programming” " (first line in Bertrand Meyer#s widely used text book Object Oriented Software Construction) ! ! KTH - CSC (School of Computer Science and Communication) Yngve Sundblad – Simula OctoberYngve 2010Sundblad! Simula concepts 1967" •# Class of similar Objects (in Simula declaration of CLASS with data and actions)! •# Objects created as Instances of a Class (in Simula NEW object of class)! •# Data attributes of a class (in Simula type declared as parameters or internal)! •# Method attributes are patterns of action (PROCEDURE)! •# Message passing, calls of methods (in Simula dot-notation)! •# Subclasses that inherit from superclasses! •# Polymorphism with several subclasses to a superclass! •# Co-routines (in Simula Detach – Resume)! •# Encapsulation of data supporting abstractions! ! KTH - CSC (School of Computer Science and Communication) Yngve Sundblad – Simula OctoberYngve 2010Sundblad! Simula example BEGIN! REF(taxi) t;" CLASS taxi(n); INTEGER n;! BEGIN ! INTEGER pax;" PROCEDURE book;" IF pax<n THEN pax:=pax+1;! pax:=n;" END of taxi;! t:-NEW taxi(5);" t.book; t.book;" print(t.pax)" END! Output: 7 ! ! KTH - CSC (School of Computer Science and Communication) Yngve Sundblad – Simula OctoberYngve 2010Sundblad!
    [Show full text]
  • 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
    [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 [email protected] 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]