Sun, 07 Jun 2009 19:03:00 GMTNever Give Uphttp://blog.csdn.net/skywalker_nick/http://blog.csdn.net/skywalker_nick/archive/2009/06/07/4249818.aspxhttp://blog.csdn.net/skywalker_nick/comments/4249818.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/4249818.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=4249818<br />今天，在Debian Lenny下安装了PulseAudio，其他的软件通过音频设置都在PulseAudio的管理下，除了Skype V2，很是郁闷。<br /><br /> 在网上也找到了一个不错的方案，使用Skype 1.4 + StaticOSS，不过我又不想重新安装Skype。<br /><br /> 结果终于找到了一个我认可的方案：<br /><br /> （1）在skype的音频设置中，In&Out&Ring三项全部设成第一个plughw设备。<br /> （2）重新启动skype，运行 #pasuspender skype<br /><br /> 这个命令在skype运行时暂停使用PulseAudio，这样导致没法一边用skype一边听音乐，这个对我来说，不是什么问题咯。<br /><br /> 附上我修改的PulseAudio配置文件：<br /> /etc/pulse/default.pa<br /><br /> /***** add these lines *****/<br /> load-module module-alsa-sin<img src ="http://blog.csdn.net/skywalker_nick/aggbug/4249818.aspx" width = "1" height = "1" /><img src="http://www1.feedsky.com/t1/236637595/skywalker_nick/csdn.net/s.gif?r=http://blog.csdn.net/skywalker_nick/archive/2009/06/07/4249818.aspx" border="0" height="0" width="0" style="position:absolute" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637595/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637595/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 08 Jun 2009 03:03:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2009/06/07/4249818.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2009/06/07/4249818.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2009/06/07/4249818.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637595/1139763http://blog.csdn.net/skywalker_nick/archive/2009/01/12/3758962.aspxhttp://blog.csdn.net/skywalker_nick/comments/3758962.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3758962.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3758962在网上找到的比较详细的信号列表, 作为参考.<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3758962.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637596/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637596/art01.gif" onerror="this.style.display='none'" /></a></p>Mon, 12 Jan 2009 20:33:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2009/01/12/3758962.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2009/01/12/3758962.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2009/01/12/3758962.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637596/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/28/3625554.aspxhttp://blog.csdn.net/skywalker_nick/comments/3625554.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3625554.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3625554在网上收集到的firefox加速技巧<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3625554.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637597/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637597/art01.gif" onerror="this.style.display='none'" /></a></p>Sun, 28 Dec 2008 10:42:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/28/3625554.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/28/3625554.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/28/3625554.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637597/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618862.aspxhttp://blog.csdn.net/skywalker_nick/comments/3618862.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3618862.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3618862自己动手安装了w32codecs和mplayer，没有碰到任何问题。<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3618862.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637598/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637598/art01.gif" onerror="this.style.display='none'" /></a></p>Sat, 27 Dec 2008 10:10:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618862.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618862.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618862.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637598/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618828.aspxhttp://blog.csdn.net/skywalker_nick/comments/3618828.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3618828.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3618828在网上搜索到的加速openoffice启动的方法，确实很有效果。<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3618828.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637599/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637599/art01.gif" onerror="this.style.display='none'" /></a></p>Sat, 27 Dec 2008 10:00:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618828.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618828.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/27/3618828.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637599/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/18/3544847.aspxhttp://blog.csdn.net/skywalker_nick/comments/3544847.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3544847.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3544847本文转自链接：http://linux.chinaunix.net/bbs/thread-1051808-1-1.html<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3544847.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637600/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637600/art01.gif" onerror="this.style.display='none'" /></a></p>Thu, 18 Dec 2008 11:14:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/18/3544847.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/18/3544847.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/18/3544847.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637600/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/16/3527015.aspxhttp://blog.csdn.net/skywalker_nick/comments/3527015.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3527015.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3527015These are some useful hash functions, which I collected from Internet.<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3527015.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637601/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637601/art01.gif" onerror="this.style.display='none'" /></a></p>Tue, 16 Dec 2008 11:48:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3527015.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3527015.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3527015.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637601/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526997.aspxhttp://blog.csdn.net/skywalker_nick/comments/3526997.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3526997.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3526997The standard implementation of Levenshtein Distance, which is used to compute the edit distance of two strings.<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3526997.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637602/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637602/art01.gif" onerror="this.style.display='none'" /></a></p>Tue, 16 Dec 2008 11:47:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526997.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526997.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526997.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637602/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526979.aspxhttp://blog.csdn.net/skywalker_nick/comments/3526979.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3526979.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3526979This is the implementation of Hamming Distance in Java, which I use it to compute the substitution distance of two strings.<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3526979.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637603/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637603/art01.gif" onerror="this.style.display='none'" /></a></p>Tue, 16 Dec 2008 11:44:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526979.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526979.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526979.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637603/1139763http://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526966.aspxhttp://blog.csdn.net/skywalker_nick/comments/3526966.aspx0http://blog.csdn.net/skywalker_nick/comments/commentRss/3526966.aspxhttp://tb.blog.csdn.net/TrackBack.aspx?PostId=3526966This is the implementation of hash table and its collision resolution strategy is seperate chaining. I optimized the hash table in two ways. First, I use power-of-two length of the hash table instead of prime number, because the modulus operation used with prime numbers is expensive. Second, I tried to control the number of collision by resizing the hash table if the number of collision is greater than the length of the table.<img src ="http://blog.csdn.net/skywalker_nick/aggbug/3526966.aspx" width = "1" height = "1" /><p class="fswww1"><a href="http://www1.feedsky.com/r/l/csdn.net/skywalker_nick/236637604/art01.html" target="_blank"><img border="0" ismap="ismap" src="http://www1.feedsky.com/r/i/csdn.net/skywalker_nick/236637604/art01.gif" onerror="this.style.display='none'" /></a></p>Tue, 16 Dec 2008 11:38:00 +0800skywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526966.aspx#Feedbackhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526966.aspxskywalkerhttp://blog.csdn.net/skywalker_nick/archive/2008/12/16/3526966.aspxhttp://blog.csdn.net/skywalker_nick/feed.aspxcsdn.net/skywalker_nick/~1139775/236637604/1139763