- csc-general - CSC Mailman

Memory-Corruption Security Holes: How to exploit, patch and prevent them.
by Computer Science Club 18 Mar '10

18 Mar '10

Hello, the CSC is hosting a talk entitled "Memory-Corruption Security Holes: How to exploit, patch and prevent them." on 2010-03-23 at 4:30 PM in MC5158. It will be presented by Peter Barfuss. 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. Light refreshments will be served and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

Another Party of Code
by Computer Science Club 18 Mar '10

18 Mar '10

Hello, the CSC is hosting Another Party of Code on 2010-03-18 at 7:00 PM in Comfy Lounge. 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. Hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

Approximation Hardness and the Unique Games Conjecture
by Computer Science Club 13 Mar '10

13 Mar '10

Hello, the CSC is hosting a talk entitled "Approximation Hardness and the Unique Games Conjecture" on 2010-03-16 at 4:30 PM in MC5158. It will be presented by Elyot Grant. Talk Abstract: 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? 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. 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. 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. I promise fun times and no gruesome math. Basic knowledge of graph theory and computational complexity might help but is not required. Light refreshments will be served and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

A Party of Code
by Computer Science Club 11 Mar '10

11 Mar '10

Hello, the CSC is hosting A Party of Code on 2010-03-12 at 7:00 PM in Comfy Lounge. A fevered night of code, friends, fun, energy drinks, and the CSC. 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. Hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

Registration for the 17th Annual Canadian Undergraduate Mathematics Conference is now open
by Computer Science Club 07 Mar '10

07 Mar '10

A word from the CSC Exec: The CUMC is not just about Pure Mathematics, Computer Science as a mathematical discipline is also welcome and a part of the conference, keep that in mind as you read the following message from the organizers: Registration for the 17th Annual Canadian Undergraduate Mathematics Conference is now open! Don't miss an exciting opportunity this summer! Travel to the University of Waterloo from July 6th to July 10th, and take part in the premier Undergraduate Mathematics event in North America. Visit the conference website at: http://cumc.math.ca Click on the Registration tab to sign up early! Registration fees will be going up at the beginning of the summer. If you are an Undergraduate student who is interested in Mathematics, don't miss this year's conference. It's a fantastic opportunity to travel, learn more mathematics and meet other talented students. -What is the Canadian Undergraduate Mathematics Conference: The Canadian Undergraduate Mathematics Conference (CUMC) is an annual gathering of undergraduate students with interests in the mathematical sciences. It is the largest event of its kind in North America. Each year it attracts over a hundred students of all abilities, from diverse fields such as pure math, applied math, physics, economics, bioinformatics, statistics, computer science, mathematical finance, and actuarial science. The 17th CUMC will be held at the University of Waterloo (located in Waterloo, Ontario, Canada) from July 6 to July 10, 2010. We encourage students who are interested in any math-related field to participate. This is a great opportunity to not only learn about new areas of mathematics, but also to meet students from across the country with similar interests, and to practice giving a mathematical talk (which is encouraged but not required). -Why attend the CUMC? The CUMC is a unique event in North America. No other conference has run seventeen consecutive years for undergraduate students, by undergraduate students. The conference provides an inclusive, non-competitive environment for students with interests in Mathematics. There students of all abilities can meet, exchange ideas and socialize with others interested in math. The conference is an invaluable opportunity to learn, travel and become exposed to the broader mathematical world. Signed: the 2010 CUMC organizing committee

1 0

Software Transactional Memory and Using STM in Haskell
by Computer Science Club 04 Mar '10

04 Mar '10

Hello, the CSC is hosting a talk entitled "Software Transactional Memory and Using STM in Haskell" on 2010-03-09 at 4:30 PM in DC1304. It will be presented by Brennan Taylor. 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. In this talk we explore what Software Transactional Memory (STM) is, what problems STM solves, and how to use STM in Haskell. We explore a number of examples that show how easy STM is to use and how expressive Haskell can be. The goal of this talk is to convince attendees that STM is not only a viable synchronization solution, but superior to how synchronization is typically done today. Light refreshments will be served and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

Bowling
by Computer Science Club 03 Mar '10

03 Mar '10

Hi everyone, The CSC is going bowling this Saturday (March 6th) at the Waterloo Bowling Lanes. We'll be bowling from 5pm-7pm. The bowling alley is located at 14 Princess Street West, but if you don't feel like navigating we will be meeting at the CSC Office starting at 4pm and going to the bowling alley some time after that. If you go bring $9.75; this covers 2 games and shoe rental, which is what we'll be staying for, though you are welcome to continue bowling after the first two games. -- Edgar Bering, Vice President ebering at uwaterloo dot ca Computer Science Club http://csclub.uwaterloo.ca/~ebering Mathematics Society MC 3036, (519)888-4567,x33870 University of Waterloo Waterloo, Ontario CANADA N2L 3G1

1 0

CSC Talk "QIP=PSPACE"
by Computer Science Club 26 Feb '10

26 Feb '10

Hello, the CSC is hosting a talk entitled "QIP=PSPACE" on 2010-03-02 at 4:30 PM in DC1304. It will be presented by Dr. John Watrous. His description follows below: 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. I will not assume that the audience for this talk has any familiarity with either quantum computing or complexity theory; and to be true to the spirit of the interactive proof system model, I hope to make this talk as interactive as possible -- I will be happy to explain anything related to the talk that I can that people are interested in learning about. Light refreshments will be provided and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0

Contest Closing Ice Cream Party
by Computer Science Club 25 Feb '10

25 Feb '10

Hi everyone, As you might recall the Google AI Challenge (that we have organized) started February 1st. Well, it is now almost over, and to help you finalize your submissions we're having an ice cream party starting at 7:00pm on Feb 26 (Tomorrow!), and going until a little after the close of submissions (11:59pm) when we will announce winners and hand out prizes. If you haven't started a submission (or forgot) more information about the contest can be found on the website: contest.csclub.ca So come on out, have some icecream, and hack hack hack. -- Edgar Bering, Vice President ebering at uwaterloo dot ca Computer Science Club http://csclub.uwaterloo.ca/~ebering Mathematics Society MC 3036, (519)888-4567,x33870 University of Waterloo Waterloo, Ontario CANADA N2L 3G1

1 0

CSCF Town Hall Discussion
by Computer Science Club 22 Feb '10

22 Feb '10

Hello, the CSC is co-hosting a CSCF Town Hall meeting on 2010-02-25 at 4:30 PM in DC1302. It will be presented by the CSCF Management. 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. 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. Cookies will be served and I hope to see you there. If you have any questions about the event e-mail the executive or check http://csclub.uwaterloo.ca.

1 0