Human relationships registering system and device for registering human relationships, program for registering human relationships, and medium storing human relationships registering program and readable by computer

Abstract

To provide a human relationships registering system, a method and a server for registering human relationships, a program for registering human relationships, and a medium storing human relationships registering program and readable by a computer, all of which are used to establish wide and close relationships with members having a variety of occupations or engaged in various technical fields and to obtain expert knowledge or information. The human relationships registering system comprises first data processing units 2 and 3 including sections for receiving personal data of a new member, and a second data processing unit including a section for storing the received personal data. The second data processing unit stores the personal data of the new member in correlation to an existing member when the existing member confirms the new member.

Claims

1. An apparatus including a server coupled to a communication network and configured to establish and update relationships between members registered to a relationships registering system coupled to the communication network, the apparatus comprising: a database configured to store personal attribute information of the members and direct relationship data indicating a direct relationship between at least some of the members; a message communicator configured to communicate via the communication network a relationship request from a first member to another member indicating that the first member wishes to establish a direct relationship with the another member; and a relationship identifier configured to search the database specifically for one or more introducing members that are directly related to both the first member and a second member, and communicate to the first member via the communication network at least a portion of the personal attribute information of at least a subset of the one or more introducing members, wherein the personal attribute information of the first member stored in the database is configured to be updated by the first member, and the personal attribute information of the second member stored in the database is configured to be updated by the second member.

2. An apparatus configured to administer relationship information of registered members, the apparatus comprising: storage configured to store identification information of the registered members; and circuitry configured to communicate a relationship request from a first member of the registered members to a second member of the registered members indicating that the first member wishes to establish a direct relationship with the second member; communicate a relationship acceptance from the second member to the first member indicating acceptance of the relationship request; determine relationship coefficients corresponding to relationship information concerning the first member or the second member; retrieve from the storage the identification information of a set of the registered members based on the relationship information in response to a first search request; and transmit the identification information of the set of registered members in response to the first search request.

3. The apparatus of claim 2, wherein the relationship coefficient between the second member and each of the set of registered members is greater than a predetermined threshold.

4. The apparatus of claim 2, wherein, when determining the relationship coefficients, the circuitry is further configured to set a relationship coefficient indicating a degree of relationship between two of the registered members to a first value when the two of the registered members have a direct relationship; and set the relationship coefficient indicating the degree of relationship between the two of the registered members to a second value when the two of the registered members do not have a direct relationship, and each of the two registered members has a direct relationship with a common member of the registered members, the second value being less than the first value.

5. The apparatus of claim 4, wherein the second value is half of the first value.

6. The apparatus of claim 4, wherein, when determining the relationship coefficients, the circuitry is further configured to set the relationship coefficient indicating the degree of relationship between the two of the registered members to a third value when the two of the registered members do not have a direct relationship, and each of the two registered members has a direct relationship with respective one of another two of the registered members that have a direct relationship, the third value being less than the second value.

7. The apparatus of claim 6, wherein the third value is half of the second value.

8. The apparatus of claim 2, wherein the circuitry is further configured to identify from the storage an introducing member of the registered members in response to a second search request requesting the introducing member for two of the registered members, the two of the registered members not having a direct relationship, and each of the two registered members having a direct relationship with the introducing member of the registered members.

9. The apparatus of claim 8, wherein identifying the introducing member of the registered members is performed based on searching for one or more key words in personal attribute information of the registered members stored in the storage.

10. A method for administering relationship information of registered members, the method comprising: communicating, by an apparatus, a relationship request from a first member of the registered members to a second member of the registered members indicating that the first member wishes to establish a direct relationship with the second member; communicating, by the apparatus, a relationship acceptance from the second member to the first member indicating acceptance of the relationship request; determining relationship coefficients corresponding to relationship information concerning the first member or the second member; retrieving from storage identification information of a set of the registered members based on the relationship information in response to a first search request; and transmitting the identification information of the set of registered members in response to the first search request.

11. The method of claim 10, wherein the relationship coefficient between the second member and each of the set of registered members is greater than a predetermined threshold.

12. The method of claim 10, wherein determining the relationship coefficients comprises: setting a relationship coefficient indicating a degree of relationship between two of the registered members to a first value when the two of the registered members have a direct relationship; and setting the relationship coefficient indicating the degree of relationship between the two of the registered members to a second value when the two of the registered members do not have a direct relationship, and each of the two registered members has a direct relationship with a common member of the registered members, the second value being less than the first value.

13. The method of claim 12, wherein the second value is half of the first value.

14. The method of claim 12, wherein determining the relationship coefficients comprises: setting the relationship coefficient indicating the degree of relationship between the two of the registered members to a third value when the two of the registered members do not have a direct relationship, and each of the two registered members has a direct relationship with respective one of another two of the registered members that have a direct relationship, the third value being less than the second value.

15. The method of claim 14, wherein the third value being half of the second value.

16. The method of claim 10, further comprising: identifying from the storage an introducing member of the registered members in response to a second search request requesting the introducing member for two of the registered members, the two of the registered members not having a direct relationship, and each of the two registered members having a direct relationship with the introducing member of the registered members.

17. The method of claim 16, wherein identifying the introducing member of the registered members is performed based on searching for one or more key words in personal attribute information of the registered members stored in the storage.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

(1) A more complete appreciation of the invention and many of the attendant advantages thereof will be readily obtained as the same becomes better understood by reference to the following detailed description when considered in connection with the accompanying drawings, wherein:

(2) FIG. 1 schematically shows how a human relationships registering system is constituted via a general communication line such as an Internet.

(3) FIG. 2 is a schematic human relationships diagram created by the human relationships registering system.

(4) FIG. 3 shows an example of a Web page used for entering the Web site offered by the human relationships registering system.

(5) FIG. 4 shows an example of Web page used for registering a personal data of a new member at the human relationships registering system.

(6) FIG. 5 shows an example of a Web page that an existing member uses for confirming a personal data of a new member.

(7) FIG. 6 shows an example of Web page used for retrieving data in the human relationships registering system.

(8) FIG. 7 shows an example of a Web page used for indicating retrieved data.

(9) FIG. 8 is another schematic human relationships diagram created by the human relationships registering system.

(10) FIG. 9 is a graph showing relationships coefficient between members which are stored in the server 1.

(11) FIG. 10 shows an example of personal data stored in the server 1.

DESCRIPTION OF REFERENCE NUMERALS

(12) 2, 3 personal computers as first data processing units 1 server as a second data processing unit 4 Internet

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

(13) Referring now to the drawings, wherein like reference numerals designate identical or corresponding parts throughout the several views.

(14) The invention will be described with respect to a human relationships registering system shown in the accompanying drawings. FIG. 1 schematically shows that this system is constituted using the Internet.

(15) Referring to FIG. 1, members are accessible via the Internet 4 to a server 1 as a second data processing unit from their personal computers 2 and 3 as first data processing units. Each personal computer comprises a computer body, an input section such as a keyboard, mouse and so on, a display, a memory such as a RAM, a hard disc, and so on. The server 1 is similar to the personal computer. The personal computer may include a printer in order to print data.

(16) The server 1 provides a Web site for constituting the human relationships registering system, stores names and personal data of registered members, and has a database for retrieving the names and personal data of the registered members. The Web site of the server 1 is assigned an address for the Internet 4.

(17) Each of the personal computers 2 and 3 stores a browser in the storage such as a hard disc in order to perform communications via the Internet 4. The personal computer 2 or 3 activates the browser and specifies an address, thereby connecting to the Web site of the human relationships registering system offered by the server 1.

(18) An input section of the personal computer 2 or 3 transmits registering data to the server 1 via the Internet 4. When a registration keyword or the like is inputted, the server 1 retrieves necessary data. The retrieved data are indicated on a display of the personal computer 2 or 3.

(19) The use of the human relationships registering system will be described with reference to FIGS. 1 to 7. FIG. 2. Is a schematic diagram showing human relationships data which are created by the human relationships registering system. FIG. 3 shows an example of a Web page used for entering the Web site offered by the server 1. FIG. 4 shows an example of a Web page used for registering a personal data of a new member at the human relationships registering system. FIG. 5 shows an example of a Web page an existing member uses for confirming a personal data of a new member. FIG. 6 shows an example of a Web page used for retrieving data in the human relationships registering system. FIG. 7 is an example of a Web page used to show retrieved results.

(20) A new member is registered in the human relationships registering system (called the system hereinafter) as shown in FIGS. 3 and 4. For convenience of description, it is assumed that an existing member A with the personal computer 2 (called the computer 2) is going to introduce a new member B who has the personal computer 3 and wishes to enter the system.

(21) When the new member B enters the system by himself or herself, he or she activates the browser of the computer 3, inputs a Web site address and gains access to the server 1 via the Internet 4. The computer 3 receives the Web page 21 as shown in FIG. 3 from the server 1 and indicates it on the display. The new member B clicks a new registration button 25 on the Web page 21, so that a signal is transmitted to the server 1. The computer 3 receives the Web page 31 as shown in FIG. 4 from the server 1 and indicates it on the display.

(22) In FIG. 3, reference numeral 22 denotes a column to input an identification code, and reference numeral 23 denotes a column to input a password. By the way, the identification code and the password are inputted in the columns 22 and 23 when an existing member gains access to the server 1. Thereafter, the existing member can access the server 1 after pushing an OK button 24.

(23) Referring to FIG. 4, the new member B enters his or her name 32, occupation 34, address 35, telephone number 36, e-mail address 37, technical field 38 and password 40 as well as the introducer's name 33. Confirming the entered data, the new member B clicks an OK button 39. Thereafter, the data will be transmitted to the server 1 via the Internet 4.

(24) The computer 2 of the introducer A (i.e. the existing member A) receives Web page 41 as shown in FIG. 5 from the server 1 in response to an e-mail. The Web page 41 indicates the new member B's name, occupation, technical field in columns 42, 43 and 44. Confirming the contents, the introducer A clicks a confirmation button 45 on the Web page 41. Thereafter, a confirmation signal is sent to the server 1. In response to the confirmation signal, the server 1 stores the new member B's personal data and password in correlation with the introducer A. FIG. 4 shows only some examples of data to be stored with respect to the new member B. The following data may be added: a new member's age, academic backgrounds, occupational backgrounds, qualifications and so on. The entered data can he updated in the server 1 whenever there are changes after the registration.

(25) Alternatively, the introducer A may register the new member B. In this case, the introducer A enters the personal data of the new member B (shown in FIG. 4) using his computer 2 in order to send them to the server 1. Thereafter, the computer 3 of the new member B receives the personal data from the server 1 by an e-mail. Confirming the received data, the new member B returns the confirmation signal to the server 1. Thus, the new member B will be registered in the server 1.

(26) Further, when receiving an e-mail address of the new member B from the introducer A, the server 1 may send an e-mail to the new member B in order to urge the new member B to register his or her personal data. Upon receiving the personal data of the new member B, the server 1 stores the received data in correlation with the introducer A's name and so on.

(27) The new member's data are confirmed by the introducer, and are stored in correlation with the introducer. The server 1 creates human relationships data and a human relationships diagram showing the human relationships on the basis of the relationships between the new member and the introducer. At the time of registration, a new member is assigned an identification code (ID No.).

(28) The registered member can establish relationships with existing members, and obtain a relationship coefficient indicating degrees of relationships. For this purpose, members may send protocol e-mails to particular existing members. For instance, a sender may indicate that he or she respects or admires an existing member and wishes to establish relationships with the existing member, and so on. Such a protocol e-mail may be sent to the existing member as an e-mail via the server 1. In response to the protocol e-mail, the existing member may meet the sender's request, and establish the relationships with the sender. Therefore, the sender can be related to the receiver (i.e. the existing member), and obtain a relationships coefficient. As will be described later, the relationships coefficient is maximum when the relationships are directly established between members while the relationships coefficient becomes smaller when the relationships are indirectly established via other members. In other words, it is possible to objectively known a degree of relationships on the basis of the relationships coefficients.

(29) The human relationships registering system shown in FIG. 1 and the human relationships diagram will be utilized as described hereinafter.

(30) The server 1 creates a human relationships diagram as shown in FIG. 2 on the basis of the basic data in which members are registered in correlation with one another, and on the basis of agreements between members who have exchanged protocol e-mails. The server 1 sends the human relationships diagram to the computer 3. In FIG. 2, reference numerals 11 to 20 denote members, and lines denote members who are correlated with one another after exchanging protocol e-mails and agreeing to establish relationships. Further, relationships coefficients of the correlated members may be indicated in the human relationships diagram. [0061] Relationships coefficients are updated each time new human relationships are established between registered members. The updated relationship coefficients are stored in the server 1. Therefore, latest relationships can be known even after relationships are changed between registered members.

(31) Referring to FIG. 2, the member 13 is directly related to the members 11, 14, 15, 16 and 18 while the member 13 is indirectly related to the members 12, 17, 19 and 20. Further, it is possible to indicate all the members having relationships coefficients which are larger than a predetermined value. Still further, it is possible to indicate occupations and technical fields of members.

(32) The following describe how the human relationships registering system is actually operated with reference to FIGS. 3, 6 and 7. It is assumed here that the member B activates a browser of the computer 3 and connects to the server 1 via the Internet 4. The Web page 21 (shown in FIG. 3) is indicated on the display of the computer 3. The member B enters his or her identification code (ID No.) and password on the columns 22 and 23 via the input section, and clicks the OK button 24. The input data are sent to the server 1, which confirms whether the identification code agrees with the password, and indicates a Web page 57 (shown in FIG. 6) on the display of the computer 3.

(33) The identification codes are usually assigned to the members by the server 1. Alternatively, members' e-mail addresses may be used as identification codes.

(34) In order to know the human relationships of the member 13 (shown in FIG. 2), the member B enters the data concerning the member 13 on the columns 52 to 55, clicks a retrieve button 56. Then, the Web page 61 (shown in FIG. 7) is indicated on the display of the computer 3, and indicates on columns 63 to 67 the members 11, 15, 18, 12, 17 and so on who are related to the member 13. The occupations and relationship coefficients of the members 11, 15, 18, 12, 17 and so on are indicated on columns 70 and 71. In this case, it is possible to indicate only the members whose relationship coefficients exceed the predetermined value. A plurality of retrieval keywords may be input in the columns 52 to 55. Further, the Web page 61 may indicate technical fields and so on of the related members.

(35) In order to retrieve data concerning members having particular occupations or engaged in particular technical fields, the member B enters keywords of the particular occupations or technical fields in the columns 52 to 55. The entered data are sent to the server 1, which retrieves desired data and indicates them on the computer 3. Alternatively, personal data of the retrieved members may be indicated by double clicking the columns 63 to 67.

(36) Further, the relationship coefficients may be used as the keywords for the retrieval. In other words, it is possible to retrieve members who are related to a particular member (who may be a retrieving member) and have the relationships coefficient of a particular value.

(37) According to the invention, it is possible to get acquainted with specialists in various particular fields by indicating occupations and technical fields of members with the human relationships diagram. Therefore, the invention is useful in order to obtain expert knowledge or information. In short, the human relationships diagram can be applied as one of effective business measures.

(38) Referring to the indicated relationships coefficients of members, some members who are not directly related to a desired member shown in the human relationship diagram can find an introducer (another member) related to the desired member.

(39) The relationships coefficients will be described in detail. FIGS. 8(a) to 8(c) show examples of human relationship diagrams created as human relationships data. The human relationships change from a state (a) to a state (b) and to a state (c). In these drawings, characters M, I, D, S and N denote members who are connected by lines when relationships are established therebetween.

(40) Referring to FIG. 8(a), the member M is directly related to the member I, and is indirectly related to the members D and S. The term directly means that the relationship is established between the members M and I by exchanging the protocol e-mails therebetween. The term indirectly means that the member M has no direct relationship with the members D and S. In short, the member M is related to the members D and S via the member I.

(41) In FIG. 8(b), the members M and D are directly related to each other by exchanging the protocol e-mails.

(42) FIG. 8(c) shows that the member N is directly related to the member I by exchanging the protocol e-mails, and is indirectly related to the members M, D and S via the member I.

(43) FIGS. 9(a) to 9(c) are tables showing examples of relationships coefficients of the members stored in the server 1. These tables correspond to FIGS. 8(a) to 8(c), respectively. Characters ID-M, ID-I, ID-D, ID-S and ID-N denote the identification codes of the members M, I, D, S and N. The figures in FIGS. 9(a) to 9(c) are the relationship coefficients between members.

(44) A maximum relationships coefficient 1.0 is assigned when members are directly related to each other. The relationships coefficient 1.0 is halved as the number of intermediate members increases. In short, a relationship coefficient 0.5 is assigned to a first member and a third member when a first member is related to a third member via a second member who is directly related to the first member. A minimum relationship coefficient 0.25 is assigned to a first member and a fourth member when the first member is related to the fourth member via the second member and the third member who is directly related to the second member.

(45) Referring to FIG. 9(a), the relationships coefficients assigned to the member M are 1.0 based on direct relationship to the member I, 0.5 based on relationship to the member D via the member I, 0.25 based on relationship to the member S via the members I and D.

(46) In the example shown in FIG. 9(b), if the member M is directly related to the member D (by exchanging the protocol e-mails), the relationships coefficient is changed to 1.0 between the members M and D. Further, the relationships coefficient is changed to 0.5 between the member M and the member S who is directly related to the member D. Needless to say, the relationship coefficient remains 1.0 between the member M and I who are directly related.

(47) As shown in FIG. 9(c), the relationships coefficient 1.0 is assigned to the member N who is directly related to the member I. The relationships coefficient 0.5 is assigned to the member N who is related to the members D and M via the member I. The relationships coefficient 0.25 is assigned to the member N who is related to the member S via the members I and D.

(48) As described above, it is possible to objectively know degrees of the human relationships on the basis of the relationship coefficients. The following describe a case in which the member S (shown in FIG. 8(a)) retrieves data of existing members using a keyword law representing a technical field.

(49) FIG. 10 shows an example of personal data of the members M, I, D and S which are stored in the server 1. In response to the keyword law entered by the member S, the server 1 retrieves and outputs data concerning the members M and I who are practicing the law. In this case, the relationships coefficients between the member S and the members M and I (shown in FIG. 8(a)) may be also indicated. This enables the member S to check the presence of the member whose relationship coefficient is high to the member S. Further, the server I may indicate a human relationships diagram concerning the members S, M and I (shown in FIG. 8(a)). On the basis of the human relationships diagram, the member S who is retrieving the data can confirm the degree of relationships with the members M, I and himself or herself. For example, the member S can know that he or she is accessible to the member I via the member D who is directly related to the members I and S.

(50) When a computer-readable recording medium such as a CD-ROM which stores the program for executing the human relationships registering method of the invention is used, another computer (not shown) can function as a server by reading the stored program similarly to the server 1.

(51) Although the invention has been described with respect to one embodiment thereof, it will be understood that various modifications or alterations are possible without departing from the spirit of the present invention. For instance, a plurality of computers may be connected to a server using a dedicated line such as a LAN in place of the Internet. The Web pages are simply shown as examples, and may be configured as desired.

Effects of the Invention

(52) The invention is effective and useful when persons create human relationships data in order to get acquainted with specialists in various particular fields, and obtain expert knowledge or information.

(53) According to the invention, the relationships coefficients are not assigned until relationships are established between members after mutual agreements are reached. The invention actively assists persons to establish wide and close relationships between members registered in the human relationships registering system.

(54) Further, when some member retrieves data on existing members, relationship coefficients of the retrieving member and the existing members whose data are being retrieved are indicated. The retrieving member can select at least members who are close to him or her.

(55) Obviously, numerous modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practiced otherwise than as specifically described herein.