Planification de mon doctorat

-

Session 1/11 -- Janvier 2010 à Avril 2010

  • PHS-8801 Activité de recherche - thèse 1

Session 2/11 -- Mai 2010 à Août 2010

  • PHS-8802 Activité de recherche - thèse 2

Session 3/11 -- Septembre 2010 à Décembre 2010

  • BIF-7900 Bio-informatique I A+
  • PHS-8803 Activité de recherche - thèse 3

Session 4/11 -- Janvier 2011 à Avril 2011

  • PHS-8000 Examen de doctorat (écrit: 1 mars 2011, oral: 1 avril 2011)
  • PHS-8804 Activité de recherche - thèse 4

Session 5/11 -- Mai 2011 à Août 2011

  • PHS-8805 Activité de recherche - thèse 5

Session 6/11 -- Septembre 2011 à Décembre 2011

  • PHS-8001 Séminaire de doctorat
  • PHS-8806 Activité de recherche - thèse 6

Session 7/11 -- Janvier 2012 à Avril 2012

  • BMO-7007 Analyse critique de publications
  • PHS-8807 Activité de recherche - thèse 7

Session 8/11 -- Mai 2012 à Août 2012

  • PHS-8808 Activité de recherche - thèse 8

Session 9/11 -- Septembre 2012 à Décembre 2012

  • Rédaction 
  • TRE-8800     Poursuite de recherche thèse 1 (inscription max. 2 sessions au tarif de 108 $)

Session 10/11 -- Janvier 2013 à Avril 2013

  • Rédaction
  • TRE-8800     Poursuite de recherche thèse 1 (inscription max. 2 sessions au tarif de 108 $)

Session 11/11 -- Mai 2013 à Août 2013

  • Rédaction et dépôt de thèse
  • TRE-8801     Poursuite de recherche thèse 2 (inscription max. 5 sessions au tarif de 334 $) 
  • 2013-08-15 dépôt voir S12

Session 12 -- Septembre 2013 à Décembre 2013 

Session 13 -- Janvier 2014 à Avril 2014

  • TRE-7802     Dépôt de thèse ou mémoire pour évaluation
  • 2014-04-10 défense

Comments

Post a Comment

Popular posts from this blog

Learning to solve the example 1 of puzzle 3aa6fb7a in the ARC prize

-
Image
Hi dear reader, Puzzle rules The example 1 of the puzzle 3aa6fb7a of the ARC prize looks like this: A playout starts with an blank board of width 7 and of height 7. There are therefore 49 cells. Each cell can be blank or can contain one of the 10 possible colors. The colors are identified from 0 to 9.  I added a rule. This rule is that each cell has to be changed exactly once.  The game ends when all cells have been changed. The player wins if all the cell colors match the cell colors in the expected output. Some numbers: Each cell has 11 possible values: 10 colors + blank state There are 49! ( 6.0828186e+62) distinct possible orders of cell changes in a playout.  There are 49!*10 ( 6.0828186e+63) 49 * 10 = 490 possible actions for the first action.  There are 11^49 ( 1.0671896e+51) possible board states The number of possible pairs (s, a) is even larger and upper-bounded by 11^49 * 49 * 10 = 5.2292289e+53 . Given a board state s and a proposed action a, an actio...
Read more

The Thorium actor engine is operational now, we can start to work on actor applications for metagenomics

-
I have been very busy during the last months. In particular, I completed my doctorate on April 10th, 2014 and we moved from Canada to the United States on April 15th, 2014. I started a new occupation on April 21st, 2014 at Argonne National Laboratory (a U.S. Department of Energy laboratory). But the biggest change, perhaps, was not one listed in the enumeration above. The biggest change was to stop working on Ray. Ray is built on top of RayPlatform, which in turn uses MPI for the parallelism and distribution. But this approach is not an easy way of devising applications because message passing alone is a very leaky, not self-contained, abstraction. Ray usually works fine, but it has some bugs . The problem with leaky abstractions is that they lack simplicity and are way too complex to scale out. For example, it is hard to add new code to an existing code base without breaking anything. This is the case because MPI only offers a fixed number of ranks. Sure, the MPI standard has s...
Read more

The source code of SOAPdenovo2 sits in the shadows

-
Update 2012-12-28: SOAPdenovo 2.04-r223 source code was posted online on 2012-12-28. Some minor concerns: 1. The tarball suffers from the bundled library problem (libbam.a and libbammac.a are shipped precompiled). This is incompatible with the GPLv3 license. 2. The Makefile is not portable with its hard-coded paths to compilers (/opt/blc/gcc-4.5.0/bin/gcc should just be gcc). The SOAPdenovo2 article was published today under the terms of the Creative Commons Attribution License. Here are the Availability and requirements for SOAPdenovo2 as reported in the article: Availability and requirements Project name: SOAPdenovo2 Project home page: http://soapdenovo2.sourceforge.net/ Operating system(s): e.g. Platform independent Programming language: C, C++ Other requirements: GCC version ≥ 4.5.0 License: GNU General Public License version 3.0 (GPLv3) Any restrictions to use by non-academics: none Contact: bgi-soap@googlegroups.com I fired up my browser and in a ...
Read more