Abstract: Methods according to the present disclosure include: creating a representative profile from at least one change profile with an identifying tag from a repository, the representative profile including fewer than all possible changes to a system from an event; creating a candidate profile for a first candidate system, not flagged as similar or dissimilar, from the plurality of systems, wherein the candidate profile includes fewer than all changes to the first candidate system from the event; calculating at least one difference between the representative profile and the candidate profile; where the at least one difference is not within at least one threshold, flagging the first candidate system as dissimilar; and where the at least one difference is within the at least one threshold, flagging the first candidate system as similar, associating the identifying tag with the candidate profile, and adding the candidate profile to the repository.

Abstract: Embodiments of the present invention manage multiple requests to allocate real world resources in a multi-user environment. A set of resource availability information is stored in a first durable data file for each resource in a plurality of resources provided by a database environment. The database environment is shared between a plurality of users. A decision context is associated with a second durable data file. The decision context is associated with a user interacting with the database environment. The decision context exists for a defined duration of time. A least one resource is determined to have been temporarily allocated to the decision context for the defined duration of time. The second durable data file is updated to indicate that the at least one resource has been temporarily allocated to the decision context. The first durable data file is updated to indicate that the at least one resource is currently unavailable.

Abstract: Embodiments of the present invention manage multiple requests to allocate real world resources in a multi-user environment. A request for interacting with a database environment comprising records of allocations of a plurality of resources is received from a user in a plurality of users. The database environment is shared between the plurality of users. A set of action choices available for the request is provided to the user via the user interface. A set of resources required by each action choice is identified. The set of resources is associated with a decision context. The decision context exists for a period of time. The set of resources are allocated to the user for a duration of the decision context. The allocating prevents the set of resources from being allocated to other users for the duration of the decision context irrespective of a set of actions performed by the other users.

Abstract: Methods according to the present disclosure include: creating a representative profile from at least one change profile with an identifying tag from a repository, the representative profile including fewer than all possible changes to a system from an event; creating a candidate profile for a first candidate system, not flagged as similar or dissimilar, from the plurality of systems, wherein the candidate profile includes fewer than all changes to the first candidate system from the event; calculating at least one difference between the representative profile and the candidate profile; where the at least one difference is not within at least one threshold, flagging the first candidate system as dissimilar; and where the at least one difference is within the at least one threshold, flagging the first candidate system as similar, associating the identifying tag with the candidate profile, and adding the candidate profile to the repository.

Abstract: Aspects of the present invention provide a solution for passively monitoring a computer system. In an embodiment, an indexing agent operates on a physical server having a plurality of virtual servers. The indexing agent has a framework having a plurality of indexing layers. Each of these indexing layers is adapted to index a virtual server along a different abstraction level to extract abstraction level features indicative of changes in the virtual server. Further, each of the indexing layers has an application programming interface, which is adapted to receive one or more external indexing modules to be plugged into the framework. Each indexing module is adapted to provide instructions to the indexing agent while the indexing layer to which it is plugged is indexing the associated abstraction level of the virtual machine.

Abstract: Aspects of the present invention provide a solution for creating a snapshot of a virtual server. In an embodiment, a first write storage is created in response to a snapshot request. For each write from the virtual server to primary storage that is the first write of that particular data block since the snapshot request, the data that resided in the data block previous to the write is copied from the primary storage to the first write storage.

Abstract: It is determined whether a location of a mobile device is within a coverage region of a first information service. Communications for the first information service are redirected to a second information service when the location of the mobile device is not within a coverage region of the first information service. The second information service generally has a coverage region encompassing the location of the mobile device. Communications between the mobile device and the first information service are redirected to a new information service when properties of the new information service are determined to meet predetermined criteria set by a user of the mobile device, by an application, or both. In yet another aspect of the invention, replacement of information services can be “aggressive” or “non-aggressive.” Communications between the mobile device and an original information service are redirected to another information service when the original information service fails.

Abstract: Aspects of the present invention provide a solution for creating a snapshot of a virtual server. In an embodiment, a first write storage is created in response to a snapshot request. For each write from the virtual server to primary storage that is the first write of that particular data block since the snapshot request, the data that resided in the data block previous to the write is copied from the primary storage to the first write storage.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Abstract: A reservation management system includes at least one processing node that includes a memory and a processor. The at least one processing node further includes a set of reservation processing and transaction modules that manage and process reservation requests and inquiries. At least one general purpose database is communicatively coupled to the at least one processing node. The at least one general purpose database includes a set of pre-allocated tables of fixed length records. At least one persistent storage device is communicatively coupled to the at least one processing node. The general purpose database persistently stores the set of pre-allocated tables of fixed length records on the at least one persistent storage device.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.

Abstract: The invention includes various systems, architectures, frameworks and methodologies that can securely enforce a privacy policy. A method is included for securely guaranteeing a privacy policy between two enterprises, comprising: creating a message at a first enterprise, wherein the message includes a request for data concerning a third party and a privacy policy of the first enterprise; signing and certifying the message that the first enterprise has a tamper-proof system with a privacy rules engine and that the privacy policy of the first entity will be enforced by the privacy rules engine of the first enterprise; sending the message to a second enterprise; and running a privacy rules engine at the second enterprise to compare the privacy policy of the first enterprise with a set of privacy rules for the third party.

Abstract: Aspects of the present invention provide a solution for passively monitoring a computer system. In an embodiment, an indexing agent operates on a physical server having a plurality of virtual servers. The indexing agent has a framework having a plurality of indexing layers. Each of these indexing layers is adapted to index a virtual server along a different abstraction level to extract abstraction level features indicative of changes in the virtual server. Further, each of the indexing layers has an application programming interface, which is adapted to receive one or more external indexing modules to be plugged into the framework. Each indexing module is adapted to provide instructions to the indexing agent while the indexing layer to which it is plugged is indexing the associated abstraction level of the virtual machine.

Abstract: Aspects of the present invention provide a solution for passively monitoring a computer system. In an embodiment, a virtual server is accessed by an indexing agent that is contained in an indexing appliance. The virtual server is located on a physical server and is one of a plurality of virtual system instances on a common physical server. The indexing appliance is separate from the virtual server and, as such, the indexing agent is not executed within the virtual server, itself. The indexing agent retrieves a virtual image of the virtual server and indexes the virtual image to extract features indicative of changes in the virtual server. These features are analyzed to perform passive monitoring of the virtual server. Since the indexing appliance is separate from the virtual server for which passive monitoring is being performed, the indexing agent can perform the retrieving and the indexing without utilizing agents executing within the virtual server.

Abstract: Methods and apparatus are provided for presenting personalized information to consumers in a retail environment. A personalized price is determined for at least one product that is in physical proximity to the customer. The physical proximity may be determined, for example, by evaluating identifiers, such as RFID tags, associated with each customer and product. A personalized message can be also presented to a customer regarding at least one product that is in physical proximity to the customer. The personalized message can provide, for example, dietary or safety information relevant to the customer and at least one product in the proximity of the customer. The personalized information may be determined based on one or more personalized message rules.

Abstract: The invention includes various systems, architectures, frameworks and methodologies that can securely enforce a privacy policy. A method is included for securely guaranteeing a privacy policy between two enterprises, comprising: creating a message at a first enterprise, wherein the message includes a request for data concerning a third party and a privacy policy of the first enterprise; signing and certifying the message that the first enterprise has a tamper-proof system with a privacy rules engine and that the privacy policy of the first entity will be enforced by the privacy rules engine of the first enterprise; sending the message to a second enterprise; and running a privacy rules engine at the second enterprise to compare the privacy policy of the first enterprise with a set of privacy rules for the third party.

Abstract: Various embodiments of the present invention allow concurrent accesses to a cache. A request to update an object stored in a cache is received. A first data structure comprising a new value for the object is created in response to receiving the request. A cache pointer is atomically modified to point to the first data structure. A second data structure comprising an old value for the cached object is maintained until a process, which holds a pointer to the old value of the cached object, at least one of one of ends and indicates that the old value is no longer needed.