Abstract: Many contemporary computing scenarios involve the submission by a user of a search query to be applied to a data set (such as a set of web pages indexed by a web search engine.) Additionally, many users participate in social networking and have generated a social profile, including demographic information, interests, and associations with other users who also have social profiles. It may be advantageous to improve the presentation of search results from search queries by adjusting the search queries according to a prediction of user interest of the user in the topics associated with respective search results, based on the information in the social profile of the user. For example, search results relating to topics in which the user or the user's friends have expressed an interest within the social network may be presented before other search results, thereby improving the relevance of the search results to the user.

Abstract: Concepts and technologies are described herein for summarizing streams of information. A stream of information is obtained and analyzed. One or more entities are identified in the stream. The data in the stream is grouped into one or more clusters corresponding to the identified entities. The data in the clusters is summarized, and a timeline corresponding to the data in the cluster is determined. In some embodiments, a format can be selected for presentation of the summarized stream data. The data in the stream can be formatted in the selected format, and the summarized data can be presented in the selected format. In some embodiments, an update feature can be used to update the data in the summarized stream. The data in the stream can be updated, and the updated summarized stream can be formatted and presented.

Abstract: Concepts and technologies are described herein for authority ranking for real time and social search. An authority index configured to store data relating to sources is generated. Data relating to the sources, including an authority value, are generated and stored at the authority index. The authority value may be defined as a function of source, topic, and point of view (“POV”), as well as other data, if desired, and may be determined based upon one or more ranking functions. The ranking functions are determined, and data corresponding to the ranking functions is obtained. Each of the ranking functions may be weighted according to a weighting function, a confidence value or interval, one or more time functions, and/or other methods. The obtained authority value may be used for affecting ranking of search results or for other purposes.

Abstract: Methods and computer-readable media are provided for determining suggested queries. A user enters a search website, and the user is identified based on a user identification. Suggested queries are determined based on a group associated with the user. This association is created by extracting queries from data logs, categorizing the queries into groups based on their respective subject matter, associating the user with one or more groups, and determining suggested queries for each group. The suggested queries are communicated for display.

Abstract: A user interface system and process for graphically displaying the results of a standard search, such as a database search, to a user on a display device via an interactive search results window in which the user views and filters search results items. These results can be presented in either a cluster or histogram format, or both. This allows the user to visualize the results graphically, rather than just displaying a list of the items found. In addition the presentation of the search results can be graphically manipulated to easily filter the results as desired by the user.

Abstract: Simulcast flow-controlled data streams is described. In embodiment(s), multicast data streams each communicate data to client devices at a different data rate. A high data rate of a first data stream can be reduced to accommodate a receive data rate of a client device that receives the data slower than the high data rate of the first data stream. A flow control service can monitor the high data rate of the first data stream to determine when the high data rate is reduced to a low trigger data rate, initiate a data stream probe at a probe data rate to determine slow client devices that receive the data slower than the probe data rate, and then demote the slow client devices for communication with a second data stream that communicates the data at a low data rate.

Abstract: Data objects are sent using a data carousel and forward error correction. This involves segregating a file into groups, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. At a receiver, the blocks are stored on disk as they are received. However, they are segregated by group as they are stored. When reception is complete, each group is read into RAM, decoded, and written back to disk. In another embodiment, the receiver segregates allocated disk space into areas corresponding to sets of groups. Received blocks are then segregated only by set as they are written to disk. One or more RAM buffers can be used in this embodiment. When reception is complete, each set is read into RAM, decoded, and then written back to disk.

Abstract: Data objects are sent using a data carousel and forward error correction. This involves segregating a file into groups, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. At a receiver, the blocks are stored on disk as they are received. However, they are segregated by group as they are stored. When reception is complete, each group is read into RAM, decoded, and written back to disk. In another embodiment, the receiver segregates allocated disk space into areas corresponding to sets of groups. Received blocks are then segregated only by set as they are written to disk. One or more RAM buffers can be used in this embodiment. When reception is complete, each set is read into RAM, decoded, and then written back to disk.

Abstract: A semi-reliable multicast transport protocol uses multiple channels for communication between a server and multiple client devices. A join channel allows the sever to negotiate with client devices to join and exit a transmission session. A communication channel allows the server to communicate with client devices about a status of the transmission session. A polling channel initiated by a content transfer protocol, which runs on top of the transport protocol, transmits polling queries received from the content transfer protocol, receives client device responses to the polling queries, and passes the client device responses to the content transfer protocol. A data channel transmits data to client devices over a network.

Abstract: In a method of assisting in management of a collection of bookmarked web pages, browsing information is received. The browsing information is related to a history of web browser use. A ranked list of web pages is generated from a plurality of web pages which is received in the browsing information. The generating is based upon a function including one or more statistical elements of the browsing information. Management information is provided based upon the ranked list of web pages. The management information is for assisting in management of a collection of bookmarked web pages.

Abstract: A user interface system and process for graphically displaying the results of a standard search, such as a database search, to a user on a display device via an interactive search results window in which the user views and filters search results items. These results can be presented in either a cluster or histogram format, or both. This allows the user to visualize the results graphically, rather than just displaying a list of the items found. In addition the presentation of the search results can be graphically manipulated to easily filter the results as desired by the user.

Abstract: Data objects are sent using a data carousel and forward error correction. This involves segregating a file into groups, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. At a receiver, the blocks are stored on disk as they are received. However, they are segregated by group as they are stored. When reception is complete, each group is read into RAM, decoded, and written back to disk. In another embodiment, the receiver segregates allocated disk space into areas corresponding to sets of groups. Received blocks are then segregated only by set as they are written to disk. One or more RAM buffers can be used in this embodiment. When reception is complete, each set is read into RAM, decoded, and then written back to disk.

Abstract: Data objects are sent using a data carousel and forward error correction. This involves segregating a file into groups, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. At a receiver, the blocks are stored on disk as they are received. However, they are segregated by group as they are stored. When reception is complete, each group is read into RAM, decoded, and written back to disk. In another embodiment, the receiver segregates allocated disk space into areas corresponding to sets of groups. Received blocks are then segregated only by set as they are written to disk. One or more RAM buffers can be used in this embodiment. When reception is complete, each set is read into RAM, decoded, and then written back to disk.

Abstract: Data objects are sent using a data carousel and forward error correction. This involves segregating a file into groups, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. At a receiver, the blocks are stored on disk as they are received. However, they are segregated by group as they are stored. When reception is complete, each group is read into RAM, decoded, and written back to disk. In another embodiment, the receiver segregates allocated disk space into areas corresponding to sets of groups. Received blocks are then segregated only by set as they are written to disk. One or more RAM buffers can be used in this embodiment. When reception is complete, each set is read into RAM, decoded, and then written back to disk.

Abstract: Data files can be sent using a data carousel and forward error correction. This involves segregating a file into groups of data blocks, wherein each group represents k data blocks. From the k data blocks of each group, n erasure-encoded blocks are calculated, where n>k. The n erasure-encoded blocks are sent in a round-robin fashion using IP multicast technology: the first erasure-encoded block for each group, then the second block of each group, and so on. Assuming a file having S data blocks, the value of k is selected by first determining the minimum number of groups G of erasure-encoded blocks that can represent the S data object blocks, wherein each group of erasure-encoded blocks represents no more than kmax data object blocks. Then, the sender determines the smallest number of data object blocks kmin that can be represented in each group while still requiring no more than G groups of erasure-encoded blocks to represent the S data object blocks.