vitus

12 ms·

121.
by vitus 2y ago
I am not saying that we are wasting 25% of our compute costs on QUIC, but rather that we hit many other bottlenecks far before we hit that point. > Having done the majority of a QUIC implementation myself, achieving (on the non-encryptio
122.
by vitus 2y ago
> To increase the number of machines under power constraints, data center operators usually cap power use per machine. However, this can cause motherboards to degrade more quickly. Can anyone elaborate on this point? This is counter to m
123.
by vitus 2y ago
> ~7 Gbps per core seems really slow for an actual quality production implementation Not really? With a 128-core machine , that's in the ballpark of 900 Gbps; you're hitting other bottlenecks far earlier than that. And in prac
124.
by vitus 2y ago
> They also describe an attack against 11-round AES-256 that requires > 2^70 time—almost practical. But... nobody uses 11-round AES-256. And, crucially, these are related-key attacks, not practical for, say, breaking TLS
125.
by vitus 2y ago
It is shuffled badly, and not at all uniformly. And heavily implementation-dependent. https://stackoverflow.com/questions/962802/is-it-correct-to-... An example of this out in the wild: https://www.robw
126.
by vitus 2y ago
> I made a shell script "hg" which stands for "history | grep." Not a Mercurial user, I take it? (hg is the standard command for Mercurial.)
127.
by vitus 2y ago
My favorite example of RNG misuse resulting in sampling bias is the general approach that looks like `arr.sort(() => Math.random() - 0.5)`. > you're lucky if one person asks whether the random bytes are cheap (and so they should
128.
by vitus 2y ago
Eh, it depends what you mean by "works". If you mean that if you add new songs in the middle of playback, it doesn't guarantee that every song is played exactly once before any are repeated, sure, but you can't really do
129.
by vitus 2y ago
> Say I have a 20 song list, and after listening to 15 I add five more. How does this approach only play the remaining 10 songs (5 that were remaining plus 5 new)? It doesn't. If you add 5 more songs, then the algorithm as presented
130.
by vitus 2y ago
> I think shuffle should be a single list of all songs, played in a random order. But that requires maintaining state, detecting additions and updating the list, etc. You should be able to accomplish this with trivial amounts of state (a
131.
by vitus 2y ago
> A professor I had in college, whose first published result was from a piece of homework he turned in where he incidentally solved an open question about bound on a problem, had a curious habit. A related anecdote is about George Dantzi
132.
by vitus 2y ago
> it was for them somewhat problematic at times that the siblings had different surnames (Björnsdottir and Björnsson), as people don't assume they're family, and especially not that the parents both had different surnames again
133.
by vitus 2y ago
> Why is it this way? As best as I can find it's so that destructors always run in reverse order of construction, I guess there could be some edge cases there that matter. It's not the strongest argument, but it's not noth
134.
by vitus 2y ago
Yeah. It has its uses. You could accomplish the same with the rather verbose `counts.try_emplace(thing).first->second++` but nobody wants to type that (even if it is more explicit about what it's doing). Another popular use case is
135.
by vitus 2y ago
> Why does construction and destruction order need to be deterministic? That question presupposes a particular compiler implementation of designated initializers. Indeed, C90 had the fixed-order requirement until C99 decided this was unn
136.
by vitus 2y ago
> "preventing themselves from accidentally mutating a variable" (when has that ever happened?) I can't count the number of times I've seen someone new to the language use map::operator[] without realizing that it&#x27
137.
by vitus 2y ago
Off the top of my head, C++17 brought slicker notation for nested namespaces, digit separators for numeric literals (so you can more easily read 1'000'000'000), improvements in type deduction for pairs / tuples (so std:
138.
by vitus 2y ago
Actually... https://developer.mozilla.org/en-US/docs/Web/JavaScript/Refe...
139.
by vitus 2y ago
There wasn't a honey farm involved, though. It started with a picture of Xi and Obama likened to a picture of Tigger and Pooh, and then the comparisons just kept coming. The part about it being seen by the CCP as mockery and disrespect
140.
by vitus 2y ago
Possibly a reference to the fake electors plot [0], although there was also the phone call to the Georgia secretary of state asking him to find 11,780 more votes [1], the pressure he applied to his VP to reject the election results [2], the
141.
Word Autobots: Using Transformers for Word Association in Codenames (2020)(ojs.aaai.org)
1 points by vitus 2y ago|0 comments
142.
by vitus 2y ago
> It is possible that the instructions didn’t try to make the gameplay as aggressive as possible. In case you're wondering, the prompts are available here: https://github.com/SuveenE/codenames-ai/blob/
143.
by vitus 2y ago
I am similarly less-than-impressed. If you click through to the website, you can watch the replay of one of the games mentioned in the article (the one with the clue "invader"). In that instance, the clues all matched 2-3 words, a
144.
by vitus 2y ago
> Does anyone actually use Paxos in real life? Yes, it's very widely used at Google through Chubby, which underpins many core pieces of infrastructure, including name resolution. (It used to be common practice to depend more directl
145.
by vitus 2y ago
Oh man, if you think Shannon's A Mathematical Theory of Communication is his most foundational contribution to computer science, you haven't seen his master's thesis from a decade prior. https://en.wikipedia.org&#x
146.
by vitus 2y ago
> No, wouldn't connecting to a slow 3g tower affect ping times to all global servers proportionately? Yep. Per the article (last point under "How it works"): > Users with a high latency to all servers can be excluded fr
147.
by vitus 2y ago
> Typedef'ing common types to your own type names is absolutely fine as long as it is unlikely to collide with the typedefs of other libraries in the same project. I read the parent post as indicating that "this is C++; we spel
148.
by vitus 2y ago
I would appreciate if the article spent more time actually discussing the benefits of websockets (and/or more modern approaches to pushing data from server -> browser) and why the team decided those benefits were not worth the purpo
149.
by vitus 2y ago
One small clarification: rather than cooking your pasta in less water, the paper actually describes boiling down the pasta water to further concentrate it ("risottata") by reducing its weight by 3x (presumably shifting your starch
150.
by vitus 2y ago
Are we also considering Brazil for EU membership, then, as the country with the longest land border with France? (French Guiana is governed by EU regulations, after all...)

More ›