Abstract: A controller is configured to accept a user input from an input interface, access a memory storing tree information that includes pieces of information about a plurality of hierarchized elements, and generate a screen command related to a display screen of a display. The controller causes elements included in the tree information to be displayed on the display. When an element located in the center in the width direction of the display receives an expanding operation, child elements are expanded one layer below the element. When a parent element of child elements goes beyond the center in the width direction, in response to the width direction slide operation, the child elements subordinate to the element are hidden on the display.

Abstract: A controller is configured to accept a user input from an input interface, access a memory storing tree information that includes pieces of information about a plurality of hierarchized elements, and generate a screen command related to a display screen of a display. The controller causes elements included in the tree information to be displayed on the display. When an element located in the center in the width direction of the display receives an expanding operation, child elements are expanded one layer below the element. When a parent element of child elements goes beyond the center in the width direction, in response to the width direction slide operation, the child elements subordinate to the element are hidden on the display.

Abstract: A device for extracting deficient capability information that can be used for recruitment, training, or the like of a human resource, and the purpose thereof is to objectively extract a deficient capability of a target human resource with respect to a required capability. A matching dictionary having a tree structure is stored. A dictionary node required for a human resource in the matching dictionary is registered as a desire node. A technical tree is generated by applying the desire node to the tree structure. A dictionary node possessed by a target human resource in the matching dictionary is registered as a possession node. A skill tree is generated by applying the possession node to the tree structure. An allocated point based on an importance level and a coefficient based on a distance to the possession node 86 are given to each of the desire nodes.

Abstract: A device for calculating a matching score that can be used for recruitment, staffing, and evaluation of a human resource, and the purpose thereof is to calculate a matching score with high accuracy by a simple process while a relevance between items is also taken into consideration. A matching dictionary having a tree structure is stored. A dictionary node required for a human resource in the matching dictionary is registered as a desire node 84. A technical tree 80 is generated by applying the desire node 84 to the tree structure. A dictionary node possessed by a human resource candidate in the matching dictionary is registered as a possession node 86. A skill tree 82 is generated by applying the possession node 86 to the tree structure.

Abstract: Through a network, an administrative server is connected with a terminal of an applicant and a terminal of a company which is a seeker. The administrative server comprises an applicant information database which stores applicant information including a registered address of the applicant, and a seeker information database which stores requirement information including a registered address of the company. The administrative server calculates a matching score of the both based on the applicant information and the requirement information, and make the terminal of the applicant display an image picture of distributed seekers 52 when it is requested by the applicant. The image picture of distributed seekers 52 includes a neighboring map showing around an address designated by the applicant. On the neighboring map, there is shown matching scores of the applicant and the companies, each matching score being indicated at the registered address of the each company.

Abstract: The present disclosure relates to a matching apparatus for calculating a matching score between a company that desires to employ a student and a student that desires to be employed, and the purpose thereof is to calculate a matching score that accurately represents the matching degree between the two by using syllabuses of respective subjects. A job offerer such as a company inputs required skill items by specifying corresponding dictionary nodes “1001” and “1002”. All dictionary nodes are associated in advance with syllabuses having relevance thereto among the syllabuses prepared for the respective subjects. A job seeker such as a student submits information on subjects taken. Associations between the subjects taken and syllabuses thereof are stored.

Abstract: Through a network, an administrative server is connected with a terminal of an applicant and a terminal of a company which is a seeker. The administrative server comprises an applicant information database which stores applicant information including a registered address of the applicant, and a seeker information database which stores requirement information including a registered address of the company. The administrative server calculates a matching score of the both based on the applicant information and the requirement information, and make the terminal of the applicant display an image picture of distributed seekers 52 when it is requested by the applicant. The image picture of distributed seekers 52 includes a neighboring map showing around an address designated by the applicant. On the neighboring map, there is shown matching scores of the applicant and the companies, each matching score being indicated at the registered address of the each company.

Abstract: Through a network, an administrative server is connected with a terminal of an applicant and a terminal of a company which is a seeker. The administrative server comprises an applicant information database which stores applicant information including a registered address of the applicant, and a seeker information database which stores requirement information including a registered address of the company. The administrative server calculates a matching score of the both based on the applicant information and the requirement information, and make the terminal of the applicant display an image picture of distributed seekers 52 when it is requested by the applicant. The image picture of distributed seekers 52 includes a neighboring map showing around an address designated by the applicant. On the neighboring map, there is shown matching scores of the applicant and the companies, each matching score being indicated at the registered address of the each company.

Abstract: Through a network, an administrative server is connected with a terminal of an applicant and a terminal of a company which is a seeker. The administrative server comprises an applicant information database which stores applicant information including a registered address of the applicant, and a seeker information database which stores requirement information including a registered address of the company. The administrative server calculates a matching score of the both based on the applicant information and the requirement information, and make the terminal of the applicant display an image picture of distributed seekers 52 when it is requested by the applicant. The image picture of distributed seekers 52 includes a neighboring map showing around an address designated by the applicant. On the neighboring map, there is shown matching scores of the applicant and the companies, each matching score being indicated at the registered address of the each company.