<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0' version='2.0'><channel><atom:id>tag:blogger.com,1999:blog-5750376782284646140</atom:id><lastBuildDate>Thu, 12 Apr 2012 23:01:31 +0000</lastBuildDate><category>Jack Kerouac</category><category>AAMAS</category><category>Enchantment</category><category>Virtual worlds</category><category>Protective Route Engine</category><category>Cooking</category><category>CAGE</category><category>Neil Gaiman</category><category>Asset Protection</category><category>UNOS</category><category>KPD</category><category>Science magazine</category><category>Orson Scott Card</category><category>Kidney paired donation</category><category>Academia</category><category>Terry Pratchett</category><category>Science</category><category>Analogy</category><category>Politics</category><category>Numb3rs</category><category>Neverwhere</category><category>On The Road</category><category>Good Omens</category><category>umd-secure</category><category>SOMA</category><category>Love</category><category>Four Horsemen of the Apocalypse</category><category>SCARE</category><category>African early childhood development</category><category>Prediction</category><category>Ubuntu</category><category>LCCD</category><category>IED attack</category><category>Law</category><category>UMD</category><category>Utopia</category><category>Religion</category><category>Secure wireless</category><category>Police</category><category>Popular Science</category><category>Carnegie Mellon University</category><category>Thomas More</category><title>Working Toward A Life</title><description></description><link>http://blog.gannon-house.com/</link><managingEditor>noreply@blogger.com (John Dickerson)</managingEditor><generator>Blogger</generator><openSearch:totalResults>19</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-7130683034361019367</guid><pubDate>Sat, 02 Apr 2011 05:28:00 +0000</pubDate><atom:updated>2011-04-02T03:29:57.986-04:00</atom:updated><title>Web of War</title><description>&lt;em&gt;Nature&lt;/em&gt; recently published an article prominently featuring national security work with which I am involved.  The article, called &lt;em&gt;&lt;a href="http://www.nature.com/news/2011/110330/full/471566a.html"&gt;Web of War&lt;/a&gt;&lt;/em&gt;, features my old lab LCCD's Spatial-Cultural Abductive Reasoning Engine (&lt;a href="http://www.umiacs.umd.edu/research/LCCD/projects/SCARE.jsp"&gt;SCARE&lt;/a&gt;) as a fielded example of how the government is augmenting its data-mining approach to national security with social-computational science. SCARE uses a combination of cultural and logistical constraints alongside real-world data to accurately predict the locations of arms caches in Baghdad, Iraq. The full article can be viewed online &lt;a href="http://www.nature.com/news/2011/110330/full/471566a.html"&gt;here&lt;/a&gt; or in print in &lt;em&gt;Nature&lt;/em&gt; &lt;strong&gt;471&lt;/strong&gt;, pp. 566-568. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://2.bp.blogspot.com/-m5J6utSw_ts/TZa9SefccUI/AAAAAAAAABA/6dzS8UnMaqw/s1600/scare.jpg"&gt;&lt;img style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 320px; height: 316px;" src="http://2.bp.blogspot.com/-m5J6utSw_ts/TZa9SefccUI/AAAAAAAAABA/6dzS8UnMaqw/s320/scare.jpg" border="0" alt=""id="BLOGGER_PHOTO_ID_5590864112547295554" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;em&gt;A screenshot of the SCARE software featured in Nature.  IED attacks are in red, while predicted cache locations are in yellow.&lt;/em&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-7130683034361019367?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2011/04/web-of-war.html</link><author>noreply@blogger.com (John Dickerson)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://2.bp.blogspot.com/-m5J6utSw_ts/TZa9SefccUI/AAAAAAAAABA/6dzS8UnMaqw/s72-c/scare.jpg' height='72' width='72'/><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-7625169717963153829</guid><pubDate>Mon, 22 Nov 2010 01:21:00 +0000</pubDate><atom:updated>2010-11-21T21:11:09.160-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>UNOS</category><category domain='http://www.blogger.com/atom/ns#'>Carnegie Mellon University</category><category domain='http://www.blogger.com/atom/ns#'>KPD</category><category domain='http://www.blogger.com/atom/ns#'>Kidney paired donation</category><title>Kidney Paired Donation</title><description>The first nationwide kidney paired donation, or KPD, took place about a week ago.  This program uses an algorithm developed by my advisor, Tuomas Sandholm, and Avrim Blum (and edited by me!) at Carnegie Mellon University.&lt;br /&gt;&lt;br /&gt;The initial run of the computer matching process included just 43 kidney transplant candidates and 45 potential living donors. The national KPD pool will eventually include as many as 10,000 donor-recipient pairs.  Each pair includes a potential donor who is not medically compatible with his or her original intended recipient, or is less than an optimal match. The algorithm then checks for new combinations between the pairs based on compatible blood and tissue types, solving this problem optimally.&lt;br /&gt;&lt;br /&gt;With nearly 87,000 people on the national kidney waiting list, hopefully this algorithm--in conjunction with the 77 participating hospitals across the country--will make a dent in this number.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;November Coverage&lt;/b&gt;&lt;br /&gt;&lt;a href="http://www.cmu.edu/news/archive/2010/November/nov16_kidneyalgorithm.shtml"&gt;CMU Press Release&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.cmu.edu/homepage/health/2010/fall/saving-lives.shtml"&gt;CMU Homepage Coverage&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.ibtimes.com/articles/83331/20101118/algorithm-makes-it-easier-to-match-kidney-donors.htm"&gt;International Business Times&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.medindia.net/news/New-Computer-Algorithm-To-Match-Live-Kidney-Donors-With-Recipients-76818-1.htm"&gt;Medindia&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.medicalnewstoday.com/articles/208284.php"&gt;Medical News Today&lt;/a&gt;&lt;br /&gt;...&lt;i&gt;and others&lt;/i&gt;...&lt;br /&gt;&lt;br /&gt;&lt;b&gt;October Coverage&lt;/b&gt;&lt;br /&gt;&lt;a href="http://optn.transplant.hrsa.gov/news/newsDetail.asp?id=1404"&gt;US Dept. of Health and Human Services&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.unos.org/about/index.php?topic=newsroom&amp;article_id=2639:a5ba3316bac4c41c58615fbb5059395d"&gt;United Network for Organ Sharing (UNOS)&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.uch.edu/conditions/transplant-services/kidney-transplant/living-kidney-donation/kidney-paired-donation-pilot-program-at-uch.aspx"&gt;University of Colorado&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-7625169717963153829?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2010/11/kidney-paired-donation.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-2507992335345638199</guid><pubDate>Tue, 28 Sep 2010 04:36:00 +0000</pubDate><atom:updated>2010-09-28T00:58:17.322-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Science</category><category domain='http://www.blogger.com/atom/ns#'>Carnegie Mellon University</category><category domain='http://www.blogger.com/atom/ns#'>Cooking</category><title>Cooking for Geeks</title><description>Jeff Potter from &lt;span style="font-style:italic;"&gt;Cooking for Geeks&lt;/span&gt; (&lt;a href="http://www.cookingforgeeks.com/"&gt;link&lt;/a&gt;) visited Carnegie Mellon yesterday as part of a tour to promote his new book.  Aside from an excellent talk covering some neat topics about cooking/baking (&lt;span style="font-style:italic;"&gt;e.g.&lt;/span&gt;, using a 48-hour warm water bath to cook meatloaf), the audience was witness to ice cream made using liquid nitrogen.&lt;br /&gt;&lt;br /&gt;With a &lt;span style="font-style:italic;"&gt;boiling point&lt;/span&gt; of roughly -195.8 Celsius, liquid nitrogen provides a significantly faster, albeit a little dangerous, way to make ice cream.  On top of this, both the cream and water in the ice cream-to-be freeze significantly faster than normal, creating smaller crystalline structures and a smoother texture overall.  Pretty cool.&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://1.bp.blogspot.com/_BhzuNKgtIlY/TKFzcBJRfhI/AAAAAAAAAAM/cHagulI_wJo/s1600/liquid_nitrogen_ice_cream.jpg"&gt;&lt;img style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 320px; height: 240px;" src="http://1.bp.blogspot.com/_BhzuNKgtIlY/TKFzcBJRfhI/AAAAAAAAAAM/cHagulI_wJo/s320/liquid_nitrogen_ice_cream.jpg" border="0" alt=""id="BLOGGER_PHOTO_ID_5521821543313800722" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;Here is a &lt;a href="http://www.youtube.com/watch?v=xTNCAqJN_qc"&gt;short video&lt;/a&gt; of the ice cream demonstration (liquid nitrogen use begins at 2:45).  Here's a link to his &lt;a href="http://www.cookingforgeeks.com/buy/"&gt;book&lt;/a&gt;.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-2507992335345638199?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2010/09/cooking-for-geeks.html</link><author>noreply@blogger.com (John Dickerson)</author><media:thumbnail xmlns:media='http://search.yahoo.com/mrss/' url='http://1.bp.blogspot.com/_BhzuNKgtIlY/TKFzcBJRfhI/AAAAAAAAAAM/cHagulI_wJo/s72-c/liquid_nitrogen_ice_cream.jpg' height='72' width='72'/><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-2114268016792241559</guid><pubDate>Sat, 17 Apr 2010 00:14:00 +0000</pubDate><atom:updated>2010-04-16T20:42:57.242-04:00</atom:updated><title>Recursive Line Count (Not Code Count)</title><description>A common question I am asked is how to count the total number of lines in specific files of a specific directory (and its subdirectories).  After navigating to the root of the directory in which you are interested, type:&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family:courier new;"&gt;find . -type f | xargs wc -l&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;This will find all files, recursively, and pass them (as arguments) into the standard word count utility; however, if you would like to specify specific types of files, try using a regular expression with the &lt;span style="font-family:courier new;"&gt;find&lt;/span&gt; utility:&lt;br /&gt;&lt;br /&gt;&lt;span style="font-family:courier new;"&gt;find . \( ! -regex '.*/\..*' \) -type f | xargs wc -l&lt;/span&gt;&lt;br /&gt;&lt;br /&gt;This line of code will only pass non-hidden files (those that do not start with a period) into &lt;span style="font-family:courier new;"&gt;wc&lt;/span&gt;.  This would be handy if, say, you were using SVN and did not want to parse &lt;span style="font-family:courier new;"&gt;.svn&lt;/span&gt; directories.  Simple edits to this regular expression will parse only &lt;span style="font-family:courier new;"&gt;.html&lt;/span&gt; or files that begin with &lt;span style="font-family:courier new;"&gt;temp&lt;/span&gt;.&lt;br /&gt;&lt;br /&gt;My guess is that most people who ask this question are interested in counting total lines of code in some project.  Typically, this is not a smart way to count code, as blank lines, comments, split lines, and brackets – not just real lines of code – will be counted.  If you are looking for a more intelligent code counter, check out &lt;a href="http://cloc.sourceforge.net/"&gt;CLOC&lt;/a&gt;.  I apologize for recommending a Perl program, but it works.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-2114268016792241559?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2010/04/recursive-line-count.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-6659831981472011919</guid><pubDate>Fri, 12 Feb 2010 19:39:00 +0000</pubDate><atom:updated>2010-02-12T15:21:51.612-05:00</atom:updated><title>A Graph-Theoretic Approach to Protect Static and Moving Targets from Adversaries</title><description>A few days ago, I submitted the camera-ready version of our &lt;a href="http://www.cse.yorku.ca/AAMAS2010/"&gt;AAMAS&lt;/a&gt;-2010 paper.  The abstract, provided below, is a slightly edited version of that which was initially submitted back in October.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;A Graph-Theoretic Approach to Protect Static and Moving Targets from Adversaries&lt;/b&gt;&lt;br /&gt;&lt;i&gt;J.P. Dickerson, G.I. Simari, V.S. Subrahmanian and Sarit Kraus&lt;/i&gt;&lt;br /&gt;&lt;blockquote&gt;&lt;br /&gt;The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack those assets. The dynamic asset protection (DAP) problem is a version of SAP where the asset is following a fixed and widely known route (&lt;i&gt;e.g.&lt;/i&gt;, a parade route) and needs to be protected.  We formalize what it means for a given allocation of resources to be "optimal" for protecting a desired set of assets, and show that randomly allocating resources to a single edge cut in the road network solves this problem. Unlike SAP, we show that DAP is not only an NP-complete problem, but that approximating DAP is also NP-hard. We provide the GreedyDAP heuristic algorithm to solve DAP and show experimentally that it works well in practice, using road network data for real cities.&lt;/blockquote&gt;&lt;br /&gt;Basically, given some set of targets &lt;i&gt;T&lt;/i&gt; and some set of "enemy" source nodes &lt;i&gt;S&lt;/i&gt;, we discuss methods to either protect from &lt;i&gt;S&lt;/i&gt; a static &lt;i&gt;T&lt;/i&gt; or choose an optimally protected path between two target nodes within &lt;i&gt;T&lt;/i&gt;.  The paper draws heavily from graph theory, game theory, and network interdiction.&lt;br /&gt;&lt;br /&gt;A copy of the paper can be found here: &lt;a href="http://www.gannon-house.com/uploads/adversarial.pdf"&gt;PDF Link&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;BibTeX citation information is &lt;a href="http://www.umiacs.umd.edu/research/LCCD/Bibtex?publication_id=67"&gt;here&lt;/a&gt;.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-6659831981472011919?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2010/02/graph-theoretic-approach-to-protect.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-6603566835732447721</guid><pubDate>Fri, 11 Dec 2009 00:37:00 +0000</pubDate><atom:updated>2009-12-11T16:59:40.229-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>SCARE</category><category domain='http://www.blogger.com/atom/ns#'>Popular Science</category><category domain='http://www.blogger.com/atom/ns#'>IED attack</category><category domain='http://www.blogger.com/atom/ns#'>LCCD</category><category domain='http://www.blogger.com/atom/ns#'>Prediction</category><title>Spatio-Cultural Abductive Reasoning Engine</title><description>Captain Paulo Shakarian, a Ph.D. student in my lab, recently presented a project to which I contributed at the &lt;i&gt;International Conference on Computational Cultural Dynamics&lt;/i&gt; (ICCCD 2009).  SCARE, the Spatio-Cultural Abductive Reasoning Engine, describes a software system we implemented that analyzes patterns of improvised explosive device (IED) attacks in a war zone in an effort to predict the locations of insurgent-run weapons caches.&lt;br /&gt;&lt;br /&gt;The test data used -- publicly available records of IED attacks in Baghdad over the last twenty-one months -- provided a way to test the predictive algorithms.  After training on the first seven months of data, the SCARE system accurately predicted (within 0.5km) the locations of real weapons caches found in the region during that time period.&lt;br /&gt;&lt;br /&gt;The paper describing this work is located &lt;a href="http://lccd-content.umiacs.umd.edu/main/papers/SCARE-Baghdad-ICCCD.pdf"&gt;here&lt;/a&gt;.  The SCARE system is online &lt;a href="http://scare.umiacs.umd.edu/"&gt;here&lt;/a&gt;.  You'll need the Google Earth plugin and an LCCD-provided login.&lt;br /&gt;&lt;br /&gt;&lt;object width="560" height="465" class="BLOG_video_class" id="BLOG_video-fff16c0177be6b96" classid="clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" codebase="http://download.macromedia.com/pub/shockwave/cabs/flash/swflash.cab#version=6,0,40,0"&gt;&lt;param name="movie" value="http://www.youtube.com/get_player"&gt;&lt;param name="bgcolor" value="#FFFFFF"&gt;&lt;param name="allowfullscreen" value="true"&gt;&lt;param name="flashvars" value="flvurl=http://redirector.googlevideo.com/videoplayback?id%3Dfff16c0177be6b96%26itag%3D5%26app%3Dblogger%26cmo%3Dsensitive_content%253Dyes%26ip%3D0.0.0.0%26ipbits%3D0%26expire%3D1340785619%26sparams%3Did,itag,ip,ipbits,expire%26signature%3DC35EB80B06D3E0CDC5D57949D2F89EA962ECD67.7DC920E8C12A77AB56635CF3080F520DB085FEFA%26key%3Dck1&amp;amp;iurl=http://video.google.com/ThumbnailServer2?app%3Dblogger%26contentid%3Dfff16c0177be6b96%26offsetms%3D5000%26itag%3Dw160%26sigh%3DAqX0ktNRo8QKFQ4KiR2SWBn4jIE&amp;amp;autoplay=0&amp;amp;ps=blogger"&gt;&lt;embed src="http://www.youtube.com/get_player" type="application/x-shockwave-flash" width="560" height="465" bgcolor="#FFFFFF" flashvars="flvurl=http://redirector.googlevideo.com/videoplayback?id%3Dfff16c0177be6b96%26itag%3D5%26app%3Dblogger%26cmo%3Dsensitive_content%253Dyes%26ip%3D0.0.0.0%26ipbits%3D0%26expire%3D1340785619%26sparams%3Did,itag,ip,ipbits,expire%26signature%3DC35EB80B06D3E0CDC5D57949D2F89EA962ECD67.7DC920E8C12A77AB56635CF3080F520DB085FEFA%26key%3Dck1&amp;iurl=http://video.google.com/ThumbnailServer2?app%3Dblogger%26contentid%3Dfff16c0177be6b96%26offsetms%3D5000%26itag%3Dw160%26sigh%3DAqX0ktNRo8QKFQ4KiR2SWBn4jIE&amp;autoplay=0&amp;ps=blogger" allowFullScreen="true" /&gt;&lt;/object&gt;&lt;br /&gt;&lt;br /&gt;The video above is provided as a tutorial to those using the SCARE system.  For the tutorial, we use publicly available data on a series of church burglaries in the St. Paul, Minnesota area.  Please excuse the voice-over!&lt;br /&gt;&lt;br /&gt;&lt;i&gt;Popular Science&lt;/i&gt; has a nice article on the project &lt;a href="http://www.popsci.com/technology/article/2009-12/scare-program-predicts-ied-weapons-caches-used-insurgents"&gt;here&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Media Coverage&lt;/b&gt;&lt;br /&gt;&lt;a href="http://www.popsci.com/technology/article/2009-12/scare-program-predicts-ied-weapons-caches-used-insurgents"&gt;Popular Science&lt;/a&gt;, &lt;a href="http://www.sciencedaily.com/releases/2009/12/091210153655.htm"&gt;Science Daily&lt;/a&gt;, &lt;a href="http://www.sciencecodex.com/fighting_ied_attacks_with_scare_technology"&gt;Science Codex&lt;/a&gt;, &lt;a href="http://www.scienceblog.com/cms/fighting-ied-attacks-scare-technology-28261.html"&gt;Science Blog&lt;/a&gt;, &lt;a href="http://www.physorg.com/news179677568.html"&gt;PhysOrg&lt;/a&gt;, &lt;a href="http://www.newswise.com/articles/fighting-ied-attacks-with-scare-technology"&gt;NewsWise&lt;/a&gt;, &lt;a href="http://www.biosciencetechnology.com/News/Feeds/2009/12/products-instrumentation-fighting-ied-attacks-with-scare-technology/"&gt;BioScience Tech&lt;/a&gt;, &lt;a href="http://www.genengnews.com/news/bnitem.aspx?name=70693837&amp;taxid=20"&gt;Genetic Engineering &amp; Biotech&lt;/a&gt;, and others.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-6603566835732447721?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/12/spatio-cultural-abductive-reasoning.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-7248653462186466136</guid><pubDate>Fri, 27 Nov 2009 21:00:00 +0000</pubDate><atom:updated>2009-12-10T20:29:08.630-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Science</category><category domain='http://www.blogger.com/atom/ns#'>LCCD</category><category domain='http://www.blogger.com/atom/ns#'>Virtual worlds</category><category domain='http://www.blogger.com/atom/ns#'>Science magazine</category><category domain='http://www.blogger.com/atom/ns#'>CAGE</category><title>What Can Virtual Worlds do for National Security?</title><description>Recently, &lt;i&gt;Science&lt;/i&gt; magazine published an article by my mentor V.S. Subrahmanian and me regarding our work on virtual worlds.  In the article, we discuss how virtual worlds and games can be used in conjunction with predictive algorithms to provide an environment in which national security and policy experts can explore the results of hypothetical political or military policy changes across the globe.&lt;br /&gt;&lt;br /&gt;Here is the abstract from &lt;i&gt;Science&lt;/i&gt;:&lt;br /&gt;&lt;blockquote&gt;Military planners have long used war games to plan for future conflicts. Beginning in the 1950s, defense analysts began to develop computer-based models to predict the outcomes of military battles that incorporated elements of game theory. Such models were often restricted to two opposing forces, and often had a strict win-lose resolution. Today, defense analysts face situations that are more complex, not only in that conflicts may involve several opposing groups within a region, but also in that military actions are only part of an array of options available in trying to foster stable, peaceful conditions. For example, in the current conflict in Afghanistan, analysts must try to estimate how particular actions by their forces—building schools, burning drug crops, or performing massive security sweeps—will affect interactions between the many diverse ethnic groups in the region. We discuss one approach to addressing this prediction problem in which possible outcomes are explored through computer-based virtual-world environments.&lt;/blockquote&gt;&lt;br /&gt;If you have a subscription to &lt;i&gt;Science&lt;/i&gt;, you can view the full article on their &lt;a href="http://www.sciencemag.org/cgi/content/summary/326/5957/1201"&gt;site&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;For a nice summary of our work, please see Larry Greenemeier's article in &lt;i&gt;Scientific American&lt;/i&gt; &lt;a href="http://www.scientificamerican.com/article.cfm?id=virtual-war-games"&gt;here&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Worldwide Media Coverage&lt;/b&gt;&lt;br /&gt;&lt;a href="http://www.scientificamerican.com/article.cfm?id=virtual-war-games"&gt;Scientific American&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.theregister.co.uk/2009/11/27/pentagon_war_matrix/"&gt;The Register&lt;/a&gt;&lt;br /&gt;&lt;a href="http://education.tmcnet.com/news/2009/11/26/4503474.htm"&gt;TMCnet&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.supercomputingonline.com/latest/building-real-security-with-virtual-worlds"&gt;Supercomputing Online&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.genengnews.com/news/bnitem.aspx?name=69571060&amp;taxid=0"&gt;Genetic Engineering &amp; Biotechnology News&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.rdmag.com/News/Feeds/2009/11/policy-building-real-security-with-virtual-worlds/"&gt;R&amp;D Magazine&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.sciencedaily.com/releases/2009/11/091126173029.htm"&gt;Science Daily&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.sciencecentric.com/news/article.php?q=09112703-building-real-security-with-virtual-worlds"&gt;Science Centric&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.scienceblog.com/cms/building-real-security-virtual-worlds-27585.html"&gt;ScienceBlog&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.newsguide.us/education/science/Building-real-security-with-virtual-worlds/"&gt;NewsGuide.us&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.zibb.com/article/5695481/Building+Real+Security+With+Virtual+Worlds"&gt;Zibb&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.tradingmarkets.com/.site/news/Stock%20News/2683238/"&gt;TradingMarkets.com&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.redorbit.com/news/technology/1791689/building_real_security_with_virtual_worlds/index.html?"&gt;redOrbit&lt;/a&gt;&lt;br /&gt;&lt;a href="http://esciencenews.com/articles/2009/11/26/building.real.security.with.virtual.worlds"&gt;e! Science News&lt;/a&gt;&lt;br /&gt;&lt;a href="http://science-nature.marc8.com/building-real-security-virtual-worlds"&gt;marc8&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.sciencecodex.com/building_real_security_with_virtual_worlds"&gt;Science Codex&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.physorg.com/news178458781.html"&gt;PhysOrg&lt;/a&gt;&lt;br /&gt;&lt;a href="http://story.birminghamstar.com/index.php/ct/9/cid/d805653303cbbba8/id/570549/cs/1/"&gt;Birmingham Star&lt;/a&gt;&lt;br /&gt;&lt;a href="http://story.albuquerqueexpress.com/index.php/ct/9/cid/a7925eab64637c1d/id/570549/cs/1/"&gt;Albuquerque Express&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.news.synavista.com/2009/11/building-real-security-with-virtual-worlds/"&gt;Syna Vista News&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.congoo.com/news/2009November27/Virtual-worlds-provide-real-security"&gt;Congoo&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.andhranews.net/Technology/2009/November/27-Virtual-worlds-provide-41813.asp"&gt;AndhraNews.net&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.newkerala.com/nkfullnews-1-159396.html"&gt;newKerala.com&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.khabarexpress.com/27/11/2009-153800/Virtual--worlds-will-provide-real-security-says--Indian--origin-scientist-news_119628.html"&gt;Khabar Express&lt;/a&gt;&lt;br /&gt;&lt;a href="http://in.news.yahoo.com/139/20091127/981/tsc-virtual-worlds-will-provide-real-sec.html"&gt;Yahoo! News&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.dailyindia.com/show/346599.php"&gt;DailyIndia.com&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.newstrackindia.com/newsdetails/135481"&gt;Newstrack India&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.thaindian.com/newsportal/health/virtual-worlds-will-provide-real-security-says-indian-origin-scientist_100280924.html"&gt;Thaindian News&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.dnaindia.com/scitech/report_virtual-worlds-will-provide-real-security-indian-origin-scientist_1317313"&gt;DNA Magazine&lt;/a&gt;&lt;br /&gt;&lt;a href="http://story.malaysiasun.com/index.php/ct/9/cid/d805653303cbbba8/id/570549/cs/1/"&gt;Malaysia Sun&lt;/a&gt;&lt;br /&gt;&lt;a href="http://blog.taragana.com/n/virtual-worlds-will-provide-real-security-says-indian-origin-scientist-236508/"&gt;Taragana.com&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.sindhtoday.net/news/1/76234.htm"&gt;Sindh Today&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.littleabout.com/news/46960,virtual-worlds-provide-real-security-indian-origin-scientist.html"&gt;LittleAbout&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.allbusiness.com/education-training/education-systems-institutions/13462770-1.html"&gt;AllBusiness&lt;/a&gt;&lt;br /&gt;&lt;a href="http://www.newsdesk.umd.edu/culture/release.cfm?ArticleID=2029"&gt;UMD Newsdesk&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-7248653462186466136?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/11/what-can-virtual-worlds-do-for-national.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-5921801103209259899</guid><pubDate>Thu, 05 Nov 2009 18:53:00 +0000</pubDate><atom:updated>2009-12-10T20:31:59.570-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>umd-secure</category><category domain='http://www.blogger.com/atom/ns#'>UMD</category><category domain='http://www.blogger.com/atom/ns#'>Secure wireless</category><category domain='http://www.blogger.com/atom/ns#'>Ubuntu</category><title>UMD Secure Wireless with Ubuntu</title><description>On the University of Maryland campus, staff and students have access to (at least) two campus-run wireless networks: &lt;i&gt;umd&lt;/i&gt; and &lt;i&gt;umd-secure&lt;/i&gt;.  Predictably, the &lt;i&gt;umd&lt;/i&gt; SSID is completely unencrypted, while &lt;i&gt;umd-secure&lt;/i&gt; sends data using WPA2 technology.  If you are on &lt;i&gt;umd&lt;/i&gt;, anyone with (widely available) wireless snooping tools installed can observe, or "sniff," your data.  This is bad!&lt;br /&gt;&lt;br /&gt;The University of Maryland provides Windows- and Mac-based instructions on how to connect to the secure &lt;i&gt;umd-secure&lt;/i&gt; SSID (&lt;a href="http://www.oit.umd.edu/nts/noc/wireless/connect.html"&gt;link&lt;/a&gt;).  However, their site neglects a third popular player in the campus OS battle: Ubuntu.&lt;br /&gt;&lt;br /&gt;If you would like to connect to &lt;i&gt;umd-secure&lt;/i&gt; using Ubuntu, use the following settings:&lt;br /&gt;&lt;br /&gt;&lt;i&gt;Security:&lt;/i&gt; WPA &amp; WPA2 Enterprise&lt;br /&gt;&lt;i&gt;Authentication:&lt;/i&gt; Tunneled TLS&lt;br /&gt;&lt;i&gt;Anonymous identity:&lt;/i&gt; anonymous&lt;br /&gt;&lt;i&gt;CA certificate:&lt;/i&gt; &lt;b&gt;see below&lt;/b&gt;&lt;br /&gt;&lt;i&gt;Inner authentication:&lt;/i&gt; PAP&lt;br /&gt;&lt;i&gt;Username:&lt;/i&gt; (Your Directory ID)&lt;br /&gt;&lt;i&gt;Password:&lt;/i&gt; (Your Directory Password)&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://gannon-house.com/blog/uploaded_images/umd-secure_settings-741260.png"&gt;&lt;img style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 247px; height: 320px;" src="http://gannon-house.com/blog/uploaded_images/umd-secure_settings-741258.png" border="0" alt="" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;To select the &lt;b&gt;CA Certificate&lt;/b&gt;, open the "Choose a Certificate Authority certificate..." dialog box.  Navigate to /etc/ssl/certs.  Select &lt;i&gt;Thawte_Premium_Server_CA.pem&lt;/i&gt;.  Press "Open."&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://gannon-house.com/blog/uploaded_images/umd-secure_CA-741335.png"&gt;&lt;img style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 320px; height: 258px;" src="http://gannon-house.com/blog/uploaded_images/umd-secure_CA-741331.png" border="0" alt="" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;If you are using an older version of Ubuntu, you may need to download the Thawte certificate from their &lt;a href="http://www.thawte.com/roots/"&gt;site&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;That's all there is to it!  If you'd like more information about what's going on, check out the following Wikipedia pages:&lt;br /&gt;&lt;br /&gt;WPA/WPA2 (&lt;a href="http://en.wikipedia.org/wiki/Wi-Fi_Protected_Access"&gt;link&lt;/a&gt;)&lt;br /&gt;Public-key Cryptography (&lt;a href="http://en.wikipedia.org/wiki/Public-key_cryptography"&gt;link&lt;/a&gt;)&lt;br /&gt;CA, or Certificate Authority (&lt;a href="http://en.wikipedia.org/wiki/Certificate_authority"&gt;link&lt;/a&gt;)&lt;br /&gt;&lt;br /&gt;&lt;i&gt;This post written from umd-secure on Ubuntu.&lt;/i&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-5921801103209259899?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/11/umd-secure-wireless-with-ubuntu.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-6975394731131962963</guid><pubDate>Sat, 31 Oct 2009 18:37:00 +0000</pubDate><atom:updated>2009-12-10T20:33:09.228-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>African early childhood development</category><category domain='http://www.blogger.com/atom/ns#'>LCCD</category><title>African ECD Report</title><description>&lt;span style="font-weight:bold;"&gt;African Early Childhood Development&lt;/span&gt;&lt;br /&gt;In contrast to many other fields of social and economic development, early childhood development (ECD) lacks a system of global indicators that include all key early childhood areas: education, nutrition, health, sanitation, and child rights and protection.&lt;br /&gt;&lt;br /&gt;We are working on meeting this urgent need for a worldwide ECD database, in conjunction with the &lt;a href="http://www.riseinstitute.org/"&gt;RISE Institute&lt;/a&gt; and the &lt;a href="http://www.ecdgroup.com/"&gt;Consultative Group for Early Childhood Care and Development&lt;/a&gt;.&lt;br /&gt;&lt;br /&gt;&lt;span style="font-weight:bold;"&gt;Initial Report&lt;/span&gt;&lt;br /&gt;We put together an initial report on 37 countries in Sub-Saharan Africa.  The printers just returned the first printing of this initial report.  I think it turned out pretty well!&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://gannon-house.com/uploads/african_ecd_book.jpg"&gt;&lt;img style="display:block; margin:0px auto 10px; text-align:center;cursor:pointer; cursor:hand;width: 319px; height: 350px;" src="http://gannon-house.com/uploads/african_ecd_book.jpg" border="0" alt="" /&gt;&lt;/a&gt;&lt;br /&gt;&lt;br /&gt;We are presenting this initial report at the Fourth African International Conference on Early Childhood Development in Dakar, Senegal on November 10-13, 2009.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-6975394731131962963?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/10/african-ecd-report.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-5346320317282963077</guid><pubDate>Tue, 27 Oct 2009 04:01:00 +0000</pubDate><atom:updated>2009-12-10T20:34:05.471-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Numb3rs</category><category domain='http://www.blogger.com/atom/ns#'>LCCD</category><category domain='http://www.blogger.com/atom/ns#'>SOMA</category><category domain='http://www.blogger.com/atom/ns#'>CAGE</category><title>LCCD on Primetime TV!</title><description>&lt;span style="font-weight: bold;"&gt;Numb3rs&lt;/span&gt;&lt;br /&gt;Our lab's work was featured on &lt;a href="http://en.wikipedia.org/wiki/Numb3rs"&gt;Numb3rs&lt;/a&gt;, a popular television crime drama.  The show directly references our SOMA (Stochastic Opponent Modeling Agent) system, which is at the heart of my &lt;a href="http://gannon-house.com/projects/cage.html"&gt;CAGE&lt;/a&gt; and &lt;a href="http://gannon-house.com/projects/cig.html"&gt;CIG&lt;/a&gt; projects.  Although the explanation was "spruced up" a bit for television, the show portrays the basic concept fairly accurately.  Exciting!&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Description of SOMA&lt;/b&gt;&lt;br /&gt;&lt;object height="340" width="560"&gt;&lt;param name="movie" value="http://www.youtube.com/v/Y9ydFrR8TVU&amp;amp;hl=en&amp;amp;fs=1&amp;amp;"&gt;&lt;param name="allowFullScreen" value="true"&gt;&lt;param name="allowscriptaccess" value="always"&gt;&lt;embed src="http://www.youtube.com/v/Y9ydFrR8TVU&amp;amp;hl=en&amp;amp;fs=1&amp;amp;" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" height="340" width="560"&gt;&lt;/embed&gt;&lt;/object&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Another Mention of SOMA&lt;/b&gt;&lt;br /&gt;&lt;object height="340" width="560"&gt;&lt;param name="movie" value="http://www.youtube.com/v/_f3P-LS_KPI&amp;amp;hl=en&amp;amp;fs=1&amp;amp;"&gt;&lt;param name="allowFullScreen" value="true"&gt;&lt;param name="allowscriptaccess" value="always"&gt;&lt;embed src="http://www.youtube.com/v/_f3P-LS_KPI&amp;amp;hl=en&amp;amp;fs=1&amp;amp;" type="application/x-shockwave-flash" allowscriptaccess="always" allowfullscreen="true" height="340" width="560"&gt;&lt;/embed&gt;&lt;/object&gt;&lt;br /&gt;&lt;br /&gt;&lt;b&gt;Episode Details&lt;/b&gt;&lt;br /&gt;&lt;span style="font-style: italic;"&gt;Air Date:&lt;/span&gt; 23 October 2009&lt;br /&gt;&lt;span style="font-style: italic;"&gt;Identifier:&lt;/span&gt; Season 6, Episode 5&lt;br /&gt;&lt;span style="font-style: italic;"&gt;Title:&lt;/span&gt; Hydra&lt;br /&gt;&lt;span style="font-style: italic;"&gt;Summary:&lt;/span&gt; The team attempts to rescue a kidnapped girl, but their involvement in the case brings up personal and moral issues for Liz, Amita and Charlie when they begin to suspect she might be one of the first human clones.  (&lt;a href="http://www.tv.com/numb3rs/show/25043/episode.html"&gt;source&lt;/a&gt;)&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-5346320317282963077?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/10/lccd-on-primetime-tv.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-3284340334882401381</guid><pubDate>Sun, 18 Oct 2009 18:31:00 +0000</pubDate><atom:updated>2009-12-10T20:35:41.656-05:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Asset Protection</category><category domain='http://www.blogger.com/atom/ns#'>LCCD</category><category domain='http://www.blogger.com/atom/ns#'>Protective Route Engine</category><category domain='http://www.blogger.com/atom/ns#'>AAMAS</category><title>Asset Protection</title><description>Finally submitted my first (real) academic paper this week, to the &lt;a href="http://www.cse.yorku.ca/AAMAS2010/"&gt;AAMAS&lt;/a&gt; (Autonomous Agents and Multi-Agent Systems) 2010 conference in Toronto.  Hopefully it will get accepted, although their roughly 20% acceptance rate does not bode well.&lt;br /&gt;&lt;br /&gt;&lt;b&gt;A Graph-Theoretic Approach to Protect Static and Moving Targets from Adversaries&lt;/b&gt;&lt;br /&gt;&lt;i&gt;J.P. Dickerson, G.I. Simari, V.S. Subrahmanian and Sarit Kraus&lt;/i&gt;&lt;br /&gt;&lt;blockquote&gt;&lt;br /&gt;The static asset protection problem (SAP) in a road network is that of allocating resources to protect vertices, given any possible behavior by an adversary determined to attack those assets.  The dynamic asset protection (DAP) problem is a version of SAP where the asset is following a fixed and widely known route (&lt;i&gt;e.g.&lt;/i&gt;, a parade route) and needs to be protected.  We formalize what it means for a given allocation of resources to be ``optimal'' for protecting a desired set of assets, and show that randomly allocating resources to a single edge cut in the road network solves this problem. We develop a polynomial time algorithm for SAP and experimentally show that it works effectively in practice. We also formalize DAP. Unlike SAP, we show that DAP is not only an NP-complete problem, but that approximating DAP is also NP-hard. We provide the GreedyDAP heuristic algorithm to solve DAP and show experimentally that it works well in practice, using road network data for real cities.&lt;br /&gt;&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;My (out of date) writeup on the project can be found &lt;a href="http://gannon-house.com/projects/adversarial.html"&gt;here&lt;/a&gt;.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-3284340334882401381?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2009/10/asset-protection.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-4682146298644900854</guid><pubDate>Fri, 05 Dec 2008 03:59:00 +0000</pubDate><atom:updated>2008-12-04T23:03:49.913-05:00</atom:updated><title>Star Trek: The Next Generation</title><description>The second iteration of the Star Trek series -- The Next Generation -- is perhaps the best television show I have ever seen.&lt;br /&gt;&lt;br /&gt;Although I saw a significant amount of it while growing up, viewing it again has brought back great memories while helping to make new ones.  The writing, characters, attention to scientific detail, and (dare I say it) general message of the show are all extremely appealing.&lt;br /&gt;&lt;br /&gt;If you have not experienced TNG, do so!  It is . . . wonderful.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-4682146298644900854?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/12/star-trek-next-generation.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-9012944211885016775</guid><pubDate>Fri, 18 Jul 2008 16:41:00 +0000</pubDate><atom:updated>2008-09-04T20:54:50.133-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Neil Gaiman</category><category domain='http://www.blogger.com/atom/ns#'>Analogy</category><category domain='http://www.blogger.com/atom/ns#'>Neverwhere</category><category domain='http://www.blogger.com/atom/ns#'>Love</category><title></title><description>&lt;span style="font-style: italic;"&gt;Neil Gaiman's &lt;span style="font-weight: bold;"&gt;Neverwhere&lt;/span&gt;.  Page 74.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;Mr. Vandemar slid his knife back into the holster in his sleeve.  He put his coat on as well, pushed his hands deep into the pockets, and was pleasantly surprised to find an almost untouched mouse in one pocket.  Good.  He was hungry.  Then he pondered Mr. Croup's last statement with the intensity of an anatomist dissecting his one true love, and, realizing the flaw in his partner's logic, Mr. Vandemar said, "We don't need bodyguards, Mister Croup.  We hurt people.  We don't get hurt."&lt;/blockquote&gt;The description of Mr. Vandemar's thinking matches his character perfectly: steady, methodical, and devoid of normal emotion.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-9012944211885016775?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/07/neil-gaimans-neverwhere.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>3</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-3095473893690349397</guid><pubDate>Wed, 18 Jun 2008 04:44:00 +0000</pubDate><atom:updated>2008-06-18T00:51:40.495-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Enchantment</category><category domain='http://www.blogger.com/atom/ns#'>Academia</category><category domain='http://www.blogger.com/atom/ns#'>Orson Scott Card</category><title></title><description>&lt;span style="font-style: italic;"&gt;Orson Scott Card's &lt;span style="font-weight: bold;"&gt;Enchantment&lt;/span&gt;.  Page 134.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;That's what Ivan had to face about himself.  The life he had chosen was a cocoon.  Surrounded by a web of old manuscripts and scholarly papers, he would achieve tenure, publish frequently, teach a group of carefully selected graduate students, be treated like a celebrity by the handful of people who had the faintest idea who he was, and go to his grave deluded into thinking he had achieved greatness while in fact he had stayed in school all his life.&lt;/blockquote&gt;I smell bias, Orson Scott Card --  I smell bias.  Card spent a year as a graduate student at Notre Dame after his mission in Brazil and subsequent graduation from Brigham Young University.&lt;br /&gt;&lt;br /&gt;Still, the man has a point.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-3095473893690349397?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/orson-scott-cards-enchantment.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-671800506855715509</guid><pubDate>Tue, 10 Jun 2008 02:40:00 +0000</pubDate><atom:updated>2008-06-09T22:56:21.180-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Jack Kerouac</category><category domain='http://www.blogger.com/atom/ns#'>Police</category><category domain='http://www.blogger.com/atom/ns#'>On The Road</category><category domain='http://www.blogger.com/atom/ns#'>Law</category><title></title><description>&lt;span style="font-style: italic;"&gt;Jack Kerouac's &lt;span style="font-weight: bold;"&gt;On The Road&lt;/span&gt;.  Page 137.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;The American police are involved in psychological warfare against those Americans who don't frighten them with imposing papers and threats.  It's a Victorian police force; it peers out of musty windows and wants to inquire about everything, and can make crimes if the crimes don't exist to its satisfaction.&lt;/blockquote&gt;It's disheartening that this is even more true now than it was fifty years ago.  It's hardly considered out of the ordinary to keep video and audio surveillance in a vehicle, for use in the event of a run-in with the so-called law.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-671800506855715509?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/jack-kerouacs-on-road_09.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-1846594155496532644</guid><pubDate>Tue, 10 Jun 2008 01:30:00 +0000</pubDate><atom:updated>2008-06-09T21:38:52.653-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Jack Kerouac</category><category domain='http://www.blogger.com/atom/ns#'>On The Road</category><title></title><description>&lt;span style="font-style: italic;"&gt;Jack Kerouac's &lt;span style="font-weight: bold;"&gt;On The Road&lt;/span&gt;.  Page 127.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;He had more books than I've ever seen in all my life -- two libraries, two rooms loaded from floor to ceiling around all four walls, and such books as the Apocryphal Something-or-Other in ten volumes.  He played Verdi operas and pantomimed them in his pajamas with a great rip down the back.  He didn't give a damn about anything.  He is a great scholar who goes reeling down the New York waterfront with original seventeenth-century musical manuscripts under his arm, shouting.  He crawls like a big spider through the streets.  His excitement blew out of his eyes in stabs of fiendish light.  He rolled his neck in spastic ecstasy.  He lisped, he writhed, he flopped, he moaned, he howled, he fell back in despair.  He could hardly get a word out, he was so excited with life.&lt;/blockquote&gt;Jack Kerouac's amazement with life bleeds through the page in every description of every character - and there are many of these - in this stream of consciousness chronicle of a few years of his life.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-1846594155496532644?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/jack-kerouacs-on-road.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-3570614931285992077</guid><pubDate>Fri, 06 Jun 2008 01:41:00 +0000</pubDate><atom:updated>2008-06-09T21:39:14.659-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Science</category><category domain='http://www.blogger.com/atom/ns#'>Thomas More</category><category domain='http://www.blogger.com/atom/ns#'>Utopia</category><category domain='http://www.blogger.com/atom/ns#'>Religion</category><title></title><description>&lt;span style="font-style: italic;"&gt;St. Thomas More's &lt;span style="font-weight: bold;"&gt;Utopia&lt;/span&gt;, translated by Paul Turner.  Page 81.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;And, as they see it, the scientific investigation of nature is not only a most enjoyable process, but also the best possible method of pleasing the Creator.&lt;br /&gt;For they assume that He has the normal reactions of an artist.  Having put the marvelous system of the universe on show for human beings to look at - since no other species is capable of taking it in - He must prefer the type of person who examines it carefully, and really admires His work, to the type that just ignores it and like the lower animals remains quite unimpressed by the whole astonishing spectacle.&lt;/blockquote&gt;In the immortal words of Bill Nye the Science Guy -- Science Rules!  In a time when the Church and Crown were at odds with the scientific community (this, obviously, is no longer the case . . .), Thomas More's fictional friend gives a simple, yet easily palatable argument as to why we should indulge our natural curiosity.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-3570614931285992077?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/st_05.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-3457440388295098035</guid><pubDate>Wed, 04 Jun 2008 16:03:00 +0000</pubDate><atom:updated>2008-06-09T21:39:39.446-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Neil Gaiman</category><category domain='http://www.blogger.com/atom/ns#'>Four Horsemen of the Apocalypse</category><category domain='http://www.blogger.com/atom/ns#'>Terry Pratchett</category><category domain='http://www.blogger.com/atom/ns#'>Good Omens</category><title></title><description>&lt;span style="font-style: italic;"&gt;Terry Pratchett and Neil Gaiman's &lt;span style="font-weight: bold;"&gt;Good Omens: The Nice and Accurate Prophecies of Agnes Nutter, Witch&lt;/span&gt;.&lt;/span&gt;&lt;br /&gt;&lt;blockquote&gt;Now white and brown sculptures of foam and sludge drifted serenely down the river, often covering it for yards at a stretch. And where the surface of the water was visible it was covered with a molecules-thin petrochemical sheen.&lt;br /&gt;There was a loud whirring as a couple of geese, thankful to be back in England again after the long, exhausting flight across the Northern Atlantic, landed on the rainbow-slicked water, and sank without a trace.&lt;/blockquote&gt;The Four Horsemen of the Apocalypse -- War, Famine, Pollution (Pestilence retired in the 1930s post-discovery of penicillin), and Death -- are preparing to ride per the Book of Revelation.  Pollution's introduction occurs on the banks of the river mentioned above, while the quotation refers to his nearly romantic view of contamination and waste.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-3457440388295098035?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/terry-pratchett-and-neil-gaimans-good.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-5750376782284646140.post-5813067295217071272</guid><pubDate>Tue, 03 Jun 2008 18:57:00 +0000</pubDate><atom:updated>2008-06-09T21:40:02.294-04:00</atom:updated><category domain='http://www.blogger.com/atom/ns#'>Thomas More</category><category domain='http://www.blogger.com/atom/ns#'>Utopia</category><category domain='http://www.blogger.com/atom/ns#'>Politics</category><title></title><description>&lt;span style="font-style: italic;"&gt;St. Thomas More's &lt;span style="font-weight: bold;"&gt;Utopia&lt;/span&gt;, translated by Paul Turner.  Page 86&lt;/span&gt;.&lt;br /&gt;&lt;blockquote&gt;But anyone who deliberately tries to get himself elected to public office is permanently disqualified from holding one.&lt;/blockquote&gt;Sure, the book's either an advertisement for Catholicism or thinly veiled communist propaganda (St. More is the only Christian to be honored with a statue at the Kremlin, courtesy Lenin), but I can't help but feel that this statement -- one of the core rules of his fictional Utopia -- holds some bearing in our current times.&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5750376782284646140-5813067295217071272?l=blog.gannon-house.com' alt='' /&gt;&lt;/div&gt;</description><link>http://blog.gannon-house.com/2008/06/st.html</link><author>noreply@blogger.com (John Dickerson)</author><thr:total>0</thr:total></item></channel></rss>
