Abstract: A document handling system comprises physical presentation means for receiving, presenting, and removing a document with respect to the system. Furthermore, it is provided with scanning memos for the document and printing means for printing on an unprinted sheet a document that contains a form. The form contains a plurality of physically sparse format calibrating items at a perimeter of the form, directly machine-readable form identifier clam in a prescribed identifier field, and form content dam including user completable indicia boxes proper to the form so identified. The form can be used for generating a facsimile sheet inclusive of standard facsimile header, for generating a standard document for general use, or for allowing a user to input amending dam for inclusion into a later to be printed user specifiable document.

Abstract: A document handling system comprises physical presentation means for receiving, presenting, and removing a document with respect to the system. Furthermore, it is provided with scanning means for the document and printing means for printing on an unprinted sheet a document that contains a form. The form contains a plurality of physically sparse format calibrating items at a perimeter of the form, directly machine-readable form identifier dam in a prescribed identifier field, and form content data including user completable indicia boxes proper to the form so identified. The form can be used for generating a facsimile sheet inclusive of standard facsimile header, for generating a standard document for general use, or for allowing a user to input amending data for inclusion into a later to be printed user specifiable document.

Abstract: A method and process for operating an interprocess communication mechanism in a multi processor computer system are described. If a sender node needs sending a message to a receiver node, it accesses the latter for available storage space. If available, the message is transferred and the sender node may resume processing. If nonavailable the transferring is deferred. In either case the message is queued to any message either awaiting processing at the receiver node or awaiting transfer, in that at the instant when such transfer was necessary, no storage space had been available. If the receiver node wants to process a message, it accesses the least recent item of the message queue and unlinks it, while belated transferring is now executed, if necessary.Thereupon the original sender node was still kept waiting, it is now allowed to resume processing. Generally only two communication operations are required per message.