<?xml version='1.0'?>
<!DOCTYPE cscpage SYSTEM "../csc.dtd">

<cscpage title="Media">
<header/>
  <section title="CSC Media">
    Here you will find a wide variety of audio and video recordings of past
    CSC and other university-related talks. Some of these files are very large,
    and we do not recommend attempting to stream them. Most of these should be
    available upon request at the Computer Science Club office to be burnt to
    CD or DVD should you so choose.
    <ul class="media">

<mediaitem title="Netplay in Emulators">
	<abstract>
		<p>You've got a game, but you didn't write it. You're running it by emulating the machine it was meant to run on, and the machine it was meant to run on never had support for networking. Now, you want to play with your friend, over the Internet. Oh, and it's not acceptable to incur any latency between your controller and the game while we're at it. Surely that can't be possible, right? Wrong. This talk will discuss the re-emulation technique for netplay used commercially by a system called GGPO and freely in an emulator frontend called RetroArch, and how similar techniques can be applied to make networking work in other scenarios it was never meant for. This will be an unprepared, impromptu talk with no slides, so it should either be a fascinating dive into a little-heard-of technique, or an impenetrable mess of jargon and algorithms. Either way, it should be fun. Professor Richards is the maintainer of the netplay infrastructure for RetroArch, a popular emulator frontend for multiple platforms.</p>
	</abstract>
	<presentor>Gregor Richards</presentor>
	<mediafile file="gregor-talk.mp4" type="Netplay in Emulators (mp4)" />
	<thumbnail file="gregor-talk-thumb.png"/>
</mediaitem>

<mediaitem title="Unix 102 Spring 2017">
  <abstract>
    <p>
      Finished the bash unit in CS246 and still don't see what's great about
      Unix? Want to gain some more in-depth knowledge, or some less well-known
      tips and tricks for using the command line? Unix 102 is the event for you!
      Fatema is "kind of successful" and "knows things about Unix" and you
      can be too! Topics covered will be: users, groups and permissions, ez
      string manipulation, additional skills, tips and tricks.
    </p>
  </abstract>
  <presentor>Fatema, Charlie</presentor>
  <mediafile file="unix102-s17.mp4" type="Unix 102 Spring 2017 (mp4)" />
  <thumbnail file="unix102-s17-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="ALT-TAB - Manic PXE Dream Servers">
  <abstract>
    <p>
      PXE stands for Pre-eXecution Environment. Fatema will talk about the
      motivation for using it, examples of industry uses and a brief overview
      of what it is and how it works.
    </p>
  </abstract>
  <presentor>Fatema Boxwala</presentor>
  <mediafile file="fatema-manic-pxe-dream-servers.mp4" type="Manic PXE Dream Servers (mp4)" />
  <thumbnail file="fatema-manic-pxe-dream-servers-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="Feminism in STEM - a 101 Panel">
  <abstract>
    <p>
      A panel organized by the CS Club on how feminism manifests itself in STEM,
      specifically CS and Engineering.
    </p>
    <p>
      Panelists are Dr. Prabhakar Ragde, Swetha Kulandaivelan, and Filzah Nasir.
      Moderated by Fatema Boxwala.
    </p>
    <p>
      Due to battery trouble, the first few minutes of audio were lost. The panelists
      were introduced as Prabhakar from the School of Computer Science, Swetha from
      4A Mechanical Engineering, and Filzah as an Engineering grad student.
    </p>
    <p>
      Sample questions from the panel section are:
      <ul>
        <li>Filzah and Swetha, can you expand on how Engineering tries to keep its curriculum grounded in reality?</li>
        <li>Why would an Engineering 101 instructor tell the class to design urinals?</li>
        <li>Prabhakar, how can men in STEM help women get their voices heard?</li>
      </ul>

      Sample questions from the audience after the panel:
      <ul>
        <li>As a woman in CS, how do I know I wasn't hired to meet a diversity target?</li>
        <li>Filzah, you mentioned that "getting to 50%" isn't what you're interested in. Can you expand on that?</li>
        <li>An admittedly selfish argument I've seen on Reddit asks why we should cooperate with marginalized
          communities when we're not significantly affected by them? (Response at 10 minutes into questions)</li>
        <li>Prabhakar, how has CS changed since you were an undergrad?</li>
      </ul>
    </p>
    <p>
      A statistical errata: The Math faculty proportionally gives offers of admission to the 25% of women
      that apply, and there are no significant disproportionate dropout rates.
    </p>
  </abstract>
  <presentor>Prabhakar, Fatema, Filzah, Swetha</presentor>
  <mediafile file="fem101-panel-discussion.mp4" type="Panel questions and discussion (mp4)" />
  <mediafile file="fem101-questions.mp4" type="Audience questions (mp4)" />
  <thumbnail file="fem101-questions-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="Bringing OOP Best Practices to the World of Functional Programming">
  <abstract>
    <p>
      I transitioned from writing software in imperative, object-oriented
      (OO) programming languages to doing functional programming (FP)
      full-time, and you can do it, too! In this talk, I'll make a case for
      using FP for real-world development, cover some cases where common FP
      language features substitute for design patterns and OOP structure,
      and provide some examples of translating traditional OO design
      patterns into functional code.
    </p>
    <p>
      Due to battery shenanigans, not the entire talk was recorded. Instead, you
      can get the slides for this talk at
      <a href="https://hashman.ca/osb-2016/">the talks section of her site</a>.
    </p>
  </abstract>
  <presentor>Elana Hashman</presentor>
  <mediafile file="ehashman-oop-best-practices.mp4" type="OOP Best Practices (mp4)" />
  <thumbnail file="ehashman-oop-best-practices-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="Open Source Computer Sound Measurement">
  <abstract>
    <p>
      An ideal computer audio system should faithfully reproduce signals of
      all frequencies in the audible range (20 to 20,000 cycles per second).
      Real systems, particularly mobile devices and laptops, may still
      produce acceptable quality, but often have a limited response,
      particularly at the low (bass) frequencies.

      Sound/acousic energy refers to time varying pressure waves in air.
      When recording sound, the acoustic signal will be picked up by
      microphone, which converts it to electrical signals (voltages).  The
      signal is then digitized (analog to digital conversion) and stored as
      a stream of numbers in a data file.  On playback the digital signal is
      converted to an electrical signal (digital to analog conversion) and
      finally returned as an acoustic signal by a speaker and/or headphones.

      In this talk I will present open source software (Octave/Linux) to
      measure the end-to-end frequency response of an audio system using the
      Discrete Fourier Transform.  I will demonstrate the software using a
      standard USB audio interface and a consumer grade omnidirectional
      microphone.

      This is joint work with John Vanderkooy, Distinguished Professor
      Emeritus, Department of Physics and Astronomy.
    </p>
  </abstract>
  <presentor>Richard Mann</presentor>
  <mediafile file="rmann-oss-sound-measurement.mp4" type="OSS Sound Measurement (mp4)" />
  <thumbnail file="rmann-oss-sound-measurement-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="Network Infrastructure talk">
  <abstract>
    <p>
      Steve Bourque and Mike Patterson of IST will give a brief overview of campus network connectivity and interconnectivity. Steve will describe the general connections, and Mike will talk about specific security measures in place. We'll have refreshments!
    </p>
  </abstract>
  <presentor>Steve Bourque and Mike Patterson</presentor>
  <mediafile file="uw-infrastructure-sbourque-half.mp4" type="Steven Bourque Talk (x264)" />
  <mediafile file="uw-infrastructure-mpatters-half.mp4" type="Mike Patterson Talk (x264)" />
  <mediafile file="uw-infrastructure-mpatters-slides.pdf" type="Mike Patterson Slides (pdf)" />
  <mediafile file="uw-infrastructure-sbourque-slides.pdf" type="Steven Bourque Slides (pdf)" />
  <thumbnail file="uw-infrastructure-sbourque-half-thumb-small.jpg"/>
</mediaitem>

<mediaitem title="CSC and WiCS Career Panel">
  <abstract>
    <p>
      The CSC is joining WiCS to host a career panel! Come hear from Waterloo
      alumni as they speak about their time at Waterloo, experience with coop,
      and life beyond the university. A great chance to network and seek
      advice!
    </p>
    <p>
      The panelists are:
      <ul>
        <li>Joanne Mckinley - Software Engineer, Google</li>
        <li>Carol Kilner - COO, BanaLogic Corporation</li>
        <li>Harshal Jethwa - Consultant, Infusion</li>
        <li>Dan Collens - CTO, Big Roads</li>
      </ul>
    </p>
  </abstract>
  <presentor>Joanne McKinley, Carol Kilner, Harshal Jethwa, Dan Collens</presentor>
  <thumbnail file="csc-wics-f15-panel-thumb-small.jpg" />
  <mediafile file="csc-wics-f15-panel.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Back to Back Talks: Culture Turnaround and Software Defined Networks">
  <abstract>
    <p>
      Back to back talks from John Stix and Francisco Dominguez on turning
      a company's culture around and on Software Defined Networks!
    </p>
    <p>
      John Stix will be talking about how he turned around the corporate culture at Fibernetics Corporation.
    </p>
    <p>
      Francisco Dominguez will be talking about Software Defined Networks, which
      for example can turn multiple flakey internet connections into one reliable
      one.
    </p>
    <p>
      The speakers are:
      <ul>
        <li>John Stix - President, Fibernetics</li>
        <li>Francisco Dominguez - CTO, Fibernetics</li>
      </ul>
    </p>
    <p>
      Food and drinks will be provided!
    </p>
  </abstract>
  <presentor>John Stix, Francisco Dominguez</presentor>
  <thumbnail file="fibernetics-thumb-small.jpg" />
  <mediafile file="fibernetics.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Starting a VN Indie Game Company as a UW Student">
  <abstract>
    <p> Many people want to make games as signified by all the game development
        schools that are appearing everywhere. But how would you do it as a UW
        student? This talk shares the experiences of how making Sakura River
        Interactive was founded without any Angel/VC investment.
    </p>
    <p> The talk will start off with inspiration drawn of Co-op Japan, to it's
        beginnings at Velocity. Then a reflection of how various game
        development and business skills was obtained in the unexpected ways at
        UW will follow. How the application of probabilities, theory of
        computation, physical/psychological attraction theories was used in the
        development of the company's first game. Finally how various Computer
        Science theories helped evaluate feasibility of several potential
        incoming business deals.
    </p>
    <a href="http://www.sakurariver.ca/">From Sakura River interactive</a>
  </abstract>
  <presentor>Alfe Clemencio</presentor>
  <thumbnail file="indie-game-dev-clemencio-thumb-small.jpg" />
  <mediafile file="indie-game-dev-clemencio.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Cory Doctorow - The War on General Purpose Computing">
  <abstract>
    <p>
      No Matter Who's Winning the  War on General Purpose Computing, You're Losing
    </p>
    <p>
      If cyberwar were a hockey game, it'd be the end of the first period and
      the score would be tied 500-500. All offense, no defense.
    </p>
    <p>
      Meanwhile, a horrible convergence has occurred as everyone from car
      manufacturers to insulin pump makers have adopted the inkjet printer
      business model, insisting that only their authorized partners can make
      consumables, software and replacement parts -- with the side-effect of
      making it a felony to report showstopper, potentially fatal bugs in
      technology that we live and die by.
    </p>
    <p>
      And then there's the FBI and the UK's David Cameron, who've joined in
      with the NSA and GCHQ in insisting that everyone must be vulnerable to
      Chinese spies and identity thieves and pervert voyeurs so that the spy
      agencies will always be able to spy on everyone and everything, everywhere.
    </p>
    <p>
      It's been fifteen years since the copyright wars kicked off, and we're
      still treating the Internet as a glorified video-on-demand service --
      when we're not treating it as a more perfect pornography distribution
      system, or a jihadi recruitment tool.
    </p>
    <p>
      It's all of those -- and more. Because it's the nervous system of the
      21st century. We've got to stop treating it like a political football.
    </p>
    <p>
      (Cory Doctorow is affiliated with the Canadian branch of EFF, the
      <a href="https://www.eff.org/">Electronic Frontier Foundation</a>)
    </p>
  </abstract>
  <presentor>Cory Doctorow</presentor>
  <thumbnail file="cory-doctorow-f2015-thumb-small.png" />
  <mediafile file="cory-doctorow-f2015.mp4" type="Talk (x264)" />
  <mediafile file="cory-doctorow-f2015-hq.mp4" type="Talk (x246 Big File)" />
</mediaitem>

<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>
      Infra sound refers to sound waves below the range of human hearing.
      Infra sound comes from a number of natural phenomena including weather
      changes, thunder, and ocean waves. Common man made sources include
      heating and ventilation systems, industrial machinery, moving vehicle
      cabins (air, trains, cars), and energy generation (wind turbines, gas
      plants).
    </p>
    <p>
      In this talk Richard Mann will present equipment he has built to measure
      infra sound, and analyse some of the infra sound he has recorded.
    </p>
    <p>
      Note: In Winter 2016 Richard Mann will be offering a new course, in
      Computer Sound. The course will appear as CS489/CS689 ("Topics in
      Computer Science"). This is a project-based course (60% assignments, 40%
      project, no final). Details at his web page,
      <a href="http://www.cs.uwaterloo.ca/~mannr">~mannr</a>.
    </p>
  </abstract>
  <presentor>Richard Mann</presentor>
  <thumbnail file="mannr-infrared-thumb-small.jpg" />
  <mediafile file="mannr-infrared.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Runtime Type Inference in Dynamic Languages">
  <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?
    </p>
    <p>
      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.
    </p>
    <p>
      Does that mean two consecutive days of free food? Yes it does.
    </p>
  </abstract>
  <presentor>Kannan Vijayan</presentor>
  <thumbnail file="vijayan-type-inference-thumb-small.jpg" />
  <mediafile file="vijayan-type-inference.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="SAT and SMT solvers">
  <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?
    </p>
    <p>
      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.
    </p>
    <p>
      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.
    </p>
    <p>
      There are both .pdf slides and a .mp4 recording of the talk. Code samples
      and spellings of terms are in the slides, consider following along with
      the slides.
    </p>
  </abstract>
  <presentor>Murphy Berzish</presentor>
  <thumbnail file="mtrberzi-sat-smt-thumb-small.jpg" />
  <mediafile file="mtrberzi-sat-smt.mp4" type="Talk (x264)" />
  <mediafile file="mtrberzi-sat-smt-slides.pdf" type="Talk (PDF)" />
</mediaitem>

<mediaitem title="Racket's Magical Match">
  <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>
  <presentor>Theo Belaire</presentor>
  <thumbnail file="tbelaire_racket-thumb-small.jpg" />
  <mediafile file="tbelaire_racket.mp4" type="Talk (x264)" />
  <mediafile file="tbelaire_racket-slides.pdf" type="Talk (PDF)" />
  <mediafile file="tbelaire_racket-slides-source.rkt" type="Talk (Rkt)" />
  <mediafile file="tbelaire_racket-stdlib.rkt" type="Source (Rkt)" />
</mediaitem>

<mediaitem title="Distributed File Systems">
  <abstract>
    <p>
      Alex Tsay from AeroFS will talk about the high availability distributed
      file systems they develop. 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>
  <presentor>Alex Tsay</presentor>
  <thumbnail file="alex_tsay_aerofs-thumb-small.jpg" />
  <mediafile file="alex_tsay_aerofs.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Google Fiber: Speed is Hard">
  <abstract>
    <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>
  </abstract>
  <presentor>Avery Pennarun</presentor>
  <thumbnail file="google-speed-is-hard.png" />
  <mediafile file="speed-is-hard-at-uwaterloo.pdf" type="Talk (PDF)" />
</mediaitem>

<mediaitem title="In Pursuit of the Travelling Salesman">
  <abstract>
    <p>
      The traveling 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>
  <presentor>Bill Cook</presentor>
  <thumbnail file="bico_2014_travelling_salesman-thumb-small.jpg" />
  <mediafile file="bico_2014_travelling_salesman.mp4" type="Talk (x264)" />
</mediaitem>

<mediaitem title="Building a Mobile Platform for Android and iOS">
  <abstract>
    <p>
      A Google engineer gives 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.
    </p>
  </abstract>
  <presentor>Wesley Tarle</presentor>
  <thumbnail file="wtarle_mobile_platform_google-thumb-small.png" />
  <mediafile file="wtarle_mobile_platform_google.pdf" type="Talk (PDF)" />
</mediaitem>

<mediaitem title="Multi-processor Real-time Systems">
  <abstract>
    <p>
      Programming systems that obey hard real-time constraints is difficult.
      So is programming multiple CPUs that interact to solve a single
      problem.
    </p>

    <p>
      On rare occasions it is possible to mix two difficult problems to create
      one easy problem and multi-CPU real-time is, on the face of it,
      just such an occasion. Give each deadline its own CPU and it will
      never be missed. This intuition is, unfortunately, incorrect, which does
      not, however, prevent it being tried in many real-time systems.
    </p>

    <p>
      For three decades, fourth year students have been exploring this problem
      in CS452, using multiple tasks (virtual CPUs) running on a single CPU.
      It is now time to consider whether modern developments in CPU
      architecture make it possible to use multiple CPUs in CS452 given the
      practical constraint of a twelve week semester.
    </p>

    <p>
      This talk will describe the nature of computation typical of real-time
      systems, architectural solutions currently employed in the course, and
      possible architectures for multi-CPU systems.
    </p>
  </abstract>
  <presentor>Bill Cowan</presentor>
  <thumbnail file="wmcowan_multi_processor_realtime-thumb-small.jpg" />
  <mediafile file="wmcowan_multi_processor_realtime.mp4" type="Talk (x264)" />
  <mediafile file="wmcowan_multi_processor_realtime.mpg" type="Talk (MPG)" />
  <flvfile   file="wmcowan_multi_processor_realtime.flv" />
  <other>
    <p>
      Professor Cowan has taught CS 452, Real-Time Programming (aka The Trains Course)
      for the last few years.
    </p>
  </other>
</mediaitem>

<mediaitem title="How Browsers Work">
  <abstract>
    <p>
      Veteran Mozilla engineer Ehsan Akhgari presents a talk on the internals of web browsers.
      The material ranges from the fundamentals of content rendering to the latest innovations in browser design.
    </p>
    <p>
      Web browsers have evolved. From their humble beginnings as simple HTML
      rendering engines they have grown and evolved into rich application
      platforms. This talk will start with the fundamentals: how a browser
      creates an on-screen representation of the resources downloaded from
      the network. (Boring, right? But we have to start somewhere.) From
      there we'll get into the really exciting stuff: the latest innovations
      in Web browsers and how those innovations enable — even encourage —
      developers to build more complex applications than ever before. You'll
      see real-world examples of people building technologies on top of
      these "simple rendering engines" that seemed impossible a short time
      ago.
    </p>
  </abstract>
  <presentor>Ehsan Akhgari</presentor>
  <thumbnail file="how-browsers-work-thumb-small.jpg" />
  <mediafile file="how-browsers-work.mp4" type="Talk (x264)" />
  <mediafile file="how-browsers-work.mpg" type="Talk (MPG)" />
  <flvfile   file="how-browsers-work.flv" />
  <other>
    <p>
      Ehsan Akhgari has contributed to the Mozilla project for more than 5
      years.  He has worked on various parts of Firefox, including the user
      interface and the rendering engine.  He originally implemented Private
      Browsing in Firefox.  Right now he's focusing on the editor component
      in the Firefox engine.
    </p>
  </other>
</mediaitem>

<mediaitem title="General Purpose Computing on Graphics Cards">
  <abstract>
    <p>
      GPGPU (general purpose graphics processing unit) computing is an
      expanding area of interest, with applications in physics, chemistry,
      applied math, finance, and other fields. nVidia has created an
      architecture named CUDA to allow programmers to use graphics cards
      without having to write PTX assembly or understand OpenGL. CUDA is
      designed to allow for high-performance parallel computation controlled
      from the CPU while granting the user fine control over the behaviour
      and performance of the device.
    </p>
    <p>
      In this talk, I'll discuss the basics of nVidia's CUDA architecture
      (with most emphasis on the CUDA C extensions), the GPGPU programming
      environment, optimizing code written for the graphics card, algorithms
      with noteworthy performance on GPU, libraries and tools available to
      the GPGPU programmer, and some applications to condensed matter
      physics. No physics background required!
    </p>
  </abstract>
  <presentor>Katie Hyatt</presentor>
  <thumbnail file="kshyatt-gpgpu-thumb-small.jpg" />
  <mediafile file="kshyatt-gpgpu.mp4" type="Talk (x264)" />
  <mediafile file="kshyatt-gpgpu-480p.mp4" type="Talk (x246 480p)" />
  <flvfile   file="kshyatt-gpgpu-480p.mp4" />
 </mediaitem>

<!-- encoding problems
<mediaitem title="Analysis of randomized algorithms via the probabilistic method">
  <abstract>
    <p>
      In this talk, we will give a few examples that illustrate the basic method and show  how it can be used to prove the existence of objects with desirable combinatorial  properties as well as produce them in expected polynomial time via randomized  algorithms.  Our main goal will be to present a very slick proof from 1995 due to  Spencer on the performance of a randomized greedy algorithm for a set-packing  problem.  Spencer, for seemingly no reason, introduces a time variable into his  greedy algorithm and treats set-packing as a Poisson process.  Then, like magic,  he is able to show that his greedy algorithm is very likely to produce a good  result using basic properties of expected value.
    </p>
    <p>
      The probabilistic method is an extremely powerful tool in combinatorics that can be
      used to prove many surprising results.  The idea is the following: to prove that an
      object with a certain property exists, we define a distribution of possible objects
      and use show that, among objects in the distribution, the property holds with
      non-zero probability.  The key is that by using the tools and techniques of
      probability theory, we can vastly simplify proofs that would otherwise require very
      complicated combinatorial arguments.
    </p>
    <p>
      As a technique, the probabilistic method developed rapidly during the latter half of
      the 20th century due to the efforts of mathematicians like Paul Erdős and increasing
      interest in the role of randomness in theoretical computer science.  In essence, the
      probabilistic method allows us to determine how good a randomized algorithm's output
      is likely to be.  Possibly applications range from graph property testing to
      computational geometry, circuit complexity theory, game theory, and even statistical
      physics.
    </p>
    <p>
      In this talk, we will give a few examples that illustrate the basic method and show
      how it can be used to prove the existence of objects with desirable combinatorial
      properties as well as produce them in expected polynomial time via randomized
      algorithms.  Our main goal will be to present a very slick proof from 1995 due to
      Spencer on the performance of a randomized greedy algorithm for a set-packing
      problem.  Spencer, for seemingly no reason, introduces a time variable into his
      greedy algorithm and treats set-packing as a Poisson process.  Then, like magic,
      he is able to show that his greedy algorithm is very likely to produce a good
      result using basic properties of expected value.
    </p>
    <p>
      Properties of Poisson and Binomial distributions will be applied, but I'll remind
      everyone of the needed background for the benefit of those who might be a bit rusty.
      Stat 230 will be more than enough. Big O notation will be used, but not excessively.
    </p>
  </abstract>
  <presentor>Elyot Grant</presentor>
  <thumbnail
  <mediafile
  <flvfile
</mediaitem>

-->

<mediaitem title="Machine learning vs human learning: will scientists become obsolete">
  <abstract><p></p></abstract>
  <presentor>Dr. Shai Ben-David</presentor>
  <thumbnail file="human-vs-machine-learning-thumb-small.jpg" />
  <mediafile file="human-vs-machine-learning.mp4" type="Talk (x264)" />
  <mediafile file="human-vs-machine-learning.mpg" type="Talk (MPG)" />
  <flvfile   file="human-vs-machine-learning.flv" />
</mediaitem>

<mediaitem title="How to build a brain: From single neurons to cognition">
  <abstract>
    <p>
      Theoretical neuroscience is a new discipline focused on constructing mathematical models of brain function.  It has made significant headway in understanding aspects of the neural code.  However, past work has largely focused on small numbers of neurons, and so the underlying representations are often simple. In this talk I demonstrate how the ideas underlying these simple forms of representation can underwrite a representational hierarchy that scales to support sophisticated, structure-sensitive representations.
    </p>
    <p>
      Theoretical neuroscience is a new discipline focused on constructing
      mathematical models of brain function.  It has made significant
      headway in understanding aspects of the neural code.  However,
      past work has largely focused on small numbers of neurons, and
      so the underlying representations are often simple. In this
      talk I demonstrate how the ideas underlying these simple forms of
      representation can underwrite a representational hierarchy that
      scales to support sophisticated, structure-sensitive
      representations.  I will present a general architecture, the semantic
      pointer architecture (SPA), which is built on this hierarchy
      and allows the manipulation, processing, and learning of structured
      representations in neurally realistic models.  I demonstrate the
      architecture on Progressive Raven's Matrices (RPM), a test of
      general fluid intelligence.
    </p>
  </abstract>
  <presentor>Dr. Chris Eliasmith</presentor>
  <thumbnail file="how-to-build-a-brain-thumb-small.jpg" />
  <mediafile file="how-to-build-a-brain.mp4" type="Talk (x264)" />
  <mediafile file="how-to-build-a-brain.mpg" type="Talk (MPG)" />
  <flvfile   file="how-to-build-a-brain.flv" />
</mediaitem>

<mediaitem title="BareMetal OS">
  <abstract>
    <p>
      BareMetal is a new 64-bit OS for x86-64 based computers. The OS is written entirely in Assembly,  while applications can be written in Assembly or C/C++.  High Performance Computing is the main target application.
    </p>
  </abstract>
  <presentor>Ian Seyler, Return to Infinity</presentor>
  <thumbnail file="bare-metal-os-thumb-small.jpg" />
  <mediafile file="bare-metal-os.mp4" type="Talk (x264)" />
  <mediafile file="bare-metal-os.mpg" type="Talk (MPG)" />
  <flvfile   file="bare-metal-os.flv" />
</mediaitem>

<mediaitem title="A Brief Introduction to Video Encoding">
  <abstract>
    <p>
      In this talk, I will go over the concepts used in video encoding (such as motion estimation/compensation, inter- and intra- frame prediction, quantization and entropy encoding), and then demonstrate these concepts and algorithms in use in the MPEG-2 and the H.264 video codecs. In addition, some clever optimization tricks using SIMD/vectorization will be covered, assuming sufficient time to cover these topics.
    </p>
    <p>
      With the recent introduction of digital TV and the widespread success
      of video sharing websites such as youtube, it is clear that the task
      of lossily compressing video with good quality has become important.
      Similarly, the complex algorithms involved require high amounts of
      optimization in order to run fast, another important requirement for
      any video codec that aims to be widely used/adopted.
    </p>
  </abstract>
  <presentor>Peter Barfuss</presentor>
  <thumbnail file="pbarfuss-video-encoding-thumb-small.jpg" />
  <mediafile file="pbarfuss-video-encoding.mp4" type="Talk (x264)" />
  <mediafile file="pbarfuss-video-encoding.mpg" type="Talk (MPG)" />
  <flvfile   file="pbarfuss-video-encoding.flv" />
</mediaitem>

<mediaitem title="Cooking for Geeks">
  <abstract>
    <p>
      The CSC is happy to be hosting Jeff Potter, author of "Cooking for Geeks" for a presentation on the finer arts of food science.
      Jeff's book has been featured on NPR, BBC and his presentations have wowed audiences of hackers &amp; foodies alike.
      We're happy to have Jeff joining us for a hands on demonstration.
    </p>
    <p>
      But you don't have to take our word for it... here's what Jeff has to say:
    </p>
    <p>
      Hi! I'm Jeff Potter, author of Cooking for Geeks (O'Reilly Media, 2010), and I'm doing a "D.I.Y. Book Tour" to talk
      about my just-released book. I'll talk about the food science behind what makes things yummy, giving you a quick
      primer on how to go into the kitchen and have a fun time turning out a good meal.
      Depending upon the space, I’ll also bring along some equipment or food that we can experiment with, and give you a chance to play with stuff and pester me with questions.
    </p>
  </abstract>
  <presentor>Jeff Potter</presentor>
  <thumbnail file="cooking-for-geeks-thumb-small.jpg" />
  <mediafile file="cooking-for-geeks.mp4" type="Talk (x264)" />
  <mediafile file="cooking-for-geeks.mpg" type="Talk (MPG)" />
  <flvfile   file="cooking-for-geeks.flv" />
</mediaitem>

<mediaitem title="The Art of the Propagator">
  <abstract>
    <p>
      We develop a programming model built on the idea that the basic computational elements are autonomous machines interconnected by shared cells through which they communicate. Each machine continuously examines the cells it is interested in, and adds information to some based on deductions it can make from information from the others. This model makes it easy to smoothly combine expression-oriented and constraint-based programming; it also easily accommodates implicit incremental distributed search in ordinary programs.

      This work builds on the original research of Guy Lewis Steele Jr. and was developed more recently with the help of Chris Hanson.
    </p>
  </abstract>
  <presentor>Gerald Jay Sussman</presentor>
  <thumbnail file="sussman-propagator-thumb-small.jpg" />
  <mediafile file="sussman-propagator.mkv" type="Talk (MKV)" />
  <mediafile file="sussman-propagator-slides.pdf" type="Slides (PDF)" />
</mediaitem>

<mediaitem title="Why Programming is a Good Medium for Expressing Poorly Understood and Sloppily Formulated Ideas">
  <abstract>
    <p>
      I have stolen my title from the title of a paper given by Marvin Minsky in the 1960s, because it most effectively expresses what I will try to convey in this talk.
    </p>

    <p>
      We have been programming universal computers for about 50 years. Programming provides us with new tools to express ourselves. We now have intellectual tools to describe "how to" as well as "what is". This is a profound transformation: it is a revolution in the way we think and in the way we express what we think.
    </p>

    <p>
      For example, one often hears a student or teacher complain that the student knows the "theory" of some subject but cannot effectively solve problems. We should not be surprised: the student has no formal way to learn technique. We expect the student to learn to solve problems by an inefficient process: the student watches the teacher solve a few problems, hoping to abstract the general procedures from the teacher's behavior on particular examples. The student is never given any instructions on how to abstract from examples, nor is the student given any language for expressing what has been learned. It is hard to learn what one cannot express. But now we can express it!
    </p>

    <p>
      Expressing methodology in a computer language forces it to be unambiguous and computationally effective. The task of formulating a method as a computer-executable program and debugging that program is a powerful exercise in the learning process. The programmer expresses his/her poorly understood or sloppily formulated idea in a precise way, so that it becomes clear what is poorly understood or sloppily formulated. Also, once formalized procedurally, a mathematical idea becomes a tool that can be used directly to compute results.
    </p>

    <p>
      I will defend this viewpoint with examples and demonstrations from electrical engineering and from classical mechanics.
    </p>
  </abstract>
  <presentor>Gerald Jay Sussman</presentor>
  <thumbnail file="sussman-why-programming-thumb-small.jpg" />
  <mediafile file="sussman-why-programming.mkv" type="Talk (MKV)" />
  <mediafile file="sussman-why-programming-slides.pdf" type="Slides (PDF)" />
</mediaitem>

<mediaitem title="A brief history of CS curriculum at UW">
  <abstract>
    <p>
      I'll survey the evolution of our computer science curriculum over the
      past thirty-five years to try to convey the reasons (not always entirely
      rational) behind our current mix of courses and their division into core
      and optional. After some remarks about constraints and opportunities in
      the near future, I'll open the floor to discussion, and hope to hear
      some candid comments about the state of CS at UW and how it might be
      improved.
    </p>
    <p>
      About the speaker:
    </p>
    <p>
      Prabhakar Ragde is a Professor in the School of Computer Science at UW.
      He was Associate Chair for Curricula during the period that saw the
      creation of the Bioinformatics and Software Engineering programs, the
      creation of the BCS degree, and the strengthening of the BMath/CS degree.
    </p>
  </abstract>
  <presentor>Prabhakar Ragde</presentor>
  <thumbnail file="prabhakar-history-of-uw-cs-thumb-small.jpg" />
  <mediafile file="prabhakar-history-of-uw-cs.avi" type="Talk (XviD)" />
  <mediafile file="prabhakar-history-of-uw-cs.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="prabhakar-history-of-uw-cs.mpg" type="Talk (MPG)" />
  <flvfile   file="prabhakar-history-of-uw-cs.flv" />
  <other>
    <h2>Contact</h2>
    <p>If you would like to contact Dr. Ragde check out his <a href="http://www.cs.uwaterloo.ca/~plragde">website</a> or e-mail him at plragde at uwaterloo dot ca.</p>
  </other>
</mediaitem>

<mediaitem title="The Future of Robotics and Automated Systems">
  <abstract><p>
    Bill Gates in his article "A Robot in every home" in the Scientific
    American describes how the current robotics industry resembles the
    1970's of the Personal Computer Industry. In fact it is not just
    Microsoft which has already taken a step forward by starting the
    Microsoft Robotics studio, but robotics researchers around the world
    believe that robotics and automation systems are going to be
    ubiquitous in the next 10-20 years (similar to Mark Weiser's
    analogy of Personal Computers 20 years ago). Natural User Interfaces
    (NUIs) are going to revolutionize the way we interact with computers,
    cellular phones, household appliances, automated systems in our daily
    lives. Just like the GUI made personal computing a reality, I believe
    natural user interfaces will do the same for robotics.
    </p><p>During the presentation I will be presenting my ongoing
    software project on natural user interfaces as well as sharing my
    goals for the future, one of which is to provide an NUI SDK and the
    other to provide a common Robotics OS for every hardware vendor that
    will enable people to make applications without worrying about
    underlying functionality.  If time permits I would like to present a
    demo of my software prototype.
  </p></abstract>
  <presentor>Sam Pasupalak</presentor>
  <thumbnail file="sam-papusalak-future-thumb-small.jpg" />
  <mediafile file="sam-papusalak-future.avi" type="Talk (XviD)" />
  <mediafile file="sam-papusalak-future.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="sam-papusalak-future.mp4" type="Talk (MP4)" />
  <mediafile file="sam-papusalak-future.mpg" type="Talk (MPG)" />
  <flvfile   file="sam-papusalak-future.flv" />
</mediaitem>

<mediaitem title="Deep Learning With Multiplicative Interactions">
  <abstract><p>
  Deep networks can be learned efficiently from unlabeled data. The layers of
  representation are learned one at a time using a simple learning module,
  called a "Restricted Boltzmann Machine" that has only one layer of latent
  variables. The values of the latent variables of one module form the data for
  training the next module. Although deep networks have been quite successful
  for tasks such as object recognition, information retrieval, and modeling
  motion capture data, the simple learning modules do not have multiplicative
  interactions which are very useful for some types of data.
  </p><p>
  The talk will show how a third-order energy function can be factorized to
  yield a simple learning module that retains advantageous properties of a
  Restricted Boltzmann Machine such as very simple exact inference and a very
  simple learning rule based on pair-wise statistics. The new module contains
  multiplicative interactions that are useful for a variety of unsupervised
  learning tasks. Researchers at the University of Toronto have been using this
  type of module to extract oriented energy from image patches and dense flow
  fields from image sequences. The new module can also be used to allow motions
  of a particular style to be achieved by blending autoregressive models of
  motion capture data.
  </p></abstract>
  <presentor>Dr. Geoff Hinton</presentor>
  <thumbnail file="ghinton-deep-learning-thumb-small.jpg" />
  <mediafile file="ghinton-deep-learning.avi" type="Talk (XviD)" />
  <mediafile file="ghinton-deep-learning.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="ghinton-deep-learning.mp4" type="Talk (MP4)" />
  <mediafile file="ghinton-deep-learning.mpg" type="Talk (MPG)" />
  <flvfile   file="ghinton-deep-learning.flv" />
</mediaitem>

<mediaitem title="Wilderness Programming">
  <abstract><p>
  Paul Lutus describes his early Apple II software development days, conducted
  from the far end of a 1200-foot power cord, in a tiny Oregon cabin. Paul
  describes how he wrote a best-seller (Apple Writer) in assembly language,
  while dealing with power outages, lightning storms and the occasional curious
  bear.
  </p><p>
  Paul also describes his subsequent four-year solo around-the-world sail in a
  31-foot boat. And be ready with your inquiries -- Paul will answer your
  questions.
  </p><p>
  Paul Lutus has a wide background in science and technology. He designed
  spacecraft components for the NASA Space Shuttle and created a mathematical
  model of the solar system used during the Viking Mars lander program. Then, at
  the beginning of the personal computer revolution, Lutus switched career paths
  and took up computer science. His best-known program is "Apple Writer," an
  internationally successful word processing program for the early Apple
  computers.
  </p></abstract>

  <presentor>Paul Lutus</presentor>
  <thumbnail file="plutus-wilderness-programming-thumb-small.jpg" />
  <mediafile file="plutus-wilderness-programming.avi" type="Talk (XviD)" />
  <mediafile file="plutus-wilderness-programming.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="plutus-wilderness-programming.mp4" type="Talk (MP4)" />
  <mediafile file="plutus-wilderness-programming.mpg" type="Talk (MPG)" />
  <flvfile   file="plutus-wilderness-programming.flv" />
</mediaitem>

<mediaitem title="The Best Algorithms are Randomized Algorithms">
  <abstract><p>
  For many problems, randomized algorithms are either the fastest algorithm or the
  simplest algorithm; sometimes they even provide the only known algorithm.
  Randomized algorithms have become so prevalent that deterministic algorithms
  could be viewed as a curious special case. In this talk I will describe some
  startling examples of randomized algorithms for solving some optimization
  problems on graphs.
  </p></abstract>

  <presentor>Dr. Nick Harvey</presentor>
  <thumbnail file="nick-harvey-random-thumb-small.jpg" />
  <mediafile file="nick-harvey-random.avi" type="Talk (XviD)" />
  <mediafile file="nick-harvey-random.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="nick-harvey-random.mp4" type="Talk (MP4)" />
  <mediafile file="nick-harvey-random.mpg" type="Talk (MPG)" />
  <flvfile   file="nick-harvey-random.flv" />
</mediaitem>

<mediaitem title="QIP=PSPACE">
  <abstract><p>
  The interactive proof system model of computation is a cornerstone of complexity
  theory, and its quantum computational variant has been studied in quantum
  complexity theory for the past decade. In this talk I will discuss an exact
  characterization of the power of quantum interactive proof systems that I
  recently proved in collaboration with Rahul Jain, Zhengfeng Ji, and Sarvagya
  Upadhyay. The characterization states that the collection of computational
  problems having quantum interactive proof systems consists precisely of those
  problems solvable with an ordinary classical computer using a polynomial amount
  of memory (or QIP = PSPACE in complexity-theoretic terminology). This
  characterization implies the striking fact that quantum computing does not
  provide any increase in computational power over classical computing in the
  context of interactive proof systems.

  </p><p>I will not assume that the audience for this talk has any familiarity with
  either quantum computing or complexity theory; and to be true to the spirit of
  the interactive proof system model, I hope to make this talk as interactive as
  possible -- I will be happy to explain anything related to the talk that I can
  that people are interested in learning about.
  </p></abstract>

  <presentor>Dr. John Watrous</presentor>
  <thumbnail file="jwatrous-qip-thumb-small.jpg" />
  <mediafile file="jwatrous-qip.avi" type="Talk (XviD)" />
  <mediafile file="jwatrous-qip.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="jwatrous-qip.mp4" type="Talk (MP4)" />
  <mediafile file="jwatrous-qip.mpg" type="Talk (MPG)" />
  <flvfile   file="jwatrous-qip.flv" />
</mediaitem>

<mediaitem title="An Introduction to Vector Graphics Libraries with Cairo">
    <abstract><p>
    Cairo is an open source, cross platform, vector graphics library with the
    ability to output to many kinds of surfaces, including PDF, SVG and PNG
    surfaces, as well as X-Window, Win32 and Quartz 2D backends.
    </p><p>
    Unlike the raster graphics used with programmes and libraries such as The
    Gimp and ImageMagick, vector graphics are not defined by grids of pixels,
    but rather by a collection of drawing operations. These operations detail
    how to draw lines, fill shapes, and even set text to create the desired
    image. This has the advantages of being infinitely scalable, smaller in file
    size, and simpler to express within a computer programme.
    </p><p>
    This talk will be an introduction to the concepts and metaphors used by
    vector graphics libraries in general and Cairo in particular.
    </p></abstract>

  <presentor>Nathaniel Sherry</presentor>
  <thumbnail file="nsasherr-cairo-thumb-small.jpg" />
  <mediafile file="nsasherr-cairo.avi" type="Talk (XviD)" />
  <mediafile file="nsasherr-cairo.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="nsasherr-cairo.mp4" type="Talk (MP4)" />
  <mediafile file="nsasherr-cairo.mpg" type="Talk (MPG)" />
  <flvfile   file="nsasherr-cairo.flv" />
</mediaitem>

<mediaitem title="Software Transactional Memory and Haskell">
  <abstract><p>
    Concurrency is hard. Well maybe not hard, but it sure is annoying to get right. Even the
    simplest of synchronization tasks are hard to implement correctly when using synchronization
    primitives such as locks and semaphores.
  <p></p>
    In this talk we explore what Software Transactional Memory (STM) is, what problems STM solves,
    and how to use STM in Haskell. We explore a number of examples that show how easy STM is to use
    and how expressive Haskell can be. The goal of this talk is to convince attendees that STM is
    not only a viable synchronization solution, but superior to how synchronization is typically
    done today.
  </p></abstract>

  <presentor>Brennan Taylor</presentor>
  <thumbnail file="b4taylor-stm-thumb-small.jpg" />
  <mediafile file="b4taylor-stm.avi" type="Talk (XviD)" />
  <mediafile file="b4taylor-stm.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="b4taylor-stm.mp4" type="Talk (MP4)" />
  <mediafile file="b4taylor-stm.mpg" type="Talk (MPG)" />
  <flvfile file="b4taylor-stm.flv" />
</mediaitem>

<mediaitem title="Programming Quantum Computers">
  <abstract><p>
    Raymond Laflamme is the director of the Institute for Quantum Computing at the
    University of Waterloo and holds the Canada Research Chair in Quantum Information.
    He will give a brief introduction to quantum computing and why it matters, followed
    by a talk on programming quantum computers. This is followed by tours of IQC Labs.
  </p></abstract>

  <presentor>Dr. Raymond Laflemme and Various</presentor>
  <thumbnail file="iqc1-thumb-small.jpg" />
  <mediafile file="iqc1.avi" type="Talk (XviD)" />
  <mediafile file="iqc1.ogg" type="Talk (Ogg/Theora)" />
  <mediafile file="iqc1.mp4" type="Talk (MP4)" />
  <mediafile file="iqc1.mpg" type="Talk (MPG)" />
  <mediafile file="iqc2.avi" type="Quantum Key Distribution Lab (XviD)" />
  <mediafile file="iqc2.ogg" type="Quantum Key Distribution Lab (Ogg/Theora)" />
  <mediafile file="iqc2.mp4" type="Quantum Key Distribution Lab (MP4)" />
  <mediafile file="iqc2.mpg" type="Quantum Key Distribution Lab (MPG)" />
  <mediafile file="iqc3.avi" type="NMR Quantum Computer (XviD)" />
  <mediafile file="iqc3.ogg" type="NMR Quantum Computer (Ogg/Theora)" />
  <mediafile file="iqc3.mp4" type="NMR Quantum Computer (MP4)" />
  <mediafile file="iqc3.mpg" type="NMR Quantum Computer (MPG)" />
  <flvfile file="iqc1.flv" />
</mediaitem>

<mediaitem title="Functional Lexing and Parsing">
  <abstract><p>
    This talk will describe a non-traditional functional approach to the
    classical problems of lexing (breaking a stream of characters into
    "words" or tokens) and parsing (identifying tree structure in a stream
    of tokens based on a grammar, e.g. for a programming language that
    needs to be compiled or interpreted). The functional approach can
    clarify and organize a number of algorithms that tend to be opaque in
    their conventional imperative presentation. No prior background in
    functional programming, lexing, or parsing is assumed.
  </p>
  <p>The slides for this talk can be found <a href="http://mirror.csclub.uwaterloo.ca/csclub/pr-functional-lexing-parsing-slides.pdf">here</a> as a pdf.
  </p></abstract>

  <presentor>Dr. Prabhakar Ragde</presentor>
  <thumbnail file="pr-functional-lexing-parsing-thumb-small.jpg" />
  <mediafile file="pr-functional-lexing-parsing.avi" type="XviD" />
  <mediafile file="pr-functional-lexing-parsing.ogg" type="Ogg/Theora" />
  <mediafile file="pr-functional-lexing-parsing.mp4" type="MP4" />
  <mediafile file="pr-functional-lexing-parsing.mpg" type="MPG" />
  <flvfile file="pr-functional-lexing-parsing.flv" />
  <other>
  <h2>Contact</h2>
  <p>If you would like to contact Dr. Ragde check out his <a href="http://www.cs.uwaterloo.ca/~plragde">website</a> or e-mail him at plragde at uwaterloo dot ca.</p>
  </other>
</mediaitem>


<mediaitem title="Rapid Prototyping and Mathematical Art">
  <abstract><p>
   The combination of computer graphics, geometry, and rapid
   prototyping technology has created a wide range of exciting
   opportunities for using the computer as a medium for creative
   expression.  In this talk, I will describe the most popular
   technologies for computer-aided manufacturing, discuss
   applications of these devices in art and design, and survey
   the work of contemporary artists working in the area (with a
   focus on mathematical art).  The talk will be primarily
   non-technical, but I will mention some of the mathematical
   and computational techniques that come into play.</p>
   <p>The slides for this talk can be found <a href="http://mirror.csclub.uwaterloo.ca/csclub/kaplan-mathematical-art-slides.pdf">here</a> as a pdf.</p>
  </abstract>
  <presentor>Dr. Craig Kaplan</presentor>
  <thumbnail file="kaplan-mathematical-art-thumb-small.jpg" />
  <mediafile file="kaplan-mathematical-art.avi" type="XviD" />
  <mediafile file="kaplan-mathematical-art.ogg" type="Ogg/Theora" />
  <mediafile file="kaplan-mathematical-art.mp4" type="MP4" />
  <mediafile file="kaplan-mathematical-art.mpg" type="MPG" />
  <flvfile file="kaplan-mathematical-art.flv" />
  <other>
    <h2>Contact</h2>
    <p>If you would like to contact Dr. Kaplan check out his <a href="http://www.cgl.uwaterloo.ca/~csk/">website</a> or e-mail him at csk at uwaterloo dot ca.</p>
    <h2>Links and credits</h2>

    <p>This talk included images of the work of a large number of talented
    artists and researchers.  I list them here and include links to
    their work online.  Everyone is listed by order of appearance; when
    a credit appears to be missing, it's probably because the slides
    include photographs of my own work or joint work with collaborators.
    Thanks to all the artists who gave me permission to use photographs
    of their work here.</p>

    <ul>
        <li><a href="http://mathematicians.org.uk/eoh/">Edmund Harriss</a>:
            laser-cut business card</li>
        <li><a href="http://www.danfunderburgh.com/">Dan Funderburgh</a>:
            laser-cut papercuttings and laser-etched wood sculpture</li>
        <li><a href="http://littlefactory.com/">Little Factory</a>:
            laser-cut scarf</li>
        <li><a href="http://www.wimdelvoye.be/gothicworks.php">Wim Delvoye</a>:
            laser-cut gothic vehicles</li>
        <li><a href="http://www.georgehart.com/">George Hart</a>:
            modular kirigami, laser-cut acrylic and metal sculpture,
            3D printed scupture</li>
        <li><a href="http://fischer.com.au/">Fischer</a>: laser-cut
            wooden lamp (the <a href="http://www.ponoko.com/showroom/SquirrelswithHammers/zen-table-lamp-2463">lamp</a> can be seen on <a href="http://www.ponoko.com/">ponoko.com</a>)</li>
        <li><a href="http://graphics.stanford.edu/~georgp/">Georg Petchnigg</a>:
            CNC sushi plate</li>
        <li><a href="http://www.bathsheba.com/">Bathsheba Grossman</a>:
            3D printed metal sculpture</li>
        <li><a href="http://www.cs.berkeley.edu/~sequin/">Carlo Sequin</a>:
            3D mathematical sculpture</li>
        <li><a href="http://www.helasculpt.com/">Helaman Ferguson</a>:
            sculpture in stone and metal</li>
        <li><a href="http://www.bulatov.org/">Vladimir Bulatov</a>:
            3D printed metal sculpture</li>
        <li><a href="http://www.rinusroelofs.nl/">Rinus Roelofs</a>:
            3D geometric sculpture, printed and rendered</li>
        <li><a href="http://www-viz.tamu.edu/faculty/ergun/">Ergun Akleman</a>:
            Sculpture and surface design.  Note his downloadable
            <a href="http://www.topmod3d.org/">TopMod</a> software</li>
        <li><a href="http://www.shapeways.com/model/24535/tight_double_moebius0_025_8_5cm.html">Emmanuel Lattes</a>: twisted toroidal sculpture</li>
    </ul>

    <h2>Resources</h2>

    <p>Here are a few additional links of interest to the audience of this
    talk.</p>

    <ul>
        <li><a href="http://hacklab.to/">hacklab.to</a>: Toronto's hackerspace.
            The bought a disused laser cutter and refurbished it.</li>
        <li>My knife cutter is the <a href="http://www.silhouettemachine.com/">QuicKutz Silhouette</a>.  I bought mine online from <a href="http://www.scrapbooksbydesign.ca/">Scrapbooks by design</a> in Toronto.</li>
        <li><a href="http://www.lazerit.ca/">Lazerit</a> is a laser cutting
            service not far from the University of Waterloo campus.</li>
        <li><a href="http://www.ponoko.com/">ponoko.com</a> is one of a new
            breed of CAM-meets-Web2.0 sites.  You create and upload a design,
            and can then order fabricated copies of that design in various
            materials.  You can also set up a shop where others can do the
            same.</li>
        <li>The <a href="http://www.probotix.com/FireBall_v90_cnc_router_kit/">Fireball V90</a> is an inexpensive CNC router kit that would be fun for home hobby applications.   For extra geek points, it has a mount designed to hold a dremel.</li>
        <li>Evil Mad Scientist Laboratories created <a href="http://candyfab.org">CandyFab</a>, a (low resolution) 3D printer that produces edible candy as output.</li>
        <li>The <a href="http://reprap.org/">reprap</a> Aims to design a 3D printer
            capable of manufacturing a complete copy of itself.</li>
        <li><a href="http://www.shapeways.com/">Shapeways</a> is essentially
            a 3D version of ponoko.com-an online 3D printing service
            bureau where you can set up a shop to sell your work.</li>
        <li>Bathsheba Grossman has her metal sculptures printed by
            <a href="http://www.prometal.com/">Ex One's Prometal</a> service.</li>
    </ul>
  </other>
</mediaitem>


<mediaitem title="More Haskell functional programming fun">
  <abstract><p>
    TODO
  </p></abstract>
  <presentor>Andrei Barbu</presentor>
  <thumbnail file="abarbu2-thumb-small.jpg" />
  <mediafile file="abarbu2.avi" type="XviD" />
  <mediafile file="abarbu2.ogg" type="Ogg/Theora" />
  <mediafile file="abarbu2.mp4" type="MP4" />
  <mediafile file="abarbu2.mpg" type="MPG" />
  <flvfile   file="abarbu2.flv" />
</mediaitem>

<mediaitem title="Why you should care about functional programming with Haskell">
  <abstract><p>
    TODO
  </p></abstract>
  <presentor>Andrei Barbu</presentor>
  <thumbnail file="abarbu1-thumb-small.jpg" />
  <mediafile file="abarbu1.avi" type="XviD" />
  <mediafile file="abarbu1.ogg" type="Ogg/Theora" />
  <mediafile file="abarbu1.mp4" type="MP4" />
  <mediafile file="abarbu1.mpg" type="MPG" />
  <flvfile   file="abarbu1.flv" />
</mediaitem>

<mediaitem title="Off-the-Record Messaging: Useful Security and Privacy for IM">
  <abstract><p>
Instant messaging (IM) is an increasingly popular mode of communication
on the Internet.  Although it is used for personal and private
conversations, it is not at all a private medium.  Not only are all of
the messages unencrypted and unauthenticated, but they are all
routedthrough a central server, forming a convenient interception point
for an attacker.  Users would benefit from being able to have truly
private conversations over IM, combining the features of encryption,
authentication, deniability, and forward secrecy, while working within
their existing IM infrastructure.
  </p>
  <p>
In this talk, I will discuss "Off-the-Record Messaging" (OTR), a widely
used software tool for secure and private instant messaging.  I will
outline the properties of Useful Security and Privacy Technologies that
motivated OTR's design, compare it to other IM security mechanisms, and
talk about its ongoing development directions.
  </p></abstract>
  <presentor>Ian Goldberg</presentor>
  <thumbnail file="ian-goldberg-otr-thumb-small.jpg" />
  <mediafile file="ian-goldberg-otr.avi" type="XviD" />
  <mediafile file="ian-goldberg-otr.ogg" type="Ogg/Theora" />
  <mediafile file="ian-goldberg-otr.mp4" type="MP4" />
  <mediafile file="ian-goldberg-otr.mpg" type="MPG" />
  <flvfile file="ian-goldberg-otr.flv" />
  <other>
  <h2>Bio</h2>
    <p>
Ian Goldberg is an Assistant Professor of Computer Science at the
University of Waterloo, where he is a founding member of the
Cryptography, Security, and Privacy (CrySP) research group.  He holds a
Ph.D. from the University of California, Berkeley, where he discovered
serious weaknesses in a number of widely deployed security systems,
including those used by cellular phones and wireless networks. He also
studied systems for protecting the personal privacy of Internet users,
which led to his role as Chief Scientist at Zero-Knowledge Systems (now
known as Radialpoint), where he commercialized his research as the
Freedom Network.
    </p></other>
</mediaitem>

<mediaitem title="Privacy by Design">
  <abstract><p>
Globally, issues about information privacy in the marketplace have emerged in tandem with the dramatic and escalating increase in information stored
in electronic formats. Data mining, for example, can be extremely valuable for businesses, but in the absence of adequate safeguards, it can
jeopradize informational privacy. Dr. Ann Cavoukian talks about how to use technology to enhance privacy. Some of the technologies discussed
included instant messaging, RFID tags and Elliptical Curve Cryptography (ECC). Then Dr. Cavoukian explained the “7 Privacy – Embedded Laws” followed
by a discussion on a biometrics solution to encryption.
  </p></abstract>
  <presentor>Dr. Ann Cavoukian</presentor>
  <thumbnail file="privacy-thumb-small.jpg" />
  <mediafile file="privacy.avi" type="XviD" />
  <mediafile file="privacy.ogg" type="Ogg/Theora" />
  <mediafile file="privacy.mp4" type="MP4" />
  <mediafile file="privacy.mpg" type="MPG" />
  <flvfile file="privacy.flv" />
  <other>
  <h2>Bio</h2>
  <p>
Dr. Ann Cavoukian, as the Information and Privacy Commissioner, oversees the operations of Ontario's freedom of information and protection of
privacy laws, which apply to both provincial and municipal government organizations. She serves as an officer of the legislature, independent of the
government of the day. Ann joined the Information and Privacy Commission in 1987 as its first Director of Compliance and was appointed Assistant
Commissioner in 1990, responsible for the protection of privacy and compliance with the Freedom of Information and Protection of Privacy Acts. Prior
to her work at the Commission, Ann headed the Research Services Branch of the Ministry of the Attorney General. Ann received her M.A. and Ph.D. in
Psychology from the University of Toronto, where she specialized in criminology and lectured on psychology and the criminal justice system. Ann
speaks extensively on the importance of privacy around the world. Her published works include a recent book on privacy called "Who Knows:
Safeguarding Your Privacy in a Networked World."
  </p>
  </other>
</mediaitem>


<mediaitem title="C++0x - An Overview">
  <abstract><p>
   A good programming language is far more than a simple collection of
   features. My ideal is to provide a set of facilities that smoothly work
   together to support design and programming styles of a generality beyond
   my imagination. Here, I briefly outline rules of thumb (guidelines,
   principles) that are being applied in the design of C++0x. Then, I
   present the state of the standards process (we are aiming for C++09) and
   give examples of a few of the proposals such as concepts, generalized
   initialization, being considered in the ISO C++ standards committee.
   Since there are far more proposals than could be presented in an hour,
   I'll take questions.
  </p><p>
   Dr. Bjarne Stroustrup is the original designer and implementer of the
   C++ Programming Language.
  </p></abstract>
  <presentor>Dr. Bjarne Stroustrup</presentor>
  <thumbnail file="stroustrup-thumb-small.jpg" />
  <mediafile file="stroustrup.avi" type="XviD" />
  <mediafile file="stroustrup.ogg" type="Ogg/Theora" />
  <mediafile file="stroustrup.mp4" type="MP4" />
  <mediafile file="stroustrup.mpg" type="MPG" />
  <flvfile file="stroustrup.flv" />
  <other>
  <h2>Q&amp;A</h2>
  <ul>
    <li>Do you think you'll ever design a new language from scratch?</li>
    <li>How long after the standard is out do you expect to see a production compiler?</li>
    <li>Is it possible to do garbage collection cleanly and efficiently in C++?</li>
    <li>How soon after you created C++ did you see it start to take over the industry?</li>
    <li>Is there any particular naming convention you subscribe to?</li>
    <li>What's your opinion about the Microsoft implementation of C++?</li>
  </ul>
  </other>
</mediaitem>

<mediaitem title="PMAMC&amp;OC SASMS - Spring 2007">
  <presentor>PMClub Various Members</presentor>
  <thumbnail file="pmc-sasms-spring-2007-thumb-small.jpg" />
  <mediafile file="pmc-sasms-spring-2007.avi" type="XviD" size="643M" />
  <mediafile file="pmc-sasms-spring-2007.ogg" type="Ogg/Theora" size="598M" />
  <mediafile file="pmc-sasms-spring-2007.mp4" type="MP4" size="625M" />
  <mediafile file="pmc-sasms-spring-2007.mpg" type="MPG" size="641M" />
  <flvfile file="pmc-sasms-spring-2007.flv" />
</mediaitem>

<mediaitem title="Copyright vs Community in the Age of Computer Networks">
  <abstract><p>
    Copyright developed in the age of the printing press, and was designed
    to fit with the system of centralized copying imposed by the printing
    press. But the copyright system does not fit well with computer networks,
    and only draconian punishments can enforce it.
    </p><p>
    The global corporations that profit from copyright are lobbying for
    draconian punishments, and to increase their copyright powers, while
    suppressing public access to technology. But if we seriously hope to serve
    the only legitimate purpose of copyright -- to promote progress, for the
    benefit of the public -- then we must make changes in the other
    direction.
    </p><p>
    This talk by Richard M. Stallman is broken into two parts: the main talk
    and the question and answer sessions following the talk. Both are
    available in only Ogg/Theora format in keeping with Stallman's wishes. They
    are available under the <a href="http://creativecommons.org/licenses/nd/1.0/">
    Creative Commons NoDerivs 1.0</a> license.
  </p></abstract>
  <presentor>Richard M. Stallman</presentor>
  <other>
  <h2>Q&amp;A</h2>
  <p>
  Download the question and answers section for answers to questions such as:
  </p>
  <ul>
    <li> What do you do when no free alternatives for a proprietary program exist?  </li>
    <li> If we are to treat works used for practical purposes differently from those used for entertainment, how do you treat works such as video games that fall in both categories?  </li>
    <li> If most of the computing industry and the US Copyright Board don't disagree with your views on copyright, how come no one has gone to change things?  </li>
  </ul>
  </other>
  <thumbnail file="rms-qa-thumb-small.jpg" />
  <mediafile file="rms-talk.ogg" type="Talk (Ogg/Theora)" size="687M" />
  <mediafile file="rms-qa.ogg" type="Q&amp;A (Ogg/Theora)" size="225M" />
</mediaitem>

<mediaitem title="Usability in the Wild">
  <abstract><p>
    What is the typical monitor resolution of a GIMP user? How many monitors
    do they have? What size images do they work on? How many layers are in
    their images? The answers to these questions are generally unknown: no
    means currently exist for open source applications to collect usage data.
    In this talk, Professor Michael Terry will present ingimp, a version of
    GIMP that has been instrumented to automatically collect usage data from
    real-world users. Prof. Terry will discuss ingimp's design, the type of
    data we collect, how we make the data available on the web, and initial
    results that begin to answer the motivating questions. ingimp can be found
    at http://www.ingimp.org.
    </p><p>
    The slides from the talk are available here: <a href="http://mirror.csclub.uwaterloo.ca/csclub/ingimp_uw_csc_talk_6_27_2007.pdf">ingimp_uw_csc_talk_6_27_2007.pdf</a>.
  </p></abstract>
  <presentor>Dr. Michael Terry</presentor>
  <thumbnail file="mterry2-thumb-small.jpg" />
  <mediafile file="mterry2.avi" type="XviD" size="521M" />
  <mediafile file="mterry2.ogg" type="Ogg/Theora" size="535M" />
  <mediafile file="mterry2.mp4" type="MP4" size="509M" />
  <mediafile file="mterry2.mpg" type="MPG" size="520M" />
  <flvfile file="mterry2.flv" preview="mterry2.png" />
</mediaitem>

<mediaitem title="Ralph Stanton 40th Anniversary of Math Faculty Talk">
  <abstract><p>
    Ralph Stanton reflects on the founding of the University of
    Waterloo Math Faculty.
  </p></abstract>
  <presentor>Ralph Stanton</presentor>
  <thumbnail file="ralph-stanton-thumb-small.jpg" />
  <mediafile file="ralph-stanton.avi" type="XviD" />
  <mediafile file="ralph-stanton-xvid.avi" type="DivX" />
  <mediafile file="ralph-stanton.ogg" type="Ogg" />
  <mediafile file="ralph-stanton.mpg" type="MPG" />
  <flvfile file="ralph-stanton.flv" />
</mediaitem>

<mediaitem title="The Free Software Movement and GNULinux Operating System, a talk by Richard Stallman at UCSD">
  <abstract><p>
    Richard Stallman will speak about the goals and philosophy of the Free
    Software Movement, and the status and history the GNU Operating System,
    which in combination with the kernel Linux is now used by tens of millions
    of users world-wide.
    </p><p>
    Richard Stallman launched the development of the GNU operating system in
    1984. GNU is free software: everyone has the freedom to copy it and
    redistribute it, as well as to make changes either large or small. The
    GNU/Linux system, basically the GNU operating system with Linux added, is
    used on tens of millions of computers today.
    </p><p>
    "The reason I care especially, is that there is a philosophy associated
    with the GNU project, and this philosophy is actually the reason why there
    is a system -- and that is that free software is not just convenient and
    not just reliable.... More important than convenience and reliability is
    freedom -- the freedom to cooperate. What I'm concerned about is not
    individual people or companies so much as the kind of way of life that we
    have. That's why I think it's a distraction to think about fighting
    Microsoft."
    </p><p>
    <strong>Biography:</strong>
    Stallman has received the ACM Grace Hopper Award, a MacArthur Foundation
    fellowship, the Electronic Frontier Foundation's Pioneer award, and the
    Takeda Award for Social/Economic Betterment, as well as several honorary
    doctorates.
    </p><p>
    The Question and Answer session (starting shortly after the hour and half
    mark) posed a number of interesting questions including, "Do you support
    the Creative Commons license?" and "Can I use ATI and NVIDIA drivers
    because Mesa isn't nearly as complete?".
    <p></p>
    The talk is only available in Ogg Theora, in keeping with Richard
    Stallman's wishes.
  </p></abstract>
  <presentor>Richard M. Stallman</presentor>
  <thumbnail file="audio-file.png" />
  <mediafile file="rms_ucsd.ogg" type="Ogg Theora" size="148MB" />
</mediaitem>

<mediaitem title="Introduction to 3-d Graphics">
  <abstract><p>
    A talk for those interested in 3-dimensional graphics but unsure of where
    to start. Covers the basic math and theory behind projecting 3-dimensional
    polygons on screen, as well as simple cropping techniques to improve
    efficiency. Translation and rotation of polygons will also be discussed.
  </p></abstract>
  <presentor>The Prof</presentor>
  <thumbnail file="the-prof-graphics-thumb-small.jpg" />
  <mediafile file="the-prof-graphics.avi" type="DivX" size="272M" />
  <mediafile file="the-prof-graphics-xvid.avi" type="XviD" size="272M" />
  <mediafile file="the-prof-graphics.mpg" type="MPG" size="272M" />
  <mediafile file="the-prof-graphics.ogg" type="Ogg/Theora" size="274M"/>
</mediaitem>

<mediaitem title="UW Software Start-ups: What Worked and What Did Not">
  <abstract><p>
    A discussion of software start-ups founded by UW students and what they
    did that helped them grow and what failed to help. In order to share the
    most insights and guard the confidences of the individuals involved, none
    of the companies will be identified.
  </p></abstract>
  <presentor>Larry Smith</presentor>
  <thumbnail file="larry-smith-talk2-thumb-small.jpg" />
  <mediafile file="larry-smith-talk2.avi" type="DivX" size="332M" />
  <mediafile file="larry-smith-talk2-xvid.avi" type="XviD" size="332M" />
  <mediafile file="larry-smith-talk2.mpg" type="MPG" size="332M" />
  <mediafile file="larry-smith-talk2.ogg" type="Ogg/Theora" size="341M"/>
</mediaitem>

<mediaitem title="Riding The Multi-core Revolution">
  <abstract><p>
    For decades, mainstream parallel processing has been thought of as
    inevitable. Up until recent years, however, improvements in manufacturing
    processes and increases in clock speed have provided software with free
    Moore's Law-scale performance improvements on traditional single-core
    CPUs. As per-core CPU speed increases have slowed to a halt, processor
    vendors are embracing parallelism by multiplying the number of cores on
    CPUs, following what Graphics Processing Unit (GPU) vendors have been
    doing for years. The Multi-core revolution promises to provide
    unparallelled increases in performance, but it comes with a catch:
    traditional serial programming methods are not at all suited to
    programming these processors and methods such as multi-threading are
    cumbersome and rarely scale beyond a few cores. Learn how, with hundreds
    of cores in desktop computers on the horizon, a local software company is
    looking to revolutionize the way software is written to deliver on the
    promise multi-core holds.
  </p></abstract>
  <presentor>Stefanus Du Toit</presentor>
  <thumbnail file="sdt-thumb-small.jpg" />
  <mediafile file="sdt.avi" type="DivX" size="406M" />
  <mediafile file="sdt-xvid.avi" type="XviD" size="406M" />
  <mediafile file="sdt.mpg" type="MPG" size="405M" />
  <mediafile file="sdt.ogg" type="Ogg/Theora" size="411M" />
  <flvfile file="sdt.flv" />
</mediaitem>

<mediaitem title="ReactOS - An Open Source OS Platform for Learning">
  <abstract><p>
    The ReactOS operating system has been in development for over eight years
    and aims to provide users with a fully functional and Windows-compatible
    distribution under the GPL license. ReactOS comes with its own Windows
    2003-based kernel and system utilities and applications, resulting in an
    environment identical to Windows, both visually and internally.
    </p><p>
    More than just an alternative to Windows, ReactOS is a powerful platform
    for academia, allowing students to learn a variety of skills useful to
    software testing, development and management, as well as providing a rich
    and clean implementation of Windows NT, with a kernel compatible to
    published internals book on the subject.
    </p><p>
    This talk will introduce the ReactOS project, as well as the various
    software engineering challenges behind it. The building platform and
    development philosophies and utilities will be shown, and attendees will
    grasp the vast amount of effort and organization that needs to go into
    building an operating system or any other similarly large project. The
    speaker will gladly answer questions related to his background, experience
    and interests and information on joining the project, as well as any other
    related information.
    </p><p>
    Slides from the talk are available
    <a href="http://mirror.csclub.uwaterloo.ca/csclub/alex-ionescu.pdf">here</a>.
    </p><p>
    <strong>Biography</strong>
    </p><p>
    Alex Ionescu is currently studying in Software Engineering at Concordia
    University in Montreal, Quebec and is a Microsoft Technical Student
    Ambassador. He is the lead kernel developer of the ReactOS Project and
    project leader of TinyKRNL. He regularly speaks at Linux and Open Source
    conferences around the world and will be a lecturer at the 8th
    International Free Software Forum in Brazil this April, as well as
    providing hands-on workshops and lectures on Windows NT internals and
    security to various companies.
  </p></abstract>
  <presentor>Alex Ionescu</presentor>
  <thumbnail file="alex-ionescu-thumb-small.jpg" />
  <mediafile file="alex-ionescu.avi" type="DivX" size="451M" />
  <mediafile file="alex-ionescu-xvid.avi" type="XviD" size="451M" />
  <mediafile file="alex-ionescu.mpg" type="MPG" size="450M" />
  <mediafile file="alex-ionescu.ogg" type="Ogg/Theora" size="461M" />
  <flvfile file="alex-ionescu.flv" />
</mediaitem>

<mediaitem title="1989 Bill Gates Talk on Microsoft">
  <abstract><p>
    Bill Gates discusses the software and computer industry, and how Microsoft
    has contributed. Gates also discusses his views on the future of the
    computing industry. The talk was recorded in 1989 but was only recently
    digitized.
    </p><p>
    Topics include:<ul>
      <li>The start and history of the microcomputer industry</li>
      <li>Microsoft BASIC and the Altair 880 computer</li>
      <li>The transition from 8-bit to 16-bit computers</li>
      <li>Microsoft's history with IBM</li>
      <li>640k memory barrier and 16-bit architectures</li>
      <li>32-bit 386 and 486 architectures</li>
      <li>RISC and multi-processor machines</li>
      <li>EGA graphics and WYSIWYG editors</li>
      <li>Decreasing cost of memory, harddisks and hardware in general</li>
      <li>The importance and future of the mouse</li>
      <li>Object-oriented programming</li>
      <li>MS-DOS and OS/2</li>
      <li>Multi-threaded and multi-application systems</li>
      <li>Synchronization in multi-threaded applications</li>
      <li>Diskette-based software</li>
      <li>UNIX standardization and POSIX</li>
      <li>History of the Macintosh and Microsoft' involvement</li>
      <li>Involvement of Xerox in graphical user interfaces</li>
      <li>Apple vs. Microsoft lawsuit regarding user interfaces</li>
      <li>OS/2 future as a replacement for MS-DOS</li>
      <li>Microsoft Office on Macintosh</li>
      <li>Thin/dumb clients</li>
      <li>Compact discs</li>
      <li>Multimedia applications</li>
      <li>Gates' current role at Microsoft</li>
      </ul>
    </p><p>
    The following picture was taken after the talk (click for higher-res).
    </p><p>
    <a href="http://mirror.csclub.uwaterloo.ca/csclub/bill-gates-1989-big.jpg" target="_blank">
      <img src="http://mirror.csclub.uwaterloo.ca/csclub/bill-gates-1989.jpg" /></a>
    </p></abstract>
  <presentor>Bill Gates</presentor>
        <thumbnail file="audio-file.png" />
	<mediafile file="bill-gates-1989.mp3" type="mp3" size="85M" />
	<mediafile file="bill-gates-1989.flac" type="flac" size="540M" />
	<mediafile file="bill-gates-1989.ogg" type="ogg" size="56M" />
	<mediafile file="bill-gates-1989.wav" type="wav" size="945M" />
  </mediaitem>

  <mediaitem title="Spam Filters: Do they work and Can you prove it">
    <abstract><p>
      Do spam filters work?  Which is the best one?  How might filters be
      improved?  Without standards, one must depend on unreliable evidence,
      such as subjective impressions, testimonials, incomparable and
      unrepeatable measurements, and vendor claims for the answers to these
      questions.
      </p><p>
      You might think that your spam filter works well and couldn't be
      improved.  Are you sure?  You may think that the risk of losing
      important mail outweighs the benefit of using a filter.  Could you
      convince someone who holds the other opinion?  If I told you that my
      filter was 99-percent accurate, would you believe me?  Would you know
      what I meant?  Would you  be able to translate that 99-percent into
      the risk of losing an important message?
      </p><p>
      Gord Cormack talks about the science, logistics, and politics of Spam
      Filter Evaluation.
    </p></abstract>
    <presentor>Dr. Gord Cormack</presentor>
  <thumbnail file="cormack-spam-thumb-small.jpg" />
  <mediafile file="cormack-spam-xvid.avi" type="XviD" size="473M" />
  <mediafile file="cormack-spam.avi" type="DiVX" size="473M" />
  <mediafile file="cormack-spam.mpg" type="MPG" size="472M" />
  <mediafile file="cormack-spam.ogg" type="Ogg/Theora" size="481M" />
  <flvfile file="cormack-spam.flv" />
</mediaitem>

<mediaitem title="Software development gets on the Cluetrain">
  <abstract><p>
    Simon Law leads the Quality teams for Ubuntu, a free-software operating
    system built on Debian GNU/Linux. As such, he leads one of the largest
    community-based testing efforts for a software product. This does get a
    bit busy sometimes.
    </p><p>
    In this talk, we'll be exploring how the Internet is changing how software
    is developed. Concepts like open source and technologies like message
    forums are blurring the lines between producer and consumer. And this
    melting pot of people is causing people to take note, and changing the way
    they sling code.
    </p><p>
    The Computer Science Club would like to thank the CS-Commons Committee for
    co-sponsoring this talk.
  </p></abstract>
  <presentor>Simon Law</presentor>
  <thumbnail file="simon-talk-thumb-small.jpg" />
  <mediafile file="simon-talk-xvid.avi" type="XviD" size="178M" />
  <mediafile file="simon-talk.avi" type="DivX" size="178M" />
  <mediafile file="simon-talk.mpg" type="MPG" size="177M" />
  <flvfile file="simon-talk.flv" />
</mediaitem>

<mediaitem title="Semacode - Image recognition on mobile camera phones">
  <abstract><p>
    Could you write a good image recognizer for a 100 MHz mobile phone
    processor with 1 MB heap, 320x240 image, on a poorly-optimized Java stack?
    It needs to locate and read two-dimensional barcodes made up of square
    modules which might be no more than a few pixels in size. We had to do
    that in order to establish Semacode, a local start up company that makes a
    software barcode reader for cell phones. The applications vary from
    ubiquitous computing to advertising. Simon Woodside (founder) will discuss
    what it's like to start a business and how the imaging code works.
  </p></abstract>
  <presentor>Simon Woodside</presentor>
  <thumbnail file="semacode-thumb-small.jpg" />
  <mediafile file="semacode.avi" type="DivX" size="180M"/>
  <mediafile file="semacode-xvid.avi" type="XviD" size="180M"/>
  <mediafile file="semacode.mpg" type="Mpeg" size="180M"/>
</mediaitem>

<mediaitem title="Eric LaForest: Next Generation Stack Computing">
  <abstract><p>
    Eric LaForest delivers a crash-course on modern stack computing, the Forth
    programming language, and some projects of his own. Stack systems have
    faster procedure calls and reduced complexity (shorter pipeline, simpler
    compilation) relative to their conventional counterparts, as well as more
    consistent performance, which is very important for real-time systems.
    Many consider stack-based architecture's crowning feature, however, to be
    the unrivalled price-to-performance ratio.
    </p><p>
	Note: the slides are hard to make out in the video, so make sure to
    download the slides as well.
  </p></abstract>
  <presentor>Eric LaForest</presentor>
  <thumbnail file="ericlaforest-thumb-small.jpg" />
  <mediafile file="eric-laforest2-720-480.avi" type="DiVX" size="357M"/>
  <mediafile file="ericlaforest-xvid.avi" type="XViD" size="309M"/>
  <mediafile file="ericlaforest.mpg" type="Mpeg" size="307M" />
  <mediafile file="CSCtalkMar06.pdf" size="1M" type="slides [pdf]"/>
  <mediafile file="CSCtalkMar06.ppt" size="1M" type="slides [Power Point]" />
  <mediafile file="CSCtalkMar06.odp" size="1M" type="slides [Open Office]" />
</mediaitem>
<mediaitem title="Larry Smith: Creating Killer Applications">
  <abstract><p>
    A discussion of how software creators can identify application
    opportunities that offer the promise of great social and commercial
    significance. Particular attention will be paid to the challenge of
    acquiring cross domain knowledge and setting up effective collaboration.
  </p></abstract>
  <presentor>Larry Smith</presentor>
  <thumbnail file="larry-killer-applications-thumb-small.jpg" />
  <mediafile file="larry-killer-applications.avi" size="686M" type="DiVX" />
  <mediafile file="larry-killer-applications-xvid.avi" size="686M" type="XviD" />
  <mediafile file="larry-killer-applications.mpg" size="685M" type="MPG" />
  <mediafile file="larry-killer-applications.ogg" size="706M" type="Ogg" />
</mediaitem>

<mediaitem title="Larry Smith: Computing's Next Great Empires">
  <presentor>Larry Smith</presentor>
  <thumbnail file="audio-file.png" />
  <mediafile file="larry-smith-talk.ogg" type="Ogg" />
  <mediafile file="larry-smith-talk.mp3" type="MP3" />
</mediaitem>

<mediaitem title="Rico Mariani: Eighteen Years in the Software Tools Business">
  <abstract><p>
    Rico Mariani, (BMath CS/EEE 1988) now an (almost) 18 year Microsoft
    veteran but then a CSC president comes to talk to us about the evolution
    of software tools for microcomputers. This talk promises to be a little
    bit about history and perspective (at least from the Microsoft side
    of things) as well as the evolution of software engineers, different types
    of programmers and their needs, and what it's like to try to make the
    software industry more effective at what it does, and sometimes succeed!
    Particularly illuminating are his responses to advocates of
    free/open-source software.
  </p></abstract>
  <presentor>Rico Mariani</presentor>
  <thumbnail file="rico-thumb-small.jpg" />
  <mediafile file="rico.avi" type="XviD" size="534M" />
  <mediafile file="rico.ogg" type="Ogg/Theora" size="528M" />
  <mediafile file="rico.mp4" type="MP4" size="507M" />
  <mediafile file="rico.mpg" type="MPG" size="532M" />
  <flvfile file="rico.flv" />
</mediaitem>

    </ul>
  </section>
<footer />
</cscpage>
