Abstract: A system and method for preference determination, including obtaining permission for profile access from social media users where the users agree to participate in surveys. Profile data, preferences, and data from completed surveys is retrieved, and base odds are calculated for particular variables in profiles of respondents and of people in the general population, and attributes for which predictive targeted sets are desired are returned. The profile data, preferences, and survey data is analyzed using a combined index calculation method to reduce the profile data, preferences, and data from surveys to a single index value for one or more particular keywords. The variables are placed in rank order based on the single index value to determine a likelihood of a particular user to prefer a particular item, and a predictive targeted set is returned for a likelihood of users in a particular set of users to prefer a particular item.

Abstract: Modeling data as an undirected graph can include a set of entities and a set of attributes. A set of relationships can be defined to represent semantic associations with each association connecting at least two entities. Attributes can be associated with entities rather than with relationships. A hierarchical query language with a set of atomic operations on modeled data can be employed. The modeled data can be displayed on a display unit.

Abstract: Described is a reliable and efficient design for a transactional status oracle (“ReTSO”), which supports large-scale storage systems. ReTSO uses a centralized scheme and implements snapshot isolation, a property that guarantees that read operations read a consistent snapshot of the data store. The centralized scheme of ReTSO enables a lock-free commit algorithm that prevents unreleased locks of a failed transaction from blocking other transactions. Each transaction submits the identifiers of modified rows to the ReTSO, the transaction is committed only if none of the modified rows is committed by a concurrent transaction, and a log of the committed transaction is cached. To recover from failures, before a client is notified of a change, the change cached is first persisted into a write-ahead log, such that the memory state can be fully reconstructed by reading from the write-ahead log. Furthermore, ReTSO implements a lazy, auto-garbage collector hash map that reduces the number of memory accesses per request.

Abstract: A method, software, database and system for determining an optimal treatment for an illness in an individual and for determining the impact (e.g., side effects and intended benefits) of the treatment in the individual are presented in which an attribute profile of the individual containing genetic and non-genetic attributes is compared against a database containing combinations genetic and non-genetic attributes that are statistically associated with successful treatment of the illness in other individuals.

Abstract: A computer-implemented method for deduplicating data transferred via physical storage media may include: 1) identifying data stored at a first location that is to be transferred to a second location via a physical storage medium, 2) deduplicating the identified data, 3) storing the deduplicated data on the physical storage medium, and then, after the physical storage medium has been physically transported from the first location to the second location, 4) transferring the deduplicated data from the physical storage medium to a storage device at the second location.

Abstract: A technique provides policy management within a policy-managed environment. A policy management agent retrieves a policy enforcement point (PEP) description from a PEP registry. The policy management agent utilizes the PEP description of the PEP to search a policy library to locate and determine matching (candidate) policies, and the matching policies match the policy description of the PEP. The managed environment, which incorporates policy evaluation, uses the equivalent policy matching criteria as the policy management agent.

Abstract: Nodes in a distributed system maintain virtual times according to specified rules. Each node can associate its virtual time with transactional messages that are transferred to other nodes and with log entries that are written to a log. A reference entry, which corresponds to an arbitrary point in time, is selected from a first log associated with a first node. A reference virtual time associated with the reference entry is identified. A matching entry, with an associated virtual time that appropriately corresponds to the reference virtual time, is selected from a second log associated with a second node. The first node is caused to roll-forward to the arbitrary time by processing the first log up to the reference entry. The second node is caused to roll-forward to the arbitrary time by processing the second log up to the matching entry.