Water resource optimization configuration system and method for near-zero sewage discharge in industrial parks

By converting the optimized configuration data into a mapping sequence for transmission in the water resource optimization configuration system in the industrial park, the data security risks caused by insufficient key management resources are solved, and a safe and efficient transmission of water resource allocation schemes is achieved.

CN118643518BActive Publication Date: 2024-11-08BEIJING KANGCHENG MUNICIPAL ENG CO
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202411088322.6
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-09
Publication Date
2024-11-08
Estimated Expiration
2044-08-09

AI Technical Summary

Technical Problem

The industrial park lacks sufficient time and financial resources for key management, resulting in the risk of loss or leakage of the optimal water resource allocation plan issued to the park, threatening the data security of the entire park.

Method used

The information acquisition module is used to obtain optimized configuration data, and convert it into optimized mapping sequence and response mapping sequence for transmission through the configuration mapping module. The enterprise module receives and restores the data, avoiding the method of key encryption and improving the security of data transmission. sex.

Benefits of technology

It gets rid of the traditional key encryption method, avoids data insecurity caused by key loss, saves resource consumption in key management, and improves the security and difficulty of data transmission.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118643518B_ABST
    Figure CN118643518B_ABST
Patent Text Reader

Abstract

The present invention discloses a water resource optimization configuration system and method for near-zero sewage discharge in industrial parks, and relates to the technical field of water resource optimization configuration management. The present invention acquires the optimal water resource configuration plan of the industrial park by setting an information acquisition module, and sets a configuration mapping module to convert the optimal water resource configuration plan of the industrial park into an optimization mapping sequence and a response mapping sequence for transmission in the network, and the conversion process goes through multiple precise steps. First, the process involves converting the optimization configuration data into binary form to generate mapping coding data. Then, a plurality of specific selection combinations are selected from these mapping coding data, and each combination consists of a preamble string and a postamble string. The uniqueness of this step is that the string length of each selection combination is specified and intercepted in the order of 2, 3, and 4, which is different from the traditional cutting algorithm and improves the complexity of the selection logic.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of water resource optimization configuration management, and in particular to a water resource optimization configuration system and method for near-zero sewage discharge in an industrial park. Background Art

[0002] With the acceleration of industrialization, the water consumption and sewage discharge in industrial parks have increased year by year, which has brought tremendous pressure on water resources and the environment. Traditional sewage treatment methods often cannot meet the increasingly stringent environmental protection requirements, and it is difficult for the treated sewage to meet the standards for reuse. Therefore, achieving near-zero sewage discharge in industrial parks has become a top priority;

[0003] At present, the industrial park formulates the best water resource allocation plan for the industrial park by collecting detailed data on water use, sewage treatment and water resource reuse of each enterprise in the industrial park, and then distributes the best water resource allocation plan to each enterprise in the industrial park. Each enterprise in the industrial park implements the best water resource allocation plan to achieve near-zero sewage discharge in the industrial park. In the process of distributing the best water resource allocation plan, the data in it may involve sensitive information such as the production process, environmental protection measures, and economic benefits of the enterprise, which needs to be protected. Therefore, the distributed plan is encrypted in the form of key encryption. However, most industrial parks do not have enough time and financial resources to maintain and manage the keys, which will lead to the risk of key loss or leakage, which may threaten the data security of the entire park;

[0004] In order to solve the above problems, the present invention proposes a solution. Summary of the invention

[0005] The purpose of the present invention is to provide a water resource optimization configuration system and method for near-zero sewage discharge in industrial parks, in order to solve the problem that in the prior art, industrial parks do not have sufficient time resources and financial resources to maintain and manage keys, resulting in the optimal water resource configuration plan issued to each enterprise in the park being encrypted using keys that may be at risk of loss or leakage, threatening the data security of the entire park;

[0006] The purpose of the present invention can be achieved through the following technical solutions:

[0007] The water resource optimization allocation system for near-zero sewage discharge in industrial parks includes:

[0008] The information collection module is used to obtain the optimal configuration data of the industrial park, which includes the optimal wastewater discharge and recycling strategies of each industrial enterprise in the industrial park;

[0009] A configuration mapping module is configured to classify the 16 binary numbers preset by the administrator according to the number of bits of each binary number: 2 bits, 3 bits, and 4 bits, and to add the 16 binary numbers to the first, second, and third gradient lists accordingly according to the classification results;

[0010] A configuration mapping module is used to perform binary conversion on the optimized configuration data of the industrial park to obtain mapping code data, and select a number of selection combinations from the mapping code data according to a preset selection step, wherein a selection combination consists of a pre-order string and a post-order string, and the number of characters in the pre-order string and the post-order string constituting a selection combination is equal;

[0011] According to all the binary numbers added to the first, second and third gradient lists, a gradient list matching them is determined according to the number of character bits in the preceding string in each selected combination, where matching means that the number of character bits in the preceding string is equal to the number of bits of any binary number in the corresponding gradient list;

[0012] The selection object and mapping object of each selection combination are determined according to the characters constituting the preceding string and the succeeding string in each selection combination, and the optimized mapping sequence and the response mapping sequence of the industrial park are obtained according to the selection object and mapping object of each selection combination.

[0013] Furthermore, the 16 binary numbers preset by the administrator are 00, 01, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111.

[0014] The method for optimizing water resource allocation for near-zero wastewater discharge in industrial parks includes the following steps:

[0015] Step 1: The information collection module obtains the optimized configuration data of the industrial park, which includes the optimal wastewater discharge and recycling strategies of each industrial enterprise in the industrial park;

[0016] Step 2: Classify the 16 binary numbers preset by the management personnel according to the number of digits of each binary number: 2 digits, 3 digits, 4 digits, and add the 16 binary numbers to the first, second, and third gradient lists accordingly according to the classification results;

[0017] Step 3: The configuration mapping module receives the optimized configuration data of the industrial park, and after receiving the optimized configuration data of the industrial park, performs binary conversion on the optimized configuration data of the industrial park to obtain mapping code data, and selects a number of selection combinations from the mapping code data according to a preset selection step, wherein a selection combination consists of a pre-sequence string and a post-sequence string, and the number of characters in the pre-sequence string and the post-sequence string constituting a selection combination is equal;

[0018] Step 4: Based on all the binary numbers added to the first, second and third gradient lists, determine the gradient list that matches them based on the number of character bits in the preceding string in each selected combination, where matching means that the number of character bits in the preceding string is equal to the number of bits of any binary number in the corresponding gradient list;

[0019] Step 5: Determine the selection object and mapping object of each selection combination according to the characters constituting the preamble string and the postamble string in each selection combination, and obtain the optimized mapping sequence and the response mapping sequence of the industrial park according to the selection object and mapping object of each selection combination;

[0020] Step 6: The enterprise-side module receives the optimized mapping sequence and the response mapping sequence of the industrial park, and restores the optimized configuration data of the industrial park based on the received optimized mapping sequence of the industrial park.

[0021] Beneficial effects of the present invention:

[0022] The present invention acquires the optimal water resource allocation scheme of the industrial park by setting an information acquisition module, converts the optimal water resource allocation scheme of the industrial park into an optimization mapping sequence and a response mapping sequence for transmission in the network by setting a configuration mapping module, and receives and restores the optimization mapping sequence and the response mapping sequence of the industrial park to obtain the optimal water resource allocation scheme of the industrial park. In this way, the traditional key encryption method is broken away, the occurrence of data insecurity caused by key loss is avoided, and resource consumption for key management is saved;

[0023] The present invention has gone through multiple precise steps in the process of converting the optimal water resource allocation scheme of the industrial park by configuring the mapping module. First, the process involves converting the optimized configuration data into binary form to generate mapping code data. Then, a plurality of specific selection combinations are selected from these mapping code data, each combination consisting of a pre-order string and a post-order string. The uniqueness of this step is that the string length of each selection combination is specified and cut in the order of 2, 3, and 4, which is different from the traditional cutting algorithm and increases the complexity of the selection logic;

[0024] Then, the corresponding matching gradient list is determined according to the binary numbers contained in the first, second and third gradient lists. Finally, the system will evaluate the leading and trailing strings in each selection combination, as well as the corresponding gradient list information, to accurately define the selection object and mapping object of each combination. In this way, the optimal configuration plan of the industrial park can be securely transmitted without relying on key encryption, avoiding the risks of data security in the park caused by key loss or leakage when using key encryption. At the same time, it breaks through the limitations of traditional encryption methods and greatly increases the difficulty for potential attackers to crack. BRIEF DESCRIPTION OF THE DRAWINGS

[0025] The present invention will be further described below in conjunction with the accompanying drawings.

[0026] Figure 1 is a system block diagram of the present invention;

[0027] Figure 2 It is a flow chart of the method of the present invention. DETAILED DESCRIPTION

[0028] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0029] like Figure 1 , Figure 2 As shown, the water resource optimization configuration system and method for near-zero sewage discharge in industrial parks include an information collection module, a configuration mapping module and an enterprise-side module;

[0030] The information collection module is used to obtain the optimal water resource allocation plan of the industrial park, and generate the optimized configuration data of the industrial park based on it, and transmit it to the configuration mapping module. The optimal water resource allocation plan contains the optimal wastewater discharge and recycling strategy of each industrial enterprise in the industrial park, which is used to guide each industrial enterprise in the industrial park to discharge and recycle wastewater;

[0031] A configuration mapping module, used for converting the optimized configuration data of the industrial park into an optimized mapping sequence and a response mapping sequence of the industrial park;

[0032] The configuration mapping module pre-stores the first, second and third gradient lists, and the first, second and third gradient lists store a number of binary numbers correspondingly;

[0033] In this embodiment, the configuration mapping module is based on 16 binary numbers preset by the administrator, classifies these binary numbers according to their bit numbers: 2 bits, 3 bits, 4 bits, and adds them to the first, second, and third gradient lists accordingly;

[0034] Specifically, these 16 binary numbers are 00, 01, 10, 11 (2 bits), 100, 101, 110, 111 (3 bits), 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111 (4 bits);

[0035] In each gradient list, all binary numbers will be arranged from left to right, and the order is determined based on the size of the decimal value corresponding to the binary number. That is, for each gradient list, the binary numbers will be sorted from small to large according to their corresponding decimal values;

[0036] For example, in the first gradient list, the binary numbers from left to right will be arranged as 00 (corresponding to decimal 0), 01 (corresponding to decimal 1), 10 (corresponding to decimal 2), 11 (corresponding to decimal 3), because 0<1<2<3;

[0037] Similarly, the binary numbers in the second gradient list will be arranged as 100 (corresponding to decimal 4), 101 (corresponding to decimal 5), 110 (corresponding to decimal 6), 111 (corresponding to decimal 7), because 4<5<6<7;

[0038] The binary numbers in the third gradient list will be arranged as 1000 (corresponding to decimal 8), 1001 (corresponding to decimal 9), 1010 (corresponding to decimal 10), 1011 (corresponding to decimal 11), 1100 (corresponding to decimal 12), 1101 (corresponding to decimal 13), 1110 (corresponding to decimal 14), 1111 (corresponding to decimal 15), because 8<9<10<11<12<13<14<15;

[0039] After receiving the transmitted optimized configuration data of the industrial park, the configuration mapping module generates an optimized mapping sequence and a response mapping sequence of the industrial park according to a preset generation rule. The specific mapping rules are as follows:

[0040] S11: performing binary conversion on the received optimized configuration data of the industrial park, and marking the converted binary data as mapping coded data;

[0041] S12: Selecting a first selection combination from the mapped coded data according to a preset selection step, the steps are as follows:

[0042] S121: First, specify the interception length as 2, intercept the first two characters, i.e., the first and second characters, from the mapping coded data in order from left to right as the to-be-prefixed string A1, and then continue to intercept two characters, i.e., the third and fourth characters, to the right as the to-be-postfixed string A2;

[0043] S122: Calculate and obtain the selection value B1 of the preceding and following sequence strings using the formula B1=PA1+PA2, wherein PA1 is the value of the preceding sequence string A1 converted to a decimal number, and PA2 is the value of the following sequence string A2 converted to a decimal number;

[0044] It should be noted that the selection values ​​of the to-be-prefixed and to-be-postfixed strings are manually defined to screen whether the to-be-prefixed and to-be-postfixed strings can be determined as the to-be-prefixed and to-be-postfixed strings;

[0045] S123: Compare B1 and P1, where P1 is a preset first selection threshold. In this embodiment, the value of P1 is 4:

[0046] If B1≥P1, it means that the number of bits of the binary number corresponding to B1 is 3 bits, and the first selection combination is selected from the mapped coded data according to the preset final selection rule;

[0047] SS1: At this time, the interception length is updated to 3, and the first three characters, i.e., the first, second, and third characters, are intercepted from the mapping code data in order from left to right as the pre-order string C1, and then three characters, i.e., the fourth, fifth, and sixth characters, are intercepted to the right as the post-order string C2, wherein the mapping code data here refers to the mapping code data before the S121 step is performed and before the interception;

[0048] SS2: Follow the same steps as S122 to calculate the selection value B2 of the sequence string to be preceded and followed at this time;

[0049] SS3: Compare B2 and P2, where P2 is the preset second selection threshold. In this embodiment, the value of P2 is 8:

[0050] SS31: If B2≥P2, it indicates that the number of bits of the binary number corresponding to B2 is 4 bits: at this time, the interception length is updated to 4, and the first four characters, i.e., the first, second, third, and fourth characters, are intercepted from the mapping code data in order from left to right as the pre-order string D1 to be waited, and then four characters, i.e., the fifth, sixth, seventh, and eighth characters, are intercepted to the right as the post-order string D2 to be waited, and the pre-order string D1 to be waited and the post-order string to be waited are automatically determined as the pre-order string and post-order string in a selection combination, wherein the mapping code data here refers to the mapping code data before the S121 step is performed and before interception;

[0051] SS32: If B2 < P2, respectively determine the to-be-precursor string C1 and the to-be-suffix string C2 as the precursor string and the suffix string in a selection combination;

[0052] If B1 < P1, respectively determine the to-be-precursor string A1 and the to-be-suffix string A2 as the precursor string and the suffix string in a selection combination; these two strings form a selection combination;

[0053] S13: Sequentially select the first, second,..., d selection combinations from the mapping encoded data in the order from left to right according to S12. It should be noted that each selection combination is based on the remaining mapping encoded data after intercepting the previous selection combination. For example, the precursor string and the suffix string in the second selection combination are intercepted from the remaining mapping encoded data after intercepting the precursor string and the suffix string of the first selection combination;

[0054] And if there are still several characters in the remaining mapping encoded data after selecting the dth selection combination, store these several characters as a group of selection strings temporarily;

[0055] S14: Obtain the first, second, and third gradient lists stored in the current configuration mapping module, marked as E1, E2, and E3 respectively;

[0056] S15: Mark the d selection combinations selected from the mapping encoded data as D1, D2,..., Dd in the order of selection of each selection combination;

[0057] S16: Determine the number of digits of the precursor string in the selection combination D1, and obtain the mapping strings of the precursor string and the suffix string of the selection combination D1 according to the determination result. At the same time, update the precursor string and the suffix string of the selection combination D1:

[0058] S161: If the number of digits of the precursor string in the selection combination D1 is 2, generate the mapping strings of the precursor string and the suffix string in the selection combination D1 according to the preset first generation rule, and at the same time update the precursor string and the suffix string in the selection combination D1. The specific steps are as follows:

[0059] S21: In the order from left to right, first determine whether the first character F1 in the precursor string in the selection combination D1 is '0'. If the character F1 is 0, use the binary number '10' as the mapping string of the precursor string in the selection combination D1, then delete the character F1 in the precursor string in the selection combination D1, and update the string after deletion as the precursor string of the selection combination D1;

[0060] Otherwise, the binary number "11" is used as the mapping string of the preceding string in the selection combination D1, and then the character F1 in the preceding string in the selection combination D1 is deleted, and the deleted string is updated as the preceding string of the selection combination D1;

[0061] S22: Then determine whether the first character F2 in the post-order string in the selection combination D1 is "0". If the character F2 is 0, use the binary number "10" as the mapping string of the post-order string in the selection combination D1, and then delete the character F2 in the post-order string in the selection combination D1, and update the remaining content in the post-order string after the deletion to the post-order string of the selection combination D1;

[0062] Otherwise, the binary number "11" is used as the mapping string of the post-order string in the selection combination D1, and then the character F2 in the post-order string in the selection combination D1 is deleted, and the remaining content in the post-order string after the deletion is updated to the post-order string of the selection combination D1;

[0063] S162: If the number of digits of the pre-order string in the selection combination D1 is 3, a mapping string of the pre-order string and the post-order string in the selection combination D1 is generated according to the preset second generation rule, and the pre-order string and the post-order string in the selection combination D1 are updated at the same time. The specific steps are as follows:

[0064] S31: From left to right, first determine whether the string G1 formed by the first two characters in the preceding string in the selection combination D1 is "10". If the string G1 is 10, use the binary number "20" as the mapping string of the preceding string in the selection combination D1, then delete the string G1 in the preceding string in the selection combination D1, and update the deleted string to the preceding string of the selection combination D1;

[0065] Otherwise, the binary number "21" is used as the mapping string of the preceding string in the selection combination D1, and then the string G1 in the preceding string in the selection combination D1 is deleted, and the deleted string is updated as the preceding string of the selection combination D1;

[0066] S32: Then determine whether the string G2 formed by the first two characters in the post-order string in the selection combination D1 is "10". If the string G2 is 10, use the binary number "20" as the mapping string of the post-order string in the selection combination D1, and then delete the string G2 in the post-order string in the selection combination D1, and update the deleted string to the post-order string of the selection combination D1;

[0067] S163: If the number of digits of the pre-order string in the selection combination D1 is 4, a mapping string of the pre-order string and the post-order string in the selection combination D1 is generated according to the preset third generation rule, and the pre-order string and the post-order string in the selection combination D1 are updated at the same time. The specific steps are as follows:

[0068] S41: From left to right, first determine whether the string H1 formed by the first three characters in the preceding string in the selection combination D1 is "100". If the string H1 is 100, use the binary number "31" as the mapping string of the preceding string in the selection combination D1, then delete the string H1 in the preceding string in the selection combination D1, and update the deleted string to the preceding string of the selection combination D1;

[0069] If the string H1 is 101, the binary number "32" is used as the mapping string of the preceding string in the selection combination D1, and then the string H1 in the preceding string in the selection combination D1 is deleted, and the deleted string is updated as the preceding string of the selection combination D1;

[0070] If the string H1 is 110, the binary number "33" is used as the mapping string of the preceding string in the selection combination D1, and then the string H1 in the preceding string in the selection combination D1 is deleted, and the deleted string is updated as the preceding string of the selection combination D1;

[0071] If the string H1 is 111, the binary number "34" is used as the mapping string of the preceding string in the selection combination D1, and then the string H1 in the preceding string in the selection combination D1 is deleted, and the deleted string is updated as the preceding string of the selection combination D1;

[0072] S42: From left to right, first determine whether the string H2 formed by the first three characters in the post-order string in the selection combination D1 is "100". If the string H2 is 100, use the binary number "31" as the mapping string of the post-order string in the selection combination D1, then delete the string H2 in the post-order string in the selection combination D1, and update the deleted string to the post-order string of the selection combination D1;

[0073] If the string H2 is 101, the binary number "32" is used as the mapping string of the post-order string in the selection combination D1, and then the string H2 in the post-order string in the selection combination D1 is deleted, and the deleted string is updated to the post-order string of the selection combination D1;

[0074] If the string H2 is 110, the binary number "33" is used as the mapping string of the post-order string in the selection combination D1, and then the string H2 in the post-order string in the selection combination D1 is deleted, and the deleted string is updated to the post-order string of the selection combination D1;

[0075] If the string H2 is 111, the binary number "34" is used as the mapping string of the post-order string in the selection combination D1, and then the string H2 in the post-order string in the selection combination D1 is deleted, and the deleted string is updated to the post-order string of the selection combination D1;

[0076] S17: according to the order of the pre-order string and the post-order string, the pre-order string and the post-order string of the updated selection combination D1 are concatenated to obtain the selection object of the selection combination D1;

[0077] Then, the mapping strings of the pre-order string and the post-order string of the selection combination D1 are converted into 8-bit binary numbers in turn, and the converted 8-bit binary numbers are concatenated according to the order of their conversion to obtain the mapping object of the selection combination D1;

[0078] S18: According to S16 to S17, the selection objects and mapping objects of the selection combinations D1, D2, ..., Dd are obtained in sequence;

[0079] S19: in the order of the selection combinations D1, D2, ..., Dd, the selection objects of the selection combinations D1, D2, ..., Dd are spliced ​​to obtain an optimized mapping sequence of the industrial park;

[0080] The mapping objects of the selection combinations D1, D2, ..., Dd are concatenated to obtain a corresponding mapping sequence of the industrial park, wherein if a selection string exists, the selection string is concatenated to the mapping object of the selection combination Dd to obtain a corresponding mapping sequence of the industrial park;

[0081] The optimized mapping sequence and the response mapping sequence of the industrial park generated by the configuration mapping module are transmitted to the local end module;

[0082] The enterprise-side module is used for enterprises in the industrial park to manage and utilize water resources according to the optimal water resource allocation plan of the industrial park. The enterprise-side module includes a plurality of enterprise units, and one enterprise unit corresponds to one industrial enterprise in the industrial park;

[0083] The enterprise-side module pre-stores the first, second and third gradient lists, and the elements stored in the first, second and third gradient lists correspond to the same elements stored in the first, second and third gradient lists in the configuration mapping module;

[0084] After receiving the transmitted optimized mapping sequence and response mapping sequence of the industrial park, the enterprise-side module restores them according to the preset restoration rules. The preset restoration rules are as follows:

[0085] SSS1: Specify the first cutting step size as 8, and cut the received industrial park response mapping sequence into 2d restored mapping strings from left to right;

[0086] According to the position of each restored mapping string in the response mapping sequence of the industrial park before cutting, the 2d restored mapping strings are marked as I1, I2, ..., Ii from left to right, where i=1, 2, ..., 2d;

[0087] It should be noted that, if after cutting 2d restored mapping strings, there are still some characters left in the response mapping sequence of the industrial park, the response mapping sequence of the industrial park remaining after cutting is marked as the compensation string of the industrial park;

[0088] SSS2: Specify the second cutting step length as 2, and cut the received optimized mapping sequence of industrial parks into 2d optimized restoration strings from left to right;

[0089] According to the position of each optimized restored string in the optimized mapping sequence of the industrial park before cutting, the 2d optimized restored strings are marked as J1, J2, ..., Ji from left to right;

[0090] SSS3: According to the optimized restoration string J1 and the restoration mapping string I1, the optimized restoration object corresponding to the optimized restoration string J1 can be obtained;

[0091] For example, if the optimized restoration string is 0, and the 8-bit binary number corresponding to the restoration mapping string I1 is 00001011, then the optimized restoration object corresponding to the optimized restoration string J1 is 10;

[0092] SSS4: According to SSS1 to SSS3, the optimized restoration objects of the optimized restoration strings J1, J2, ..., Ji are obtained in sequence, and the optimized restoration objects of the optimized restoration strings J1, J2, ..., Ji are concatenated in the order in which they are obtained to obtain the mapping code data of the industrial park. It should be noted that if there is a compensation string for the industrial park, the compensation string of the industrial park is concatenated after the optimized restoration object of Ji to obtain the mapping code data of the industrial park;

[0093] The enterprise-side module restores the mapping coding data of the spliced ​​industrial park to obtain the optimized configuration data of the industrial park. The enterprise-side module transmits the optimal wastewater discharge and recycling strategies of each industrial enterprise contained in the optimized configuration data of the industrial park to the corresponding enterprise unit, and the corresponding enterprise executes the current optimal wastewater discharge and recycling strategy;

[0094] In the description of the specification, the description with reference to the terms "one embodiment", "example", "specific example", etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present invention. In this specification, the schematic representation of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any one or more embodiments or examples in a suitable manner.

[0095] The above contents are merely examples and explanations of the present invention. Those skilled in the art may make various modifications or additions to the specific embodiments described or replace them in a similar manner. As long as they do not deviate from the invention or exceed the scope defined by the claims, they shall all fall within the protection scope of the present invention.

[0096] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.

Claims

1. The water resource optimization allocation system for near-zero wastewater discharge in industrial parks is characterized by: include: The information collection module is used to obtain the optimal configuration data of the industrial park, which includes the optimal wastewater discharge and recycling strategies of each industrial enterprise in the industrial park; A configuration mapping module is configured to classify the 16 binary numbers preset by the administrator according to the number of bits of each binary number: 2 bits, 3 bits, and 4 bits, and to add the 16 binary numbers to the first, second, and third gradient lists accordingly according to the classification results; A configuration mapping module is used to perform binary conversion on the optimized configuration data of the industrial park to obtain mapping code data, and select a number of selection combinations from the mapping code data according to a preset selection step, wherein a selection combination consists of a pre-order string and a post-order string, and the number of characters in the pre-order string and the post-order string constituting a selection combination is equal; According to all the binary numbers added to the first, second and third gradient lists, a gradient list matching them is determined according to the number of character bits in the preceding string in each selected combination, where matching means that the number of character bits in the preceding string is equal to the number of bits of any binary number in the corresponding gradient list; Determine the selection object and mapping object of each selection combination according to the characters constituting the preceding string and the succeeding string in each selection combination, and obtain the optimized mapping sequence and the response mapping sequence of the industrial park according to the selection object and mapping object of each selection combination; It also includes an enterprise-side module, which receives the optimized mapping sequence and the response mapping sequence of the industrial park, and restores the optimized configuration data of the industrial park according to the received optimized mapping sequence of the industrial park.

2. The water resource optimization configuration system for near-zero discharge of sewage in industrial parks according to claim 1 is characterized in that: The 16 binary numbers preset by the administrator are 00, 01, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111.

3. The water resource optimization configuration system for near-zero discharge of sewage in industrial parks according to claim 1 is characterized in that: The default selection steps for selecting a number of selection combinations from the mapped coded data are as follows: S12: Selecting a first selection combination from the mapped coded data according to a preset selection step, the steps are as follows: S121: First, specify the interception length as 2, intercept the first two characters, i.e., the first and second characters, from the mapping coded data in order from left to right as the to-be-prefixed string A1, and then continue to intercept two characters, i.e., the third and fourth characters, to the right as the to-be-postfixed string A2; S122: Calculate and obtain the selection value B1 of the preceding and following sequence strings using the formula B1=PA1+PA2, wherein PA1 is the value of the preceding sequence string A1 converted to a decimal number, and PA2 is the value of the following sequence string A2 converted to a decimal number; S123: Compare B1 and P1, where P1 is the preset first selection threshold: If B1≥P1, the first selection combination is selected from the mapped coded data according to the preset final selection rule, and the preset selection rule is as follows; SS1: Update the truncation length to 3. Starting from the left, extract the first three characters, i.e., the first, second, and third characters from the mapped encoded data as the pre-order string C1, and then continue to extract the next three characters, i.e., the fourth, fifth, and sixth characters to the right as the post-order string C2; SS2: Follow the same steps as S122 to calculate the selection value B2 of the current pre- and post-order strings; SS3: Compare the magnitudes of B2 and P2, where P2 is the preset second selection threshold: SS31: If B2 ≥ P2, update the truncation length to 4. Starting from the left, extract the first four characters, i.e., the first, second, third, and fourth characters from the mapped encoded data as the pre-order string D1, and then continue to extract the next four characters, i.e., the fifth, sixth, seventh, and eighth characters to the right as the post-order string D2, and automatically determine that the pre-order string D1 and the post-order string D2 are the pre-order string and the post-order string in a selection combination; SS32: If B2 < P2, then respectively determine that the pre-order string C1 and the post-order string C2 are the pre-order string and the post-order string in a selection combination; If B1 < P1, then respectively determine that the pre-order string A1 and the post-order string A2 are the pre-order string and the post-order string in a selection combination; S13: Sequentially select the first, second,..., d selection combinations from the mapped encoded data in the order from left to right according to S12, where each selection combination is based on the remaining mapped encoded data after the previous selection combination is truncated.

4. The water resource optimization configuration system for near-zero discharge of sewage in industrial parks according to claim 3 is characterized in that: The steps to determine the selection object and the mapping object of each selection combination are as follows: S14: Obtain the first, second, and third gradient lists stored in the current configuration mapping module, marked as E1, E2, and E3 respectively; S15: In the order of selection of each selection combination, sequentially mark the d selection combinations selected from the mapped encoded data as D1, D2,..., Dd; S16: Determine the number of characters in the pre-order string of the selection combination D1, and based on the determination result, obtain the mapped strings of the pre-order string and the post-order string of the selection combination D1, and at the same time update the pre-order string and the post-order string of the selection combination D1; S161: If the number of characters in the pre-order string of the selection combination D1 is 2, generate the mapped strings of the pre-order string and the post-order string in the selection combination D1 according to the preset first generation rule, and at the same time update the pre-order string and the post-order string in the selection combination D1; S162: If the number of characters in the pre-order string of the selection combination D1 is 3, generate the mapped strings of the pre-order string and the post-order string in the selection combination D1 according to the preset second generation rule, and at the same time update the pre-order string and the post-order string in the selection combination D1; If the number of characters in the pre-order string of the selection combination D1 is 4, generate the mapped strings of the pre-order string and the post-order string in the selection combination D1 according to the preset third generation rule, and at the same time update the pre-order string and the post-order string in the selection combination D1; S163: If the number of characters in the pre-order string of the selection combination D1 is 4, generate the mapped strings of the pre-order string and the post-order string in the selection combination D1 according to the preset third generation rule, and at the same time update the pre-order string and the post-order string in the selection combination D1; S17: according to the order of the pre-order string and the post-order string, the pre-order string and the post-order string of the updated selection combination D1 are concatenated to obtain the selection object of the selection combination D1; Then, the mapping strings of the pre-order string and the post-order string of the selection combination D1 are converted into 8-bit binary numbers in turn, and the converted 8-bit binary numbers are concatenated according to the order of their conversion to obtain the mapping object of the selection combination D1; S18: According to S16 to S17, the selection objects and mapping objects of the selection combinations D1, D2, ..., Dd are obtained in turn.

5. The water resource optimization configuration system for near-zero discharge of sewage in industrial parks according to claim 4 is characterized in that: In S161, the first generation rule is preset as follows: S21: From left to right, first determine whether the first character F1 in the preceding string of the selection combination D1 is "0". If the character F1 is 0, use the binary number "10" as the mapping string of the preceding string of the selection combination D1, then delete the character F1 in the preceding string of the selection combination D1, and update the deleted string to the preceding string of the selection combination D1; Otherwise, the binary number "11" is used as the mapping string of the preceding string in the selection combination D1, and then the character F1 in the preceding string in the selection combination D1 is deleted, and the string after deletion is updated as the preceding string of the selection combination D1; S22: Then determine whether the first character F2 in the post-order string in the selection combination D1 is "0". If the character F2 is 0, use the binary number "10" as the mapping string of the post-order string in the selection combination D1, and then delete the character F2 in the post-order string in the selection combination D1, and update the remaining content in the post-order string after the deletion to the post-order string of the selection combination D1; Otherwise, the binary number "11" is used as the mapping string of the post-order string in the selection combination D1, and then the character F2 in the post-order string in the selection combination D1 is deleted, and the remaining content in the post-order string after the deletion is updated to the post-order string of the selection combination D1.

6. A method for optimizing water resource allocation for near-zero discharge of sewage in industrial parks, using a water resource optimization allocation system for near-zero discharge of sewage in industrial parks as described in any one of claims 1 to 5, characterized in that: The following steps are involved: Step 1: The information collection module obtains the optimized configuration data of the industrial park, which includes the optimal wastewater discharge and recycling strategies of each industrial enterprise in the industrial park; Step 2: Classify the 16 binary numbers preset by the management personnel according to the number of digits of each binary number: 2 digits, 3 digits, 4 digits, and add the 16 binary numbers to the first, second, and third gradient lists accordingly according to the classification results; Step 3: The configuration mapping module receives the optimized configuration data of the industrial park, and after receiving the optimized configuration data of the industrial park, performs binary conversion on the optimized configuration data of the industrial park to obtain mapping code data, and selects a number of selection combinations from the mapping code data according to a preset selection step, wherein a selection combination consists of a pre-sequence string and a post-sequence string, and the number of characters in the pre-sequence string and the post-sequence string constituting a selection combination is equal; Step 4: Based on all the binary numbers added to the first, second and third gradient lists, determine the gradient list that matches them based on the number of character bits in the preceding string in each selected combination, where matching means that the number of character bits in the preceding string is equal to the number of bits of any binary number in the corresponding gradient list; Step 5: Determine the selection object and mapping object of each selection combination according to the characters constituting the preamble string and the postamble string in each selection combination, and obtain the optimized mapping sequence and the response mapping sequence of the industrial park according to the selection object and mapping object of each selection combination; Step 6: The enterprise-side module receives the optimized mapping sequence and the response mapping sequence of the industrial park, and restores the optimized configuration data of the industrial park based on the received optimized mapping sequence of the industrial park.