TUGBOAT Volume 35, Number 3 / 2014
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae Available Online
Donald Knuth Fletcher Jones Professor of Computer Science, Emeritus Curriculum Vitae available Online Bio BIO Donald Ervin Knuth is an American computer scientist, mathematician, and Professor Emeritus at Stanford University. He is the author of the multi-volume work The Art of Computer Programming and has been called the "father" of the analysis of algorithms. He contributed to the development of the rigorous analysis of the computational complexity of algorithms and systematized formal mathematical techniques for it. In the process he also popularized the asymptotic notation. In addition to fundamental contributions in several branches of theoretical computer science, Knuth is the creator of the TeX computer typesetting system, the related METAFONT font definition language and rendering system, and the Computer Modern family of typefaces. As a writer and scholar,[4] Knuth created the WEB and CWEB computer programming systems designed to encourage and facilitate literate programming, and designed the MIX/MMIX instruction set architectures. As a member of the academic and scientific community, Knuth is strongly opposed to the policy of granting software patents. He has expressed his disagreement directly to the patent offices of the United States and Europe. (via Wikipedia) ACADEMIC APPOINTMENTS • Professor Emeritus, Computer Science HONORS AND AWARDS • Grace Murray Hopper Award, ACM (1971) • Member, American Academy of Arts and Sciences (1973) • Turing Award, ACM (1974) • Lester R Ford Award, Mathematical Association of America (1975) • Member, National Academy of Sciences (1975) 5 OF 44 PROFESSIONAL EDUCATION • PhD, California Institute of Technology , Mathematics (1963) PATENTS • Donald Knuth, Stephen N Schiller. "United States Patent 5,305,118 Methods of controlling dot size in digital half toning with multi-cell threshold arrays", Adobe Systems, Apr 19, 1994 • Donald Knuth, LeRoy R Guck, Lawrence G Hanson. -
Modified Moments for Indefinite Weight Functions [2Mm] (A Tribute
Modified Moments for Indefinite Weight Functions (a Tribute to a Fruitful Collaboration with Gene H. Golub) Martin H. Gutknecht Seminar for Applied Mathematics ETH Zurich Remembering Gene Golub Around the World Leuven, February 29, 2008 Martin H. Gutknecht Modified Moments for Indefinite Weight Functions My education in numerical analysis at ETH Zurich My teachers of numerical analysis: Eduard Stiefel [1909–1978] (first, basic NA course, 1964) Peter Läuchli [b. 1928] (ALGOL, 1965) Hans-Rudolf Schwarz [b. 1930] (numerical linear algebra, 1966) Heinz Rutishauser [1917–1970] (follow-up numerical analysis course; “selected chapters of NM” [several courses]; computer hands-on training) Peter Henrici [1923–1987] (computational complex analysis [many courses]) The best of all worlds? Martin H. Gutknecht Modified Moments for Indefinite Weight Functions My education in numerical analysis (cont’d) What did I learn? Gauss elimination, simplex alg., interpolation, quadrature, conjugate gradients, ODEs, FDM for PDEs, ... qd algorithm [often], LR algorithm, continued fractions, ... many topics in computational complex analysis, e.g., numerical conformal mapping What did I miss to learn? (numerical linear algebra only) QR algorithm nonsymmetric eigenvalue problems SVD (theory, algorithms, applications) Lanczos algorithm (sym., nonsym.) Padé approximation, rational interpolation Martin H. Gutknecht Modified Moments for Indefinite Weight Functions My first encounters with Gene H. Golub Gene’s first two talks at ETH Zurich (probably) 4 June 1971: “Some modified eigenvalue problems” 28 Nov. 1974: “The block Lanczos algorithm” Gene was one of many famous visitors Peter Henrici attracted. Fall 1974: GHG on sabbatical at ETH Zurich. I had just finished editing the “Lectures of Numerical Mathematics” of Heinz Rutishauser (1917–1970). -
Mathematical Circus & 'Martin Gardner
MARTIN GARDNE MATHEMATICAL ;MATH EMATICAL ASSOCIATION J OF AMERICA MATHEMATICAL CIRCUS & 'MARTIN GARDNER THE MATHEMATICAL ASSOCIATION OF AMERICA Washington, DC 1992 MATHEMATICAL More Puzzles, Games, Paradoxes, and Other Mathematical Entertainments from Scientific American with a Preface by Donald Knuth, A Postscript, from the Author, and a new Bibliography by Mr. Gardner, Thoughts from Readers, and 105 Drawings and Published in the United States of America by The Mathematical Association of America Copyright O 1968,1969,1970,1971,1979,1981,1992by Martin Gardner. All riglhts reserved under International and Pan-American Copyright Conventions. An MAA Spectrum book This book was updated and revised from the 1981 edition published by Vantage Books, New York. Most of this book originally appeared in slightly different form in Scientific American. Library of Congress Catalog Card Number 92-060996 ISBN 0-88385-506-2 Manufactured in the United States of America For Donald E. Knuth, extraordinary mathematician, computer scientist, writer, musician, humorist, recreational math buff, and much more SPECTRUM SERIES Published by THE MATHEMATICAL ASSOCIATION OF AMERICA Committee on Publications ANDREW STERRETT, JR.,Chairman Spectrum Editorial Board ROGER HORN, Chairman SABRA ANDERSON BART BRADEN UNDERWOOD DUDLEY HUGH M. EDGAR JEANNE LADUKE LESTER H. LANGE MARY PARKER MPP.a (@ SPECTRUM Also by Martin Gardner from The Mathematical Association of America 1529 Eighteenth Street, N.W. Washington, D. C. 20036 (202) 387- 5200 Riddles of the Sphinx and Other Mathematical Puzzle Tales Mathematical Carnival Mathematical Magic Show Contents Preface xi .. Introduction Xlll 1. Optical Illusions 3 Answers on page 14 2. Matches 16 Answers on page 27 3. -
DNDO Statement of Intent for New National Lab Work, 22 Nov 05
70RDND18R00000001 ER BAA FY18 Exploratory Research in Preventing Nuclear and Radiological Terrorism Broad Agency Announcement No. 70RDND18R00000001 for Domestic Nuclear Detection Office (DNDO) Transformational and Applied Research Directorate (TAR) 1 70RDND18R00000001 ER BAA FY18 Table of Contents 1 Introduction ..............................................................................................................................4 1.1 Background ......................................................................................................................5 1.2 Grand Challenges & Technology Portfolios ....................................................................6 1.3 Strategic Approach...........................................................................................................8 1.4 Scope and Funding ...........................................................................................................8 2 Exploratory Research Topics ...................................................................................................9 2.1 RTA-01: Mobile Active Interrogation Using Neutrons (MAIN) ....................................9 2.2 RTA-02: Radiation Isotope Identification Device (RIID) Based on Thallium Bromide......................................................................................................................................11 2.3 RTA-03: Nuclear Detection through Centralized Data Analytics .................................14 3 Management Approach ..........................................................................................................16 -
Typeset MMIX Programs with TEX Udo Wermuth Abstract a TEX Macro
TUGboat, Volume 35 (2014), No. 3 297 Typeset MMIX programs with TEX Example: In section 9 the lines \See also sec- tion 10." and \This code is used in section 24." are given. Udo Wermuth No such line appears in section 10 as it only ex- tends the replacement code of section 9. (Note that Abstract section 10 has in its headline the number 9.) In section 24 the reference to section 9 stands for all of ATEX macro package is presented as a literate pro- the eight code lines stated in sections 9 and 10. gram. It can be included in programs written in the If a section is not used in any other section then languages MMIX or MMIXAL without affecting the it is a root and during the extraction of the code a assembler. Such an instrumented file can be pro- file is created that has the name of the root. This file cessed by TEX to get nicely formatted output. Only collects all the code in the sequence of the referenced a new first line and a new last line must be entered. sections from the code part. The collection process And for each end-of-line comment a flag is set to for all root sections is called tangle. A second pro- indicate that the comment is written in TEX. cess is called weave. It outputs the documentation and the code parts as a TEX document. How to read the following program Example: The following program has only one The text that starts in the next chapter is a literate root that is defined in section 4 with the headline program [2, 1] written in a style similar to noweb [7]. -
Accessibility Checklists
Accessibility Checklists www.aub.edu.lb/it May 2020 Contact Person Maha Zouwayhed Office of Information Technology American University of Beirut [email protected] | +961-1-350-000 ext. 2082 Beirut PO Box 11-0236, Riad El Solh 1107 2020, Beirut, Lebanon | Tel: +961-1-350-000 | New York 3 Dag Hammarskjold Plaza, 8th Floor | New York, NY 10017–2303, USA | Tel: +1-212-583-7600 | Fax: +1-212-583-7651 1 ACCESSIBILITY CHECKLISTS Role Name & Role Date Compilation Farah Eid – IT Business Development Assistant 13-May-2020 Review Maha Zouwayhed -IT Business Development Manager 14-May-2020 Review Yousif Asfour - CIO (Chief Information Officer) 19-May-2020 Review Walid El-Khazen – Assistant CIO 21-May-2020 Review Ali Zaiter – Senior Software Engineer and Analyst 21-May-2020 Review Fadi Khoury- Manager, Software Development 21-May-2020 Review Rami Farran – Director, It Academic Service 19-May-2020 Review Rana Al Ghazzi – Instructional Designer 19-May-2020 2 ACCESSIBILITY CHECKLISTS Table of Contents Purpose...................................................................................................................................................................... 4 Introduction ............................................................................................................................................................... 5 Developers Checklist ............................................................................................................................................... 6 Designers Checklist ................................................................................................................................................ -
The Arabi System — TEX Writes in Arabic and Farsi
The Arabi system | ] ¨r` [ A\ TEX writes in Arabic and Farsi Youssef Jabri Ecole´ Nationale des Sciences Appliqu´ees, Oujda, Morocco yjabri (at) ensa dot univ-oujda dot ac dot ma Abstract In this paper, we will present a newly arrived package on CTAN that provides Arabic script support for TEX without the need for an external pre-processor. The Arabi package adds one of the last major multilingual typesetting capabilities to Babel by adding support for the Arabic ¨r and Farsi ¨FCA languages. Other languages using the Arabic script should also be more or less easily imple- mentable. Arabi comes with many good quality free fonts, Arabic and Farsi, and may also use commercial fonts. It supports many 8-bit input encodings (namely, CP-1256, ISO-8859-6 and Unicode UTF-8) and can typeset classical Arabic poetry. The package is distributed under the LATEX Project Public License (LPPL), and has the LPPL maintenance status \author-maintained". It can be used freely (including commercially) to produce beautiful texts that mix Arabic, Farsi and Latin (or other) characters. Pl Y ¾Abn Tn ®¤ Tr` ¤r Am`tF TAk t§ A\ ¨r` TEC .¤r fOt TEX > < A\ Am`tFA d¤ dnts ¨ n A\ (¨FCA ¤ ¨r)tl Am`tF TAk S ¨r` TEC , T¤rm rb Cdq tmt§¤ ¯m ¢k zymt§ A\n @h , T§db @n¤ Y At§ ¯ ¢ Y TAR . AARn £EA A \` Am`tF® A ¢± ¾AO ¾AA ¨r` dq§ . Tmlk ¨ ¤r AkJ d§dt ¨CA A` © ¨ ¨t ªW d Am`tF ¢nkm§ Am Am`tF¯ r ªW Tmm ¯¤ ¨A ¨r` , A\n TbsnA A w¡ Am . -
A Systematic Study of Groebner Basis Methods
A Systematic Study of Gr¨obner Basis Methods Vom Fachbereich Informatik der Technischen Universit¨at Kaiserslautern genehmigte Habilitationsschrift von Dr. Birgit Reinert Datum der Einreichung: 6. Januar 2003 Datum des wissenschaftlichen Vortrags: 9. Februar 2004 arXiv:0903.2462v2 [math.RA] 29 Mar 2009 Dekan: Prof. Dr. Hans Hagen Habilitationskommission: Vorsitzender: Prof. Dr. Otto Mayer Berichterstatter: Prof. Dr. Klaus E. Madlener Prof. Dr. Teo Mora Prof. Dr. Volker Weispfenning Vorwort Die vorliegende Arbeit ist die Quintessenz meiner Ideen und Erfahrungen, die ich in den letzten Jahren bei meiner Forschung auf dem Gebiet der Gr¨obnerbasen gemacht habe. Meine geistige Heimat war dabei die Arbeitsgruppe von Profes- sor Klaus Madlener an der Technischen Universit¨at Kaiserslautern. Hier habe ich bereits im Studium Bekanntschaft mit der Theorie der Gr¨obnerbasen gemacht und mich w¨ahrend meiner Promotion mit dem Spezialfall dieser Theorie f¨ur Monoid- und Gruppenringe besch¨aftigt. Nach der Promotion konnte ich im Rahmen eines DFG-Forschungsstipendiums zus¨atzlich Problemstellungen und Denkweisen an- derer Arbeitsgruppen kennenlernen - die Arbeitsgruppe von Professor Joachim Neub¨user in Aachen und die Arbeitsgruppe von Professor Theo Mora in Genua. Meine Aufenthalte in diesen Arbeitsgruppen haben meinen Blickwinkel f¨ur weit- ergehende Fragestellungen erweitert. An dieser Stelle m¨ochte ich mich bei allen jenen bedanken, die mich in dieser Zeit begleitet haben und so zum Entstehen und Gelingen dieser Arbeit beigetragen haben. Mein besonderer Dank gilt meinem akademischen Lehrer Professor Klaus Madlener, der meine akademische Ausbildung schon seit dem Grundstudium be- gleitet und meine Denk- und Arbeitsweise wesentlich gepr¨agt hat. Durch ihn habe ich gelernt, mich intensiv mit diesem Thema zu besch¨aftigen und mich dabei nie auf nur einen Blickwinkel zu beschr¨anken. -
Fundamental Theorems in Mathematics
SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL Abstract. An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 243 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful and whether it could serve as a guide [6] without leading to panic. The order is not a ranking but ordered along a time-line when things were writ- ten down. Since [556] stated “a mathematical theorem only becomes beautiful if presented as a crown jewel within a context" we try sometimes to give some context. Of course, any such list of theorems is a matter of personal preferences, taste and limitations. The num- ber of theorems is arbitrary, the initial obvious goal was 42 but that number got eventually surpassed as it is hard to stop, once started. As a compensation, there are 42 “tweetable" theorems with included proofs. More comments on the choice of the theorems is included in an epilogue. For literature on general mathematics, see [193, 189, 29, 235, 254, 619, 412, 138], for history [217, 625, 376, 73, 46, 208, 379, 365, 690, 113, 618, 79, 259, 341], for popular, beautiful or elegant things [12, 529, 201, 182, 17, 672, 673, 44, 204, 190, 245, 446, 616, 303, 201, 2, 127, 146, 128, 502, 261, 172]. For comprehensive overviews in large parts of math- ematics, [74, 165, 166, 51, 593] or predictions on developments [47]. For reflections about mathematics in general [145, 455, 45, 306, 439, 99, 561]. Encyclopedic source examples are [188, 705, 670, 102, 192, 152, 221, 191, 111, 635]. -
TUGBOAT Volume 32, Number 1 / 2011
TUGBOAT Volume 32, Number 1 / 2011 General Delivery 3 From the president / Karl Berry 4 Editorial comments / Barbara Beeton Opus 100; BBVA award for Don Knuth; Short takes; Mimi 6 Mimi Burbank / Jackie Damrau 7 Missing Mimi / Christina Thiele 9 16 years of ConTEXt / Hans Hagen 17 TUGboat’s 100 issues — Basic statistics and random gleanings / David Walden and Karl Berry 23 TUGboat online / Karl Berry and David Walden 27 TEX consulting for fun and profit / Boris Veytsman Resources 30 Which way to the forum? / Jim Hefferon Electronic Documents 32 LATEX at Distributed Proofreaders and the electronic preservation of mathematical literature at Project Gutenberg / Andrew Hwang Fonts 39 Introducing the PT Sans and PT Serif typefaces / Pavel Far´aˇr 43 Handling math: A retrospective / Hans Hagen Typography 47 The rules for long s / Andrew West Software & Tools 56 Installing TEX Live 2010 on Ubuntu / Enrico Gregorio 62 tlcontrib.metatex.org: A complement to TEX Live / Taco Hoekwater 68 LuaTEX: What it takes to make a paragraph / Paul Isambert 77 Luna — my side of the moon / Paweł Jackowski A L TEX 83 Reflections on the history of the LATEX Project Public License (LPPL)— A software license for LATEX and more / Frank Mittelbach 95 siunitx: A comprehensive (SI) units package / Joseph Wright 99 Glisterings: Framing, new frames / Peter Wilson 104 Some misunderstood or unknown LATEX2ε tricks III / Luca Merciadri A L TEX 3 108 LATEX3 news, issue 5 / LATEX Project Team Book Reviews 109 Book review: Typesetting tables with LATEX / Boris Veytsman Hints & Tricks -
Farsitex and the Iranian TEX Community
FarsiTEX and the Iranian TEX Community Behdad Esfahbod Computing Center Sharif University of Technology Azadi Avenue Tehran, Iran [email protected] http://behdad.org/ Roozbeh Pournader Computing Center Sharif University of Technology Azadi Avenue Tehran, Iran [email protected] http://sina.sharif.edu/~roozbeh/ Abstract FarsiTEX, a localized version of LATEX, is a bilingual Persian/English typesetting package, meeting the minimum requirements of Persian mathematical and tech- nical typography. This paper will describe FarsiTEX, together with its history, future and technicalities, its user community, and the reasons behind its success in Iran, amid its various usage and interoperability problems. It will also draw a general picture of the TEX community in Iran, and tries to describe why the community is still far from achieving its basic typographical needs. Introduction version 3.2 (Unicode Editorial Committee, 2002), lists a total of 139 letters in the script, which are The Persian language, in its contemporary form, is derivatives of about 28 basic Arabic letters. a language spoken natively in Iran, Afghanistan, The Persian typography, influenced by major and Tajikistan. The local forms are known as calligraphic practices of the pre-printing era, is ac- Farsi, Dari, and Tajiki respectively. They all use tually based on the famous Naskh style, which more the same basic vocabulary and grammar, but there than 99% of contemporary texts published in it. The are differences in both pronunciations and modern alternate style, Nastaliq, a little harder to read but vocabulary. In this paper, we will focus on the form considered very beautiful by the general public, and used in Iran, which is the official language of the widely known as the hardest commonly used script country. -
Recursion Theory Notes, Fall 2011 0.1 Introduction
Recursion Theory Notes, Fall 2011 Lecturer: Lou van den Dries 0.1 Introduction Recursion theory (or: theory of computability) is a branch of mathematical logic studying the notion of computability from a rather theoretical point of view. This includes giving a lot of attention to what is not computable, or what is computable relative to any given, not necessarily computable, function. The subject is interesting on philosophical-scientific grounds because of the Church- Turing Thesis and its role in computer science, and because of the intriguing concept of Kolmogorov complexity. This course tries to keep touch with how recursion theory actually impacts mathematics and computer science. This impact is small, but it does exist. Accordingly, the first chapter of the course covers the basics: primitive recur- sion, partial recursive functions and the Church-Turing Thesis, arithmetization and the theorems of Kleene, the halting problem and Rice's theorem, recur- sively enumerable sets, selections and reductions, recursive inseparability, and index systems. (Turing machines are briefly discussed, but the arithmetization is based on a numerical coding of combinators.) The second chapter is devoted to the remarkable negative solution (but with positive aspects) of Hilbert's 10th Problem. This uses only the most basic notions of recursion theory, plus some elementary number theory that is worth knowing in any case; the coding aspects of natural numbers are combined here ingeniously with the arithmetic of the semiring of natural numbers. The last chapter is on Kolmogorov complexity, where concepts of recursion theory are used to define and study notions of randomness and information content.