Patent Grant
11075861
This invention relates generally to a network-based chat room system, and more particularly to an intelligent system and method for “paging” a chat room participant based upon information relating to that participant's characteristics.
A computer program listing Appendix is hereby incorporated-by-reference. The Appendix includes 86 files concurrently filed herewith as follows:
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.
The present invention is related to computer Chat Room systems or similar network-based systems providing services to network users, specifically, the automated process of paging a chatter or other network participant. In one embodiment the paging may result in a display of information related to one or more chatters within a Chat Room system. In a related embodiment, the paging may be an audio, visual or similar sensory cue which may or may not be associated with a visual display related to the other chatter.
Heretofore, a number of patents and publications have disclosed computer-based Chat Room systems, the relevant portions of which may be briefly summarized as follows:
U.S. Pat. No. 5,764,916 to Busey et al. for a “METHOD AND APPARATUS FOR REAL TIME COMMUNICATION OVER A COMPUTER NETWORK,” issued Jun. 9, 1998 is an exemplary representation of a Chat Room.
U.S. Pat. No. 5,828,839 to Moncreiff for a “COMPUTER NETWORK CHAT ROOM BASED ON CHANNEL BROADCASTS IN REAL TIME,” issued in Oct. 27, 1998 is directed to one or more Chat Rooms with the conversation being related to TV/Radio broadcasts of the chatters' preferences. The spirits of these inventions best capture the essence of the present-day Chat Room system; people conversing via a computer network designed to accommodate chatters with themed Chat Rooms for the purpose of initiating a common conversation. Traditionally, those chatting have had to type the conversation, however, Voice and Video communication technology is being introduced through Internet Portals using data compression methods similar to those described in U.S. Pat. No. 5,838,927 to Gillon et al., issued Nov. 17, 1998 for a “METHOD AND APPARATUS FOR COMPRESSING A CONTINUOUS, INDISTINCT DATA STREAM.”
WO 98/16045 to Goldfinger et al., PCT Publication of 16 Apr. 1998 for a “COMMUNICATIONS SYSTEM,” hereby incorporated by reference for its teachings, is directed to a communication network wherein users of the network can list “sought” users and the sought users are identified to the “seeking” user whenever they are “on-line.” The list of sought users must, however, have been predefined by the seeking user. The publication further describes in detail, aspects of such a system, wherein the user's are tracked or identified by an identifier or identification code, and the identifier is associated with the user's network address of the user's communication terminal.
Furthermore, various well-known Internet Portals (IPs) such as Yahoo.com, Excite.com, AOL.com have Chat Rooms systems with functionality beyond simple conversation (communication via typing on a keyboard or via voice chat). For example, these Internet portals employ Chat Rooms systems that provide additional functionality such as:
1. Search Engine—Many Chat Room systems provide search engines that enable a user to search for other chatters by inputting previously known chat name(s) and being presented with a list of where the desired chatter(s) are “chatting.” The user normally has previously encountered and conversed with the other chatter(s) and is simply looking for a chatters' chat name within the search engine archives to see if that person is currently logged into the Chat Room system. This information is valuable to a user, because it shows whether the other chatter(s) is available to chat in real-time. Usually, this functionality accompanies a display, providing a link that takes the user from the search engine interface screen directly to a Chat Room in the system. This is a completely proactive approach of finding friends.
2. Paging System—Several chat systems allow a chatter to keep a list of “friends” within the Chat Room system memory. When a chatter is logged into the Chat Room system, the Chat Room software will prompt or page the user upon detecting that one or more friends are logged in the chat system. A display of the chat name within the user's current Chat Room will appear notifying the user that the friend is logged into the system.
3. Profile—Many chat Room systems use a database to provide or display a list of characteristics of one chatter to another chatter. The characteristics, (the data) are provided to the Chat Room system by the chatters themselves. Commonly, chatters are given a set of questions to answer when first registering or logging into a Chat Room system. The answers to these questions are intended for display to other chatters. Criteria such as personal interests, hobbies, geographic location, age group, astrological information and sexual preferences are stored in a database and may subsequently be compiled into a list, which is revealed graphically, to other chatters in a visual display window should the other chatters choose to look at such a profile. The profile is commonly accessed by chatters using a computer mouse that enables the chatter to click a button and bring up another chatter's profile, where the button typically launches a new and separate display to the chatter revealing the profile.
4. Navigation within a Chat Room System—A chatter attends and moves to new Chat Rooms by clicking on a link that conveys to the computer Chat Room software (such as IRCD “Internet Relay Chat Daemon”) that the chatter wishes to move to the Room that Corresponds to the link. Within the Chat Room system, there are a multiple of rooms. Each room has a theme or topic for discussion. For example, there are rooms that have a politics theme. A chatter would click the appropriate link for the politics room in order to chat with others about politics.
Most Chat Room systems have functionality that allows a maximum number of chatters to chat in one room. For instance, the functionality may only allow up to twenty-five chatters to chat in one room at a time. This is a necessary limitation, as too much activity in a room may hinder the ability to comprehend or create fluidity in a conversation. Hypothetically, the theme of this room could be Politics. With this model, the Chat Room system software will automatically create a new room of the same theme (Politics) once the room reaches its limitation of 25 chatters within a room. This new room will accommodate any new chatters who wish to be in the Politics Room.
Perhaps more important is the fact that when a new chatroom is created, a user who enters later may not know that other chatters he/she is accustomed to seeing are already participating in a filled chat room. The current invention eliminates such problems by showing (or paging) a user with characteristics of another person who may be in the same chat system, but in another room.
For example, if there were 300,000 chatters that Yahoo has at any one time in the same room, there wouldn't be a need for paging, because one could see all of the characteristics that are shown in the room (Assuming that one has a visual display devise that will show all 300,000 chatters' names at once.) The limitation of the number of users in any particular chat room emphasize the advantages of a profile display or paging system as described herein.
Ultimately, the Chat Room systems are very similar. There are multiple rooms; each room has a theme, or topic to induce a common conversation. Each chatter has a fictitious name and a means of finding other chatters via a search engine. And lastly, they have a paging system that will display information to a chatter if a friend(s) should log into the Chat System during the time that the chatter is logged into the system himself. These Chat Room systems' style of communication is effective for initiating or guiding a common conversation. They are designed to unite chatters with the intent of creating conversation subject matter through themed rooms, such as politics, for the sake of a common conversation. It will be appreciated that the paging of “friends,” as provided by one aspect of the present invention, may not be important for inducing a conversation based on a themed room. However, the purpose of identifying the common paging process is that the pager in any other chat room is completely pro-active. Thus, a “friends” paging system only pages those who already know each other and functions only when the user enables or programs it to do so.
The aforementioned Chat Room functionality does not provide a way of introducing, prompting or paging unknown or non-“friends” chatters based upon either personality traits (including, for example, astrological sign) and/or geographic location. This functionality, however, is crucial for establishing lasting interpersonal relationships that extend beyond a Chat Room experience. Unfortunately, well-known Chat Room systems are not designed to unite chatters for the sake of creating new and meaningful interpersonal relationship with another chatter.
It is common knowledge, in the psychiatric community, that interpersonal relationships are most successful when the people involved have much in common. Examples of commonality include chatters having similar interests, such as a leisure time activity, or commonality of the area in which they live. Living within the same area or city accommodates a more likely chance that chatters will establish more involved relationships outside of the Chat Room system. However, there is no paging (or introduction) system that will alert a user should another unknown chatter, have favorable commonalities such as geographic area and common psychological traits; thereby matching people from all over the world that are logged into the Chat Room system.
Knowledge of being able to share in these common leisure time activities, with other chatters, and having commonalities in psychological traits assures the chatters of a greater chance of successful relationship. On this point, existing Chat Room systems are believed to be inferior because they are unable to alert, page, or otherwise notify a user that there is another chatter(s) that meets favorable requirements for a successful interpersonal relationship.
The present invention is, therefore, directed to a new system designed to unite chatters for the purpose of creating new interpersonal relationships. The system is referred to as an Intelligence Driven Paging Process (IDPP). The IDPP is a process that augments and adds functionality to the profile functionality of known Chat Room systems and provides a means for promoting or prompting communications between two or more individuals. The current and common profiling system only displays profile information to a user upon request, usually by clicking a link. Because the profile display process of conventional Chat Room systems is only initiated when a user requests the information, it can be seen as reactive. Once the buttoned is clicked, the Chat Room system launches a separate and new display for review, where the display depicts the profile information of only one chatter.
Conversely, one aspect of the IDPP is different in that it is proactive and automated; instead of waiting for a chatter to click a button to review a profile, the IDPP uses predetermined preferences to ascertain personal compatibility between chatters based upon profile information for each chatter logged into the Chat Room system. If the IDPP system determines that these preferences are favorable for interpersonal compatibility, the system will automatically notify or page the chatters to be introduced.
It will be further appreciated that a user may control the desirable profile characteristics that will be used to select chatters for display to the user. It will also be appreciated that the simple process of displaying a table, or similar visual representation, of chatter profile information in association with an ongoing chat session may prove, in and of itself, a valuable feature.
This novel paging process is further intended to solve the problem of overcrowded Chat Room systems. For example, large Internet Portals such as America Online and Yahoo may have hundreds or thousands of chatters within the system at any given time. It is impossible for a user to view every profile of the other chatters (via a link to a profile display) who were logged into the Chat Room system at that given time; people log in and out of the system randomly. Another aspect of the IDPP solves this problem due to its proactive, intelligence-driven paging process. More specifically, the IDPP may be employed to notify a user of other chatters' characteristics without having to click on links to find other chatters' profile information. The IDPP uses the profile information and preset compatibility preferences of all chatters that are logged into the Chat Room system in order to determine interpersonal compatibility. If the IDPP's system logic determines that two or more people are compatible (using Compatibility Criteria), the profile information may be automatically displayed. This saves chatters time by not requiring them to click on the profiles of every chatter within the system to determine the compatibility of said chatters.
The Compatibility Criteria used by the IDPP can be identified and determined by well-established psychological methods. The methods used may also be based upon identified commonality between chatters' personality traits and geographic location. Commonality includes that of psychological personality traits; such as the way chatters interact emotionally or the way chatters cognitively function. Any given information will suffice, however.
As will be appreciated by those knowledgeable in the area of psychiatry, there are myriad of methods to identify cognitive and emotional personality traits in order to create data for a Chat Room system to determine which chatters should be introduced to other chatters. These traits or data can be identified and saved into the Chat Room system memory. The data that is saved into the system memory can be used to compare such data to the archived data of all other chatters within the Chat Room system.
For example, the IDPP may use the results of standard industry personality typing tests such as the Myers, Briggs Personality Assessment Test or the Keirsey, Bates Temperament Sorter, another personality typing system, as used in Please Understand Me, Character and Temperament Types, published in 1978 by David Keirsey and Marilyn Bates. Additionally, Astrology, a controversial science spanning thousands of years, can be used to identify and describe such traits. These are only two examples of ways to determine and identify data of a chatter needed to compare with data of other chatters. Data required for comparison may be as simple as marital status (e.g., single and divorced chatters being identified as compatible), need for employment, religious preferences, or age.
As used herein, the processes are examples of ways that are intended to identify facets of a chatter's personality. It does not matter which system is used for identifying these facets, as the IDPP system will compare any and all data contained in chatters' profiles in order to page and Introduce two or more of said chatters.
In accordance with the present invention, there is provided a method for the automated display of human participant-specific data to a human participant of a network chat room, comprising the steps of: (a) collecting human participant customized data for a plurality of chat room participants; (b) storing, in memory, the human participant customized data collected, (c) sorting said human participant customized data from a plurality of chat room participants by participant-specified preferences; and (d) automatically displaying sorted human participant customized data to at least one participant in association with a network chat room.
In accordance with another aspect of the present invention, there is provided a method for determining the compatibility of at least two participants in a chat room, and for the automated paging of compatible participants, comprising the steps of: (a) collecting human participant customized data for a plurality of chat room participants; (b) storing, in memory, the human participant customized data collected; (c) sorting said human participant customized data from a plurality of chat room participants by participant-specified preferences; (d) automatically computing the compatibility of at least two human participants, and (e) paging the participants to indicate their compatibility.
In accordance with yet another aspect of the present invention, there is provided a method for automatically prompting compatible users in a network based upon a compatibility criteria, comprising the steps of: (a) collecting human participant customized data for a plurality of network users; (b) storing, in memory, the human participant customized data collected; (c) sorting said human participant customized data from a plurality of network users by participant-specified preferences; (d) automatically computing the compatibility of at least two network users using the predetermined criteria; and (e) paging the network users to indicate their compatibility.
In accordance with a further aspect of the present invention, there is provided a system for the automated display of human participant-specific data to a human participant of a network chat room, comprising: a computer network for collecting human participant customized data for a plurality of chat room participants; a database for storing, in a memory, the human participant customized data collected via the network; and a processor, associated with said network and with access to said database, for sorting said human participant customized data from a plurality of chat room participants using compatibility criteria, and automatically displaying at least a portion of the sorted human participant customized data to at least one participant in association with the network chat room.
The techniques described herein are advantageous because they significantly improve the functionality of traditional chat rooms, with little additional overhead. Moreover, the techniques provide to chat rooms, the opportunity to easily identify compatible chatters, avoiding the tedious process of manually reviewing chatters' profiles. As a result of the invention, it is believed that chat room and network participant satisfaction will increase as will the usage of chat rooms and networks that employ aspects of the present invention.
The present invention will be described in connection with a preferred embodiment, however, it will be understood that there is no intent to limit the invention to the embodiment described. On the contrary, the intent is to cover all alternatives, modifications, and equivalents as may be included within the spirit and scope of the invention as defined by the appended claims.
For a general understanding of the present invention, reference is made to the drawings. In the drawings, like reference numerals have been used throughout to designate identical elements. In describing the present invention, the following term(s) have been used in the description.
A “Chat Room system” is one or more networked computers implementing a Chat Room or multiple of chat rooms, and including various functions implemented therein such as search engines, memory archives containing chatters' profile information, voice and video transmission capability. Such system is at least, but not limited to the traditional chat room as described in U.S. Pat. No. 5,764,916 to Busey and Weghort (1996) and U.S. Pat. No. 5,838,927 to Gillon and McFadden (1996), and the network is understood to be a wired or wireless communication network.
A “chatter” or a “user” is a person participating or communicating within a computer Chat Room system, whether the person is actively or passively communicating.
“Voice chat” is chat communication via computer microphone and speakers using a computerized communication system as the medium. It is typically an added function in well-known Chat Room systems. As used herein, a “user” is the chatter who initiates an action or is the original chatter referred to in an explanation involving multiple chatters.
A “chat name” is generally a fictitious name chosen by a chatter to be used as guise in a Chat Room system.
A “link” is an Internet Address connector or a pointer, typically in an HTML document, that leads to another World Wide Web site, or to another place within the same document; also called a hyperlink. A link is activated by clicking on it or otherwise indicating a selection by a user.
“Friend” is a person who has created a relationship with another person (chatter or other network user). Usually, Chat Room systems allow a chatter to save another chatter's chat name in the Chat Room system memory. Once a chat name is saved into the Chat Room system memory, the system will display, to the user, whether or not the friend(s) are logged into the Chat Room system.
“Introduce” means the action of paging a user and displaying a link for certain chatter or chatters that will move these certain chatters into a common Chat Room or enabling them to chat in a common medium within the same Chat Room system. Introduce could also mean the display of characteristics to the parties involved, without communication actually being established, where the system could provide them a choice or prompt to engage.
Referring to
As is well-known, users of such chat rooms may also access profile information for other chatters by simply clicking a mouse or cursor-based pointing device on the chatters name. For example at chat rooms on http://chat.yahoo.com, clicking on a chatters chat name will produce a window or dialog box that allows the user to see the chatter's profile, send a personal message to the chatter, etc. Similarly, one or more chatters may be added to a user's “friends” list (associated with the user's information in the database stored on disk 32). A user may then check to see if friends are currently on-line or chatting in a particular room. Similarly, the system might notify the user when a friend has logged on to participate in the chat. Such a system is taught, as noted above by WO 98/16045 to Goldfinger et al., PCT Publication of 16 Apr. 1998 for a “COMMUNICATIONS SYSTEM,” and is hereby incorporated by reference for its teachings related to the implementation of such a system. The list of sought users of friends must, however, be predefined by the seeking user.
Turning next to
For example, to the right of chat window 104, the other chatters in a room are listed in a table or window region 110. Table 110 includes a left-most column 118 that shows the chatters name, and one or more columns to the right thereof that depict personal profile information that each chatter has entered about themselves. For example, in the Politics chat room of
Turning next to
In windows 112 and 114, the listings for each of the other chatters is reflected in a table format, where the table includes:
For example, in the chat room of
This novel prompting or paging process is further intended to solve the problem of overcrowded Chat Room systems. For example, large Internet Portals such as America Online and Yahoo may have hundreds or thousands of chatters within the system at any given time. It is impossible for a user to view every profile of the other chatters (via a link to a profile display) who were logged into the Chat Room system at that given time; people log in and out of the system randomly. More specifically, the IDPP may be employed to notify a user of other chatters' characteristics without having to click on links to find other chatters' profile information. If the IDPP's system logic determines that two or more people are compatible (using Compatibility Criteria), the profile information for the compatible chatter(s) may be automatically displayed. This saves chatters time by not requiring them to click on the profiles of every chatter within the system to determine the compatibility of said chatters.
The Compatibility Criteria used by the IDPP can be identified and determined by well-established psychological methods. The methods used may also be based upon identified commonality between chatters' personality traits and geographic location. Commonality includes that of psychological personality traits; such as the way chatters interact emotionally or the way chatters cognitively function. Any given information will suffice, however.
For example, compatibility may be determined from the answers that the user gave on a test (online or not) that determines a psychological profile such as the Myers Briggs Personality Test or the Keirsey Temperament Sorter. Such answers may show tendencies to voice emotions more or less than another person. As a further example, consider the personality traits of a first born child, which may provide compatibility for a youngest child in the sibling birth order because the first born since early childhood has grown in a “role” that provides certain emotional stabilities that the youngest child is used to receiving.
Another example would be where, as a result of data derived from a test, a person is labeled as one who tends to voice her emotions whenever they arise. She essentially wears her heart on her sleeve. Because of this trait, she should be matched with another person that has traits that allow him the patience to invariably listen to her at the pace in which she voices her emotions. They would be compatible because the combination of their personalities allows for a greater amount of self-expression than many other personality combinations would allow.
Although alternative methods and systems may be employed to implement the IDPP system, one embodiment includes improved chat host system software that is modified so as to continuously or periodically run one or more programs to (a) identify chatters and retrieve profile and compatibility metrics from a database, and (b) run a program to “calculate” the compatibility of at least one chatter with another chatter and return a score representing the compatibility. It will be appreciated that in a preferred embodiment, the compatibility calculations will be run for a plurality of chatters, preferably including all chatters that have opted to participate in the IDPP system.
In a particular alternative embodiment, one or more of the pieces of user profile data could be “set” or “selected” by a chatter as attributes that he/she might want to search for or use as an alternative to, or in association with, the compatibility criteria so as to further limit the chatters identified as compatible. In other words, using an example from
As will be appreciated by those knowledgeable in the area of psychiatry, there are myriad of methods to identify cognitive and emotional personality traits in order to create data for a Chat Room system to determine which chatters should be introduced to other chatters. These traits or data can be identified and saved into the Chat Room system memory. The data that is saved into the system memory can be used to compare such data to the archived data of all other chatters within the Chat Room system.
For example, the IDPP may use the results of standard industry personality typing tests such as the Myers, Briggs Personality Assessment Test or the Keirsey, Bates Temperament Sorter, another personality typing system, as used in “Please Understand Me, Character and Temperament Types,” published in 1978 & 1984 by David Keirsey and Marilyn Bates, particularly pages 4-13, the relevant portions of which are hereby incorporated by reference. Additionally, Astrology, a controversial science spanning thousands of years, can be used to identify and describe such traits. In the examples presented to this point, the threshold for compatibility has been a “match” (e.g., equals or opposites). However, it will also be appreciated that in various rankings, or combinations of compatibility criteria, a score or point system may be used, where compatibility is determined based upon the difference in points or score being within a predefined threshold. These are only two examples of ways to determine and identify data of a chatter needed to compare with data of other chatters. Data required for comparison may be as simple as marital status (e.g., single and divorced chatters being identified as compatible), religious preferences, or age.
As used herein, the processes are examples of ways that are intended to identify facets of a chatter's personality. It does not matter which system is used for identifying these facets, as the IDPP system may compare some or all data contained in chatters' profiles in order to page and introduce two or more of said chatters. For example, as depicted in
Software or firmware that may be used to direct and store data within the database files on server host 30 (e.g., disk 32) may include database software such as Microsoft SQL (database software) and Microsoft Visual Basic (programming software). Other programs may be used to direct and store such personal data as described above. These other programs may be Oracle database software and C++, Java Applets, and similar software to direct the data to its intended locale. The protocol for the networked computers to communicate with each other may be the industry standard IP (Internet Protocol). The networked computers may also use TCP/IP, another industry standard for network communications. Lastly, a chat room software such as iChat™ or IRCD (an industry standard) may be required to create a chat room in which human participants interact, and to which the various improvements and enhancements may be added.
Ultimately, the various components required to implement at least one embodiment of the present invention include:
1. Computer (or server) that is connected to at least one other computer via IP, TCP/IP or another computer network protocol. 2. A software database such as SQL or Oracle that is capable of storing said human specific data. 3. Programming software that can work in conjunction with the software database that is used to direct data for display to human participants within the chat room network. 4. Chat room software that enables human participants to communicate in real-time via the network protocol such as iChat™ or IRCD.
With respect to the collection of human participant defined, human specific data may, various means may be employed to accomplish the data collection, including but not limited to:
In yet another embodiment, the present invention contemplates the use of e-mail to notify a chatter of other compatible chatters. As described above, the IDPP system is directed to an invitation to communicate between real-time chatters. The IDPP pages or otherwise notifies users of compatible chatters (based upon profile information) within a chat room. This alternative embodiment further extends that function with e-mail. Ultimately, users of a chat room system may be paged, notifying a user that another person that he/she should be introduced to is either in the chat room, or is on-line and available to go to the chat room in order to converse.
There are believed to be at least two scenarios where this process would work:
Scenario 2. In this scenario, depicted in
In a further alternative embodiment, chatters that should be introduced based upon compatibility determined according to the IDPP system described above may be alerted to this fact via an e-mail generated by the chat room system. More specifically, the chat room will allow the chatter to indicate one or more local establishments where the chatter will be on a particular day or at a particular time (e.g., nightclub, restaurant, bar, coffee house, grocery store, etc.). In particular, there will be a place for chatters to indicate which establishments they will go to in their city on a particular evening. If the two should meet (due to the natural functionality of the IDPP indicating compatibility and a common establishment/time), the IDPP will e-mail both chatters (either a digital page to their phone or regular e-mail) letting them know that the other will be there.
Yet another alternative embodiment is depicted in
As a more specific example, consider a User A, having device 42a, who is traveling on business and plans to stop by her parents home. The location of User A is periodically or continuously monitored, and when it is determined that A is at or near the parent's home, as indicated by coordinates associated with the “Mom & Dad's House” record in database table 212, User B might be paged as he was trying to contact A when she arrived.
Alternatively, the positioning information may be used to evaluate compatibility based not only on “family” membership, but also on the proximity of two or more family members. Using the “**nearby**” setting in the database (a programmable function that allows users to specify the level of proximity (e.g., 100 feet, ¼ mile, same city, etc.)) the system would notify the members (User A and User B) when they were nearby. Here again, notification may be accomplished by a paging signal (pager), an automatic call (cell phone) or similar means (PDA & computers) for example as depicted in the interface of the PDA shown in
It will be further appreciated that a user may be a member of more than one family, or that “families” have subsets or alternative familiar places that may be selected by one or more users. Also, two users may be considered to be members of a “family” based solely upon compatible characteristics as previously described with respect to IDPP, even though the parties involved may not actually know one another. As a result of an aspect of this invention, it is thus conceivable that a first chatter in the bar may introduce himself to another person in the same bar as a result of a prompt or page based upon information provided as part of a profile.
Moreover, the present invention contemplates the application of the IDPP technology to a cellular phone, PDA or other wireless communication technology. Accordingly, this application does not necessarily have to include a chat room, but use of the IDPP capability may be provided to any network subscriber, where the application is geared towards the paging process for direct communication (talking directly to a person after the person is identified with the paging process).
In recapitulation, the present invention is a method and system for using predetermined preferences/characteristics to ascertain personal compatibility between chat room or other network participants. When the system determines that these preferences are favorable for interpersonal compatibility, the system will automatically notify or page the chatters so as to facilitate their introduction, either on-line or personally. Further functionality, aside from the compatibility based upon profile information, includes e-mail and other electronic notification of personal compatibility as well as geographic compatibility.
It is, therefore, apparent that there has been provided, in accordance with the present invention, a method and apparatus for a network-based chat room system, and more particularly to an intelligent system and method for “paging” a chat room participant based upon information relating to that participant's characteristics. While this invention has been described in conjunction with preferred embodiments thereof, it is evident that many alternatives, modifications, and variations will be apparent to those skilled in the art. Accordingly, it is intended to embrace all such alternatives, modifications and variations that fall within the spirit and broad scope of the appended claims.
This application is a continuation of, and claims priority from, U.S. patent application Ser. No. 15/242,538 for “SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS” by Benjamin D. Baker filed Aug. 21, 2016, which is a continuation of U.S. patent application Ser. No. 14/560,108 for “SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS” by Benjamin D. Baker filed Dec. 4, 2014, which is a continuation of U.S. patent application Ser. No. 13/854,983 (U.S. Pat. No. 8,930,406) for “SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS” by Benjamin D. Baker filed Apr. 2, 2013, which is a continuation of U.S. patent application Ser. No. 13/018,344 (U.S. Pat. No. 8,417,729) for “SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS” by Benjamin D. Baker filed Jan. 31, 2011, which is a continuation of U.S. patent application Ser. No. 12/021,374 (U.S. Pat. No. 7,885,977) for a SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS,” by Benjamin D. Baker, filed Jan. 29, 2008, which is a continuation of, and claims priority from, U.S. patent application No. Ser. No. 09/793,364, (U.S. Pat. No. 7,401,098) for a “SYSTEM AND METHOD FOR THE AUTOMATED NOTIFICATION OF COMPATIBILITY BETWEEN REAL-TIME NETWORK PARTICIPANTS,” by Benjamin D. Baker, filed Feb. 26, 2001, and further claims priority from Provisional Application No. 60/185,858, filed Feb. 29, 2000 for an “INTELLIGENCE DRIVEN PAGING PROCESS USED IN AN INTERNET CHATROOM,” by Benjamin D. Baker, all of which are hereby incorporated by reference in their entirety for their teachings, including all computer program listing appendices.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4483680 | Daly | Nov 1984 | A |
| 4917380 | Kojima | Apr 1990 | A |
| 5086394 | Shapira | Feb 1992 | A |
| 5613205 | Dufour | Mar 1997 | A |
| 5625818 | Zarmer et al. | Apr 1997 | A |
| 5659731 | Gustafson | Aug 1997 | A |
| 5764916 | Busey et al. | Jun 1998 | A |
| 5775695 | Byers | Jul 1998 | A |
| 5793365 | Tang et al. | Aug 1998 | A |
| 5794210 | Goldhaber et al. | Aug 1998 | A |
| 5796395 | de Hond | Aug 1998 | A |
| 5813006 | Polnerow et al. | Sep 1998 | A |
| 5828839 | Moncreiff | Oct 1998 | A |
| 5838927 | Gillon et al. | Nov 1998 | A |
| 5872850 | Klein et al. | Feb 1999 | A |
| 5880731 | Liles et al. | Mar 1999 | A |
| 5913212 | Sutcliffe et al. | Jun 1999 | A |
| 5950200 | Sudai et al. | Sep 1999 | A |
| 5952959 | Norris | Sep 1999 | A |
| 5963951 | Collins | Oct 1999 | A |
| 6022002 | Niggli | Feb 2000 | A |
| 6041311 | Chislenko et al. | Mar 2000 | A |
| 6052122 | Sutcliffe et al. | Apr 2000 | A |
| 6058387 | Sutcliffe et al. | May 2000 | A |
| 6061716 | Moncreiff | May 2000 | A |
| 6073105 | Sutcliffe et al. | Jun 2000 | A |
| 6073138 | de I'Etraz et al. | Jun 2000 | A |
| 6081830 | Schindler | Jun 2000 | A |
| 6167395 | Beck et al. | Dec 2000 | A |
| 6181736 | McLaughlin et al. | Jan 2001 | B1 |
| 6212548 | DeSimone et al. | Apr 2001 | B1 |
| 6249282 | Sutcliffe et al. | Jun 2001 | B1 |
| 6249806 | Kohda et al. | Jun 2001 | B1 |
| 6263212 | Ross et al. | Jul 2001 | B1 |
| 6272487 | Durand et al. | Aug 2001 | B1 |
| 6299139 | Kazerooni | Oct 2001 | B1 |
| 6363352 | Dailey et al. | Mar 2002 | B1 |
| 6386513 | Kazerooni | May 2002 | B1 |
| 6425012 | Trovato et al. | Jul 2002 | B1 |
| 6480885 | Olivier | Nov 2002 | B1 |
| 6490601 | Markus et al. | Dec 2002 | B1 |
| 6513036 | Fruensgaard et al. | Jan 2003 | B2 |
| 6519771 | Zenith | Feb 2003 | B1 |
| 6542882 | Smith | Apr 2003 | B1 |
| 6549788 | Fraccaroli | Apr 2003 | B1 |
| 6559883 | Megiddo | May 2003 | B1 |
| 6622990 | Kazerooni | Sep 2003 | B2 |
| 6708172 | Wong et al. | Mar 2004 | B1 |
| 6735588 | Buckwalter et al. | May 2004 | B2 |
| 6760731 | Huff | Jul 2004 | B2 |
| 6941317 | Chamberlin et al. | Sep 2005 | B1 |
| 6974044 | Munnekehoff | Dec 2005 | B1 |
| 7006616 | Christofferson et al. | Feb 2006 | B1 |
| 7278921 | Fujisawa | Oct 2007 | B1 |
| 7401098 | Baker | Jul 2008 | B2 |
| 7885977 | Baker | Feb 2011 | B2 |
| 20030014485 | Banatwala | Jan 2003 | A1 |
| 20030093405 | Mayer | May 2003 | A1 |
| 20060067500 | Christofferson et al. | Mar 2006 | A1 |
| 20060167944 | Baker | Jul 2006 | A1 |
| Number | Date | Country |
|---|---|---|
| 2001243275 | Feb 2001 | AU |
| 2419428 | Jun 2001 | CA |
| 2400123 | Aug 2008 | CA |
| 60129795 | Jun 2008 | DE |
| 1259869 | Feb 2007 | EP |
| WO1998016045 | Apr 1998 | WO |
| WO2000016209 | Mar 2000 | WO |
| WO2001028171 | Apr 2001 | WO |
| WO2001065334 | Sep 2001 | WO |
| WO2001072020 | Sep 2001 | WO |
| WO2001097541 | Dec 2001 | WO |
| WO2001098856 | Dec 2001 | WO |
| WO2002001823 | Jan 2002 | WO |
| WO2002013053 | Feb 2002 | WO |
| WO2002013054 | Feb 2002 | WO |
| WO2002028125 | Apr 2002 | WO |
| WO2002029506 | Apr 2002 | WO |
| WO2002062092 | Aug 2002 | WO |
| WO2002064488 | Aug 2002 | WO |
| Entry |
|---|
| “Fisch sucht Fahrrad” CT, Online! vol. 18; 1999; pp. 1-3, XPO02332437; www.heise.de.ct/99/18/068. Jun. 5, 2005. |
| “Adding Names to Your Buddy List,” Netscape, (http://wp.netscape.com/support/books/netcenter/044000138.htm) Mar. 7, 2007. |
| “Creating a Personality,” Netscape, (http://wp.netscape.com/support/books/netcenter/044000139.htm) Mar. 7, 2007. |
| “Editing Your Options,” Netscape, (http://wp.netscape.corn/support/books/netcenter/044000140.htm) Mar. 7, 2007. |
| “Sending Instant Messages,” Netscape, (http://wp.netscape.com/support/books/netcenter/044000141.htm) Mar. 7, 2007. |
| “Chatting with Buddy Chat,” Netscape, (http://wp.netscape.cornisupport/books/netcenter/044000142.htm) Mar. 7, 2007. |
| Newsroom (press release), Time Warner, (http://www.timewarner.com/corp/newsroom/pr/0,20812.666482,00.htm l) Mar. 7, 2007. |
| Mark S. Acherman et al., Social Activity Indicators for Groupware, 1996, IEEE, 37-42. Jun. 30, 1996. |
| Timothy W. Bickmore et al., Animated Autonomous Personal Representatives, 1998, ACM, 8-15. Dec. 12, 2007. |
| Kiersey, D; Bates, M.; Please Understand Me; 1984; pp. 4-13. Prometheus Nemesis Book Co., Del Mar, Callifomia Jan. 1, 1994. |
| Udate; Udate,com, “Who's Online” ;Oct. 31, 2002; Oct. 31, 2002. |
| An unofficial prosecution history for Australian Patent AU2001243275 corresponding to U.S. Pat. No. 7,401,098, Feb. 26, 2001. Jul. 15, 2008. |
| An unofficial prosecution history for Canadian Patent CA2400123 corresponding to U.S. Pat. No. 7,401,098, Aug. 12, 2008. Jul. 15, 2008. |
| An unofficial prosecution history of European Patent EP1259869 corresponding to U.S. Pat. No. 7,401,098, Jun. 12, 2008. Jul. 15, 2008. |
| International Search report & Written Opinion for International Application PCT/US01/06023, corresponding to U.S. Pat. No. 7,401,098. dated Jul. 31, 2001. |
| Mathews, T.J.; Operation Match; The Harvard Crimson-Online Edition; Pub. Nov. 2, 1965 Nov. 3, 1965. |
| Meyer, C.A.; The Computer Personals: Meeting Your Match Online; Link-Up Communications and the Small computer, vol. 1, No. 10, Jul. 1984 Jul. 1, 1984. |
| Operation Match; Compatibility Research, Inc.; 872 Massachusetts Ave, Cambridge, MA Jan. 1, 1996. |
| OperationMatchlsHere; The Tech; The Bulletin Board, p. 12; Oct. 13, 1965 Oct. 31, 1965. |
| Scharlott et al.; Overcoming Relationship Initiation Barrieres: The Impact of a Computer-Dating System on Sec Role, Shyness, and Appearance Inhibitions; Computers in Human Behavior; vol. 11, No. 2, pp. 191-204; 1995 Elsevier Science Ltd. Jan. 1, 1995. |
| Brown; The Originals Matching them up; harvardmagaine.com online 030386html Jan. 1, 1965. |
| Zelitchenko, A.I.; Information Retrieval Expert System “Matchmaker”; Moscow State University; Computers in Human Behavior; vol. 8, pp. 281-296; 1992 Pergamon Press Ltd. Jan. 1, 1992. |
| An unofficial File History of U.S. Pat. No. 7,401,098 Jul. 14, 2010. |
| An unofficial U.S. Appl. No. 60/185,858 Jul. 14, 2010. |
| An unofficial file history of U.S. Appl. No. 11/328,428 Jul. 14, 2001. |
| U.S. Appl. No. 90/010,360 Re-Examination PA Exhibits Oct. 8, 2009. |
| Weverka, P.; Taylor, M.; ICQ for Dummies; IDG Books Worldwide, Inc., Foster City, CA 94404, c.1999; pp. 69, 71, 72, 73, 74, 105, 106 (Total pp. 9, including cover and copyright pgs.) Jan. 1, 1999. |
| Re U.S. Pat. No. 7,401,098 etc.—Defendant Responses to First Set of Interrogatories dated Sep. 26, 2011 Sep. 26, 2011. |
| Re U.S. Pat. No. 7,401,098 etc.—Defendant Responses to First Set of Interrogatories dated Sep. 26, 2011 _ Exhibit A Sep. 26, 2011. |
| Re U.S. Pat. No. 7,401,098 etc.—Defendant Responses to First Set of Interrogatories dated Sep. 26, 2011 _ Exhibit B Sep. 26, 2011. |
| Re U.S. Pat. No. 7,401,098 etc.—Defendant Responses to First Set of Interrogatories dated Sep. 26, 2011 _ Exhibit C Sep. 26, 2011. |
| Re U.S. Pat. No. 7,401,098 etc.—Plaintiff Markham brief dated Jan. 17, 2012 Jan. 17, 2012. |
| Re U.S. Pat. No. 7,401,098 etc.—Defendant Markham Reply Claims Construction dated Jan. 31, 2012 Jan. 31, 2012. |
| Re U.S. Pat. No. 7,401,098 etc.—Plaintiff Markham Reply Brief dated Feb. 17, 2012 Feb. 17, 2012. |
| David Vronay et al., Alternative interfaces for chat, Nov. 1999, ACM, 19-26. Nov. 1, 1999. |
| Nurmela et al., Evaluating CSCL log files by social network analysis, 1999, ACM, 12 pages. Jan. 1, 1999. |
| An unofficial File History of U.S. Appl. No. 90/010,360 in Re-examination of U.S. Pat. No. 7,404,098 issued Jul. 15, 2008; U.S. Appl. No. 09/793,364, filed Feb. 26, 2001; published as US 2001/0048449 A1, Inventor: Benjamin D. Baker. Jul. 15, 2008. |
| An unofficial File History of U.S. Pat. No. 7,885,977 issued Feb. 28, 2011; U.S. Appl. No. 12/021,374, filed Jan. 29, 2008; published Aug. 21, 2008 as US 2008/0201425 A1; Inventor: Benjamin D. Baker Feb. 28, 2011. |
| Leonard N. Foner, Yenta: A Multi-Agent, Referral-Based Matchmaking System, MIT Media, Lab, 7 pages. Dec. 11, 2012. |
| Delaware District Court Memorandum, Jedi Technologies, Inc. v Spark Networks, Inc. et al., Case 1:16-cv-01055-GMS, Document #35 Aug. 3, 2017. |
| Delaware District Court Order, Jedi Technologies, Inc. v Spark Networks, Inc. et al., Case 1:16-cv-01055-GMS, Document #36 Aug. 3, 2017. |
| Unofficial U.S. Appl. No. 60/139,616 Jun. 17, 1999. |
| Number | Date | Country | |
|---|---|---|---|
| 20190166072 A1 | May 2019 | US |
| Number | Date | Country | |
|---|---|---|---|
| 60185858 | Feb 2000 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15242538 | Aug 2016 | US |
| Child | 16199907 | US | |
| Parent | 14560108 | Dec 2014 | US |
| Child | 15242538 | US | |
| Parent | 13854983 | Apr 2013 | US |
| Child | 14560108 | US | |
| Parent | 13018344 | Jan 2011 | US |
| Child | 13854983 | US | |
| Parent | 12021374 | Jan 2008 | US |
| Child | 13018344 | US | |
| Parent | 09793364 | Feb 2001 | US |
| Child | 12021374 | US |
