mattb314

5 ms·

1.
by mattb314 1y ago
Super rough summary of the first half: in order to pick out random vectors with a given shape (where the "shape" is determined by the covariance matrix), MASS::mvrnorm() computes some eigenvectors, and eigenvectors are only well d
2.
by mattb314 2y ago
The idea is that memory-only data systems like HyPer are able to make design decisions that make them significantly faster that disk-based systems (eg postgres), even when the working set fits entirely within cache for the disk-based system
3.
by mattb314 4y ago
Wonder if this has anything to do with the sliding window: > Sonic only keeps the N most recently pushed results for a given word, in a sliding window way (the sliding window width can be configured) Default window looks like 1k document
4.
by mattb314 5y ago
> Joules-Thomson effect is what allows for refrigeration I don't think this is true. The "simple" model of refrigeration taught in highschool is just a carnot cycle running backwards, and this can be modeled with an ideal
5.
by mattb314 5y ago
Heads up this weights all your scores towards 0. If you want to avoid this, an equally simple approach is to use (x+3)/(y+5) to weight towards 3/5, or any (x+a)/(y+b) to weight towards a/b. It turns out that this seeming
6.
by mattb314 5y ago
Free fillable forms is hard to use for taxes in general, but this page is specifically for people who want the CTC without having filed taxes (presumably you otherwise would have gotten the CTC when you filed takes). You can see the screens
7.
by mattb314 6y ago
I doubt it? At least the number times the "last updated" column appears on SQL server stats [1] leads me to believe it collects stats async with updates to the table. The only system I've heard of that relies on up-to-date st
8.
by mattb314 6y ago
I think I generally agree with the majority of the comments here that burn in can serve a useful purpose (especially if you can't find a high probability density point to start from), but I also wonder: if burn-in vs no burn-in makes a
9.
by mattb314 6y ago
If you're new to differential privacy and looking for an introduction, I highly recommend the Dwork and Roth book, especially the first three chapters: https://www.cis.upenn.edu/~aaroth/Papers/privacybook.pdf
10.
by mattb314 7y ago
Personally I'm not super bullish on differential privacy outside a couple specific use cases, but correlation attacks and cross referencing against external data are exactly the vectors that differential privacy is intended to protect
11.
by mattb314 7y ago
I'd also like an answer to this one. It seems like most of these explanations would also apply to plastic or metal getting wet, so why does cloth get so much darker than other materials? It feels like the fact that water is absorbed ha
12.
by mattb314 7y ago
This is basically the issue. If a single line from the bottom of left is present at the top of right, it will fast-forward all the way through left and fail to match anything else from right. The hard part with diffing isn't finding di
13.
by mattb314 9y ago
re: efficiency, I think this blog post does a decent job explaining: https://auth0.com/blog/beating-json-performance-with-protobu... . Basically, it doesn't make a huge difference if you're communicating with
14.
by mattb314 9y ago
I might be missing some context here, but usually the L_infinity norm means the max norm, or the maximum absolute difference over all components (data points). This gives (min + max)/2 as GP suggested. Wikipedia entry: https:/&#x
15.
by mattb314 9y ago
To be honest, I'm a little confused by your answer. Aren't high contention and deadlocking workloads essentially the same thing to a deadlock-detection db? I can imagine some patterns where that wouldn't necessarily be true,
16.
by mattb314 9y ago
Does anyone know why they use deadlock detection rather than deadlock avoidance (the simplest avoidance algorithm being simply to always acquire locks in the same order)? I can't find a good reference right now, but I was under the imp
17.
by mattb314 9y ago
Even assuming you meant "upper bound" instead of "lower bound", this isn't strictly true in theory. To achieve high throughput with large latency between nodes, all you have to do is group transactions into large ba
18.
by mattb314 9y ago
I'm a little confused about the columnar database comment: > Performing queries across billions of metrics looking for labels that only match a few of them (a common scenario with time series data at scale) is really slow in Cassand
19.
by mattb314 9y ago
Worth noting that (I'm 99% sure) you're absolutely allowed to benchmark Oracle, just not publish the results publicly. It's pretty common for DB papers to compare against postgres and a number of "mystery" databases
20.
by mattb314 9y ago
Could you link/explain how you get those hardware prices, specifically the servers and desktops? Are the available for the average consumer (ie not making a bulk purchase)? I have very little experience buying hardware, but those price
21.
by mattb314 9y ago
I think the idea of spending to upgrade your helper AI sounds really interesting and potentially novel, but it's important to push back a little bit on the idea of "removing all the rote" from an RTS. day[9] (ex Broodwar pro,
22.
by mattb314 9y ago
I'm certainly not long on uBeam (even after this fragile demo), but what physics dictates that it won't work? Sure, you're certainly going to take an efficiency loss, but wall outlets already output far, far more power than y
23.
by mattb314 9y ago
Thanks! This talk is pretty cool. In case anyone else is interested, in addition to the above video, this [1] paper goes into some of the details, including this explanation: "Reads and writes on SSDs can interfere with each other for
24.
by mattb314 9y ago
Do you think you could point me towards a source for "mixing reads & writes with a SSD lowers performance"? This seems reasonable, but I've never actually heard it before, and a cursory googling didn't turn much up.
25.
by mattb314 9y ago
Slightly related question from a non-expert in ad-blocking: is it possible to block interstitial ads? While the freedom to render a page as you wish seems to come with controlling the browser on your computer, I can't imagine any way t
26.
by mattb314 9y ago
Agreed. Especially given that these rate limits seemed to be aimed at stopping something catastrophic like spammers using 100x allotted capacity, a 2x innacuracy shouldn't really matter. The solution was interesting, however, and I cou
27.
by mattb314 9y ago
But depending on node failures, couldn't the same client successfully run cas(nil, A) -> cas(A, B) -> cas(nil, C), with all operations succeeding? Say the first two operations only succeed in writing to a single node (as in the p
28.
by mattb314 10y ago
The source: https://www.glassdoor.com/research/studies/gender-pay-gap/ The methodology: https://www.glassdoor.com/research/how-we-analyzed-the-gende... I didn't find the editorializ
29.
by mattb314 10y ago
You can actually transmit this information in a single bit: just have your friend send a 0 if you should answer false on everything or 1 if you should answer true on everything. To use the other 11 bits, transmit the first 11 answers first,
30.
by mattb314 10y ago
Awesome! I'll keep an eye out.

More ›