JP2010157050A - Apparatus and program for processing information - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide an information processing apparatus and information processing program for facilitating finding of target individual information. <P>SOLUTION: The individual information of a candidate of high relationship degree by a priority division is displayed at a higher grade (relatively remarkable position). In other words, the individual information of a candidate of low relationship degree with a priority division is displayed at a lower grade (relatively hardly remarkable position). Thus a user of a PC2A easily finds a target mail address. This is based on a trend that, when electronic mails are exchanged in a corporate organization, many electronic mails are transmitted between a certain division and circumferential divisions having higher relationship degree with the certain division. <P>COPYRIGHT: (C)2010,JPO&INPIT

Description

  The present invention relates to an information processing apparatus and an information processing program.

  An LDAP server is known as a server for managing e-mail addresses, employee information, and the like in an organization such as a company where a large number of people belong. The LDAP server arranges a plurality of directories in a hierarchical structure. As shown in the organization chart, the company organization has departments that have a hierarchical structure. Therefore, according to the LDAP server, the email addresses and employee information of all employees are managed in a directory according to department, Useful for managing information on the number of people.

In order to extract the email address and employee information of a desired person from such an LDAP server or an address book in which a large number of email addresses are registered, the user uses, for example, the name of the target person as a search condition. Enter. Then, the person who matches this search condition can be extracted as a candidate and the mail address can be extracted from the LDAP server or the like, so that the user can send the e-mail using this to send the e-mail address one character at a time. It is possible to save the trouble of inputting.
JP 2007-96706 A JP 2004-274486 A

  However, since information on a plurality of candidates is extracted depending on the search condition, there is a problem that it is troublesome to find information on a desired person from among the information.

  The present invention has been made to solve the above-described problems, and an object of the present invention is to provide an information processing apparatus and an information processing program that make it easy to find target individual information.

  In order to achieve this object, the information processing apparatus according to claim 1 is capable of communicating with storage means for storing individual information on a plurality of persons belonging to a group constituting an organization, and is input by a user. An extraction means for extracting individual information of the person from the storage means, a specifying means for specifying one of the groups constituting the organization as a priority group, and the extraction And display means for displaying the individual information of each candidate extracted by the means in order in the order of the degree of association in the organization between the group to which each candidate belongs and the priority group.

  The information processing device according to claim 2 is the information processing device according to claim 1, wherein the storage unit uses a tree structure in which nodes corresponding to the group are connected by an edge representing a relationship between the groups in the organization. The degree of association corresponding to the number indicating the number of the edges between the node corresponding to the group to which the candidate belongs and the node corresponding to the priority group. A first relevance level acquisition unit is provided, and the display unit displays individual information of each candidate extracted by the extraction unit according to the relevance level acquired by the first relevance level acquisition unit.

  An information processing apparatus according to claim 3 is the information processing apparatus according to claim 1, wherein belonging information extracting means for extracting a character string specifying a group to which each candidate belongs as candidate belonging information; A second relevance level acquisition unit configured to compare a character string constituting the information with a character string specifying the priority group and acquire a value corresponding to the number of matching characters as a relevance level; Displays the individual information of each candidate extracted by the extraction means according to the degree of association acquired by the second degree of association acquisition means.

  The information processing apparatus according to claim 4 is the information processing apparatus according to claim 3, wherein the group constituting the organization forms a hierarchical structure in which a group in an upper hierarchy includes a group in a lower hierarchy, The candidate affiliation information extracted by the affiliation information extraction means is the name of each group existing from the group arranged in the upper hierarchy of the group to which the candidate belongs to the group to which the candidate belongs, and the organization hierarchy It is composed of character strings arranged in order from the upper layer of the structure, and the character string specifying the priority group is each existing from the group arranged in the upper layer of the priority group to the priority group in the hierarchical structure of the organization The name of the group is composed of a character string arranged in order from the upper hierarchy of the hierarchical structure of the organization, and the second relevance acquisition means is the candidate A character string constituting the affiliation information, between the character string for specifying the priority group, the value corresponding to the number of characters that match continuously from the beginning of the string, obtains as a relevance.

  The information processing device according to claim 5 transmits information by using contact information representing a person's contact information included in the individual information in the information processing device according to any one of claims 1 to 4. An information transmission unit is provided, and the identification unit identifies, as the priority group, a group having the largest number of transmissions as a group to which a transmission destination person belongs in the transmission history of the information transmission unit.

  The information processing program according to claim 6 is a candidate for a person who satisfies a condition that a user inputs, as an information processing apparatus capable of communicating with storage means for storing individual information about a plurality of persons belonging to a group constituting an organization. , Extraction means for extracting individual information of the person from the storage means, identification means for specifying one of the groups constituting the organization as a priority group, and each candidate extracted by the extraction means The individual information is caused to function as a display unit that displays the individual information in an order in which the degree of association in the organization between the group to which each candidate belongs and the priority group is high.

  According to the information processing apparatus according to claim 1, the individual information of each candidate is displayed side by side in the order in which the degree of association in the organization between the group to which each candidate belongs and the priority group is high. There is an effect that it is easy to discover individual information. “Individual information of each candidate is displayed side by side in the order of high degree of association” means that individual information of candidates belonging to a highly relevant group is more relevant so that it is more noticeable. This means that candidate contact information is displayed in order. For example, the individual information of each candidate may be displayed side by side in an order from the top to the bottom of the display screen so that the degree of association with the priority group decreases. The individual information of each candidate may be displayed side by side in an order in which the degree of association becomes low toward. When the individual information includes a plurality of items, the display unit may display all of the plurality of items included in the individual information, or may display only a part of the items. .

  According to the information processing device according to claim 2, in addition to the effect produced by the information processing device according to claim 1, the edge representing the relationship between the groups corresponds to the node and the priority group corresponding to the group to which the candidate belongs. Since the value corresponding to the number indicating how many nodes exist is obtained as the degree of association, there is an effect that the degree of association that appropriately represents the degree of association in the organization can be obtained.

  According to the information processing device according to claim 3, in addition to the effect produced by the information processing device according to claim 1, based on the character string constituting the candidate affiliation information and the character string specifying the priority group, There is an effect that it is possible to acquire a degree of association that appropriately represents the degree of association in the organization.

  According to the information processing device according to claim 4, in addition to the effect produced by the information processing device according to claim 3, the value corresponding to the number of characters continuously matched from the beginning of the character string is set as the relevance level. There is an effect that a more appropriate degree of association can be acquired.

  According to the information processing apparatus of the fifth aspect, in addition to the effect produced by the information processing apparatus according to any one of the first to fourth aspects, in the transmission history, Since a group with a large number of transmissions is identified as a priority group, there is an effect that the user can easily find individual information that is highly likely to be used.

  According to the information processing program of the sixth aspect, the same effect as the information processing apparatus according to the first aspect is obtained.

  Hereinafter, preferred embodiments of the present invention will be described with reference to the accompanying drawings. FIG. 1 is an electrical block diagram showing an outline of a configuration of a communication system 1 including PCs (personal computers) 2A, 2B, and 2C according to the first embodiment of the present invention.

  The communication system 1 has a configuration in which PCs 2A, 2B, and 2C and a server 3 are connected via a LAN line 4, and is installed in a certain company organization, for example. Employees belonging to the company organization use the terminals such as PCs 2A, 2B, and 2C to access the server 3 and acquire individual information such as email addresses of other employees from the address book 31a stored in the server 3. be able to.

  In particular, the PCs 2A, 2B, and 2C correspond to an example of the information processing apparatus according to the present invention, and when the user obtains an e-mail from the address book 31a, the user selects the purpose from the individual information extracted as candidates. The extracted individual information is appropriately arranged and displayed so that the individual information can be easily found.

  The PC 2A mainly includes a CPU 11, a ROM 12, a RAM 13, a hard disk (hereinafter abbreviated as “HD”) 14, a keyboard 15, a mouse 16, a liquid crystal display (hereinafter abbreviated as “LCD”) 17, and an interface 19. These are connected to each other via a bus 20.

  The CPU 11 is an arithmetic device that controls each unit connected by the bus 20 in accordance with fixed values and programs stored in the ROM 12, the RAM 13, and the HD 14. The ROM 12 is a non-rewritable nonvolatile memory that stores programs and various settings for the CPU 11 to control input / output of each unit connected to the bus 20. The RAM 13 is a rewritable volatile memory for the CPU 11 to temporarily store various programs and data.

  The HD 14 is a rewritable nonvolatile memory disk that stores various programs executed by the CPU 11 such as an OS and application programs and various settings. In this HD 14, e-mail software 14a is installed. The e-mail software 14a is a program for executing processing for transmitting an e-mail or receiving an e-mail using a mail address selected by the user.

  The HD 14 is further provided with a transmission history memory 14b and a transmission ranking memory 14c. The contents of data stored in these memories will be described later with reference to FIG.

  The keyboard 15 and the mouse 16 are input devices for the user to input characters and instructions to the PC 2A. The LCD 17 is a display device that displays various results and information of a program executed by the CPU 11. The interface 19 is an interface for connecting to an external PC or the like via the LAN line 4 or the Internet line (not shown).

Since the PCs 2B and 2C are configured in the same manner as the PC 2A, detailed description thereof is omitted.

  Similarly to the PC 2A, the server 3 includes a CPU, ROM, RAM, keyboard, mouse, LCD, interface (not shown), and an HD 31. The HD 31 stores an address book 31a. The server 3 is configured as an LDAP server that can be accessed by a so-called LDAP (Lightweight Directory Access Protocol). A plurality of directories are provided in the address book 31a, and individual information including e-mail addresses and the like of employees of a company organization that uses this communication system is stored in each directory.

  FIG. 2 is a diagram schematically showing the data structure of the address book 31a managed by the server 3. As shown in FIG. The address book 31a stores individual employee information using directories arranged in a tree structure. In FIG. 2, each directory is represented as a node having a tree structure. As shown in FIG. 2, attribute information “ou = address book” indicating that the lower layer data is an address book is added to the node 33 (directory) at the apex. A node 34 corresponding to a department constituting the company organization is connected to the lower hierarchy of the apex node 33 via an edge 35. In FIG. 2, the department name representing the department is added as attribute information to the node 34 corresponding to the department constituting the company organization. Each node 34 is connected by an edge 35 representing the relationship between departments in the company organization.

  Here, it is assumed that the company organization that uses the communication system 1 is composed of a plurality of departments. The departments constituting the company organization form a hierarchical structure in which upper-level departments include lower-level departments.

  Specifically, it has “A Company” and “B Company” as departments in the highest hierarchy, and the company includes a general affairs department, a design department, and a manufacturing department in the lower hierarchy. And some parts contain 1G, 2G, 3G, etc. in a further lower layer. In the following description, units handled as a group within a company organization, such as “company”, “department”, and “G”, are each referred to as a “department” (an example of a group of the present invention).

  Then, the attribute information “ou = A company” and “ou = B company” indicating the department name of the department at the highest level in the company organization is added to the node 34 connected to the vertex node 33 and the edge 35. . The node 34 corresponding to each company and the lower-level node 34 connected by the edge 35 include attribute information “ou = general affairs department” and “ou = design department” indicating department names in the lower hierarchy of the company, respectively. And “ou = manufacturing department” are added. Further, when “G” is arranged in the lower hierarchy of the part, the node 34 corresponding to “G” is connected to the lower hierarchy of the node 34 corresponding to each part by the edge 35, and the attribute information “ou = 1G "," ou = 2G ", etc. are added.

  Further, a node 36 representing a person is arranged at the lowest level, and the name of the individual is added as attribute information. For example, in FIG. 2, a node 36 to which attribute information “ou = Brother Takeshi” indicating an individual's name is added is connected to a lower hierarchy of “2G” of “Design Department” of “A Company”. Similarly, a node 36 to which attribute information “ou = Brother Takashi” indicating an individual's name is added is connected to a lower hierarchy of “General Affairs Department” of “B Company”. As shown in FIG. 2, the node 36 representing a person stores at least a mail address (an example of contact information of the present invention) representing the contact information of the person. If the nodes 36 are illustrated for all the persons, it is difficult to see the drawing. In FIG. 2, only the two persons are illustrated for the nodes 36 representing the persons.

  Accordingly, the PC 2A can read the name of the person, department information indicating the department to which the person belongs, and an e-mail address indicating the contact information of the person from the address book 31a stored in the server 3. For convenience of explanation, a set of information including a person's name, department information, and e-mail address will be referred to as individual information of the person.

  The transmission history memory 14b and transmission ranking memory 14c provided in the PC 2A will be described with reference to FIG.

  FIG. 3A is a diagram schematically showing the configuration of the transmission history memory 14b. The transmission history memory 14b is a memory for storing the transmission history of e-mails, and uses individual information of an e-mail transmission destination individual, that is, a name, a mail address, and department information indicating the affiliation of the individual as a management number. Store in association with each other.

  Here, “department information” means a character string that can uniquely identify one of a plurality of departments constituting a company organization. For example, the department information of “General Affairs Department” included in “B Company” is composed of the character string “B Company General Affairs Department”. That is, the department information is constituted by a character string in which names of departments existing from a department arranged in an upper hierarchy of a department to the department are arranged in order from the upper hierarchy of the organization hierarchical structure. This department information corresponds to an example of affiliation information of the present invention.

  Note that the transmission history memory 14b in the present embodiment can store the transmission history for the last 20 cases, and after the transmission history for the 20 cases has been accumulated, the oldest transmission is sent each time an e-mail is sent. A description will be given assuming that the history is deleted and a new transmission history is stored.

  FIG. 3B is a diagram schematically showing the configuration of the transmission ranking memory 14c. The transmission ranking memory 14c is a memory that stores department information included in the transmission history for 20 cases stored in the transmission history memory 14b in the order of the number of e-mail transmissions. Specifically, the transmission ranking memory 14c stores the department information and the number of transmissions in association with the value indicating the ranking. The department information with a larger number of corresponding transmissions is associated with a higher ranking (that is, a ranking with a smaller value). Accordingly, the department information representing the department with the largest number of transmissions as the department to which the transmission destination person belongs in the latest 20 transmission histories is stored as the department information representing the department with the highest ranking. .

  For example, in the example shown in FIG. 3B, the user of the PC 2A transmits the most e-mail address to the “A company design department 1G”.

  The outline of the present invention will be described with reference to FIG. FIG. 4A is a diagram illustrating an example of an organization chart representing a company organization. In the description with reference to FIG. 4, it is assumed that a searcher who is a user of the PC 2A belongs to the “B company manufacturing department 1G”. In addition, it is assumed that the department ranked first in the PC 2A is the “A company design department 1G”. In other words, it is assumed that the most recent e-mail transmissions executed by the PC 2A were most frequently addressed to the “A company design department 1G”. The department ranked first is hereinafter referred to as “priority department”. In FIG. 4, “A Company Design Department 1G”, which is a priority department, is shown with a star mark.

  A case will be described in which a searcher who is a user of such a PC 2A reads individual employee information from the address book 31a (FIG. 2) and sends an e-mail. When the searcher inputs the character string “Brotherata” as a search condition by the address search process (described later with reference to FIG. 5) executed by the e-mail software 14a of the PC 2A, the PC 2A starts the character string representing the name. Individual information of persons including “Brotherata” is extracted from the address book 31a.

  In the example shown in FIG. 4, the PC 2A uses the characters “Brother Takashi” and “Brother Takeshi” that match the character string “Brother Data” input by the user in front (that is, matches the search condition) as candidates. The PC 2A extracts the individual information from the address book 31a.

  FIG. 4B is a diagram illustrating an example of a search result display screen displayed on the LCD 17 of the PC 2A. As shown in FIG. 4B, the individual information of the extracted candidates is displayed on the LCD 17 in the order in which the degree of association in the organization between the department to which each candidate belongs and the priority department is high. . Here, the “degree of association in the organization with the priority department” in the present embodiment specifically means the degree of proximity to the priority department in the organization chart as shown in FIG. Yes. For example, the “A Company Design Department 2G” is closer to the “A Company Design Department 1G”, which is the priority department, and is more relevant than the “B Company General Affairs Department”.

  Therefore, in the example illustrated in FIG. 4, the individual information of “Brother Takashi” is displayed after the individual information of “Brother Takeshi”. As described with reference to FIG. 4A, when “A Company Design Department 2G” to which “Brother Takeshi” belongs and “B Company General Affairs Department” to which “Brother Takashi” belongs are compared, “A This is because “Company Design Department 2G” is more related to “A Company General Affairs Department” which is the priority department.

  In the example shown in FIG. 4B, a cursor 37 is displayed on the search result display screen. The user can change the position of the cursor 37 by operating the keyboard 15 or the mouse 16 (FIG. 1) and select any individual information. The e-mail software 14a (FIG. 1) sets a candidate e-mail address specified by the selected individual information as an e-mail transmission destination. In the example shown in FIG. 4B, the name and department information among the individual pieces of candidate information are displayed, but an e-mail address may also be displayed.

  In this way, the individual information of the candidate having a higher degree of association with the priority department is displayed at a higher level (relatively conspicuous position), in other words, the individual information of the candidate having a lower degree of association with the priority department is lower By displaying it at a (relatively inconspicuous position), the user of the PC 2A can easily find the individual information of the target person.

  This is based on the tendency that when an electronic mail is exchanged within a company organization, an electronic mail is frequently transmitted to a certain department and a peripheral department having a high degree of association with the department. That is, it is easier for the user to find the individual information of the target person as compared with the case where the individual information of the candidates is displayed in the simple alphabetical order.

  In particular, when searching for email addresses in a company organization with a large number of employees, there are many employees with the same surname, and many candidates are extracted even if the search string is entered, so it is highly effective. Is obtained.

  Furthermore, according to the present embodiment, even if individual information displayed in a relatively conspicuous position is selected due to an error and an e-mail is sent to the wrong person, the department or the Since an e-mail is sent to a department that has a high degree of association with a department that frequently exchanges, it is possible to cause troubles to completely irrelevant departments or suppress the risk of information leakage.

  FIG. 5 is a flowchart showing the address search process. This process is executed according to the e-mail software 14a, and is executed when the user inputs an address search command.

  First, the CPU 11 refers to the transmission ranking memory 14c (FIG. 3B), and identifies the department represented by the department information corresponding to the first ranking as the priority department (S502). That is, one department is specified as a priority department among a plurality of departments constituting the company organization. Next, the CPU 11 determines whether or not a search character string as a search condition has been input (S504). If the determination in S504 is negative (S504: No), the process waits, but if a search character string is input (S504: Yes), the CPU 11 selects a person who satisfies the search condition input by the user as the candidate. Are extracted from the address book 31a (FIG. 1) of the server 3 (S506). In the present embodiment, it is assumed that a character string indicating a part or all of the name is input by the user as a search condition.

  Next, the CPU 11 executes relevance degree calculation processing (S508). This relevance calculation process (S508) counts how many edges 35 exist between the node 34 corresponding to the department to which each candidate belongs and the node 34 (FIG. 2) corresponding to the priority department. This is a process for acquiring the number as the relevance. Details of the relevance calculation processing (S508) will be described later with reference to FIG.

  Next, the CPU 11 displays the individual information of each candidate extracted in S506 according to the acquired degree of association, in order of the degree of association with the priority department (S509). Although details will be described later, according to the relevance degree calculation process (S508), the lower the degree of relevance with the priority department, the lower the relevance value is acquired. Therefore, in step S509, the relevance value is low. The individual information of each candidate is displayed side by side in this order.

  Next, the CPU 11 determines whether any candidate has been selected (S510). If the determination in S510 is negative (S510: No), the CPU 11 determines whether or not a new character is additionally input to the search character string (S512). If the determination in S512 is affirmative (S512: Yes), the CPU 11 further narrows down candidates that have already been extracted (S516), and returns to S510 to repeat the processing.

  On the other hand, when the determination in S512 is negative (S512: No), the CPU 11 determines whether or not the search character string has been changed (S514). If the determination in S514 is negative (S514: No), the process returns to S510 and is repeated.

  On the other hand, if the determination in S514 is affirmative (S514: Yes), the CPU 11 returns to S506 and repeats the process based on the changed search character string. That is, candidate individual information is extracted based on the changed search condition, the relevance calculation process (S508) is executed, and the individual information is displayed. Note that, for example, when one character is deleted from the last character of the search character string, the candidates extracted based on the changed search condition include the same candidates as those previously extracted. Therefore, since the relevance degree already acquired can be used for the same candidate as the previously extracted candidate, the relevance degree calculation process (S508) is executed only for the newly extracted candidate. You may do it. If the determination in S510 is affirmed while the process is repeated in this manner (S510: Yes), the address search process is terminated. The e-mail software 14a inputs the e-mail address included in the individual candidate information selected by the user as the e-mail transmission destination e-mail address. Therefore, it is possible to reduce the user's trouble of inputting the destination mail address character by character.

  According to the address search process of this embodiment, the contact information of each candidate is displayed side by side in the order in which the degree of association in the company organization between the department to which each candidate belongs and the priority department is high. Easy to find the target email address.

  FIG. 6 is a flowchart showing the relevance calculation process (S508). This degree-of-association calculation process (S508) is a process for acquiring a degree of association indicating the degree of association in the company organization between the department to which each candidate belongs and the priority department based on the department information of each candidate. In this process, the higher the degree of association between the department to which each candidate belongs and the priority department, the lower the degree of association is acquired.

  First, the CPU 11 reads candidate department information (S602). Then, the CPU 11 sets the department indicated by the department information to “B” (S604), and sets the variable “d” representing the degree of association to “0” (S606).

  Next, the CPU 11 determines whether “B” is a priority department (S608). If the determination in S608 is affirmative (S608: Yes), that is, if it is determined that the candidate belongs to the priority department, the CPU 11 stores the degree of association “d” (0 in this example) in association with the candidate. (S618).

  Then, the CPU 11 determines whether or not all candidates have been processed (S620). If the determination in S620 is negative (S620: No), the process returns to S602, and the process is repeated for the next candidate.

  If it is determined that “B” is not a priority department (S608: No), the CPU 11 determines whether “B” is a department in a higher hierarchy of the priority department (S610). If “B” is in the upper hierarchy of the priority department (S610: Yes), the department that is one hierarchy lower than “B” is designated as “B” (S612). On the other hand, when “B” is not in the upper hierarchy of the priority department (S610: No), the department that is one hierarchy higher than “B” is designated as “B” (S614). Then, “1” is added to “d” (S616), and the process returns to S608.

  If the determination in S608 is affirmed while the processing is repeated in this way (S608: Yes), the degree of association “d” at that time is stored in association with the candidate (S618). Then, the process is repeated until the determination in S620 is affirmed. When the determination in S620 is affirmed (S620: Yes), the relevance calculation process (S508) is terminated.

  According to the relevance calculation processing (S508), in the address book 31a, the edge 35 (FIG. 2) representing the relationship between departments is defined between the node 34 corresponding to the department to which the candidate belongs and the node 34 corresponding to the priority department. Since the value indicating how many exist in between is acquired as the degree of association, the degree of association that appropriately represents the degree of association in the organization can be obtained.

  FIG. 7 is a flowchart showing the e-mail transmission process. This e-mail transmission process is executed according to the e-mail software 14a. First, the CPU 11 transmits an e-mail using the e-mail address selected by the user (S701).

  Next, the CPU 11 reads out the oldest transmission history among the transmission histories stored in the transmission history memory 14b (FIG. 3A) (S702). Then, the CPU 11 determines whether or not the department information included in the read transmission history is in the transmission ranking memory 14c (S704).

  When the department information exists in the transmission ranking memory 14c (S704: Yes), the CPU 11 subtracts “1” from the number of transmissions corresponding to the department information (S708). Then, the CPU 11 compares the number of transmissions of the department information with the number of transmissions of department information that is one rank lower than the ranking of the department information (S710). When the number of transmissions of the department information is smaller than the number of transmissions of the department information of the next lower ranking (S710: Yes), the CPU 11 replaces the ranking with the next lower department information (S712), and returns to S710. . And CPU11 repeats a process until judgment of S710 is affirmed. That is, when deleting the oldest transmission history, the number of transmissions corresponding to the department information is decremented by “1”, so that the ranking of the lower ranking is compared with the number of transmissions of department information with a lower ranking. The ranking of the department information is lowered until it is determined that it is not less than the number of transmissions of department information.

  If the determination in S710 is negative while the process is repeated in this manner (S710: No), the process proceeds to S714.

  On the other hand, if the department information does not exist in the transmission ranking memory 14c (S704: No), it is not necessary to lower the ranking, and the process directly proceeds to S714.

  Next, the CPU 11 deletes the oldest transmission history by shifting the data stored in the transmission history memory 14b (S714). Then, the CPU 11 stores the latest transmission history in an empty area of the transmission history memory 14b generated by the data shift (S716). Then, the CPU 11 determines whether or not the department information included in the latest transmission history is in the transmission ranking memory 14c (FIG. 3B) (S718).

  When the department information included in the latest transmission history is in the transmission ranking memory 14c (S718: Yes), the CPU 11 adds “1” to the number of transmissions corresponding to the department information (S720). On the other hand, when the department information included in the latest transmission history is not in the transmission ranking memory 14c (S718: No), the CPU 11 associates “1” as the number of transmissions, and assigns the department information to the lowest rank of the transmission ranking memory 14c. (S722).

  Next, the CPU 11 determines whether or not the number of transmissions of the department information is greater than the number of transmissions of department information that is one rank higher (S724). If the determination in S724 is affirmative (S724: Yes), the CPU 11 replaces the department information and ranking by one (S726), and returns to the step of S724. That is, if the ranking is changed due to the addition of the latest transmission history, it is changed in S726.

  If the determination in S724 is negative (S724: No), the e-mail transmission process is terminated.

  According to the e-mail transmission post-process, every time the user transmits an e-mail, the latest transmission ranking at that time is created. Therefore, if there are a large number of emails sent to a certain department during a certain limited period (for example, one week), that department is switched to a priority department (that is, a department ranked first). Also, when the period ends and the number of emails sent to the relevant department decreases, other departments that are frequently exchanged in normal operations are switched to priority departments. Further, when electronic mail is frequently transmitted to persons in the same department, the own department can be set as the priority department. As described above, according to the e-mail transmission process shown in FIG. 7, the optimum department can always be set as the priority department. Also, if there are departments with the same number of transmissions, the departments that have been in the ranking from before are set to higher rankings, so that frequent replacement of rankings is suppressed. If there are a plurality of e-mail transmission destinations, the steps S704 to S712 and the steps S718 to S722 may be repeated until the department information of each person is processed.

  Next, a second embodiment of the present invention will be described with reference to FIG. The electrical configuration of the PC 2A according to the second embodiment is the same as that of the PC 2A according to the first embodiment, and thus detailed description thereof is omitted.

  FIG. 8 is a flowchart showing the degree-of-association calculation process (S800) executed in the PC 2A of the second embodiment. In the relevance level calculation process (S508) of the first embodiment described above, the node 34 corresponding to the department to which the candidate belongs and the priority department are handled as the degree of association representing the degree of association between the department to which the candidate belongs and the priority department. A value representing the number of edges 35 existing with the node 34 to be acquired has been acquired. In other words, the value indicating the degree of proximity between the two in the organization chart is regarded as the degree of association. On the other hand, in the relevance calculation process (S800) of the second embodiment, the character string constituting the candidate department information is compared with the character string representing the priority department, and a value corresponding to the number of matching characters is obtained. Get as relevance. The relevance level calculation process (S800) shown in FIG. 8 is executed instead of the relevance level calculation process (S508) of the first embodiment shown in FIG.

  First, the CPU 11 reads candidate department information (S802). This department information is configured in the same way as the department information described in the first embodiment, and is configured by a character string that uniquely identifies the department to which each candidate belongs. For example, in the case of “Brother Takeshi” belonging to “2G” of “Design Department” of “A Company”, the character string constituting the department information is “A Company Design Department 2G”.

  Next, the CPU 11 sets the character string constituting the candidate department information to “F” (S804), sets the variable “d” indicating the degree of association to “0” (S806), and sets the variable “i” to “1”. (S808). Next, the CPU 11 determines whether or not the i-th character of F matches the i-th character of the character string specifying the priority department (S810). Here, the character string that identifies the priority department is a character string of department information that identifies the priority department. Specifically, from the department arranged in the higher hierarchy of the priority department in the hierarchical structure of the organization. It is a character string in which the names of the departments existing up to the priority department are arranged in order from the upper hierarchy of the organization hierarchical structure.

  If the determination in S810 is negative (S810: No), that is, if the first character of F does not match the first character of the character string specifying the priority department, the CPU 11 sets “0” as the relevance d. Then, it is stored in association with the candidate for processing (S818). Next, it is determined whether all candidates have been processed (S820). If the determination in S820 is negative (S820: No), the process returns to S802, and the CPU 11 repeats the process for the next candidate.

  When it is determined that the i-th character of F matches the i-th character of the character string specifying the priority department (S810: Yes), the CPU 11 subtracts “1” from the variable “d” indicating the degree of association. Then, “1” is added to the variable “i” (S814). Next, the CPU 11 determines whether the variable “i” is larger than the number of characters of F, or whether the variable “i” is larger than the number of characters of the character string specifying the priority department (S816). Is denied (S816: No), the process returns to S810 and is repeated.

  When the determination in S810 is denied while the processing is repeated in this manner (S810: No), or the determination in S816 is affirmed (S816: Yes), the CPU 11 processes the relevance “d” as a processing target. Are stored in association with the candidates (S818). Then, the process is repeated until all candidate processes are processed. When the determination in S820 is affirmed (S820: Yes), the relevance calculation process (S800) is terminated.

  According to the second embodiment, the same effect as the first embodiment can be obtained. In particular, according to the relevance calculation processing (S800) of the second embodiment, the character string constituting the candidate department information and the character string specifying the priority department are continuously matched from the beginning of the character string. A value corresponding to the number of characters to be acquired can be acquired as the degree of association. Therefore, it is possible to acquire the degree of association that appropriately represents the degree of association in the organization. For example, when the priority department is a department included in the A company, the department included in the A company has a higher degree of association with the priority department than the department included in the B company (in other words, For example, there are many characters that match the character string that identifies the priority department). Therefore, the individual information of candidates belonging to Company A is displayed higher than the individual information of candidates belonging to Company B, and for users who frequently send e-mails to Company A, individual information of persons belonging to Company A is displayed. Are more likely to be discovered.

  The CPU 11 that executes the step of S506 corresponds to an example of an extraction unit. The CPU 11 that executes the step of S502 corresponds to an example of a specifying unit. The CPU 11 that executes step S509 corresponds to an example of a display unit. The CPU 11 that executes the relevance degree calculation process (FIG. 6) corresponds to an example of a first relevance degree acquisition unit. The CPU 1 that executes the step of S802 corresponds to an example of department information extraction means. The CPU 11 that executes the relevance degree calculation process (FIG. 8) corresponds to an example of a second relevance degree acquisition unit.

  Although the present invention has been described based on the embodiments, the present invention is not limited to the above-described embodiments, and various improvements and modifications can be easily made without departing from the spirit of the present invention. Can be inferred.

  For example, in the above embodiment, the server 3 is described as being configured with an LDAP server, but the present invention can also be applied to a case where the server 3 is not an LDPA server.

  In the above embodiment, the address book 31a stored in the server 3 has been described as being used in common by many users. However, even when individual information is read from the address book stored locally in each PC. The present invention can be applied.

  In the above embodiment, the description has been given using the PC. However, the present invention may be applied to a telephone or a facsimile machine. When extracting the individual information of the candidate that matches the name or the input number that has been entered in the telephone or the facsimile machine from the phone book stored in the server or the like, and selecting a desired telephone number or facsimile number from the candidate, You may comprise so that it may rearrange and display in the order based on a division. The same applies when a facsimile machine or electronic mail is transmitted by a multi-function machine having a facsimile function or an electronic mail transmission function.

  Further, in the above embodiment, the individual information of all candidates is displayed side by side at a time. However, for example, the individual information may be viewed little by little in order by scroll display. In that case, it may be configured such that individual information of a person belonging to a department highly related to the priority department is displayed in an earlier order.

  The above communication system has been described as being used in a certain company organization. However, the communication system is not limited to this. For all cases in which individual information of a person is acquired from storage means for storing individual information of a person constituting a certain organization. Applicable.

  In the above embodiment, there is only one priority department. However, two or more priority departments are identified, and the degree of relevance with the priority department ranked first is given a higher weight, and the ranking second place. The degree of association with the priority department below may be configured to obtain a degree of association representing the degree of association between the department to which the candidate belongs and the priority department by applying a smaller weight. Also, instead of simply determining the priority department based on the number of transmissions, for example, a higher weight is applied to the number of transmissions of departments belonging to the same company, and a smaller weight is applied to the transmissions of departments belonging to other companies. To obtain a ranking, and a priority department may be specified based on the ranking.

It is an electrical block diagram which shows the outline | summary of a structure of the communication system containing PC which is 1st Embodiment of this invention. It is the figure which showed typically the data structure of the address book which a server manages. (A) is a figure which shows the structure of a transmission history memory typically, (b) is a figure which shows the structure of a transmission ranking memory typically. (A) is an example of an organization chart showing a company organization, and (b) is an example of a search result display screen displayed on the LCD of a PC. It is a flowchart which shows an address search process. It is a flowchart which shows the relevance degree calculation process of 1st Embodiment. It is a flowchart which shows an email transmission process. It is a flowchart which shows the relevance degree calculation process of 2nd Embodiment.

Explanation of symbols

2A PC
3 Server 31a Address book

Claims (6)

In an information processing apparatus capable of communicating with storage means for storing individual information about a plurality of persons belonging to a group constituting an organization,
An extraction means for extracting individual information of the person from the storage means as a candidate satisfying a condition input by the user;
A specifying means for specifying one of the groups constituting the organization as a priority group;
And display means for displaying the individual information of each candidate extracted by the extracting means in a sequence in which the degree of association in the organization between the group to which each candidate belongs and the priority group is arranged. Information processing apparatus. The storage means stores data using a tree structure in which nodes corresponding to the group are connected by an edge representing an association between groups in the organization,
A first degree-of-association obtaining unit that obtains a degree of association corresponding to a number indicating how many edges exist between a node corresponding to the group to which the candidate belongs and a node corresponding to the priority group;
The information processing apparatus according to claim 1, wherein the display unit displays individual information of each candidate extracted by the extraction unit in accordance with the association degree acquired by the first association degree acquisition unit. Affiliation information extraction means for extracting a character string that identifies a group to which each candidate belongs, as affiliation information of the candidate,
A second relevance level acquisition unit configured to compare a character string constituting the candidate affiliation information with a character string specifying the priority group and acquire a value corresponding to the number of matching characters as a relevance level; ,
The information processing apparatus according to claim 1, wherein the display unit displays individual information of each candidate extracted by the extraction unit according to the degree of association acquired by the second association degree acquisition unit. The group constituting the organization forms a hierarchical structure in which an upper layer group includes a lower layer group,
The candidate belonging information extracted by the belonging information extracting means is:
The name of each group existing from the group arranged in the upper hierarchy of the group to which the candidate belongs to the group to which the candidate belongs, is composed of a character string arranged in order from the upper hierarchy of the hierarchical structure of the organization,
The character string specifying the priority group is
In the hierarchical structure of the organization, the name of each group existing from the group arranged in the upper hierarchy of the priority group to the priority group is composed of a character string arranged in order from the upper hierarchy of the hierarchical structure of the organization,
The second relevance level acquisition means is
A value corresponding to the number of characters that continuously match from the beginning of the character string between the character string that constitutes the candidate affiliation information and the character string that identifies the priority group is acquired as the degree of association. The information processing apparatus according to claim 3. Using the contact information representing the contact information of the person included in the individual information, the information transmitting means for transmitting information,
The identification unit identifies, as the priority group, a group having the largest number of transmissions as a group to which a transmission destination person belongs in a transmission history by the information transmission unit. 5. The information processing apparatus according to any one of 4. An information processing apparatus capable of communicating with storage means for storing individual information about a plurality of persons belonging to a group constituting an organization,
An extraction means for extracting individual information of the person from the storage means as a candidate satisfying a condition input by the user;
A specifying means for specifying one of the groups constituting the organization as a priority group;
The individual information of each candidate extracted by the extraction unit is made to function as a display unit that displays the information in a sequence in which the degree of association in the organization between the group to which the candidate belongs and the priority group is high. Information processing program.

Images