Days before, Professor Huang told me that he was going to open two new courses about Python (Python Programing) and Haskell (Programming Language) in Queens College and Graduate Center of City University of New York. Liang was a genius in Algorithm Coding Competitions (I think every students who attended ACM-ICPC, OI or Topcoder in China know him since he is one of the authors of the famous ‘Black-Book’) I was also a ACMer. During the competitions, we were  both gained much from practice coding on Online Judges. So he wanted to know which OJs support Python and Haskell, so that he coud ask his students to train themselves on them.

I list some OJs below that I know that support these two languages. If you know others, tell me, please

Timus Online Judge: supports C, C++, C#, Pascal, Go, Python, Ruby, Haskell, Scala; This is one of the best OJs; from Russian; Old and very hard.

Zejiang University Online Judge: supports C/C++, Python and Scheme

Codeforces: supports many languages, traditional ones and Haskell, Python, Ocaml, Scala, Go; a combination of OJ and Topcoder; Easy problems to very hard problems.

HackerRank: supports traditional ones and Erlang, Groovy, JS, Haskell, Lua, PHP, Python, Scala; a famous India OJ, mainly for finding jobs.

There are also two new kind of OJs, Project Euler and Rosalind. Each of their problems provide a input file. You could write your program on your computer by any languages, run on the input file and then submit output files. What’s more interesting, problems in Project Euler are all mathematical problems while problems from Rosalind are all BioInfo problems. You could learn new knowledge from other domains while doing coding practice.

Last but not least, Python Challenge is an awesome place to train tricky skills in Python

Which NLP research papers (no matter whether classic or state-of-the-art) do you recommend students to read, if you were a teacher/professor/adviser? And why?

View Question on Quora

I am now an intern @Yahoo! Global. I gave a presentation to my group mates to introduce three algorithms.

Though these Algorithms are core in a Yahoo! Ad and Search engine, they have been published by two papers.

Thus, I cut down the sensitive parts (showed with X in slides) and public this slide (just leave your mail, I will send a copy).

This slide could be used for a newbie guide to get into these algorithms. For deeper knowledge, you have to read the orient papers.

If anyone have any problems, welcome to discuss.

If anyone thinks this is illegal, notice me pleasure.

Leave words and I will give you my email address.

Thank you!

PPT:

Tech Talk

paper1:

§Efficient query evaluation using a two-level retrieval process, A. Broder, D. Carmel, M. Herscovici, A. Soffer, J. Zien, CIKM 2003 (pdf)

paper2:

§Efficiently Evaluating Complex Boolean Expressions, M. F. Fontoura, S. Sadanandan, J. Shanmugasundaram, S. Vassilvitski, E. Vee, S. Venkatesan, J. Zien, SIGMOD 2010 (pdf)

(Just leave your mail, I will send a copy)

Welcome to WordPress.com. After you read this, you should delete and write your own post, with a new title above. Or hit Add New on the left (of the admin dashboard) to start a fresh post.

Here are some suggestions for your first post.

1. You can find new ideas for what to blog about by reading the Daily Post.
2. Add PressThis to your browser. It creates a new blog post for you about any interesting  page you read on the web.
3. Make some changes to this page, and then hit preview on the right. You can always preview any post or edit it before you share it to the world.