Abstract: The invention is an algorithmic method, or a computer implementation thereof, which synthesizes connectivities. In its prototypical form, the invention computes pairwise channels for an arbitrary number of nodes, minimizing both latency and the cost of channels, such that all, or nearly all, healthy nodes remain connected, despite a prescribed number or proportion of failures in channels and/or nodes. The invention also solves a similar problem, where minimum latency is replaced or augmented by maximum throughput. In general, channels may bear a non-uniform cost, nodes are assigned a value, each channel or node has a corresponding latency and capacity, and fault patterns may be probabilistic or deterministic. In particular, the invention optimizes the connectivity of large numbers of computers, perhaps dynamically self-organizing.

Abstract: The invention creates and reads digital business cards, forms, and stationery. In its capacity as creator, the invention digitizes contact information into a representation suitable for printing, or otherwise transferring, to business cards. More generally, the invention converts files created by any computer application into a digital representation especially suitable for printing, or otherwise transferring, to paper, cardboard, or alternate media. In its capacity as reader, the invention transfers such digitized representations from business cards, forms, or stationery to computer applications. Beneficial applications include the automated scanning of digital business cards into electronic address books and Personal Information Managers, as well as the automated transfer of application-specific forms from paper to online systems for filing and data processing.