DOCSLIB.ORG

Appendix A: References and Suggested Reading

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Appendix A: References and Suggested Reading Chapter 1: Professor’s Son Leena Ellonen (ed.): Suomen professorit, Finlands professorer 1640–2007 (Pro- fessors of Finland 1640–2007). Professoriliitto/Gummerus, Jyväskylä 2008. Filosofia.fi – Portti filosofiaan (Gate to philosophy): Salomaa, Jalmari Edvard (Mikko Salmela, ed.), 2014. Helsingin Sanomat 6th December 1944. Helsingin Sanomat 6th September 1960. Kaarlo Hänninen: Kansakoulun maantieto ja kotiseutuoppi yksiopettajaisia kouluja varten (Local geography and history for one-teacher elementary schools), 4th edition. Valistus, Helsinki 1929. Eino Kaila: On the Method of Philosophy – Extracts from a Statement to the Section of History and Philology at the University of Helsinki (1930). Analytic Philosophy in Finland (Leila Haaparanta, Ilkka Niiniluoto, eds.). Rodopi B.V., New York 2003, 69–77. Kuka kukin on – Who’s Who in Finland 2003. Otava, Keuruu 2002. Reino Leimu: Pentti Antero Salomaa À Muistopuhe 10.5.1976 (Commemorative speech). Esitelmät ja pöytäkirjat, Suomalainen Tiedeakatemia (Lectures and records, Finnish Academy of Science and Letters), 1976, 59–63. Vilho Lukkarinen: Suomen lotat – Lotta Svärd -järjestön historia (Members of the women’s auxiliary services in Finland – History of the Lotta Svärd organization). Suomen Naisten Huoltosäätiö /WSOY, Porvoo 1981. Rolf Nevanlinna: Muisteltua (Memoirs). Otava, Keuruu 1976. Valtteri Niemi: Interview, 20th October 2016. Arto Salomaa: Nuoruusvuodet – Meine jungen Tage. Photo album, Ifolor 2014. Arto Salomaa: Interviews, 2nd September 2015 and 22nd October 2015. J. E. Salomaa: Eräs lapsuus ja nuoruus (A childhood and youth). WSOY, Porvoo 1954. Kaarina Salomaa: Interview, 25th October 2016. © Springer Nature Switzerland AG 2019 277 J. Paakki, Arto Salomaa: Mathematician, Computer Scientist, and Teacher, https://doi.org/10.1007/978-3-030-16049-4 278 Appendix A: References and Suggested Reading Chapter 2: Child and Youngster in Turku, Finland Helsingin Sanomat 6th June 1934 and 7th June 1934. Valtteri Niemi: Interview, 20th October 2016. Arto Salomaa: Nuoruusvuodet – Meine jungen Tage. Photo album, Ifolor 2014. Arto Salomaa: Interview, 22nd October 2015. Radomir S. Stanković, Jaakko T. Astola (eds.): Reprints from the Early Days of Information Sciences – Interview with Arto Salomaa. TICSP series # 52, Tampere International Center for Signal Processing, Tampere 2009. Chapter 3: Master and Doctor of Science Cristian S. Calude: A Dialogue on Theoretical Computer Science with Professor Arto Salomaa. Bulletin of EATCS 96, 2008, 32–42. Helsingin Sanomat 15th December 1954. Helsingin Sanomat 4th June 1955. Helsingin Sanomat 13th July 1956 and 14th July 1956. Helsingin Sanomat 4th January 1959 and 5th January 1959. Helsingin Sanomat 21st March 1959 and 22nd March 1959. Heikki Lammi: Lukuteoriaa (Number theory), blog 45/14. http://www.ylasatakunta. fi/blogit/30-heikki-lammi/798-lukuteoriaa-blogi-45-14 Olli: Korsia polulta (Straws from the path). Uusi Suomi 17th July 1960, p. 2. Arto Salomaa: Nuoruusvuodet – Meine jungen Tage. Photo album, Ifolor 2014. Arto Salomaa: Interview, 16th December 2015. Kaarina Salomaa: Interview, 25th October 2016. Radomir S. Stanković, Jaakko T. Astola (eds.): Reprints from the Early Days of Information Sciences – Interview with Arto Salomaa. TICSP series # 52, Tampere International Center for Signal Processing, Tampere 2009. Chapter 4: Master of Many-Valued Logic Helsingin Sanomat 4th February 1962. Heikki Lammi: Lukuteoriaa (Number theory), blog 45/14. http://www.ylasatakunta. fi/blogit/30-heikki-lammi/798-lukuteoriaa-blogi-45-14 Arto Salomaa: On Many-Valued Systems of Logic. Ajatus 22, 1959, 115–159. Arto Salomaa: A Theorem Concerning the Composition of Functions of Several Variables Ranging Over a Finite Set. The Journal of Symbolic Logic 25, 3, 1960, 203–208. Arto Salomaa: Some Completeness Criteria for Sets of Functions Over a Finite Domain, I. Annales Universitatis Turkuensis – Turun yliopiston julkaisuja, series A I, no. 53, Turku 1962. Arto Salomaa: Some Completeness Criteria for Sets of Functions Over a Finite Domain, II. Annales Universitatis Turkuensis – Turun yliopiston julkaisuja, series A I, no. 63, Turku 1963. Arto Salomaa: Events and Languages. People & Ideas in Theoretical Computer Science (Cristian S. Calude, ed.). Springer, Singapore 1999, 253–273. Appendix A: References and Suggested Reading 279 Arto Salomaa: Interviews, 16th December 2015 and 19th October 2017. Radomir S. Stanković, Jaakko T. Astola (eds.): Reprints from the Early Days of Information Sciences – On the Contributions of Arto Salomaa to Multiple-Valued Logic. TICSP series # 50, Tampere International Center for Signal Processing, Tampere 2009. Radomir S. Stanković, Jaakko Astola: Contributions of Arto Salomaa to Multiple- Valued Logic. Journal of Multiple-Valued Logic and Soft Computing (Special Issue Dedicated to Professor Arto Salomaa) 24, 1–4, 2015, 1–19. Chapter 5: Prehistory of Automata and Formal Languages Noam Chomsky: On Certain Formal Properties of Grammars. Information and Control 2, 2, 1959, 137–167. Seymour Ginsburg: Methods for Specifying Families of Formal Languages – Past- Present-Future. In: Ronald V. Book (ed.): Formal Language Theory – Perspec- tives and Open Problems. Academic Press, New York 1980, 1–22. Sheila A. Greibach: Formal Languages: Origins and Directions. Annals of the History of Computing 3, 1, 1981, 14–41. Donald E. Knuth: On the Translation of Languages from Left to Right. Information and Control 8, 6, 1965, 607–639. K. Kutti: On a Graphical Representation of the Operating Regime of Circuits. In: Edward F. Moore (ed.): Sequential Machines – Selected Papers. Addison- Wesley, Reading 1964, 228–235. (Translation from Russian, 1928) Robert McNaughton, Hisao Yamada: Regular Expressions and State Graphs for Automata. IRE Transactions on Electronic Computers EC-9, 1, 1960, 39–47. Michael O. Rabin, Dana Scott: Finite Automata and Their Decision Problems. IBM Journal of Research and Development 3, 2, 1959, 114–125. Arto Salomaa: Interview, 19th October 2017. Claude E. Shannon, John McCarthy (eds.): Automata Studies. Annals of Mathemat- ical Studies, number 34. Princeton University Press, Princeton 1956. Chapter 6: Father of Formal Languages Michael A. Arbib: Book Review: Theory of Automata – Arto Salomaa, (Oxford, England: Pergamon, 1969, 263 pp). IEEE Transactions on Information Theory 16, 5, 1970, 652–653. Michael A. Arbib: Review – Theory of automata. By Arto Salomaa. Pergamon Press, Oxford, 1969. xii + 263 pp. Quarterly of Applied Mathematics XXIX, 3, October 1971, 456–457. John A. Brzozowski: Review – Salomaa, Arto. Two complete axiom systems for the algebra of regular events. J. ACM 13, 1 (Jan. 1966), 158–169. Computing Reviews 7, 3, 1966, p. 264. Noam Chomsky: Three Models for the Description of Language. IRE Transactions on Information Theory IT-2, 3, 113–124. Noam Chomsky, George A. Miller: Finite State Languages. Information and Con- trol 1, 2, 1958, 91–112. 280 Appendix A: References and Suggested Reading Noam Chomsky, Marcel-Paul Schützenberger: The Algebraic Theory of Context- Free Languages. In: P. Braffort, D. Hirschberg (eds.): Computer Programming and Formal Systems. North-Holland, Amsterdam 1963, 118–161. Lawrence C. Eggan: Transition Graphs and the Star-Height of Regular Events. Michigan Mathematical Journal 10, 4, 1963, 385–397. Eugene Garfield: The 100 Most-Cited Books in the CompuMath Citation Index, 1976–1980. Essays of an Information Scientist 7, 34, 1984, 264–269. http:// www.garfield.library.upenn.edu/essays/v7p264y1984.pdf Seymour Ginsburg, Sheila Greibach: Abstract Families of Languages. In: Confer- ence Record of 1967 Eighth Annual Symposium on Switching and Automata Theory, University of Texas. IEEE 1967, 128–139. Michael A. Harrison: Book Reviews: Theory of Automata. Arto Salomaa. Pergamon, New York, 1969. xii, 264 pp., illus. International Series of Monographs in Pure and Applied Mathematics, vol. 100. Theories of Abstract Automata. Michael A. Arbib. Prentice-Hall, Englewood Cliffs, N.J., 1969. xviii, 414 pp., illus. Prentice-Hall Series in Automatic Computation. Science 170, 3953, 2 October 1970, 55–56. Juris Hartmanis: Book Review – Formal Languages. By Arto Salomaa. Academic Press, New York 1973. xiii + 322 pp. SIAM Review 17, 1, 1975, 179–180. Helsingin Sanomat 30th April 1970. Helsingin Sanomat 27th October 1984. Wolfgang Händler: Buchbesprechung – Theory of Automata. Von A. Salomaa. Mit 25 Abb., XII, 263 S. Oxford-London-Edinburgh-New York-Toronto-Sydney- Paris-Braunschweig; Pergamon Press. 1969. Computing 9, 1, 1972, 85–86. Kirsti Kähärä: Interview, 23th October 2016. Michael O. Rabin: Probabilistic Automata. Information and Control 6, 3, 1963, 230–245. Grzegorz Rozenberg: Interview (email), 26th November 2016. Arto Salomaa: Automaattien teoriasta (On the theory of automata). Arkhimedes 2, 1965, 7–20. Arto Salomaa: Two Complete Axiom Systems for the Algebra of Regular Events. Journal of the Association for Computing Machinery 13, 1, 1966, 158–169. Arto Salomaa: On m-Adic Probabilistic Automata. Information and Control 10, 2, 1967, 215–219. Arto Salomaa: Matematiikka ja tietokone (Mathematics and the Computer). Arkhimedes 2, 1968, 5–9. Arto Salomaa: On the Index of a Context-Free Grammar and Language. Information and Control 14, 5, 1969, 474–477. Arto Salomaa: Theory of Automata. International Series of Monographs in Pure and Applied Mathematics, volume 100, Pergamon Press, Hungary 1969. Appendix A: References and Suggested Reading 281 Arto Salomaa: Review – Michael
Recommended publications
  • 4.Murtomäki 2017.10192 Words

    4.Murtomäki 2017.10192 Words

    Sibelius in the Context of the Finnish-German History Veijo Murtomäki Introduction The life and career of a composer cannot be considered as an isolated case without taking into account the wider context. The history of ideas and ideologies is always part of any serious enquiry into an artist’s personal history. Therefore we must bear in mind at least four points when considering the actions of artist and his or her country. Firstly, as the eminent Finnish historian Matti Klinge has observed, "the biggest challenge for understanding history is trying to situate oneself in the preconditions of the time-period under scrutiny while remembering that it did not know what the posterity knows."[1] Writing history is not primarily a task whereby the historian provides lines for actors to speak, but rather is an attempt to understand and explain why something happened, and to construct a context including all of the possible factors involved in a certain historical process. Secondly, supporting (or not opposing) an ideology prevailing at a certain time does not mean that the supporter (or non-opponent) is committing a crime. We could easily condemn half of the European intellectuals for supporting Fascism, Nazism, Communism or Maoism, or just for having become too easily attracted by these – in their mind – fascinating, visionary ideologies to shape European or world history. Thirdly, history has always been written by the winners – and thus, historiography tends to be distorted by exaggerating the evil of the enemy and the goodness of the victor. A moral verdict must be reached when we are dealing with absolute evil, but it is rare to find exclusively good or bad persons or civilizations; therefore history is rarely an issue of black and white.
  • The Origins of the Propagation of Smallness Property and Its Utility in Controllability Problems

    The Origins of the Propagation of Smallness Property and Its Utility in Controllability Problems

    The Origins of the Propagation of Smallness Property and its Utility in Controllability Problems. Jone Apraiz University of the Basque Country, Spain Seminario control en tiempos de crisis May 4th 2020 Jone Apraiz (UPV/EHU) Control en tiempos de crisis 04/05/2020 1 / 37 Index 1 Definition of the propagation of smallness property 2 Origin of the propagation of smallness property Harmonic measure Two-constants and Hamard three-circles theorems Phragmén-Lindelöf theorem and Hadamard three-lines lemma 3 Applications to Control Theory Higher dimensions: three-balls and three-regions theorems Null-control for some parabolic problems Jone Apraiz (UPV/EHU) Control en tiempos de crisis 04/05/2020 2 / 37 Definition of the propagation of smallness property Index 1 Definition of the propagation of smallness property 2 Origin of the propagation of smallness property Harmonic measure Two-constants and Hamard three-circles theorems Phragmén-Lindelöf theorem and Hadamard three-lines lemma 3 Applications to Control Theory Higher dimensions: three-balls and three-regions theorems Null-control for some parabolic problems Jone Apraiz (UPV/EHU) Control en tiempos de crisis 04/05/2020 3 / 37 Definition of the propagation of smallness property Definition of the propagation of smallness property Definition (Propagation of smallness) n Given three subsets of R , E, B1 and B2, verifying E ⊂ B1 ⊂ B2 and a class of functions A ⊂ C(B2), we say that E is a propagation of smallness set for A if, for any u 2 A, there exists α = α(E; B1; B2) 2 (0; 1) such that jjujj ≤ jjujjα jjujj1−α : 1;B1 1;E 1;B2 The “information of the function” on the smaller domain is propagating or affecting over bigger domains in some sense.
  • Handbook of Formal Languages

    Handbook of Formal Languages

    Handbook of Formal Languages von Grzegorz Rozenberg, Arto Salomaa 1. Auflage Handbook of Formal Languages – Rozenberg / Salomaa schnell und portofrei erhältlich bei beck-shop.de DIE FACHBUCHHANDLUNG Springer 1997 Verlag C.H. Beck im Internet: www.beck.de ISBN 978 3 540 60420 4 Contents of Volume 1 Chapter 1. Formal Languages: an Introduction and a Synopsis Alexandru Mateescu and Arto Salomaa ............................ 1 1. Languages, formal and natural ................................. 1 1.1 Historical linguistics ...................................... 3 1.2 Language and evolution ................................... 7 1.3 Language and neural structures ............................ 9 2. Glimpses of mathematical language theory ...................... 9 2.1 Words and languages ..................................... 10 2.2 About commuting ........................................ 12 2.3 About stars ............................................. 15 2.4 Avoiding scattered subwords .............................. 19 2.5 About scattered residuals ................................. 24 3. Formal languages: a telegraphic survey ......................... 27 3.1 Language and grammar. Chomsky hierarchy ................. 27 3.2 Regular and context-free languages ......................... 31 3.3 L Systems............................................... 33 3.4 More powerful grammars and grammar systems .............. 35 3.5 Books on formal languages ................................ 36 References ..................................................... 38 Chapter
  • Ucla Computer Science Depart "Tment

    Ucla Computer Science Depart "Tment

    THE UCLA COMPUTER SCIENCE DEPART"TMENT QUARTERLY THE DEPARTMENT AND ITS PEOPLE FALL 1987/WINTER 1988 VOL. 16 NO. 1 SCHOOL OF ENGINEERING AND APPLIED SCIENCE COMPUTER SCIENCE DEPARTMENT OFFICERS Dr. Gerald Estrin, Chair Dr. Jack W. Carlyle, Vice Chair, Planning & Resources Dr. Sheila Greibach, Vice Chair, Graduate Affairs Dr. Lawrence McNamee, Vice Chair, Undergraduate Affairs Mrs. Arlene C. Weber, Management Services Officer Room 3713 Boelter Hall QUARTERLY STAFF Dr. Sheila Greibach, Editor Ms. Marta Cervantes, Coordinator Material in this publication may not be reproduced without written permission of the Computer Science Department. Subscriptions to this publication are available at $20.00/year (three issues) by contacting Ms. Brenda Ramsey, UCLA Computer Science Department, 3713 Boelter Hall, Los Angeles, CA 90024-1596. THE UCLA COMPUTER SCIENCE DEPARTMENT QUARTERLY The Computer Science Department And Its People Fall Quarter 1987/Winter Quarter 1988 Vol. 16, No. 1 SCHOOL OF ENGINEERING AND APPLIED SCIENCE UNIVERSITY OF CALIFORNIA, LOS ANGELES Fall-Winfer CSD Quarterly CONTENTS COMPUTER SCIENCE AT UCLA AND COMPUTER SCIENCE IN THE UNITED STATES GeraldEstrin, Chair...................................................................................................... I THE UNIVERSITY CONTEXT .............................................................................................. 13 THE UCLA COMPUTER SCIENCE DEPARTMENT The Faculty A rane nf;ntraract Biographies .............................................................................................................................
  • A Complete Bibliography of Publications in the Journal of Computer and System Sciences

    A Complete Bibliography of Publications in the Journal of Computer and System Sciences

    A Complete Bibliography of Publications in the Journal of Computer and System Sciences Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 26 May 2021 Version 1.04 Title word cross-reference (s; t) [1475]. 0(n) [1160]. 1 [270]. 1 − L [1371, 924]. 12n2 [450]. 2 [3525, 3184, 2191, 1048, 3402, 1500, 3364, 2034, 2993, 834, 2473, 3101]. f2; 3g [2843]. #09111 [1814]. #AM01053M 2pn 1=3 − 2 O(n ) [1862, 1877, 1904]. #better 5X8 els [1856]. 2 [2353]. 2 [445]. 2 [1977]. 3 #better 5X8 els.pdf [1856]. #BIS [3184]. [1920, 2242, 2827, 2374, 1961, 2825, 3240, · #BIS-hardness #CSP 1071, 1133]. 43 [3620]. 4 Log2N [655]. 5=4 [3184]. ∗ 0 #econdirectM [1612]. 8 [2998]. =? [1433]. [858]. [2696, 2908, 2500, 3508]. 1 ∗ NP [1893]. #HA03022M [1860, 1875]. [1625, 3418, 1085]. [1523]. [3194]. NP[O(log n)] p ⊆ PH #HA05062N [1876]. #HA05062O [2235]. [995]. 2 [2235]. [1849, 1861]. #HA06043M [1501]. 2 [3418]. H [1565]. a [426, 289]. [1892, 1871, 1889]. #HA08111M [1846]. A[P (x); 2x; x + 1] [500]. Ax = λBx [377]. b · #P [1195, 3598, 1261, 1264]. [3253]. β [3444]. [3418]. d #praise 5X8 els.pdf [1832]. [2527, 1362, 3256, 3563]. δ [3553]. `p [2154]. #sciencejobs N [1802]. [1551, 2617, 1864, 1693]. g [3312]. h [1019]. K [1320, 2756, 191, 3494, 1300, 1546, 3286, #P [1373].
  • Separation of Test-Free Propositional Dynamic Logics Over Context-Free Languages

    Separation of Test-Free Propositional Dynamic Logics Over Context-Free Languages

    Separation of Test-Free Propositional Dynamic Logics over Context-Free Languages Markus Latte∗ Department of Computer Science University of Munich, Germany For a class L of languages let PDL[L] be an extension of Propositional Dynamic Logic which allows programs to be in a language of L rather than just to be regular. If L contains a non-regular language, PDL[L] can express non-regular properties, in contrast to pure PDL. For regular, visibly pushdown and deterministic context-free languages, the separation of the respective PDLs can be proven by automata-theoretic techniques. However, these techniques introduce non-determinism on the automata side. As non-determinism is also the difference between DCFL and CFL, these techniques seem to be inappropriate to separate PDL[DCFL] from PDL[CFL]. Nevertheless, this separation is shown but for programs without test operators. 1 Introduction Propositional Dynamic Logic (PDL)[9] is a logical formalism to specify and verify programs [12, 16, 11]. These tasks rely on the satisfiability and model-checking problems. Applications in the field are supported by their relatively low complexities: EXPTIME- and PTIME-complete, respectively [9]. Formulas in PDL are interpreted over labeled transition systems. For instance, the formula hpij means that after executing the program p the formula j shall hold. In this context, programs and formulas are defined mutually inductively. This mixture allows programs to test whether or not a formula holds at the current state. Additionally, programs are required to be regular over the set of atomic programs and test operations. For instance, the program while (b) do p; can be rendered as h(b?; p)∗;:bij to ensure that the loop is finite and that j holds when the loop terminates [9].
  • The EATCS Award 2020 Laudatio for Toniann (Toni)Pitassi

    The EATCS Award 2020 Laudatio for Toniann (Toni)Pitassi

    The EATCS Award 2020 Laudatio for Toniann (Toni)Pitassi The EATCS Award 2021 is awarded to Toniann (Toni) Pitassi University of Toronto, as the recipient of the 2021 EATCS Award for her fun- damental and wide-ranging contributions to computational complexity, which in- cludes proving long-standing open problems, introducing new fundamental mod- els, developing novel techniques and establishing new connections between dif- ferent areas. Her work is very broad and has relevance in computational learning and optimisation, verification and SAT-solving, circuit complexity and communi- cation complexity, and their applications. The first notable contribution by Toni Pitassi was to develop lifting theorems: a way to transfer lower bounds from the (much simpler) decision tree model for any function f, to a lower bound, the much harder communication complexity model, for a simply related (2-party) function f’. This has completely transformed our state of knowledge regarding two fundamental computational models, query algorithms (decision trees) and communication complexity, as well as their rela- tionship and applicability to other areas of theoretical computer science. These powerful and flexible techniques resolved numerous open problems (e.g., the su- per quadratic gap between probabilistic and quantum communication complex- ity), many of which were central challenges for decades. Toni Pitassi has also had a remarkable impact in proof complexity. She in- troduced the fundamental algebraic Nullstellensatz and Ideal proof systems, and the geometric Stabbing Planes system. She gave the first nontrivial lower bounds on such long-standing problems as weak pigeon-hole principle and models like constant-depth Frege proof systems. She has developed new proof techniques for virtually all proof systems, and new SAT algorithms.
  • Bibliography

    Bibliography

    Bibliography [57391] ISO/IEC JTC1/SC21 N 5739. Database language SQL, April 1991. [69392] ISO/IEC JTC1/SC21 N 6931. Database language SQL (SQL3), June 1992. [A+76] M. M. Astrahan et al. System R: a relational approach to data management. ACM Trans. on Database Systems, 1(2):97–137, 1976. [AA93] P. Atzeni and V. De Antonellis. Relational Database Theory. Benjamin/Cummings Publishing Co., Menlo Park, CA, 1993. [AABM82] P. Atzeni, G. Ausiello, C. Batini, and M. Moscarini. Inclusion and equivalence between relational database schemata. Theoretical Computer Science, 19:267–285, 1982. [AB86] S. Abiteboul and N. Bidoit. Non first normal form relations: An algebra allowing restructuring. Journal of Computer and System Sciences, 33(3):361–390, 1986. [AB87a] M. Atkinson and P. Buneman. Types and persistence in database programming languages. ACM Computing Surveys, 19(2):105–190, June 1987. [AB87b] P. Atzeni and M. C. De Bernardis. A new basis for the weak instance model. In Proc. ACM Symp. on Principles of Database Systems, pages 79–86, 1987. [AB88] S. Abiteboul and C. Beeri. On the manipulation of complex objects. Technical Report, INRIA and Hebrew University, 1988. (To appear, VLDB Journal.) [AB91] S. Abiteboul and A. Bonner. Objects and views. In Proc. ACM SIGMOD Symp. on the Management of Data, 1991. [ABD+89] M. Atkinson, F. Bancilhon, D. DeWitt, K. Dittrich, D. Maier, and S. Zdonik. The object- oriented database system manifesto. In Proc. of Intl. Conf. on Deductive and Object-Oriented Databases (DOOD), pages 40–57, 1989. [ABGO93] A. Albano, R. Bergamini, G. Ghelli, and R. Orsini.
  • Formal Languages and Logics Lecture Notes

    Formal Languages and Logics Lecture Notes

    Formal Languages and Logics Jacobs University Bremen Herbert Jaeger Course Number 320211 Lecture Notes Version from Oct 18, 2017 1 1. Introduction 1.1 What these lecture notes are and aren't This lecture covers material that is relatively simple, extremely useful, superbly described in a number of textbooks, and taught in almost precisely the same way in hundreds of university courses. It would not make much sense to re-invent the wheel and re-design this lecture to make it different from the standards. Thus I will follow closely the classical textbook of Hopcroft, Motwani, and Ullman for the first part (automata and formal languages) and, somewhat more freely, the book of Schoening in the second half (logics). Both books are available at the IRC. These books are not required reading; the lecture notes that I prepare are a fully self-sustained reference for the course. However, I would recommend to purchase a personal copy of these books all the same for additional and backup reading because these are highly standard reference books that a computer scientist is likely to need again later in her/his professional life, and they are more detailed than this lecture or these lecture notes. There are several sets of course slides and lecture notes available on the Web which are derived from the Hopcroft/Motwani/Ullman book. At http://www- db.stanford.edu/~ullman/ialc/win00/win00.html, you will find lecture notes prepared by Jeffrey Ullman himself. Given the highly standardized nature of the material and the availablity of so many good textbooks and online lecture notes, these lecture notes of mine do not claim originality.
  • Quasiconformal Mappings, from Ptolemy's Geography to the Work Of

    Quasiconformal Mappings, from Ptolemy's Geography to the Work Of

    Quasiconformal mappings, from Ptolemy’s geography to the work of Teichmüller Athanase Papadopoulos To cite this version: Athanase Papadopoulos. Quasiconformal mappings, from Ptolemy’s geography to the work of Teich- müller. 2016. hal-01465998 HAL Id: hal-01465998 https://hal.archives-ouvertes.fr/hal-01465998 Preprint submitted on 13 Feb 2017 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. QUASICONFORMAL MAPPINGS, FROM PTOLEMY'S GEOGRAPHY TO THE WORK OF TEICHMULLER¨ ATHANASE PAPADOPOULOS Les hommes passent, mais les œuvres restent. (Augustin Cauchy, [204] p. 274) Abstract. The origin of quasiconformal mappings, like that of confor- mal mappings, can be traced back to old cartography where the basic problem was the search for mappings from the sphere onto the plane with minimal deviation from conformality, subject to certain conditions which were made precise. In this paper, we survey the development of cartography, highlighting the main ideas that are related to quasicon- formality. Some of these ideas were completely ignored in the previous historical surveys on quasiconformal mappings. We then survey early quasiconformal theory in the works of Gr¨otzsch, Lavrentieff, Ahlfors and Teichm¨uller,which are the 20th-century founders of the theory.
  • New Probabilistic Model of Stochastic Context-Free Grammars in Greibach Normal Form

    New Probabilistic Model of Stochastic Context-Free Grammars in Greibach Normal Form

    New Probabilistic Model of Stochastic Context-Free Grammars in Greibach Normal Form Yevhen Hrubiian Student, group FI-33, Institute of Physics and Technology NTUU “Igor Sikorsky Kyiv Polytechnic Institute” Kyiv, Ukraine [email protected] Імовірнісна Модель Стохастичних Контекстно- Вільних Граматик в Нормальній Формі Грейбах Євген Грубіян Студент групи ФІ-33, Фізико-технічний інститут НТУУ “Киівський політехнічний інститут ім. Ігоря Сікорського” Київ, Україна [email protected] Abstract—In this paper we propose new probabilistic model models of languages were proposed by Claude Shannon to of stochastic context-free grammars in Greibach normal form. describe informational aspects of languages such as entropy but This model might be perspective for future developments and they became very relevant and actual in modern linguistics. N- researching stochastic context-free grammars. gram model is one of the most accurate statistical models of language but the main drawback is that for precious learning Анотація—В роботі запропоновано нову імовірнісну this model for high values of N one needs a huge amount of модель стохастичних контекстно-вільних граматик в texts in different thematic, but unfortunately, even if we have нормальній формі Грейбах. Ця модель може бути got a lot of texts it turns out to be harmful for accurate and перспективною для подальших досліджень стохастичних precise modeling whole language. Because of this reason контекстно–вільних граматик. stochastic context-free grammars were introduced for more Keywords—stochastic context-free grammar; Greibach normal precious description of languages because context-freeness form; hidden Markov models guarantees grammatical pattern of language and probability distributions on grammatical rules approach semantic structure Ключові слова—стохастична контекстно-вільна граматика; of phrases.
  • Continuance and Transience of Lifetime Co-Authorships

    Continuance and Transience of Lifetime Co-Authorships

    Open Archive TOULOUSE Archive Ouverte ( OATAO ) OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. This is an author-deposited version published in : http://oatao.univ-toulouse.fr/ Eprints ID : 13197 To link to this article : doi:10.1007/s11192-014-1426-0 URL : http://dx.doi.org/10.1007/s11192-014-1426-0 To cite this version : Cabanac, Guillaume and Hubert, Gilles and Milard, Béatrice Academic careers in Computer Science: Continuance and transience of lifetime co-authorships. (2015) Scientometrics, vol. 102 (n° 1). pp. 135-150. ISSN 0138-9130 Any correspondance concerning this service should be sent to the repository administrator: [email protected] DOI 10.1007/s11192-014-1426-0 Academic careers in Computer Science: Continuance and transience of lifetime co-authorships Guillaume Cabanac · Gilles Hubert · Béatrice Milard Abstract Scholarly publications reify fruitful collaborations between co-authors. A branch of research in the Science Studies focuses on analyzing the co-authorship networks of established scientists. Such studies tell us about how their collaborations developed through their careers. This paper updates previous work by reporting a transversal and a longitudinal studies spanning the lifelong careers of a cohort of researchers from the DBLP bibliographic database. We mined 3,860 researchers’ publication records to study the evolution patterns of their co-authorships. Two features of co-authors were considered: 1) their expertise, and 2) the history of their partnerships with the sampled researchers. Our findings reveal the ephemeral nature of most collaborations: 70% of the new co-authors were only one-shot partners since they did not appear to collaborate on any further publications.