Abstract:
Described herein are techniques for supporting bi-temporal data in a key value cache system. An embodiment provides bi-temporal data as the basic functionality of a key value cache system. An embodiment provides a redesign of the core data structures of a key value cache system, adds bi-temporal data storage in the key value hashing structure, and provides a temporality-aware memory space manager. Embodiments can achieve the same performance as current key value cache systems for regular queries (that is, the queries that only access the current versions of data) while supporting bi-temporal data.
Abstract:
A system and method for non-invasively generating a report of cardiac electrical activities of a subject includes determining, using cardiac electrical activation information, equivalent current densities (ECDs). The ECDs are assembled into time-course ECD information and a spectrum of the time-course ECD information is analyzed to determine peaks for spectral characteristics of atrial fibrillation (AF). The spectral characteristics of AF are correlated with potential electrical sources of the AF and a report is generated indicating the potential electrical sources of the AF spatially registered with the medical imaging data.
Abstract:
Embodiments of a system are described. In one embodiment, the system is a device for performing operations and supporting transactions. The device is configured to receive a transaction comprising a command and data. The device writes the data to a transaction manager on a persistent memory device. The transaction manager also maintains a status of the transaction and reference to entries within memory that are manipulated by the transaction. The device also creates an in-memory log of the transaction in a first hash directory. The device then commits a copy of the first hash directory to a second hash directory maintained on a persistent memory device.
Abstract:
A method for implementing multicast data exchange over a partitioned network having an encrypted domain with HAIPE devices at the edges consists of proxies running at an ingress edge and at egress edges of the encrypted domain. The proxies at the ingress edge device modify the multicast data packet to replace the destination address with the address of a proxy running on an egress edge device, such that the encrypted domain routes the packet directly to the proxy at the egress edge device without processing it as a multicast data packet. At the egress edge devices, the proxies restore the original address and send the multicast packets to the appropriate destinations.
Abstract:
Embodiments of the invention provide a system, method and computer program products for information retrieval from multiple documents by proximity searching for search queries. A method includes generating an index for the multiple documents, wherein the index includes words in snippets in the documents. An input search query is processed against the index by searching query terms over the snippets to introduce term proximity information implicitly in the information retrieval. Results of multiple sentence level search operations are combined as output.
Abstract:
A method for computing a quantitative metric indicative of pain experienced by a subject using an electrophysiological signal detection system is provided. Electrophysiological data are acquired from a subject with the electrophysiological signal detection system. Modulations in the acquired electrophysiological data that are associated with pain experienced by the subject during the acquisition of the electrophysiological data are identified. A quantitative metric indicative of the pain experienced by the subject is computed by processing the identified modulations in the acquired electrophysiological data.
Abstract:
Embodiments of the present invention provide a system, method and computer program products for memory space management for storage class memory. One embodiment comprises a method for information storage in an information technology environment. The method comprises storing data in a storage class memory (SCM) space, and storing storage management metadata corresponding to said data, in the SCM in a first data structure. The method further includes buffering storage management metadata corresponding to said data, in a main memory in a second data structure.
Abstract:
A system and method for managing communication of a movable entity is provided. The system comprises a chargeable power source, at least one sensor unit which is connected with the movable entity, and a global positioning device which is powered by the chargeable power source and is connected with the movable entity, wherein the global positioning device is used to track moveable entity status in response to sensor data received from said at least one sensor unit, the global positioning device is configured to execute a power saving mode based on moveable entity status information. The system and method save electric energy consumption of a battery for the GPS device by the mode switching between a sleep mode and a work mode, and judgment on the predetermined event provided may help to prevent the machine from being stolen.
Abstract:
Data may be modeled as an undirected graph. A set of entities and a set of attributes may be defined. A set of relationships may be defined to represent semantic associations with each association connecting at least two entities. Attributes may be associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data may be employed. The modeled data may be displayed on a display unit.
Abstract:
A method for use with an aggregation operation (e.g., on a relational database table) includes a sorting pass and a merging pass. The sorting pass includes: (a) reading blocks of the table from a storage medium into a memory using an aggregation method until the memory is substantially full or until all the data have been read into the memory; (b) determining a number k of blocks to write back to the storage medium from the memory; (c) selecting k blocks from memory, sorting the k blocks, and then writing the k blocks back to the storage medium as a new sublist; and (d) repeating steps (a), (b), and (c) for any unprocessed tuples in the database table. The merging pass includes: merging all the sublists to form an aggregation result using a merge-sort algorithm.