qpleple

French: hein \ɛ̃\

From a book linked in another comment: https://livebook.manning.com/book/nim-in-action/chapter-1/34

Anybody knows how?

Cool post. You don't need `python -m SimpleHTTPServer 8000` to test your page tough, just double-click on index.html :)

You could run a topic model [1] to display, say, the top 20 topics discussed on Twitter. LDA [2] is a good one.

[1] http://en.wikipedia.org/wiki/Topic_model

[2] https://pypi.python.org/pypi/lda

Maybe a fix: http://www.amongtech.com/how-to-fix-ios-8-0-1-no-service-iss...

It could copy to clipboard on click, or Cmd+click.

> a bruteforce over the MAC space wouldn't take long

Indeed, best supercomputers are running today around 10 petaFLOPS (= 10^16 FLoating-point Operations Per Second) and there are 2^48 ~= 10^15 possible MAC addresses.

Indeed, I'm using it in ST and I haven't noticed an impact on performance.

Screenshot: http://share.qpleple.com/U8eN

> When messages pile up, select all, hit delete, and declare email bankruptcy.

> Email: bilton@nytimes.com. Twitter: @nickbilton

Kind of ironic

Can you tell us what tool you used? Or maybe share your results/conclusions?

Ha ! There is an email notification every time someone comments, and no way to unsubscribe. I just got 6 emails and one minute, and Chrome re-focusing the tab automatically because gn commented <script>alert('Moo!');</script>

I've been TAing Computer Science 101 (Design of algorithms) four times now, and I cannot agree more with this post.

Having to teach something forces you to go one step deeper in your level of understanding. When it's only for yourself, you stop when you get the idea. And this is good enough. But when you know you will have to present it in front 200+ students, then you make sure you really understand it. You can't help it, your mind is trying to find edge cases, to put it in a another context, ...

Same as Nate, I first enrolled as a TA because it was paying my tuition fees. But I got a whole new enlightening understanding of the algorithms we study in 101: Divide and Conquer, graph algorithms (DFS/BFS/Dijkstra/Bellman-Ford/Kruskal/Prim/...), greedy algorithms, NP-hard reductions, etc. I now genuinely enjoy thinking about algorithms, or proving one algorithm is correct, or deriving the time complexity analysis. Now I TA really because I enjoy it, money is just a side benefit.

> Do you accept donations?

> Sure, you can make donation to louis@pentesterlab.com using Paypal. If you don't like Paypal just send a donation to any charity and email me so I will feel good about it ;)

I like this state of mind.

That's the point: you read the code, and when something is not crystal clear, you glance at the comment.

I feel it gives a good tradeoff between:

- typed languages that are too low level to start (C/C++)

- scripting languages that are high level, not typed, and therefore do a lot of things under the hood (Python, Ruby, Javascript)

Manhattan https://maps.google.com/maps?ll=40.713175,-73.998499&spn...

Very nice UI.

Or just hit Escape key before the page has finished loading.

Yes, but as long as there will be people no knowing about that, there will be room for such freeloaders.

Does this quickly bounced traffic on port 22 affect that much the server ?

Tiger doesn't seems ready yet.

"This same tool has now been resurrected and there is ongoing development in order to make it useful for newer versions of the UNIX operating systems it supported."

And conclusion : turn off the network as well. You never know.

Do you experience something like that ?

24in60.com looks good !

It is risky indeed, if twitter.com implements your killer feature, you will lose everything.

But you can play with that, or go some direction Twitter doe not want to take.

You will have to improve much much more the way tweets are displaid before I pay for that kind of service every month.