daly

Delay-Tolerant Networking is a network architecture providing communications in and/or through highly stressed environments. Stressed networking environments include those with intermittent connectivity, large and/or variable delays, and high bit error rates. To provide its services, BP may be viewed as sitting at the application layer of some number of constituent networks, forming a store-carry-forward overlay network. Key capabilities of BP include: • Ability to use physical motility for the movement of data. • Ability to move the responsibility for error control from one node to another. • Ability to cope with intermittent connectivity, including cases where the sender and receiver are not concurrently present in the network. • Ability to take advantage of scheduled, predicted, and opportunistic connectivity, whether bidirectional or unidirectional, in addition to continuous connectivity. • Late binding of overlay-network endpoint identifiers to underlying constituent network addresses

This idea goes all the way back to the 1970s. There was a program that compressed your 8k ram to "double" the space. The bytes were uncompressed on the fly.

JEV is rule-based programming with a better pattern matcher. Charles Forgy did this back in the 80s.

Lisp is trivial to read. I find the C++ example hard.

A novel woven robot hand design based on traditional fabric technology.

Should robot hands use tendons in the forearm or motors in the fingers?

Tsundoku.

I own about that many. Fortunately a large percentage is PDFs. Never the less I have about 200 linear feet of shelf space to hold my books in my "library" and in my home office.