A method and system for intelligent acquisition of clinical trial data

Abstract

This invention belongs to the field of data acquisition and transmission technology, specifically relating to an intelligent acquisition method and system for clinical trial data. The method includes: encoding the acquired clinical trial data into hexadecimal text; based on the obtained hexadecimal text, calculating the initial frequency of each basic character using the inter-class maximum variance method; dividing the basic characters into retained characters and replacement characters; obtaining the run length of each retained character in the hexadecimal text and forming a run length set for setting multiple replacement schemes for each replacement character; sequentially performing replacement operations on each data in the hexadecimal text belonging to the replacement character to obtain the replaced text; scrambling the replaced text to obtain the encrypted result of the clinical trial data and transmitting it. This invention improves the security and confidentiality of the acquired clinical trial data during transmission.

Description

Technical Field

[0001] This invention relates to the field of data acquisition and transmission technology. More specifically, this invention relates to an intelligent acquisition method and system for clinical trial data. Background Technology

[0002] In clinical trials, the accurate and efficient collection of patients' physiological indicators (such as heart rate, blood pressure, blood sugar, etc.) is crucial for evaluating the safety and efficacy of new drugs or therapies.

[0003] With the widespread application of wearable devices, remote monitoring systems, and electronic medical records, clinical trial data is characterized by high frequency, multi-dimensionality, and large scale. This not only improves the efficiency of data collection but also places higher demands on data security and privacy protection.

[0004] Because clinical trial data often contains highly sensitive personal health information, if it is illegally obtained or tampered with during transmission or storage, it may not only infringe on the privacy of the subjects, but also affect the scientific validity and compliance of the trial results, and even raise legal and ethical risks. Therefore, secure and reliable encryption of clinical trial data has become a key step in ensuring data integrity, confidentiality and availability.

[0005] Currently, existing data encryption methods mainly include symmetric encryption (such as AES), asymmetric encryption (such as RSA), and hash-based integrity verification mechanisms. However, these traditional methods have several limitations when applied to clinical trial data: existing data encryption methods usually encrypt the data as a whole without fully considering the statistical characteristics of the original data, such as character frequency distribution and run-length structure. This makes it easy for patterns that can be used for statistical analysis to remain in the ciphertext. Attackers can then use statistical methods such as frequency analysis to crack the ciphertext, leading to data leakage. Summary of the Invention

[0006] To address the technical problem that traditional methods ignore the characteristics of the data structure itself, allowing attackers to infer the original information by analyzing data distribution patterns or frequency statistics, this invention provides solutions in the following aspects.

[0007] In a first aspect, the present invention provides an intelligent acquisition method for clinical trial data, comprising: encoding the acquired clinical trial data into hexadecimal text; performing initial frequency statistics on basic characters in the obtained hexadecimal text; dividing the basic characters into retained characters and replacement characters based on the inter-class maximum variance method, wherein the initial frequency of the retained characters is greater than that of the replacement characters; obtaining the run length of each retained character in the hexadecimal text and forming a set of run lengths for each retained character; and setting at least one run length for each replacement character. One alternative solution, This equals the total number of types of reserved characters, where each reserved character has at least one possible replacement. The replacement schemes for the reserved characters are as follows: The first Composed of reserved characters, It is a positive integer and does not belong to the th . The process involves: first, determining the run lengths of reserved characters; second, sequentially replacing each data element in the hexadecimal text that is a replacement character, and obtaining the replaced text; third, for any data element that is a replacement character, forming a first set with the basic characters corresponding to its two adjacent data elements; fourth, obtaining the difference between the set of all reserved characters and the first set, and selecting the replacement schemes corresponding to the reserved characters in the difference set as optional schemes; fifth, selecting an optional scheme and replacing the data element that is a replacement character; and finally, scrambling the replaced text to obtain the encrypted result of the clinical trial data and transmitting it.

[0008] This invention utilizes frequency statistics and the inter-class maximum variance method to distinguish between retained and replaced characters, enhancing the randomness of the data. Based on a set of run lengths, it designs diverse replacement schemes to ensure that the distribution pattern of the replaced data is completely different from that of the original data, fundamentally altering the statistical distribution characteristics of the original data and making the encrypted data more uniform in character frequency. Finally, it generates a highly random scrambling step-size sequence through a one-dimensional Logistic chaotic mapping and uses a variable-step Josephus traversal algorithm to thoroughly scramble the data, destroying the original structure and distribution characteristics of the data. This effectively resists attacks targeting the statistical characteristics of the data, significantly improving the security and confidentiality of clinical trial data during transmission.

[0009] Preferably, the hexadecimal text consists of ten Arabic numerals and the first six English letters, using the ten Arabic numerals and the first six English letters, a total of 16 characters, as the basic characters.

[0010] Preferably, the initial frequency of the basic character refers to the number of times the basic character appears in the hexadecimal text.

[0011] Preferably, the run length of each reserved character in the hexadecimal text refers to the length of all consecutive occurrences of each reserved character in the hexadecimal text.

[0012] Preferably, the step of selecting an optional scheme to replace the data belonging to the replacement character includes: selecting any optional scheme as the final scheme for the data belonging to the replacement character, and performing a replacement operation on the data belonging to the replacement character.

[0013] This invention provides a method for selecting a replacement scheme, that is, arbitrarily choosing an available scheme. Compared with fixed replacement rules, this method introduces preliminary randomness into the replacement process, so that even the same character to be replaced may be replaced by different sequences in different positions, increasing the difficulty of cracking.

[0014] Preferably, the step of selecting an optional scheme and performing a replacement operation on the data belonging to the replacement character includes: calculating the first selectivity of each optional scheme; when there is only one optional scheme with the largest first selectivity, the optional scheme with the largest first selectivity is taken as the final scheme for the data belonging to the replacement character; when there are multiple optional schemes with the largest first selectivity, the multiple optional schemes with the largest first selectivity are taken as pending schemes, calculating the second selectivity of each pending scheme, and taking the pending scheme with the largest second selectivity as the final scheme for the data belonging to the replacement character; and performing a replacement operation on the data belonging to the replacement character using the final scheme.

[0015] This invention proposes a two-step dynamic replacement scheme selection mechanism. Compared with random selection, this mechanism actively selects the scheme that makes the character frequency distribution of the replaced text most uniform through calculation and comparison, thereby more effectively smoothing out the statistical features in the data and making the encrypted text statistically closer to white noise, which greatly enhances the ability to resist frequency analysis attacks.

[0016] Preferably, calculating the first selectivity of each alternative includes: In the formula, Indicates the first The first data belonging to the replacement character The first selectivity of the alternative options Indicates the first Reserved characters In the The frequency of the hexadecimal text after the replacement operation. It equals the number of all reserved character types. Indicates the first Reserved characters included in the optional schemes, Reserved characters In the The frequency of the hexadecimal text after the replacement operation.

[0017] This invention dynamically balances the character distribution of the replaced text by maximizing the frequency difference between the most frequent character and the characters in the selected replacement scheme, ensuring that each replacement operation aims to achieve global frequency balance, thus making the encryption process more intelligent and efficient.

[0018] Preferably, calculating the second selectivity of each candidate solution includes: ; Indicates the first The first data belonging to the replacement character The second degree of selectivity for a pending solution Indicates the first The first data belonging to the replacement character The number of reserved characters included in each pending scheme. Indicates the first The first data belonging to the replacement character The first selectivity of the alternative options.

[0019] This invention calculates a second selectivity as the decision-making basis when multiple schemes have the same maximum first selectivity. By introducing a judgment on the length of the replacement scheme itself, it provides an additional optimization dimension to the selection process, making the final selected scheme not only optimal in terms of frequency balance, but also more reasonable in terms of replacement efficiency.

[0020] Preferably, scrambling the replaced text includes: generating a key based on the initial value and parameters of the one-dimensional Logistic chaotic mapping function; substituting the key as an initial condition into the expression of the one-dimensional Logistic chaotic mapping function, and then... The next iteration obtained One chaotic value; multiply each chaotic value by... Then, the result is rounded down and used as the scrambling step size to construct the scrambling step size sequence; where, The number of data points in the replaced text is equal to the number of data points in the replaced text. The scrambling step sequence is used as the step sequence of the variable step Josephus traversal algorithm, and the replaced text is scrambled using the variable step Josephus traversal algorithm.

[0021] Secondly, the present invention provides an intelligent clinical trial data acquisition system, including a processor and a memory, wherein the memory stores computer program instructions, and when the computer program instructions are executed by the processor, the above-mentioned intelligent clinical trial data acquisition method is implemented.

[0022] By adopting the above technical solution, a computer program is generated from the above-mentioned intelligent acquisition method for clinical trial data and stored in a memory so that it can be loaded and executed by a processor. In this way, a terminal device can be made based on the memory and the processor for convenient use.

[0023] The beneficial effects of this invention are as follows:

[0024] This invention utilizes frequency statistics and the inter-class maximum variance method to distinguish between retained and replaced characters, enhancing the randomness of the data. Based on a set of run lengths, it designs diverse replacement schemes to ensure that the distribution pattern of the replaced data is completely different from that of the original data, fundamentally altering the statistical distribution characteristics of the original data and making the encrypted data more uniform in character frequency. Finally, it generates a highly random scrambling step-size sequence through a one-dimensional Logistic chaotic mapping and uses a variable-step Josephus traversal algorithm to thoroughly scramble the data, destroying the original structure and distribution characteristics of the data. This effectively resists attacks targeting the statistical characteristics of the data, significantly improving the security and confidentiality of clinical trial data during transmission. Attached Figure Description

[0025] Figure 1 This is a flowchart illustrating an intelligent clinical trial data acquisition method according to the present invention;

[0026] Figure 2 It is a statistical histogram that schematically shows the initial frequency of each basic character in hexadecimal text;

[0027] Figure 3 It is a statistical histogram illustrating the frequency of each character in the final encrypted result. Detailed Implementation

[0028] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0029] The specific embodiments of the present invention will now be described in detail with reference to the accompanying drawings.

[0030] This invention discloses an intelligent data acquisition method for clinical trials, referring to... Figure 1 This includes steps S1-S5:

[0031] S1. Collect clinical trial data from patients and encode the clinical trial data into hexadecimal text format.

[0032] Specifically, clinical trial data of patients are continuously collected from their wearable devices, sensors, or electronic medical record systems at a fixed sampling frequency, such as once per minute. This includes, but is not limited to, heart rate, blood pressure, and blood glucose levels, resulting in heart rate data sequences, blood pressure data sequences, and blood glucose level data sequences.

[0033] Furthermore, when different types of sensors have different sampling frequencies, resampling techniques (such as upsampling or downsampling) are needed to align the data sequences of various physiological indicators over time.

[0034] Optionally, if any physiological indicator has a missing value at any sampling time, linear interpolation is used to replace the missing value to ensure the integrity of the physiological indicator data at each sampling time. Normalization, resampling techniques, and linear interpolation are all existing technologies and will not be described in detail in this embodiment.

[0035] Specifically, hexadecimal is a base-16 positional numeral system that uses 16 characters to represent numerical values, including ten Arabic numerals (0-9) and six English letters (A, B, C, D, E, F). 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 represent decimal 0-9; A, B, C, D, E, F represent decimal 10-15. Therefore, after encoding clinical trial data into hexadecimal text, the resulting hexadecimal text consists of ten Arabic numerals and the first six English letters.

[0036] Furthermore, the ten Arabic numerals and the first six English letters, a total of 16 characters, are used as basic characters. Therefore, the basic characters include 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, and F.

[0037] It should be noted that hexadecimal encoding is a common data representation method that unifies data into a fixed character set, has high information density, and facilitates subsequent statistical, classification, and encryption operations.

[0038] S2. Perform initial frequency statistics on the basic characters in the obtained hexadecimal text; based on the inter-class maximum variance method, divide the basic characters into retained characters and replacement characters, and the initial frequency of the retained characters is greater than the initial frequency of the replacement characters.

[0039] Specifically, an initial frequency count is performed on all basic characters in the obtained hexadecimal text, where the initial frequency of the basic characters refers to the number of times the basic characters appear in the hexadecimal text.

[0040] For example, for the collected clinical trial data, step S1 converts the clinical trial data into hexadecimal text, and the length of the obtained hexadecimal text is 7240. The initial frequencies of each basic character in the obtained hexadecimal text are statistically analyzed. The initial frequencies of each basic character 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, and F are 1042, 310, 1339, 1806, 585, 425, 835, 144, 172, 167, 62, 10, 10, 211, 66, and 56, respectively. The histogram of the initial frequencies of each basic character is shown below. Figure 2 As shown.

[0041] Furthermore, based on the initial frequency of the basic characters, all basic characters are divided into two categories using the maximum variance method between classes: one category is reserved characters with higher initial frequencies, and the other category is replacement characters with lower initial frequencies. That is, the initial frequency of the reserved characters is greater than the initial frequency of the replacement characters, so as to reduce the number of replacement operations and improve efficiency when the reserved characters are used to replace the replacement characters.

[0042] Among them, the maximum variance between classes method is a well-known technique. The core idea of ​​the maximum variance between classes method is to find the optimal threshold that maximizes the variance between the two classes of basic characters, thereby achieving optimal classification. Specifically, it is as follows: sort all basic characters in ascending order of their initial frequency to form a list; iterate through all possible thresholds and divide all basic characters into two groups. The initial frequency of basic characters in one group is less than or equal to the possible threshold, and the initial frequency of basic characters in the other group is greater than the possible threshold. Calculate the inter-class variance of the initial frequencies of the two groups, select the possible threshold that maximizes the inter-class variance as the optimal threshold, and use the initial characters whose initial frequency is greater than the optimal threshold as retained characters and the initial characters whose initial frequency is less than or equal to the optimal threshold as replacement characters.

[0043] For example, based on the initial frequencies of the basic characters: 1042, 310, 1339, 1806, 585, 425, 835, 144, 172, 167, 62, 10, 10, 211, 66, 56, all basic characters are divided into two classes based on the maximum variance between classes method. At this time, the frequency threshold calculated by the maximum variance between classes method is 585. Therefore, basic characters with an initial frequency greater than 585 are selected as retained characters, and the retained characters include characters 0, 2, 3, and 6. Basic characters with an initial frequency less than or equal to 585 are selected as replacement characters, and the replacement characters include characters 1, 4, 5, 7, 8, 9, A, B, C, D, E, and F.

[0044] It should be noted that by using frequency statistics and classification, high-frequency characters in the data are distinguished from low-frequency characters, providing a basis for subsequent replacement operations; high-frequency characters are retained as reserved characters to maintain their main characteristics in the data; low-frequency characters are used as replacement characters to enhance the randomness of the data, thereby improving the encryption effect.

[0045] S3. Obtain the run length of each reserved character in the hexadecimal text and form a set of run lengths for each reserved character; based on the set of run lengths of the reserved characters, set multiple replacement schemes for each replacement character.

[0046] Specifically, for any reserved character, the length of all consecutive occurrences of the reserved character in the hexadecimal text is extracted as the run length, and these run lengths are grouped into a set, which is denoted as the run length set of the reserved character.

[0047] For example, for the reserved characters 0, 2, 3 and 6, their run length sets are as follows: character "0": {1,2}, character "2": {1,2}, character "3": {1,2,3,4,5}, character "6": {1,2,3,4,5,6}.

[0048] It should be noted that the run length set reflects the distribution pattern of the retained characters in the data, avoiding the replacement scheme from having the same distribution pattern as the original data, which would increase the unpredictability of the data.

[0049] Specifically, set at least for each replacement character There are several alternative options, among which... This is equal to the total number of all retained character types. Each replacement scheme must satisfy the following condition:

[0050] (1) Each replacement scheme contains only one reserved character, and a replacement scheme is the replacement scheme corresponding to the reserved character it contains.

[0051] (2) No. The replacement schemes for the reserved characters are as follows: The first Composed of reserved characters, It is a positive integer and does not belong to the th . The set of run-lengths of the reserved characters, i.e. the first The number of reserved characters in the replacement scheme corresponding to the reserved character cannot be equal to the number of reserved characters in the first reserved character. Any run length from the set of run lengths for reserved characters.

[0052] (3) There is at least one replacement scheme for each reserved character, and any replacement scheme for different characters is different.

[0053] Therefore, for the reserved character "0", since its run length set is {1,2}, the number of "0"s in the replacement scheme cannot be 1 or 2, but can be 3, 4, 5 or other positive integers that do not appear in the run length set.

[0054] For example, four replacement schemes are set for the replacement character "1": (1) replace the replacement character "1" with "000"; (2) replace the replacement character "1" with "222"; (3) replace the replacement character "1" with "333333"; (4) replace the replacement character "1" with "6666666".

[0055] It should be noted that the number of characters to be retained in the replacement scheme, i.e., the run length, is not part of the first step. The set of run lengths for the reserved characters ensures that the replacement data structure is different from the original data, further enhancing encryption security. At the same time, it guarantees that when replacing hexadecimal text later, regardless of which basic character the adjacent data belongs to, a replacement scheme containing reserved characters different from the adjacent data can be found, so that the run length in the replacement scheme is not broken after replacement, ensuring decryptability.

[0056] S4. Perform a replacement operation on each data in the hexadecimal text that belongs to the replacement character to obtain the replaced text.

[0057] Specifically, following the sequence, each data point in the hexadecimal text is sequentially determined to be a replacement character. For each data point in the hexadecimal text that is a replacement character, a replacement operation is performed to obtain the replaced text, including:

[0058] 1. For any data that is a replacement character, obtain its two adjacent data, and form a first set of the basic characters corresponding to the two adjacent data, denoted as . .

[0059] 2. Let the set consisting of all reserved characters be denoted as ; Obtain the set of all reserved characters With the first set The difference set, where the difference set refers to all sets belonging to the set And does not belong to the first set A set consisting of elements.

[0060] 3. Each replacement scheme corresponding to each retained character in the difference set is taken as an optional scheme.

[0061] For example, in the hexadecimal text "202…616E…3833", the data "1" is a replacement character, and its only adjacent data is "6". If we form the first set of the basic characters corresponding to its adjacent data, then... ={6}, the set of all reserved characters If the set is {0, 2, 3, 6}, then the set consists of all reserved characters. With the first set The difference set is {0, 2, 3}, therefore, the possible solutions include replacing the replacement character “1” with “000”, replacing the replacement character “1” with “222”, and replacing the replacement character “1” with “333333”.

[0062] 4. Select an optional scheme as the final scheme for the data that belongs to the replacement character, and perform the replacement operation on the data that belongs to the replacement character according to the final scheme.

[0063] In one embodiment, any optional scheme is selected as the final scheme for the data belonging to the replacement character, and the replacement operation is performed on the data belonging to the replacement character.

[0064] In another embodiment, a first selectivity of each alternative is calculated: when there is only one alternative with the highest first selectivity, the alternative with the highest first selectivity is taken as the final alternative for the data belonging to the replacement character; when there are multiple alternatives with the highest first selectivity, the multiple alternatives with the highest first selectivity are taken as pending alternatives, a second selectivity of each pending alternative is calculated, and the pending alternative with the highest second selectivity is taken as the final alternative for the data belonging to the replacement character; the data belonging to the replacement character is replaced using the final alternative.

[0065] The formula for calculating the first selectivity of the alternative is as follows:

[0066] ;

[0067] In the formula, Indicates the first The first data belonging to the replacement character The first selectivity of the alternative options Indicates the first Reserved characters In the The frequency of the hexadecimal text after the replacement operation. It equals the number of all reserved character types. Indicates the first Reserved characters included in the optional schemes, Reserved characters In the The frequency of the hexadecimal text after the replacement operation.

[0068] It should be noted that the first degree of selectivity The calculation formula is based on the frequency distribution difference of the retained characters before the current replacement operation. By maximizing the frequency difference to select the optimal replacement scheme, it can effectively avoid some retained characters from appearing too frequently or in the replaced text. At the same time, this mechanism ensures that the replaced sequence has more uniform statistical characteristics, thereby reducing the pattern features in the data.

[0069] The formula for calculating the second selectivity of the undetermined scheme is as follows:

[0070] ;

[0071] Indicates the first The first data belonging to the replacement character The second degree of selectivity for a pending solution Indicates the first The first data belonging to the replacement character The number of reserved characters included in each pending scheme. Indicates the first The first data belonging to the replacement character The first selectivity of the alternative options.

[0072] It should be noted that when there are multiple alternatives with the highest first selectivity, if the highest first selectivity is equal to 0, the reciprocal of the number of reserved characters contained in each alternative is taken as the second selectivity of each alternative, and the alternative with the highest second selectivity is taken as the final alternative for the data belonging to the replacement character.

[0073] It should be noted that when the first degree of selectivity cannot uniquely determine the optimal solution, a second degree of selectivity is introduced. The selection process was further optimized; the second selectivity took into account the number of characters to be retained. and first selectivity This makes the final selected scheme not only better in frequency distribution, but also more reasonable in the number of characters; it further enhances the uniformity of the statistical characteristics of the replaced sequence, and the replaced data can better mask the distribution characteristics of the original data, thus rendering statistical analysis attacks ineffective and significantly improving the security of encryption.

[0074] S5. Using a one-dimensional chaotic mapping function and a variable step size Josephus traversal algorithm, the replaced text is scrambled to obtain the encrypted results of the clinical trial data and transmit them.

[0075] Specifically, the one-dimensional Logistic chaotic mapping function, with its pseudo-randomness, sensitivity to initial conditions, non-periodicity, and long-term unpredictability, is often used as a key generator. Since the one-dimensional Logistic chaotic mapping function enters a chaotic state and generates chaotic values ​​between [0,1] when the initial value is in the range [0,1] and the parameter is in the range (3.57,4], when generating a key based on the one-dimensional Logistic chaotic mapping function, an initial value and a parameter are randomly generated within the ranges of the initial value and the parameter, i.e., [0,1] and (3.57,4], respectively, to form the key.

[0076] Among them, implementers can choose a one-dimensional chaotic mapping function according to the actual application scenario and needs. One-dimensional chaotic mapping functions include, but are not limited to, one-dimensional Logistic chaotic mapping function, one-dimensional Tent chaotic mapping function, one-dimensional Singer chaotic mapping function, and one-dimensional Sine chaotic mapping function. These are all well-known technologies and will not be described in detail here.

[0077] Furthermore, the key is substituted as an initial condition into the expression of the one-dimensional Logistic chaotic mapping function, through... The next iteration obtained One chaotic value; multiply each chaotic value by... Then, the result is rounded down and used as the scrambling step size to construct the scrambling step size sequence; where, It equals the amount of data in the replaced text.

[0078] Furthermore, the scrambling step sequence is used as the step sequence for the variable-step Josephus traversal algorithm. The variable-step Josephus traversal algorithm is then used to scramble the replaced text. Specifically, all the data in the replaced text is arranged in a circle. Take from 1 , will the The extracted data is placed in the first position of the scrambled text. One location, Indicates the scrambling step size sequence of the 1st step. One scrambling step; place the last remaining data in the leftmost position of the scrambled text, i.e., the first scrambling step. The positions are used to obtain the scrambled text.

[0079] For example, all data belonging to the replacement characters in the hexadecimal text are replaced, resulting in a text of length 14064 containing only the four characters 0, 2, 3, and 6. A Logistic chaotic mapping is then used to generate a key: the initial value is 0.31415 and the parameter is 3.98. The replaced text is then scrambled, and the final encrypted result still has a length of 14064. The frequency of each character in the final encrypted result is then statistically analyzed. The frequencies of the characters 0, 2, 3, and 6 are 3517, 3514, 3510, and 3523, respectively. The histogram of the frequency of each character is shown below. Figure 3 As shown; in summary, a comparative analysis of the statistical histograms of character frequency information before and after the replacement shows that the replaced character frequency information has more uniform statistical characteristics, which can better mask the distribution characteristics of the original data, thus rendering statistical analysis attacks ineffective and significantly improving the security of encryption.

[0080] It should be noted that the keys and scrambling step sequences generated by chaotic mapping are highly random and unpredictable, which further enhances the security of encryption; the scrambling operation disrupts the original order of the data, making it difficult for attackers to recover the original information by analyzing the data structure.

[0081] This invention also discloses an intelligent clinical trial data acquisition system, including a processor and a memory. The memory stores computer program instructions, which, when executed by the processor, implement an intelligent clinical trial data acquisition method according to the present invention.

[0082] The system also includes other components well known to those skilled in the art, such as communication buses and communication interfaces, the settings and functions of which are known in the art and will not be described in detail here.

Claims

1. A method for intelligent collection of clinical trial data, characterized in that, The method comprises the following steps: Text encoding in hexadecimal format is performed on the collected clinical trial data; Initial frequency statistics are performed on the basic characters in the obtained hexadecimal text; The basic characters are divided into reserved characters and replacement characters based on the maximum variance between classes method, and the initial frequency of the reserved characters is greater than that of the replacement characters; obtaining the run length of each reserved character in the hexadecimal text and composing a run length set of each reserved character; setting at least one replacement scheme for each replacement character, equal to the number of types of all reserved characters, wherein each replacement scheme contains only one reserved character, and a replacement scheme is the replacement scheme corresponding to the reserved character it contains; The replacement scheme corresponding to the th reserved character is composed of reserved characters, which is a positive integer and does not belong to the run length set of the th reserved character, that is, the number of reserved characters in the replacement scheme corresponding to the th reserved character cannot be equal to any run length in the run length set of the th reserved character; each reserved character corresponds to at least one replacement scheme, and any replacement scheme of different replacement characters is different. Replacement operations are performed on the data belonging to the replacement characters in the hexadecimal text in sequence to obtain the replaced text, including: for any data belonging to the replacement characters, the adjacent two data corresponding to the basic characters form a first set; a difference set is obtained between the set of all reserved characters and the first set, and the replacement scheme corresponding to the reserved characters in the difference set is selected as an optional scheme; one optional scheme is selected to perform replacement operations on the data belonging to the replacement characters; the replaced text is shuffled to obtain an encryption result of the clinical trial data and transmit the encryption result. The run length of each reserved character in the hexadecimal text refers to the length of all consecutive occurrences of each reserved character in the hexadecimal text.

2. The method of claim 1, wherein, The hexadecimal text is composed of ten Arabic numerals and the first six English letters, and the ten Arabic numerals and the first six English letters, a total of 16 characters, are used as basic characters. 3.The intelligent clinical trial data acquisition method of claim 1, wherein, The initial frequency of the basic characters refers to the number of occurrences of the basic characters in the hexadecimal text.

4. The method of claim 1, wherein, The selection of one optional scheme to perform replacement operations on the data belonging to the replacement characters comprises: Any one optional scheme is selected as the final scheme of the data belonging to the replacement characters, and replacement operations are performed on the data belonging to the replacement characters.

5. The method of claim 1, wherein, The selection of one optional scheme to perform replacement operations on the data belonging to the replacement characters comprises: A first optional degree of each optional scheme is calculated: when there is only one optional scheme with the maximum first optional degree, the optional scheme with the maximum first optional degree is selected as the final scheme of the data belonging to the replacement characters; when there are multiple optional schemes with the maximum first optional degree, the multiple optional schemes with the maximum first optional degree are selected as tentative schemes, a second optional degree of each tentative scheme is calculated, and the tentative scheme with the maximum second optional degree is selected as the final scheme of the data belonging to the replacement characters; the data belonging to the replacement characters is replaced through the final scheme.

6. The method of claim 5, wherein, The calculation of the first optional degree of each optional scheme comprises: ； In the formula, Indicates the first The first data belonging to the replacement character The first selectivity of the alternative options Indicates the first Reserved characters In the The frequency of the hexadecimal text after the replacement operation. It equals the number of all reserved character types. Indicates the first Reserved characters included in the optional schemes, Reserved characters In the The frequency of the hexadecimal text after each replacement operation.

7. The method of claim 5, wherein the method further comprises: The calculation of the second optional degree of each tentative scheme comprises: ； a first number of pending schemes for data belonging to the replacement character, a second number of pending schemes for data belonging to the replacement character, a first number of pending schemes for data belonging to the replacement character, a second number of pending schemes for data belonging to the replacement character, a first number of pending schemes for data belonging to the replacement character, a second number of pending schemes for data belonging to the replacement character, a first number of pending schemes for data belonging to the replacement character, a second number of pending schemes for data belonging to the replacement character, a first number of pending schemes for data belonging to the replacement character, 8.The method of claim 1, wherein, The shuffling of the replaced text comprises: A key is generated according to the initial value and parameters of a one-dimensional Logistic chaotic mapping function; The key is substituted into the expression of the one-dimensional Logistic chaotic mapping function as an initial condition, and a chaotic value is obtained through the first iteration chaotic values; each chaotic value is multiplied by and rounded, and the rounding result is used as a scrambling step length to construct a scrambling step length sequence; wherein, is equal to the number of data in the replaced text. The shuffled step sequence is used as the step sequence of a variable-step Joseph traversal algorithm, and the variable-step Joseph traversal algorithm is used to shuffle the replaced text.

9. A clinical trial data intelligent acquisition system, characterized by, The method comprises the following steps: A processor and a memory are provided, and the memory stores computer program instructions, which, when executed by the processor, implement the intelligent clinical trial data acquisition method according to any one of claims 1-8.

Images