Comments for Nerdland http://nerdland.net Computer Science, Programming, and All Points Beyond Thu, 15 Jul 2010 12:47:41 +0000 hourly 1 http://wordpress.org/?v=3.0 Comment on Nerdland is Moving by Tyler McHenry http://nerdland.net/2010/07/nerdland-is-moving/comment-page-1/#comment-5525 Tyler McHenry Thu, 15 Jul 2010 12:47:41 +0000 http://nerdland.net/?p=511#comment-5525 I actually wasn't planning to put the ANO site back up, since it hasn't been accessed more than a handful of times in years, and hasn't been updated in even more years (the last update was in 2002). But if there's any info or pictures you want from the gallery, drop me an e-mail and I'll send them to you. I actually wasn’t planning to put the ANO site back up, since it hasn’t been accessed more than a handful of times in years, and hasn’t been updated in even more years (the last update was in 2002). But if there’s any info or pictures you want from the gallery, drop me an e-mail and I’ll send them to you.

]]> Comment on Nerdland is Moving by Magmagirl http://nerdland.net/2010/07/nerdland-is-moving/comment-page-1/#comment-5519 Magmagirl Wed, 14 Jul 2010 16:48:05 +0000 http://nerdland.net/?p=511#comment-5519 How strange I thought to check the Nerd Gallery today! Well, I'm glad to know it's just moving, and not entirely erased...was starting to worry. How have you been? How strange I thought to check the Nerd Gallery today! Well, I’m glad to know it’s just moving, and not entirely erased…was starting to worry. How have you been?

]]> Comment on “Code”: Mass Noun versus Count Noun by Will Entriken http://nerdland.net/2010/06/code-mass-noun-versus-count-noun/comment-page-1/#comment-5421 Will Entriken Mon, 21 Jun 2010 21:41:24 +0000 http://nerdland.net/?p=506#comment-5421 Right, we all learned this as kids: I just learned the cheat codes for 30 lives and the blood mode... now these games are way better. Right, we all learned this as kids: I just learned the cheat codes for 30 lives and the blood mode… now these games are way better.

]]> Comment on I’ll Tell You When You’re Older by “Code”: Mass Noun versus Count Noun « Nerdland http://nerdland.net/2009/06/ill-tell-you-when-youre-older/comment-page-1/#comment-5399 “Code”: Mass Noun versus Count Noun « Nerdland Tue, 15 Jun 2010 17:45:45 +0000 http://nerdland.net/?p=251#comment-5399 [...] cult programming (which I consider one of the biggest issues in Computer Science education, and have complained about before). Comments (0) Tags: Education, Human [...] [...] cult programming (which I consider one of the biggest issues in Computer Science education, and have complained about before). Comments (0) Tags: Education, Human [...]

]]> Comment on How to Post to Google Buzz via SMS by Tweets that mention How to Post to Google Buzz via SMS « Nerdland -- Topsy.com http://nerdland.net/unstumping-the-internet/how-to-post-to-google-buzz-via-sms/comment-page-1/#comment-5173 Tweets that mention How to Post to Google Buzz via SMS « Nerdland -- Topsy.com Wed, 28 Apr 2010 10:28:32 +0000 http://nerdland.net/?page_id=496#comment-5173 [...] This post was mentioned on Twitter by Alex. Alex said: http://tinyurl.com/y3oojbd -- how to post to Google Buzz via SMS (workaround) [...] [...] This post was mentioned on Twitter by Alex. Alex said: http://tinyurl.com/y3oojbd — how to post to Google Buzz via SMS (workaround) [...]

]]> Comment on How to Post to Google Buzz via SMS by nxsalex http://nerdland.net/unstumping-the-internet/how-to-post-to-google-buzz-via-sms/comment-page-1/#comment-5030 nxsalex Sun, 18 Apr 2010 16:13:24 +0000 http://nerdland.net/?page_id=496#comment-5030 I kept trying to leave a comment but it never appeared. Maybe after I registered it will: http://buzzalex.blogspot.com implemented using your very valuable idea. Thanks so much, and if you have any suggestions / comments / remarks, please do let me know. Thanks, Alex I kept trying to leave a comment but it never appeared. Maybe after I registered it will:

http://buzzalex.blogspot.com

implemented using your very valuable idea. Thanks so much, and if you have any suggestions / comments / remarks, please do let me know.

Thanks,

Alex

]]> Comment on Covariant, Templatized Virtual Copy Constructors by Java Tutorial : The super and this Keywords – Rocking Team | Java WebDev Insider http://nerdland.net/2009/06/covariant-templatized-virtual-copy-constructors/comment-page-1/#comment-4787 Java Tutorial : The super and this Keywords – Rocking Team | Java WebDev Insider Fri, 19 Mar 2010 23:43:25 +0000 http://nerdland.net/?p=212#comment-4787 [...] Covariant, Templatized Virtual Copy Constructors « Nerdland [...] [...] Covariant, Templatized Virtual Copy Constructors « Nerdland [...]

]]> Comment on Understanding the Five Aspects of Cryptographic Security by Understanding the Five Aspects of Cryptographic Security « Nerdland | Reader Card Drivers Center http://nerdland.net/2010/03/understanding-the-five-aspects-of-cryptographic-security/comment-page-1/#comment-4631 Understanding the Five Aspects of Cryptographic Security « Nerdland | Reader Card Drivers Center Fri, 12 Mar 2010 00:03:46 +0000 http://nerdland.net/?p=476#comment-4631 [...] Go here to read the rest:  Understanding the Five Aspects of Cryptographic Security « Nerdland [...] [...] Go here to read the rest:  Understanding the Five Aspects of Cryptographic Security « Nerdland [...]

]]> Comment on Understanding the Five Aspects of Cryptographic Security by Android adds strong authentication from VeriSign « ColdSip.com http://nerdland.net/2010/03/understanding-the-five-aspects-of-cryptographic-security/comment-page-1/#comment-4626 Android adds strong authentication from VeriSign « ColdSip.com Thu, 11 Mar 2010 18:50:11 +0000 http://nerdland.net/?p=476#comment-4626 [...] Understanding the Five Aspects of Cryptographic Security « Nerdland March 11th, 2010 | Tags: adds, Android, authentication, from, strong, VeriSign | Category: Nexus One [...] [...] Understanding the Five Aspects of Cryptographic Security « Nerdland March 11th, 2010 | Tags: adds, Android, authentication, from, strong, VeriSign | Category: Nexus One [...]

]]> Comment on An Introduction to the Lottery Problem by erce http://nerdland.net/the-lottery-problem/an-introduction-to-the-lottery-problem/comment-page-1/#comment-3555 erce Mon, 18 Jan 2010 21:12:28 +0000 http://nerdland.net/blog/?page_id=27#comment-3555 "A lottery wheel that guarantees a match of 2 numbers from the winning ticket would then be: 1-2-3, 4-5-6, 1-3-4. The reader can verify that every combination of two numbers from 1 to 6 (ignoring order) can be found on each of those three tickets." The first sentence is correct. The second sentence is utterly wrong and irrelevant. Which ticket contains the pair 1-6 for example. None, because it isn't needed to achieve the stipulated guarantee. “A lottery wheel that guarantees a match of 2 numbers from the winning ticket would then be: 1-2-3, 4-5-6, 1-3-4. The reader can verify that every combination of two numbers from 1 to 6 (ignoring order) can be found on each of those three tickets.”

The first sentence is correct. The second sentence is utterly wrong and irrelevant. Which ticket contains the pair 1-6 for example. None, because it isn’t needed to achieve the stipulated guarantee.

]]> Comment on Designing Painless Protocols by Designing Painless Protocols « Nerdland | Webmasters feeds http://nerdland.net/2009/12/designing-painless-protocols/comment-page-1/#comment-2940 Designing Painless Protocols « Nerdland | Webmasters feeds Wed, 30 Dec 2009 11:28:15 +0000 http://nerdland.net/?p=444#comment-2940 [...] Designing Painless Protocols « Nerdland var addthis_pub = ''; var addthis_language = 'en';var addthis_options = 'email, favorites, digg, [...] [...] Designing Painless Protocols « Nerdland var addthis_pub = ''; var addthis_language = 'en';var addthis_options = 'email, favorites, digg, [...]

]]> Comment on Results and Analysis of the Greedy Implementation by Anastasios http://nerdland.net/the-lottery-problem/results-and-analysis-of-the-greedy-implementation/comment-page-1/#comment-1313 Anastasios Fri, 02 Oct 2009 20:51:53 +0000 http://nerdland.net/?page_id=328#comment-1313 Quite informative article I have to say. You put the problem to its deserved dimension. I have written such a program, called Wheel Generator and during the development I tried all sorts of different approaches over the years, including greedy. I had to tackle the same design issues as you have demonstrated so I'll not delve in this here. However, my two cents here is that a greedy algorithm approach is definitely not a good option, from personal experience, when dealing with set cover theory. Better to opt for hill-climbing/simulated annealing. The only thing I haven't tried yet and I intend to do sometime in the future is to use genetic algorithms & mutation. Also, Covermaster depends on the concept of variants of an existing ticket (that is to change one of its numbers and test again if it can provide equal or better coverage - this is what the Var column shows during optimization: the variant picked) and it is written in assembly as far as I know. Don't ask me more on this, I just don't know more details :) cheers Anastasios Quite informative article I have to say. You put the problem to its deserved dimension. I have written such a program, called Wheel Generator and during the development I tried all sorts of different approaches over the years, including greedy. I had to tackle the same design issues as you have demonstrated so I’ll not delve in this here. However, my two cents here is that a greedy algorithm approach is definitely not a good option, from personal experience, when dealing with set cover theory. Better to opt for hill-climbing/simulated annealing. The only thing I haven’t tried yet and I intend to do sometime in the future is to use genetic algorithms & mutation.
Also, Covermaster depends on the concept of variants of an existing ticket (that is to change one of its numbers and test again if it can provide equal or better coverage – this is what the Var column shows during optimization: the variant picked) and it is written in assembly as far as I know. Don’t ask me more on this, I just don’t know more details :)

cheers
Anastasios

]]> Comment on Wheel Generation Success and Failure by Neil http://nerdland.net/2009/07/wheel-generation-success-and-failure/comment-page-1/#comment-319 Neil Sat, 08 Aug 2009 22:17:22 +0000 http://nerdland.net/?p=372#comment-319 You might want to look up Knuth's dancing links. Seems to fit this problem. You might want to look up Knuth’s dancing links. Seems to fit this problem.

]]> Comment on Results and Analysis of the Greedy Implementation by Carlos http://nerdland.net/the-lottery-problem/results-and-analysis-of-the-greedy-implementation/comment-page-1/#comment-277 Carlos Wed, 29 Jul 2009 16:08:32 +0000 http://nerdland.net/?page_id=328#comment-277 Hello again, Covermaster also has an optimization button, which seems to go through the Matrix again, after the greedy value has been found. Clicking there it takes the program 4 hours to spit a 312 ticket wheel. There still is some room until reaching 163. The program with all its features is barely 2 MB big. I don't know much about programming, but maybe it's written in assembler. Rgds Carlos Hello again,

Covermaster also has an optimization button, which seems to go through the Matrix again, after the greedy value has been found.

Clicking there it takes the program 4 hours to spit a 312 ticket wheel. There still is some room until reaching 163.

The program with all its features is barely 2 MB big. I don’t know much about programming, but maybe it’s written in assembler.

Rgds

Carlos

]]> Comment on Results and Analysis of the Greedy Implementation by Tyler McHenry http://nerdland.net/the-lottery-problem/results-and-analysis-of-the-greedy-implementation/comment-page-1/#comment-276 Tyler McHenry Wed, 29 Jul 2009 15:47:15 +0000 http://nerdland.net/?page_id=328#comment-276 Obviously I can't say what CoverMaster is doing that allows it to run so fast because there appears to be no source code or documentation available for it. However, I would suspect that one thing it might be doing is either using something precomputed, or generating some portion of the wheel at random before starting to actually use a greedy algorithm. If it is actually using a greedy algorithm from scratch like my approach, I would be very interested in knowing how it manages to do that, since in my experience with this it takes a few minutes just to compute how all of the tickets are related to one another. Obviously I can’t say what CoverMaster is doing that allows it to run so fast because there appears to be no source code or documentation available for it.

However, I would suspect that one thing it might be doing is either using something precomputed, or generating some portion of the wheel at random before starting to actually use a greedy algorithm.

If it is actually using a greedy algorithm from scratch like my approach, I would be very interested in knowing how it manages to do that, since in my experience with this it takes a few minutes just to compute how all of the tickets are related to one another.

]]>