Abstract: Input data is partitioned into data chunks and digest values are calculated for each of the data chunks. The positions of similar repository data are found in a repository of data for each of the data chunks. The input digests of the input data are matched with the repository digests contained in the global digests cache for locating data matches. The processor prefers to match the input digests of the input data with the repository digests contained in the global digests cache which are of the similar repository data, rather than repository digests which are of other repository data that was not determined as similar to the input data chunks. The positions of the similar repository data are used to locate and linearly load into the global digests cache, digests and digest block boundaries of the similar repository data.

Abstract: In a storage system including plural source storage devices, a target storage device selects which source storage device to accept a copy request from the target storage device so as to minimize the load on the entire system. The system calculates first and second load values for job loads being processed. System load values for the system are derived from job load value of a specific data, and respective load values for first and second source storage devices. The system compares the system load values to select a storage device to provide the data copy so as to minimize the load on the entire system.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include mirroring, in a distributed storage system having multiple storage nodes, data on the storage nodes. Upon the distributed storage system detecting a loss of communication with a given storage node, a log including updates to the data stored in the given storage node is recorded and, the recorded updates can be applied to the given storage node upon communication with the given storage node being reestablished. In some embodiments, the distributed storage system may be configured as a software defined storage system where the storage nodes can be implemented as either virtual machines or software containers. In additional embodiments, upon detecting the loss of communication, a redistribution of the mirrored data among remaining storage nodes is initiated upon detecting the loss of communication, and the redistribution is rolled back upon reestablishing the communication.

Abstract: A method for optimizing data storage based on application feedback includes receiving, by a storage system from an application, an I/O request associated with particular data residing on the storage system. The storage system processes the I/O request and returns a response to the application. The application analyzes the I/O and sends feedback to the storage system indicating whether I/O performance associated with the I/O request was acceptable. In the event the I/O performance was not acceptable, the storage system automatically adjusts an algorithm for placing the particular data on storage tiers of the storage system. This may include, for example, adjusting a decision window over which I/O activity to the particular data is measured, adjusting a weight of the particular data, adjusting a priority of the particular data within a migration queue, or the like. A corresponding system and computer program product are also disclosed.

Abstract: Embodiments for cause identification in audit data by a processor. A probabilistic logical representation is extracted from text data representing a knowledge domain according to an ontology to identify one or more reoccurring problems of the knowledge domain. A root cause and one or more causal factors of the one or more reoccurring problems is automatically identified using the logical representation such that the identifying associates a confidence level for the root cause and the one or more causal factors.

Abstract: Embodiments relate to visually encoding data and analyzing an associated dataset. More specifically, the embodiments relate to encoding a dynamic dataset and supporting data exploration of the dynamic dataset. In various embodiments, data and data viewing history are tracked according to defined criterion, which form a data version and viewing analysis record. The data and record can be displayed in many ways. In one embodiment, a visual display of differences between a first version and a second version of data is shown. In another embodiment, the visual display is dynamic and changes in real-time.

Abstract: Embodiments for targeted learning and recruitment by a processor. Attributes obtained from a user profile are used to identify a user as a potential candidate for performing an activity related to either the recruiting or the learning and providing a customized learning experience with targeted course suggestions for the user.

Abstract: A contact spring for placement in a gap between an electrical substrate opposite a lid (electrically conductive heat spreader) of an electronic device comprises a spring that both conducts heat from the substrate to the lid and electrically connects the substrate and lid. The spring comprises a flat single element configured as a plurality of polygons, providing contact points, the spring substantially lying in a plane and extending substantially in a straight line, or a spiral. The spring in an electronic device such as a flip chip ball grid array having this lid and an electrical substrate with EMI emitters: (1) provides low impedance electrical connection between the electronic circuit and lid; (2) grounds the lid to the electronic circuit; (3) minimizes EMI in the electronic circuit; (4) conducts heat from the electronic circuit to the lid; or any one or combination of the foregoing features (1)-(4).

Abstract: Data matches are calculated in a data deduplication system by matching input and repository digests using a digest based data matching process where the reference digests corresponding to a repository interval of data identified as similar to an input interval of data are loaded into two data structures. The dual data structures include a sequential buffer containing a plurality of digest entries in a sequence corresponding to a placement order of calculated values of the reference digests, the placement order of the calculated values of the reference digests correlative to an order in which input digest values were calculated such that the plurality of digests are stored in a linear form independent of a deduplicated form by which data the plurality of digests describe is stored.

Abstract: Methods, systems, and computer program product embodiments for controlling congestion in a storage grid, by a processor device, are provided. In a storage grid, a storage request transmit queue length of storage requests submitted by a plurality of nodes is monitored, the storage request transmit queue comprising a queue holding the storage requests unable to be transmitted through a current transmission control protocol/internet protocol (TCP/IP) socket buffer of the storage grid. Upon reaching at least one of a certain threshold, a watermarked message indicating a specific one of the plurality of nodes is congested is transmitted to upper layer grid nodes in a hierarchy of the plurality of nodes transmitting the storage requests, and the upper layer grid nodes each alter the storage requests based upon the watermarked message.

Abstract: A muscle movement data is analyzed to determine a pattern of movement. The muscle movement data is collected from a user at a location using a sensor. The pattern of movement is correlated to a manner of using a dinnerware. A set of aspects is calculated, the set of aspects being indicative of a circumstance of using the dinnerware. A preference profile is constructed for the user, the preference profile including an identity of the user, an identifier associated with the dinnerware, and the set of aspects. A knowledgebase of preference profiles is updated with the profile, where the knowledgebase is configured to predict a dinnerware preference of the user during a future dining circumstance of the user.

Abstract: A method of managing a data storage cache, comprising: providing a redundant cache comprising first and second caches associated with first and second storage volumes. One of the first and second storage volumes is an active, and one is a passive volume. A write request is received at one of the volumes. If the write request is received at the passive volume, it is forwarded to the active volume. It is determined whether the active volume is a low latency volume. If it is a low latency volume, it is determined whether data exists in the cache associated with the active volume which overlaps with data contained in the write request. If no data exists in that cache which overlaps with data contained in the write request, the write request is processed straight down to said active volume.

Abstract: A dynamic decode circuit for decoding a plurality of input signals comprises a decoder that decodes the plurality of input signals to produce a result at a first node, the result is propagated to a second node while an evaluation clock is active by a pair of serially connected transistors consisting of a transistor receiving an evaluation clock at its gate and a transistor receiving the first node at its gate, the interconnection of the pair of serially connected transistors is precharged when the evaluation clock is inactive to provide a delay between the end of the active evaluation clock and the beginning of the precharge.

Abstract: Merging analysis paths is provided. A first analysis path and a second analysis path are identified, wherein each analysis path identifies one or more data resources of an information space. A match is determined between a first data resource of the one or more data resources identified by the first analysis path and a second data resource of the one or more data resources identified by the second analysis path. A third analysis path that is based, at least in part, on the first analysis path and the second analysis path is generated.

Abstract: Embodiments relate to a hardware circuit that is operable as a fixed point adder and a checksum adder. An aspect includes a driving of a multifunction compression tree disposed on a circuit path based on a control bit to execute one of first and second schemes of vector input addition and a driving of a multifunction adder disposed on the circuit path based on the control bit to perform the one of the first and second schemes of vector input addition.

Abstract: Operation of a multi-slice processor that includes a plurality of execution slices and a plurality of load/store slices coupled via a results bus includes: retrieving, from the results bus into an entry of a register file of an execution slice, speculative result data of a load instruction generated by a load/store slice; and determining, from the load/store slice after expiration of a predetermined period of time, whether the result data is valid.

Abstract: Embodiments presented herein provide techniques for setting different methods of skipping duplicate values when executing a query statement in a relational database. A distance between a two distinct keys in an index, a current index key and a next distinct index key, are estimated. Based on the estimated distance, an appropriate duplicate-skipping method is determined. If the proximity between the distinct keys is relatively far apart (e.g., the keys reside in index pages that are at least an index page apart), then a “big skip” method is performed. Otherwise, if the proximity between the distinct keys is relatively near (e.g., the keys reside in the same index page), then a “little skip” method is performed.

Abstract: A magnetic storage system according to one embodiment includes a magnetic head having a removable organic coating thereon in an amount sufficient for reducing exposure of the head to oxidation promoting materials. The system also includes an applicator in a drive in which the magnetic head resides, the applicator being configured to apply the organic coating directly to the magnetic head without contacting the magnetic head. At least one guide is configured to create a spacing between the magnetic head and the guide, wherein the spacing is sufficient to insert the applicator into the spacing.

Abstract: A method for verification of a design of an electronic circuit is provided. The method includes executing test runs of the design. The method further includes increasing a fail counter if the executing of a test run of the test runs failed. The method further includes increasing a pass counter if the executing of the test run of the test runs passed. The method further includes halting the executing of the test runs of the design if the current ratio of the fail counter versus the pass counter exceeds a predetermined threshold.

Abstract: Methods and systems of authenticating electronic identification (ID) documents may provide for receiving a decryption key and an encrypted ID document from a certificate authority server at a mobile device, wherein the encrypted ID document includes a read only document having a photograph of an individual. Additionally, the decryption key may be applied to the encrypted ID document to obtain a decryption result in response to a display request. The decryption result can be output via a display of the mobile device, wherein the encrypted ID document can be sent to a challenge terminal if a challenge request is received.