Thursday, June 29, 2006
Monday, June 26, 2006
so dark the con oF man
Madonna of the Rocks, with a more popular name The Virgin of the Rocks, refers to two different paintings with almost identical compositions. One is in the National Gallery, London, and another is in the Louvre.
SODARKTHECONOFMAN
vs.
MADONNAOFTHEROCKS
SODARKTHECONOFMAN
vs.
MADONNAOFTHEROCKS
Sunday, June 25, 2006
Humorous Words
- There are 10 kinds of people in the world. One knows binary, while the other don't.
- 世界上总共有 10 种人,一种懂得什么是二进制 ,一种不懂。
Friday, June 23, 2006
Tuesday, June 20, 2006
Vista, Office 2007, InfoCard
This afternoon, I attended, together with SV, a so-called meeting held by Microsoft on topics related to Vista, Office 2007 and InfoCard.
Well, it was actually not a meeting for us. However, we did get something, a small foot-like clock (it is cute ;)) and some ideas about the corporation. Two out of three lecturer (so called) demonstrated on Vista and the other used XP.
First topic was Vista. What is Vista? What could Vista do? What to benifit from Vista. Most are demonstrations, few about technologies. One demo was 3D virtual Olympic arena. Another was clipping of anything, pictures, videos, vectors or bitmaps. They were somewhat interesting, though not equally useful.
Well, it was actually not a meeting for us. However, we did get something, a small foot-like clock (it is cute ;)) and some ideas about the corporation. Two out of three lecturer (so called) demonstrated on Vista and the other used XP.
First topic was Vista. What is Vista? What could Vista do? What to benifit from Vista. Most are demonstrations, few about technologies. One demo was 3D virtual Olympic arena. Another was clipping of anything, pictures, videos, vectors or bitmaps. They were somewhat interesting, though not equally useful.
Algorithm related Book List
Combinatorial Algorithms
Computer Graphics
Design and Analysis of Algorithms
Computational Optimization
Computational Geometry: Methods and Applications
Introduction to Algorithms (2nd edition)
Advanced Topics in Graph Algorithms
Graph-Theoretic Algorithms
Fundamental Problems in Algorithmic Algebra
Algorithmic Information Theory
Algorithms and Complexity
Combinatorics of Words
Fast Algorithms for Sorting and Searching Strings
Computation Complexity
Theoretical Foundations for Greedy Methods
Computer Graphics
Design and Analysis of Algorithms
Computational Optimization
Computational Geometry: Methods and Applications
Introduction to Algorithms (2nd edition)
Advanced Topics in Graph Algorithms
Graph-Theoretic Algorithms
Fundamental Problems in Algorithmic Algebra
Algorithmic Information Theory
Algorithms and Complexity
Combinatorics of Words
Fast Algorithms for Sorting and Searching Strings
Computation Complexity
Theoretical Foundations for Greedy Methods
Saturday, June 17, 2006
RollRotor beta Now Available
RollRotor is a 3D animation demonstrator of rotors.
The beta version now is available at
sourceforge.net/projects/rollrotor
Before you download, make sure you know what 'beta version' means.
Thanks for your interests.
The beta version now is available at
sourceforge.net/projects/rollrotor
Before you download, make sure you know what 'beta version' means.
Thanks for your interests.
Friday, June 16, 2006
New Project on Sourceforge.net
Recently, I created a project on sourceforge.net. The project is about visualization and animation. Now it is under alpha test, and the beta version will be soon available.
Thanks for your interests.
btw, subversion on sourceforge seems not available.
Thanks for your interests.
btw, subversion on sourceforge seems not available.
Tuesday, June 13, 2006
Why in English
reasons:
- Widely used! The most important
- ACM/ICPC official language
- Personal preference
Monday, June 12, 2006
Floyd-Warshall All-Pairs Shortest Path
Time complexity: O(n^3)
Space complexity: O(n^3), O(n^2)
In computer science, the Floyd-Warshall algorithm (sometimes known as the Roy-Floyd algorithm or Warshall's algorithm) is an algorithm for solving the all-pairs shortest path problem on weighted, directed graphs in cubic time.
Space complexity: O(n^3), O(n^2)
In computer science, the Floyd-Warshall algorithm (sometimes known as the Roy-Floyd algorithm or Warshall's algorithm) is an algorithm for solving the all-pairs shortest path problem on weighted, directed graphs in cubic time.
Saturday, June 10, 2006
关于网络的一些想法
从writely说起, 它大概是最早提供在线word的,而现在google又出了spreadsheet, 也就是ms的excel (受ms影响太深了~~) 随后我猜想(或者已经存在)会有ppt, dreamweaver (其实page creator就是的, 虽然太简陋了), photoshop (这个比较有挑战, image的数据量不是一般text可以比的), 然后我希望会有visual c++(或者换个好听点儿的名字), java bean, eclipse, ultraEdit.
切入正题, 我想说的是google, writely等正在逐步改变microsoft所创立的windows植入用户大脑的根深蒂固的概念或观念. 简单的说, 网络时代才刚刚开始.
我们可以没有硬盘,内存,cpu,甚至显示器,键盘,鼠标等等. 我们不需要电脑或者说pc! 我们需要的仅仅是一个接口,或者说交互的终端(terminals), 但不一定是显示器和键盘, 它也许是三维投影仪(个人设想;)
那么, 我们的数据在哪儿?
上个世纪, 也许你可以把金砖藏在自家的地下室里, 现在, 你更愿意把他们放在银行(虽然不是每个银行都像瑞士银行). 所以, 现在你把你的(数字化的)宝贵资料都放在自己的电脑里, 将来也许应该有一个类似银行的机构(当然不是存放现金), 或许银行以后也开办这样的业务~~ 或者有个新名词~
安全问题
最重要的问题便是安全问题, 大多数人都很关心这个问题, 特别是关于敏感信息, 个人隐私等等. 那么, 首先的问题是放在个人电脑上够安全吗?
对于大多数人来说答案是否定的. 很多电脑上没有密码或者密码很弱, 绝大多数硬盘上的数据没有经过加密, 换言之取得那些数据根本不需要密码,操作系统的登陆密码是一个极为脆弱的保护(什么级别不记得了, 大概C).
另外一个问题是, 你有备份吗? 或许有人有很好的习惯, 把数据备份到移动硬盘上, 那么这是很值得称赞的, 但是, 请问你的移动硬盘跟你的硬盘的物理直线距离是多少? 10米还是10公里? 还是更远?
切入正题, 我想说的是google, writely等正在逐步改变microsoft所创立的windows植入用户大脑的根深蒂固的概念或观念. 简单的说, 网络时代才刚刚开始.
我们可以没有硬盘,内存,cpu,甚至显示器,键盘,鼠标等等. 我们不需要电脑或者说pc! 我们需要的仅仅是一个接口,或者说交互的终端(terminals), 但不一定是显示器和键盘, 它也许是三维投影仪(个人设想;)
那么, 我们的数据在哪儿?
上个世纪, 也许你可以把金砖藏在自家的地下室里, 现在, 你更愿意把他们放在银行(虽然不是每个银行都像瑞士银行). 所以, 现在你把你的(数字化的)宝贵资料都放在自己的电脑里, 将来也许应该有一个类似银行的机构(当然不是存放现金), 或许银行以后也开办这样的业务~~ 或者有个新名词~
安全问题
最重要的问题便是安全问题, 大多数人都很关心这个问题, 特别是关于敏感信息, 个人隐私等等. 那么, 首先的问题是放在个人电脑上够安全吗?
对于大多数人来说答案是否定的. 很多电脑上没有密码或者密码很弱, 绝大多数硬盘上的数据没有经过加密, 换言之取得那些数据根本不需要密码,操作系统的登陆密码是一个极为脆弱的保护(什么级别不记得了, 大概C).
另外一个问题是, 你有备份吗? 或许有人有很好的习惯, 把数据备份到移动硬盘上, 那么这是很值得称赞的, 但是, 请问你的移动硬盘跟你的硬盘的物理直线距离是多少? 10米还是10公里? 还是更远?
Friday, June 9, 2006
Wednesday, June 7, 2006
Monday, June 5, 2006
Mnemonic
Mnemonic, pronounced nee'monikos, is "A device, such as a formula or rhyme, used as an aid in remembering."
Examples of Mnemonics:
PI
Poe, E.: Near a Raven. Midnights so dreary, tired and weary.
Silently pondering volumes extolling all by-now obsolete lore.
During my rather long nap-the weirdest tap!
An ominous vibrating sound disturbing my chamber's antedoor.
'This,' I whispered quietly, 'I ignore.'
Perfectly, the intellect remembers: the ghostly fires, a glittering ember.
Inflamed by lightning's outbursts, windows cast penumbras upon this floor.
Sorrowful, as one mistreated, unhappy thoughts I heeded:
That inimitable lesson in elegance--Lenore--
Is delighting, exciting... nevermore.
Examples of Mnemonics:
PI
Poe, E.: Near a Raven. Midnights so dreary, tired and weary.
Silently pondering volumes extolling all by-now obsolete lore.
During my rather long nap-the weirdest tap!
An ominous vibrating sound disturbing my chamber's antedoor.
'This,' I whispered quietly, 'I ignore.'
Perfectly, the intellect remembers: the ghostly fires, a glittering ember.
Inflamed by lightning's outbursts, windows cast penumbras upon this floor.
Sorrowful, as one mistreated, unhappy thoughts I heeded:
That inimitable lesson in elegance--Lenore--
Is delighting, exciting... nevermore.
Saturday, June 3, 2006
Algorithm related Abbreviations
dsu - disjoint set union
dp - dynamic programming
dfs - depth first search
bfs - broad first search
FFT - Fast Fourier Transform
NP - nondeterministic polynomial
KM -
LIS - Longest Increasing Subsequence
LCP - Longest Common Prefix
SA - Suffix Array
KMP - Knuth-Morris-Pratt
Any More?
dp - dynamic programming
dfs - depth first search
bfs - broad first search
FFT - Fast Fourier Transform
NP - nondeterministic polynomial
KM -
LIS - Longest Increasing Subsequence
LCP - Longest Common Prefix
SA - Suffix Array
KMP - Knuth-Morris-Pratt
Any More?
Friday, June 2, 2006
Thursday, June 1, 2006
First things first :)
Thanks for your interests.
This is the very beginning...
And there is a long way to go...
Tsul Problem Hints coming soon.
:)
This is the very beginning...
And there is a long way to go...
Tsul Problem Hints coming soon.
:)
Subscribe to:
Posts (Atom)