Archive for 七月, 2008

You are currently browsing the monthly archives for 七月, 2008.

让阳光充满整个房间 – Built To Last

Posted on 七月 30th, 2008 by 王茂 in 音乐 | 0 comments

I’ve looked for love in stranger places, 我在陌生的世界里寻找我的真爱
but never found someone like you. 但却没有找到一个像你一样的女孩
Someone whose smile makes me feel I’ve been holding back,
他们的笑声让我感觉自己犹豫不决
and now there’s nothing I can’t do. 没有什么我能做的
‘Cause this is real, and this is good. 你让我感觉如此真实,如此美好
It warms the inside just like it should, 本该有的温暖
but most of all it’s built to last. 所有的一切,爱你到永远
All of our friends saw from the start. 我们所有的朋友从一开始都这样认为
So why didn’t we believe it too? 所以,我们为什么不这样认为?
Whoa yeah, now look where you are. 你现在在哪里?
You’re in my heart now. 你现在就在我的心中
And there’s no escaping it for you. 无处可逃
‘Cause this is real, and this is good. 你让我感觉如此真实,如此美好
It warms the inside just like it should, 本该有的温暖
but most of all it’s built to last. 所有的一切,爱你到永远
Walking on the hills that night with those fireworks and candlelight
还记得在烟火和烛光的晚上,我们走在山坡上
You and I were made to get love right 我们就如天生一对
‘Cause this is real, and this is good. 你让我感觉如此真实,如此美好
It warms the inside just like it should, 本该有的温暖
but most of all it’s built to last. 爱你到永远
‘Cause you are the sun in my universe, 因为你是我世界里的太阳
considered the best when we’ve felt the worst 即使天塌下来
and most of all it’s built to last.我们的爱一直到永远

随手翻的,大家不要见笑。

数独和其他

Posted on 七月 27th, 2008 by 王茂 in 随笔 | 0 comments

最近迷上了数独,手机上下了个Gameloft做的一款数独游戏,整日绞尽脑汁在那做。

先说下数独:数独是一种源自18世纪末的瑞士,后在美国发展、并在日本得以发扬光大的数学智力拼图游戏。拼图是九宫格(即3格宽×3格高)的正方形状,每一格又细分为一个九宫格。在每一个小九宫格中,分别填上1至9的数字,让整个大九宫格每一列、每一行的数字都不重复。

 

■数独前身为“九宫格”,最早起源于中国。数千年前,我们的祖先就发明了洛书,其特点较之现在的数独更为复杂,要求纵向、横向、斜向上的三个数字之和等于15,而非简单的九个数字不能重复。儒家典籍《易经》中的“九宫图”也源于此,故称“洛书九宫图”。而“九宫”之名也因《易经》在中华文化发展史上的重要地位而保存、沿用至今。
■你知道是最先发明数独的吗?

1783年,瑞士数学家莱昂哈德·欧拉发明了一种当时称作“拉丁方块”的游戏,这个游戏是一个n×n的数字方阵,每一行和每一列都是由不重复的n个数字或者字母组成的。
■你知道是哪一本杂志最先推广数独的吗?
19世纪70年代,美国的一家数学逻辑游戏杂志《戴尔铅笔字谜和词语游戏》(Dell Puzzle Mαgαzines)开始刊登现在称为“数独”的这种游戏,当时人们称之为“数字拼图”,在这个时候,9×9的81格数字游戏才开始成型。
■你知道“数独”这个游戏名称是怎么来的吗?
1984年4月,在日本游戏杂志《字谜通讯Nikoil》上出现了“数独”游戏,提出了“独立的数字”的概念,意思就是“这个数字只能出现一次”或者“这个数字必须是惟一的”,并将这个游戏命名为“数独”(SU DOKU),从此,这个游戏开始风靡全球。

推荐个在线玩的地方: http://www.sudoku.name/index-cn.php

好了,大家开始玩的时候再推荐一个有关数独的分布式计算项目:

 http://dist2.ist.tugraz.at/sudoku/

使用的是BOINC平台,所以想做这个项目先下载安装一个BOINC的平台软件。来看看这个项目的介绍:Sudoku is a very popular puzzle, so just google for it to get a description, programs etc. An important thing about Sudoku is that there always exists a solution and that this solution has to be unique! Writing a program which finds this solution is not very difficult, and you can find many such programs on the web. Average Sudokus (from newspapers etc.) have about 25-30 given numbers. Usually a Sudoku becomes more involved, the less numbers are given. But be careful, this is not a universal rule: there are also hard Sudokus with many givens, and easy ones with only a few givens.
An interesting question is, how few givens are sufficient such that a Sudoku still has a unique solution. A trivial lower bound is 8: assume only 7 numbers are given. Then in any solution you can interchange all occurrences of two non given digits, and thus there are always at least two different solutions. Surprisingly so far no better lower bound has been obtained by mathematical reasoning. All known minimal Sudokus with a unique solution have 17 given numbers, see http://people.csse.uwa.edu.au/gordon/sudokumin.php for a collection of over 41000 such puzzles (still growing).
Thus the current range for the smallest number of clues (given numbers) that a Sudoku puzzle (with one unique solution) can have is 8 to 17. The goal of our project is to close this gap. To this end we start with 92248 sets with 8 primary givens (digits 1-8, representing all possibilities w.r.t. symmetry, relabeling etc.) and extend them by adding more givens, and checking for uniqueness. (A more detailed and mathematical description of our approach will follow.)
During a first evaluation phase of our program we have been able to show that at least 11 numbers have to be given. Thus the current range is 11..17. Using distributed computing our approach will step by step increase the lower bound, until one user either finds a new minimal example or we can show that no such examples exist for up to 16 givens.

 关于BOINC和其他分布式计算请访问:中国分布式计算总站论坛

五子棋

Posted on 七月 26th, 2008 by 王茂 in 随笔 | 1 comment

先手要攻,后手要守,以攻为守,以守待攻。
攻守转换,慎思变化,先行争夺,地破天惊。
守取外势,攻聚内力,八卦易守,成角易攻。
阻断分隔,稳如泰山,不思争先,胜如登天。
初盘争二,终局抢三,留三不冲,变化万千。
多个先手,细算次先,五子要点,次序在前。
斜线为阴,直线为阳,阴阳结合,防不胜防。
连三连四,易见为明,跳三跳四,暗剑深藏。
己落一子,敌增一兵,攻其要点,守其必争。
势已形成,败即降临,五子精华,一子输赢。

精华啊,好好学习下。

大家都来参与到FreeRice

Posted on 七月 26th, 2008 by 王茂 in DC | 0 comments

FreeRice,来这里轻点鼠标,帮助WFP来募捐粮食。

1 word = 20 grains 5 words = 100 grains  答对的越多,Grain就越多。答题的方式就是根据提示单词选出意思相近的一个(四选一).

Play and help,我想这个确实是一举两得的事情,做了好事还提高了英文词汇量。

这个原理基于分布式计算的理论,不过严格意义上讲不算是真正的“计算”,根据Distributed Computing的目录分类,将此类项目归类为Charity,这种类似的项目在国外已经有很多,而且做得相当成功的。例如,Care2.com。都是通过这样一个 -"你来点击,我来捐助’"的形式,来为各种各样的慈善活动进行募捐。

黄建为 《Over the Way》清新淡然

Posted on 七月 25th, 2008 by 王茂 in 音乐 | 0 comments

第一次听到《Over the way》好像在哪里听到一样,软软的声音仿佛不像是一个歌手的作品,而更像是身处在一个下着小雨的田地里,周围正放着轻轻的音乐。很像是New Age的风格,有种夏天的画面感。真希望人就如这样,真实自然,简简单单。听时却有种淡淡的忧伤在里面,轻盈的歌唱里总有点说不出的惆怅。歌词很不错,分享下(可惜自己的翻译水平很次,就不再翻了)

The sunshine’s come
the flowers dance along the river
the mountain
It’s cold in the stream
I jump in and swim
being a dreamer
saying nothing in words

Approaching to a child
ignoring the crowd
I hear my heart beats
it’s so real
Nameless song
I’ve sung it over the way

And maybe I’ll be alone
to be on the tramp with the moon

So you empty the roads
leading the craft for truth

Cause I don’t have wings to fly
so freely like birds in the sky

I’ll have to let go of mind
to soar in the wind and smile
Ya ye ya ye ya ye ya