December the Harvard Mark 1 [Aug 7] with Have “Translated from the Old Don Piatt

Total Page:16

File Type:pdf, Size:1020Kb

December the Harvard Mark 1 [Aug 7] with Have “Translated from the Old Don Piatt Lake and Benjamin M. Durfee, shalt not covet thy Neighbor’s who had previously worked on System,” which he claimed to December the Harvard Mark 1 [Aug 7] with have “translated from the Old Don Piatt. Durfee and Piatt Geek.” He also revealed that the would later be assigned to the Mexican version of MS-DOS is Dickens and SSEC [Jan 27]. “DOS Equis” and the Swedish is “Häagen-DOS.” Babbage At the height of his renown, Dec. 1855 Armstrong donned vestments, glued a microchip to his Charles Dickens attended forehead (" the third I/O”) and Charles Babbage's [Dec 26] presented pun-filled “DOSpels” Saturday famous soirees at least to thousands at COMDEX [Dec once [March 00], where he may 3]. have seen a demonstration of the first Difference Engine [June A typical sermon began: 14] and listened to chitchat “Dearly C-loved, we are about the Analytical Engine [Dec assembled here together 23]. because PCing is believing. We’re here to console you; ASCII Dickens probably based the One of the Aberdeen PSRCs. character of the struggling and ye shall receive. We say Photo by Eric Hankam. (c) IBM there is a life worth debugging. inventor Daniel Doyce in “Little Archive. Dorrit” partly on Babbage and Data, data, everywhere, but not a on his engineer, Joseph Clement. thought to think, that’s the The first two PSRCs were The book’s fictional problem…. Friends, perhaps you delivered to the Ballistics Circumlocution Office satirizes know someone out there with a Research Lab (BRL) at the the British Treasury and its terminal illness…” Aberdeen Proving Ground in dealings with Babbage over Dec. 1944, where they were Armstrong also founded the funding for his engines. Doyce is known as the Aberdeen Relay world’s first tech religion, The described like so: Calculators. Church of Heuristic Information "He was not much to look at, Processing (C.H.I.P), and became The Aberdeens were America’s either in point of size or in point its sole prophet and apostle fastest digital calculators at the of dress; being merely a short, [April 4]. Then he gave it all up: time, capable of 24,000 six-digit square, practical looking man, “I lost interest and everyone was multiplications per hour, twenty whose hair had turned grey, and self-interested.” times faster than the Mark I. in whose face and forehead They were still being used in Armstrong is now a spiritual there were deep lines of 1952, by which time the BRL teacher and astrologer living in cogitation, which looked as also had the ENIAC [Feb 15], the Vancouver, where he founded though they were carved in hard EDVAC [April 12] and ORDVAC. the Vedic Academy of Sciences wood." and Arts, and is the author of The IBM 604, an electronic The novel first appeared in numerous books including: (vacuum-tube) version of the serial form, in 19 monthly “Spiritual Teachings of the PSRC was released in [June 00] instalments published between Avatar, Ancient Wisdom for a 1948. The 604 was the main Dec. 1855 and June 1857. New World.” computing element in IBM's Card-Programmed electronic Calculator (CPC), which sold The PSRC very well until moderately FORTRAN Begins priced, stored-program Dec. 1944 computers became available in Dec. 1953 the mid-1950's. The IBM Pluggable Sequence John Backus [Dec 3] submitted a Relay Calculator (PSRC) was a proposal to IBM to develop a special purpose punched card practical alternative to assembly machine for determining Jeffrey Armstrong language for programming the artillery firing trajectories for IBM 704 [May 7]. FORTRAN (aka Saint $ilicon) the Army. It's sometimes called (“FORmula TRANslator”) would the missing link between Born: Dec. 1947; simplify the programming punched card equipment and Detroit, Michigan process by allowing the use of the stored-program computer. algebra-like expressions when In 1987, Armstrong published writing software. Its specification was due to “The Binary Bible of Saint Wallace Eckert [June 19] but the $ilicon”, an omnibus of prayers, Backus’ boss, Cuthbert Hurd machine was designed and built nursery rhymes, and [April 5], gave him the go-ahead, by an IBM team led by Clair D. commandments, such as “Thou and work began in early 1954. 1 Backus sought out a correct switches on the console unwelcome, but the individual development team with would cause the girl’s hips to only replied, “but this is "creativity, a lot of smarts and sway, synchronized to music important!” In other words, this experience. We had a great played on the console’s buzzer. may have been the first spam variety of people: a physicist, a If the operator pointed the message, although Gary Thuerk crystallographer, an English console’s light gun (another is usually granted the award for major.” handy part of SAGE’s design) at that innovation [May 3]. the dancer's navel and pulled For example, Sheldon Best, on Another contender for first the trigger, her skirt would drop loan from MIT, wrote the part of email (on a time-sharing off and the screen go blank. the compiler that decided how machine) are the DIAL, LINK and Sadly, there's no pictorial record to use the 704’s index registers JOIN commands on the SDC [Oct of that program in action. efficiently. Roy Nutt, formerly 00] AN/FSQ-32 (aka Q32) at head of the data center at United DARPA. They were developed by Aircraft, was responsible for the Larry Roberts [Dec 21] and FORMAT I/O, and Harlan CTSS MAIL Thomas Marill in the early Herrick decided to call the 1960's. language's unconditional jump a Dec. 1964 For an alternative view on the GOTO [May 11]. Tom Van Vleck and Noel Morris origins of EMAIL, see [Aug 30]. For relaxation, the team held implemented the first e-mail lunch-time “blind chess” program for MIT’s Compatible matches and, in the winter, Time-Sharing System (CTSS impromptu snowball fights. [May 3]) in the summer of 1965. PDP-7 (and UNIX) However, the original idea of Dec. 1965 The first FORTRAN program was having a CTSS MAIL command successfully run by Herrick on had been proposed in The PDP-7 was DEC’s third 18- Sept. 20, 1954. A preliminary "Programming Staff Note" (PSN) bit machine, and quite similar to report on the language was 39 by Louis Pouzin, Glenda the PDP-4 but less expensive, released on [Nov 10] 1954. The Schroeder, and Pat Crisman in retailing at a very reasonable first FORTRAN manual appeared Dec. 1964. The full story was $72,000. It was the first machine two years later on [Oct 15] 1956, explained in a series of to use DEC’s “flip-chips”, 3 by 5 followed by the first compiler in fascinating articles that inch boards holding multiple 1957 [Feb 26; April 19]. appeared in The New York Times discrete components. Also, the in June 2011, written by the standard core memory capacity noted filmmaker Errol Morris was set at 4K words, expandable Computer Art (and brother of Noel). up to an impressive 64K words (equivalent to 144 KB). Dec. 1956 In the mid-1960's, Van Vleck wrote another “mail” command, The PDP-7 is probably best The earliest known computer- this time for Multics [Nov 30] remembered as the computer generated art work was a that he modeled on CTSS MAIL, where Ken Thompson [Feb 4] glamor girl image, probably and Bob Frankston [June 14] began developing UNIX. He was copied from the December 1956 (then an undergraduate) looking for a machine suitable as pinup drawn by George Petty for contributed a Multics version of a home for his “Space Travel” that year's Esquire calendar. text messaging. game, which he had nurtured on To be clear, these tools only Multics [Nov 30] until Bell The image was displayed during pulled out of the project in April the execution of a diagnostics allowed users to communicate 1969. He had first tried porting program used when data was on a single time-sharing the game over to a GE 635 transferred between two SAGE computer. The first program for running GECOS, but the OS [June 26] computers. The sending e-mail over the processed jobs in batch mode rendering was made possible ARPANET [Oct 29] was probably which was poorly suited to because each console included a Ray Tomlinson’s [April 23] playing games. Thompson then 19-inch circular cathode ray extension to SNDMSG in 1971. found an unused PDP-7, which tube (CRT) that could draw By the 1970's, there were over a sported an excellent Graphics II vector lines. We know all this thousand CTSS users. Van Vleck terminal (offering a resolution of because budding historian was mightily displeased one day 1024 x 1024 pixels). Also, the Lawrence Tipton snapped the in 1971 to discover that a machine's OS, DECsys, provided only known photo of the pinup sysadmin had sent a long anti- an interactive, single user, during his time at Fort Lee in war message to every user. It program development Virginia in early 1959. began: environment for Fortran and assembly language. However, SAGE veterans also remember THERE IS NO WAY TO PEACE. another risqué diagnostics PEACE IS THE WAY. the OS worked best on a PDP-7 program that debuted around with 8K words of memory and 1960. It featured the outline of a Van Vleck pointed out that this two DECtape mass storage topless hula dancer. Flipping the was inappropriate and possibly drives, while the machine 2 commandeered by Thompson microprocessor-based computer group of machines that were only had paper tape storage.
Recommended publications
  • The Future: the Story of Squeak, a Practical Smalltalk Written in Itself
    Back to the future: the story of Squeak, a practical Smalltalk written in itself Dan Ingalls, Ted Kaehler, John Maloney, Scott Wallace, and Alan Kay [Also published in OOPSLA ’97: Proc. of the 12th ACM SIGPLAN Conference on Object-oriented Programming, 1997, pp. 318-326.] VPRI Technical Report TR-1997-001 Viewpoints Research Institute, 1209 Grand Central Avenue, Glendale, CA 91201 t: (818) 332-3001 f: (818) 244-9761 Back to the Future The Story of Squeak, A Practical Smalltalk Written in Itself by Dan Ingalls Ted Kaehler John Maloney Scott Wallace Alan Kay at Apple Computer while doing this work, now at Walt Disney Imagineering 1401 Flower Street P.O. Box 25020 Glendale, CA 91221 [email protected] Abstract Squeak is an open, highly-portable Smalltalk implementation whose virtual machine is written entirely in Smalltalk, making it easy to debug, analyze, and change. To achieve practical performance, a translator produces an equivalent C program whose performance is comparable to commercial Smalltalks. Other noteworthy aspects of Squeak include: a compact object format that typically requires only a single word of overhead per object; a simple yet efficient incremental garbage collector for 32-bit direct pointers; efficient bulk- mutation of objects; extensions of BitBlt to handle color of any depth and anti-aliased image rotation and scaling; and real-time sound and music synthesis written entirely in Smalltalk. Overview Squeak is a modern implementation of Smalltalk-80 that is available for free via the Internet, at http://www.research.apple.com/research/proj/learning_concepts/squeak/ and other sites. It includes platform-independent support for color, sound, and image processing.
    [Show full text]
  • Oral History of Fernando Corbató
    Oral History of Fernando Corbató Interviewed by: Steven Webber Recorded: February 1, 2006 West Newton, Massachusetts CHM Reference number: X3438.2006 © 2006 Computer History Museum Oral History of Fernando Corbató Steven Webber: Today the Computer History Museum Oral History Project is going to interview Fernando J. Corbató, known as Corby. Today is February 1 in 2006. We like to start at the very beginning on these interviews. Can you tell us something about your birth, your early days, where you were born, your parents, your family? Fernando Corbató: Okay. That’s going back a long ways of course. I was born in Oakland. My parents were graduate students at Berkeley and then about age 5 we moved down to West Los Angeles, Westwood, where I grew up [and spent] most of my early years. My father was a professor of Spanish literature at UCLA. I went to public schools there in West Los Angeles, [namely,] grammar school, junior high and [the high school called] University High. So I had a straightforward public school education. I guess the most significant thing to get to is that World War II began when I was in high school and that caused several things to happen. I’m meandering here. There’s a little bit of a long story. Because of the wartime pressures on manpower, the high school went into early and late classes and I cleverly saw that I could get a chance to accelerate my progress. I ended up taking both early and late classes and graduating in two years instead of three and [thereby] got a chance to go to UCLA in 1943.
    [Show full text]
  • April 22 -- STEPS NSF 2012 Report
    ! 2012 REPORT ! STEPS Toward Expressive Programming Systems ! “A#Science#Experiment”# ! by# (In#random#order)#Yoshiki#Ohshima,#Dan#Amelang,#Ted#Kaehler,#Bert#Freudenberg,# Aran#Lunzer,#Alan#Kay,#Ian#Piumarta,#Takashi#Yamamiya,#Alan#Borning,#Hesam# Samimi,#Bret#Victor,#Kim#Rose*# VIEWPOINTS#RESEARCH#INSTITUTE# # # *These#are#the#STEPS#researchers#for#the#year#2012.#For#a#complete#listing# of#the#participants#over#the#length#of#the#project#see#the#section#on#the# NSF#site#which#contains#this#report.# TABLE OF CONTENTS — The STEPS Project for the General Public Summary of the STEPS project . Origin . STEPS aims at personal computing . What does STEPS look like? . STEPS is a “science project” . General approach . “T-shirt programming” . Overall map of STEPS . General STEPS results . Making “runnable maths” . Assessing STEPS Summary of STEPS research in 2012 . Inventing & building a language for STEPS “UI and applications”, and rewriting Frank in it . Producing a workable “chain of meaning” that extends from the screen all the way to the CPU . Inventing methods that create automatic visualizers for languages created from metalanguages . Continuing the start of “What vs How” programming via “Cooperating Languages and Solvers” Reflections on the STEPS Project to Date References Outreach Activities for final year of NSF part of the STEPS project Publications for the NSF part of the STEPS project Appendix I: KScript and KSWorld Appendix II: Making Applications in KSWorld ——— ! The$STEPS$Project$For$The$General$Public$ If#computing#is#important—for#daily#life,#learning,#business,#national#defense,#jobs,#and#
    [Show full text]
  • Smalltalk's Influence on Modern Programming
    1 Smalltalk’s Influence on Modern Programming Smalltalk’s Influence on Modern Programming Matt Savona. February 1 st , 2008. In September 1972 at Xerox PARC, Alan Kay, Ted Kaeher and Dan Ingalls were discussing programming languages in the hallway of their office building. Ted and Dan had begun to consider how large a language had to be to have “great power.” Alan took a different approach, and “asserted that you could define the "most powerful language in the world" in "a page of code."” Ted and Dan replied, “Put up or shut up” (Kay). And with that, the bet to develop the most powerful language was on. Alan arrived at PARC every morning at 4am for two weeks, and devoted his time from 4am to 8am to the development of the language. That language was Smalltalk. Kay had “originally made the boast because McCarthy's self-describing LISP interpreter was written in itself. It was about "a page", and as far as power goes, LISP was the whole nine- yards for functional languages.” He was sure that he could “do the same for object-oriented languages” and still have a reasonable syntax. By the eighth morning, Kay had a version of Smalltalk developed where “symbols were byte-coded and the receiving of return-values from a send was symmetric” (Kay). Several days later, Dan Ingalls had coded Kay’s scheme in BASIC, added a “token scanner”, “list maker” and many other features. “Over the next ten years he made at least 80 major releases of various flavors of Smalltalk” (Kay).
    [Show full text]
  • Pharo by Example
    Pharo by Example Andrew P. Black Stéphane Ducasse Oscar Nierstrasz Damien Pollet with Damien Cassou and Marcus Denker Version of 2009-10-11 ii This book is available as a free download from http://PharoByExample.org. Copyright © 2007, 2008, 2009 by Andrew P. Black, Stéphane Ducasse, Oscar Nierstrasz and Damien Pollet. The contents of this book are protected under Creative Commons Attribution-ShareAlike 3.0 Unported license. You are free: to Share — to copy, distribute and transmit the work to Remix — to adapt the work Under the following conditions: Attribution. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work). Share Alike. If you alter, transform, or build upon this work, you may distribute the resulting work only under the same, similar or a compatible license. • For any reuse or distribution, you must make clear to others the license terms of this work. The best way to do this is with a link to this web page: creativecommons.org/licenses/by-sa/3.0/ • Any of the above conditions can be waived if you get permission from the copyright holder. • Nothing in this license impairs or restricts the author’s moral rights. Your fair dealing and other rights are in no way affected by the above. This is a human-readable summary of the Legal Code (the full license): creativecommons.org/licenses/by-sa/3.0/legalcode Published by Square Bracket Associates, Switzerland. http://SquareBracketAssociates.org ISBN 978-3-9523341-4-0 First Edition, October, 2009.
    [Show full text]
  • The Computational Attitude in Music Theory
    The Computational Attitude in Music Theory Eamonn Bell Submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the Graduate School of Arts and Sciences COLUMBIA UNIVERSITY 2019 © 2019 Eamonn Bell All rights reserved ABSTRACT The Computational Attitude in Music Theory Eamonn Bell Music studies’s turn to computation during the twentieth century has engendered particular habits of thought about music, habits that remain in operation long after the music scholar has stepped away from the computer. The computational attitude is a way of thinking about music that is learned at the computer but can be applied away from it. It may be manifest in actual computer use, or in invocations of computationalism, a theory of mind whose influence on twentieth-century music theory is palpable. It may also be manifest in more informal discussions about music, which make liberal use of computational metaphors. In Chapter 1, I describe this attitude, the stakes for considering the computer as one of its instruments, and the kinds of historical sources and methodologies we might draw on to chart its ascendance. The remainder of this dissertation considers distinct and varied cases from the mid-twentieth century in which computers or computationalist musical ideas were used to pursue new musical objects, to quantify and classify musical scores as data, and to instantiate a generally music-structuralist mode of analysis. I present an account of the decades-long effort to prepare an exhaustive and accurate catalog of the all-interval twelve-tone series (Chapter 2). This problem was first posed in the 1920s but was not solved until 1959, when the composer Hanns Jelinek collaborated with the computer engineer Heinz Zemanek to jointly develop and run a computer program.
    [Show full text]
  • 1. with Examples of Different Programming Languages Show How Programming Languages Are Organized Along the Given Rubrics: I
    AGBOOLA ABIOLA CSC302 17/SCI01/007 COMPUTER SCIENCE ASSIGNMENT ​ 1. With examples of different programming languages show how programming languages are organized along the given rubrics: i. Unstructured, structured, modular, object oriented, aspect oriented, activity oriented and event oriented programming requirement. ii. Based on domain requirements. iii. Based on requirements i and ii above. 2. Give brief preview of the evolution of programming languages in a chronological order. 3. Vividly distinguish between modular programming paradigm and object oriented programming paradigm. Answer 1i). UNSTRUCTURED LANGUAGE DEVELOPER DATE Assembly Language 1949 FORTRAN John Backus 1957 COBOL CODASYL, ANSI, ISO 1959 JOSS Cliff Shaw, RAND 1963 BASIC John G. Kemeny, Thomas E. Kurtz 1964 TELCOMP BBN 1965 MUMPS Neil Pappalardo 1966 FOCAL Richard Merrill, DEC 1968 STRUCTURED LANGUAGE DEVELOPER DATE ALGOL 58 Friedrich L. Bauer, and co. 1958 ALGOL 60 Backus, Bauer and co. 1960 ABC CWI 1980 Ada United States Department of Defence 1980 Accent R NIS 1980 Action! Optimized Systems Software 1983 Alef Phil Winterbottom 1992 DASL Sun Micro-systems Laboratories 1999-2003 MODULAR LANGUAGE DEVELOPER DATE ALGOL W Niklaus Wirth, Tony Hoare 1966 APL Larry Breed, Dick Lathwell and co. 1966 ALGOL 68 A. Van Wijngaarden and co. 1968 AMOS BASIC FranÇois Lionet anConstantin Stiropoulos 1990 Alice ML Saarland University 2000 Agda Ulf Norell;Catarina coquand(1.0) 2007 Arc Paul Graham, Robert Morris and co. 2008 Bosque Mark Marron 2019 OBJECT-ORIENTED LANGUAGE DEVELOPER DATE C* Thinking Machine 1987 Actor Charles Duff 1988 Aldor Thomas J. Watson Research Center 1990 Amiga E Wouter van Oortmerssen 1993 Action Script Macromedia 1998 BeanShell JCP 1999 AngelScript Andreas Jönsson 2003 Boo Rodrigo B.
    [Show full text]
  • MTS on Wikipedia Snapshot Taken 9 January 2011
    MTS on Wikipedia Snapshot taken 9 January 2011 PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sun, 09 Jan 2011 13:08:01 UTC Contents Articles Michigan Terminal System 1 MTS system architecture 17 IBM System/360 Model 67 40 MAD programming language 46 UBC PLUS 55 Micro DBMS 57 Bruce Arden 58 Bernard Galler 59 TSS/360 60 References Article Sources and Contributors 64 Image Sources, Licenses and Contributors 65 Article Licenses License 66 Michigan Terminal System 1 Michigan Terminal System The MTS welcome screen as seen through a 3270 terminal emulator. Company / developer University of Michigan and 7 other universities in the U.S., Canada, and the UK Programmed in various languages, mostly 360/370 Assembler Working state Historic Initial release 1967 Latest stable release 6.0 / 1988 (final) Available language(s) English Available programming Assembler, FORTRAN, PL/I, PLUS, ALGOL W, Pascal, C, LISP, SNOBOL4, COBOL, PL360, languages(s) MAD/I, GOM (Good Old Mad), APL, and many more Supported platforms IBM S/360-67, IBM S/370 and successors History of IBM mainframe operating systems On early mainframe computers: • GM OS & GM-NAA I/O 1955 • BESYS 1957 • UMES 1958 • SOS 1959 • IBSYS 1960 • CTSS 1961 On S/360 and successors: • BOS/360 1965 • TOS/360 1965 • TSS/360 1967 • MTS 1967 • ORVYL 1967 • MUSIC 1972 • MUSIC/SP 1985 • DOS/360 and successors 1966 • DOS/VS 1972 • DOS/VSE 1980s • VSE/SP late 1980s • VSE/ESA 1991 • z/VSE 2005 Michigan Terminal System 2 • OS/360 and successors
    [Show full text]
  • Actor Model of Computation
    Published in ArXiv http://arxiv.org/abs/1008.1459 Actor Model of Computation Carl Hewitt http://carlhewitt.info This paper is dedicated to Alonzo Church and Dana Scott. The Actor model is a mathematical theory that treats “Actors” as the universal primitives of concurrent digital computation. The model has been used both as a framework for a theoretical understanding of concurrency, and as the theoretical basis for several practical implementations of concurrent systems. Unlike previous models of computation, the Actor model was inspired by physical laws. It was also influenced by the programming languages Lisp, Simula 67 and Smalltalk-72, as well as ideas for Petri Nets, capability-based systems and packet switching. The advent of massive concurrency through client- cloud computing and many-core computer architectures has galvanized interest in the Actor model. An Actor is a computational entity that, in response to a message it receives, can concurrently: send a finite number of messages to other Actors; create a finite number of new Actors; designate the behavior to be used for the next message it receives. There is no assumed order to the above actions and they could be carried out concurrently. In addition two messages sent concurrently can arrive in either order. Decoupling the sender from communications sent was a fundamental advance of the Actor model enabling asynchronous communication and control structures as patterns of passing messages. November 7, 2010 Page 1 of 25 Contents Introduction ............................................................ 3 Fundamental concepts ............................................ 3 Illustrations ............................................................ 3 Modularity thru Direct communication and asynchrony ............................................................. 3 Indeterminacy and Quasi-commutativity ............... 4 Locality and Security ............................................
    [Show full text]
  • Interview with Barbara Liskov ACM Turing Award Recipient 2008 Done at MIT April 20, 2016 Interviewer Was Tom Van Vleck
    B. Liskov Interview 1 Interview with Barbara Liskov ACM Turing Award Recipient 2008 Done at MIT April 20, 2016 Interviewer was Tom Van Vleck Interviewer is noted as “TVV” Dr. Liskov is noted as “BL” ?? = inaudible (with timestamp) or [ ] for phonetic [some slight changes have been made in this transcript to improve the readability, but no material changes were made to the content] TVV: Hello, I’m Tom Van Vleck, and I have the honor today to interview Professor Barbara Liskov, the 2008 ACM Turing Award winner. Today is April 20th, 2016. TVV: To start with, why don’t you tell us a little bit about your upbringing, where you lived, and how you got into the business? BL: I grew up in San Francisco. I was actually born in Los Angeles, so I’m a native Californian. When I was growing up, it was definitely not considered the thing to do for a young girl to be interested in math and science. In fact, in those days, the message that you got was that you were supposed to get married and have children and not have a job. Nevertheless, I was always encouraged by my parents to take academics seriously. My mother was a college grad as well as my father, so it was expected that I would go to college, which in those times was not that common. Maybe 20% of the high school class would go on to college and the rest would not. I was always very interested in math and science, so I took all the courses that were offered at my high school, which wasn’t a tremendous number compared to what is available today.
    [Show full text]
  • Exploring the Rns Gene Landscape in Ophiostomatoid Fungi and Related
    ________________________________________________________________________ Exploring the rns gene landscape in ophiostomatoid fungi and related taxa: Molecular characterization of mobile genetic elements and biochemical characterization of intron-encoded homing endonucleases. By Mohamed Hafez Ahmed Abdel-Fattah A Thesis submitted to the Faculty of Graduate Studies of the University of Manitoba in partial fulfilment of the requirements of the degree of: DOCTOR OF PHILOSOPHY Department of Microbiology Faculty of Science University of Manitoba Winnipeg, Manitoba Canada Copyright © 2012 by Mohamed Hafez Ahmed Abdel-Fattah ________________________________________________________________________ ABSTRACT The mitochondrial small-subunit ribosomal RNA (mt. SSU rRNA = rns) gene appears to be a reservoir for a number of group I and II introns along with the intron- encoded proteins (IEPs) such as homing endonucleases (HEases) and reverse transcriptases. The key objective for this thesis was to examine the rns gene among different groups of ophiostomatoid fungi for the presence of introns and IEPs. Overall the distribution of the introns does not appear to follow evolutionary lineages suggesting the possibility of rare horizontal gains and frequent loses. Some of the novel findings of this work were the discovery of a twintron complex inserted at position S1247 within the rns gene, here a group IIA1 intron invaded the ORF embedded within a group IC2 intron. Another new element was discovered within strains of Ophiostoma minus where a group II introns has inserted at the rns position S379; the mS379 intron represents the first mitochondrial group II intron that has an RT-ORF encoded outside Domain IV and it is the first intron reported to at position S379. The rns gene of O.
    [Show full text]
  • Memorial Gathering for Corby
    Fernando J. Corbat6 Memorial Gathering Gifts in memory of Corby may be made to MIT's ... Fernando Corbat6 Fellowship Fund November 4, 2019 via MIT Memorial Gifts Office, Bonny Kellermann 617-253-9722 MIT Stata Center Kirsch Auditorium l•lii MIT EECS MIT CS A IL 1926- 2019 Today we gather to commemorate Fernando J. Corbat6, After CTSS, Corbat6 led a time-sharing effort called Multics 'Corby,' Professor Emeritus in the Department of Electrical (Multiplexed Information and Computing Service), which En~ neering and Computer Science at MIT directly inspired operating systems like Linux and laid the foundation for many aspects of modern computing. Multics Fernando Corbat6 was Lorn on July 1, 1926 in Oakland, doubled as a fertile training ground for an emerging California. At 17, he enlisted as a technician in the U.S. Navy, generation of programmers. Multics was available for where he first got the en~neering bug working on a range of general use at MIT in October 1969 and became a Honeywell radar and sonar systems. After World War II, he earned his • product in 1973. Corbat6 and his colleagues also opened up bachelor's deuee at Caltech before heading to MIT to communication between users with early versions of email, complete a PhD in Physics in 1956. Corbat6 then joined MIT's instant messaging, and word processing. Computation Center as a research assistant, swn moving up to become deputy director of the entire center. Another legacy is "Corbat6's Law," which states that the number of lines of code someone can write in a day is the He was appointed Associate Professor in 1962, promoted to same regardless of the language used.
    [Show full text]