Commits

committed cd1dcd0

Validated and normalized some documents.

• Participants
• Parent commits fe2ea1c
• Branches default

File t2/MathVentures/disco_circle.html

`-<HTML>`
`-<TITLE>Math-Ventures: A Solidarian Disco Circle</TITLE>`
`-`
`-<BODY BGCOLOR="#FFFFFF">`
`-`
`-<CENTER><H2>A Solidarian Disco Circle</H2></CENTER>`
`-`
`-Are you familiar with disco circles? I participated in quite a lot of them`
`-when in the parties I attended. The concept is that a group of boys and`
`-girls are standing in a circle with pop music playing in the background. A`
`-boy and girl couple is standing in the middle of the circle dancing, and`
`-after a while the boy walks-dances out of the center, while the girl invites`
`-a different boy to dance with her. After a while longer, the girl leaves,`
`-allowing the new boy to invite a new female partner. Again, the boy leaves,`
`-and so on.<P>`
`-`
`-I eventually came to wonder about this question regarding disco circles:<P>`
`-`
`-<TABLE BORDER=1>`
`-<TR><TD>`
`-<B>1.</B> When can a group of dancers form a disco circle, such that every`
`-girl dances with every boy once and only once?`
`-<P>`
`-`
`-<B>2.</B> In case this feat cannot be achieved, what possible times can`
`-every pair dance, so that all boy-girl combinations will dance the same`
`-number of times together?`
`-`
`-</TR></TD>`
`-</TABLE>`
`-`
`-The solution can be found some space below:`
`-<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`-<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`-<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`-<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`-`
`-<H3>Solution:</H3>`
`-`
`-The secret to solving this problem lies in representing it in a proper`
`-model. Let's take a piece of paper (or an empty pad in a drawing program)`
`-and draw one circle for every boy and one for every girl. We can mark the`
`-boys' circles with "B1", "B2", "B3" and so on and the girls' with "G1",`
`-"G2".<P>`
`-`
`-Now, let's suppose a girl invited a boy to dance with her in the middle of`
`-the disco circle. After a short while, the girl would leave and the boy`
`-would be able to invite a girl to join him in the center. If we keep tracing`
`-who is the person in the middle who can (now or in a short while) invite a`
`-member of the opposite sex to join him, we can see that we move from a boy`
`-to a girl, and then to another boy, another girl, and so on.<P>`
`-`
`-Imagine we put the pencil inside the circle of the kid that is in the`
`-middle , and when he is replaced by the one he invited, we move the`
`-pencil towards the circle of the new kid, thus drawing a line between`
`-the two circles. Assuming that a dancing routine in which every pair`
`-danced once can be achieved, we'll end up with a drawing in which every`
`-boy is connected to every girl (and vice-versa).<P>`
`-`
`-If we can traverse this drawing, so that every link is drawn once,`
`-and the pencil is not lifted off the paper, then we found a dancing`
`-order that satistfies the request. In mathematical terminology a`
`-drawing with lines and circles is commonly called a <B>"Graph"</B>, and`
`-the field of mathemtics that deals with graphs is called <B>Graph`
`-Theory</B>.<P>`
`-`
`-A very famous theorem in Graph Theory, called Euler's Circle Law,`
`-proves that a graph can be drawn in one draw if and only if the`
`-following condition is fullfilled:<BR>`
`-Every circle is connected by an even number of links or there are only`
`-two circles that are connected by an uneven number of links.<P>`
`-`
`-In our case, it's obvious that the number of links for every girl is`
`-equal to the number of boys and vice versa. Thus, to have an even`
`-number of links that emerge from every circle, we will need to have an`
`-even number of boys <B>and</B> an even number of girls. Plus, if there`
`-are two boys and an uneven number of girls, we'll still get a graph`
`-with only two circles having an uneven number of links. (and likewise`
`-for two girls and an uneven number of boys).<P>`
`-`
`-Yet another option is the trivial case in which there is one boy and one`
`-girl. The reason that it is not included in the other sub-cases, is because`
`-that way the two nodes are all the existing nodes in the graph.<p>`
`-`
`-To sum up, a disco circled in which every pair of boy and girl dances`
`-together once can be formed on one of the following conditions:<P>`
`-`
`-1. There are 2 boys present.<BR>`
`-2. There are 2 girls present.<BR>`
`-3. There is an even number of boys and an even number of girls who wish to`
`-pariticipate in the circle.<BR>`
`-4. There is exactly one boy and exactly one girl.<br>`
`-`
`-<P>`
`-`
`-`
`-<HR>`
`-`
`-<A HREF="./"><H3>Back to the Math-Ventures Web page</H3></A><P>`
`-<A HREF="../"><H3>Back to Shlomi Fish' Homepage</H3></A>`
`-`
`-`
`-</BODY>`
`-</HTML>`

File t2/MathVentures/disco_circle.html.wml

`+<HTML>`
`+<TITLE>Math-Ventures: A Solidarian Disco Circle</TITLE>`
`+`
`+<BODY BGCOLOR="#FFFFFF">`
`+`
`+<CENTER><H2>A Solidarian Disco Circle</H2></CENTER>`
`+`
`+Are you familiar with disco circles? I participated in quite a lot of them`
`+when in the parties I attended. The concept is that a group of boys and`
`+girls are standing in a circle with pop music playing in the background. A`
`+boy and girl couple is standing in the middle of the circle dancing, and`
`+after a while the boy walks-dances out of the center, while the girl invites`
`+a different boy to dance with her. After a while longer, the girl leaves,`
`+allowing the new boy to invite a new female partner. Again, the boy leaves,`
`+and so on.<P>`
`+`
`+I eventually came to wonder about this question regarding disco circles:<P>`
`+`
`+<TABLE BORDER=1>`
`+<TR><TD>`
`+<B>1.</B> When can a group of dancers form a disco circle, such that every`
`+girl dances with every boy once and only once?`
`+<P>`
`+`
`+<B>2.</B> In case this feat cannot be achieved, what possible times can`
`+every pair dance, so that all boy-girl combinations will dance the same`
`+number of times together?`
`+`
`+</TR></TD>`
`+</TABLE>`
`+`
`+The solution can be found some space below:`
`+<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`+<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`+<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`+<BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR><BR>`
`+`
`+<H3>Solution:</H3>`
`+`
`+The secret to solving this problem lies in representing it in a proper`
`+model. Let's take a piece of paper (or an empty pad in a drawing program)`
`+and draw one circle for every boy and one for every girl. We can mark the`
`+boys' circles with "B1", "B2", "B3" and so on and the girls' with "G1",`
`+"G2".<P>`
`+`
`+Now, let's suppose a girl invited a boy to dance with her in the middle of`
`+the disco circle. After a short while, the girl would leave and the boy`
`+would be able to invite a girl to join him in the center. If we keep tracing`
`+who is the person in the middle who can (now or in a short while) invite a`
`+member of the opposite sex to join him, we can see that we move from a boy`
`+to a girl, and then to another boy, another girl, and so on.<P>`
`+`
`+Imagine we put the pencil inside the circle of the kid that is in the`
`+middle , and when he is replaced by the one he invited, we move the`
`+pencil towards the circle of the new kid, thus drawing a line between`
`+the two circles. Assuming that a dancing routine in which every pair`
`+danced once can be achieved, we'll end up with a drawing in which every`
`+boy is connected to every girl (and vice-versa).<P>`
`+`
`+If we can traverse this drawing, so that every link is drawn once,`
`+and the pencil is not lifted off the paper, then we found a dancing`
`+order that satistfies the request. In mathematical terminology a`
`+drawing with lines and circles is commonly called a <B>"Graph"</B>, and`
`+the field of mathemtics that deals with graphs is called <B>Graph`
`+Theory</B>.<P>`
`+`
`+A very famous theorem in Graph Theory, called Euler's Circle Law,`
`+proves that a graph can be drawn in one draw if and only if the`
`+following condition is fullfilled:<BR>`
`+Every circle is connected by an even number of links or there are only`
`+two circles that are connected by an uneven number of links.<P>`
`+`
`+In our case, it's obvious that the number of links for every girl is`
`+equal to the number of boys and vice versa. Thus, to have an even`
`+number of links that emerge from every circle, we will need to have an`
`+even number of boys <B>and</B> an even number of girls. Plus, if there`
`+are two boys and an uneven number of girls, we'll still get a graph`
`+with only two circles having an uneven number of links. (and likewise`
`+for two girls and an uneven number of boys).<P>`
`+`
`+Yet another option is the trivial case in which there is one boy and one`
`+girl. The reason that it is not included in the other sub-cases, is because`
`+that way the two nodes are all the existing nodes in the graph.<p>`
`+`
`+To sum up, a disco circled in which every pair of boy and girl dances`
`+together once can be formed on one of the following conditions:<P>`
`+`
`+1. There are 2 boys present.<BR>`
`+2. There are 2 girls present.<BR>`
`+3. There is an even number of boys and an even number of girls who wish to`
`+pariticipate in the circle.<BR>`
`+4. There is exactly one boy and exactly one girl.<br>`
`+`
`+<P>`
`+`
`+`
`+<HR>`
`+`
`+<A HREF="./"><H3>Back to the Math-Ventures Web page</H3></A><P>`
`+<A HREF="../"><H3>Back to Shlomi Fish' Homepage</H3></A>`
`+`
`+`
`+</BODY>`
`+</HTML>`

File t2/guide2ee/index.html

`+<!DOCTYPE html`
`+     PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN"`
`+     "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">`
` <html>`
` <head>`
` <title>Guide to the Electrical Engineering Faculty's Courses</title>`
` </head>`
` `
`-<body bgcolor="white">`
`+<body>`
` `
` <h1>Guide to the Electrical Engineering Faculty's Courses</h1>`
` `
` <p>`
`-Due to the incredibly kitchy, disfunctional and non-standards compliant`
`+Due to the incredibly kitchy, dysfunctional and non-standards compliant`
` <a href="http://www.ee.technion.ac.il">homepage</a> `
` of the Electrical Engineering Department, the site became unusable with many`
` browsers, and many of the homepages of the courses disappeared from search`
` <a href="undergrad_courses_list.html"><h3>Undergraduate Courses List</h3></a>`
` </p>`
` `
`-<hr>`
`+<hr />`
` <a href="../"><img src="../images/bk2hp.gif" border="0"></a>`
` `
` `
` </body>`
`+</html>`
`+`

`-<html>`
`-<head>`
`-<title>The Road to Heaven is Paved with Bad Intentions</title>`
`-</head>`
`-`
`-<body bgcolor="white">`
`-<h1>The Road to Heaven is Paved with Bad Intentions</h1>`
`-`
`-<p>`
`-This is the sequel to <a href="../TheEnemy/">The Enemy and How I Helped`
`-to Fight it</a>. Read the abstract to find more. (everything is in Hebrew`
`-for the time being)`
`-</p>`
`-`
`-<h2>Abstract</h2>`
`-`
`-<a href="Road to Heaven abstract.doc">Word Format</a><br />`
`-<a href="Road to Heaven abstract.htm">HTML Format</a><br />`
`-<a href="Road to Heaven abstract.pdf">PDF Format</a><br />`
`-`
`-<br /><br />`
`-<hr />`
`-Designed by Shlomi Fish, <a href="mailto:shlomif@iglu.org.il">shlomif@iglu.org.il</a><br />`
`-<br />`
`-<div align="right">`
`-<a href="../../"><img src="../../images/bk2hp.gif" border="0"></a>`
`-</div>`
`-`
`-</body>`
`-</html>`

`+#include '../template.wml'`
`+`
`+<subject "The Road to Heaven is Paved with Bad Intentions" />`
`+`
`+<p>`
`+This is the sequel to <a href="../TheEnemy/">The Enemy and How I Helped`
`+to Fight it</a>. Read the abstract to find more. (everything is in Hebrew`
`+for the time being)`
`+</p>`
`+`
`+<h2>Abstract</h2>`
`+`
`+<ul>`
`+<li><a href="Road to Heaven abstract.doc">Word Format</a></li>`
`+<li><a href="Road to Heaven abstract.htm">HTML Format</a></li>`
`+<li><a href="Road to Heaven abstract.pdf">PDF Format</a></li>`
`+</ul>`
`+`

File t2/index.html.wml

` `
` <h2>News</h2>`
` `
`+<h3 class="newsitem">26-Jun-2003</h3>`
`+`
`+<p class="newsitem">`
`+Added my favourite online comic strips to the <a href="links.html">links `
`+section</a>.`
`+</p>`
`+`
` <h3 class="newsitem">19-Jun-2003</h3>`
` `
` <p class="newsitem">`
` Added the <a href="./open-source/favourite/">favourite open source `
` software list</a>. Added the `
`-<rellink url="lecture/mini/mdda/" host="vipe">Meta-Data Database Access `
`-lecture</rellink> to the <rellink url="lecture/" host="vipe">lectures `
`-collection</rellink>.`
`+<a href="<rellink url="lecture/mini/mdda/" host="vipe" />">Meta-Data `
`+Database Access lecture</a> to the <a href="<rellink url="lecture/" host="vipe" />">lectures collection</a>.`
` </p>`
` `
` <h3 class="newsitem">26-Oct-2002</h3>`

` A really funny story, for those who know about UNIX.<br />`
` <a href="http://i-want-a-website.com/about-linux/">Humorix</a> - Linux-related`
` humour items.<br />`
`+`
`+<h4>Comic Strips</h4>`
`+`
`+<div class="indent">`
`+<a href="http://www.garfield.com/">Garfield</a><br />`
`+<a href="http://www.unitedmedia.com/comics/luann/">Luann</a><br />`
`+<a href="http://www.ozyandmillie.org/">Ozy and Millie</a><br />`
` <a href="http://www.userfriendly.org/">User Friendly</a> - a very funny comic `
`-strip about an unusuall Internet service provider.<br />`
`+strip about an unusual Internet service provider.<br />`
`+</div>`
` `
` </div>`
` `

File t2/open-source/favourite/index.html.wml

` of my sites, including this one.`
` </p>`
` `
`+<h4><a href="http://www.linpro.no/lwp/">Libwww-perl (LWP)</a></h4>`
`+`
`+<p>`
`+LWP is a very powerful Perl framework for retrieving documents from the`
`+World Wide Web. It's a must if you want to automate web processes in`
`+Perl.`
`+</p>`
`+`
` <h2>Multimedia</h2>`
` `
` <h3><a href="http://www.gimp.org/">The GIMP - The GNU Image Manipulation Program</a></h3>`
` written in Python and so is cross-platform.`
` </p>`
` `
`+<h2>Networking</h2>`
` `
`+<h3><a href="http://spamassassin.org/">SpamAssassin</a></h3>`
`+`
`+<p>`
`+A very nice Junk E-mail filtering mechanism that makes reading the inbox`
`+much more enjoyable.`
`+</p>`
`+`
`+<h3><a href="http://www.gnu.org/software/wget/wget.html">wget</a></h3>`
`+`
`+<p>`
`+A command-line utility for fetching URLs and documents from the Internet `
`+through various protocols. Very powerful and feature-rich.`
`+</p>`
`+`
`+<h3><a href="http://curl.haxx.se/">cURL</a></h3>`
`+`
`+<p>`
`+Another command-line URL fetcher which has proven useful. Also a library`
`+for use within your C programs.`
`+</p>`
`+`
`+<h3><a href="http://perl.overmeer.net/mailbox/">Mail::Box</a></h3>`
`+`
`+<p>`
`+A set of Perl modules that enables one to manage the E-mail folders, prune`
`+old messages, etc. Very very nice, but kinda slow.`
`+</p>`
`+`
`+<h3><a href="http://www.procmail.org/">procmail</a></h3>`
`+`
`+<p>`
`+A useful UNIX utility that can be used to sort and process incoming E-mail `
`+messages. `
`+</p>`
`+`
`+<h3><a href="http://samba.org/rsync/">rsync</a></h3>`
`+`
`+<p>`
`+A feature-rich tool for incremental remote transfer of files.`
`+</p>`
`+`
`+<!--`
`+Todo: add rsync.`
`+-->`

File t2/wysiwyt.html.wml

` </p>`
` </li>`
` `
`-<LI><b>Accesibility Features</b> - it is one of our topmost goals to make`
`+<li><b>Accesibility Features</b> - it is one of our topmost goals to make`
` MS-Windows 95 more accesible for people with various disabilities than it is`
` today. At the moment, work is carried out on making Win95 usable by men and`
` women of inadequate intelligence (I.Q. 250 and less) and by people who`
` eventually be able to use this OS. `
` </li>`
` `
`-</UL>`
`+</ul>`
` `