Lots of stuff.

foo
Stefanus Du Toit 21 years ago
parent 77d559aef9
commit a51c0d9a42
  1. 2
      about/Makefile
  2. 4
      about/index.xml
  3. 2
      cscweb.xsl
  4. 3
      docs/Makefile
  5. 2
      docs/directory.xml
  6. 7
      docs/index.xml
  7. 615
      events.xml
  8. 2
      events/directory.xml
  9. 6
      events/old.xml
  10. 8
      index.xml
  11. 5
      news.xml

@ -1,4 +1,4 @@
INPUTS = index.xml exec.xml members.xml
INPUTS = index.xml exec.xml members.xml
include ../default.mk

@ -59,8 +59,8 @@ N2L 3G1
</section>
<section title="Who is your executive?">
<p>
Each term a new executive is elected by <a href="members">the
membership</a>. See the <a href="exec">Executive</a> page to find
Each term a new executive is elected by <a href="members.html">the
membership</a>. See the <a href="exec.html">Executive</a> page to find
out who this term's executive is.
</p>
</section>

@ -260,7 +260,7 @@
select="document('events.xml')/eventdefs/eventitem">
<xsl:sort select="translate(@date, '-', '')"
order="ascending"
order="descending"
data-type="number"/>
<xsl:if

@ -1,3 +1,4 @@
INPUTS = index.xml
INPUTS = index.xml constitution.xml official.xml machine_usage.xml \
machine_usage_summary.xml website.xml
include ../default.mk

@ -3,4 +3,6 @@
<!DOCTYPE directory SYSTEM "../csc.dtd">
<directory title="Documents">
<diritem title="Official documents" href="official.html" />
<diritem title="Website documents" href="website.html" />
</directory>

@ -6,8 +6,13 @@
<header />
<section title="CSC Documents">
<p>
To be added...
Here you'll find all kinds of documents pertaining to the CSC or
possibly useful to CSC members. So far we have:
</p>
<ul>
<li><a href="official.html">Official documents</a></li>
<li><a href="website.html">Documentation about the website</a></li>
</ul>
</section>
<footer />

@ -1,4 +1,6 @@
<eventdefs>
<!-- Fall 1994 -->
<eventitem
date="1994-09-13" time="9:00 PM"
room="Princess Cinema"
@ -163,6 +165,506 @@
</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"
@ -298,119 +800,6 @@ href="ja2morri@uwaterloo.ca">James Morrison</a>.</p>
</p>
</abstract>
</eventitem>
<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-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>
</eventdefs>

@ -3,5 +3,5 @@
<!DOCTYPE directory SYSTEM "../csc.dtd">
<directory title="Events">
<diritem title="Old events" href="old.html" />
<diritem title="Past terms' events" href="old.html" />
</directory>

@ -5,7 +5,11 @@
<cscpage title="CSC Past events">
<header />
<section title="Past">
<section title="Events the CSC has held in past terms">
<p>
Select a term below to see the list of events for it. Due to lack
of data this web page is not fully accurate.
</p>
<old-events />
</section>

@ -9,11 +9,9 @@
<section title="Welcome!">
<p>
Welcome to the University of Waterloo Computer Science Club
website. If you're new to the World Wide Web or the Internet, we
have some <a href="wwwhelp/">useful pointers</a> on-line. Use the
menus at the top and bottom of our pages to navigate around our
website. If you're new to the Computer Science Club, be sure to
check out our <a href="about/">About section</a>.
website. Use the menus at the top and bottom of our pages to
navigate around our website. If you're new to the Computer Science
Club, be sure to check out our <a href="about/">About section</a>.
</p>
</section>

@ -2,6 +2,11 @@
<!DOCTYPE newdefs SYSTEM "csc.dtd">
<newsdefs>
<newsitem author="sjdutoit" date="2002-04-15">
Added a bunch of <a href="/events/old.html">old events</a> and <a
href="/docs/">some documents</a>, including the <a
href="/docs/constitution.html">constitution</a>.
</newsitem>
<newsitem author="sjdutoit" date="2002-04-15">
Added the <a href="/about/members.html">membership list</a>. <a
href="/events/old.html">Old events</a> are working. Event terms, as

Loading…
Cancel
Save