i'm a girl, yeah, if i have to chose a word to describ me, i think i'm a lucky girl.
yeah, that's it, i'm lucky, why?first because, i have a wonderful family. Mother and Father go along with each other very well, although sometimes some small quarrel happend between them. They have married for 22 years as i have had 21 birthdays. You can't believe how far time flies. Mom was borned in the 1965 while father is two years older than her. Both of them are over age 40. You know at a age of over 40 a person has reached the milddle age. So i always worried about their health status. I'm glad to hear about mom goes to the fitness club taking some cources ,such as yoga. As we know yoga is a good dicipline for learning to relax. That's precisely what my mom need. I know mom endure a heavy psychological burden of the work issues, fortunately dad and i are both understanding her, and mom also relieve some for the surport from me and dad. My big dady~~haha ~~, at home i always argued with my dad, my thought is always opposit of what dad think about. Dad and I nerver see eye to eye on anything. In that case,i'll try to argue him out of his opinions, however, i win and hold my decision. So in a certain extent, our family is a democratic family. As long as you're right, others will respect your decision. Second , I'm fortunate to be able to have so many good friends. The most important one is Hong Yang. We were classmates sinced the junior high school. After graduation, she was admitted into Nanjing university which is one of the top universities in china. Although i failed in the firsty year, i was admitted into east china normal university in shanghai next year. I'm so happy when hearing about shanghai is not far away from nanjing. I went there twice and i had a wonderful time. I know she is upset now, but i don't know how to console her, may be my company will be helpful, but i'm in shanghai and i also do not want to trouble her. What i can do may be is the best wishes for her. "Sheep, come on!" In the university, i'm so lucy to have three kind roomates, xiang, ting and hong. I always consider my dorm is my home in shanghai. The four in our dorm get along with each other very well through unknown to the familiar. I never have roommates until attending the university. So I never obtain a special friendship like the one of the roomates through living together. At first, i'm not accustom to living with stranger. yeah, i know "stranger" is not approriate to name my roomates, but i can't accept them in heart. We come from all corners of our countries, have various living habits. well, all of these problems are no longer a problem. We interact on each other. I cherish this relationship very much. In addtion, i have another close friend named jingyan in the university. She comes from chongqing. I'm grateful for her generous and helpfulness. Jingyan is a big cook who usually do some cooking in the dom. what she cooked is very delicious.
posted @
2009-03-26 21:38 zoyi 閱讀(441) |
評論 (4) |
編輯 收藏
摘要:
閱讀全文
posted @
2009-02-22 15:11 zoyi 閱讀(218) |
評論 (0) |
編輯 收藏
原文:
It's been a long strange trip toward better security for Microsoft, but
they've made enough progress to have both improvements to their
technique and some highly interesting war stories. The company's got a
new site explaining the past decade's advances, and you have a reson to
read comics at work day.
The process of "baking security in" -- getting developers to think
about security less as "those people who yell at us" and more as an
integral part of any software-construction effort -- lends its name to
Baking Security In. which details Microsoft's progress on the Sccurity
Development Lifecycle, a process involving 14 stages and checkpoints
over the six stages of the software-devlopment cycle (requirments,
design, implement, verification, release, support/service ).
Microsoft has previously estimated that adoption of the SDL strategy
increases lifecycle costs by 20%, If that's a hit the company's willing
to take to build security into their products, building a fairly clever
educational site including "The Amaing Adeventures of Kevlarr", a
developer who requires some convincing (that's him above), is just part
of the effort, But come forthe comics and stay for the videos, as
real-life, non-animated Microsofties like Steve Lipner and Michael
Howard recount their memories of the days before Microsoft got
security-serious.
譯文:
微軟安全開發的旅程奇怪而又漫長,但是他們在技術的進步和有趣的戰略故事上都發展迅速,微軟今天啟動了一個新站點用動畫的形式來解釋過去十年中微軟就安全技術方面所作出的努力和進步,很值得在上班的時候看一看這個連環畫。
“baking sercurity in”
這個過程,是讓開發者不僅僅是考慮那些侵犯系統程序的人,而且要更多將安全作為任何一個軟件開發努力中完整的一部分,將這個過程取名為“Baking
Security in”,
在這個連環畫中詳細介紹了微軟在安全開發周期(SDL)中的進步,其中包括14個階段和檢查要點覆蓋了軟件開發周期的六個步驟(需求,設計,實施,驗證,
發表,支持/服務)。
微軟先前估計如果采用SDL戰略成本將增加20%,但是如果這是必要的,那么公司愿意去為其產品建立安全體系,并且建立一個很有教育意義的網站包含
“Kevlarr的傳奇經歷”,一個開發者很有說服力,其為安全開發周期做出了努力。但是他來自動畫,停留在視頻上,而作為現實中非動畫虛構的人物像
Steve Lipner和Michael Howard回憶了在微軟有意識安全問題嚴重性以前的那段日子。
posted @
2009-02-20 09:48 zoyi 閱讀(194) |
評論 (0) |
編輯 收藏
很久沒有做題,感覺手生疏了很多,以前從來沒有做過usaco的題目,現在先把這一百題做完,也好做一個系統的復習,第一板塊的題目感覺都是一些沒有特定想法的題目,想清楚了,題目也就做出來了,現在發現在usaco上做題有一個好處,哪里錯了,他還會把數據給你,這個平臺真的很不錯,加油加油~~!?。?br>
posted @
2009-01-17 13:13 zoyi 閱讀(208) |
評論 (1) |
編輯 收藏
昨天看了一組有關于08軍人的組圖,有抗旱雪災的90后的戰士,也有512中犧牲的烈士,還有感動中國的政治學習家,和奮不顧身救人而犧牲的戰士,08年過去了,透過軍人給我們的感動,對自己有很多的觸動,有的時候,真的應該感謝人民的戰士給我們的一個和平的小環境,之所以說小環境,在全球的大前提下,還是有不和平的炮聲的,在和室友感慨和平年代的好處時不禁讓我想起地球的另一面有非洲保守饑餓的人們,人道主義關愛的無國界醫生們,他們給這些地方帶去了和平的色彩,幫助他們同疾病抗爭,也同嚴酷的世界抗爭,巴以沖突,有多少無辜的平民受牽連,在空襲的籠罩下他們應該沒有新年的喜悅,相對于他們我們是如此的幸福,平靜的等待著新年的到來。
08年的不平凡,中國的不平凡,我們有年初的雪災,7.8級的地震,西藏沖突,還有三鹿三聚氰胺牛奶的對奶制品市場的沖擊,當然最重要的在如此曲折的一年我們成功舉辦了奧運,在北京的比賽的那天,站在鳥巢外面,我努力想象著,八月的北京是如何的精彩,記得在公選的結課論文上寫的就是關于奧運的文章,奧運能給國民的反思太多太多,確實在如此曲折的一年,能夠成功舉辦奧運確實是對中華民族的考驗,而我們不負眾望,但是全民奧運的路還有很遠,精英奧運的模式下讓我們有驕人的金牌戰績,卻也有對相對日韓中國青少年普遍體能素質弱的反思。
步入09年,我真正的20歲了,記得看過一篇報道,一名小戰士在在抗震救災的一線,感嘆說自己想領養一個孤兒,戰友笑話他自己也還是一個小屁孩,還能領養什么孩子,他回答說,長大不在于年齡,而在于他是否知道該如何承擔責任。我能想象一個90后的小戰士說出一句這樣的話是多么的讓人驚訝,長大的責任,我們已經步入20歲,再如何狡辯,我們已經是成年人,長大的責任需要我們自己承擔。
小的時候我們犯錯沒有關系,我們可以說我們沒有14歲,
絕對無刑事責任年齡,我們不需要對任何犯罪承擔刑事責任,慢慢長大,14-16歲相對刑事責任能力,走過16步入18歲,作為一自然人,我們能為自己所做所為承擔應當承擔的法律責任,當我們已然18歲,才不入大學校園不久,我們說自己是學生,狡辯自己仍然孩子,但是慢慢長大,在地鐵上已經有小朋友瞪著圓圓的眼睛喊你阿姨,呵呵孩子是不會撒謊的,他說你是阿姨,你就真的是了,20歲的女孩,喊阿姨喊姐姐,都改不了一個成人應該承受的,我們要開始學會做好自己,而且要學會做好社會,也許年齡到了,我們無條件汲取的時刻到了,也該是我們付出的時候,雖然自己還屬于零收入或未成年人群,但是力所能及的事情也許應該從小事做起。
posted @
2009-01-02 11:02 zoyi 閱讀(213) |
評論 (0) |
編輯 收藏
摘要:
閱讀全文
posted @
2008-12-28 14:41 zoyi 閱讀(685) |
評論 (0) |
編輯 收藏
最近總以情緒低落為借口懶惰了很多~~看見甜甜過so甜甜,胖胖樂呵呵的眼睛的笑沒了
還有身邊的人都是如此積極的向上的活著,現在一切都太美好了~~
軟大一雖然做得沒有什么技術含量,但是畢竟也是大家一起做得哈哈~~
現在發現我還挺適合做沒技術含量的事情,做個外包什么的,真的挺和我胃口
確實我做的事情大部分是外包,比如掃雷,現在的軟大一,還有就是我們的泡泡堂~~
看來審美邏輯上還是很有優勢的嘛~~


我的目標~~哈哈~~理想一點的目標
posted @
2008-12-25 13:59 zoyi 閱讀(208) |
評論 (0) |
編輯 收藏
摘要: 二分還沒搞出來~~一直超時~~迭代感覺也是利用了單調性~~不斷地逼近迭代代碼:
#include<iostream>#include<algorithm>#include<math.h>#define inf 1.0e-8#define maxn 100005using namespace std;s...
閱讀全文
posted @
2008-10-11 03:30 zoyi 閱讀(290) |
評論 (0) |
編輯 收藏
貪心的思想首先要好好理解一下,這里給出了每一門考試開始的時間,和復習的最大提前時間(否則容易忘記),應該是枚舉加貪心的思想
n的范圍是50000,從大到小進行枚舉,如果是考試的一天進堆,不是則找出最大的那個復習時間上限
比較難處理的是時間轉化問題,我在這里是把它提前了31。1。1600作為一個起始時間,然后都做一個轉換
第一個程序我是寫了一個date的類,重載了各種操作,現在也覺得在這種比賽提里面如果沒有必要還是少些類比較好,太復雜了,調試起來也不清晰
以下是ac代碼:
#include<iostream>
#include<algorithm>
#define maxn 50005
int T[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
using namespace std;
struct node
{
int test,bg,i;
friend bool operator<(node a,node b)
{
return a.test>b.test;
}
}in[maxn];
int n;
bool cmp2(int x,int y)
{
return in[x].bg<in[y].bg;
}
int leap(int y)
{
if((y%4==0&&y%100)||(y%400==0))return 1;
return 0;
}
int DtoI(int d,int m,int y)
{
int yy,mm,ret=0;
for(yy=1600;yy<y;yy++)
ret+=365+leap(yy);
for(mm=1;mm<m;mm++)
ret+=T[mm]+(int)(leap(y)&&mm==2);
ret+=d;
return ret;
}
void print(int x)
{
int yy,mm,dd;
for(yy=1600;x>=365+leap(yy);yy++)
{
x-=365+leap(yy);
if(!x)
{
printf("31.12.%04d\n",yy);
return;
}
}
for(mm=1;x>=T[mm]+(int)(leap(yy)&&mm==2);mm++)
{
x-=T[mm]+(int)(leap(yy)&&mm==2);
if(x==0)
{
printf("%02d.%02d.%04d\n",T[mm]+(int)(leap(yy)&&mm==2),mm,yy);
return;
}
}
printf("%02d.%02d.%04d\n",x,mm,yy);
}
int main()
{
//freopen("1","r",stdin);
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
char str[12];
scanf("%s",str);
int d,m,y,t;
scanf("%d.%d.%d",&d,&m,&y);
scanf("%d",&t);
in[i].test=DtoI(d,m,y);
in[i].bg=in[i].test-t;
}
sort(in,in+n);
int maxd=in[0].test,index=-1;
int heap[maxn],heapsize=0;
bool yes=true;
int tmp=n;
for(;yes&&tmp;maxd--)
{
if(maxd==in[index+1].test)
{
heap[heapsize++]=index+1;
push_heap(heap,heap+heapsize,cmp2);
++index;
continue;
}
if(heapsize>0)
{
int top=heap[0];
pop_heap(heap,heap+heapsize,cmp2);
heapsize--;
if(in[top].bg>maxd)yes=false;
else tmp--;
}
}
if(!yes)
printf("Impossible\n");
else
{
print(maxd+1);
}
return 0;
}
posted @
2008-10-10 22:26 zoyi 閱讀(265) |
評論 (0) |
編輯 收藏
摘要:
閱讀全文
posted @
2008-09-23 13:26 zoyi 閱讀(3537) |
評論 (6) |
編輯 收藏