Associating multiple visibility profiles with a user of real-time communication system
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06F-015/16
G06F-015/173
G06F-015/177
출원번호
UP-0195233
(2008-08-20)
등록번호
US-7743099
(2010-07-12)
발명자
/ 주소
Szeto, Christopher
출원인 / 주소
Yahoo! Inc.
대리인 / 주소
Hickman Palermo Truong & Becker LLP
인용정보
피인용 횟수 :
12인용 특허 :
31
초록▼
Visibility profiles associated with a substantially real time messaging environment are disclosed. Additionally, techniques for managing visibility profiles are disclosed, which include automatically associating a first profile with a first situation, automatically associating a second profile with
Visibility profiles associated with a substantially real time messaging environment are disclosed. Additionally, techniques for managing visibility profiles are disclosed, which include automatically associating a first profile with a first situation, automatically associating a second profile with a second situation, and where the first and second profiles are associated with visibility. Visibility profiles may be used to manage the appearance of a user to other users/friends for communication using applications such as instant messaging, electronic mail, web-based mail programs, or other types of data communication exchange applications.
대표청구항▼
What is claimed is: 1. A method for managing visibility of a particular user in a messaging environment, comprising: associating a first visibility profile, of the particular user, with a first situation; wherein the first visibility profile indicates a first particular set of users; associating a
What is claimed is: 1. A method for managing visibility of a particular user in a messaging environment, comprising: associating a first visibility profile, of the particular user, with a first situation; wherein the first visibility profile indicates a first particular set of users; associating a second visibility profile, of the particular user, with a second situation that is different than the first situation; wherein the second visibility profile indicates a second particular set of users; while the first visibility profile and the second visibility profile remain stored: when the particular user is in the first situation, determining, based on the first visibility profile and not on the second visibility profile, a first set of one or more users that are allowed to view the particular user as available to communicate; when the particular user is in the second situation, determining, based on the second visibility profile and not on the first visibility profile, a second set of one or more users that are allowed to view the particular user as available to communicate; wherein the first set of users is different than the second set of users; wherein: the first particular set of users is the same as the first set of one or more users and the second particular set of users is the same as the second set of one or more users, or none of the users in the first particular set of users is the same as any of the users in the first set of one or more users and none of the users in the second particular set of users is the same as any of the users in the second set of one or more users; and storing, by at least one hardware processing unit, the first and second visibility profiles in a volatile or non-volatile non-transitory storage media. 2. The method of claim 1, wherein the first situation indicates at least one of the following: a particular time period in which the particular user is logged in to the real time messaging environment, a particular location in which the particular user is located, a particular device that the particular user is using, or a particular log-in that the particular user is using. 3. The method of claim 1, wherein the first visibility profile identifies at least a subset of the first set of one or more users. 4. The method of claim 1, wherein: the first visibility profile identifies one or more third users that are not allowed to view the particular user as available to communicate; and none of the one or more third users are in the first set of one or more users. 5. The method of claim 1, wherein the first visibility profile and the second visibility profile are stored on the same device. 6. The method of claim 1, further comprising, when the particular user is in the first situation: providing a visible state to a first user of the first set of users, wherein the visible state indicates, to the first user, that the particular user is available to communicate; providing an invisible state to a second user that is not in the first set of users, wherein the invisible state indicates, to the second user, that the particular user is not available to communicate. 7. The method of claim 1, wherein the messaging environment comprises at least one of instant messaging communication, mobile device communication, or electronic mail communication. 8. The method of claim 1, wherein the particular user is logged in as available to communicate when the particular user is in the first situation and the second situation. 9. The method of claim 1, wherein the particular user is logged in as not available to communicate when the particular user is in at least one of the first situation or the second situation. 10. The method of claim 1, further comprising: when the particular user is in the first situation, allowing at least a subset of the users in the first set to view the particular user as available to communicate; and when the particular user is in the second situation, allowing at least a subset of the users in the second set to view the particular user as available to communicate. 11. A method for managing visibility of a particular user in a messaging environment, the method comprising: storing, in association with the particular user, a first visibility profile that indicates a first particular set of one or more users with a first situation; storing, in association with the particular user, a second visibility profile that indicates a second particular set of one or more users with a second situation that is different than the first situation; while the first visibility profile and the second visibility profile remain stored: determining, based on the first visibility profile and not the second visibility profile, a first set of one or more users that are allowed to view the particular user as available to communicate; in response to a selection by the particular user, determining, based on the second visibility profile and not the first visibility profile, a second set of one or more users that are allowed to view the particular user as available to communicate; wherein the first set of users is different than the second set of users; wherein: the first particular set of users is the same as the first set of one or more users and the second particular set of users is the same as the second set of one or more users, or none of the users in the first particular set of users is the same as an y of the users in the first set of one or more users and none of the users in the second particular set of users is the same as any of the users in the second set of one or more users, and storing, by at least one hardware processing unit, the first visibility profile and the second visibility profile in a volatile or non-volatile non-transitory storage media. 12. The method of claim 11, wherein: in response to determining the first set of users, allowing at least a subset of the users in the first set to view the particular user as available to communicate; and in response to determining the second set of users, allowing at least a subset of the users in the second set to view the particular user as available to communicate. 13. The method of claim 11, wherein the first visibility profile identifies the first set of one or more users. 14. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 1. 15. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 2. 16. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 3. 17. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 4. 18. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 5. 19. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 6. 20. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 7. 21. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 8. 22. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 9. 23. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 10. 24. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 11. 25. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 12. 26. One or more non-transitory computer-readable storage media storing instructions which, when executed by one or more processors, cause the one or more processors to perform the steps recited in claim 13.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (31)
Aravamudan Murali ; Henrick Robert F. ; Sundar Rangamani ; Xikes Gregory James, Assignable associate priorities for user-definable instant messaging buddy groups.
Alexander, Geoffrey D.; Doss, J. Smith; Kovales, Renee M.; Ogle, David M.; Pozefsky, Diane P.; Sundstrom, Robert J., Calendar-driven application technique for preparing responses to incoming events.
Scully Keith J. (Austin TX) Singh Harinder S. (Boca Raton FL), Electronic calendaring method to establish calendar floating triggers for calendared events and processes.
Davis Bruce ; Ellis Michael Dean ; Knudson Edward Bruce ; Thomas William L., Electronic television program guide schedule system and method with pop-up hints.
Robinson, B. Alex; Carey, Charles A.; Longe, Michael; Parr, Joe, Facilitating instant messaging outside of user-defined buddy group in a wireless and non-wireless environment.
Parker, Benjamin J.; Werner, Shane R.; Diaz, Charles; Frederick, Terry M., Integration of video telephony with chat and instant messaging environments.
Cooperman, Hillel N.; Proteau, Stephen P.; Ligameri, Mark R.; De Bonte, Austina M.; McNamee, Kathleen B.; Van Dok, Cornelis K., Method and apparatus for providing an instant message notification.
Estrada,Julio; Estrada,Miguel A.; Hill,Charles Robert; Shalabi,Sami Mohammed; Shore,Maurice B., Method and system for designing a theme and associating it with a collaboration space user interface.
Lamb, Christopher H.; Petrack, Scott B.; Slaughter, III, Frank G.; Toga, James E., Methods and apparatus for providing communications services between connectionless and connection-oriented networks.
Lee, Juhnyoung; Kalagnanam, Jayant R.; Davenport, Andrew J.; Lee, Ho Soo, System and method for using virtual wish lists for assisting shopping over computer networks.
Bly Sara A. (Mountain View CA) Hodges Jeffrey D. (Newark CA) Kupfer Michael D. (Mountain View CA) Lewis Brian T. (Palo Alto CA) Tallan Michael L. (Mountain View CA) Tom Stephen B. (San Francisco CA), Updating local copy of shared data in a collaborative system.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.