Abstract: A computer-implemented method for creating and synchronizing security metadata for data objects within a synchronized-data network is disclosed. This method may comprise: 1) identifying a data object, 2) determining the trustworthiness of the data object, 3) generating security metadata for the data object that identifies the trustworthiness of the data object, and 4) synchronizing the security metadata within the synchronized-data network. The method may also comprise identifying a need to perform a security operation on the data object to determine the trustworthiness of the data object and then offloading or load balancing the security operation within the synchronized-data network. Corresponding systems and computer-readable media are also disclosed.

Abstract: Apparatus (2) for saving water, which apparatus (2) comprises: (i) separator means (4) for separating water that is flowing from a water inlet (6) and that has not been interrupted in flow, from water that is flowing from the water inlet (6) and that has been interrupted in flow; (ii) first outlet means (8) for receiving water that has not been interrupted in flow; and (iii) second outlet means (10) for receiving the water that has been interrupted in flow, and the apparatus (2) being such that in use it permits the water received by the first outlet means (8) to be saved from flowing to waste.

Abstract: A computer-implemented method for integrating the management of a temporary email address within an email client application is described. An email client application is provided. A function of the email client application is modified. An attribute is added to the modified function. The attribute is configured to allow the selection of a temporary email address or a non-temporary email address. The selected email address is set as a default email address for the modified function.

Abstract: A peer-to-peer storage manager measures availability (liveness) of the various nodes in a peer-to-peer storage pool, and adjusts the storage of data within the pool to meet performance expectations based on this liveness information. Based on node liveness statistics, the peer-to-peer storage manager fine tunes storage up or down to efficiently allocate storage while maintaining service level objectives for retrieval time probabilities. Responsive to node liveness information, the peer-to-peer storage manager can dynamically adjust redundancy and/or determine which nodes on which to store data. The peer-to-peer storage manager can execute these storage modifications using rateless erasure codes that allow highly robust storage with only weakly synchronized directory update protocols.

Abstract: A system and method are provided for strategic power supply sequencing in a computer system. The system and method includes a plurality of processing resources that process data and a plurality of power supplies that provide power for the processing resources. A power management engine adjusts the power supplies in response to processing resource changes to optimize power consumption. The power management engine brings online power supplies to meet the demand created by bringing online additional processing resources and brings offline power supplies to meet the decreased demand caused by a decrease in the number of processing resources. Also, the power management engine rotates which power supplies operate to take advantage of more efficient power supplies and to extend the lives of the power supplies. The power management engine also adjusts the power supplies in advance based upon predicted demand levels for the computer system.

Abstract: A computer system that includes a first integrated circuit that has a plurality of first functions. The first integrated circuit is coupled to a second integrated circuit having a plurality of second functions via a communication link that includes a plurality of pipes carrying transactions on the link. Each pipe has a source end in one of the first and second integrated circuits and a target end in the other of the first and second integrated circuits. Each of the pipes is identified by a pipe identifier that uniquely identifies both the source end and the target end of a respective pipe. Each transaction on the link includes a pipe identification field containing the pipe identifier to associate each of the transactions with one of the pipes. The pipes share the link on a packet multiplexed basis. Each pipe can carry either isochronous or asynchronous transactions.