Talent management system based on digital portrait evaluation system

Abstract

The invention discloses a talent management system based on a digital portrait evaluation system, which relates to the technical field of talent management, and is characterized in that evaluation index information is converted into binary data when a data protection module encrypts the evaluation index information, and the binary data is cut into protection word strings from left to right according to a specific cutting step length; according to the method, all bit weights of each protection word string are obtained, a replacement change path is determined in a protection table according to the bit weights, and a protection replacement sequence of each protection word string is obtained according to the replacement change path, so that a traditional mode of encrypting evaluation index information by using a secret key form is eliminated, and the encryption of the evaluation index information depends on the protection table; however, a specific cell is determined based on the bit weight of each protection word string in the protection table, so that uniqueness of encryption is ensured, the possibility of leakage of the evaluation index information due to leakage of the protection table is reduced, and the confidentiality and security of the evaluation index information in the transmission process are greatly improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of talent management, and particularly relates to a talent management system based on a digital portrait evaluation system. BACKGROUND

[0002] In today's competitive business environment, enterprises have increasingly high requirements for the refinement and scientific nature of talent management, and a talent management system based on a digital portrait evaluation system has emerged as the times require. It comprehensively depicts the characteristics of talents by integrating multi-dimensional data, thereby providing strong support for enterprise talent selection, training, promotion and other decision-making.

[0003] In the process of personnel evaluation management, talent-related information needs to be extracted from multiple systems within the target enterprise. This information contains a large amount of sensitive information related to employees' personal privacy, such as employees' performance data, salary information, work history, business operation details, and daily office behavior data. The security protection of this information is crucial, as it relates to employees' personal rights and interests and the information security of the enterprise.

[0004] Currently, in terms of information extraction and transmission security, a common method is to use keys. This method encrypts the extracted talent information, and only the recipient with the correct key can decrypt and obtain the original information during transmission. However, this key-based security mechanism relies too much on the key, which is the key to the entire security system. If the key is leaked, whether due to the improper behavior of internal personnel, external hacker attacks, or negligence in the key management process, it will result in complete exposure of information.

[0005] To solve the above problems, the present application provides a solution. SUMMARY

[0006] The present application aims to provide a talent management system based on a digital portrait evaluation system to solve the problems raised in the background.

[0007] The object of the present application can be achieved by the following technical solutions.

[0008] The talent management system based on a digital portrait evaluation system comprises:

[0009] A multi-source extraction module for extracting evaluation index data corresponding to target personnel from several systems within the target enterprise and generating evaluation index information of the target personnel according to the data;

[0010] A data protection module for performing security protection on the evaluation index information according to a preset protection rule to obtain evaluation protection data of the target personnel after receiving the transmitted evaluation index information of the target personnel.

[0011] Further, the several systems include business systems, human resource management systems and office automation systems.

[0012] Further, a protection table is built in the data protection module, which has a structure of a matrix of a rows and b columns, when the protection table is created, each cell in the protection table is randomly assigned a two-bit binary number, each cell is randomly assigned a binary number selected from 00, 01, 10 and 11, and the two-bit binary number assigned to each row and each column of the protection table must contain 00, 01, 10 and 11.

[0013] Further, the preset protection rule for obtaining the evaluation protection data of the target personnel is as follows:

[0014] S11: binary number conversion is performed on the received evaluation index information, and the converted binary data is labeled as to-be-protected data;

[0015] S12: the cutting step is specified as 8, and the to-be-protected data is cut in the order from left to right to obtain c groups of protection character strings, and the number of characters of the protection character string is 8;

[0016] S13: in the order from left to right, all groups of protection character strings are sequentially labeled as C1, C2,..., Cc according to the order of each group of protection character string in the to-be-protected data before cutting;

[0017] S14: all bit weights D1, D2,..., Dd of the protection character string C1 are obtained according to the preset bit weight acquisition rule, and the bit weight acquisition rule is as follows:

[0018] S141: the protection character string C1 is converted into a decimal number Z1, at this time, the decimal number Z1 can be expressed by using a polynomial expression, that is, the polynomial expression of the decimal number Z1 is expressed as:

[0019] Z1=PC1*2 7 +PC2*2 6 +PC3*2 5 +PC4*2 4 +PC5*2 3 +PC6*2 2 +PC7*2 1 +PC8*2 0 , wherein

[0020] The characters constituting the protection character string C1 from left to right are PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8;

[0021] In the polynomial expression, PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 are coefficients of the polynomial expression, and the exponent of 2 multiplied by the coefficient is the bit weight of the corresponding coefficient, that is, 7, 6, 5, 4, 3, 2, 1, 0 are bit weights of PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 respectively;

[0022] S142: Obtain the bit weights corresponding to the coefficients with non-zero values from the polynomial expression of the decimal number Z1, and mark the obtained bit weights as the bit weights of the guard string C1. In order of decreasing bit weight values, mark all bit weights of the guard string C1 as D1, D2,..., Dd, d is a positive integer greater than 0 and less than or equal to 8;

[0023] S15: For the guard string C1 that has not been specifically marked, find the permutation string of all bit weights of the guard string C1 according to the preset search rule, and the search rule is as follows:

[0024] S16: Based on the positions of the unit cells of the bit weights D1, D2,..., Dd in the protection table, obtain all the moving change paths based on the guard string C1, and mark them as E1, E2,..., Ee in turn, e≥1;

[0025] Any moving change path based on the guard string C1 starts from the unit cell of the bit weight D1, and each time it moves one unit cell up or down, and then it moves one unit cell left or right, and finally it reaches the unit cell of the bit weight Dd through the unit cells of the bit weights D2, D3,..., Dd-1;

[0026] Based on any moving change path of the guard string C1, all unit cells other than the unit cells of the bit weights D1, D2,..., Dd in the unit cells reached from the unit cell of the bit weight D1 to the unit cell of the bit weight Dd are all transition unit cells of the corresponding moving change path;

[0027] At the same time, all unit cells contained in any moving change path based on the guard string C1 have an order, which is arranged from left to right in the order of translation;

[0028] S17: Obtain the total number of transition unit cells F1, F2,..., Fe contained in the moving change paths E1, E2,..., Ee in turn, and obtain the moving change path corresponding to Fmin as the permutation change path of the guard string C1, Fmin is the minimum value of F1, F2,..., Fe;

[0029] S18: in the order from left to right, all transition cells contained in the permutation change path of the protection string C1 are sequentially obtained, and the binary numbers assigned to the transition cells are marked as G1, G2,..., Gg, g >= 1;

[0030] S19: in the order of the permutation string of the bit weight D1, G1, G2,..., Gg, and " ", the permutation string of the bit weight D1, G1, G2,..., Gg and " " are spliced to obtain the protection permutation sequence of the protection string C1;

[0031] S110: according to steps S13 to S19, the protection permutation sequences of the protection strings C1, C2,..., Cc are sequentially obtained, wherein when calculating the permutation string of all bit weights of the protection string C2, the cells are selected from the (d+1) th row based on the total number of bit weights d of the protection string C1 in the order of numbers 1, 2, 3,..., b, and the other protection strings are sequentially obtained;

[0032] S111: in the order of C1, C2,..., Cc, the protection permutation sequences of C1, C2,..., Cc are spliced to obtain the evaluation protection data of the target person.

[0033] Further, the evaluation data management module is further included, which is used for restoring the evaluation index information of the target person after receiving the transmitted evaluation protection data of the target person, and storing the evaluation index information.

[0034] The present application has the following advantages:

[0035] The present application extracts the evaluation index information of the target person from several systems by setting a multi-source extraction module, and sets a data protection module to protect the evaluation index information, wherein the data protection module contains a protection table created by a manager, which is used for encrypting the collected early warning information, and the evaluation index information is encrypted during transmission by the protection table and the preset protection rules in the data protection module, so that the safety of information transmission is ensured, and the risk of information leakage is reduced.

[0036] The application converts the evaluation index information into binary data when the data protection module encrypts the evaluation index information, cuts the binary data into protection character strings from left to right according to a specific cutting step length, obtains all bit weights of each protection character string, looks up the corresponding permutation character string in the protection table according to the bit weight, determines the permutation change path, obtains the protection permutation sequence of each protection character string according to the permutation change path, and in this way, on the one hand, the traditional encryption mode of using a key to encrypt the evaluation index information is abandoned, and on the other hand, the encryption of the evaluation index information depends on the protection table, but a specific cell in the protection table is determined based on the bit weight of each protection character string, and then a unique permutation change path is selected, so that the unique nature of the encryption is ensured, and at the same time, the protection table is not excessively relied on, the possibility of evaluation index information leakage due to the leakage of the protection table is reduced, and the confidentiality and security of the evaluation index information in the transmission process are greatly improved. BRIEF DESCRIPTION OF DRAWINGS

[0037] The application will be further described below in combination with the drawings.

[0038] Figure 1 The figure is a system block diagram of the application. DETAILED DESCRIPTION

[0039] The technical solutions in the embodiments of the application will be clearly and completely described below in combination with the drawings in the embodiments of the application. Obviously, the described embodiments are only part of the embodiments of the application, rather than all the embodiments. Based on the embodiments in the application, all other embodiments obtained by those skilled in the art without creative labor fall within the protection scope of the application.

[0040] As shown in the figure, the talent management system based on the digital portrait evaluation system includes a multi-source extraction module, a data protection module and an evaluation data management module. Figure 1

[0041] The multi-source extraction module is used to extract the evaluation index data corresponding to the target personnel from a plurality of systems in the target enterprise. In the application, the plurality of systems include a business system, a human resource management system and an office automation system.

[0042] In the application, the evaluation index data includes the task completion rate, the project delivery quality and the index achievement situation, the cross-department collaboration frequency and the collaboration time of the target personnel, the education background, the work history, the annual / quarterly performance, the number of email sending and receiving, and the use time of office software of the target personnel. In the embodiment, the office software includes but is not limited to QQ, WeChat, enterprise WeChat, Dingding, WPS, office, etc.

[0043] ​The multi-source extraction module extracts corresponding evaluation index data from several systems inside the target enterprise and generates evaluation index information of the target personnel according to the evaluation index data, and transmits the evaluation index information to the data protection module;

[0044] The data protection module is used for security protection of the transmission process of the evaluation index information, and a protection table is built in the data protection module, which has a matrix form of a rows and b columns, wherein 'a' represents the number of rows, and 'b' represents the number of columns. Such a design forms a rectangular array composed of a rows and b columns, ensuring that each row contains b cells and each column contains a cell;

[0045] The protection table is a protection table created by the manager, and each cell in the protection table is randomly assigned a two-bit binary number when the protection table is created. Each cell is randomly assigned a binary number selected from 00, 01, 10 and 11;

[0046] And the two-bit binary number assigned to each cell in each row and each column of the protection table must contain 00, 01, 10 and 11;

[0047] After the data protection module receives the transmitted evaluation index information, the evaluation index information is security protected according to a preset protection rule, and the preset protection rule is as follows:

[0048] S11: Perform binary number conversion on the received evaluation index information, and label the converted binary data as to-be-protected data;

[0049] S12: Specify the cutting step as 8, and cut the to-be-protected data in the order from left to right to obtain c groups of protection character strings, wherein the number of characters of the protection character string is 8;

[0050] It should be noted that when the to-be-protected data is cut, if the number of remaining characters is greater than 0 and less than 8, the remaining characters are temporarily stored as a group of reserved character strings;

[0051] S13: In the order from left to right, all groups of protection character strings are sequentially labeled as C1, C2,..., Cc according to the order of each group of protection character string in the to-be-protected data before cutting;

[0052] S14: Obtain all bit weights D1, D2,..., Dd of the protection character string C1 according to a preset bit weight acquisition rule, and the preset bit weight acquisition rule is as follows:

[0053] S141: Perform decimal conversion on the protection character string C1 to obtain a decimal number Z1, and at this time, the decimal number Z1 can be expressed by using a polynomial expression, that is, the polynomial expression of the decimal number Z1 is expressed as:

[0054] Z1 = PC1 * 2 7 + PC2 * 2 6 + PC3 * 2 5 + PC4 * 2 4 + PC5 * 2 3 + PC6 * 2 2 + PC7 * 2 1 + PC8 * 2 0 wherein

[0055] The characters constituting the guard string C1 from left to right are PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 in turn;

[0056] It should be noted that in the polynomial expression, PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 are the coefficients of the polynomial expression, and the exponent of 2 multiplied by the coefficient is the bit weight of the corresponding coefficient, that is, 7, 6, 5, 4, 3, 2, 1, 0 are the bit weights of PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 respectively;

[0057] For example, if the guard string C1 is "11010100", the decimal number obtained by converting it to decimal is 212, and at this time, the polynomial expression of the decimal number 212 is 212 = 1 * 2 7 + 1 * 2 6 + 0 * 2 5 + 1 * 2 4 + 0 * 2 3 + 1 * 2 2 + 0 * 2 1 + 0 * 2 0 , 7, 6, 5, 4, 3, 2, 1, 0 are the bit weights of 1, 1, 0, 1, 0, 1, 0, 0 respectively;

[0058] S142: Obtain the bit weights corresponding to the coefficients with non-zero values from the polynomial expression of the decimal number Z1, mark the obtained bit weights as the bit weights of the guard string C1, and mark all the bit weights of the guard string C1 as D1, D2,..., Dd in turn according to the order of the bit weight values from large to small, d is a positive integer greater than 0 and less than or equal to 8, it should be noted that if all the coefficients of the polynomial expression of the decimal number Z1 are 0, the guard string C1 is marked specifically;

[0059] S15: For the guard string C1 which is not marked specifically, find the permutation string of all the bit weights of the guard string C1 according to the preset finding rule, and the finding rule is as follows:

[0060] S151: based on the bit weight D1 of the protection string C1, the D1th cell in the 1st row of the protection table is selected as the target cell of the bit weight D1 in the order of numbers 1, 2, 3, …, b, and the binary number assigned to the target cell of the bit weight D1 is obtained as the permutation string of the bit weight D1;

[0061] It should be noted that the D1th cell in the 1st row of the protection table is described according to the arrangement rule of the protection table from top to bottom and from right to left;

[0062] S152: based on the bit weight D2 of the protection string C1, the D2th cell in the 2nd row of the protection table is selected as the target cell of the bit weight D2 in the order of numbers 1, 2, …, b, and the binary number assigned to the target cell of the bit weight D2 is obtained as the permutation string of the bit weight D2;

[0063] It should be noted that when the corresponding target cell is selected based on the bit weight, only one cell in each row of the protection table can be selected;

[0064] For the protection string C1 that is marked with a specific mark, the protection string C1 is spliced with “.” to obtain the protection permutation sequence of the protection string C1;

[0065] S16: based on the positions of the cells of the bit weights D1, D2, …, Dd in the protection table, all the moving change paths based on the protection string C1 are obtained and are sequentially marked as E1, E2, …, Ee, e≥1;

[0066] Any moving change path based on the protection string C1 starts from the cell of the bit weight D1, and each time it moves one cell up or down or left or right, sequentially passes through the cells of the bit weights D2, D3, …, Dd-1, and finally reaches the cell of the bit weight Dd;

[0067] It should be noted that in any moving change path based on the protection string C1, all the cells that are passed through from the cell of the bit weight D1 to the cell of the bit weight Dd, except the cells of the bit weights D1, D2, …, Dd, are the transition cells of the corresponding moving change path;

[0068] Meanwhile, all the cells contained in any moving change path based on the protection string C1 have an order, which is arranged from left to right in the order of movement;

[0069] S17: sequentially obtain the total number of transition cells contained in the movement change paths E1, E2,..., Ee, and obtain the movement change path corresponding to Fmin as the permutation change path of the guard string C1, Fmin being the minimum value of F1, F2,..., Fe;

[0070] It should be noted that if there is more than one movement change path corresponding to Fmin, then the movement change path to which the transition cell assigned with the binary number 00 is selected as the permutation change path of the guard string C1 in the order of 00, 01, 10, 11, if there are multiple movement change paths selected at this time, then the movement change path to which the transition cell assigned with the binary number 01 is selected as the permutation change path of the guard string C1, and this process continues until there is only one movement change path selected, which is taken as the permutation change path of the guard string C1;

[0071] S18: in the order from left to right, sequentially obtain the binary numbers assigned to all transition cells contained in the permutation change path of the guard string C1, corresponding to G1, G2,..., Gg, g≥1;

[0072] S19: in the order of the permutation string of the bit weight D1, G1, G2,..., Gg, and “,”, the permutation string of the bit weight D1, G1, G2,..., Gg, and “,” are spliced to obtain the guard permutation sequence of the guard string C1;

[0073] S110: according to steps S13 to S19, the guard permutation sequences of the guard strings C1, C2,..., Cc are obtained in turn, wherein when calculating the permutation string of all bit weights of the guard string C2, the cells are selected from the d+1th row based on the total number of bit weights d of the guard string C1 in the order of numbers 1, 2, 3,..., b, and the other guard strings are calculated in the same way;

[0074] S111: in the order of C1, C2,..., Cc, the guard permutation sequences of C1, C2,..., Cc are spliced to obtain the evaluation guard data of the target person;

[0075] If there is a reserved string, then the reserved string is spliced to the rightmost side of the guard permutation sequence of Cc using “..”;

[0076] The data protection module transmits the evaluation guard data of the target person to the evaluation data management module;

[0077] The evaluation data management module is used for receiving, restoring and safely storing the evaluation protection data, so as to facilitate the evaluation and management of the target person in the future. After the evaluation protection data is received by the evaluation data management module, the sequence to be restored before each "," or "." is extracted in the order from left to right;

[0078] For an extracted sequence to be restored, the first character after the sequence is determined. If the character is ". ", the sequence to be restored is temporarily stored as a group of restored strings.

[0079] If the character is ",", the sequence to be restored is restored to obtain the corresponding restored string according to the protection table stored in the evaluation data management module and the inverse operation of the protection replacement sequence of the generated protection string.

[0080] After all the restored strings are obtained, all the protection strings are spliced in the order from left to right according to the position of each restored string in the evaluation protection data to obtain the evaluation index information of the target person, and the evaluation index information is stored.

[0081] In the description of the specification, the description of the terms "one embodiment", "example", "specific example" and the like means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present application. In the specification, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0082] The above is only an example and description of the present application. Those skilled in the art can make various modifications or supplements or use similar ways to replace the described specific embodiments, as long as they do not deviate from the scope of the invention or exceed the scope defined by the claims, and should belong to the protection scope of the present application.

[0083] The above has been described in detail, but the content is only the preferred embodiment of the present application, and cannot be considered as limiting the scope of the present application. Any equivalent changes and improvements made in the scope of the present application should still belong to the patent scope of the present application.

Claims

1. A personnel management system based on a digital portrait evaluation system, characterized by, The method comprises the following steps: A multi-source extraction module is used to extract evaluation index data corresponding to a target person from a plurality of systems within a target enterprise and generate evaluation index information of the target person according to the evaluation index data; A data protection module is used to perform security protection on the evaluation index information according to a preset protection rule to obtain evaluation protection data of the target person after receiving the transmitted evaluation index information of the target person.

2. The digital portrait evaluation system-based talent management system according to claim 1, characterized by, The plurality of systems include a business system, a human resource management system and an office automation system.

3. The digital portrait evaluation system-based talent management system according to claim 1, characterized by, The data protection module has a protection table built therein, which has a matrix form of a line a and a column b. When the protection table is created, each cell in the protection table is randomly assigned a two-digit binary number. Each cell is randomly assigned a binary number selected from 00, 01, 10 and 11. The two-digit binary numbers assigned to each cell in each row and each column of the protection table must include 00, 01, 10 and 11.

4. The digital portrait evaluation system-based talent management system according to claim 1, characterized by, The preset protection rule for obtaining the evaluation protection data of the target person is as follows: S11: Perform binary number conversion on the received evaluation index information, and label the converted binary data as to-be-protected data; S12: Specify a cutting step length of 8, and cut the to-be-protected data in a left-to-right order to obtain c groups of protection character strings, wherein the number of characters in each protection character string is 8; S13: Label all groups of protection character strings as C1, C2,..., Cc in a left-to-right order according to the order of each group of protection character strings in the to-be-protected data before cutting; S14: Obtain all bit weights D1, D2,..., Dd of the protection character string C1 according to a preset bit weight acquisition rule, and the bit weight acquisition rule is as follows: S141: Perform decimal conversion on the protection character string C1 to obtain a decimal number Z1. At this time, the decimal number Z1 can be expressed by using a polynomial expression, that is, the polynomial expression of the decimal number Z1 is as follows: Z1 = PC1*2 7 + PC2*2 6 + PC3*2 5 + PC4*2 4 + PC5*2 3 + PC6*2 2 + PC7*2 1 + PC8*2 0 wherein The characters constituting the protection character string C1 from left to right are PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8; In the polynomial expression, PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8 are coefficients of the polynomial expression. The exponent of 2 multiplied by the coefficient is the bit weight of the corresponding coefficient, that is, 7, 6, 5, 4, 3, 2, 1 and 0 are the bit weights of PC1, PC2, PC3, PC4, PC5, PC6, PC7 and PC8, respectively; S142: Obtain the bit weights corresponding to the coefficients with a value of 0 in the polynomial expression of the decimal number Z1, label the obtained bit weights as the bit weights of the protection character string C1, and label all bit weights of the protection character string C1 in a descending order of bit weight values as D1, D2,..., Dd, wherein d is a positive integer greater than 0 and less than or equal to 8; S15: For the protection character string C1 that has not been specifically labeled, find a permutation character string of all bit weights of the protection character string C1 according to a preset finding rule, and the finding rule is as follows: S16: Based on the position of the unit cell of the bit weight D1, D2,..., Dd in the protection table, all the moving change paths based on the protection string C1 are obtained, and are sequentially marked as E1, E2,..., Ee, e≥1; Any moving change path based on the protection string C1 starts from the unit cell of the bit weight D1, and each time moves one unit cell in the up-down or left-right direction, sequentially passes through the unit cells of the bit weights D2, D3,..., Dd-1, and finally reaches the unit cell of the bit weight Dd; In any moving change path based on the protection string C1, all the unit cells passed through from the unit cell of the bit weight D1 to the unit cell of the bit weight Dd, except the unit cells of the bit weights D1, D2,..., Dd, are all the transition unit cells of the corresponding moving change path; Meanwhile, all the unit cells contained in any moving change path based on the protection string C1 have an order, which is arranged in the left-to-right order according to the moving order; S17: The total number F1, F2,..., Fe of the transition unit cells contained in the moving change paths E1, E2,..., Ee is sequentially obtained, and the moving change path corresponding to Fmin is obtained as the permutation change path of the protection string C1, where Fmin is the minimum value in F1, F2,..., Fe; S18: In the left-to-right order, the binary numbers assigned to all the transition unit cells contained in the permutation change path of the protection string C1 are sequentially obtained, and are marked as G1, G2,..., Gg, g≥1; S19: In the order of the permutation string of the bit weight D1, G1, G2,..., Gg, and ",", the permutation string of the bit weight D1, G1, G2,..., Gg, and "," are spliced to obtain the protection permutation sequence of the protection string C1; S110: The protection permutation sequences of the protection strings C1, C2,..., Cc are sequentially obtained according to steps S13 to S19, wherein when calculating the permutation string of all the bit weights of the protection string C2, the cells are selected from the (d+1)th row based on the total number d of the bit weights of the protection string C1 in the order of the numbers 1, 2, 3,..., b, and the other protection strings are sequentially obtained in the same way; S111: The protection permutation sequences of C1, C2,..., Cc are spliced in the order of C1, C2,..., Cc to obtain the evaluation protection data of the target person.

5. The digital portrait evaluation system-based talent management system according to claim 4, characterized by, S15, the search rule of the permutation string of all the bit weights of the protection string C1 is as follows: S151: Based on the bit weight D1 of the protection string C1, the D1th cell in the first row of the protection table is selected as the target cell of the bit weight D1 in the order of the numbers 1, 2, 3,..., b, and the binary number assigned to the target cell of the bit weight D1 is obtained as the permutation string of the bit weight D1; S152: based on the bit weight D2 of the guard string C1, selecting the D2th cell in the 2nd row of the guard table as the target cell of the bit weight D2 in the order of numbers 1, 2,..., b, obtaining the binary number assigned to the target cell of the bit weight D2 as the permutation string of the bit weight D2; For the guard string C1 which is marked with a specific mark, concatenating itself and "." to obtain the guard permutation sequence of the guard string C1.

6. The digital portrait evaluation system-based talent management system according to claim 1, characterized by, The evaluation data management module is further included, which is used for restoring the evaluation protection data of the target person after receiving the transmitted evaluation protection data to obtain the evaluation index information of the target person, and storing the evaluation index information.

Images