Abstract: A computer-implemented method and a computer system are proposed. According to the method, content and a rule are obtained. The rule specifies a condition associated with the content and an action to be performed if the condition is satisfied. A profile, instructions and chain code are determined at least based on the rule. The profile is used for recording a result of the action. The instructions are used for monitoring whether the condition is satisfied and for updating the profile. The chain code is used for operating a blockchain. In response to the condition being satisfied, the profile is updated and the updated profile is stored in association with the content and the rule into the blockchain by the chain code.

Abstract: A masking system and method for automatically masking sensitive user information on a webpage is provided. The method includes the steps of identifying a location of the first user data of the first type of sensitive user information on the webpage, updating an initial path to the first user data to account for changes to the initial path detected in response to repeated visits to the webpage, wherein the updated initial path to the first user data is stored as a stable path, locating a second user data associated with a second type of sensitive user information on the webpage, by accessing a central database containing path information to a location of the second user data on the webpage, and masking the first user data and the second user data on the webpage, using the stable path and the path information obtained from the central database.

Abstract: A method, computer system, and a computer program product for a monitor security process is provided. The present invention may include configuring monitors in a chain configuration by configuring a network address of a primary monitor to a backup monitor. The present invention may include configuring a sensor to communicate with the monitors. The present invention may include receiving a first set of information from the sensor to a primary and backup monitor and broadcasting the information to a plurality of monitors and logging the information. The present invention may include receiving a second set of information from the chain of monitors. The present invention may include determining the information conflicts and marking a temporary log within the plurality of temporary logs as conflicting. The present invention may include determining a conflicting threshold has been exceeded, generating and executing an audit and recovery plan that isolates the affected monitor.

Abstract: A method, computer system, and a computer program product for a monitor security process is provided. The present invention may include configuring monitors in a chain configuration by configuring a network address of a primary monitor to a backup monitor. The present invention may include configuring a sensor to communicate with the monitors. The present invention may include receiving a first set of information from the sensor to a primary and backup monitor and broadcasting the information to a plurality of monitors and logging the information. The present invention may include receiving a second set of information from the chain of monitors. The present invention may include determining the information conflicts and marking a temporary log within the plurality of temporary logs as conflicting. The present invention may include determining a conflicting threshold has been exceeded, generating and executing an audit and recovery plan that isolates the affected monitor.

Abstract: A method, computer system, and a computer program product for a monitor security process is provided. The present invention may include configuring monitors in a chain configuration where sensors communicate with the monitors. The present invention may include receiving a first set of information from the sensor to a primary and backup monitor based on an event. The present invention may include broadcasting the information from the primary and backup monitor to a plurality of monitors and logging the information. The present invention may include receiving a second set of information from within the chain of monitors. The present invention may include determining that the sets of information conflict. The present invention may include marking at least one temporary log within the plurality of temporary logs as conflicting. The present invention may include determining that a conflicting threshold has been exceeded and then generate an audit and recovery plan.

Abstract: Automatically reserving a requested resource in real-time is provided. In response to posting a resource request message that includes a set of resource request criteria on a network, a set of resource availability options is received from a set of resource service providers via the network using a negotiation communication channel. The set of resource availability options received from the set of resource service providers is ranked based on an amount of matching between constraints of each respective resource availability option and the set of resource request criteria. The set of resource availability options is displayed by rank from a greatest amount to a least amount of matching in a resource negotiation table.

Abstract: A masking system and method for automatically masking sensitive user information on a webpage is provided. The method includes the steps of identifying a location of the first user data of the first type of sensitive user information on the webpage, updating an initial path to the first user data to account for changes to the initial path detected in response to repeated visits to the webpage, wherein the updated initial path to the first user data is stored as a stable path, locating a second user data associated with a second type of sensitive user information on the webpage, by accessing a central database containing path information to a location of the second user data on the webpage, and masking the first user data and the second user data on the webpage, using the stable path and the path information obtained from the central database.

Abstract: Generating a solution keyword tag cloud is provided. Keywords are identified in a question asking how to resolve an issue experienced by a user with a product. The keywords identified in the question are matched with keyword tags included in a set of condition-solution trees corresponding to the product. The solution keyword tag cloud for the product is generated based on the matching of the keywords identified in the question with the keyword tags included in the set of condition-solution trees corresponding to the product. The solution keyword tag cloud is presented in a graphical user interface display on a client device corresponding to the user.

Abstract: Computing systems, methods and management tools for scheduling, optimizing and completing a dynamically adjustable workflow process. The computing systems, methods and management tools being capable of evaluating the availability of resources available for completing the workflow process and ascertaining the reliability of the resources in order to pre-generate a workflow process schedule. The computing systems, methods and management tools are further able to communicate with the assigned resources to incrementally negotiate and receive approval for proposed improvements to the pre-generated workflow schedule prior to implementation of the workflow schedule in order to optimize the cycle time of the process and increase probability of successfully completing the workflow process. The computing systems, methods and management tools may dynamically track the due dates for completing particular tasks and generate amended workflow process schedules in the event a failure occurs.

Abstract: Administering reward schemes. A first reward scheme is predefined by a computer system, the first reward scheme defining a first reward event. A second reward scheme is obtained externally by the computer system, the second reward scheme defining a second reward event. In response to an action by a user, the computer system determines whether the first reward event or the second reward event has been triggered. If the first reward event has been triggered, the computer system calculates a first reward for the user according the first reward scheme and if the second reward event has been triggered, the computer system calculates a second reward for the user according the second reward scheme. The second reward scheme may be obtained by, and shared to, the computer system as an inheritance of rules within an organization.

Abstract: Aspects are related to automatically determining game mechanics in business process gamification. Execution data of prior users of a first task in a business process is accessed in a history database. The execution data of the prior users of the first task is analyzed. The game mechanics for the first task is determined according to a result of the analyzing.

Abstract: Device and method for implementing a vehicle sharing reward program. The present invention provides for a cost-sharing plan where two or more constituencies share the rental cost associated with a user who rents a shared vehicle in a vehicle sharing program. This results in a reimbursement of the rental cost to the user. When enrolling in the vehicle sharing reward program, the user is given a health prescription to adhere to on any trip taken while using a shared vehicle. On a selected travel route, the user visits a vehicle sharing station, where the sharing station includes a kiosk that the user uses to check-in and upload relevant information such as distance traveled and locations visited. By complying with the health prescription issued to the user, the user can have its total rental cost reimbursed.

Abstract: A device, method, and optical machine-readable code for providing context-aware guidance for healthcare. The device includes: a wireless communication module configured to receive contextual information pertaining to a user's health from one or more devices; an optical code reader to read an optical code encoded with a plurality of healthcare guidance messages; a processor to decode the optical code encoded with the plurality of healthcare guidance messages into a selected context-aware healthcare guidance message using the received contextual information pertaining to the user's health; and a screen for providing the selected context-aware healthcare guidance message to the user. The optical machine-readable code including: an optical code storing a plurality of healthcare guidance messages and encoded in a manner that one of the plurality of healthcare guidance messages can be selected using a decode key, wherein the optical code is provided on a container for medication.

Abstract: A method for generating a lifestyle progression (LSP) plan for a patient subject includes collecting patient data including a list of exercise activities performed over a plurality of non-overlapping periods for a plurality of patients and patient health records. The collected patient data is clustered into related groups using k-mean clustering. An LSP model for each cluster is created by averaging the exercise activities performed and respective period durations. Patient data for a patient subject including patient health records is received. A vector is calculated for the received patient data. A shortest distance between the calculated vector for the received patient data and vectors calculated for each LSP model is found. An LSP is built for the patient subject bases on the LSP model with the shortest distance to the calculated vector for the received patient data.

Abstract: A method for matching social network participants includes receiving activity data pertaining to a plurality of participants in a social network. The activity data is parsed to generate activity pattern summaries for each of the participants. The participants are clustered into a plurality of groups according to the activity pattern summaries. At least one participant of influence is determined within at least one group according to the activity data. A social connection is established within the social network between the determined participant of influence and at least one other participant clustered into the same group.

Abstract: A method and system of teaming via a social network service for activity coaching include creating a stage model that comprises a first and second stages, wherein a value of a performing parameter for use in the first stage is less than a value of the performing parameter for use in the second stage; receiving initial activity data of users at social network service; determining users involved in the first stage according to initial activity data; teaming the users involved in the first stage; communicating to users via social network service the value of the performing parameter for use in the second stage; setting a team goal to achieve the value; waiting for feedback from the users; determining whether the team goal is achieved; moving the users in the same team to the second stage; and providing rewards to the users, if the determination is affirmative.

Abstract: Systems for negotiation support. First and second negotiation agent modules respectively receive multiple first proposals, calculate preference scores (PSs) for each first proposal using utility models and select a portion of the first proposals as second proposals in descending order according to the calculated PSs therewith. The negotiation management module receives the second proposals from the first and second negotiation modules, and generates third proposals according to the received proposals. The first and second negotiation agent modules respectively receive the third proposals, calculate PSs for received proposals using utility models, and arrange the third proposals in descending order according to PSs therewith to generate voting results. The negotiation management module receives the voting results, and generates a final agreement according to the received voting results.

Abstract: Methods for auction negotiation support executed by a negotiator agent module are provided. The best bid corresponding to a product/service and a total number of negotiator agent modules placing the best bid are received. It is determined that a bid is placed by a following strategy or an exceeding strategy. The following strategy indicates that, when the received best bid is not equal to the prior bid placed by the negotiator agent module, the negotiator agent module places the bid equal to the received best bid. The exceeding strategy indicates that, when the inverse of the total number of negotiator agent modules placing the best bid is lower than a predetermined threshold, the negotiator agent module places the bid advanced to the received best bid.

Abstract: A method and a system for generating supply chain planning information are provided, which are used to dynamically adjust the control factors of the supply information provided by an original supplier and an original logistics provider, after the first supply chain planning information has been generated through a conventional supply chain planning information system, so as to generate much more supply information to process. Then, the information is processed by a planning engine of the supply chain planning information system to further generate other supply chain planning information among which to select in decision making. Hence, a decision maker can select and find out improved ways to negotiate with suppliers, so as to reduce the total cost and also meet customers' service quality requirements.

Abstract: Methods for auction negotiation support executed by a negotiator agent module are provided. The best bid corresponding to a product/service and a total number of negotiator agent modules placing the best bid are received. It is determined that a bid is placed by a following strategy or an exceeding strategy. The following strategy indicates that, when the received best bid is not equal to the prior bid placed by the negotiator agent module, the negotiator agent module places the bid equal to the received best bid. The exceeding strategy indicates that, when the inverse of the total number of negotiator agent modules placing the best bid is lower than a predetermined threshold, the negotiator agent module places the bid advanced to the received best bid.