X-Git-Url: http://git.csclub.uwaterloo.ca/?p=mspang%2Fwww.git;a=blobdiff_plain;f=events.xml;h=f09b0088ae0ca30b7400a8f2ca08f16d17b59eb5;hp=2bf4dcd4b3f8fc64c18973f46ac313cae0d7da95;hb=297bd9828964c687d39ce998db991eefb34cb9d6;hpb=d68573b245af77dd6cced4f21201d99848c20fd7
diff --git a/events.xml b/events.xml
index 2bf4dcd..f09b008 100755
--- a/events.xml
+++ b/events.xml
@@ -1,4 +1,671 @@
+ 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.
+
+ The Princess Cinema is Waterloo's repertoire theatre. This month
+ and next, they are featuring a ``Cyber Film Festival''. Upcoming
+ films include:
+
+ Admission is $4.25 for a Princess member, $7.50 for a non-member.
+ Membership to the Princess is $7.00 per year.
+
+ What is the next step in the evolution of computer languages?
+ Intelligent agents? Distributed objects? or visual languages?
+
+ 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?
+
+ 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.
+
+ 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.
+
+ 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.
+
+ Last fall's winners went on to the International Finals and came
+ first overall! You could be there, too!
+
+ 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?
+
+ 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.
+
+ 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.
+
+ 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.
+ by Blair MacIntyre and Elizabeth Mynatt 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.
+
+ 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.
+
+ 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.
+
+ 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.
+
+ 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.
+ by Jan Gray 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. 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. By Edgar Dijkstra 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. 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. His current research interests focus on the formal
+ derivation of proofs and programs, and the streamlining of the
+ mathematical argument in general. Dijkstra held the Schlumberger Centennial Chair in Computer
+ Sciences at The University of Texas at Austin until retiring in
+ October. 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. 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. His current research interests focus on the formal
+ derivation of proofs and programs, and the streamlining of the
+ mathematical argument in general. Dijkstra held the Schlumberger Centennial Chair in Computer
+ Sciences at The University of Texas at Austin until retiring in
+ October.
+ 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.
+
+ 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.
+ Real World J2EE - Design Patterns and architecture behind the
+ yet to be released J2EE portal: theserverside.com 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.
+ 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.
+ Nominations for all positions are being taken in the CSC office, MC
+ 3036. Interested in Computer Graphics?
+ Enjoy watching state-of-the-art Animation?
+ Looking for a cheap place to take a date?
+ SIGGraph Video Night -
+ Featuring some truly awesome computer animations from Siggraph '99.
+ Come out for the Computer Science Club general elections at 6:00
+ pm, right before SIGGraph! 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. 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. 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.
+
+ Nominations for all positions are being taken in the CSC
+ office, MC 3036.
+ They haven't been done in 2 terms.
+ We have an old list of books to buy.
+ Any suggestions from uw.csc are welcome. 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). 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? 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. 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. 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. Any comments from the newsgroup are welcome. 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
+the contest web page. 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). 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. 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
+the contest web page. 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). 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.
+
+ Big Money and Prizes!
+ Need something to do between assignments/beers?
+ From the Minimax Theorem, through Alpha-Beta, and beyond...
+ by Floyd Marinescu
+
+
+ Vitals
+
+
+
+Abstract
+The Speaker
+For More Information
+
+Shirley Fenton
+The infraNET Project
+University of Waterloo
+519-888-4567 ext. 5611
+http://infranet.uwaterloo.ca/
+
+ Proposed agenda
+
+
+
+ Easy Question:
+
+Input: Output:
+
+asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
+abcbabCdcbaqwerewq abCdcba
+
+
+Hard Question:
+
+Input: Output:
+
+post post pots stop
+pots start
+start
+stop
+
+ Easy Question:
+
+Input: Output:
+
+asfgjh12dsfgg kj0ab12321BA wdDwkj abBA
+abcbabCdcbaqwerewq abCdcba
+
+
+Hard Question:
+
+Input: Output:
+
+post post pots stop
+pots start
+start
+stop
+
+
- To be announced. -
-+ Vote for the exec this term. Meet at the CSC office. +
++ 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). +
++ 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. +
++ 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. +
+ ++ The proposed change is illustrated on + a web page. +
+ ++ There will be a business meeting on 30 Sept 2002 at 18:30 in + the comfy lounge, MC 3001. Please come and vote +
++ Get to know UNIX and be the envy of your friends! +
++ 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. +
++ Topics that will be discussed include: +
++ If you do not have a Math computer account, don't panic; one will be +lent to you for the duration of this class. +
+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.
+ +Profs who have confirmed their attendance are:
+There will also be...
+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.
+ +Topics that will be discussed include:
+If you do not have a Math computer account, don't panic; one will be +lent to you for the duration of this class.
+ +The CSC, the KW-Linux User Group, and the UW Debian Interest Group + are jointly hosting a GNU/Linux InstallFest. GNU/Linux is a + powerful, free operating system for your computer. It is mostly + written by talented volunteers who like to share their efforts + and help each other.
+ +Perhaps you have are you interested in installing GNU/Linux. + If so, bring your computer, monitor and keyboard; and we will + help you install GNU/Linux on your machine. You can also find + knowledgable people who can answer your questions about + GNU/Linux.
+ +Q: What is GNU/Linux?
+A: GNU/Linux is a free operating system for your computer. It is mostly
+ written by talented volunteers who like to share their efforts.
+
Q: Free?
+A: GNU/Linux is available for zero-cost. As well, it allows you such
+ freedom to share it with your friends, or to modify the software to
+ your own needs and share that with your friends. It's very friendly.
+
Q: What is an InstallFest?
+A: An InstallFest is a meeting where volunteers help people install
+ GNU/Linux on their computers. It's also a place to meet users, and
+ talk to them about running GNU/Linux.
+
Q: What kind of computer do I need to use GNU/Linux?
+A: Almost any recent computer will do. If you have an old machine
+ kicking around, you can install GNU/Linux on it as well. If it is
+ at least 5 years old, it should be good enough.
+
Q: Can I have Windows and GNU/Linux on the same computer?
+A: If you can run Windows now, and you have an extra gigabyte (GB) of
+ disk space to spare; then it should be possible.
+
Q: What should I bring if I want to install GNU/Linux?
+A: You will want to bring:
+Modern graphics accelerators, or "GPUs", have embedded high-performance +programmable components in the form of vertex and fragment shading units. +Recently, these units have evolved from 8-bit computations to floating-point, +and other operations provide array gather, scatter, and summation. +These capabilities make GPUs akin to array processors of the +past, but with a difference: every PC now has one! I am interested +in finding the best way to exploit this computational capacity for not +only graphics but for general-purpose computation. +
+Current APIs permit specification of the programs for GPUs +using an assembly-language level interface. Compilers for high-level +shading languages are available, such as NVIDIA's Cg, and OpenGL 2.0 and +DirectX will also include standardized shading languages. This talk will +review these. However, compilers for these languages read in an external +string specification, which can be inconvenient. +
+However, it is possible, using standard C++, to define a high-level +shading language directly in the API. Such a language can be nearly +indistinguishable from a special-purpose programming language, yet +permits more direct interaction with the specification of textures +(arrays) and parameters, simplifies implementation, and enables +on-the-fly generation, manipulation, and specialization of shader programs. +A shading language built into the API also permits the lifting of +C++ host language type, modularity, and scoping constructs into the shading +language without any additional implementation effort. Such an +embedded language could be used to program other embedded processors +(such as DSP chips in sound cards) or even to generate machine language +on the fly for the host CPU. +
+This whirlwind talk is aimed at providing an overview of the +GNU/Linux port for the HP PARISC processor. The talk will focus on +the "intricacies" of the processor, and in particular the +implementations of the Linux kernel and GNU Libc. After the talk +you should be acutely aware of how little code needs to be written +to support a new architecture! Carlos has been working on the port +for two years, and enjoying the fruits of his labour on a 46-node +PARISC cluster.
+ ++Carlos is currently in his 5th year of study at the University +of Western Ontario. This is his last year in a concurrent +Computer Engineering and Computer Science degree. His research +interest range from distributed and parallel systems to low +level optimized hardware design. He likes playing guitar and +just bought a Cort NTL-20, jumbo body, solid spurce top with +a mahogany back. Carlos hacks on the PARISC Linux kernel, GNU libc, +GNU Debugger, GNU Binutils and various Debian packages. +
+ + +The Hurd server interfaces are at the heart of the Hurd system. They + define the remote procedure calls (RPCs) that are used by the servers, the + GNU C library and the utility programs to communicate with the Hurd system + and to implement the POSIX personality of the Hurd as well as other + features.
+ +This talk is a walk through the Hurd RPCs, and will give an overview of how + they are used to implement the system. Individual RPCs will be used to + illustrate important or exciting features of the Hurd system in general, + and it will be shown how those features are accessible to the user at the + command line, too.
+ +Marcus Brinkmann is a math student at the Ruhr-Universitaet Bochum in + Germany. He is one of maintainers of the GNU Hurd project and the + initiator of the Debian GNU/Hurd binary distribution. He designed and + implemented the console subsystem of the Hurd, wrote the FAT filesystem + server, and fixed a lot of bugs, thus increasing the stability and + usability of the system.
+ +Virtual memory management is one of the cornerstones of multiuser +operating systems. Most systems available today place all of the +policy in a monolithic virtual memory manager, VMM, isolated from the +rest of the system. Although secure and lightweight, users have no +way to communicate their anticipated memory needs and usage to the +system pager. As a result, the VMM can only implement a global paging +policy (typically, an approximation of LRU) which may be good on +average but is best for nobody.
+ +With the port of Hurd to the L4 microkernel, this situation is being +readdressed. Due to its more distributed nature, a centralized +resource manager is not only more difficult to implement efficiently +but also contrary to the philosophy of the rest of the system. We are +currently exploring a model whereby each program is fully self-paged +and all compete for memory from a physical memory server. This talk +will first discuss how paging currently works in Mach and other +systems. An argument for an external paging policy will then be +presented followed by the requirements of such a design and the design +itself.
+ +Neal Walfield, a GNU Hurd developer, is from the University of Massachusetts +Lowell. Neal spent the summer of 2002 at University of Karlsruhe working +on porting the GNU Hurd to L4.
+ +The Debian Project produces a "Universal Operating System" that is +comprised entirely of Free Software. This talk focuses on using Debian +GNU/Linux in an enterprise environment. This includes:
++ Do you ever wonder what java is doing while you wait? Have you ever used +Modula-3? Do you wonder how lazily you can Mark and Sweep? Would you like to +know how to Stop-and-Copy? +
+ Come out to this talk and learn these things and more. No prior knowledge of +Garbage Collection or memory management is needed. +
+