DOCSLIB.ORG

Olympiads in Informatics

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Olympiads in Informatics ISSN 1822-7732 INTERNATIONAL OLYMPIAD IN INFORMATICS INSTITUTE OF MATHEMATICS AND INFORMATICS INTERNATIONAL FEDERATION FOR INFORMATION PROCESSING OLYMPIADS IN INFORMATICS Volume 3 2009 Selected papers of the International Conference joint with the XXI International Olympiad in Informatics Plovdiv, Bulgaria, August 8–15, 2009 OLYMPIADS IN INFORMATICS ISSN 1822-7732 Editor-in-Chief Valentina Dagiene˙ Institute of Mathematics and Informatics, Lithuania, [email protected] Executive Editor Richard Forster British Informatics Olympiad, UK, [email protected] International Editorial Board Gerald Futschek, Vienna University of Technology, Austria, [email protected] Bruria Haberman, Holon Institute of Technology, Israel, [email protected] Marcin Kubica, Warsaw University, Poland, [email protected] Ville Leppänen, University of Turku, Finland, [email protected].fi Krassimir Manev, Sofia University, Bulgaria, [email protected]fia.bg Fredrik Niemelä, KTH University, Sweden, [email protected] Rein Prank, University of Tartu, Estonia, [email protected] Miguel A. Revila Ramos, University of Valladolid, Spain, [email protected] Peter Taylor, University of Canberra, Australia, [email protected] Troy Vasiga, University of Waterloo, Canada, [email protected] Peter Waker, International Qualification Alliance, Republic of South Africa, [email protected] http://www.mii.lt/olympiads_in_informatics c Institute of Mathematics and Informatics, 2009 Olympiads in Informatics, Volume 3, 2009 2009.06.30. 13 leidyb. apsk. l. Tirazˇas 200 egz. Uzˇsakymas Nr. 1748 Printed by Printing house “Mokslo aidai”, Gosˇtauto 12, 01108 Vilnius, Lithuania Olympiads in Informatics, 2009, Vol. 3 2009 Institute of Mathematics and Informatics, Vilnius Foreword OLYMPIADS IN INFORMATICS is an annual refereed journal that provides an inter- national forum for presenting research in teaching and learning informatics through competition. The journal is substantially connected with the conference held during the International Olympiad in Informatics (IOI). The papers in this volume are being presented during IOI’2009 in Plovdiv, Bulgaria. What a difference 20 years makes In May 1989, when the teams were gathering for the first IOI (also in Bulgaria), the 80486 microprocessor had just been released on the world and Tim Berners-Lee’s “Information Management: A Proposal” was being distributed to CERN’s management. That processor was available at 25 Mhz; the one this introduction is being written on is running at 2.5 Ghz. That proposal was the seed of the World Wide Web, which has become so ubiquitous that access has become a basic utility, along with water and power, in many countries. And what of the IOI? The foundation of the IOI, thanks to the efforts of Professor Blagovest Sendov and the support of UNESCO, saw the emergence of a second phase of international science olympiads. The 50s and 60s saw Mathematics, Physics and Chemisty flourish. It was to be another 20 years before another olympiad, the IOI, came into existence. Since then there has been an explosion of interest, from Astronomy to Earth Sciences, from Biology to Linguistics. The 13 countries who participated in 1989 have grown to around 80. The contest has run every year since its inauguration, has been held in 19 different countries across 5 dif- ferent continents. Contestants from earlier years are now lead delegations. Leaders who come for ‘just one year’ find themselves coming back year after year. The IOI commu- nity – the IOI family – continues to grow, and long may it continue. The contest itself has been polished over the years, but is still fundamentally faithful to the original vision. The number of questions may have changed and their difficulty tuned, but contestants today require the same skills as those 20 years ago. Machines may have hundreds or thousands of times the speed or memory, but it is a testimony to the types of problems set that, with perhaps a little tweak here and there, the challenges from the contest’s history remain a challenge. In a world that demands ‘bigger’ and ‘faster’, the IOI demands ‘smarter’. And what of the wider community? National olympiads have become an established part of the educational system in many countries. You need only read the papers in these proceedings to see how many students we reach and have reached. Some contests are run with governmental support and guid- ance, some independently. In all cases opportunities, which might not otherwise exist, are given to students. Not just to those who know they are interested in informatics, but often at a junior level where such an interest can be inspired. In this year, when the IOI returns to its birthplace, we should think back over the last 20 years. Think of the thousands of students who have been given the wonderful opportunity of attending an IOI, and of the hundreds of thousands (if not more) who have been touched across the world by national endeavours. Think of the teams of volunteers who have given their time and resources to making the contests the success that they are. Organisers who work tirelessly, often for no reward or even recognition, time and time again. Thanks are due to everyone who has contributed to this volume and the IOI con- ference. In particular, we would like to thank Prof. Krassimir Manev and the Bulgarian organisation of this year’s IOI for giving us the opportunity to host the conference. Editors Olympiads in Informatics, 2009, Vol. 3, 3–16 3 © 2009 Institute of Mathematics and Informatics, Vilnius Using Item Response Theory to Rate (not only) Programmers Michal FORIŠEK Department of Informatics, Faculty of Mathematics, Physics and Informatics Comenius University Mlynská dolina, 842 48 Bratislava, Slovakia e-mail: [email protected] Abstract. We show how Item Response Theory (IRT) can be used to define a new type of rating system, one that is especially suitable for programming competitions (and other types of compe- titions where difficulty of competitions varies between rounds). We show some useful theoretical properties of this rating system, including the ability to argue about hardness of past competition tasks, and about the precision of contestants’ skill estimates. We also define an objective method of comparing different rating systems. In the final section of the paper we apply our methods on real competition data. Key words: item response theory, ranking, rating, programming competitions. 1. Overview In this section we provide an overview of topics relevant to this article: – research of scoring and ranking in programming competitions, – research in the area of rating systems, – Item Response Theory. 1.1. Programming Competitions For a few years the International Olympiad in Informatics (IOI) community is con- cerned about the accuracy of the testing, scoring and ranking process. Several publica- tions that research various aspects of this problem include (Cormack, 2006; Cormack et al., 2006; Forišek, 2004; Forišek, 2006; Opmanis, 2006; Van Leeuwen, 2005; Verhoeff, 2006; Yakovenko, 2006). A publication particularly relevant to the topic of this paper is (Kemkes et al., 2006) where Kemkes et al. use Item Response Theory to analyze scoring used at IOI 2005, and in particular the impact of the proportion of “easy” and “hard” test cases on the relevancy of the competition results. Based on the results of the analysis, new scoring methods with better discrimination are suggested. (We would like to note that similar research has recently been conducted for other competitions as well, for example see (Gleason, 2008) for an analysis of two mathemati- cal competitions.) 4 M. Forišek However, we would like to note that while these publications use IRT only passively, as a tool for analysis of tasks only. In parts of this paper, we will use IRT as an active tool – not only to rate tasks and participants, but also to make estimates and predictions. 1.2. Rating Systems The idea of a rating system has been studied for several decades. Competitiveness is a part of our human nature, and when there is competition, there is the need to rate and/or rank the competitors. Also, the need for rating is often encountered in educational systems, and many other areas. In this context, rating means assigning a vector of properties to each subject (i.e., contestant), and ranking means arranging the subjects into a linear order according to some set of criteria. Usually, ranking is the goal, and rating represents possible means to achieve this goal. The first rating systems were reward-based: A good performance was rewarded by granting the subject rating points. The main advantage of these rating systems was their simplicity. Due to this reason, such rating systems are still used in many popular sports, such as tennis and Formula 1. These systems are usually designed so that their discrimination ability is highest among the top subjects, and rapidly decreases as the skill of the subjects decreases. More- over, the reward values are usually designed ad-hoc, and the rating systems usually have little to no scientific validity. One of the first areas to adopt a more scientific-based rating (and thus ranking) system was chess. The United States Chess Federation (USCF) was founded in 1939. Initially, USCF used the Harkness rating system (Harkness, 1967). This was a reward-based sys- tem determined by a table that listed the reward size as a simple function of the difference between the players’ current ratings. After discovering many inaccuracies caused by this system, a new system with a more solid statistical basis was designed by Arpád Elo,˝ and first implemented in 1960. For details of this rating system see (Elo, 1978). The Elo rating system was based on the following set of assumptions: • The performance of a player in a game is a normally distributed random variable. • For a fixed player, the mean value of his performance remains constant (or varies negligibly slowly).
Load more

Recommended publications
  • All That Math Portraits of Mathematicians As Young Researchers
    Downloaded from orbit.dtu.dk on: Oct 06, 2021 All that Math Portraits of mathematicians as young researchers Hansen, Vagn Lundsgaard Published in: EMS Newsletter Publication date: 2012 Document Version Publisher's PDF, also known as Version of record Link back to DTU Orbit Citation (APA): Hansen, V. L. (2012). All that Math: Portraits of mathematicians as young researchers. EMS Newsletter, (85), 61-62. General rights Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. Users may download and print one copy of any publication from the public portal for the purpose of private study or research. You may not further distribute the material or use it for any profit-making activity or commercial gain You may freely distribute the URL identifying the publication in the public portal If you believe that this document breaches copyright please contact us providing details, and we will remove access to the work immediately and investigate your claim. NEWSLETTER OF THE EUROPEAN MATHEMATICAL SOCIETY Editorial Obituary Feature Interview 6ecm Marco Brunella Alan Turing’s Centenary Endre Szemerédi p. 4 p. 29 p. 32 p. 39 September 2012 Issue 85 ISSN 1027-488X S E European M M Mathematical E S Society Applied Mathematics Journals from Cambridge journals.cambridge.org/pem journals.cambridge.org/ejm journals.cambridge.org/psp journals.cambridge.org/flm journals.cambridge.org/anz journals.cambridge.org/pes journals.cambridge.org/prm journals.cambridge.org/anu journals.cambridge.org/mtk Receive a free trial to the latest issue of each of our mathematics journals at journals.cambridge.org/maths Cambridge Press Applied Maths Advert_AW.indd 1 30/07/2012 12:11 Contents Editorial Team Editors-in-Chief Jorge Buescu (2009–2012) European (Book Reviews) Vicente Muñoz (2005–2012) Dep.
    [Show full text]
  • Table of Contents 129
    Table of Contents 129 TABLE OF CONTENTS Table of Contents ......................................................................................................................................................129 Science and Checkers (H.J. van den Herik) .............................................................................................................129 Searching Solitaire in Real Time (R. Bjarnason, P. Tadepalli, and A. Fern)........................................................ 131 An Efficient Approach to Solve Mastermind Optimally (L-T. Huang, S-T. Chen, S-Ch. Huang, and S.-S. Lin) ...................................................................................................................................... 143 Note: ................................................................................................................................................................. 150 Gentlemen, Stop your Engines! (G. McC. Haworth).......................................................................... 150 Information for Contributors............................................................................................................................. 157 News, Information, Tournaments, and Reports: ......................................................................................................158 The 12th Computer Olympiad (Continued) (H.J. van den Herik, M.H.M. Winands, and J. Hellemons).158 DAM 2.2 Wins Draughts Tournament (T. Tillemans) ........................................................................158
    [Show full text]
  • EMS Newsletter September 2012 1 EMS Agenda EMS Executive Committee EMS Agenda
    NEWSLETTER OF THE EUROPEAN MATHEMATICAL SOCIETY Editorial Obituary Feature Interview 6ecm Marco Brunella Alan Turing’s Centenary Endre Szemerédi p. 4 p. 29 p. 32 p. 39 September 2012 Issue 85 ISSN 1027-488X S E European M M Mathematical E S Society Applied Mathematics Journals from Cambridge journals.cambridge.org/pem journals.cambridge.org/ejm journals.cambridge.org/psp journals.cambridge.org/flm journals.cambridge.org/anz journals.cambridge.org/pes journals.cambridge.org/prm journals.cambridge.org/anu journals.cambridge.org/mtk Receive a free trial to the latest issue of each of our mathematics journals at journals.cambridge.org/maths Cambridge Press Applied Maths Advert_AW.indd 1 30/07/2012 12:11 Contents Editorial Team Editors-in-Chief Jorge Buescu (2009–2012) European (Book Reviews) Vicente Muñoz (2005–2012) Dep. Matemática, Faculdade Facultad de Matematicas de Ciências, Edifício C6, Universidad Complutense Piso 2 Campo Grande Mathematical de Madrid 1749-006 Lisboa, Portugal e-mail: [email protected] Plaza de Ciencias 3, 28040 Madrid, Spain Eva-Maria Feichtner e-mail: [email protected] (2012–2015) Society Department of Mathematics Lucia Di Vizio (2012–2016) Université de Versailles- University of Bremen St Quentin 28359 Bremen, Germany e-mail: [email protected] Laboratoire de Mathématiques Newsletter No. 85, September 2012 45 avenue des États-Unis Eva Miranda (2010–2013) 78035 Versailles cedex, France Departament de Matemàtica e-mail: [email protected] Aplicada I EMS Agenda .......................................................................................................................................................... 2 EPSEB, Edifici P Editorial – S. Jackowski ........................................................................................................................... 3 Associate Editors Universitat Politècnica de Catalunya Opening Ceremony of the 6ECM – M.
    [Show full text]
  • NEW-IOA-Inner Page.Cdr
    INTERNATIONAL O L Y M P I A D I O A A C A D E M Y CSAR Learning Solutions Pvt. Ltd. brings WORLD’S MOST CELEBRATED CONTESTS Registration Open 2020-21 INTERNATIONAL SCIENCE OLYMPIAD MATH KANGAROO COMPETITION HIPPO ENGLISH OLYMPIAD INTERNATIONAL OLYMPIAD ACADEMY A division of CSAR Learning Solutions Pvt. Ltd. +91 9810336335, +91 8368118421 [email protected] www.internationalolympiadacademy.com INTERNATIONAL O L Y M P I A D A C A D E M Y INTERNATIONAL OLYMPIAD ACADEMY Our education system has, for long, focused only on the core concepts that science and mathematics can offer. This has spurred the need for an external platform that provides the opportunity to apply these concepts and build a deep understanding of the core concepts learned in school. Olympiads are competitive examinations conducted nationally and internationally and have proved to be such platforms that allow students to test their mettle in different subjects. These exams focus on the application of concepts learned in the classroom. The exams are designed in such a way that the students are forced to apply multiple concepts simultaneously to arrive at the answers. This not only sharpens their skill, it also builds in them the deep appreciation of the subject. We, at International Olympiad Academy, recognize the need for such periodic tests that pushes the students out of their comfort zone and helps them build them their logical reasoning and analytical abilities. Our Olympiads, picks students from all across the globe to compete against their peer groups. We aim to foster a healthy environment which is competitive yet enriching.
    [Show full text]
  • Mathematics People
    Mathematics People Ooguri Receives Chunichi Turaev and Virelizier Awarded Cultural Award Balaguer Prize Hirosi Ooguri of the California Vladimir Turaev of Indiana Uni- Institute of Technology has been versity and Alexis Virelizier of honored with the 2016 Chunichi Université Lille 1 have been awarded Cultural Award. The award carries the 2016 Ferran Sunyer i Balaguer a cash prize of 2 million yen (ap- Prize for their monograph Monoidal proximately US$20,000). Categories and Topological Field According to the prize citation, Theory. The monograph introduces Ooguri was honored for the “devel- monoidal categories and Penrose’s opment of innovative methods of graphical calculus; gives an alge- modern mathematics in high energy braic description of the center of Hirosi Ooguri theory.” His work involves “creating monoidal categories based on the Vladimir Turaev new theoretical tools in quantum theory of Hopf monads as devel- field theory and superstring theory.” He is especially oped by Virelizier and coauthors; known for his work on topological string theory, “which explains topological quantum field has had broad applications ranging from black hole phys- theories, including fundamental ics to algebraic geometry and knot theory in mathematics.” earlier work of Reshetihkin-Turaev Ooguri is a past recipient of the AMS Eisenbud Prize and Turaev-Viro; and shows how to (2008), a Humboldt Research Award (2008), the Nishina present ribbon graphs by diagrams Memorial Prize (2009), a Simons Investigator Award on skeletons of 3-manifolds and (2012), and the Kodansha Prize for Science Books of define graph topological quantum Japan (2014) for his popular science book, Introduction to field theories by means of state Superstring Theory.
    [Show full text]
  • Mohex 2.0: a Pattern-Based MCTS Hex Player
    MoHex 2.0: a pattern-based MCTS Hex player Shih-Chieh Huang1,2, Broderick Arneson2, Ryan B. Hayward2, Martin M¨uller2, and Jakub Pawlewicz3 1 DeepMind Technologies 2 Computing Science, University of Alberta 3 Institute of Informatics, University of Warsaw Abstract. In recent years the Monte Carlo tree search revolution has spread from computer Go to many areas, including computer Hex. MCTS Hex players now outperform traditional knowledge-based alpha-beta search players, and the reigning Computer Olympiad Hex gold medallist is the MCTS player MoHex. In this paper we show how to strengthen Mo- Hex, and observe that — as in computer Go — using learned patterns in priors and replacing a hand-crafted simulation policy with a softmax pol- icy that uses learned patterns can significantly increase playing strength. The result is MoHex 2.0, about 250 Elo stronger than MoHex on the 11×11 board, and 300 Elo stronger on 13×13. 1 Introduction In the 1940s Piet Hein [22] and independently John Nash [26–28] invented Hex, the classic two-player alternate-turn connection game. The game is easy to im- plement — in the 1950s Claude Shannon and E.F. Moore built an analogue Hex player based on electrical circuits [29] — but difficult to master, and has often been used as a testbed for artificial intelligence research. Around 2006 Monte Carlo tree search appeared in Go Go [11] and soon spread to other domains. The four newest Olympiad Hex competitors — MoHex from 2008 [4], Yopt from 2009 [3], MIMHex from 2010 [5], Panoramex from 2011 [20] — all use MCTS.
    [Show full text]
  • Rules for the 17Th World Computer-Chess
    Rules for the 17 th World Computer-Chess Championship 1 RULES FOR THE 17 th WORLD COMPUTER-CHESS CHAMPIONSHIP Pamplona, Spain May 11-18, 2009 The Board of ICGA The 17 th World Computer-Chess Championship will take place from May 11-18, 2009 in Pamplona, Spain. Here we recall that the Maastricht Triennial Meeting in 2002, i.e., the ICGA meeting, decided that the WCCC should be held annually without distinguishing any type of machines. The observation was clear: all kinds of differences between microcomputers, personal computers, “normal” computers, and supercomputers were in some sense obsolete and the classification thus was considered artificial. So was the division into the classes of single processors and multiprocessors. For 2009 we are introducing a new rule on a somewhat experimental basis. For this year’s WCCC a limit is being placed on the number of cores that a computer system may use for the tournament. The longer-term future of this rule is currently under discussion in various computer chess forums and will be debated by the contestants during this year’s World Championship, which might lead to changes for future years. Another division considered obsolete since 2002 is that between amateur and professional. Is not the real amateur a professional? Or the other way round? For organizational matters we have kept this difference, since for amateurs the cost of travelling and housing is already expensive. Being treated as a professional may be agreeable, but if you have to pay for it then it might be less agreeable. As in previous years we have maintained three groups here, viz.
    [Show full text]
  • Computer Chinese Chess
    Computer Chinese Chess Tsan-sheng Hsu [email protected] http://www.iis.sinica.edu.tw/~tshsu 1 Abstract An introduction to research problems and opportunities in Computer Games. • Using Computer Chinese chess (aaaËËË) as examples. • Show how theoretical research can help in solving the problems. Data-intensive computing: tradeoff between computing on the spot and using pre-stored knowledge. Phases of games • Open game ( 開開開@@@): database • Middle game (---@@@): Search • End game (殘殘殘@@@): knowledge Topics: • Introduction • Construction of a huge knowledge base that is consistent • Playing rules for repetition of positions • Construction of huge endgame databases • Benchmark TCG: Computer Chinese Chess, 20141224, Tsan-sheng Hsu c 2 Introduction Why study Computer Games: • Intelligence requires knowledge. • Games hold an inexplicable fascination for many people, and the notion that computers might play games has existed at least as long as computers. • Reasons why games appeared to be a good domain in which to explore machine intelligence. They provide a structured task in which it is very easy to measure success or failure. They did not obviously require large amount of knowledge. A course on teaching computers to play games was introduced at NTU in 2007. TCG: Computer Chinese Chess, 20141224, Tsan-sheng Hsu c 3 Predictions for 2010 { Status My personal opinion about the status of Prediction-2010 [van den Herik 2002] at October, 2010, right after the Computer Olympiad held in Kanazawa, Japan. solved over champion world champion grand master amateur Awari Chess Go (9 ∗ 9) Bridge Go (19 ∗ 19) Othello Draughts (10 ∗ 10) Chinese chess Shogi Checkers (8 ∗ 8) Scrabble Hex Backgammon Amazons Lines of Action .
    [Show full text]
  • Teacher Gender and Student Performance in Mathematics
    Journal of Education and Training Studies Vol. 1, No. 1; April 2013 ISSN 2324-805X E-ISSN 2324-8068 Published by Redfame Publishing Teacher Gender and Student Performance in Mathematics. Evidence from Catalonia (Spain) Josep-Oriol Escardíbul1 & Toni Mora2 1University of Barcelona & Barcelona Institute of Economics (IEB); Barcelona, Spain 2Universitat Internacional de Catalunya & Barcelona Institute of Economics (IEB); Barcelona, Spain Correspondence: Josep-Oriol Escardíbul, University of Barcelona, Faculty of Economics & Business, Department of Public Economics; Av. Diagonal, 690, Torre 6, Piso 2; 08034 Barcelona, Spain. Tel: 34-934-039-936. E-mail: [email protected] Received: December 13, 2012 Accepted: December 31, 2012 Available online: January 10, 2013 doi:10.11114/jets.v1i1.22 URL: http://dx.doi.org/10.11114/jets.v1i1.22 Abstract This paper analyses the impact of teacher gender towards students’ test results in a blinded Math test administered to students in Catalonia (Spain). The data for this analysis are drawn from a sample of secondary school students who participated in an international blind-test known as the “Mathematical Kangaroo” in 2008. The estimation considers a two-stage procedure since participation on the test leads to the presence of sample selection. Results show a correlation between female teacher gender and student results. Moreover, students with female teachers have a higher probability of participating in the “Kangaroo” test (in this case, the effect being more marked among male students). Keywords: grading;
    [Show full text]
  • Austria Belgium Belarus
    AUSTRIA national representative: Robert Geretschläger organizing team: Konrad Ehgartner, Renate Gottlieb, Gottfried Perz, Gerhard Plattner IT: Jan Matuška, Sara Kropf, Andreas Pipp, Jan Pöschko, Birgit Vera Schmidt participants: Heinrich Gstöttner, Gerhard Hainscho, Alois Lederhilger, Elisabeth Willau BELGIUM national representative: Bart Windels participant: Ria Van Huffel BELARUS national representative: Henadzi Niakhai participants: Viktar Kaskevich, Aleh Tauhen Dear friends, Chers amis, The Belarusian delegation would like to La délégation de Biélorussie remercie thank our colleagues from Graz fort he cordiallement nos collègues de Graz pour chance to visit the country of the great belle possibilité de visiter le pays de grand Mozart, to meet again and to help with the Mozart, de nous nous rencontrer ici et work at this conference. In our country, the d’assister aux travaux de cette conférence. Kangaroo contest is organized by the Le jeu « Kangourou » est organisé dans notre Belarusian society “Concours” with the help pays par l’Association biélorusse “Concours” of the Academy of Postdiplomatic education avec l’aide de l’Academie de l’education and under the guidance of the national postdiplome et sous l’éguide du Ministère de ministry of education. Each year the contest l’éducation nationale. Chaque anneé ce becomes more and more popular among the concours devient de plus en plus populaire youngsters. The number of participants has parmi des enfants. Le nombre de participants grown in the last 14 years and reached augmente á la durée de 14 ans et est atteint 116472 in 2007. 116472 élèves en 2007. We distributed 127000 booklets and 16500 Nous avons distribué 127000 brochures et books for the students and teachers, which 16500 livres pour les élèves et les are published by the association.
    [Show full text]
  • Sander Dommers
    Curriculum vitae { Sander Dommers Ruhr-Universit¨atBochum Fakult¨atf¨urMathematik Room NA 6/35 Universit¨atsstraße150 44780 Bochum Germany [email protected] http://www.ruhr-uni-bochum.de/ffm/Lehrstuehle/Kuelske/dommers.html Personal Born on August 22, 1984 in Dordrecht, the Netherlands. Dutch nationality. Education Gymnasium, Stedelijk Dalton Lyceum, Dordrecht, the Netherlands, 2002. BSc Industrial and Applied Mathematics, Eindhoven University of Technology, 2008. MSc Industrial and Applied Mathematics, Eindhoven University of Technology, 2009. PhD Mathematics, Eindhoven University of Technology, 2013. Courses in the PROOF program for PhD students at Eindhoven University of Technology: Supervising Students in Independent Learning, 2009. Scientific Integrity, 2009. Teaching and Learning in Higher Education, 2010. The Art of Presenting Science, 2010. Presentation using performance skills, 2010. Writing Articles and Abstracts in English, 2011. Voice training, 2011. Employment Promovendus (PhD student), Department of Mathematics and Computer Science, Eindhoven University of Technology, March 2009{December 2012. (Defense: March 26, 2013.) Assegnista di ricerca (Postdoc), Dipartimento di Matematica, Universit`adi Bologna, January 2013{September 2015. Wissenschaftlicher Mitarbeiter (Postdoc), Fakult¨atf¨urMathematik, Ruhr-Universit¨atBochum, October 2015{Present. Research visits abroad Universit`adegli studi di Modena e Reggio Emilia, Reggio Emilia, Italy. July{August 2010 (3 weeks). Universit`adegli studi di Modena e Reggio Emilia,
    [Show full text]
  • Computer Olympiad
    The 7th Computer Olympiad Mark Winands IKAT, Universiteit Maastricht From July 5 to 11 2002 the Institute for Knowledge and Agent Technology (IKAT) organised the 7th Computer Olympiad at the Universiteit Maastricht (UM). Together with the Olympiad a Computer-Games workshop was organised. This event took place from July 6 to 8. Both events are described in this report. The Computer Olympiad The Computer Olympiad is a multi-games event in which all of the participants are computer programs. The Olympiad is a brainchild of David Levy, who organised this tournament in 1989 (London) for the first time. The next five editions were held in 1990 (London), 1991 (Maastricht), 1992 (London), 2000 (London) and 2001 (Maastricht). This year was the third time that the event was held in Maastricht. IKAT was responsible for the organisation. Similar to last year, Jaap van den Herik was the tournament director. The purpose of the Olympiad is to determine the strongest program for each game. The Olympiad has grown to a social event, as the authors of the programs are not bound to silence during the play as in human tournaments. The event is a reunion where programmers meet, discuss ideas and renew acquaintances. Some teams arrive with the clear goal of winning, some just come to participate, some to test new ideas under tournament conditions. The Olympiad is a truly international event. This year, participants came from all over the world: USA, Canada, Japan, Taiwan, Israel and the European Union. The event was held under the auspices of the ICCA (International Computer Chess Association), which gave it an official status.
    [Show full text]