On road again, 2015

简介:

Actually, I've disappeared a long time almost 4 years.

Hope that I could start to write what I really want to say and think and share what I do and feel.

What's my plan next? 

  1. Create a blog wetsibe of myself.

  2. Focus on architecture of IT and managment. BTW, clouding time is comming, but I'm not sure AWS will be better and better in China. I know you can guess why I said that.

  3. Pursue different my own life, work is not important part of my life. -:). So maybe I'll share more what I like to do, say to English culture and etc.

  4. More sports. In my view, sport is not only health for your body but it's the attuitude of my life. Yea, For challenging, quantification of target whcih my physical exercise is necessary. Like freestyle swimming  that I could swim 1000m no more than 30m -:)


I'll write my plan or wish list of new year in days.


On road again, I'm comming 2015.

本文转自Be the miracle!博客51CTO博客,原文链接http://blog.51cto.com/miracle/1598256如需转载请自行联系原作者


Larry.Yue

相关文章
|
8月前
|
机器学习/深度学习 安全 Java
hdu-1596-find the safest road(dijkstra)
hdu-1596-find the safest road(dijkstra)
52 0
Codeforces Round #192 (Div. 2) (330B) B.Road Construction
要将N个城市全部相连,刚开始以为是最小生成树的问题,其实就是一道简单的题目。 要求两个城市之间不超过两条道路,那么所有的城市应该是连在一个点上的,至于这个点就很好找了,只要找到一个没有和其他点有道路限制的即可。
53 0
uva10783 Odd Sum
uva10783 Odd Sum
54 0
|
机器学习/深度学习
The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree
The Preliminary Contest for ICPC China Nanchang National Invitational J题 Distance on the tree
98 0
|
测试技术
HDU-1847,Good Luck in CET-4 Everybody!(巴什博弈)
HDU-1847,Good Luck in CET-4 Everybody!(巴什博弈)

热门文章

最新文章