Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.

Abstract: Embodiments for discovery and analysis of interpersonal relationships from a collection of unstructured text data by a processor. A relationship between one or more entities and extracted text data from a plurality of unstructured text data may be identified such that the relationship includes a sentiment of the relationship, a type of relationship, temporal information, or a combination thereof. The one or more entities may be associated with a knowledge graph based on an ontology of concepts representing a domain knowledge. The extracted information and the identified relationship may be automatically aggregated into a multi-graph representation.

Abstract: A computer system, method, and computer readable product are provided for managing passwords using steganography. In various embodiments, a computing system provides a password manager that a user provides a password to. The user then selects a service for which credentials will be generated or stored, and an image on the user's device that will be used to steganographically store the credentials. The computing system then generates a steganographic image that includes the credentials and stores that image with the other images on the user's device.

Abstract: A computer system, method, and computer readable product are provided for managing passwords using steganography. In various embodiments, a computing system provides a password manager that a user provides a password to. The user then selects a service for which credentials will be generated or stored, and an image on the user's device that will be used to steganographically store the credentials. The computing system then generates a steganographic image that includes the credentials and stores that image with the other images on the user's device.

Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.

Abstract: A computer system, method, and computer readable product are provided for managing passwords using steganography. In various embodiments, a computing system provides a password manager that a user provides a password to. The user then selects a service for which credentials will be generated or stored, and an image on the user's device that will be used to steganographically store the credentials. The computing system then generates a steganographic image that includes the credentials and stores that image with the other images on the user's device.

Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.

Abstract: Technique to determine relative relevance of pairs of nodes in a linked data graph, such as an RDF graph, including calculation of raw relevance scores (which are based upon adjacency relations between nodes after edge filtering, the incoming and outgoing degrees of nodes in the graph after the edge filtering, and the distance (or weight) values of the edge(s)) and/or “refined relevance scores,” which take into account “complementary nodes.

Abstract: A method, computer system, and a computer program product for building a team to work on an opportunity is provided. The present invention may include receiving an opportunity signature based on the opportunity. The present invention may include determining a plurality of team roles. The present invention may include selecting a role to fill from the determined plurality of team roles. The present invention may include determining a plurality of candidates, wherein the plurality of candidates includes a plurality of candidate evidence data. The present invention may include selecting a candidate based on the plurality of candidate evidence data. The present invention may include assigning the selected candidate to fill the selected role. The present invention may include iteratively selecting at least one additional role and at least one additional candidate to fill the selected at least one additional role on the team until a stopping criterion is met.

Abstract: Embodiments for discovery and analysis of interpersonal relationships from a collection of unstructured text data by a processor. A relationship between one or more entities and extracted text data from a plurality of unstructured text data may be identified such that the relationship includes a sentiment of the relationship, a type of relationship, temporal information, or a combination thereof. The one or more entities may be associated with a knowledge graph based on an ontology of concepts representing a domain knowledge. The extracted information and the identified relationship may be automatically aggregated into a multi-graph representation.

Abstract: A computer system, method, and computer readable product are provided for managing passwords using steganography. In various embodiments, a computing system provides a password manager that a user provides a password to. The user then selects a service for which credentials will be generated or stored, and an image on the user's device that will be used to steganographically store the credentials. The computing system then generates a steganographic image that includes the credentials and stores that image with the other images on the user's device.

Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.

Abstract: Technique to determine relative relevance of pairs of nodes in a linked data graph, such as an RDF graph, including calculation of raw relevance scores (which are based upon adjacency relations between nodes after edge filtering, the incoming and outgoing degrees of nodes in the graph after the edge filtering, and the distance (or weight) values of the edge(s)) and/or “refined relevance scores,” which take into account “complementary nodes.

Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.

Abstract: A method and system for indicating a priority of a first linked node and a second linked node within a plurality of linked nodes associated with an electronically interactive social relations service. The method may include assigning a weight to the first linked node within the plurality of linked nodes. The method may also include assigning a weight to the second linked node within the plurality of linked nodes. Additionally, the method may include determining an adjustment of the weight of the first linked node within the plurality of linked nodes. The method may further include adjusting the weight of the second linked node based on the determining of the adjustment of the weight of the first linked node, the adjusting of the weight of the second linked node corresponding to a link strength of the second link node relative to the first link node.