Abstract: Making an information retrieval process public, so that it can be followed by others, allows capturing of an interest graph that allows people to learn more about shared interests with other people. This also allows items of interest to a trusted resource (such as an expert) to be identified. These items can then be brought to the attention of other users that share the same interest as the expert. In addition, by keeping track of what particular content a user has already seen, the system can bring items of interest to the user's attention, where the user has not yet seen those items.

Abstract: Making an information retrieval process public, so that it can be followed by others, allows capturing of an interest graph that allows people to learn more about shared interests with other people. This also allows items of interest to a trusted resource (such as an expert) to be identified. These items can then be brought to the attention of other users that share the same interest as the expert. In addition, by keeping track of what particular content a user has already seen, the system can bring items of interest to the user's attention, where the user has not yet seen those items.

Abstract: Making an information retrieval process public, so that it can be followed by others, allows capturing of an interest graph that allows people to learn more about shared interests with other people. This also allows items of interest to a trusted resource (such as an expert) to be identified. These items can then be brought to the attention of other users that share the same interest as the expert. In addition, by keeping track of what particular content a user has already seen, the system can bring items of interest to the user's attention, where the user has not yet seen those items.

Abstract: Methods, systems, and computer program products for dispatching an incoming event are described. A scoring stack is accessed, the scoring stack comprising an identity of one or more tasks, each task corresponding to one or more scorable functions. A scorable tree is generated based on the one or more scorable functions corresponding to the one or more tasks of the scoring stack and the incoming event is processed using the scorable tree to generate one or more scores. One or more actions identified in the scorable tree are performed based on the one or more scores.

Abstract: In an example, a method includes receiving a data package, the data package including a contact identification and a message payload; in response to determining that a key for the contact identification does not exist in a contact table: generating a key for the contact identification; and updating the contact table with the generated key to indicate an association between the key and the contact identification; calculating a hashed identification based on the generated key and contact identification; and associating the message payload with the hashed identification in a message table.

Abstract: Methods, systems, and computer program products for dispatching an incoming event are described. A scorable tree is obtained and the incoming event is submitted to a root node of the scorable tree for processing. The incoming event is augmented with scoring data generated by the root node to create a scoring event and the scoring event is iteratively passed from each parent node of the scorable tree to each corresponding child node of the scorable tree for further processing until each leaf node of each branch of the scorable tree is reached, wherein each child node augments an incoming scoring event with additional scoring data and each leaf node generates an intermediate scoring event.

Abstract: Methods, systems, and computer program products for dispatching an incoming event are described. A scorable tree is obtained and the incoming event is submitted to a root node of the scorable tree for processing. The incoming event is augmented with scoring data generated by the root node to create a scoring event and the scoring event is iteratively passed from each parent node of the scorable tree to each corresponding child node of the scorable tree for further processing until each leaf node of each branch of the scorable tree is reached, wherein each child node augments an incoming scoring event with additional scoring data and each leaf node generates an intermediate scoring event.

Abstract: Methods, systems, and computer program products for dispatching an incoming event are described. A scoring stack is accessed, the scoring stack comprising an identity of one or more tasks, each task corresponding to one or more scorable functions. A scorable tree is generated based on the one or more scorable functions corresponding to the one or more tasks of the scoring stack and the incoming event is processed using the scorable tree to generate one or more scores. One or more actions identified in the scorable tree are performed based on the one or more scores.

Abstract: In an example, a method includes receiving a data package, the data package including a contact identification and a message payload; in response to determining that a key for the contact identification does not exist in a contact table: generating a key for the contact identification; and updating the contact table with the generated key to indicate an association between the key and the contact identification; calculating a hashed identification based on the generated key and contact identification; and associating the message payload with the hashed identification in a message table.

Abstract: Various embodiments provide data structures and algorithms for efficiently computing a time ordered stream that is the combination of a time ordered substream for individual persons of interest. In addition, various embodiments provide an approach for identifying how many changes of interest have happened to a particular stream since it was last viewed.

Abstract: Various embodiments provide data structures and algorithms for efficiently computing a time ordered stream that is the combination of a time ordered substream for individual persons of interest. In addition, various embodiments provide an approach for identifying how many changes of interest have happened to a particular stream since it was last viewed.

Abstract: Various embodiments provide data structures and algorithms for efficiently computing a time ordered stream that is the combination of a time ordered substream for individual persons of interest. In addition, various embodiments provide an approach for identifying how many changes of interest have happened to a particular stream since it was last viewed.

Abstract: Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests.

Abstract: Various embodiments provide data structures and algorithms for efficiently computing a time ordered stream that is the combination of a time ordered substream for individual persons of interest. In addition, various embodiments provide an approach for identifying how many changes of interest have happened to a particular stream since it was last viewed.

Abstract: In a crowd-sourced question answering system, the user is allowed to provide clarifying information to eliminate some of the most probable solutions or answers. This allows the user to find less common solutions to a query.

Abstract: Making an information retrieval process public, so that it can be followed by others, allows capturing of an interest graph that allows people to learn more about shared interests with other people. This also allows items of interest to a trusted resource (such as an expert) to be identified. These items can then be brought to the attention of other users that share the same interest as the expert. In addition, by keeping track of what particular content a user has already seen, the system can bring items of interest to the user's attention, where the user has not yet seen those items.

Abstract: Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests.

Abstract: Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests.

Abstract: Methods and systems provide a tool for prioritizing the ordering of outstanding indexing work in order to bring a particular portion of an indexing source up to date quickly and to reduce the likelihood of inconsistencies between an index-backed view and a direct view of a source. In accordance with the described embodiments, indexing of items can be prioritized based upon a user's view or metadata contained within a query. Further, in at least some embodiments, the tool can decide the order to index items based upon multiple prioritization requests.

Abstract: A method and system which allow the addition of context into a search involves the use of state monitors in the computing environment. The state monitors record information such as the installed hardware, software, user preferences, and operating modes. The state information is used to modify information gathered via a user search to make the search results more relevant to the user in the context of his computing environment. The monitors, along with logical operators and variables, assess the current state of the machine and modify the displayed search results by excluding irrelevant information, biasing up information relevant to the computing environment and biasing down other information less relevant to the computing environment.