Update after the end of the january event: Adding presentations and

recordings

Signed-off-by: Philippe Krief <philippe.krief@eclipse-foundation.org>

content/_index.md

@@ -19,7 +19,7 @@ Through a selection of state-of-the-art project presentations and demonstrations
 {{</ grid/section-container >}}
 {{</ grid/section-container >}}
 
-{{< grid/section-container id="about" class="featured-section-row featured-section-row-lighter-bg" >}}
+{{< grid/section-container id="about" class="featured-section-row featured-section-row-dark-bg" >}}
 {{< grid/section-container class="featured-section-row text-center">}}
 
 <h2>Upcoming Event: <a href="2022/may"> May 3, 2022</h2></a>

data/en/2022/january/agenda.yml

@@ -5,12 +5,13 @@ items:
     - name: "Introduction"
       presenter: <a href="speakers/#marco_jahn">Marco Jahn</a> and <a href="speakers/#cedric_thomas">Cedric Thomas</a>
       type: session
-      time: 16:00 - 16:15 (CET)
+      vod: https://www.youtube.com/watch?v=H7keVdJ3M_Y
+      slides: presentations/2022-01-18-Webinar_05_Introduction.pdf
     - name: "On-going research to fuel and enhance Eclipse Steady"
       presenter: <a href="speakers/#serena_ponta">Serena Ponta</a>
       type: session
       vod: https://www.youtube.com/watch?v=H7keVdJ3M_Y&t=434s
-      slides: 
+      slides: presentations/2022-01-18_Steady.pdf
       abstract: |
            <p>Eclipse Steady offers a code-based approach to detect the presence of open-source code subject to known 
            vulnerabilities, to assess the severity of findings and to propose mitigations. Its code-centricity allows 
@@ -26,7 +27,7 @@ items:
       presenter: <a href="speakers/#daniel_le_berre">Daniel Le Berre</a>
       type: session
       vod: https://www.youtube.com/watch?v=H7keVdJ3M_Y&t=2332s
-      slides: 
+      slides: presentations/2022-01-18_Sat4j.pdf
       abstract: |
           <p>Sat4j is a library of tools in Java to solve combinatorial problems with Boolean variables. One of such
           problem is the canonical SATisfiability problem, one of the simplest hard problems in theoretical computer science.