Abstract: A method, system and apparatus for provisioning a computation into a trusted execution environment, including verifying the trusted execution environment, generating integrity information of the computation, generating sealed data, sending information of the computation, the sealed data, and integrity information to the trusted execution environment, confirming the sealed data, and verifying integrity of the computation information from the integrity information and the computation information.

Abstract: The disclosure relates to a plug-in connector including a housing having at least two contact terminals received in adjacent terminal receiving cavities. An electric identification device is arranged in the housing and adapted to simultaneously contact the at least two terminals. The electric identification device including a unique identifier, wherein one of the at least two terminals is an output terminal of the identification device, and wherein the unique identifier of the electric identification device is adapted to be read out via the output terminal for authenticating an original equipment manufacturer's parts, such as a plug-in authenticator.

Abstract: A method, system and apparatus for provisioning a computation into a trusted execution environment, including verifying the trusted execution environment, generating integrity information of the computation, generating sealed data, sending information of the computation, the sealed data, and integrity information to the trusted execution environment, confirming the sealed data, and verifying integrity of the computation information from the integrity information and the computation information.

Abstract: A method, system and apparatus for generating a computation such that it will execute in a target trusted execution environment (TEE), including selecting the target TEE, generating an authorization that is satisfied by a TEE, associating the authorization with the computation that executes in the TEE that is authorized, and generating the computation with the associated authorization.

Abstract: A method, apparatus, and article are provided for managing migration of annotations between versions of source code. Annotations associated with patterns of source code are identified. A comparison of the modified source code is conducted in conjunction with the identified annotations in a prior version of the source code to determine if the annotations may be migrated to any portions of the modified source code. The comparison includes an exact match and a partial match. With respect to the partial match, a threshold value is employed to define the parameters of a partial match. All annotations that are determine to be an exact match or a partial match are automatically migrated to a location in the modified source code determine to match within the threshold value.

Abstract: A method, apparatus, and article are provided for managing migration of annotations between versions of source code. Annotations associated with patterns of source code are identified. A comparison of the modified source code is conducted in conjunction with the identified annotations in a prior version of the source code to determine if the annotations may be migrated to any portions of the modified source code. The comparison includes an exact match and a partial match. With respect to the partial match, a threshold value is employed to define the parameters of a partial match. All annotations that are determine to be an exact match or a partial match are automatically migrated to a location in the modified source code determine to match within the threshold value.

Abstract: A method and system for maximizing connectivity within members of a group, or for example a clique, in polynomial time. Vertices representing inter-connectivity of each member are placed on a graph in descending order. Least connected members are systematically removed from the graph until the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph. Following the removal of a vertex from the graph, an update of the inter-connectivity of each member on the graph is performed. Accordingly, when the connectivity count of a least connected vertex is equal to a quantity of vertices remaining in the graph a clique with maximum inter-connectivity has been achieved.

Abstract: A method and computer system for efficiently backing up data in a computer network. Multiple resources are grouped into nodes wherein each node includes a network adapter for allowing the node to communicate with the computer system. Each node includes a storage device, or multiple storage devices. The storage devices of each node are mapped with mirrors to form a logical volume. At least one mirror, also known as a plex is connected to both the logical volume and a network adapter for the respective node. For backup of data, the source node sends data to a target node through the network adapter. The target nodes receives data from the plex through the network adapter. In communication with the network adapter and the volume, the plex of the target node is configured to be a feed plex in that it acts as a communication pipe between the network adapter and the target node volume.

Abstract: A method and computer system for efficiently backing up data in a computer network. Multiple resources are grouped into nodes wherein each node includes a network adapter for allowing the node to communicate with the computer system. Each node includes a storage device, or multiple storage devices. The storage devices of each node are mapped with mirrors to form a logical volume. At least one mirror, also known as a plex is connected to both the logical volume and a network adapter for the respective node. For backup of data, the source node sends data to a target node through the network adapter. The target nodes receives data from the plex through the network adapter. In communication with the network adapter and the volume, the plex of the target node is configured to be a feed plex in that it acts as a communication pipe between the network adapter and the target node volume.