Computer Science at the University of Waterloo
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Department of Computer Science
Department of Computer Science Content Research Overview of the Computer Science Department This brochure gives an overview of the ongoing research activities at the Department of Computer Science of ETH Zurich. It is a collection of the two-page research summaries given by every professor of the Department. The following pages are in alphabetical order of the names of the professors. Gustavo Alonso Information and Communication Systems Research Group Armin Biere Formal Methods for Solving Complexity and Quality Problems Walter Gander From Numerical Analysis to Scientific Computing Gaston Gonnet Computational Biochemistry and Computer Algebra Markus Gross Computer Graphics Laboratory Thomas Gross Laboratory for Software Technology Jürg Gutknecht Program Languages and Runtime Systems Petros Koumoutsakos Computational Sciences Friedemann Mattern Ubiquitous Computing Infrastructures Ueli Maurer Information Security and Cryptography Bertrand Meyer Chair of Software Engineering Kai Nagel Modeling and Simulation Jürg Nievergelt Algorithms, Data Structures, and Applications Moira Norrie Constructing Global Information Spaces Hans-Jörg Schek Realizing the Hyperdatabase Vision Bernt Schiele Perceptual Computing and Computer Vision Robert Stärk Computational Logic Thomas Stricker Parallel- and Distributed Systems Group Roger Wattenhofer Distributed Computing Group Emo Welzl Theory of Combinatorial Algorithms Peter Widmayer Algorithms, Data Structures, and Applications Carl August Zehnder Development and Application Group The most up-to-date research summaries can be found under Û research in the Web presentation of the Department. This version is as of June 12, 2002. Information and Communication Systems Research Group Information Systems Prof. Gustavo Alonso http://www.inf.ethz.ch/department/IS/iks/ [email protected] Figure 1 to 4 BiOpera, a develop- ment and run time environment for cluster and grid computing The motivation behind our research uted at a large scale and heterogeneous. -
A Phylogenomic Study of Human, Dog, and Mouse
A Phylogenomic Study of Human, Dog, and Mouse Gina Cannarozzi, Adrian Schneider, Gaston Gonnet* Institute of Computational Science, ETH Zurich, Zurich, Switzerland In recent years the phylogenetic relationship of mammalian orders has been addressed in a number of molecular studies. These analyses have frequently yielded inconsistent results with respect to some basal ordinal relationships. For example, the relative placement of primates, rodents, and carnivores has differed in various studies. Here, we attempt to resolve this phylogenetic problem by using data from completely sequenced nuclear genomes to base the analyses on the largest possible amount of data. To minimize the risk of reconstruction artifacts, the trees were reconstructed under different criteria—distance, parsimony, and likelihood. For the distance trees, distance metrics that measure independent phenomena (amino acid replacement, synonymous substitution, and gene reordering) were used, as it is highly improbable that all of the trees would be affected the same way by any reconstruction artifact. In contradiction to the currently favored classification, our results based on full-genome analysis of the phylogenetic relationship between human, dog, and mouse yielded overwhelming support for a primate–carnivore clade with the exclusion of rodents. Citation: Cannarozzi G, Schneider A, Gonnet G (2007) A phylogenomic study of human, dog, and mouse. PLoS Comput Biol 3(1): e2. doi:10.1371/journal.pcbi.0030002 Introduction Long branch attraction (LBA) may occur when an ingroup has a faster rate of evolution, thereby promoting migration of A correct interpretation of the direction of evolution in the long branch with accelerated evolution toward the long basal parts of the mammalian tree has important implications branch of the outgroup. -
Fundamentación De La Propuesta De Otorgar El T´Itulo De Doctor Honoris Causa De La Facultad De Ingenier´Ia Al Dr. Gaston Go
Fundamentaci´onde la propuesta de otorgar el t´ıtulode Doctor Honoris Causa de la Facultad de Ingenier´ıaal Dr. Gaston Gonnet. Gaston Henry Gonnet naci´oen Uruguay en setiembre de 1948. En 1968, habiendo concluido sus estudios secundarios, ingres´ocomo do- cente al reci´encreado CECUR (Centro de Computaci´onde la Universidad de la Rep´ublica).Al mismo tiempo, fue estudiante de la nueva carrera de Computador Universitario, habi´endosegraduado en agosto de 1973. A pesar de su juventud, Gonnet ya ten´ıacontacto con las grandes compu- tadoras de esa ´epoca gracias a su trabajo en la empresa IBM en Uruguay. Poco tiempo despu´esde la intervenci´onde la UDELAR en 1973, Gonnet se radic´oen Canad´a. En 1977, se doctor´oen la Universidad de Waterloo transform´andose r´api- damente en un cient´ıficodestacado internacionalmente en el ´areade Algorit- mos y Computabilidad. En 1980, Gonnet co-fund´oel Grupo de Computaci´onSimb´olicaen la Uni- versidad de Waterloo. De ese grupo surgi´oel proyecto Maple, que produjo el conocido Sistema de Algebra Computacional de amplio uso en el ´ambito cient´ıfico-tecnol´ogico.En 2011, Gaston Gonnet y Keith Geddes recibieron el Premio ACM Richard Jenks a la Excelencia en Ingenier´ıade Software apli- cada al Algebra Computacional en el Proyecto Maple. En 1984, Gonnet fue uno de los miembros fundadores del proyecto New Oxford English Dictionary. Este proyecto permiti´ocrear la primer versi´on electr´onicadel Oxford English Dictionary. En 1985, utiliz´osu a~nosab´aticopara retornar al Uruguay y ayudar al Instituto de Computaci´onen su reconstrucci´onluego de la dictadura. -
Polynomial Transformations of Tschirnhaus, Bring and Jerrard
ACM SIGSAM Bulletin, Vol 37, No. 3, September 2003 Polynomial Transformations of Tschirnhaus, Bring and Jerrard Victor S. Adamchik Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA [email protected] David J. Jeffrey Department of Applied Mathematics, The University of Western Ontario, London, Ontario, Canada [email protected] Abstract Tschirnhaus gave transformations for the elimination of some of the intermediate terms in a polynomial. His transformations were developed further by Bring and Jerrard, and here we describe all these transformations in modern notation. We also discuss their possible utility for polynomial solving, particularly with respect to the Mathematica poster on the solution of the quintic. 1 Introduction A recent issue of the BULLETIN contained a translation of the 1683 paper by Tschirnhaus [10], in which he proposed a method for solving a polynomial equation Pn(x) of degree n by transforming it into a polynomial Qn(y) which has a simpler form (meaning that it has fewer terms). Specifically, he extended the idea (which he attributed to Decartes) in which a polynomial of degree n is reduced or depressed (lovely word!) by removing its term in degree n ¡ 1. Tschirnhaus’s transformation is a polynomial substitution y = Tk(x), in which the degree of the transformation k < n can be selected. Tschirnhaus demonstrated the utility of his transformation by apparently solving the cubic equation in a way different from Cardano. Although Tschirnhaus’s work is described in modern books [9], later works by Bring [2, 3] and Jerrard [7, 6] have been largely forgotten. Here, we present the transformations in modern notation and make some comments on their utility. -
SIGLOG: Special Interest Group on Logic and Computation a Proposal
SIGLOG: Special Interest Group on Logic and Computation A Proposal Natarajan Shankar Computer Science Laboratory SRI International Menlo Park, CA Mar 21, 2014 SIGLOG: Executive Summary Logic is, and will continue to be, a central topic in computing. ACM has a core constituency with an interest in Logic and Computation (L&C), witnessed by 1 The many Turing Awards for work centrally in L&C 2 The ACM journal Transactions on Computational Logic 3 Several long-running conferences like LICS, CADE, CAV, ICLP, RTA, CSL, TACAS, and MFPS, and super-conferences like FLoC and ETAPS SIGLOG explores the connections between logic and computing covering theory, semantics, analysis, and synthesis. SIGLOG delivers value to its membership through the coordination of conferences, journals, newsletters, awards, and educational programs. SIGLOG enjoys significant synergies with several existing SIGs. Natarajan Shankar SIGLOG 2/9 Logic and Computation: Early Foundations Logicians like Alonzo Church, Kurt G¨odel, Alan Turing, John von Neumann, and Stephen Kleene have played a pioneering role in laying the foundation of computing. In the last 65 years, logic has become the calculus of computing underpinning the foundations of many diverse sub-fields. Natarajan Shankar SIGLOG 3/9 Logic and Computation: Turing Awardees Turing awardees for logic-related work include John McCarthy, Edsger Dijkstra, Dana Scott Michael Rabin, Tony Hoare Steve Cook, Robin Milner Amir Pnueli, Ed Clarke Allen Emerson Joseph Sifakis Leslie Lamport Natarajan Shankar SIGLOG 4/9 Interaction between SIGLOG and other SIGs Logic interacts in a significant way with AI (SIGAI), theory of computation (SIGACT), databases (SIGMOD) and knowledge bases (SIGKDD), programming languages (SIGPLAN), software engineering (SIGSOFT), computational biology (SIGBio), symbolic computing (SIGSAM), semantic web (SIGWEB), and hardware design (SIGDA and SIGARCH). -
© in This Web Service Cambridge University Press
Cambridge University Press 978-1-107-03903-2 - Modern Computer Algebra: Third Edition Joachim Von Zur Gathen and Jürgen Gerhard Index More information Index A page number is underlined (for example: 667) when it represents the definition or the main source of information about the index entry. For several key words that appear frequently only ranges of pages or the most important occurrences are indexed. AAECC ......................................... 21 analytic number theory . 508, 523, 532, 533, 652 Abbott,John .............................. 465, 734 AnalyticalEngine ............................... 312 Abel,NielsHenrik .............................. 373 Andrews, George Eyre . 644, 697, 729, 735 Abeliangroup ................................... 704 QueenAnne .................................... 219 Abramov, Serge˘ı Aleksandrovich (Abramov annihilating polynomial ......................... 341 SergeiAleksandroviq) 7, 641, 671, 675, annihilator, Ann( ) .............................. 343 734, 735 annusconfusionis· ................................ 83 Abramson, Michael . 738 Antoniou,Andreas ........................ 353, 735 Achilles ......................................... 162 Antoniszoon, Adrian (Metius) .................... 82 ACM . see Association for Computing Machinery Aoki,Kazumaro .......................... 542, 751 active attack . 580 Apéry, Roger . 671, 684, 697, 761 Adam,Charles .................................. 729 number ....................................... 684 Adams,DouglasNoël ..................... 729, 796 Apollonius of -
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 -
Central Library: IIT GUWAHATI
Central Library, IIT GUWAHATI BACK VOLUME LIST DEPARTMENTWISE (as on 20/04/2012) COMPUTER SCIENCE & ENGINEERING S.N. Jl. Title Vol.(Year) 1. ACM Jl.: Computer Documentation 20(1996)-26(2002) 2. ACM Jl.: Computing Surveys 30(1998)-35(2003) 3. ACM Jl.: Jl. of ACM 8(1961)-34(1987); 43(1996);45(1998)-50 (2003) 4. ACM Magazine: Communications of 39(1996)-46#3-12(2003) ACM 5. ACM Magazine: Intelligence 10(1999)-11(2000) 6. ACM Magazine: netWorker 2(1998)-6(2002) 7. ACM Magazine: Standard View 6(1998) 8. ACM Newsletters: SIGACT News 27(1996);29(1998)-31(2000) 9. ACM Newsletters: SIGAda Ada 16(1996);18(1998)-21(2001) Letters 10. ACM Newsletters: SIGAPL APL 28(1998)-31(2000) Quote Quad 11. ACM Newsletters: SIGAPP Applied 4(1996);6(1998)-8(2000) Computing Review 12. ACM Newsletters: SIGARCH 24(1996);26(1998)-28(2000) Computer Architecture News 13. ACM Newsletters: SIGART Bulletin 7(1996);9(1998) 14. ACM Newsletters: SIGBIO 18(1998)-20(2000) Newsletters 15. ACM Newsletters: SIGCAS 26(1996);28(1998)-30(2000) Computers & Society 16. ACM Newsletters: SIGCHI Bulletin 28(1996);30(1998)-32(2000) 17. ACM Newsletters: SIGCOMM 26(1996);28(1998)-30(2000) Computer Communication Review 1 Central Library, IIT GUWAHATI BACK VOLUME LIST DEPARTMENTWISE (as on 20/04/2012) COMPUTER SCIENCE & ENGINEERING S.N. Jl. Title Vol.(Year) 18. ACM Newsletters: SIGCPR 17(1996);19(1998)-20(1999) Computer Personnel 19. ACM Newsletters: SIGCSE Bulletin 28(1996);30(1998)-32(2000) 20. ACM Newsletters: SIGCUE Outlook 26(1998)-27(2001) 21. -
SMT-Like Queries in Maple
SMT-like Queries in Maple Stephen A. Forrest Maplesoft Europe Ltd., Cambridge, UK [email protected] Abstract. The recognition that Symbolic Computation tools could ben- efit from techniques from the world of Satisfiability Checking was a pri- mary motive for the founding of the SC2 community. These benefits would be further demonstrated by the existence of \SMT-like" queries in legacy computer algebra systems; that is, computations which seek to decide satisfiability or identify a satisfying witness. The Maple CAS has been under continuous development since the 1980s and its core symbolic routines incorporate many heuristics. We describe ongoing work to compose an inventory of such \SMT-like\ queries ex- tracted from the built-in Maple library, most of which were added long before the inclusion in Maple of explicit software links to SAT/SMT tools. Some of these queries are expressible in the SMT-LIB format us- ing an existing logic, and it is hoped that those that are not could help inform future development of the SMT-LIB standard. 1 Introduction 1.1 Maple Maple is a computer algebra system originally developed by members of the Symbolic Computation Group in the Faculty of Mathematics at the University of Waterloo. Since 1988, it has been developed and commercially distributed by Maplesoft (formally Waterloo Maple Inc.), a company based in Waterloo, Ontario, Canada, with ongoing contributions from affiliated research centres. The core Maple language is implemented in a kernel written in C++ and much of the computational library is written in the Maple language, though the system does employ external libraries such as LAPACK and the GNU Multiprecision Library (GMP) for special-purpose computations. -
ACM JOURNALS S.No. TITLE PUBLICATION RANGE :STARTS PUBLICATION RANGE: LATEST URL 1. ACM Computing Surveys Volume 1 Issue 1
ACM JOURNALS S.No. TITLE PUBLICATION RANGE :STARTS PUBLICATION RANGE: LATEST URL 1. ACM Computing Surveys Volume 1 Issue 1 (March 1969) Volume 49 Issue 3 (October 2016) http://dl.acm.org/citation.cfm?id=J204 Volume 24 Issue 1 (Feb. 1, 2. ACM Journal of Computer Documentation Volume 26 Issue 4 (November 2002) http://dl.acm.org/citation.cfm?id=J24 2000) ACM Journal on Emerging Technologies in 3. Volume 1 Issue 1 (April 2005) Volume 13 Issue 2 (October 2016) http://dl.acm.org/citation.cfm?id=J967 Computing Systems 4. Journal of Data and Information Quality Volume 1 Issue 1 (June 2009) Volume 8 Issue 1 (October 2016) http://dl.acm.org/citation.cfm?id=J1191 Journal on Educational Resources in Volume 1 Issue 1es (March 5. Volume 16 Issue 2 (March 2016) http://dl.acm.org/citation.cfm?id=J814 Computing 2001) 6. Journal of Experimental Algorithmics Volume 1 (1996) Volume 21 (2016) http://dl.acm.org/citation.cfm?id=J430 7. Journal of the ACM Volume 1 Issue 1 (Jan. 1954) Volume 63 Issue 4 (October 2016) http://dl.acm.org/citation.cfm?id=J401 8. Journal on Computing and Cultural Heritage Volume 1 Issue 1 (June 2008) Volume 9 Issue 3 (October 2016) http://dl.acm.org/citation.cfm?id=J1157 ACM Letters on Programming Languages Volume 2 Issue 1-4 9. Volume 1 Issue 1 (March 1992) http://dl.acm.org/citation.cfm?id=J513 and Systems (March–Dec. 1993) 10. ACM Transactions on Accessible Computing Volume 1 Issue 1 (May 2008) Volume 9 Issue 1 (October 2016) http://dl.acm.org/citation.cfm?id=J1156 11. -
A Study on Various Programming Languages to Keep Pace with Innovation
S.Sridhar* et al. (IJITR) INTERNATIONAL JOURNAL OF INNOVATIVE TECHNOLOGY AND RESEARCH Volume No.5, Issue No.2, February – March 2017, 5681-5704. A Study On Various Programming Languages To Keep Pace With Innovation S.SRIDHAR Professor & Director RV Centre for Cognitive & Central Computing R.V.College of Engineering, Mysore Road Bangalore-560059 India Abstract: A programming language is a formal computer language designed to communicate instructions to a machine, particularly a computer. Programming languages can be used to create programs to control the behaviour of a machine or to express algorithms. The earliest known programmable machine preceded the invention of the digital computer and is the automatic flute player described in the 9th century by the brothers Musa in Baghdad, "during the Islamic Golden Age". From the early 1800s, "programs" were used to direct the behavior of machines such as Jacquard looms and player pianos. Thousands of different programming languages have been created, mainly in the computer field, and many more still are being created every year. Many programming languages require computation to be specified in an imperative form (i.e., as a sequence of operations to perform) while other languages use other forms of program specification such as the declarative form (i.e. the desired result is specified, not how to achieve it). The description of a programming language is usually split into the two components of syntax (form) and semantics (meaning). Some languages are defined by a specification document (for example, the C programming language is specified by an ISO Standard) while other languages (such as Perl) have a dominant implementation that is treated as a reference. -
Stephen M. Watt 25 October 2010
Stephen M. Watt 25 October 2010 Professional Address Department of Computer Science MC 375 [email protected] University of Western Ontario http://www.csd.uwo.ca/~watt London Ontario, canada n6a 5b7 Tel. +1 519 661-4244 Fax. +1 519 661-3515 Personal Address 56 Doncaster Place [email protected] London Ontario, canada n6g 2a5 Tel. +1 519 471-1688 Fax. +1 519 204-9288 Table of Contents General Career and Education . 2 Professional Biography . 2 Prizes, Awards, Honours . .3 Leadership . 4 Research Research Summary . 6 Publications . 8 Major Software Productions . 20 Invited Presentations . 21 Research Grants . .27 Technology Transfer . 30 Teaching Teaching Philosophy . .31 Program Development . 31 Courses Taught . .32 Training of Highly Qualified Personnel . .34 Outreach and Coaching . .39 Service Institutional Service . 40 Professional Boards and Committees . 42 Conference Organization . 43 Evaluation . 47 Stephen M. Watt 2 1 Career and Education 1997-date Professor, Department of Computer Science, University of Western Ontario, canada Department Chair (1997-2002) Cross appointments to departments of Applied Mathematics and Mathematics 2001-date Member, Board of Directors, Descartes Systems Group (nasdaq dsgx, tse dsg) Chairman of the Board (2003-2007) 1998-2009 Member, Board of Directors, Maplesoft 1996-1998 Responsable Scientifique (Scientific Director), Projet safir Institut National de Recherche en Informatique et en Automatique, france 1995-1997 Professeur, Dept. d’Informatique, Universit´ede Nice–Sophia Antipolis, france Titularisation (tenure) awarded January 1996. 1984-1997 Research Staff Member, IBM T.J. Watson Research Center, Yorktown Heights ny, usa 1982-1984 Lecturer (during PhD), Dept. of Computer Science, University of Waterloo, canada 1981-1986 PhD, Computer Science, University of Waterloo, canada 1979-1981 MMath, Applied Mathematics, University of Waterloo, canada 1976-1979 BSc, Honours Mathematics and Honours Physics, U.