<?xml version="1.0" encoding="UTF-8" ?>
<?xml-stylesheet type="text/xsl" href="http://blogs.msdn.com/utility/FeedStylesheets/rss.xsl" media="screen"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:wfw="http://wellformedweb.org/CommentAPI/"><channel><title>Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx</link><description>Want to prove that you are the best programmer money can buy? (OK, I know you are not for sale, but your boss may need a friendly reminder that it's time for your next big raise.) Here's your chance: On a telephone keypad, the number keys 2 -- 9 also</description><dc:language>en-US</dc:language><generator>CommunityServer 2.1 SP1 (Build: 61025.2)</generator><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#102141</link><pubDate>Tue, 30 Mar 2004 06:33:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:102141</guid><dc:creator>Joe Lisp User</dc:creator><description>This is pretty similar to the programming problem that was used to compare Java to C/C++ (and later to Lisp) a few years ago:&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://www.norvig.com/java-lisp.html"&gt;http://www.norvig.com/java-lisp.html&lt;/a&gt;</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#102155</link><pubDate>Tue, 30 Mar 2004 06:58:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:102155</guid><dc:creator>Anonymous</dc:creator><description>I didn't see you mentioning payment or a prize? Do you expect someone doing your job for free? :-)</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#102181</link><pubDate>Tue, 30 Mar 2004 08:17:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:102181</guid><dc:creator>the1</dc:creator><description>Dear Joe,&lt;br&gt;&lt;br&gt;Thanks for the pointer!  I wasn't aware that there was a similar contest.  But we shouldn't let that take away the fun, should we?  Let's try to beat Norvig!&lt;br&gt;&lt;br&gt;Dear Anonymous,&lt;br&gt;&lt;br&gt;By winning the contest, you gain unlimited bragging right.  Didn't I also mention your boss's reaction?  Come on, there is no excuse for not doing it. :-)</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#103346</link><pubDate>Tue, 30 Mar 2004 15:31:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:103346</guid><dc:creator>senkwe</dc:creator><description>Hey, isn't including numbers in the phrase a cop out? eg &amp;quot;nice-9-in-fox&amp;quot;. Shoudn't there be a few constraints on how many numbers are allowed in the phrase?</description></item><item><title>Another clear code challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#103491</link><pubDate>Tue, 30 Mar 2004 20:08:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:103491</guid><dc:creator>jaybaz_MS's WebLog</dc:creator><description /></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#103492</link><pubDate>Tue, 30 Mar 2004 20:10:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:103492</guid><dc:creator>the1</dc:creator><description>Dear Senkwe,&lt;br&gt;&lt;br&gt;Let's keep it simple.  For now I don't care how many numbers you use in the phrase.  The idea is to get ALL different ways to phrase your phone number.  Additional constraints (e.g. 3 digits allowed at most) can aways be added later to filter the result.  The principle of modular programming says we should do only ONE thing (and do it well) in one module.</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#103785</link><pubDate>Tue, 30 Mar 2004 21:09:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:103785</guid><dc:creator>B.Y.</dc:creator><description>OK, I have a question. When you say &amp;quot;how clear the code is&amp;quot;, does the word code mean code only, or code and comment ? If I have the following two entries:&lt;br&gt;&lt;br&gt;*entry A: simple code without comment.&lt;br&gt;*entry B: slightly more complex code than A, but it has a ton of comments to make it easier to understand.&lt;br&gt;&lt;br&gt;which entry is considered better in this contest ?&lt;br&gt;&lt;br&gt;&lt;br&gt;&lt;br&gt;</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#104087</link><pubDate>Tue, 30 Mar 2004 22:38:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:104087</guid><dc:creator>the1</dc:creator><description>Dear B.Y.,&lt;br&gt;&lt;br&gt;You are really serious about this. :-) This is a contest for clear code.  While good comments are important, they are not the focus.  (Actually often I don't trust comments, because I've seen so many cases when they are out of sync with what the code really does -- programmers always update the code and forget to change the comments accordingly).&lt;br&gt;&lt;br&gt;Good code should be clear on itself and require few comments.  Bad comments are worse than no comments at all.  I hate people writing comments just for comments' sake, e.g.&lt;br&gt;&lt;br&gt;  a++; // increase the value of a by 1&lt;br&gt;&lt;br&gt;In your example, A will be preferred -- as long as it can be easily understood without comment.&lt;br&gt;&lt;br&gt;Finally, I don't want to pretend being an authority on code clarity.    There is no judge for this contest. :-)  The whole purpose of this chanllenge is to have some fun and learn from each others' different angles of solving problems.  (OK, I lied about the big raise, but if we learn something from this, it can be applied to get us closer to the raise.)</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#104160</link><pubDate>Tue, 30 Mar 2004 23:57:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:104160</guid><dc:creator>Jay Bazuzi [MS]</dc:creator><description>Here are some thoughts on comments: &lt;a target="_new" href="http://weblogs.asp.net/jaybaz_ms/archive/2004/03/22/94066.aspx"&gt;http://weblogs.asp.net/jaybaz_ms/archive/2004/03/22/94066.aspx&lt;/a&gt;&lt;br&gt;&lt;br&gt;If your code can't be understood without comments, then either add them or simplify.  (Doing neither is bad!)</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#104930</link><pubDate>Wed, 31 Mar 2004 20:28:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:104930</guid><dc:creator>CalvinH [MS]</dc:creator><description>My boss forwarded me this blog&amp;lt;g&amp;gt;&lt;br&gt;&lt;br&gt;I have a 100 line solution (with comments) not written in C++. It uses a 53000 word dictionary and does not have much optimization, although I have an optimized version too.&lt;br&gt;&lt;br&gt;How should I submit this entry? Should I just post it here?&lt;br&gt;&lt;br&gt;thanks</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#104935</link><pubDate>Wed, 31 Mar 2004 20:37:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:104935</guid><dc:creator>the1</dc:creator><description>Dear Calvin,&lt;br&gt;&lt;br&gt;Wow, the first entry!  Congratulations!&lt;br&gt;&lt;br&gt;You can either post the code here, or put it on your own blog (if you have one or want to create one) and provide a link.&lt;br&gt;&lt;br&gt;If you post it here, the format and indentation will be lost. :-(  Let's see how it looks, and if necessary, you can email me (Zhanyong Wan) the code and I'll post it in its original format.&lt;br&gt;&lt;br&gt;Also, can you provide a link to your dictionary so others can also use it?  Thanks!</description></item><item><title>Word games with phone numbers: 1-800-RESULTS</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105160</link><pubDate>Thu, 01 Apr 2004 03:19:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105160</guid><dc:creator>VS DATA Team's WebLog</dc:creator><description /></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105162</link><pubDate>Thu, 01 Apr 2004 03:23:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105162</guid><dc:creator>CalvinH [MS]</dc:creator><description>Here's a link to the programming challenge solution on my blog. It also includes a link to the dictionary I used.&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx"&gt;http://blogs.msdn.com/vsdata/archive/2004/03/31/105159.aspx&lt;/a&gt;&lt;br&gt;</description></item><item><title>Word games with phone numbers: 1-800-RESULTS (by Calvin)</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105224</link><pubDate>Thu, 01 Apr 2004 05:29:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105224</guid><dc:creator>VS DATA Team's WebLog</dc:creator><description /></item><item><title>First entry to my programming challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105887</link><pubDate>Thu, 01 Apr 2004 23:43:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105887</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105919</link><pubDate>Fri, 02 Apr 2004 00:45:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105919</guid><dc:creator>Justin Rogers</dc:creator><description>I made some changes to the algorithm by cutting out single character responses.  I don't bother placing the dashes in since I don't think they are uber important, but I could put that feature back in if necessary.  The code is hosted on.&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://weblogs.asp.net/justin_rogers/articles/105916.aspx"&gt;http://weblogs.asp.net/justin_rogers/articles/105916.aspx&lt;/a&gt;&lt;br&gt;&lt;br&gt;I'm using the cheapo dictionary for now, and I've done 0 optimizations.  The only true optimization is in the switch table.&lt;br&gt;&lt;br&gt;One thing to note.  You can really optimize the algorithm in the case that a 1 or 2 somehow bisects the numbers.  When you do this, you only have to process two substrings, reinserting the splitting character where necessary.  This can result in a huge performance gain.  However, a good deal of the numbers you would process don't contain a 1 or a 0, and so the perf gain is lost.</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105923</link><pubDate>Fri, 02 Apr 2004 00:55:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105923</guid><dc:creator>Justin Rogers</dc:creator><description>And my algorithm isn't properly convergent either, so I'm not yet completed.&lt;br&gt;</description></item><item><title>Entries to my programming challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#105985</link><pubDate>Fri, 02 Apr 2004 02:28:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:105985</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>Another entry to the phraser programming contest</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#106231</link><pubDate>Fri, 02 Apr 2004 12:11:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106231</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>My own solution to my programming challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#106693</link><pubDate>Fri, 02 Apr 2004 23:00:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106693</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>Phone Number Conversion Challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#106741</link><pubDate>Fri, 02 Apr 2004 23:46:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106741</guid><dc:creator>Ken Robertson's Blog</dc:creator><description /></item><item><title>Phone Number Conversion Challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#106756</link><pubDate>Fri, 02 Apr 2004 23:47:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:106756</guid><dc:creator>Ken Robertson's Blog</dc:creator><description /></item><item><title>Solutions to the Phraser programming challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#108703</link><pubDate>Wed, 07 Apr 2004 02:50:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108703</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>Solutions to the Phraser programming challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#108709</link><pubDate>Wed, 07 Apr 2004 02:50:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108709</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>One more entry to the Phaser challenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#108718</link><pubDate>Wed, 07 Apr 2004 02:55:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108718</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>A JScript entry to the Phaser chanllenge</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#108745</link><pubDate>Wed, 07 Apr 2004 03:48:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108745</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>My entry to the Phraser compo</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#108952</link><pubDate>Wed, 07 Apr 2004 12:31:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:108952</guid><dc:creator>Frans Bouma's blog</dc:creator><description /></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109043</link><pubDate>Wed, 07 Apr 2004 14:56:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109043</guid><dc:creator>Nick Berardi</dc:creator><description>&amp;quot;Nice&amp;quot; isn't in the dictionary list that you provided.</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109052</link><pubDate>Wed, 07 Apr 2004 15:05:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109052</guid><dc:creator>Nick Berardi</dc:creator><description>neither is &amp;quot;in&amp;quot;, &amp;quot;win&amp;quot;, or &amp;quot;fox&amp;quot;.  just to let everybody know for testing purposes.</description></item><item><title>Programming Challenge: Phraser </title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109149</link><pubDate>Wed, 07 Apr 2004 20:27:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109149</guid><dc:creator>Nick Berardi's Blog</dc:creator><description /></item><item><title>Programming Challenge: Phraser </title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109165</link><pubDate>Wed, 07 Apr 2004 20:40:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109165</guid><dc:creator>Nick Berardi's Blog</dc:creator><description /></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109169</link><pubDate>Wed, 07 Apr 2004 17:48:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109169</guid><dc:creator>Nick Berardi</dc:creator><description>Here is my submission for the contest.  You can find the code at &lt;a target="_new" href="http://blog.zigamorph.com/Default.aspx/archive/2004/04/07/158.aspx"&gt;http://blog.zigamorph.com/Default.aspx/archive/2004/04/07/158.aspx&lt;/a&gt;&lt;br&gt;&lt;br&gt;In addition you just need to take the word is in this blog and add &amp;quot;nice&amp;quot;, &amp;quot;in&amp;quot;, &amp;quot;win&amp;quot;, and &amp;quot;fox&amp;quot;.  Then name it &amp;quot;Dictionary.txt&amp;quot; and put it in the same directory as your program.&lt;br&gt;&lt;br&gt;Have fun and if you find any bugs please submit it to my blog for the code.&lt;br&gt;&lt;br&gt;For all of you that want to know how long this too, it took about 3 hours to wrap my mind around the problem and code it.  So please forgive spelling errors.&lt;br&gt;&lt;br&gt;Thanks, Nick</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109177</link><pubDate>Wed, 07 Apr 2004 18:03:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109177</guid><dc:creator>Nick Berardi</dc:creator><description>Oh one more thing.  In you original post you mentioned that there was 160 solutions for the number 6423946369 but my program returns 228 possible solutions.  I have verified all the data am I missing something in my program?  Anybody see an error, or was there an error with the original dataset?</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109257</link><pubDate>Wed, 07 Apr 2004 20:06:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109257</guid><dc:creator>the1</dc:creator><description>Nick,&lt;br&gt;&lt;br&gt;Your result list is bigger because your word list contains &amp;quot;ox&amp;quot;, which mine doesn't have.</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109597</link><pubDate>Thu, 08 Apr 2004 06:03:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109597</guid><dc:creator>Mike</dc:creator><description>Here is my entry to the challenge:&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://zert.net/blog/2004/04/07/programming_challenge_phraser.html"&gt;http://zert.net/blog/2004/04/07/programming_challenge_phraser.html&lt;/a&gt;</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109904</link><pubDate>Thu, 08 Apr 2004 16:29:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109904</guid><dc:creator>Nick Berardi</dc:creator><description>Ah..&lt;br&gt;&lt;br&gt;That makes more sense, I had to add that to get one of the 4 results you had listed above.</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#109916</link><pubDate>Thu, 08 Apr 2004 16:40:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:109916</guid><dc:creator>Nick Berardi</dc:creator><description>Hey Mike,&lt;br&gt;&lt;br&gt;Nice easy solution to look at.  But what dictionary did you use.  Because the one I got off the site above doesn't seem to work.  Well at least there seems to be a loop that never ends?</description></item><item><title>re: Programming Challenge: Phraser</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#110500</link><pubDate>Fri, 09 Apr 2004 17:24:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:110500</guid><dc:creator>Brian C Robinson</dc:creator><description>Ok, here's my beautifully innefficient but correct and clear solution:&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://www.herassmygod.org/bcr19374/programming/Phraser/Phraser.py"&gt;http://www.herassmygod.org/bcr19374/programming/Phraser/Phraser.py&lt;/a&gt;&lt;br&gt;&lt;br&gt;Tests available here:&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://www.herassmygod.org/bcr19374/programming/Phraser/PhraserTest.py"&gt;http://www.herassmygod.org/bcr19374/programming/Phraser/PhraserTest.py&lt;/a&gt;&lt;br&gt;&lt;br&gt;And an example of using the class (assuming words.txt in the current directory is a text file with one word per line, as the example stated in the problem):&lt;br&gt;&lt;br&gt;&lt;a target="_new" href="http://www.herassmygod.org/bcr19374/programming/Phraser/PhraserRun.py"&gt;http://www.herassmygod.org/bcr19374/programming/Phraser/PhraserRun.py&lt;/a&gt;</description></item><item><title>Programming in XSLT!</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#217978</link><pubDate>Sat, 21 Aug 2004 00:31:00 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:217978</guid><dc:creator>the1's WebLog</dc:creator><description /></item><item><title>historic black colleges in atlanta ga</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#4870660</link><pubDate>Wed, 12 Sep 2007 00:35:16 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:4870660</guid><dc:creator>historic black colleges in atlanta ga</dc:creator><description>&lt;p&gt;historic black colleges in atlanta ga&lt;/p&gt;
</description></item><item><title>foxpro.catalyst       ??  &amp;raquo; Blog Archive   &amp;raquo; NF . Channel9</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#6122910</link><pubDate>Mon, 12 Nov 2007 04:02:40 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:6122910</guid><dc:creator>foxpro.catalyst       ??  » Blog Archive   » NF . Channel9</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://foxpro.ntsl119.com/scr/archives/129"&gt;http://foxpro.ntsl119.com/scr/archives/129&lt;/a&gt;&lt;/p&gt;
</description></item><item><title> the1 s WebLog Programming Challenge Phraser | Paid Surveys</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#9683960</link><pubDate>Tue, 02 Jun 2009 09:58:15 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9683960</guid><dc:creator> the1 s WebLog Programming Challenge Phraser | Paid Surveys</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://paidsurveyshub.info/story.php?id=28338"&gt;http://paidsurveyshub.info/story.php?id=28338&lt;/a&gt;&lt;/p&gt;
</description></item><item><title> the1 s WebLog Programming Challenge Phraser | debt solutions</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#9757153</link><pubDate>Tue, 16 Jun 2009 03:56:19 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9757153</guid><dc:creator> the1 s WebLog Programming Challenge Phraser | debt solutions</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://debtsolutionsnow.info/story.php?id=9789"&gt;http://debtsolutionsnow.info/story.php?id=9789&lt;/a&gt;&lt;/p&gt;
</description></item><item><title> the1 s WebLog Programming Challenge Phraser | low cost car insurance</title><link>http://blogs.msdn.com/the1/archive/2004/03/29/102123.aspx#9766148</link><pubDate>Wed, 17 Jun 2009 07:50:45 GMT</pubDate><guid isPermaLink="false">91d46819-8472-40ad-a661-2c78acb4018c:9766148</guid><dc:creator> the1 s WebLog Programming Challenge Phraser | low cost car insurance</dc:creator><description>&lt;p&gt;PingBack from &lt;a rel="nofollow" target="_new" href="http://lowcostcarinsurances.info/story.php?id=5292"&gt;http://lowcostcarinsurances.info/story.php?id=5292&lt;/a&gt;&lt;/p&gt;
</description></item></channel></rss>