Abstract: Systems and methods for communicating and managing patient physiological data and healthcare practitioner instructions are disclosed. An example method may be implemented at a first electronic device for receiving patient physiological data. The first electronic device may also communicate the patient physiological data to a second electronic device of a healthcare practitioner. Further, the first electronic device may receive, from the second electronic device, healthcare practitioner instructions for communication to a third electronic device of a patient. The first electronic device may also communicate the healthcare practitioner instructions to the third electronic device.

Abstract: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a patricia tree having leaf keys and pattern search control blocks containing a prefix and either an end-of-trail leaf or a pointer to another of the pattern search control blocks, by placing each of the prefixes in a tree prefix table; searching for a key in the tree; searching for the key in the prefix table if the tree searching does not find the key in the tree; confirming that the key is deleted if the key is not found in the prefix table; deleting the key from one of the pattern search control blocks; and collapsing the patricia tree by eliminating the left most pattern search control block from the patricia tree if the patricia tree searching finds the key.

Abstract: Techniques and articles of manufacture are provided comprising computer readable programs that, when executed on the computer, cause the computer to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.

Abstract: A technique is provided to delete a leaf from a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as a leaf to be deleted. Using the pattern, the tree is walked to identify the location of the leaf to be deleted. The leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. The technique also is applicable to deleting a prefix of a prefix.

Abstract: A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.

Abstract: A tree structure and method to organize routing information for processing messages within a network, each message being associated with a search key of “n” bits. The processing determines where to send the message next. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key, and one or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key or a pointer to a subsequent PSCB if the end of a search trail is not identified. Each PSCB entry DT entry also indicates that the search has been resolved to the end of the search trail.

Abstract: A technique is provided to either insert or delete a leaf in a Patricia tree having a direct table and a plurality of PSCB's which decode portions of the pattern of a leaf in the tree without shutting down the functioning of the tree. A leaf having a pattern is identified as either a leaf to be inserted or deleted. Using the pattern, the tree is walked once to identify the location of the leaf to be deleted or the location where the leaf is to be inserted. If it is a delete operation, the leaf to be deleted is identified and deleted, and any relevant PSCB modified, if necessary. If it is an insert operation, the tree is walked a second time to insert the leaf and reform or create any PSCB in the chain that needs to be reformed or created. The technique also is applicable to inserting or deleting a prefix of a prefix.

Abstract: A structure and method of routing a message is disclosed. A tree structure is provided for organizing routing information used in processing messages within a network, each message being associated with a search key of “n” bits. The processing includes a determination of where to send the message next to get the message closer to the desired destination. The structure has a direct table (DT) of 2x entries for decoding the first “x” bits of the search key. One or more pattern search control blocks (PSCB's), each having 2m entries for decoding subsequent groups of “m” bits, is provided. Each PSCB entry and DT entry includes a pointer to data associated with a specific route, if at this point a specific routing table entry is a potential match to the search key. Each PSCB entry and DT entry includes a pointer to a subsequent PSCB if the end of a search trail is not identified.

Abstract: The disclosure describes a system to permit communication between two dissimilar networks that involves an interface system. More particularly, it is an interface system to permit communication between a MAP network that is utilizing common application service elements (CASE) and a network of non-MAP computer equipment. The interface system that is described establishes a connection between the two networks which involves a process of decoding data from one network into predetermined component parts, and then encoding the component parts into data for transfer to computer equipment in the other network, and then, releasing the connection when the data transfer is completed, in accordance with the State Table of FIG. 3 of the drawings.

Abstract: A method of transforming a first editable form of a document prepared by a batch text processing system into a second and incompatible editable form for use in another batch or an interactive text processing system through the use of a transform mechanism is described. A significant step of this method requires the identification of a limited number of key state variables, whose values reflect information concerning source document controls that have been read in a sequence thereof. The next step requires a definition of control compatibility, which source document controls are compatible with other source controls that set the state variables to their current values in that sequence. After control compatibility has been determined, it will be necessary to define the output items that need to be written for the target document as part of the transformation of any possible input sequence.