PUBLIC MARKS with search memory-residency

With NodeTree we seek a hybrid of these two techniques. Callbacks can be set for virtually every stage of processing, but what is returned is the (possibly incomplete) object being processed. Nodes which have been fully processed can be removed from the tree in processing to save memory and the user can even specify an alternative class to create child nodes of an element. The goal is a clean, Pythonic API usable for the most basic to the most advanced XML processing.

mental maps, the idea to ask a person to draw a map from memory, to get an insight of the person’s perception of the world.

SQLite is very careful about measuring its memory usage and provides an API to access those measurements.  But in order to measure its own memory usage accurately, it adds 8 bytes to every allocation request in order to store the requested size at the start of the resulting heap block.  In doing so, it converts a lot of 1,024 byte requests into 1,032 byte requests.  Ironically enough, the slop caused by storing the requested size rendered the stored size inaccurate. 

Inspired by the song's lyrics, "not to make it a memory," Party created the video using 250 Canon still cameras; their flashes were controlled via a potent DIY cocktail of arduino, openFrameworks, and Flash. The effect is a “light animation” produced with no CGI at all.

kyoto-client is a node.js module that acts as a client to a Kyoto

Tycoon server. Kyoto Tycoon is the server component of Kyoto

Cabinet, a fast, efficient key-value store developed by FAL

labs. Records can be stored on disk or in memory using a hash table

or B+ tree.

Take advantage of our web farm. Right now our server farm has ten fairly beefy, modern web servers with 16 GB memory each that are … pretty much doing nothing most of the time. We are almost comically overprovisioned. With Lucene, we can create an index on each webserver and have the “heavy lifting” of actually searching the index distributed across those 10 webservers instead of a single big iron database.

We’re all frogs in heating water; the water has been getting hotter gradually as the buffers grow in subsequent generations of hardware, and memory has become cheaper. We’ve been forgetting what the Internet *should* feel like for interactive applications. Us old guy’s memory is fading of how well the Internet worked in the days when links were 64Kb, fractional T1 or T1 speeds.  For interactive applications, it often worked much better than today’s internet.