Apparatus and system for providing information required for meeting with desired person while travelling

Abstract: Disclosed is an apparatus and a system for providing information required for meeting with a desired person while travelling. A subscriber registers his or her attribute data, attribute data of a desired person and his or her travel schedule data through an input/output terminal (1). Input data is transferred via a communication network to a host computer (3). Host computer (3) generates information regarding the other party who the subscriber can meet with for each subscriber by processing data transferred from many subscribers. Generated data is stored in an output list file (48), so that the subscriber is able to know a possibility to meet with a desired person while travelling by making access to the output list file through the input/output terminal.

Description: BACKGROUND OF THE INVENTION Field of the Invention The present invention relates generally to an information providing system using a communication network and, more particularly, to an information providing apparatus and system for providing registered subscribers with information required for meeting with desired people while travelling. Description of the Background Art Recently, with development of transportation systems such as airplanes, railroads, expressways and freeways, there are increasing opportunities for many people in general as well as businessmen to make a trip or travel by means of transportation. In particular, it takes long to travel abroad or some distant domestic areas, and hence, fruitful and enjoyable trips or travels are desired. In general, main purposes of travels are mostly definite and clear. There are, however, some cases where some people or some travellers wish to meet with unknown people in far distance (including people in native areas and travellers), which may be a secondary purpose for them though. There is a case, for example, where one wish to know a person who he or she has not met yet but who has common interests or common experiences. Further, there is a case where even if one does not plan to travel, he or she desires to meet an unknown person (desired person) on travel. Conventionally, however, there has been no information providing system for providing effective information to people who expect to meet with unknown people on travels. Those who expect such meeting could not have easily met with desired people while travelling. The following publications are acknowledged: United Kingdom Patent Application GB-A-2017360 discloses a system for the controlled selection of subjects from a data bank by weighted cross-correlation techniques, whereby ideal partners are defined as a basis for selection. The results are output as a list of the most compatible participants with their characteristics, names and addresses. The selection of social and marriage partners belongs to the possible applications of the system. However, that system does not use schedule data as a basis for selection. European Patent Application EP-A-0276425 relates to a calendaring system with workstations connected to a host processor. Criteria are pre-established by each calendar owner, which allow the system to automatically develop responses to invitations sent to a user requesting his involvement in a future event: data relevant to an event being scheduled are compared with said pre-established criteria and an answer is automatically developed when a predetermined relationship is indicated. Such criteria may include the name of the event originator, the subject, place, time of the meeting, or various combinations of the above. European Patent Application EP-A-0276427 concerns the same electronic calendaring method as above and describes the display of a composite calendar comprising entries from plural calendars within a specified time span which have been selected by criteria entered interactively by the given calendar owner. SUMMARY OF THE INVENTION One object of the present invention which is defined in the appended claims, is therefore to provide a method and apparatus for providing information required for meeting with a desired person while travelling. In carrying out the invention, the attribute data and schedule data of a subscriber and the attribute data of an expected person are stored in advance in attribute/schedule storing means for each subscriber who expects to meet with a desired person while travelling. The subscriber selecting means selects a specific subscriber having common attribute data and common schedule data among subscribers by referring to the attribute/schedule storing means. The information as to the expected person is accumulated for each selected subscriber by the information accumulating means. The information providing means provides subscribers via a communication network with the accumulated information. The foregoing and other objects, features, aspects and advantages of the present invention will become more apparent from the following detailed description of the present invention when taken in conjunction with the accompanying drawings. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a block diagram of an information providing system showing one embodiment of the present invention. Fig. 2 is a diagram of a display showing one example displayed on a display unit when attribute data is entered. Fig. 3 is a diagram of a display of a data input area 14 shown in Fig. 2. Fig. 4 is a diagram of a display of a guidance area 15 shown in Fig. 2. Fig. 5 is a diagram of a display showing one example displayed on the display unit when schedule data is input. Fig. 6 is a diagram of data showing several examples of movement data input as schedule data. Fig. 7 is a diagram of data showing an example of the contents of location data input as schedule data. Fig. 8 is an output list showing an example of an output list of a certain user Mr. A. Fig. 9 is an output list showing an example of an output list of another user Mr. B. Fig. 10 is an overall flow chart showing a schematic processing flow in the information providing system shown in Fig. 1. Fig. 11 is a flow chart showing a processing in a data coupling processor shown in Fig. 1. Fig. 12 is a flow chart showing a generation processing of an expected number file 44 in an expected number detecting processor shown in Fig. 1. Fig. 13 is a flow chart showing a generating processing of an expected number file 45 in the expected number detecting processor shown in Fig. 1. Fig. 14 is a flow chart showing a generating processing of an expected number file 46 in the expected number detecting processor shown in Fig. 1. Figs. 15 and 16 are flow charts showing a processing in a feasible meeting detecting processor shown in Fig. 1. Fig. 17 is a flow chart for use in generating data to be stored in the output list file shown in Fig. 1. DESCRIPTION OF THE PREFERRED EMBODIMENTS Fig. 1 is a block diagram of an information providing system showing one embodiment of the present invention. With reference to Fig. 1, this information providing system includes a large number of input/output terminals 1 for use in accesses by many subscribers, and a host computer 3 connected via a communication network 2 to input/output terminals 1. One input/output terminal 1 includes a keyboard (or touch panel) unit 11 for use in an input of data and commands by subscribers, a CRT display unit 12, and a printer 13. Communication network 2 is implemented by, for example, an integrated service digital network (ISDN) and/or a telephone network, and in some case, by a local area network (LAN) and the like. Host computer 3 includes a data input processor 31, a data coupling processor 32, an expected number detecting processor 33, a feasible meeting detecting processor 34, and a data output processor 35. In this embodiment, those processors 31 to 35 are implemented with software or programming and are connected via an interface unit 30 to communication network 2. Host computer 3 further includes an attribute file 41, a schedule file 42, an attribute/schedule file 43, expected number files 44, 45 and 46, intermediate files 47 and 49, and an output list file 48. These files 41 to 48 are formed in a random accessible memory such as, for example, a magnetic disc unit. Those files 41 to 48 are connected via a bus line 40 to processors 31 to 35. While a detailed description will be made later as to processors 31 to 35 and files 41 to 48 provided in host computer 3, the following description will first be made on a manner of use of the information providing system shown in Fig. 1 for the purpose of a schematic description of the information providing system. Fig. 2 is a diagram showing one example displayed on display unit 12 when attribute data is input. With reference to Fig. 2, a data input area 14 is used when a subscriber inputs his or her attributes and attributes of an expected person, i.e., the other party. A guidance area 15 is displayed for assistance in data inputs to data input area 14 by the subscriber. Respective examples of displays of data input area 14 and guidance area 15 are shown in Figs. 3 and 4, respectively. With reference to Fig. 3, data input area 14 includes a column 51 to which registration numbers are input, a column 52 to which registrants' names are input, a column 53 to which passwords are input, a column 54 to which the names of banks specified for payment are input, a column 55 to which bank account numbers are input, a column 56 to which registrants' addresses are input, a column 57 to which registrants' ages are input, a column 58 to which telephone numbers are input, a column 59 to which facsimile numbers are input, and a column 60 to which registrants' other information are input. Various attribute data indicating a range for receiving of information providing services are input to a column 61. Data regarding attributes of an expected person such as, for example, birthplace data, alma mater data, family data, origins data and interest data are input to column 61. The example shown in Fig. 3 indicates birthplace data, alma mater data, family data, art data and sports data as his or her likings. Various registration codes are input to a column 62. While a data input to data input area 14 shown in Fig. 3 is carried out by keyboard unit 11, guidance area 15 shown in Fig. 4 is used for input assistance in order to reduce the workload of data input. That is, with the use of a guidance display, data which is prepared in advance in guidance area 15 is displayed, and a user can easily make a data input by shifting a cursor to the displayed data. Various data for use in reducing the data input workload are prepared in guidance display area 15 if required. An input of unprepared data is made by a key entry through keyboard unit 11. In another example, a map is displayed on display unit 12, and area (region) data is input by repetition of instructions of a desired area or region. The displayed map is changed in sequence from a large-scale map to a small-scale map, and the repeating of instructions allows an input of hierarchical regional data. In a case, for example, where a person expects to meet another person of the same birthplace on journeys, birthplace data is input as expected attribute data. The birthplace data is allowed to designate regions from a larger range to a smaller range in sequence. While nationality data is also allowed to be input in a case where an international network is formed, only area data which is more detailed than to/do/fu/ken (urban and rural prefectures) data in Japan is displayed in the example shown in Fig. 2. In a case where the birthplace of a certain user is 4-chome, Funairi-cho, Hiroshima-shi, Hiroshima-ken (4, Funairi Town, Hiroshima City, Hiroshima Prefecture), if the user wishes to meet as his or her target a person who comes from the same town as the user's, birthplace data representing "Hiroshima Prefecture", "Hiroshima City" and "Funairi Town" is input into the column of birthplaces as shown in Fig. 3. If the input birthplace data includes data representing "4-chome", those (registrants) who come from Funairi Town other than from 4-chome are excluded from targets for retrieval. Alma mater data is input in a case where a meeting with graduates from the same school is expected. In this case, data representing the name of alma mater, data representing the year of graduation or data representing the range of graduation year is input. The graduation year range data defines the range of the year when a person who is expected to meet graduated from his or her school. If the graduation year data is not input, all graduates from a specified school are targets for retrieval. Family data is input in a case where a meeting with a person of the same origin such as, for example, the Kishu clan, a branch of the Tokugawa clan, or one's kin or relative is expected. Data representing the cradle of his or her family (or data representing the names of places closely related to the family in history) and data representing family names are input in some cases. In addition, in a case where a meeting with a person who has the same taste or liking, i.e., the same interest and/or sports as the user's is expected, interest data and/or sports data of the expected person are input. In the example shown in Fig. 3, "music" ("Italian opera" in further detail) and "swimming" (200-meter breaststroke in further detail) are input as art data and sports data, respectively. As other attribute data of registrants, occupation data, data representing such experience as a detention in Siberia, and age data, for example, can be included. For a retrieval mask FL, with an input of a flag "L", retrieval data provided with that flag "L" is not employed in a retrieval processing. That is, although data is input as expected attribute data, the input of flag "L" prevents specified data from limiting a person who is expected to meet. In other words, data which has once been excluded from a target for retrieval can be easily returned as an item for retrieval by removal of flag "L". Fig. 5 is a diagram of a display showing one example displayed on display unit 12 when schedule data is input. A data input area 16 is provided with columns for use in inputs of various data which will be described below. In order to indicate data to be input in blank-space columns in data input area 16, columns 70 to 90 include the following indications. Column 72 has an indication of "retrieval mask flag"; column 71, "date"; column 72, "date/month/year"; column 73, "margin"; column 74, "schedule partition"; column 75, "time"; column 76, "departure"; column 77, "margin"; column 78, "arrival"; and column 79, "margin." Further, column 80 has an indication of "area"; column 81, "to/do/fu/ken (urban and rural prefectures)"; column 82, "means of transport"; column 83, "flight (or train, bus etc.) service number"; column 84, "departure station (the name of area)"; column 85, "arrival station (the name of area)"; column 86, "gun (county)"; column 87, "shi/cho/son (city/town/district)"; column 88, "the name of town/district"; column 89, "location"; and column 90, "communication means." Schedule data that can be changed depending on date and time are input in corresponding blank-space columns represented by columns 73, 77 and 79 where "margin" is indicated. That is, in a case where schedule is not determined yet or a case where schedule is alterable if necessary, data for determining the alterable number of days and time periods is allowed to be input in a corresponding blank column. In a retrieval processing which will be described later, targets to be retrieved are increased by referring to those margin data, resulting in an increase in probability that an expected person is discovered. Corresponding data indicated in columns 70 to 90 are input in the blank-space columns in data input area 16 shown in Fig. 5. A data input is carried out through keyboard 11 by utilizing guidance area 15 as in the case with attribute data input shown in Fig. 3. Schedule data includes movement data for determining a schedule of the user when the user moves from a point X to another point Y, and location data for determining a schedule of the user's stay in the future such as a site for exhibition, accommodations and a waiting room in the airport. It is pointed out that both the movement data and the location data include time data and place data constituting schedule data. An example of movement data is shown in Table 1 below. Movement data (from point X to point Y) (1-1) Starting of location October 8, 1990 9:55 a.m. (1-2) End of movement October 8, 1990 10:55 a.m. (2-1) Starting point: Area Kyushu (2-2) Prefecture Kumamoto (3-1) Transportation means Airplane (3-2) Flight No. ANA 522 (3-4) Departure station (Name of town) Kumamoto Airport (3-5) Arrival station (Name of town) Itami Airport An example of location data is shown in Table 2 below. Location data (in a certain area) (1-1) Starting of location October 8, 1990 6:30 p.m. (1-2) End of location October 9, 1990 9:30 a.m. (2-1) Area Kinki (2-2) Prefecture Osaka (2-3) County/city Osaka (2-4) City/town Osaka-City (2-5) Town/district Sakai (3-1) Starting place Hotel Prince (3-2) Communication means Tel.No. 06-232-5678 Fig. 6 is a diagram showing data representing several examples of movement data input as schedule data. Fig. 7 is a diagram showing data representing several examples of location data input as schedule data. It is pointed out that other various data are allowed to be used as movement data and location data besides the examples shown in Figs. 6 and 7. As described above, after attribute data is input by reference to data input area 14 shown in Fig. 3 and schedule data is also input by reference to data input area 16 shown in Fig. 5, a retrieval processing including data input by many other subscribers is executed by host computer 3 shown in Fig. 1. While this retrieval processing will be described subsequently in detail, the following description will first be made on an example of an output list which is finally output by display unit 12 and/or printer 13. In the following example, assume that a certain user, Mr. A has a registration schedule shown in Table 3 below. Mr. A's registered schedule Oct.10 1990 8:30 Kumamoto Airport : ANA522 10:30 to 16:30 Flower Exposition 18:00 Hotel Prince Osaka (Arrival) Oct.11 9:30 Hotel Prince Osaka (Departure) 10:00 Hankyu Railway Express for Kawaramachi, Kyoto 11:00 to 12:00 Heian Shrine, Kyoto 16:00 Japan Railway Sanyo for Osaka 18:00 Hotel Prince Osaka (Arrival) Oct.12 9:00 Hotel Prince Osaka (Departure) 9:30 Hankyu Railway Express for Kobe 10:30 Mt. Rokko by cable car 12:00 to 14:00 Top of Mt. Rokko 16:00 Hotel Koyo in Arima Onsen (Arrival) Oct.13 9:00 Hotel Koyo in Arima Onsen (Departure) 9:30 Kobe Railway Express for Sannomiya 10:20 to 10:50 Ijinkan in Sannomiya, Kobe 11:00 to 13:00 Daiohji Zoo 14:00 From Miyoshi to Osaka Airport by Airport limousine 18:55 Osaka Airport : ANA529 In addition, assume that another user, Mr. B has a registration schedule shown in Table 4 below. Mr. B's registered schedule Oct.11 1990 10:00 Kumamoto Airport : ANA524 11:30 For Kyoto by Airport Limousine 12:30 to 14:00 Sightseeing in Kiyomizu Temple, Kyoto 18:30 Hotel Miyako, Kyoto (Arrival) Oct.12 9:00 Hotel Miyako, Kyoto (Departure) 10:00 Express from Hankyu Kawaramachi to Osaka 12:00 to 17:00 Flower Exposition 18:00 Hotel Prince Osaka (Arrival) Oct.13 9:00 Hotel Prince Osaka (Departure) 10:00 to 14:00 Flower Exposition 16:30 Osaka Airport : ANA527 Fig. 8 is a diagram of an output list showing an example of an output list of the user, Mr. A. Fig. 9 is a diagram of an output list showing an example of an output list of another user, Mr. B. As can be seen from the registered schedules of Mr. A and Mr. B. shown in the above tables 3 and 4, it is possible that Mr. A and Mr. B who do not know each other (or know each other but do not know their mutual schedules in some case) may meet on their schedules. In this example, assume that Mr. A's attribute data match Mr. B's. Therefore, Mr. B's schedule data and attribute data are displayed as the other party's information in Mr. A's output list 91 shown in Fig. 8. With reference to Fig. 8, Mr. A's output list 91 includes a column 92 for displaying schedule data of Mr. A, a column 93 for displaying schedule data of the other party (i.e., including Mr. B), and a column 94 for displaying detailed attribute data of the other party. With reference to Fig. 9, Mr. B's output list 95 includes a column for displaying Mr. B's schedule data, a column 97 for displaying the other party's (i.e., including Mr. A) schedule data, and a column 98 for displaying the other party's detailed attribute data. As shown in Figs. 8 and 9, since there are other people (Mr. E, Mr. X, Mr. W etc.) other than Mr. B and Mr. A who Mr. A and Mr. B may possibly meet with, respectively, as their respective other parties, schedule data and attribute data concerning those other people are also displayed. Mr. A and Mr. B who have received the output lists shown in Figs. 8 and 9, respectively, can be informed that there are their respective expecting parties on travels. Accordingly, Mr. A and Mr. B can communicate with their desired parties before starting to travel or during travelling. If they agree to meet each other, they can see each other while travelling. The foregoing description has been made on one example of the manner of use of the information providing system shown in Fig. 1. A detailed description will now be made on a data processing in the information providing system shown in Fig. 1. Fig. 10 is an overall flow chart showing a schematic processing flow in the information providing system shown in Fig. 1. With reference to Fig. 10, first, in a step 101, attribute data are input (or updated in some case) by a large number of users or subscribers. A subscriber inputs/updates self-attribute data and expected attribute data through input/output terminal 1 shown in Fig. 1. The input attribute data is transferred through communication network 2 to host computer 3. In a step 102, data input processor 31 processes the transferred attribute data and registers or stores the processed attribute data in attribute file 41. In some case, the data in attribute file 41 is updated. In a step 103, schedule data is input through input/output terminal 1 by the subscriber. In some case, the subscriber updates the schedule data. The input schedule data is transferred through communication network 2 to host computer 3. In a step 104, data input processor 31 processes the transferred schedule data and registers the processed schedule data in schedule file 42. In some case, the schedule data in schedule file 42 is updated. In a step 105, data coupling processor 32 couples two data stored via a common registrant number by referring to attribute file 41 and schedule file 42. That is, for each subscriber, attribute data and schedule data are coupled to each other (which will be described in detail later), and coupled attribute/schedule data is generated. In a step 106, the generated attribute/schedule data is registered in attribute/schedule file 43. In some case, the attribute/schedule data in file 43 is updated. In a step 107, expected number detecting processor 33 generates three expected number files 44, 45 and 46 by carrying out a processing which will be described later in detail. In some case, expected number files 44, 45 and 46 are updated. In a step 108, feasible meeting detecting processor 34 detects a feasible meeting by carrying out a processing which will be described later in detail. In a step 109, data concerning a feasible meeting is stored in intermediate file 47. In some case, the data stored in intermediate file 47 is updated. In a step 110, data output processor 35 generates output data having a format suitable for an output by display unit 12 or printer 13, and stores the generated output data into an output list file 48. In some case, the data in output list file 48 is updated. In a step 111, data output processor 35 responds to a request from input/output terminal 1 to refer to the data stored in output list file 48, and applies requested data through interface unit 30 and communication network 2 to input/output terminal 1. A data format of the data stored in each of files 41 to 47 shown in Fig. 1 will now be described. The data stored in attribute file 41 has a data format shown in Table 5 below. Registrant No. Attribute Data RN EA 1 EA 2 EA 3 EA 4 • • • With reference to Table 5, the data stored in attribute file 41 includes attribute data EA1, EA2, ... provided for each registrant, i.e., each registrant number RN. Respective attribute data EA1, EA2, ... correspond to attribute codes representing the attribute data described with reference to Fig. 3. That is, each of attribute codes EA1, EA2, ... represents attributes of a registrant himself or herself and attributes of an expected person. In the example shown in Fig. 3, a code representing the prefecture "Hiroshima Prefecture" from which a registrant (having his or her registrant number RN) comes is input as attribute code EA1, a code representing the city "Hiroshima City" from which the registrant comes is input as attribute code EA2, and a code representing the town "Funairi" from which the registrant comes is input as attribute code EA3. Other data shown in Fig. 3 (data numbers 02 to 04) are also input as attribute codes of the same registrant number RN in accordance with a predetermined coding. Accordingly, attribute data input via data input area 14 shown in Fig. 3 is converted into an attribute code in data input processor 31 of Fig. 1, and thereafter, the converted attribute code is stored in the data format shown in Table 5 in attribute file 41. Similarly, when an alteration or updating of attribute data is requested, data input processor 31 alters or updates the attribute code stored in attribute file 41 in accordance with the request. Schedule data stored in schedule file 42 shown in Fig. 1 has a data format shown in Table 6 below. Registrant No. Schedule Data Time Place RN TMA TMB PL 1 PL 2 PL 3 PL 4 • • • With reference to Table 6, schedule data also includes time codes TMA and TMB and place codes PL1, PL2, ... provided for each registrant, i.e., each registrant number RN. Time code TMA includes a code for determining the time/date/month/year for a registrant to start in a certain place. Time code TMB includes a code for determining the time/date/month/year for the registrant to end. Place codes PL1, PL2, ... include a code for determining places sequentially from a larger area to a smaller area. That is, single schedule data stored in schedule file 42 represents that registrant RN stays at a place determined by place codes PL1, PL2, ... during a period determined by starting time code TMA and ending time code TMB. Therefore, schedule data input via data input area 16 shown in Fig. 5 is converted into a time code and a place code in data input processor 31 of Fig. 1 and is then stored in schedule file 42 for each registrant number. The data stored in attribute/schedule file 43 has a data format shown in Table 7 below. Attribute Data Schedule Data Registrant No. Time Place EA 1 EA 2 EA 3 EA 4 • • • TMA TMB PL 1 PL 2 PL 3 PL 4 • • • RN As can be seen from Table 7, the contents of attribute/schedule file 43 is obtained by coupling the attribute data and the schedule data stored in attribute file 41 and schedule file 42 in accordance with a predetermined processing. This coupling processing is made by data coupling processor 32 shown in Fig. 1. The data coupling processing is carried out on the basis of a flow chart shown in Fig. 11. Fig. 11 is a flow chart showing a processing in data coupling processor 32 shown in Fig. 1. With reference to Fig. 11, in a step 121, attribute data EA1, EA2, ... are read for each one registrant number RNA by reference to attribute file 41. In a step 122, schedule data, i.e., time codes TMA and TMB and place codes PL1, PL2, ... are read for each registrant number RNB by reference to schedule file 42. In a step 123, attribute/schedule data which is obtained by all combinations of attribute data EA and schedule data TM and PL are produced for each registrant (RNA). The produced attribute/schedule data are stored in attribute/schedule file 43. Accordingly, in this step 123, attribute data EL and schedule data TM and PL are coupled to each other for each registrant, so that the coupled data are stored in attribute/schedule file 43. In a step 124, it is determined whether the processings in steps 121 to 123 are carried out for all the registrants. If attribute data of a registrant which is not processed is left in attribute file 41, the processing returns to step 121. When the processings in steps 121 to 123 are completed for all the registrants, the above-described data coupling processing is completed. This results in generation of coupled data having the data format shown in Table 7 in attribute/schedule file 43 shown in Fig. 1. A description will now be made on a processing carried out in expected number detecting processor 33 shown in Fig. 1. Prior to this description, a description will first be made on a data format of data generated in an expected number detecting processing, i.e., a data format of data stored in expected number files 44, 45 and 46 shown in Fig. 1. Table 8 below shows a data format of data stored in a first expected number file 44. Attributes Expected Number EA 1 EA 2 EA 3 EA 4 • • • ENA With reference to Table 8, single data stored in first expected number file 44 includes attribute codes and the number of registrants who expect common attributes. Attribute data includes attribute codes EA1, EA2, ... as already described. Attribute codes EA1, EA2, ... are used as a first retrieval key KA for use in detecting a first expected number, as will be described later. Data stored in a second expected number file 45 has a data format shown in Table 9 below. Attributes Time Expected Number EA 1 EA 2 EA 3 EA 4 • • • TMA TMB ENB With reference to Table 9, single data stored in second expected number file 45 includes attribute codes EA1, EA2, ..., time codes TMA and TMB, and expected number data ENB. That is, expected number data ENB corresponds to the number of registrants who have common attribute codes and common time codes. Data stored in a third expected number file 46 has a data format shown in Table 10 below. Attributes Place Expected Number EA 1 EA 2 EA 3 EA 4 ··· PL 1 PL 2 PL 3 PL 4 ··· EN 1 EN 2 EN 3 EN 4 ··· With reference to Table 10, single data stored in a third expected number file 46 includes attribute codes EA1, EA2, ..., place codes PL1, PL2, ..., and expected number data EN1, EN2 .... For example, expected number data EN1 corresponds to the number of registrants who have common attribute codes EA1, EA2, ... and common place code PL1. Expected number code EN2 corresponds to the number of registrants who have common attribute codes EA1, EA2, ... and common place codes PL1 and PL2. In addition, expected number code EN3 corresponds to the number of registrants who have common attribute codes EA1, EA2, ... and common place codes PL1, PL2 and PL3. Another expected number data EN4 also corresponds to the number of registrants according to a similar rule. Fig. 12 is a flow chart showing a generation processing of expected number file 44 in expected number detecting processor 33 shown in Fig. 1. With reference to Fig. 12, first, in a step 131, a first retrieval key KA is extracted by reference to attribute/schedule file 43. First retrieval key KA is comprised of attribute codes EA1, EA2, ... as mentioned above. In a step 132, the number of registrants who have the same retrieval key code is counted for each retrieval key KA by reference to attribute/schedule file 43. That is, the number of registrants who have registered the same attribute data is obtained as expected number data ENA. In a step 133, expected number data ENA is stored in expected number file 44 for each retrieval key KA. That is, data having the data format shown in Table 8 is stored in expected number file 44. Fig. 13 is a flow chart showing a generation processing of expected number file 45 in expected number detecting processor 33 shown in Fig. 1. With reference to Fig. 13, in a step 134, a second retrieval key KB is extracted by reference to attribute/schedule file 43. Second retrieval key KB is comprised of attribute codes EA1, EA2, ... and time codes TMA and TMB shown in Table 9. In a step 135, the number of registrants who have the same retrieval key code is counted for each retrieval key RB by reference to attribute/schedule file 43. Accordingly, the number of registrants who have the same attribute data and the same time code is obtained as expected number data ENB. In a step 136, expected number data ENB is written for each retrieval key KB in expected number file 45. Thus, data having the data format shown in Table 9 is stored in second expected number file 45. Fig. 14 is a flow chart showing a generation processing of a third expected number file 46 in expected number detecting processor 33 shown in Fig. 1. With reference to Fig. 14, a third retrieval key KC is extracted by reference to attribute/schedule file 43 in a step 137. Third retrieval key KC is comprised of attribute codes EA1, EA2, ... and place codes PL1, PL2, ... shown in Table 10. In a step 138, the number of registrants who have the same retrieval key code is counted for each retrieval key KC by reference to attribute/schedule file 43. As described above, expected number data EN2, for example, corresponds to the number of registrants who have common attribute codes EA1, EA2, ... and common place codes PL1, PL2. Similarly, expected number data EN4 corresponds to the number of registrants who have common attribute codes EA1, EA2, ... and common place codes PL1 to PL4. In a step 139, expected number data EN1, EN2, ... are written for each retrieval key KC in expected number file 46. Accordingly, data having the data format shown in Table 10 is stored in third expected number file 46. A processing carried out in feasible meeting detecting processor 34 shown in Fig. 1 will now be described. With reference to Fig. 15, expected number data ENA is read by reference to expected number file 44 in a step 181. It is determined in a step 182 that read data ENA is not lower than "2". When data ENA is "1", the processing returns to step 181. When a relation ENA ≧ "2" is satisfied, the processing proceeds to a step 183. In step 183, a first retrieval key KA having expected number ENA not lower than "2" is extracted from expected number file 44, and expected number file 45 is retrieved with retrieval key KA. Thus, expected number data ENB having retrieval key KA is read from expected number file 45. In a step 184, it is determined whether expected number data ENB is not lower than "2". If data ENB is "1", the processing returns to step 183. If a relation ENB ≧ "2" is satisfied, the processing proceeds to a step 185. In step 185, a second retrieval key KB is extracted from expected number file 45, and expected number file 46 is retrieved with retrieval key KB. Accordingly, expected number data ENj (j = 1, 2, ...) is read. A determination is made in a step 186 as to whether all data ENj are not lower than "2". When at least one data ENj is "1", the processing returns to step 185. When all data ENj satisfy a relation ENj ≧ 2, the processing proceeds to a step 187 shown in Fig. 19. In step 187, retrieval data for retrieving attribute/schedule file 43 is generated with combinations of attribute code EA, time code TM and place code PL. In a step 188, registrant numbers RNA, RNB, ... are extracted by retrieving of attribute/schedule file 43 with retrieval data. In a step 189, intermediate file data are generated for all combinations of extracted registrant numbers, and generated data are stored in intermediate file 47. In a step 190, a determination is made as to whether all data in expected number file 44 are processed or not. When any data is left, the processing returns to step 181 shown in Fig. 15. When all data in expected number file 44 are processed, the processing in feasible meeting detecting processor 34 shown in Fig. 1 is completed. A data format of data generated as the result of the feasible meeting detection processing shown in Figs. 15 and 16 is represented in Table 11 below. That is, the data format shown in Table 1 corresponds to the data format of the data stored in intermediate file 47 shown in Fig. 1. Registrant No. The Other Party's No. Attribute Data of the Other Party Schedule Data of the Other Party Time Place RNA RNB EA 1 EA 2 EA 3 EA 4 ••• TMA TMB PL 1 PL 2 PL 3 PL 4 ••• With reference to Table 11, single data stored in intermediate file 47 includes the other party's registrant number data provided for each registrant number RNA, the other party's attribute data and the other party's schedule data. The other party's number data RNB corresponds to a registration number of a person who registrant RNA may possibly meet with while travelling. The other party's attribute data and schedule data as well as the other party's number data RNB are stored in intermediate file 47. That is, other party attribute data includes other party attribute codes EA1, EA2 .... The other party schedule data includes the other party's time codes TMA and TMB and place codes PL1 and PL2, .... Consequently, intermediate file 47 stores therein, for each registrant, information regarding the person who the registrant might see while travelling. Output list file 48 is produced in the following procedure by reference to intermediate file 47. Fig. 17 is a flow chart for use in generating data stored in output list file 48 shown in Fig. 1. With reference to Fig. 17, in a step 161, sorting of data stored in intermediate file 47 is made by using registrant numbers. As a result, data as to the same registrant are concentrated in intermediate file 47, and accesses of data with respect to one registrant can easily be made. In a step 162, schedule data is read by reference to schedule file 42 for each registrant existing in intermediate file 47. That is, data necessary to constitute the output lists shown in Figs. 8 and 9 are read for each registrant. In a step 163, read schedule data are written in an output format in the output list file for each registrant. In the example shown in Fig. 8, for example, Mr. A's schedule data is written in a data format which is suitable for constituting the output list of Fig. 8, in output list file 48. In a step 164, information as to the feasible other party is read for each registrant by reference to intermediate file 47. In the example shown in Fig. 8, schedule information and attribute information concerning Mr. B and Mr. E are read from intermediate file 47. In a step 165, the read other party information is written in the data format suitable for constituting the output list into output list file 48. As the result of data writing in steps 163 and 165, data having a data format suitable for outputting the output list shown in Fig. 8, for example, is formed in output list file 48. A determination is made in a step 166 as to whether there are any other registrants left as the other party. If some other party is left, the processing returns to step 164. If no other party is left, the processing proceeds to a step 167. In step 167, it is determined whether there remain in intermediate file 47 any other registrants who are not subjected to the processings in steps 162 to 166. If some registrant is left, the processing returns to step 162. If there is no registrant left, the output list file data generation processing shown in Fig. 16 is completed. The foregoing description has been made on the detailed processings in steps 101 to 110 shown in the overall flow chart of Fig. 10. The processings in steps 101 to 110 shown in Fig. 10 are carried out at predetermined time intervals, for example, once in a day or twice in a day in some case. The user can obtain latest information by referring to output list file 48. In addition to intermediate file 47, intermediate file data one generation before, i.e., one generation older is also stored in old intermediate file 49. By comparing data in latest intermediate file 47 and that in old intermediate file 49, feasible meeting detection processor 34 is able to detect that a realizable meeting newly occurs or does not occur. Information as to such a new realizable meeting is also reported to subscribers through input/output terminals 1. Accordingly, a subscriber who has completed-his or her attribute data registration and schedule data registration can obtain the latest output list by making access again to this information providing system via input/output terminals 1 after a predetermined time interval has passed. That is, when a certain subscriber requests an output of an output list via input/output terminals 1, data output processor 35 refers to output list file 48 thereby to transfer the output list data requested by the subscriber toward the input/output terminals. The subscriber can obtain information as to the other party during his or her travel by referring to an output list displayed on display unit 12. The output list is allowed to be output even via printer 13 if necessary. In such a manner, if the subscriber makes access to the information providing system shown in Fig. 1, then the subscriber can obtain the output lists shown in, for example, Figs. 8 and 9. By referring to the output lists, the subscriber recognizes that it is possible to meet with a person who the subscriber expects to meet on his or her travel schedule. The subscriber can communicate with a desired person prior to or during travel, so that an expected meeting can be realized. Although the present invention has been described and illustrated in detail, it is clearly understood that the same is by way of illustration and example only and is not to be taken by way of limitation, the scope of the present invention being limited only by the terms of the appended claims.

Claims: Method for determining the feasibility of meetings between members of a plurality of subscribers (1) connected through a communication network (2) with a host computer, using personal attributes data and schedule data, the method comprising the following steps executed in the host computer: receiving from each subscriber and storing in coded form inputs representing personal attributes data and schedule data of the given subscriber and desired attributes data of a person he may wish to meet, said schedule data representing times and places, processing the stored inputs to produce a file (43) indicating, for each subscriber, the corresponding personal attributes data and schedule data; comparing the contents of the file (43) with the desired attributes data and the schedule data of each subscriber to determine, for each subscriber, an expected number of feasible meetings with another subscriber; extracting and transferring to an output file (48) the personal attributes data and schedule data relating to each subscriber and to the other subscribers with whom a meeting is feasible where the said expected number is not lower than 2; and supplying to each subscriber, from the output file (48), the personal attributes data and schedule data of other subscribers, if any, with whom a meeting is feasible. Method according to claim 1 in which the input representing the personal attributes of the subscriber includes, in coded form, at least one of his birthplace, alma mater, family data, origins and interest. Method according to claim 1 or claim 2, in which the schedule data include, for each time interval, a plurality of place codes determining places sequentially from larger to smaller areas, and an expected meeting number is generated corresponding to each place code. A host computer to execute said steps of the method according to claim 1, 2 or 3 comprising: data storage means (41,42) for storing inputs representing personal attributes data and schedule data of a given subscriber, and desired attributes data of a person he may wish to meet, said schedule data representing times and places; processing means (32) for processing the stored inputs to produce a file (43) indicating, for each subscriber, the corresponding personal attributes data and schedule data; means (33) for comparing the contents of the file (43) with the desired attributes data and the schedule data of each subscriber to determine, for each subscriber, an expected number of feasible meetings with another subscriber; means (34,47) for extracting and transferring to an output file (48), where the said expected number is not lower than 2, the personal attribute data and schedule data relating to each subscriber and to the other subscribers with whom a meeting is feasible; and means 30,35 for supplying to each subscriber, from the output file (48), the personal attributes data and schedule data of other subscribers, if any, with whom a meeting is feasible. A communication system comprised of: the host computer (3) of claim 4; a plurality of subscriber terminals (1) for sending said inputs representing respective personal attributes data, schedule data, and desired attributes data, to said host computer (3), and for receiving from said host computer (3) said personal attributes data and schedule data of other subscribers, with whom a meeting is feasible; and a communications network (2) connecting said plurality of subscriber terminals (1) to said host computer (3).

Inventors: SENDA KIMIHIRO, SENDA, KIMIHIRO, Senda, Kimihiro, c/o Mitsubishi Denki K.K.
Applicants: MITSUBISHI ELECTRIC CORP, MITSUBISHI DENKI KABUSHIKI KAISHA
Application year: 1992
Main classification: G06F17
IPC codes: G06F7, G06Q99