关于谈判

今天参加了《双赢谈判》的第一天培训。其间做了一个小游戏。规则是4个team，互相看不到，10轮选择「说」，「不说」(其实就是两种选择，并不一定是这两样行为)。得分规则是：

Ａ队　Ｂ队　　　　　　Ａ队得分　Ｂ队得分
不说　不说　　　　　　＋５０　　＋５０
不说　　说　　　　　　－１００　＋１００
说　　不说　　　　　　＋１００　－１００
说　　　说　　　　　　－５０　　－５０

Debian Linux 3.0 coming

Now they are at r6. I hope that FreeBSD will have dabian base for their 3.x series soon, which will provide better compatibility and ease the way of users to migrate to FreeBSD.

gcc 3.4.4 imported into FreeBSD base

kan         2005-06-03 03:29:21 UTC

  FreeBSD src repository

  src/contrib/gcc - Imported sources
  Update of /home/ncvs/src/contrib/gcc
  In directory repoman.freebsd.org:/tmp/cvs-serv9201

  Log Message:
  Gcc 3.4.4 release.

  Status:

  Vendor Tag:	FSF
  Release Tags:	gcc_3_4_4_20050518

争议人物delphij

sigh…

不安全的原因

我们来看看那个人说的这段话：

I’d be really surprised if somebody is actually able to get a real-world attack on a real-world pgp key usage or similar out of it (and as to the covert channel, nobody cares). It’s a fairly interesting approach, but it’s certainly neither new nor HT-specific, or necessarily seem all that worrying in real life. (HT and modern CPU speeds just means that the covert channel is _faster_ than it has been before, since you can test the L1 at core speeds. I doubt it helps the key attack much, though, since faster in that case cuts both ways: the speed of testing the cache eviction may have gone up, but so has the speed of the operation you’re trying to follow, and you’d likely have a really hard time trying to catch things in real life).

It does show that if you want to hide key operations, you want to be careful. I don’t think HT is at fault per se.

彼岸花

From sarah’s blog.

彼岸花，又称曼珠沙华。一般认为是生长在三途河边的接引之花。花香传说有魔力，能唤起死者生前的记忆。

春分前后三天叫春彼岸，秋分前后三天叫秋彼岸。彼岸花开在秋彼岸期间，非常准时，所以才叫彼岸花吧。

熬夜好比出大招

从houxd的blog上面看到的：「有的时候觉得熬夜就像游戏里的大招。一发出来威力无穷，但是却有条件，比如损血，或者费魔法点数之类的。」

仔细想想颇有道理……

跑了题的一段废话

跟一个孩子聊了聊关于出国的问题，鼓励了他一番。

你对自己的受教育状况满意吗？答案肯定是不满意，从对个别课程，到对整个教育体系——当然，我非常清楚的一件事情是，很多人都把我的想法误解为「精英式教育」。我的想法，总结一下很简单，就是无论做什么，你可以分成不同的层次，但是不可以做出次品。比如说做一台电脑，主频1M可以，但是不能说3分钟自动暴毙或重启一次。

How to determine whether a number is 2^[INTEGER]?

I have an idea: let we have “a” is the number to determine.

return ( (0 == (a & (a-1))) && (a > 0))

Despite the style of the code, is there some better solution? Note that a is a native integer type (say, int, long, long long, etc).

Enabled SPF protection on beastie

A decision was made to enable SPF on beastie. SPF is a technology that mitigates forged spam (while it itself is not totally spam proof, as spammers can set up their own SPF record :-)

• ← 上一页
• 下一页 →