Co-Authorship Proximity of A. M. Turing Award and John Von Neumann Medal Winners to the Disciplinary Boundaries of Computer Science
Total Page:16
File Type:pdf, Size:1020Kb

Load more
Recommended publications
-
The Power of Abstraction
The Power of Abstraction Barbara Liskov March 2013 MIT CSAIL Software is Complex Systems are big and they do complicated things and they may be distributed and/or concurrent Addressing Complexity Algorithms, data structures, protocols Addressing Complexity Algorithms, data structures, protocols Programming methodology Programming languages This Talk Programming methodology as it developed Programming languages Programming languages today The Situation in 1970 The software crisis! Programming Methodology How should programs be designed? How should programs be structured? The Landscape E. W. Dijkstra. Go To Statement Considered Harmful. Cacm, Mar. 1968 The Landscape N. Wirth. Program Development by Stepwise Refinement. Cacm, April 1971 The Landscape D. L. Parnas. Information Distribution Aspects of Design Methodology. IFIP Congress, 1971 “The connections between modules are the assumptions which the modules make about each other.” Modularity A program is a collection of modules Modularity A program is a collection of modules Each module has an interface, described by a specification Modularity A program is a collection of modules Each has an interface, described by a specification A module’s implementation is correct if it meets the specification A using module depends only on the specification Modularity A program is a collection of modules Each has an interface, described by a specification A module’s implementation is correct if it meets the specification A using module depends only on the specification E.g. a sort routine sort(a) Benefits of Modularity Local reasoning Modifiability Independent development The Situation in 1970 Procedures were the only type of module Not powerful enough, e.g., a file system Not used very much Complicated connections Partitions B. -
Available in PDF Format
Defining Business Rules ~ What Are They Really? the Business Rules Group formerly, known as the GUIDE Business Rules Project Final Report revision 1.3 July, 2000 Prepared by: Project Manager: David Hay Allan Kolber Group R, Inc. Butler Technology Solutions, Inc. Keri Anderson Healy Model Systems Consultants, Inc. Example by: John Hall Model Systems, Ltd. Project team: Charles Bachman David McBride Bachman Information Systems, Inc. Viasoft Joseph Breal Richard McKee IBM The Travelers Brian Carroll Terry Moriarty Intersolv Spectrum Technologies Group, Inc. E.F. Codd Linda Nadeau E.F. Codd & Associates A.D. Experts Michael Eulenberg Bonnie O’Neil Owl Mountain MIACO Corporation James Funk Stephanie Quarles S.C. Johnson & Son, Inc. Galaxy Technology Corporation J. Carlos Goti Jerry Rosenbaum IBM USF&G Gavin Gray Stuart Rosenthal Coldwell Banker Dyna Systems John Hall Ronald Ross Model Systems, Ltd. Ronald G. Ross Associates Terry Halpin Warren Selkow Asymetrix Corporation CGI/IBM David Hay Dan Tasker Group R, Inc. Dan Tasker John Healy Barbara von Halle The Automated Reasoning Corporation Spectrum Technologies Group, Inc. Keri Anderson Healy John Zachman Model Systems Consultants, Inc. Zachman International, Inc. Allan Kolber Dick Zakrzewski Butler Technology Solutions, Inc. Northwestern Mutual Life - ii - GUIDE Business Rules Project Final Report Table of Contents 1. Introduction 1 Project Scope And Objectives 1 Overview Of The Paper 2 The Rationale 2 A Context for Business Rules 4 Definition Of A Business Rule 4 Categories of Business Rule 6 2. Formalizing Business Rules 7 The Business Rules Conceptual Model 8 3. Formulating Business Rules 9 The Origins Of Business Rules — The Model 10 Types of Business Rule 13 Definitions 14 4. -
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. -
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. -
MIT Turing Laureates Propose Creation of School of Computing an Open Letter to President Rafael Reif
9/26/2017 The Tech OPINION LETTER TO THE EDITOR MIT Turing laureates propose creation of School of Computing An open letter to President Rafael Reif By MIT Turing Laureates | Sep. 20, 2017 Facebook Dear Rafael, Twitter There comes a time, in the course of scientic evolution, when a discipline is ready to emerge from the womb of its parent disciplines and take its own place in the world. For Reddit computer science, or more accurately, for the eld of computing, this moment is now. Print Born from a combination of mathematics and electrical engineering, with the original intent of speeding up calculations, computer science has grown to encompass all information processing and most communications and now to provide an alternative evolutionary path to intelligence. Computer science is rapidly becoming an essential part of most academic disciplines, and students are voting with their feet. One third of MIT undergraduates are majoring in computer science. This trend is unlikely to slow down anytime soon. We, the 7 active MIT Turing Award winners, therefore write this open letter to recommend that you consider the bold step of establishing a School of Computing at MIT. The new school, a brother to the Schools of Engineering and Science, will allow the eld of computing, with its many https://thetech.com/2017/09/20/turing-laureates-open-letter-to-reif 1/4 9/26/2017 The Tech facets and sub-elds, to grow and interact naturally with the Institute’s scientic and engineering environment. The Tech Submit Campus Life Stories Today the study of computation is housed primarily in the EECS department within the School of Engineering, but departments are limited in their ability to hire and grow. -
Edsger Dijkstra: the Man Who Carried Computer Science on His Shoulders
INFERENCE / Vol. 5, No. 3 Edsger Dijkstra The Man Who Carried Computer Science on His Shoulders Krzysztof Apt s it turned out, the train I had taken from dsger dijkstra was born in Rotterdam in 1930. Nijmegen to Eindhoven arrived late. To make He described his father, at one time the president matters worse, I was then unable to find the right of the Dutch Chemical Society, as “an excellent Aoffice in the university building. When I eventually arrived Echemist,” and his mother as “a brilliant mathematician for my appointment, I was more than half an hour behind who had no job.”1 In 1948, Dijkstra achieved remarkable schedule. The professor completely ignored my profuse results when he completed secondary school at the famous apologies and proceeded to take a full hour for the meet- Erasmiaans Gymnasium in Rotterdam. His school diploma ing. It was the first time I met Edsger Wybe Dijkstra. shows that he earned the highest possible grade in no less At the time of our meeting in 1975, Dijkstra was 45 than six out of thirteen subjects. He then enrolled at the years old. The most prestigious award in computer sci- University of Leiden to study physics. ence, the ACM Turing Award, had been conferred on In September 1951, Dijkstra’s father suggested he attend him three years earlier. Almost twenty years his junior, I a three-week course on programming in Cambridge. It knew very little about the field—I had only learned what turned out to be an idea with far-reaching consequences. a flowchart was a couple of weeks earlier. -
Reinventing Education Based on Data and What Works • Since 1955
Reinventing Education Based on Data and What Works • Since 1955 Carnegie Mellon is reinventing education and the way we think about leveraging technology through its study of the science of learning – an interdisciplinary effort that we’ve been tackling for more than 50 years with both computer scientists and psychologists. CMU's educational technology innovations have inspired numerous startup companies, which are helping students to learn more effectively and efficiently. 1955: Allen Newell (TPR ’57) joins 1995: Prof. Kenneth R. Koedinger (HSS Prof. Herbert Simon’s research team as ’88,’90) and Anderson develop Practical a Ph.D. student. Algebra Tutor. The program pioneers a new form of computer-aided instruction for high 1956: CMU creates one of the world’s first school students based on cognitive tutors. university computation centers. With Prof. Alan Perlis (MCS ’42) as its head, it is a joint 1995: Prof. Jack Mostow (SCS ’81) undertaking of faculty from the business, develops Project LISTEN, an intelligent tutor Simon, Newell psychology, electrical engineering and that helps children learn to read. The National mathematics departments, and the Science Foundation included Project precursor to computer science. LISTEN’s speech recognition system as one of its top 50 innovations from 1950-2000. 1956: Simon creates a “thinking machine”—enacting a mental process 1995: The Center for Automated by breaking it down into its simplest Learning and Discovery is formed, led steps. Later that year, the term “artificial by Prof. Thomas M. Mitchell. intelligence” is coined by a small group Perlis including Newell and Simon. 1998: Spinoff company Carnegie Learning is founded by CMU scientists to expand 1956: Simon, Newell and J. -
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. -
Towards a Secure Agent Society
Towards A Secure Agent So ciety Qi He Katia Sycara The Rob otics Institute The Rob otics Institute Carnegie Mellon University Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. Pittsburgh, PA 15213, U.S.A [email protected] [email protected] March 23, 1998 Abstract We present a general view of what a \secure agent so ciety" should b e and howtode- velop it rather than fo cus on any sp eci c details or particular agent-based application . We b elieve that the main e ort to achieve security in agent so cieties consists of the following three asp ects:1 agent authentication mechanisms that form the secure so ciety's foundation, 2 a security architecture design within an agent that enables security p olicy making, se- curity proto col generation and security op eration execution, and 3 the extension of agent communication languages for agent secure communication and trust management. In this pap er, all of the three main asp ects are systematically discussed for agent security based on an overall understanding of mo dern cryptographic technology. One purp ose of the pap er is to give some answers to those questions resulting from absence of a complete picture. Area: Software Agents Keywords: security, agent architecture, agent-based public key infrastructure PKI, public key cryptosystem PKCS, con dentiality, authentication, integrity, nonrepudiation. 1 1 Intro duction If you are going to design and develop a software agent-based real application system for elec- tronic commerce, you would immediately learn that there exists no such secure communication between agents, which is assumed by most agent mo del designers. -
Charles Bachman
Charles Bachman Born December 11, 1924, Manhattan, Kan.; Proposer of a network approach to storing data as in the Integrated Data Store (IDS) and developer of the OSI Reference Model. Education: BS, mechanical engineering, Michigan State University, 1948; MS, mechanical engineering, University of Pennsylvania, 1950. Professional Experience: Dow Chemical Corporation, 1950-1960; General Electric Company, 1960-1970; Honeywell Information Systems, 1970-1981; Cullinet, 1981- 1983; founder and chairman, BACHMAN Information Systems, 1983-present. Honors and Awards: ACM Turing Award, 1973; distinguished fellow, British Computer Society, 1978. Bachman began his service to the computer industry in 1958 by chairing the SHARE Data processing Committee that developed the IBM 709 Data Processing Package (9PAC), and which preceded the development of the programming language Cobol. He continued this development work through the American National Standards Institute SPARC Study Group on Data Base Management Systems (ANSI/ SPARC/DBMS) that created the layer architecture and conceptual schema for database systems. This work led to the development of the international “Reference Model for Open Systems Integration,” which included the basic idea of a seven- layer architecture, the basis of the OSI networking standard. Bachman received the 1973 ACM Turing Award for his development of the Integrated Data Store, which lifted database work from the status of a specialty to first-class citizenship in computing. IDS provided an elegant logical framework for organizing large on-line collections of variously interrelated data. The system had pragmatic significance also in taking into account advice on expected usage patterns, to improve physical data layouts. The facilities of IDS were fully integrated into the Cobol language and so became available for full-scale practical use. -
CRN What It Was Doing and Why It Was Cognitive Systems Vision Doing It, and to Recover from Mental Continued on Page 8 Expanding the Pipeline
COMPUTING RESEARCH NEWS Computing Research Association, Celebrating 30 Years of Service to the Computing Research Community November 2002 Vol. 14/No. 5 DARPA’s New Cognitive Systems Vision By Ron Brachman and IPTO’s goal is to create a new to cope with systems both keep Zachary Lemnios generation of cognitive systems. growing. In order to make our systems more reliable, more secure, The impact of the Defense Mired in Moore’s Law? and more understandable, and to Advanced Research Projects Agency One benefit of such cognitive continue making substantial contri- (DARPA) on computing over the systems would be their help in butions to society, we need to do past 40 years has been profound. Led extracting us from a corner into something dramatically different. by the visionary J.C.R. Licklider and which our success seems to have his innovative successors in the painted us. The research that has The Promise of Cognitive Information Processing Techniques helped the industry follow Moore’s Systems Office (IPTO), DARPA initiated “Law” has created processors that are IPTO is attacking this problem by work that ultimately put personal remarkably fast and small, and data driving a fundamental change in computers on millions of desktops storage capabilities that are vast and computing systems. By giving systems Ron Brachman and made the global Internet a cheap. Unfortunately, these incred- more cognitive capabilities, we reality. In fact, the original IPTO, ible developments have cut two ways. believe we can make them more which lasted from 1962 to 1985, was While today’s computers are more responsible for their own behavior in large part responsible for estab- powerful than ever, we have been and maintenance. -
1. Course Information Are Handed Out
6.826—Principles of Computer Systems 2006 6.826—Principles of Computer Systems 2006 course secretary's desk. They normally cover the material discussed in class during the week they 1. Course Information are handed out. Delayed submission of the solutions will be penalized, and no solutions will be accepted after Thursday 5:00PM. Students in the class will be asked to help grade the problem sets. Each week a team of students Staff will work with the TA to grade the week’s problems. This takes about 3-4 hours. Each student will probably only have to do it once during the term. Faculty We will try to return the graded problem sets, with solutions, within a week after their due date. Butler Lampson 32-G924 425-703-5925 [email protected] Policy on collaboration Daniel Jackson 32-G704 8-8471 [email protected] We encourage discussion of the issues in the lectures, readings, and problem sets. However, if Teaching Assistant you collaborate on problem sets, you must tell us who your collaborators are. And in any case, you must write up all solutions on your own. David Shin [email protected] Project Course Secretary During the last half of the course there is a project in which students will work in groups of three Maria Rebelo 32-G715 3-5895 [email protected] or so to apply the methods of the course to their own research projects. Each group will pick a Office Hours real system, preferably one that some member of the group is actually working on but possibly one from a published paper or from someone else’s research, and write: Messrs.