Abstract: Methods, systems, and computer program products for improving the transcoding operations which are performed on structured documents (such as those encoded in the Hypertext Markup Language, or “HTML”) through use of annotations. Source documents may be annotated according to one or more types of annotations. Representative types of annotations direct an annotation engine to perform selective clipping of document content, provide enhanced HTML form support, request node and/or attribute replacement or the insertion of HTML or other rendered markup syntax, and direct a transcoding engine to provide fine-grained transcoding preference support (such as controlling transcoding of tables on a per-row or per-column basis). The disclosed techniques may be used with statically-generated document content and with dynamically-generated content.

Abstract: Methods, systems, and computer program products are provided for communicating between a source device and a destination device over an external communication link by transmitting a message stored in a source persistent queue at the source device over the external communication link to the destination device. The transmitted message has transmitted with it an associated sequence identifier which identifies the message stored in the source persistent queue. The transmitted message and the associated sequence identifier are received at the destination device and stored in a destination persistent queue at the destination device. Occasionally, a commit message is transmitted to the source device from the destination device which identifies a sequence identifier associated with received message which has been persistently stored in the destination persistent queue.

Abstract: Systems, methods and computer program products are provided for utilizing XML-based tools to tailor HTML-based Web page content for display within various client devices. Content portions of a requested Web page are converted to an XML format and then modified using an XML content-tailoring tool. Other content portions of the Web page are masked so as to be “hidden” and are, thus, not converted to XML format. The masked portions of the Web page are then unmasked, combined with the modified content portions, and transmitted to a client device for display therewithin.

Abstract: Method, apparatus and program products for increasing the performance of communications using differencing data communications over a message queue supporting asynchronous communications from a variety of applications executing on a source device over a shared external communication link to destination devices are provided. A data stream between the source device and the destination device is segmented based on the type of the data stream to provide a logical segmentation which increases the occurrence of repeated transmissions of a segment. The segments are then placed in the message queue as a message for transport to a destination computer. Differencing is provided by replacing the segment with an associated identifier for segments which have previously been transported to provide a reduced volume of data for transmittal based on recognition and replacement of data segments which have previously been transmitted by the source device.

Abstract: Method, apparatus and program products for increasing the performance of communications using differencing data communications over a message queue supporting asynchronous communications from a variety of applications executing on a source device over a shared external communication link to destination devices are provided. A data stream between the source device and the destination device is segmented based on the type of the data stream to provide a logical segmentation which increases the occurrence of repeated transmissions of a segment. The segments are then placed in the message queue as a message for transport to a destination computer. Differencing is provided by replacing the segment with an associated identifier for segments which have previously been transported to provide a reduced volume of data for transmittal based on recognition and replacement of data segments which have previously been transmitted by the source device.

Abstract: A method, system, and computer-readable code with which a program component can be dynamically selected for downloading, based on current values of one or more changeable attributes. Multiple versions of a program component are available, and a specific version is dynamically selected for downloading based on current attribute values. Attribute values may represent a user's authorization privileges, current working environment, preferences, network connection type, status, etc. In this manner, software can be optimized for particular users or groups of users, or particular environments of hardware and/or software, while still providing applications that are usable by a wide range of users in a wide range of operating environments. In another aspect, this dynamic selection based on attributes can be used to select a version of a component for remote execution, instead of for downloading. The dynamic selection process may occur on a server in the network, or on the client's local machine.

Abstract: Systems, methods, and computer program products for displaying user selectable attributes for a first item contained within a set of items are provided. Attributes previously configured for the first item are displayed in a user interface so as to indicate their status as previously configured for the first item. Attributes previously configured for other items contained within the set are displayed in the user interface so as to indicate their status as previously configured for the other items. Attributes not configured for any item contained within the set may be displayed in the user interface so as to indicate their status as not configured for any item within the set.

Abstract: A computer system and process efficiently provides resource recovery for a failure during a commit procedure. An application is run on a processor and requests a work operation involving a resource such as a protected conversation with another application in a different real machine. A commit procedure is begun for the work request, and if the commit procedure fails before completion, the following steps are taken to optimize the use of one or both of the applications. At some time after the commit procedure fails, a return code is sent to at least the application that initiated the commit indicating the result of the application commit order and that the application can continue to run and does not have to wait for resynchronization (recovery). Then, while the initiating application continues to run and do other useful work, resynchronization is implemented in parallel, asynchronously.

Abstract: A multiprotocol transport network (MPTN) gateway provides transparent interconnection of two or more SPTNs running different transport layer protocols to form an integrated heterogeneous MPTN. The MPTN gateway of the present invention has no dependencies on the particular transport protocols running on the SPTNs being interconnected as it utilizes a common transport provider (a Gateway Services Protocol Boundary (GSPB)) between the SPTN transport protocols and the gateway components. The MPTN gateway supports connections between end systems across multiple intermediate networks. The MPTN gateway provides automatic routing based on dynamic participation in the routing protocols of the interconnected SPTNs so that any number of gateways may be interconnected and in any topology desired. As the MPTN gateway has a general architecture and acquires routing information automatically, it supports not only other MPTN nodes and gateways but also non-MPTN nodes and gateways.

Abstract: The present invention is a general solution to the problem address incompatibility between application programs and transport services. The invention may be embodied in a method for mapping the application program address (program address) to the transport services address (transport Provider address). According to the method, a program address is registered in the network so that it becomes available to other programs that understand the address, even if they are running over a transport protocol that does not understand the address format. When a request is made that a connection be established between a program and a program partner or that a datagram be sent therebetween, the program address is mapped to the transport Provider address (if necessary). The program address is then conveyed to the program partner so that it knows who it is talking to.

Abstract: A method of managing unit-of-work identifiers in a chained distributed database transaction system. The system has a plurality of processing nodes which are logically connected to form a tree. Normally, each node automatically increments its present identifier at the end of processing each transaction to derive the next transaction identifier. However, in response to a failure condition which results in a severed tree, the distributed database that now reside in the first and second subtrees that result from the severance are forced to consistent states. The transaction identifier is incremented in each of the nodes of the first subtree. Transaction work in the first subtree then proceeds with the incremented identifier. The second subtree is dismantled. In response to a nonfailure condition which results in a severed tree, the distributed database in the first and second subtrees that result from the nonfailure severance is committed to a permanent state.

Abstract: A computer system and process efficiently provides resource recovery for a failure during a commit procedure. An application is run on a processor and requests a work operation involving a resource such as a protected conversation with another application in a different real machine. A commit procedure is begun for the work request, and if the commit procedure fails before completion, the following steps are taken to optimize the use of one or both of the applications. At some time after the commit procedure fails, a return code is sent to at least the application that initiated the commit indicating the result of the application commit order and that the application can continue to run and does not have to wait for resynchronization (recovery). Then, while the initiating application continues to run and do other useful work, resynchronization is implemented in parallel, asynchronously.

Abstract: A method of reducing the number of messages required for sync point (commit or backout) operations by leaving out nodes that have not participated in the corresponding transaction. A two-phase sync point protocol is used in a distributed transaction processing network to commit or backout transactions in the network. In response to the beginning of sync point operations on a transaction x, each node determines if each of its partner nodes stated on the sync point operation for transaction x-1 that the partner could be left out of sync point operations for transaction x-1. If a partner node did so state that it could be left out, the present node determines if the partner node was included by the present node during the present transaction x. If the partner node was not included during the present transaction, the present node excludes the partner node from the present sync point operations.

Abstract: A Transport Layer Protocol Boundary (TLPB) architecture is described which will permit an application program to run over a non-native transport protocol without first generating a protocol compensation package tailored to the transport protocols assumed by the program's application programming interface and by the available transport provider. All transport functions required by the program are converted to standardized or TLPB representations. When a connection between the first application program and a second remote application is requested, the individual required TLPB transport functions are compared to corresponding functions supported by the transport provider. Compensations are invoked only where there is a mismatch. The node on which the remote application program runs is informed of the compensations so that necessary de-compensation operations can be performed before the data is delivered to the remote application program.