From ce44f6b4e1d706926a2c29d709d8c23672668f91 Mon Sep 17 00:00:00 2001
From: Keri Warr <keri@warr.ca>
Date: Mon, 20 Jul 2015 20:55:16 -0400
Subject: [PATCH 1/2] add Professor Lubiw's recorded talk

---
 events.xml      | 30 ++++++++++++++++++++++++++++++
 media/index.xml | 20 ++++++++++++++++++++
 2 files changed, 50 insertions(+)

diff --git a/events.xml b/events.xml
index f3cd7c0..67f5f24 100644
--- a/events.xml
+++ b/events.xml
@@ -5,6 +5,36 @@
 
 <!-- Spring 2015 -->
 
+<eventitem date="2015-07-16" time="6 PM" room="MC 4064"
+           title="Algorithms for Shortest Paths">
+  <short>
+    <p>
+      Come to this exciting talk about path-finding algorithms which
+      is being presented by Professor Anna Lubiw.
+    </p>
+  </short>
+  <abstract>
+    <p>
+      Finding shortest paths is a problem that comes up in many applications:
+      Google maps, network routing, motion planning, connectivity in social
+      networks, and etc.
+      The domain may be a graph, either explicitly or implicitly represented,
+      or a geometric space.
+    </p>
+    <p>
+      Professor Lubiw will survey the field, from Dijkstra's foundational algorithm to
+      current results and open problems.
+      There will be lots of pictures and lots of ideas.
+    </p>
+    <p>
+      <a href="http://mirror.csclub.uwaterloo.ca/csclub/shortest-paths-CSclub.pdf">Click here to see the slides from the talk.</a>
+    </p>
+    <p>
+      <a href="/media/Algorithms%20for%20Shortest%20Paths">Click here for the recorded talk.</a>
+    </p>
+    </abstract>
+</eventitem>
+
 <eventitem date="2015-07-08" time="6 PM" room="MC 4060"
            title="Infra sound is all around us">
   <short>
diff --git a/media/index.xml b/media/index.xml
index a02b715..1ddbee9 100644
--- a/media/index.xml
+++ b/media/index.xml
@@ -11,6 +11,26 @@
     CD or DVD should you so choose.
     <ul class="media">
 
+<mediaitem title="Algorithms for Shortest Paths">
+  <abstract>
+    <p>
+      Finding shortest paths is a problem that comes up in many applications:
+      Google maps, network routing, motion planning, connectivity in social
+      networks, and etc.
+      The domain may be a graph, either explicitly or implicitly represented,
+      or a geometric space.
+    </p>
+    <p>
+      Professor Lubiw will survey the field, from Dijkstra's foundational algorithm to
+      current results and open problems.
+      There will be lots of pictures and lots of ideas.
+    </p>
+  </abstract>
+  <presentor>Anna Lubiw</presentor>
+  <thumbnail file="alubiw-shortest-paths-thumb-small.jpg" />
+  <mediafile file="alubiw-shortest-paths.mp4" type="Talk (x264)" />
+</mediaitem>
+
 <mediaitem title="Infra Sound is All Around Us">
   <abstract>
     <p>

From ddb627d79a4c534ae369366489cda6caa3a4750b Mon Sep 17 00:00:00 2001
From: Webmaster <www@csclub.uwaterloo.ca>
Date: Sun, 26 Jul 2015 11:38:31 -0400
Subject: [PATCH 2/2] fix umask bs

---
 Makefile | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/Makefile b/Makefile
index 1ddf5e3..7338279 100644
--- a/Makefile
+++ b/Makefile
@@ -1,4 +1,4 @@
-SHELL = umask 002; exec /bin/sh
+SHELL = umask 002 ; exec /bin/sh
 
 FILES = events.ics events.atom news.atom index.html stats.html \
 	favicon.ico default.css csclub.der csclub.pem robots.txt