Abstract: Techniques are provided for splitting a computer dataset between multiple storage locations based on a workload footprint analysis of that dataset. As a computer accesses data storage, its input/output (I/O) access can be monitored, as well as a working dataset of that dataset. The I/O access patterns can be used to determine an application of the computer that is generating the I/O. The application and the working dataset can be used to determine a split for the dataset across multiple storage locations. The dataset can then be split according to the determined split.

Abstract: A cleaning assembly includes a handle assembly configured to grasp a moistened tissue. A drum is included within a dispensing unit to store the tissue. The dispensing unit selectively releases the tissue from the drum as an actuating assembly operates a lever between a first position and a second position. The drum is seated within the dispensing unit in communication with the actuating assembly in a manner such that the tissues are sealed and prevented from drying out. The seal is selectively broken to permit dispensing of the tissues. The cleaning assembly permits a user the ability to clean a potentially unclean surface without the need to physically contact any of the cleaning tissue, chemicals, or surface itself at any time. The user is separated from the potentially harmful surfaces and chemicals.

Abstract: Techniques are provided for splitting a computer dataset between multiple storage locations based on a workload footprint analysis of that dataset. As a computer accesses data storage, its input/output (I/O) access can be monitored, as well as a working dataset of that dataset. The I/O access patterns can be used to determine an application of the computer that is generating the I/O. The application and the working dataset can be used to determine a split for the dataset across multiple storage locations. The dataset can then be split according to the determined split.

Abstract: A computer-implemented method, computer program product, and computing system for receiving a unique identifier on a client electronic device. The unique identifier is associated with at least one IT component. Status information is obtained concerning the at least one IT component. A visual representation of the at least one IT component is generated on a display screen of the client electronic device. A graphical representation of the status information is superimposed onto the visual representation of the at least one IT component.

Abstract: Example embodiments of the present invention relate to a method, an apparatus, and a computer program product for IT appliance control. The method comprises determining an action regarding a storage system, encoding the action regarding the storage system, and representing the action regarding the storage system as a graphical representation.

Abstract: A computer-implemented method, computer program product, and computing system for receiving a unique identifier on a client electronic device. The unique identifier is associated with at least one IT component. Status information is obtained concerning the at least one IT component. A visual representation of the at least one IT component is generated on a display screen of the client electronic device. A graphical representation of the status information is superimposed onto the visual representation of the at least one IT component.

Abstract: A system and method is provided in which access patterns of data blocks are used to predict future accesses to the data blocks. One of the types of patterns that may be used in connection with the system described herein is depended blocks. Dependent blocks are blocks that are often referenced one after another in a short period of time. For example, one block (block b) is commonly referenced after another block (block a) a noted time period. The system described herein provides a block dependency algorithm that enables a search task involving searching of block dependencies with respect to proposed dependency definitions. In an embodiment, the search task may be performed based on using of a branch and bound methodology. A search tree is built in which a set of activity vectors (V) are ordered, and a search algorithm is used to traverse and “prune” branches of the tree.

Abstract: Example embodiments of the present invention relate to a method, an apparatus, and a computer program product for IT appliance control. The method comprises determining an action regarding a storage system, encoding the action regarding the storage system, and representing the action regarding the storage system as a graphical representation.

Abstract: Disclosed is a shopper-centric social networking system.

Abstract: A system and method is provided in which access patterns of data blocks are used to predict future accesses to the data blocks. One of the types of patterns that may be used in connection with the system described herein is depended blocks. Dependent blocks are blocks that are often referenced one after another in a short period of time. For example, one block (block b) is commonly referenced after another block (block a) a noted time period. The system described herein provides a block dependency algorithm that enables a search task involving searching of block dependencies with respect to proposed dependency definitions. In an embodiment, the search task may be performed based on using of a branch and bound methodology. A search tree is built in which a set of activity vectors (V) are ordered, and a search algorithm is used to traverse and “prune” branches of the tree.

Abstract: Disclosed is a computer-implemented incentivizing system for providing a shopping incentive to a primary user in exchange for sharing sharable information on a computer-based host system with one or more secondary users on a social networking platform where the primary user holds a membership account. A secondary user comprises a fellow user of the primary user on the social networking platform the personal profile of whom is associated with that of the primary user. The shopping incentive provided to the primary user is proportionate to the number of applicable users the sharable information is shared with wherein, an applicable user comprises a secondary user that satisfies a predefined condition set by host system.

Abstract: A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a node of an ad-hoc network. The distributed RSA signature generation method in an ad-hoc network includes distributing key share information, which is generated using a maximum distance separable (MDS) code and a random symmetric matrix, to a plurality of nodes; generating, in a fewer number of nodes than the plurality of nodes, a partial signature using the distributed key share information; transmitting the partial signature to a signature generation node; and generating an RSA signature using the partial signature, in the signature generation node.

Abstract: A method and system for protecting a broadcast frame are provided. A frame broadcasted through a packet switching network is protected and a wireless LAN system is included. A current frame is authenticated based on a TESLA scheme. The authentication of the broadcast frame can be performed without a time difference.

Abstract: A method of protecting a broadcast frame, the method comprising broadcasting a beacon and a maintenance beacon frame (MBF) from an access point (AP) to a plurality of terminals during a maintenance beacon waiting period (MBWP); and broadcasting broadcast management frames (BMFs) from the AP to the plurality of terminals during a broadcast management frame waiting period (BMFWP), wherein the MBF comprises a BMFs message integrity code (MIC) field including a BMFs MIC calculated from concatenated BMFs to be sent in a current beacon interval.

Abstract: A method and system for performing a distributed verification with respect to measurement data in a sensor network. The method of performing the distributed verification with respect to measurement data in a sensor network includes: verifying, by an aggregator, the measurement data received from each of a plurality of sensors; generating, by the aggregator, verification request data by using the verified measurement data; transmitting the verification request data to a verifier; and verifying, by the verifier, the aggregator via a predetermined number of sensors of the plurality of sensors and the verification request data. The method of performing a distributed verification with respect to measurement data in a sensor network further includes transmitting, by the aggregator, an aggregation result with respect to the measurement data to a base station when the aggregator is verified; and verifying, by the base station, the aggregation result.

Abstract: A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a signature generation node are provided, including steps for distributing key information to a plurality of nodes using an RSA parameter and a maximum distance separable (MDS) code, in a dealer node, generating a partial signature using the key information and transmitting the generated partial signature to a signature generation node, in the plurality of nodes, and generating an RSA signature using the partial signature, in the signature generation node, wherein the RSA signature is generated using the partial signature, received from a fewer number of nodes than the entire plurality of nodes.

Abstract: A method and system for performing a distributed verification with respect to measurement data in a sensor network. The method of performing the distributed verification with respect to measurement data in a sensor network includes: verifying, by an aggregator, the measurement data received from each of a plurality of sensors; generating, by the aggregator, verification request data by using the verified measurement data; transmitting the verification request data to a verifier; and verifying, by the verifier, the aggregator via a predetermined number of sensors of the plurality of sensors and the verification request data. The method of performing a distributed verification with respect to measurement data in a sensor network further includes transmitting, by the aggregator, an aggregation result with respect to the measurement data to a base station when the aggregator is verified; and verifying, by the base station, the aggregation result.

Abstract: A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a node of an ad-hoc network. The distributed RSA signature generation method in an ad-hoc network includes distributing key share information, which is generated using a maximum distance separable (MDS) code and a random symmetric matrix, to a plurality of nodes; generating, in a fewer number of nodes than the plurality of nodes, a partial signature using the distributed key share information; transmitting the partial signature to a signature generation node; and generating an RSA signature using the partial signature, in the signature generation node.

Abstract: A method of protecting a broadcast frame, the method comprising broadcasting a beacon and a maintenance beacon frame (MBF) from an access point (AP) to a plurality of terminals during a maintenance beacon waiting period (MBWP); and broadcasting broadcast management frames (BMFs) from the AP to the plurality of terminals during a broadcast management frame waiting period (BMFWP), wherein the MBF comprises a BMFs message integrity code (MIC) field including a BMFs MIC calculated from concatenated BMFs to be sent in a current beacon interval.

Abstract: A distributed Rivest Shamir Adleman (RSA) signature generation method in an ad-hoc network and a signature generation node are provided, including steps for distributing key information to a plurality of nodes using an RSA parameter and a maximum distance separable (MDS) code, in a dealer node, generating a partial signature using the key information and transmitting the generated partial signature to a signature generation node, in the plurality of nodes, and generating an RSA signature using the partial signature, in the signature generation node, wherein the RSA signature is generated using the partial signature, received from a fewer number of nodes than the entire plurality of nodes.