An encyclopedia of consistency models for concurrent systems.

The algorithm for de-pixelating a pixelated moving window with fixed content:

1. extract the frames and find the absolute positions of the window for each frame
2. assume the color of each pixelated cell is the color for the center pixel of each cell (think of pixelation as a magnifier filter focusing on the center pixel for each cell)
3. by tracking the locations of the centered pixels and its colors in each frame, we fill in more and more pixels with known colors.
4. for the remaining unfillled pixels, interpolate from nearest pixel of known colors (e.g. voronoi)

Analyze the bytes in a SQL database.

A small hash function reconstruct a ultra-blurred image from a 20-bit integer, used for image preview. The integer is bit-decomposed into nine values, six brightness values (0-3) at the 2x3 grid-points of the image, three other values to encode a color for the background (oklab). Then the blurred image is rendered by drawing six radial gradient at the points fading into transparency, then a solid background.