<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/" >
   <channel>
    <atom:link href="http://littlemonsterrocket.webnode.com/rss/all.xml" rel="self" type="application/rss+xml" />
      <title><![CDATA[littlemonsterrocket.com]]></title>
      <link>http://littlemonsterrocket.webnode.com/archive/news/</link>
      <description></description>
      <language>en</language>
      <pubDate>Tue, 15 Jun 2010 23:59:00 +0200</pubDate>
      <lastBuildDate>Tue, 15 Jun 2010 23:59:00 +0200</lastBuildDate>
      <category><![CDATA[Information]]></category>
      <category><![CDATA[Disclaimer]]></category>
      <category><![CDATA[News]]></category>
      <category><![CDATA[Blog]]></category>
      <category><![CDATA[QND:  Disclaimer]]></category>
      <docs>http://blogs.law.harvard.edu/tech/rss</docs>
      <generator>Rubicus v2.0</generator>
      <managingEditor><![CDATA[lmr2010@live.com (lmr2010@live.com)]]></managingEditor>
      <webMaster><![CDATA[lmr2010@live.com (lmr2010@live.com)]]></webMaster>
      <item>
         <title><![CDATA[QND Disclaimer]]></title>
         <link>http://www.littlemonsterrocket.com/news/qnd-disclaimer1/</link>
         <description><![CDATA[Important Notice and Legal Disclaimer:

&#160;
Neither LMR, it's affiliates, nor I guarantee the accuracy, adequacy, completeness or availability of any information; this includes any errors or omissions or for the results obtained from the use of such information. WE PROVIDE NO EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE OR USE. In no event shall LMR, it's affiliates, nor I be liable for any indirect,...]]></description>
         <pubDate>Tue, 15 Jun 2010 23:59:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/qnd-disclaimer1/</guid>
         <category>Information</category>
      </item>
      <item>
         <title><![CDATA[QND Disclaimer]]></title>
         <link>http://www.littlemonsterrocket.com/news/qnd-disclaimer/</link>
         <description><![CDATA[Important Notice and Legal Disclaimer

&#160;
Neither LMR, it's affiliates, nor I guarantee the accuracy, adequacy, completeness or availability of any information; this includes any errors or omissions or for the results obtained from the use of such information. WE PROVIDE NO EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, ANY WARRANTIES OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE OR USE. In no event shall LMR, it's affiliates, nor I be liable for any indirect,...]]></description>
         <pubDate>Tue, 15 Jun 2010 23:56:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/qnd-disclaimer/</guid>
         <category>Disclaimer</category>
      </item>
      <item>
         <title><![CDATA[LMR: News and Updates]]></title>
         <link>http://www.littlemonsterrocket.com/news/lmr-news-and-updates/</link>
         <description><![CDATA[Blog Entries:

&#160;
“The Numbers Game of the N-Prize, Quick and Dirty Feasibility Overview/Simulator, and a $1000 Challenge!”
www.littlemonsterrocket.com/news/the-numbers-game-of-the-n-prize-quick-and-dirty-feasibility-overview-simulator-and-a-1000-challenge-/

&#160;

&#160;
“Development Plans”
www.littlemonsterrocket.com/news/development-plans/

&#160;

&#160;
“Overview of the LMR N-Prize Approach”
www.littlemonsterrocket.com/news/overview-of-the-lmr-n-prize-approach/

&#160;

&#160;
Be...]]></description>
         <pubDate>Tue, 15 Jun 2010 23:33:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/lmr-news-and-updates/</guid>
         <category>News</category>
      </item>
      <item>
         <title><![CDATA[The Numbers Game of the N-Prize, Quick and Dirty Feasibility Overview/Simulator, and a $1000 Challenge!]]></title>
         <link>http://www.littlemonsterrocket.com/news/the-numbers-game-of-the-n-prize-quick-and-dirty-feasibility-overview-simulator-and-a-1000-challenge-/</link>
         <description><![CDATA[Those of you who’ve read my earlier blog entry “Overview of the LMR N-Prize Approach”&#160; (www.littlemonsterrocket.com/news/overview-of-the-lmr-n-prize-approach/)&#160;might be interested in the details of how my decisions and estimates were arrived at. I'm going to cover some of that thought process here; this will hopefully (also) shed some insight into the basic first-pass design of a multistage rocket system.

&#160;
This is informal, and there are many ways to approach the problem. The...]]></description>
         <pubDate>Tue, 15 Jun 2010 23:12:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/the-numbers-game-of-the-n-prize-quick-and-dirty-feasibility-overview-simulator-and-a-1000-challenge-/</guid>
         <category>Blog</category>
      </item>
      <item>
         <title><![CDATA[Development Plans]]></title>
         <link>http://www.littlemonsterrocket.com/news/development-plans/</link>
         <description><![CDATA[Regarding my earlier blog entry on the LMR overview&#160; ("Overview of the LMR N-Prize Approach," www.littlemonsterrocket.com/news/overview-of-the-lmr-n-prize-approach/), I thought I would briefly outline how I intend to develop it.

&#160;
It's a reasonably sized task, separable into various parts and phases – all which are manageable by a capable entity (that is, given enough time and bandwidth).

&#160;
To start, I'm constructing the third stage first (this is currently in progress). Once...]]></description>
         <pubDate>Sun, 23 May 2010 16:09:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/development-plans/</guid>
         <category>Blog</category>
      </item>
      <item>
         <title><![CDATA[Overview of the LMR N-Prize Approach]]></title>
         <link>http://www.littlemonsterrocket.com/news/overview-of-the-lmr-n-prize-approach/</link>
         <description><![CDATA[The approach we're taking is one based on my personal experience and research; it's not the only way to accomplish the N-Prize, but in my opinion it is the most straightforward, most expedient, and lowest cost.

&#160;
Some of you have already gathered high-level insight into our plans; even if you hadn't followed the original N-Prize forum, there is enough information in the FAQ (and interview) to provide a reasonable outline. For those who haven't yet read the FAQ, we'll cover the basics of...]]></description>
         <pubDate>Sun, 23 May 2010 10:05:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/overview-of-the-lmr-n-prize-approach/</guid>
         <category>Blog</category>
      </item>
      <item>
         <title><![CDATA[Space Fellowship Interview]]></title>
         <link>http://www.littlemonsterrocket.com/news/space-fellowship-interview/</link>
         <description><![CDATA[spacefellowship.com/news/art7600/little-monster-rocket-q-amp-a-with-the-space-fellowship.html]]></description>
         <pubDate>Sun, 04 Jan 2009 12:50:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/space-fellowship-interview/</guid>
         <category>News</category>
      </item>
      <item>
         <title><![CDATA[Is the N-Prize Possible?]]></title>
         <link>http://www.littlemonsterrocket.com/news/is-the-n-prize-possible/</link>
         <description><![CDATA[It has has been discussed on both the Space Fellowship site and even the N-Prize Forum that the N-Prize is somehow “impossible.”&#160; This is false.
&#160;
First, we must acknowledge historically that claims of impossibility have generally been met with embarrassing outcomes for the claimant; it is redundant to rehash the list of what was once thought impossible which we now take for granted, and I think such things are quite self-evident.
&#160;
Second, we must acknowledge that the general...]]></description>
         <pubDate>Mon, 03 Nov 2008 16:13:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/is-the-n-prize-possible/</guid>
         <category>Blog</category>
      </item>
      <item>
         <title><![CDATA[N-Prize]]></title>
         <link>http://www.littlemonsterrocket.com/news/n-prize/</link>
         <description><![CDATA[LMR is proud to announce our entry into the N-Prize competition.
&#160;
The N-Prize&#160;puts forth&#160;a nearly impossible task:
Send a 9.99g-19.99g satellite into orbit -- it must be proven to complete at least 9 orbits. Launch cost (minus ground facilities) must be under £999.99. The first person to accomplish this before 19:19:09 (GMT) September 19, 2011, is the victor – and with it, an important claim to history...
&#160;
Now, we've all heard the old adage: “faster, cheaper, better – pick...]]></description>
         <pubDate>Mon, 20 Oct 2008 01:04:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/n-prize/</guid>
         <category>News</category>
      </item>
      <item>
         <title><![CDATA[Website]]></title>
         <link>http://www.littlemonsterrocket.com/news/visitors-notice/</link>
         <description><![CDATA[Website launched!&#160; Check back frequently for updates...]]></description>
         <pubDate>Thu, 16 Oct 2008 22:17:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/visitors-notice/</guid>
         <category>News</category>
      </item>
      <item>
         <title><![CDATA[The Little Monster Rocket]]></title>
         <link>http://www.littlemonsterrocket.com/news/first-blog/</link>
         <description><![CDATA[Welcome!]]></description>
         <pubDate>Thu, 16 Oct 2008 22:16:00 +0200</pubDate>
         <guid isPermaLink="true">http://www.littlemonsterrocket.com/news/first-blog/</guid>
         <category>Blog</category>
      </item>
   </channel>
</rss>