Patent Application
20070283206
Exemplary embodiments of a reliability evaluation device and a computer program product according to the present invention are explained below in detail referring to the accompanying drawings. While the reliability evaluation device and the computer program product are applied to a procedure of renewing a driver's license (hereinafter, “license”) according to the following embodiment, the present invention is not limited to the embodiments explained below.
The license renewal procedure is a procedure to replace a license that has passed a validity period (hereinafter, “old license”) with a license having a new validity period (hereinafter, “new license”).
In the license renewal procedure, an applicant submits an application form that includes a name, an address, and a photograph (hereinafter, “photo”) of the applicant to a person at a reception desk (hereinafter, “receptionist”) and the identity is thereby verified. The receptionist compares the photo on the old license with the figure (face) of the applicant, and verifies that the applicant is a legitimate owner of the old license. The receptionist then compares the photo and the description on the old license with those on the application form, and verifies that the photo on the application form is that of the applicant and that the description is correct.
The applicant proceeds with necessary processes by bringing the application form, and receives the new license at last. A person in an applied party in charge of each process compares the photo on the application form with the figure of the applicant, and verifies the legitimateness of the applicant. In this manner, in the license renewal procedure, personal identification is performed at each step using the application form as an identification certificate.
To evaluate reliability of the application procedure, it is required to track the relations between the identification certificates and the applicant (hereinafter, “objects”) compared in the verification at each step based on the procedure described above, and systematically determine the legitimateness of the relations. The reliability evaluation method according to an embodiment of the present invention includes arrangement of the comparison relation in the form of a matrix data. The matrix is herein referred to as an action matrix.
To distinguish the object by the step of the application procedure, an object used at a predetermined step is described herein as
<object name>@<person in the applied party in charge of the predetermined step>.
For example, an “application form@receptionist” and an “application form@examiner” are regarded as different items though they actually refer to the same item. The examiner is a person in the applied party in charge of examining visual acuity and the like of the applicant.
Attributes such as the photo, the name, the address, and the figure included in the objects are also arranged in the top row and the leftmost column of the action matrix as elements of each object. The object including the attribute at the predetermined step is described herein as
<object name>@<person in the applied party in charge of the predetermined step>.<attribute name>.
At an intersection of a column and a row of the attributes in the top row and the leftmost column, an action indicative of the comparison relation between the attributes is set. For example, an action “move” indicates a move of the attribute accompanying the move of the applicant. An action “transfer” indicates a delivery of the attribute by the person in the applied party, and an action “bring” indicates the delivery of the attribute by the applicant.
An action “compare” indicates comparison by the person in the applied party to check identity of objects, an action “photograph” indicates taking a picture of the applicant by the person in the applied party, and an action “transcript” indicates transcription of the attribute to another document by the person in the applied party.
Each action is directional, and is set in the action matrix so that information flows from the attribute in the top row to the attribute in the leftmost column. The “compare” is generally regarded as bidirectional; however, the “compare” is regarded as a directional action in which the object that the person in the applied party trusts more is regarded as an original and the other object is regarded as a target of the comparison. In other words, the person that performs the comparison copies reliability of the original of the comparison to the target of the comparison by performing the comparison.
The attribute in the leftmost column associated with that in the top row via the action appears in the next step as the attribute with the same name in the top row, which is again associated with another attribute in the leftmost column via an action. Repetition of the association between the attributes until the end of the application procedure is serially represented in the action matrix.
The action matrix shown in
The action matrix further indicates that the photo, the name, and the address on the old license are compared with those on the application form by the receptionist, that those on the application form being the target move to the examiner because the applicant brings them, and that the photo on the application form is then compared with the figure of the applicant by the examiner.
Each action can be assigned with a reliability. The reliability corresponding to each of the actions “move”, “transfer”, and “bring” indicates how accurately the attribute is delivered. The reliability corresponding to each of the actions “photograph” and “transcript” indicates how accurately the attribute is copied. The reliability corresponding to the action “compare” indicates how accurately the attribute is compared.
A photographer herein indicates a person in the applied party in charge of taking a picture for the new license. A creator herein indicates a person in the applied party in charge of creating the new license. An issuer herein indicates a person in the applied party in charge of issuing the new license.
In the example, because the action taken by the applied party is assumed to be reliable, the reliabilities of the actions “compare”, “photograph”, “transfer”, and “transcript” are all one. On the contrary, because it is assumed that the action taken by the applicant can be dishonest, the reliability of the “move” is zero, the reliability of the “bring” of the photo on the application form from the receptionist to the examiner is 0.8, and the reliability of the “bring” of the photo on the application form from the examiner to the photographer is 0.9. The reliabilities of the “bring” are different depending on, for example, the distance and time required for the applicant to deliver the attribute.
In this manner, the association among the attributes in the action matrix can be represented by the diagram that connects nodes indicative of the object and the attribute thereof at a certain step with a path indicative of the action. Each of the paths includes a reliability assigned to the corresponding action.
The node 31 has paths to the nodes 32 and 35, and the node 32 has a path to the node 33. The node 33 has paths to the nodes 34 and 36, and the node 34 has a path to the node 37. The node 35 has a path to the node 36, and the node 36 has a path to the node 37.
The node 31 is a starting point of the application procedure. The reliability evaluation method according to the present embodiment is explained as a method of evaluating the reliability of the application procedure at the node 37.
The reliability at the starting point is delivered to a node of which the reliability is evaluated (hereinafter, “verification point”) via the paths that connect the nodes, and the delivered reliability can be regarded as the reliability of the application procedure at the verification point (hereinafter, “verification-point reliability”).
The reliability at the starting point decreases when passing through a path with a low reliability by the amount of the difference in reliability. In other words, the verification-point reliability can be high if the reliability of each path between the starting point and the verification point is high, and it is low if the reliability of each path between the starting point and the verification point is low.
While the example shown in
In summary, a verification-point reliability N can be obtained using the following equation:
N=max(R1,R2,R3, . . . ,Rn) (1)
The Ri indicates the reliability of the application procedure via an i-th route among n routes, and the max( ) indicates a function to calculate a maximum value. The Ri can be obtained using the following equation:
R
i
=Y·X
i1
·X
i2
·X
i3· . . . ·Xim (2)
The Y indicates the reliability at the starting point, and the Xij indicates the reliability of a j-th path in the i-th route. An equation to calculate the verification-point reliability N can be defined also by one of the following equations:
N=min(R1,R2,R3, . . . ,Rn) (3)
N=ave(R1,R2,R3, . . . ,Rn) (4)
The min( ) indicates a function to calculate a minimum value, and the ave( ) indicates a function to calculate an average value. In a certain type of the application procedure, only one of the routes can be used. In such a case, the Equation 3 is suitable for most strictly evaluating the reliability assuming the worst case. The Equation 4 is suitable for slightly less strictly evaluating the reliability.
Moreover, a plurality of the verification points can be provided to evaluate a total reliability of the application procedure by combining the verification point reliabilities. A total reliability C resulting from combining the p verification point reliabilities can be obtained by, for example, using the following equation:
C=N
1
·N
2
·N
3
· . . . ·N
p (5)
According to the Equation 5, a product of the verification point reliabilities is the total reliability, and the reliability is assumed to be guaranteed at all of the p verification points. Another equation can be used depending on the purpose. For example, when the reliability needs to be guaranteed at only one verification point, a sum of the verification point reliabilities is defined as the total reliability that is obtained by the following equation:
C=N
1
+N
2
+N
3
+ . . . +N
p (6)
Furthermore, when importance varies depending on the verification point, a weight can be applied to each verification point as calculated by the following equation:
C=a
1
·N
1
+a
2
·N
2
+a
3
·N
3
+ . . . +a
p
·N
p (7)
Returning to the explanation of
The verification point reliabilities are calculated using the Equation 1 and the Equation 2 assuming the reliability at the starting point to be one. When the verification point reliabilities are assigned to the Equation 5, the total reliability is about 0.41.
The storage unit 110 stores therein various types of information such as object information 111, attribute information 112, object-attribute information 113, node information 114, and path information 115.
The object information 111 includes a list of objects used for verifications performed at the steps of the application procedure.
In the first line item, the object ID is “OB001”, and the object name is “old license”. This indicates that there is an object named “old license” and that the object is identified by the object ID “OB001”.
The attribute information 112 includes a list of attributes that can be included in the objects.
The associated attribute is an attribute ID of another attribute that can be compared with the attribute. Generally, the same type of attributes is compared with each other; however, sometimes different attributes are compared like a photo and a figure. When there is a different attribute to be compared with, the attribute ID is registered as the associated attribute, and when there is not a different attribute to be compared with, the cell of the associated attribute is blank.
In the first line item, the attribute ID is “AT001”, the attribute name is “photo”, and the associated attribute is “AT004”. This indicates that there is an attribute named “photo”, that it is identified by the attribute ID “AT001”, and that it can be compared with another attribute identified by the attribute ID “AT004” as well as the same attribute.
The object-attribute information 113 includes the association between the objects and the attributes.
The object ID corresponds to that in the object information 111, and the attribute ID corresponds to that in the attribute information 112. The combination of the object ID and the attribute ID in the same line item indicates that the object identified by the object ID includes the attribute identified by the attribute ID. The remark indicates a free comment.
In the first line item, the object ID is “OB001”, and the attribute ID is “AT001”. This indicates that the object named “old license” identified by the object ID “OB001” includes the attribute named “photo” identified by the attribute ID “AT001”.
A single object can include a plurality of the attributes, and the object-attribute information 113 includes the same number of line items as that of the attributes included in the object.
The node information 114 manages the objects with respect to each step of the application procedure, and corresponds to the information in the top row and the leftmost column of the action matrix.
The node name is used to distinguish objects used at a predetermined step of the application procedure, and described as
<object name>@<person in the applied party in charge of the predetermined step>.
The object ID corresponds to that in the object information 111. The occurrence order is the order of occurrence of the nodes that uses the object in the application procedure, and the node with a smaller value occurs earlier.
In the first line item, the node name is “old license@receptionest”, the object ID is “OB001”, and the occurrence order is “1”. This indicates that the object named “old license” identified by the object ID “OB001” is distinguished from the same object used at another step by the node name “old license@receptionest”, and that the object appears at the earliest stage of the application procedure.
The path information 115 indicates the association among the nodes in the node information 114, and corresponds to the information in the cells of the action matrix.
The node name and the attribute ID of the origin indicate the node at which information originates and the attribute of the node. The node name and the attribute ID of the destination indicate the node to which the information is delivered and the attribute of the node.
The action indicates the name of the action that associates two nodes, and the path reliability indicates the reliability of the action. The verification-point flag indicates one when the destination is the verification point, and otherwise indicates zero. The verification-point reliability indicates the computed reliability of the verification point when the destination is the verification point.
In the first line item shown in
The controlling unit 120 controls the entire reliability evaluation device 100, and includes a user-interface controlling unit 121, an input supporting unit 122, a route acquiring unit 123, a verification-point-reliability computing unit 124, a total-reliability computing unit 125, a reliability simulating unit 126, and an information visualizing unit 127.
The user-interface controlling unit 121 controls the user interface 130 to input and output information.
The input/output screen takes a form of the action matrix. The action matrix is user-friendly because it enables the user to instinctively input the information.
To display the input/output screen, the user-interface controlling unit 121 arranges the data in the path information 115 in the top row and the leftmost column in the occurrence order, acquires the attributes corresponding to the objects in each node by referring to the object-attribute information 113 and the attribute information 112, and adds the acquired attributes to the top row and the leftmost column.
The user-interface controlling unit 121 displays the data in the path information 115 in a corresponding cell on the action matrix. For example, because the first line item in
Because a second line item in
Because the value of the verification-point flag in the second line item is one, the user-interface controlling unit 121 displays one in the upper part of a verification-point reliability cell 6 at the left end of the row that includes the cell 2. This indicates that the corresponding node is the verification point. The screen also displays the result of the evaluation of the reliability, and the computed verification-point reliability is displayed in the lower part of the verification-point reliability cell 6.
After displaying all data in the path information 115 in the action matrix, the user-interface controlling unit 121 accepts the addition of the action, the correction of the action, the deletion of the action, the setup of the path reliability, the correction of the path reliability, the setup of the starting point, the setup of the verification point, and the like from the user. The user-interface controlling unit 121 then reflects the result on the path information 115.
The input supporting unit 122 supports the input of information to the input/output screen. For example, the action “compare” can be performed only between the same attributes or the attributes associated by the attribute information 112. The action “compare” cannot be set for the attribute that has not yet appeared in the application procedure.
The input supporting unit 122 determines whether the action “compare” can be set based on the associated attribute in the attribute information 112 and the occurrence order in the node information 114. When the user tries to add the action “compare” to a certain attribute, the input supporting unit 122 presents candidates of the attribute that can be compared with the certain attribute. Moreover, the input supporting unit 122 issues a warning when the user terminates the editing operation with the starting point unconnected with any of the verification points.
The route acquiring unit 123 acquires a route from the starting point to the verification point required for evaluating the reliability of the application procedure based on the path information 115. The verification-point-reliability computing unit 124 computes the verification point reliabilities using the acquired route. The Equation 1, the Equation 2, and the like are used to compute the verification point reliabilities.
The total-reliability computing unit 125 computes the total reliability based on the verification point reliabilities computed by the verification-point-reliability computing unit 124. The Equation 5 and the like are used to compute the total reliability.
The reliability simulating unit 126 verifies how the reliability of the application procedure changes when a certain condition is changed. The reliability simulating unit 126 creates a copy of the path information 115, instructs the route acquiring unit 123 and the verification-point-reliability computing unit 124 to compute the verification reliability based on the copy that is modified using the screen shown in
The user can use the function to verify how much the reliability of the application procedure improves when a comparison between certain attributes is added. The verification result when the comparison and the path reliability one is added to a cell 3 in
The result indicates that the reliability cannot be improved by adding the comparison to the cell 3.
Moreover, the function enables the user to verify how much the reliability of the application procedure decreases when a comparison between certain attributes is omitted. The verification results when a comparison A is omitted from a cell 1 and when a comparison B is omitted from the cell 2 in
The result indicates that the reliability can be compensated by later comparisons when the comparison A is omitted, and that the reliability greatly decreases through the entire application procedure when the comparison B is omitted.
Moreover, the reliability simulating unit 126 can simulate how the reliability of the application procedure changes when the path reliability of an action varies in a predetermined range and plot a graph of the result.
It is known from the graph that the reliability cannot improve by adding the comparison to the cell 3. It is also known that the verification-point reliability is not affected by the improvement of the reliability of the action “move” in the cell 4 as long as the reliability is equal to or less than 0.9.
Furthermore, the reliability simulating unit 126 can compute an amount of virtual change when the path reliability at each action varies in a narrow range (δ×) and an amount of the accompanying change of the reliability at the verification point (δC), perform a sensitivity analysis by calculating a quotient of the amounts (δC/δX), thereby find actions highly effective to improve the verification-point reliability, and present the actions to the user.
The user can effectively design and improve the application procedure by using the functions of the reliability simulating unit 126.
The information visualizing unit 127 divides the action matrix and displays the divided action matrix in two or three dimensions. As described above, in the action matrix, the attribute in the leftmost column associated with the attribute in the top row through the action appears in the next step as the attribute with the same name in the top row. In a large action matrix, it is difficult to visually recognize both of the attributes with the same name in the leftmost column and the top row.
The information visualizing unit 127 improves the visibility of the associated attributes in the leftmost column and the top row by dividing the action matrix and displaying the divided action matrix in two or three dimensions as shown in
The process performed by the reliability evaluation device 100 shown in
As shown in
If the current node after the move is an end point and not a verification point (YES at step S104), the process control returns to the former node, sets the returned path as an explored path, deletes the returned path from the visiting path string (step S108), and resumes from the step S102.
If the current node after the move is not the end point (NO at step S104) and not the verification point (NO at step S105), the process resumes from the step S102 without any other operation. If the current node is not the end point (NO at step S104) but the verification point (YES at step S105), contents of the visiting path string is recorded in a reached route list (step S106), the step S108 is performed, and the process resumes from the step S102.
If the information read by the route acquiring unit 123 does not include an unexplored path from the current node (NO at step S102) and the current node is not the starting point (NO at step S107), the step S108 is performed, and the process resumes from the step S102. If the current node is the starting point (YES at step S107), the verification-point-reliability computing unit 124 computes the reliability of each route recorded in the reached route list (step S109) and regards the maximum value of the computed result as the verification-point reliability (step S110).
When the maximum reliability among a plurality of the routes is used as the verification-point reliability, it is useless to continue exploring a route that has been proven to be less reliable than another route.
The route acquiring unit 123 reads all of the path information 115, regards the starting point as a current node, empties an explored route list, and assigns zero to a variable of the verification-point reliability (step S201).
If the read information includes any unexplored path from the current node (YES at step S202), the route acquiring unit 123 checks whether there is a route that passes through any unexplored path and that is not enlisted in the explored route list. If there is no such route (NO at step S203), the process control returns to the former node (step S210) and resumes from the step S202.
If there is a route that satisfies the conditions at step S203 (YES at step S203), the process moves to another node via any one of the paths and the verification-point-reliability computing unit 124 computes the reliability of the route from the starting point to the current node (step S204). If the computed reliability is less than the variable of the verification-point reliability (NO at step S205), the current route is included in the explored routes (step S209), the process control returns to the former node (step S210), and the process resumes from the step S202.
If the reliability computed at the step S204 is equal to or more than the variable of the Verification-point reliability (YES at step S205) and the current node after the move is the end point and not a verification point (YES at step S206), the process control returns to the former node, sets the returned path as an explored path (step S212), and resumes from the step S202.
If the current node after the move is not the end point (NO at step S206) and not the verification point (NO at step S207), the process resumes from the step S202 without any other operation. If the current node is not the end point (NO at step S206) but the verification point (YES at step S207), the reliability computed at the step S204 is set as the variable of the verification-point reliability (step S208), the process control returns to a former node, sets the returned path as an explored path (step S212), and resumes from the step S202.
If the read information does not include any unexplored path from the current node at the step S202 (NO at step S202) and the current node is not the starting point (NO at step S211), the process control returns to the former node, sets the returned path as an explored path (step S212), and resumes from the step S202. If the read information does not include any unexplored path from the current node at the step S202 (NO at step S202) and the current node is the starting point (YES at step S211), the value assigned to the variable of the verification-point reliability is determined to be the verification-point reliability (step S213).
The function of the reliability evaluation device 100 described above can be realized by executing a reliability evaluation program on a computer. An example of the computer that executes the reliability evaluation program is explained below.
The hard disk drive 1070 stores therein the reliability evaluation program 1071 with the function equivalent to the controlling unit 120 and a reliability evaluation data 1072 equivalent to various data stored in the storage unit 110. The reliability evaluation data 1072 can be separated and stored in other computers connected via the network.
The CPU 1010 reads the reliability evaluation program 1071 from the hard disk drive 1070 and develops it in the RAM 1060, whereby the reliability evaluation program 1071 functions as a reliability evaluation process 1061. The reliability evaluation process 1061 develops information read from the reliability evaluation data 1072 and the like in an area of the RAM 1060 assigned to the reliability evaluation process 1061 as needed, and processes various data based on the developed data and the like.
The reliability evaluation program 1071 does not necessarily need to be stored in the hard disk drive 1070; it can be stored in a recording medium such as a compact disk read only memory (CD-ROM) and executed by the computer 1000 reading it. The reliability evaluation program 1071 can be otherwise stored in another computer or a server connected to the computer 1000 via a public line, the Internet, a local area network, a wide area network, or the like, and executed by the computer 1000 reading it.
As described above, according to the present embodiment, a flow of the information transferred between the steps of the application procedure is defined as a path, and the reliability of the application procedure is computed based on the path reliability assigned to each path. As a result, the reliability of the application procedure can be quantitatively evaluated and the quantitative evaluation improves efficiency of the design works and the improvement works of the process in the application procedure.
While the embodiment was explained assuming that the reliability at the starting point be one, the reliability at the starting point does not necessarily need to be one. For example, comparing a license that has been used for the identity verification in many occasions through many renewals and a license that is being renewed for the first time, the former is assumed to be more reliable. In this manner, the reliability of the starting point can vary depending on the validity period, the use count, and the like of the object being the starting point.
According to an aspect of the present invention, a flow of the information transferred between the steps of the application procedure is defined as a path, and the reliability of the application procedure is computed based on the path reliability assigned to each path. This results in an advantage that the reliability of the application procedure can be quantitatively evaluated.
According to another aspect of the present invention, because various analyses and simulations can be performed by computing the reliability of the application procedure, the reliability can be computed and compared based on a variety of the application procedures, and efficiency of the design works and the improvement works of the process in the application procedure can be improved.
Although the invention has been described with respect to a specific embodiment for a complete and clear disclosure, the appended claims are not to be thus limited but are to be construed as embodying all modifications and alternative constructions that may occur to one skilled in the art that fairly fall within the basic teaching herein set forth.
| Number | Date | Country | Kind |
|---|---|---|---|
| 2006-135618 | May 2006 | JP | national |
