摘要： Well, I have been out for this Beauty of Programming. Anyway, I still gain a lots things.Firstly, I find it's not difficult to pass the second competition, what I can do is solve the easy question as soon as possible. Besides, I can resigter one more account so that I can submit a lots times.Sec 阅读全文

摘要： Problem Description 给定一个m × n (m行, n列)的迷宫，迷宫中有两个位置，gloria想从迷宫的一个位置走到另外一个位置，当然迷宫中有些地方是空地，gloria可以穿越，有些地方是障碍， 她必须绕行，从迷宫的一个位置，只能走到与它相邻的4个位置中,当然在行走过程中，gloria不能走到迷宫外面去。令人头痛的是，gloria是个没什 么方向感的人，因此，她在行走过程中，不能转太多弯了，否则她会晕倒的。我们假定给定的两个位置都是空地，初始时，gloria所面向的方向未定，她可以 选择4个方向的任何一个出发，而不算成一次转弯。gloria能从一个位置走到另外一个 阅读全文

摘要： Problem Description 可怜的公主在一次次被魔王掳走一次次被骑士们救回来之后，而今，不幸的她再一次面临生命的考验。魔王已经发出消息说将在T时刻吃掉公主，因为他听信谣言说 吃公主的肉也能长生不老。年迈的国王正是心急如焚，告招天下勇士来拯救公主。不过公主早已习以为常，她深信智勇的骑士LJ肯定能将她救出。现据密探所报，公主被关在一个两层的迷宫里，迷宫的入口是S（0，0，0），公主的位置用P表示，时空传输机用#表示，墙用*表示，平地用.表示。骑士们一进入时空传输机就会被转到另一层的相对位置，但如果被转到的位置是墙的话，那骑士们就会被撞死。骑士们在一层中只能前后左右移动，每移动一格花1时 阅读全文

摘要： Problem Description A friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determ 阅读全文

摘要： Well, I really think u have to write note here, because when I new a word, I always lost.Get down to business. For decision tree, which is based on rule, also use some statistical method, in other words, heuristic rule.Error rateyou couldn't use the error rate in training data, what we care abou 阅读全文

摘要： There are a number of advanced variants of minimum edit distance that play a special role in computational biology.String x : AGAString y : AGNeedleman-WunschIn computational biology, what we care about is the similarity. So we must modify the previous algorithm, minimum edit distance algorithm, to 阅读全文

摘要： IntroduceThrough the following, u will know what's edit distance.target : you are cute and I love u.source: I am cute I don't love u.For the two sentences, u can use edit including insert, delete and substitute the source so that it can be same to the target.u will subsutitute "you" 阅读全文

摘要： Our final discussion in basic text processing is segmenting out sentences from text.We use a decision tree to solve this question. But it's doesn't enough, we should use more sophisticated decision tree features to gain the classifier. For example, u can get the probablity of one word end of 阅读全文

摘要： Well, today I learned the word normalization and stemming.After word tokenization, we should stem to map them to a normal form. For examples, u should refer "are is " to "be", and refer "windows" to "window" and so on. Afterwards, we can use Linux tool to impl 阅读全文

摘要： Well, after listen the class, it's necessary to make notes.In this class, Pro just tell us there are a lot of words in various corpus using Linux program, and introduce that in different language, there are different language. For example, word segmentation is the crucial step for Chinese, and i 阅读全文