2011年12月20日星期二

Gap semester plan

It has been a while since the last update. Has a lot on my mind right now, and I am trying to come up with a feasible plan for the gap semester (modifications are expected as time goes on):
1. Understand the basics of stock market (be familiar with jargon). If time allowed, try to step a little more into some security analysis, or black-schole option model.
Books: Investment and Security analysis by Graham.
if prepared well, try to open an trading account as soon as possible.
Also, if possible, try to take some econ or fin courses on campus that will help.
2. Try to attend and learn the following courses next semester:Math 561(together with the fifty probability problems) and CS 576 (Haskell training) and CS 498. Continuing reading papers in mendeley and try to explore as many interesting areas of study as possible (Keep notes taking in Linuxmint).
3. Figure out how to maximize my academic fun while social or financial obstruction is minimized.

Book list (keep updating):
My life as a quant
Probability theory: the logic of science
Investment

2010年9月22日星期三

Online Resource

18.102 Introduction to Functional Analysis together with Math540
18.103 Fourier Analysis - Theory and Applications together with Probability
18.238 Geometry and Quantum Field Theory
18.330 Introduction to Numerical Analysis
18.701 Algebra I together with any abstract algebra course
18.385J / 2.036J Nonlinear Dynamics and Chaos with 510
18.405J / 6.841J Advanced Complexity Theory something new
18.435J / 2.111J / ESD.79J Quantum Computation with Physics 513
18.965 Geometry of Manifolds with 518

2010年7月23日星期五

Embrace the environment

To do list everyday:
Read couple of articles from a major science website or a news website.
Finish reading O'Henry's short story book.
Oral practise to be enforced.
Watch movies as you need to translate every single word actors said.

To do list:
Reading tasks every week.
Understand that practice makes prefect(10 thousand hours).

To think about the future ideas.

2010年6月25日星期五

Completely Unsocializable

After 3 yrs staying abroad, I have successfully turned myself into a silent person, no social life at all, although it is not important to me, but sometimes I still feel helpless and useless.

Abroad
Good:
good education system, many more opportunities, fast internet, lots of academic resources, new tech stuff available
Bad:
English, racial discrimination, communicating badly, no common topics, no friendship, cooperating with other will be difficult, not used to American's life style (like party and stuff), even researchers like to social, don't want to act stupid, so I will have to avoid social activities as many as possible, not easy to get a job for a alien, disgusting food, and high price. Totally can not blend in. The worst part is that I am invisible to them, which means I am a totally outsider, actually, even if I am able to talk very nice English, like some of my Chinese friends, they are still willing to hang out with Chinese, not the Americans, which is why the lifestyle is more important.

Homeland
Good:
good food, have social network, have family living together, no worry to move, speak Chinese, cheaper.
Bad:absolutely disaster academically, and fucking bureau systems, have no social security network, must try hard to earn money, and if you ever get a chance to go abroad, you are ranked second class, people are too smart to organize.

There are two solutions, one for each country, one is that I will be able to speak English more confidently and better, then I am sure I won't feel sad whenever I am about to talk, and I am able to express myself freely, that will at least help me out of nervous. The other one is to wait or help China evolve into a better country, with international reputation, not only for its population and anything that is because of its gigantic size, for example, let her own citizen feel proud of its high technology and science achievement, improve its high-education system.

No where to go, China seems will fail soon, and here I don't have an idea what to do, what to make a living...

目前看来最实际的应该是赶紧赚钱,赚很多钱,这样才能想干啥干啥而不必被他人浪费时间,不然就只能碰运气去做,十有八九要失败。

这年头都他妈很有趣,找女朋友,没感觉,看祖国,很堕落,看国外,被鄙视,读博士,还没门,确实挺没劲的。又一个血逼大低潮


有时候也在想,是不是本人的学术能力和把妹能力一样低下呢?很害怕,毕竟如果是一样的,就没出路了,试想当一种渴望的能力和天生的本能一样是必需的,那么就算知道没有希望也要强撑,难道不痛苦吗?

2010年3月13日星期六

Schedule the schedule

It is painful that every time I am about to get something done, there is no break time, immediately huge amount of things follows, and forces me chasing. I have no problem making schedules, short-term ones, and get them done, but talking about long-term schedules, that's what confuses me the most, and become impractical to follow. While they are still useful and able to work as a guidence for my future life. I think it is the time for me to clearly list all things I want to try, and divide time for each single part, thus conquer them one by one. Please hand me my patience and insistency! (Detailed book plan, study plan, etc., will be post online)!

2010年1月30日星期六

没头脑和不高兴

人生是个什么东西?这个问题看样子完全答不上来,虽然无数次的都好像明白了这条路是多么的不适合被已经看穿了的人去走,还是对她的美依依不舍,又或许我需要资本来成全我的幼稚。纵然是渴望的,有人的地方还是有江湖,而那个地方却充满了杀机。终于明白了,几十年的路,不是家里的支持和帮助,早已经人面桃花了。痴痴地不舍只换来无尽的感慨,毕竟,我不是生而天赋。其实不是不明白那里可能有多么的不顺,但总是被美好的幻想压的喘不过气来,毕竟,幻想总是带来不朽,而现实只是惭愧的低着他的头。混什么不是混社会!说实话,我并不需要大学来释放自我,我一直认为自己是一个个性的个体,但是好像心却从来是高傲的抬着头,不闻不问脚下的路。未来是一件麻烦的事情,至少我现在并没有眉目。我想,缺乏的就是自我,自我的创造。不创造就死亡,我还有退路吗?

2009年12月17日星期四

Newest Upgrade, Plan for Winter Break

It's been a long semester, and I have to drop a course because i am not doing well in all others. Well, frankly, I think I have learnt my lesson, that is study is not about concentration and resource, the more time you spend and the more resources you used, the better understanding you will have. So the plan for this winter is first, finish complex variable, and prof it at the beginning of the semester, also, check the am I still in the group, then study some part of 427,436,and of course if possible 470. This seems to be impractical, I will make time table for each in detail. Hope, I won't be lost again for the next semester, and also I have to start to search for summer research. So, the winter is clearly not a break for me. Living in busy time is kind of pleasure, if I can retrieve passion from it, no matter success or failure.

The step towards a subject, you should first sketch a rough blueprint for that, like a content table for a book, and then list some of the important theorem or methods or concepts for each topic, and then practice them for some amounts of problems (find a good problem book) to get a concrete understanding for each of the concept. THIS IS VERY CRUCIAL!!!!!!!!

2009年6月26日星期五

语言决定世界

语言决定世界,那么在我掌握的语言之外会不会有什么是别的语言有的世界,但是中文却没有?

语言是个体所具有的世界的载体,虽然在国内没有办法将各个少数民族的文字进行信息化或者推广各族自己的文字(事实上我也不希望这样的东西产生在现在的时代,离心力过于强大),但是依然很渴望能够在另外的语言里面找寻一份不同。

2009年5月31日星期日

有所启发

看了cuitianyi的博客,有所启发,看样子有规律的更新博客可以有效督促各种计划的完成,于是乎也在酝酿作一些受监督的计划。

2009年5月16日星期六

Ural 1513的递推

做了Ural 1513,由于懒得写高精度,所以还是WA,不过这个递推是经过了思考的,思路如下,用一个二维数组来记录在长度为i时的可能情况数,这样的话,如果i<=k那么我们就不用顾忌,dp[i,'L']=dp[i-1,'L']+dp[i-1,'B'] and dp[i,'B']=dp[i-1,'L']+dp[i-1,'B'], 一旦i>k,那么dp[i,'L']=dp[i-1,'L']+dp[i-1,'B']-dp[i-k-1,'B'],也就是说,在累加所有上一个长度可能情况的同时,我们只需要排除从i到i-k都为L而i-k-1位置为B的情况(有待完善。。。)

2009年5月9日星期六

很好玩

集合论告诉我们并不是所有能够描述的集合都能够构造出来,而维特根斯坦说对于我们不能说的,我们要保持沉默,很好玩的两句话


蛋白质的暴涨和宇宙的暴涨

2009年5月5日星期二

Summer Plan

1.ACMs(Tire and Automata, Probability Problem Random Shooting SGU,SGU431,SGU 打印N个自身)
2.Self Study (Differential Equation, E&M II, Quantum II, Complex Analysis)
3.Crackme
4.Probability Challenge
5.Project Euler
6.Tensor
7.Harvard 100 Problem
8.CMU Puzzle
9.200 Physics Problem
10.Wittgenstein
11.Complex System
12.Mizar Proof(Prove Weak Form of Goldbach's Conjecture)
13.Numenta
14.Various Games(博弈)
15.felicity.iiit.ac.in
16.Different Metrcis(Godel Metric)
17.曙光 魔方 超级计算机(illinois supercomputing center)
18.AI-Code Robot Course
19. Develop a distributed project for my group

2009年4月29日星期三

大创造

大创造需要大智慧,需要大问题,而不是拘泥于一个学科,一门学问,既然是宇宙的抽象模型,那么每一个问题的背后,每一个创造的背后都是一种互相关联的揭露,于是我知道如果我的想法是要改变世界的,那么他就不会平凡,不会拘泥于一道题,一个定理,而是一种理的追求。这才是正确的态度和心态。

控制论
信息论
随机数论
WolframAlpha

2009年4月16日星期四

Randomness is Symmetric

Randomness is Symmetric

2009年3月26日星期四

这回搞笑了,相声大师都不是汉族

这回搞笑了,相声大师都不是汉族的。。。
侯宝林 满族
马三立 回族

2009年3月8日星期日

Beat Conway John

1 3
1 1 1 3
3 1 1 3
1 3 2 1 1 3
1 1 1 3 1 2 2 1 1 3
3 1 1 3 1 1 2 2 2 1 1 3
1 3 2 1 1 3 2 1 3 2 2 1 1 3
1 1 1 3 1 2 2 1 1 3 1 2 1 1 1 3 2 2 2 1 1 3
next line?

2009年2月13日星期五

A nice course on rubik's cube

This course discusses the inner relationship between Group Theory and Rubik' Cube, which seems very fascinating to me.
http://akbar.marlboro.edu/~mahoney/courses/Spr00/rubik.html

2009年1月13日星期二

Shity Recursion

This is a program that could be used to calculate rook polynomial which is putting rooks in a irregular chess board( more specifically, it can partially solve sgu269). Almost killed by recursion.
#include <iostream>
#include <fstream>
#include <memory>
using namespace std;
fstream fin;
int n,k,num[5],rk[5],ans[5][8],ma,mi;
void ready()
{
    fin>>n>>k;
    for (int i=1;i<=n;i++)
     {
       fin>>num[i];
       if (num[i]>ma) ma=num[i];
       rk[i]=(1 << num[i])-1;
     }
     if (ma>n)
      mi=n;
      else
      mi=ma;
}
bool chk(int rook[])
{
    for (int i=1;i<=n;i++)
      if (rook[i]!=0)
        return false;
    return true;
}
void poly(int dep,int lev,int pow)
{  
   int tmp[5];
  if (chk(rk))  //如果检查是空棋盘
   {
ans[0][dep]=1;   
     return;
   }
           
             memcpy(tmp,rk,sizeof(tmp));
             while (rk[lev]==0) lev++;
while ((rk[lev] & (1 << pow))!=(1 << pow))
  pow++;
rk[lev]=rk[lev]- (1 << pow);
             if (rk[lev]==0)
poly(dep+1,lev+1,0);
else poly(dep+1,lev,pow+1);
            for (int l=0;l<=mi;l++)
{ans[l][dep]+=ans[l][dep+1];
ans[l][dep+1]=0;}
memcpy(rk,tmp,sizeof(rk));
                rk[lev]=0;
             for (int k=lev+1;k<=n;k++)
              if ((rk[k])>=(1 << pow))
rk[k]=rk[k]- (1 << pow);
              poly(dep+1,lev+1,0);
            for (int l=1;l<=mi;l++)
{ans[l][dep]+=ans[l-1][dep+1];
ans[l-1][dep+1]=0;}
memcpy(rk,tmp,sizeof(rk));

         
}
int main()
{   fin.open("c:\\test.txt");
    ready();
    poly(1,1,0);
cout<<ans[k][1];
    fin.close();
}

2009年1月7日星期三

POJ 2449 A* search K shortest path

First real C++ program
#include<iostream>
#include<fstream>
using namespace std;
int n,m,s,t,k,size;
int l[1001],l2[1001],her[1001],time[1001];
bool used[1001];
fstream fin;
int a,b,r;
struct edge{
    int v,l,t;
};
struct key{
int v,value;
};

edge map[1001][1001],map2[1001][1001];
key data[1001],tmp;
void ready()
{
fin>>n>>m;
   for (int i=1;i<=m;i++)
   {  
  fin>>a>>b>>r;
  l[a]++;
      map[a][l[a]].v=b;
      map[a][l[a]].l=r;
      l2[b]++;
      map2[b][l2[b]].v=a;
      map2[b][l2[b]].l=r;
   }
   fin>>s>>t>>k;
   if (s==t) k++;
}
void dijkstra()
{ int z;
   for (int i=1;i<=n;i++)
her[i]=1000000;
   her[t]=0;
   for (int i=1;i<=n;i++)
   {
  int min=1000000;
  for (int j=1;j<=n;j++)
    if ((!used[j]) && (her[j]<min))
{
min=her[j];
z=j;
  }
used[z]=true;
for (int j=1;j<=l2[z];j++)
{
   if (her[z]+map2[z][j].l<her[map2[z][j].v])
            her[map2[z][j].v]=her[z]+map2[z][j].l;
}
   }
}
void push(int v,int i)
{    int tmp1;
     key temp;
    size++;
data[size].v=map[v][i].v;
data[size].value=tmp.value+map[v][i].l;
tmp1=size;
while (tmp1 > 1)
{
if (data[tmp1 >> 1].value+her[data[tmp1>>1].v]<data[tmp1].value+her[map[v][i].v]) break;
temp=data[tmp1];
data[tmp1]=data[tmp1 >> 1];
data[tmp1 >> 1]=temp;
        tmp1= tmp1 >> 1;
}
}
void del()
{   key temp;
temp=data[size];
data[size]=data[1];
data[1]=temp;
size--;
int i = 1;
while ((i << 1) <= size)
{
int j;
j = i << 1;
if ((j < size) && (data[j + 1].value+her[data[j+1].v]< data[j].value+her[data[j].v])) j++;
if (data[i].value+her[data[i].v]< data[j].value+her[data[j].v]) break;
temp=data[i];
data[i]=data[j];
data[j]=temp;
i = j;
}
}
int a_star()
if( her[s]==1000000 ) return -1;
data[1].v=s;
data[1].value=0;
  time[s]=0;
  size=1;
  
  while (size>0) {
    time[data[1].v]++;
 if (time[t]==k)
 return data[1].value;
 
      tmp=data[1];
 del();
 if (time[data[1].v]>k) continue;
 for (int e=1;e<=l[tmp.v];e++)
 {push(tmp.v,e);                           
  }
  }
return -1;
}
int main()
{
 fin.open("c:\\test.txt");
ready(); 
 dijkstra();
 int ans;
 ans=a_star();
 cout<<ans;  
 fin.close();
}

2008年12月15日星期一

The Random Incoherent inside Physics

了解了一点广义相对论,于是知道在重力场里面的物体在进行自由落体的时候会Maximum its spacetime curve,于是无法理解阻力存在的作用,因为这一部分应该是热统的,所以想像纯数学描述的力还是跟现实有差距。