a1k0n

10 ms·

61.
by a1k0n 10y ago
So SigOpt was tuning rank (number of latent factors), number of iterations to run the algorithm (in my experience alternating least squares generally converges within 10-20 iterations, but there'd be no downside to running it longer un
62.
by a1k0n 10y ago
I tried to use the Range header feature to resume downloads in an autoupdating app once, and it worked beautifully...for about 90% of users; the others had all kinds of weird issues thanks to transparent proxies and caches not handling the
63.
by a1k0n 10y ago
Why Korn shell? Is there something special about the way it handles being run w/ a setuid bit?
64.
by a1k0n 10y ago
From the context it's obvious that 0x0 is right. AX must be 32 bits (or 64 bits) wide. https://github.com/golang/go/blob/fad2bbdc6a686a20174d2e73cf...
65.
The GlEnd of Zelda(): Automatic 3Dification of NES Games(cs.cmu.edu)
1 points by a1k0n 10y ago|0 comments
66.
by a1k0n 10y ago
320x200x256 colors was referred to as MCGA, but nobody actually had an an MCGA card.
67.
by a1k0n 10y ago
Having to manually inspect the call stack depth as a best practice seems like a design flaw... why doesn't send() itself throw an exception? And does an exception roll back the entire contract or would it leave it half executed?
68.
by a1k0n 10y ago
They do both; there's a parametric synthesis module later on in the video. It doesn't work all that well for water.
69.
by a1k0n 10y ago
Or you could just lift the MOSI/MISO/SCK/CS pins off the board with an iron and tweezers and power it up normally. The pin pitch on this one is relatively big, shouldn't be too hard, definitely easier than removing.
70.
by a1k0n 10y ago
I wonder: Did Square/Matasano end up hiring many people from this? It was a super fun challenge either way...
71.
by a1k0n 10y ago
I'm glad you mentioned that, because I had just turned it to "No" while reviewing that page. Now I'm confused.
72.
by a1k0n 10y ago
That would be pretty impressive, considering the only data structure included in scratch is a list, and it's pretty cumbersome to address.
73.
by a1k0n 10y ago
How does this compare to OpenSCAD?
74.
by a1k0n 10y ago
That's right, I was, but on further reflection you don't need to do anything special in this case since it's just doing 32 bit math, not 32 bit addressing. EAX/EBX/etc should just work in real mode IIRC.
75.
by a1k0n 10y ago
ΣnFib(n+2)x^(n+2) is F(x)−x−1 because it's an infinite series of powers of x, except since it's x^(n+2) then x^1 (x) and x^0 (1) never appear, so you need to subtract them from F(x) which is ΣnFib(n)x^n. I hope that's clear a
76.
by a1k0n 10y ago
You don't even need to be in protected mode to use 32-bit registers. You can sort of bounce in and out just enough to use them with the 66 prefix. I used to do that but it's been so long I forgot how.
77.
by a1k0n 11y ago
Usually it's because as it searches the move tree, it finds ways for the opponent to maximize their own winning probability and so has to hedge against that. In minimax games sometimes the evaluator finds a long chain of moves that lea
78.
by a1k0n 11y ago
Check out Concise [0] or Roaring Bitmaps [1] before rolling your own compressed bitset scheme. Wish I had known about these sooner. (I realize now this is offtopic, as this is bit fields not bit sets; nevermind, but still it's interest
79.
by a1k0n 11y ago
You wouldn't, for statistics. That's my point. Only in number theory problems do you actually need bignums for factorials, and those are usually toy problems or modulo some big prime. I don't know of any actual applications w
80.
by a1k0n 11y ago
Depends what you need them for... In statistics, factorials appear in normalizing constants for various distributions (e.g., Poisson) and often you're working with floating point log-probabilities, in which case you can use the log-gam
81.
by a1k0n 11y ago
It is all of those things. The language is just a bit overwrought.
82.
by a1k0n 11y ago
Tay Zonday's response is hilarious. "It is hard to create Derrida’s fracture in the repetition of power structures when the loins of civil society log every person’s digital utterance."
83.
by a1k0n 11y ago
This is awesome! Way easier than installing anything that tries to do everything for you, especially if you have a non-traditional setup. One caveat: AWS CloudFront requires the domain key to be 2048 bits instead of 4096. Other than that, w
84.
by a1k0n 11y ago
I submitted this yesterday, and then someone re-submitted this today, and the auto-resubmit logic apparently just kicked in for my post. You can see on https://news.ycombinator.com/submitted?id=a1k0n that it was submitted &
85.
A Cabinet of Infocom Curiousities(ascii.textfiles.com)
15 points by a1k0n 11y ago|2 comments
86.
by a1k0n 11y ago
Not a bad chiptune either: http://www.a1k0n.net/code/jsxm/#Ghidorah_-_Toilet_story_5.xm
87.
by a1k0n 11y ago
edit: THANK YOU! That was the issue; I had to make a dummy oscillator. And, separately, there was a CSS issue which made the buttons black on black. Now it works on iOS.
88.
by a1k0n 11y ago
On second thought you're probably right; this API will probably break in a couple years and my player won't work anymore, just like everything else that tried to use createJavaScriptNode in the past is now broken. Hopefully the we
89.
by a1k0n 11y ago
Yep. Just added drag-and-drop to the player window; drag a local .xm file onto it to load it. Only tested in Chrome.
90.
by a1k0n 11y ago
Haha, sure, let me push some fixes to the github repo. RIP script, OMG. I remember that. With HTML canvas, shouldn't be too hard, though it would be weirdly high-resolution.

More ›