Abstract: A geographically distributed highly available mailbox system that includes at least first and second data centers servicing different geographical locations. A payload is received by at least one server of the first data center from a first user to be later accessed by a second user. A server from a second data center replicates the payload from the server of the first data center and the first server of the first data center sends notification to the first user that a payload has been uploaded successfully and sends out notification to the second user that the payload has been uploaded. When the second user sends a request to access the payload, the second user is directed to either the first data center or the second data center based on which data center can provide the second user with the quickest access to the payload.

Abstract: An illustrative embodiment of a computer-implemented process for dynamic management of integration protocols connects a set of applications to a communication fabric to form a set of connections, which are monitored to collect a set of performance metrics. In response to a determination the predetermined performance metric is not within the predetermined tolerance associated with the particular application in the set of applications an integration path in the set of connections for the particular application in the set of applications is adjusted by programmatically using a set of rules wherein each rule in the set of rules is a performance driven rule.

Abstract: A computing method receives a shopping list, a GPS location, and products offered at a store. The computing method classifies each shopping list item into one or more hierarchies with an associated confidence level. The computing method determines one or more items corresponding to hierarchies where confidence level that exceeds the predetermined threshold level. The computing method determines a user location and a store within a predefined range of the user location. The computing method determines whether the store includes any of the one or more items and sends a notification to the user including an identification of the store and the item at the store.

Abstract: A computing method receives a shopping list, a GPS location, and products offered at a store. The computing method classifies each shopping list item into one or more hierarchies with an associated confidence level. The computing method determines one or more items corresponding to hierarchies where confidence level that exceeds the predetermined threshold level. The computing method determines a user location and a store within a predefined range of the user location. The computing method determines whether the store includes any of the one or more items and sends a notification to the user including an identification of the store and the item at the store.

Abstract: Providing user software feedback and conflict resolution from a kiosk device. A computer of the kiosk captures audio and visual data from a user during an interaction between the user and software of the kiosk device. The computer analyzes the audio data and visual data to determine at least a sentiment of the user relative to the interaction and determines a score for the interaction. If the score is greater than a threshold, the computer determining at least a portion of the software needs improvement based on the score and the determined sentiment of the user during the interaction.

Abstract: In one embodiment, a computer-implemented method for dynamic management of integration points includes connecting a set of applications to a communication interconnect fabric to form a set of connections, wherein each application in the set of applications is interconnected and each individual connection has a set of integration paths defined including a default path. The set of connections is monitored to determine whether a performance metric for a specific application in the set of applications is within a predefined tolerance. Responsive to a determination that the performance metric for the specific application in the set of applications is not within a predefined tolerance, a change may be instructed in availability of an integration component.

Abstract: A geographically distributed highly available mailbox system that includes at least first and second data centers servicing different geographical locations. A payload is received by at least one server of the first data center from a first user to be later accessed by a second user. A server from a second data center replicates the payload from the server of the first data center and the first server of the first data center sends notification to the first user that a payload has been uploaded successfully and sends out notification to the second user that the payload has been uploaded. When the second user sends a request to access the payload, the second user is directed to either the first data center or the second data center based on which data center can provide the second user with the quickest access to the payload.

Abstract: An illustrative embodiment of a computer-implemented process for dynamic management of integration protocols connects a set of applications to a communication fabric to form a set of connections, which are monitored to collect a set of performance metrics. In response to a determination the predetermined performance metric is not within the predetermined tolerance associated with the particular application in the set of applications an integration path in the set of connections for the particular application in the set of applications is adjusted by programmatically using a set of rules wherein each rule in the set of rules is a performance driven rule.

Abstract: Embodiments of the present invention address deficiencies of the art in respect to application migration and provide a novel and non-obvious method, system and computer program product for application migration through migratable units. In one embodiment, an application migration method can include decomposing an application migration into a plurality of migratable units (MUs). The MUs can be prioritized for migration to a target platform. Thereafter, each of the MUs can be migrated in an order defined by the prioritization. Finally, a stateful wizard can be provided which can reduce the complexity of the migration by providing a dashboard to the migration process.

Abstract: In one embodiment, a computer-implemented method for dynamic management of integration points includes connecting a set of applications to a communication interconnect fabric to form a set of connections, wherein each application in the set of applications is interconnected and each individual connection has a set of integration paths defined including a default path. The set of connections is monitored to determine whether a performance metric for a specific application in the set of applications is within a predefined tolerance. Responsive to a determination that the performance metric for the specific application in the set of applications is not within a predefined tolerance, a change may be instructed in availability of an integration component.

Abstract: A social networking group definition that identifies each social group of a social network user within a social networking service is obtained by a processor for each different social networking service used by the user. An associated subset of items of a wish list of the user is identified for at least one identified social group of the obtained social networking group definitions using the social networking group definition. A partition of the wish list, including the identified subset of items of the wish list and the associated identified social group of the user, is defined for each identified subset of items of the wish list. Each partition of the wish list is accessible only by social connections of the user defined by the respective social group within the social networking group definition.

Abstract: A social networking action by a user within a social networking website that positively references a marketplace offering of an entity is detected by a processor. In response to detecting the social networking interaction by the user, a social networking influence of the user is determined based upon entity interactions by social network connections of the user with the entity by a number of entity access channels of the entity. A determination is made as to whether the determined social networking influence of the user satisfies a reward threshold defined within a social networking influence incentive rule. In response to determining that the determined social networking influence of the user satisfies the incentive threshold defined within the social networking influence incentive rule, an incentive defined within the social networking influence incentive rule is generated for the user.

Abstract: A method of performing a three-way merge includes receiving first, second, and third versions of a structured document containing first, second, and third pluralities of elements respectively; deserializing the first, second, and third versions to generate first, second, and third tree-structured data models respectively representing the first, second, and third versions; generating an identifier for each node of each data model that is unique within the data model by applying identifier determination rules to a context describing the element corresponding to the node; comparing each identifier in the first data model with each identifier in the second data model to identify each node in the first data model not having matching identifiers with any node in the second data model and to link each pair of nodes having matching identifiers; and applying comparison rules to the contexts of each linked pair of nodes to identify differences therebetween.

Abstract: A method of performing a three-way merge includes receiving first, second, and third versions of a structured document containing first, second, and third pluralities of elements respectively; deserializing the first, second, and third versions to generate first, second, and third tree-structured data models respectively representing the first, second, and third versions; generating an identifier for each node of each data model that is unique within the data model by applying identifier determination rules to a context describing the element corresponding to the node; comparing each identifier in the first data model with each identifier in the second data model to identify each node in the first data model not having matching identifiers with any node in the second data model and to link each pair of nodes having matching identifiers; and applying comparison rules to the contexts of each linked pair of nodes to identify differences therebetween.