2.26
kismet
course
distr paper & proposal.
so tired.
Somebody said I’m better looking in a business attire.
Is it so?
it makes me uneasy.
that’s me, man.
February 27, 2007
February 26, 2007
February 25, 2007
February 24, 2007
2.23
surveying on vehicle wireless mesh (ad hoc). there are research about such a network, but it seems that no one has considered combining it with open wiki access point.
went to Brad’s for a game night. dizzy with Halo in XBOX.
Their cute baby son is simplely not interested in me. So sad…
Talked something interesting with Kelvin. Great.
February 23, 2007
2.22
only one thing today:
the business career fair in Hilton Hall.
put on business attire for the first time. i practiced how to tie a tie in the rest room for 5 times.
This is my first formal encounter with the recruiting stuff of US companies.
The good news is, it’s not hard to communicate with corporate people here. But I do need more practice, though.
The bad news : I don’t know most of the companies here. And my resume is pretty scratchy.
Spent the night writing the online resume in career center. Haven’t worked on resume for a long time.
3 decisions:
List target companies and study them thoroughly.
Online resume and profile in major career sites and networking sites. Perhaps I need to run a server of my own as well. More planning is needed to combine those well together.
Target at wireless related interns and start real application.
2.20
Rong was mad at my presentation.
I didn’t have the time to draw graphs in slides to demonstrate the algorithm. So I just wrote on the white board with a marker. I marked my hand and face all over with my marker, but nobody could see it because of the light. When I finished nobody had any questions. I guess eye sight is an sensitive topic.
2.19
kismet
prepare for the presentation in distributed system, but really don’t have enough time.
2.18
project discussion with Soji.
Rong broke into the office cause she forgot her key.
I stole some of her food when she was out for key.
no daily log for another week
o…
i’m so lazy.
but perphaps i’m just tired of writing a post every, cause it bores the most of you.
listening this guy blogging alone, i can’t help imagining myself singing:)
is it that my blog boring life boring or my life boring?
i will change both.
come on!
February 19, 2007
February 16, 2007
2.10
a visit to NASA.
visited control center
witnessed the international space station being assembled.
saw pieces of former space station
a whole rocket
talk given by an astronaut about his walk in space.
free food!!
February 8, 2007
February 7, 2007
February 5, 2007
February 4, 2007
2.3
shopping with Cunqing
Been to Joon’s with Joon, Ann and Youn.
Nice to meet Tomas. Good talking with the old man.
Need to be rational with my life, and feel the pace at the same time.
February 3, 2007
被点名
规则(LXY)： 1、被点到名字的要在自己的博客或者空间上写下答案, 所有问题都要真实回答,并且要将这几个题目传给你的七个好朋友, 通知对方”你被点名了”. 2、这七个人要在博客或者空间上注明是在哪接到的题目, 并且再将题目传给其他七个(可以不限制啦)朋友, 让游戏继续下去, 不得回传, 被点名的人将得到大家的祝福, 并且所有美丽的愿望都会在不久以后得以实现. 3、虽然不可以回点, 但是你的朋友的朋友还是可能会点到你, 如果有第二次, 甚至第三次点到,那说明你将会是一个非常幸运和幸福的人.
规则(WFY)： 点名游戏即为博客里所谓流行的击鼓传花游戏，“花”即是一串很多人“传”下来的问题，传给谁谁就得接着，否则就得挨罚，请认真对待，不要怕暴露隐私。 被点到名字的要在自己的博客里写下自己对所有已有问题的答案（要注明问题出处及提问者），同时再加一个自己想问的问题，并连已经传下来的所有问题一起传给三个人并这三个人的博客里留言通知对方——你被点名了，被点名者不得拒绝回答问题，将游戏进行到底，完成游戏的人将会永远得到大家的祝福。被点到名字的人将得到大家的祝福，并且所有的美丽愿望都会在不久的以后实现。注意：不得回传。
1.2006你最开心的事是什么？ i did it. no regrets.
2.2006年最难过的事是什么？ i did it. no regrets.
3.2007年最大的心愿是什么？ establish myself in U.S.
4.最大的愿望： free my heart
5.如果现在可以让你随心所欲去旅行，你想去哪？ Tibet
6.你最满意自己身体哪个部位？与别人初次见面你会先注意他（她）哪个部位？ eye/eye
7.失眠过吗？你用什么办法对抗失眠？ yes. sleep late.
8.会不会做饭？你希望你的伴侣（or 未来的伴侣）会做饭吗？ barely. don’t care.
9.你最想做哪个动画片角色？为什么？ 浦饭幽助(Yusuke Urameshi) in YuYu Hakusho
10.在你心中我是怎么样一个人？ spiritual
11.如果可以重来,你最想改变的是什么？ should have had a fight in kindergarten. and should have had a girl friend in kindergarten as well.
12.觉得自己是个自恋的人么? i hate and love myself.
13.爱人爱到怎样的程度才算是超过爱自己呢？ don’t need her to love you.
14.你理想的伴侣应该具备什么样的品质？ beautiful
15.谈谈你最近在听的音乐吧． American idiot
16.你会出于什么样的理由结婚? 或者是出于什么样的理由单身? for love. marry for love of a women, stay single for love of freedom.
17.如果现在你有自由权利可以杀掉一个人，你选谁，为什么？（好像年底不应该问这么邪恶的问题，那么我提供一个可选项，请看问题二）如果你现在可以随便kiss一个人，你选谁，为什么？（哈哈，还是很邪恶） kiss the beautiful spanish girl sitting next to me now.
18.和恋人分手了你会把对方的手机，msn，qq删掉么，如果删掉为什么？ Yes. To erase the pain.
19.如果可以按照自己的想法去实现,你希望在多少岁时结婚,为什么? Never.
20.写下目前在你的生命中最重要最珍贵的三个朋友的名字(恋人不算) You And you there Yes, the all of you. Not you!
点名:
lele darkblue arrive
many thanks!!:)
2.2
preparing for presentation.
presented.
talked about “Agile in research”.
I think research groups in universities can learn a lot from practices in industries.
360 degree convergence.
To me, it’s the only solution for this
2.1
prepare for the presentation.
reviewed the comic “bad company”
still will be carried away by dreams of young blood.
1.30
found that i didn’t read the papers selected for the distributed system course, and thus i didn’t submit the critiques in time…
cool. i’ll read it.
have i REALLY read a paper before?
seldomly.
do i REALLY know how to appreciate and judge other’s work before?
no.
it takes much time…
fuck the time line. The time line keeps you busy, but often stop you from spending time on the “REAL THING”. Hard to imagine how much time has been wasted by time line. It took most part of most people’s life.
1.29
Talked to data structure instuctor after class:
“So glad you come out with a solution so quickly. It’s not required, you know.”
“Oh, you found some paper with complexity lower than O(N^3)? Really?”
…
Read the bio of Guass. He started to appreicate the works of mathematicians before him from ancient time to
to his temporaries. And he learnt how to explore in cutting edge areas in mathematics.
Looked at us. We’re fed by “the most up to date” version of knowledge in classroom. Nobody learns by tracing the path of the grand masters solving those problems. We learn because we’re told to learn. Few explore the problems and papers first, identify the problem and break up the learning task and carry it our with a clear purpose and sharp angle.
Nah. Students forget the purpose of learning for a long time. Minds are so dead.
You can find “the Matrix” everywhere.
1.28
Restored some rationality.
Understood the papers. Don’t have time to do further investigation on this.
Wrote a program to demonstrate my own algorithm and submitted.
Still feeling it a shame to have spent so much time on this.
1.27
came out with just an algorithm with O(N^3).
i began to google with great anger.
found two papers addressing this problem. They only improved the complexity to O(N^3*(loglogN/logN)^0.5). But I couldn’t understand it…
Why is it so hard for me to read papers? Damn it I’ll comprehend you like reading a fiction!!!!!!!!!!!!!!!!!!!!!!!!
1.26
My plan for today was: finish all the homework and misc stuff, clear the path for me to dive into the paper reading.
However, a problem in data structure took me the whole day:
“In the maximum sub-array problem we are given an N x N array of real numbers, and we must find the maximum sum contained in any rectangular sub-array. What is the complexity of the problem? What is the best algorithm that you can come up with? “
My vague memory told me that the teacher want us to find algorithm with computation complexity lower than O(N^3)
Never achieved this in the whole day…
February 2, 2007
Long time no update!!!!!!!!!!!!!
Oh!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
I’m so lazy!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
