#statstab #317 Tests for Pairwise Mean Differences in R
by @timmastny.bsky.social

Thoughts: A nice illustration of what {emmeans} is doing when computing contrasts using various functions.

#emmeans #r #pairwise #ttest #tutorial #dataviz

timmastny.com/blog/tests-p...

My friend @timmastny.bsky.social made a game for the NES and asked me to write music. We made both the game and music under the constraints of the NES.

Check out the game on tmastny.itch.io/dead-rise

And the soundtrack on all streaming platforms!

Spotify link: open.spotify.com/album/2NDjba...

Which program is faster? 1/

Problem 2 from the @sirupsen.bsky.social's napkin math newsletter:

Your SSD-backed database has a usage-pattern that rewards you with a 80% page-cache hit-rate. The median is 50 distinct disk pages for a query to gather its query results. What is the expected average query time from your database?

Search in B+ trees is a balance of two operations: scanning within nodes (1ns each) and jumping between nodes (100ns each). The size of each node determines how many of each operation we do - and that's why finding the optimal node size is crucial for performance.

Starting to work through the Napkin Math newsletter by x.com/Sirupsen

Problem 1: How much will the storage of logs cost for a standard, monolithic 100,000 RPS web application?

Latest demo: collaborative text editing synchronized with a conflict-free data structure.

The data structure ensures that insertions, edits, and deletions are properly merged during synchronization. Even if the changes were made offline. 1/

When analyzing branch prediction algorithms, the "better" hashing approach (gshare) is theoretically worse than the simple one (concatenation).

What's going on?

Let's explain CPU pipelining using an assembly line metaphor. In a basic CPU, only one worker is active. The others must wait until the entire instruction completes before starting the next one. 1/5