Computer Science Seminar

INFO-F-530

 
  1. Link to the university program

  2. Organization of the course

  3. Ethics

  4. Questions

  5. Preliminary program

  6. Deadline for the reports : 4/06/2018




Prof. J. Cardinal, Prof. M. Labbé, Prof. T. Lenaerts and Prof. O. Markowitch

2015-2018

Organization of the course

The course provides 5-7 seminars given by internationally recognized invited speakers with extensive expertise in a particular area of Computer Science.  The talks are aimed at a large audience of computer scientists with diverse backgrounds and they will cover some advanced topic, in an accessible and introductionary fashion.


Students enrolled for the course INFO-F-530 are required to participate in at least 3 of the proposed seminars and their presence is encouraged in the rest.  For each of the 3 seminars, the students are requested to complete a questionnaire and they will be evaluated on the quality of the responses they give on the questions. For some questions, the students are expected to look up additional information.  The questions are the same for each seminar, meaning that 3 completed documents need to be returned corresponding to the three different seminars the student selected (see below).


The completed questionnaires should be typeset (use LateX,  Word or Openoffice) and a paper version should be handed in to the student secretary of the Computer Science department (Building NO, 8th floor, office N.8.104) no later than the 4th of May, 2018 (before 15:00).


Ethics

Plagiarism is easily detected and will be severely sanctioned.  Plagiarism cases include reusing someone else’s written or drawn material, or any kind of work, without an explicit quote or reference.  Please examine the following pages : http://www.bib.ulb.ac.be/fr/aide/eviter-le-plagiat/ and http://www.plagiarism.org/

Questions

For every seminar you attend you have to answer the following questions. Respond to these questions in a clear and precise manner.   Typeset your questions using Word, Openoffice or Latex.  Provide as a heading of your document:

  1. 1.your name

  2. 2.your affiliation

  3. 3.the title of the presentation

  4. 4.the date

  5. 5.the name of the presenter


These are the questions:

  1. 1.Provide an outline of the content of the seminar in your own words (1500 chars) (3 points)

  2. 2.Which were the major points discussed by the speaker? List and explain their importance. (3 points)

  3. 3.For which discipline in computer science is the topic relevant and why (explain)? (2points)

  4. 4.Suggest 2 or 3 articles discussing similar work (not necessarily published by the speaker). Explain why they are related. (3 points)

  5. 5.Propose two scientific questions relevant for the topic discussed in this seminar (2 points)

  6. 6.Would you like to know more about this field? Do you have particular critiques about the scientific content? Provide a brief motivation for your answers.  (2 points)


Preliminary seminar program

  1. 1.John Lacono, The Cache-oblivious model of computation (12 oct. 2017 at 12h15).  Room FORUM G

Abstract: In the standard model of computation often taught in computer science courses one identifies elementary operations and counts them in order to obtain the runtime. However, given the complexity of computing hardware, this measure often does not correlate well with actual observed runtime on a computer; accessing n items sequentially or randomly typically have runtimes that differ by several orders of magnitude. In this talk I will present the cache-oblivious model of computation, a model that was introduced by Prokop in 1999 and is relatively easy to reason with, by modeling the multilevel caches that are a defining feature of the cost of modern computation. After presenting the model, several data structure and algorithms that illustrate design techniques to develop cache-obliviously optimal structures will be presented.


The slides are available here : DLS John Iacono.pdf


  1. 2.Mohamed El Kandri, Blockchain presentation (19 mars 2018, 16:00-17:00) Room Forum G (La Plaine Campus)

Abstract :


  1. 3.Hande Yaman,Hub Location Problems: Applications, Models and Solution Methods (27 Mars 2018 à 12h00  ) Room FORUM F (La Plaine Campus)

Abstract: Hubbing is commonly used in airlines, cargo delivery and telecommunications networks where traffic from many origins to many destinations are consolidated at hubs and are routed together to benefit from economies of scale. Each application area has its own specific features and the associated hub location problems are of complex nature. In the first part of this talk, I will introduce the basic hub location problems, summarize important models and results and mention the shortcomings of these in addressing real life situations. In the second part, I will introduce new variants of the hub location problem that incorporate features such as hierarchical and multimodal networks, service of quality constraints, generalized allocation strategies and demand uncertainty. I will conclude the talk with an ongoing work on a joint problem of hub location, network design and dimensioning.


  1. 4.Ana Paiva (16th April) : CANCELLED


  1. 5.Joan Daemen Column-parity mixing layers in cryptography (26 April 2018, 13:30) : Room NO5 (Solvay room).

Abstract: Mixing layers, such as MixColumns in the AES, are an essential ingredient that can be found in the round function of most modern block ciphers and permutations. We study a generalization of the mixing layer in Keccak-f, the permutation underlying the NIST standard SHA-3 and the authenticated encryption schemes Keyak and Ketje. We call this generalization column-parity mixing layers and investigate their algebraic and diffusion properties and implementation cost. We demonstrate their competitiveness by presenting a fully specified 256-bit permutation with strong bounds for differential and linear trails.


  1. 6.Sévatien Hoarau. Utilisation de plateformes ludiques de programmation pour motiver les apprenants (24 May 2018, 12:00) : Room 2NO7.08


Résumé : Depuis une quinzaine d'années les étudiants de l'Université de la Réunion sont de moins en moins motivés par les énoncés classiques d'exercices de programmation notamment ceux très mathématiques. Ces cinq dernières années, de nombreuses plateformes ludiques d'apprentissage de la programmation ont vu le jour offrant la possibilité de proposer autre chose aux jeunes programmeurs. Que peut-on faire de ces outils dans le cadre d'un enseignement universitaire ?


  1. 7.Francisco C. Santos Social norm complexity and human cooperation (28 May 2018; 12h00): Room Solvay room (Building NO, 5th floor)


Abstract : Explaining the emergence of cooperation is one of the biggest challenges science faces today. Indeed, cooperation dilemmas occur at all scales and levels of complexity, from cells to global governance. Theoretical and experimental works have shown that status and reputations can provide solutions to the cooperation conundrum. These features are often framed in the context of indirect reciprocity, which constitutes one of the most elaborate mechanisms of cooperation discovered so far. By helping someone, individuals may increase their reputation, which can change the predisposition of others to help them in the future. The reputation of an individual depends, in turn, on the social norms that establish what characterises a good or bad action. Such norms are often so complex that an individual’s ability to follow subjective rules becomes important. In this seminar, I will discuss a simple evolutionary game capable of identifying the key pattern of the norms that promote cooperation, and those that do so at a minimum complexity. This combination of high cooperation and low complexity suggests that simple moral principles, and informal institutions based on reputations, can elicit cooperation even in complex environments.

This is a joint work with Fernando P. Santos (IST, University of Lisbon) and Jorge M. Pacheco (University of Minho).