Differences

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

Link to this comparison view

Both sides previous revision Previous revision
Next revision
Previous revision
Next revision Both sides next revision
teaching:mfe:ia [2015/03/26 14:55]
bersini
teaching:mfe:ia [2015/04/11 17:39]
stuetzle [Feature Extraction and Automatic Algorithm Selection.]
Line 20: Line 20:
   * Contact : [[http://​code.ulb.ac.be/​iridia.people.php?​id=1|Hugues Bersini (IRIDIA)]] ​   * Contact : [[http://​code.ulb.ac.be/​iridia.people.php?​id=1|Hugues Bersini (IRIDIA)]] ​
  
-===== Contribution au développement de la platerorme ​Big Data d'​IRIDIA =====+===== Contribution au développement de la plateforme ​Big Data d'​IRIDIA =====
  
 Dans de nombreux projets d'​enseignement et d'​industrie dans lesquels IRIDIA se trouvent impliqués, des demandes pressantes nous sont faites de formation et d'​utilisation des outils Big Data (Map-Reduce,​ Cloudera, Hue, Hive, Pig, Elastic Search, HBase). Nous répondons tant bien que mal à ces demandes et tentons d'​équiper notre cluster avec les logiciels demandés. Le mémoire consisterait en une étude comparative de l'​existant en terme surtout logiciel et la mise en place d'un cours mettant en évidence les avantages de l'une ou l'​autre solution en ce compris par rapport à des solutions plus conventionnels de type BD relationnelle. Dans de nombreux projets d'​enseignement et d'​industrie dans lesquels IRIDIA se trouvent impliqués, des demandes pressantes nous sont faites de formation et d'​utilisation des outils Big Data (Map-Reduce,​ Cloudera, Hue, Hive, Pig, Elastic Search, HBase). Nous répondons tant bien que mal à ces demandes et tentons d'​équiper notre cluster avec les logiciels demandés. Le mémoire consisterait en une étude comparative de l'​existant en terme surtout logiciel et la mise en place d'un cours mettant en évidence les avantages de l'une ou l'​autre solution en ce compris par rapport à des solutions plus conventionnels de type BD relationnelle.
Line 177: Line 177:
     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​
     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​
-    * [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari (IRIDIA)]] ​ 
-    * [[http://​iridia.ulb.ac.be/​~manuel|Manuel López-Ibáñez (IRIDIA)]] 
  
  
Line 192: Line 190:
     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​
     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​
-    * [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari (IRIDIA)]] ​ 
-    * [[http://​iridia.ulb.ac.be/​~manuel|Manuel López-Ibáñez (IRIDIA)]] 
        
- 
- 
-===== Graphical Tools for analysing Multi-Objective Data. ===== 
- 
-In multi-objective problems, not only one objective function must be minimised but several, often conflicting,​ objectives must be taken into account. The result is often a set of solutions modelling the trade-off between the objectives of the problem. 
- 
-The goal of this project is to develop graphical tools to interactively examine and compare the results of algorithms for multi-objective problems. 
- 
-Required skills: The candidate should be well acquainted with programming in object oriented languages. 
- 
- 
-  * Contacts :  
-    * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​ 
-    * [[http://​iridia.ulb.ac.be/​~manuel|Manuel López-Ibáñez (IRIDIA)]] 
  
  
Line 229: Line 211:
     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​
     * [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~mbiro|Mauro Birattari (IRIDIA)]] ​
-    * [[http://​iridia.ulb.ac.be/​~manuel|Manuel López-Ibáñez (IRIDIA)]] +    * [[http://​iridia.ulb.ac.be/​~lperez|Leslie Perez (IRIDIA)]]
-    * [[http://​iridia.ulb.ac.be/​~jdubois|Jérémie Dubois-Lacoste ​(IRIDIA)]]+
  
  
Line 248: Line 229:
     * [[http://​iridia.ulb.ac.be/​~fmascia|Franco Mascia (IRIDIA)]] ​       * [[http://​iridia.ulb.ac.be/​~fmascia|Franco Mascia (IRIDIA)]] ​  
  
- 
-===== Analysis of Local Optima Networks for the Max-Clique problem. ====== 
- 
-Stochastic Local Search algorithms search for optimal solutions in a large space of candidate solutions. Local Optima Networks (LON) are representations of search landscapes of combinatorial optimisation problems. In these networks, nodes are local optima of the problem, and edges are weighted transitions between the optima. These networks model in a more compact way the properties of the larger search spaces they represent. 
- 
-The goal of this project is to build LON of small instances of the Maximum Clique (MC) problem, and measure properties that could illustrate the differences between instance families. 
- 
-The MC problem is an NP-hard combinatorial optimisation problem that asks to find the biggest completely connected component of a graph. It has relevant applications in information retrieval, computer vision, social network analysis, computational biochemistry,​ bioinformatics and genomics. 
- 
- 
-Required skills: good knowledge of C or C++ programming. ​ 
- 
- 
-  * Contacts :  
-    * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​ 
-    * [[http://​iridia.ulb.ac.be/​~fmascia|Franco Mascia (IRIDIA)]] ​   
  
  
Line 279: Line 244:
   * Contacts :    * Contacts : 
     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​
-    * [[http://​iridia.ulb.ac.be/​~fmascia|Franco Mascia (IRIDIA)]] ​   
  
  
Line 569: Line 533:
     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​     * [[http://​iridia.ulb.ac.be/​~mdorigo|Marco Dorigo (IRIDIA)]] ​
  
- 
-===== A graphical interface for the optimisation of Water Distribution Networks ===== 
- 
-The [[http://​iridia.ulb.ac.be/​~manuel/​doc/​cec2005-presentation.pdf|optimization of the operations of Water Distribution Networks]] may save important amounts of energy and its associated costs, and, therefore, it is an important problem in practice. There are [[http://​www.epa.gov/​nrmrl/​wswrd/​dw/​epanet.html|graphical tools and simulators]] available. In addition, several optimization methods based on [[http://​iridia.ulb.ac.be/​~manuel/​doc/​cec2005.pdf|evolutionary algorithms]] and [[http://​dx.doi.org/​10.1061/​(ASCE)0733-9496(2008)134:​4(337)|ant colony optimization]] have been proposed in the literature. The goal of this project is to integrate the optimization algorithms into a graphical environment that can be used by water engineers and operators. No knowledge about water distribution networks is necessary. The optimisation algorithms and toolkit libraries for handling water distribution networks will be available to the student. 
- 
-  * Contacts :  
-    * [[http://​iridia.ulb.ac.be/​~manuel|Manuel López-Ibáñez (IRIDIA)]] 
-    * [[http://​iridia.ulb.ac.be/​~stuetzle|Thomas Stützle (IRIDIA)]] ​ 
  
  
 
teaching/mfe/ia.txt · Last modified: 2024/07/01 16:15 by stuetzle