vitus

72 ms·

781.
by vitus 6y ago
Not necessarily! Due to chemical reactions, certain foods are sweeter, less bitter, and so forth when cooked. (e.g. onions caramelize, glucosinolates [0] in kale leach out when blanching) Evolution already predisposed us to like sugary food
782.
by vitus 6y ago
Plants still need to use the glucose, though. It's misleading to say that plants produce CO2 at night (since they produce it all the time); rather, they become a net CO2 producer at night because they're not offsetting it with pho
783.
by vitus 6y ago
Hm, I wonder how you reconcile this with the other summary finding that > the real median earnings of full-time, year-round workers increased 0.8 percent between 2018 and 2019 Seems like this is the wealth gap, coupled with an increase o
784.
by vitus 6y ago
Clean network partitions do happen, although it's certainly not a weekly occurrence. For instance, a metro might be isolated from the rest of the network due to simultaneous fiber cuts. https://www.bbc.com/news/tec
785.
by vitus 6y ago
The full news release from Pew [0] indicates that this is analysis of the monthly Current Population Survey [1] conducted by the Department of Labor. "The analysis of recent trends and characteristics is based on the monthly Current Po
786.
by vitus 6y ago
From the original Pew report: https://www.pewresearch.org/fact-tank/2020/09/04/a-majority-... So, the increase was mostly driven by 18-24 year olds (both college-age as well as some new grads), who were
787.
by vitus 6y ago
I think the 1024 (2^10) count is more important. We're not really looking for a community-wide preference -- instead, we're essentially looking to identify the size of the biggest possible Smith set [0], as defined for Condorcet m
788.
by vitus 6y ago
I'd expect this to be about the Caterer's Problem (i.e. the current problem, which shows up on the linked page).
789.
by vitus 6y ago
An (obvious?) iterative improvement on this solution is to just take the first two rows and mirror it for the bottom two, for a solution of 4x3=12 pieces. -X--X--X- -X--X--X- -X--X--X- -X--X--X- The naive lower bound on
790.
by vitus 6y ago
Totally makes sense that you wouldn't get the same capacity from the same silicon, or even close, given that SRAM uses far more transistors per cell. But if you have issues scaling DRAM, and different scaling limits on transistor count
791.
by vitus 6y ago
If the difficulty of DRAM is in creating capacitors at that size, why haven't we seen a shift toward SRAM (6T, for instance), which is purely transistor-based? Sure, you have to sacrifice more transistors for the same capacity, but new
792.
by vitus 6y ago
To expand on this: Several of my coworkers who moved from the Bay Area still pay CA taxes for stocks that were granted before they moved, which means potentially 4 years of paying taxes for two separate states. On the plus side, their CA ta
793.
by vitus 6y ago
I went to Berkeley for undergrad. Anyone in the EECS department who was serious about a future in programming took, at a minimum, two courses on algorithms / data structures (CS61B / CS170), one of which was required for the degre
794.
by vitus 6y ago
Towards the end, when the author tries to replace the inner branch with arithmetic ("Replacing the branch with arithmetic"), one thing I noticed is that the branchless code actually reduced branches by 5x the number of eliminated
795.
by vitus 7y ago
Article states: > The outlet suggests the discussed cuts could impact upwards of 20 percent of Uber’s 27,000 employees which checks out -- 20% of 27,000 is 5400.
796.
by vitus 7y ago
That works great until the note that \times returns for cross product, curl, and cartesian product. (And in both cross product and curl, if you substitute a \cdot, then that's an entirely different operation!)
797.
by vitus 7y ago
Yes. In particular, as you describe it, you'd then need to solve for P(E1 ∩ E2) by extrapolating from the existing result of P(E2 | E1) present in the article, then plug it into that formula you've provided. (Bayes' law strea
798.
by vitus 7y ago
A 5-dim yard and a 6-dim yard convert to a different number of n-dim feet (243 vs 729). - A 5-d sphere with R=1yd would have volume of ~5.264 yd^5 or 1279 ft^5. - A 6-d sphere with R=1yd would have volume of ~5.168 yd^6 or 3767 ft^6.
799.
by vitus 7y ago
They have a lot more CPU than they need, but the challenge is often getting servers shaped appropriately (RAM x CPU x disk x network), especially if you're not building your own. Ultimately, their service is (most likely) not compute-b
800.
by vitus 7y ago
You don't need teleportation for secure comms; you just need pairs of entangled qubits (at which point you can just use their measurements as a one-time pad). That said, if you really want to amplify your transmission rate, you'll
801.
by vitus 7y ago
The article describes three optimizations: - Changing the memory layout to be column-oriented (i.e. for greater cache friendliness, as the sibling comment mentions). - Iterating over batches (analogous, possibly equivalent to loop unrolling
802.
by vitus 7y ago
Link to "previous discussion", it seems. Dictation software and/or autocorrect mangle text in odd ways.
803.
by vitus 7y ago
If your captive portal is implemented by intercepting your DNS queries, then having a short TTL should ensure that the captive portal actually has a query to intercept. But sure, there are other implementation approaches (e.g. injecting HTT
804.
by vitus 7y ago
> Here’s another example of a low-TTL-CNAME+low-TTL-records situation, featuring a very popular name: > $ drill detectportal.firefox.com @1.1.1.1 Is captive portal detection not a valid use case for low TTL? The entire point is to det
805.
by vitus 7y ago
The security guarantee here isn't for the user, though. It's more of a placebo effect for the content producers.
806.
by vitus 7y ago
Nit, since this confused me when I was looking for more context: for whatever reason, Widevine security levels are ordered in decreasing security (whereas the article has them backwards). Widevine on Linux only supports L3, which means that
807.
by vitus 7y ago
nit: runtime for radix sort is O(nk), since you sort the full list by each of the digits, sequentially. I've always thought claiming radix sort on integers to be linear was a bit disingenuous, since k << log(n) only if your list
808.
by vitus 7y ago
Yeah. I was disappointed to see that there wasn't a comparison between 2011 and 2013 to try to identify how big that effect was. Wikipedia has images that can give a vague idea of the geographic shift (which I like especially because t
809.
by vitus 7y ago
I always thought one of the main arguments for the guard pattern ("early exits" in the article) was _specifically_ to reduce nesting, so I find it interesting that both guard patterns and nested ternaries were mentioned. For compl
810.
by vitus 7y ago
Not when you're looking at high utilization, as presented in the example in the article. For that particular case (a M/M/1 queue with arrival rate of 5.8 customers per hour and a service rate of 6 per hour), even your median

More ›