Monographs in Computer Science
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Early Stored Program Computers
Stored Program Computers Thomas J. Bergin Computing History Museum American University 7/9/2012 1 Early Thoughts about Stored Programming • January 1944 Moore School team thinks of better ways to do things; leverages delay line memories from War research • September 1944 John von Neumann visits project – Goldstine’s meeting at Aberdeen Train Station • October 1944 Army extends the ENIAC contract research on EDVAC stored-program concept • Spring 1945 ENIAC working well • June 1945 First Draft of a Report on the EDVAC 7/9/2012 2 First Draft Report (June 1945) • John von Neumann prepares (?) a report on the EDVAC which identifies how the machine could be programmed (unfinished very rough draft) – academic: publish for the good of science – engineers: patents, patents, patents • von Neumann never repudiates the myth that he wrote it; most members of the ENIAC team contribute ideas; Goldstine note about “bashing” summer7/9/2012 letters together 3 • 1.0 Definitions – The considerations which follow deal with the structure of a very high speed automatic digital computing system, and in particular with its logical control…. – The instructions which govern this operation must be given to the device in absolutely exhaustive detail. They include all numerical information which is required to solve the problem…. – Once these instructions are given to the device, it must be be able to carry them out completely and without any need for further intelligent human intervention…. • 2.0 Main Subdivision of the System – First: since the device is a computor, it will have to perform the elementary operations of arithmetics…. – Second: the logical control of the device is the proper sequencing of its operations (by…a control organ. -
Optimizing the Block Cipher Resource Overhead at the Link Layer Security Framework in the Wireless Sensor Networks
Proceedings of the World Congress on Engineering 2008 Vol I WCE 2008, July 2 - 4, 2008, London, U.K. Optimizing the Block Cipher Resource Overhead at the Link Layer Security Framework in the Wireless Sensor Networks Devesh C. Jinwala, Dhiren R. Patel and Kankar S. Dasgupta, data collected from different sensor nodes. Since the Abstract—The security requirements in Wireless Sensor processing of the data is done on-the-fly, while being Networks (WSNs) and the mechanisms to support the transmitted to the base station; the overall communication requirements, demand a critical examination. Therefore, the costs are reduced [2]. Due to the multi-hop communication security protocols employed in WSNs should be so designed, as and the in-network processing demanding applications, the to yield the optimum performance. The efficiency of the block cipher is, one of the important factors in leveraging the conventional end-to-end security mechanisms are not performance of any security protocol. feasible for the WSN [3]. Hence, the use of the standard In this paper, therefore, we focus on the issue of optimizing end-to-end security protocols like SSH, SSL [4] or IPSec [5] the security vs. performance tradeoff in the security protocols in WSN environment is rejected. Instead, appropriate link in WSNs. As part of the exercise, we evaluate the storage layer security architecture, with low associated overhead is requirements of the block ciphers viz. the Advanced Encryption required. Standard (AES) cipher Rijndael, the Corrected Block Tiny Encryption Algorithm (XXTEA) using the Output Codebook There are a number of research attempts that aim to do so. -
The Advent of Recursion & Logic in Computer Science
The Advent of Recursion & Logic in Computer Science MSc Thesis (Afstudeerscriptie) written by Karel Van Oudheusden –alias Edgar G. Daylight (born October 21st, 1977 in Antwerpen, Belgium) under the supervision of Dr Gerard Alberts, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: November 17, 2009 Dr Gerard Alberts Prof Dr Krzysztof Apt Prof Dr Dick de Jongh Prof Dr Benedikt Löwe Dr Elizabeth de Mol Dr Leen Torenvliet 1 “We are reaching the stage of development where each new gener- ation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon.” J.A.N. Lee in 1996 [73, p.54] “To many of our colleagues, history is only the study of an irrele- vant past, with no redeeming modern value –a subject without useful scholarship.” J.A.N. Lee [73, p.55] “[E]ven when we can't know the answers, it is important to see the questions. They too form part of our understanding. If you cannot answer them now, you can alert future historians to them.” M.S. Mahoney [76, p.832] “Only do what only you can do.” E.W. Dijkstra [103, p.9] 2 Abstract The history of computer science can be viewed from a number of disciplinary perspectives, ranging from electrical engineering to linguistics. As stressed by the historian Michael Mahoney, different `communities of computing' had their own views towards what could be accomplished with a programmable comput- ing machine. -
Software Tools: a Building Block Approach
SOFTWARE TOOLS: A BUILDING BLOCK APPROACH NBS Special Publication 500-14 U.S. DEPARTMENT OF COMMERCE National Bureau of Standards ] NATIONAL BUREAU OF STANDARDS The National Bureau of Standards^ was established by an act of Congress March 3, 1901. The Bureau's overall goal is to strengthen and advance the Nation's science and technology and facilitate their effective application for public benefit. To this end, the Bureau conducts research and provides: (1) a basis for the Nation's physical measurement system, (2) scientific and technological services for industry and government, (3) a technical basis for equity in trade, and (4) technical services to pro- mote public safety. The Bureau consists of the Institute for Basic Standards, the Institute for Materials Research, the Institute for Applied Technology, the Institute for Computer Sciences and Technology, the Office for Information Programs, and the ! Office of Experimental Technology Incentives Program. THE INSTITUTE FOR BASIC STANDARDS provides the central basis within the United States of a complete and consist- ent system of physical measurement; coordinates that system with measurement systems of other nations; and furnishes essen- tial services leading to accurate and uniform physical measurements throughout the Nation's scientific community, industry, and commerce. The Institute consists of the Office of Measurement Services, and the following center and divisions: Applied Mathematics — Electricity — Mechanics — Heat — Optical Physics — Center for Radiation Research — Lab- oratory Astrophysics^ — Cryogenics^ — Electromagnetics^ — Time and Frequency*. THE INSTITUTE FOR MATERIALS RESEARCH conducts materials research leading to improved methods of measure- ment, standards, and data on the properties of well-characterized materials needed by industry, commerce, educational insti- tutions, and Government; provides advisory and research services to other Government agencies; and develops, produces, and distributes standard reference materials. -
A Networked Robotic System and Its Use in an Oil Spill Monitoring Exercise
A Networked Robotic System and its Use in an Oil Spill Monitoring Exercise El´oiPereira∗† Co-authors: Pedro Silvay, Clemens Krainerz, Christoph Kirschz, Jos´eMorgadoy, and Raja Sengupta∗ cpcc.berkeley.edu, eloipereira.com [email protected] Swarm at the Edge of the Could - ESWeek'13, Montreal, Canada September 29, 2013 ∗ - Systems Engineering, UC Berkeley y - Research Center, Portuguese Air Force Academy z - Computer Science Dept., University of Salzburg Programming the Ubiquitous World • In networked mobile systems (e.g. teams of robots, smartphones, etc.) the location and connectivity of \machines" may vary during the execution of its \programs" (computation specifications) • We investigate models for bridging \programs" and \machines" with dynamic structure (location and connectivity) • BigActors [PKSBdS13, PPKS13, PS13] are actors [Agh86] hosted by entities of the physical structure denoted as bigraph nodes [Mil09] E. Pereira, C. M. Kirsch, R. Sengupta, and J. B. de Sousa, \Bigactors - A Model for Structure-aware Computation," in ACM/IEEE 4th International Conference on Cyber-Physical Systems, 2013, pp. 199-208. Case study: Oil spill monitoring scenario • \Bilge dumping" is an environmental problem of great relevance for countries with large area of jurisdictional waters • EC created the European Maritime Safety Agency to \...prevent and respond to pollution by ships within the EU" • How to use networked robotics to monitor and take evidences of \bilge dumping" Figure: Portuguese Jurisdiction waters and evidences of \Bilge dumping". -
Edsger W. Dijkstra: a Commemoration
Edsger W. Dijkstra: a Commemoration Krzysztof R. Apt1 and Tony Hoare2 (editors) 1 CWI, Amsterdam, The Netherlands and MIMUW, University of Warsaw, Poland 2 Department of Computer Science and Technology, University of Cambridge and Microsoft Research Ltd, Cambridge, UK Abstract This article is a multiauthored portrait of Edsger Wybe Dijkstra that consists of testimo- nials written by several friends, colleagues, and students of his. It provides unique insights into his personality, working style and habits, and his influence on other computer scientists, as a researcher, teacher, and mentor. Contents Preface 3 Tony Hoare 4 Donald Knuth 9 Christian Lengauer 11 K. Mani Chandy 13 Eric C.R. Hehner 15 Mark Scheevel 17 Krzysztof R. Apt 18 arXiv:2104.03392v1 [cs.GL] 7 Apr 2021 Niklaus Wirth 20 Lex Bijlsma 23 Manfred Broy 24 David Gries 26 Ted Herman 28 Alain J. Martin 29 J Strother Moore 31 Vladimir Lifschitz 33 Wim H. Hesselink 34 1 Hamilton Richards 36 Ken Calvert 38 David Naumann 40 David Turner 42 J.R. Rao 44 Jayadev Misra 47 Rajeev Joshi 50 Maarten van Emden 52 Two Tuesday Afternoon Clubs 54 2 Preface Edsger Dijkstra was perhaps the best known, and certainly the most discussed, computer scientist of the seventies and eighties. We both knew Dijkstra |though each of us in different ways| and we both were aware that his influence on computer science was not limited to his pioneering software projects and research articles. He interacted with his colleagues by way of numerous discussions, extensive letter correspondence, and hundreds of so-called EWD reports that he used to send to a select group of researchers. -
A Common Programming Language for the Depart Final Ment of Defenses-Background and Technical January -December 1975 1 Requirements «
Approved for public release; distribution unlimited I 1 PAPER P-1191 A COMMON PROGRAMMING LANGUAGE 1 FOR THE DEPARTMENT OF DEFENSE - - I BACKGROUND AND TECHNICAL REQUIREMENTS I I D. A. Fisher June 1976 I 1 I I I I INSTITUTE FOR DEFENSE ANALYSES I SCIENCE AND TECHNOLOGY DIVISION I I IDA Log No. HQ 76-18215 I Cop-)*- > . -JJ . of 155. cop I ess Approved for public release; distribution unlimited I I I I The work reported in this document was conducted under contract DAHC15 73 C 0200 for the Department of Defense. The publication I of this IDA Paper does not indicate endorsement by the Department of Defense, nor should the contents be construed as reflecting the official position of that agency. I I I I This document has been approved for public release, distribution is unlimited. I I 1 1 1 I I I Copyright IDA/Scanned June 2007 I 1 Approved for public release; distribution unlimited UNCLASSIFIED - ©; ; ; : ;" -; .©, . 1 SECURITY CLASSIFICATION OF THIS PAGE CWnen DM* Entered; READ INSTRUCTIONS REPORT DOCUMENTATION PAGE BEFORE COMPLETING FORM ). RECIPIENT©S CATALOG NUMBER 1 Paper P-J.191. 4. TITLE fend Subtitle.) 5. TYPE Of REPORT e PERIOD COVERED A Common Programming Language for the Depart Final ment of Defenses-Background and Technical January -December 1975 1 Requirements «. PERFORMING ORG. REPORT NUMBER P-1191 I. CONTRACT OR GRANT NUMBERflJ 1 DAHC15 73 C 0200 D.A, Fisher 10. PROGRAM ELEMENT. PROJECT TASK 1 INSTITUTE FOR DEFENSE ANALYSES AREA * WORK UNIT NUMBERS 400 Army-Navy Drive Task T-36 Arlington. Virginia 22202 11. -
The Space and Motion of Communicating Agents
The space and motion of communicating agents Robin Milner December 1, 2008 ii to my family: Lucy, Barney, Chloe,¨ and in memory of Gabriel iv Contents Prologue vii Part I : Space 1 1 The idea of bigraphs 3 2 Defining bigraphs 15 2.1 Bigraphsandtheirassembly . 15 2.2 Mathematicalframework . 19 2.3 Bigraphicalcategories . 24 3 Algebra for bigraphs 27 3.1 Elementarybigraphsandnormalforms. 27 3.2 Derivedoperations ........................... 31 4 Relative and minimal bounds 37 5 Bigraphical structure 43 5.1 RPOsforbigraphs............................ 43 5.2 IPOsinbigraphs ............................ 48 5.3 AbstractbigraphslackRPOs . 53 6 Sorting 55 6.1 PlacesortingandCCS ......................... 55 6.2 Linksorting,arithmeticnetsandPetrinets . ..... 60 6.3 Theimpactofsorting .......................... 64 Part II : Motion 66 7 Reactions and transitions 67 7.1 Reactivesystems ............................ 68 7.2 Transitionsystems ........................... 71 7.3 Subtransitionsystems .. .... ... .... .... .... .... 76 v vi CONTENTS 7.4 Abstracttransitionsystems . 77 8 Bigraphical reactive systems 81 8.1 DynamicsforaBRS .......................... 82 8.2 DynamicsforaniceBRS.... ... .... .... .... ... .. 87 9 Behaviour in link graphs 93 9.1 Arithmeticnets ............................. 93 9.2 Condition-eventnets .. .... ... .... .... .... ... .. 95 10 Behavioural theory for CCS 103 10.1 SyntaxandreactionsforCCSinbigraphs . 103 10.2 TransitionsforCCSinbigraphs . 107 Part III : Development 113 11 Further topics 115 11.1Tracking................................ -
TCM Report, Summer
Board of Directors Corporate Donors Contributing Members John William Poduska. Sr. Benefactor-$lO.ooo or more Pathway Design. Inc. Patron-$SOO or more Chairman and CEO AFIPS. Inc." PC Magazine Anonymous. Ray Duncan. Tom Eggers. Belmont Computer. Inc. American Exr.ress Foundation Peat. Marwick. Mitchell & Co. Alan E. Frisbie. Tom and Rosemarie American Te ephone & Telegraph Co." Pell. Rudman. Inc. Hall. Andrew Lavien. Nicholas and Gwen Bell. President Apollo Computer. Inc." Pencept. Inc. Nancy Petti nella. Paul R. Pierce. The Computer Museum Bank of America" Polese-Clancy. Inc. Jonathan Rotenberg. Oliver and Kitty Erich Bloch The Boston Globe" Price Waterhouse Selfridge. J. Michael Storie. Bob National Science Foundation ComputerLand" Project Software & Development. Inc. Whelan. Leo R. Yochim Control Data Corporation" Shawmut Corporation David Donaldson Data General Corporation" Standard Oil Corporation Sponsor-$250 Ropes and Gray Digital Equipment Corporation" Teradyne Hewlett-Packard Warner & Stackpole Isaac Auerbach. G. C . Beldon. Jr .. Sydney Fernbach Philip D. Brooke. Richard J. Clayton. Computer Consultant International Data Group" XRE Corporation International Business Machines. Inc." " Contributed to the Capital Campaign Richard Corben. Howard E. Cox. Jr .. C. Lester Hogan The MITRE Corporation" Lucien and Catherine Dimino. Philip H. Fairchild Camera and Instrument NEC Corporation" Darn. Dan L. Eisner. Bob O. Evans. Corporation Raytheon Company Branko Gerovac. Dr. Roberto Guatelli. Sanders Associates M. Ernest Huber. Lawrence J. Kilgallen. Arthur Humphreys The Travelers Companies Core Members Martin Kirkpatrick. Marian Kowalski. ICL Wang Laboratories. Inc." Raymond Kurzweil. Michael Levitt. Carl Theodore G. Johnson Harlan E. and Lois Anderson Machover. Julius Marcus. Joe W .. Charles and Constance Bachman Matthews. Tron McConnell. -
The Origins of Structural Operational Semantics
The Origins of Structural Operational Semantics Gordon D. Plotkin Laboratory for Foundations of Computer Science, School of Informatics, University of Edinburgh, King’s Buildings, Edinburgh EH9 3JZ, Scotland I am delighted to see my Aarhus notes [59] on SOS, Structural Operational Semantics, published as part of this special issue. The notes already contain some historical remarks, but the reader may be interested to know more of the personal intellectual context in which they arose. I must straightaway admit that at this distance in time I do not claim total accuracy or completeness: what I write should rather be considered as a reconstruction, based on (possibly faulty) memory, papers, old notes and consultations with colleagues. As a postgraduate I learnt the untyped λ-calculus from Rod Burstall. I was further deeply impressed by the work of Peter Landin on the semantics of pro- gramming languages [34–37] which includes his abstract SECD machine. One should also single out John McCarthy’s contributions [45–48], which include his 1962 introduction of abstract syntax, an essential tool, then and since, for all approaches to the semantics of programming languages. The IBM Vienna school [42, 41] were interested in specifying real programming languages, and, in particular, worked on an abstract interpreting machine for PL/I using VDL, their Vienna Definition Language; they were influenced by the ideas of McCarthy, Landin and Elgot [18]. I remember attending a seminar at Edinburgh where the intricacies of their PL/I abstract machine were explained. The states of these machines are tuples of various kinds of complex trees and there is also a stack of environments; the transition rules involve much tree traversal to access syntactical control points, handle jumps, and to manage concurrency. -
Curriculum Vitae Thomas A
Curriculum Vitae Thomas A. Henzinger February 6, 2021 Address IST Austria (Institute of Science and Technology Austria) Phone: +43 2243 9000 1033 Am Campus 1 Fax: +43 2243 9000 2000 A-3400 Klosterneuburg Email: [email protected] Austria Web: pub.ist.ac.at/~tah Research Mathematical logic, automata and game theory, models of computation. Analysis of reactive, stochastic, real-time, and hybrid systems. Formal software and hardware verification, especially model checking. Design and implementation of concurrent and embedded software. Executable modeling of biological systems. Education September 1991 Ph.D., Computer Science Stanford University July 1987 Dipl.-Ing., Computer Science Kepler University, Linz August 1986 M.S., Computer and Information Sciences University of Delaware Employment September 2009 President IST Austria April 2004 to Adjunct Professor, University of California, June 2011 Electrical Engineering and Computer Sciences Berkeley April 2004 to Professor, EPFL August 2009 Computer and Communication Sciences January 1999 to Director Max-Planck Institute March 2000 for Computer Science, Saarbr¨ucken July 1998 to Professor, University of California, March 2004 Electrical Engineering and Computer Sciences Berkeley July 1997 to Associate Professor, University of California, June 1998 Electrical Engineering and Computer Sciences Berkeley January 1996 to Assistant Professor, University of California, June 1997 Electrical Engineering and Computer Sciences Berkeley January 1992 to Assistant Professor, Cornell University December 1996 Computer Science October 1991 to Postdoctoral Scientist, Universit´eJoseph Fourier, December 1991 IMAG Laboratory Grenoble 1 Honors Member, US National Academy of Sciences, 2020. Member, American Academy of Arts and Sciences, 2020. ESWEEK (Embedded Systems Week) Test-of-Time Award, 2020. LICS (Logic in Computer Science) Test-of-Time Award, 2020. -
Roger Needham
The Marshall Symposium: Address: Roger Needham Table of Contents Participants The Marshall Philip Power: Good morning. In remorseless pursuit of our Scholarships timetable, which envisages a busy and crowded day, I think that it's time to get going. Home Welcome to the second session of the Marshall Symposium. I'd like to get some housekeeping matters out of the way. For those of you who don't have programs, they are available in the lobby. There will be a fifteen-minute break between the first and the second panel, at approximately ten forty-five. There will be coffee and pop available in the lobby, but we will resume our panel discussions promptly at eleven. We are hopeful of provoking as much interplay between our panels and the audience as we can. To facilitate that, there are microphones at each aisle, and so at the end of panels, people are encouraged and invited to ask questions. Our morning speaker is a most distinguished trans-Atlantic visitor who suffered the indignities inflicted on many airline travelers at the hands of Northwest Airlines and its associated unions. Roger Needham, who is a pro-vice chancellor of Cambridge University, was born in 1935 and has been in computing at Cambridge since 1956. His Ph.D. thesis in 1961 concerned the application of digital computers to problems of classification and grouping. In 1962, he joined the computer laboratory, which was then called the mathematical laboratory, and has been on the faculty since 1963. He took a leading role in Cambridge projects in operating systems, in time-sharing systems, in memory protection, in local area networks and in distributed systems over the next twenty years.