Differences

This shows you the differences between two versions of the page.

--- teaching:mfe:ia [2017/04/20 18:33]
stuetzle
+++ teaching:mfe:ia [2020/02/24 10:55]
stuetzle
@@ Line 1: / Line 1: @@
-====== MFE 2015-2016 : Intelligence Artificielle ======
+====== MFE 2018-2019 : Intelligence Artificielle ======
 ===== Introduction =====
@@ Line 8: / Line 8: @@
-===== Swarm construction: Development of remote monitoring software for intelligent structures =====
+---
+=====  A WebGL Visualization for a Swarm Robotics Simulator  =====
-S-blocks are dynamically reconfigurable blocks used for autonomous construction applications. When two or more S-blocks are assembled they are capable of communicating with each other over a near field communication (NFC) wireless interface. The goal of this master thesis is to develop software to monitor (and control) the blocks in an intelligent structure remotely over the auxiliary Zigbee-based wireless interface. As only one block in the structure is fitted with this wireless interface, it is required that the other blocks communicate with the PC, via routing messages through the block-to-block NFC interfaces. This will require the software on the S-Blocks to be enhanced to use preemptive task swapping, to allow multiple blocks to communicate with each other simultaneously.
+ARGoS is a multi-robot simulator that has been designed to simulate swarms of 1000s of robots in real time. The simulator is modular and allows developers to easy add new plugins such as physics engines, visualizations, and new sensors and actuators. The goal of this master’s thesis is to develop a WebGL-based visualization for the ARGoS simulator. This interface will allow a user to monitor and to interact with the simulation from a web browser.
-Required skills: The candidates should understand low level computer concepts such as: interrupts, timers, and registers, have some experience with C/C++ programming, and have a working knowledge of the English language.
+Required skills: The candidates should have some experience with programming in C++ and Javascript and to have some experience with HTML5 and CSS. A working knowledge of the English language is required.
-* Contact: [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] (IRIDIA)
+* Contact: Marco Dorigo
-===== Design of a holonomic drive system for autonomous robots in a swarm =====
-Unlike a differential drive system, a holonomic drive system has the advantage of being able to move in any direction at a given instant. The goal of this master thesis is to design and evaluate the performance of a holonomic drive system. The drive system will be assembled from a combination of off-the-shelf components and 3D printed parts. In order to evaluate the drive system, close loop controllers need to be designed and evaluated in C/C++.
-Required skills: The candidates should have some experience with programming in C/C++, and some experience with 3D modelling (preferably Solidworks). The candidates should be able to use basic kinematics to solve simple physics problems, and have a working knowledge of the English language.
-* Contact: [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo]] (IRIDIA)
@@ Line 60: / Line 51: @@
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
 ===== Développer un programme informatique permettant une analyse statistique en vue de  l'évaluation d'un module psychothérapeutique. =====
 Ce mémoire se fera en collaboration avec l'équipe médicale du centre pour l'anorexie et la boulimie de l'hôpital Erasme. Il consistera en l'analyse informatisée des données récoltées lors d'entretiens avec le patient et sa famille au cours du traitement. Les données sont actuellement stockées dans dans une base de données SPSS.  Le mémoire consistera pour l'essentiel au traitement de ces données par des approches "Machine Learning" et "Data Mining" dans une perspective de Quality Management.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Développer des solutions de text mining pour la société Procter & Gamble =====
+Ce mémoire se fera en collaboration avec des responsables marketing de cette société. Il consistera en l'analyse informatisée des appréciations récoltées sur les produits de la firme et d'une analyse comparative avec les appréciations de concurrents. Il s'agira pour l'essentiel d'études de type "clustering", "classification" et "sentiment analysis" au départ de nombreuses librairies déjà existantes.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Le data mining en tant qu’outil d’aide à la gestion active d’actifs cotés  =====
+L’idée de ce mémoire serait d’avoir un travail en plusieurs parties dont notamment :
+•	une partie théorique qui reprendrait les fondamentaux du data mining,
+•	un screening, une présentation et comparaison des outils existants utilisés dans le cadre de la gestion d’actifs cotés,
+•	une partie pratique destinée à construire un data set et à le modéliser.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Speed-up Techniques for Shortest Path Problems =====
+The shortest path problem is one of the most important in combinatorial optimization and has multiple real-world applications.
+The well-known Dijkstra algorithm solves the shortest path problem in any weighted graph with non-negative weights. However, with the recent increase of the amount of data, we feel the need to drastically increase the execution time of the algorithm.
+In the latest years, we observe the emergence of a lot of new speed-up techniques; among them there are: heuristic search, bidirectional search, landmarks, reaches, short-cuts and contractions. The efficiency of these techniques heavily depends on the topology of the graph. Moreover, graphs with more complex structures (as user-adapted graphs) do not support some of these techniques, at least as they are currently presented.
+From these observations, several questions arise, among them we propose:
+Which optimization methods are the most efficient depending on the graph topology?
+How can we adapt these techniques to more complex graph structures?
+Other research questions in this topic can be proposed and discussed.
+These questions can be studied from both theoretical and empirical approach.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Développer des solutions de data mining pour la société BMW Group Belux =====
+Ce mémoire se fera en collaboration avec des responsables marketing et techniques de cette société.
+Les sujets pourraient couvrir tout ce qui concerne les data, tant les data dites de campagne, communication, que celles liées à la production ou aux véhicules connectés.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Transposition en logique floue des réseaux de neurones récurrents de type GRU =====
+Ce mémoire consistera en la conception et l'analyse de systèmes de logiques floues, capables d'apprentissage automatique, et très inspirés des réseaux de neurones récurrents de type GRU, utilisés avec succès ces jours-ci pour la traduction automatique, la labélisation automatique d'images, la génération de musique et la conduite de véhicules autonomes.
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
@@ Line 79: / Line 116: @@
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-===== Etude pratique et expérimentale du langage de programmation F# =====
-Depuis quelques années, Microsoft met en avant un nouveau langage de programmation F# créé dans le sillage des langages dits déclaratifs ou fonctionnels. Il semblerait que ce langage soit idéal pour le traitement des données. Le MFE consistera en une étude expérimentale de ce langage et un comparatif avec les langages de programmation aujourd'hui les plus usités.
- * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
 ===== Etude de l'algorithme du Deep Learning =====
@@ Line 209: / Line 240: @@
   * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
+===== Utilisation de réseaux de neurones récurrents pour la détection d'arythmies cardiaques =====
+Ce mémoire s'effectuera en collaboration avec le service de cardiologie d'Erasme et consistera en la détection automatique d'apparition d'arythmies cardiaques à l'aide des réseaux de neurones récurrents, qui semblent être très efficaces pour le traitement des séries chronologiques complexes.
+  * Contact : [[http://code.ulb.ac.be/iridia.people.php?id=1|Hugues Bersini (IRIDIA)]]
-===== Software framework for ant colony optimization =====
-Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications, and engineering. While ACO has a very wide applicability, the development times for effective ACO algorithms can be relatively high. This is due to the fact that each time a new problem is to be tackled by an ACO algorithm, a researcher needs to implement the algorithms almost from scratch.
+===== Text Categorisation and quality control through automatic language processing =====
-The goal of the project is to provide a software framework to support the application and the implementation of ACO algorithms to new problems. The software framework will offer all the standard procedures that are used in ACO algorithms and will allow for the rapid prototyping of ACO algorithms.
+This thesis is developed in collaboration with the Energy Efficiency in Industrial Processes (EEIP) company. EEIP is a global industry information network. As part of their activities, they disseminate case studies to various network groups. The goal of the project is to develop an automatic language processing algorithm capable to evaluate the quality (accept / reject) of the proposed case studies and to allocate them to single/multiple categories. Testing and training the algorithm is a key part as it not only requires development and testing of concepts such as how to evaluate quality or definition of requirements for multiple category allocation but the project also has
-The application of this software framework will be tested on a number of optimization problems.
+to be developed in a limited data environment (+/- 1000 case studies as training set).
-Required skills: The candidate should be well acquainted with programming in object oriented languages.
+Required skills: A background in machine learning would be helpful.
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]
+    * [[https://www.ee-ip.org/|Jürgen Ritzek (EE-IP)]]
-===== Software framework for ant colony optimization =====
+===== Automated configuration of multi-objective continuous optimizers =====
-Ants have inspired a number of computational techniques and among the most successful is ant colony optimization (ACO). ACO is an optimization technique that can be applied to tackle a wide variety of computational problems that arise in computer science, telecommunications, and engineering. While ACO has a very wide applicability, the development times for effective ACO algorithms can be relatively high. This is due to the fact that each time a new problem is to be tackled by an ACO algorithm, a researcher needs to implement the algorithms almost from scratch.
+Many problems arising in real-world applications involve the optimization of various, often conflicting objectives. While the design of algorithms for tackling multi-objective problems has usually done manually, over the recent years automated design methodologies have been established and proved to be very powerful.
-The goal of the project is to provide a software framework to support the application and the implementation of ACO algorithms to new problems. The software framework will offer all the standard procedures that are used in ACO algorithms and will allow for the rapid prototyping of ACO algorithms.
+The goal of this project is to extend the automated design to multi-objective continuous optimization problems. As the basis of the approach, a framework based on the two-phase plus Pareto local search approach will be developed into which basic search techniques for continuous optimization will be integrated. The goal is to build first a flexible framework from which then in a second step effective multi-objective optimizers will be generated exploiting automated algorithm design techniques. The final goal of this work is to participate in algorithm competitions with the goal of challenging the methodology.
-The application of this software framework will be tested on a number of optimization problems.
-Required skills: The candidate should be well acquainted with programming in object oriented languages.
+Required skills: The candidate should have very good analytical as well as programming skills.
   * Contacts :
-    * [[http://iridia.ulb.ac.be/~mdorigo|Marco Dorigo (IRIDIA)]]
     * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stützle (IRIDIA)]]