THIS DOCUMENT IS OBSOLETE. Please, see the update of this document, on the new Alexandre Fenyo's web site

I modified a map of Jussieu designed by the RATP : I have added some new buildings (31-41, gymnasium, Maison de la pédagogie), the building numbers, etc.

It is also available in PDF format.

I designed this logo for the EDITE de Paris (Ecole Doctorale d'Informatique, Télécommunications et Electronique de Paris), using Corel Draw and Adobe Photoshop.
I designed this logo for the EDDV, using Adobe Illustrator and Adobe Photoshop.

I designed these flyers with the help of Agnès Lefranc, for the Eliane & Isa Show, using Adobe Photoshop.

Architecture of my personal computer,
designed with Visio Technical
(also available in Acrobat/PDF format)
I'm also connected to the Net by means of one of my phones :

After having programmed some SNMP managers and agents, I wrote an introduction to SNMPv2, the second version of SNMP :

Demonstration of slalom

- Slides from my course about Databases and W3/XML.

- Slides I've done with xfig about the Secure Channelized Protocol of the MPC parallel computer.

- Slides I've done with xfig about my TCP/IP implementation over the MPC parallel computer.

- DOOM over the MPC parallel computer.

I'm very interested in mathematics, especially algebra. As a result of my little investigations in this domain, I obtained the following theorem for which I have never been 100% sure of my proof :
If you have a counter-example or a proof of this proposition, please send me a mail. -- Note (year 2002) : Thanx to G. Legrand that has found a proof, there should not be any counter-example.

download thesis, read abstract, etc. : click here
I have started my PhD Thesis on parallel computing in november 1995, and ended it at the beginning of july 2001. The aim of my work was to design secure network protocols and Unix kernel software components to allow fast communications accross the 1Gbit/s wormhole direct memory to memory network of the MPC parallel computer. I also wrote a multi-threaded Object Request Broker in C++ to let the distributed kernel components communicate together. Finally, I developped a stochastic approach on fault-coupling and redundant systems reliability to show that simple protocols could be sufficient to achieve the needs of security in communications over high speed networks of parallel computers.
The full source of the Operating System (based on BSD-Unix) I wrote for the MPC parallel computer is available here (about 40000 lines of mixed kernel/user-level C/C++/Perl programs).
The whole MPC project has been included in the 100 most important facts (Les 100 faits marquants) published by the SPI (Sciences for Engineers - Sciences pour l'ingénieur) department of the french public research organisation CNRS (Centre national pour la recherche scientifique).

Here are the performances obtained with the MPC parallel computer and the low-level kernel communication layer (PUT) I designed :

During my thesis, I've established the (basic) following results on stochastic processes :

Note that the third result is important for engineers : it allows to apply the first two results to real phenomena analysis.

These booklets I designed with Corel Draw are provided in Adobe Acrobat/PDF file format :
plaquette Services Informatiques (3,1Mo)
plaquette Réseau Informatique (3,2Mo)
plaquette Organigramme Edite (3,6Mo)
plaquette Contacts/Adresses (3,2Mo)

This map, I designed with Corel Draw, shows the network and systems of Edite that I manage.

This map is also available in Adobe Acrobat/PDF file format (273Ko)

I have designed a few web servers :

The MPC computer and I
(avi/mpeg-4 file format)

The MPC project
(mpeg-1 file format)

Bad Boys
(avi/mpeg-4 file format)
also available in avi/cinepak and mpeg-1 file formats


Manuel de typographie française - Grammaire française - vidéo-surveillance
tirés du lexique des règles typographiques en usage à l'Imprimerie nationale
et du code typographie du Centre de formation et de perfectionnement des journalistes