Abstract: A method, system and computer-usable medium are disclosed for enhancing a classification system to include an automatic classification validation system. The automatic classification validation system takes the classification results and automatically validates them for correctness. More specifically, the automatic classification validation system analyzes the data objects in the categories and, if any outliers are identified, then determines a context of the data object from a plurality of records contained within a certain category to determine the context. The classification validation system then uses the context of the data object to validate the classification.

Abstract: Mechanisms for ingesting a document from a corpus of documents for use by a Question and Answer (QA) system are provided. The mechanisms receive a document from a corpus of documents and generate one or more titles for the document based on an analysis of content of the document. The mechanisms generate score values for the titles based on a measure of a degree to which the titles represent the content of the document. The mechanisms store the score values in association with the titles as document metadata associated with the document and output the document and document metadata to the QA system. The QA system utilizes the document metadata and document to generate a candidate answer to an input question.

Abstract: An approach is provided to adjust time dependent terminology in a question and answering (QA) system. The approach ingests a set of documents to produce a corpus utilized by the QA system. A base time is established and the approach acquires a temporally accurate lexicon of terms that correspond to the base time. A corpus of the QA system is updated according to the lexicon. The QA system answers a question according to the updated corpus.

Abstract: An approach is provided for mining threaded online discussions. In the approach, performed by an information handling system, a natural language processing (NLP) analysis is performed on threaded discussions pertaining to a given topic. The analysis is performed across multiple web sites with each of the web sites including one or more threaded discussions. The analysis results in harvested discussions pertaining to the topic. The harvested discussions are correlated and a question is identified from the harvested discussions. A set of candidate answers is also identified from the harvested discussions, with one of the candidate answers being selected as the most likely answer to the identified question.

Abstract: One embodiment of the present method and apparatus for efficiently expanding a P2P network includes receiving a search request message from a requesting node and sending a response message to the requesting node on behalf of a node that has the requested data, where the response message originates at an intermediate node. The intermediate node may respond on behalf of the “responding” node, for example, in cases where the responding node is too far away from the requesting node to receive the search request message.

Abstract: An approach is provided to automatically classify and handle data. The approach is implemented by an information handling system. In the approach, data is received, from a sender, at a content management system. When the data is received, the system automatically utilizes an artificial intelligence (AI) engine (e.g., IBM Watson, etc.) to perform an unstructured information analysis using a pre-existing knowledge base. The result of using the AI engine is an identification of a confidentiality level of the data. The approach further performs an action based on the identified confidentiality level of the data.

Abstract: Disclosed are methods and systems for expanding the search space in a Peer-to-Peer (“P2P”) network. In one embodiment, the search space is expanded by increasing the time-to-live value of the search request message. The P2P network may include a plurality of nodes, and the method for increasing the search space in the network includes the steps of receiving a search request message; changing a time-to-live value carried by the message; and forwarding the message to at least one peer node.

Abstract: One embodiment of the present method and apparatus for assisting a peer-to-peer connection between a first node and a second node includes receiving, at a third node, a request for connection assistance from one of the first and second nodes. The third node then connects to both the first node and the second node, receives the data from the first node and delivers the data to the second node. In this manner, data may be transferred between the first and second nodes even if the first and second nodes are unable to directly connect to each other (e.g., due to permanent or temporary limitations).

Abstract: A router or router process directs computer network traffic by, upon receipt of an access request to a network resource, determining that the request contains at least one routing cookie; determining a cookie scope of the routing cookie; responsive to the cookie scope being unequivalent to a root value, designating the at least one routing cookie as a delegate cookie; adding a path value associated the delegate cookie to a session lookup table entry for a user associated with the network traffic; and subsequently, using the lookup table entry to determine a destination address for redirecting computer network traffic for the user having the delegate cookie to a delegated resource located in the network at the path.

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

Abstract: Efficient routing for a client-server session or connection is provided in an application layer of multi-layered systems interconnect stack by caching a plurality of application-specific information at an intermediary network point; using the application specific information to route messages for an application connection; and indexing the application-specific information with a key provided by the application. Optionally, a second key may be used to retrieve the application-specific information if the first key is not provided in an application connection request, where the second key is optionally opaque to the application program. The intermediary network point may be an edge of network Internet Protocol (IP) switch, and the application layer in which the routing is performed may be layer seven of the Open Systems Interconnection model.

Abstract: A redundancy elimination mechanism is provided, which applies aspects of duplicate block elimination and delta encoding at the block level. The redundancy elimination mechanism divides file objects into content-defined blocks or “chunks.” Identical chunks are suppressed. The redundancy elimination mechanism also performs resemblance detection on remaining chunks to identify chunks with sufficient redundancy to benefit from delta encoding of individual chunks. Any remaining chunks that do not benefit from delta encoding are compressed. Resemblance detection is optimized by merging groups of fingerprints into super fingerprints. This merging can be constructed to ensure that if two objects have a single super fingerprint in common, they are extremely likely to be substantially similar.

Abstract: A conveyed set of recipient email messages can be identified. An event triggering the conveyed set of email message to be prioritized relative to each other can be detected. Responsive to the detected event, a priority score for each of the emails in the conveyed set can be determined based upon recipient specific criteria. The recipient specific criteria can be based upon recipient behavior regarding a set of previous email messages. The priority score can be calculated base upon prioritizing factors determined from patterns discovered in the recipient behavior regarding the set of previous email messages. At least one programmatic action can be performed based upon the determined priority scores of the email messages.

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

Abstract: A router or router process directs computer network traffic by, upon receipt of an access request to a network resource, determining that the request contains at least one routing cookie; determining a cookie scope of the routing cookie; responsive to the cookie scope being unequivalent to a root value, designating the at least one routing cookie as a delegate cookie; adding a path value associated the delegate cookie to a session lookup table entry for a user associated with the network traffic; and subsequently, using the lookup table entry to determine a destination address for redirecting computer network traffic for the user having the delegate cookie to a delegated resource located in the network at the path.

Abstract: In one embodiment, the present invention is a method and apparatus for inferring the read status of instant messages. One embodiment of the inventive method involves displaying the instant message on the receiver's computing device and sending a message to the sender indicating a probability with which the receiver has viewed the instant message. In one embodiment, this probability is based at least in part on an amount of the instant message that is in view on the receiver's computing device and on user input that is received by the receiver's computing device, e.g., from the receiver.

Abstract: One embodiment of the present method and apparatus for reducing spam in peer-to-peer networks includes forming a search message including at least one decoy word and sending the search request message, including the decoy word(s), to one or more nodes in the network. Embodiments of the present invention make it possible to weed out nodes in the network that send spam in response to every search message (e.g., regardless of the search message's content).

Abstract: One embodiment of the present method and apparatus for improving data transfers in peer-to-peer networks includes receiving a search request message from a requesting node, where the search request message requests specific data. A responding node then sends a response message to the requesting node including a referral message comprising at least one referred node that is expected to have the requested data, based on knowledge of the referred node's previous incoming and outgoing data transfers. The responding node may also indicate that the responding node has the requested data. In addition to increasing the requesting node's view of the peer-to-peer network, this also enables the identification of nodes (e.g., referred nodes) with which the requesting node may wish to establish direct peer-to-peer connections, e.g., to build peer-to-peer communities of nodes having similar interests.

Abstract: One embodiment of the present method and apparatus for re-establishing anonymous data transfers between a first endpoint and a second endpoint in a network includes receiving, from a first node, the identity of a second node connected to the first node, where at least the first node is a neighbor node. A third node (a neighbor node) is then selected, and instructed to connect to the second node in order to establish a link for the path. In this manner, the first endpoint and the second endpoint remain unknown at least to each other (e.g., where “unknown” means that neither endpoint knows any identifying information, such as network address, about the other endpoint), and likely to all other nodes in the path as well. In another embodiment, a failure is detected at a neighbor node, where the neighbor node is part of an original path between the first endpoint and the second endpoint.

Abstract: One embodiment of the present method and apparatus for user-moderation of an online chat room in which a plurality of users are exchanging messages includes providing the chat room and controlling a manner in which the users send and receive the messages in the chat room in accordance with user feedback relating to the messages. In one embodiment, the user feedback is received in the form of user chat profiles, which describe the respective users' participation in the chat room, and flags, which users may be given in response to messages that are deemed inappropriate for the chat room.