skysight-inc/HackerNews huggingface dataset:
Actually, to the contrary. It's all about SDN.

It provides open interfaces to interact with the switch through several means like OVSDB, REST API ... or CLI. OpenFlow is not supported yet although will be in near future.

Since it's open source, it also gives you the opportunity to run other agents in the switch control plane ... which is hardly possible with IOS or JunOS.
The rise of the zero-day market
PHP wasn't always what it is now, that's OPs point. They are where they chose to go. Probably in the search of legitimacy, they chose to follow the most enterprisey language.
tl;dr; It's not really about democracy at all, that's just a post-hoc justification for your anti-corporate agenda.

Incidentally, badly implemented environmental or discrimination laws can also negatively impact quality of life, just as badly implemented trade laws can. Why aren't you concerned that bad workers may file bogus discrimination lawsuits, just as tobacco companies file bad lawsuits. (See Ellen Pao as an example.)

But I guess that stuff doesn't count, because it doesn't inspire the same negative feelings in you that corporations do.
TeMPOraL updated his original post with a link to exactly what he was describing: A thorough understandable explanation of the TPP https://www.reddit.com/r/explainlikeimfive/comments/3nl4sz/e...
This works well when your users are technical. On a IPTV project I worked on the support process for our customers' network engineers was to call my cellphone. On a CCTV project where some users barley knew how to use a computer and one (not uncommon) problem was that user stopped paying the bill it didn't make sense to spend development time on 99% of support calls.

IMO the trend towards insulating developers is more of a reflection on how "mass market" technology is now compared to in decades passed than anything else.
> People often underestimate the difficulties of getting a hack to work and overestimate how long doing something correctly will take.

Yes. And sometimes one of those people is your boss.
We are way touchier about anything that might be a personal attack on HN these days. I think it's a good change. I'm sure I'll run afoul of the new norms regularly, but I also think it will make me a better writer.
In a lot of languages there is several different ways to do seemingly the same thing, and it often helps knowing the history to understand why they got added but also why they got replaced.

Concurrency in C#/.Net is a good example. There is three[0] or more ways of doing concurrency, and without understanding the history, it seemingly doesn't make sense. C++ is another good example, in particular in C++14, it is important to understand C++11 to port code, but also understand why some things are done differently in C++14 (rather than just knowing that they simply are).

[0] https://msdn.microsoft.com/en-us/library/hh156548%28v=vs.110...
No it isn't. It's part of the superordinate clause (a), and you can tell that because the subclause of (ii) that you mention has further subclauses ((A),(B),(c)) which end with a period. Think about how this would be indented:

1. *Blah blah blah.* Blah blah, blah blah blah blah blah:
(a) blah blah blah; blah blah, blah blah blah where
(i) blah blah, or
(ii) blah blah blah, blah:
(A) blah,
(B) blah blah, or
(C) blah blah blah.

Blah blah blah, blah blah blah blah blah. *<< this is still part of subclause (1)(a)*

(b) Blah blah blah [...]

One of the depressing aspects of this whole TPP/TTIP debate here on HN is that although most people here either write code for a living or at least know how to do so, very few have ever thought through the fact that there are rules of scope in legal documents as well.

I appreciate that such documents are very confusing, even more so when they are in draft form and include multiple 'live' options (rather like improperly declared constants in programming), and more so again when they're presented as just a big wall of text without any typographic structuring that would make them easier to read. Parsing such complex documents is difficult; if it were easy then courts would be less busy than they are. But a great deal of the 'analysis' of the impending trade agreements (as well as other legal stuff that is sometimes posted to HN) seems to start with an assumption about meaning or purpose, and then go through the text looking for clues to back it up. This is a fast track to self-deception and eventual defeat in the event of a dispute.

I'm not a lawyer, just a law nerd.
Didn't see a single plus sized model, nor anyone over late-20s I guess they decided that wasn't a market they cared about. Maybe why they are bankrupt now.
For example, in a user session with 5 page views that
load 40 resources per page, how many users will not
experience worse than 95%’ile of HTTP requests? The
chances of not seeing it is ~.003%.

This is assuming complete independence, which is very wrong.
The training of O....do no read it!
Cool, I always liked OS2, but I wonder what the chances are for this to succeed? Even reactos is far from complete, and the window for Win2k-2003 compatibility needs is shrinking.
this is usually the case for low quality submissions
Ship.io apparently never raised money according to CrunchBase, which means this shouldn't be that unusual.
> There are whole groups of people who serve to insulate developers from the real world. Customer Service. Q/A. Devops. You name it. And why do these groups exist? They exist because each of these are areas where software developers have failed so badly at that companies have had to defend themselves by creating whole new departments and management structures.

What do you suppose would happen if there were an 800 number that every Microsoft customer could call to get a direct line to their Windows or Office dev teams.
Require a hefty retainer up front. The retainer should be applicable against final invoice. This means you get a check upfront, then bill against the work you've done on a regular cycle and get checks for that work, except at the end where the money you got paid upfront covers the last part of the job.

The idea is that instead of the client always owing you money, you always owe the client work. The goal is to avoid people who don't pay. Good clients recognize that you shouldn't be assuming the financial risk of their project. Good clients are also ready to write checks.

A potential client who isn't prepared to write a retainer check upfront hasn't properly budgeted for your services. Often, they never will. A potential client who isn't ready to write checks, isn't ready to start their project.

Good luck.
It has been picked for a long time now, so it is hard to put yourself in the heads of the designers at that time. Having said that, PHP OO (like C#, ActionScript, etc at that time) was probably inspired by Java for pragmatic reasons.
Traction – New Book Launch Backed by Exclusive Compass Data Analysis
Ah, so you like that it's undemocratic. That's a different thing entirely.
But you, like the OP, fail to communicate exactly WHY this is a bad thing. You just take it for granted that your point stands on its own without an explanation.

Why NOT Java?
Curious - are AWS's EU clusters subject to EU laws, or US ones? I would've thought that as a US corporation, they'd be subject to both. If the US government has a warrant to snoop on Amazon's customers, it doesn't seem like Amazon has much choice (as a US corporation) but to comply.
Your proposed system sounds a lot like https://flattr.com/

I, too, have thought about a system like what you describe ($25 a year, distributed to each thing you visit). However, there are some issues.

1) You say 1/3 of a cent per visit... what happens after you visit 7,500 sites in the year? Where does the money come from at that point?

2) Say that instead of a 1/3 per year fee, you just take the whole $25 and divide it by the number of sites I visited...so if I visited only 5 sites in the year, they each would get $5, but if I visited 25,000 they would each only get 1/10 a penny. The question then becomes, how much is a reasonable amount to charge per year, if we are going to charge the same rate to everyone? Should someone who consumes much more pay more, or is it a flat rate?

3) No matter your system, there are going to be issues of content. Does a click-baity article that takes 10 seconds to read cost the same as a 10 page, in depth and well researched, article? You are going to incentivize people to make cheap and quick content, since you are not rewarded for anything besides clicks.

I also think your analysis of piracy being a result of pricing something above what it is worth to be a bit of a stretch; no matter what something is worth, if you offer the same thing to me for free, I will take the free.

To give an example: Suppose I was selling $10 bills for $10, and the guy next to me was giving away $10 bills. Everyone will obviously take the free $10 bills from the guy next to me - that doesn't mean I was selling the $10 bills for more than they were worth, it just means that people will always choose to pay less for something no matter what it is worth.
Which is, in fact, exactly the model of Google Contributor.

Puts $5 each month into a bucket, and then each time you visit a site you pay a few cents in order to have an ad-free experience.
Google posts Android 6.0 Marshmallow system images for Nexus devices
Grooming Students for a Lifetime of Surveillance
Off the top of my head, for an example of a sticky post, check out this[0] entry point to Ukrainian Conflict on /r/worldnews, which also links to this[1] sticky post on /r/ukraine. Also be sure to see the live thread[2], which has been going for something like two years now.

EDIT or check out [3] on NSA leaks. Less discussions there, but find me a better place to find all the information about pretty much every single leak and surveillance-related story recently. Be sure to check out the sidebar - the list of posts is sortable by topics and there's also a Wiki.

[0] - https://www.reddit.com/r/worldnews/comments/1w4090/ukraine_r...

[1] - https://www.reddit.com/r/ukraine/comments/1vuj6v/ukrainian_p...

[2] - https://www.reddit.com/live/3rgnbke2rai6hen7ciytwcxadi

[3] - https://www.reddit.com/r/NSALeaks/
I am a second time founder. I would say go acquire them manually. Go ask them in person.
Yeah, understood, but what I mean is that I don't want to watch 17 year old bootleg tapes that random people have uploaded to YouTube, I want Viacom or somebody to actually put this content online in whatever is the best quality they have.
How does that work? I use soundcloud and bandcamp heavily, follow hundreds of artists but I have never come across someone with a flattr account.
Do you understand that this whole article is designed to point out the major losses from categorically excluding developers "not compatible with the culture?"
Because it's unsecured debt. Cannot take an 'education' back. You can take back a house or a car. People with low or no income only get small credit lines.
Imogen Heap Releases “Tiny Human” on Ethereum blockchain built by ConsenSys [pdf]
>Facebook is explicitly designed to primarily be a platform for "real world" relationships

Good thing the developer can't control how people decide to use their software. I don't understand this obsession with wanting to force people to not use a pseudonym and only add friends who they know in real life. How does it affect you negatively to know that others use the service in a different way than you?
> Which language?

Haven't you been paying attention? You're supposed to write your security-critical code in a language that was released 5 months ago and has no major deployments yet.
Location: Moscow, Russia

Remote (Maybe)

Willing to relocate:Yes

Technologies: C++/C++11, Python, OpenGL

Résumé/CV: http://goo.gl/GZ7xoa

Email: gmanukyan@gmail.com

Experienced C++ software engineer. Looking for challenging and interesting projects.
> TL;DR: people accusing me of being sarcastic are probably missing out on one of the few bullshit-free sources of information on the Internet.

My experience with Reddit has been that, like most other places on the Internet, it's a mixed bag.

Specifically, some of the moderators are authoritarian dicks (e.g. /r/technology) who evaluate rules without nuance and ban people for sharing a link even when given explicit permission by another moderator to share it.

Other subreddits are a bit better (e.g. /r/php), others are probably worse. My opinion of /r/netsec has changed frequently over the past few months.
> Xkcd estimated that Google owns 2 million machines

Xkcd doesn't sound like a very convincing source. And at least this estimation should have some error-bars.
Huh. You'd need a closurescript wrapper around MiniMongo which is the in memory mongo database that powers Meteor's isomorphic code. But in theory very doable.
the higher-end switches take considerable engineering, just on the hardware side, and are fairly high-margin products. If the networking equipment space becomes OS agnostic, or consolidates around OpenSwitch, this removes one of Cisco's major advantages (their huge installed-base, network OS dominance, customer switching costs), and allows HP (and others) to compete directly on network equipment hardware architecture/performance/cost. More competition in that area would be a very good thing (maybe not so good for Cisco's dominance). It's also good to decouple the hardware from the OS/software, and allow innovation in both areas independently.
> Here’s a letter Watney writes for Johanssen in case he dies. Johanssen is the “hot chick” on the mission. He also tries to tell her how to dress and how to act. Perhaps Watney also wanted her to smile more.

> > Johanssen: Your poster outsold the rest of ours combined. You’re a hot chick who went to Mars. You’re on dorm-room walls all over the world. Looking like that, why are you such a nerd? And you are, you know. A serious nerd. I had to do some computer shit to get Pathfinder talking to the rover and oh my god. And I had NASA telling me what to do every step of the way. You should try to be more cool. Wear dark glasses and a leather jacket. Carry a switchblade. Aspire to a level of coolness known only as…“Botanist Cool.” Did you know Commander Lewis had a chat with us men? If anyone hit on you, we’d be off the mission. […]

I haven't read the book but isn't the "dark glasses and leather jacket" bit here Watney paraphrasing what he was told by NASA to do? Not Watney telling Johanssen what to do?
Sure, there are orchestras that are closing down, but there are also a lot that are thriving (mostly in big cities). Are there really a lot of people who want to be able to go to an orchestra performance but are not able to because there isn't enough supply?

There is the issue of location (i.e. you have to live in or near a big city to be able to go to an orchestra), but that is a consequence of the physical world (you need to be close to something to visit it, and for niche things like an orchestra, there will only be enough people to support it in a big city). This isn't the case on the internet - if your worldwide market is small, you can still reach them wherever they are.
I don't have the time to jump through hoops to maintain promotional pricing for a NYT subscription. Maybe a sufficient long term discount would be attractive, or unbundling content. The NY Times just doesn't offer enough value to warrant the asking price for my tastes.
I used pencil and parchment...
Hey, I really appreiate your reply. This case is taking plae in Toronto and I have little to no money to pay you. I really do appreciate your feedback.

CEO is saying that since I got the idea while working for him, he believes that he deserves all of my project. They have money so they got a lawyer sending me mail saying I should stop it.

I talked to lawyers in the field of employment, IP and corporate to see if there is any issues. So I am clean. But they want to stop me from raising money by sending me statement of claim.
Takeaways from Mobile Web Behavior
Jet Makes Emergency Landing in Syracuse After Pilot Dies
I think you're approaching this from a justice angle: who is responsible, who should pay. I think akamaka is approaching this from a system perspective: what enabled this to happen, what can we change to avoid it?
More on this little computer:
http://www.gemalto.com/techno/sim/
The citation: http://www.informit.com/articles/article.aspx?p=2213858

I've come to believe that P = NP, namely that there does exist an integer M and an algorithm that will solve every n-bit problem belonging to the class NP in nM elementary steps.

Some of my reasoning is admittedly naïve: It's hard to believe that P ≠ N P and that so many brilliant people have failed to discover why. On the other hand if you imagine a number M that's finite but incredibly large—like say the number [really big number] discussed in my paper on "coping with finiteness"—then there's a humongous number of possible algorithms that do nM bitwise or addition or shift operations on n given bits, and it's really hard to believe that all of those algorithms fail.

My main point, however, is that I don't believe that the equality P = NP will turn out to be helpful even if it is proved, because such a proof will almost surely be nonconstructive. Although I think M probably exists, I also think human beings will never know such a value. I even suspect that nobody will even know an upper bound on M.

Mathematics is full of examples where something is proved to exist, yet the proof tells us nothing about how to find it. Knowledge of the mere existence of an algorithm is completely different from the knowledge of an actual algorithm.

For example, RSA cryptography relies on the fact that one party knows the factors of a number, but the other party knows only that factors exist. Another example is that the game of N × N Hex has a winning strategy for the first player, for all N. John Nash found a beautiful and extremely simple proof of this theorem in 1952. But Wikipedia tells me that such a strategy is still unknown when N = 9, despite many attempts. I can't believe anyone will ever know it when N is 100.

More to the point, Robertson and Seymour have proved a famous theorem in graph theory: Any class of graphs that is closed under taking minors has a finite number of minor-minimal graphs. (A minor of a graph is any graph obtainable by deleting vertices, deleting edges, or shrinking edges to a point. A minor-minimal graph H for is a graph whose smaller minors all belong to although H itself doesn't.) Therefore there exists a polynomial-time algorithm to decide whether or not a given graph belongs to : The algorithm checks that G doesn't contain any of 's minor-minimal graphs as a minor.

But we don't know what that algorithm is, except for a few special classes , because the set of minor-minimal graphs is often unknown. The algorithm exists, but it's not known to be discoverable in finite time.

This consequence of Robertson and Seymour's theorem definitely surprised me, when I learned about it while reading a paper by Lovász. And it tipped the balance, in my mind, toward the hypothesis that P = NP.

The moral is that people should distinguish between known (or knowable) polynomial-time algorithms and arbitrary polynomial-time algorithms. People might never be able to implement a polynomial-time-worst-case algorithm for satisfiability, even though P happens to equal NP.
I find an instance of 'New Incognito Window' is a good way to view that site.
New rights for UK consumers buying digital content come into force
How often do you expect a 1000-year rain?

No, that's not a trick question. You expect it every 1000 years - in any one location. But how many independent locations are there where you can have a 1000-year rain?

This gets trickier in the US. In Europe, they know what a 1000-year rain is - they have records. In the US, they have guesses.
If you're an active twitter user, you likely know how it works. But otherwise, the @ mentions etc. are not very simple w/o somebody teaching you. And even after that, it can seem difficult.
>*
>*
>*

I generally agree with all of that and I don't think I have made a claim that contradicts your summary.

I haven't re-read this entire thread in awhile, but I believe you came into this seeking a clarification to what I was asking on a different thread. The reason it might seem like I am only piecing you pieces of information is that I am just responding to your questions and points as I perceive them to be related to my memory of what that thread was about.

If the search space is finite for problems of a certain length [it is], you may be able to uniformly sample from the instance space of a given problem and attempt to derive a statistical characterization of a given algorithm.

I do not now if iteratively sampling integers from a uniform distribution is the "best" way to search the space, but it seems like it would give you a reasonable/interesting map of a particular area. The only intent of the exercise was to explore.

To a part of your point:

>Most instances are easy, but you/he need to show that the algorithm runs sub-exponentially on all instances, not just the easy ones.

Absolutely, a proof requires showing all instances can be solved by a single [deterministic (non-non-deterministic) [etc....insert your own word here]] algorithm in polynomial time of the length of the instance (Edit: On second read, I might change this to 'problem' [which may need to be distinguished from Problem]).

I have not seen that, so I do not claim or claim to know of any P=NP proof.

>The whole point of all my comments is that claiming sub-exponential running time on specific examples/instances is no proof, and poor evidence.

The point of my question was to get instances (simulated or real) to feed to this person's algorithm to see it could actually solve problems people want solved quicker/much quicker than competing algorithms. Additionally, I am interested in the topic more generally and was looking for speculation on which problems (and instances) might be the most "beneficial" (as defined in our conversation) to solve (ie. give to a hypothesized solver that you trust to solve in a given polynomial time of the length of the problem).

Since it is impractical to search the entire instance space for problems of larger than some smallish length, you may test an algorithm with a specifically [Aside: I believe this may be implied by 'algorithm'...though the halting problem may prevent such arbitrary analysis of running times...] claimed polynomial limit on the running time. Any (hypothesized) P=NP exploiting solver would (speculative) make a polynomial-time running claim that could be tested.

I don't know what running-time limits he has put on his algorithm. It is one of the reasons I am skeptical of his proof.
Real-life targeted advertising: bus-stop ads that scan your face, look up your private browsing history, and try to sell you the complete works of Nickelback or something equally embarrassing.
China’s First Nobel Laureate in Science
This is how you build a design-driven culture
No, we require our social networks to provide us with meaningful, usable, robust privacy controls. When they don't do well enough at that (difficult) task, we insist on our own privacy measures, such as pseudonymous use.
More like how the King of Belgium colonised the Congo as a private citizen, or the East India Company colonised India.
main repository is indeed at git.openswitch.net where it's paired with Gerrit for code reviews (review.openswitch.net).

Github mirroring will be set up in about week.
We've built a pretty cool library for Express that makes it easy to do WebSocket stuff through Pushpin (a proxy server). http://blog.fanout.io/2015/03/09/stateless-websockets-with-e...

Not that this was covered in the article, but it would be a reason to choose Express as the backend. It would be cool to build something similar for Koa though.
But what about sunk costs?
For a 21 year old prodigy developer, what are some of the best options?