skysight-inc/HackerNews huggingface dataset:
What about differentiating between speech in support of an idea vs. in support of a person running for election?

Then you get into the wide gray area of "public interest organizations" that aren't supporting a candidate, just supporting the idea that Obama's birth certificate is fake.

I've come around to the far opposite position on this. The only regulation on any political donations should be transparency. Give as much as you want to whomever you want, as long as it's completely out in the open.
You can run OS X vm in vmware player. If you have a decent desktop box it can be quite usable. This probably violates apple's TOS, but whatever.
Exactly. The reason they fight it is because talking about legalizing drugs is a sure way to lose votes.

Opposite of how we all like to think of the tech industry, politics are slow, clunky, and bureaucratic — for good reason. It takes a long time to go from "random HN/reddit commenters talking about legalizing drugs" to "politicians talking about legalizing drugs."
I think the "scary" part is the notation. Any competent programmer, whether schooled or self-taught, is familiar with the concepts if not the notation.
Andrew Godwin's Django Migration pull request to master branch
Thanks for the thorough yet concise explanation.
The average case for finding a value in an unsorted list is also O(n). Assuming the values you want are randomly distributed, on average you have to look at half the list. Naively this sounds like O(n/2), but O(n/2) is actually the same as O(n) because you strip out the constant factor of 1/2.
You keep repeating this, but that doesn't make it true.

Where I've worked and hired people -- in San Francisco and Silicon Valley -- there is little emphasis placed on formal eduction. Virtually none. Some companies have a reputation for liking degrees. Google, for example, but they are an exception.

I don't think a self taught programmer, who takes his craft seriously and learns not just practical how-to but also data structures and algorithms, is at ANY disadvantage in today's job market.
And when talking about the running time of an algorithm with O-notation, concerns about whether or not an algorithm is faster by a constant factor (for example three times faster, an order of magnitude faster, two orders of magnitude faster) compared to another algorithm is not captured by the O-notation by convention (it is abstracted out, so to speak). If you find out that an algorithm is O(2n), you simplify it to O(n) (the coefficient of n does not matter).
I can't speak for the UK but in the USA our laws technically apply no matter where a citizen is. US law trumps foreign laws and you could be prosecuted when you return.
Didn't Google threaten to pull CyanogenMod's ability to distribute Google Play for implementing the same thing a while back?
There's been a few articles like this recently. The problem is, it's so easy to flip a world like "request" to "tell", or drum up a government looking document asking for xyz. There's just no way to determine the validity of this stuff.
Interesting indeed. But as you noted, it is irrelevant to how people have been (and continued to be by some) treated according to he "original" law of the land, which is no less the "truth".

People can learn many lessons from an event in history.
Just in case you're now really into the history and sicence of reinforced concrete, there was an excellent 99% invisible podcast episode about it recently:

http://99percentinvisible.org/post/52361601736/episode-81-re...
This is great, thanks for your effort. Couple more things I'd love to see:

1. Parse a chunk of text and salvage any email addresses from it that you can find. Use case: my users upload spreadhseets with email of their other team members, but email field would often contain more than one email (separated by slash or space or coma or god knows what), or other stuff like Skype account etc.

2. Actual validation service. I'd pay for it at standard mailgun rates, it would be easier for me than rolling my own as I do now.

Thanks again!
Well, you work in SF / SV. There's a whole Earth outside of those places. And those places are largely prejudiced against people who don't have degrees. I've experienced it firsthand.

"Well, move!" Except it's not that easy when you have family.
My dad worked in the Great Workroom. Made a huge impression on me as a kid.

I truly believe that investing in great architecture inspires the mind and invites you to give your very best. You rise to the environment you're situated in.
I am all for protecting children so I hope this doesn't come out wrong but there are way too many "think of the children" laws on the books (and it's only going to continue).

Similar to your example, in the state where I live (Indiana) it would be legal for me (a 34-year-old man) to have sex 10 times a day with a 16-year-old kid but it would be a felony punishable by years in prison if I took a naked picture of the same kid. (I don't have any desire to do either one, of course, I just think that's an illustrative example.)
Well ... What if I launched a cloud based startup that used homomorphic encryption on your data? I mean, it'll be another 10 years before we get the encryption overhead below a factor of a million, but at least we won't be able to give away your data in any useful form...
You don't have to build goroutines into the language to have lightweight multithreaded tasks. TBB does this for C++, for example. (Edit: I was mistaken about Java here -- apparently it does use OS threads.)
Not quite. From the article:

> A 2009 paper (PDF) by computer scientist Colin Percival estimated that it would cost a mere $4 to crack, in an average of one year, an 8-character bcrypt password composed only of letters.

Yet the linked paper by cpercival specifically states that a 8 _letter_ password would only take $4 per year to crack, but a 8 _character_ password would jump to $130k. Also, these numbers, as quoted from the paper, are referenced from 2002 dollars, including dollar costs of hardware from 2002, but do not include hardware other than the CPU, such as power supplies.
I have played competitively for years.
Of course. But it's also the worst case. I'm really just wondering if there's a "default" scenario that's being referred to when we just say "f(n) is in O(n)" or does it depend on context?
There is a conflict of interest issue when companies funded almost entirely by government contracts uses money in this manner. The government could easily specify as a term in their contracts that are not allowed to do this. Considering the amount of funds involved, I think this is more than reasonable.
As a non-developer, I'm curious what others are using RabbitMQ (and similar) for.

Examples that quickly come to mind are push notifications for apps, large e-mail blasts triggered when $event happens, etc. What are some things that you use this type of a setup for?

(As I said, I'm not a developer (network engineer and Linux guy) and I'm trying to think of use cases that would apply to my environment (ISP).)
If this is a problem for you, then don't use it. Steal some regex off a Stack Overflow page.
More interesting than the specific codes would be to understand the security of the algorithm used. For example, if the secret code in the Megamos system is changed but the algorithm is not is it susceptible to reverse engineering from listening to the challenge/response when the key is activated.
I know one of the developers there and Peter's always struck me as incredibly smart. I wish door dash the absolute best (and hope they expand to the East Bay) as soon as feasible :) ).
The first time we used DoorDash, Jessica said "This has changed my life." If you have small children you understand.
Or the code word for something bad "suddenly".
Facebook’s stock is above $30, its employees are breathing a sigh of relief
goroutines are lighter than Java threads, though, so it's still an improvement.
The best "email address validation" that ever existed was SMTP's VRFY verb (and EXPN was quite useful too). Unfortunately, the spammers killed that real quick.
C# 5 also has this, with the async/await keywords. The nice thing is that it works with older plain Task-based code (which was callback spaghetti).
Pinterest Allows Users to Opt-Out of Being Tracked
what in American politics is surprising for me is that such a meager sum (vs. the scale of decisions these lawmakers take and even the scale of their personal wealth, etc..) as 20K is supposedly able to affect/sway their decision. To compare, 20K is something that sometimes may sway a junior engineer in the Valley take this job instead of this - compare that with decisions affecting distribution of some billions of dollars and lives of millions of people. I'm really puzzled by that.
This looks freakishly similar to Gumroad. Even the 'I want this' button seems copied.
I would love to hear a more detailed reason why. I'm in the opposite boat. Been using node on a number of projects, have recently discovered clojure and want to get away from node and to clojure, once I can justify doing so.

Logging, toolchain, ease of deployment, and callback hell on "large" projects are the reasons that I'm down on node.

-edit- basically help me understand the skeletons in the closet you've discovered in clojure -edit-
The site has been hammered lately. Have been trying to update to latest Node via Homebrew and keep getting timeouts.
Domain names have have three contact points, address, phone and email. If only one is wrong I doubt the domain will be deleted. If all the contact info is wrong then sure, dispute it and let it go back into the pool.

I've reported domains that had obviously fake contact info on them, like fake phone numbers or fake addresses. If you don't want to use real info use a proxy service.
When I get off a plane, the first thing I do is check if the country I'm deplaning in has prior restraint and mandatory Internet censorship. If it does, I know I'm in the third world.
The key point for me is C++ stdlib doesn't include an HTTP stack, while Go's does.

Fair enough, but it was a bit of a foregone conclusion that he wouldn't want to develop/reuse a C++ HTTP stack as he went into the project with the intention of using Go...
Thank you Grace.

As long as I have your ear, I would also like to recommend better integration into Facebook.

These touching stories are perfectly poised to go viral, and Facebook is the perfect place to make that happen.

You just need to to set up the right conditions and get the right flow going.

Like getting the right soil, the proper fertilizer, the perfect growing conditions for a plant. Then you just plop in the seed and it grows, seemingly on its own.

Your existing "share" button just isn't good enough for that. I'm not going to pretend I know exactly what is good enough, but I do know that examining and solving that problem could open up some amazing viral growth.

I'll bet you can find some Watsi Facebook share posts/campaigns that were wildly successful and fast.

They probably start out with a post like this: "This is very dear to my heart. I just donated $30. We only need $150 more. Can you help?" Then other people start replying "I just gave $50", "I just donated", "We only need $100 more", "We DID IT!" - all on one person's timeline. The seed. Then the flow, the shared excitement, and finally the celebration. In their house, with their friends watching.

It's everything that makes sports so exciting, but even better because at it's heart it satisfies a basic human need to help others.

Is there a way for you to facilitate that on Facebook? Like one click to seed, with compelling text? And maybe realtime updates on each thread from someone at Watsi? With a celebration at the end? And updates from Watsi directly onto that person's Facebook thread?

Like I said, I don't necessarily have all the answers, but I can see the possibilities.
Being familiar with big O notation is not that same thing as being familiar with a few basic complexity classes. I wouldn't be surprised or disappointed if a self-taught programmer was intimidated by big O notation, but I would be surprised if they were unfamiliar with the concept that hash map lookups are much faster than array searches, or that searching a sorted array is much faster than an unsorted array. You seem to be using "big O notation" to refer to fundamental competency about basic data structures. It's even quite possible and understandable for a self-taught programmer to, over time, figure out that certain big O classes refer to certain algorithms while still not understanding the meaning of the mathematical notation.
Just curious: is this a one-time immediate check for an MX that responds?

Say, for example, that example.com has only a single MX and for whatever reason (server is down, network connectivity is broken, etc.) it is unreachable or unresponsive at the exact time you test. Would that constitute a "fatal error" in your validation process?

If there is a single MX RR but it "expands" to multiple hosts (multiple A RRs), do you test a second one if the first doesn't respond?

TIA!
It depends on context. Generally if people fail to specify, they mean average case, as in "Quicksort takes O(n*lg n) time". There may even be some amortization shenanigans thrown in there, as in "list.append takes O(1) time".
Building a company the Steve Jobs way
Considering that the US Government no longer considers things like waterboarding and sleep depravation to be torture, I take little comfort in Holder's statements.
They should try and publish it with the cambridge lot who write the light blue touchpaper blog.

http://www.lightbluetouchpaper.org/

They ran into a similar situation with the banks and answered with one of the best academic slap downs I have ever read.

http://www.cl.cam.ac.uk/~rja14/Papers/ukca.pdf
http://www.youtube.com/watch?v=z1MXuBAxcdM
Maintenance is a monthly fee, forgot to mention that. Sometimes clients do call in unfortunate situations, but they pay for that privilege. All additional services are opt-in.
Note that it is a requirement of domain name registration that contact information be present and be correct. You have to agree to that in order to own a name http://www.icann.org/en/resources/registrars/consensus-polic...

It isn't possible to tell the difference between the contact details being incorrect, and them being correct but the recipient choosing not to answer. But that is why the registrar gets to verify the details are indeed correct, and not the reporter. The registrars are allowed to take action to prevent spam and similar actions against usage of the contact information.

So what should happen is that apparently uncontactable domain owners are reported, and the registrars catch the slimy peddlers.
PGN isn't a format designed for parsing convenience. PGN is the exact notation any chess player uses for writing down games. I would never write down 1.e2-e4 for instance when simply 1.e4 is totally apparent. I find it very confusing when too much information is presented in this case. In the same vein, whenever you are presenting chess notation to a human it is preferable to not show the long notation. So any time you would want to display the notation of a chess game(which is pretty much everytime) you would need to parse the game with a program that understands the rules to produce the shorter notation.
Ah, I think I had seen that but forgotten to note it. Thanks.
Is it better for them to publish the codes or to sell them to some thieves? I'd imagine the latter is worse ...
The kind of thing they're referring to is commonplace in Russia, unfortunately, so you can't exactly blame them for thinking that: http://en.wikipedia.org/wiki/List_of_journalists_killed_in_R...
I'm intrigued by the claim that the Haskell code is correct in a concurrent environment. If I run two copies of this function concurrently, won't they step on each others' toes as they fight over the file offset of stdin?
Let P(F|D) = .001 (assuming 1 in 1000 chance foul play was involved given a death of a speaker at a conference)

P(F|D) = P(D|F)P(F)/P(D)
= 1 0.00002 / 0.0017
= 0.018 (chance of foul play for a single speech given the speaker died 1 month before)

Is this a typo? I don't understand how you're finding two different values for P(F|D).
So you're telling me the official rails policy is: we think you (developers) are smart enough to build an app that works on a distributed cluster but aren't smart enough to work out how to use a central/replicated system for session storage.

At the very least cookie storage should be an opt-in for apps that need it, not a default with apparently not enough warnings about the security aspects
This looks pretty awesome and my first thought is it would be sweet if it was integrated into common webmail software.

I work for an ISP and we, of course, provide e-mail access via webmail. Right this moment, I can see dozens and dozens of e-mail messages queued up on our outbound relays that will never be delivered because the user typo'd the recipient's e-mail address.

An amazingly high number of messages bounced back to our users (the original senders) are due to typo's like this. Some people, despite not being "techies" can skim over a bounce message and realize they misspelled "live.com" and will resend. Others, well, they call support wanting to know why they suddenly can't e-mail Aunt Sally.
Yep, we miss this command too
How long does it take before a device is active? I'm stuck on the activation screen in iOS7 :(
Quicksort is the exception, in my experience big-O usually refers to worst case running time as opposed to average case or expected running time. CLR(S) [1] sticks to worst case because 1) worst case is a guarantee; 2) the worst case can be frequent; 3) the average case is often roughly as bad as the worst case. This is a widely used textbook, so I generally assume a lot people follow its conventions.

[1] https://mitpress.mit.edu/books/introduction-algorithms (Introduction to Algorithms)
Did anyone check to see if he had his fingers crossed behind his back when he said it?
Life is fragile.

I had a friend of mine drop dead of a heart attack at the ripe old age of 27.
What you said is not very correct too!
Big O tells about the "order of Growth of a function or the Growth rate", that's it. It gives a larger view of the function. Seeing from 1000 feet above the ground.

Link: http://web.mit.edu/16.070/www/lecture/big_o.pdf

My understanding --

A bounding function is when we know the exact function and its end-points from an algorithm. We know the extremes. i.e C1 and C2. i.e a Function falls within that boundary, it will always stay within that box(end-points). C1 and C2 are 2 lines, making a rectangle.

- Worst case, Best case, average case are different input cases, under which the algorithm grows in different ways. And we use BigO notation to classify them under easier functions, based on the order of Growth of a function.

And unless we don't know that exact function, its not possible to predict for any input variables.
So don't call Big O as any bounding function, unless we know c1 and c2 <end bounds>.

- Big O is a notation that characterizes functions according to their growth rates.

- Different functions with the same growth rate may be represented using the same O notation.

- The letter O is used because the growth rate of a function is also referred to as order of the function. A description of a function in terms of big O notation usually only provides an upper bound on the growth rate of the function.
It would be really nice to know how they legally interpret "torture" and "kill" since so many other common English words often mean completely different things to the U.S. Government.
Achieving Greatness Is A Choice
Been dying for this in MV since GrubHub and Seamless have terrible selection / high delivery costs on a per restaurant basis.

Only junk food is available on a regular basis.

No kids in my case, just lots of side projects to shepherd, rather not spend time to cook or go out.
The math of Big-O isn't that hard and the article while having good intentions misses the point. Big-O is about asymptotic behaviour and the graphs are misleading in that regard (well, they're simply wrong, not misleading). There are algorithms where if you just look at the Big-O you'd think one has faster run time than the other but because the constants fall out that wouldn't be the case for any practical problem size.

What O(N) means is there is some large enough number where the run-time (edit: or any function really) is bounded by a constant times the input size for any input size larger than that number (see, math, not hard). That constant may be so large that an O(N^2) may be a better solution for any practical purpose.

EDIT: As an example of this we can look at two multiplication algorithms, Karatsuba and Schönhage–Strassen, the latter having better asymptotic performance but that really kicks in once you have large enough numbers (100,000 digits or so). ( http://en.wikipedia.org/wiki/Sch%C3%B6nhage%E2%80%93Strassen... )
One way to read this article is as a call for a chip slicing method for the masses.

It would seem quite a tractable problem for a keen hobbyist. Build a robot, something like a 3D printer in reverse, to alternately remove thin layers from a chip and image the newly exposed layer, until the chip is gone. Use a program to assemble the images into a 3D representation and extract the circuit.

In fact, such a project would be a relatively simple way to start gaining the knowledge required for the reverse process, of building a chip.
Last year rewards programs like Five Stars were hot. This year everyone wants to do deliveries. Sucks to be waiter.com these days.
Don't they realize how weird it is for them to have to be spelling it out like this? There's a bigger problem when it's just assumed by everyone the government is going to do this...
Also because the US government lies, even using its own definitions of terms.
Snowden is charged [1] with:

* 18 USC 641 - Theft of government property
* 18 USC 793(d) - Unauthorized communication of national defense information
* 18 USC 798(a)(3) - Willful communication of classified communications intelligence information to an unauthorized person

None carry the death penalty. All carry a prison sentence of "not more than ten years."

[1] http://apps.washingtonpost.com/g/documents/world/us-vs-edwar...

[EDIT formatting]
No, but he plays one on TV.
Unfortunately, there is basically no trust left in the US Government. They've used it all up. Why would Snowden believe proven-to-be pathological liars?

The US Government will put you in solitary confinement for years and waterboard you and it's not considered 'torture.'
I wonder if this constitutes the administration's promised response to the Snowden pardon petition[1]

[1]: https://petitions.whitehouse.gov/petition/pardon-edward-snow...
For apps that are explicitly used to contact people, sure, accessing the addressbook is assumed. But there should not be an option in any app to "tell everyone in your addressbook about this app!", and apps that do this behind the users back (or worse, mine addressbooks for email addresses) should be outright banned. There's a reason I hand out individualized email aliases, even to friends: far too much risk that they will leak the address, intentional or otherwise, and I can disable the alias at a whim.
14-year-old Developer Creates SMS Notification System for Apple Dev Services
Anything @example.com is actually invalid due to it being reserved by RFC 2606.
Just fyi, you can tab a link with the "More" link at the end of the descriptions.
Of course, we're talking about a government that is in this predicament precisely because they just ignore the law when convenient.
Aside: Does anyone know how these slides are generated?
It's not that weird, since they are known to torture whistleblowers.
Lightweight Threads, Channels and Actors for the JVM: http://blog.paralleluniverse.co/post/49445260575/quasar-puls...