www/events.xml

<?xml version='1.0'?>

<!DOCTYPE eventdefs SYSTEM "csc.dtd" [<!ENTITY mdash "&#x2014;">]>
<eventdefs>

<!-- Winter 2015 -->

<eventitem date="2015-03-10" time="6:00 PM" room="MC 4040"
           title="Runtime Type Inference in Dynamic Languages - Day 2">
  <short>
    <p>
      Day 2 of Runtime Type Inference in Dynamic Languages with Kannan Vijayan
    </p>
  </short>
  <abstract>
    <p>
      Day 2 of Runtime Type Inference in Dynamic Languages with Kannan Vijayan
    </p>
    </abstract>
</eventitem>

<eventitem date="2015-03-09" time="6:00 PM" room="MC 4040"
           title="Runtime Type Inference in Dynamic Languages - Day 1">
  <short>
    <p>
      Javascript is fast. In some cases, very close to compiled-language fast.
      How is this even possible? How do we know what types our variables have?
      How can we optimize it well? Kannan Vijayan will be talking about the
      historical advances in JIT-compilation of dynamically typed programs over
      two days. Of course, both of those talks will have free food.
    </p>
  </short>
  <abstract>
    <p>
      How do we make dynamic languages fast? Today, modern Javascript engines
      have demonstrated that programs written in dynamically typed scripting lan-
      guages can be executed close to the speed of programs written in languages
      with static types. So how did we get here? How do we extract precious type
      information from programs at runtime? If any variable can hold a value of any
      type, then how can we optimize well?
      <br></br>
      This talk covers a bit of the history of the techniques used in this space, and
      tries to summarize, in broad strokes, how those techniques come together to
      enable efficient jit-compilation of dynamically typed programs.
      To do the topic justice, Kannan Vijayan will be talking the Monday and
      Tuesday March 9th and 10th.
      <br></br>
      Does that mean two consecutive days of free food? Yes it does.
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-03-03" time="6:00 PM" room="MC 2038"
           title="SAT and SMT solvers">
  <short>
    <p>
      Murphy Berzish explains how to programmatically determine if a program is satisfiable,
      and how to find a concrete counterexample if it is unsatisfiable. At the core
      are SAT/SMT solvers. SAT theory deals with Boolean Satisfiability solvers,
      while SMT theory--Satisfiability Modulo a Theory--allows SMT to be extended
      to common data structures. Free food!
    </p>
  </short>
  <abstract>
    <p>
      Does your program have an overflow error? Will it work with all inputs? How
      do you know for sure? Test cases are the bread and butter of resilient design,
      but bugs still sneak into software. What if we could prove our programs are
      error-free?
      <br></br>
      Boolean Satisfiability (SAT) solvers determine the ‘satisfiability’ of boolean
      set of equations for a set of inputs. An SMT solver (Satisfiability Modulo
      a Theory) applies SMT to bit-vectors, strings, arrays, and more. Together,
      we can reduce a program and prove it is satisfiable, or provide a concrete
      counter-example. The implications of this are computer-aided reasoning tools
      for error-checking in addition to much more robust programs.
      <br></br>
      In this talk Murphy Berzish will give an overview of SAT/SMT theory and
      some real-world solution methods. He will also demonstrate applications of
      SAT/SMT solvers in theorem proving, model checking, and program verification.
      <br></br>
      What else? Oh yes, refreshments and drinks will be served. Come out!
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-02-27" time="6:00 PM" room="EV3 1408"
           title="Code Party 0">
  <short>
    <p>
      The first code party of Winter 2015, and we have something a litle different
      this time. We're running a Code Retreat (coderetreat.org) with Boltmade.
      The result of this is that you will be able to do a coding challenge, wherein
      you implement Rule 110 (like the Game of Life). Of course, if you want to
      work on whatever you can do that as well. Delicious free food, but RSVP!
      <a href="https://bit.ly/code-party-0">bit.ly/code-party-0</a>
    </p>
  </short>
  <abstract>
    <p>
      The first code party of Winter 2015, and we have something a litle different
      this time. We're running a Code Retreat (coderetreat.org) with Boltmade.
      The result of this is that you will be able to do a coding challenge, wherein
      you implement Rule 110 (like the Game of Life). Of course, if you want to
      work on whatever you can do that as well. Delicious free food, but RSVP!
      <a href="https://bit.ly/code-party-0">bit.ly/code-party-0</a>
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-02-05" time="3:30 PM" room="DC 1302"
           title="Making Robots Behave">
  <short>
    <p>
      Part of the Cheriton School of CS' Distinguished Lecture Series, MIT's Leslie Kaelbling will
      discuss robotic AI applied to the messy real world. We make a number of
      approximations during planning but regain robustness and effectiveness
      through a continuous state estimation and replanning process. This allows
      us to solve problems that would otherwise be intractable to solve optimally.
    </p>
  </short>
  <abstract>
    <p>
      The fields of AI and robotics have made great improvements in many
      individual subfields, including in motion planning, symbolic planning,
      probabilistic reasoning, perception, and learning.  Our goal is to
      develop an integrated approach to solving very large problems that are
      hopelessly intractable to solve optimally.  We make a number of
      approximations during planning, including serializing subtasks,
      factoring distributions, and determinizing stochastic dynamics, but
      regain robustness and effectiveness through a continuous state
      estimation and replanning process.  This approach is demonstrated in
      three robotic domains, each of which integrates perception, estimation,
      planning, and manipulation.
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-02-02" time="6:00 PM" room="MC 4063"
           title="Racket's Magical match">
  <short>
    <p>
      Theo Belaire, a fourth-year CS student, will be talking about Racket's
      match' function. Bug resistant, legible, and super powerful! Especially
      useful for CS 241 in writing compilers, but all-round a joy to write.
    </p>
  </short>
  <abstract>
    <p>
      Come learn how to use the power of the Racket match construct to make your
      code easier to read, less bug-prone and overall more awesome!
    </p>
    <p>
      Theo Belaire,
      a fourth-year CS student, will show you the basics of how this amazing
      function works, and help you get your feet wet with some code examples and
      advanced use cases.
    </p>
    <p>
      If you're interested in knowing about the more
      powerful features of Racket, then this is the talk for you! The material
      covered is especially useful for students in CS 241 who are writing their
      compiler in Racket, or are just curious about what that might look like.
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-01-21" time="6:00 PM" room="MC 2017"
           title="Alumni Tech Talk">
  <short>
    <p> Alex Tsay from AeroFS will talk about the high availability distributed
       file systems they develop.
    </p>
    <p>The CAP Theorem outlined the fundamental limitations of a distributed system.
    When designing a distributed system, one has to constantly be aware of the
    trade-off between consistency and availability.

    Most distributed systems are designed with consistency in mind. However, AeroFS
    has decided to build a high-availability file system instead.

    In this tech talk, I'll be presenting an overview of AeroFS file system,
    advantages and challenges of a high-availability file system, and examine the
    inner workings of AeroFS's core syncing algorithm.
    </p>
  </short>
  <abstract>
    <p> Alex Tsay from AeroFS will talk about the high availability distributed
       file systems they develop.
    </p>
    <p>The CAP Theorem outlined the fundamental limitations of a distributed system.
    When designing a distributed system, one has to constantly be aware of the
    trade-off between consistency and availability.

    Most distributed systems are designed with consistency in mind. However, AeroFS
    has decided to build a high-availability file system instead.

    In this tech talk, I'll be presenting an overview of AeroFS file system,
    advantages and challenges of a high-availability file system, and examine the
    inner workings of AeroFS's core syncing algorithm.
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-01-15" time="7:00 PM" room="Comfy Lounge"
           title="Winter 2015 Elections">
  <short>
    <p>Elections for Winter 2015 are being held! Submit a nomination and join
       your fellow members in choosing this term's CSC executive. (Please note
       the time change to 7PM.)
    </p>
  </short>
  <abstract>
    <p>The Computer Science Club will be holding its termly elections this
       upcoming Thursday, Jan. 15 at 6PM in the Comfy Lounge (MC 3001). During
       the election, the president, vice-president, treasurer and secretary will
       be elected, the sysadmin will be ratified, and the librarian and office
       manager will be appointed.
    </p>
    <p>Nominations are now closed. The candidates are:</p>
    <ul>
      <li>President:<ul>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Gianni Gambetti (<tt>glgambet</tt>)</li>
        <li>Ford Peprah (<tt>hkpeprah</tt>)</li>
        <li>Khashayar Pourdeilami (<tt>kpourdei</tt>)</li>
      </ul></li>
      <li>Vice-President:<ul>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Gianni Gambetti (<tt>glgambet</tt>)</li>
        <li>Patrick Melanson (<tt>pj2melan</tt>)</li>
        <li>Ford Peprah (<tt>hkpeprah</tt>)</li>
        <li>Khashayar Pourdeilami (<tt>kpourdei</tt>)</li>
      </ul></li>
      <li>Treasurer:<ul>
        <li>Weitian Ding (<tt>wt2ding</tt>)</li>
        <li>Aishwarya Gupta (<tt>a72gupta</tt>)</li>
        <li>Edward Lee (<tt>e45lee</tt>)</li>
      </ul></li>
      <li>Secretary:<ul>
        <li>Ilia "itchy" Chtcherbakov (<tt>ischtche</tt>)</li>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Patrick Melanson (<tt>pj2melan</tt>)</li>
        <li>Ford Peprah (<tt>hkpeprah</tt>)</li>
        <li>Khashayar Pourdeilami (<tt>kpourdei</tt>)</li>
      </ul></li>
    </ul>
    <p>Voting will be heads-down, hands-up, restricted to MathSoc social
       members. If you'd like to review the elections procedure, you can visit
       our <a href="http://csclub.uwaterloo.ca/about/constitution#officers">Constitution</a>
       page.
    </p>
  </abstract>
</eventitem>

<eventitem date="2015-01-15" time="6:00 PM" room="MC 2065"
           title="Tech Talk: Google Fiber Internet: The Messy Bits">
  <short>
    <p>
	Our speaker, Avery Pennarun, will share some not-very-secret secrets from
	the team creating GFiber's open source router firmware, including some
	discussion of wifi, marketing truthiness, the laws of physics, something
	about coaxial cables, embedded ARM processors, queuing theory, signal
	processing, hardware design, and kernel driver optimization. If you're lucky,
	he may also rant about poor garbage collector implementations. Also, there
	will be at least one slide containing one of those swooshy circle-and-arrow
	lifecycle diagrams, we promise.
    </p>
    <p>
	Please RSVP here: http://bit.ly/GoogleFiberTalk.
    </p>
  </short>
  <abstract>
    <p>
	Google Fiber's Internet service offers 1000 Mbps internet to a few cities:
	that's 100x faster than a typical home connection. The problem with going
	so fast is it moves the bottleneck around: for the first time, your Internet
	link may be faster than your computer, your wifi, or even your home LAN.
    </p>
    <p>
	Our speaker, Avery Pennarun, will share some not-very-secret secrets from
	the team creating GFiber's open source router firmware, including some
	discussion of wifi, marketing truthiness, the laws of physics, something
	about coaxial cables, embedded ARM processors, queuing theory, signal
	processing, hardware design, and kernel driver optimization. If you're lucky,
	he may also rant about poor garbage collector implementations. Also, there
	will be at least one slide containing one of those swooshy circle-and-arrow
	lifecycle diagrams, we promise.
    </p>
    <p>
	About Avery Pennarun:
	Avery graduated from the University of Waterloo in Computer Engineering,
	started some startups and some open source projects, and now works at Google
	Fiber on a small team building super fast wifi routers, TV settop boxes, and
	the firmware that runs on them. He lives in New York.
    </p>
    <p>
	Please RSVP here: http://bit.ly/GoogleFiberTalk.
    </p>
  </abstract>
</eventitem>

<!-- Fall 2014 -->

<eventitem date="2014-11-27" time="6:00 PM" room="MC 4020" title="Talk: Heroic Android HTTP">
  <short>
    <p>
      The network is unreliable. 3G networking is slow. Using WiFi drains your battery.
      The NSA is spying on you. Different versions of HttpURLConnection have different bugs.
    </p>
    <p>
      Jesse Wilson, a software developer at Square, will be talking about OkHttp,
      a library that he maintains, and how to use it to make your app's networking work even
      when conditions aren't ideal. He will talk about how to configure caching to improve behavior
      and save resources. He will talk about crypto, and he will give advice on which libraries
      to use to make good networking easy.
    </p>
    <p>
      Please RSVP here: https://www.ticketfi.com/event/77/heroic-android-http.
    </p>
  </short>
</eventitem>

<eventitem date="2014-11-25" time="5:30 PM" room="MC 4041" title="Talk: C++ ABI">
    <short>
        <p> C++ is an interesting study because it supports a large number of
            powerful, abstract concepts, yet it operates very close to the
            hardware compared to many modern programming languages. There are
            also many implementations of C++ which must be made interoperable.
            I will discuss some aspects of the Itanium 64 Application Binary
            Interface (ABI) for C++, which is now the de facto standard across
            Unix-like platforms of all architectures. In particular, I will
            cover a number of aspects of the class system fundamental to C++:
            data layout, polymorphic types, construction and destruction, and
            dynamic casting.
        </p>
    </short>
</eventitem>

<eventitem date="2014-11-21" time="6:00 PM" room="M3 1006"
    title="Code Party 1/SE Hack Day #13">
  <short>
    <p>
       Why sleep when you could be hacking on $SIDE_PROJECT, or working on
       $THE_NEXT_BIG_THING with some cool CSC/SE people?
       Come when you want, hack on something cool, demo before you leave.
    </p>
    <p>
       If you don't have a project, don't worry - we have a list of ideas,
       and a lot of people will be looking for an extra helping hand on
       their projects.
    </p>
    <p>
       NOTE: Dinner and snacks will only be served to those working on
       projects during the event.
    </p>
  </short>
</eventitem>

<eventitem date="2014-11-17" time="6:00 PM" room="QNC 1502"
    title="Talk: Why Pattern Recognition is Hard, and Why Deep Neural Networks Help">
  <short>
    <p>
       In the last few years, there has been breakthrough progress in pattern
       recognition -- problems like computer vision and voice recognition.
       This sudden progress has come from a powerful class of models called
       deep neural networks.
    </p>
    <p>
       This talk will explore what it means to do pattern recognition, why it
       is a hard problem, and why deep neural networks are so effective. We
       will also look at exciting and strange recent results, such as state
       of the art object recognition in images, neural nets playing video
       games, neural nets proving theorems, and neural nets learning to run
       python programs!
    </p>
    <p>
       Our speaker, Christopher Olah, is a math-obsessed and Haskell-loving
       research intern from Google's Deep Learning group. He has a blog about
       his research here: http://colah.github.io/.
    </p>
  </short>
</eventitem>

<eventitem date="2014-11-12" time="5:30 PM" room="EIT 1015"
    title="Talk: Machine Learning at Bloomberg">
  <short>
    <p>
        Kang, our guest speaker from Bloomberg, will illustrate some examples and
        difficulties associated with working on some of the most fascinating technical
        challenges in business and finance.
        He will also show some of the machine learning applications at Bloomberg that are
        useful in this environment.
        Please show up early to ensure a spot (and dinner).
    </p>
  </short>
</eventitem>

<eventitem date="2014-11-10" time="5:30" room="RCH 205" title="Talk: From Zero to Kernel">
  <short>
    <p>
        From the massive supercomputer, to your laptop, to a Raspberry Pi: all
        computing systems run on an operating system powered by a kernel. The kernel is
        the most fundamental software running on your computer, enabling developers and
        users to interact with its hardware at a higher level.
    </p>
    <p>
        This talk will explore the process of writing a minimal kernel from
        scratch, common kernel responsibilities, and explore of the challenges of
        kernel development.
    </p>
  </short>
</eventitem>

<eventitem date="2014-11-07" time="7:00 PM" room="MC Comfy" title="'Hackers' Screening">
  <short>
    <p>
      Women in Computer Science (WiCS) and the Computer Science Club (CSC) will
      meet up in the Comfy Lounge to watch a favourite cult classic: Hackers.
      Join us as we relive our 90s teenage hacking fantasies and stuff our faces
      with popcorn and junk food.
    </p>
    <p>
      Hackers of the world, unite!
    </p>
  </short>
</eventitem>

<eventitem date="2014-10-24" time="5:00 PM" room="MC 3003"
           title="Unix 101">
  <short>
    <p>
      Interested in Unix, but don't know where to start? Then Come learn some
      basic topics with us including interaction with the shell, motivation
      for using it, some simple commands, and more.
    </p>
  </short>
</eventitem>

<eventitem date="2014-10-24" time="6:00 PM" room="MC Comfy"
           title="Code Party 0">
  <short>
    <p>
        Immediately after UNIX 101, we will be having our first annual code party.
        Enjoy a free dinner, relax, and share ideas with your friends about
        your favourite topics in computer science.  Feel free to show up
        with or without personal projects to work on, we've got lots of ideas
        to get started with.
    </p>
  </short>
</eventitem>

<eventitem date="2014-10-22" time="5:00 PM" room="MC 4041"
           title="Talk: In Pursuit of the Travelling Salesman">
  <short>
    <p>
        The Travelling Salesman Problem is easy to state: given a number of
cities along with the cost of travel between each pair, find the cheapest way
to visit all of the cities and return to your starting point.  However, TSP is very  difficult to solve.
In this talk, Professor Bill Cook will  discuss the history, applications, and computation of this
fascinating problem.
    </p>
  </short>
  <abstract>
    <p>
        The Travelling Salesman Problem is easy to state: given a
        number of cities along with the cost of travel between each
        pair of them, find the cheapest way to visit them all and
        return to your starting point.  Easy to state, but
        difficult to solve.  Despite decades of research, in
        general it is not known how to significantly improve upon
        simple brute-force checking.  It is a real possibility that
        there may never exist an efficient method that is
        guaranteed to solve every instance of the problem.  This
        is a deep mathematical question: Is there an efficient
        solution method or not?  The topic goes to the core of
        complexity theory concerning the limits of feasible
        computation and we may be far from seeing its
        resolution. This is not to say, however, that the
        research community has thus far come away
        empty-handed.  Indeed, the problem has led to a large
        number of results and conjectures that are both
        beautiful and deep, and on the practical side solution
        methods are used to compute optimal or near-optimal tours
        for a host of applied problems on a daily basis, from
        genome sequencing to arranging music on iPods.  In this
        talk we discuss the history, applications, and
        computation of this fascinating problem.
    </p>
  </abstract>

</eventitem>

<eventitem date="2014-09-18" time="6:00 PM" room="MC 4021"
           title="Talk: Building a Mobile Platform for Android and iOS">
  <short>
    <p>
      Come listen to a Google software engineer give a talk on building a
      mobile platform for Android and iOS!
      Wesley Tarle has been leading development at Google in Kitchener and
      Mountain View, and building stuff for third-party developers on
      Android and iOS. He's contributed to Google Play services since its
      inception and continues to produce APIs and SDKs focused on mobile
      startups.
      RSVP at http://goo.gl/Pwc3m4.
    </p>
  </short>
</eventitem>


<!-- Spring 2014 -->

<eventitem date="2014-07-25" time="7:30 PM" room="Laurel Creek Fire Pit"
           title="CSC Goes Outside...Again!">
  <short>
    <p>
      Do you like going outside? Are you vitamin-D deficient from being in the
      MC too long? Do you think s'mores and bonfire are a delicious
      combination? If so, you should join us as the CSC is going outside again!
      Around 7:30PM, we're going to Laurel Creek Fire Pit for some outdoor fun.
      Come throw frisbees, relax and eat snacks in good company - even if you
      aren't a fan of the outside or vitamin-D deficient! We'll also have
      some sort of real food - probably pizza.
    </p>
  </short>
</eventitem>


<eventitem date="2014-07-22" time="6:00 PM" room="MC 4020"
           title="The Most Important Parts of School (from a CS dropout)">
  <short>
    <p>
      Learn about the real reasons you should be in school from David Wolever,
      CTO of akindi and a director of PyCon Canada.
    </p>
  </short>
  <abstract>
    <p>
      Hindsight is 20/20, and since leaving university I’ve had five years and three
      startups to reflect on the most valuable things I have (and haven’t) taken away
      from my time in school.
      David studied computer science for three years at the University of Toronto
      before leaving to be employee zero at a Waterloo-based startup. Since then
      he has been a founder of two more startups, started PyCon Canada, and has
      written hundreds of thousands of lines of code. He is currently CTO of Akindi, a
      Toronto-based startup trying to make multiple choice testing a bit less terrible.
      He’s best found on Twitter at http://twitter.com/wolever
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-07-11" time="5:00 PM" room="MC 3003, M3 1006"
           title="Unix 102, Code Party 1">
  <short>
    <p>
      Learn how to host a website and spend the night hacking!
    </p>
  </short>
  <abstract>
    <p>
      Did you know that by becoming a CSC member, you get 4GB of free webspace?
      Join us in MC 3003 on Friday July 11 to learn how to use that space and
      host content for the world to see!

      Afterwards we will be moving over to M3 1006 for a night of hacking and
      snacking! Work on a personal project, open source software, or anything
      you wish. Food will be provided for your hacking pleasure.

      Come join us for an evening of fun, learning, and food!
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-06-25" time="6:00 PM" room="MC 2035" title="Battle Decks">
  <short>
    <p>
      Five slides. Five minutes. Pure fun.
    </p>
  </short>
  <abstract>
    <p>
      Create an entertaining slideshow and present someone else's on the spot!
      Join us in MC 2035 on Wednesday June 25 at 18:00 for a fun evening of
      quick presentations of random slide decks. An example from last semester
      can be found at tinyurl.com/battle-decks-example. Please e-mail your
      battle deck to l3france@csclub.uwaterloo.ca. Snacks will be provided to
      fuel your battle hunger!
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-06-19" time="5:30 PM" room="MC 4064"
           title="Bloomberg Technical Talk">
  <short>
    <p>
      Learn how functional programming is used in the real world, while
      enjoying free dinner, and free swag.
    </p>
  </short>
  <abstract>
    <p>
      Enjoy a free dinner while Max Ransan, a lead developer at Bloomberg,
      talks about the use of functional programming within a recently developed
      product from Bloomberg. This includes UI generation, domain-specific
      languages, and more! Free swag will also be provided.
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-06-13" time="7:30 PM" room="Laurel Creek Fire Pit"
           title="CSC Goes Outside">
  <short>
    <p>
      Come throw a frisbee, hang around a bonfire, and roast marshmellows!
      This is a social event just for fun, so come relax and eat snacks in
      good company!
    </p>
  </short>
  <abstract>
    <p>
      Meet at the Laurel Creek Fire Pit (the one across Ring Road from EV3)
      at 7:30 for a fun night of hanging out with friends. If you aren't sure
      where it is, meet at the office ten minutes before hand, and we will
      walk over together. We'll start the evening off with throwing around
      a frisbee or two, and as the night goes on we'll light up the fire and
      get some s'mores cooking!
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-05-30" time="5:30 PM" room="MC 3003, Comfy Lounge"
           title="Unix 101/Code Party 0">
  <short>
    <p>
      Interested in Unix, but don't know where to start? Then Come learn some
      basic topics with us including interaction with the shell, motivation
      for using it, some simple commands, and more.
    </p>
    <p>
      Afterwards we will be moving over to the MC Comfy Lounge for a
      fun night of hacking! The sysadmin position will also be ratified
      during a general meeting of the membership at this time. Come join us
      for an evening of fun, learning, and food!
    </p>
  </short>
  <abstract>
    <p>
      Interested in Unix, but don't know where to start? Then start
      in MC 3003 on Friday May 30 with basic topics including
      interaction with the shell, motivation for using it, some simple
      commands, and more.
    </p>
    <p>
      Afterwards we will be moving over to the MC Comfy Lounge for a
      fun night of hacking! Work on a personal project, open source
      software, or anything you wish. Food will be available for your
      hacking pleasure. The Sysadmin position will also be ratified
      during a general meeting at this time. Come join us for an
      evening of fun, learning, and food!
    </p>
  </abstract>
</eventitem>

<eventitem date="2014-05-15" time="6:00 PM" room="Comfy Lounge"
           title="Spring 2014 Elections">
  <short>
    <p>The Computer Science Club will soon be holding elections for this term's
    executive. The president, vice president, treasurer, and secretary for the
    spring 2014 term will be elected. The system administrator, office manager,
    and librarian are also typically appointed here.
    </p>
  </short>
  <abstract>
    <p>Nominations are now closed. The candidates are:</p>
    <ul>
      <li>President:<ul>
        <li>Jinny Kim (<tt>yj7kim</tt>)</li>
        <li>Matthew Thiffault (<tt>mthiffau</tt>)</li>
        <li>Shane Creighton-Young (<tt>srcreigh</tt>)</li>
        <li>Hayford Peprah (<tt>hkpeprah</tt>)</li>
      </ul></li>
      <li>Vice-President:<ul>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Jinny Kim (<tt>yj7kim</tt>)</li>
        <li>Shane Creighton-Young (<tt>srcreigh</tt>)</li>
        <li>Hayford Peprah (<tt>hkpeprah</tt>)</li>
      </ul></li>
      <li>Treasurer:<ul>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Matthew Thiffault (<tt>mthiffau</tt>)</li>
        <li>Catherine Mercer (<tt>ccmercer</tt>)</li>
        <li>Joseph Chouinard (<tt>jchouina</tt>)</li>
      </ul></li>
      <li>Secretary:<ul>
        <li>Luke Franceschini (<tt>l3france</tt>)</li>
        <li>Catherine Mercer (<tt>ccmercer</tt>)</li>
        <li>Joseph Chouinard (<tt>jchouina</tt>)</li>
        <li>Ifaz Kabir (<tt>ikabir</tt>)</li>
      </ul></li>
    </ul>
  </abstract>
</eventitem>



<!-- Winter 2014 -->


<eventitem date="2014-03-28" time="7:00 PM" room="CPH 1346" title="HackWaterloo">
    <short>
        <p>Work on a software project for 24 hours in teams of up to 4 members. Swag will be provided
    by Facebook and Google. A Microsoft Surface Tablet will be awarded to the winning team.
    Register and find out more at <a href="http://hack-waterloo.com">http://hack-waterloo.com</a>.</p>
    </short>
    <abstract>
        <p>Work on a software project for 24 hours in teams of up to 4 members. Swag will be provided
    by Facebook and Google. A Microsoft Surface Tablet will be awarded to the winning team.
    Register and find out more at <a href="http://hack-waterloo.com">http://hack-waterloo.com</a>.</p>
    </abstract>
</eventitem>

<eventitem date="2014-03-18" time="7:00 PM" room="MC 4041" title="Battle Decks">
    <short>
        <p>Create a 5-slide PowerPoint presentation about a specific topic. Bring it with
            you to the event (on a flash drive). Submit it into the lottery. Select a random
            PowerPoint presentation from the lottery and talk about it on the spot.
        </p>
    </short>
    <abstract>
        <p>Create a 5-slide PowerPoint presentation about a specific topic. Bring it with
            you to the event (on a flash drive). Submit it into the lottery. Select a random
            PowerPoint presentation from the lottery and talk about it on the spot.
        </p>
    </abstract>
</eventitem>

<eventitem date="2014-03-14" time="7:00 PM" room="Comfy Lounge" title="Code Party 1">
    <short>
        <p>We will be having our 2nd code party this term. Enjoy a free dinner, relax, and
           share ideas with your friends about your favourite topics in computer science.
        </p>
    </short>
    <abstract>
        <p>We will be having our 2nd code party this term. Enjoy a free dinner, relax, and
           share ideas with your friends about your favourite topics in computer science.
        </p>
    </abstract>
</eventitem>

<eventitem date="2014-02-13" time="5:30 PM" room="MC 3003" title="UNIX 101">
    <short><p>Learn the basics of using tools found commonly on UNIX-like operating systems.
    For students new to this topic, knowledge gained from UNIX 101 would be useful in coursework.</p>
    </short>
    <abstract><p>Learn the basics of using tools found commonly on UNIX-like operating systems.
    For students new to this topic, knowledge gained from UNIX 101 would be useful in coursework.</p>
    </abstract>
</eventitem>

<eventitem date="2014-02-13" time="6:30 PM" room="Comfy Lounge" title="Code Party 0">
    <short><p>Immediately after UNIX 101, we will be having our first annual code party.
            Enjoy a free dinner, relax, and share ideas with your friends about
            your favourite topics in computer science.</p>
    </short>
    <abstract><p>Immediately after UNIX 101, we will be having our first annual code party.
            Enjoy a free dinner, relax, and share ideas with your friends about
           your favourite topics in computer science.</p>
    </abstract>
</eventitem>


<eventitem date="2014-02-04" time="5:30 PM" room="MC 4058" title="Bloomberg Talk">
  <short><p>
          Bloomberg's Alex Scotti will be presenting a talk this Tuesday on concurrency control
          implementations in relational databases. Free swag and dinner will be provided.
  </p></short>
  <abstract>
      <p>Join Alex Scotti of Bloomberg LP for a discussion of concurrency control
          implementation in relational database systems. Focus will be placed on the
          optimistic techniques as employed and developed inside Combdb2, Bloomberg's
          database system.</p>
      <p>Food will be served by Kismet!</p>
  </abstract>
</eventitem>


<eventitem date="2014-01-16" time="5:30 PM" room="Comfy Lounge" title="Winter 2014 Elections">
  <short><p>
     Elections for Winter 2014 are being held! The Executive will be elected,
     and the Office Manager and Librarian will be appointed by the new
     executive.
  </p></short>
  <abstract>
    <p>It's elections time again! On Thursday, January 16 at 5:30PM, come to the Comfy Lounge
    on the 3rd floor of the MC to vote in this term's President, Vice-President, Treasurer
    and Secretary. The Sysadmin, Librarian, and Office Manager will also be chosen at this time.</p>

    <p>Nominations are open until 4:30PM on Wednesday, January 15, and can be written
    on the CSC office whiteboard (yes, you can nominate yourself). Full CSC
    members can vote and are invited to drop by. You may also send nominations to
    the <a href="mailto:cro@csclub.uwaterloo.ca">Chief Returning Officer</a> by email.</p>

    <p>Nominations are now closed. The candidates are:</p>
    <ul>
      <li>President:<ul>
        <li>Jonathan Bailey (<tt>jj2baile</tt>)</li>
        <li>Nicholas Black (<tt>nablack</tt>)</li>
        <li>Bryan Coutts (<tt>b2coutts</tt>)</li>
        <li>Annamaria Dosseva (<tt>mdosseva</tt>)</li>
        <li>Youn Jin Kim (<tt>yj7kim</tt>)</li>
        <li>Visha Vijayanand (<tt>vvijayan</tt>)</li>
      </ul></li>
      <li>Vice-President:<ul>
        <li>Nicholas Black (<tt>nablack</tt>)</li>
        <li>Bryan Coutts (<tt>b2coutts</tt>)</li>
        <li>Visha Vijayanand (<tt>vvijayan</tt>)</li>
      </ul></li>
      <li>Treasurer:<ul>
        <li>Jonathan Bailey (<tt>jj2baile</tt>)</li>
        <li>Nicholas Black (<tt>nablack</tt>)</li>
        <li>Marc Burns (<tt>m4burns</tt>)</li>
        <li>Bryan Coutts (<tt>b2coutts</tt>)</li>
      </ul></li>
      <li>Secretary:<ul>
        <li>Jonathan Bailey (<tt>jj2baile</tt>)</li>
        <li>Bryan Coutts (<tt>b2coutts</tt>)</li>
        <li>Mark Farrell (<tt>m4farrel</tt>)</li>
      </ul></li>
    </ul>
  </abstract>
</eventitem>


<!-- Fall 2013 -->
<eventitem date="2013-11-23" time="TBD" room="Toronto, ON"
           title="CSC Goes to Toronto Erlang Factory Lite 2013">
  <short><p>
    The CSC has been invited to attend this Erlang conference in Toronto. If
    you are interested in attending, please sign up on our <a
    href="http://goo.gl/8XOELB">web form</a>. We have submitted a MEF proposal
    to cover the transportation fees of up to 25 math undergraduates.
  </p></short>
  <abstract><p>
    The CSC has been invited to attend this Erlang conference in Toronto. If you
    are interested in attending, please sign up on our <a
    href="http://goo.gl/8XOELB">web form</a>, so we can coordinate the group.
    We have submitted a MEF proposal to cover the transportation fees of up to
    25 math undergraduates to attend. You will be responsible for your
    conference fee and transportation, and if the MEF proposal is granted, you
    can submit your bus tickets/mileage record and conference badge to MEF for
    a reimbursement. From the <a
    href="https://www.erlang-factory.com/conference/Toronto2013">conference
    website</a>:</p>

    <p>"Our first ever Toronto Erlang Factory Lite has been confirmed. Join us
    on 23 November for a full day debate on Erlang as a powerful tool for
    building innovative, scalable and fault tolerant applications. Our speakers
    will showcase examples from their work experience and their personal success
    stories, thus presenting how Erlang solves the problems related to
    scalability and performance. At this event we will focus on what Erlang
    brings to the table in the multicore era."
  </p></abstract>
</eventitem>

<eventitem date="2013-11-22" time="6:30PM" room="MC 3001 (Comfy)"
           title="Hackathon-Code Party!!">