<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	>

<channel>
	<title>Rhinovirus</title>
	<atom:link href="http://rhinovirus.org/math/feed/" rel="self" type="application/rss+xml" />
	<link>https://rhinovirus.org/math</link>
	<description>Computer, My Thoughts, The Complete and Total Destruction of Mankind</description>
	<pubDate>Tue, 18 Nov 2008 16:22:11 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.3</generator>
	<language>en</language>
			<item>
		<title>Flash</title>
		<link>https://rhinovirus.org/math/2008/11/18/flash/</link>
		<comments>https://rhinovirus.org/math/2008/11/18/flash/#comments</comments>
		<pubDate>Tue, 18 Nov 2008 16:22:11 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=880</guid>
		<description><![CDATA[My first flash animation. Flash is a fun toy but I don&#8217;t think I could justify spending 200$ on it(education discount FTW) so I will have to contend myself with the 30 day trial.


]]></description>
			<content:encoded><![CDATA[<p>My first flash animation. Flash is a fun toy but I don&#8217;t think I could justify spending 200$ on it(education discount FTW) so I will have to contend myself with the 30 day trial.</p>
<p><object classid="clsid:d27cdb6e-ae6d-11cf-96b8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=10,0,0,0" width="550" height="400" id="my1" align="middle"><param name="allowScriptAccess" value="sameDomain" /><param name="allowFullScreen" value="false" /><param name="movie" value="https://rhinovirus.org/math/wp-content/uploads/2008/11/my1.swf" /><param name="quality" value="high" /><param name="bgcolor" value="#ffffff" /><embed src="https://rhinovirus.org/math/wp-content/uploads/2008/11/my1.swf" quality="high" bgcolor="#ffffff" width="550" height="400" name="Untitled-1" align="middle" allowScriptAccess="sameDomain" allowFullScreen="false" type="application/x-shockwave-flash" pluginspage="http://www.adobe.com/go/getflashplayer" /><br />
</object></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/11/18/flash/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Fun With Databases</title>
		<link>https://rhinovirus.org/math/2008/11/16/fun-with-databases/</link>
		<comments>https://rhinovirus.org/math/2008/11/16/fun-with-databases/#comments</comments>
		<pubDate>Sun, 16 Nov 2008 07:56:08 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=876</guid>
		<description><![CDATA[I&#8217;ve fallen in love with MONDIAL  and writing wacky queries for it. What language is the most profitable in terms of GDP, which country has the greatest combined river length, etc.
Two things I haven&#8217;t enjoyed are how out of date it is and the massive amount of missing/inconsistent data. Consider the following SQL query [...]]]></description>
			<content:encoded><![CDATA[<p>I&#8217;ve fallen in love with <a href="http://www.dbis.informatik.uni-goettingen.de/Mondial/">MONDIAL </a> and writing wacky queries for it. What language is the most profitable in terms of GDP, which country has the greatest combined river length, etc.</p>
<p>Two things I haven&#8217;t enjoyed are how out of date it is and the massive amount of missing/inconsistent data. Consider the following SQL query and the data returned.<br />
<img class="alignnone size-full wp-image-877" title="mondial" src="https://rhinovirus.org/math/wp-content/uploads/2008/11/mondial.png" alt="" /></p>
<p>Now, can you think of any English and/or French speaking countries that may be missing from that list?</p>
<p>I downloaded the <a href="https://www.cia.gov/library/publications/download/">CIA World Fact Book</a> and wrote a parser to convert the HTML pages into SQL. The data is more correct then the Mondial but less comprehensive as Mondial also includes extra geographical data. So now I&#8217;m looking for an efficient way to harvest all data from <a href="http://www.geohive.com">GeoHive</a> and <a href="http://data.un.org/">UNdata</a>, I may just end up asking for it.</p>
<p>Data is fun.</p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/11/16/fun-with-databases/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Do I Win at Google App Engine?</title>
		<link>https://rhinovirus.org/math/2008/11/13/do-i-win-at-google-app-engine/</link>
		<comments>https://rhinovirus.org/math/2008/11/13/do-i-win-at-google-app-engine/#comments</comments>
		<pubDate>Thu, 13 Nov 2008 15:19:24 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=873</guid>
		<description><![CDATA[
But apparently this had nothing to do with appengine.google.com returning 404 errors earlier that night.
]]></description>
			<content:encoded><![CDATA[<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/11/gae.png" alt="" title="gae"  class="alignnone size-full wp-image-874" /></p>
<p>But apparently this had nothing to do with appengine.google.com returning 404 errors earlier that night.</p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/11/13/do-i-win-at-google-app-engine/feed/</wfw:commentRss>
		</item>
		<item>
		<title>My Research, etc, at FuturePlay 2008</title>
		<link>https://rhinovirus.org/math/2008/11/03/my-research/</link>
		<comments>https://rhinovirus.org/math/2008/11/03/my-research/#comments</comments>
		<pubDate>Mon, 03 Nov 2008 21:10:25 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=676</guid>
		<description><![CDATA[
Woot, finally I&#8217;m presenting something at a conference, even though they misspelled my name. There are only about 50 Pattrick&#8217;s in Canada so I guess I can forgive them.
So far (about an hour before I&#8217;m actually going to present) this entire experience has been highly rewarding, I have been exposed to several enlightening ideas and [...]]]></description>
			<content:encoded><![CDATA[<p><img class="alignnone size-full wp-image-677" title="name" src="https://rhinovirus.org/math/wp-content/uploads/2008/11/name.png" alt="" /></p>
<p>Woot, finally I&#8217;m presenting something at a conference, even though they misspelled my name. There are only about 50 Pa<strong>tt</strong>rick&#8217;s in Canada so I guess I can forgive them.</p>
<p>So far (about an hour before I&#8217;m actually going to present) this entire experience has been highly rewarding, I have been exposed to several enlightening ideas and already come up with a few new ideas for future research unrelated to my current paper. Free ideas make this entire thing worth it already.</p>
<p>Here are a few examples I&#8217;ve heard:</p>
<ul>
<li>Methods for implementing entities in simulations with eminent and complex personalities and states.</li>
<li>Strategies for using video games to teach primary topics such as multiplication tables while avoiding the math or spelling drills.</li>
<li>A case study of repurposing aspects from industrial commercial games to make education games more enjoyable.</li>
<li>Methods for simulating vehicle and pedestrian traffic intelligently.</li>
<li>An industry perspective on what employers (or at least EA) want in a new hire during tough economic time.</li>
<li>A case for video games that run using vanilla web technologies for increases accessibility (think the AJAX pong that I wrote).</li>
<li>A case for increased social networking and user generated content in video games. Dubbed &#8220;Video Games 2.0&#8243;</li>
</ul>
<p>I may post more of my ideas later - if I think that I wont use them myself - but for now here is one idea. There was a demo of 6 axis 3D wireless game controller for PC and the seller was looking for non-game industry applications; I can see these used in a surgery simulators. They only cost about $35 dollars a hand so far more inexpensive then a cadaver; and they are precise enough to measure the angle, directions, and movements of a prospective surgeon. This could be adapted into a large TV screen with software that simulates knee/heart/brain surgery or possibly complete dissection. This would give medschool students an opportunity to practice a lot in an inexpensive way.</p>
<p>A few of the presenters were good and a few of them were <em>really</em> good; whereas another needed some help. It always amazes me how at the PHD level there are still people who don&#8217;t feel comfortable with public speaking. I wish I could send a message to ever presenter to the world: &#8220;Its called powerpoint, not powerparagraph&#8221;.</p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/11/03/my-research/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Nmap SoC 2008 Success Stories</title>
		<link>https://rhinovirus.org/math/2008/10/15/nmap-soc-2008-success-stories/</link>
		<comments>https://rhinovirus.org/math/2008/10/15/nmap-soc-2008-success-stories/#comments</comments>
		<pubDate>Thu, 16 Oct 2008 01:42:01 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=663</guid>
		<description><![CDATA[Hi Folks.  The Google Summer of Code pencils-down date was in August,
and we&#8217;ve been busily integrating code since then.  Thanks to the
continued help of the participants themselves as well as the wider
Nmap community, I&#8217;m happy to report that most of the code has now been
integrated!  As this report will demonstrate, the 2008 [...]]]></description>
			<content:encoded><![CDATA[<blockquote><p>Hi Folks.  The Google Summer of Code pencils-down date was in August,<br />
and we&#8217;ve been busily integrating code since then.  Thanks to the<br />
continued help of the participants themselves as well as the wider<br />
Nmap community, I&#8217;m happy to report that most of the code has now been<br />
integrated!  As this report will demonstrate, the 2008 Nmap/Google<br />
Summer of Code was another huge success for the project!</p>
<p>I&#8217;ll start with the raw numbers:</p>
<p>In 2005, 70% (7 out of 10) students succeeded, and they tackled some<br />
wonderful projects!  This was the year that Zenmap (then named Umit),<br />
Ncat, and the 2nd generation OS detection systems got their starts.<br />
Doug Hoyte first made major contributions that summer, and continues<br />
helping to this day.  I was the mentor for all 10 students, and I had<br />
them all send me patches rather than providing SVN access.  Nmap<br />
didn&#8217;t even have a public SVN tree at this point.  Here is a more<br />
detailed writeup:<br />
http://slashdot.org/comments.pl?sid=183143&#038;cid=15133184</p>
<p>In 2006, I had a better idea of what works and what doesn&#8217;t and was<br />
able to improve the success rate to 80% (8 out of 10).  Perhaps the<br />
most exciting project was the Nmap Scripting Engine, which has become<br />
one of Nmap&#8217;s most compelling features.  We also finished and<br />
integrated the 2nd generation OS detection system, and Zenmap (Umit)<br />
continued to improve.  I again mentored the students myself without<br />
providing SVN access.  Read the details at<br />
http://seclists.org/nmap-dev/2007/q1/0235.html .</p>
<p>In 2007, our success rate grew again to 83% (5 of 6)!  I attribute<br />
part of the success to me being less of a control freak.  For example,<br />
I took only 4 students compared to 10 the previous year.  The<br />
remaining two 2006 students were mentored by Diman Todorov, who<br />
created NSE as a 2006 SoC student.  I also made the Nmap SVN server<br />
public and provided commit access to the students.  This year we<br />
formally integrated Zenmap into the Nmap build system and packages,<br />
making massive improvements along the way.  This Summer also<br />
introduced David Fifield to the Nmap project and was the first SoC for<br />
Kris Katterjohn.  Both of them have been prolific developers ever<br />
since then.  Read the details at:<br />
http://seclists.org/nmap-dev/2007/q4/0024.html</p>
<p>Enough with the history&#8211;let&#8217;s take a look at our 2008 results!  I&#8217;m<br />
happy to report that we had an 86% (6 out of 7) success rate.  In<br />
other words, our success rate has increased every single year!  I like<br />
to credit improved processes and interaction based on what we&#8217;ve<br />
learned before, but it also helps that we invite the best students<br />
back in later years.  We&#8217;ve never had a 2nd year (or more) student<br />
fail.  This year we expanded to three mentors, all of whom (except for<br />
me) were former SoC students.  Now let&#8217;s look in detail at our 2008<br />
SoC accomplishments:</p>
<p>Patrick Donnelly made substantial NSE infrastructure improvements.  He<br />
added mutex support and an NSE Standard Library (stdnse), fixed some<br />
serious bugs, and rewrote and optimized a substantial amount of code<br />
(particularly the nse_init system).  But his crowning accomplishment<br />
was the NSEDoc system, which uses special comments and variables in<br />
script and library code to generate a comprehensive documentation<br />
portal at http://nmap.org/nsedoc/ .</p>
<p>Kris Katterjohn, who already had hundreds of useful Nmap patches to<br />
his name, returned for 2008 to write hundreds more!  There is no way I<br />
can list everything he did here, particularly as his contributions<br />
ranged all over the map from writing NSE libraries (such as the<br />
username/password module unpwdb and the standardized communication<br />
comm library) to improving Windows support (adding IPv6 and OpenSSL).<br />
His biggest project has been finishing up Ncat, our advanced Netcat<br />
replacement (which began as a 2005 SoC project by Chris Gibson).  Ncat<br />
is now integrated with Nmap in our latest SVN revision.  Learn more<br />
about this exciting new tool at http://nmap.org/ncat/ .</p>
<p>Vladimir Mitrovic spent the summer improving the Zenmap GUI, under<br />
David Fifield&#8217;s expert mentorship.  They made huge usability and<br />
stability improvements, but the pinnacle of their summer achievement<br />
was clearly the scan aggregation and topology features!  Scan<br />
aggregation allows you to conduct multiple scans at different times<br />
and add them seamlessly to your existing results.  Topology draws a<br />
beautiful interactive diagram of the discovered network.  Learn more<br />
about these features (and view the pretty pictures) at<br />
http://nmap.org/book/zenmap-topology.html and<br />
http://nmap.org/book/zenmap-scanning.html#aggregation.</p>
<p>Jurand Nogiec also worked with David on Zenmap, and was responsible<br />
for many key UI improvements which now seem obvious in hindsight.  For<br />
example, he added a cancel button for aborting a scan in progress<br />
without clearing the Nmap output, and he added context-sensitive help<br />
to the many dozens of options in the Profile Editor.  He also made<br />
numerous improvements to the command entry field for people who like to<br />
type Nmap command directly, while still benefiting from Zenmap&#8217;s<br />
visual and searchable presentation of results.</p>
<p>Michael Pattrick was David&#8217;s third student, and he accomplished a wide<br />
variety of tasks.  For example, he created a new OSAssist application<br />
for testing and integrating the thousands of Nmap OS detection<br />
submissions sent in by Nmap users all over the world.  With OSAssist,<br />
integration is more accurate and much less tedious.  Michael also<br />
built two prototypes (one in Perl and then another in C++) for an Ndiff<br />
application which compares two or more scan output files and prints<br />
out any changes.  The prototypes proved so popular that David wrote a<br />
final version in Python which is now integrated with Nmap in our<br />
latest SVN revision.</p>
<p>Philip Pickering spent the summer working on NSE scripts and<br />
libraries.  We&#8217;ve already incorporated his libraries for binary data<br />
manipulation (binlib), DNS queries, Base64 encoding, SNMP, POP3, and<br />
cryptographic hashes.  We&#8217;ve also incorporated several scripts he<br />
wrote utilizing these new libraries.</p>
<p>In addition to these core Nmap projects, 5 students were sponsored to<br />
work on the UMIT Nmap GUI (now a separate project led by Adriano<br />
Marques).  Four of their five students passed, as described at:<br />
http://blog.umitproject.org/2008/08/google-summer-of-code-results.html</p>
<p>Please join me in congratulating all these students for their<br />
excellent work!  I&#8217;m particularly pleased that many of the SoC<br />
students have continued contributing even though the summer has ended.<br />
I&#8217;m looking forward to GSoC 2009 (assuming it is held again and they<br />
invite us), but 2008 will be a tough year to top!</p>
<p>Cheers,<br />
Fyodor
</p></blockquote>
<p>Source: <a href="http://seclists.org/nmap-dev/2008/q4/0193.html">http://seclists.org/nmap-dev/2008/q4/0193.html</a></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/10/15/nmap-soc-2008-success-stories/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Missing market rebounds can be costly</title>
		<link>https://rhinovirus.org/math/2008/10/11/missing-market-rebounds-can-be-costly/</link>
		<comments>https://rhinovirus.org/math/2008/10/11/missing-market-rebounds-can-be-costly/#comments</comments>
		<pubDate>Sun, 12 Oct 2008 00:12:23 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=654</guid>
		<description><![CDATA[
]]></description>
			<content:encoded><![CDATA[<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/10/rebound.png" alt="" title="rebound"  class="alignnone size-medium wp-image-655" /></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/10/11/missing-market-rebounds-can-be-costly/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Ch-ch-ch-chia</title>
		<link>https://rhinovirus.org/math/2008/09/28/ch-ch-ch-chia/</link>
		<comments>https://rhinovirus.org/math/2008/09/28/ch-ch-ch-chia/#comments</comments>
		<pubDate>Sun, 28 Sep 2008 11:34:11 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[photos]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=607</guid>
		<description><![CDATA[
]]></description>
			<content:encoded><![CDATA[<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/09/dscf23473.jpg" alt="" title="dscf23473" class="alignnone size-full wp-image-608" /></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/09/28/ch-ch-ch-chia/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Nature</title>
		<link>https://rhinovirus.org/math/2008/09/28/nature/</link>
		<comments>https://rhinovirus.org/math/2008/09/28/nature/#comments</comments>
		<pubDate>Sun, 28 Sep 2008 05:27:01 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[photos]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=597</guid>
		<description><![CDATA[Nature:
The cellphone tower is on the other side of the lake

]]></description>
			<content:encoded><![CDATA[<p>Nature:<br />
The cellphone tower is on the other side of the lake</p>
<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/09/dscf2347.jpg" alt="" title="dscf2347" class="alignnone size-full wp-image-598" /></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/09/28/nature/feed/</wfw:commentRss>
		</item>
		<item>
		<title>Invisable cat at a pet hotel</title>
		<link>https://rhinovirus.org/math/2008/09/27/invisable-cat-at-a-pet-hotel/</link>
		<comments>https://rhinovirus.org/math/2008/09/27/invisable-cat-at-a-pet-hotel/#comments</comments>
		<pubDate>Sat, 27 Sep 2008 11:00:54 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[photos]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=604</guid>
		<description><![CDATA[
]]></description>
			<content:encoded><![CDATA[<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/09/dscf23472.jpg" alt="" title="dscf23472" class="alignnone size-full wp-image-605" /></p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/09/27/invisable-cat-at-a-pet-hotel/feed/</wfw:commentRss>
		</item>
		<item>
		<title>How low can windows go?</title>
		<link>https://rhinovirus.org/math/2008/09/27/how-low-can-windows-go/</link>
		<comments>https://rhinovirus.org/math/2008/09/27/how-low-can-windows-go/#comments</comments>
		<pubDate>Sat, 27 Sep 2008 05:23:09 +0000</pubDate>
		<dc:creator>Michæl</dc:creator>
		
		<category><![CDATA[News]]></category>

		<guid isPermaLink="false">https://rhinovirus.org/math/?p=593</guid>
		<description><![CDATA[
90MB is pretty darn low.
]]></description>
			<content:encoded><![CDATA[<p><img src="https://rhinovirus.org/math/wp-content/uploads/2008/09/dscf2370.png" alt="" title="dscf2370" class="alignnone size-full wp-image-594" /></p>
<p>90MB is pretty darn low.</p>
]]></content:encoded>
			<wfw:commentRss>https://rhinovirus.org/math/2008/09/27/how-low-can-windows-go/feed/</wfw:commentRss>
		</item>
	</channel>
</rss>
