Position of Professor 27th section

Hiring Campaign – Computer Science Department / LIP Laboratory ENS 2011

Position of Professor 27th section

The CSD and LIP invite applications for a position of Professor in Computer Science for the beginning of the school year 2011.

Teaching Contact: eric.fleury@ens-lyon.fr

Research Contact: gilles.villard@ens-lyon.fr

Research. The Professor will reinforce LIP‘s research according to the project set up in the laboratory’s four-year plan. This project’s scope is the study and anticipation of the digital world and its theoretical foundations, in order to invent new ICT concepts and methods and to anticipate their repercussions on other science domains. Research is organized along two complementary axes crossing all eight teams:

  • models and methods in mathematical computer science;
  • challenges of future computing and communication architectures.

The machine (computer, infrastructure), be it the physical object or the abstract entity, is at the core of the studies. Research in LIP has always covered both fundamental and development aspects, which is a major source of invention. The laboratory is traditionally and profusely open to mathematics, but also to communication and semi- conductor industries, digital sciences, modelization, and life sciences.The candidate will collaborate closer with one of the laboratory’s teams and could bring in a new research theme, in concordance with those of the laboratory’s project. Brilliant candidates of all profiles and backgrounds are invited to apply; the final choice will depend first and foremost on the application’s quality. This recruitment is very open; external French and foreign applications will be favored.

Teaching. The teaching will be done in the Computer Science Department of ENS Lyon, for the Licence (L3) and the Master (M1 and M2), in the Fundamental Computer Science specialty. One of the emblematic characteristics of this ENS Lyon formation is that it is resolutely done by and for research in Computer Science. This pledge to giving a formation to excellence research is reflected on the organization of the courses. The priorities of the Meyrieux campus also bring about important strategic challenges related to complexity and modelization. The Computer Science Department of ENS Lyon integrates this local context by supporting interdisciplinary formations. Care should be taken that the teachings be related to the candidate’s project/research theme, and have their place in one of the three curricula of the Fundamental Computer Science specialty|”Computer Science Mathematics”, “Algorithmic”, “Models and Optimizations for Emerging Infrastructures” or be related to the “Modelization of Complex Systems” curriculum. The Fundamental Computer Science specialty is a complete formation with, on one side, courses teaching the fundamental bases of a solid general culture in computer science and, on the other, more specialized courses offering an introduction to research. The “Complex Systems” curriculum is based on the Fundamental Computer Science, Mathematics, and Physics Masters of ENS Lyon. Candidates bringing areas of competence complementary to those of the CS Department and proposing new courses will be particularly appreciated.

The Professor will have to put to use his capacities for organization management and assume administrative responsibilities in the management of the ENS Lyon Computer Science Department.

Nota. The recruitment procedure in France involves preliminary steps that need to be accomplished before the position actually becomes available (see below). All potentially interested candidates should start the process as soon as possible:

French qualification procedure (as of October 2010)

Application procedure. In France, the procedure is done in two steps: first, every candidate applies to a national committee that assesses the overall level of the candidate’s profile and delivers a qualification, which is valid for 4 years. However (décret du 23/04/2009), candidates holding a position at a level equivalent to that of the vacant position in a foreign university are exempt from the the quali fication procedure. Such foreign applications will be reviewed by the ENS Scientific Council prior to the hiring committee meetings.

First stage: qualification. The qualification procedure is specific to France, and is done by the CNU (Comité National des Universités), which is divided into sections, one for each discipline. See the web page of the Computer Science section for extremely useful information: all interested candidates should read the qualification section there, but here follows a short summary of the important dates.

The first step of qualification is performed at the following web site. You can register, and fill in the required forms here.

This very first step must be completed very soon: before the 28th of October. Interested candidates should not be afraid to contact us early in case of difficulty with the qualification procedure. A few weeks after the application has been registered on the web site, the names of the two reviewers will be given on the 16th of November on the Antares website.

Candidates should then immediately send their full application to the two reviewers, no later than the 17th of December 2010.

ER 01 : Stochastic Geometry for Wireless Networks

Intervenant : François Baccelli (http://www.di.ens.fr/~baccelli/)

The lecture will be taught in English.

Dates : 10 – 14 janvier 2011 – ENS Lyon

Planning:

lundi : 10h30 : 12h30 – 14h00 : 17h00
mardi : 10h00 : 12h00 – 14h00 : 17h00
mercredi : 10h00 : 12h00 – 14h00 : 17h00
jeudi : 10h00 : 12h00 – 14h00 : 17h00
vendredi : 10h00 : 12h00 – 14h00 : 16h00

Objectif: Introduction à la géométrie stochastique et application à la modélisation des communications dans les réseaux sans fil.

Programme (prévisionnel)

Part I – Classical Stochastic Geometry

1. Poisson Point Process
2. Marked Point Processes and Shot-Noise Fields
3. Boolean Model
4. Voronoi Tessellation

Part II – Signal-to-Interference Ratio Stochastic Geometry

5. Signal-to-Interference Ratio Cells
6. Interacting Signal-to-Interference Ratio Cells
7. Signal-to-Interference Ratio Coverage
8. Signal-to-Interference Ratio Connectivity

Part III – Medium Access Control

9. Spatial Aloha: the Bipole Model
10. Receiver Selection in Spatial Aloha
11. Carrier Sense Multiple Access
12. Code Division Multiple Access in Cellular Networks

Part IV – Multihop Routing in Mobile ad Hoc Networks

13. Optimal Routing
14. Greedy Routing
15. Time-Space Routing

Prérequis : Probabilités (à cet effet, les étudiants de M1 sont vivement invités à suivre le cours de L3 “Probabilités – Statistiques“)

Documents de support : monographie “Stochastic Geometry and Wireless Networks” (2009), by F. Baccelli and B. Blaszczyszyn (available on-line at http://www.di.ens.fr/~baccelli/)

Correspondant local : P. Gonçalves.
Sponsor : Pôle ResCom du GDR CNRS ASR

ER 03: Vision and Machine-learning

From the 24th to the 28th of January 2011 — ENS Lyon

The lectures will be delivered in English.

Goals

Some of the notable recent successes in automated visual recognition are results of combining advanced visual representations together with powerful machine learning techniques. The objective of this winter school is to provide an overview of basic tools and some latest advances in visual recognition together with the related machine learning algorithms. A particular emphasis will be given on topics related to recognition of objects and human actions in video and still images. Lectures will be given by experts in visual recognition and machine learning. Lectures will be complemented by practical sessions, where participants will obtain hands-on experience with the discussed material.

Speakers :

  1. Zaid Harchaoui (INRIA, LEAR, INRIA Rhône-Alpes)
  2. Ivan Laptev (INRIA, WILLOW, INRIA Rocquencourt)
  3. Cordelia Schmid (INRIA, LEAR, INRIA Rhône-Alpes)
  4. Josef Sivic (INRIA, WILLOW, INRIA Rocquencourt)

Tentative outline and schedule of the course

[L] means a lecture, and [E] means an exercise session.

If possible, please bring a laptop with you for the exercise sessions.

  • Monday, January 24
    • [L] 8:15 AM – 9:15 AM. Unsupervised learning (Zaid Harchaoui). Slides available here, here and here.
  • [L] 9:30 AM – 10:30 AM. Unsupervised learning (Zaid Harchaoui)
  • [E] 10:45 AM – 11:45 AM. Unsupervised learning (Zaid Harchaoui)
  • [L] 1:30 PM – 2:30 PM. Image features (Cordelia Schmid). Slides available here and here (ppt files) or here and here (pdf files).
  • [L] 2:45 PM – 3:45 PM. Image features (Cordelia Schmid)
  • [E] 4:00 PM – 5:00 PM. Image features (Cordelia Schmid, Josef Sivic)
  • Tuesday, January 25
    • [L] 8:15 AM – 9:15 AM. Camera geometry and Image Alignment (Josef Sivic). Slides available here.
    • [L] 9:30 AM – 10:30 AM. Camera geometry and Image Alignment (Josef Sivic)
    • [E] 10:45 AM – 11:45 AM. Camera geometry and Image Alignment (Ivan Laptev and Josef Sivic).
    • [L] 1:30 PM – 3:00 PM. Efficient visual search (Josef Sivic). Slides available here.
    • [L] 3:15 PM – 4:45 PM. Efficient visual search (Cordelia Schmid). Slides available here (ppt file) and here (pdf file).
  • Wednesday, January 26
    • [L] 8:15 AM – 9:15 AM. Bag-of-features models for category-level classification (Cordelia Schmid). Slides available here (ppt file) and here (pdf file).
    • [L] 9:30 AM – 10:30 AM. Bag-of-features models for category-level
      classification (Cordelia Schmid)
    • [E] 10:45 AM – 11:45 AM. Bag-of-features models for category-level classification (Ivan Laptev, Cordelia Schmid and Josef Sivic)
    • [L] 1:30 PM – 2:30 PM. Category-level localization (Ivan Laptev). Slides available here.
    • [L] 2:45 PM – 3:45 PM. Category-level localization (Ivan Laptev)
    • [E] 4:00 PM – 5:00 PM. Category-level localization (Ivan Laptev and Josef Sivic)
  • Thursday, January 27
    • [L] 8:15 AM – 9:15 AM. Motion and human actions (Ivan Laptev). Slides available here.
    • [L] 9:30 AM – 10:30 AM. Motion and human actions (Ivan Laptev)
    • [L] 10:45 AM – 11:45 AM. Motion and human actions (Ivan Laptev)
  • Friday, January 28
    • [L] 8:15 AM – 9:15 AM. Supervised learning (Zaid Harchaoui)
    • [L] 9:30 AM – 10:30 AM. Supervised learning (Zaid Harchaoui)
    • [E] 10:45 AM – 11:45 AM. Supervised learning (Zaid Harchaoui)

Total hours: 18 hours of lectures + 6 hours of practical exercises.

Prerequisites

The course is self-contained.

Bibliography

  • D.A. Forsyth and J. Ponce, “Computer Vision: A Modern Approach, Prentice-Hall, 2003.
  • J. Ponce, M. Hebert, C. Schmid, and A. Zisserman, “Toward category-level object recognition”, Springer LNCS, 2007.
  • R. Szeliski, “Computer Vision: Algorithms and Applications”, Springer, 2010.
  • O. Faugeras, Q.T. Luong, and T. Papadopoulo, “Geometry of Multiple Images,” MIT Press, 2001.
  • R. Hartley and A. Zisserman, “Multiple View Geometry in Computer Vision”, Cambridge University Press, 2004.
  • J. Koenderink, “Solid Shape”, MIT Press, 1990.

Registration

There are no registration fees. For organization reasons it is however necessary to register online; see the registration page.

Location and schedule

All the lectures will take place in “amphithéatre B”, at the 3rd floor of the GN1 building (main building of the “exact sciences” part of ENS Lyon, a.k.a. Campus Jacques Monod).

Local organizers

There are several useful informations on the main page of the research schools in Computer Science at ENS Lyon.

ER 04 (2011) : Separation logics and applications

Separation logic is an extension of Floyd-Hoare logic that makes it possible to reason about programs manipulating pointers. Since its introduction at the beginning of this millenary, it has led to several developments, which include tools for the automatic verification of properties of pointer manipulating programs, as well as reasoning about concurrent programs in a shared memory scenario.

This research school will take place in the week Jan.31st-Feb. 4, 2011.

Courses will be taught in english.

Slides:

HYang, intro, sep-logic, hiding, automation

AGotsman, concurrency, csl, lockfree, scheduler

MParkinson,abstract predicates, rely-guarantee, RGSep, deny-guarantee

Code: reverse.c, create.c, dispose.c, push.c, pop.c

The lecture notes on Separation Logic, written by J. Reynolds and mentioned by H. Yang in his lecture, are available here.

The prerequisite to follow the course is a basic knowledge of first-order logic.

Tool exercises: we suggest that attendees bring a laptop for the sessions devoted to tool exercises. Exercises will be made using the Verifast Program Verifier (follow the link to download and install the tool on your computer).

Lecturers

  • Hongseok Yang (Lecturer, Queen Mary University of London, UK)
  • Alexey Gotsman (Assistant Professor, IMDEA, Spain)
  • Matthew Parkinson (Researcher, Microsoft Research, Cambridge, UK)

Topics (tentative description)

1) Basic separation logic.

  • [a] Basic proof rules and semantics of separation logic.
  • [b] Basic automatic verification algorithms based on separation logic.

2) Logic-based approaches on information hiding and data abstraction.

  • [a] Higher-order frame rules and abstract predicates.
  • [b] Automatic verification algorithm with abstract predicates.

3) Invariant-based approaches on the verification of concurrent programs.

  • [a] Concurrent separation logic.
  • [b] Automatic verification algorithm based on concurrent separation logic.

4) Rely-Guarantee.

  • [a] RGSep: the marriage of rely-guarantee and separation logic.
  • [b] Automatic verification with RGSep.
  • [c] Reasoning about liveness properties.
  • [d] Deny Guarantee.

Tentative schedule for the week. [L] means a lecture, and [E] means an exercise session.

Mon (5 hours)

  • [L] Introduction and basic semantics (HY)     10h30
  • [E] Introduction and basic semantics (HY)
  • [E] Concurrent programming (AG)      14h00
  • [L] Basic separation logic (HY)
  • [E] Basic separation logic (HY)

Tue (5 hours)

  • [L] Abstract predicate (MP)     9h00
  • [E] Abstract predicate (MP)
  • [E] Tool exercise 1 (AG)
  • [L] Information hiding (HY)   14h00
  • [E] Information hiding (HY)

Wed (7 hours)

  • [L] Concurrent separation logic (AG)     9h00
  • [E] Concurrent separation logic (AG)
  • [E] Tool exercise 2 (AG)
  • [L] RGSep (MP)              13h30
  • [E] RGSep (MP)
  • [L] Automation (HY)     16h00
  • [E] Automation (HY)

Thu (4 hours)

  • [L] Soundness of concurrent separation logic (AG)        9h00
  • [L] Deny/Guarantee (MP)
  • [E] Deny/Guarantee (MP)
  • [L] ..

Fri (3+1 hours)

  • [L] Liveness (AG)          9h00
  • [E] Liveness (AG)
  • [L] Concurrent abstract predicate (MP)
  • Exam     (end: 13h00)

Please contact Daniel Hirschkoff if you have any question regarding this course.

ER 05 (2011) : Complexité algébrique, complexité de comptage et applications en physique statistique

Horaires :
  • Lundi : 9h-12h15 et 14h-17h15 (Arnaud)
  • Mardi : 9h-12h15 (Jesper) et 14h-16h (Guillaume)
  • Mercredi : 9h-12h15 (Jesper) et 14h-16h (Guillaume)
  • Jeudi : 9h30-12h45 (Sylvain) – rien l’après-midi
  • Vendredi : 9h30-12h45 (Sylvain) et 14h30-16h30 (Guillaume) + QCM 20min

Ce cours sera donné en Français.

ER 06 : Rule-based modeling and application to biomolecular networks

From 2011 Feb the 14th to Feb. the 18th — ENS Lyon

Links to main documents

Goal

The goal of this course is to give an overview on rule-based modelling.

Rule-based approaches (as in our own Kappa, or BNGL, or many other
propositions allowing the consideration of “reaction classes”) offer
some means to capture combinatorial molecular interactions as we find
them in biological subcellular systems. This is trying to fill a need
that seems ever more pressing – as molecular biology uncovers more
amazing combinational structures. In so doing we get a more physically
realistic, less parameter-hungry, and more structured approach to the
modeling/programming of combinatorial molecular networks.

We will explain the approach through numerous motivating examples. We
will also reenact various methods commonly employed in the
verification and analysis of concurrent systems to support our
approach with analytic tools, such as: static analysis (qualitative
and quantitative) for reachability questions and for the reduction of
dynamical systems, causality analysis (including methods for the
compression of partial time traces), and more specific “termination”
methods using local energy functionals to guarantee thermodynamical
correctness.

The intended audience is students and staff in theoretical computer
science/concurrency theory, computational biologists with an interest
in modelling techniques, statistical physicists/applied mathematicians
with an interest in biomodelling.

Speakers

  1. Vincent Danos
  2. Jérôme Feret
  3. Jean Krivine
  4. Gregory Batt
  5. Jonathan Hayman

Pedagogical materials will be in English.

Lectures will be given in English.

Timetable

Monday 14th [Amphi B]
  • 9h30: Welcome [Amphi B, 3rd floor]
  • 10h00-12h00: Basics of modeling (V. Danos) [Amphi D, ground floor]
     
  • 14h00-15h30: Basics of modeling (V. Danos) [Amphi B]
  • 15h45-17h00: Basics of modeling (V. Danos) [Amphi B]
Tuesday 15th [Amphi B]
  • 10h00-12h00: Introduction to kappa (J. Krivine)
     
  • 14h00-15h30: Dynamics (J. Krivine)
  • 15h45-17h00: Dynamics (J. Krivine)
Wednesday 16th [Amphi B]
  • 10h00-12h00: Static analysis (J. Feret)
     
  • 14h00-15h30: Model reduction (J. Feret)
  • 15h45-17h00: Model reduction (J. Feret)
Thursday 17th [Amphi B]
  • 10h00-12h00: Model reduction (J. Feret)
     
  • 14h00-15h30: Modeling session: epigenetics (J. Krivine)
  • 15h45-17h00: Modeling session: epigenetics (J. Krivine)
Friday 18th [Amphi B]
  • 10h00-12h00: Energy and syntax (V. Danos)
     
  • 13h15-14h00: evaluation for ENS students
     
  • 14h00-15h30: Extensions (G. Batt)
  • 15h45-17h00: Extensions (J. Hayman)

Content

Basics of modeling : Petri-Nets, mass action law, detection of equilibriums and steady states, thermodynamic limit (Kurz theorem).

Introduction to kappa : Notion of model in biology, syntax and operational semantics.

Dynamics : Gillespie’s algorithm, scalability issue, causality.

Static analysis : Qualitative analysis, reachability (completeness result), species enumeration algorithm.

Model reduction : Information flow, ODE semantics, stochastic semantics.

Energy and syntax : Information flow, ODE semantics, stochastic semantics.

Extensions : Compartments, agent variants,diffusion.

Software

Preliminary requirements

This course requires no prelimary knowledge.

The fundamental notions which will be used in this course will be properly introduced.

Bibliography

Local organizer

Olivier Laurent