Enterprise science and technology information resource sharing system

Abstract

The invention provides an enterprise science and technology information resource sharing system, which comprises a data input module, a data storage module and a data reading module, and is characterized in that the data input module and the data reading module are respectively in communication connection with the data storage module; the data storage module comprises a data analysis sub-module, a data encryption sub-module, a distributed storage sub-module and a key distribution sub-module, and the data analysis sub-module, the data encryption sub-module, the distributed storage sub-module and the key distribution sub-module are in communication connection with one another; according to the method, keyword extraction is carried out on the newly-added shared information resources so that the newly-added shared information resources can be easily retrieved, and correlation between keywords of the newly-added shared information resources and keywords of existing shared information resources is compared so that other shared information resources related to the newly-added shared information resources can be determined; and the newly-added shared information resources are encrypted and stored in a distributed manner, so that the newly-added shared information resources can be safely stored and read.

Description

Technical Field

[0001] The present application relates to the field of information sharing, and in particular to an enterprise science and technology information resource sharing system. Background Art

[0002] In order to promote the circulation and sharing of scientific and technological information resources among enterprises, including but not limited to research data, technical solutions, market analysis, and patent information, it is necessary to establish a resource sharing system. At present, information resource sharing is mainly achieved through a centralized database system, which is a database management system that stores data in a single location or server. This system allows data management, query, update, and maintenance to be performed through a centralized database management system (DBMS), providing users with a unified data access interface. In a centralized database system, all data is stored in a server or data center, and users access this central location through the network to obtain the required information. The advantages of a centralized database system are that it is easy to manage: since all data is centrally stored and managed, database maintenance, backup, and recovery operations are more convenient; data consistency is high, and a centralized database is easy to implement a strong consistency model, ensuring the accuracy and consistency of data in all aspects; security control: a centralized database can implement more stringent security control and access rights management, effectively preventing unauthorized access and data leakage.

[0003] However, centralized databases also have certain shortcomings: single point failure, all data is concentrated in a single server or location, once a failure occurs, it may affect the availability of the entire system; scalability issues, as the amount of data increases, centralized databases may face performance bottlenecks and expansion limitations; challenges of data backup and recovery, although centralized databases are convenient for data backup, when the amount of data is extremely large, the backup and recovery process may be time-consuming and complicated; network dependence: users need to rely on a good network connection to access centralized databases, and network delays or failures may affect the efficiency and experience of data access. Summary of the invention

[0004] The present application provides an enterprise science and technology information resource sharing system, which extracts keywords from newly added shared information resources so that they can be easily retrieved, and compares the correlation between the keywords of the newly added shared information resources and the existing shared information resources to determine other shared information resources related to the newly added shared information resources, and then encrypts and distributes the newly added shared information resources so that they can be securely stored and read.

[0005] The enterprise science and technology information resource sharing system includes: Data input module, for inputting information resource data that needs to be shared; Data storage module, for storing information resource data; Data reading module, for users to read information resource data; Wherein, the data input module and the data reading module are respectively communicably connected to the data storage module; Among them, the data storage module includes a data analysis submodule, a data encryption submodule, a distributed storage submodule and a key distribution submodule, and the data analysis submodule, the data encryption submodule, the distributed storage submodule and the key distribution submodule are communicatively connected to each other.

[0006] By adopting the above-mentioned technical scheme, the data input module can be used to transmit the information resource data that needs to be shared to the data storage module, the analysis submodule of the data storage module can analyze the information resource data that needs to be shared to extract corresponding keyword information and summary information, etc., the data encryption submodule can encrypt the information resource data that needs to be shared, the distributed storage submodule can perform distributed storage on the information resource data that needs to be shared, and the key distribution submodule can distribute keys to authorized access users.

[0007] Optionally, the enterprise science and technology information resource sharing system further includes an information resource sharing strategy, and the information resource sharing strategy includes the following steps: A1, transmitting preset shared information resource data to the data storage module through the data input module; A2, generating corresponding shared resource keyword information by using a preset keyword extraction algorithm through the data analysis submodule of the data storage module according to the shared information resource data; A3, generating corresponding shared resource summary information by using a preset information summary algorithm through the data analysis submodule of the data storage module according to the shared information resource data; A4, generating an associated resource information set according to the shared resource keyword information using a preset associated resource matching algorithm; A5, generating shared resource ciphertext data and a shared resource key through the data encryption submodule according to the shared information resource data using a preset data encryption algorithm; A6, generating a plurality of shared resource ciphertext block data according to the shared resource ciphertext data by using a preset data block algorithm; A7, storing each shared resource ciphertext block data using a preset data distribution storage algorithm in the distributed storage submodule and generating shared resource ciphertext block location information; A8, generating shared resource index information according to the shared resource keyword information, shared resource summary information, associated resource information set and shared resource ciphertext block location information; A9, calculating the shared resource check value using a preset check value algorithm according to the shared resource index information; A10, storing the shared resource index information in a preset search database, combining the shared resource key and the shared resource check value to generate key matching data and storing the key matching data in the key distribution submodule.

[0008] By adopting the above technical scheme, the enterprise science and technology information resource sharing system can extract keywords from the information resource data that needs to be shared, so that the information resource data can be easily retrieved. It can also compare the correlation between information resource data based on keyword information, so that users can easily obtain related information resource data. At the same time, the information resource data that needs to be shared and its related data can be encrypted to avoid information resource leakage. On the other hand, through distributed storage, while improving its data security, it can improve access efficiency and increase data confidentiality to a certain extent.

[0009] Optionally, the enterprise science and technology information resource sharing system further includes a shared resource reading strategy, and the shared resource reading strategy includes the following steps: B1, obtaining the selected shared resource index information from the search database according to a preset search method through the data reading module and defining it as the resource index information to be read; B2, calculating the check value of the resource to be read by using a check value algorithm according to the index information of the resource to be read; B3, sending the preset reader information and the check value of the resource to be read to the key distribution submodule; B4, if the reader information exists in the preset reading whitelist of the key distribution submodule, the corresponding shared resource key is obtained according to the check value of the resource to be read; B5, sending the shared resource key to the data reading module in a preset encrypted transmission mode; B6, the data reading module obtains all the shared resource ciphertext block data according to the shared resource ciphertext block position information and combines them to generate the shared resource ciphertext data; B7, the data reading module generates shared information resource data according to the shared resource ciphertext data and the shared resource key using a preset data decryption algorithm.

[0010] By adopting the above technical solution, the enterprise science and technology information resource sharing system can identify users who read data and distribute keys through resource verification values ​​to prevent users without access rights from obtaining resource data.

[0011] Optionally, the keyword extraction algorithm includes the following steps: C1, generating a word segment list according to the shared information resource data and the preset stop word list using a preset word segmentation algorithm; C2, according to the shared information resource data and each word segment text in the word segment list, respectively calculate the corresponding word segment frequency using a preset word segment frequency algorithm, wherein the word segment frequency algorithm is: , Where TF(w) is the segment frequency of segment text w, n is the number of times segment text w appears in the shared information resource data, and N is the total number of times all segment texts appear in the shared information resource data; C3, determining the corresponding segment position index data in the shared information resource data according to the segment text, and calculating the average segment position according to the field position index data, wherein the average segment position is calculated by the following calculation formula: , Among them, P(w) is the average position of the word segment of the word segment text w, p i is the segment position index of the i-th occurrence of the segment text w in the shared information resource data; C4, calculating the difference between the word segment according to the word segment text and the shared information resource data using a preset difference algorithm, wherein the difference algorithm is: , Among them, σ(w) is the segment difference of segment text w, f(w,w') is the co-occurrence frequency of segment text w and another segment text w' in the shared information resource data, in, , Where c(w,w') is the number of times a word segment text w and another word segment text w' appear together within the preset text length window, and max w' c(w,w') is the maximum value among all c(w,w'); C5, calculating the key score of the word segment according to the word segment frequency, the average position of the word segment and the difference between the word segments using a preset keyword scoring algorithm, wherein the keyword scoring algorithm is: , Among them, S(w) is the key score of the word segment, and a is the preset adjustment parameter; C6, generating a segment score ranking table according to the segment scores of all segment texts in ascending order; C7, according to the preset keyword number threshold value, the corresponding number of segment texts are sequentially obtained from the segment score ranking table as keyword texts, and the shared resource keyword information is generated according to all the keyword text combinations.

[0012] By adopting the above technical solution, the enterprise science and technology information resource sharing system can extract corresponding keyword information from the shared information resource data to better reflect the content direction, so as to facilitate user retrieval.

[0013] Optionally, the associated resource matching algorithm includes the following steps: D1, define the shared resource keyword information as the current shared resource keyword information; D2, sequentially obtaining shared resource keyword information in other shared resource index information from the search database and defining it as a comparison shared resource keyword information; D3, calculating keyword similarity according to the current shared resource keyword information and the compared shared resource keyword information using a preset keyword similarity algorithm; D4, if the keyword similarity is not less than a preset similarity threshold, defining the shared resource keyword information as associated resource information; D5, generating an associated resource information set according to all associated resource information combinations.

[0014] By adopting the above technical solution, the enterprise science and technology information resource sharing system can calculate the similarity between the keywords corresponding to the current shared information resource and the keywords of other shared information resources, and determine other shared information resources that have a certain correlation with the current shared information resource, so as to facilitate users to quickly obtain related information resources.

[0015] Optionally, the keyword similarity algorithm includes the following steps: E1, sequentially obtain the keyword text and the corresponding sorting index value in the current shared resource keyword information, and define the keyword text as the current keyword text, and define the corresponding sorting index value as the current index value; E2, if the current keyword exists in the comparison shared resource keyword information, obtain the sorting index value of the current keyword in the comparison shared resource keyword information and define it as the comparison index value; E3, if the current keyword does not exist in the compared shared resource keyword information, then define the keyword number threshold as the comparison index value; E4, calculating the keyword index distance according to the current index value and the comparison index value, wherein the keyword index distance is calculated by the following calculation formula: , Among them, d is the keyword index distance, k is the current index value, and j is the comparison index value; E5, calculating the keyword similarity according to all keyword index distances and the keyword number threshold, wherein the keyword similarity is calculated by the following calculation formula: , Among them, m is the keyword similarity, A is the keyword number threshold, d is i is the keyword index distance of the i-th keyword text in the shared resource keyword information.

[0016] By adopting the above technical solution, the enterprise science and technology information resource sharing system can determine the keyword similarity between the current shared resource keyword information and the keyword information of other shared information resources by comparing them, and then can compare the correlation between the current shared information resource and other shared information resources.

[0017] Optionally, the data segmentation algorithm comprises the following steps: F1, dividing the shared resource ciphertext data into multiple ciphertext data blocks according to a preset block size; F2, determining the redundant data size by multiplying the block size and the preset redundancy; F3, dividing the shared resource ciphertext data according to the redundant data size to generate multiple redundant ciphertext data blocks; F4, generating corresponding erasure ciphertext data blocks according to each ciphertext data block using a preset erasure code algorithm; F5, generating corresponding erasure redundant ciphertext data blocks by using an erasure code algorithm according to each redundant ciphertext data block; F6, defines all erasure ciphertext data blocks and all erasure redundant ciphertext data blocks as shared resource ciphertext block data.

[0018] By adopting the above technical solution, the enterprise science and technology information resource sharing system can reduce the loss of data blocks due to distributed storage by generating redundant data blocks, thereby improving the storage stability of data, and processing data blocks with an erasure code algorithm can further improve the storage stability of data, and can also reconstruct data when data is missing.

[0019] Optionally, the data encryption algorithm includes the following steps: G1, randomly obtain the same number of characters in the shared information resource data according to the preset key length value using a preset random algorithm and define them as shared information random characters; G2, sequentially combines all shared information random characters to generate a shared information random string; G3, generates a random string value using a preset hash function according to the shared information random string; G4, initializes a preset random number generator according to the random string value, generates a random value through the random number generator and defines it as a shared resource key; G5, generates shared resource ciphertext data according to the shared information resource data and the shared resource key using a preset symmetric encryption algorithm.

[0020] By adopting the above technical solution, the enterprise science and technology information resource sharing system can generate a random seed based on the content of the shared information resource data and initialize the random number generator to improve the randomness of the random number generator, thereby making the shared resource key generated by the random number generator have better randomness, thereby improving encryption and reducing the possibility of data being deciphered.

[0021] In summary, the present application includes at least one of the following beneficial technical effects: 1. The enterprise science and technology information resource sharing system can extract keywords from the information resource data that needs to be shared, so that the information resource data can be easily retrieved. It can also compare the correlation between information resource data based on keyword information, so that users can easily obtain related information resource data. At the same time, the information resource data that needs to be shared and its related data can be encrypted to avoid information resource leakage. On the other hand, distributed storage can improve data security while improving access efficiency and increase data confidentiality to a certain extent.

[0022] 2. The enterprise science and technology information resource sharing system can extract corresponding keyword information from the shared information resource data to better reflect the content direction, so as to facilitate user retrieval.

[0023] 3. The enterprise technology information resource sharing system can calculate the similarity between the keywords corresponding to the current shared information resource and the keywords of other shared information resources, and determine other shared information resources that have a certain degree of relevance to the current shared information resource, so as to facilitate users to quickly obtain related information resources. BRIEF DESCRIPTION OF THE DRAWINGS

[0024] Figure 1 It is a principle schematic diagram of an enterprise science and technology information resource sharing system of the present invention.

[0025] Figure 2 It is a flow chart of the information resource sharing strategy of the enterprise science and technology information resource sharing system described in the present invention.

[0026] Description of reference numerals: 10. Data input module; 20. Data storage module; 30. Data reading module; 21. Data analysis submodule; 22. Data encryption submodule; 23. Distributed storage submodule; 24. Key distribution submodule. DETAILED DESCRIPTION

[0027] In order to make the purpose, technical solution and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are only used to explain the present application and are not used to limit the present application.

[0028] The embodiments of the present application are further described in detail below in conjunction with the drawings in the specification.

[0029] refer to Figure 1 The present invention provides an enterprise science and technology information resource sharing system, which extracts keywords from newly added shared information resources so that they can be easily retrieved, and compares the correlation between the keywords of the newly added shared information resources and the existing shared information resources to determine other shared information resources related to the newly added shared information resources, and then encrypts and distributes the newly added shared information resources so that they can be securely stored and read.

[0030] The enterprise science and technology information resource sharing system includes: A data input module 10 is used to input information resource data that needs to be shared; A data storage module 20 for storing information resource data; Data reading module 30, for users to read information resource data; Wherein, the data input module 10 and the data reading module 30 are respectively communicably connected to the data storage module 20; Among them, the data storage module 20 includes a data analysis submodule 21, a data encryption submodule 22, a distributed storage submodule 23 and a key distribution submodule 24, and the data analysis submodule 21, the data encryption submodule 22, the distributed storage submodule 23 and the key distribution submodule 24 are communicatively connected to each other.

[0031] The data analysis submodule 21 is used to analyze the information resource data that needs to be shared to extract the corresponding keyword information and summary information, so that the information resource data can be easily retrieved. At the same time, the data analysis submodule 21 can also compare the relevance between the information resource data according to the keyword information, so that the user can easily obtain the corresponding related information resource data; The data encryption submodule 22 is used to encrypt the information resource data and related data that need to be shared to avoid leakage of information resources; The distributed storage submodule 23 is used to perform distributed storage on information resource data that needs to be shared, which can improve the data security, improve the access efficiency, and increase the confidentiality of the data to a certain extent; The key distribution submodule 24 is used to distribute keys to authorized access users so that they can decrypt the encrypted data to generate the original text of the information resource data for reference.

[0032] Through the above technical scheme, the data input module 10 can be used to transmit the information resource data that needs to be shared to the data storage module 20, the data analysis submodule 21 of the data storage module 20 can analyze the information resource data that needs to be shared to extract corresponding keyword information and summary information, etc., the data encryption submodule 22 can encrypt the information resource data that needs to be shared, the distributed storage submodule 23 can distribute the information resource data that needs to be shared, and the key distribution submodule 24 can distribute keys to authorized access users.

[0033] Further, refer to Figure 2 The enterprise science and technology information resource sharing system also includes an information resource sharing strategy, and the information resource sharing strategy includes the following steps: A1, transmitting preset shared information resource data to the data storage module 20 through the data input module 10; The shared information resource data is the information data that is pre-selected by the user and needs to be shared.

[0034] A2, generating corresponding shared resource keyword information by using a preset keyword extraction algorithm through the data analysis submodule 21 of the data storage module 20 according to the shared information resource data; The keyword extraction algorithm is a pre-set algorithm used to extract keywords from shared information resource data. Existing keyword extraction algorithms include TF-IDF algorithm, TextRank algorithm, LDA algorithm, and KeyBERT, which can easily extract keywords based on information text; The shared resource keyword information is a text collection of multiple keywords extracted from the shared information resource data by an algorithm, which can be used to reflect the subject content of the shared information resource data and facilitate user retrieval and identification.

[0035] A3, generating corresponding shared resource summary information by using a preset information summary algorithm through the data analysis submodule 21 of the data storage module 20 according to the shared information resource data; The information summary algorithm is a pre-set algorithm used to generate corresponding summary information based on the shared information resource data so that users can understand the general content of the shared information resource data. The existing summary extraction algorithms include TextRank algorithm, NLP model, BertSum model, etc., which can better generate corresponding summary content based on the text content; The shared resource summary information is the summary content generated based on the shared information resource data.

[0036] A4, generating an associated resource information set according to the shared resource keyword information using a preset associated resource matching algorithm; The associated resource matching algorithm is a pre-set algorithm used to find other associated shared content based on shared resource keyword information; The associated resource information set is a collection of preliminary information of other shared content associated with the shared information resource data, such as keywords, summary content, storage address and other information of other shared content, which is convenient for quickly obtaining the associated shared content.

[0037] A5, generating shared resource ciphertext data and a shared resource key according to the shared information resource data by the data encryption submodule 22 using a preset data encryption algorithm; The data encryption algorithm is a pre-set algorithm used to generate a key and encrypt data content according to the key; The shared resource key is the key corresponding to the shared information resource data and is used for encryption and decryption; The shared resource ciphertext data is the ciphertext generated by the shared information resource data after the encryption algorithm is used.

[0038] A6, generating a plurality of shared resource ciphertext block data according to the shared resource ciphertext data by using a preset data block algorithm; The data block algorithm is a pre-set algorithm used to block the shared resource ciphertext data; The shared resource ciphertext block data is block data generated by dividing the shared resource ciphertext data through a data block algorithm.

[0039] A7, storing each shared resource ciphertext block data using a preset data distribution storage algorithm in the distributed storage submodule 23 and generating shared resource ciphertext block location information; The data distribution storage algorithm is a pre-set algorithm, which is used by the distributed storage submodule 23 to distribute and store the encrypted block data of each shared resource; The shared resource ciphertext block location information is the information of the storage location of all shared resource ciphertext block data, which can be confirmed when storing each shared resource ciphertext block data; Through distributed storage, the load of each storage node can be balanced to avoid excessive load on a single storage node.

[0040] A8, generating shared resource index information according to the shared resource keyword information, shared resource summary information, associated resource information set and shared resource ciphertext block location information; The shared resource index information is a collection of shared resource keyword information, shared resource summary information, associated resource information set, and shared resource ciphertext block location information.

[0041] A9, calculating the shared resource check value using a preset check value algorithm according to the shared resource index information; The check value algorithm is a pre-set algorithm used to calculate the check value of the shared resource index information. The existing check value algorithms include MD5 algorithm, SHA1 algorithm, CR32 algorithm, etc. The shared resource check value is a check value generated by calculating the shared resource index information through a check value algorithm.

[0042] A10, storing the shared resource index information to a preset search database, combining the shared resource key and the shared resource check value to generate key matching data and storing the key matching data in the key distribution submodule 24; The search database is a pre-set database used to store index information of all shared information resources for users to search and retrieve; The key matching data is a data collection of a shared resource key and a shared resource check value. The shared resource key corresponding to the key matching data can be found through the shared resource check value.

[0043] Through the above steps, the enterprise science and technology information resource sharing system can extract keywords from the information resource data that needs to be shared, so that the information resource data can be easily retrieved. It can also compare the correlation between information resource data based on keyword information, so that users can easily obtain related information resource data. At the same time, the information resource data that needs to be shared and its related data can be encrypted to avoid information resource leakage. On the other hand, through distributed storage, while improving its data security, it can improve access efficiency and increase data confidentiality to a certain extent.

[0044] Furthermore, the enterprise science and technology information resource sharing system further includes a shared resource reading strategy, and the shared resource reading strategy further includes the following steps: B1, the data reading module 30 obtains the selected shared resource index information from the search database according to a preset search method and defines it as the resource index information to be read; The search method is a pre-set method for searching for specific content in the search database, for example, searching can be performed based on keywords; The resource index information to be read is the shared resource index information of the detailed content selected to be read.

[0045] B2, calculating the check value of the resource to be read by using a check value algorithm according to the index information of the resource to be read; The check value of the resource to be read is the check value corresponding to the index information of the resource to be read.

[0046] B3, sending the preset reader information and the check value of the resource to be read to the key distribution submodule 24; The reader information is the identity information of the user who needs to read the data, such as the information of the user's operation account, which is used to identify the user's identity.

[0047] B4, if the reader information exists in the preset reading whitelist of the key distribution submodule 24, the corresponding shared resource key is obtained according to the check value of the resource to be read; The read whitelist is a pre-set user list that can be used to confirm whether the user who wants to read data has the corresponding read permission.

[0048] B5, sending the shared resource key to the data reading module 30 in a preset encrypted transmission mode; The encrypted transmission method is a pre-set transmission method used for encrypted data transmission. For example, the https protocol, SSL / TLS, SSH and other methods can be used for encrypted data transmission.

[0049] B6, the data reading module 30 obtains all the shared resource ciphertext block data according to the shared resource ciphertext block position information and combines them to generate the shared resource ciphertext data; The data reading module 30 can read the corresponding data blocks from the distributed storage submodule 23 according to the shared resource ciphertext block location information, and then combine to obtain the shared resource ciphertext data.

[0050] B7, the data reading module 30 generates shared information resource data according to the shared resource ciphertext data and the shared resource key using a preset data decryption algorithm; The data decryption algorithm is a pre-set algorithm, corresponding to the data encryption algorithm, and is used to decrypt data.

[0051] Through the above steps, the enterprise science and technology information resource sharing system can identify users who read data and distribute keys through resource verification values ​​to prevent users without access rights from obtaining resource data.

[0052] Furthermore, the keyword extraction algorithm comprises the following steps: C1, generating a word segment list according to the shared information resource data and the preset stop word list using a preset word segmentation algorithm; The stop word list is a pre-set word list. The words in the stop word list will not be extracted as keywords and will be removed during the word segmentation process. Common stop words include some symbols, pronouns, modal particles, etc. The stop word list can use an existing table or be set based on experience; The word segmentation algorithm is a pre-set algorithm used for word segmentation of text content. There are many existing word segmentation algorithms, including rule-based word segmentation algorithms such as the maximum matching method and the shortest path method, statistical-based word segmentation algorithms such as the hidden Markov model and conditional random field, and deep learning-based word segmentation algorithms such as bidirectional long short-term memory networks, Transformer models, and pre-trained models such as BERT and ERNIE, all of which can achieve word segmentation operations well; The word segment list is a list of all word segments generated after being processed by the word segmentation algorithm and can be used for keyword extraction.

[0053] C2. Calculate the corresponding word segment frequency for each word segment text in the shared information resource data and the word segment list respectively according to a pre-set word segment frequency algorithm, where the word segment frequency algorithm is: , where TF(w) is the word segment frequency of the word segment text w, n is the number of times the word segment text w appears in the shared information resource data, and N is the total number of times all word segment texts appear in the shared information resource data; The word segment text is the text content of a single word segment in the word segment list; The word segment frequency is the frequency of the word segment text appearing in the shared information resource data.

[0054] C3. Determine the corresponding word segment position index data for the word segment text in the shared information resource data, and calculate the average word segment position according to the field position index data, where the average word segment position is calculated by the following formula: , where P(w) is the average word segment position of the word segment text w, and p i is the word segment position index of the i-th occurrence of the word segment text w in the shared information resource data; The word segment position index data is the serial number data of the position of the word segment text in the shared information resource data. For example, if the word segment text is "day", then for the text "How's the weather today", the corresponding word segment position index data is 2 and 3, that is, the word "day" appears at the 2nd and 3rd positions in the text "How's the weather today"; The average word segment position is the average value of the word segment position index data. For example, the average word segment position of the word segment text "day" in the above example is (2 + 3) / 2 = 2.5.

[0055] C4. Calculate the word segment difference degree according to the word segment text and the shared information resource data by a pre-set difference degree algorithm, where the difference degree algorithm is: , Among them, σ(w) is the segment difference of segment text w, f(w,w') is the co-occurrence frequency of segment text w and another segment text w' in the shared information resource data, in, , Where c(w,w') is the number of times a word segment text w and another word segment text w' appear together within the preset text length window, and max w' c(w,w') is the maximum value among all c(w,w'); The segment difference reflects the difference between a segment text and other segment texts. It is calculated by analyzing the degree of co-occurrence of a segment text with all other segment texts. If a segment text frequently co-occurs with many other different segment texts, it may not be a good keyword.

[0056] C5, calculating the key score of the word segment according to the word segment frequency, the average position of the word segment and the difference between the word segments using a preset keyword scoring algorithm, wherein the keyword scoring algorithm is: , Among them, S(w) is the key score of the word segment, and a is the preset adjustment parameter; The key score of a phrase reflects the key degree of the phrase text. The lower the key score of the phrase, the more suitable the corresponding phrase text is as a keyword.

[0057] C6, generating a segment score ranking table according to the segment scores of all segment texts in ascending order; The word segment score ranking table is a list generated by sorting the word segment texts from small to large based on the word segment scores.

[0058] C7, according to the preset keyword number threshold, sequentially obtain the corresponding number of segment texts from the segment score ranking table as keyword texts, and generate shared resource keyword information according to all keyword text combinations; The keyword number threshold is a preset reference value used to determine the number of keywords. For example, if the keyword number threshold is set to 10, 10 word segment texts are obtained from the word segment score ranking table as keyword texts. The keyword text is the text of the phrase selected as the keyword; The shared resource keyword information is a collection of all selected keyword texts.

[0059] Through the above steps, the enterprise science and technology information resource sharing system can extract corresponding keyword information from the shared information resource data to better reflect the content direction, so as to facilitate user retrieval.

[0060] Furthermore, the associated resource matching algorithm includes the following steps: D1, define the shared resource keyword information as the current shared resource keyword information; The current shared resource keyword information is the keyword information of the current shared information resource.

[0061] D2, sequentially obtaining shared resource keyword information in other shared resource index information from the search database and defining it as a comparison shared resource keyword information; Compare the shared resource keyword information with the keyword information of other shared information resources.

[0062] D3, calculating keyword similarity according to the current shared resource keyword information and the compared shared resource keyword information using a preset keyword similarity algorithm; The keyword similarity algorithm is a budget algorithm used to calculate the similarity between the current shared resource keyword information and the compared shared resource keyword information; The keyword similarity is the similarity between the current shared resource keyword information and the compared shared resource keyword information.

[0063] D4, if the keyword similarity is not less than a preset similarity threshold, defining the shared resource keyword information as associated resource information; The similarity threshold is a pre-set reference value used to determine whether the shared resource keyword information has a certain degree of similarity with the current shared resource keyword information; The associated resource information is the compared shared resource keyword information that has a certain degree of similarity with the current shared resource keyword information.

[0064] D5, generating an associated resource information set according to all associated resource information combinations; The associated resource information set is the collection of all associated resource information.

[0065] Through the above algorithm, the enterprise technology information resource sharing system can calculate the similarity between the keywords corresponding to the current shared information resource and the keywords of other shared information resources, and determine other shared information resources that have a certain correlation with the current shared information resource, so as to facilitate users to quickly obtain related information resources.

[0066] Furthermore, the keyword similarity algorithm includes the following steps: E1, sequentially obtain the keyword text and the corresponding sorting index value in the current shared resource keyword information, and define the keyword text as the current keyword text, and define the corresponding sorting index value as the current index value; The sorting index value is the sorting sequence value of the keyword text in the current shared resource keyword information. For example, the sorting index value of the first keyword text in the current shared resource keyword information is 1, and so on; The current keyword text is the currently selected keyword text; The current index value is the sorting index value of the current keyword text.

[0067] E2, if the current keyword exists in the comparison shared resource keyword information, obtain the sorting index value of the current keyword in the comparison shared resource keyword information and define it as the comparison index value; The comparison index value is a sorting index value of the keyword text that is the same as the current keyword in the comparison shared resource keyword information.

[0068] E3, if the current keyword does not exist in the compared shared resource keyword information, then define the keyword number threshold as the comparison index value; That is, the comparison index value is set to the maximum index value according to the number of keyword texts.

[0069] E3, calculating the keyword index distance according to the current index value and the comparison index value, wherein the keyword index distance is calculated by the following calculation formula: , Among them, d is the keyword index distance, k is the current index value, and j is the comparison index value; The keyword index distance is the difference between the current index value and the comparison index value, and is used to reflect the difference in importance of the current keyword between the current shared resource keyword information and the comparison shared resource keyword information.

[0070] E5, calculating the keyword similarity according to all keyword index distances and the keyword number threshold, wherein the keyword similarity is calculated by the following calculation formula: , Among them, m is the keyword similarity, A is the keyword number threshold, d is i is the keyword index distance of the ith keyword text in the shared resource keyword information; The keyword similarity is the keyword similarity between the current shared resource keyword information and the compared shared resource keyword information, and is used to reflect the correlation between the current shared resource keyword information and the compared shared resource keyword information.

[0071] Through the above steps, the enterprise technology information resource sharing system can determine the keyword similarity between the current shared resource keyword information and the keyword information of other shared information resources by comparing them, and then can compare the correlation between the current shared information resource and other shared information resources.

[0072] Furthermore, the data segmentation algorithm comprises the following steps: F1, dividing the shared resource ciphertext data into multiple ciphertext data blocks according to a preset block size; The block size is a preset data size, which is used to determine the size of the block data; The ciphertext data block is a data block of the shared resource ciphertext data after segmentation.

[0073] F2, determining the redundant data size by multiplying the block size and the preset redundancy; Redundancy is a preset value used to determine the size of redundant data; The redundant data size is the data size of the redundant data block; For example, if the redundancy is set to 2, two additional copies of the shared resource ciphertext data need to be stored to avoid the inability to read the entire data due to the loss of a data block. The size of the redundant data block is twice the block size.

[0074] F3, dividing the shared resource ciphertext data according to the redundant data size to generate multiple redundant ciphertext data blocks; The redundant ciphertext data block is a database of shared resource ciphertext data corresponding to the redundant data size, and is used as redundant data.

[0075] F4, generating corresponding erasure ciphertext data blocks according to each ciphertext data block using a preset erasure code algorithm; The erasure code algorithm is a pre-set algorithm used to reconstruct data when data loss occurs. Common erasure code algorithms include RAID algorithm, Reed-Solomon algorithm and graph-based erasure code algorithm. The erasure ciphertext data block is a ciphertext data block processed by the erasure code algorithm.

[0076] F5, generating corresponding erasure redundant ciphertext data blocks by using an erasure code algorithm according to each redundant ciphertext data block; The erasure redundant ciphertext data block is a redundant ciphertext data block processed by the erasure code algorithm.

[0077] F6, defines all erasure ciphertext data blocks and all erasure redundant ciphertext data blocks as shared resource ciphertext block data; Distributed storage of all erasure ciphertext data blocks and all erasure redundant ciphertext data blocks can improve data storage security.

[0078] Through the above steps, the enterprise science and technology information resource sharing system can reduce the loss of data blocks due to distributed storage by generating redundant data blocks, thereby improving data storage stability, and processing data blocks with an erasure code algorithm can further improve data storage stability, and can also reconstruct data when data is missing.

[0079] Furthermore, the data encryption algorithm comprises the following steps: G1, randomly obtain the same number of characters in the shared information resource data according to the preset key length value using a preset random algorithm and define them as shared information random characters; The key length value is a preset length value used to determine the length of the key; The random algorithm is a preset algorithm for randomly obtaining characters from shared information resource data; The shared information random characters are characters randomly obtained from the shared information resource data.

[0080] G2, sequentially combines all shared information random characters to generate a shared information random string; The shared information random character string is a character string formed by sequentially combining all the shared information random characters.

[0081] G3, generates a random string value using a preset hash function according to the shared information random string; The hash function is a pre-set function used to generate a corresponding hash value based on a random string of shared information; The random string value is the hash value of the shared information random string.

[0082] G4, initializes a preset random number generator according to the random string value, generates a random value through the random number generator and defines it as a shared resource key; The random number generator is a pre-set algorithm used to generate random values; The shared resource key is a random value generated by a random number generator and serves as the key for encryption and decryption of shared information resource data.

[0083] G5, generates shared resource ciphertext data according to the shared information resource data and the shared resource key using a preset symmetric encryption algorithm.

[0084] The symmetric encryption algorithm is a pre-set encryption algorithm used to encrypt shared information resource data according to a shared resource key to generate shared resource ciphertext data.

[0085] Through the above steps, the enterprise science and technology information resource sharing system can generate a random seed according to the content of the shared information resource data, and initialize the random number generator to improve the randomness of the random number generator, thereby making the shared resource key generated by the random number generator have better randomness, so as to improve encryption and reduce the possibility of data being deciphered.

[0086] The above are all preferred embodiments of the present application, and are not intended to limit the protection scope of the present application. Any feature disclosed in this specification (including the abstract and drawings), unless otherwise stated, can be replaced by other equivalent or alternative features with similar purposes. That is, unless otherwise stated, each feature is only an example of a series of equivalent or similar features.

Claims

1. An enterprise science and technology information resource sharing system, characterized in that: include: Data input module, for inputting information resource data that needs to be shared; Data storage module, for storing information resource data; Data reading module, for users to read information resource data; Wherein, the data input module and the data reading module are respectively communicably connected to the data storage module; Among them, the data storage module includes a data analysis submodule, a data encryption submodule, a distributed storage submodule and a key distribution submodule, and the data analysis submodule, the data encryption submodule, the distributed storage submodule and the key distribution submodule are communicatively connected to each other.

2. According to claim 1, the enterprise science and technology information resource sharing system is characterized in that: The enterprise science and technology information resource sharing system further includes an information resource sharing strategy, which includes the following steps: A1, transmitting preset shared information resource data to the data storage module through the data input module; A2, generating corresponding shared resource keyword information by using a preset keyword extraction algorithm through the data analysis submodule of the data storage module according to the shared information resource data; A3, generating corresponding shared resource summary information by using a preset information summary algorithm through the data analysis submodule of the data storage module according to the shared information resource data; A4, generating an associated resource information set according to the shared resource keyword information using a preset associated resource matching algorithm; A5, generating shared resource ciphertext data and a shared resource key through the data encryption submodule according to the shared information resource data using a preset data encryption algorithm; A6, generating a plurality of shared resource ciphertext block data according to the shared resource ciphertext data by using a preset data block algorithm; A7, storing each shared resource ciphertext block data using a preset data distribution storage algorithm in the distributed storage submodule and generating shared resource ciphertext block location information; A8, generating shared resource index information according to the shared resource keyword information, shared resource summary information, associated resource information set and shared resource ciphertext block location information; A9, calculating the shared resource check value using a preset check value algorithm according to the shared resource index information; A10, storing the shared resource index information in a preset search database, combining the shared resource key and the shared resource check value to generate key matching data and storing the key matching data in the key distribution submodule.

3. The enterprise science and technology information resource sharing system according to claim 2 is characterized in that: The enterprise science and technology information resource sharing system further includes a shared resource reading strategy, and the shared resource reading strategy includes the following steps: B1, obtaining the selected shared resource index information from the search database according to a preset search method through the data reading module and defining it as the resource index information to be read; B2, calculating the check value of the resource to be read by using a check value algorithm according to the index information of the resource to be read; B3, sending the preset reader information and the check value of the resource to be read to the key distribution submodule; B4, if the reader information exists in the preset reading whitelist of the key distribution submodule, the corresponding shared resource key is obtained according to the check value of the resource to be read; B5, sending the shared resource key to the data reading module in a preset encrypted transmission mode; B6, the data reading module obtains all the shared resource ciphertext block data according to the shared resource ciphertext block position information and combines them to generate the shared resource ciphertext data; B7, the data reading module generates shared information resource data according to the shared resource ciphertext data and the shared resource key using a preset data decryption algorithm.

4. The enterprise science and technology information resource sharing system according to claim 3 is characterized in that: The keyword extraction algorithm includes the following steps: C1, generating a word segment list according to the shared information resource data and the preset stop word list using a preset word segmentation algorithm; C2, according to the shared information resource data and each word segment text in the word segment list, respectively calculate the corresponding word segment frequency using a preset word segment frequency algorithm, wherein the word segment frequency algorithm is: , Where TF(w) is the segment frequency of segment text w, n is the number of times segment text w appears in the shared information resource data, and N is the total number of times all segment texts appear in the shared information resource data; C3, determining the corresponding segment position index data in the shared information resource data according to the segment text, and calculating the average segment position according to the field position index data, wherein the average segment position is calculated by the following calculation formula: ， Among them, P(w) is the average position of the word segment of the word segment text w, p i is the segment position index of the i-th occurrence of the segment text w in the shared information resource data; C4, calculating the difference between the word segment according to the word segment text and the shared information resource data using a preset difference algorithm, wherein the difference algorithm is: ， Among them, σ(w) is the segment difference of segment text w, f(w,w') is the co-occurrence frequency of segment text w and another segment text w' in the shared information resource data, in, , Where c(w,w') is the number of times a word segment text w and another word segment text w' appear together within the preset text length window, and max w' c(w,w') is the maximum value among all c(w,w'); C5, calculating the key score of the word segment according to the word segment frequency, the average position of the word segment and the difference between the word segments using a preset keyword scoring algorithm, wherein the keyword scoring algorithm is: ， Among them, S(w) is the key score of the word segment, and a is the preset adjustment parameter; C6, generating a segment score ranking table according to the segment scores of all segment texts in ascending order; C7, according to the preset keyword number threshold value, the corresponding number of segment texts are sequentially obtained from the segment score ranking table as keyword texts, and the shared resource keyword information is generated according to all the keyword text combinations.

5. The enterprise science and technology information resource sharing system according to claim 4 is characterized in that: The associated resource matching algorithm includes the following steps: D1, define the shared resource keyword information as the current shared resource keyword information; D2, sequentially obtaining shared resource keyword information in other shared resource index information from the search database and defining it as a comparison shared resource keyword information; D3, calculating keyword similarity according to the current shared resource keyword information and the compared shared resource keyword information using a preset keyword similarity algorithm; D4, if the keyword similarity is not less than a preset similarity threshold, defining the shared resource keyword information as associated resource information; D5, generating an associated resource information set according to all associated resource information combinations.

6. The enterprise science and technology information resource sharing system according to claim 5, characterized in that: The keyword similarity algorithm comprises the following steps: E1, sequentially obtain the keyword text and the corresponding sorting index value in the current shared resource keyword information, and define the keyword text as the current keyword text, and define the corresponding sorting index value as the current index value; E2, if the current keyword exists in the comparison shared resource keyword information, obtain the sorting index value of the current keyword in the comparison shared resource keyword information and define it as the comparison index value; E3, if the current keyword does not exist in the compared shared resource keyword information, then define the keyword number threshold as the comparison index value; E4, calculating the keyword index distance according to the current index value and the comparison index value, wherein the keyword index distance is calculated by the following calculation formula: ， Among them, d is the keyword index distance, k is the current index value, and j is the comparison index value; E5, calculating the keyword similarity according to all keyword index distances and the keyword number threshold, wherein the keyword similarity is calculated by the following calculation formula: ， Among them, m is the keyword similarity, A is the keyword number threshold, d is i is the keyword index distance of the i-th keyword text in the shared resource keyword information.

7. The enterprise science and technology information resource sharing system according to claim 6, characterized in that: The data chunking algorithm The following steps are involved: F1, dividing the shared resource ciphertext data into multiple ciphertext data blocks according to a preset block size; F2, determining the redundant data size by multiplying the block size and the preset redundancy; F3, dividing the shared resource ciphertext data according to the redundant data size to generate multiple redundant ciphertext data blocks; F4, generating corresponding erasure ciphertext data blocks according to each ciphertext data block using a preset erasure code algorithm; F5, generating corresponding erasure redundant ciphertext data blocks by using an erasure code algorithm according to each redundant ciphertext data block; F6, defines all erasure ciphertext data blocks and all erasure redundant ciphertext data blocks as shared resource ciphertext block data.

8. The enterprise science and technology information resource sharing system according to claim 7, characterized in that: The data encryption algorithm comprises the following steps: G1, randomly obtain the same number of characters in the shared information resource data according to the preset key length value using a preset random algorithm and define them as shared information random characters; G2, sequentially combines all shared information random characters to generate a shared information random string; G3, generates a random string value using a preset hash function according to the shared information random string; G4, initializes a preset random number generator according to the random string value, generates a random value through the random number generator and defines it as a shared resource key; G5, generates shared resource ciphertext data according to the shared information resource data and the shared resource key using a preset symmetric encryption algorithm.

Images