Systems and methods of calculating communications strengths

Abstract
Organizing a participant list includes maintaining a participant list of users of an electronic communications system to be used by a first user of the electronic communications system. Communications strengths between the first user and each of the users included in the participant list are determined. The users included in the participant list are organized based on the corresponding communications strengths. Communications strengths may be determined for users included in a group within a participant list, and the users within the group may be organized within the group based on communications strength. An additional group in the participant list in which some or all of the users included in the participant list are organized based on communications strength may be provided.
Description
TECHNICAL FIELD

This document relates to passively populating participant lists of an electronic communications system and organizing the entries within the participant lists.


BACKGROUND

When a user first uses an electronic communications system, the user may be provided with a participant list to be used with the electronic communications system. The user may populate a participant list with identifiers of other users of the electronic communications system with which communication may occur through the electronic communications system. The task of manually populating the participant list may be inefficient, especially when a large number of other users are to be added to the participant list. The user also may desire to notify the other users that the user has become a new user of the electronic communications system. Manually doing so also may be burdensome when the number of other users is large.


The user may not be involved in strong relationships with all of the users or may not communicate with all of the users included in the participant list. Furthermore, as users are continually added to the participant list, the participant list may include users with which the user no longer communicates or with which the user otherwise has a relationship with a low strength. The users included in the participant list having high strength relationships with the user may be mixed with users having low strength relationships with the user, which may prevent the user from easily identifying and accessing the users corresponding to high strength relationships, especially when the number of users corresponding to high strength relationships is small relative to the size of the entire participant list.


SUMMARY

In one general aspect, organizing a participant list includes maintaining a participant list of users of an electronic communications system to be used by a first user of the electronic communications system. Communications strengths between the first user and each of the users included in the participant list are determined. The users included in the participant list are organized based on the corresponding communications strengths.


Implementations may include one or more of the following features. For example, communications strength may be determined for users included in a group within the participant list. The users within the group may be organized within the group based on communications strength.


An additional group in the participant list in which the users included in the participant list are organized based on communications strength may be provided. An additional group in the participant list that includes the users included in the participant list with the highest communications strengths may be provided.


Organizing the users based on the corresponding communications strengths may include ordering the users with higher communications strengths before the users with lower communications strengths.


Determining the communications strengths between the first user and each of the users may include determining a degree of separation between the first user and each of the users included in the participant list user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined degrees of separation. Organizing the users based on the determined degrees of separation may include sorting the users in order of increasing number of degrees of separation from the first user.


Determining the communications strengths between the first user and each of the users may include determining whether the users included in the participant list include the first user in contact lists maintained by the users and are included in a contact list maintained by the first user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determinations of whether the users include the first user in contact lists maintained by the users and are included in a contact list maintained by the first user. Organizing the users based on the determinations of whether the users includes the first user in contact lists maintained by the users and are included in a contact list maintained by the first user may include ordering the users that include the first user in contact lists maintained by the users and that are included in a contact list maintained by the first user before the users that do not include the first user in contact lists maintained by the users and that are not included in a contact list maintained by the first user.


Determining the communications strengths between the first user and each of the users may include determining a number of messages sent between the first user and each of the users included in the participant list. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined numbers of messages. Organizing the users based on the determined numbers of messages may include sorting the users in order of decreasing number of messages exchanged with the first user.


Determining the communications strengths between the first user and each of the users may include determining a frequency with which messages between the first user and each of the users included in the participant list are exchanged. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined frequencies. Organizing the users based on the determined frequencies may include organizing the users in order of decreasing frequency with which messages are exchanged with the first user.


Determining the communications strengths between the first user and each of the users may include determining whether each of the users included in the participant list is a direct or indirect addressee of a message from the first user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determinations of whether each of the users is a direct or indirect addressee of a message from the first user. Organizing the users based on the determinations of whether each of the users included in the participant list is a direct or indirect addressee of a message from the first user may include ordering the users that are direct addressees before the users that are indirect addressees.


Determining the communications strengths between the first user and each of the users may include determining whether each of the users included in the participant list is a publisher of contact information subscribed to by the first user and a subscriber to contact information published by the first user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determinations of whether each of the users is a publisher of contact information subscribed to by the first user and a subscriber to contact information published by the first user. Organizing the users based on the determinations of whether each of the users is a publisher of contact information subscribed to by the first user and a subscriber to contact information published by the first user may include ordering the users that are both subscribers to the first user's contact information and publishers of contact information subscribed to by the first user before the users that are not both subscribers to the first user's contact information and publishers of contact information subscribed to by the first user.


Determining the communications strengths between the first user and each of the users may include determining a frequency with which messages are exchanged in a chat room between the first user and each of the users included in the participant list. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined frequencies. Organizing the users based on the determined frequencies may include sorting the users in order of decreasing frequency with which messages are exchanged in the chat room with the first user.


Determining the communications strengths between the first user and each of the users may include determining amounts of time for which the first user and each of the users have exchanged messages. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined amounts of time. Organizing the users based on the determined amounts of time may include sorting the users in order of decreasing amount of time for which messages have been exchanged with the first user.


Determining the communications strengths between the first user and each of the users may include determining amounts of contact information for the first user held by each of the users and amounts of contact information for each of the users held by the first user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined amounts of contact information. Organizing the users based on the determined amounts of contact information may include sorting the users in order of decreasing amount of contact information held for or by the first user.


Determining the communications strengths between the first user and each of the users may include determining whether each of the users both sends messages to the first user and receives messages from the first user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determinations of whether each of the users both sends messages to the first user and receives messages from the first user. Organizing the users based on the determinations of whether each of the users both sends messages to the first user and receives messages from the first user may include sorting the users such that users that both send messages to the first user and receive messages from the first user are ordered before users that do not both send messages to the first user and receive messages from the first user.


Determining the communications strengths between the first user and each of the users may include determining communications strengths between each of the users and a second user. Organizing the users based on the corresponding communications strengths may include organizing the users based on the determined communications strengths. Organizing the users based on the determined amounts may include sorting the users in order of decreasing communications strength.


The users with a communications strength below a minimum allowable communications strength may be removed from the participant list.


The participant list may be a buddy list of an instant messaging system, an address book of an e-mail system, or a social network of the first user. The electronic communications system may be an instant messaging system, a chat system, or an e-mail system.


In another general aspect, a graphical user interface is used to manage a list of users of an electronic communications system with which electronic messages may be exchanged. The graphical user interface includes a participant list display associated with a user of the participant list display that includes users of an electronic communications system. The users are organized in the participant list display based on communications strengths between the user and each of the users.


Implementations may include one or more of the following features. For example, the participant list display may include groups that are associated with one or more of the users included in the participant list display. The one or more users associated with a group included in the participant list display may be organized within the group based on communications strengths between the user and each of the associated users.


The participant list display may include a group associated with the users included in the participant list display within which the associated users are organized based on communications strengths between the user and each of the associated users.


The participant list display may include a group associated with the users included in the participant list display that have high communications strengths with the user. The users associated with the group may be organized based on communications strengths between the user and each of the associated users.


The participant list display may be a display of a buddy list associated with an instant messaging system, or a display of an address book associated with an e-mail system.


These general and specific aspects may be implemented using a system, a method, or a computer program, or any combination of systems, methods, and computer programs.


Other features will be apparent from the description and drawings, and from the claims.





DESCRIPTION OF DRAWINGS


FIG. 1 is a flow chart of a process for passively populating a participant list for a user of an electronic communications system with known contacts of the user.



FIGS. 2A-2C are illustrations of a participant list before (FIG. 2A) and after (FIGS. 2B and 2C) known contacts are automatically added.



FIG. 3 is a flow chart of a process for announcing a new user of an electronic communications system to existing users of the electronic communications system that are known to the new user.



FIGS. 4A and 4B are illustrations of notifications of a new user that are sent to other users.



FIGS. 5A and 5B are illustrations of a participant list before (FIG. 5A) and after (FIG. 5B) new users are automatically added.



FIG. 6 is a flow chart of a process for organizing entries of a participant list.



FIGS. 7A-7C are illustrations of the participant list of FIG. 2A after the entries in the participant list are organized.



FIG. 8 is a block diagram of a communications system.



FIGS. 9 and 10 are expansions of the block diagram of FIG. 8.





Like reference symbols in the various drawings indicate like elements.


DETAILED DESCRIPTION

A participant list of an electronic communications system to be used by a first user may be organized based on the strengths of the relationships between the first user and the users included in the participant list. The users of the participant list may be ordered in the participant list based on strength of relationship. Alternatively or additionally, the users may be organized in a special group within the participant list and may be unchanged elsewhere. A portion of the users (e.g., the users included in the participant list corresponding to the strongest relationships with the first user) may be organized within the special group. Users with weak relationships may be removed from the participant list, because the first user is unlikely to attempt to communicate with those users. Organizing the users included in the participant list based on relationship strength enables the first user to quickly identify and access identifiers of the users included in participant list with which the first user is most likely to communicate.


A first user may exchange electronic messages with a second user, and the relationship between the first and second users with respect to the exchanging of electronic messages may be described by a communications strength between the first and second users. The communications strength between the first and second users is a numerical measure of the strength of the relationship between the first and second users with respect to exchanging electronic messages. Higher communications strengths typically correspond to stronger relationships. Communications strengths may be useful when comparing relationships while passively adding contacts to participant lists, announcing new membership to known contacts, or organizing participant lists. The communications strength between the first and second users also may be called the communications strength of the first user with respect to the second user, the communications strength of the second user with respect to the first user, or more simply the communications strength of the first or second users.


A calculation of the communications strength between the first and second users may consider the number of messages that are exchanged between the first and second users, and a higher number of messages may correspond to a higher communications strength. Similarly, the calculation may consider the frequency with which messages are exchanged between the first and second users, and a higher frequency may correspond to a higher communications strength. In implementations where the first and second users are users of a chat room, the calculation may consider the frequency with which messages are exchanged between the first and second users in the chat room, and a higher frequency of messages exchanged in the chat room may correspond to a higher communications strength.


The time over which messages are exchanged by the first and second users may affect the communications strength between the first and second users. In general, a longer amount of time over which the first and second users exchange messages may correspond to a higher communications strength. For example, the communications strength between the first and second users may be higher when the first and second users exchange a lower number of messages over a longer period of time than when the first and second users exchange a higher number of messages over a shorter period of time. Similarly, the communications strength may be higher when the first and second users exchange messages with a lower frequency for a longer period of time than when the first and second users exchange messages with a higher frequency for a shorter period of time. In general, exchanging messages over a longer period of time may indicate that the first and second users have a stronger, more enduring relationship.


A calculation of the communications strength between the first and second users may consider only messages sent between the first and second users with the electronic communications system, or all types of messages sent between the first and second users. For example, in implementations where the electronic communications system is an instant messaging system, the communications strength between the first and second users may depend on the instant messages sent between the first and second users, or the communications strength may depend on all communications between the first and second users, including, for example, instant messages, e-mail messages, and cellular telephone calls.


Alternatively or in addition to using the exchanging of electronic messages to measure communications strength between users, whether or not a first user and a second user each list each other in respective contact lists, such as address books, buddy lists, e-mail distribution lists, social networks, mobile telephone phone books, lists of members of an organization, and/or white lists, may be considered when calculating the communications strength between the first and second users. Inclusion in respective contact lists may be indicative of a strong relationship between the first and second users. As a result, a high communications strength may be assigned when the first user is listed in a contact list used by the second user and when the second user is listed in a contact list used by the first user. Each contact list may be a contact list that includes a single user's contacts, or a global contact list that includes multiple users' contacts. A lower communications strength may be assigned when only one of the first and second users lists the other user in a contact list used by the first or second user. An even lower communications strength may be assigned when neither the first nor the second user includes the other user in a respective contact list. The type of contact lists that include the first or second users may affect the communications strength. For example, a higher communications strength may be assigned when the first and second users are listed in mobile telephone phone books than when the first and second users are listed in white lists. Such a communications strength may be assigned because adding the first and second users to the mobile telephone phone books may be harder and may require more effort by the first and second users than adding the first and second users to the white lists.


The calculation of the communication strength also may consider the amount and type of contact information that the first and second users have for one another. The communications strength may be directly related to the amount of contact information that the first and second users have for one another. For example, a higher communications strength may be assigned when the first user has both work and home contact information for the second user than when the first user only has work or home contact information for the second user. As another example, a higher communications strength may be assigned when the second user has home contact information for the first user than when the second user has work contact information for the first user. Such a consideration may be particularly important when the second user typically communicates with the first user when the first user is at home.


The calculation of the communications strength also may consider the degree of separation between the first and second users. The degree of separation between the first and second users describes a relationship between the first and second user. A low degree of separation between the first and second users may indicate a close, and consequently strong, relationship. Typically, user contact lists are evaluated to determine the number of degrees (or hops) that are required to link or relate the first and second users. For example, user A may list user B in user A's address book, user B may list user C in user B's address book, and user C may list user D in user C's address book. Here, user D is linked to user A by two degrees of separation (with user B as the first degree and user C as the second degree). User A is related to user C by one degree of separation (user B) and user B is separated from user D by one degree of separation (user C). Users A and B, users B and C, and users C and D are each respectively separated by zero degrees of separation. In general, a smaller degree of separation may correspond to a higher communications strength.


Whether or not the first and second users are direct or indirect addressees of messages sent between the first and second users may be considered when calculating the communications strength between the first and second users. The first and second users being direct addressees of the messages may be indicative of a strong relationship between the first and second users. The first user may be called a direct addressee of a message from the second user when the message is received directly from the second user, and the first user may be called an indirect addressee of the message when the message is received from the second user through one or more other users. In general, the number of other users through which the message is received is inversely proportional to the communications strength between the first and second users.


Alternatively or additionally, in implementations where the messages sent between the first user and the second user are e-mail messages, whether the first and second users are listed in the “To,” “Carbon Copy,” or “Blind Carbon Copy” fields of the e-mail messages may indicate whether the first and second messages are direct or indirect addressees. For example, if the second user is listed in the “To” field of an e-mail message sent by the first user, the second user may be a direct addressee of the message. If the second user is listed in the “Carbon Copy” or “Blind Carbon Copy” fields of the e-mail message, the second user may be an indirect addressee of the message. A higher communications strength may be assigned when the first or second users are direct addressees than when the first or second users are indirect addressees. The number of times that the first and second user are direct or indirect addressees may affect the communications strength, with the communications strength being directly related to the number of times that the first and second user are direct or indirect addressees.


Similarly, whether or not the first and second users are both senders and recipients of messages sent between one another may be considered when calculating the communications strength between the first and second users. The first and second users being both senders and recipients of the messages may be indicative of a strong relationship between the first and second users. A higher communications strength may be assigned when both the first and the second users are both senders and recipients of the messages. A lower communications strength may be assigned when both the first and second users are not both senders and recipients of the messages, which may occur when the first user sends messages to the second user and does not receive messages from the second user in response, or vice versa.


The first and second users may publish personal contact information, and the first and second users may subscribe to the published contact information. More particularly, the first user may subscribe to contact information published by the second user, and the second user may subscribe to contact information published by the first user. When a user subscribes to published contact information, any changes to the published contact information are automatically propagated to the user. Subscribing to each other's contact information may be indicative of a strong relationship between the first and second users. Therefore, a high communications strength may be assigned to the relationship between the first and second users when the first and second users subscribe to each other's contact information. A lower communications strength may be assigned to the relationship when only one of the first and second users subscribes to the other user's published contact information. An even lower communications strength may be assigned when neither of the first and second users subscribes to each other's contact information.


Other characteristics of the first and second user or their communication behavior may be considered when calculating the communications strength between the first and second users. For example, a type of relationship between the first and second user may affect the communications strength between the first and second user. For example, in one implementation, a higher communications strength may be assigned if the first and second users are family members than if the first and second users are business contacts.


One or more of the above characteristics of the relationship may be included in a calculation of the communications strength between the first and second users. For each of the included characteristics, a numerical measure corresponding to the characteristics is identified. The numerical measure of a characteristic may be a raw measurement of the characteristic or some other numerical value representative of the characteristic. The communications strength may be calculated from the numerical measures of the characteristics using, for example, a weighted average or some other function of the numerical measures of the characteristics.


In some implementations, the communications strength between the first and second users may depend on the communications strength between the first user and a third user, or on the communications strength between the second user and the third user. For example, a relationship may not have been established between the first and second users, which may prevent the calculation of the communications strength between the first and second users. The relationship between the third user and the first or second user may be similar to the expected relationship between the first and second users. For example, the first user may be a new employee of a company that already employs the second and third users. The first user may be working with the second user in a similar manner as the third user, so the relationship between the second and third users may model the expected relationship between the first and second users. As a result, the communications strength between the second and third users may represent the expected communications strength between the first and second users. The communications strengths of the third user with the first or second users may be calculated as described above. The communications strength between the second and third users also may be combined with the communications strength between the first and second users that is calculated as described above. In some implementations, the communications strengths between the second user and multiple other users may be combined with the calculated communications strength between the first and second users.


In some implementations, the first user or the second user may use multiple identifiers when communicating over the electronic communications system. For example, the first user may have two identities that are both used to communicate with the second user. A separate communications strength may be calculated for each of the identifiers. The separate communications strength for a particular identifier describes the relationship between the first user and the second user when communicating with the particular identifier. The overall communications strength between the first and second user may be calculated by combining the separate communications strengths for each of the multiple identifiers. For example, a weighted average of the separate communications strengths may be used to combine the separate communications strengths into the overall communications strength between the first and second users.


The communications strength between the first and second users may be calculated in real time as the first and second users communicate. For example, each time a message is sent between the first and second users, a calculation of the communications strength may be performed. Alternatively or additionally, the communications strength may be determined after the messages have been exchanged. For example, logs of the messages sent between the first and second users, such as an e-mail log or an instant message log, may be inspected and processed to determine the communications strength. Other information indicative of the relationship between the first and second users may be processed when calculating the communications strength.


Referring to FIG. 1, a process 100 is used to passively populate a participant list to be used by a user of an electronic communications system with other users of the electronic communications system. The process 100 identifies other users of the electronic communications system that are known to the user and adds identifiers of those known users to the participant list. If all of the known users may not be added to the participant list, a portion of the known users (e.g., the known users that have the highest communications strengths) is added to the participant lists. Identifiers of the known users may be added to the participant list in general, or to specific groups within the participant list. The process 100 may be executed when the user first becomes a user of the electronic communications system, periodically on a recurring basis, or after an indication to execute the process 100 is received from the user.


The process 100 begins by maintaining a participant list to be used by the user of the electronic communications system (105). The participant list is maintained for use by the user such that the user may use the participant list to communicate with the other users included in the participant list. The participant list includes one or more identifiers of other users of the electronic communications system, and the other users typically are the other users with whom the first user commonly communicates. The first user may select an identifier from the participant list to address a message to be sent with the electronic communications system to the corresponding user. The identifiers included in the participant list may be separated into one or more groups that categorize or otherwise organize the other users.


Other people that are known to the user are identified (110). The known people may be identified from a contact list that includes contact information for people with whom the user may communicate. People included in the contact list are inferred to be known by the user. Examples of the contact list include a buddy list of an instant messaging system, an e-mail address book of an e-mail system, an e-mail distribution list, a list of people in the user's social network, a list of people in a phone book of a mobile telephone used by the user, a list of members of an organization that includes the user, and a white list of people from whom communications are allowed. The contact list may be maintained by the user himself, or by another person or a central system on behalf of the user. For example, the user may be an employee of a company, and the contact list may be a list of e-mail addresses of all employees of the company that is maintained by the company. The user may access and use the contact list from the central system, or the user may use a copy of the contact list that is stored on a computer system used by the user. In one implementation, the set of people known to the user is filtered to include only the people known to the user that are not already included in the participant list.


The known people that are existing users of the electronic communications system are identified (115). In one implementation, identifying the known people that are existing users of the electronic communications system may include identifying identifiers of the known people in the electronic communications system. Identifying the identifiers of the known people may implicitly indicate whether each of the known people is a user of the electronic communications system. More particularly, if an identifier for one of the known people in the electronic communications system may not be identified, then it may be assumed that the known person is not an existing user of the electronic communications system. The known person may be sent an invitation to join the electronic communications system using the information in the contact list.


In some implementations, the contact list includes an indication of the identifiers of the known users in the electronic communications system, and identifying the identifiers of the known people may include identifying the identifiers from the contact list. If the contact list does not include an identifier for a known person, then it may be assumed that the known person is not a user of the electronic communications system. In other implementations where the contact list does not include the identifiers, the identifiers may be otherwise determined. For example, contact information in the contact list may be used to identify the identifiers for the known people. For instance, the participant list may be a buddy list of an instant messaging system and the contact list may include e-mail addresses of the known people that are not identifiers of the known people in the instant messaging system. However, the instant messaging system may maintain a mapping of e-mail addresses to identifiers, and the e-mail addresses may be used to identify the corresponding identifiers from the mapping. If the mapping does not include an identifier for an e-mail address of a known person, then it may be assumed that the known person is not a user of the instant messaging system. Other contact information, such as, for example, a phone number, a name, and/or an address, may be used to identify the identifiers for the known people. For example, a system may maintain a mapping of other contact information to identifiers, and the other contact information may be used to identify the corresponding identifiers from the mapping.


Communications strengths are determined for each of the known people for which an identifier in the electronics communications system has been identified (120). The communications strengths may be calculated from one or more characteristics of the relationship between the user and each of the existing users, as described above. Alternatively or additionally, the communications strengths may be indicated by the contact list from which the known people were identified. For example, the contact list may be organized such that the communications strengths of the included people are indicated by the positions of the included people within the contact lists. The existing users may be sorted based on the communications strengths that have been determined (125). Sorting the existing users by corresponding communications strength may help in determining which of the existing users are added to the participant list.


In other exemplary implementations, communications strengths may be determined between the user and the people known to the user, and the known people that are existing users of the communications system then may be identified.


A number of the existing users that may be added to the participant list may be determined (130). The participant list may have a maximum capacity, such that the participant list does not have sufficient space for all of the known people for which identifiers have been identified. In such a case, the number of existing users that may be added to the participant list is the number of remaining spaces in the participant list. Alternatively or additionally, the number of existing users that may be added may depend on the corresponding communications strengths. For example, a particular number of existing users may be determined because adding more existing users to the participant list may result in the addition of existing users with a communications strength that is lower than desired.


The known people corresponding to the highest communications strengths are identified for addition to the participant list (135). For example, a number of the known people with the highest communications strengths equal to the maximum allowable number of additions to the participant list may be identified for addition to the participant list. In implementations where a number of allowable additions is not determined, all of the existing users may be identified for addition to the participant list.


A group within the participant list to which each of the existing users is to be added may be created (140). For example, a special group may be created within the participant list for users that have been passively added to the participant list with the process 100. Alternatively or additionally, a group may be created for users in the participant list that have a certain characteristic. For example, a group may be created within the participant list for co-workers of the user because one or more of the known people to be added are determined to be co-workers of the user, and such a group is not already included in the participant list.


Alternatively or additionally, an existing group in the participant list to which each of the existing users is to be added may be identified (145). The existing group may be identified because one or more of the users of the existing group share a characteristic with each of the existing users to be added to the group, or because one or more of the users of the existing group are otherwise associated with each of the existing users. Alternatively or additionally, the existing group may be identified for each of the existing users because each of the existing users is included in a corresponding group in another contact list, such as the contact list that indicated that the existing users are known to the user.


In order to identify or create groups for the known people that have been identified for addition to the participant list, additional information describing the known people may be accessed. The additional information may identify characteristics of the known people that may be useful in identifying groups to which the known people should be added. In one implementation, profiles of the known people in the electronic communications system are accessed for use in identifying or creating groups to which the known people should be added.


The existing users that have been identified for addition to the participant list are then added to the participant list (150). In implementations where groups within the participant list have been identified for each of the existing users, the existing users are added to those groups. In implementations where groups have not been identified, the existing users are simply added to the list in general or to a default group within the list. For example, the existing users may be added to a general user group within the participant list.


In some implementations, the user of the electronic communications system whose participant list is maintained with the process 100 may use multiple identifiers when communicating over the electronic communications system. For example, the user may have a business identifier that is used with communicating during business hours or with business contacts, and a family identifier that is used when communicating with family members. The multiple identifiers may be linked such that the user may communicate using more than one of the multiple identities at a time. Furthermore, the user may maintain a participant list for each of the multiple identities. The participant list for a particular identifier may include other users with whom the user communicates using the particular identifier. For example, the participant list for the business identifier of the user may include the business contacts of the user, and the participant list for the family identifier may include the family member of the user. The participant lists for each of the multiple identities may be conglomerated into a single participant list that is maintained with the process 100.


When an existing user that is known to the user is added to the single participant list for the user during the process 100, an appropriate participant list within the single participant list for the existing user may be identified. For example, the existing user may be determined to be a business contact of the user, so the existing user may be added to the participant list corresponding to the business identifier of the user. The appropriate participant list for the existing user may be identified in a similar manner to how appropriate groups were identified or created for each of the identified users to be added to the participant list (140, 145).


In some implementations of the process 100, people known to the user that are not existing users of the electronic communications system may be added to the participant list of the user. When a person that is not an existing user of the electronic communications system is added to the participant list of the user, the person may be enabled to use the electronic communications system to communicate with the user. For example, the person may be made a trial user of the electronic communications system when the person is added to the participant list of the user with the process 100. The person then may choose to become a full user of the electronic communications system after being a trial user.


Referring to FIG. 2A, a buddy list interface 200 for a given user displays the screen names of other selected users of an instant messaging system with which the given user regularly communicates. The other selected users form a buddy list for the given user. Communications with one of the other selected users may be initiated through selection of the corresponding screen name for the other user from the buddy list. The other users may have been added to the buddy list by the given user manually using identifiers of the other users in the instant messaging system that are known to the given user at the time of addition. More particularly, the buddy list interface 200 illustrated in FIG. 2A may be presented to the given user before the process 100 of FIG. 1 is executed for the given user.


The buddy list interface 200 includes a text box 205 that contains the buddy list for the given user, who is identified by a screen name “AOLUser,” as indicated in the title bar 203 of the buddy list interface 200. The buddy list in the buddy list interface 200 includes multiple screen names 210a-210e. More particularly, the buddy list includes the screen name “Friend1” 210a, the screen name “Friend2” 210b, the screen name “Mom” 210c, the screen name “Dad” 210d, and the screen name “Sister” 210e.


The screen names within the buddy list shown by buddy list interface 200 are organized into multiple buddy groups 215a-215c. Each screen name within the buddy list is associated with at least one of the buddy groups 215a-215c. The buddy list includes a “Buddies” buddy group 215a, a “Family” buddy group 215b, and an “Offline” buddy group 215c. The screen name 210a appears below the heading for the buddy group 215a because the screen name 210a has been associated with the buddy group 215a and the corresponding user is present, that is, logged into the instant messaging system and available to send and receive instant messages. The heading for each of the buddy groups 215a and 215b indicates the number of buddies in the group currently logged into the instant messaging system, as well as the total number of buddies in the group. For example, two out of the two members of the buddy group 215a are logged into the instant messaging system for which the buddy list interface 200 is displayed. Similarly, the heading for the “Offline” buddy group 215c indicates the number of other users on the buddy list that are not logged into the system (i.e., 0) and the total number of buddies on the buddy list (i.e., 5). Typically, when users log into the instant messaging system, screen names of the users are moved from the “Offline” buddy group 215c to one of the other buddy groups 215a or 215b.


The buddy list interface 200 also includes controls 220 that enable the given user to communicate with the other selected users corresponding to the screen names 210a-210e. For example, the given user may send instant messages, chat invitations, or e-mail messages to the communications identities referenced in the buddy list through use of the controls 220. The controls 220 also enable the user to obtain information describing the other users, as well as to modify the set of other users referenced in the buddy list interface 200.


The buddy list interface 200 also includes controls 225 that enable the given user to access other information not directly related to sending and receiving instant messages. For example, the given user may use the controls to access e-mail messages or other special features of the instant messaging system. The given user also may use the controls 225 to modify preferences for the buddy list interface 200.


Referring also to FIGS. 2B and 2C, the buddy list displayed in the buddy list interface 200 may be augmented with additional screen names after the process 100 of FIG. 1 is executed for the given user to automatically add screen names of other users known by the given user to the buddy list. More particularly, a screen name 210f, “Friend3;” a screen name 210g, “Brother;” and a screen name 210h, “Boss” have been added to the buddy list interfaces 200 illustrated in FIGS. 2B and 2C. The users corresponding to the screen names 210f-210h are existing users of the instant messaging system and are known to the given user. The screen names 210f-210h may be added to general or specific groups within the buddy list interface 200. The screen names 210a-210e remain associated with the same respective buddy groups 215a and 215b as before the process 100 was executed.


In some implementations of the buddy list interface 200, one of the buddy groups 215a and 215b may be designated as a default buddy group to which screen names are added when different groups for the screen names are not specified. For example, in the buddy list interface 200 illustrated in FIG. 2B, the buddy group 215a was designated as the default buddy group, and the screen names 210f-210h were automatically added to the buddy group 215a during the execution of the process 100. The screen names 210f-210h were added to the buddy group 215a because a specific group was not identified for the screen names 210f-210h during the process 100.


Alternatively or additionally, specific groups to which the screen names 210f-210h are to be added may be identified during the process 100. The screen names 210f-210h may be added to one or more groups in the buddy list, and the one or more groups in the buddy list may need to be created before the screen names 210f-210h may be added, as is illustrated in the buddy list interface 200 of FIG. 2C. In FIG. 2C, the screen name 210f has been added to the default buddy group 215a, either because the buddy group 215a was explicitly identified as the group to which the screen name 210f was to be added, or because a group to which the screen name 210f was to be added was not identified.


The screen name 210g “Brother” was added to the buddy group 215b named “Family.” The screen name 210g may be added to the buddy group 215b because the user corresponding to the screen name 210g may share a characteristic or may be otherwise associated with the users corresponding to the other screen names 210c-210e included in the buddy group 215b (i.e., they are family members of the given user). The screen name 210g also may be added to the buddy group 215b because the user corresponding to the screen name 210g may be included in a corresponding group in another contact list, such as the contact list that was used during the process 100 to identify the user as being known to the given user.


The screen name 210h “Boss” has been added to a new buddy group 215d called “Co-Workers.” The user corresponding to screen name 210h is the only member of the new buddy group 215d and is presently logged into the instant messaging system, as indicated in the heading of the buddy group 215d. The buddy group 215d may be created for users corresponding to screen names in the participant list that have a certain characteristic, including the user corresponding to the screen name 210h (i.e. they are co-workers of the given user). As such, the buddy group 215d is created for the user corresponding to the screen name 215h. Other users that are co-workers of the given user may have their screen names added to the buddy group 215d of the participant list later.


The given user may be presented with a notification that screen names are being added automatically to the buddy list displayed in the buddy list interface 200. The given user may be enabled to accept the screen names to be added such that the automatically added screen names become visible in the buddy list interface 200. Alternatively, the given user may dismiss the screen names to be added, in which case, the screen names are not added to the displayed buddy list and are not visible in the buddy list interface 200. The given user also may be enabled to accept some of the screen names to be added and dismiss others of the screen names to be added.


Referring to FIG. 3, a process 300 is used to announce a new user of an electronic communications system to other users of the electronic communications system that are known to the new user. The process 300 identifies other users of the electronic communications system that are known to the user and notifies the known users that the new user has joined the electronic communications system. In one exemplary implementation, only the known users that have high communications strengths with the new user may be sent notifications. The known users are enabled to add an identifier of the new user to participant lists for the electronic communications system used by the known users. In addition, the new user may be enabled to add identifiers of the known users to which notifications were sent to a participant list used by the new user. The process 300 may be executed when the new user first joins the electronic communications system, or at some time thereafter.


The process 300 begins upon receipt of an indication that there is a new user of the electronic communications system (305). Such an indication may be received, for example, when the new user provides the electronic communications system with personal information, such as a name, address, and phone number, or billing information, such as a credit card or bank account number, that indicates that the new user is joining the electronic communications system. When the new user first joins the electronic communications system, the new user chooses or is assigned an identifier that is used to address messages sent to and from the new user within the electronic communications system. In addition, a participant list may be provided to the new user for use with the electronic communications system. The new user may access identifiers of other users of the electronic communications system that have been added to the participant list to address messages to be sent over the electronic communications system to the other users.


People that are known to the new user are identified (310). The known people may be identified from a contact list that includes contact information for people with whom the new user may communicate, as is done in the process 100 of FIG. 1. Identifiers of the known people are identified (315). Identifying the identifiers of the known people may include directly or indirectly identifying the identifiers from the contact information included in the contact list, as is done in the process 100 of FIG. 1. Identifying an identifier for a known person may indicate that the known person is an existing user of the electronic communications system.


Communications strengths may be determined for each of the known people that is an existing user of the electronic communications system (320). The communications strengths may be calculated from one or more characteristics of the relationship between the new user and each of the existing users, as described above. Alternatively or additionally, the communications strengths may be indicated by the contact list from which the known people was identified, as described above. The known users with high communications strengths may be identified (325). More particularly, the known users with communications strengths above a threshold value that is indicative of a high communications strength may be identified.


The identified users of the electronic communications system may be sent a message that notifies the identified users of the identifier of the new user (330). The previously identified identifiers of the identified users may be used to address the notifications to the identified users. The notification may be sent as a type of message typically sent with the electronic communications system. For example, when the electronic communications system is an instant messaging system, the notifications may be sent as instant messages. As another example, the electronic communications system may be an e-mail system, and the notifications are sent as e-mail messages.


The identified users are enabled to add the identifier of the new user to participant lists used by the identified users (335). In some implementations, the notifications may include an indication of the identifier of the new user and a control that automatically adds the identifier of the new user to the participant lists of the identified users. The control may be a button or a link within the notification that may be selected. In other implementations, the identifier may be added to the participant lists when a response to the notifications is received. For example, when the notifications are sent to the identified users as instant messages, the identifier may be added to the participant lists when affirmative responses to the instant messages are received. In other implementations, the identified users may manually add the identifier to the participant lists when the notifications are received.


The new user is enabled to add the identified identifiers to the participant list that is used by the new user (340). The identifiers may be identified and added to the participant list through execution of the process 100 of FIG. 1. In one implementation, the identifiers of the known people that were sent notifications are added to the participant list. In another implementation, identifiers of all known people are added to the participant list. The new user also may be enabled to manually add the identified identifiers to the participant list.


In some implementations, each of the existing users of the electronic communications system that are known to the new user may use multiple identifiers when communicating over the electronic communications system. The multiple identifiers may be linked such that each of the existing users may communicate using more than one of their multiple identities at a time, and a participant list may be maintained for each of the multiple identities. The participant lists for each of the multiple identities used by an existing user may be conglomerated into a single participant list for the existing user. When an existing user that is known to the new user is enabled to add an identifier of the new user to the single participant list for the existing user, a participant list within the single participant list for the existing user that is appropriate for the addition of the new user may be identified.


Referring to FIG. 4A, a message notifying a user of an instant messaging system of an identifier of a new user of the instant messaging system is displayed in an instant messaging interface 400. Instant messages may be sent and received with the instant messaging interface 400. For example, the instant messaging interface 400 may be used to exchange communications with a user whose screen name is displayed on a buddy list interface, such as the buddy list interface 200 of FIG. 2A. After a sender of instant messages is notified that a recipient is present and available to send and receive instant messages, the sender may use the Instant messaging interface 400 to exchange instant messages with the recipient.


The instant messaging interface 400 includes a message history box 405 that lists the instant messages sent between the sender and the recipient. The message history box 405 also may be referred to as a message transcript box 405. Each message is presented with an indication of a screen name by which the sender or the recipient is identified as the sender of the message. Each message listed in the message history box 405 also includes the text of the instant message sent by the sender or the recipient. For example, the message history box 405 includes a message 406 sent by a user with a screen name “SystemMessage” and a message 407 sent by a user with a screen name “ExistingUser.” In one implementation, each message listed in the message history box 405 includes a time stamp of when the message was sent. The users that sent the messages 406 and 407 are the recipient and the sender, respectively.


The instant messaging interface 400 also includes a message specification box 410 in which the sender may specify a message to be sent to the recipient. The sender may enter text to be sent to the recipient in the message specification box 410. The instant message interface 400 includes a set of format controls 415 that may be used to format the text entered in the message specification box 410. More particularly, the controls in the set of format controls 415 enable the user to change the size, foreground color, background color, style, and effects of the text entered in the message specification box 410. The set of format controls 415 also includes controls for inserting objects that are not plain text, such as hyperlinks and emoticons, into the message specification box 410.


After a message has been specified in the message specification box 410, the message may be sent by selecting a send button 425 included in a second control set 420. After the send button 425 has been selected, the text that has been entered in the message specification box 410 is sent to the recipient, and the message specification box 410 is cleared. The message is added to the message history box 405. The message also is displayed in a message history box 405 of an instance of the instant messaging interface 400 being viewed by the recipient. Also included in the second control set 420 are controls for warning instant message senders, blocking instant messages from particular senders, or adding the sender to a participant list used by the sender.


The recipient with the screen name “SystemMessage” may be an instant messaging robot that automatically sends notifications of new users to existing users that are known to the new users, and the sender with the screen name “ExistingUser” may be one of those known existing users. The message 406 is a notification of a screen name of a new user of the instant messaging system that knows the sender. For example, the new user is named “John Smith” and has chosen “JohnSmith1” as a screen name to be used to identify himself in the instant messaging system. The message 407 is an affirmative response to the notification message 406. Upon receiving the affirmative response, the recipient (SystemMessage) automatically adds the screen name of the new user to a buddy list maintained for use by the sender (ExistingUser) such that the sender may select the new user's screen name to address instant messages to the new user.


Referring to FIG. 4B, a notification interface 450 notifies an existing user of an electronic communications system, such as an e-mail system, of an identifier of a new user of the electronic communications system, such as an e-mail address of the new user. The notification interface 450 also enables the existing user to import the identifier into a list of contact information, such as an e-mail address book, that is used by the existing user.


The notification interface 450 includes a message 455 that informs the existing user of the identifier of the new user. For example, the message 455 illustrated in FIG. 4B informs the existing user that the new user is a new user of the e-mail system and that the new user's e-mail address is “JohnSmith@domain.com.”


The notification interface 450 also includes an accept button 460 that enables the existing user to import the e-mail address of the new user into an e-mail address book used by the existing user. When the existing user selects the accept button 460, the e-mail address of the new user is added to the address book of the existing user. The notification interface 450 also includes a reject button 465 that, when selected, dismisses the notification interface 450 without first adding the e-mail address of the new user to the address book of the existing user.


Referring to FIG. 5A, an exemplary address book 500 may be displayed to a user of an e-mail program. The address book 500 includes a list box 505 that includes a list of the user's contacts. Three contacts, Larry Jones, Bob Davis, and Jane Doe, are shown in the list box 505. When a contact in list box 505 is selected, the contact's information is shown in a box 510. The information includes, for example, the contact's name and the contact's e-mail address. FIG. 5A illustrates the address book 500 before a notification of an e-mail address of a new user, such as the notification interface 450 of FIG. 4B, is displayed for the user.


Referring also to FIG. 5B, the address book 500 also may be displayed to the user after such a notification is displayed. For example, the user, upon being presented with the notification interface 450 of FIG. 4B, may select the accept button 460 to import the e-mail address of the new user into the address book 500, and then may access the address book 500. When the address book 500 is subsequently accessed, the new user appears in the list box 505 as an additional contact 515 named John Smith, as was indicated in the notification interface 450. Selection of the contact 515 displays contact information for the contact 515 in the box 510. For example, the e-mail address 520, “JohnSmith@domain.com,” which was indicated on the notification interface 450, is associated with the contact 515 that was added to the address book 500 as a result of the selection of the accept button 460. The contact 515 may be selected from the address book 500 to address messages to the new user. In addition, the new user may have added the user of the address book 500 to an address book used by the new user such that the new user may select the user from the address book to address e-mail messages to the user.


Referring to FIG. 6, a process 600 is used to organize a participant list of users of an electronic communications system that is used by a user of the electronic communications system. The users included in the participant list are organized based on communications strengths of the users with the user that uses the participant list. The users may be organized in place in the participant list, or in a special group within the participant list. The special group may only include the users that correspond to the highest communications strengths. In addition, the users that correspond to the lowest communications strengths may be removed from the participant list, because communication with those users is unlikely. The process 600 may be executed when the user first becomes a user of the electronic communications system, periodically on a recurring basis, or after an indication to execute the process 600 is received from the user.


Initially, the participant list used by the user is maintained (605). The user may use the participant list to communicate with the other users included in the participant list. The participant list includes one or more identifiers of the other users, and the user may select an identifier from the participant list to address a message to be sent to the corresponding user with the electronic communications system. The identifiers included in the participant list may be separated into one or more groups that categorize or otherwise organize the other users. The location of the identifier within the participant list may affect how quickly and easily the user may find and select the identifier and send the message.


Communications strengths are determined for each of the users included in the participant list (610). The communications strengths may be calculated from one or more characteristics of the relationship between the new user and each of the known users, as described above.


An additional group within the participant list may be provided (615). Copies of the identifiers of some or all of the users included in the participant list may be organized within the additional group. In one implementation, the additional group is added to the end of the participant list below other existing groups within the participant list. Organizing copies of the identifiers within the additional group does not disrupt the organization of other copies of the identifiers included in other existing groups of the participant list. Therefore, the user may access the unorganized identifiers, with which the user may be more familiar, or the organized identifiers in the additional group when accessing identifiers to address messages to the corresponding users of the electronic communications system.


The users included in the participant list may be organized based on communications strength in the additional group (620). In one implementation, second copies of identifiers of users with higher communications strengths are placed above identifiers of users with lower communications strengths in the additional group. All users included in the participant list are organized within the additional group, so the participant list includes two copies of an identifier of each of the users included in the participant list. Copies of the identifiers in the other existing groups are not organized by communications strength.


Alternatively, only some of the users included in the participant list may be organized based on communications strength in the additional group. For example, the users with the highest communications strengths may be organized in the additional group (625). Identifiers of users with higher communications strengths may be placed above identifiers of users with lower communications strengths in the additional group. In one implementation, identifiers of a particular number of the users with the highest communications strengths are organized within the participant list. In another implementation, identifiers of the users with communications strengths above a threshold value are organized within the additional group. Only some of the users of the participant list are organized within the additional group, so the participant list includes two copies of an identifier of some of the users included in the participant list. Copies of the identifiers in the other existing groups remain unorganized.


When the additional group is not provided within the participant list, the users included in the participant list are organized in place based on corresponding communications strengths (630). Doing so may change the order in which the identifiers of the included users appear in the participant list. Identifiers of users with higher communications strengths may be placed above identifiers of users with lower communications strengths within each group of the participant list. In such implementations, the participant list includes a single copy of each different identifier, and no identifiers are moved or copied between groups.


Identifiers of the users included in the participant list corresponding to the lowest communications strengths may be removed from the participant list (635). For example, identifiers of the users corresponding to communications strengths that are below a threshold value may be removed from the participant list. A low communications strength for a particular user is indicative of a weak relationship between the particular user and the user. As such, the user most likely does not communicate with the particular user very often, and the user most likely does not access an identifier of the particular user included in the participant list to address a message to the particular user very often. Therefore, the identifier of the particular user, and other users included in the participant list corresponding to the lowest communications strengths, may be removed from the participant list. As an alternative to removal, these users may be moved to a special group designated as being for users with lower communications strengths.


In some implementations, the user of the electronic communications system whose participant list is maintained with the process 600 may use multiple identifiers when communicating over the electronic communications system. The multiple identifiers may be linked such that the user may communicate using more than one of the multiple identities at a time. Furthermore, the user may maintain a participant list for each of the multiple identities, and the participant list for a particular identifier may include other users with whom the user communicates using the particular identifier. The participant lists for each of the multiple identities may be conglomerated into a single participant list that is maintained with the process 600.


When organizing the participant list of the user with the process 600, the multiple participant lists corresponding to the user may be organized individually. In addition, an additional participant list may be added to the single participant list for the user. The additional participant list may include one or more users from one or more of the multiple participant lists for the user in an organized manner, in a manner similar to how users of the participant list were organized within an additional group within the participant list (620, 625).


Referring to FIGS. 7A-7C, a buddy list interface 200 for a given user displays in an organized manner the screen names of other selected users of an instant messaging system with which the given user regularly exchanges instant messages. More particularly, the buddy list interfaces 200 illustrated in FIGS. 7A-7C display organized listings of the screen names displayed in the buddy list interface 200 of FIG. 2A. The buddy list interfaces 200 illustrated in FIGS. 7A-7C are presented to the given user after various implementations of the process 600 of FIG. 6 are executed for the given user.


The buddy list interface 200 in FIG. 7A is presented to the given user after the execution of an implementation of the process 600 in which the displayed screen names are organized in place within the buddy groups with which the displayed screen names are associated. The displayed screen names are organized within the buddy list based on communications strength between the corresponding other users and the given user, with screen names corresponding to higher communications strengths appearing within the buddy groups above screen names corresponding to lower communications strengths. In addition, screen names corresponding to exceedingly low communications strengths may be removed from the buddy list.


For example, in the buddy list interface 200 from FIG. 2A, the screen name 210a is listed above the screen name 210b in the buddy group 215a. However, in the buddy list interface 200 of FIG. 7A, the screen name 210b is listed above the screen name 210a in the buddy group 215a because the user corresponding to the screen name 215b has a higher communications strength with the given user than the user corresponding to the screen name 210a. The screen names 210a and 210b are still associated with the buddy group 215a.


Similarly, the screen names 215c, 215d, and 215e are presented within the buddy group 215b in that order in the buddy list 200 of FIG. 2B. However, in the buddy list interface 200 of FIG. 7A, the screen name 210e is listed above the screen name 210c in the buddy group 215b, and the screen name 210d is no longer associated with the buddy group 215b. Such a display of the screen names 210c-210e indicates that the user corresponding to the screen name 210e has the highest communications strength with the given user among the users corresponding to the screen names 210c-210e. The user corresponding to the screen name 210d has a communications strength with the given user that warrants removing the screen name from the buddy list, and the user corresponding to the screen name 210c has a communications strength between the communications strengths corresponding to the screen names 210d and 210e.


Organizing the screen names 210a-210e within the groups with which the screen names 210a-210e are associated indicates the relative communications strengths of the users corresponding to a particular group. However, the relative communications strengths of users whose screen names are associated with different buddy groups are not easily seen with such an organization. Organizing the screen names 210a-210e without reference to a particular buddy group indicates the relative communications strengths of users whose screen names are associated with different buddy groups.


The buddy list interfaces 200 in FIGS. 7B and 7C are presented to the given user after the execution of implementations of the process 600 in which the displayed screen names are organized within a special group in the buddy list based on communications strength. More particularly, all of the screen names displayed in the buddy list interface 200 of FIG. 2A are organized within the special group displayed in the buddy list interface 200 of FIG. 7B, and the screen names corresponding to the highest communications strengths are organized within the special group displayed in the buddy list interface 200 of FIG. 7C. Screen names corresponding to higher communications strengths are displayed within the special group above screen names corresponding to lower communications strengths.


The buddy list interfaces 200 of FIGS. 7B and 7C include a special buddy group 215e, “Organized,” that includes some or all of the screen names 210a-210e. The header of the special buddy group 215e indicates that all of the users associated with the special buddy group 215e are present and available to exchange instant messages. In FIG. 7B, the screen name 210e is the first screen name listed in the special group 215e, the screen name 210b is the second, the screen name 210c is the third, the screen name 210a is the fourth, and the screen name 210d is the fifth. In FIG. 7C, only the screen names 210e, 210b, and 210c, are listed within the special group 215e in the same order as in FIG. 7B. The order of appearance of the screen names 210a-210e within the special buddy group 215e is indicative of the relative communications strengths of the users corresponding to the screen names 210a-210e. The screen names 210a-210e remain associated with the buddy groups 215a-215c such that some or all of the screen names 210a-210e are displayed in the buddy list interface 200 twice.


The special buddy group 215e may be placed above, below, or among the other existing buddy groups 215a-215c to facilitate viewing and selecting the organized screen names 210a-210e. In some implementations, the screen names 210a-210e may be selectable from the buddy list interfaces 200 of FIGS. 7A-7C to reveal the communications strengths of the users corresponding to the screen names 210a-210e. For example, selecting one of the screen names 210a-210e may cause a tool tip or some other pop-up window to be displayed with an indication of the communications strength of the user corresponding to the selected screen name. The indication of the communications strength may be a numerical value for the communications strength or a more qualitative description of the communications strength.


The described techniques for augmenting and organizing participant lists of identifiers used in sending and receiving electronic messages may be applied to any type of participant list associated with any type of electronic communications system. For example, a buddy list used with an instant messaging system, an e-mail address book used with an e-mail system, a list of users of a social network used with a social networking system, or any other list of contact information that includes information that may be used to contact other people, may be automatically augmented with contact information of known people. The same contact lists may be organized to facilitate accessing and selecting contact information that may be used to contact other people.



FIGS. 8-10 illustrate exemplary block diagrams of an electronic communications system that may be used as part of the implementation of the features described above.


For illustrative purposes, FIGS. 8-10 show an example of a communications system for implementing techniques for transferring electronic data, including instant messages and e-mail. For brevity, several elements in the figures described below are represented as monolithic entities. However, as would be understood by one skilled in the art, these elements each may include numerous interconnected computers and components designed to perform a set of specified operations and/or may be dedicated to a particular geographical region.


Referring to FIG. 8, a communications system 800 is capable of delivering and exchanging data between a user system 805 and a provider system 810 through a communications link 815. The user system 805 typically includes one or more user devices 820 and/or user controllers 825, and the provider system 810 typically includes one or more provider devices 835 and/or provider controllers 840. For example, the user system 805 or the provider system 810 may include one or more general-purpose computers (e.g., personal computers), one or more special-purpose computers (e.g., devices specifically programmed to communicate with each other and/or the user system 805 or the provider system 810), or a combination of one or more general-purpose computers and one or more special-purpose computers. The user system 805 and the provider system 810 may be arranged to operate within or in concert with one or more other systems, such as, for example, one or more LANs (“Local Area Networks”) and/or one or more WANs (“Wide Area Networks”).


The user device 820 (or the provider device 835) is generally capable of executing instructions under the command of a user controller 825 (or a provider controller 840). The user device 820 (or the provider device 835) is connected to the user controller 825 (or the provider controller 840) by a wired or wireless data pathway 830 or 845 capable of delivering data.


Each of the user device 820, the user controller 825, the provider device 835, and the provider controller 840 typically includes one or more hardware components and/or software components. An example of a user device 820 or a provider device 835 is a general-purpose computer (e.g., a personal computer) capable of responding to and executing instructions in a defined manner. Other examples include a special-purpose computer, a workstation, a server, a device, a component, other physical or virtual equipment or some combination thereof capable of responding to and executing instructions. The user device 820 and the provider device 835 may include devices that are capable of peer-to-peer communications.


An example of a user controller 825 or a provider controller 840 is a software application loaded on the user device 820 or the provider device 835 for commanding and directing communications enabled by the user device 820 or the provider device 835. Other examples include a program, a piece of code, an instruction, a device, a computer, a computer system, or a combination thereof, for independently or collectively instructing the user device 820 or the provider device 835 to interact and operate as described. The user controller 825 and the provider controller 840 may be embodied permanently or temporarily in any type of machine, component, physical or virtual equipment, storage medium, or propagated signal capable of providing instructions to the user device 820 or the provider device 835.


The communications link 815 typically includes a delivery network 860 making a direct or indirect communication between the user system 805 and the provider system 810, irrespective of physical separation. Examples of a delivery network 860 include the Internet, the World Wide Web, WANs, LANs, analog or digital wired and wireless telephone networks (e.g. PSTN, ISDN, and xDSL), radio, television, cable, satellite, and/or any other delivery mechanism for carrying data. The communications link 815 may include communication pathways 850 and 855 that enable communications through the one or more delivery networks 860 described above. Each of the communication pathways 850 and 855 may include, for example, a wired, wireless, cable or satellite communication pathway.



FIG. 9 illustrates a communications system 900 including a user system 905 communicating with a provider system 910 through a communications link 915. User system 905 typically includes one or more user devices 920 and one or more user controllers 925 for controlling the user devices 920. Provider system 910 typically includes one or more provider devices 935 and one or more provider controllers 940 for controlling the provider devices 935. The communications link 915 may include communication pathways 950 and 955 that enable communications through the one or more delivery networks 960.


Examples of each element within the communications system of FIG. 9 are broadly described above with respect to FIG. 8. In particular, the provider system 910 and communications link 915 typically have attributes comparable to those described with respect to the provider system 810 and the communications link 815 of FIG. 8. Likewise, the user system 905 of FIG. 9 typically has attributes comparable to and illustrates one possible implementation of the user system 805 of FIG. 8.


The user device 920 typically includes a general-purpose computer 970 having an internal or external storage 972 for storing data and programs such as an operating system 974 (e.g., DOS, Windows™, Windows 95™, Windows 98™, Windows 2000™, Windows Me™, Windows XP™, Windows NT™, OS/9, or Linux) and one or more application programs. Examples of application programs include authoring applications 976 (e.g., word processing programs, database programs, spreadsheet programs, or graphics programs) capable of generating documents or other electronic content; user applications 978 (e.g., AOL user, CompuServe user, AIM user, AOL TV user, or ISP user) capable of communicating with other computer users, accessing various computer resources, and viewing, creating, or otherwise manipulating electronic content; and browser applications 980 (e.g., Netscape's Navigator or Microsoft's Internet Explorer) capable of rendering standard Internet content and also capable of supporting a web-based e-mail user and a web-based instant messaging user.


The general-purpose computer 970 also includes a central processing unit 982 (CPU) for executing instructions in response to commands from the user controller 925. In one implementation, the user controller 925 includes one or more of the application programs installed on the internal or external storage 972 of the general-purpose computer 970. In another implementation, the user controller 925 includes application programs externally stored in and performed by one or more device(s) external to the general-purpose computer 970.


The general-purpose computer typically will include a communication device 984 for sending and receiving data. One example of the communication device 984 is a modem.


Other examples include a transceiver, a set-top box, a communication card, a satellite dish, an antenna, or another network adapter capable of transmitting and receiving data over the communications link 915 through a wired or wireless data pathway 950. The general-purpose computer 970 also may include a TV tuner 986 for receiving television programming in the form of broadcast, satellite, and/or cable TV signals. As a result, the user device 920 can selectively and/or simultaneously display network content received by communications device 984 and television programming content received by the TV tuner 986.


The general-purpose computer 970 typically will include an input/output interface 988 for wired or wireless connection to various peripheral devices 990. Examples of peripheral devices 990 include, but are not limited to, a mouse 991, a mobile phone 992, a personal digital assistant 993 (PDA), an MP3 player (not shown), a keyboard 994, a display monitor 995 with or without a touch screen input, a TV remote control 996 for receiving information from and rendering information to subscribers, and an audiovisual input device 998.


Although FIG. 9 illustrates devices such as a mobile telephone 992, a PDA 993, and a TV remote control 996 as being peripheral with respect to the general-purpose computer 970, in another implementation, such devices may themselves include the functionality of the general-purpose computer 970 and operate as the user device 920. For example, the mobile phone 992 or the PDA 993 may include computing and networking capabilities and function as a user device 920 by accessing the delivery network 960 and communicating with the provider system 910. Furthermore, the user system 905 may include one, some or all of the components and devices described above.


Referring to FIG. 10, a communications system 1000 is capable of delivering and exchanging information between a user system 1005 and a provider system 1010 through a communication link 1015. User system 1005 typically includes one or more user devices 1020 and one or more user controllers 1025 for controlling the user devices 1020. Provider system 1010 typically includes one or more provider devices 1035 and one or more provider controllers 1040 for controlling the provider devices 1035. The communications link 1015 may include communication pathways 1050 and 1055 that enable communications through the one or more delivery networks 1060.


Examples of each element within the communications system of FIG. 10 are broadly described above with respect to FIGS. 8 and 9. In particular, the user system 1005 and the communications link 1015 typically have attributes comparable to those described with respect to user systems 805 and 905 and communications links 815 and 915 of FIGS. 8 and 9. Likewise, the provider system 1010 of FIG. 10 may have attributes comparable to and illustrates one possible implementation of the provider systems 810 and 910 shown in FIGS. 8 and 9.


The provider system 1010 includes a provider device 1035 and a provider controller 1040. The provider controller 1040 is generally capable of transmitting instructions to any or all of the elements of the provider device 1035. For example, in one implementation, the provider controller 1040 includes one or more software applications loaded on the provider device 1035. In other implementations, as described above, the provider controller 1040 may include any of several other programs, machines, and devices operating independently or collectively to control the provider device.


The provider device 1035 includes a login server 1070 for enabling access by subscribers and for routing communications between the user system 1005 and other elements of the provider device 1035. The provider device 1035 also includes various provider complexes such as the depicted OSP (“Online Service Provider”) provider complex 1080 and IM (“Instant Messaging”) provider complex 1090. To enable access to these provider complexes by subscribers, the user system 1005 includes communication software, for example, an OSP user application and an IM user application. The OSP and IM communication software applications are designed to facilitate the subscriber's interactions with the respective services and, in particular, may provide access to all the services available within the respective provider complexes.


Typically, the OSP provider complex 1080 supports different services, such as e-mail, discussion groups, chat, news services, and Internet access. The OSP provider complex 1080 is generally designed with an architecture that enables the machines within the OSP provider complex 1080 to communicate with each other and employs certain protocols (i.e., standards, formats, conventions, rules, and structures) to transfer data. The OSP provider complex 1080 ordinarily employs one or more OSP protocols and custom dialing engines to enable access by selected user applications. The OSP provider complex 1080 may define one or more specific protocols for each service based on a common, underlying proprietary protocol.


The IM provider complex 1090 is generally independent of the OSP provider complex 1080, and supports instant messaging services irrespective of a subscriber's network or Internet access. Thus, the IM provider complex 1090 allows subscribers to send and receive instant messages, whether or not they have access to any particular ISP. The IM provider complex 1090 may support associated services, such as administrative matters, advertising, directory services, chat, and interest groups related to instant messaging. The IM provider complex 1090 has an architecture that enables all of the machines within the IM provider complex to communicate with each other. To transfer data, the IM provider complex 1090 employs one or more standard or exclusive IM protocols.


The provider device 1035 may include one or more gateways that connect and therefore link complexes, such as the OSP provider complex gateway 1085 and the IM provider complex gateway 1095. The OSP provider complex gateway 1085 and the IM provider complex gateway 1095 may directly or indirectly link the OSP provider complex 1080 with the IM provider complex 1090 through a wired or wireless pathway. Ordinarily, when used to facilitate a link between complexes, the OSP provider complex gateway 1085 and the IM provider complex gateway 1095 are privy to information regarding the protocol type anticipated by a destination complex, which enables any necessary protocol conversion to be performed incident to the transfer of data from one complex to another. For instance, the OSP provider complex 1080 and IM provider complex 1090 generally use different protocols such that transferring data between the complexes requires protocol conversion by or at the request of the OSP provider complex gateway 1085 and/or the IM provider complex gateway 1095.


The described techniques result in the population and organization of participant lists for electronic communications systems. Presence and location of a user in a participant list is indicative of the communications strength of the user with another user that uses the participant list. As a result, participant lists populated and organized with the described techniques may inform the population and organization of other participant lists. For example, when a buddy list of an instant messaging system is organized with the process 600 of FIG. 6, the organization of contacts within the buddy list may be used to organize the same contacts in an address book for an e-mail system. The e-mail system may receive the participant list from the instant messaging system as a result of subscribing to participant lists published by the instant messaging system. Furthermore, applications and systems related or unrelated to a participant list that has been populated or organized with the described techniques may use the participant list. For example, an application may need to communicate with a person well known to a user whose participant list was populated with the process 100 of FIG. 1. The application may identify such a person from the participant list because people with high communications strengths with the user have been added to the user's participant list.


In another example, when a buddy list of an instant messaging system is populated using the process 100 of FIG. 1 and/or organized using the process 600 of FIG. 6, the populated and/or organized buddy list may be accessed by and/or exported to other instant messaging systems or other systems that provide a user interface for an instant messaging system. Thus, a buddy list that is populated and/or organized in one instant messaging system may be accessed, used, and/or exported for use by a different instant messaging system.


The described techniques may be applied when a user first becomes a user of an electronic communications system, at which point the user receives a new personal identifier and a corresponding participant list for use with the electronic communications system. The described techniques also may be applied when the user changes their identifier, or when the user chooses an additional identifier. For example, people known to the user may be notified of the changed or additional identifier such that those people may add the changed or additional identifier to their personal participant lists. People known to the user may be added to participant lists corresponding to the changed or additional identifier, and the participant lists corresponding to the changed or additional identifier may be organized. Population and organization of the participant lists for the changed or additional identifier may occur separately for each of those participant lists, or together for all of the participant lists corresponding to the user, as described above.


A participant list of a user of an electronic communications system may be dynamically maintained by calculating communications strengths between the user and people known to the user multiple times on a periodic or aperiodic basis. As messages are sent and received by the user, and as the relationships between the users and the known people change, the communications strengths between the user and the known people may change, and the communications strengths may be calculated multiple times to account for that change. For example, the communications strength between the user and one of the known people may be calculated each time a message is sent to or from that known person. The population and organization of the participant list of the user may be updated according to the process 100 of FIG. 1 and the process 600 of FIG. 6, based on the latest calculations of the communications strengths that have been received. In addition, people known to the user may be enabled to add an identifier of the user to a personal participant list according to the process 300 of FIG. 3, based on the latest calculations of the communications strengths that have been received.


The described systems, methods, and techniques may be implemented in digital electronic circuitry, computer hardware, firmware, software, or in combinations of these elements. Apparatus embodying these techniques may include appropriate input and output devices, a computer processor, and a computer program product tangibly embodied in a machine-readable storage device for execution by a programmable processor. A process embodying these techniques may be performed by a programmable processor executing a program of instructions to perform desired functions by operating on input data and generating appropriate output. The techniques may be implemented in one or more computer programs that are executable on a programmable system including at least one programmable processor coupled to receive data and instructions from, and to transmit data and instructions to, a data storage system, at least one input device, and at least one output device. Each computer program may be implemented in a high-level procedural or object-oriented programming language, or in assembly or machine language if desired; and in any case, the language may be a compiled or interpreted language. Suitable processors include, by way of example, both general and special purpose microprocessors. Generally, a processor will receive instructions and data from a read-only memory and/or a random access memory. Storage devices suitable for tangibly embodying computer program instructions and data include all forms of non-volatile memory, including by way of example semiconductor memory devices, such as Erasable Programmable Read-Only Memory (EPROM), Electrically Erasable Programmable Read-Only Memory (EEPROM), and flash memory devices; magnetic disks such as internal hard disks and removable disks; magneto-optical disks; and Compact Disc Read-Only Memory (CD-ROM). Any of the foregoing may be supplemented by, or incorporated in, specially-designed ASICs (application-specific integrated circuits).


It will be understood that various modifications may be made without departing from the spirit and scope of the claims. For example, advantageous results still could be achieved if steps of the disclosed techniques were performed in a different order and/or if components in the disclosed systems were combined in a different manner and/or replaced or supplemented by other components. Accordingly, other implementations are within the scope of the following claims.

Claims
  • 1. A method comprising: providing, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determining a number of a first type of electronic messages exchanged between a user and a first co-user of the communications system;determining a number of a second type of electronic messages exchanged between the user and the first co-user;determining a frequency of electronic messages exchanged between the user and the first co-user;calculating, using at least one processor, a communications strength between the user and the first co-user using: the number of the first type of electronic messages exchanged between the user and the first co-user,the number of the second type of electronic messages exchanged between the user and the first co-user, andthe frequency of electronic messages exchanged between the user and the first co-user;determining the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, updating the list of co-users within the graphical user interface by automatically adding a first identifier corresponding to the first co-user to the list of co-users and automatically removing a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generating an electronic message to send to the first co-user.
  • 2. The method of claim 1, further comprising: determining a time period associated with messages exchanged between the user and the first co-user; andusing the time period in calculating the communications strength between the user and the first co-user.
  • 3. The method of claim 1, further comprising automatically organizing the list of co-users based at least in part on the calculated communications strength between the user and the first co-user.
  • 4. The method of claim 3, wherein organizing the list of co-users comprises determining a location within the list of co-users to add the first co-user based on the communications strength between the user and the first co-user.
  • 5. The method of claim 3, further comprising: calculating a communications strength between the user and one or more additional users;ranking the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically listing the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 6. The method of claim 3, further comprising: determining whether the first co-user is logged on to, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically adding the first co-user to the list of co-users in a higher prioritized location of the list of co-users.
  • 7. The method of claim 6, further comprising, if the first co-user is logged off of the communications system, automatically removing the first co-user from the list of co-users.
  • 8. A method comprising: providing, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determining a number of a first type of electronic messages exchanged between a user and a first co-user of the communications system;determining a number of a second type of electronic messages exchanged between the user and the first co-user;determining a frequency of electronic messages exchanged between the user and the first co-user;calculating, using at least one processor, a communications strength between the user and the first co-user using: the number of the first type of electronic messages exchanged between the user and the first co-user,the number of the second type of electronic messages exchanged between the user and the first co-user, andthe frequency of electronic messages exchanged between the user and the first co-user;determining the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, updating the list of co-users within the graphical user interface by automatically ordering a first identifier corresponding to the first co-user higher in the list of co-users than a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generating an electronic message to send to the first co-user.
  • 9. The method of claim 8, further comprising: determining a time period associated with messages exchanged between the user and the first co-user; andusing the time period in calculating the communications strength between the user and the first co-user.
  • 10. The method of claim 8, further comprising: determining a time period associated with messages exchanged between the user and the second co-user; andusing the time period in calculating the communications strength between the user and the second co-user.
  • 11. The method of claim 8, further comprising automatically organizing the list of co-users based at least in part on the calculated communications strength between the user and the first co-user.
  • 12. The method of claim 11, further comprising determining a communications strength between the user and the second co-user based on determining a number of the first type of electronic messages exchanged between the user and the second co-user, determining a number of the second type of electronic messages exchanged between the user and the second co-user, and determining a frequency of electronic messages exchanged between the user and the second co-user.
  • 13. The method of claim 11, further comprising: calculating a communications strength between the user and one or more additional users;ranking the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically listing the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 14. The method of claim 11, further comprising: determining whether the first co-user is logged on to, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically adding the first co-user to the list of co-users in a higher prioritized location of the list of co-users.
  • 15. The method of claim 14, further comprising, if the first co-user is logged off of the communications system, automatically removing the first co-user from the list of co-users.
  • 16. A system comprising: at least one processor; anda non-transitory computer readable medium comprising instructions that, when executed by the at least one processor, cause the system to: provide, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determine whether a user of a communications system is in a first contact list associated with a first co-user of the communications system;determine whether the user of the communications system is in a second contact list associated with the first co-user of the communications system;determine a frequency of electronic messages exchanged between the user and the first co-user;calculate, using at least one processor, a communications strength between the user and the first co-user based on: whether the user is in the first contact list,whether the user is in the second contact list, andthe frequency of electronic messages exchanged between the user and the first co-user;determine the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, update the list of co-users within the graphical user interface by automatically adding a first identifier corresponding to the first co-user to the list of co-users and automatically removing a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generate an electronic message to send to the first co-user.
  • 17. The system of claim 16, further comprising instructions that, when executed by the at least one processor, cause the system to: determine a time period associated with messages exchanged between the user and the first co-user; anduse the time period in calculating the communications strength between the user and the first co-user.
  • 18. The system of claim 16, further comprising instructions that, when executed by the at least one processor, cause the system to: determine a number of electronic messages exchanged between the user and the first co-user of the communications system; anduse the number of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 19. The system of claim 16, further comprising instructions that, when executed by the at least one processor, cause the system to automatically organize the of co-users based on the calculated communications strength between the user and the first co-user.
  • 20. The system of claim 19, wherein organizing the list of co-users comprises determining a location within the list of co-users to add the first co-user to the list of co-users based on the communications strength between the user and the first co-user.
  • 21. The system of claim 19, further comprising instructions that, when executed by the at least one processor, cause the system to: calculate a communications strength between the user and one or more additional users;rank the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically list the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 22. The system of claim 19, further comprising instructions that, when executed by the at least one processor, cause the system to: determine whether the first co-user is logged onto, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically add the first co-user to the list of co-users in a higher prioritized location of the list of co-users.
  • 23. The system of claim 22, further comprising instructions that, when executed by the at least one processor, cause the system to, if the first co-user is logged off of the communications system, automatically remove the first co-user from the list of co-users.
  • 24. A system comprising: at least one processor; anda non-transitory computer readable medium comprising instructions that, when executed by the at least one processor, cause the system to: provide, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determine a frequency of electronic messages sent from a user of a communications system to a first co-user from among the list of co-users;determine a frequency of electronic messages sent from the first co-user of a communications system to the user of the communications system;determine a degree of separation between the user of the communications system and the first co-user of the communications system;calculate, using at least one processor, a communications strength between the user and the first co-user using: the frequency of electronic messages sent from the user to the first co-user,the frequency of electronic messages sent from the first co-user to the user, anda degree of separation between the user of the communications system and the first co-user of the communications system;determine the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, update the list of co-users within the graphical user interface by automatically adding a first identifier corresponding to the first co-user to the list of co-users and automatically removing a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generate an electronic message to send to the first co-user.
  • 25. The system of claim 24, further comprising instructions that, when executed by the at least one processor, cause the system to: determine a time period associated with messages exchanged between the user and the first co-user; anduse the time period in calculating the communications strength between the user and the first co-user.
  • 26. The system of claim 24, further comprising instructions that, when executed by the at least one processor, cause the system to: determine a number of electronic messages exchanged between the user and the first co-user of the communications system; anduse the number of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 27. The system of claim 24, further comprising instructions that, when executed by the at least one processor, cause the system to: determine a frequency of electronic messages exchanged between the user and the first co-user; anduse the frequency of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 28. The system of claim 24, further comprising instructions that, when executed by the at least one processor, cause the system to automatically organize the list of co-users based on the calculated communications strength between the user and the first co-user.
  • 29. The system of claim 28, further comprising instructions that, when executed by the at least one processor, cause the system to determine a communications strength between the user and the second co-user based on determining a number of a first type of electronic messages exchanged between the user and the second co-user, determining a number of a second type of electronic messages exchanged between the user and the second co-user, and determining a frequency of electronic messages exchanged between the user and the second co-user.
  • 30. The system of claim 28, further comprising instructions that, when executed by the at least one processor, cause the system to: calculate a communications strength between the user and one or more additional users;rank the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically list the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 31. The system of claim 28, further comprising instructions that, when executed by the at least one processor, cause the system to: determine whether the first co-user is logged onto, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically add the first co-user to the list of co-users.
  • 32. The system of claim 31, further comprising instructions that, when executed by the at least one processor, cause the system to, if the first co-user is logged off of the communications system, automatically remove the first co-user from the list of co-users.
  • 33. A non-transitory computer readable medium comprising instructions that, when executed by at least one processor, cause a computer device to: provide, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determine a degree of separation between a user of a communications system and a first co-user of the communication system;determine a communications strength between a second co-user and the user;determine a communications strength between the second co-user and the first co-user;calculate, using at least one processor, a communications strength between the user and the first co-user using; the degree of separation between the user and the first co-user,the communications strength between the second co-user and the user, andthe communications strength between the second co-user and the first co-user;determine the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, update the list of co-users within the graphical user interface by automatically adding a first identifier corresponding to the first co-user to the list of co-users and automatically removing a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generate an electronic message to send to the first co-user.
  • 34. The non-transitory computer readable medium of claim 33, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a time period associated with messages exchanged between the user and the first co-user; anduse the time period in calculating the communications strength between the user and the first co-user.
  • 35. The non-transitory computer readable medium of claim 33, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a number of electronic messages exchanged between the user and the first co-user of the communications system; anduse the number of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 36. The non-transitory computer readable medium of claim 33, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a frequency of electronic messages exchanged between the user and the first co-user; anduse the frequency of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 37. The non-transitory computer readable medium of claim 33, further comprising instructions that, when executed by the at least one processor, cause the computer device to automatically organize the list of co-users based on the calculated communications strength between the user and the first co-user.
  • 38. The non-transitory computer readable medium of claim 37, wherein organizing the list of co-users comprises determining a location within the list of co-users to automatically add the first co-user based on the communications strength between the user and the first co-user.
  • 39. The non-transitory computer readable medium of claim 37, further comprising instructions that, when executed by the at least one processor, cause the computer device to: calculate a communications strength between the user and one or more additional users;rank the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically list the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 40. The non-transitory computer readable medium of claim 37, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine whether the first co-user is logged onto, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically add the first co-user to the list of co-users.
  • 41. The non-transitory computer readable medium of claim 40, further comprising instructions that, when executed by the at least one processor, cause the computer device to, if the first co-user is logged off of the communications system, automatically remove the first co-user from the list of co-users.
  • 42. A non-transitory computer readable medium comprising instructions that, when executed by at least one processor, cause a computer device to: provide, within a graphical user interface on a client device associated with a user, a list of co-users associated with the user within a communications system;determine whether a user of a communications system subscribes to receive information posted by a first co-user from among the list of co-users;determine whether the first co-user of the communications system subscribes to receive information posted by the user of the communications system;determine a degree of separation between the user of the communications system and the first co-user of the communications system;calculate, using at least one processor, a communications strength between the user and the first co-user based on: whether the user subscribes to receive information posted by the first co-user,whether the first co-user subscribes to receive information posted by the user, andthe degree of separation between the user and the first co-user;determine the communications strength between the user and the first co-user is greater than a communications strength between the user and a second co-user included on the list of co-users within the graphical user interface;based on the communications strength between the user and the first co-user being greater than the communications strength between the user and the second co-user, update the list of co-users within the graphical user interface by automatically adding a first identifier corresponding to the first co-user to the list of co-users and automatically removing a second identifier corresponding to the second co-user from the list of co-users; andin response to detecting a selection of the first identifier of the first co-user from the list of co-users within the graphical user interface, automatically generate an electronic message to send to the first co-user.
  • 43. The non-transitory computer readable medium of claim 42, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a time period associated with messages exchanged between the user and the first co-user; anduse the time period in calculating the communications strength between the user and the first co-user.
  • 44. The non-transitory computer readable medium of claim 42, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a number of electronic messages exchanged between the user and the first co-user of the communications system; anduse the number of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 45. The non-transitory computer readable medium of claim 42, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine a frequency of electronic messages exchanged between the user and the first co-user; anduse the frequency of electronic messages exchanged between the user and the first co-user of the communications system in calculating the communications strength between the user and the first co-user.
  • 46. The non-transitory computer readable medium of claim 42, further comprising instructions that, when executed by the at least one processor, cause the computer device to automatically organize the list of co-users based on the calculated communications strength between the user and the first co-user.
  • 47. The non-transitory computer readable medium of claim 46, wherein organizing the list of co-users comprises determining a location within the list of co-users to automatically add the first co-user based on the communications strength between the user and the first co-user.
  • 48. The non-transitory computer readable medium of claim 46, further comprising instructions that, when executed by the at least one processor, cause the computer device to: calculate a communications strength between the user and one or more additional users;rank the first co-user with respect to the one or more additional users based on the calculated communications strengths; andautomatically list the first co-user and the one or more additional users in the list of co-users in order of the ranking.
  • 49. The non-transitory computer readable medium of claim 46, further comprising instructions that, when executed by the at least one processor, cause the computer device to: determine whether the first co-user is logged onto, or logged off of, the communications system; andif the first co-user is logged on to the communications system, automatically add the first co-user to the list of co-users.
  • 50. The non-transitory computer readable medium of claim 49, further comprising instructions that, when executed by the at least one processor, cause the computer device to, if the first co-user is logged off of the communications system, automatically remove the first co-user from the list of co-users.
CROSS REFERENCE TO RELATED APPLICATIONS

The present application is a continuation of U.S. patent application Ser. No. 12/765,045 filed on Apr. 22, 2010, which is continuation of U.S. application Ser. No. 11/015,424 filed on Dec. 20, 2004 which is now issued as U.S. Pat. No. 7,716,287, which claims the benefit of and priority to U.S. provisional application No. 60/552,718 filed on Mar. 15, 2004 and U.S. provisional application No. 60/549,937 filed on Mar. 5, 2004. Each of the aforementioned patent(s), and application(s) are hereby incorporated by reference in their entirety.

US Referenced Citations (535)
Number Name Date Kind
4323987 Holtz et al. Apr 1982 A
4365293 Holtz Dec 1982 A
4517561 Burke et al. May 1985 A
4837798 Cohen et al. Jun 1989 A
4860339 D'Agosto et al. Aug 1989 A
5086394 Shapira Feb 1992 A
5251248 Tokunaga et al. Oct 1993 A
5276905 Hurst Jan 1994 A
5327486 Wolff et al. Jul 1994 A
5377354 Scannell et al. Dec 1994 A
5553110 Heller et al. Jul 1996 A
5548637 Heller et al. Aug 1996 A
5557659 Hyde-Thomson Sep 1996 A
5583920 Wheeler, Jr. Dec 1996 A
5608786 Gordon Mar 1997 A
5610910 Focsaneanu et al. Mar 1997 A
5634197 Paavonen May 1997 A
5650994 Daley Jul 1997 A
5694616 Johnson Dec 1997 A
5721906 Siefert Feb 1998 A
5724410 Parvulescu et al. Mar 1998 A
5737726 Cameron et al. Apr 1998 A
5742905 Pepe et al. Apr 1998 A
5764916 Busey et al. Jun 1998 A
5774670 Montulli Jun 1998 A
5790800 Gauvin et al. Aug 1998 A
5793365 Tang Aug 1998 A
5802470 Gaulke et al. Sep 1998 A
5806692 Pepper Sep 1998 A
5812770 Sakai Sep 1998 A
5831611 Kennedy et al. Nov 1998 A
5835724 Smith Nov 1998 A
5848134 Sekiguchi et al. Dec 1998 A
5850594 Cannon et al. Dec 1998 A
5859979 Tung et al. Jan 1999 A
5867162 O'Leary et al. Feb 1999 A
5870744 Sprague Feb 1999 A
5872521 Lopatukin et al. Feb 1999 A
5878219 Vance, Jr. et al. Mar 1999 A
5889799 Grossman et al. Mar 1999 A
5893091 Hunt et al. Apr 1999 A
5893099 Schreiber et al. Apr 1999 A
5919247 Van Hoff et al. Jul 1999 A
5920692 Nguyen et al. Jul 1999 A
5923848 Goodhand et al. Jul 1999 A
5940488 DeGrazia Aug 1999 A
5946617 Portaro Aug 1999 A
5948058 Kudoh et al. Sep 1999 A
5950193 Kulkarni Sep 1999 A
5951643 Shelton et al. Sep 1999 A
5951646 Brandon Sep 1999 A
5951652 Ingrassia, Jr. et al. Sep 1999 A
5954798 Shelton et al. Sep 1999 A
5956716 Kenner et al. Sep 1999 A
5960173 Tang et al. Sep 1999 A
5966714 Huang et al. Oct 1999 A
5983369 Bakoglu et al. Nov 1999 A
5987113 James Nov 1999 A
5987407 Wu et al. Nov 1999 A
5991791 Siefert Nov 1999 A
5995023 Kreft Nov 1999 A
6002402 Schacher Dec 1999 A
6006179 Wu et al. Dec 1999 A
6006215 Retallick Dec 1999 A
6009413 Webber et al. Dec 1999 A
6012051 Sammon, Jr. et al. Jan 2000 A
6014135 Fernandes Jan 2000 A
6014638 Burge et al. Jan 2000 A
6023723 McCormick et al. Feb 2000 A
6026382 Kalthoff Feb 2000 A
6026403 Siefert Feb 2000 A
6026429 Jones et al. Feb 2000 A
6049533 Norman et al. Apr 2000 A
6052709 Paul Apr 2000 A
6065047 Carpenter May 2000 A
6070171 Snyder et al. May 2000 A
6073112 Geerlings Jun 2000 A
6073138 de l'Etraz et al. Jun 2000 A
6081830 Schindler Jun 2000 A
6085223 Carino, Jr. et al. Jul 2000 A
6088435 Barber et al. Jul 2000 A
6101320 Schuetze et al. Aug 2000 A
6108691 Lee et al. Aug 2000 A
6112181 Shear et al. Aug 2000 A
6119114 Smadja Sep 2000 A
6134432 Holmes et al. Oct 2000 A
6144934 Stockwell et al. Nov 2000 A
6144991 England Nov 2000 A
6151584 Papierniak et al. Nov 2000 A
6151624 Teare et al. Nov 2000 A
6161130 Horvitz et al. Dec 2000 A
6166730 Goode et al. Dec 2000 A
6175831 Weinreich et al. Jan 2001 B1
6182227 Blair et al. Jan 2001 B1
6192395 Lerner et al. Feb 2001 B1
6195354 Skalecki et al. Feb 2001 B1
6199103 Sakaguchi et al. Mar 2001 B1
6202058 Rose et al. Mar 2001 B1
6212265 Duphorne Apr 2001 B1
6212548 DeSimone et al. Apr 2001 B1
6212550 Segur Apr 2001 B1
6223213 Cleron et al. Apr 2001 B1
6226372 Beebe et al. May 2001 B1
6233577 Ramasubramani et al. May 2001 B1
6247043 Bates Jun 2001 B1
6249740 Ito et al. Jun 2001 B1
6249743 Ito et al. Jun 2001 B1
6260148 Aggarwal et al. Jul 2001 B1
6269369 Robertson Jul 2001 B1
6301609 Aravamudan et al. Oct 2001 B1
6311211 Shaw Oct 2001 B1
6314420 Lang et al. Nov 2001 B1
6314450 Hachiya et al. Nov 2001 B1
6317776 Broussard et al. Nov 2001 B1
6324541 de l'Etraz et al. Nov 2001 B1
6330079 Dugan et al. Dec 2001 B1
6330590 Cotton Dec 2001 B1
6332153 Cohen Dec 2001 B1
6335963 Bosco Jan 2002 B1
6336133 Morris et al. Jan 2002 B1
6347332 Malet et al. Feb 2002 B1
6349327 Tang et al. Feb 2002 B1
6351698 Kubota et al. Feb 2002 B1
6351764 Voticky et al. Feb 2002 B1
6363392 Halstead et al. Mar 2002 B1
6366962 Teibel Apr 2002 B1
6374246 Matsuo Apr 2002 B1
6374290 Scharber et al. Apr 2002 B1
6389127 Vardi et al. May 2002 B1
6389372 Glance et al. May 2002 B1
6393464 Dieterman May 2002 B1
6396513 Helfman et al. May 2002 B1
6400381 Barrett et al. Jun 2002 B1
6405035 Singh Jun 2002 B1
6405249 Matsuda et al. Jun 2002 B1
6415318 Aggarwal Jul 2002 B1
6421439 Liffick Jul 2002 B1
6421675 Ryan Jul 2002 B1
6421709 McCormick et al. Jul 2002 B1
6425012 Trovato et al. Jul 2002 B1
6430344 Dixon et al. Aug 2002 B1
6430604 Ogle et al. Aug 2002 B1
6442589 Takahashi et al. Aug 2002 B1
6446112 Bunney et al. Sep 2002 B1
6449344 Goldfinger et al. Sep 2002 B1
6449634 Capiel Sep 2002 B1
6480885 Olivier Nov 2002 B1
6484196 Maurille Nov 2002 B1
6487600 Lynch Nov 2002 B1
6499021 Abu-Hakima Dec 2002 B1
6501834 Milewski et al. Dec 2002 B1
6507866 Barchi Jan 2003 B1
6525747 Bezos Feb 2003 B1
6529475 Wan et al. Mar 2003 B1
6535586 Cloutier et al. Mar 2003 B1
6539421 Appelman et al. Mar 2003 B1
6542750 Hendrey et al. Apr 2003 B2
6546417 Baker Apr 2003 B1
6549937 Auerbach et al. Apr 2003 B1
6557027 Cragun Apr 2003 B1
6559863 Megiddo May 2003 B1
6564248 Budge et al. May 2003 B1
6564261 Gudjonsson et al. May 2003 B1
6571234 Knight May 2003 B1
6574599 Lim et al. Jun 2003 B1
6580790 Henry et al. Jun 2003 B1
6584471 Maclin et al. Jun 2003 B1
6587549 Weik Jul 2003 B1
6606647 Shah et al. Aug 2003 B2
6615241 Miller et al. Sep 2003 B1
6622160 Horvitz Sep 2003 B1
6625258 Ram et al. Sep 2003 B1
6630944 Kakuta et al. Oct 2003 B1
6636733 Helferich Oct 2003 B1
6636850 Lepien Oct 2003 B2
6640218 Golding Oct 2003 B1
6640230 Alexander et al. Oct 2003 B1
6643641 Snyder Nov 2003 B1
6647383 August Nov 2003 B1
6654683 Jin et al. Nov 2003 B2
6654787 Aronson et al. Nov 2003 B1
6654791 Bates et al. Nov 2003 B1
6677968 Appelman Jan 2004 B1
6677976 Parker et al. Jan 2004 B2
6678719 Stimmel Jan 2004 B1
6681108 Terry et al. Jan 2004 B1
6691162 Wick Feb 2004 B1
6697807 McGeachie Feb 2004 B2
6701348 Sommerer Mar 2004 B2
6708205 Sheldon et al. Mar 2004 B2
6714791 Friedman Mar 2004 B2
6714793 Carey Mar 2004 B1
6714916 Robertson et al. Mar 2004 B1
6731308 Tang May 2004 B1
6732155 Meek May 2004 B2
6738822 Fukasawa et al. May 2004 B2
6745230 Cao et al. Jun 2004 B1
6747970 Lamb et al. Jun 2004 B1
6748421 Ozkan et al. Jun 2004 B1
6750881 Appelman Jun 2004 B1
6757365 Bogard Jun 2004 B1
6757732 Sollee et al. Jun 2004 B1
6772188 Cloutier Aug 2004 B1
6772195 Hatlelid et al. Aug 2004 B1
6779022 Horstmann et al. Aug 2004 B1
6781608 Crawford Aug 2004 B1
6785554 Amerga Aug 2004 B1
6785681 Keskar et al. Aug 2004 B2
6785781 Keskar et al. Aug 2004 B2
6788769 Waites Sep 2004 B1
6795863 Doty Sep 2004 B1
6799039 Wu et al. Sep 2004 B2
6800031 Di Cesare Oct 2004 B2
6807574 Partovi et al. Oct 2004 B1
6816578 Kredo et al. Nov 2004 B1
6821851 Hergenrother et al. Nov 2004 B2
6832245 Isaacs Dec 2004 B1
6839735 Wong et al. Jan 2005 B2
6839737 Friskel Jan 2005 B1
6857006 Nishizawa Feb 2005 B1
6868436 Fleming, III Mar 2005 B1
6868498 Katsikas Mar 2005 B1
6879665 Cook et al. Apr 2005 B1
6895426 Cortright et al. May 2005 B1
6901559 Blum et al. May 2005 B1
6904026 Tarnanen et al. Jun 2005 B1
6907243 Patel Jun 2005 B1
6912563 Parker Jun 2005 B1
6912564 Appelman et al. Jun 2005 B1
6917610 Kung et al. Jul 2005 B1
6917965 Gupta Jul 2005 B2
6920478 Mendiola et al. Jul 2005 B2
6940955 Jones et al. Sep 2005 B1
6941345 Kapil et al. Sep 2005 B1
6968179 DeVries Nov 2005 B1
6980870 Mok Dec 2005 B1
6990513 Belfiore et al. Jan 2006 B2
6990628 Palmer et al. Jan 2006 B1
6993327 Mathis Jan 2006 B2
6993564 Whitten, II Jan 2006 B2
6996520 Levin Feb 2006 B2
7007067 Azvine et al. Feb 2006 B1
7035865 Doss et al. Apr 2006 B2
7039639 Brezin May 2006 B2
7039676 Day et al. May 2006 B1
7043530 Isaacs et al. May 2006 B2
7058036 Yu Jun 2006 B1
7058690 Maehiro Jun 2006 B2
7065186 Myers et al. Jun 2006 B1
7082047 Chow Jul 2006 B2
7082407 Bezos et al. Jul 2006 B1
7085834 Delany et al. Aug 2006 B2
7117254 Lunt Oct 2006 B2
7120668 Manber et al. Oct 2006 B2
7120687 Tessman, Jr. et al. Oct 2006 B1
7124123 Roskind Oct 2006 B1
7127232 O'Neil Oct 2006 B2
7133898 Malik Nov 2006 B1
7143091 Charnok et al. Nov 2006 B2
7162202 Westman Jan 2007 B2
7167910 Farnham Jan 2007 B2
7171473 Eftis et al. Jan 2007 B1
7177880 Ruvolo Feb 2007 B2
7181498 Zhu Feb 2007 B2
7185059 Daniell et al. Feb 2007 B2
7188143 Szeto Mar 2007 B2
7188153 Lumt Mar 2007 B2
7190956 Dorenbosch Mar 2007 B2
7200634 Mendiola et al. Apr 2007 B2
7202814 Caspi et al. Apr 2007 B2
7206814 Kirsch Apr 2007 B2
7216144 Morris et al. May 2007 B1
7222156 Gupta et al. May 2007 B2
7233992 Muldoon et al. Jun 2007 B1
7263614 Roskind Aug 2007 B2
7269590 Hull Sep 2007 B2
7275215 Werndorfer Sep 2007 B2
7283805 Agrawal Oct 2007 B2
7313760 Grossman Dec 2007 B2
7316028 Donatelli et al. Jan 2008 B2
7366779 Crawford Apr 2008 B1
7380007 Bu et al. May 2008 B1
7403942 Bayliss Jul 2008 B1
7436780 Stephens et al. Oct 2008 B2
7437413 Okuyama et al. Oct 2008 B2
7454470 Isaacs Nov 2008 B1
7475113 Stolze Jan 2009 B2
7519717 Stanford-Clark Apr 2009 B2
7561682 Doherty et al. Jul 2009 B2
7596386 Yach et al. Sep 2009 B2
7610627 McKenna Oct 2009 B1
7636752 Madsen et al. Dec 2009 B2
7680886 Cooley Mar 2010 B1
7711106 Likwornik May 2010 B2
7716287 Appelman May 2010 B2
7774711 Valeski Aug 2010 B2
7904511 Ryan Mar 2011 B2
7917744 Radatti Mar 2011 B2
7941491 Sood May 2011 B2
7945674 Appelman May 2011 B2
7949759 Appelman May 2011 B2
7954146 Roskind May 2011 B2
7979802 Appelman Jul 2011 B1
7992210 McKenna Aug 2011 B2
8060566 Appleman Nov 2011 B2
8117265 Ben-Yoseph Feb 2012 B2
8180807 Gorti May 2012 B2
8185638 Appelman May 2012 B2
8365083 Martin et al. Jan 2013 B2
8429119 Gorti Apr 2013 B2
8560706 Appelman Oct 2013 B2
8751440 Gorti Jun 2014 B2
8861694 Kirchhoff et al. Oct 2014 B1
RE45254 Roskind Nov 2014 E
9177293 Gagnon et al. Nov 2015 B1
20010002469 Bates et al. May 2001 A1
20010005861 Mousseau Jun 2001 A1
20010013050 Shah Aug 2001 A1
20010032246 Fardella et al. Oct 2001 A1
20010034244 Calder et al. Oct 2001 A1
20010052019 Walters et al. Dec 2001 A1
20020015061 Maguire Feb 2002 A1
20020021307 Glenn et al. Feb 2002 A1
20020023132 Tornabene et al. Feb 2002 A1
20020023134 Roskowski et al. Feb 2002 A1
20020028595 Higashi et al. Mar 2002 A1
20020042816 Bae Apr 2002 A1
20020049717 Routtenberg et al. Apr 2002 A1
20020055975 Petrovykh May 2002 A1
20020056123 Liwerant et al. May 2002 A1
20020059201 Work May 2002 A1
20020065856 Kisiel May 2002 A1
20020065894 Dalal May 2002 A1
20020077080 Greene Jun 2002 A1
20020083136 Whitten Jun 2002 A1
20020086732 Kirmse et al. Jul 2002 A1
20020091667 Jaipuria et al. Jul 2002 A1
20020095464 Meek Jul 2002 A1
20020103801 Lyons Aug 2002 A1
20020107928 Chalon Aug 2002 A1
20020112181 Smith Aug 2002 A1
20020116463 Hart Aug 2002 A1
20020116641 Mastrianni Aug 2002 A1
20020124053 Adams Sep 2002 A1
20020128033 Burgess Sep 2002 A1
20020133292 Miyaki Sep 2002 A1
20020133369 Johnson Sep 2002 A1
20020147777 Hackbarth et al. Oct 2002 A1
20020154149 Hebbar et al. Oct 2002 A1
20020174010 Rice Nov 2002 A1
20020175953 Lin Nov 2002 A1
20020178161 Brezin Nov 2002 A1
20020181703 Logan et al. Dec 2002 A1
20020184089 Tsou Dec 2002 A1
20020193942 Odakura et al. Dec 2002 A1
20020199095 Bandini et al. Dec 2002 A1
20030004855 Dutta et al. Jan 2003 A1
20030004872 Gardi et al. Jan 2003 A1
20030009385 Tucciarone et al. Jan 2003 A1
20030009523 Lindskog et al. Jan 2003 A1
20030009698 Lindeman et al. Jan 2003 A1
20030018726 Low et al. Jan 2003 A1
20030023691 Knauerhase Jan 2003 A1
20030023692 Moroo Jan 2003 A1
20030023875 Hursey et al. Jan 2003 A1
20030025824 Keskar Feb 2003 A1
20030037112 Fitzpatrick Feb 2003 A1
20030043201 Abdelhadi et al. Mar 2003 A1
20030045272 Burr Mar 2003 A1
20030046198 Knapp et al. Mar 2003 A1
20030050916 Ortega et al. Mar 2003 A1
20030055831 Ryan Mar 2003 A1
20030065721 Roskind Apr 2003 A1
20030074454 Peck Apr 2003 A1
20030078981 Harms et al. Apr 2003 A1
20030083046 Mathis May 2003 A1
20030084103 Weiner et al. May 2003 A1
20030088554 Ryan May 2003 A1
20030093483 Allen et al. May 2003 A1
20030093580 Thomas et al. May 2003 A1
20030101226 Quine May 2003 A1
20030028595 Vogt et al. Jun 2003 A1
20030105822 Gusler et al. Jun 2003 A1
20030110212 Lewis Jun 2003 A1
20030131061 Newton et al. Jul 2003 A1
20030140103 Szeto et al. Jul 2003 A1
20030158855 Farnham et al. Aug 2003 A1
20030167324 Farnham et al. Sep 2003 A1
20030172349 Katayama Sep 2003 A1
20030182394 Ryngler et al. Sep 2003 A1
20030187813 Goldman Oct 2003 A1
20030188263 Bates et al. Oct 2003 A1
20030191969 Katsikas Oct 2003 A1
20030200272 Campise et al. Oct 2003 A1
20030212745 Caughey Nov 2003 A1
20030212804 Hashemi Nov 2003 A1
20030225847 Heikes et al. Dec 2003 A1
20030233416 Beyda Dec 2003 A1
20030233418 Goldman Dec 2003 A1
20030236835 Levi et al. Dec 2003 A1
20040015548 Lee Jan 2004 A1
20040015553 Griffin et al. Jan 2004 A1
20040017396 Werndorfer et al. Jan 2004 A1
20040054729 Fukizumi et al. Mar 2004 A1
20040054733 Weeks Mar 2004 A1
20040054735 Daniell et al. Mar 2004 A1
20040054736 Daniell Mar 2004 A1
20040056901 March Mar 2004 A1
20040059781 Yoakum et al. Mar 2004 A1
20040073643 Hayes et al. Apr 2004 A1
20040111261 Chaudhari et al. Jun 2004 A1
20040117443 Barsness Jun 2004 A1
20040117451 Chung Jun 2004 A1
20040122681 Ruvolo Jun 2004 A1
20040122810 Mayer Jun 2004 A1
20040122822 Thompson et al. Jun 2004 A1
20040122855 Ruvolo Jun 2004 A1
20040122901 Sylvain Jun 2004 A1
20040128322 Nagy Jul 2004 A1
20040128356 Bernstein et al. Jul 2004 A1
20040148275 Achlioptas Jul 2004 A1
20040153519 Stolze Aug 2004 A1
20040177119 Mason et al. Sep 2004 A1
20040179039 Blattner Sep 2004 A1
20040186738 Reisman Sep 2004 A1
20040199581 Kucharewski Oct 2004 A1
20040201624 Crawford Oct 2004 A1
20040203695 Mikan Oct 2004 A1
20040205126 Ben-Yoseph Oct 2004 A1
20040210844 Pettinati et al. Oct 2004 A1
20040215648 Marshall Oct 2004 A1
20040215721 Szeto et al. Oct 2004 A1
20040215793 Ryan Oct 2004 A1
20040220897 Bernhart et al. Nov 2004 A1
20040221309 Zaner Nov 2004 A1
20040243844 Adkins Dec 2004 A1
20040255122 Ingerman et al. Dec 2004 A1
20040260762 Fish Dec 2004 A1
20050004989 Satterfield et al. Jan 2005 A1
20050015432 Cohen Jan 2005 A1
20050021750 Abrams Jan 2005 A1
20050027382 Kirmse Feb 2005 A1
20050038688 Collins et al. Feb 2005 A1
20050038856 Krishnasamy Feb 2005 A1
20050043989 Shifrin Feb 2005 A1
20050044152 Hardy et al. Feb 2005 A1
20050050143 Gusler et al. Mar 2005 A1
20050055340 Dresden Mar 2005 A1
20050055416 Heikes Mar 2005 A1
20050055450 Gang Mar 2005 A1
20050060377 Lo et al. Mar 2005 A1
20050076240 Appleman Apr 2005 A1
20050076241 Appelman Apr 2005 A1
20050080859 Lake Apr 2005 A1
20050080863 Daniell Apr 2005 A1
20050086211 Mayer Apr 2005 A1
20050086305 Koch et al. Apr 2005 A1
20050091311 Lund et al. Apr 2005 A1
20050097170 Zhu May 2005 A1
20050102202 Linden et al. May 2005 A1
20050102257 Onyon et al. May 2005 A1
20050108344 Tafoya May 2005 A1
20050114229 Ackley et al. May 2005 A1
20050117729 Reding et al. Jun 2005 A1
20050124320 Ernst et al. Jun 2005 A1
20050153681 Hanson Jul 2005 A1
20050154913 Barriga et al. Jul 2005 A1
20050159970 Buyukkokten Jul 2005 A1
20050159998 Buyukkokten Jul 2005 A1
20050160144 Bhatia Jul 2005 A1
20050171799 Hull Aug 2005 A1
20050177385 Hull Aug 2005 A1
20050177486 Yeager Aug 2005 A1
20050188044 Fleming, III Aug 2005 A1
20050197846 Pezaris Sep 2005 A1
20050198131 Appelman Sep 2005 A1
20050198171 Landsman Sep 2005 A1
20050198172 Appelman Sep 2005 A1
20050198173 Evans Sep 2005 A1
20050198268 Chandra Sep 2005 A1
20050216300 Appelman Sep 2005 A1
20050246420 Little Nov 2005 A1
20060031366 Dolph Feb 2006 A1
20060031772 Valeski Feb 2006 A1
20060036701 Bulfer et al. Feb 2006 A1
20060053384 La Fetra et al. Mar 2006 A1
20060075044 Fox et al. Apr 2006 A1
20060129678 Morita Jun 2006 A1
20060167991 Heikes et al. Jul 2006 A1
20060168054 Burkhart et al. Jul 2006 A1
20060173824 Bensky et al. Aug 2006 A1
20060173963 Roseway et al. Aug 2006 A1
20060182248 Smith et al. Aug 2006 A1
20060190536 Strong et al. Aug 2006 A1
20060212561 Feng Sep 2006 A1
20060248573 Pannu et al. Nov 2006 A1
20060256959 Hynmes Nov 2006 A1
20060277187 Roese et al. Dec 2006 A1
20070005654 Schachar et al. Jan 2007 A1
20070038664 Jonas Feb 2007 A1
20070047522 Jefferson et al. Mar 2007 A1
20070050456 Vuong et al. Mar 2007 A1
20070156664 Norton et al. Jul 2007 A1
20070208727 Saklikar et al. Sep 2007 A1
20070208747 Puckrin Sep 2007 A1
20070239869 Raghav et al. Oct 2007 A1
20070250566 Appelman Oct 2007 A1
20080082620 Barsness Apr 2008 A1
20080115087 Rollin et al. May 2008 A1
20080186164 Emigh et al. Aug 2008 A1
20080208812 Quoc et al. Aug 2008 A1
20080228598 Leff et al. Sep 2008 A1
20080255989 Altberg Oct 2008 A1
20090030940 Brezina et al. Jan 2009 A1
20090043844 Zimmet Feb 2009 A1
20090070306 Stroe Mar 2009 A1
20090089316 Kogan et al. Apr 2009 A1
20090100321 Singh et al. Apr 2009 A1
20090141046 Rathnam et al. Jun 2009 A1
20100205546 Appelman Aug 2010 A1
20100325113 Valeski Dec 2010 A1
20120005078 Pitroda Jan 2012 A1
20120233269 Ben-Yoseph Sep 2012 A1
20120262462 Montan et al. Oct 2012 A1
20130066990 Ben-Yoseph Mar 2013 A1
20130066991 Ben-Yoseph Mar 2013 A1
20130066992 Ben-Yoseph Mar 2013 A1
20130073556 Valeski Mar 2013 A1
20140317122 Valeski Oct 2014 A1
20140317215 Isaacs et al. Oct 2014 A1
20140324886 Valeski Oct 2014 A1
20150081828 Appelman Mar 2015 A1
20170374170 Ben-Yoseph Dec 2017 A1
20190037038 Ben-Yoseph Jan 2019 A1
20190042640 Valeski Feb 2019 A1
Foreign Referenced Citations (41)
Number Date Country
1348296 May 2002 CN
10048653 Apr 2002 DE
0862304 Sep 1998 EP
1176840 Jan 2002 EP
2319137 May 1998 GB
2357932 Jul 2001 GB
2368747 May 2002 GB
2008-314826 Nov 1996 JP
2000-499001 Feb 2000 JP
2000259514 Sep 2000 JP
2000284999 Oct 2000 JP
2001084320 Mar 2001 JP
WO 9710558 Mar 1997 WO
WO 9714234 Apr 1997 WO
WO 9746955 Dec 1997 WO
WO 9816045 Apr 1998 WO
WO 9847270 Oct 1998 WO
WO 9908434 Feb 1999 WO
WO 9934628 Jul 1999 WO
WO 9948011 Sep 1999 WO
WO 0016201 Mar 2000 WO
WO 0024154 Apr 2000 WO
WO 0060809 Oct 2000 WO
WO 0079396 Dec 2000 WO
WO 0106748 Jan 2001 WO
WO 0122258 Mar 2001 WO
WO 0124036 Apr 2001 WO
WO 0143357 May 2001 WO
WO 0167787 Sep 2001 WO
WO 0172020 Sep 2001 WO
WO 0180079 Oct 2001 WO
WO 0203216 Jan 2002 WO
WO 0209437 Jan 2002 WO
WO 0228046 Apr 2002 WO
WO 0235781 May 2002 WO
WO 0262039 Aug 2002 WO
WO 0273886 Sep 2002 WO
WO 0428178 Apr 2004 WO
WO 05089286 Sep 2005 WO
WO 2005086723 Sep 2005 WO
WO 2006068955 Jun 2006 WO
Non-Patent Literature Citations (388)
Entry
U.S. Appl. No. 60/538,035, filed Jan. 24, 2004, pp. 1-25.
“A Countermeasure to Duplicate-detecting Anti-spam Techniques,” Robert J. Hall, AT&T Labs Technical Report 99.9.1, 1999, Abst. and pp. 1-26.
“A Reputation System for Peer-to-Peer Networks,” Gupta et al., Jun. 1-3, 2003, NOSSDAV'03, Monterey, California, pp. 144-152.
“Announce: Implementation of E-mail Spam Proposal,” Maurice L. Marvin, news.admin.net-abuse.misc, Aug. 3, 1996, 2 pages.
“BestCalls.com Announces the BestCalls Technology Index,” Business Wire, Jun. 30, 1999, Business Wire, p. 1.
“Better Bayesian Filtering,” Paul Graham, Jan. 2003, pp. 1-11, http://www.paulgraham.com/better.html.
“Business at Cyberspeed; Brainstorm Becomes Quick Internet Hit,” Walker, Jan. 24, 1999, The Washington Post, p. A.01 (4 total pages).
“CrushParty.com: Help,” retrieved Jun. 12, 2002 from the World Wide Web: http://www.crushparty.com/help.jsp, 3 pages.
“Degrees of Separation Email Spam Protection,” Halfbakery: Degrees of Separation Email Spam Protection, reprinted from http://halfbakery.com/idea/Degrees-20of-20Separation-20Email-20Spam-20Protecti . . . printed on Mar. 1, 2004 (3 pages).
“Finding Others Online: Reputation Systems for Social Online Spaces,” Jensen et al., Apr. 20-25, 2002, CHI, Minneapolis, Minnesota, vol. 4, Issue 1, pp. 447-454.
“Hottie or Nottie? Web Site Voters Let You Know Whether You Sizzle or Fizzle,” Marino, Jul. 11, 2001, Florida Times Union, p. C.1. (2 total pages).
“Icq.anywhere, Email Features-Email Center-ICQ.com.” Retrieved Apr. 29, 2004 from the World Wide Web: http://www.icq.com/email/popular-features.html, pp. 1-5.
“Idea for Online Networking Brings Two Entrepreneurs Together,” Patents: Idea for Online Networking Brings Two Entrepreneurs Together, reprinted from http://www.nytimes.com/2003/12/01/technology/01patt.html?adxnnl+0&adxnnlx=107029 . . . , printed on Nov. 5, 2004 (3 pages).
“Instant Messaging for Garners,” PC Gamer, May 2004, vol. 11, No. 5, p. 28.
“Learning Spam: Simple Techniques for Freely-Available Software,” Bart Massey et al, Computer Science Dept., Portland, or USA, Jun. 2003, pp. 1-14.
“Learning to Filter Spam E-Mail: A Comparison of a Naïve Bayesian and a Memory-Based Approach,” Ion Adroutsopoulos et al., University of Athens, Sep. 2000, pp. 1-12.
“Lotus Instant Messaging Everyplace FAQ.” Retrieved Apr. 29, 2004 from the World Wide Web: http://www.lotus.com/products/product4.nsf/wdocs/249c6f083166cd3e85256d7300714407, pp. 1-3.
“PieSpy Social Network Bot Inferring and Visualizing Social Networks on IRC” Paul Mutton. Dec. 4, 2003. Internet Archive WaybackMachine http://web.archive.org/web/20031204185952/http://jibble.org/piespy/.
“PieSpy—Inferring and Visualizing Social Network on IRC,” PieSpy Social Network Bot, reprinted from http://lister.linux-srv.anlx.net/piespy printed on Mar. 11, 2004 (18 pages).
“Plaxo-Update Your Address Book,” Plaxo Contact Networks, reprinted from http://web.archive.org/web/20030218233638/http://www.plaxo.com/ printed on Nov. 5, 2004 (available on Feb. 18, 2003) (1 page).
“plaxo,” Plaxo, reprinted from http://web.archive.org/web/20041105072256/http://www.plaxo.com/ printed on Nov. 5, 2004 (available on Feb. 14, 2004) (2 pages).
“Reflections on Friendster, Trust and Intimacy,” Danah Boyd. Ubicomp 2003, Workshop Application for the Intimate Ubiquitous Computing Workshop. Seattle, WA, Oct. 12-15, 2003.
“Reputation Systems,” Resnick et al., Dec. 2000, Communications of the ACM, vol. 43, No. 12, pp. 45-48.
“RIM Road: Software: Internet & Network: Webmessenger RIM J2ME/Instant Messaging.” Retrieved Apr. 29, 2004 from the World Wide Web: http://www.rimroad.com/software/rim1/Webmessenger-RIM-J2ME-Instant-Messaging-20 . . . , pp. 1-4.
“Six Degrees—New Programs Help Companies ‘Mine Workers’ Relationships for Key Business Prospects,” William M. Bulkeley et al., Marketplace, The Wall Street Journal, Aug. 4, 2003, (3 pages).
“Social Nets Find Friends in VCs,” Joanna Glasner, http://www.wired.com/news, Nov. 17, 2003, pp. 1-3.
“Social Network Fragments: An Interactive Tool for Exploring Digital Social Connections.” Danah Boyd, Jeff Potter. Sketch at SIGGRAPH 2003. San Diego, California: ACM, Jul. 27-31, 2003.
“Social Networking for Business: Release 0.5,” Esther Dyson, Esther Dyson's Monthly Report, vol. 21, No. 10, Nov. 25, 2003, www.edventure.com, (36 pages).
“Social Sites Clicking With Investors,” Washingtonpost.com: Social Sites Clicking With Investors, reprinted from http://www.washingtonpost.com/ac2/wp-dyn/A32066-2003Nov12?language=printer printed on Nov. 5, 2004.
“Social Social Networks: Deodorant for the Soul?,” Esther Dyson, Esther Dyson's Monthly Report, Release 1.0, vol. 21, No. 11, Dec. 12, 2003, www.edventure.com, (36 pages).
“Socialware: Multiagent Systems for Supporting Network Communities,” Hattori et al., Mar. 1999, Association for Computing Machinery, Communications of the ACM, vol. 42, Issue 3, 55ff.
“Spoke Builds on Social Networking Patent Portfolio,” Spoke Builds on Social Networking Patent Portfolio, reprinted from http://www.internetnews.com/ent-news/print.php/3073621 printed on Nov. 5, 2004 (3 pages).
“Support Vector Machines for Spam Categorization,” Harris Drucker et al., IEEE Transactions on Neural Networks, vol. 10, No. 5, Sep. 1999, pp. 1048-1054.
“Support Vector Machines,” Marti Hearst, IEEE Intelligent Systems, Jul./Aug. 1998, pp. 18-28.
“SVM-based Filtering of E-mail Spam with Content-specific Misclassification Costs,” Aleksander Kolcz et al., TextDM'2001 (IEEE ICDM-2001 Workshop on Text Mining), San Jose, CA, 2001, pp. 1-14.
“SWF Seeks Attractive Head Shot; to Stand Out, Online Daters Pay for Professional Photos; Cropping out the Ex-Wife,” Leiber, Nov. 19, 2003, The Wall Street Journal, p. D.1.
“Technical Solutions for Controlling Spam,” Shane Hird, Proceedings of AUUG2002, Melbourne, Sep. 4-6, 2002, 17 pages.
“Technology Journal—Are You Satisfied? EBay's Battle Against Fraud Rests Primarily on a Simple Concept: Customer Feedback,” Wingfield, Sep. 23, 2002, Asian Wall Street Journal, p. T.8, (4 total pages).
“Telstra targets Net spammers,” J. Dudley, news.com.au, Dec. 2, 2003, 2 pages.
“Text Categorization with Support Vector Machines: Learning with Many Relevant Features,” Thorsten Joachims, University of Dortmund, Computer Science Dept., LS-8 Report 23, Apr. 1998, 18 pages.
“The first Social Software . . . a true Social Adventure,” Huminity-Social Networking, Chat Software, Create Personal Free Blogs and My Group . . . , reprinted from http://www.huminity.com/ printed on Nov. 5, 2004 (2 pages).
“Trillian Discussion Forums—HOWTO: Import ICQ 2003a Contact List.” Retrieved Apr. 29, 2004 from the World Wide Web: http://trillian.cc/forums/showthread.php?s+&threadid=36475, pp. 1-2.
“Welcome to Huminity World of Connections,” Huminity-Home, reprinted from http://web.archive.org/web/20030228131435/www.huminity.com/default.php?internationa . . . printed on Nov. 5, 2004 (available on Feb. 2, 2003) (1 page).
“Will You Buy a Car From This Man?,” Leander Kahney, Oct. 6, 2003, pp. 1-3.
America Online Inc., “AOL Instant Messenger”, Aug. 29, 2000, Internet: www.aol.com/aim/ (18 pages).
America Online Inc., New AIM 4.7, Sep. 27, 2001, Internet: http://aim.aol.com (7 pages).
CNET Networks Inc., “PopUp Killer”, Sep. 13, 2001, Internet: download.cnet.com/downloads/0-10059-100-6932612.html, (3 pages).
Ed Bott and Ron Person, Using Windows 95 with Internet Explorer 4.0, Feb. 17, 1998, Que, Special Edition, 21 pages.
Home-tribe.net, http://washingtondc.tribe.net/message/24434d1b-817b-4580-aa42-3bffal5f26a?page=1 (4 total pages).
http://www.friendster.com (17 pages).
International Search Report and written opinion dated Feb. 15, 2006 for International Application No. PCT/US05/07204.
International Search Report and Written Opinion issued in International Application No. PCT/US05/45663, dated Apr. 11, 2008.
International Search Report, Application Serial No. PCT/US05/08476, dated Oct. 16, 2006, 9 pages.
McKendrick, Joseph; “Internet Call Centers: New Era in Customer Service”, Feb. 2002; V10, n2, (4 pages).
Neo Mai, Ken Neo. “Buying and selling on the internet; [Computimes, 2* Edition],” New Straits Times. Kuala Lumpur: Jun. 28, 2001, p. 53.
“Technology Journal: Changing Chat—Instant Messaging is Taking Off, and for Some Users It's Nuzzling Out the Phone,” Nick Wingfield, Asian WSJ, Sep. 2000.
R. Movva & W. Lai, “MSN Messenger Service 1.0 Protocol”, Aug. 1999, Internet Draft, http://tools.ietf.org/id/draft-movva-msn-messenger-protocol-oo.txt, 28 pages.
Reichard, K., “AOL, ICQ to Interoperate-But in a Limited Fashion,” Oct. 30, 2002, InstantMessagingPlanet, available at www.instanmessagingplanet.com/public/article.php/1490771.
Ryze home page, www.ryze.com, Dec. 21, 2003, available at http://web.archive.org/web/20031221010006/http://ryze.com, printed Mar. 16, 2005, (13 pages).
Viegas et al., “Digital Artifacts for Remembering and Storytelling: PostHistory and Social Network Fragments.” Retrieved from the World Wide Web: http://web.media.mit.edu/˜fviegas/papers/posthistory-snf.pdf, 10 total pages.
VisiblePath webpages, www.visiblepath.org, Dec. 3, 2003, available at http://web.archive.org/web/20031203132211/http://www.visiblepath.com, printed Mar. 16, 2005, 5 pages.
WebmasterWorld.com Inc., “HTML and Browsers”, Mar. 5, 2001, Internet: www.webmaster.com/forum21/367.htm, 2 pages.
ZeroDegrees home page, www.zerodegrees.com, Jan. 24, 2004, available at http://web.archive.org/web/20040204153037/www.zerodegrees.com/home.htm, printed Mar. 16, 2005, 2 pages.
U.S. Appl. No. 10/146,814, Dec. 11, 2006, Office Action.
U.S. Appl. No. 10/146,814, Jul. 2, 2007, Office Action.
U.S. Appl. No. 10/184,002, Jan. 9, 2007, Office Action.
U.S. Appl. No. 10/334,056, May 12, 2008, Office Action.
U.S. Appl. No. 10/334,056, Nov. 5, 2007, Office Action.
U.S. Appl. No. 10/334,056, May 21, 2007, Office Action.
U.S. Appl. No. 10/334,056, May 10, 2006, Office Action.
U.S. Appl. No. 10/334,056, Oct. 31, 2005, Office Action.
U.S. Appl. No. 10/334,056, Jul. 6, 2005, Office Action.
U.S. Appl. No. 10/334,056, Nov. 29, 2004, Office Action.
U.S. Appl. No. 10/633,636, Oct. 11, 2006, Office Action.
U.S. Appl. No. 11/015,423, Mar. 2, 2009, Office Action.
U.S. Appl. No. 11/015,424, Mar. 19, 2008, Office Action.
U.S. Appl. No. 11/015,424, Nov. 3, 2008, Office Action.
U.S. Appl. No. 11/015,424, May 1, 2009, Office Action.
U.S. Appl. No. 11/015,424, Feb. 17, 2010, Notice of Allowance.
U.S. Appl. No. 11/017,204, Jun. 23, 2008, Office Action.
U.S. Appl. No. 11/017,204, Dec. 12, 2007, Office Action.
U.S. Appl. No. 11/237,718, Apr. 2, 2009, Office Action.
U.S. Appl. No. 11/238,110, Nov. 29, 2007, Office Action.
U.S. Appl. No. 11/238,110, Jul. 9, 2008, Office Action.
U.S. Appl. No. 11/238,110, Oct. 9, 2008, Office Action.
U.S. Appl. No. 11/238,129, Nov. 14, 2007, Office Action.
U.S. Appl. No. 11/238,129, May 28, 2008, Office Action.
U.S. Appl. No. 11/238,130, Apr. 14, 2009, Office Action.
U.S. Appl. No. 11/238,130, Nov. 13, 2008, Office Action.
U.S. Appl. No. 11/238,130, Jul. 3, 2008, Office Action.
U.S. Appl. No. 11/464,816, Apr. 21, 2009, Office Action.
U.S. Appl. No. 12/290,827, Jun. 5, 2015, Notice of Allowance.
U.S. Appl. No. 13/615,126, May 8, 2015, Office Action.
U.S. Appl. No. 13/615,134, Oct. 8, 2014, Office Action.
U.S. Appl. No. 13/615,134, May 7, 2015, Office Action.
U.S. Appl. No. 13/615,142, May 6, 2015, Office Action.
U.S. Appl. No. 12/290,827, Jul. 8, 2015, Notice of Allowance.
U.S. Appl. No. 12/765,045, Mar. 7, 2014, Office Action.
U.S. Appl. No. 13/620,921, Apr. 25, 2014, Notice of Allowance.
U.S. Appl. No. 14/049,069, May 23, 2014, Office Action.
U.S. Appl. No. 12/290,827, filed Nov. 4, 2008, Isaacs.
U.S. Appl. No. 14/326,407, filed Jul. 8, 2014, Roskind.
U.S. Appl. No. 14/327,164, filed Jul. 9, 2014, Isaacs.
U.S. Appl. No. 14/327,183, filed Jul. 9, 2014, Isaacs.
U.S. Appl. No. 14/327,202, filed Jul. 9, 2014, Isaacs.
U.S. Appl. No. 14/327,216, filed Jul. 9, 2014, Isaacs.
U.S. Appl. No. 14/327,226, filed Jul. 9, 2014, Isaacs.
U.S. Appl. No. 14/328,525, filed Jul. 10, 2014, Isaacs.
Joan Morris DiMicco and David R. Millen, “Identity Management: Multiple Presentations of Self in Facebook”, Proceeding GROUP '07 Proceedings of the 2007 International ACM Conference on Supporting Group Work, pp. 383-386, ACM.
Julian Byrne, “My Spamblock was thrwarting UCE address culling programs”, news.admin.net-abuse.e-mail, Jan. 19, 1997.
Kenrick Mock, Dynamic Email Organization via Relevance Catergories, Intel Corp., Tools with Artificial Intelligence, 1999. Proceedings. 11th IEEE International Conference, pp. 399-405.
Nardi et al.; Integrating Communication and Information Contactmap; Communication of the ACM; Apr. 2002; vol. 45, No. 4; p. 89-95.
Online! Feb. 1, 2003, pp. 1-2, XP002297111, Webpage of Slipstick Systems: To add addresses automatically to Microsoft Outlook Contacts, http://web.archive.org/web/20030201082058/http://www.slipstick.com/contacts/addauto.htm>, retrieved on Sep. 17, 2004 the whole document.
Uhara7, “Re. being invisible to all but one person on your list”, alt.chat-programs.icq, Feb. 29, 2000.
Zephyr on Athena (AC-34), http://web.mit.edu/olh//Zephyr/Revision.html, 11 pages, Retrieved on May 17, 2013.
International Search Report dated Jan. 27, 2005 for International Application No. PCT US2004/009422, International Filing Date Mar. 26, 2004.
Office Action issued in Chinese Application No. 200480013443.9, dated Mar. 6, 2009, 20 pages, including English translation.
Written Opinion dated Jan. 27, 2005 for International Application No. PCT/US2004/009422, International Filing Date Mar. 26, 2004.
U.S. Appl. No. 09/726,912, Mar. 15, 2004, Office Action.
U.S. Appl. No. 09/726,912, Sep. 24, 2004, Notice of Allowance.
U.S. Appl. No. 10/747,682, Oct. 11, 2007, Office Action.
U.S. Appl. No. 10/747,682, Apr. 7, 2008, Office Action.
U.S. Appl. No. 10/747,682, Aug. 19, 2008, Office Action.
U.S. Appl. No. 10/747,682, Mar. 18, 2009, Office Action.
U.S. Appl. No. 10/747,682, Nov. 2, 2009, Office Action.
U.S. Appl. No. 10/747,682, Jun. 11, 2010, Office Action.
U.S. Appl. No. 10/747,682, Dec. 2, 2010, Office Action.
U.S. Appl. No. 10/747,682, Oct. 5, 2011, Notice of Allowance.
U.S. Appl. No. 10/979,960, Jan. 31, 2008, Office Action.
U.S. Appl. No. 10/979,960, Sep. 25, 2008, Notice of Allowance.
U.S. Appl. No. 11/945,792, Jun. 21, 2010, Office Action.
U.S. Appl. No. 11/945,792, Dec. 7, 2010, Office Action.
U.S. Appl. No. 11/945,792, Aug. 22, 2011, Office Action.
U.S. Appl. No. 11/945,792, Jan. 31, 2012, Notice of Allowance.
U.S. Appl. No. 12/765,045, Aug. 5, 2014, Notice of Allowance.
U.S. Appl. No. 12/852,769, Aug. 5, 2014, Notice of Allowance.
U.S. Appl. No. 12/290,827, Jun. 30, 2010, Office Action.
U.S. Appl. No. 12/290,827, Jan. 5, 2011, Office Action.
U.S. Appl. No. 12/290,827, Sep. 27, 2011, Office Action.
U.S. Appl. No. 13/372,371, May 9, 2013, Office Action.
U.S. Appl. No. 13/372,371, Nov. 29, 2013, Office Action.
U.S. Appl. No. 13/372,371, Mar. 26, 2014, Office Action.
U.S. Appl. No. 13/372,371, Jul. 1, 2014, Notice of Allowance.
U.S. Appl. No. 13/443,080, Dec. 31, 2012, Notice of Allowance.
U.S. Appl. No. 13/850,352, Jul. 18, 2013, Office Action.
U.S. Appl. No. 13/850,352, Nov. 27, 2013, Notice of Allowance.
U.S. Appl. No. 13/907,761, Jun. 10, 2014, Office Action.
U.S. Appl. No. 13/907,761, Jul. 16, 2014, Notice of Allowance.
U.S. Appl. No. 09/726,912, Sep. 24, 2004, Office Action.
U.S. Appl. No. 10/979,960, Jan. 3, 2008, Office Action.
U.S. Appl. No. 13/615,126, Oct. 6, 2014, Office Action.
U.S. Appl. No. 13/615,142, Oct. 2, 2014, Office Action.
U.S. Appl. No. 14/049,069, Aug. 26, 2014, Notice of Allowance.
“About File Transfers”, AOL Instant Messenger, version 4.3, Help Documentation, available on Jul. 21, 2001, 5 pages.
“About Internet directory services,” Outlook 2000 SR-1 (9.0.0. 4527) Help File, on or before Aug. 10, 2001, p. 1.
“Active Directory Features,” [online], Jun. 15, 1999 [retrieved on May 13, 2003]. Retrieved from the Internet, pp. 1-4.
“Active Directory Service Overview,” [online], Nov. 30, 2001 [retrieved on May 13, 2003], Retrieved from the Internet, pp. 1-5.
“Active Directory,” [online], [retrieved on May 13, 2003]. Retrieved from the Internet, pp. 1-13.
“AOL Instant Messenger Windows Beta Features”, Jun. 24, 1999, 2 pages, AOL Instant Messenger All New Version 2.0, 2 pages, Jun. 24, 1999, What is AOL Instant Messenger, 3 pages, Jun. 24, 1999, Quick Tips for Getting Started, 5 pages, Jun. 24, 1999, Frequently Asked Questions About AOL Instant Messenger, 6 pages, Jun. 24, 1999.
“AOL Instant Messenger”, reprinted from http://web.archive.org/web/20010721193059/http://aim.com/ (Way Back Machine—Available on Jul. 21, 2001) on Aug. 26, 2005, 7 pages.
“AOL technology, turning complicated things into a engaging services”, 1996 Annual Report, 22 pages.
“Benefits of Active Directory in a Windows 2000 Environment,” [online], Sep. 20, 2001 [retrieved on May 13, 2003]. Retrieved from the Internet, pp. 1-9.
“Directory Integration Can Lower Total Cost of Ownership and Increase Application Functionality,” [online], Jul. 27, 1998 [retrieved on May 13, 2003]. Retrieved from the Internet, pp. 1 of 4.
“Enterprise Identity Management with Windows 2000 and Active Directory,” [online], 1999 [retrieved on May 13, 2003]. Retrieved from the Internet <http://www.microsoft.com/technet/prodtechnol/ad/windows2000/evaluate/w2keims.asp?fra . . . , pp. 1-16.
“GLWebMail 2.0 is released!” http://www.gordano.com; available on Apr. 18, 2001, reprinted from http://web.archive.org/web/20010418153714//http://www.gordano.com, 2 pages.
“Idea for Online Networking Brings Two Entrepreneurs Together,” Patents: Idea for Online Networking Brings Two Entrepreneurs Together, reprinted from http://www.nytinnes.com/2003/12/01/technology/01patt.html?adxnnl+0&adxnnlx=107029 . . . , printed on Nov. 5, 2004 (3 pages).
“Integrating Applications with Windows 2000 and Active Directory,” [online], Oct. 2000 [retrieved on May 8, 2003]. Retrieved from the Internet, pp. 1-12.
“Integrating Microsoft Metadirectory Services and Active Directory,” [online], Aug. 31, 2000 [retrieved on May 13, 2003]. Retrieved from the Internet, p. 1.
“Introducing the Gordano Messaging Suite”; http://www.gordano.com; copyright 1994-2003, 2 pages.
“Look up contact information from an item,” Outlook 2000 SR-1 (9.0.0. 4527) Help File, on or before Aug. 10, 2001, p. 1.
“New Features in AOL Instant Messager for Windows V. 2.01 Beta”, 2 pages, Apr. 28, 1999.
“Part I: Active Directory Operations,” Active Directory Operations Guide, Microsoft Corporation, Microsoft Windows 2000, Version 1.5, pp. 1-187 (Dec. 5, 2002).
“Part II: Tasks and Procedures Appendices,” Active Directory Operations Guide, Microsoft Corporation, Microsoft Windows 2000, Version 1.5, pp. 1-131 (Dec. 5, 2002).
“Set up LDAP directory services,” Outlook 2000 SR-1 (9.0.0. 4527) Help File, on or before Aug. 10, 2001, p. 1.
“Social Sites Clicking With Investors,” Washingtonpost.com: Social Sites Clicking With Investors, reprinted from http://www.washingtonpost.com/ac2/wp-dyn/A32066-Nov. 12, 2003?language=printer printed on Nov. 5, 2004.
“Socialware: Multiagent Systems for Supporting Network Communities,” Hattori et al., Mar. 1999, Association for Computing Machinery, Communications of the ACM, vol. 42, Issue 3, pp. 55ff.
“The LP Wireless Messenger”, Messenger Documentation, [online]. LP Wireless, Inc., 2001 [retrieved on Nov. 2, 2002]. Retrieved from the Internet, http://lpwireless.com/messengerhelp.htm>, pp. 1-7.
“Using Active Directory Service”, from Chapter 5, Microsoft Windows 2000 Administrator's Pocket Consultant, by William R. Stank (1999). Retrieved from http://ww.microsoft.com/technet/prodtechnol/ad/windows2000/evaluate/05w2kadb.asp?fr . . . , pp. 1-6.
“What new about exchanging information over the internet,” Outlook 2000 SR-1 (9.0.0.4527) Help File, on or before Aug. 10, 2001, p. 1.
“Windows 2000 Directory Services,” [online], [retrieved on May 13, 2003]. Retrieved from the Internet, p. 1-2.
“Windows NetMeeting—Features”, [Online], Jun. 17, 1999, X002245623, Retrieved from the Internet: URL:http://www.microsoft.com/windows/NetMeeting/Features/default.ASP>, 8 pages.
“Working with Active Directory Domains”, from Chapter 5, Microsoft Windows 2000 Administrator's Pocket Consultant, by William R. Stank (1999). Retrieved from http://www.microsoft.com/technet/prodtechnol/ad/windows2000/evaluate/05w2kadb.asp?fr . . . , pp. 1-10.
“Yahoo! Messenger Makes the World a Little Smaller, More Informed”, 1 page, Jun. 21, 1999.
Alan Cohen, “Instant Messaging”, May 4, 1999, PC Magazine, PC Labs, 2 pages.
Anand Ranganathan et al., “ConChat: A Context-Aware Chat Program”, Jul.-Sep. 2002, Pervasive Computing, pp. 51-57.
Anonymous: “Push to Talk Services”, Internet Document, [Online], p. 1, Retrieved from the internet: URL:http://www.nextel.com/services/directconnect/ptt_overview.shtml, 1 page.
Anonymous: “The Internet—the Advent of New Forms of Communication”, Internet Document, [Online], pp. 1-4, Retrieved from the internet URL:http://www.journal.fujitsu.com/248e/e48now.htm, 3 pages.
Archive.org Archived copy of the Morpheus 1.9.1 download page on c-net Download.com [online] Jun. 20, 2002, Retrieved from the internet, URL:http://web.archive.org/web/20020803071751/download.com.com/3000-2166-10057840.html>, 2 pages.
Australian Office Action of Apr. 7, 2006, App. No. 2002340039 (2 pages).
BuddyGopher ˜We Love Away Messages!, “BuddyGopher simultaneously checks the away messages of your favorite AIM® buddies.”, available on Sep. 24, 2004, reprinted from http://web.archive.org/web/200400924104001/http://www.buddygopher.com/ on Sep. 28, 2005 (2 pgs).
BuddyGopher˜About, available on Jul. 13, 2004, reprinted from http://web.archive.org/web/20040713002836/www.buddygopher.com/about.html on Sep. 28, 2005 (3 pgs).
Canadian Office Action from Application Serial No. 2403520 dated Feb. 21, 2005, 2 pages.
Chinese Office Action dated Jul. 7, 2006, App. No. 02821420X (5 pages).
Courter et al., “Mastering Microsoft Outlook 2000 Premium Edition”, Sybex Inc., Alameda, California, Feb. 2000, pp. 167-169, ISBN 0-7821-2676-6.
Dodgeball.com:: mobile social software, “help: text messaging”, available on Oct. 13, 2004, reprinted from http://web.archive.org/web/20041013034241/www.dodgeball.com/social/help—text.php on Sep. 28, 2005 (3 pgs).
Dodgeball.com:: mobile social software, “help: the basics”, available on Oct. 9, 2004, reprinted from http://web.archive.org/web/20041009200739/www.dodgeball.com/social/help—basics.php on Sep. 28, 2005 (2 pgs).
Dodgeball.com:: mobile social software, “help: use it”, available on Oct. 9, 2004, reprinted from http://web.archive.org/web/20041009201853/www.dodgeball.com/social/help—useit.php on Sep. 28, 2005 (2 pgs).
Dodgeball.com:: mobile social software, “Hook up with friends. Discover what's around you”, available on Nov. 30, 2003, reprinted from http://web.archive.org/web/20041130034344/www.dodgeball.com/social/index.php on Sep. 28, 2005 (2 pgs).
Dutta-Roy Amitava, “Virtual Meetings with Desktop Conferencing”, IEEE Spectrum, vol. 35, No. 7, Jul. 1, 1998, pp. 47-56 and p. 66.
Eschenburg, WO laufen sie denn?, Oct. 26, 1998, pp. 92-95.
European Office Action in Application No. 01954931.0-2414, dated Jul. 14, 2008, 3 pages.
European Patent Office, Communication dated Aug. 30, 2005, App. No. 03731244.1-2416 (PCT/US0315715) 4 pages.
European Patent Office, Communication dated Aug. 31, 2009, App. No. 02778374.5-1238, 8 pages.
European Patent Office, Communication dated Sep. 5, 2006, App. No. 02778374.5-1238, 4 pages.
Home-tribe.net, http://washingtondc.tribe.net/message/24434d1b-817b-4580-aa42-3bffa15f26a?page=1 (4 total pages).
IBM “Configuring Sametime servers in your Domino environment” May 1, 2000 (14 pages).
International Search Report and Written Opinion issued for PCT Application No. PCT/US2005/042992, dated Mar. 6, 2007 914 pages).
International Search Report for International Application No. PCT/US03/15715, dated Aug. 14, 2003.
International Search Report issued in International Application No. EP03731244, dated Aug. 30, 2005, (4 pages).
International Search Report dated Apr. 11, 2003, App. No. PCT/US00/35160 (3 pages).
International Search Report dated Jan. 9, 2003, App. No. PCT/US02/30730 (4 pages).
International Search Report, Application Serial No. PCT/US2006/018286, dated Oct. 19, 2006, 12 pages.
Isaacs, Ellen: “Example UI Spec: Sound Instant Messages”, Internet Document, [online], pp. 1-2. Retrieved from the internet: URL:http://www.uidesigns.com/spec/d-sims.html [retrieved on Jun. 26, 2003].
J.C. Cannon, “Design Guide for Directory-Enabled Applications,” [online], Apr. 2001 [retrieved on May 13, 2003]. Retrieved from the Internet <http://msdn.microsoft.com/library/en-us/dnactdir/html/deal.asp?frame=true>, pp. 1-18.
Japanese Office Action dated May 12, 2008, App. No. 2003-533140 (7 pages).
Klaus Hartenstein et al., “xhtalk 2.9”, Nov. 1992, 6 pages.
Kohda et al., IMPP: A new Instant Messaging Standard and Its Impact on Internet Business, Dec. 2000, Fujitsu Sci. Tech. J., 36, 2 pgs. 147-153.
Lotus Sametime 1.5 Jul. 27, 1999 (4 pages).
Mariano, Gwendolyn. ZDNetNews, “Morpheus 1.9 to be unleashed”, [online] Jun. 10, 2002. Retrieved from internet URL: http;//news.zdnetcom/2100-3513_22-934615.htm, 6 pages.
Mary Beth Marklein, “Student have ‘away’ with words”, Mar. 28, 2004, USA RODAY, http://www.usatoday.com/tech/news/2004-03-28-aways-messages-usat—x.htnn, all pages.
Matsumoto, Tatsuro et al.: “Chocoa Communicator—A New Communication System based on Awareness and Text Communications—”, Fujitsu Sci. Tech. J., 36, 2, pp. 154-161, Dec. 2000.
Microsoft Corporation, “Active Directory Services Interface in the Microsoft Exchange 5.5 Environment,” [online], Nov. 1997 [retrieved on May 13, 2003]. Retrieved from the Internet <http://msdn.microsoft.com/library/en-us/dnactdir/html/msdn—adsiexch.asp?frame=true>, pp. 1-19.
Microsoft Corporation, “Comparing Microsoft Active Directory to Novell's NDS,” [online], Sep. 1998 [retrieved on May 13, 2003]. Retrieved from the Internet <http://msdn.microsoft.com/library/en-us/dnactdir/html/msdn—activedirvsnds.asp?frame=true>, pp. 1-26.
Microsoft Corporation, “Introduction to Active Directory Application Mode,” Microsoft Windows Server 2003, Aug. 2002, pp. 1-16.
Microsoft Corporation, “Using ADSI, LDAP, and Network Management Functions With Active Directory,” [online], Feb. 2002 [retrieved on May 13, 2003]. Retrieved from the Internet <http://msdn.microsoft.com/library/en-us/dnactdir/html/BuildingADApps.asp?frame=true>, pp. 1-13.
Mike Snider, “America goes online for New Year's bash”, USA Today, Jan. 3, 2000, 1 page.
Muller, Nathan, “Dial 1-800-Internet”: Feb. 1996, pp. 83-84, 86, 88.
Office Action dated approximately Feb. 29, 2006 for Japanese Patent Application No. 2002-515026 (6 pages).
Office Action of Canadian Application No. 2,462,037, dated Feb. 12, 2009, 8 pages.
PowWow (Mar. 1, 2000), Introduction, Retrieved Apr. 3, 2006 from website http://web.archive.org/web/20000301125635/ww2.tribal.com/help/online_docs/h205voic.html.
Pruitt, Scarlet. IDG News Service. “Morpheus Updates Peer-to-Peer Client” [online] Jun. 10, 2002, Retrieved from the internet URL:http://www.pcworld.com/article/id.101736/article.html, 3 pages.
Satter, Michael, excerpts from the Internet TV with CU-SeeMe, First Edition, including inside Title Page and Copyright Page; “Overview”; “Contents,” through pp. xii; Chapter 1, “Introduction to the Internet Videoconferencing and CU-SeeMe,” pp. 1-12; Chapter 4, “Hardware,” pp. 47-64; Chapter 5, “Software,” pp. 65-92: Chapter 6, “CU-SeeMe User's Guide,” pp. 93-121; Chapter 9, “Other Videoconferencing Technologies,” pp. 201-226; Chapter 10, “What the Future Holds,” pp. 227-233; Appendix A, “Troubleshooting Q&A,” pp. 235-249; published by Sams.net Publishing, 201 W. 103rd St., Indianapolis, IN 46290, International Standard Book No. 1-57521-006-1, Library of Congress Catalog Card No. 95-70178, copyright 1995.
Supplementary European Search Report issued in European Application No. EP05728303, dated Jan. 9, 2009, (2 pages).
Takashi Yoshino et al., “Namba: Location-Aware Collaboration System for Shopping and Meeting”, Aug. 2002, IEEE Transactions on Consumer Electronics, pp. 470-477.
Tribal Voice, PowWow Guided Tour—Step 6, PowWow personal communication. Http://web.archive.org/web/2000817094516/www.tribal.com/powwow/tour/step6.cfnn (Oct. 22, 1999), 2 pages.
Wayner, Peter, “Hey Baby, Call Me at My IP Address”, Apr. 1996, 3 pages.
WBWE (1998), PowWow 3.6 Brings the Power of Internet Community to the People, Business Wire, 2 pages.
William R. Stanek, Microsoft Windows 2000 Administrator's Pocket Consultant [online]. Microsoft Corporation, 1999 [retrieved on May 8, 2003]. Retrieved from the Internet <http://www.microsoft.com/technet/prodtechnol/ad/windows2000/evaluate/05w2kada.asp?fr . . . >, pp. 1-16.
Yubing Wang, Mark Claypool, Zheng Zuo. Video: An empirical study of realvideo performance across the internet. Proceedings of the 1st ACM SIGCOMM Workshop on the internet measurement IMW'01. Nov. 2001. ACM Press. 15 pages.
U.S. Appl. No. 09/810,159, Feb. 11, 2005, Office Action.
U.S. Appl. No. 09/810,159, Jun. 15, 2005, Office Action.
U.S. Appl. No. 09/810,159, Dec. 2, 2005, Office Action.
U.S. Appl. No. 09/810,159, Apr. 19, 2006, Office Action.
U.S. Appl. No. 09/810,159, Jan. 10, 2008, Examiner's Answer.
U.S. Appl. No. 09/810,159, Jan. 11, 2008, Office Action.
U.S. Appl. No. 09/810,159, Jan. 29, 2010, Office Action.
U.S. Appl. No. 09/843,788, Mar. 30, 2004, Office Action.
U.S. Appl. No. 09/843,788, Dec. 2, 2004, Office Action.
U.S. Appl. No. 09/843,788, Jul. 27, 2005, Office Action.
U.S. Appl. No. 09/843,788, Mar. 28, 2006, Office Action.
U.S. Appl. No. 09/843,788, Jun. 12, 2006, Office Action.
U.S. Appl. No. 09/843,788, Apr. 19, 2007, Office Action.
U.S. Appl. No. 09/843,788, Oct. 31, 2007, Office Action.
U.S. Appl. No. 09/843,788, Sep. 15, 2008, Office Action.
U.S. Appl. No. 09/843,788, May 5, 2010, Office Action.
U.S. Appl. No. 09/911,799, Oct. 5, 2004, Office Action.
U.S. Appl. No. 09/911,799, Apr. 29, 2005, Office Action.
U.S. Appl. No. 09/911,799, Nov. 17, 2005, Office Action.
U.S. Appl. No. 09/911,799, Aug. 11, 2006, Office Action.
U.S. Appl. No. 09/911,799, Jul. 3, 2007, Office Action.
U.S. Appl. No. 09/911,799, Dec. 1, 2008, Office Action.
U.S. Appl. No. 09/911,799, Mar. 18, 2009, Office Action.
U.S. Appl. No. 09/911,799, Mar. 18, 2010, Office Action.
U.S. Appl. No. 10/134,437, Nov. 1, 2005, Office Action.
U.S. Appl. No. 10/134,437, May 18, 2006, Office Action.
U.S. Appl. No. 10/134,437, Aug. 21, 2006, Advisory Action.
U.S. Appl. No. 10/134,437, Sep. 6, 2007, Miscellaneous Action.
U.S. Appl. No. 10/134,437, Feb. 11, 2008, Office Action.
U.S. Appl. No. 10/134,437, Sep. 18, 2008, Office Action.
U.S. Appl. No. 10/134,437, Mar. 10, 2009, Office Action.
U.S. Appl. No. 10/134,437, Oct. 2, 2009, Notice of Allowance.
U.S. Appl. No. 10/134,437, Nov. 17, 2009, Supplemental Notice of Allowability.
U.S. Appl. No. 10/146,814, May 17, 2002, Examiner's Answer.
U.S. Appl. No. 10/146,814, Sep. 20, 2005, Office Action.
U.S. Appl. No. 10/146,814, May 22, 2006, Office Action.
U.S. Appl. No. 10/146,814, Apr. 15, 2008, Office Action.
U.S. Appl. No. 10/146,814, Jan. 12, 2009, Office Action.
U.S. Appl. No. 10/146,814, Mar. 22, 2010, Office Action.
U.S. Appl. No. 10/184,002, Aug. 25, 2005, Office Action.
U.S. Appl. No. 10/184,002, Apr. 20, 2006, Office Action.
U.S. Appl. No. 10/184,002, Jan. 8, 2008, Office Action.
U.S. Appl. No. 10/184,002, Jul. 24, 2008, Office Action.
U.S. Appl. No. 10/747,623, Mar. 13, 2007, Office Action.
U.S. Appl. No. 10/747,623, Aug. 21, 2007, Office Action.
U.S. Appl. No. 10/747,623, Nov. 14, 2007, Office Action.
U.S. Appl. No. 10/747,623, Jun. 23, 2008, Office Action.
U.S. Appl. No. 10/747,624, Feb. 26, 2007, Office Action.
U.S. Appl. No. 10/747,624, Jul. 16, 2007, Office Action.
U.S. Appl. No. 10/747,624, Nov. 1, 2007, Office Action.
U.S. Appl. No. 10/747,679, Oct. 2, 2007, Office Action.
U.S. Appl. No. 10/747,679, Apr. 29, 2008, Office Action.
U.S. Appl. No. 10/981,460, Aug. 20, 2008, Office Action.
U.S. Appl. No. 11/015,424, Oct. 19, 2009, Office Action.
U.S. Appl. No. 11/150,180, Oct. 2, 2007, Office Action.
U.S. Appl. No. 11/150,180, Apr. 7, 2008, Office Action.
U.S. Appl. No. 11/150,180, Aug. 19, 2009, Office Action.
U.S. Appl. No. 11/237,718, Oct. 30, 2009, Office Action.
U.S. Appl. No. 11/237,718, Apr. 2, 2010, Notice of Allowance.
U.S. Appl. No. 11/238,130, Nov. 24, 2009, Office Action.
U.S. Appl. No. 12/336,880, Aug. 4, 2010, Office Action.
U.S. Appl. No. 12/765,045, Dec. 12, 2011, Office Action.
U.S. Appl. No. 12/765,045, Jul. 19, 2012, Office Action.
U.S. Appl. No. 12/765,045, Dec. 31, 2012, Office Action.
U.S. Appl. No. 12/765,045, Apr. 15, 2013, Office Action.
U.S. Appl. No. 12/852,769, Nov. 14, 2012, Office Action.
U.S. Appl. No. 12/852,769, Jul. 3, 2013, Office Action.
U.S. Appl. No. 12/852,769, Sep. 20, 2013, Notice of Allowance.
U.S. Appl. No. 13/620,921, Feb. 15, 2013, Office Action.
U.S. Appl. No. 13/620,921, Aug. 7, 2013, Office Action.
U.S. Appl. No. 13/619,312, filed Sep. 14, 2012, Appelman.
U.S. Appl. No. 13/619,364, filed Sep. 14, 2012, Appelman.
U.S. Appl. No. 13/619,397, filed Sep. 14, 2012, Appelman.
U.S. Appl. No. 14/049,069, filed Oct. 8, 2013, Appelman.
“AOL Instant Messenger All New Version 2.0 Quick Tips for Getting Started,” Jun. 24, 1999, 5 pages.
“Digital Artifacts for Remembering and Storytelling: Post History and Social Network Fragments,” Viegas et al., retrieved from the World Wide Web: http://we.media.mit.edul-fviegas/papers/posthistory _snf.pdf, (10 pages) 2004.
“File Transfer Preferences”, AOL Instant Messenger, version 5.1, Help Documentation, apparently available as of Nov. 21, 2002, 2 pages.
“Frequently Asked Questions About AOL Instant Messenger,” Jun. 24, 1999, 6 pages.
“The Gordano Messaging Server,” http://www.gordano.com, Copyright 1994-2003, Gordano, 3 pages.
“What is AOL Instant Messenger,” Jun. 24, 1999, 3 pages.
AOL Instant Messenger, available on Nov. 21, 2002, reprinted from http://web.archive.org/web/20021121031257/http:// aim.com on Aug. 31, 2005 (2 pages).
Hudson, Greg; Security in the Internet Message and Presence Protocols, http://mirrors.isc.org/pub/www.watersprings.org/pub/id/ draft-hudson-impp-security-00.txt; p. 6, section 7.2.2, first paragraph, p. 6 section 7.2.1, lines 1-2, Nov. 21, 2000.
M. Marvin, “Announce: Implementation of E-mail Spam Proposal”, news.admin.net-abuse.misc, Aug. 3, 1996, 2 pages.
International Search Report from International Application No. PCT/US03/41499, dated Oct. 27, 2004.
Supplementary European Search Report issued in European Application No. 05857099.5-1238/1836596 PCT/US2005045663, dated Nov. 7, 2008, (5 pages).
U.S. Appl. No. 10/746,230, Mar. 17, 2009, Office Action.
U.S. Appl. No. 10/746,230, Oct. 5, 2009, Office Action.
U.S. Appl. No. 10/746,230, Apr. 9, 2010, Notice of Allowance.
U.S. Appl. No. 10/746,230, Jan. 6, 2011, Notice of Allowance.
U.S. Appl. No. 10/746,232, Mar. 18, 2009, Office Action.
U.S. Appl. No. 10/746,232, Oct. 30, 2009, Office Action.
U.S. Appl. No. 10/746,232, Jun. 10, 2010, Notice of Allowance.
U.S. Appl. No. 10/746,232, Jan. 18, 2011, Notice of Allowance.
U.S. Appl. No. 11/015,476, Mar. 2, 2009, Office Action.
U.S. Appl. No. 11/079,522, Apr. 3, 2009, Office Action.
U.S. Appl. No. 11/079,522, Oct. 16, 2008, Office Action.
U.S. Appl. No. 11/782,461, Jan. 22, 2008, Office Action.
U.S. Appl. No. 11/782,461, Jul. 17, 2008, Office Action.
U.S. Appl. No. 11/782,461, Oct. 7, 2008, Notice of Allowance.
U.S. Appl. No. 12/349,161, Jun. 4, 2010, Office Action.
U.S. Appl. No. 12/349,161, Oct. 1, 2010, Office Action.
U.S. Appl. No. 12/349,161, Jan. 24, 2011, Notice of Allowance.
U.S. Appl. No. 13/093,147, Jul. 19, 2011, Office Action.
U.S. Appl. No. 13/093,147, Jan. 27, 2012, Notice of Allowance.
U.S. Appl. No. 10/334,142, Sep. 7, 2004, Office Action.
U.S. Appl. No. 10/334,142, May 4, 2005, Office Action.
U.S. Appl. No. 10/334,142, Dec. 6, 2005, Office Action.
U.S. Appl. No. 10/334,142, Jul. 7, 2006, Office Action.
U.S. Appl. No. 10/334,142, Dec. 29, 2006, Office Action.
U.S. Appl. No. 10/334,142, Apr. 18, 2007, Notice of Allowance.
U.S. Appl. No. 13/472,583, Dec. 6, 2012, Office Action.
U.S. Appl. No. 13/472,583, Jul. 1, 2013, Notice of Allowance.
U.S. Appl. No. 13/620,921, Dec. 20, 2013, Office Action.
U.S. Appl. No. 13/615,126, Jan. 4, 2016, Office Action.
U.S. Appl. No. 13/615,134, Nov. 19, 2015, Office Action.
U.S. Appl. No. 13/615,142, Nov. 19, 2015, Office Action.
U.S. Appl. No. 14/327,183, Jan. 20, 2016, Office Action.
U.S. Appl. No. 14/327,216, Feb. 16, 2016, Office Action.
U.S. Appl. No. 14/858,166, filed Sep. 18, 2015, Isaacs.
U.S. Appl. No. 14/323,601, Jul. 31, 2015, Office Action.
U.S. Appl. No. 14/326,383, Aug. 26, 2016, Office Action.
U.S. Appl. No. 14/327,164, Aug. 18, 2016, Office Action.
U.S. Appl. No. 14/327,183, Jul. 18, 2016, Office Action.
U.S. Appl. No. 14/327,216, Aug. 17, 2016, Office Action.
U.S. Appl. No. 14/327,226, Aug. 25, 2016, Notice of Allowance.
U.S. Appl. No. 14/554,563, Jun. 2, 2016, Notice of Allowance.
U.S. Appl. No. 14/858,166, Aug. 1, 2016, Office Action.
U.S. Appl. No. 14/319,898, Feb. 19, 2016, Office Action.
U.S. Appl. No. 14/323,601, Apr. 4, 2016, Notice of Allowance.
U.S. Appl. No. 14/327,164, Feb. 26, 2016, Office Action.
U.S. Appl. No. 14/327,202, Mar. 11, 2016, Office Action.
U.S. Appl. No. 14/328,525, Apr. 11, 2016, Office Action.
U.S. Appl. No. 14/327,226, Feb. 26, 2016, Office Action.
U.S. Appl. No. 14/554,563, Apr. 5, 2016, Office Action.
U.S. Appl. No. 14/858,166, Mar. 23, 2016, Office Action.
U.S. Appl. No. 13/615,126, Sep. 22, 2016, Office Action.
U.S. Appl. No. 13/615,134, Sep. 14, 2016, Notice of Allowance.
U.S. Appl. No. 13/615,142, Sep. 16, 2016, Notice of Allowance.
U.S. Appl. No. 14/327,202, Sep. 6, 2016, Office Action.
U.S. Appl. No. 14/328,525, Oct. 6, 2016, Office Action.
U.S. Appl. No. 13/615,126, Mar. 24, 2017, Notice of Allowance.
U.S. Appl. No. 14/326,383, Apr. 6, 2017, Notice of Allowance.
U.S. Appl. No. 14/327,183, Apr. 26, 2017, Notice of Allowance.
U.S. Appl. No. 14/858,166, Apr. 27, 2017, Notice of Allowance.
U.S. Appl. No. 14/326,407, Jun. 28, 2018, Office Action.
U.S. Appl. No. 14/327,164, Jun. 30, 2017, Notice of Allowance.
U.S. Appl. No. 14/328,525, Jul. 12, 2017, Notice of Allowance.
U.S. Appl. No. 14/326,407, dated Dec. 28, 2018, Office Action.
U.S. Appl. No. 15/676,835, dated Jan. 25, 2019, Office Action.
Related Publications (1)
Number Date Country
20130080529 A1 Mar 2013 US
Provisional Applications (2)
Number Date Country
60552718 Mar 2004 US
60549937 Mar 2004 US
Continuations (2)
Number Date Country
Parent 12765045 Apr 2010 US
Child 13618707 US
Parent 11015424 Dec 2004 US
Child 12765045 US