<eventitemdate="2021-05-24"time="7 PM"room="Online"title="CSC x SE Soc: Interview Prep">
<short>
<p>CSC and SE Soc are hosting an Interview Prep Workshop next week! Join Kristy Gao and Bimesh De Silva as they review the interview process, from behavioural to technical interviews. They'll finish off with live mock interviews, and the event will be held on Twitch (https://www.twitch.tv/uwcsclub).</p>
</short>
<abstract>
<p>Browsing through your unsolved Leetcode problems? Flipping open CTCI for the first time? Have no clue what to expect from a technical interview or just need an interview refresher? </p>
<p>We've got you covered at our CSC x SE Soc Interview Prep Workshop this Monday, May 24th from 7:00-8:30pm ET! Live-streamed on Twitch, Kristy Gao and Bimesh De Silva will be walking through important aspects of the interview process from coding challenges to behavioural interviews to algorithmic interviews, go through some live mock interviews, and share their tips and techniques along the way!</p>
<p>Registration isn't required, we'll just be sending you an email reminder, as well as inviting you to our calendar event!</p>
<p>The event will be hosted on Twitch at <ahref="https://www.twitch.tv/uwcsclub">https://www.twitch.tv/uwcsclub</a></p>
<p>Register at <ahref="http://bit.ly/csc-sesoc-interview-prep-signup">http://bit.ly/csc-sesoc-interview-prep-signup</a>!</p>
</abstract>
</eventitem>
<eventitemdate="2021-05-17"time="8:00 pm"room="Online"title="CSC BOT & Game Night">
<short>
<p>
Learn about our plans for the term and play some games with us.
</p>
</short>
<abstract>
<p>Kick off your Spring term with CSC! Come join us on Discord to learn more about what we'll be up to this term and how you can participate!</p>
<p>Afterwards, stick around for a relaxing and fun game night. See you there!</p>
Live Resume Critiques with Tech+, UW Data Science Club, and UW PM (registration required).
</p>
</short>
<abstract>
<p>Joining forces with Tech+, UW Data Science Club, and UW PM, we're hosting live resume critiques!</p>
<p>The session will be held on Discord; you must sign up at <ahref="http://bit.ly/S21-resume-critique">http://bit.ly/S21-resume-critique</a> to gain access to the critiques. Deadline to signup is Friday, May 14th at 11:59pm EDT.</p>
Live Resume Critiques with Tech+, UW Data Science Club, and UW PM (registration required).
</p>
</short>
<abstract>
<p>Joining forces with Tech+, UW Data Science Club, and UW PM, we're hosting live resume critiques!</p>
<p>The session will be held on Discord; you must sign up at <ahref="http://bit.ly/S21-resume-critique">http://bit.ly/S21-resume-critique</a> to gain access to the critiques. Deadline to signup is Friday, May 14th at 11:59pm EDT.</p>
Join us for lightning tech talk presented by students.
</p>
</short>
<abstract>
<p>CSC is proud to present to you Alt-Tab! Join us in a lightning tech talk series presented to you by our very own students. Alt-Tab consists of 10 to 15-minute talks about anything related to tech. Learn more about exciting topics that range from competitive programming to cryptography!</p>
<p>We will have four incredible presenters that are eager to share their insights with you. Stay tuned as we'll be introducing them and the topics that they will be discussing soon!.</p>
<p>Registration is not required to attend! We'll just be sending you an email reminder, as well as inviting you to our calendar event.</p>
<p>Event Date: March 27th EDT via Twitch (<ahref="https://www.twitch.tv/uwcsclub">https://www.twitch.tv/uwcsclub</a>) at 2:30-4pm</p>
<p>You can also attend here: <ahref="https://live.csclub.uwaterloo.ca/2021-03-27-alt-tab.html">https://live.csclub.uwaterloo.ca/2021-03-27-alt-tab.html</a>.</p>
<p>Register at <ahref="http://bit.ly/uwcsclub-alt-tab-signup!">http://bit.ly/uwcsclub-alt-tab-signup!</a> Alternatively, you can also email us at exec@csclub.uwaterloo.ca to sign up as well.</p>
<p>See you all soon!</p>
</abstract>
</eventitem>
<eventitemdate="2021-03-25"time="7 pm"room="Online"title="Out of The Box: React">
<short>
<p>
Learn how React works and make your own version!
</p>
</short>
<abstract>
<p>Modern web frameworks are a black-box. They're easy to use, but they have numerous minute details to master in order to apply them to truly scalable websites. Over the last few years, front-end frameworks have absorbed the responsibilities of the back-end, meaning it's become ever more important to dig their details out of the box. </p>
<p>Out of the Box is a series of code-along projects that explore what's under the hood of modern web frameworks. Nearly 5 million websites use React, including many of the internet's most popular websites. While its simple syntax attracts developers from all over, underneath lies a complex infrastructure of code to manage all elements from caching to hooks. Rishi will bring these ideas to light in our inaugural episode of Out of the Box. Come join him and code your own version of React!</p>
<p>Only basic web experience is needed. All JavaScript code will be written within a single HTML document for simplicity. Node.js will also be required to participate in the event! </p>
<p>Registration is not required to attend! We'll just be sending you an email reminder, as well as inviting you to our calendar event.</p>
<p> Event Date: Thurs. March 25 at 7-9 PM EST via Twitch (<ahref="http://twitch.tv/uwcsclub">http://twitch.tv/uwcsclub</a>) </p>
<p> Register at <ahref="http://bit.ly/uwcsc-ootb-diy-react-signup!">http://bit.ly/uwcsc-ootb-diy-react-signup!</a> Alternatively, you can also email us at exec@csclub.uwaterloo.ca to sign up as well.</p>
Join CSC to meet new people in a Speed-Friending event.
</p>
</short>
<abstract>
<p>
Meeting people in University can be challenging, especially when it's virtual.
We understand these struggles, and we want to give you a chance to meet other students! The CS community is huge, and we'd like to connect you all.
</p>
<p>
Have you heard of speed-dating? Well, CSC is now introducing our Speed-Friending event, where you will get the chance to meet people in fast rotating groups of 3 or 4, and talk to them for about 10 minutes We'll provide you with an optional prompt to start off your discussions, but the rest is up to you!. Feel free to leave at any time with a group you like.
</p>
<p>
You won't want to miss this event! Registration is optional; we'll just be sending you a reminder on the day of, as well as a calendar invite.
</p>
<p>
Event Date: Tuesday, March 16th from 7:30 - 8:30PM EST
</p>
<p>
Sign up at <ahref="https://bit.ly/uwcsclub-speed-friending-signup">https://bit.ly/uwcsclub-speed-friending-signup</a>! Alternatively, you can also email us at exec@csclub.uwaterloo.ca.
</p>
<p>
Click this link to join the event once it starts! We'll be hosting it on Zoom: <ahref="https://zoom.us/j/93667714038?pwd=aHIyOTAyOTNhd0VmREtONjl4QTNUUT09">https://zoom.us/j/93667714038?pwd=aHIyOTAyOTNhd0VmREtONjl4QTNUUT09</a>.
</p>
</abstract>
</eventitem>
<eventitemdate="2021-03-06"time="7:00 pm"room="Online"title="Afterhours: Personal Relationships">
<short>
<p>
Join CSC as we talk about personal relationships.
</p>
</short>
<abstract>
<p>
The past year has been tough for all of us, having to deal with the pandemic while studying or working remotely. If you've felt that meeting new people and sustaining relationships with others has never been more challenging, we feel that too, and we want to talk about it.
</p>
<p>
CSC brings you the third chapter of Afterhours, and this time we're discussing Personal Relationships. Join us for a chat about how our relationships (platonic and romantic) have been affected, whether that be due to co-op, sequence changes, or COVID. We'll be sharing our own personal stories and we'd love for you all to join in on the discussion.
</p>
Registration is required for attendance, so don't miss out!
<ul>
<li>Event Date: Sat. March 6 at 7 PM EST via Zoom</li>
<li>Register at <ahref="https://forms.gle/Gzeqvg9KpEghCH4H9">https://forms.gle/Gzeqvg9KpEghCH4H9</a>! Alternatively, you can also email us at exec@csclub.uwaterloo.ca to sign up as well.</li>
<li>Deadline to Register: Sat. March 6 at 12PM EST</li>
Join CSC as we play games all night! Come for an opportunity to play League (win some free skins :eyes:), Scribbl.io, Among Us, Jackbox, Tetris and more!
</p>
<p>
This event will be occurring on our Discord: <ahref="https://discord.gg/pHfYBCg">https://discord.gg/pHfYBCg</a>
Come watch a movie with CSC! Bring your popcorn and your movie commentary, we'll be looking for your input on what we watch so keep an eye out for a poll on our Discord.
</p>
<p>
This event will be occurring on our Discord: <ahref="https://discord.gg/pHfYBCg">https://discord.gg/pHfYBCg</a>
</p>
</abstract>
</eventitem>
<eventitemdate="2021-02-16"time="8:00 pm"room="Online"title="Talk to CSC Tuesday">
<short>
<p>
Come meet and chill out with CSC execs.
</p>
</short>
<abstract>
<p>
Come meet and chill out with CSC execs. This is an opportunity for you to meet new people and socialize with us!
</p>
<p>
This event will be occurring on our Discord: <ahref="https://discord.gg/pHfYBCg">https://discord.gg/pHfYBCg</a>
</p>
</abstract>
</eventitem>
<eventitemdate="2021-01-28"time="7:00 pm"room="Online"title="Recovering From a Rough Term">
<short>
<p>
Join us to learn about other students have bounced back from a rough term, and how you can too.
</p>
</short>
<abstract>
<p>
The fall term has ended and the winter term is ramping up. Maybe you didn't meet all your expectations last term, you are feeling overwhelmed with your coop search, or you are feeling stuck with a bad mindset-we've been there before and you're not alone.
</p>
<p> Introducing the first session of our Afterhours series, join us for a chat with fellow UW CS students. Learn about how they bounced back from their rough times and how you can too! </p>
Join us for tips and tricks on technical interviews.
</p>
</short>
<abstract>
<p> LeetCode? What is that?</p>
<p> Your favourite course is back and ready to help you cram for your upcoming WaterlooWorks interviews.</p>
<p> Join us on January 26 at 7PM EST on Twitch where we'll walk you through all the important concepts such as coding challenges, behavioural questions, and algorithms to help you crack the coding interview! Get your notebooks out and stay until the end to witness a CSC exec go through a sample problem and get some behind the scenes tips and tricks.</p>
<p>
The event will be streamed at <ahref="https://twitch.tv/uwcsclub">twitch.tv/uwcsclub</a>
</p>
<p>
Register at <ahref="https://forms.gle/pqG47mPh8cyf2sWB8">https://forms.gle/pqG47mPh8cyf2sWB8</a>
Join us for resume and WaterlooWorks tips for the upcoming coop search.
</p>
</short>
<abstract>
<p>
Class is in session and the job search is starting! Want your resume reviewed before applying?
</p>
<p>
With WaterlooWorks applications opening next week, we want to help you prepare for the coop hunt! Come join us on January 14th at 7pm EST on Twitch to get some WaterlooWorks tips and tricks and watch upper-year/alum students critique your resumes live.
Take notes as we provide resume advice from the perspective of engineers currently working in the tech industry!
</p>
<p>
Drop your resume in the registration link for a chance to get your resume reviewed live!
</p>
<p>
Not interested in a public critique? You can also drop your resume in the registration link for emailed feedback! More details on the RES135 registration form
</p>
<p>
The event will be streamed at <ahref="https://twitch.tv/uwcsclub">twitch.tv/uwcsclub</a>
</p>
<p>
Register at <ahref="https://forms.gle/KFygHB6N6mmnwWpm7">https://forms.gle/KFygHB6N6mmnwWpm7</a>
</p>
</abstract>
</eventitem>
<eventitemdate="2021-01-11"time="7:00 pm"room="Online"title="Get involved in CS Club!">
<short>
<p>
Learn about how you can involved with CS Club this term.
</p>
</short>
<abstract>
<p>Do you want to take part in CS Club's exciting upcoming events? Want to help out with our website redesign? Come join us on January 11th at 7pm EST on Twitch to learn about how you can become a member of CS Club, the roles that you can take on and how to participate in existing and brand-new community initiatives.
</p>
<p>
The event will be streamed at <ahref="https://twitch.tv/uwcsclub">twitch.tv/uwcsclub</a>
</p>
<p>
Register at <ahref="https://forms.gle/WBGPkvs5HzX1CEj98">https://forms.gle/WBGPkvs5HzX1CEj98</a>
</p>
</abstract>
</eventitem>
<!-- Fall 2020-->
<eventitemdate="2020-11-25"time="7:00 pm"room="Online"title="Roasting Our First Year Resumes">
<short>
<p>
Upper years students will be critiquing their own resumes from first year.
</p>
<p>
👉 Streamed at <ahref="https://twitch.tv/uwcsclub">twitch.tv/uwcsclub</a>
</p>
</short>
<abstract>
<p>
Looking to start your resume for next term but don’t know where to start? CSC is hosting a Roasting Our First Year Resumes event.
</p>
<p>
Join us on November 25 from 7-8pm on Twitch to hear from some Waterloo upper years as they critique their resumes from first year.
</p>
<p>
Be sure to tune in to hear resume tips from a diverse group of upper years in varying tech domains and bring your questions for the Q&A!
</p>
<p>
The event will be streamed at <ahref="https://twitch.tv/uwcsclub">twitch.tv/uwcsclub</a>
</p>
</abstract>
</eventitem>
<eventitemdate="2020-11-19"time="5:00 pm"room="Online"title="WiCS x CSC: Alt-Tab">
<short>
<p>
CSC and WiCS are hosting Alt-Tab on November 19th, 5-7 PM EST.
</p>
</short>
<abstract>
<p>
Come join the UW Computer Science Club (CSC) and Women in Computer Science (WiCS) on Thursday, November 19th from 5-7PM EST for Alt-Tab!
</p>
<p>
Alt-Tab is a lightning tech talk series presented by students and alumni. This term's Alt-Tab event will comprise of 4 different speakers who will be talking about topics including Ethereum NFT gaming, proof assistants and vanity Tor URLS. There will also be a raffle to win $20 gift cards!
</p>
</abstract>
</eventitem>
<!-- Winter 2020-->
<eventitemdate="2020-03-12"time="6:00 pm"room="MC Comfy"title="WiCS x CSC Bondfire">
<short>
<p>
"Bonfire" with WiCS Thursday March 12th @ 6PM in MC Comfy
</p>
</short>
<abstract>
<p>
CSC and WiCS are hosting an indoor get together event Thursday March 12th @ 6PM in MC Comfy. Gather around the "bonfire" for a night of fun, food, and friends! Free hot chocolate, food and s'mores on us!
Physical Security Workshop on Tuesday, Feb 11th, at 6:00 PM in MC 4045
</p>
</short>
<abstract>
<p>
In this physical security workshop, students will learn about the theoretical considerations of what makes a system secure. Then, we will break into teams for a hands-on exercise, and a screening of the legendary movie "Hackers".
</p>
<p>
Snacks and drinks will be provided.
</p>
</abstract>
</eventitem>
<eventitemdate="2020-01-28"time="6:30 pm"room="STC 0010"title="Code Party 0">
<short>
<p>
Code Party 0 on January 28th, 2020, at 6:30 PM in STC 0010
</p>
</short>
<abstract>
<p>
Code Party 0 on January 28th, 2020, at 6:30 PM in STC 0010
</p>
<p>
The CS Club is hosting our first Code Party of the term from 6:30 pm until 9 pm in STC 0010, on Tuesday, January 28. Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 0 and do it, with great company and great food. Come any time after 6:30 pm.
</p>
</abstract>
</eventitem>
<!-- Spring 2019 -->
<eventitemdate="2019-07-29"time="6:00 PM"room="MC Comfy"title="End of Term Event">
<short>
<p>
The Computer Science Club will be holding a end of term event on Monday, July 29th
at MC Comfy at 6:00 PM.
</p>
</short>
<abstract>
<p>
Come hang out and celebrate the end of the term with us. There will be pizza,
The Computer Science Club will be holding elections for the Spring 2019
term on Thursday, May 16th in MC Comfy (MC 3001) at 7:00 PM.
</p>
</short>
<abstract>
<p>
During the meeting, the president, vice-president, treasurer and
assistant vice-president (formerly secretary) will be elected, the
sysadmin will be ratified, and the librarian and office manager will be
appointed.
</p>
<p>
If you'd like to run for any of these positions or nominate someone,
you can write your name on the whiteboard in the CSC office (MC
3036/3037) or send an email to cro@csclub.uwaterloo.ca. You can also
deposit nominations in the CSC mailbox in MathSoc or present them to
the CRO, Charlie Wang, in-person. Nominations will close at 6:00 PM on
Wednesday, May 15th.
</p>
</abstract>
</eventitem>
<!-- Winter 2019 -->
<eventitemdate="2019-04-05"time="3:30 pm"room="STC 0020"title="Prof talk: Making the Switch: Going from 2D to S3D">
<short>
<p>
We will be having our second prof talk of the term with Lesley Istead, on April 5, 3:30 pm in STC 0020. She will be talking about the problems and algorithms used in the film industry to go from 2D to S3D. Come listen to the talk and enjoy some free food!
</p>
</short>
<abstract>
<p>
We will be having our second prof talk of the term with Lesley Istead, on April 5, 3:30 pm in STC 0020. She will be talking about the problems faced, and algorithms used in the film industry to go from 2D to S3D. Come listen to the talk and enjoy some free food!
</p>
<p>
For the last 10 years, most blockbusters have been released in both 2D and stereoscopic 3D. The move from 2D to S3D is non-trivial and involves many new algorithms and technologies.
But there are still many problems to be solved and many improvements that can still be made. In this talk, we'll explore artifacts of traditional 2D photography, methods to represent them comfortably in S3D, and their meaning in a 3D world.
</p>
</abstract>
</eventitem>
<eventitemdate="2019-03-21"time="6 pm"room="MC Comfy"title="CSC + WiCS Movie Night">
<short>
<p>
CSC + WiCS Movie Night on March 21th, 2019, at 6 PM in MC Comfy
</p>
</short>
<abstract>
<p>
CSC + WiCS Movie Night on March 21th, 2019, at 6 PM in MC Comfy
</p>
<p>
Join us and bring all your friends to CSC and WiCS' movie night! We will be showing your fave tech-related movies and serving some delicious snacks.
Professor Craig Kaplan will be talking about tiling arrangements on March 20th, 2019, at 4 PM in PHY 150
</p>
</short>
<abstract>
<p>
By slowly varying the shapes of tiles in a tiling, it's possible to create fun and interesting abstract animations. Many of these animations are a good fit for the genre of looping mathematical GIFs that proliferate in social media. In this talk, I'll introduce a few core concepts from tiling theory and then discuss techniques for constructing tilings that evolve in space or in time.
</p>
</abstract>
</eventitem>
<eventitemdate="2019-03-13"time="6 pm"room="QNC 1502"title="Code Party 0">
<short>
<p>
Code Party 0 on March 13th, 2019, at 6 PM in QNC 1502
</p>
</short>
<abstract>
<p>
Code Party 0 on March 13th, 2019, at 6 PM in QNC 1502
</p>
<p>
The CS Club is hosting our first Code Party of the term from 6 pm until 9 pm in QNC-1502, on Wednesday, March 13. Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 0 and do it, with great company and great food. Come any time after 6 pm.
Git 101 workshop on March 2nd, 2019, at 12 PM in QNC 1502
</p>
</short>
<abstract>
<p>
Git 101 workshop on March 2nd, 2019, at 12 PM in QNC 1502
</p>
<p>
Git and source code management is an essential tool in software development. Knowing how to make the best out of it will help you get out of tricky situations, and allow you to be a better engineer.
</p>
<p>
Come learn some basic topics with us including the motivation for using git, interaction with git using the command line, pull requests, feature branch workflow, etc. This event targets first years with minimal git experience.
</p>
<p>
We are also searching for mentors for the workshop. Instructions for signing up are <ahref="https://github.com/uwcsc/git-101-mentor-signup">here</a>
</p>
<p>Pizza will be provided.</p>
</abstract>
</eventitem>
<eventitemdate="2019-01-24"time="6:30 pm"room="STC 0060"title="Algorithms practice workshop">
<short>
<p>
Algorithms practice workshop on January 24th, 2019, at 6:30 PM in STC 0060
</p>
</short>
<abstract>
<p>
Algorithms practice workshop on January 24th, 2019, at 6:30 PM in STC 0060
</p>
<p>
Worried about your upcoming WaterlooWorks technical interviews? Want to nail your dream internship this term? Come to the Algorithms Practice Workshop at 6:30 PM, January 24th at STC 0060!
</p>
<p>
During the workshop, you will learn tons of useful technical interview tips collected from experienced upper-year students, as well as gain hands-on experience by practicing efficiently!
</p>
<p>
Writing a good solution to the problem is only the beginning — technical interviewers are evaluating more than just your code. Let's learn how to impress them in multiple ways!
Alt-Tab is coming up next week on Thursday Nov. 29th 6-8pm at MC 5417. We have an amazing group of members giving short talks on topics of their choice.
</p>
</short>
<abstract>
<p>
Alt-Tab is coming up next week on Thursday Nov. 29th 6-8pm at MC 5417. We have an amazing group of members giving short talks on topics of their choice.
</p>
<h3>Talk List:</h3>
<h4>Anna Lorimer - <redacted></h4>
<p>
All about Slitheen (no, not the dr who alien)
</p>
<h4>Will Gertler - Quantum Information: a Primer</h4>
<p>
An introduction to elementary topics in quantum information theory as an analogous extension of classical information, including simple applications.
</p>
<h4>Fatema Boxwala - GANs, Generative Art and Edward Bellamy</h4>
<p>On October 25th of this year, the first AI-generated work of art sold on the high-end art market at Christie's - for half a million dollars. A Portrait of Edward Bellamy is an image generated by a GAN, a Generative Adversarial Network. Fatema is going to wax poetic about GANs, generative art, and what it really means for something to be art.</p>
<h4>Alex Zvorygin - Designing Large Scale Systems for the Web</h4>
<p>
Learn to build systems that scale! Handle millions of users, keep latencies low, and your systems stable!
</p>
<h4>Patrick Melanson - ᴜɴɪᴄᴏᴅᴇ</h4>
<p>
ᴜɴɪᴄᴏᴅᴇ! It will let you talk to all your friends in Egyptian hieroglyphs, pictures of rocketships, Urdu, or even just Latin characters!
</p>
<p>
ᴜɴɪᴄᴏᴅᴇ: BUT WHAT SECRETIVE CABAL CONTROLS THIS UNIMAGINABLE POWER? Find out at this talk!
</p>
<p>
ᴜɴɪᴄᴏᴅᴇ; not just a blessing, but a curse! Reset Spotify forum passwords, make fradulent PayPal sites, send misunderstood texts to your girlfriends' parents, and prevent all of these real-world examples!!
</p>
<p>
ᴜɴɪᴄᴏᴅᴇ. ؟؟Can you really afford to not tap into this power??
</p>
<h4>Zichuan Wei - Quantum Computers: what they are and what they can do</h4>
<p>
Recently, quantum computing is getting a lot attention and companies like Google, IBM and Microsoft are investing millions of dollars into the field. What is it? and Why people are willing to spend so much money on it? This talk aims to partially answer these questions.
Professor Gregor Richards will be talking about netplay in emulators, which allows for playing video games over the internet.
</p>
</short>
<abstract>
<h3>Abstract:</h3>
<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.
</p>
<p>
Prof. Richards is the maintainer of the netplay infrastructure for RetroArch, a popular emulator frontend for multiple platforms.
title="[Cancelled] BBC micro:bit computer: What is it good for?">
<short>
<p>
Professor Richard Mann will be talking about the BBC micro:bit, an embedded computer that is popular with hobbyists and comes with a variety of peripherals.
</p>
</short>
<abstract>
<p>This talk was cancelled. The material for the talk can be found <ahref="http://www.cs.uwaterloo.ca/~mannr">here.</a></p>
<h3>Abstract:</h3>
<p>
BBC micro:bit (microbit.org) was introduced in 2015 and has since become popular with educators and hobbyists.
</p><p>
Micro:bit uses an ARM Cortex M0 processor running the "mbed" OS/runtime (mbed.arm.com). It has a built in LED 7x7 array, two buttons, compass, accelerometer, infra red transceivers, and low power wireless communication. Most importantly, it has multiple analog and digital pins to connect to the external world.
</p><p>
Web based tools compile gui/blocks, javascript, or python to executable (HEX) files that run on the device. The device appears as a USB drive. It is programmed by copying (dragging) the HEX image to the device. Once programmed, the device runs standalone and communicates with the the host computer via a serial port API.
</p><p>
All of this is great fun and a gateway into electronics and real time programming.
</p><p>
In this talk I will present a brief introduction to micro:bit, electronics, and electronic signal measurement (voltmeter, function generator, oscilloscope).
</p><p>
We will measure the run time performance of the micro:bit, in particular the operation of the analog inputs and outputs and the response time/latency of the device and consider its suitability for user interface, music and audio projects.
</p>
<h3>Bio:</h3>
<p>
Richard Mann is Associate Professor in Computer Science. His research is in AI, Sound/Audio, Acoustics, and Electro/acoustic measurement. Details at www.cs.uwaterloo.ca/~mannr
</p><p>
In W19 I will teach: CS489 -- Advanced topics, Computational Sound and Audio. This is a project-based course (no final).
</p><p>
I am also looking for URA students in the Sound/Audio area.
Make touchscreen gloves with the CS Club on October 29, 5:30 PM in QNC 1506.
</p>
</short>
<abstract>
<p>
Do you have a pair of favorite gloves that you wish you could use with your phone? Do you not have that but have always wondered how touchscreen gloves work? Join us on Monday Oct 29th 5:30-6:30pm at QNC1506 to learn how you can make your own pair of touchscreen gloves! Fatema Boxwala will be teaching a hands-on workshop with all materials provided (but you can also totally bring your own). Come and learn a super easy introduction to wearable electronics and sewing!
The CS Club is hosting our first Code Party of the term from 6:30pm until ~9:30pm in EV3-1408, on Thursday October 18.
</p>
</short>
<abstract>
<p>
The CS Club is hosting our first Code Party of the term from 6:30pm until ~9:30pm in EV3-1408, on Thursday October 18.
</p>
<p>
Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 0 and do it, with great company and great food.
Jane Street's Yaron Minsky is coming to Waterloo to give a talk aimed at undergraduate students.
</p>
</short>
<abstract>
<p>
Jane Street's Yaron Minsky is coming to Waterloo to give a talk aimed at
undergraduate students. The talk titled Data Driven UIs, Incrementally
will be held in DC 1302 on Oct. 15th 5:30-6:30pm. Yaron Minsky got his
BA in Mathematics from Princeton and his PhD in Computer Science from
Cornell, where he studied distributed systems. He joined Jane Street in
2003, where he started out developing quantitative trading strategies,
going on to found the firm's quantitative research group. Here's a brief
description of the talk:
</p>
<p>
Trading in financial markets is a data-driven affair, and as such, it
requires applications that can efficiently filter, transform and
present data to users in real time.
</p>
<p>
But there's a difficult problem at the heart of building such
applications: finding a way of expressing the necessary
transformations of the data in a way that is simultaneously easy to
understand and efficient to execute over large streams of data.
</p>
<p>
This talk will show how we've approached this problem using
Incremental, an OCaml library for constructing dynamic computations
that update efficiently in response to changing data. We'll show how
Incremental can be used throughout the application, from the servers
providing the data to be visualized, to the JavaScript code that
generates DOM nodes in the browser. We'll also discuss how these
applications have driven us to develop ways of using efficiently
diffable data structures to bridge the worlds of functional and
incremental computing.
</p>
</abstract>
</eventitem>
<eventitemdate="2018-10-03"time="7:00 pm"room="Columbia Lake Firepit 2"
title="CSC & WiCS & MathSoc go outside!">
<short>
<p>
We will be having a bonfire this Wednesday, Oct 3rd 7-10pm, at Columbia Lake Firepit 2 (NW of CIF), co-hosted with WiCS and MathSoc. Smores and snacks will be provided!
</p>
</short>
<abstract>
<p>
We will be having a bonfire this Wednesday, Oct 3rd 7-10pm, at Columbia Lake Firepit 2 (NW of CIF), co-hosted with WiCS and MathSoc. Smores and snacks will be provided!
</p>
<p>
Here's a map that shows the firepit location: <ahref="https://uwaterloo.ca/economics/sites/ca.economics/files/uploads/files/firepit_map_oct_2012.pdf">https://uwaterloo.ca/economics/sites/ca.economics/files/uploads/files/firepit_map_oct_2012.pdf</a>
title="Sound: From microphones to speakers and everything inbetween">
<short>
<p>
The CSC will be hosting a Prof Talk by Richard Mann.
</p>
</short>
<abstract>
<p>
The CSC will be hosting a Prof Talk by Richard Mann.
</p>
<p>
When you hit record on your phone how is the sound recorded? Air pressure changes come to a microphone, which converts electricity to voltage. The analog signal is digitized by an analog to digital converter (ADC), and finally stored as a digital file in memory. For playback, the process is reversed, and output to head phones or a (tiny) speaker.</p>
<p>
In a loud room does your phone distort? Can you hear the sound clearly? Phones are getting better. But what is needed to achieve professional quality sound recording?</p>
Test your programming, web, networking, and trivia skills in this computer security themed contest. Learn how to reverse engineer, crack codes, find flaws in websites, and use security tools.
</p>
</short>
<abstract>
<p>
Test your programming, web, networking, and trivia skills in this computer security themed contest. Learn how to reverse engineer, crack codes, find flaws in websites, and use security tools.
</p>
<p>Play as an individual, a team of up to three, or join a team at the event.</p>
<p> Bring your laptops, have fun, win prizes!</p>
<p>Run by Capture The Flag Club in partnership with CACR and the CS Club.</p>
<p>See http://ctf.uwaterloo.ca/ for more info!</p>
Come hear 10-15 minutes talks from CSC members on a variety of topics.
</p>
</short>
<abstract>
<p>
Come hear 10-15 minutes talks from CSC members on a variety of topics. Currently planned talks include:
</p>
<ul>
<li>Abstract Machines, what a PL person thinks a computer looks like!</li>
<li>Rendering with Signed Distance Fields</li>
<li>Strength, weaknesses, and applications of genetic algorithms</li>
</ul>
<p>
Interested in talking? Email djauhar@edu.uwaterloo.ca with your title and
a short abstract.
</p>
</abstract>
</eventitem>
<eventitemdate="2018-06-04"time="6:00 pm"room="Laurel Creek Firepit"
title="CSC and WiCS Go Outside">
<short>
<p>
Come join us for a bonfire outside at the Laurel Creek firepit (across Ring. Rd. from EV3) with fellow CSC and WiCS members. Smores and snacks will be provided.
</p>
</short>
<abstract>
<p>
Come join us for a bonfire outside at the Laurel Creek firepit (across Ring. Rd. from EV3) with fellow CSC and WiCS members. Smores and snacks will be provided.
</p>
<p>
The firepit we will be using is in the bottom right of <ahref="https://uwaterloo.ca/economics/sites/ca.economics/files/uploads/files/firepit_map_oct_2012.pdf">this map.</a>
The CS Club is hosting our first Code Party of the term from 6:30pm until ~9:30pm in STC 0020!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
</short>
<abstract>
<p>
The CS Club is hosting our first Code Party of the term from 6:30pm until ~9:30pm in STC 0020!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 0 and do it, with great company and great food.
The CS Club is hosting our second Code Party of the term from 6:00pm until late in the evening in STC 0050!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
</short>
<abstract>
<p>
The CS Club is hosting our second Code Party of the term from 5:30pm until late in the evening in STC 0050!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 1 and do it, with great company and great food.
Come watch (or give!) interesting short talks by CS Club members.
Talks include "Dynamic programming as path finding", "What is a landing page", "Subsurface scattering" and "How to compute on a GPU", but more are welcome (email <ahref="mailto:tghume@csclub.uwaterloo.ca">tghume@csclub.uwaterloo.ca</a>)! Click the link to the event detail page for more info.
</p>
</short>
<abstract>
<p>
Come watch (or give!) interesting short talks by CS Club members.
Talks include "Dynamic programming as path finding", "What is a landing page", "How to compute on a GPU" and "Subsurface scattering", but more are welcome (email <ahref="mailto:tghume@csclub.uwaterloo.ca">tghume@csclub.uwaterloo.ca</a>)! There will be food.
</p>
<p>
Each talk can be 5-15 minutes long on any computer-related topic of interest.
If you're interested in giving a talk (please do!) email <ahref="mailto:tghume@csclub.uwaterloo.ca">tghume@csclub.uwaterloo.ca</a>.
</p>
</abstract>
</eventitem>
<eventitemdate="2017-11-02"time="7pm"room="MC 4059 and MC 4061"
title="CSC+WiCS Fall Social and Movie Night">
<short>
<p>
Join other CSC and WiCS members for a social event featuring free food, board games and a showing of Wonder Woman.
</p>
</short>
<abstract>
<p>
Join other CSC and WiCS members for a social event featuring free food, board games and a showing of Wonder Woman.
Interested in Linux, but don't know where to start? Come learn some
basic topics with us including interaction with the shell, motivation
for using it, some simple commands, and more! (Snacks after)
</p>
</short>
<abstract>
<p>
New to the Linux computing environment? If you seek an introduction,
look no further (you can if you want we're not the police). Topics that
will be covered include basic interaction with the shell and the
motivations behind using it, and an introduction to compilation. You'll
have to learn this stuff in CS 246 anyways, so why not get a head start!
</p>
<p>
If you're interested in attending, make sure you can log into the Macs
on the third floor, or show up to the CSC office (MC 3036) 20 minutes
early for some help.
</p>
</abstract>
</eventitem>
<eventitemdate="2017-10-05"time="6:00 pm"room="Laurel Creek Firepit"
title="CSC Goes Outside">
<short>
<p>
Come join us for a bonfire outside at the Laurel Creek firepit (across Ring. Rd. from EV3) with fellow CSC members. Smores and snacks will be provided.
</p>
</short>
<abstract>
<p>
Come join us for a bonfire outside at the Laurel Creek firepit (across Ring. Rd. from EV3) with fellow CSC members. Smores and snacks will be provided.
</p>
<p>
The firepit we will be using is in the bottom right of <ahref="https://uwaterloo.ca/economics/sites/ca.economics/files/uploads/files/firepit_map_oct_2012.pdf">this map.</a>
The CS Club is hosting our first Code Party of the term (Friday September 29th) from 6:30pm until late in the evening in M3 1006!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
</short>
<abstract>
<p>
The CS Club is hosting our first Code Party of the term (Friday September 29th) from 6:30pm until late in the evening in M3 1006!
</p>
<p>
Come code with us, eat some food, do some things.
</p>
<p>
Personal projects you want to work on? Homework projects you need to finish? Or want some time to explore some new technology and chat about it? You can join us at Code Party 0 and do it, with great company and great food.
</p>
<p>
Come any time after 6:30pm, there will be snacks and we'll be ordering pizza at around 7:00pm!
The Computer Science Club will be holding elections for the
Spring 2017 President, Vice-President, Secretary and Treasurer.
Additionally, the Systems Administrator, Office Manager and
Librarian, CTF Club Liaison and Fridge Person will be appointed.
</p>
</short>
<abstract>
<p>
The Computer Science Club will be holding elections for the
Fall 2017 term on Friday, September 15th at 6:00pm
in the MC Comfy Lounge (MC 3001).
</p>
<p>
The following positions will be elected: President, Vice-President,
Treasurer and Secretary. The following positions will be appointed:
Systems Administrator (to be ratified at the meeting),
Office Manager and Librarian, CTF Club Liaison and Fridge Person (the exact name of this position is still to be determined). Additionally, we will be looking
for members to join the Programme Committee.
</p>
<p>
If you would like to run or nominate someone for any of the elected positions,
you can put your name in a special box in the CSC office (MC 3036/3037)
or by sending an email to the Chief Returning Officer (Felix)
at <ahref="mailto:cro@csclub.uwaterloo.ca">cro@csclub.uwaterloo.ca</a>.
Please note that executive positions are restricted
to MathSoc social members. We welcome the participation of first years.
</p>
<p>
Nominations will close at 6:00pm on Thursday, September 14th
(24 hours prior to the start of elections).
After that time, a list of current nominations will be sent out by email. It will also be available on the whiteboard
A talk and demo about more advanced Unix tricks and tools than are taught in our regular Unix 101 events. Topics may include customizing your prompt, the ranger console file manager, fancy shells, htop, rsync and using terminal escape sequences in your programs.
</p>
</short>
<abstract>
<p>
A talk and demo about more advanced Unix tricks and tools than are taught in our regular Unix 101 events. Topics may include customizing your prompt, the ranger console file manager, fancy shells, htop, rsync and using terminal escape sequences in your programs.
</p>
<p>
List of things talked about can be found <ahref="https://gist.github.com/trishume/fb1c80f61c9a62426a6565a9f661e449">here</a>.
Come watch (or give!) interesting short talks by CS Club members.
Talks include "Stepping into math: building a step-by-step algebra solver" and "Online database migrations at scale", but more are welcome (email <ahref="mailto:tghume@csclub.uwaterloo.ca">tghume@csclub.uwaterloo.ca</a>)! Click the link to the event detail page for more info. (Note: date was moved to Thursday)
</p>
</short>
<abstract>
<p>
Come watch (and/or give!) interesting short talks by CS Club members.
Talks include "How your text editor does syntax highlighting", "Online database migrations at scale", "Stitching Spaces in Subdivision Surfaces", "Theory of Computation" and "Stepping into math: building a step-by-step algebra solver", but more are welcome!
</p>
<p>
Each talk can be 5-15 minutes long on any computer-related topic of interest.
If you're interested in giving a talk (please do!) email <ahref="mailto:tghume@csclub.uwaterloo.ca">tghume@csclub.uwaterloo.ca</a>.
</p>
<p>
The event was previously scheduled for Wednesday but was moved to Thursday the 9th due to a conflict with a WICS event.
<p>Come out to a talk on surrounding a polygon by Dr. Craig Kaplan! Also stay afterwards for our EOT and socialize :) food will be provided!
</p>
</short>
<abstract>
<p>
Come out to a talk on surrounding a polygon by Dr. Craig Kaplan! Also stay afterwards for our EOT and socialize :) food will be provided!
The prof talk will be on Surrounding a Polygon:
Dr. Craig Kaplan will explore the problem of surrounding a polygon with copies of itself. This problem raises a number of fascinating mathematical questions, and we can use software as an experimental tool to probe the answers to those questions.
<p></p>
He'll also present known mathematical and computational results related to surrounds of polygons, and discuss what they say about larger open questions in tiling theory. Finally, he will also show how the task of surrounding individual polygons can make for fun and challenging puzzles, and say a bit about his experience creating an app based on those puzzles.
<p>The CSC is hosting the first annual member talk series! This is a chance for anyone to come and give a short talk on any relevant topic.
Some talks already arranged are on topics ranging from modern Javascript, to the Linux Kernel.</p>
</short>
<abstract>
<p>
The CSC is hosting the first annual member talk series. This is a chance for anyone to come and give a short talk on any relevant topic.
We already have some talks arranged, on topics ranging from modern JavaScript, and the Linux Kernel. More speakers are welcome. If you are interested, please email tbelaire@uwaterloo.ca or signup here:http://goo.gl/forms/zNYbDEQSFU
title="SAT and SMT Solvers for Software Engineering and Security">
<short>
<p>A talk about SAT and SMT Solvers for Software Engineering and Security by Dr. Vijay Ganesh</p>
</short>
<abstract>
<p>
Boolean SAT and SMT solvers increasingly play a central role in the construction of reliable and secure software, regardless of whether such reliability/security is ensured through formal methods, program analysis or testing. This dramatic influence of solvers on software engineering as a discipline is a recent phenomenon, largely attributable to impressive gains in solver efficiency and expressive power. Dr. Vijay Ganesh will motivate the need for SAT and SMT solvers, sketch out their research story thus far, and then describe his contributions to solver research. Specifically, he will talk about a SAT solver called MapleCMS, and a string SMT solver, called Z3str2, developed in his lab. He will also talk about real-world applications enabled by his solvers, and the techniques he developed that helped make them efficient.
<p>Git 102 : Why you learned git in the first place. </p>
</short>
<abstract>
<p>
Learn how to manage multiple remotes, for those times when GitHub goes down. Then learn what to do when you accidentally overwrite your source code! Only basic git knowledge is assumed.
title="Steve Bourque and Mike Patterson Network Infrastructure talk">
<short>
<p>
Steve Bourque and Mike Patterson of IST will give a brief overview of campus network connectivity and interconnectivity.</p>
</short>
<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!
eth1: a day-long programming contest. Form teams and hack
together a trading bot to compete against others and the markets.
</p>
</short>
<abstract>
<p>
eth1: a day-long programming contest. Form teams and hack together a trading bot to compete against others and the markets.
</p>
<p>
Brought to you by: CSC and Jane Street.
</p>
<p>
Each member of the winning team will receive $1000 USD.
</p>
<p>
There'll be lots of (free) food and drink available.
</p>
<p>
Absolutely no special math, OCaml, or finance knowledge is required; you can use any language you like. The contest is entirely technical in nature and you won't need any visual design skills.
</p>
<p>
The exact details of the hackathon aren't released until the competition begins. The one thing you can do ahead of time to prepare is familiarize yourself with the libraries for writing TCP clients in your programming language of choice.
The contest will be on Saturday, January 23rd, from 11:00AM - 11:00PM. Signups will close on Monday, January 18th at 11:59PM, and we'll send out confirmations to participants on the 20th.
</p>
<p>
For any other queries, email: eth1-waterloo@janestreet.com
</p>
<p>
Further details will be announced closer to the event. Teams of up to three will be accepted, but you don't have to have a team to sign up — feel free to turn up as a singleton and we'll form teams on the fly.
The Computer Science Club has elected its executive for the term, and a new Office Manager and System Administrator have been appointed.
</p>
<p>
See inside for results.
</p>
</short>
<abstract>
<p>
The Computer Science Club has elected its executive for the term, and a new Office Manager and System Administrator have been appointed.
The quorum for elections had been reached, and voting members of the CSC voted for their President, Vice President, Treasurer, and Secretary from among many qualified candidates.
The new elected executive then proceeded to appoint a System Administrator (who became part of the executive <i>ex officio</i>) and an Office Manager.
The appointment of a Librarian was delayed because no suitable and willing candidate was found.
<eventitemdate="2015-06-26"time="7:00 PM"room="Laurel Creek Firepit"
title="WiCS and CSC Go Outside">
<short>
<p>Come hang out with the Women in Computer Science and the Computer Science Club! There will be s'mores and frozen yogurt. Also fire. And a creek. Let's enjoy the outdoors!</p>
</short>
<abstract>
<p>Come hang out with the Women in Computer Science and the Computer Science Club! There will be s'mores and frozen yogurt. Also fire. And a creek. Let's enjoy the outdoors!</p>
Elections for Spring 2013 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 Wednesday, May 15 at 6:00PM, 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 Tuesday, May 14, 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 <ahref="mailto:cro@csclub.uwaterloo.ca"> Chief Returning Officer</a>. A
full list of candidates will be posted when nominations close, along with
instructions for voting remotely.</p>
<p>Good luck to our candidates!</p>
</abstract>
</eventitem>
<!-- Winter 2013 -->
<eventitemdate="2013-04-01"time="7:00 PM"room="Comfy Lounge"title="Code Party 1">
<short>
<p>The Computer Science Club is running the second code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
</short>
<abstract>
<p>The Computer Science Club is running the second code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
<p><i>by Calum T. Dalek</i>. New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a tutorial on using Unix this upcoming Monday. Topics that will be covered include basic interaction with the shell and use of myriad powerful tools.</p>
</short>
<abstract>
<p>New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a tutorial on using Unix this upcoming Monday. Topics that will be covered include basic interaction with the shell and use of myriad powerful tools.</p>
<p>If you're interested in attending, make sure you can log into the Macs on the third floor, or show up to the CSC office (MC 3036) 20 minutes early for some help.</p>
</abstract>
</eventitem>
<eventitemdate="2013-03-21"time="4:30 PM"room="MC 4020"title="Using Computers to Find Evidence in Litigation">
<short>
<p>Professor Gordon Cormack will be presenting a talk on using machine-learning based spam filters to accurately locate relevent electronic documents - a process which has typically been very manual, and very expensive.</p>
</short>
<abstract>
<p>In a lawsuit, each party is typically entitled to Discovery, in which the
other party is compelled to produce any "documents" in its possession that
may be pertinent to the case. Documents include not only traditional
paper documents, but email messages, text messages, computer files, and
other electronically stored information, or ESI. Suppose you were
compelled to produce every document in your possession pertaining to
software downloads or purchases? How would you do it? If you were a
large corporation, you would probably hire an army of lawyers to read all
your email, plus your assignments, and any other files on your UW account,
your laptop, your phone, and your tablet, at a cost of one dollar or more
per file. As a CSC member, you know there must be a better way. But what
is that better way, and how do you convince the court to let you use it?</p>
<p>It turns out that spam filters that employ machine learning can do this job
well -- better than that army of lawyers. But lawyers aren't happy about
this. This talk will outline how the technology works and how to prove
that it works, so as to convince scientists, lawyers, and judges.</p>
</abstract>
</eventitem>
<eventitemdate="2013-02-28"time="4:30 PM"room="DC 1302"title="Machine Architecture, Performance, and Scalability: Things Your Programming Language Never Told You">
<short>
<p>"Herb Sutter is a leading authority on software development. He is the best selling author of several books including Exceptional C++ and C++ Coding Standards, as well as hundreds of technical papers and articles [and] has served for a decade as chair of the ISO C++ standards committee." - http://herbsutter.com/about</p>
</short>
<abstract>
<p>High-level languages insulate the programmer from the machine. That's a
wonderful thing -- except when it obscures the answers to the fundamental
questions of "What does the program do?" and "How much does it cost?"</p>
<p>The C++ and C# programmer is less insulated than most, and still we find
that programmers are consistently surprised at what simple code actually
does and how expensive it can be -- not because of any complexity of a
language, but because of being unaware of the complexity of the machine on
which the program actually runs.</p>
<p>This talk examines the "real meanings" and "true costs" of the code we
write and run especially on commodity and server systems, by delving into
the performance effects of bandwidth vs. latency limitations, the
ever-deepening memory hierarchy, the changing costs arising from the
hardware concurrency explosion, memory model effects all the way from the
compiler to the CPU to the chipset to the cache, and more -- and what you
<p>CSC Elections have begun for the Winter 2013 term, nominations are open!</p>
</short>
<abstract>
<p>It's elections time again! On Wednesday January 16th at 4:00PM, 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:00PM on Tuesday January 15th, and can be
written on the CSC office whiteboard (yes, you can nominate yourself). All CSC members
can vote and are invited to drop by. You may also send nominations to the
<ahref="mailto:cro@csclub.uwaterloo.ca">
Chief Returning Officer</a>. A full list of candidates will be posted
when nominations close.</p>
<p>Good luck to our candidates!</p>
</abstract>
</eventitem>
<!-- Fall 2012 -->
<eventitemdate="2012-11-23"time="19:00"room="MC 3001"title="Code Party 3">
<short>
<p>The Computer Science Club is running our third, and last, code party of the term! Whether you're a hacking guru or a newbie to computer science, you're welcome to attend; there will be activities for all. Syed Albiz will be presenting a tutorial on implementing a <ahref="http://en.wikipedia.org/wiki/Ray-tracing">ray-tracer</a> in C and Scheme.</p>
</short>
<abstract>
<p>The Computer Science Club is running our third, and last, code party of the term! Whether you're a hacking guru or a newbie to computer science, you're welcome to attend; there will be activities for all. Syed Albiz will be presenting a tutorial on implementing a <ahref="http://en.wikipedia.org/wiki/Ray-tracing">ray-tracer</a> in C and Scheme. Everyone is welcome, so please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
<p><i>by PMC.</i>The Pure Mathematics, Applied Mathematics, Combinatorics & Optimization Club is hosting the Fall 2012 Short Attention Span Math Seminars (SASMS).</p>
</short>
<abstract>
<p>The Pure Mathematics, Applied Mathematics, Combinatorics & Optimization Club is hosting the Fall 2012 Short Attention Span Math Seminars (SASMS).</p>
<p>All talks will be 25 minutes long, and everyone is welcome to give a talk. Applications for speaking are open until the day of the event. For event details, see <ahref="http://pmclub.uwaterloo.ca/?q=content/sasms-fall-2012">the PMC event page.</a></p>
<short><p><i>by Calum T. Dalek</i>. New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a series of tutorials on using Unix, beginning with Unix 101 this upcoming Monday. Topics that will be covered include basic interaction with the shell and use of myriad powerful tools. </p></short>
<abstract><p>New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a series of tutorials on using Unix, beginning with Unix 101 this upcoming Monday. Topics that will be covered include basic interaction with the shell and use of myriad powerful tools. </p>
<p>If you're interested in attending, make sure you can log into the Macs on the third floor, or show up to the CSC office (MC 3036) 20 minutes early for some help. If you're already familiar with these topics, don't hesitate to come to Unix 102, which will be held the week of the 26th.</p>
<p>ehashman's lousy frosh event naming scheme continues as we prepare for this week's movie night---a screening of the original TRON in PHY 150. Come watch the groundbreaking film that defined the role of computer graphics and the quality of special effects in modern cinema. And bring your friends!</p>
</short>
<abstract>
<p>ehashman's lousy frosh event naming scheme continues as we prepare for this week's movie night---a screening of the original TRON in PHY 150. Come watch the groundbreaking film that defined the role of computer graphics and the quality of special effects in modern cinema. And bring your friends!</p>
</abstract>
</eventitem>
<eventitemdate="2012-09-14"time="19:00"room="MC 3001"title="Code Party 1: FROSH-A-THON">
<short>
<p>The Computer Science Club is running our first "welcome back" code party of the term! Whether you're a hacking guru or a newbie to computer science, you're welcome to attend; there will be activities for all! Our party is loosely themed as a Linux installfest, where we will have a team of members dedicated to helping individuals install and learn to use one of many flavours of Linux.</p>
</short>
<abstract>
<p>The Computer Science Club is running our first "welcome back" code party of the term! Whether you're a hacking guru or a newbie to computer science, you're welcome to attend; there will be activities for all! Our party is loosely themed as a Linux installfest, where we will have a team of members dedicated to helping individuals install and learn to use one of many flavours of Linux. Everyone is welcome, so please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
<p>The School of Computer Science is hosting a dinner event for incoming first-year students. You'll get to meet us, some of the faculty, and other new undergraduates. Food will be provided.</p>
</short>
<abstract>
<p>The School of Computer Science is hosting a dinner event for incoming first-year students. You'll get to meet us, some of the faculty, and other new undergraduates. Food will be provided.</p>
</abstract>
</eventitem>
<!-- Spring 2012 -->
<eventitemdate="2012-06-08"time="19:00:00"room="MC 3001"title="Code Party 1">
<short>
<p>The Computer Science Club is running the first code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
</short>
<abstract>
<p></p>
<p>The Computer Science Club is running the first code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
<p>CSC Elections have begun for the Spring 2012 term, nominations are open!</p>
</short>
<abstract>
<p>It's elections time again! On Thursday May 10th at 4: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 May 9th, and can be
written on the CSC office whiteboard (yes, you can nominate yourself). All CSC members
who have paid their Mathsoc fee can vote and are invited to drop by.
You may also send nominations to the <ahref="mailto:cro@csclub.uwaterloo.ca">
Chief Returning Officer</a>. A full list of candidates will be posted
when nominations close.</p>
<p>Good luck to our candidates!</p>
</abstract>
</eventitem>
<eventitemdate="2012-05-07"time="6:00 PM"room="DC 1302"title="mmap and the Mortgage Crisis">
<short>
<p>Palantir is a Palo Alto-based intelligence analysis software company that has partnered with the CSC to put on a tech talk and social. There will be free food, free drinks, and for one lucky winner, a free iPad, so why not come on out?</p>
</short>
<abstract>
<p>In the aftermath of the 2008 economic crisis, large banks have been saddled with the prospect of foreclosing on millions of distressed mortgages, at a financial cost of billions of dollars and an incalculable social cost. Crucial to solving this problem is the ability to model and analyze these millions of loans in real time, enabling lenders to price homes so that they can find effective and mutually beneficial alternatives to foreclosure.</p>
<p>In this talk, we'll describe how engineers at Palantir are working on a calculation engine that supports such analyses. We'll outline our design goals of constructing a platform that supports queries against large sets of data at interactive speeds and exposes a high-level object-oriented interface that enables analysts to construct models intuitively without having to worry about the underlying implementation details. We'll describe the different architectures we explored in prototyping the system, demo how to use our product to analyze massive datasets, and discuss how we've ultimately deployed it in the field.</p>
<p><i>by Bill Cowan</i>. Programming systems that obey hard real-time constraints is difficult. So is programming multiple CPUs that interact to solve a single problem. This talk will describe the nature of computation typical of real-time systems, architectural solutions currently employed in CS 452, and possible architectures for multi-CPU systems.</p>
</short>
<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><i>by Calum T. Dalek</i>. The University of Waterloo Computer Science Club and AMD's OpenCL programming competition comes to a close, as the contest ends at midnight and prizes are awarded! Open submissions will be judged, so make sure to come out and watch.
</p>
</short>
<abstract>
<p>The University of Waterloo Computer Science Club and AMD's <ahref="http://csclub.uwaterloo.ca/opencl">OpenCL programming competition</a> comes to a close, as the contest ends at midnight and prizes are awarded! Open submissions will be judged, so make sure to come out and watch.
<p><i>by Calum T. Dalek</i>. Join the Computer Science Club and PhysClub every Wednesday evening for the rest of the term for our five screenings of the classic 1964 Messenger Lecture Series by Richard Feynman in PHY 150. Dinner provided!
</p>
</short>
<abstract>
<p>The Physics Club and the Computer Science Club are proud to present the 1964 Feynman Messenger Lecture Series in PHY 150 on Wednesday evenings at 5:30 PM. The screenings will be taking place as follows (please note times and dates):</p>
<ul>
<li><b>Feb. 29, 5:30-6:30 PM:</b><i>Law of Gravitation: An Example of Physical Law</i></li>
<li><b>Mar. 7, 5:30-7:30 PM:</b><i>The Relation of Mathematics and Physics</i> and <i>The Great Conservation Principles</i> (double feature)</li>
<li><b>Mar. 14, 5:30-6:30 PM:</b><i>Symmetry in Physical Law</i></li>
<li><b>Mar. 21, 5:30-7:30 PM:</b><i>The Distinction of Past and Future</i> and <i>Probability and Uncertainty: The Quantum Mechanical View</i> (double feature)</li>
<li><b>Mar. 28, 5:30-6:30 PM:</b><i>Seeking New Laws</i></li>
</ul>
<p>Dinner will be provided, so come on out, relax in the comfy PHY 150 theatre, and enjoy. Hope to see you there!</p>
<short><p><i>by Calum T. Dalek</i>. The University of Waterloo Computer Science Club and AMD are running an OpenCL programming competition. If you're interested in writing massively parallel software on the OpenCL platform, come out and join us for our introductory code party!</p></short>
<abstract><p>The University of Waterloo Computer Science Club and AMD are running an <ahref="http://csclub.uwaterloo.ca/opencl">OpenCL programming competition.</a> If you're interested in writing massively parallel software on the OpenCL platform, come out and join us for our introductory code party!</p>
<short><p><i>by Calum T. Dalek</i>. New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a series of tutorials on using Unix, beginning with Unix 101 this upcoming Thursday. Topics that will be covered include basic interaction with the shell and the motivations behind using it, and an introduction to compilation. You'll have to learn this stuff in CS 246 anyways, so why not get a head start!</p></short>
<abstract><p>New to the Unix computing environment? If you seek an introduction, look no further. We will be holding a series of tutorials on using Unix, beginning with Unix 101 this upcoming Thursday. Topics that will be covered include basic interaction with the shell and the motivations behind using it, and an introduction to compilation. You'll have to learn this stuff in CS 246 anyways, so why not get a head start!</p>
<p>If you're interested in attending, make sure you can log into the Macs on the third floor, or show up to the CSC office (MC 3036) 20 minutes early for some help. If you're already familiar with these topics, don't hesitate to come to Unix 102, planned to be held after Reading Week.</p>
<short><p><i>by Victor Fan</i>. Join Victor Fan for his talk, intended for all second-year math students with a solid first-year background. Even if you are a first-year or a seasoned veteran, you will probably still take home something new, so please come out to enjoy the talk! Refreshments will be served.</p></short>
<abstract><p>Are you interested in algorithms? What is an algorithm anyway? We will discuss two or three neat problems with very elegant answers. Some of these answers are actually fast, and some will result in a proof that the problem is NP-complete. (What does that mean?) We will also discuss the motivating thoughts that led us to the solutions.</p>
<p>Join Victor Fan for his talk, intended for all second-year math students with a solid first-year background. Even if you are a first-year or a seasoned veteran, you will probably still take home something new, so please come out to enjoy the talk! Refreshments will be served.</p></abstract>
</eventitem>
<eventitemdate="2012-01-27"time="6:30 PM"room="Math CnD"title="Code Party 0">
<short><p><i>by Calum T. Dalek</i>. The Computer Science Club is running the first code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p></short>
<abstract><p>The Computer Science Club is running the first code party of the term! Come join us and hack on open source software, your own projects, or whatever comes up. Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p></abstract>
<p>CSC Elections have begun for the Winter 2012 term, nominations are open!</p>
</short>
<abstract>
<p>It's elections time again! On Thursday January 12th at 4: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 11th, and can be
written on the CSC office whiteboard (yes, you can nominate yourself). All CSC members
who have paid their Mathsoc fee can vote and are invited to drop by.
You may also send nominations to the <ahref="mailto:cro@csclub.uwaterloo.ca">
Chief Returning Officer</a>. A full list of candidates will be posted
when nominations close.</p>
<p>Good luck to our candidates!</p>
</abstract>
</eventitem>
<!-- Fall 2011 -->
<eventitemdate="2011-11-18"time="7:00 PM"room="Comfy Lounge"title="CSC Open Data Code Party">
<short><p><i>by Calum T. Dalek</i>. The Computer Science Club is teaming up with the UW Open Data Initiative to bring you our third code party of the term! Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p></short>
<abstract><p> We're teaming up with the UW Open Data Initiative to host our next code party on Friday, November 18 at 7PM in the MC Comfy Lounge.</p>
<p>As always, you're welcome to work on your own projects, but we'll be hacking on some open data related projects:
<ol>
<li>Design and build UW APIs.</li>
We're looking for API design experts to bring scalable API designs to the party. At the party, we'll work on implementing these designs. The APIs that you build will be used by everyone to access the university data made available by the Open Data Initiative.
<li>Applications using university data that is currently available.</li>
</ol>
</p>
<p>If you'd like to discuss your ideas for these proposed projects, check out the newsgroup, uw.csc</p></abstract>
</eventitem>
<eventitemdate="2011-11-12"time="7:30 AM"room="Davis Centre"title="CSC goes to Design Our Tomorrow">
<short><p><i>by Calum T. Dalek</i>. The Computer Science Club has a limited number of tickets available for the <ahref="http://designourtomorrow.com/">Design Our Tomorrow Conference</a> at the University of Toronto on Saturday, November 12, 10:00 - 16:30. See event information for ticket details.</p></short>
<abstract><p>
The Computer Science Club has tickets available for the Design Our Tomorrow Conference at the University of Toronto on Saturday, November 12, 10:00 - 16:30, and would like to invite you to attend. The DOT Conference is a TED-style event geared towards students in high school, undergraduate, and graduate studies. The goal of the event is to inspire young people to create, innovate, better themselves, and in the process, better the world. The conference is free for students and is valued at $500 a ticket for non-students. For more details about the conference, visit <ahref="http://designourtomorrow.com/">http://designourtomorrow.com/</a>.</p>
<p>Tickets have been reserved for the CSC, and transportation to the conference has been funded by the David R. Cheriton School of Computer Science; a $5 deposit is required to secure a seat on the bus, which will be refunded to attendees upon departure. To sign up, visit the CSC office at MC 3036/3037 with exact change. You will need to provide your full name, e-mail, and student ID number. Please note that students who have already registered for the conference *should not* try to register through the CSC. For more details, visit the CSC website at <ahref="http://csclub.uwaterloo.ca/">http://csclub.uwaterloo.ca/</a>.</p>
<p>This event is not restricted to CSC members—any student is free to attend. Tickets are very limited, so please sign up as soon as possible.</p>
<p>On the morning of November 12, attendees should meet in front of the Davis Center at 7:30 am. The bus will be leaving promptly at 8:00 am, so please arrive no later than 7:30 so we can process refunds and depart on time.</p>
<p>We hope that you will join us.
</p></abstract>
</eventitem>
<eventitemdate="2011-10-24"time="4:30 PM"room="MC 3003"title="UNIX 102: Tools in the UNIX Environment">
<short><p><i>by Calum T. Dalek</i>. The next installment in the CS Club's popular Unix tutorials UNIX 102 introduces powerful text editing tools for programming and document formatting.
</p></short>
<abstract><p>Unix 102 is a follow up to Unix 101, requiring basic knowledge of the shell. If you missed Unix 101 but still know your way around you should be fine. Topics covered include: "real" editors, text processing, navigating a multiuser Unix environment, standard tools, and more. If you aren't interested or feel comfortable with these tasks, watch out for Unix 103 and 104 to get more depth in power programming tools on Unix.</p></abstract>
</eventitem>
<eventitemdate="2011-10-21"time="7 PM"room="Comfy Lounge"title="Code Party 2">
<short>
<p><i>by Calum T. Dalek</i>. The Computer Science Club is having our second code party of the term! Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
</short>
<abstract>
<p>
The Computer Science Club is having our second code party of the term! Everyone is welcome; please bring your friends. There will be foodstuffs and sugary drinks available for your hacking pleasure.
<p><i>by Ehsan Akhgari</i>. Veteran Mozilla engineer Ehsan Akhgari will present a talk on the internals of web browsers. The material will range from the fundamentals of content rendering to the latest innovations in browser design. Click on the talk title for a full abstract.</p>
</short>
<abstract>
<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.
Bio of the speaker:
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>
<p>
There will be 4 more code parties this term.
</p>
</abstract>
</eventitem>
<eventitemdate="2011-09-30"time="7 PM"room="Comfy Lounge"title="Code Party 1">
<short>
<p><i>by Calum T. Dalek</i>. The Computer Science Club is having our first code party of the term! The theme for this code party will be collaborative development. We'll present several ideas of small projects to work on for the unexperienced. Everyone is welcome; please bring your friends! There will be foodstuffs and sugary drinks available for your hacking pleasure.</p>
</short>
<abstract>
<p>
The Computer Science Club is having our first code party of the term! The theme for this code party will be collaborative development. We'll present several ideas of small projects to work on for the unexperienced. Everyone is welcome; please bring your friends! There will be foodstuffs and sugary drinks available for your hacking pleasure.
</p>
<p>
There will be 4 more code parties this term.
</p>
</abstract>
</eventitem>
<eventitemdate="2011-09-29"edate="2011-09-29"time="4:00 PM"etime="5:30 PM"room="MC 3004"title="UNIX 101: An Introduction to the Shell">
<short>
<p><i>by Calum T. Dalek</i>. New to Unix? No problem, we'll teach you to power use circles around your friends!</p>
</short>
<abstract>
<p>Unix 101 is the first in a series of tutorials on using Unix. This tutorial will present an introduction to the Unix shell environment, both on the student servers and on other Unix environments. Topics covered include: using the shell, both basic interaction and more advanced topics like scripting and job control, the filesystem and manipulating it, and secure shell. If you feel you're already familiar with these topics, don't hesitate to come to Unix 102 to learn about documents, editing, and other related tasks, or watch out for Unix 103, 104, and 201 that get much more in depth with power tools and software authoring on Unix. </p>
<short><p><i>by Stanley Khaing</i>. What are the requirements for obtaining a patent? Should software be patentable?</p></short>
<abstract>
<p>Stanley Khaing is a lawyer from Waterloo whose areas of practice are software and high technology. He will be discussing software patents. In particular, he will be addressing the following questions:</p>
<ul>
<li>What are the requirements for obtaining a patent?</li>
<li>Should software be patentable?</li>
</ul>
</abstract>
</eventitem>
<eventitemdate="2011-02-17"time="07:00 PM"room="MC2017"title="A Smorgasbord of Perl Talks">
<short><p><i>by KW Perl Mongers</i>. These talks are intended for programmers who are curious about the Swiss Army Chainsaw of languages, Perl.</p></short>
<abstract>
<p>Tyler Slijboom will present:</p>
<ul>
<li>Prototyping in Perl,</li>
<li>Perl Default Variables,</li>
<li>HOWTO on OO Programming, and</li>
<li>HOWTO on Installing and Using Modules from CPAN</li>
</ul>
<p>Daniel Allen will present:</p>
<ul>
<li>Coping with Other Peoples' Code</li>
</ul>
<p>Justin Wheeler will present:</p>
<ul>
<li>Moose: a Modern Perl Framework</li>
</ul>
</abstract>
</eventitem>
<eventitemdate="2011-02-09"time="04:30 PM"room="MC3003"title="UNIX 103: Version Control Systems">
<short><p><i>by Calum T. Dalek</i>. In this long-awaited third installment of the popular Unix Tutorials the friendly experts of the CSC will teach you the simple art of version control.
</p></short>
<abstract><p>You will learn the purpose and use of two different Version Control Systems (git and subversion). This tutorial will advise you in the discipline of managing the source code of your projects and enable you to quickly learn new Version Control Systems in the work place -- a skill that is much sought after by employers.</p></abstract>
<short><p><i>by Calum T. Dalek</i>. Come one, come all to the Code Party happening in the Comfy Lounge this Friday. The event starts at 7:00PM and will run through the night.</p></short>
<abstract><p>Why sleep when you could be hacking on $your_favourite_project or doing $something_classy in great company? Join us for a night of coding and comraderie! Food and caffeine will be provided.</p></abstract>
</eventitem>
<eventitemdate="2011-02-02"time="04:30 PM"room="MC3003"title="UNIX 102: Documents and Editing in the Unix environment">
<short><p><i>by Calum T. Dalek</i>. The next installment in the CS Club's popular Unix tutorials UNIX 102 introduces powerful text editing tools for programming and document formatting.
</p></short>
<abstract><p>Unix 102 is a follow up to Unix 101, requiring basic knowledge of the shell. If you missed Unix 101 but still know your way around you should be fine. Topics covered include: "real" editors, document typesetting with LaTeX (great for assignments!), bulk editing, spellchecking, and printing in the student environment and elsewhere. If you aren't interested or feel comfortable with these tasks, watch out for Unix 103 and 104 to get more depth in power programming tools on Unix.</p></abstract>
</eventitem>
<eventitemdate="2011-01-26"time="04:30 PM"room="MC3003"title="UNIX 101: An Introduction to the Shell">
<short><p><i>by Calum T. Dalek</i>. New to Unix? No problem, we'll teach you to power use circles around your friends!
</p></short>
<abstract><p>This first tutorial is an introduction to the Unix shell environment, both on the student
servers and on other Unix environments. Topics covered include: using the shell, both basic
interaction and advanced topics like scripting and job control, the filesystem and manipulating
it, and ssh. If you feel you're already familiar with these topics don't hesitate to come
to Unix 102 to learn about documents, editing, and other related tasks, or watch out
for Unix 103 and 104 that get much more in depth into power programming tools on Unix.
</p></abstract>
</eventitem>
<!-- Fall 2010 -->
<eventitemdate="2010-11-17"time="04:30 PM"room="MC4061"title="Mathematics and aesthetics in maze design">
<short><p><i>by Dr. Craig S. Kaplan</i>. In this talk, I discuss the role of the computer in the process of designing mazes. I present some well known algorithms for maze construction, and more recent research that attempts to novel mazes with non-trivial mathematical or aesthetic properties.
</p></short>
<abstract><p>For thousands of years, mazes and labyrinths have played
an important role in human culture and myth. Today, solving
mazes is a popular pastime, whether with pencil on paper
or by navigating through a cornfield.
</p><p>The construction of compelling mazes encompasses a variety of
challenges in mathematics, algorithm design, and aesthetics.
The maze should be visually attractive, but it should also be
an engaging puzzle. Master designers balance these two goals
with wonderful results.
</p><p>In this talk, I discuss the role of the computer in the process
of designing mazes. I present some well known algorithms for
maze construction, and more recent research that attempts to
novel mazes with non-trivial mathematical or aesthetic properties.
<short><p>The CSC is going to Toronto to visit UofT's <ahref="http://cssu.cdf.toronto.edu/">CSSU</a>, see what they do, and have beer with them.
If you would like to come along, please come by the office and sign up. The cost for the trip is $2 per member.
The bus will be leaving from the Davis Center (DC) Saturday Nov. 13 at NOON (some people may have been told 1pm, this is an error). Please show up a few minutes early so we may
<short><p>Come join the CSC for a night of code, music with only 8 bits, and comradarie. We will be in the C&D Lounge from 7pm until 7am working on personal projects, open source projects, and whatever else comes to mind. If you're interested in getting involved in free/open source development, some members will be on hand to guide you through the process.
</p></short>
<abstract><p>Come join the CSC for a night of code, music with only 8 bits, and comradarie. We will be
in the C&D Lounge from 7pm until 7am working on personal projects, open source projects, and
whatever else comes to mind. If you're interested in getting involved in free/open source development,
some members will be on hand to guide you through the process.
</p></abstract>
</eventitem>
<eventitemdate="2010-10-26"time="04:30 PM"room="MC4040"title="Analysis of randomized algorithms via the probabilistic method">
<short><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></short>
<abstract><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>
</eventitem>
<eventitemdate="2010-10-19"time="04:30 PM"room="RCH 306"title="Machine learning vs human learning - will scientists become obsolete?">
<short><p>This installment in the CS Club's popular Unix tutorials UNIX 102 introduces powerful text editing tools for programming and document formatting.
</p></short>
<abstract><p>Unix 102 is a follow up to Unix 101, requiring basic knowledge of the shell.
If you missed Unix101 but still know your way around you should be fine.
Topics covered include: "real" editors, document typesetting with LaTeX
(great for assignments!), bulk editing, spellchecking, and printing in the
<short><p>Unix 103 will cover version control systems and how to use them to manage your projects. Unix 101 would be helpful, but all that is needed is basic knowledge of the Unix command line (how to enter commands).
</p></short>
<abstract><p>Unix 103 will cover version control systems and how to use them to manage
your projects. Unix 101 would be helpful, but all that is needed is basic
knowledge of the Unix command line (how to enter commands).
</p></abstract>
</eventitem>
<eventitemdate="2010-10-12"time="04:30 PM"room="MC4061"title="How to build a brain: From single neurons to cognition">
<short><p><i>By Dr. Chris Eliasmith</i>. 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></short>
<abstract><p><i>By Dr. Chris Eliasmith</i>. 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
<short><p><i>By Ian Seyler, Return to Infinity</i>. 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></short>
<abstract><p><i>By Ian Seyler, Return to Infinity</i>. 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>
</eventitem>
<eventitemdate="2010-09-28"time="04:30 PM"room="MC4061"title="A Brief Introduction to Video Encoding">
<short><p><i>By Peter Barfuss</i>. 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></short>
<abstract><p><i>By Peter Barfuss</i>. 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><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></abstract>
</eventitem>
<eventitemdate="2010-09-23"time="04:30 PM"room="DC1301 (The Fishbowl)"title="Calling all CS Frosh">
<short><p>Come meet and greet your professors, advisors, and the heads of the school. Talk to the CSC executive and other upper year students about CS at Waterloo. Free food and beverages will also be available, so there is really no excuse to miss this.
</p></short>
<abstract><p>Come meet and greet your professors, advisors, and the heads of the school.
Talk to the CSC executive and other upper year students about CS at Waterloo.
Free food and beverages will also be available, so there is really no excuse
<short><p>Need to use the Unix environment for a course, want to overcome your fears of the command line, or just curious? Attend the first installment in the CSC's popular series of Unix tutorials to learn the basics of the shell and how to navigate the unix environment. By the end of the hands on workshop you will be able to work efficiently from the command line and power-use circles around your friends.
</p></short>
<abstract><p>Need to use the Unix environment for a course, want to overcome your fears of
the command line, or just curious? Attend the first installment in the CSC's
popular series of Unix tutorails to learn the basics of the shell and how to
navigate the unix environment. By the end of the hands on workshop you will
be able to work efficiently from the command line and power-use circles around
your friends.
</p></abstract>
</eventitem>
<eventitemdate="2010-09-22"time="06:00 PM"room="MC4045"title="Cooking for Geeks">
<short><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 & foodies alike. We're happy to have Jeff joining us for a hands on demonstration.
</p></short>
<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 & 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><p>If you have a copy of the book, bring it! I’ll happily sign it.
</p></abstract>
</eventitem>
<eventitemdate="2010-09-21"time="04:30 PM"room="MC4061"title="In the Beginning">
<short><p><b>by Dr. Prabhakar Ragde, Cheriton School of Computer Science</b>. I'll be workshopping some lecture ideas involving representations of
numbers, specification of computation in functional terms, reasoning about
such specifications, and comparing the strengths and weaknesses of different approaches.
</p></short>
<abstract><p>I'll be workshopping some lecture ideas involving representations
of numbers, specification of computation in
functional terms, reasoning about such specifications, and comparing the
strengths and weaknesses of
different approaches. No prior background is needed; the talk should be accessible
to anyone attending
the University of Waterloo and, I hope, interesting to both novices and experts.
<short><p>The last talk in the CS10 series will be presented by Jordan Saunders, in which he will discuss methods for processing brush-based constructive solid geometry.
</p></short>
<abstract><p>For some would-be graphics programmers, the biggest barrier-to-entry is getting data to render. This is why there exist so
many terrain renderers: by virtue of the fact that rendering height-fields tends to give pretty pictures from next to no
"created" information. However, it becomes more difficult when programmers want to do indoor rendering (in the style of the
Quake and Unreal games). Ripping map information from the Quake games is possible (and fairly simple), but their tool-chain
is fairly clumsy from the point of view of adding a conversion utility.
</p><p>My talk is about Constructive Solid Geometry from a Brush-based perspective (nearly identical to Unreal's and still very similar
to Quake's). The basic idea is that there are brushes (convex volumes in 3-space) and they can either be additive (solid brushes)
or subtractive (hollow, or air brushes). The entire world starts off as an infinite solid lump and you can start removing sections
of it then adding them back in. The talk pertains to fast methods of taking the list of brushes and generating world geometry. I may
touch on interface problems with the editor, but the primary content will be the different ways I generated the geometry and what I found to be best.
<short><p>Get the opportunity to learn about Microsoft's Cloud Services Platform, Windows Azure. Attend this Hands-on-lab session sponsored by Microsoft.
</p></short>
<abstract><p>We are in the midst of an industry shift as developers and businesses embrace the Cloud.
Technical innovations in the cloud are dramatically changing the economics of computing
and reducing barriers that keep businesses from meeting the increasing demands of
today's customers. The cloud promises choice and enables scenarios that previously
were not economically practical.
</p><p>Microsoft's Windows Azure is an internet-scale cloud computing services platform hosted
in Microsoft data centers. The Windows Azure platform, allows developers to build and
deploy production ready cloud services and applications. With the Windows Azure platform,
developers can take advantage of greater choice and flexibility in how they develop and
deploy applications, while using familiar tools and programming languages.
</p><p>Get the opportunity to learn about Microsoft's Cloud Services Platform, Windows Azure.
Attend the Hands-on-lab session sponsored by Microsoft.
<short><p>Once again the CSC will be holding its traditional end of term dinner. It will be at the Vice President's house. If you don't know how to get there meet at the club office at 6:30 PM, a group will be leaving from the MC then. The dinner will be potluck style so bring a dish for 4-6 people, or some plates or pop or something.
</p></short>
<abstract><p>Once again the CSC will be holding its traditional end of term dinner. It will
be at the Vice President's house. If you don't know how to get there meet
at the club office at 6:30 PM, a group will be leaving from the MC then. The
dinner will be potluck style so bring a dish for 4-6 people, or some plates
or pop or something.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-30"time="4:30 PM"room="DC1304"title="NUI: The future of robotics and automated systems">
<short><p>Member Sam Pasupalak will present some of his ongoing work in Natural User Interfaces and Robotics in this sixth installment of CS10.
</p></short>
<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>
</eventitem>
<eventitemdate="2010-03-26"time="7:00 PM"room="MC7001"title="A Final Party of Code">
<short><p>There is a CSC/CMC Code Party Friday starting at 7:00PM (1900) until we get bored (likely in the early in morning). Come out for fun hacking times, spreading Intertube memes (optional), hacking on open source projects, doing some computational math, and other general classiness. There will be free energy drinks for everyone's enjoyment. This is the last of the term so don't miss out.
</p></short>
<abstract><p>There is a CSC/CMC Code Party Friday starting at 7:00PM (1900) until we
get bored (likely in the early in morning). Come out for fun hacking
times, spreading Intertube memes (optional), hacking on open source projects,
doing some computational math, and other
general classiness. There will be free energy drinks for everyone's
enjoyment. This is the last of the term so don't miss out.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-23"time="4:30 PM"room="MC5158"title="Memory-Corruption Security Holes: How to exploit, patch and prevent them.">
<short><p>Despite it being 2010, code is still being exploited due to stack overflows, a 40+ year old class of security vulnerabilities. In this talk, I will go over several common methods of program exploitation, both on the stack and on the heap, as well as going over some of the current mitigation techniques (i.e. stack canaries, ASLR, etc.) for these holes, and similarly, how some of these can be bypassed as well.
</p></short>
<abstract><p>Despite it being 2010, code is still being exploited due to
stack overflows, a 40+ year old class of security vulnerabilities. In
this talk, I will go over several common methods of program
exploitation, both on the stack and on the heap, as well as going over
some of the current mitigation techniques (i.e. stack canaries, ASLR,
etc.) for these holes, and similarly, how some of these can be
bypassed as well.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-19"time="7:00 PM"room="Comfy Lounge"title="Another Party of Code">
<short><p>There is a CSC Code Party Friday starting at 7:00PM (1900) until we get bored (likely in the early in morning). Come out for fun hacking times, spreading Intertube memes (optional), hacking on the OpenMoko, creating music mixes, and other general classiness. There will be free energy drinks for everyone's enjoyment.
</p></short>
<abstract><p>There is a CSC Code Party Friday starting at 7:00PM (1900) until we
get bored (likely in the early in morning). Come out for fun hacking
times, spreading Intertube memes (optional), hacking on the OpenMoko,
creating music mixes, and other
general classiness. There will be free energy drinks for everyone's
enjoyment.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-16"time="4:30 PM"room="MC5158"title="Approximation Hardness and the Unique Games Conjecture">
<short><p>The fifth installment in CS10: Undergraduate Seminars in CS, features CSC member Elyot Grant introducing the theory of approximation algorithms. Fun times and a lack of gruesome math are promised.
</p></short>
<abstract><p>The theory of NP-completeness suggests that some problems in CS are inherently hard—that is,
there is likely no possible algorithm that can efficiently solve them. Unfortunately, many of
these problems are ones that people in the real world genuinely want to solve! How depressing!
What can one do when faced with a real-life industrial optimization problem whose solution may
save millions of dollars but is probably impossible to determine without trillions of
years of computation time?
</p><p>One strategy is to be content with an approximate (but provably "almost ideal") solution, and from
here arises the theory of approximation algorithms. However, this theory also has a depressing side,
as many well-known optimization problems have been shown to be provably hard to approximate well.
</p><p>This talk shall focus on the depressing. We will prove that various optimization problems (such as
traveling salesman and max directed disjoint paths) are impossible to approximate well unless P=NP.
These proofs are easy to understand and are REALLY COOL thanks to their use of very slick reductions.
</p><p>We shall explore many NP-hard optimization problems and state the performance of the best known
approximation algorithms and best known hardness results. Tons of open problems will be mentioned,
including the unique games conjecture, which, if proven true, implies the optimality of many of the
best known approximation algorithms for NP-complete problems like MAX-CUT and INDEPENDENT SET.
</p><p>I promise fun times and no gruesome math. Basic knowledge of graph theory and computational
complexity might help but is not required.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-12"time="7:00 PM"room="Comfy Lounge"title="A Party of Code">
<short><p>A fevered night of code, friends, fun, energy drinks, and the CSC.
</p></short>
<abstract><p>A fevered night of code, friends, fun, energy drinks, and the CSC.
</p><p>Come join us for a night of coding. Get in touch with more experianced coders,
advertize for/bug squash on your favourite open source project, write that personal
project you were planning to do for a while but haven't found the time. Don't
have any ideas but want to sit and hack? We can find something for you to do.
</p></abstract>
</eventitem>
<eventitemdate="2010-03-09"time="4:30 PM"room="DC1304"title="Software Transactional Memory and Using STM in Haskell">
<short><p>The fourth Undergraduate Seminar in Computer Science will be presented by Brennan Taylor, a club member. He will be discussing various concurrent computing problems, and introducing Software Transactional Memory as a solution to them.
</p></short>
<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
<short><p>Dr. John Watrous of the <ahref="http://www.iqc.ca">IQC</a> will present his recent result "QIP=PSPACE". The talk will not assume any familiarity with quantum computing or complexity theory, and light refreshments will be provided.
</p></short>
<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
<short><p>The <ahref="http://contest.csclub.uwaterloo.ca">contest</a> is coming to a close tomorrow, so to finish it in style we will be having ice cream and code friday night.
It would be a shame if Waterloo lost (we're not on top of the <ahref="http://csclub.uwaterloo.ca/contest/rankings.php">leaderboard</a> right now) so come out and hack for the home team.</p></short>
</eventitem>
<eventitemdate="2010-02-25"time="4:30 PM"room="DC1302"title="CSCF Town Hall">
<short><p>Come to a town hall style meeting with the managers of CSCF to discuss how to improve the undergraduate (student.cs) computing environment. Have gripes? Suggestions? Requests? Now is the time to voice them.
</p></short>
<abstract><p>Come to a town hall style meeting with the managers of CSCF to discuss how
to improve the undergraduate (student.cs) computing environment. Have gripes?
Suggestions? Requests? Now is the time to voice them.
</p><p>CSCF management (Bill Ince, Associate Director; Dave Gawley, Infrastructure Support;
Dawn Keenan, User Support; Lawrence Folland, Research Support) will be at the
meeting to listen to student concerns and suggestions. Information gathered from
the meeting will be summarized and taken to the CSCF advisory committee for
discussion and planning.
</p></abstract>
</eventitem>
<eventitemdate="2010-02-23"time="04:30 PM"room="MC5136B"title="The Best Algorithms are Randomized Algorithms">
<short><p>In this talk Nicholas Harvey discusses the prevalence of randomized algorithms and their application to solving optimization problems on graphs; with startling results compared to deterministic algorithms.
</p></short>
<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>
</eventitem>
<eventitemdate="2010-02-09"time="4:30 PM"room="DC1304"title="An Introduction to Vector Graphics Libraries with Cairo">
<short><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. 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. This talk will be an introduction to the concepts and metaphors used by vector graphics libraries in general and Cairo in particular.
</p></short>
<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. 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. This talk will be an introduction to the concepts and metaphors used
by vector graphics libraries in general and Cairo in particular.
<short><p>New to Unix? No problem, we'll teach you to power use circles around your friends! The popular tutorial returns for a second session, in case you missed the first one.
</p></short>
<abstract><p>New to Unix? No problem, we'll teach you to power use circles around your friends!
The popular tutorial returns for a second session, in case you missed the first one.
</p><p>This first tutorial is an introduction to the Unix shell environment, both on the student
servers and on other Unix environments. Topics covered include: using the shell, both basic
interaction and advanced topics like scripting and job control, the filesystem and manipulating
it, and ssh. If you feel you're already familiar with these topics don't hesitate to come
to Unix 102 to learn about documents, editing, and other related tasks, or watch out
for Unix 103 and 104 that get much more in depth into power programming tools on Unix.
<short><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></short>
<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>
</eventitem>
<eventitemdate="2010-01-26"time="05:00 PM"room="DC1302"title="Deep learning with multiplicative interactions">
<short><p>Geoffrey Hinton, from the University of Toronto and the Canadian Institute for Advanced Research, will discuss some of his latest work in learning networks and artificial intelligence. The talk will be accessable, so don't hesitate to come out. More information about Dr. Hinton's research can be found on <ahref="http://www.cs.toronto.edu/~hinton/">his website</a>.
</p></short>
<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>
</eventitem>
<!-- Fall 2009 -->
<eventitemdate="2009-12-05"time="6:30 PM"room="MC3036"edate="2009-12-05"etime="11:55 PM"title="The Club That Really Likes Dinner">
<short><p>Come on out to the club's termly end of term dinner, details in the abstract</p></short>
<abstract><p>The dinner will be potluck style at the Vice President's house, please RSVP (respond swiftly to the vice president)
<ahref="https://csclub.uwaterloo.ca/rsvp">here</a> if you plan on attending. If you don't know how to get there meet at the club
office at 6:30 PM, a group will be leaving to lead you there.</p></abstract>
<short><p>A fevered night of code, friends, fun, energy drinks, and the CSC. Facebook will be around to bring some food and hang out.
</p></short>
<abstract><p>Come join us for a night of coding. Get in touch with more experianced coders,
advertize for/bug squash on your favourite open source project, write that personal
project you were planning to do for a while but haven't found the time. Don't
have any ideas but want to sit and hack? Try your hand at the Facebook puzzles,
write a new app, or just chill and watch scifi.
</p></abstract>
</eventitem>
<eventitemdate="2009-11-05"time="4:30 PM"room="MC2065"title="In the Beginning">
<short><p>To most CS students an OS kernel is pretty low level. But there is something even lower, the instructions that must be executed to get the CPU ready to accept a kernel. That is, if you look at any processor's reference manual there is a page or two describing the state of the CPU when it powered on. This talk describes what needs to happen next, up to the point where the first kernel instruction executes.
</p></short>
<abstract><p>To most CS students an OS kernel is pretty low level. But there is
something even lower, the instructions that must be executed to get the
CPU ready to accept a kernel. That is, if you look at any processor's
reference manual there is a page or two describing the state of the CPU
when it powered on. This talk describes what needs to happen next,
up to the point where the first kernel instruction executes.
</p><p>This part of execution is extremely architecture-dependent. Those of
you who have any experience with this aspect of CS probably know the x86
architecture, and think it's horrible, which it is. I am going to talk
about the ARM architecture, which is inside almost all mobile phones,
and which allows us to look at a simple implementation that includes
all the essentials.
</p></abstract>
</eventitem>
<eventitemdate="2009-10-20"time="04:30 PM"room="MC3036"title="CSC Goes To Dooly's">
<short><p>We're going to Dooly's to play pool. What more do you want from us? Come to the Club office and we'll all bus there together. We've got discount tables for club members so be sure to be there.
</p></short>
<abstract><p>We're going to Dooly's to play pool. What more do you want from us?
Come to the Club office and we'll all bus there together. We've got
discount tables for club members so be sure to be there.
</p></abstract>
</eventitem>
<eventitemdate="2009-10-16"time="7:00 PM"room="Comfy Lounge"title="Code Party and Contest Finale">
<short><p>Come on out for a night of code, contests, and energy drinks. Join the Computer Scinece Club for the finale of the Google AI Challenge and an all night code party. Finish up your entry, or start it (its not too late). Not interested in the contest? Come out anyway for a night of coding and comradarie with us.
</p></short>
<abstract><p>Come on out for a night of code, contests, and energy drinks. Join the Computer
Scinece Club for the finale of the Google AI Challenge and an all night code party.
Finish up your entry, or start it (its not too late). Not interested in the contest?
Come out anyway for a night of coding and comradarie with us.
</p><p>Included in the party will be the contest finale and awards cerimony, so if you've
entered be sure to stick arround to collect the spoils of victory, or see just who
<short><p>In this long-awaited third installment of the popular Unix Tutorials the friendly experts of the CSC will teach you the simple art of version control. You will learn the purpose and use of two different Version Control Systems (git and subversion). This tutorial will advise you in the discipline of managing the source code of your projects and enable you to quickly learn new Version Control Systems in the work place -- a skill that is much sought after by employers.
</p></short>
<abstract><p>In this long-awaited third installment of the popular Unix Tutorials the
friendly experts of the CSC will teach you the simple art of version control.
You will learn the purpose and use of two different Version Control Systems
(git and subversion). This tutorial will advise you in the discipline of
managing the source code of your projects and enable you to quickly learn new
Version Control Systems in the work place -- a skill that is much sought after
by employers.
</p></abstract>
</eventitem>
<eventitemdate="2009-10-14"time="2:30 PM"room="DC1304"title="UofT Graduate School Information Session">
<short><p> "Is Graduate School for You?" Get the answers to your grad school questions - and have a bite to eat, our treat</p>
</short>
<abstract><p> Join Prof. Greg Wilson, faculty member in the Software Engineering research group in the UofT's Department of Computer Science,
as he gives insight into studying at the graduate level-what can be expected, what does UofT offer, is it right for you? Pizza and pop will
be served. <b>Come see what grad school is all about!</b>. All undergraduate students are welcome; registration is not required.</p>
<p>For any questions about the program, visit <ahref="http://www.cs.toronto.edu/dcs/prospective-grad.html">UofT's website</a>. This
event is not run by the CS Club, and is announced here for the benefit of our members.</p></abstract>
<short><p>The next installment in the CS Club's popular Unix tutorials UNIX 102 introduces powerful text editing tools for programming and document formatting.
</p></short>
<abstract><p>Unix 102 is a follow up to Unix 101, requiring basic knowledge of the shell.
If you missed Unix101 but still know your way around you should be fine.
Topics covered include: "real" editors, document typesetting with LaTeX
(great for assignments!), bulk editing, spellchecking, and printing in the
student environment and elsewhere.
</p><p>If you aren't interested or feel comfortable with these taskes, watch out for
Unix 103 and 104 to get more depth in power programming tools on Unix.
</p></abstract>
</eventitem>
<eventitemdate="2009-09-28"time="4:30 PM"edate="2009-10-09"etime="11:59 OM"room="MC3003"title="AI Programming Contest sponsored by Google">
<short><p>Come learn how to write an intelligent game-playing program.
No past experience necessary. Submit your program using the <ahref="http://csclub.uwaterloo.ca/contest/">online web interface</a>
to watch it battle against other people's programs. Beginners and experts welcome! Prizes provided by google,
including the delivery of your resume to google recruiters.
</p></short>
<abstract><p>Come learn how to write an intelligent game-playing program.
No past experience necessary. Submit your program using the <ahref="http://csclub.uwaterloo.ca/contest/">online
web interface</a> to watch it battle against other people's programs.
Beginners and experts welcome!
</p><p>The contest is sponsored by Google, so be sure to compete for a chance
to get noticed by them.
</p><p>Prizes for the top programs:
<ul><li>$100 in Cash Prizes</li>
<li> Google t-shirts</li>
<li>Fame and recognition</li>
<li>Your resume directly to a Google recruiter</li>
<short><p> Joel Spolsky, of <ahref="http://www.joelonsoftware.com">Joel on Software</a> will be giving a talk entitled "Computer Science Education and the Software Industry".</p>
</short>
<abstract><p><b>About Joel Spolsky:</b> Joel Spolsky is a
globally-recognized expert on the software development process. His
<eventitemdate="2008-11-15"time="6:30 AM"room="Toronto"title="Changing the World Conference">
<short><p>Organized by Queen's students, Changing the World aims to bring together the world's greatest visionaries to inspire people to innovate and better our world. Among these speakers include Nobel Peace Prize winner, Eric Chivian. He was a recipient for his work on stopping nuclear war.
</p></short>
<abstract><p>Organized by Queen's students, Changing the World
aims to bring together the world's greatest visionaries to
inspire people to innovate and better our world. Among these
speakers include Nobel Peace Prize winner, Eric Chivian. He
was a recipient for his work on stopping nuclear war.
</p><p>The conference is modeled after TED (Technology,
Entertainment, Design), an annual conference uniting the
world's most fascinating thinkers and doers, and like TED,
each speaker is given 18 minutes to give the talk of their
lives.
</p><p>Specifically for students in CS/Math, 50 tickets have
been reserved (non-students: $500). For those who would like
to attend, please pick up your ticket in the Computer Science
Club office. The tickets are limited and they are first come
There is a general meeting scheduled for Friday, October 19, 2007 at 17:00.
</p>
<p>
This is a chance to bring out any ideas and concerns about CSC happenings into the open, as well as a chance to make sure all CSC staff is up to speed on current CSC doings. The current agenda can be found at <ahref="http://wiki.csclub.uwaterloo.ca/wiki/Friday_19_October_2007">http://wiki.csclub.uwaterloo.ca/wiki/Friday_19_October_2007.</a>
</p>
</short>
</eventitem>
<eventitemdate="2007-09-25"time="1:30 PM"room="DC 1302"title="Virtual Reality, Real Law: The regulation of Property in Video Games">
<short>Susan Abramovitch</short>
<abstract>
<p>
This talk is run by the School of Computer Science
</p>
<p>
How should virtual property created in games, such as weapons used in
games like Mir 3 and real estate or clothing created or acquired in
games like Second Life, be treated in law. Although the videogaming
industry continues to multiply in value, virtual property created in
virtual worlds has not been formally recognized by any North American
court or legislature. A bridge has been taking shape from gaming's
virtual economies to real world economies, for example, through
unauthorized copying of designer clothes sold on Second Life for in-game
cash, or real court damages awarded against deletion of player-earned
swords in Mir 3. The trading of virtual property is important to a
large number of people and property rights in virtual property are
currently being recognized by some foreign legal bodies.
</p>
<p>
Susan Abramovitch will explain the legal considerations in determining
how virtual property can or should be governed, and ways it can be
legally similar to tangible property. Virtual property can carry both
physical and intellectual property rights. Typically video game
developers retain these rights via online agreements, but Ms.
Abramovitch questions whether these rights are ultimately enforceable
and will describe policy issues that may impact law makers in deciding
how to treat virtual property under such agreements.
</p>
</abstract>
</eventitem>
<eventitemdate="2007-10-02"time="4:30 PM"room="MC4061"title="Putting the fun into Functional Languages and Useful Programming with OCaml/F#">
<short>Brennan Taylor</short>
<abstract>
<p>A lecture on why functional languages are important, practical applications, and some neat examples. Starting with an introduction to
basic functional programming with ML syntax, continuing with the strengths of OCaml and F#, followed by some exciting examples. Examples include GUI
programming with F#, Web Crawlers with F#, and OpenGL/GTK programming with OCaml. This lecture aims to display how powerful functional languages can
be.</p>
</abstract>
</eventitem>
<eventitemdate="2007-10-09"time="4:45 PM"room="MC 4060"title="Join-Calculus with JoCaml. Concurrent programming that doesn't fry your brain">
<short>Brennan Taylor</short>
<abstract>
<p>
A lecture on the fundamentals of Pi-Calculus followed by an introduction
to Join-Calculus in JoCaml with some great examples. Various concurrent
control structures are explored, as well as the current limitations of
JoCaml. The examples section will mostly be concurrent programming,
however some basic distributed examples will be explored. This lecture
focuses on how easy concurrent programming can be.
</p>
</abstract>
</eventitem>
<eventitemdate="2007-10-15"time="4:30 PM"room="MC4041"title="Off-the-Record Messaging: Useful Security and Privacy for IM">
<short>Ian Goldberg</short>
<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>
<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>
</abstract>
</eventitem>
<eventitemdate="2007-11-20"time="4:30 PM"room="MC 4041"title="Why you should care about functional programming with Haskell *New-er Date*">
Haskell is a modern lazy, strongly typed functional language with type inferrence. This talk will focus on multiple monads, existential types,
lambda expressions, infix operators and more. Along the way we'll see a parser and interpreter for lambda calculus using monadic parsers. STM,
software transactional memory, a new approach to concurrency, will also be discussed. Before the end we'll also see the solution to an ACM problem
to get a hands on feeling for the language. Don't worry if you haven't seen the first talk, you should be fine for this one anyway!
</abstract>
</eventitem>
<eventitemdate="2007-11-29"time="4:30 PM"room="MC 4061"title="Concurrent / Distributed programming with JoCaml">
<short>Brennan Taylor</short>
<abstract>
<p>
A lecture on the fundamentals of Pi-Calculus followed by an introduction to Join-Calculus in JoCaml with some great examples.
Various concurrent control structures are explored, as well as the current limitations of JoCaml. The examples section will
mostly be concurrent programming, however some basic distributed examples will be explored. This lecture focuses on how easy
concurrent programming can be.
</p>
</abstract>
</eventitem>
<eventitemdate="2007-12-04"time="4:30 PM"room="TBA"title="PE Executable Translation: A solution for legacy games on linux (Postponed)">
<short>David Tenty</short>
<abstract>
<p>
With today's fast growing linux user base, a large porportion of legacy applications have established open-source equivalents or ports.
However, legacy games provided an intresting problem to gamers who might be inclinded to migrate to linux or other open platforms.
PE executable translation software will be presented that provides a solution to this dilema and will be contrasted with the windows compatiblity framwork Wine.
The Computer Science club is holding a programming contest from 1:00 to 6:30 open to all! C++,C,Perl,Scheme are allowed.
Prizes totalling in value of $75 will be distributed. You can participate online! For more information, including source files visit <ahref="http://www.csclub.uwaterloo.ca/contest">http://www.csclub.uwaterloo.ca/contest</a>
</p>
<p>
And Free Pizzaa for all who attend!
</p>
</abstract>
</eventitem>
<eventitemdate="2007-12-02"time="2:30 PM"room="TBA"title="Multi-Player Linux games for Linux awarness week">
<short>Multi-Player Gaming with Linux [Possibly Pizza!]</short>
<abstract>
<p>
Come out for multi-player gaming on Linux. If you don't have linux on your machine, we will have LiveCDs available.
Lots of fun! Possible Pizzaa!
</p>
</abstract>
</eventitem>
<eventitemdate="2007-10-04"time="4:30 PM"room="TBA"title="Distributed Programming with Erlang">
<short>Brennan Taylor</short>
<abstract>
<p>
A quick introduction on the current state of distributed programming and various grid computing projects. Followed by some
history and features of the Erlang language and finishing with distributed examples including operating on a cluster.
</p>
</abstract>
</eventitem>
<eventitemdate="2007-12-05"time="4:30 PM"room="MC 4061"title="Google Summer of Code, a look back on 2007">
<short>Holden Karau</short>
<abstract>
<p>
An overview on Google Summer of Code 2007. This talk will look at some of the Summer of Code projects, the project organization, etc.
</p>
<p>
Holden Karau participated in Google Summer of Code 2007 as a student on the subversion team. He created a set of scheme bindings for the
subversion project.
</p>
</abstract>
</eventitem>
<!--spring 2007-->
<eventitemdate="2007-07-17"time="7:00 PM"room="AL 116"title="C++0x - An Overview">
<short>Bjarne Stroustrup</short>
<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></abstract>
</eventitem>
<eventitemdate="2007-07-06"time="4:30 PM"room="AL 116"title="Copyright vs Community in the Age of Computer Networks">
<short>Richard Stallman</short>
<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>
The CSC would like to thank MEF and Mathsoc for funding this talk.
<short>Come out to discuss current & future plans/projects for the Club</short>
<abstract>
<p>
The Computer Science Club (CSClub) has "new" DEC Alphas which are most awesome. Come out, help take them part, put them back
together, solder, and eat free food (probably pizza).
</p>
</abstract>
</eventitem>
<eventitemdate="2006-06-21"time="4:30 PM"
room="MC4042" title="CSC General Meeting">
<short>Come out to discuss current & future plans/projects for the Club</short>
<abstract>
<p>
The venue will include:</p>
<p><ul>
<li><p>Computer usage agreement discussion (Holden has some changes he'd like to propose)</p></li>
<li><p>Web site - Juti is redesigning the web site (you can see <ahref="beta/">a beta here</a> - ideas are welcome.</p></li>
<li><p>Frosh Linux cd's that could be put in frosh math faculty kits.</p></li>
<li><p>VoIP "not phone services" ideas.</p></li>
<li><p>Ideas for talks (people, topics, etc...). We requested Steve Jobs and Steve Balmer, so no idea is too crazy.</p></li>
<li><p>Ideas for books.</p></li>
<li><p>General improvements/comments for the club.</p></li>
</ul></p>
<p>
If you have ideas, but can't attend, please email them to <ahref="mailto:president@csclub.uwaterloo.ca">president@csclub.uwaterloo.ca</a> and they will be read them at the meeting.
</p>
</abstract>
</eventitem>
<eventitemdate="2006-05-25"time="4:00 PM"room="MC 4060"title="Eighteen Years in the Software Tools Business">
<short>Eighteen Years in the Software Tools Business at Microsoft, a talk by Rico Mariani, (BMath CS/EEE 1988)</short>
<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!
</p>
<p>
A video of the talk is available for download in our <ahref="media/">media</a> section.
</p>
</abstract>
</eventitem>
<eventitemdate="2006-05-14"time="1:00 PM"room="CSC"title="Unix 101 and 102 Recording">
<short>Unix 101 and 102 recording</short>
<abstract>
<p>
Have you heard of our famous Unix 101 and Unix 102 tutorials. We've decided to try
and put them on the web. This Sunday we will be doing a first take.
At the same time, we're going to be looking at adding new material
that we haven't covered in the past. </p>
<p>
Why should you come out? Not only will you get to hang out with a wonderful group of people,
you can help impart your knowledge to the world. Don't know anything about Unix? That's cool too,
we need people to make sure its easy to follow along and hopefully keep us from leaving something
out by mistake.
</p>
</abstract>
</eventitem>
<eventitemdate="2006-05-13"time="1:00 PM"room="CSC"title="Video 4 Linux Day">
<short> We don't know enough about V4L</short>
<abstract>
<p>
We don't know Video 4 Linux, but increasingly people are wanting to do interesting stuff with our webcam which
could benefit from a better understanding of Video 4 Linux. So, this Saturday a number of us will be trying to learn
as much as possible about Video 4 Linux and doing weird things with webcam(s).
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>
</eventitem>
<eventitemdate="2006-02-09"time="5:30 PM"room="Bombshelter Pub"title="Pints With Profs">
<short>Come out and meet your professors. Free food provided!</short>
<abstract>
<p>Come out and meet your professors! This is a great opportunity to
mingle with your professors before midterms or find out who you might
have for future courses. All are welcome!</p>
<p>Best of all, there will be <strong>free food!</strong></p>
<p>You can pick up invitations for your professors at the Computer Science
Club office in MC 3036.</p>
<p>Pints with Profs will be held this term on Thursday, 9 February 2006
from 5:30 to 8:00 PM in the Bombshelter.</p>
</abstract>
</eventitem>
<!-- Fall 2005 -->
<eventitemdate="2005-11-29"time="5:30 PM"
room="TBA" title="Programming Contest">
<short>Come out, program, and win shiny things!</short>
<abstract>
<p>
The Computer Science club is holding a programming contest open to all students on Tuesday the 29th of November at 5:30PM. C++,C,Perl,Scheme* are allowed. Prizes totalling in value of $75 will be distributed.
</p>
<p>And best of all... free food!!!</p>
</abstract>
</eventitem>
<eventitemdate="2005-10-17"time="5:30 PM"
room="Fishbowl" title="Party with Profs!">
<short>Get to know your profs and be the envy of your
friends!</short>
<abstract>
<p>
Come out and meet your professors!! This is a great opportunity to
meet professors for Undergraduate Research jobs or to find out who
you might have for future courses. One and all are welcome!