The DI website is upgrated to two new complementary area:
- The official web site: http://informatique.ens-lyon.fr/
- The internal web site: http://www.ens-lyon.fr/DI
The applicant will develop a research project within the scientific spectrum of the LIP, or in a new research area that harmoniously interfaces with the current spectrum. This research project will be consistent with the teaching objectives. She/he will have experience in the proposed research area, with supporting publications or software development at the highest international level. She/he may be led to take “research management” responsibilities.
This position is widely open: external French and International applications are strongly encouraged.
The professor will become a member of the Computer Science teaching department of ENS de Lyon. She/he will be in charge of courses with strong emphasis on the implementation and experimentation aspects of Computer Science, such as: programming projects, compilation, systems, networks, architecture, etc. In line with the missions of the Ecoles Normales Supérieures, she/he will lead the students towards academic careers in these areas. It is expected that the professor will actively participate in the architecture of the curriculum. International applications are welcome, as the courses can be taught in English.
How to find S. Zeitounian, she is very helpful for all your deals with the DI?
You can reach easily the administrative office (LE 237), only 6 steps
Open from Monday to Friday
This year, ENS-Lyon is hosting visiting professors who are leading experts in two aspects of numerical computing.
Nick Trefethen (University of Oxford) is a well-known numerical analyst and the inventor of Chebfun, a MATLAB-based tool that solves all kinds of problems of rootfinding, integration, and differential equations fast and typically to 15 digits of accuracy.
Warwick Tucker (Uppsala University) is a leader in the area of rigorous numerical computing, where instead of computing numbers with no guarantees, one applies interval analysis and other methods to obtain guaranteed results — and even to rigorously prove mathematical theorems with the aid of the computer.
In this week, using a mixture of lectures and hand-on computer laboratories, the two professors will showcase some of the highlights of these two sides of numerical computing.
Schedule for ER02
|Monday||Chebyshev (amphi B)||Chebyshev (lab rooms E001 and 125)||Validated numerics (amphi B)|
|Tuesday||Validated numerics (amphi B)||Validated numerics (amphi B)||Chebyshev (amphi B)||Chebyshev (lab rooms E001 and 125)|
|Wednesday||Chebyshev (amphi B)||Validated numerics (amphi B)||Validated numerics (amphi B)|
|Thursday||Validated numerics (amphi B)||Validated numerics (amphi B)|
|Friday||Chebyshev (lab rooms E001 and 125)||Chebyshev (amphi B)||Exam (amphi B)|
For the part on Chebyshev:
For the part on Validated Numerics:
This lecture provides an overview as large as possible about the research around the Grid (through different kind of Grid: Grid computing, Research Grid, Production Grid, etc.) We talk about Grid architecture, data management (Hadoop, etc.), middleware, services (SOA, PaaS, SaaS, etc.), the Cloud Computing and so on. Moreover, we will see different programming model as workflow paradigm, software component, skeleton-based programming or the chemical models. This lecture concerns the second year of the master and will be finish through the study of paper from this research topic by the students.
The goal of this lecture is to give to you the keys to manage an ambitious software project. Based on existing methods in software engineering and management, students will be wrote a proposal and prove the feasibility of the project. Students will defend all their choices (software architecture, technical choice, etc.) and implement the project.
Students will be familiar with project roadmap. Work assessment come from reports during the project and a public final demonstration of the software.
Team management will be a key of success.
See previous project : http://graal.ens-lyon.fr/~ecaron/Teaching/ensproject.html
This lecture focuses on algorithmic for distributed systems. We will introduce distributed algorithms to solve communication problem, resource allocation, synchronization, … Thus leader election problems, waves algorithm, termination, routing, fault tolerance, self-stabilization, etc. are some examples that we will see during the lecture. Different kind of distributed system programming and implementation will be studied through ERLANG, CORBA or the DIET middleware.
English upon request.