old-website/events.xml

965 lines
35 KiB
XML
Executable File

<eventdefs>
<!-- Fall 1994 -->
<eventitem
date="1994-09-13" time="9:00 PM"
room="Princess Cinema"
title="Movie Outing: Brainstorm">
<short>
No description available.
</short>
<abstract>
<p>
The first of this term's CSC social events, we will be going to see
the movie ``Brainstorm'' at the Princess Cinema. This outing is
intended primarily for the new first-year students.
</p>
<p>
The Princess Cinema is Waterloo's repertoire theatre. This month
and next, they are featuring a ``Cyber Film Festival''. Upcoming
films include:
</p>
<ul>
<li>Brazil</li>
<li>Bladerunner (director's cut)</li>
<li>2001: A Space Odyssey</li>
<li>Naked Lunch</li>
</ul>
<p>
Admission is $4.25 for a Princess member, $7.50 for a non-member.
Membership to the Princess is $7.00 per year.
</p>
</abstract>
</eventitem>
<eventitem
date="1994-09-16" time="4:30 PM"
room="MC 4040"
title="CSC Elections">
<short>No description available</short>
<abstract>No abstract available</abstract>
</eventitem>
<eventitem
date="1994-09-19" time="4:30 PM"
room="MC 3022"
title="UNIX I Tutorial">
<short>No description available</short>
<abstract>No abstract available</abstract>
</eventitem>
<eventitem
date="1994-09-21" time="6:30 PM"
room="DC 1302"
title="SIGGRAPH Video Night">
<short>No description available</short>
<abstract>No abstract available</abstract>
</eventitem>
<eventitem
date="1994-09-22" time="4:30 PM"
room="MC 3022"
title="UNIX I Tutorial">
<short>No description available</short>
<abstract>No abstract available</abstract>
</eventitem>
<eventitem
date="1994-09-26" time="4:30 PM"
room="MC 3022"
title="UNIX II Tutorial">
<short>No description available</short>
<abstract>No abstract available</abstract>
</eventitem>
<eventitem
date="1994-10-13" time="5:00 PM"
room="DC 1302"
title="Prograph: Picture the Future">
<short>No description available</short>
<abstract>
<p>
What is the next step in the evolution of computer languages?
Intelligent agents? Distributed objects? or visual languages?
</p>
<p>
Visual languages overcome many of the drawbacks and limitations
of the textual languages that software development is based on
today. Do you think about programming in a linear fashion? Or do
you draw a mental picture of your algorithm and then linearize it
for the benefit of your compiler? Wouldn't it be nice if you could
code the same way you think?
</p>
<p>
Visual C++ and Visual BASIC aren't visual languages, but Prograph
is. Prograph is a commercially available, visual, object-oriented,
data-flow language. It is well suited to graphical user interface
development, but is as powerful for general-purpose programming as
any textual language.
</p>
<p>
The talk will comprise a discussion of the problems of textual
languages that visual languages solve, a live demonstration of
Prograph, and some of my observations of the applications of
Prograph to software development.
</p>
</abstract>
</eventitem>
<eventitem
date="1994-10-15" time="10:00 AM"
room="MC 3022"
title="ACM-Style Programming Contest">
<short>No description available</short>
<abstract>
<h3>Big Money and Prizes!</h3>
<p>
So you think you're a pretty good programmer? Pit your skills
against others on campus in this triannual event! Contestants will
have three hours to solve five programming problems in either C or
Pascal.
</p>
<p>
Last fall's winners went on to the International Finals and came
first overall! You could be there, too!
</p>
</abstract>
</eventitem>
<eventitem
date="1994-10-20" time="4:30 PM"
room="MC 3009"
title="Exploring the Internet">
<short>No description available</short>
<abstract>
<h3>Need something to do between assignments/beers?</h3>
<p>
Did you know that your undergrad account at Waterloo gives you
access tothe world's largest computer network? With thousands
of discussion groups, gigabytes of files to download, multimedia
information browsers, even on-line entertainment?
</p>
<p>
The resources available on the Internet are vast and wondrous, but
the tools for navigating it are sometimes confusing and arcane. In
this hands-on tutorial you will get the chance to get your feet wet
with the world's most mind-bogglingly big computer network, the
protocols and programs used, and how to use them responsibly and
effectively.
</p>
</abstract>
</eventitem>
<eventitem
date="1994-11-02" time="4:30 PM"
room="MC 2038"
title="Game Theory">
<short>No description available</short>
<abstract>
<h3>From the Minimax Theorem, through Alpha-Beta, and beyond...</h3>
<p>
This will be a descussion of the pitfalls of using mathematics and
algorithms to play classical board games. Thorough descriptions
shall be presented of the simple techniques used as the building
blocks that make all modern computer game players. I will use
tic-tac-toe as a control for my arguements. Other games such as
Chess, Othello and Go shall be the be a greater measure of progress;
and more importantly the targets of our dreams.
</p>
<p>
To enhance the discussion of the future, Barney Pell's Metagamer
shall be introduced. His work in define classes of games is
important in identifying the features necessary for analysis.
</p>
</abstract>
</eventitem>
<!-- Fall 1999 -->
<eventitem date="1999-10-18" time="2:30 PM" room="DC1304"
title="Living Laboratories: The Future Computing Environments at
Georgia Tech">
<short>By Blair MacIntyre and Elizabeth Mynatt</short>
<abstract>
<p>by Blair MacIntyre and Elizabeth Mynatt</p>
<p>The Future Computing Environments (FCE) Group at Georgia Tech
is a collection of faculty and students that share a desire to
understand the partnership between humans and technology that
arises as computation and sensing become ubiquitous. With
expertise covering the breadth of Computer Science, but
focusing on HCI, Computational Perception, and Machine
Learning, the individual research agendas of the FCE faculty
are grounded in a number of shared "living laboratories" where
their research is applied to everyday life in the classroom
(Classroom 2000), the home (the Aware Home), the office
(Augmented Offices), and on one's person. Professors
MacIntyre and Mynatt will discuss a variety of these projects,
with an emphasis on the HCI and Computer Science aspects of
the FCE work.
</p>
<p>
In addition to their affiliation with the FCE group,
Professors Mynatt and MacIntyre are both members of the
Graphics, Visualization and Usability Center (GVU) at Georgia
Tech. This interdisciplinary center brings together research
in computer science, psychology, industrial engineering,
architecture and media design by examining the role of
computation in our everyday lives. During the talk, they will
touch on some of the research and educational opportunities
available at both GVU and the College of Computing.
</p>
</abstract>
</eventitem>
<eventitem date="1999-10-19" time="4:30 PM" room="DC1304"
title="GDB, Purify Tutorial">
<short>No description available.</short>
<abstract>
<p>
Debugging can be the most difficult and time consuming part of
any program's life-cycle. Far from an exact science, it's more
of an art ... and close to some kind of dark magic. Cryptic
error messages, lousy error checking, and icky things like
implicit casts can make it nearly impossible toknow what's
going on inside your program.
</p>
<p>
Several tools are available to help automate your
debuggin. GDB and Purify are among the most powerful
debugging tools available in a UNIX environment. GDB is an
interactive debugger, allowing you to `step' through
aprogram, examine function calls, variable contents, stack
traces and let you look at the state of a program after it
crashes. Purify is a commercial program designed to help find
and remove memory leaks from programs written inlanguages
without automatic garbage collection.
</p>
<p>
This talk will cover how to compile your C and C++ programs
for use with GDB and Purify, as well as how to use the
available X interfaces. If a purify license is available on
undergrad at the time of the talk, we will cover how to use it
during runtime.
</p>
</abstract>
</eventitem>
<eventitem date="1999-12-01" time="4:30 PM" room="MC2066"
title="Homebrew Processors and Integrated Systems in FPGAs">
<short>By Jan Gray</short>
<abstract>
<p>by Jan Gray</p>
<p> With the advent of large inexpensive field-programmable gate
arrays and tools it is now practical for anyone to design and
build custom processors and systems-on-a-chip. Jan will discuss
designing with FPGAs, and present the design and implementation
of xr16, yet another FPGA-based RISC computer system with
integrated peripherals.</p>
<p> Jan is a past CSC pres., B.Math. CS/EEE '87, and wrote
compilers, tools, and middleware at Microsoft from 1987-1998. He
built the first 32-bit FPGA CPU and system-on-a-chip in
1995. </p>
</abstract>
</eventitem>
<eventitem date="1999-12-01" time="7:00 PM" room="Golf's Steakhouse"
title="Ctrl-D">
<short>End-of-term dinner</short>
<abstract>
No abstract available.
</abstract>
</eventitem>
<eventitem date="1999-12-02" time="1:30 PM" room="DC1302"
title="Calculational Mathematics">
<short>By Edgar Dijkstra</short>
<abstract>
<p> By Edgar Dijkstra</p>
<p> This talk will use partial orders, lattice theory, and, if
time permits, the Galois connection as carriers to illustrate
the use of calculi in mathematics. We hope to show the brevity
of many calculations (in order tofight the superstition that
formal proofs are necessarily unpractically long), and the
strong heuristic guidance that is available for their
design. </p>
<p> Dijkstra is known for early graph-theoretical algorithms,
the first implementation of ALGOL 60, the first operating system
composed of explicitly synchronized processes, the invention of
guarded commands and of predicate transformers as a means for
defining semantics, and programming methodology in the broadest
sense of the word. </p>
<p> His current research interests focus on the formal
derivation of proofs and programs, and the streamlining of the
mathematical argument in general.</p>
<p> Dijkstra held the Schlumberger Centennial Chair in Computer
Sciences at The University of Texas at Austin until retiring in
October. </p>
</abstract>
</eventitem>
<eventitem date="1999-12-03" time="10:00 AM" room="Siegfried Hall,
St Jerome's" title="Proofs and Programs">
<short>By Edsger Dijkstra</short>
<abstract>
<p> This talk will show the use of programs for the proving of
theorems. Its purpose is to show how our experience gained in
the derivations of programs might be transferred to the
derivation of proofs in general. The examples will go beyond the
(traditional) existence theorems. </p>
<p> Dijkstra is known for early graph-theoretical algorithms,
the first implementation of ALGOL 60, the first operating system
composed of explicitly synchronized processes, the invention of
guarded commands and of predicate transformers as a means for
defining semantics, and programming methodology in the broadest
sense of the word. </p>
<p> His current research interests focus on the formal
derivation of proofs and programs, and the streamlining of the
mathematical argument in general.</p>
<p> Dijkstra held the Schlumberger Centennial Chair in Computer
Sciences at The University of Texas at Austin until retiring in
October. </p>
</abstract>
</eventitem>
<eventitem date="1999-12-03" time="3:00 PM" room="DC1351"
title="Open Q&amp;A session">
<short>By Edsger Dijkstra</short>
<abstract>No description available.</abstract>
</eventitem>
<!-- Winter 2000 -->
<eventitem date="2000-03-24" time="4:30 PM" room="DC1304"
title="Enterprise Java APIs and Implementing a Web Portal">
<short>No description available.</short>
<abstract>
<h3>by Floyd Marinescu
</h3>
<p>
The first talk will be an introduction to the Enterprise Java
API's: Servlets, JSP, EJB, and how to use them to build
eCommerce sites.
</p>
<p>
The second talk will be about how these technologies were used
to implement a real world portal. The talk will include an
overview of the design patterns used and will feature
architectural information about the yet to be release portal
(which I am one of the developers) called theserverside.com.
</p>
</abstract>
</eventitem>
<eventitem date="2000-03-30" time="4:30 PM" room="DC1304"
title="Enterprise Java APIs and Implementing a Web Portal (1)">
<short>No description available.</short>
<abstract>
<p>Real World J2EE - Design Patterns and architecture behind the
yet to be released J2EE portal: theserverside.com</p>
<p>This talk will feature an exclusive look at the architecture
behind the new J2EE portal: theserverside.com. Join Floyd
Marinescu in a walk-through ofthe back-end of the portal,
while learning about J2EE and its real world patterns,
applications, problems and benefits.</p>
</abstract>
</eventitem>
<!-- Spring 2000 -->
<eventitem date="2000-07-20" time="7:00 PM" room="Ali Babas Steak
House, 130 King Street S, Waterloo" title="Ctrl-D">
<short>End-of-term dinner</short>
<abstract>No abstract available.</abstract>
</eventitem>
<!-- Fall 2000 -->
<eventitem date="2000-09-14" time="6:00 PM" room="DC1302"
title="CSC Elections">
<short>Fall 2000 Elections for the CSC.</short>
<abstract>
<p>
Would you like to get involved in the CSC? Would you like to have a
say in what the CSC does this term? Come out to the CSC Elections!
In addition to electing the executive for the Fall term, we will be
appointing office staff and other positions. Look for details in
uw.csc.
</p>
<p>Nominations for all positions are being taken in the CSC office, MC
3036.</p>
</abstract>
</eventitem>
<eventitem date="2000-09-14" time="7:00 PM" room="DC1302"
title="SIGGraph Video Night">
<short> SIGGraph Video Night Featuring some truly awesome computer
animations from Siggraph '99. </short>
<abstract>
<p> Interested in Computer Graphics?
</p>
<p> Enjoy watching state-of-the-art Animation?
</p>
<p> Looking for a cheap place to take a date?
</p>
<p> SIGGraph Video Night -
Featuring some truly awesome computer animations from Siggraph '99.
</p>
<p>Come out for the Computer Science Club general elections at 6:00
pm, right before SIGGraph!</p>
</abstract>
</eventitem>
<eventitem date="2000-09-25" time="2:30 PM" room="DC1302"
title="Realising the Next Generation Internet">
<short>By Frank Clegg of Microsoft Canada</short>
<abstract>
<h3>Vitals</h3>
<dl>
<dt>By</dt>
<dd>Frank Clegg</dd>
<dd>President, Microsoft Canada</dd>
<dt>Date</dt>
<dd>Monday, September 25, 2000</dd>
<dt>Time</dt>
<dd>14:30 - 16:00</dd>
<dt>Place</dt>
<dd>DC 1302</dd>
<dd>(Davis Centre, Room 1302, University of Waterloo)</dd>
<dt>Cost</dt>
<dd>$0.00</dd>
<dt>Pre-registration</dt>
<dd>Recommended</dd>
<dd><a HREF="http://infranet.uwaterloo.ca:81/infranet/semform.htm">http://infranet.uwaterloo.ca:81/infranet/semform.htm</a></dd>
<dd>(519) 888-4004</dd>
</dl>
<h3>Abstract</h3>
<p>The Internet and the Web have revolutionized our communications, our access
to information and our business methods. However, there is still much room
for improvement. Frank Clegg will discuss Microsoft's vision for what is
beyond browsing and the dotcom. Microsoft .NET (pronounced "dot-net") is a
new platform, user experience and set of advanced software services planned
to make all devices work together and connect seamlessly. With this next
generation of software, Microsoft's goal is to make Internet-based
computing and communications easier to use, more personalized, and more
productive for businesses and consumers. In his new position of president
of Microsoft Canada Co., Frank Clegg will be responsible for leading the
organization toward the delivery of Microsoft .NET. He will speak about
this new platform and the next generation Internet, how software developers
and businesses will be able to take advantage of it, and what the .NET
experience will look like for consumers and business users.</p>
<h3>The Speaker</h3>
<p>Frank Clegg was appointed president of Microsoft Canada Co. this month.
Prior to his new position, Mr. Clegg was vice-president, Central Region,
Microsoft Corp. from 1996 to 2000. In this capacity, he was responsible for
sales, support and marketing activities in 15 U.S. states. Mr. Clegg joined
Microsoft Corp. in 1991 and headed the Canadian subsidiary until 1996.
During that time, Mr. Clegg was instrumental in introducing several key
initiatives to improve company efficiency, growth and market share. Mr.
Clegg graduated from the University of Waterloo in 1977 with a B. Math.</p>
<h3>For More Information</h3>
<address>
Shirley Fenton<br />
The infraNET Project<br />
University of Waterloo<br />
519-888-4567 ext. 5611<br />
<a HREF="http://infranet.uwaterloo.ca/">http://infranet.uwaterloo.ca/</a>
</address>
</abstract>
</eventitem>
<!-- Winter 2001 -->
<eventitem date="2001-01-15" time="4:30 PM" room="MC3036"
title="Executive elections">
<short>Winter 2001 CSC Elections.</short>
<abstract>
<p>Would you like to get involved in the CSC? Would you like to
have a say in what the CSC does this term? Come out to the CSC
Elections! In addition to electing the executive for the
Winter term, we will be appointing office staff and other
positions. Look for details in uw.csc.
</p>
<p>
Nominations for all positions are being taken in the CSC
office, MC 3036.
</p>
</abstract>
</eventitem>
<eventitem date="2001-01-22" time="3:30 PM" room="MC3036"
title="Meeting #2">
<short>Second CSC meeting for Winter 2001.</short>
<abstract>
<h3>Proposed agenda</h3>
<dl>
<dt>Book purchases</dt>
<dd>
<p>They haven't been done in 2 terms.
We have an old list of books to buy.
Any suggestions from uw.csc are welcome.</p>
</dd>
<dt>CD Burner</dt>
<dd>
<p>For doing linux burns. It was allocated money on the budget
request - about $300. We should be able to get a decent 12x
burner with that (8x rewrite).</p>
<p>The obvious things to sell are Linux Distros and BSD variants.
Are there any other software that we can legally burn and sell
to students?</p>
</dd>
<dt>Unix talks</dt>
<dd>
<p>Just a talk of the topics to be covered, when, where, whatnot.
Mike was right on this one, this should have been done earlier
in the term. Oh well, maybe we can fix this for next fall term.</p>
</dd>
<dt>Game Contest</dt>
<dd>
<p>We already put a bit of work into planning the Othello contest
before I read Mike's post. I still think it's viable. I've got
at least 2 people interested in writing entries for it. This
will be talked about more on monday. Hopefully, Rory and I will
be able to present a basic outline of how the contest is going
to be run at that time.</p>
</dd>
<dt>Peri's closet cleaning</dt>
<dd>
<p>Current sysadmin (jmbeverl) and I (kvijayan) and
President (geduggan) had a nice conversation about this 2
days ago, having to do with completely erasing all of
peri, installing a clean stable potato debian on it, and
priming it for being a gradual replacement to calum. We'll
probably discuss how much we want to get done on this
front on Monday.</p>
</dd>
</dl>
<p>Any <a HREF="nntp://news.math.uwaterloo.ca/uw.csc/8305">comments</a> from <a HREF="news:uw.csc">the newsgroup</a> are welcome.</p>
</abstract>
</eventitem>
<eventitem date="2001-01-27" time="10:30 AM" room="MC3006"
title="ACM-Style programming contest">
<short>Practice for the ACM international programming
contest</short>
<abstract>
<p>Our ACM-Style practice contests involve answering five questions in three
hours. Solutions are written in Pascal, C or C++. Seven years in a row,
Waterloo's teams have been in the top ten at the world finals.
For more information, see
<a HREF="http://plg.uwaterloo.ca/~acm00/">the contest web page</a>.</p>
<h3>Easy Question:</h3>
<p>A palindrome is a sequence of letters that reads the same backwards and
forwards, such as ``Madam, I'm Adam'' (note that case doesn't matter and
only letters are important). Your task is to find the longest palindrome in
a line of text (if there is a tie, print the leftmost one).</p>
<pre>
Input: Output:
asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
abcbabCdcbaqwerewq abCdcba
</pre>
<h3>Hard Question:</h3>
<p>An anagram is a word formed by reordering the letters of another word.
Find all sets of anagrams that exist within a large dictionary. The
input will be a sorted list of words (up to 4000 words), one per line.
Output each set of anagrams on a separate line. Each set should be
in alphabetical order, and all lines of sets should be in alphabetical
order. A word with no anagrams is a set of anagrams itself, and should
be displayed with no modifications.</p>
<pre>
Input: Output:
post post pots stop
pots start
start
stop
</pre>
</abstract>
</eventitem>
<eventitem date="2001-01-29" time="02:39 PM" room="MC3036"
title="Meeting #3">
<short>No description available.</short>
<abstract>No abstract available.</abstract>
</eventitem>
<eventitem date="2001-02-05" time="03:30 PM" room="MC3036"
title="Meeting #4">
<short>No description available.</short>
<abstract>No abstract available.</abstract>
</eventitem>
<eventitem date="2001-02-12" time="03:30 PM" room="MC3036"
title="Meeting #5">
<short>No description available.</short>
<abstract>No abstract available.</abstract>
</eventitem>
<!-- Spring 2001 -->
<eventitem date="2001-06-02" time="10:30 AM" room="MC3006"
title="ACM-Style programming contest">
<short>Practice for the ACM international programming
contest</short>
<abstract>
<p>Our ACM-Style practice contests involve answering five questions in three
hours. Solutions are written in Pascal, C or C++. Seven years in a row,
Waterloo's teams have been in the top ten at the world finals.
For more information, see
<a HREF="http://plg.uwaterloo.ca/~acm00/">the contest web page</a>.</p>
<h3>Easy Question:</h3>
<p>A palindrome is a sequence of letters that reads the same backwards and
forwards, such as ``Madam, I'm Adam'' (note that case doesn't matter and
only letters are important). Your task is to find the longest palindrome in
a line of text (if there is a tie, print the leftmost one).</p>
<pre>
Input: Output:
asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
abcbabCdcbaqwerewq abCdcba
</pre>
<h3>Hard Question:</h3>
<p>An anagram is a word formed by reordering the letters of another word.
Find all sets of anagrams that exist within a large dictionary. The
input will be a sorted list of words (up to 4000 words), one per line.
Output each set of anagrams on a separate line. Each set should be
in alphabetical order, and all lines of sets should be in alphabetical
order. A word with no anagrams is a set of anagrams itself, and should
be displayed with no modifications.</p>
<pre>
Input: Output:
post post pots stop
pots start
start
stop
</pre>
</abstract>
</eventitem>
<!-- Winter 2002 -->
<eventitem date="2002-01-26" time="2:00 PM"
room="Comfy Lounge MC3001"
title="An Introduction to GNU Hurd">
<short>Bored of GNU/Linux? Try this experimental operating
system!</short>
<abstract>
<p>GNU Hurd is an operating system kernel based on the microkernel
architecture design. It was the original GNU kernel, predating Linux,
and is still being actively developed by many volunteers.</p>
<p>The Toronto-area Hurd Users Group, in co-operation with the Computer
Science Club, is hosting an afternoon to show the Hurd to anyone
interested. Jeff Bailey, a Hurd developer, will give a presentation on
the Hurd, followed by a GnuPG/PGP keysigning party. To finish it off,
James Morrison, also a Hurd developer, will be hosting a Debian
GNU/Hurd installation session.</p>
<p>All interested are invited to attend. Bring your GnuPG/PGP fingerprint
and mail your key to sjdutoit@uwaterloo.ca with the subject
``keysigning'' (see separate announcement).</p>
<p>Questions? Suggestions? Contact <a
href="ja2morri@uwaterloo.ca">James Morrison</a>.</p>
</abstract>
</eventitem>
<eventitem date="2002-01-26" time="2:30 PM"
room="Comfy Lounge MC3001"
title="GnuPG/PGP Keysigning Party">
<short>Get more signatures on your key!</short>
<abstract>
<p>
GnuPG and PGP provide public-key based encryption for e-mail and
other electronic communication. In addition to preventing others
from reading your private e-mail, this allows you to verify that an
e-mail or file was indeed written by its perceived author.
</p>
<p>
In order to make sure a GnuPG/PGP key belongs to the respective
person, the key must be signed by someone who has checked the
user's key fingerprint and verified the user's identification.
</p>
<p>
A keysigning party is an ideal occasion to have your key signed by
many people, thus strengthening the authority of your key. Everyone
showing up exchanges key signatures after verifying ID and
fingerprints. The Computer Science Club will be hosting such a
keysigning party together with the Hurd presentation by THUG (see
separate announcement). See
<a href="http://www.student.math.uwaterloo.ca/~sjdutoit/"> the
keysigning party homepage</a> for more information.
</p>
<p>
Before attending it is important that you mail your key to
sjdutoit@uwaterloo.ca with the subject ``keysigning.'' Also make
sure to bring photo ID and a copy of your GnuPG/PGP fingerprint on
a sheet of paper to the event.
</p>
</abstract>
</eventitem>
<eventitem date="2002-01-31" time="6:00 PM" room="MC2037"
title="UNIX 101: First Steps With UNIX">
<abstract>
This is the first in a series of seminars that cover the use of
the UNIX Operating System. UNIX is used in a variety of
applications, both in academia and industy. We will be covering
the basics of the UNIX environment, as well as the use of PINE, an
electronic mail and news reader.
</abstract>
</eventitem>
<eventitem date="2002-02-13" time="4:00 PM" room="MC4060"
title="DVD-Video Under Linux">
<short>Billy Biggs will be holding a talk on DVD technology
(in particular, CSS and playback issues) under Linux, giving some
technical details as well as an overview of the current status of
Free Software efforts. All are welcome.</short>
<abstract>
<p>DVD copy protection: Content Scrambling System (CSS)</p>
<ul>
<li>A technical introduction to CSS and an overview of the ongoing
legal battle to allow distribution of non-commercial DVD
players</li>
<li>The current Linux software efforts and open issues</li>
<li>How applications and Linux distributions are handling the
legal issues involved</li>
</ul>
<p>DVD-Video specifics: Menus and navigation</p>
<ul>
<li>An overview of the DVD-Video standard</li>
<li>Reverse engineering efforts and their implementation status</li>
<li>Progress of integration into Linux media players</li>
</ul>
</abstract>
</eventitem>
<eventitem date="2002-02-07" time="6:00 PM" room="MC2037"
title="Unix 102: Fun With UNIX">
<short>This the second in a series of UNIX tutorials. Simon Law and
James Perry will be presenting some more advanced UNIX
techniques. All are welcome. Accounts will be provided for those
needing them.</short>
<abstract>
<p>
This is the second in a series of seminars that cover the use of
the UNIX Operating System. UNIX is used in a variety of
applications, both in academia and industry. We will provide you
with hands-on experience with the Math Faculty's UNIX environment
in this tutorial.
</p>
<p>Topics that will be discussed include:</p>
<ul>
<li>Interacting with Bourne and C shells</li>
<li>Editing text using the vi text editor</li>
<li>Editing text using the Emacs display editor</li>
<li>Multi-tasking and the screen multiplexer</li>
</ul>
<p>
If you do not have a Math computer account, don't panic; one will
be lent to you for the duration of this class.
</p>
</abstract>
</eventitem>
<eventitem date="2002-03-01" time="5:00 PM" room="MC4060"
title="Computer Go, The Ultimate">
<short>Thomas Wolf from Brock University will be holding a talk on
the asian game of Go. All are welcome.</short>
<abstract>
<p>
The asian game go is unique in a number of ways. It is the oldest
board game known. It is a strategy game with very simple
rules. Computer programs are very weak despite huge efforts and
prizes of US$ &gt; 1.5M for a program beating professional
players. The talk will quickly explain the rules of go, compare go
and chess, mention various attempts to program go and describe our
own efforts in this field. Students will have an opportunity to
solve computer generated go problems. Prizes will be available.
</p>
</abstract>
</eventitem>
<!-- Spring 2002 -->
<eventitem date="2002-05-11" time="7:00 PM" room="MC3036" title="S02
elections">
<short>Come and vote for this term's exec</short>
<abstract>
<p>
Vote for the exec this term. Meet at the CSC office.
</p>
</abstract>
</eventitem>
<!-- Fall 2002 -->
<eventitem date="2002-09-16" time="5:30 PM" room="Comfy lounge"
title="F02 elections">
<short>Come and vote for this term's exec</short>
<abstract>
<p>
Vote for the exec this term. Meet at the comfy
lounge. There will be an opportunity to obtain or renew
memberships. This term's CRO is Siyan Li
(s8li@csclub.uwaterloo.ca).
</p>
</abstract>
</eventitem>
<eventitem date="2002-09-30" time="6:30 PM" room="Comfy lounge, MC3001"
title="Business Meeting">
<short>Vote on a constitutional change.</short>
<abstract>
<p>
The executive has unanimously decided to try to change our
constitution to comply with MathSoc policy. The clause we are trying
to change is the membership clause. The following is the proposed new
reading of the clause.
</p>
<p><i>
In compliance with MathSoc regulations and in recognition of
the club being primarily targeted at undergraduate students, full
membership is open to all undergraduate students in the Faculty of
Mathematics and restricted to the same.</i>
</p>
<p>
The proposed change is illustrated <a
href="http://www.csclub.uwaterloo.ca/docs/constitution-change-20020920.html">on
a web page</a>.
</p>
<p>
There will be a business meeting on 30 Sept 2002 at 18:30 in
the comfy lounge, MC 3001. Please come and vote
</p>
</abstract>
</eventitem>
<eventitem date="2002-09-26" time="5:30 PM" room="MC3006"
title="UNIX 101">
<short>First Steps with UNIX</short>
<abstract>
<p>
Get to know UNIX and be the envy of your friends!
</p>
<p>
This is the first in a series of seminars that cover the use
of the UNIX Operating System. UNIX is used in a variety of
applications, both in academia and industy. We will provide
you with hands-on experience with the Math Faculty's UNIX
environment in this seminar.
</p>
<p>
Topics that will be discussed include:
</p>
<ul>
<li>Navigating the UNIX environment</li>
<li>Using common UNIX commands</li>
<li>Using the PICO text editor</li>
<li>Reading electronic mail and news with PINE</li>
</ul>
<p>
If you do not have a Math computer account, don't panic; one will be
lent to you for the duration of this class.
</p>
</abstract>
</eventitem>
<eventitem date="2002-10-01" time="6:30 PM-9:30 PM" room="The Bomber"
title="Pints with the Profs">
<short></short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-05" time="5:30 PM" room="MC3006"
title="UNIX 102">
<short></short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-08" time="TBA" room="MC4045"
title="Graphics Drivers">
<short>A talk on graphics drivers by Filip Spacek, KGI developer</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-10" time="TBA" room="TBA"
title="UNIX 103">
<short></short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-15" time="TBA" room="TBA"
title="The Evil Side of C++">
<short>Abusing template metaprogramming in C++ for fun and profit</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-29" time="TBA" room="TBA"
title="A romp through the Linux kernel">
<short></short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-10-31" time="TBA" room="TBA"
title="A romp through the Linux kernel, part 2">
<short></short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-11-02" time="TBA" room="Comfy lounge, MC3001"
title="Linux Install Fest with KW-LUG">
<short>Bring over your computer and we'll help you install Linux</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-11-07" time="TBA" room="TBA"
title="The GNU General Public License">
<short>A talk by Simon Law</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-11-12" time="TBA" room="TBA"
title="Memory Management">
<short>A talk by Jim Morrison</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-11-16" time="TBA" room="TBA"
title="Trip to York University">
<short>Going to visit the York University Computer Club</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
<eventitem date="2002-11-22" time="TBA" room="TBA"
title="Perl 6">
<short>A talk by Simon Law</short>
<abstract>No abstract available yet.</abstract>
</eventitem>
</eventdefs>