-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathindex.en.html
More file actions
1001 lines (984 loc) · 113 KB
/
Copy pathindex.en.html
File metadata and controls
1001 lines (984 loc) · 113 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
<!DOCTYPE HTML>
<html lang="en">
<head>
<meta charset="utf-8" />
<title>Lilian Besson - professor of Computer Science</title>
<meta name="viewport" content="width=device-width, initial-scale=1" />
<meta name="author" content="Lilian Besson" />
<meta name="description" content="Professional homepage of Lilian Besson, full time teacher in MP2I in Computer Science, at Lycée Kléber in Strasbourg (France)." />
<!--[if lte IE 8]><script src="assets/js/ie/html5shiv.js"></script><![endif]-->
<link rel="stylesheet" href="assets/css/main.min.css" />
<link rel="stylesheet" href="assets/css/font-awesome.min.css" />
<link rel="stylesheet" href="assets/css/devicon.min.css" />
<!--[if lte IE 9]><link rel="stylesheet" href="assets/css/ie9.min.css"/><![endif]-->
<!--[if lte IE 8]><link rel="stylesheet" href="assets/css/ie8.min.css"/><![endif]-->
<!-- <link rel="stylesheet" href="assets/css/corner-ribbon.css"/> -->
</head>
<body>
<!-- Wrapper -->
<div id="wrapper">
<!-- Ribbon -->
<!-- <div class="corner-ribbon top-right sticky black shadow"> -->
<!-- 🇫🇷 <a href="http://www.editions-vendemiaire.com/catalogue/a-paraitre/kaamelott-un-livre-d-histoire-florian-besson-et-justine-breton-dir/">Un tout nouveau livre <br>sur Kaamelott par mon frère !</a> -->
<!-- 🇫🇷 <a href="https://www.pf-duflos.fr/P1220.aspx?IdPer=652623">Saddened to learn of the departure of one of my comrades </a> from <a href="https://perso.crans.org/besson/agreg-2014/">prépa' agrég' 2013/2014 at ENS Cachan</a>. -->
<!-- Rest in peace <b>Rémi Cheval</b>, you were a very inspiring teacher and human, to your students and loved ones. -->
<!-- </div> -->
<!-- Header -->
<header id="top" class="alt">
<span class="logo">
<img width="15%" style="border: 1px #F6F6F6; border-radius: 50% 50% 50% 50%;" src="images/lbesson.png" alt=""/>
</span>
<h1 class="LilianHandwrittingFont"><a href="http://ipa-reader.xyz/?text=li.lj%C9%91%CC%83%20%5Cb%C9%9B.s%C9%94%CC%83%5C&voice=Mathieu" title="Pronounced « li.ljɑ̃ \bɛ.sɔ̃\e »">Lilian Besson</a></h1>
<p>
Passionate teacher in <b>Computer Science</b>, prof. agrégé in <a href="https://prepas.org/index.php?article=42" target="_blank">MP2I</a> at Lycée Kléber in Strasbourg (France).
<!-- <br> -->
<!-- <a target="_blank" href="../carte-confinement/">Cautious (but not paranoid) about the Covid-19 outbreak</a> (<a title="Me and my colleagues teachers at ENS de Rennes were all working from home. We are teaching about 80% at distance, with web-based tools. We should all stay cautious!" href="https://perso.crans.org/besson/coronavirus.en.html">no longer working from home!</a>). -->
</p>
<ul class="icons">
<li><a title="Home" target="_blank" href="https://perso.crans.org/besson/index.html" class="icon fa-home alt"><span class="label">Home</span></a></li>
<li><a title="Email" target="_blank" href="mailto:Lilian.Besson_AT_crans_DOT_org" class="icon fa-envelope alt"><span class="label">Email</span></a></li>
<li><a title="GitHub" target="_blank" href="https://GitHub.com/Naereen" class="icon fa-github alt"><span class="label">GitHub</span></a></li>
<li><a title="Bitbucket" target="_blank" href="https://Bitbucket.org/lbesson" class="icon fa-bitbucket alt"><span class="label">Bitbucket</span></a></li>
<li><a title="Google Scholar" target="_blank" href="https://scholar.google.com/citations?user=bt3upq8AAAAJ" class="icon fa-google alt"><span class="label">Google Scholar</span></a></li>
<li><a title="CV HAL" target="_blank" href="https://cv.archives-ouvertes.fr/lilian-besson" class="icon fa-graduation-cap alt"><span class="label">CV HAL</span></a></li>
<li><a title="Contact information" target="_blank" href="https://perso.crans.org/besson/callme.html" class="icon fa-address-card-o alt"><span class="label">Contact information</span></a></li>
<li><a title="Wikipedia" target="_blank" href="https://en.wikipedia.org/wiki/User:Naereen" class="icon fa-wikipedia-w alt"><span class="label">Wikipedia</span></a></li>
<li><a title="Phone" target="_blank" href="tel:+330628412257" class="icon fa-phone alt"><span class="label">Phone</span></a></li>
<li><a title="🇫🇷 Version française ?" href="index.fr.html" class="icon fa-language alt"><span class="label">🇫🇷 Version française ?</span></a></li>
</ul>
</header>
<!-- Nav -->
<nav id="nav">
<ul>
<li><a target="_blank" href="#top" class="active">Top</a></li>
<li><a target="_blank" href="#bio">Bio</a></li>
<li><a target="_blank" href="#news">News</a></li>
<li><a target="_blank" href="#research">Research</a></li>
<li><a target="_blank" href="#publications">Publications</a></li>
<li><a target="_blank" href="#teaching">Teaching</a></li>
<li><a target="_blank" href="#code">Code</a></li>
<li><a target="_blank" href="#contact">Contact</a></li>
</ul>
</nav>
<!-- Main -->
<div id="main">
<!-- Introduction -->
<section id="bio" class="main">
<div class="spotlight">
<div class="content">
<header class="major">
<h2>📜 <a target="_blank" href="bio.en.txt" title="You can download a short text file containing a short bio for myself (Lilian Besson), if you need.">Short Bio</a></h2>
</header>
<p>
<span title="This warm « Hello ! » is displayed with a custom font looking like my handwriting, that I created in March 2018 with the free and open-source software Fontify, on which I worked. Check out https://github.com/Naereen/fontify for more details!" class="LilianHandwrittingFont" style="font-size:125%;">Hello !</span> I am <strong>Lilian Besson</strong>, teacher-coder at Kléber high school in Strasbourg (France) in the MP2I class, since September 2021.
Before starting to work in CPGE (prépa) I taught at <a target="_blank" href="http://www.ens-rennes.fr/">ENS Rennes</a> for two years.
I am professor "agrégé" in mathematics, and former student in mathematics and computer science from <a target="_blank" href="http://www.ens-cachan.fr/version-anglaise/">ENS de Cachan</a>.
I am a passionate programmer, ecologist and open-source enthusiast, and currently professor in computer science in <a target="_blank" href="https://prepas.org/index.php?article=42">classes préparatoires MP2I</a> in 2021 in France.
I also love to <a target="_blank" href="https://besson.link/cuisine/">cook</a> and meet people, to travel and exchange, to bike or hike,
and to play Magic: the Gathering (really awesome Trading Cards Game).
<!-- and I am <a target="_blank" href="https://en.wikipedia.org/wiki/Alignment_(Dungeons_%26_Dragons)#Chaotic_good">chaotic-good</a> (even IRL). -->
<!-- , and I try to be the nicest possible human being every day of my life ✌. -->
<!-- 👨 I use the <a href="https://pronoun.is/he/him/his/his/himself" target="_blank">he/him pronouns</a>. -->
<br><br>
From August 2019 to August 2021, I was a junior professor (agrégé) at <a href="http://www.dit.ens-rennes.fr/lilian-besson--292020.kjsp" target="_blank">ENS Rennes</a>, in charge of the class <a href="https://perso.crans.org/besson/agreg-2019/" target="_blank">preparing the "agrégation" national exam</a>, with a major in mathematics and a minor in computer science, level M2, and in charge of lectures for <a href="https://perso.crans.org/besson/info1_algo1_2019/">introduction and advanced algorithms</a>.
<!-- <br> -->
<!-- I also was an associate researcher with the <a href="https://team.inria.fr/panama/team-members/" target="_blank">PANAMA team</a> at <a href="https://www.irisa.fr/" target="_blank">IRISA</a> and <a href="https://www.inria.fr/centre/rennes" target="_blank">INRIA Rennes</a>. My research interests lie between sequential learning, tensor decomposition, cognitive radio, Python and open source software, and other directions. -->
<br><br>
Between <em>October 2016</em> and <em>November 2019</em>:
</p>
<ul class="simple">
<li>
I was pursuing <a target="_blank" href="https://perso.crans.org/besson/phd/">my PhD</a> at CentraleSupélec (<a target="_blank" href="http://www-scee.rennes.supelec.fr/">SCEE team</a>, <a target="_blank" href="https://www.ietr.fr/spip.php?auteur1069">IETR lab</a>)
in Rennes (France), with <a target="_blank" href="https://moychris.wordpress.com/">Christophe Moy</a> and <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">Émilie Kaufmann</a> (<a target="_blank" href="https://team.inria.fr/sequel/team-members/">CNRS & Inria, SequeL team, CRIStAL lab, at Lille</a>). My PhD is on multi-players multi-arms bandits models applied to radio-telecommunication, especially
Internet-of-Things problems.
I defended in November, and I now hold a PhD in telecommunications.
My <a href="https://perso.crans.org/besson/articles/PhD_thesis__Lilian_Besson.pdf" target="_blank">PhD thesis is here</a> and the slides used for my defense are <a href="https://perso.crans.org/besson/slides/2019_11__PhD_Defense__Multi-players_Bandit_Algorithms_for_Internet_of_Things_Networks/slides.pdf" target="_blank">there</a>.
</li>
<li>
And I was <a target="_blank" href="https://perso.crans.org/besson/teaching.en.html">teaching</a> theoretical computer science at <a target="_blank" href="http://www.dit.ens-rennes.fr/agregation-option-d/">ENS Rennes</a> (for a class preparing for the "agrégation" national exam, level M2) and <a target="_blank" href="http://www.ensai.fr/formation/id-1re-annee.html">ENSAI</a> (complexity and calculabilty, level L3).
</li>
</ul>
<ul class="actions">
<li>
<a target="_blank" href="https://perso.crans.org/besson/cv.en.pdf" class="button"><i class="icon fa-file-pdf-o"></i> Résumé (English)</a>
</li>
<li>
<a target="_blank" href="https://perso.crans.org/besson/cv.fr.pdf" class="button"><i class="icon fa-file-pdf-o"></i> Curriculum Vitæ (Français)</a>
</li>
</ul>
</div>
<span class="image">
<img src="images/lbesson.png" alt="Fake picture of me" title="Fake picture of me. I love Link from « The Legend of Zelda » games. And I don't like pictures of me. That's it!"/>
</span>
</div>
</section>
<!-- First Section -->
<section id="news" class="main special">
<header class="major">
<h2>📰 News</h2>
</header>
<ul class="features">
<li>
<span class="icon major style1 fa-handshake-o"></span>
<h3>April 2021</h3>
<p>
I have been promoted to a life-time full-teaching position, as a professor of Computer Science, in <a type="_blank" href="https://lycee-kleber.com.fr/">Lycée Kléber</a> in <a type="_blank" href="https://en.wikipedia.org/wiki/Strasbourg">Strasbourg</a>, where I'll live from August 2021.
I'll be in charge of one class of 50 bac+1 students in a new program called <a type="_blank" href="https://prepas.org/index.php?article=42">MP2I</a> !
</p>
</li>
<li>
<span class="icon major style2 fa-book"></span>
<h3>August 2020</h3>
<p>
<a type="_blank" href="https://www.dunod.com/prepas-concours/131-developpements-pourl-oral-agregation-externe-mathematiquesinformatique"><em>« <b>131 développements pour l'oral</b>, Agrégation externe Mathématiques/Informatique »</em></a>
I helped a little bit for this 944-pages book, <a type="_blank" href="https://www.dunod.com/prepas-concours/131-developpements-pourl-oral-agregation-externe-mathematiquesinformatique">published at Éditions Dunod in August 2020</a>, with former students of mine from ENS Rennes, comrades from ENS Cachan, and friends. Congrats to them!
</p>
</li>
<li>
<span class="icon major style3 fa-handshake-o"></span>
<h3>September, 2019</h3>
<p>
I have finished my contract as PhD student, I'll work for two years as <a target="_blank" href="http://www.ens-rennes.fr/recrutements/recrutement-agpr-au-departement-informatique-291278.kjsp">junior professor (agrégé)</a> at <a target="_blank" href="http://www.dit.ens-rennes.fr/l-equipe/">École Normale Supérieure de Rennes</a>, within the <a target="_blank" href="http://www.dit.ens-rennes.fr/l-equipe/">Computer Science Department</a>.
I teach <a target="_blank" href="https://perso.crans.org/besson/info1_algo1_2019/">Algorithms</a> and theoretical computer science.
</p>
</li>
<li>
<span class="icon major style3 fa-graduation-cap"></span>
<h3>November, 2019</h3>
<p>
I have defended my PhD thesis on the 20th of November 2019!
You can read <a type="_blank" href="https://tel.archives-ouvertes.fr/tel-02491380">the thesis</a>!
I've also been <a type="_blank" href="https://www.galaxie.enseignementsup-recherche.gouv.fr/ensup/CNU_qualification.htm">qualified</a> for <a type="_blank" href="https://www.conseil-national-des-universites.fr/cnu/#/">CNU</a> in sections 26 (applied maths), 27 (computer science) and 61 (signal processing and telecommunications), for four years.
</p>
</li>
<li>
<span class="icon major style4 fa-book"></span>
<h3>March, 2018</h3>
<p>
I <abbr title="Under the MIT Open-Source License, see https://lbesson.mit-license.org/ for more details.">released</abbr> the <a target="_blank" href="https://SMPyBandits.GitHub.io/">📃 documentation</a> and the <a target="_blank"
href="https://github.com/SMPyBandits/SMPyBandits/">🗄 full code</a> of my numerical environments for Multi-Armed Bandits problems 🎰, <b><abbr title="SMPyBandits: Open-Source Python package for Single- and Multi-Players multi-armed Bandits algorithms.">SMPyBandits</abbr></b>.
</p>
</li>
<li>
<span class="icon major style5 fa-graduation-cap"></span>
<h3>October, 2016</h3>
<p>
I started my Ph.D. ! I am fully funded for 3 years, with a grant from the Ministry of Higher Education and Research. Thanks to them!
<em>I'm done! I now hold a PhD, I'm a doctor in Computer Science and Telecommunications!</em>
</p>
</li>
</ul>
</section>
<!-- Research Section -->
<section id="research" class="main">
<header class="major">
<h2>🔬 Research</h2>
<p>
For my Ph.D., my research is in applied machine learning, focused on low-cost online learning algorithm with limited feedback (bandit feedback), mainly applied to cognitive radio problems for Opportunistic Spectrum Access and setting up reliable network
access protocol for the future Internet of Things networks. By studying and applying classical and recent Multi-Armed Bandit algorithms to carefully designed radio models, we are able to prove some performance guarantees, both numerically
in simulations and theoretically with statistical proofs.
<br>
I'll continue to do research after my PhD, I've joined in September 2019 the <a target="_blank" href="https://team.Inria.fr/panama/">PANAMA team</a> at <a target="_blank" href="https://www.IRISA.fr/">IRISA laboratory</a> in Rennes!
</p>
</header>
<ul class="statistics">
<li class="style1">
<span class="icon fa-commenting-o"></span>
<strong>14</strong> Research talks and posters
<br> (since 2017)
</li>
<li class="style2">
<span class="icon fa-files-o"></span>
<strong>10</strong> Research articles
<br> (9 published, 1 sent)
</li>
<li class="style3">
<span class="icon fa-handshake-o"></span>
<strong>2</strong> PhD advisors
<br>and collaboration with 2 PhD student and postdoc
</li>
<li class="style4">
<span class="icon fa-graduation-cap"></span>
<strong>2</strong> Higher Education institutes where I teach in Rennes
</li>
<li class="style5">
<span class="icon fa-code-fork"></span>
<strong>1</strong> <a href="https://github.com/SMPyBandits/SMPyBandits">Research software</a>
<br> (and <em>many</em> <a href="#code">personal projects!</a>)
</li>
</ul>
<!-- <h2>🚔 Students</h2>
<ol reversed="reversed">
<li>
Robin (2019-)<br>
Ph.D. student co-supervised with <a target="_blank" href="XXX">Batman</a> • <a target="_blank" href="XXX">Université d'Arkham</a> and <a target="_blank" href="http://XXX">Wayne Co.</a>.
</li>
</ol>
-->
</section>
<!-- Publications -->
<section id="publications" class="main">
<header class="major">
<h2>📚 Publications</h2>
<p>
<a target="_blank" href="https://orcid.org/0000-0003-2767-2563" title="Orcid: a universal identifier for every researcher around the world">
<img src="images/orcid.png" alt="Orcid.org logo"> Orcid
</a>
• <a target="_blank" href="https://arxiv.org/search/?searchtype=author&query=Besson%2C+Lilian" title="List of my publications on arXiv"><i class="icon fa-link"></i> arXiv</a>
• <a target="_blank" title="List of my publications on DBLP" href="https://dblp.org/pid/210/2613.html">
<img src="images/dblp.png" alt="DBLP" width="40" height="40"> DBLP
</a>
• <a target="_blank" href="https://hal.inria.fr/search/index/q/*/authIdHal_s/lilian-besson" title="List of my publications on HAL"><i class="icon fa-link"></i> IdHAL</a>
• <a target="_blank" href="https://scholar.google.fr/citations?user=bt3upq8AAAAJ" title="List of my publications on Google Scholar"><span class="icon fa-google"></span> Google Scholar</a>
<!-- • <a target="_blank"href="https://www.researchgate.net/profile/Lilian_Besson"><i class="icon fa-user-circle"></i> ResearchGate</a> -->
• <a target="_blank" href="https://haltools.inria.fr/Public/afficheRequetePubli.php?auteur_exp=Lilian%2C+Besson&CB_auteur=oui&CB_titre=oui&CB_article=oui&langue=Anglais&tri_exp=annee_publi&tri_exp2=typdoc&tri_exp3=date_publi&ordre_aff=TA&Fen=Rech&lang=fr&Formate=Oui&css=../css/VisuCondense.css" title="List of my publications on HAL Tools"><i class="icon fa-link"></i> HALtools</a>
<br><a target="_blank" href="https://perso.crans.org/besson/articles/" title="List of my publications on my website, with free PDF of every articles"><i class="icon fa-file-pdf-o"></i> List of the PDF of my articles</a>
</p>
</header>
<h3>Journal papers</h3>
<ol reversed="reversed">
<li>
<strong>L. Besson</strong>, <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a>, <a target="_blank" href="http://odalricambrymmaillard.neowordpress.fr/">O-A. Maillard</a> & <a target="_blank" href="https://fr.linkedin.com/in/julien-seznec-29364a104">J. Seznec</a>.
<br>
<em>Efficient Change-Point Detection for Tackling Piecewise-Stationary Bandits</em>.
<br>
Accepted in the <a href="https://jmlr.org/papers/v23/">Journal of Machine Learning Research</a> volume 23, in 2022.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__BGLRT-klUCB_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-02006471/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__BGLRT-klUCB_2019/"><i class="icon fa-mobile"></i> Mobile version</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_06__About_Bernoulli_GLRTest__Seminar_at_PANAMA_IRISA_Rennes/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://scholar.google.com/scholar?oi=bibs&cites=6921709849721019261" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 100</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1902.01575"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02006471"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02006471/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
<!-- • [ <a target="_blank" href="https://bitbucket.org/lbesson/combining-the-generalized-likelihood-ratio-test-and-kl-ucb-for/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ] -->
• [ <a target="_blank" href="https://github.com/EmilieKaufmann/PiecewiseStationaryBandits"><i class="icon fa-code"></i> Code</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ] -->
</li>
<li>
<a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a> & <strong>L. Besson</strong> & G. Delbarre & L. Toutain.
<br>
<em>Decentralized Spectrum Learning for Radio Collision Mitigation in Ultra-Dense IoT Networks: LoRaWAN Case Study and Measurements</em>.
<br>
Accepted to a special volume of <a target="_blank" href="https://annalsoftelecommunications.wp.imt.fr">the Annals of Telecommunications</a> journal, on "Machine Learning for Intelligent Wireless Communications and Networking", August 2020.
<!-- <br> -->
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/MBDT__Annales_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF*</a> ] -->
[ <a target="_blank" href="http://link.springer.com/article/10.1007/s12243-020-00795-y"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/articles/MBDT__Annales_2019/"><i class="icon fa-mobile"></i> Version mobile</a> ] -->
<!-- • [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ] -->
• [ <a target="_blank" href="https://hal.inria.fr/hal-02956350"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02956350/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:blknAaTinKkC" title="Mise à jour manuelle du total de citations, dernier changement 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 18</a> ]
<!-- • [ <a target="_blank" href="https://bitbucket.org/lbesson/XXX"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ] -->
• [ <a target="_blank" href="https://doi.org/10.1007/s12243-020-00795-y"><i class="icon fa-key"></i> DOI</a> ]
</li>
</ol>
<h3>Preprints or in process of submissions</h3>
<ol reversed="reversed">
<!-- <li>
<strong>L. Besson</strong> et al.
<em>Awesome title</em>.
May 2018.
<br>
[ <a target="_blank" href="https://perso.crans.org/besson/articles/article1.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://XXX"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://XXX"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://XXX"><i class="icon fa-code"></i> Code</a> ]
</li> -->
<li>
<strong>L. Besson</strong> & <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a>.
<br>
<em>What Doubling-Trick Can and Can't Do for Multi-Armed Bandits</em>.
September 2018.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__DoublingTricks_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-01736357/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__DoublingTricks_2019/"><i class="icon fa-mobile"></i> Mobile version</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_XXX__Presentation_XXX/slides_169.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides (TODO)</a> ] -->
• [ <a target="_blank" href="https://scholar.google.com/scholar?oi=bibs&cites=8164194064551345600" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 150</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1803.06971"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01736357"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01736357/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/what-doubling-tricks-can-and-cant-do-for-multi-armed-bandits/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://SMPyBandits.GitHub.io/DoublingTrick.html"><i class="icon fa-code"></i> Code</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ] -->
</li>
<li>
<strong>L. Besson</strong>.
<em>🔬 🎰 SMPyBandits: an Open-Source Research Framework for Single and Multi-Players Multi-Arms Bandits (MAB) Algorithms in Python</em>.
July 2018.
<!-- (Refused at <a href="http://jmlr.org/mloss/">JMLR MLOSS</a>, I'll try again maybe later?) -->
<i class="force-right">
<a class="icon" href="https://pypi.org/project/SMPyBandits"><img alt="PyPI version" src="https://img.shields.io/pypi/v/smpybandits.svg"></a>
<!-- <a class="icon" href="https://SMPyBandits.ReadTheDocs.io/en/latest/?badge=latest"><img alt="Documentation Status" src="https://readthedocs.org/projects/smpybandits/badge/?version=latest"></a> -->
<!-- <a class="icon" href="https://travis-ci.org/SMPyBandits/SMPyBandits"><img alt="Build Status" src="https://travis-ci.org/SMPyBandits/SMPyBandits.svg?branch=master"></a> -->
<a class="icon" href="https://github.com/SMPyBandits/SMPyBandits/network/"><img src="https://img.shields.io/github/forks/SMPyBandits/SMPyBandits.svg?style=social&label=Fork&maxAge=2592000" alt="GitHub forks"/></a> <a class="icon" href="https://github.com/SMPyBandits/SMPyBandits/stargazers/"><img src="https://img.shields.io/github/stars/SMPyBandits/SMPyBandits.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/SMPyBandits/SMPyBandits/watchers/"><img src="https://img.shields.io/github/watchers/SMPyBandits/SMPyBandits.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
<br> [ <a target="_blank" href="https://hal.inria.fr/hal-01840022/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ] [
<a target="_blank" href="https://perso.crans.org/besson/articles/SMPyBandits__Long_Version__02-2018.pdf"><i class="icon fa-file-pdf-o"></i> PDF (long version)</a> ]
<!-- • [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ] -->
• [ <a target="_blank" href="https://scholar.google.com/scholar?oi=bibs&cites=12147263690905554676" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 31</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01840022"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/SMPyBandits.bib"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://github.com/SMPyBandits/SMPyBandits"><i class="icon fa-code"></i> Code</a> ]
• [ <a target="_blank" href="https://SMPyBandits.GitHub.io/"><i class="icon fa-book"></i> Documentation</a> ]
</li>
<li>
<strong>L. Besson</strong>.
<em>A Note on the Ei Function and a Useful Sum-Inequality</em>.
February 2018.
<br> [ <a target="_blank" href="https://hal.inria.fr/hal-01847480/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
<!-- • [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ] -->
• [ <a target="_blank" href="https://hal.inria.fr/hal-01847480"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01847480/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://nbviewer.jupyter.org/github/Naereen/notebooks/blob/master/Exponential_Integral_Python.ipynb"><i class="icon fa-code"></i> Code</a> ]
</li>
</ol>
<!-- <h3>International peer-reviewed journals</h3>
<center>(not yet)</center> -->
<!-- <ol reversed="reversed">
<li>
<strong>L. Besson</strong> et al.
<em>Awesome title</em>.
May 2018.
<br>
[ <a target="_blank" href="https://perso.crans.org/besson/articles/article1.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-XXX"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-XXX/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://XXX"><i class="icon fa-code"></i> Code (not yet)</a> ]
• [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ]
</li>
</ol> -->
<h3>Communications in National Conferences (in France)</h3>
<ol reversed="reversed">
<li>
L. Ly & <strong>L. Besson</strong> & <a target="_blank" href="https://vertmo.org/">B. Pesin</a> & <a target="_blank" href="https://www.lip6.fr/Emmanuel.Chailloux/">E. Chailloux</a>.
<br>
<em>Programmer en OCaml pour et sur les calculatrices Numworks</em> (in French).
<br>
<strong>JFLA 2026</strong> - 37th "<em>Journées Francophones des Langages Applicatifs</em>, Marie Kerjean; Yannick Zakowski, January 2026, Oberbronn, Alsace, France.
<!-- January 2026. -->
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/LBPC_JFLA26.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.science/hal-05428160/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/articles/LBPC_JFLA26/"><i class="icon fa-mobile"></i> Mobile version</a> ] -->
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2026_01__LBPC_JFLA26/slides.en.pdf"><i class="icon fa-file-powerpoint-o"></i> 🇬🇧 Slides</a> ] -->
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2026_01__LBPC_JFLA26/slides.fr.pdf"><i class="icon fa-file-powerpoint-o"></i> 🇫🇷 Slides</a> ] -->
• [ <a target="_blank" href="https://hal.inria.fr/hal-05428160"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-05428160/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&cstart=20&pagesize=80&citation_for_view=bt3upq8AAAAJ:J_g5lzvAfSwC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 0</a> ]
<!-- • [ <a target="_blank" href="https://github.com/NaVeeDev/jfla2026/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ] -->
• [ <a target="_blank" href="https://github.com/Vertmo/OMicroB/tree/numworks"><i class="icon fa-code"></i> Code</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ] -->
</li>
<li>
<strong>L. Besson</strong> & <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a>.
<br>
<em>Analyse non asymptotique d'un test séquentiel de détection de ruptures et application aux bandits non stationnaires</em> (in French).
<br>
GRETSI, Lille, France. August 2019.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__GRETSI_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-02152243/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__GRETSI_2019/"><i class="icon fa-mobile"></i> Mobile version</a> ] -->
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_06__About_Bernoulli_GLRTest__Seminar_at_PANAMA_IRISA_Rennes/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> 🇬🇧 Slides</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_08__Bernoulli_GLRTest_and_PieceWise-Stationary_Bandits__GRETSI_2019_Lille/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> 🇫🇷 Slides</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02152243"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02152243/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/gretsi-2019-detection-de-ruptures-en-ligne-avec-le-test-glr"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://smpybandits.github.io/NonStationaryBandits.html"><i class="icon fa-code"></i> Code</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ] -->
</li>
</ol>
<h3>Communications in International Conferences</h3>
<ol reversed="reversed">
<li>
<a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a> & <strong>L. Besson</strong>.
<br>
<em>Decentralized Spectrum Learning for IoT Wireless Networks Collision Mitigation</em>.
<br>
<a target="_blank" href="https://sites.google.com/view/ISIoT2019/">1st ISIoT workshop</a> at the <a target="_blank" href="https://dcoss.org/">DCOSS</a> conference, Santorini, Greece. May 2019.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/MB__ISIoT_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF*</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-02144465/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/articles/MB__ISIoT_2019/"><i class="icon fa-mobile"></i> Version mobile</a> ] -->
• [ <a target="_blank" href="https://arxiv.org/abs/1906.00614"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02144465"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02144465/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:-f6ydRqryjwC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 14</a> ]
<!-- • [ <a target="_blank" href="https://bitbucket.org/lbesson/XXX"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ] -->
• [ <a target="_blank" href="https://doi.org/10.1109/DCOSS.2019.00117"><i class="icon fa-key"></i> DOI</a> ]
</li>
<li>
<a target="_blank" href="https://fr.linkedin.com/in/r%C3%A9mi-bonnefoi-010a4466">R. Bonnefoi</a>, <strong>L. Besson</strong>, J. Manco-Vasquez & <a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a>.
<br>
<em>Upper-Confidence Bound for Channel Selection in LPWA Networks with Retransmissions</em>.
<br>
<a target="_blank" href="https://sites.google.com/view/wcncworkshop-motion2019/">1st MoTION workshop</a> at <a target="_blank" href="http://wcnc2019.ieee-wcnc.org/authors/call-papers">WCNC</a>, Marrakech, Morocco. April 2019.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BMBM__IEEE_WCNC_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-02049824/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BMBM__IEEE_WCNC_2019/"><i class="icon fa-mobile"></i> Mobile</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1902.10615"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02049824"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02049824/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:IWHjjKOFINEC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 9</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_04__Presentation_IEEE_WCNC__MoTION_Workshop/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/reinforcement-learning-for-retransmissions-in-aloha-like"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://bitbucket.org/scee_ietr/ucb_smart_retrans/"><i class="icon fa-file-archive-o"></i> Code (MATLAB)</a> ]
• [ <a target="_blank" href="https://doi.org/10.1109/WCNCW.2019.8902891"><i class="icon fa-key"></i> DOI</a> ]
</li>
<li>
<strong>L. Besson</strong>, <a target="_blank" href="https://fr.linkedin.com/in/r%C3%A9mi-bonnefoi-010a4466">R. Bonnefoi</a> & <a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a>.
<br>
<em>GNU Radio Implementation of MALIN: "Multi-Armed bandits Learning for Internet-of-things Network"</em>.
<br>
<a target="_blank" href="http://wcnc2019.ieee-wcnc.org/authors/call-papers">WCNC (Wireless Communication and Networks Conference)</a>, Marrakech, Morocco. April 2019.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BBM__IEEE_WCNC_2019.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-02006825/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BBM__IEEE_WCNC_2019/"><i class="icon fa-mobile"></i> Mobile version</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1902.01734"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://youtube.com/watch?v=HospLNQhcMk"><i class="icon fa-youtube"></i> YouTube Video</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02006825"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02006825/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:7PzlFSSx8tAC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 14</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2019_04__Presentation_IEEE_WCNC__Demo_ICT_2018/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/gnu-radio-implementation-of-malin-multi-arm-bandits-learning/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://bitbucket.org/scee_ietr/malin-multi-armed-bandit-learning-for-iot-networks-with-grc/"><i class="icon fa-file-archive-o"></i> Code (GNU Radio)</a> ]
• [ <a target="_blank" href="https://doi.org/10.1109/WCNC.2019.8885841"><i class="icon fa-key"></i> DOI</a> ]
</li>
<li>
<strong>L. Besson</strong>, <a target="_blank" href="https://fr.linkedin.com/in/r%C3%A9mi-bonnefoi-010a4466">R. Bonnefoi</a> & <a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a>.
<br>
<em>MALIN: Multi-Arm bandit Learning for Iot Networks with GRC: A TestBed Implementation and Demonstration that Learning Helps</em>.
<br> Demonstration presented at the <a target="_blank" href="http://ict-2018.org/call-for-demos/">ICT (International Conference on Communication)</a>, Saint-Malo, France. June 2018.
<br>
[ <a target="_blank" href="https://perso.crans.org/besson/articles/BBM__Demo_ICT_2018.pdf" title="Available upon request, please send me an email to Lilian[dot]Besson[at]ENS-Rennes[dot]fr, and I can share the article with you!"><i class="icon fa-file-pdf-o"></i> PDF*</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02013866/document"><i class="icon fa-file-image-o"></i> Poster</a> ]
<!-- • [ <a target="_blank" href="https://perso.crans.org/besson/articles/BBM__Demo_ICT_2018/"><i class="icon fa-mobile"></i> Mobile version</a> ] -->
• [ <a target="_blank" href="https://youtube.com/watch?v=HospLNQhcMk"><i class="icon fa-youtube"></i> YouTube Video</a> ]
• [ <a target="_blank" href="https://bitbucket.org/scee_ietr/malin-multi-armed-bandit-learning-for-iot-networks-with-grc/"><i class="icon fa-file-archive-o"></i> Code (GNU Radio)</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:Wp0gIr-vW9MC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 14</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX"><i class="icon fa-key"></i> DOI</a> ] -->
<details style="margin-left:3%;">
<summary>More details…</summary>
The demo implements a toy wireless system, with one <em>IoT object</em> communicating with a gateway (or base station) and trying to find the frequency channel which is the less perturbated by a random interfering traffic,
by using reinforcement learning. We use three <a href="http://files.ettus.com/manual/page_usrp2.html">USRP cards by National Instruments</a> for the random traffic, the IoT object and the gateway. It is based on our <a target="_blank"
href="https://hal.inria.fr/hal-01575419">CROWNCOM 2017 article</a>. See also <a href="https://hal.inria.fr/hal-02013866/document" target="_blank">this document</a>. Here is a 5-minute video I made to explain this demonstration.
<center><iframe width="640" height="360" src="https://www.youtube.com/embed/HospLNQhcMk" frameborder="0" allow="autoplay; encrypted-media" allowfullscreen></iframe></center>
</details>
</li>
<li>
<strong>L. Besson</strong> & <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a>.
<br>
<em>Multi-Player Bandits Revisited</em>.
<br>
<a target="_blank" href="http://www.cs.cornell.edu/conferences/alt2018/accepted.html">ALT</a>, Lanzarote, Canari Islands, April 2018.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__ALT_2018.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
<!-- [ <a target="_blank" href="http://proceedings.mlr.press/v83/besson18a/besson18a.pdf"><i class="icon fa-file-pdf-o"></i> PDF (PMLR)</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-01629733/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__ALT_2018/"><i class="icon fa-mobile"></i> Mobile version</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BK__ALT_2018__Erratum_Lower-Bound.pdf"><i class="icon fa-file-pdf-o"></i> Erratum (2019)</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2018_04__Presentation_at_ALT_2018_conference/slides_169.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02013847/document"><i class="icon fa-file-image-o"></i> Poster</a> ]
• [ <a target="_blank" href="https://scholar.google.com/scholar?oi=bibs&cites=17456082541999604695" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 138 + 3</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1711.02317"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01629733"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01629733/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/multi-player-bandits-revisited/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://SMPyBandits.GitHub.io/MultiPlayers.html"><i class="icon fa-code"></i> Code</a> ]
<!-- • [ <a target="_blank" href="https://doi.org/XXX/XXX.XXX"><i class="icon fa-key"></i> DOI (not yet)</a> ] -->
<details style="margin-left:3%;">
<summary>Presented a few times…</summary>
<span style="color:gray;">
In 2017 and 2018, I presented different versions of <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2017_12__Presentation_Inria_Lille_SequeL_Seminar/slides_169.pdf">these slides</a>
for a <a target="_blank" href="https://team.inria.fr/sequel/seminar/">SequeL seminar in Lille</a> on <a target="_blank" href="http://seminaire.univ-lille1.fr/node/264">December 22th</a>,
for the <a target="_blank" href="http://www.cs.cornell.edu/conferences/alt2018/accepted.html">ALT conference in Lanzarote (Spain)</a> on April 8th 2018,
and I presented <a target="_blank" href="https://hal.inria.fr/hal-02013847/document">this poster</a> for a <a target="_blank" href="www.erim.eur.nl/e-code-erasmus-centre-for-optimization-of-digital-experiments/workshop-on-multi-armed-bandits-and-learning-algorithms/">Workshop on Multi-Armed Bandits and Learning Algorithms</a> on May 24th 2018 in Rotterdam School of Management (Erasmus University, Netherlands), for the <a target="_blank" href="https://www.ietr.fr/">IETR lab "PhD Students Day"</a> on June 15th 2018 (Vannes, France), and one last time for the <a target="_blank" href="http://cimi.univ-toulouse.fr/optimisation/en/workshop-optimization-and-machine-learning">Workshop Optimization and Learning</a> on September 10th 2018 in University de Toulouse in Toulouse (France).
</span>
</details>
</li>
<li>
<strong>L. Besson</strong>, <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a> & <a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a>.
<br>
<em>Aggregation of Multi-Armed Bandits learning algorithms for Opportunistic Spectrum Access</em>.
<br>
<a target="_blank" href="http://wcnc2018.ieee-wcnc.org/">IEEE WCNC</a>, Barcelona, Spain. April 2018.
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BKM__IEEE_WCNC_2018.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
• [ <a target="_blank" href="https://hal.inria.fr/hal-01705292/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BKM__IEEE_WCNC_2018/"><i class="icon fa-mobile"></i> Mobile version</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2018_04__Presentation_IEEE_WCNC/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
<!-- • [ <a target="_blank" href="https://arxiv.org/abs/XXX"><i class="icon fa-link"></i> arXiv</a> ] -->
• [ <a target="_blank" href="https://hal.inria.fr/hal-01705292"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01705292/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:M3ejUd6NZC8C" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 7</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/aggregation-of-multi-armed-bandits-learning-algorithms-for/"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://SMPyBandits.GitHub.io/Aggregation.html"><i class="icon fa-code"></i> Code</a> ]
• [ <a target="_blank" href="https://doi.org/10.1109/wcnc.2018.8377070"><i class="icon fa-key"></i> DOI</a> ]
• [ <a href="https://ieeexplore.ieee.org/document/8377070"><i class="icon fa-book"></i> Proceedings</a> ]
</li>
<li>
<a target="_blank" href="https://fr.linkedin.com/in/r%C3%A9mi-bonnefoi-010a4466">R. Bonnefoi</a>, <strong>L. Besson</strong>, <a target="_blank" href="https://moychris.wordpress.com/">C. Moy</a>, <a target="_blank" href="http://chercheurs.lille.inria.fr/ekaufman/research.html">E. Kaufmann</a> & <a target="_blank" href="https://www.ietr.fr/spip.php?auteur223">J. Palicot</a>.
<br>
<em>Multi-Armed Bandit Learning in IoT Networks and non-stationary settings</em>.
<br>
<a target="_blank" href="http://crowncom.org/2017/">CrownCom</a>, Lisboa, Portugal. September 2017.
<strong>Best Paper Award!</strong>
<br>
<!-- [ <a target="_blank" href="https://perso.crans.org/besson/articles/BBMKP_CROWNCOM_2017.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ] -->
[ <a target="_blank" href="https://hal.inria.fr/hal-01575419/document"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/articles/BBMKP_CROWNCOM_2017/"><i class="icon fa-mobile"></i> Mobile version</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2017_09__Presentation_article_CrownCom_Conference/slides_169.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-02013839/document"><i class="icon fa-file-image-o"></i> Poster</a> ]
• [ <a target="_blank" href="https://scholar.google.com/scholar?oi=bibs&cites=5982914347412750983" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 119</a> ]
• [ <a target="_blank" href="https://arxiv.org/abs/1807.00491"><i class="icon fa-link"></i> arXiv</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01575419"><i class="icon fa-tag"></i> HAL</a> ]
• [ <a target="_blank" href="https://hal.inria.fr/hal-01575419/bibtex"><i class="icon fa-file-text-o"></i> BibTeX</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/multi-armed-bandit-learning-in-iot-networks-learning-helps"><i class="icon fa-file-archive-o"></i> Code (LaTeX)</a> ]
• [ <a target="_blank" href="https://bitbucket.org/scee_ietr/rl_slotted_iot_networks"><i class="icon fa-code"></i> Code (MATLAB)</a> ]
• [ <a target="_blank" href="https://doi.org/10.1007/978-3-319-76207-4_15"><i class="icon fa-key"></i> DOI</a> ]
• [ <a href="https://www.springer.com/us/book/9783319762067"><i class="icon fa-book"></i> Proceedings</a> ]
<details style="margin-left:3%;">
<summary>Presented a few times…</summary>
<span style="color:gray;">
In 2017 I presented different versions of <a target="_blank" href="https://perso.crans.org/besson/publis/slides/2017_09__Presentation_article_CrownCom_Conference/slides_169.pdf">these slides</a>
for a <a target="_blank" href="https://team.inria.fr/sequel/seminar/">SequeL seminar in Lille</a> on September 15th,
for the <a target="_blank" href="https://crowncom.org/2017/">CrownCom conference in Lisbon</a> on September 22th,
for this <a target="_blank" href="http://gdr-isis.fr/index.php?page=reunion&idreunion=348">research day organized by the GdR-ISIS in Paris</a> on November 17th,
and for the <a target="_blank" href="http://www-scee.rennes.supelec.fr/wp/seminar/">SCEE seminar in Rennes</a> on November 23th.
</span>
</details>
</li>
</ol>
<h3>Academic publications</h3>
<ol reversed="reversed">
<li>
<strong>L. Besson</strong>.
<br>
<em>Multi-players Bandit Algorithms for Internet of Things Networks</em>.
<br>PhD thesis.
Under supervision of <a href="https://moychristophe.wordpress.com/" target="_blank">Prof. Christophe Moy</a> and <a href="http://chercheurs.lille.inria.fr/ekaufman/" target="_blank">Dr Emilie Kaufmann</a>.
Team SCEE at CentraleSupélec (campus de Rennes) and IETR, Rennes, and team SequeL at Inria Lille Nord Europe, Lille.
October 2016 - November 2019.
<br>
[ <a target="_blank" href="https://perso.crans.org/besson/articles/PhD_thesis__Lilian_Besson.pdf"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://tel.archives-ouvertes.fr/tel-02491380/bibtex" class="icon fa-file-text-o"></i> bibTeX</a> ]
• [ <a target="_blank" href="https://github.com/Naereen/phd-thesis/"><i class="icon fa-code"></i> Code (thesis)</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/slides/2019_11__PhD_Defense__Multi-players_Bandit_Algorithms_for_Internet_of_Things_Networks/slides.pdf"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://github.com/Naereen/slides/tree/master/2019_11__PhD_Defense__Multi-players_Bandit_Algorithms_for_Internet_of_Things_Networks"><i class="icon fa-code"></i> Code (slides)</a> ]
• [ <a target="_blank" href="https://smpybandits.github.io/"> Code (simulations)</a> ]
• [ <a target="_blank" href="https://scholar.google.fr/citations?view_op=view_citation&hl=fr&user=bt3upq8AAAAJ&citation_for_view=bt3upq8AAAAJ:R3hNpaxXUhUC" title="Manually updated count of citations, last change 2026-01-03"><i class="icon fa-list-ol"></i> Citations: 6</a> ]
<details style="margin-left:3%;">
<summary>Summary of my PhD thesis</summary>
<span style="color:gray;">
In this PhD thesis, we study wireless networks and reconfigurable end-devices that can access Cognitive Radio networks, in unlicensed bands and without central control. We focus on Internet of Things networks (IoT), with the objective of extending the devices' battery life, by equipping them with low-cost but efficient machine learning algorithms, in order to let them automatically improve the efficiency of their wireless communications. We propose different models of IoT networks, and we show empirically on both numerical simulations and real-world validation the possible gain of our methods, that use Reinforcement Learning. The different network access problems are modeled as Multi-Armed Bandits (MAB), but we found that analyzing the realistic models was intractable, because proving the convergence of many IoT devices playing a collaborative game, without communication nor coordination is hard, when they all follow random active pattern. The rest of this manuscript thus studies two restricted models, first multi-players bandits in stationary problems, then non-stationary single-player bandits. We also detail another contribution, <a target="_blank" href="https://smpybandits.github.io/">SMPyBandits, our open-source Python library</a> for numerical MAB simulations, that covers all the studied models and more.
<b>Keywords:</b>
Internet of Things (IoT), Cognitive Radio, Learning Theory, Collision Mitigation Sequential Learning, Reinforcement Learning, Multi-Armed Bandits (MAB), Decentralized Learning, Multi-Player Multi-Armed Bandits, Change Point Detection, Non-Stationary Multi-Armed Bandits.
</span>
</details>
</li>
<li>
<strong>L. Besson</strong>, J. Fageot & M. Unser.
<br>
<em>A Theoretical Study Of Steerable Homogeneous Operators, And Applications</em>.
<br>Research Internship Report – Master MVA. Internship with Prof.Dr. Michael Unser and Dr. Julien Fageot. BIG team at EPFL, Lausanne (Switzerland). August 2016.
<br>
[ <a target="_blank" href="https://goo.gl/xPzw4A"><i class="icon fa-file-pdf-o"></i> PDF</a> ]
• [ <a target="_blank" href="https://goo.gl/vm8WPF"><i class="icon fa-file-powerpoint-o"></i> Slides</a> ]
• [ <a target="_blank" href="https://bitbucket.org/lbesson/internship-mva-2016"><i class="icon fa-code"></i> Code</a> ]
• [ <a target="_blank" href="https://perso.crans.org/besson/publis/mva-2016/">🏅 Rank: 1st & 🎓 Grade: 18.43/20</a> ]
</li>
</ol>
</section>
<!-- Teaching -->
<section id="teaching" class="main">
<header class="major">
<h2>🎓 <a style="border-bottom: none;" target="_blank" href="https://perso.crans.org/besson/teaching.en.html">Teaching</a></h2>
<p>
<a href="https://perso.crans.org/besson/a-faire-avant-30-ans.html#professionnellement" target="_blank">My wish</a> is to keep doing both teaching and research,
<!-- become a tenured full-time teaching professor in a Preparatory School in France (CPGE), -->
in Computer Science and/or Maths.
<i class="icon fa-commenting-o"></i> Ideally, I will be the happiest man if
<!-- Now the easter egg 🐣 -->
<abbr title="And also if I could bake cakes 🎂 and mountain hike ⛰ regularly! 🇫🇷 Vive la pâtisserie !">I could spend</abbr> the next 35 years teaching introductory Computer Science with
<abbr title="End of course, the next awesome languages! Julia is very nice for instance…">Python</abbr>, data structures and algorithmic, computer architecture etc.
<!-- More examples -->
I like to share my passion for practical computer science and mathematics, and how both can be combined and used for research and modelisation problems, for instance for analysis of data coming from our daily life (e.g., <a href="https://perso.crans.org/besson/data-analysis-of-2-years-of-sms-2016-2017.fr.html" target="_blank">my text messages</a>, <a href="https://nbviewer.jupyter.org/github/Naereen/notebooks/blob/master/Generer_des_fausses_citations_latines_du_Roi_Loth.ipynb" target="_blank">quotes from the Kaamelott TV show</a>, <a href="https://perso.crans.org/besson/notebooks/agreg/TP_SQL/screenshots/" target="_blank">or data about the national result for the maths agrégation exam</a>, etc).
<br>
I am still teaching after my PhD, and even much more, as I joined since September 2019 <a target="_blank" href="http://www.ENS-Rennes.fr/team-157089.kjsp">the <b>Computer Science</b> department</a> de <a target="_blank" href="http://www.international.ens-rennes.fr/ens-rennes-english-version-253208.kjsp">at <b>ENS de Rennes</b></a> (as a <a target="_blank" href="http://www.ENS-Rennes.fr/recrutements/recrutement-agpr-au-departement-informatique-291278.kjsp">junior professor</a>), see <a href="http://www.dit.ens-rennes.fr/lilian-besson--292020.kjsp">this page</a>.
</p>
</header>
<ul>
<li>
<em>2022-2023</em> @
<a target="_blank" href="https://lycee-kleber.com.fr/cpge-scientifiques/">Lycée International de Valbonne</a>, Valbonne, France :
<br>
• Professor for a class of 49 student, again in a class of <a target="_blank" href="https://prepas.org/index.php?article=42">MP2I</a>.
<br>
• About 600h/year and 16h/week of teaching.
</li>
<li>
<em>2021-2022</em> @
<a target="_blank" href="https://lycee-kleber.com.fr/cpge-scientifiques/">Lycée Kléber</a>, Strasbourg, France :
<br>
• Professor for a class of 48 student, in the new "classes préparatoires" branch called <a target="_blank" href="https://prepas.org/index.php?article=42">MP2I</a> (maths, physics, computer science and engineering).
<br>
• In charge of every part of the teaching in <em>MP2I</em>: practical sessions to learn programming (in SQL, Python, C and OCaml), exercises sessions to learn theoretical computer science, courses, oral and written exams, personal research project, etc.
<br>
• All this for a class of 48 students, with about 15 hours of teaching weekly and 540h/year as "professeur agrégé".
</li>
<li>
<em>2020-2021</em> @
<a target="_blank" href="http://www.dit.ens-rennes.fr/agregation-option-d">ENS de Rennes</a>, Rennes, France :
<br>
I keep the same teaching activities as last year, but I am also teaching two new courses:
<br>
• A small course, of 6 lectures of 2 hours, of <b>Introduction to Computer Sience</b>, for the first year students of the <a href="http://www.dem.ens-rennes.fr/">department "Droit Économie Management"</a>: see <a href="https://perso.crans.org/besson/teach/intro_num_DEM_2020/">the page of the course</a>. I teach the basics of computer science, both from a historical and technological point of view, and the basics of programming with an introduction to the Linux/Mac/Windows shell (terminal) and with Python ;
<br>
• I also give TDs and TPs (10 of each, 2*2*10h=40h) for the course <b>Informatique 1</b>, for the first year students of Licence Informatique and Licence Mathématiques, at the University of Rennes 1. On <a href="https://perso.crans.org/besson/teach/INF1_L1_Rennes1_2020-21/">my course page</a> I give solutions to TDs and TPs in Java (and Python, for the curious) in Jupyter notebooks.
</li>
<li>
<em>2019-2020</em> @
<a target="_blank" href="http://www.dit.ens-rennes.fr/agregation-option-d">ENS de Rennes</a>, Rennes, France :
<br>
• I am responsible of the <a target="_blank" href="https://perso.crans.org/besson/teach/agreg-2019/">training for Computer Science option for the national exam of "agrégation de mathématiques" (to become a teacher in maths and/or computer science)</a> (<b>"prépa agrég"</b>, option D),
and in particular I'm in charge <a target="_blank" href="https://github.com/Naereen/notebooks/tree/master/agreg/">of the practical sessions of programming, in Python 🐍 and OCaml 🐫</a>. (80 h / year)
<a target="_blank" href="https://perso.crans.org/besson/agreg_info_planning/">The time table is here!</a>
<br>
• I give the course of <a target="_blank" href="https://perso.crans.org/besson/teach/info1_algo1_2019/"><b>Introduction to Algorithmic</b> (ALGO1)</a> for the first year student (in L3) at ENS de Rennes (see <a target="_blank" href="http://people.irisa.fr/Francois.Schwarzentruber/math1_algo1_2019/">the page for the same course in the maths department</a>, given by <a target="_blank" href="http://people.irisa.fr/Francois.Schwarzentruber/">François Schwarzentruber</a>). (20h / year)
<br>
• I give the tutorial sessions for the course of <a target="_blank" href="http://people.rennes.inria.fr/Nathalie.Bertrand/teaching.html"><b>Advanced Algorithmic</b> (ALGO2)</a>, for the first year student (in L3) at ENS de Rennes, given by <a target="_blank" href="http://people.rennes.inria.fr/Nathalie.Bertrand/">Nathalie Bertrand</a>. (20h / year)
<br>
• I'm also in charge of the <a target="_blank" href="https://perso.crans.org/besson/seminaire_dptinfo_2019/">bi-monthly research seminar of the Computer Science department</a>, of some visits of research labs, and of the internships of first year students (in L3) at ENS de Rennes. (40h / year)
</li>
<li>
<em>2016-2019</em> @
<a target="_blank" href="http://www.dit.ens-rennes.fr/agregation-option-d">ENS de Rennes</a>, Rennes, France :
<i class="force-right">
<a href="https://GitHub.com/Naereen/notebooks/network/"><img src="https://img.shields.io/github/forks/Naereen/notebooks.svg?style=social&label=Fork&maxAge=2592000" alt="GitHub forks"/></a> <a href="https://GitHub.com/Naereen/notebooks/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/notebooks.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a href="https://GitHub.com/Naereen/notebooks/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/notebooks.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
<br>
<a target="_blank" href="https://perso.crans.org/besson/teach/agreg-2017/">"préparation à l'agrégation"</a>,
<a target="_blank" href="https://github.com/Naereen/notebooks/tree/master/agreg/">with notebooks in Python 🐍 and OCaml 🐫</a>. (40 h / year)
</li>
<li>
<em>2016-2018</em> @
<a target="_blank" href="http://www.ensai.fr/formation/id-1re-annee.html">ENSAI</a>, Rennes, France :
<i class="force-right">
<a href="https://GitHub.com/Naereen/jsTuring_fr/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/jsTuring_fr.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a href="https://GitHub.com/Naereen/jsTuring_fr/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/jsTuring_fr.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
<br>
<a target="_blank" href="https://perso.crans.org/besson/teach/ensai-2017/">calculability and complexity theory</a> with <a target="_blank" href="https://naereen.github.io/jsTuring_fr/turing.html#Machine">Turing Machines 🖥</a> (24 h / year).
</li>
<li>
<em>2016-2017</em> :
<i class="force-right">
<a href="https://GitHub.com/Naereen/slides/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/slides.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a href="https://GitHub.com/Naereen/slides/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/slides.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
<br> various teaching and scientific resources,
<a target="_blank" href="https://github.com/Naereen/notebooks/">many Jupyter notebooks</a>,
<a target="_blank" href="https://github.com/Naereen/slides/">and some slides</a>. Written regularly, covering various subjects. Lots of geeky stuff in English, but teaching resources are in French.
</li>
<li>
<em>2015-2016</em> @
<a target="_blank" href="http://www.lyc-lakanal-sceaux.ac-versailles.fr/">Lycée Lakanal</a>, Sceaux, France :
<br>
<a target="_blank" href="https://perso.crans.org/besson/teach/infoMP/">maths oral exams and Computer Science practical sessions</a>
<a target="_blank" href="https://en.wikipedia.org/wiki/Classe_pr%C3%A9paratoire_aux_grandes_%C3%A9coles">in Prep'School</a>
<a target="_blank" href="http://prepas.org/ups.php?article=56">(MP)</a> (120 h / year).
</li>
<li>
<em>2014-</em>
<br>
active and regular participation in the writing <a target="_blank" href="https://laurent.claessens-donadello.eu/frido.html">of a mathematics course, which covers quite completely the French mathematics agrégation ("Le Frido")</a>, with <a target="_blank" href="https://laurent.claessens-donadello.eu/">Laurent Claessens</a>.
The sources of the book are <a target="_blank" href="https://github.com/LaurentClaessens/mazhe/">distributed under open-source GPL license on GitHub</a> (<a target="_blank" href="https://github.com/LaurentClaessens/mazhe/">@LaurentClaessens/mazhe</a>), and the <a target="_blank" href="https://laurent.claessens-donadello.eu/pdf/lefrido.pdf">PDF version of the book is freely distributed</a>.
<i class="force-right">
<a href="https://GitHub.com/LaurentClaessens/mazhe/stargazers/"><img src="https://img.shields.io/github/stars/LaurentClaessens/mazhe.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a href="https://GitHub.com/LaurentClaessens/mazhe/watchers/"><img src="https://img.shields.io/github/watchers/LaurentClaessens/mazhe.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
<details style="margin-left:3%;">
<summary>More details...</summary>
<span style="color:gray;">
In addition to more than 2000 pages, the four volumes of the Frido contain mathematics at the agrégation level.
The book covers almost the entire program by trying to keep the ratings consistent from one end to the other (no rating abuse that the reader should guess), while remaining clear and very complete in the demonstrations.
No holes that the reader should fill himself, nothing is a priori considered obvious.
The book has been published since 2016 under the title "Le Frido", currently in four volumes with an ISBN number and therefore authorized for oral agrégation.
<br>
In particular, I have <a target="_blank" href="https://github.com/LaurentClaessens/mazhe/commits?author=Naereen">contributed to the chapters on statistics, and corrected many typos</a>.
I use this book very regularly, for my mathematics lessons in pre-preparation and preparation for agrégation, and to maintain myself as much as possible at the level of agrégation. In general, I read it again from one end to the other once or twice a year....
This book remains <a target="_blank" href="https://github.com/LaurentClaessens/mazhe/graphs/contributors">more than 99.99% of Laurent Claessens' creation</a>.
</span>
</details>
</li>
<li>
<em>2014-2015</em> @
<a target="_blank" href="http://mahindraecolecentrale.edu.in/">Mahindra École Centrale</a>, Hyderabad, <strong>India</strong> :
<br> full-time teaching assistant for 2 maths courses and 1 Computer Science course,
<a target="_blank" href="https://perso.crans.org/besson/teach/ma101/">MA101</a> &
<a target="_blank" href="https://perso.crans.org/besson/teach/ma102/">MA102</a>,
<a target="_blank" href="https://perso.crans.org/besson/teach/cs101/">CS101</a> (250 h / year).
</li>
<li>
<em>2012-2014</em> @
<abbr title="The company no longer exists">Correction Rue Ulm</abbr>, Paris, France :
<br> one-to-one teaching assistant for junior high maths (30 h / year), and grading of maths written exams (10 times / year).
</li>
</ul>
</section>
<!-- Code -->
<section id="code" class="main">
<header class="major">
<h2>💻 Code</h2>
<p>
I love to program and write code <i class="icon fa-code"></i> and documentation <i class="icon fa-book"></i>, especially in Python for science, GNU Bash for desktop automation, and HTML/CSS/JS for the web.
<a target="_blank" href="https://perso.crans.org/besson/publis.en.html">Everything I did and do</a> is open-source and published (using <a href="https://git-scm.com/"><span class="icon fa-git"></span> Git</a>), on <a target="_blank"
href="https://GitHub.com/Naereen"><span class="icon fa-github"></span> my GitHub</a> or
<a target="_blank" href="https://Bitbucket.org/lbesson"><span class="icon fa-bitbucket"></span> my Bitbucket</a> profiles.
</p>
<ul>
<li><b><a target="_blank" href="https://github.com/Naereen?tab=repositories">Expert</a></b>:
<a target="_blank" href="https://smpybandits.readthedocs.io/">🐍 Python</a> (research & teaching) <i class="devicon-python-plain-wordmark colored"></i>, <a target="_blank" href="https://lbesson.bitbucket.io/bin/">GNU Bash</a> (scripts), <a target="_blank" href="https://github.com/Naereen?tab=repositories&q=&type=&language=ocaml&sort=">🐫 Caml/OCaml</a> (research & teaching).
</li>
<li><b>Tools</b>:
<a target="_blank" href="https://github.com/Naereen/notebooks">Jupyter</a> notebooks for OCaml and 🐍 Python, <a target="_blank" href="http://caml.inria.fr/pub/docs/manual-ocaml/ocamldoc.html">OCamlDoc</a> for <a target="_blank" href="https://perso.crans.org/besson/a/m/2/doc/">OCaml</a>, <a target="_blank" href="https://bitbucket.org/lbesson/web-sphinx">Sphinx</a> for <a target="_blank" href="https://github.com/Naereen?tab=repositories&q=&type=&language=python&sort=">🐍 Python</a>,
databases (SQLite, <a target="_blank" href="https://github.com/Naereen/A-B-testing-of-draft-cards/">SQL</a>), version control software (mainly <strong>git</strong>, but I've used svn and hg in the past) <i class="devicon-git-plain-wordmark colored"></i>,
visios (BBB, <a target="_blank" href="https://besson.link/jitsi.en.html">Jitsi</a>, OBS Studio, Twitch.tv, etc.).
Since 2025, I've been using Generative AI tools quite frequently, like Google <a target="_blank" href="https://gemini.google.com/">Gemini</a> and <a target="_blank" href="https://notebooklm.google/">NotebookLM</a>, and <a target="_blank" href="https://github.com/copilot/">Copilot de Github</a>, and I oscillate greatly between loving it and hating it!
</li>
<li><b><a target="_blank" href="https://wakatime.com/@lbesson">Proficient</a></b>:
<a target="_blank" href="https://perso.crans.org/besson/me/index.fr.html">HTML</a> & <a target="_blank" href="https://lbesson.bitbucket.io/particle_homepage/">CSS</a> & <a target="_blank" href="https://github.com/Naereen/StrapDown.js/">JavaScript</a> (web), <a target="_blank" href="https://fr.wikipedia.org/wiki/Julia_(langage)">Julia</a> & <a target="_blank" href="https://fr.wikipedia.org/wiki/GNU_Octave">GNU Octave</a> & <a target="_blank" href="https://fr.wikipedia.org/wiki/Matlab">MATLAB</a> & <a target="_blank" href="https://fr.wikipedia.org/wiki/SciLab">SciLab</a> (numerical computations), C & Makefiles.
<i class="devicon-css3-plain-wordmark colored"></i>
<i class="devicon-html5-plain-wordmark colored"></i>
<i class="devicon-javascript-plain colored"></i>
<i class="devicon-c-plain-wordmark colored"></i>
<i class="devicon-cplusplus-plain-wordmark colored"></i>
</li>
<li><b>Knowledgable</b>:
<a target="_blank" href="https://fr.wikipedia.org/wiki/BASIC">BASIC</a> for Casio and Texas Instrument graphical calculator, <a target="_blank" href="https://www.gnuradio.org/about/">GNU Radio</a>, <a target="_blank" href="https://fr.wikipedia.org/wiki/Compute_Unified_Device_Architecture">nVidia CUDA</a>,
<a target="_blank" href="https://github.com/Naereen/gym-nes-mario-bros/search?l=Lua&q=lua">Lua</a>.
</li>
<li><b>Computers</b>: expert user, capable of managing dozens of machines, under <a target="_blank" href="http://www.microsoft.com/fr-fr/">Windows</a> or <a target="_blank" href="https://www.gnu.org/gnu/linux-and-gnu.fr.html">GNU/Linux</a>.
<i class="devicon-linux-plain colored"></i>
<i class="devicon-ubuntu-plain-wordmark colored"></i>
<i class="devicon-windows8-original-wordmark colored"></i>
</li>
<li><b>Writing</b>:
<a target="_blank" href="https://github.com/Naereen#js-contribution-activity-description">daily usage</a> of <a target="_blank" href="https://cv.archives-ouvertes.fr/lilian-besson">LaTeX</a>, <a target="_blank" href="https://perso.crans.org/besson/slides/">Beamer</a> (for slides) and <a target="_blank" href="https://naereen.github.io/StrapDown.js/">Markdown</a>, and <a target="_blank" href="https://perso.crans.org/besson/">web pages design</a>.
<i class="devicon-visualstudio-plain-wordmark colored"></i>
<i class="devicon-firefox-plain-wordmark colored"></i>
</li>
</ul>
<p>
Here are a few things I did since 2012:
</p>
</header>
<ul>
<!-- FIXME more but only the best examples! -->
<li>
<em>2025</em> :
<a target="_blank" href="https://github.com/Naereen/Can-you-guess-my-Scryfall-search-of-the-week-MTG/">Can-you-guess-my-Scryfall-search-of-the-week-MTG</a> A tiny web-page for an interactive game I play with random friends at local Magic the Gathering FNM events! Can you guess my Scryfall search of the week (MTG)? Try to be as fast as you can! In both English 🇬🇧 and French 🇫🇷
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/Can-you-guess-my-Scryfall-search-of-the-week-MTG/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Can-you-guess-my-Scryfall-search-of-the-week-MTG.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Can-you-guess-my-Scryfall-search-of-the-week-MTG/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Can-you-guess-my-Scryfall-search-of-the-week-MTG.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2025</em> :
<a target="_blank" href="https://github.com/Naereen/jap-jap.js/">jap-jap.js</a> A web-version of the card game "Jap Jap !", written for fun! Fully functional with 2/3/4 players mode (with built-in AI to play solo against 1/2/3 opponents).
<em>Written in one weekend, from my phone, using GitHub's Copilot, and almost no manually written code - everything with "vibe coding"!</em>
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/jap-jap.js/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/jap-jap.js.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/jap-jap.js/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/jap-jap.js.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2025</em> :
<a target="_blank" href="https://github.com/Naereen/Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons/">Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons</a> 🇫🇷 A Magic the Gathering Quiz for the last two editions of the "Don des Dragons" festival in Strasbourg, in 2024 and 2025!
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Un-Quiz-Magic-the-Gathering-pour-le-festival-Don-des-Dragons.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2025</em> :
<a target="_blank" href="https://github.com/Naereen/A-B-testing-of-draft-cards/">A-B-testing-of-draft-cards</a> 🇫🇷 A simple web application (PHP + SQLite) to allow A/B testing experiments on draft cards. A gift for a friend!
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/A-B-testing-of-draft-cards/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/A-B-testing-of-draft-cards.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/A-B-testing-of-draft-cards/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/A-B-testing-of-draft-cards.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2025</em> :
<a target="_blank" href="https://github.com/Naereen/A-C-Compiler-for-the-NumWorks-calculator/">A C Compiler for the NumWorks calculator</a> & <a target="_blank" href="https://github.com/Naereen/A-JavaScript-interpreter-for-the-NumWorks-calculator">A JavaScript interpreter for the NumWorks calculator</a> : two innovative projects which tried to bring new programming languages to the <a target="_blank" href="https://www.numworks.com/">Numworks calculators</a>.
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/A-C-Compiler-for-the-NumWorks-calculator/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/A-C-Compiler-for-the-NumWorks-calculator.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/A-C-Compiler-for-the-NumWorks-calculator/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/A-C-Compiler-for-the-NumWorks-calculator.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/A-JavaScript-interpreter-for-the-NumWorks-calculator/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/A-JavaScript-interpreter-for-the-NumWorks-calculator.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/A-JavaScript-interpreter-for-the-NumWorks-calculator/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/A-JavaScript-interpreter-for-the-NumWorks-calculator.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2024/2026</em> :
<a target="_blank" href="https://github.com/Naereen/Numworks-apps/">Numworks-apps</a> A simple repository to store the working versions of the Numworks apps we've developped (.nwa files) - flash them on <a target="_blank" href="https://my.numworks.com/apps">https://my.numworks.com/apps</a>
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/Numworks-apps/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Numworks-apps.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Numworks-apps/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Numworks-apps.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2024/2025</em> :
<a target="_blank" href="https://github.com/Naereen/Assistant-traduction-CranialInsertion-en-Python/">Assistant-traduction-CranialInsertion-en-Python</a> Helping to translate new articles published on <a target="_blank" href="https://www.cranial-insertion.com/">https://www.cranial-insertion.com/</a>, which we have to translate every weekend from American English to French.
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/Assistant-traduction-CranialInsertion-en-Python/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Assistant-traduction-CranialInsertion-en-Python.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Assistant-traduction-CranialInsertion-en-Python/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Assistant-traduction-CranialInsertion-en-Python.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2021</em> :
<a target="_blank" href="https://github.com/Naereen/Peut-on-coder-avec-OCaml-Python-et-C-par-SMS/">Peut-on-coder-avec-OCaml-Python-et-C-par-SMS</a> 🇫🇷 I wished to answer the following question: Can we code with OCaml, Python and C by simply sending an old-school SMS message? Spoiler alert: Yes we can!
<i class="force-right"> <a class="icon" href="https://github.com/Naereen/Peut-on-coder-avec-OCaml-Python-et-C-par-SMS/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Peut-on-coder-avec-OCaml-Python-et-C-par-SMS.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Peut-on-coder-avec-OCaml-Python-et-C-par-SMS/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Peut-on-coder-avec-OCaml-Python-et-C-par-SMS.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a> </i>
</li>
<li>
<em>2020</em> :
<a target="_blank" href="https://github.com/Naereen/Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France">Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France</a> 🇫🇷 Un script IPython qui génère automatiquement une attestation de sortie toute les 55 minutes, pour le confinement 2.0 en France face au COVID 19. Expérimental et pour le plaisir.
<i class="force-right">
<a class="icon" href="https://github.com/Naereen/Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Generateur-attestation-de-sortie-automatique-COVID-19-confinement-en-France.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
</li>
<li>
<em>2018</em> :
<a target="_blank" href="https://github.com/Naereen/ParcourSup.py/">ParcourSup.py</a> 🇫🇷 A clone of the code used by French government to decide the affectation between highschool students and universities (ParcoursSup), written
in 🐍 Python 3. Aimed at being didactic. Documentation <a href="https://perso.crans.org/besson/publis/ParcourSup.py/parcoursup.html">here (in French)</a>, and an interactive notebook <a target="_blank" href="https://mybinder.org/v2/gh/Naereen/ParcourSup.py/master?filepath=notebooks%2FParcourSup.py_version_simplifiee.ipynb">here (in French)</a>.
<i class="force-right">
<a class="icon" href="https://parcoursuppy.readthedocs.io/fr/latest/?badge=latest"><img alt="Documentation Status" src="https://readthedocs.org/projects/parcoursuppy/badge/?version=latest"></a> <a class="icon" href="https://travis-ci.org/Naereen/ParcourSup.py"><img alt="Build Status" src="https://travis-ci.org/Naereen/ParcourSup.py.svg?branch=master"></a> <a class="icon" href="https://mybinder.org/v2/gh/Naereen/ParcourSup.py/master?filepath=notebooks%2FParcourSup.py_version_simplifiee.ipynb"><img alt="Binder" src="https://mybinder.org/badge.svg"></a> <a class="icon" href="https://github.com/Naereen/ParcourSup.py/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/ParcourSup.py.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://github.com/Naereen/ParcourSup.py/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/ParcourSup.py.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
</li>
<li>
<em>2018</em> :
<a target="_blank" href="https://naereen.github.io/gym-nes-mario-bros/">Gym-NES-Mario-Bros</a> 🐍 🏋 OpenAI GYM for Nintendo NES emulator FCEUX and 1983 game <em>Mario Bros.</em> + Double Q Learning for mastering the game with
reinforcement learning.
<i class="force-right">
<a class="icon" href="https://GitHub.com/Naereen/gym-nes-mario-bros/network/"><img src="https://img.shields.io/github/forks/Naereen/gym-nes-mario-bros.svg?style=social&label=Fork&maxAge=2592000" alt="GitHub forks"/></a> <a class="icon" href="https://GitHub.com/Naereen/gym-nes-mario-bros/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/gym-nes-mario-bros.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://GitHub.com/Naereen/gym-nes-mario-bros/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/gym-nes-mario-bros.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
</li>
<li>
<em>2017</em> :
<a target="_blank" href="https://github.com/Naereen/Jupyter-NBConvert-OCaml/">Jupyter-NBConvert-OCaml</a>
<span class="icon fa-code"></span>, custom <a href="https://www.jupyter.org/">Jupyter 📓</a> <a href="http://nbconvert.readthedocs.io/en/latest/external_exporters.html#writing-a-custom-exporter">NBConvert exporter</a> for the
<a href="http://www.ocaml.org">🐫 OCaml</a> language (and <a href="https://github.com/akabe/ocaml-jupyter/">ocaml-jupyter</a> kernel)
<i class="force-right">
<a class="icon" href="https://GitHub.com/Naereen/Jupyter-NBConvert-OCaml/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Jupyter-NBConvert-OCaml.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://GitHub.com/Naereen/Jupyter-NBConvert-OCaml/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/Jupyter-NBConvert-OCaml.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
</li>
<li>
<em>2017</em> : small Python 🐍 (<a target="_blank" href="https://github.com/Naereen/Lempel-Ziv_Complexity/">Lempel-Ziv_Complexity</a>) and Julia (<a target="_blank" href="https://github.com/Naereen/LempelZiv.jl/">LempelZiv.jl</a>)
<span class="icon fa-code"></span> libraries to efficiently compute the Lempel-Ziv complexity between two binary strings. Published on Pypi and METADATA.jl
<i class="force-right">
<a class="icon" href="https://pypi.org/project/lempel-ziv-complexity/"><img src="https://img.shields.io/pypi/v/lempel-ziv-complexity.svg" alt="PyPI version"/></a>
<a class="icon" href="https://GitHub.com/Naereen/Lempel-Ziv_Complexity/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/Lempel-Ziv_Complexity.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a>
<a class="icon" href="https://GitHub.com/Naereen/LempelZiv.jl/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/LempelZiv.jl.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a>
</i>
</li>
<li>
<em>2016</em> :
<a target="_blank" href="https://github.com/Naereen/uLogMe/">uLogMe</a>
<span class="icon fa-user-secret"></span>, self-monitoring software for GNU/Linux, with zero CPU overhead and outstanding visualizations.
<i class="force-right">
<a class="icon" href="https://GitHub.com/Naereen/uLogMe/network/"><img src="https://img.shields.io/github/forks/Naereen/uLogMe.svg?style=social&label=Fork&maxAge=2592000" alt="GitHub forks"/></a> <a class="icon" href="https://GitHub.com/Naereen/uLogMe/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/uLogMe.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a>
</i>
</li>
<li>
<em>2013</em> :
<a target="_blank" href="https://github.com/Naereen/StrapDown.js/">StrapDown.js</a>
<span class="icon fa-file-text-o"></span><span class="icon fa-wrench"></span>, An awesome Javascript tool to quickly publish nice-looking webpages from raw Markdown, no server-side compilation. Light script
<a class="icon" href="https://github.com/Naereen/StrapDown.js/blob/master/strapdown.min.js"><img src="https://badge-size.herokuapp.com/Naereen/StrapDown.js/master/strapdown.min.js" alt="Only 32 Kb"></a>.
<i class="force-right">
<a class="icon" href="https://GitHub.com/Naereen/StrapDown.js/network/"><img src="https://img.shields.io/github/forks/Naereen/StrapDown.js.svg?style=social&label=Fork&maxAge=2592000" alt="GitHub forks"/></a> <a class="icon" href="https://GitHub.com/Naereen/StrapDown.js/stargazers/"><img src="https://img.shields.io/github/stars/Naereen/StrapDown.js.svg?style=social&label=Star&maxAge=2592000" alt="GitHub stars"/></a> <a class="icon" href="https://GitHub.com/Naereen/StrapDown.js/watchers/"><img src="https://img.shields.io/github/watchers/Naereen/StrapDown.js.svg?style=social&label=Watch&maxAge=2592000" alt="GitHub watchers"/></a>
</i>
</li>
<li>
<em>Since 2012</em> :
<a target="_blank" href="https://bitbucket.org/lbesson/cv/">My résumé</a>
<span class="icon fa-file-pdf-o"></span> 🎓, is open-source and publicly available, <abbr title="Take that, LinkedIn and Viadeo!"> self hosted</abbr>.
</li>
</ul>
</section>
</div>
<!-- Footer -->
<footer id="contact">
<section>
<h2>📮 <a style="border-bottom: none;" target="_blank" href="https://perso.crans.org/besson/callme.html">Contact</a></h2>
<dl class="alt">
<dt>Address</dt>
<dd>
Dr Lilian Besson <br> Classe de MP2I • Lycée Kléber
<br>67000 Strasbourg • France
</dd>
<ul class="actions">
<li><a target="_blank" title="Map to my office, on Google Maps" href="https://www.google.fr/maps/place/Collège+et+Lycée+Kléber/@48.5942051,7.7548168,17z/" class="button"><i class="icon fa-map-marker"></i> Google Maps</a></li>
<li><a target="_blank" title="Map to my office, on Open Street Map" href="https://www.OpenStreetMap.org/?mlat=48.5942051&mlon=7.7548168#map=19/48.5942051,7.7548168&layers=N" class="button"><i class="icon fa-map-o"></i> Open Street Map</a></li>
</ul>
</dl>
<dl class="alt">
<dt>Phone</dt>
<dd>📞 <a href="tel:+33628412257">+33 06 28 41 22 57</a></dd>
<dt>Email</dt>
<dd>📧 <a href="mailto:Lilian.Besson_AT_Crans_DOT_org">Lilian.Besson[AT]Crans[DOT]org</a></dd>
<dt>Email</dt>
<dd>📧 <a href="mailto:Lilian.Besson_AT_ac-Strasbourg_DOT_fr">Lilian.Besson[AT]ac-Strasbourg[DOT]fr</a></dd>
</dl>
</section>
<section>
<h2>I am also pleased to be</h2>
<ul>
<!-- <li>
Passionate about ecology, resilience, local life in cities etc. If these keywords are also important for you, please go check <a target="_blank" href="https://perso.crans.org/besson/Rennes-en-Resilience/">my « Rennes en Résilience » blog</a> (in French, 🇫🇷 📒).
<img height="1pt" src="https://perso.crans.org/besson/carte-confinement/css/Rennes_en_Resilience_logo.ico" alt="Logo of « Rennes en Résilience »">
You can also have a look at <a target="_blank" href="https://perso.crans.org/besson/carte-confinement/">this map</a>!
</li> -->
<li>
🍴 An amateur (French) cook, see <a target="_blank" href="https://perso.crans.org/besson/cuisine/">this blog</a> 🎂 🍸 🍝 (in French, 🇫🇷 📒).
</li>
<li>
💚 A motivated ecologist who tries to produce the least possible amount of 🍃 non-recyclable waste. See <a target="_blank" href="https://perso.crans.org/besson/zero-dechet/">this other blog</a> (in French, 🇫🇷 📒).
</li>
<li>
Lucky and happy 👌 when I can ride my 🚴 bike every day,
<!-- and swim once a week 🏊. -->
and play to <i>Magic: The Gathering</i> 🃏 every week (here are <a target="_blank" href="https://www.moxfield.com/users/Naereen">my deck lists</a>).
<!-- I'm also happy to be a regular <a target="_blank" href="https://fr.wikipedia.org/wiki/Futsal">⚽ futsal</a> player since September 2017 (if no COVID...). -->
<!-- I'm also happy to be a regular <a target="_blank" href="https://fr.wikipedia.org/wiki/Badminton"> badminton</a> player since Nov. 2022. -->
<!-- and an occasional runner 🏃 since Jan. 2018. -->
</li>
<li>
An open-source enthusiast, active on both
<a target="_blank" href="https://GitHub.com/Naereen"><i class="icon fa-github"></i> GitHub</a> and
<a target="_blank" href="https://Bitbucket.org/lbesson"><i class="icon fa-bitbucket"></i> Bitbucket</a> for <a target="_blank" href="https://naereen.github.io/">personal projects</a> but <a target="_blank" href="https://libraries.io/github/Naereen/contributions">also world-class open-source projects</a> 👌.
</li>
</ul>
</section>
<p class="copyright">
<a target="_blank" href="https://creativecommons.org/licenses/by/3.0/"><i class="fa fa-creative-commons"></i> BY-SA</a> © Lilian Besson, 2017-26. 🛠 <a target="_blank" href="https://GitHub.com/Naereen/me/">Open source (on GitHub)</a>.
Inspired by <a title="Many thanks!" href="https://bguedj.github.io/website-2016-2020-deprecated/">Benjamin Guedj</a>'s old webpage. 🎨 Design: <a target="_blank" href="https://html5up.net/stellar/">HTML5 UP</a>.
</p>
</footer>
</div>
<!-- Scripts -->
<script type="text/javascript" src="assets/js/jquery.min.js"></script>
<script type="text/javascript" src="assets/js/jquery.scrollex.min.js"></script>
<script type="text/javascript" src="assets/js/jquery.scrolly.min.js"></script>
<script type="text/javascript" src="assets/js/skel.min.js"></script>
<script type="text/javascript" src="assets/js/util.min.js"></script>
<!--[if lte IE 8]><script type="text/javascript" src="assets/js/ie/respond.min.js"></script><![endif]-->
<script type="text/javascript" src="assets/js/main.min.js"></script>
<!-- Hack to underline longer the h2 titles -->
<style type="text/css">
header.major h2::after {
width: 100% !important;
}
</style>
<script type="text/javascript">
$.fn.textWidth = function(text) {
var self = $(this);
var html = $('<h2 style="position:absolute;left:-9999px;white-space:nowrap;">' + (text || self.html()) + '</h2>');
if (!text) {
html.css("font-family", self.css("font-family"));
html.css("font-weight", self.css("font-weight"));
html.css("font-size", self.css("font-size"));
}
$('body').append(html);
var width = html.width();
html.remove();
return 1 + width;
};
$("header.major h2").each(function() {
console.log("Setting width of this from textWidth of this:", $(this), $(this).textWidth());
$(this).width($(this).textWidth());
});
</script>
</body>