.gitlab-ci.yml

+# image: omalaspinas/hakyll-test:latest
 image: omalaspinas/pandoc_website:latest
 
+variables:
+  GIT_SUBMODULE_STRATEGY: recursive
+  
 before_script:
    ##
    ## Run ssh-agent (inside the build environment)
@@ -28,6 +32,8 @@ before_script:
 
 build_and_deploy:
   script:
-    - make
-    - rsync -avz index.html malaspinas@129.194.185.180:/www/
-    - blc http://129.194.185.180/ -ro --exclude *.pdf --filter-level 3
+    - pandoc -v
+    - make update SHELL=bash
+    - make deploy SHELL=bash
+    - rsync -avzz site/* ur1bg_malas@ur1bg.ftp.infomaniak.com:web/malaspinas/
+      #    - blc https://malaspinas.academy/index.html -ro --exclude *.pdf --filter-level 3 --exclude https://bbb.hesge.ch*

.gitmodules

+[submodule "css/tufte-css"]
+	path = css/tufte-css
+	url = https://github.com/edwardtufte/tufte-css.git

Makefile

-STYLES := css/tufte-css/tufte.css \
-	css/pandoc.css \
-	css/pandoc-solarized.css \
-	css/tufte-extra.css
-
-all: index.html
+all: index.html 
 
 index.html: index.md Makefile
-	pandoc -o $@ $< -t html5 -c css/styling.css --self-contained
+	pandoc -o $@ $< -t html5 --css css/tufte-css/tufte.css -s
 
 deploy: all
+	make -C archives
 	mkdir -p site
+	mkdir -p site/archives
 	cp index.html site/
 	cp -r css site/
+	cp -r figs site/
+	cp -r archives/index.html site/archives/
+
+update:
+	git submodule foreach 'git pull origin master || true'
 
 clean:
-	rm -rf index.html
+	rm -rf index.html site

archives/Makefile

+all: index.html 
+
+index.html: index.md Makefile
+	pandoc -o $@ $< -t html5 --css ../css/tufte-css/tufte.css -s
+
+clean:
+	rm -rf index.html

archives/index.md

+# Cours d'années précédentes
+
+# Physique appliquée
+
+<!-- Chaîne *BBB* du cours <https://bbb.hesge.ch/rooms/ty7-tww-afq-lql/join> -->
+
+---
+
+##  [Polycopié](https://malaspinas.academy/phys/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/isc_physics), [pdf](https://malaspinas.academy/phys/cours.pdf)
+
+## Exercices sur les Lois de Newton, [HTML](phys/exercices/newton.html), [PDF](phys/exercices/newton.pdf)
+
+## Travail pratique: vecteurs, [HTML](https://malaspinas.academy/phys/practical_work/tp_vec), [PDF](https://malaspinas.academy/phys/practical_work/tp_vec.pdf), [tp_vec2.tar](https://malaspinas.academy/phys/practical_work/tp_vec2.tar)
+
+## Travail pratique: planètes, [HTML](https://malaspinas.academy/phys/planets/enonce.html), [PDF](https://malaspinas.academy/phys/planets/enonce.pdf), [skeleton.tar](https://malaspinas.academy/phys/planets/skeleton.tar)
+
+## Travail pratique: lignes de champs, [HTML](https://malaspinas.academy/phys/field_lines/enonce.html), [PDF](https://malaspinas.academy/phys/field_lines/enonce.pdf), [utils.tar.gz](https://malaspinas.academy/phys/field_lines/utils.tar.gz)
+
+## Travail pratique: circuit RC, [HTML](https://malaspinas.academy/phys/rc_circuit/enonce.html), [PDF](https://malaspinas.academy/phys/rc_circuit/enonce.pdf)
+
+# Mathématiques en technologie de l'information
+
+##  [Polycopié](https://malaspinas.academy/mti/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info), [pdf](https://malaspinas.academy/mti/cours.pdf)
+
+##  [Travail pratique: optimisation](https://malaspinas.academy/mti/tpOptimisation/index.html), [git repo](https://gitedu.hesge.ch/orestis.malaspin/math_tech_info/-/tree/master/travaux_pratiques/tpOptimisation), [pdf](https://malaspinas.academy/mti/tpOptimisation/tpOptimisation.pdf)
+
+##  [Travail pratique: intégrales](https://malaspinas.academy/mti/tpIntegrales/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info/-/tree/master/travaux_pratiques/tpIntegrales), [pdf](https://malaspinas.academy/mti/tpIntegrales/tp_integrales_conv.pdf)
+
+##  [Travail pratique: EDO](https://malaspinas.academy/mti/tpEdo/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info/tree/master/tpEdo), [pdf](https://malaspinas.academy/mti/tpEdo/tpEquadiffs.pdf)
+
+# Programmation concurrente (2019-2020)
+
+## [Polycopié](https://malaspinas.academy/concurrence/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/cours_prog_conc)
+
+# Exercices de programmation concurrente
+
+## TP1: L'ensemble de Julia [PDF](https://malaspinas.academy/tp_concurrence/julia.pdf), [HTML](https://malaspinas.academy/tp_concurrence/julia.html)
+
+## TP2: Les threads et verrous [PDF](https://malaspinas.academy/tp_concurrence/threads.pdf), [HTML](https://malaspinas.academy/tp_concurrence/threads.html)
+
+## TP3: Structures de données concurrentes [PDF](https://malaspinas.academy/tp_concurrence/synchro.pdf), [HTML](https://malaspinas.academy/tp_concurrence/synchro.html)
+
+## TP4: File et workflow [PDF](https://malaspinas.academy/tp_concurrence/file_workflow.pdf), [HTML](https://malaspinas.academy/tp_concurrence/file_workflow.html)
+
+## TP5: Variables de condition [PDF](https://malaspinas.academy/tp_concurrence/variables_condition.pdf), [HTML](https://malaspinas.academy/tp_concurrence/variables_condition.html)
+
+## Projet: Asteroids [PDF](https://malaspinas.academy/tp_concurrence/asteroids.pdf), [HTML](https://malaspinas.academy/tp_concurrence/asteroids.html)
+
+## TP6: Sémaphores [PDF](https://malaspinas.academy/tp_concurrence/semaphores.pdf), [HTML](https://malaspinas.academy/tp_concurrence/semaphores.html)
+
+## Projet: Asteroids concurrents [PDF](https://malaspinas.academy/tp_concurrence/multithreaded_asteroids.pdf), [HTML](https://malaspinas.academy/tp_concurrence/multithreaded_asteroids.html)
+
+# Anciens exercices en C (2019-20)
+
+## Tableaux unidimensionnels, [HTML](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GFX](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/gfx_example.tar.gz)
+
+## Les matrices, [HTML](https://malaspinas.academy/prog_seq_c_tp/matrices_intro/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/matrices_intro/matrices_intro.pdf)
+
+## Les chaînes de caractères, [HTML](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/chaines_caracteres.pdf)
+
+## Traitement d'images, [HTML](https://malaspinas.academy/prog_seq_c_tp/transformations/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/transformations/transformations.pdf)
+
+## Vector, [HTML](https://malaspinas.academy/prog_seq_c_tp/vector/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/vector/vector.pdf)
+
+## Fichier LAS, [HTML](https://malaspinas.academy/prog_seq_c_tp/lidar/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/lidar/read.pdf)
+
+## Fichier STL, [HTML](https://malaspinas.academy/prog_seq_c_tp/stl/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/stl/stl.pdf)
+
+## List-Vector, [HTML](https://malaspinas.academy/prog_seq_c_tp/lst_vector/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/lst_vector/linked_vector.pdf)
+
+## Delaunay, [HTML](https://malaspinas.academy/prog_seq_c_tp/delaunay/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/delaunay/delaunay.pdf)
+
+## TP noté 2: triangulation, [HTML](https://malaspinas.academy/prog_seq_c_tp/lidar_triangulation/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/lidar_triangulation/triangulation.pdf)
+
+## Code Morse, [HTML](https://malaspinas.academy/prog_seq_c_tp/morse/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/morse/morse.pdf)
+
+## Arbres quaternaires, [HTML](https://malaspinas.academy/prog_seq_c_tp/quadtree/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/quadtree/quadtree.pdf)
+
+## File de priorité, [HTML](https://malaspinas.academy/prog_seq_c_tp/priority_queue/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/priority_queue/linked_list.pdf)
+
+## Graphes, [HTML](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.pdf), [xml_parser.h](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.h), [xml_parser.c](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.c), [main.c](https://malaspinas.academy/prog_seq_c_tp/shortest_path/main.c), [villes.xml](https://malaspinas.academy/prog_seq_c_tp/shortest_path/villes.xml), [suisse.txt](https://malaspinas.academy/prog_seq_c_tp/shortest_path/suisse.txt)
+
+## Floyd-Dijkstra, [HTML](https://malaspinas.academy/prog_seq_c_tp/shortest_path/df.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/shortest_path/df.pdf), [squelette.c](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/c/main.c), [Makefile](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/c/Makefile), [commandes_a_tester.txt](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/commandes_de_test/cmd_a_tester.txt), [output](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/results_out/output)
+
+## Tests, [HTML](https://malaspinas.academy/prog_seq_c_tp/shortest_path/test.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/shortest_path/test.pdf)
+
+# Programmation séquentielle en Rust (2018-2019) 
+
+* [Slides du cours](https://malaspinas.academy/prog_seq/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/rust)
+
+# Exercices programmation séquentielle en Rust (2018-19)
+
+## TP1 Rust: Nombre secret, [HTML](https://malaspinas.academy/prog_seq/exercices/01_nombre_secret/), [PDF](https://malaspinas.academy/prog_seq/exercices/01_nombre_secret/index.pdf)
+## TP2 Rust: Calcul de $\pi$, [HTML](https://malaspinas.academy/prog_seq/exercices/02_calcul_pi/), [PDF](https://malaspinas.academy/prog_seq/exercices/02_calcul_pi/index.pdf)
+## TP3 Rust: Tableaux, [HTML](https://malaspinas.academy/prog_seq/exercices/03_tableaux/), [PDF](https://malaspinas.academy/prog_seq/exercices/03_tableaux/index.pdf)
+## TP4 Rust: Couverture de la reine, [HTML](https://malaspinas.academy/prog_seq/exercices/04_reine/), [PDF](https://malaspinas.academy/prog_seq/exercices/04_reine/index.pdf)
+## TP5 Rust: Puissance 4, [HTML](https://malaspinas.academy/prog_seq/exercices/05_puissance4/), [PDF](https://malaspinas.academy/prog_seq/exercices/05_puissance4/index.pdf)
+## TP6 Rust: Listes, [HTML](https://malaspinas.academy/prog_seq/exercices/06_listes/), [PDF](https://malaspinas.academy/prog_seq/exercices/06_listes/index.pdf)
+## TP7 Rust: Reed-Solomon, [HTML](https://malaspinas.academy/prog_seq/exercices/07_reed_solomon/index.html), [PDF](https://malaspinas.academy/prog_seq/exercices/07_reed_solomon/index.pdf)
+## TP8 Rust: Transformation d'images, [HTML](https://malaspinas.academy/prog_seq/exercices/08_transformation_images/index.html), [PDF](https://malaspinas.academy/prog_seq/exercices/08_transformation_images/index.pdf)
+## TP9 Rust: Problème du voyageur de commerce, [HTML](https://malaspinas.academy/prog_seq/exercices/09_voyageur_commerce/index.html), [PDF](https://malaspinas.academy/prog_seq/exercices/09_voyageur_commerce/index.pdf)

tufte-css @ e225f3a0

+Subproject commit e225f3a0e5f8f42a1d28416c1c85962411711907

index.md

 ---
 author:
-- Orestis Malaspinas
-title: Quelques cours de la filière ITI de hepia
+- Orestis Malaspinas, bureau A401, ISC, HEPIA
+title: Quelques cours de la filière ISC de hepia
 autoSectionLabels: true
 autoEqnLabels: true
 eqnPrefix: 
@@ -15,52 +15,209 @@ lang: fr
 documentclass: book
 papersize: A4
 cref: false
-pandoc-numbering:
-  - category: exercice
-    listing: Liste des exercices
 urlcolor: blue
 corrige: false
 ---
 
-# Cours de première année
+<div align="center">
+<video width="640" poster="figs/intro.svg" height="360" controls="true" autoplay="false">
+   <source src="videos/malaspinas.mp4" type="video/mp4">
+</video>
+</div>
 
-# Cours de programmation séquentielle en C
+:::::::::::::: {.columns}
+::: {.column width="40%"}
 
-## [Récapitulatif](prog_seq_c_cours/index.html)
+# Prog. séquentielle en C
 
-## Introduction [PDF](prog_seq_c_cours/intro.pdf)
+<!-- Chaîne *BBB* du cours <https://bbb.hesge.ch/rooms/wkm-a1q-7d1-rjb/join> -->
 
-## Base 1 [PDF](prog_seq_c_cours/base_1.pdf)
+## Bibliographie
 
-## Base 2 [PDF](prog_seq_c_cours/base_2.pdf)
+* Débutants: [E. Barthomier, D. Schang, Le C en 20 heures](https://c.developpez.com/cours/20-heures/)
+* Moyens: [J. Gustedt, Modern C](https://hal.inria.fr/hal-02383654/document)
 
-# Exercices de programmation séquentielle en C
+---
+
+## [Théorie](https://malaspinas.academy/prog_seq_c_cours/index.html)
+
+## [Tutoriel git](https://malaspinas.academy/git_tuto/git_tutorial.pdf)
+
+<!-- ## Théorie 
+
+### Introduction [PDF](prog_seq_c_cours/intro.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/cours) -->
+
+---
+
+## Exercices
+
+<!-- ### 02.06.2023: Plus court chemin, [HTML](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/shortest_path/graphes.pdf), [MAIN](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/c/main_dijkstra.c), [XML_PARSER_H](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.h), [XML_PARSER_C](https://malaspinas.academy/prog_seq_c_tp/shortest_path/xml_parser.c), [TEST_INPUT](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/commandes_de_test/cmd_a_tester_dijkstra.txt), [TEST_OUTPUT](https://malaspinas.academy/prog_seq_c_tp/shortest_path/squelette/results_out/output_dijkstra),  [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/shortest_path/enonce)
+
+### 23.05.2023: Barbes euh... B-arbres, [HTML](https://malaspinas.academy/prog_seq_c_tp/b_arbres/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbres.pdf), [HEADER](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbre.h), [SQUELETTE](https://malaspinas.academy/prog_seq_c_tp/b_arbres/b_arbre_skel.c), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/b_arbres/enonce)
+
+### 16.05.2023: Classification, [HTML](https://malaspinas.academy/prog_seq_c_tp/classification/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/classification/classification.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/classification/enonce)
+
+### 02.05.2023: Arbres quaternaires, [HTML](https://malaspinas.academy/prog_seq_c_tp/quadtree/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/quadtree/quadtree.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/quadtree/enonce), [BUZZ](https://malaspinas.academy/prog_seq_c_tp/quadtree/buzz.pgm)
+
+### 18.04.2023: Julia, [HTML](https://malaspinas.academy/prog_seq_c_tp/julia/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/julia/julia.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/julia/enonce)
+
+### 28.03.2023: Arbres AVL, [HTML](https://malaspinas.academy/prog_seq_c_tp/arbres_avl/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/arbres_avl/arbres_avl.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/arbres_avl/enonce)
+
+### 21.03.2023: Tris, [HTML](https://malaspinas.academy/prog_seq_c_tp/tris/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tris/tris.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tris/enonce)
+
+### 14.03.2023: Code morse, [HTML](https://malaspinas.academy/prog_seq_c_tp/morse/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/morse/code_morse.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/code_morse/enonce), [texte-morse.txt](https://malaspinas.academy/prog_seq_c_tp/morse/texte-morse.txt), [code-morse.txt](https://malaspinas.academy/prog_seq_c_tp/morse/code-morse.txt)
+
+### 28.02.2023: Table de hachage, [HTML](https://malaspinas.academy/prog_seq_c_tp/hashmap/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/hashmap/hashmap.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/hashmap/enonce), [students.txt](https://malaspinas.academy/prog_seq_c_tp/hashmap/students.txt)
+
+### 21.02.2023: Doubles pointeurs, [HTML](https://malaspinas.academy/prog_seq_c_tp/doubles_pointeurs/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/doubles_pointeurs/doubles_pointeurs.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/doubles_pointeurs/enonce)
+
+### 10.01.2023: Jeu du serpent, [HTML](https://malaspinas.academy/prog_seq_c_tp/serpent/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/serpent/serpent.pdf), [GFX](https://malaspinas.academy/prog_seq_c_tp/serpent/gfx.tar), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/serpent/enonce)
+
+### 28.11.2022: Puissance 4, [HTML](https://malaspinas.academy/prog_seq_c_tp/puissance4/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/puissance4/puissance4.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/puissance4/enonce), [Skeleton](https://malaspinas.academy/prog_seq_c_tp/puissance4/skeleton_for_students.tar.gz)
+
+### 20.09.2022: Calendrier, [HTML](https://malaspinas.academy/prog_seq_c_tp/calendar/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/calendar/calendar.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/calendar/enonce) -->
 
-## Le nombre secret, [HTML](prog_seq_c_tp/nombre_secret/index.html), [PDF](prog_seq_c_tp/nombre_secret/nombre_secret.pdf)
+<!-- ### 14.12.2023: Traitement d'image, [HTML](https://malaspinas.academy/prog_seq_c_tp/traitement_dimages/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/traitement_dimages/traitement_dimages.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/traitement_dimages/enonce) -->
+<!---->
 
-## Tableaux unidimensionnels, [HTML](prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GFX](prog_seq_c_tp/tableaux_unidimensionnels/gfx_example.tar.gz)
+### 07.01.2025: La liste doublement chaînée, [HTML](https://malaspinas.academy/prog_seq_c_tp/doubly_linked_list/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/doubly_linked_list/doubly_linked_list.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/doubly_linked_list/enonce)
 
-# Cours de deuxième année
+### 17.12.2024: Le serpent, [HTML](https://malaspinas.academy/prog_seq_c_tp/serpent/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/serpent/serpent.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/serpent/enonce), [GFX](https://malaspinas.academy/prog_seq_c_tp/serpent/gfx.tar)
+
+### 10.12.2024: La calculatrice, [HTML](https://malaspinas.academy/prog_seq_c_tp/calculator/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/calculator/calculator.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/calculator/enonce)
+
+### 03.12.2024: Matrices, [HTML](https://malaspinas.academy/prog_seq_c_tp/matrices/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/matrices/matrices.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/matrices/enonce)
+
+### 26.11.2024: Chaînes de caractères, [HTML](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/chaines_caracteres/chaines_caracteres.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/chaines_caracteres/enonce)
+
+### 19.11.2024: Makefiles et compilation séparée, [HTML](https://malaspinas.academy/prog_seq_c_tp/makefiles/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/makefiles/makefiles.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/makefiles/enonce)
+<!---->
+
+### 05.11.2024: Démineur, [HTML](https://malaspinas.academy/prog_seq_c_tp/demineur/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/demineur/demineur.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/demineur/enonce)
+
+### 28.10.2024: Tris par fusion, base, et sélection, [HTML](https://malaspinas.academy/prog_seq_c_tp/tri_fusion_base_selection/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tri_fusion_base_selection/tri_fusion_base_selection.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tri_fusion_base_selection/enonce)
+
+### 15.10.2024: Fractions, [HTML](https://malaspinas.academy/prog_seq_c_tp/fractions/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/fractions/fractions.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/fractions/enonce)
+
+### 08.10.2024: Tableaux unidimensionnels, [HTML](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/tableaux_unidimensionnels/tableaux_unidimensionnels.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/tableaux_unidimensionnels/enonce)
+
+### 01.10.2024: Bissection, [HTML](https://malaspinas.academy/prog_seq_c_tp/bissection/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/bissection/bissection.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/bissection/enonce)
+
+### 23.09.2024: Exercices introductifs, [HTML](https://malaspinas.academy/prog_seq_c_tp/exercices_intro/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/exercices_intro/exercices_intro.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/exercices_intro/enonce)
+
+### 16.09.2024: Nombre secret, [HTML](https://malaspinas.academy/prog_seq_c_tp/nombre_secret/index.html), [PDF](https://malaspinas.academy/prog_seq_c_tp/nombre_secret/nombre_secret.pdf), [GIT](https://gitedu.hesge.ch/programmation_sequentielle/travaux_pratiques/c_lang/nombre_secret/enonce)
+
+:::
+::: {.column width="60%"}
+
+# Algo. et structures de données
+
+<!-- Chaîne *BBB* du cours  <https://bbb.hesge.ch/rooms/jli-y03-zrx-52a> -->
+
+## Bibliographie
+
+[T. H. Cormen, C. E. Leiserson, R. L. Rivest and C. Stein, Introduction to Algorithms, 3rd edition](https://mitpress.mit.edu/9780262533058/)
+
+---
+
+## [Théorie](https://malaspinas.academy/algo_cours/index.html)
+
+---
 
-## [Mathématiques en technologie de l'information](mti/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/math_tech_info), [pdf](mti/cours.pdf)
-## [Programmation concurrente](concurrence/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/cours_prog_conc)
+# Prog. Système avancée
+
+## [Repo git du cours](https://gitedu.hesge.ch/programmation_systeme_avancee/cours)
+## [Lien BBB](https://bbb.hesge.ch/rooms/x7q-ciw-ue6-90s/join)
+
+---
+
+## Travaux pratiques
+
+## 17.02.2025: Les emsembles de Julia, [HTML](https://malaspinas.academy/prog_sys_av_tp/julia/), [PDF](https://malaspinas.academy/prog_sys_av_tp/julia/julia.pdf)
+## 24.02.2025: Le petit déjeuner, [HTML](https://malaspinas.academy/prog_sys_av_tp/petit_dej/), [PDF](https://malaspinas.academy/prog_sys_av_tp/petit_dej/petit_dej.pdf)
+## 24.02.2025: Logging, [HTML](https://malaspinas.academy/prog_sys_av_tp/logging/), [PDF](https://malaspinas.academy/prog_sys_av_tp/logging/logging.pdf)
+## 03.03.2025: Appels système, [HTML](https://malaspinas.academy/prog_sys_av_tp/syscalls/), [PDF](https://malaspinas.academy/prog_sys_av_tp/syscalls/syscalls.pdf)
+## 10.03.2025: Le runtime (un peu plus) générique, [HTML](https://malaspinas.academy/prog_sys_av_tp/fibers/), [PDF](https://malaspinas.academy/prog_sys_av_tp/fibers/fibers.pdf)
+## 17.03.2025: Les coroutines, [HTML](https://malaspinas.academy/prog_sys_av_tp/coroutines/), [PDF](https://malaspinas.academy/prog_sys_av_tp/coroutines/coroutines.pdf)
+## 24.03.2025: Réacteur-Exécuteur, [HTML](https://malaspinas.academy/prog_sys_av_tp/executor_reactor/), [PDF](https://malaspinas.academy/prog_sys_av_tp/executor_reactor/executor_reactor.pdf)
+
+---
+
+# Université d'automne
+
+## [Polycopié](https://malaspinas.academy/rust-101/book/)
+
+## [Slides](https://malaspinas.academy/rust-101/slides)
+
+## [Exercices](https://malaspinas.academy/rust-101/exercises)
+
+## [Git](https://gitedu.hesge.ch/orestis.malaspin/rust-101)
+
+:::
+::::::::::::::
+
+---
 
 # Les projets de bachelor passés
 
-## [Astéroides avec algorithme génétique, T. Ibanez](https://dai.ly/x6tosqh)
-## [Pacman, Pong et Phoenix avec technique de renforcement, N. Nufer](https://dai.ly/x6tosqg)
+## 2024
+
+### [F. Burgener, Isochrones des transports publics suisses à partir des données HRDF](https://gradechelor.hesge.ch/2024/documents/BURGENER-674)
+
+### [Y. Niermaréchal, Extraction automatique d'information de plans architecturaux](https://gradechelor.hesge.ch/2024/documents/NIERMAR%C3%89CHAL-693)
+
+## 2023
+
+### [J. Debray, Analyse automatique de plans architecturaux](https://gradechelor.hesge.ch/2023/documents/Debray-626)
+
+### [D. Peiry, Création d'une plateforme de dépôt et d'attribution de projets de semestre/Bachelor](https://gradechelor.hesge.ch/2023/documents/Peiry-648)
+
+## 2022
+
+### [R. Bach, fmpi: An easy-to-use libray using Futhark and MPI to create simple parallel programs](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Bach-575)
+
+### [A. Blancy, HEPIA Virtuel - une plateforme virtuelle pour hepia](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Blancy-578)
+
+### [T. Dagier-Joncour, Simulation de transports publics : l'import de Genève dans A/B street](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Dagier-Joncour-583)
+
+### [D. Fangous, Application d'entraînement pour sportifs et entraîneurs intéractive et modulaire](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/Fangous-586)
+
+### [I. N'Hairi, Modélisation de la population du canton de Genève](https://sitehepia.hesge.ch/diplome/ITI/2022/documents/N'Hairi-605)
+
+## 2021
+
+### [B. Coudray, MPI-Futhark : distributed high-performance computing for people](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Coudray-553)
+
+### [J. Jose Goncalves, Générateur statique d'une plateforme d'apprentissage dynamique](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Jose%20Goncalves-556)
+
+### [T. Kaltrachian, GAN's methods for super-resolution on fluid flow simulation](https://sitehepia.hesge.ch/diplome/ITI/2021/documents/Kaltrachian-570)
+
+## 2020
+
+### [J. Chétélat, Application de triangulation de points lidar sur le canton de Genève](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Ch%C3%A9telat-495)
+
+### [L. De Biasi, Inari, Apprentissage par renforcement appliqué au jeu Dota 2](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/De%20biasi-497)
+
+### [M. El Kharroubi, Cryptographie sur GPU avec le langage Futhark](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/El%20kharroubi-501)
+
+### [T. Pirkl, Outil de scraping de sites internet](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Pirkl-532), [vidéo](https://www.youtube.com/watch?v=RKho4VPnF58)
+
+### [M. Vachon, Développement d'IHM pour la librairie open source Palabos](https://sitehepia.hesge.ch/diplome/ITI/2020/documents/Vachon-537)
+
+## 2019
+
+### [N. Denby, Création d'IHM pour la librairie Palabos](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Denby-449)
+
+### [G. Laurie, Méthode de Boltzmann sur réseau sur GPU en Futhark](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Laurie%20riveros-463)
+
+### [S. Ollquist, Étude et visualisation d'algorithmes de classement de pages Web](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Ollquist-465)
+
+### [A. Vanini, Logiciels et Systèmes complexes](https://sitehepia.hesge.ch/diplome/ITI/2019/documents/Vanini-482)
 
+## 2018
 
-<!-- ## [Programmation séquentielle en Rust](prog_seq/index.html), [git repo](https://githepia.hesge.ch/orestis.malaspin/rust)
+### [T. Ibanez, Astéroides avec algorithme génétique](https://sitehepia.hesge.ch/diplome/ITI/2018/documents/Ibanez-11), [video](https://dai.ly/x6tosqh)
 
-# Exercices programmation séquentielle en Rust
+### [N. Nufer, Construction d'un agent joueur par apprentissage par renforcement](https://sitehepia.hesge.ch/diplome/ITI/2018/documents/Nufer-18), [video](https://dai.ly/x6tosqg)
 
-## TP1 Rust: Nombre secret, [HTML](prog_seq/exercices/01_nombre_secret/), [PDF](prog_seq/exercices/01_nombre_secret/index.pdf)
-## TP2 Rust: Calcul de $\pi$, [HTML](prog_seq/exercices/02_calcul_pi/), [PDF](prog_seq/exercices/02_calcul_pi/index.pdf)
-## TP3 Rust: Tableaux, [HTML](prog_seq/exercices/03_tableaux/), [PDF](prog_seq/exercices/03_tableaux/index.pdf)
-## TP4 Rust: Couverture de la reine, [HTML](prog_seq/exercices/04_reine/), [PDF](prog_seq/exercices/04_reine/index.pdf)
-## TP5 Rust: Puissance 4, [HTML](prog_seq/exercices/05_puissance4/), [PDF](prog_seq/exercices/05_puissance4/index.pdf)
-## TP6 Rust: Listes, [HTML](prog_seq/exercices/06_listes/), [PDF](prog_seq/exercices/06_listes/index.pdf)
-## TP7 Rust: Reed-Solomon, [HTML](prog_seq/exercices/07_reed_solomon/index.html), [PDF](prog_seq/exercices/07_reed_solomon/index.pdf)
-## TP8 Rust: Transformation d'images, [HTML](prog_seq/exercices/08_transformation_images/index.html), [PDF](prog_seq/exercices/08_transformation_images/index.pdf)
-## TP9 Rust: Problème du voyageur de commerce, [HTML](prog_seq/exercices/09_voyageur_commerce/index.html), [PDF](prog_seq/exercices/09_voyageur_commerce/index.pdf) -->
+# [Cours archivés (Prog. Concurrente, Rust, Maths)](archives/index.html)