Abstract: Audio content is converted to text using speech recognition software. The text is then associated with a distinct voice or a generic placeholder label if no distinction can be made. From the text and voice information, a word cloud is generated based on key words and key speakers. A visualization of the cloud displays as it is being created. Words grow in size in relation to their dominance. When it is determined that the predominant words or speakers have changed, the word cloud is complete. That word cloud continues to be displayed statically and a new word cloud display begins based upon a new set of predominant words or a new predominant speaker or set of speakers. This process may continue until the meeting is concluded. At the end of the meeting, the completed visualization may be saved to a storage device, sent to selected individuals, removed, or any combination of the preceding.

Abstract: Audio content is converted to text using speech recognition software. The text is then associated with a distinct voice or a generic placeholder label if no distinction can be made. From the text and voice information, a word cloud is generated based on key words and key speakers. A visualization of the cloud displays as it is being created. Words grow in size in relation to their dominance. When it is determined that the predominant words or speakers have changed, the word cloud is complete. That word cloud continues to be displayed statically and a new word cloud display begins based upon a new set of predominant words or a new predominant speaker or set of speakers. This process may continue until the meeting is concluded. At the end of the meeting, the completed visualization may be saved to a storage device, sent to selected individuals, removed, or any combination of the preceding.

Abstract: Audio content is converted to text using speech recognition software. The text is then associated with a distinct voice or a generic placeholder label if no distinction can be made. From the text and voice information, a word cloud is generated based on key words and key speakers. A visualization of the cloud displays as it is being created. Words grow in size in relation to their dominance. When it is determined that the predominant words or speakers have changed, the word cloud is complete. That word cloud continues to be displayed statically and a new word cloud display begins based upon a new set of predominant words or a new predominant speaker or set of speakers. This process may continue until the meeting is concluded. At the end of the meeting, the completed visualization may be saved to a storage device, sent to selected individuals, removed, or any combination of the preceding.

Abstract: A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. A user may elect to “tag” a torrent when a new file is submitted to the peer-to-peer system. A user may view the various tags with one or more file fragments that the user is hosting in the background. The user may view the tags for all fragments being shared in the background and search the tags. The peer-to-peer system may store metadata tags for the torrents in a central repository, such as a relational database, or in a distributed hash table.

Abstract: Embodiments of the invention relate to dynamic creation and tracking of one or more tasks. Each task has one or more properties that define the task. Activities are monitored in real-time, and one or more tasks associated with the monitored activity are placed in a queue. Progress of the queued tasks is monitored in view of any associated milestones. Upon completion of the task, the associated milestones are updated to reflect that either the milestones have been met or to change associated milestone data so that future processing of the monitored tasks may include the updated milestone data.

Abstract: A mechanism is provided for distributing file fragments in the background of a segmented peer-to-peer network using list passing between peers. Rather than trading actual content, peers may trade file names or file fragment identifiers. Upon receiving a new file name or identifier, a peer may request that file from the network, either in the background or the foreground. For example, once a client begins background file sharing in a swarm, the client may propagate file information for files it possesses to all or a portion of the peers in a swarm. Those clients then have the file information for a file without the user having to locate and specifically request that file. The file list may piggyback on a file fragment that is transferred as a result of a file sharing request.

Abstract: A mechanism is provided for file fragment pricing in a segmented file sharing system. The mechanism allows peers to set a price for distributing a file through the file sharing system. A peer then becomes a file distributor on behalf of an original file provider. The original file provider may compensate the file distributor based on a compensation agreement. The peer's client may be configured to download file fragments from file distributors, or the original file provider, based on preferences, such as price, peer rating, upload speed, or similarity. As a result, a peer may download a file for a price that is less than the original price from the original file provider. Thus, the mechanism provides an incentive for peers to participate in file sharing, which results in larger swarms.

Abstract: A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. Each file sharing participant may designate an amount of bandwidth and/or storage space for background file sharing. Peer-to-peer file sharing clients then share file data and content in the background automatically. The client may participate in additional swarms, in the background, to generally increase the number of peers in file sharing networks, thus increasing the speed of downloading desired files for other users.

Abstract: A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. Each file sharing participant may designate an amount of bandwidth and/or storage space for background file sharing. Peer-to-peer file sharing clients then share file data and content in the background automatically. The client may participate in additional swarms, in the background, to generally increase the number of peers in file sharing networks, thus increasing the speed of downloading desired files for other users.

Abstract: E-mail applications can be extended to allow recipients to specify quotas indicating maximum numbers of e-mail messages from specific senders based on actions indicated for the recipients to take. A sender can set a quota specifying that no more than five action related e-mail messages should be sent by each sender per week. Quotas may also be set for a number of e-mail messages received that do not require action. Recipient quota information is accessible by senders' e-mail applications so that senders are aware of the quotas before sending an e-mail message. After determining recipients for an e-mail message, an e-mail application can determine quotas for the recipients based on an action indicated in the e-mail message for the sender. The e-mail application can determine if the e-mail message to be sent will approach or reach the quota, and display a notification before the sender sends the e-mail message.

Abstract: A method, apparatus, and computer usable program product for managing received calls. In response to receiving a first call from a user, the process stores a record of the first call in a table of received calls. Thereafter, in response to receiving a second call from the user within a predefined period of time after the first call was prematurely disconnected, the process identifies a second call as a prematurely terminated call. The process then places the prematurely terminated call in a queue of calls according to a set of configurable criteria and updates the record of the first call with a progress of the prematurely terminated call.

Abstract: A mechanism is provided for distributing file fragments in the background of a segmented peer-to-peer network using list passing between peers. Rather than trading actual content, peers may trade file names or file fragment identifiers. Upon receiving a new file name or identifier, a peer may request that file from the network, either in the background or the foreground. For example, once a client begins background file sharing in a swarm, the client may propagate file information for files it possesses to all or a portion of the peers in a swarm. Those clients then have the file information for a file without the user having to locate and specifically request that file. The file list may piggyback on a file fragment that is transferred as a result of a file sharing request.

Abstract: A mechanism is provided for file fragment pricing in a segmented file sharing system. The mechanism allows peers to set a price for distributing a file through the file sharing system. A peer then becomes a file distributor on behalf of an original file provider. The original file provider may compensate the file distributor based on a compensation agreement. The peer's client may be configured to download file fragments from file distributors, or the original file provider, based on preferences, such as price, peer rating, upload speed, or similarity. As a result, a peer may download a file for a price that is less than the original price from the original file provider. Thus, the mechanism provides an incentive for peers to participate in file sharing, which results in larger swarms.

Abstract: Peer-to-peer file sharing clients share file fragments in the background based on rarity values. When a first peer offers a fragment to a second peer to be shared in the background, the second peer checks the rarity of the fragment and identifies one or more fragments from its swarm that is approximately as rare as the fragment being offered. The second peer then offers the one or more fragments in exchange for the originally offered fragment. The first peer may then offer the one or more fragments to other peers in its swarm to be shared in the background.

Abstract: The present disclosure is directed to a method for reading a computer screen having a set of information and a button for submitting the set of information. The method may comprise collecting the set of information; determining a set of representative information, wherein the set of representative information is a subset of the set of information; concatenating the set of representative information to form a summarized context; associating the summarized context with the button; and producing audible sound reciting the summarized context when the button receives focus from a computer mouse.

Abstract: In accordance with one illustrative embodiment, when a file is moved from the background to the foreground in a peer-to-peer client, the client makes a local request for file pieces. The client sends a handshake message to itself to check for available pieces. The client then exchanges messages locally the same way it would with external peers. As an alternative approach to local message passing, the client may keep a local record of file fragments in a data structure, such as a markup language document or other data repository. The client may then query the data structure for needed file fragments before submitting a request to the peer-to-peer network. Every time a new file segment is downloaded and validated in the background, or the foreground, the peer-to-peer client may update the data structure. Then, the client may simply query the data structure for the specific segment it wishes to download.

Abstract: A method, apparatus, and computer usable program product for managing received calls. In response to receiving a first call from a user, the process stores a record of the first call in a table of received calls. Thereafter, in response to receiving a second call from the user within a predefined period of time after the first call was prematurely disconnected, the process identifies a second call as a prematurely terminated call. The process then places the prematurely terminated call in a queue of calls according to a set of configurable criteria and updates the record of the first call with a progress of the prematurely terminated call.

Abstract: In accordance with one illustrative embodiment, when a file is moved from the background to the foreground in a peer-to-peer client, the client makes a local request for file pieces. The client sends a handshake message to itself to check for available pieces. The client then exchanges messages locally the same way it would with external peers. As an alternative approach to local message passing, the client may keep a local record of file fragments in a data structure, such as a markup language document or other data repository. The client may then query the data structure for needed file fragments before submitting a request to the peer-to-peer network. Every time a new file segment is downloaded and validated in the background, or the foreground, the peer-to-peer client may update the data structure. Then, the client may simply query the data structure for the specific segment it wishes to download.

Abstract: A peer-to-peer file sharing client with background file sharing is provided in a segmented peer-to-peer file sharing network. Each file sharing participant may designate an amount of bandwidth and/or storage space for background file sharing. Peer-to-peer file sharing clients then share file data and content in the background automatically. The client may participate in additional swarms, in the background, to generally increase the number of peers in file sharing networks, thus increasing the speed of downloading desired files for other users.

Abstract: Peer-to-peer file sharing clients share file fragments in the background based on rarity values. When a first peer offers a fragment to a second peer to be shared in the background, the second peer checks the rarity of the fragment and identifies one or more fragments from its swarm that is approximately as rare as the fragment being offered. The second peer then offers the one or more fragments in exchange for the originally offered fragment. The first peer may then offer the one or more fragments to other peers in its swarm to be shared in the background.