Viewing profile — waitingkuo
waitingkuo
HN member- Joined
- Wed, Feb 27, 2013, 7:53 AM UTC
- HN karma
- 266
- Public activity
- 133 items
- HN profile
- View on Hacker News ↗
About waitingkuo
No profile information was provided.
Recent public activity
-
comment
Comment #37248598
Looks like that we need to request the access first
- story
-
comment
Comment #32457449
this remind me ruby...
-
comment
Comment #25590658
It's opened and free now https://openlearninglibrary.mit.edu/courses/course-v1:MITx+8...
-
comment
Comment #20332760
I always think that learning probability can not only help you to gain more intuition when dealing with scientific relative subjects but also empower you to think the daily life th…
- story
- story
- story
-
comment
Comment #13320966
This is amazing work. Look forward to the integration between go & python
-
comment
Comment #13320906
Will Grumpy be a good fit for go's scientific packages such like gonum?
- story
- story
- story
-
comment
Comment #11564831
You need a GSM Core Network[1]. For more details, you can take a look at HLR and AuC components which are responsible for authentication. [1] https://en.wikipedia.org/wiki/Network_…
-
comment
Comment #11461498
Most of them are about Data Science / Machine Learning and some math stuff
-
comment
Comment #11461482
Disclaimer: I've paid for many courses but never paid for a specialiazation. I personally don't care about the effect of the certificate. I paid simply because what instructor taug…
- story
-
comment
Comment #11024754
Does this work in China? We're considering giving it a try but the biggest concern is that one of our office is located in China.
-
comment
Comment #10937829
In my experience, the best part of Meteor is its tightly couple stack so that I can developer very smoothly. But the worst part is also its tightly couple stack when my web/app gro…
-
comment
Comment #10855695
As always! It need a http://www.netflix.cn/ first
- story
-
comment
Comment #10327856
It's definitely a huge contribution. But P=NP potentially means that RSA is solvable in Polynomial time. Then countless servers will be attackable. Not sure whether it's good to an…
-
story
Ask HN: If you prove that P=NP, dare you announce it?
If you solve the P=NP? problem that find that P=NP. Dare you announce it publicly?
- story
-
comment
Comment #10189673
I've tried to learn R several time, but its index started with 1 always stop me from learning.