moyix

39 ms·

361.
by moyix 9y ago
(2) allows smart contracts to securely get input from the outside world. So for example you can have a smart contract make decisions based on stock prices.
362.
TLS-N: Non-repudiation over TLS(tls-n.org)
81 points by moyix 9y ago|32 comments
363.
by moyix 9y ago
Small correction: Gelman is at Columbia, not NYU.
364.
by moyix 9y ago
The repeated use of the word "pirate" here is absurd. From a moral standpoint, the argument against piracy is that it deprives creators of their livelihood. In scientific publishing, creators (and even reviewers!) are not compen
365.
by moyix 9y ago
Based on your other replies, I suspect it's not worth engaging, but for anyone else reading, here's a great article by a math journal editor writing about all of the different attempts to disprove Cantor's diagonal argument h
366.
by moyix 9y ago
FEMA is saying they'll be there for years , not months: http://www.cnn.com/2017/08/27/politics/fema-harvey-brock-lon...
367.
Even Artificial Neural Networks Can Have Exploitable 'Backdoors'(wired.com)
3 points by moyix 9y ago|0 comments
368.
by moyix 9y ago
Cast it as a reinforcement learning problem: you produce a candidate decompilation, try to compile it, and score it based on the similarity to the initial binary.
369.
by moyix 9y ago
There was a paper that claimed those sorts of rotations and movements can help alleviate adversarial examples: https://arxiv.org/abs/1707.03501 However, OpenAI quickly refuted it by creating adversarial examples that c
370.
by moyix 9y ago
> we know nearly nothing about the effects of variation on complex traits like intelligence This is changing at an astonishing rate, though. The development of GWAS combined with huge genetic datasets and associated IQ test information h
371.
Correction of a pathogenic gene mutation in human embryos(nature.com)
1 points by moyix 9y ago|0 comments
372.
by moyix 9y ago
Well, this isn't exactly how I expected my PDB parsing library to end up on HN ;) The bytes/string changeover is probably the biggest pain point for RE tools written in Python2. Indeed, despite lucasg's excellent work porting
373.
by moyix 9y ago
Yeah, just to spell out how things work in CS for the things you mentioned: > Peer review Organized and performed by volunteers. > curating for quality Ditto. > editing, typesetting Done by authors (LaTeX isn't perfect, but it
374.
by moyix 9y ago
Yes: > Adversarial training seeks to improve the generalization of a model when presented with adversarial examples at test time by proactively generating adversarial examples as part of the training procedure. This idea was first introd
375.
by moyix 9y ago
Sadly there is no binary, only papers. Now, if someone could come up with a technique for automatically creating source code from a PDF description... :D
376.
by moyix 9y ago
Do you know if this talk will be recorded? I would love to watch but it is a bit far from NYC :)
377.
by moyix 9y ago
Another open source decompiler is fcd: https://zneak.github.io/fcd/ I quite like the authors' blog about the development of the decompiler, as it gives a lot of insight into how it works and what academic literatu
378.
by moyix 9y ago
A good decompiler can have a massive impact on the readability of the code. For example, here's a study where the authors found that their decompiler allowed students without reverse engineering expertise to approach the performance of
379.
by moyix 9y ago
You haven't linked the program in your assembly example. All the extra code you see there is a result of the libc startup code. Decompilers work starting from then entry point ( not your program's main), which is why there's
380.
by moyix 9y ago
Looks like it needs a constant folding pass, yep.
381.
by moyix 9y ago
As the author mentions, the CS231n course notes may be what you want. They build up many of the neural network primitives using just numpy and basic operations, so it's very easy to see exactly how it works at the code level.
382.
by moyix 9y ago
Have you read Scott Aaronson's NP-Complete Problems and Physical Reality [1] ? He goes into some detail about why analog computing is not thought to be physically realizable (Section 6). [1] http://www.scottaaronson.com&#x
383.
by moyix 9y ago
Yep, that looks like it. And you can go from there to his advisor's home page and see he's listed as one of his PhD students: http://csusap.csu.edu.au/~tzia/research.htm
384.
by moyix 9y ago
Depends on the university but often yes. If Craig Wright has a PhD you should be able to find his dissertation, look up his advisor/thesis committee, see his publications in CS conferences, etc.
385.
by moyix 9y ago
Yes. It would be nice if they hadn't taken 6 months to get around to it, though...
386.
by moyix 9y ago
The use of the term Proof of Concept goes back to at least 1984: https://en.wikipedia.org/wiki/Proof_of_concept#Usage_history I'm less clear on when PoC came into vogue, but I think it was likely in the 90s. Edit:
387.
by moyix 9y ago
I think many commenters here are viewing this only in terms of die cost. But the blog post is not about that: it's about the other costs that this complexity introduces! Each new feature interacts with all the others in complex ways, a
388.
by moyix 9y ago
I'm not sure compiler writers care that much; they don't have to support every x86 instruction and can restrict themselves to whatever subset produces fast code. Where it really kills you are things that have to analyze x86 bina
389.
by moyix 9y ago
Are you thinking of the adiabatic QC approach (i.e., the dwave machine)? I think they still haven't been able to show that it's faster than a classical approach for any problem.
390.
by moyix 9y ago
Which optimization problems are you thinking of?

More ›