Movatterモバイル変換


[0]ホーム

URL:


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

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

Info

Publication number
CN118643518B
CN118643518BCN202411088322.6ACN202411088322ACN118643518BCN 118643518 BCN118643518 BCN 118643518BCN 202411088322 ACN202411088322 ACN 202411088322ACN 118643518 BCN118643518 BCN 118643518B
Authority
CN
China
Prior art keywords
string
selection
mapping
order
selection combination
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202411088322.6A
Other languages
Chinese (zh)
Other versions
CN118643518A (en
Inventor
杨猛
景翠翠
李凯
赵海涛
胡金武
崔焕霞
王德龙
王晓燕
郑学磊
舒方辉
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Shuifa Beijing Construction Co ltd
Original Assignee
Shuifa Beijing Construction Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Shuifa Beijing Construction Co ltdfiledCriticalShuifa Beijing Construction Co ltd
Priority to CN202411088322.6ApriorityCriticalpatent/CN118643518B/en
Publication of CN118643518ApublicationCriticalpatent/CN118643518A/en
Application grantedgrantedCritical
Publication of CN118643518BpublicationCriticalpatent/CN118643518B/en
Activelegal-statusCriticalCurrent
Anticipated expirationlegal-statusCritical

Links

Classifications

Landscapes

Abstract

The invention discloses a system and a method for optimizing and configuring water resources of near-zero discharge of sewage in an industrial park, which relate to the technical field of optimizing and configuring water resources, and the invention obtains an optimal water resource configuration scheme of the industrial park through a setting information acquisition module. First, the process involves converting the optimal configuration data into binary form to generate map-encoded data. Then, a plurality of specific selected combinations are selected from the map-encoded data, each combination being composed of one preamble string and one postamble string. The unique feature of this step is that the string length of each selection combination is cut according to the sequence of 2, 3 and 4, which is different from the traditional cutting algorithm, and improves the complexity of the selection logic.

Description

System and method for optimizing and configuring water resources of near-zero emission of sewage in industrial park
Technical Field
The invention relates to the technical field of water resource optimal allocation management, in particular to a water resource optimal allocation system and method for near zero discharge of industrial park sewage.
Background
Along with the acceleration of the industrialization progress, the water consumption and sewage discharge of the industrial park are increased year by year, and huge pressure is brought to water supply resources and environment. The traditional sewage treatment method often cannot meet the increasingly strict environmental protection requirements, and the treated sewage hardly meets the reuse standard. Therefore, the realization of near zero discharge of sewage in the industrial park becomes urgent;
At present, the industrial park establishes an optimal water resource allocation scheme for the industrial park by collecting detailed data of water use, sewage treatment and water resource reuse of each enterprise in the industrial park, then issues the established optimal water resource allocation scheme to each enterprise in the industrial park, each enterprise in the industrial park realizes near zero emission of sewage of the industrial park by executing the optimal water resource allocation scheme, sensitive information such as production process, environmental protection measures, economic benefits and the like of the enterprise is possibly related to data in the optimal water resource allocation scheme in the issuing process, and needs to be protected, so the issued scheme is encrypted in a key encryption mode, however, most parks do not have enough time resources and financial resources to maintain and manage keys, which leads to risk of losing or leaking keys, and further the data security of the whole park is possibly threatened;
in order to solve the above problems, the present invention proposes a solution.
Disclosure of Invention
The invention aims to provide a water resource optimal allocation system and a water resource optimal allocation method for near-zero emission of industrial park sewage, which aim to solve the problems that in the prior art, keys are not maintained and managed for the industrial park, so that the optimal water resource allocation scheme for each enterprise in the park is encrypted by using the keys possibly having loss or leakage risks, and the data safety of the whole park is threatened;
the aim of the invention can be achieved by the following technical scheme:
near zero emission's of industrial park sewage water resource optimal configuration system includes:
the information acquisition module is used for acquiring the optimal configuration data of the industrial park, wherein the optimal configuration data comprises the optimal wastewater discharge and recycling strategies of all industrial enterprises in the industrial park;
A configuration mapping module, configured to preset 16 binary numbers by a manager, according to the number of bits of each binary number: classifying 2 bits, 3 bits and 4 bits, and correspondingly adding the 16 binary numbers into a first gradient list, a second gradient list and a third gradient list according to classification results;
The configuration mapping module is used for binary converting the optimized configuration data of the industrial park to obtain mapping coding data, and selecting a plurality of selection combinations from the mapping coding data according to a preset selection step, wherein one selection combination consists of a preamble string and a postamble string, and the number of characters in the preamble string and the postamble string of one selection combination is equal;
Determining a gradient list matched with the character bit number in the preamble string according to all binary numbers added into the first, second and third gradient lists and the number of the character bit in the preamble string in each selected combination, wherein the matching of the character bit number in the preamble string is equal to the number of any binary number in the corresponding gradient list;
And determining the selection object and the mapping object of each selection combination according to the characters respectively forming the preamble string and the postamble string in each selection combination, and obtaining the optimized mapping sequence and the response mapping sequence of the industrial park according to the selection object and the mapping object of each selection combination.
Further, 16 binary numbers preset by the manager are 00, 01, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, 1111, respectively.
The near-zero emission water resource optimal allocation method for the industrial park sewage comprises the following steps:
Step one: the information acquisition module acquires the optimal configuration data of the industrial park, wherein the optimal configuration data comprises the optimal wastewater discharge and recycling strategies of all industrial enterprises in the industrial park;
step two: 16 binary numbers to be preset by the manager, according to the number of bits of each binary number: classifying 2 bits, 3 bits and 4 bits, and correspondingly adding the 16 binary numbers into a first gradient list, a second gradient list and a third gradient list according to classification results;
Step three: the configuration mapping module receives the optimized configuration data of the industrial park, binary converts the optimized configuration data of the industrial park after receiving to obtain mapping coding data, and selects a plurality of selection combinations from the mapping coding data according to a preset selection step, wherein one selection combination consists of a front character string and a rear character string, and the number of characters in the front character string and the rear character string of one selection combination is equal;
Step four: determining a gradient list matched with the character bit number in the preamble string according to all binary numbers added into the first, second and third gradient lists and the number of the character bit in the preamble string in each selected combination, wherein the matching of the character bit number in the preamble string is equal to the number of any binary number in the corresponding gradient list;
Step five: determining a selection object and a mapping object of each selection combination according to characters respectively forming a preamble string and a postamble string in each selection combination, and obtaining an optimized mapping sequence and a response mapping sequence of the industrial park according to the selection object and the mapping object of each selection combination;
step six: and the enterprise terminal module receives the optimization mapping sequence and the response mapping sequence of the industrial park, and restores the optimization mapping sequence of the industrial park according to the received optimization mapping sequence to obtain the optimization configuration data of the industrial park.
The invention has the beneficial effects that:
According to the invention, the optimal water resource allocation scheme of the industrial park is acquired through the setting information acquisition module, the setting configuration mapping module converts the optimal water resource allocation scheme of the industrial park into the optimal mapping sequence and the response mapping sequence to be transmitted in the network, and the setting enterprise end module receives and restores the optimal mapping sequence and the response mapping sequence of the industrial park to obtain the optimal water resource allocation scheme of the industrial park, so that the traditional key encryption mode is eliminated, the occurrence of data unsafe conditions caused by key loss is avoided, and the resource consumption for key management is also saved;
the present invention undergoes a number of precise steps in the process of the configuration mapping module converting the optimal water resource configuration scheme for the industrial park. First, the process involves converting the optimal configuration data into binary form to generate map-encoded data. Then, a plurality of specific selected combinations are selected from the map-encoded data, each combination being composed of one preamble string and one postamble string. The unique feature of this step is that the string length of each selection combination is specified and intercepted according to the sequence of 2, 3 and 4, which is different from the traditional cutting algorithm, and improves the complexity of the selection logic;
And then determining a corresponding matching gradient list according to binary numbers contained in the first, second and third gradient lists, and finally, evaluating the preamble string and the postamble string in each selected combination and gradient list information corresponding to the preamble string and the postamble string by the system to accurately define the selected object and the mapped object of each combination.
Drawings
The invention is further described below with reference to the accompanying drawings.
FIG. 1 is a system block diagram of the present invention;
fig. 2 is a flow chart of the method of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
As shown in fig. 1 and 2, the system and the method for optimizing and configuring the water resource of the near-zero emission of the sewage in the industrial park comprise an information acquisition module, a configuration mapping module and an enterprise end module;
The information acquisition module is used for acquiring an optimal water resource allocation scheme of the industrial park, generating optimal allocation data of the industrial park according to the optimal allocation scheme, and transmitting the optimal allocation data to the allocation mapping module, wherein the optimal water resource allocation scheme comprises an optimal wastewater discharge and recycling strategy of each industrial enterprise in the industrial park, and is used for guiding each industrial enterprise in the industrial park to perform wastewater discharge and recycling;
the configuration mapping module is used for converting the optimization configuration data of the industrial park into an optimization mapping sequence and a response mapping sequence of the industrial park;
the configuration mapping module is pre-stored with a first gradient list, a second gradient list and a third gradient list, and the first gradient list, the second gradient list and the third gradient list are correspondingly stored with a plurality of binary numbers;
In the present embodiment, the configuration mapping module maps 16 binary numbers preset by the manager, based on the binary numbers, in terms of their number of bits: classifying 2 bits, 3 bits and 4 bits, and adding the classification bits, the 3 bits and the 4 bits to a first gradient list, a second gradient list and a third gradient list correspondingly;
Specifically, the 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), respectively;
In each gradient list, all binary numbers will be arranged in a left-to-right order, and the order is determined based on the size of the decimal values to which the binary numbers correspond, that is, for each gradient list, the binary numbers will be ordered from small to large by their corresponding decimal values;
For example, in the first gradient list, the left-to-right binary numbers would be arranged as 00 (0 corresponding to decimal number), 01 (1 corresponding to decimal number), 10 (2 corresponding to decimal number), 11 (3 corresponding to decimal number), because 0<1<2<3;
Likewise, the binary numbers in the second gradient list will be arranged as 100 (corresponding to 4 in decimal), 101 (corresponding to 5 in decimal), 110 (corresponding to 6 in decimal), 111 (corresponding to 7 in decimal), because 4<5<6<7;
The binary numbers in the third gradient list will be arranged as 1000 (8 for decimal), 1001 (9 for decimal), 1010 (10 for decimal), 1011 (11 for decimal), 1100 (12 for decimal), 1101 (13 for decimal), 1110 (14 for decimal), 1111 (15 for decimal), as 8<9<10<11<12<13<14<15;
and the configuration mapping module receives the transmitted optimization configuration data of the industrial park and generates an optimization mapping sequence and a response mapping sequence of the industrial park according to a preset generation rule, wherein the specific mapping rule is as follows:
S11: binary conversion is carried out on the received optimal configuration data of the industrial park, and the binary data after conversion are calibrated into mapping coding data;
S12: selecting a first selection combination from the mapping coding data according to a preset selection step, wherein the steps are as follows:
S121: firstly, designating the interception length as 2, intercepting the first two-bit characters, namely the first two-bit character, from the mapping coded data as a to-be-preceded character string A1 according to the sequence from left to right, and then continuing intercepting the second two-bit characters, namely the third two-bit character and the fourth two-bit character, as a to-be-followed character string A2 to right;
s122: calculating and obtaining a selection value B1 of the to-be-preceded and-followed character strings by using a formula B1=PA 1+PA2, wherein PA1 is a value converted from the to-be-preceded character string A1 to a decimal number, and PA2 is a value converted from the to-be-followed character string A2 to the decimal number;
it should be noted that, the selection value of the strings to be preceded and followed is defined for screening whether the strings to be preceded and followed can be determined as the strings to be preceded and followed;
S123: comparing the sizes of B1 and P1, wherein P1 is a preset first selection threshold value, and in the embodiment, the value of P1 is 4:
if B1 is more than or equal to P1, the number of bits of binary numbers corresponding to B1 is 3, and a first selection combination is selected from the mapping coding data according to a preset final selection rule;
SS1: at this time, updating the interception length to be 3, intercepting the first three-bit character, namely the first, the second and the third-bit character, from the mapping coded data according to the sequence from left to right as a character string C1 to be preceded, and then continuing intercepting the third-bit character, namely the fourth, the fifth and the sixth-bit character, to the right as a character string C2 to be followed, wherein the mapping coded data refers to mapping coded data which is not subjected to the step S121 and is not intercepted;
SS2: according to the same step of S122, calculating a selection value B2 of the strings to be preceded and followed at the moment;
SS3: comparing the sizes of B2 and P2, wherein P2 is a preset second selection threshold, and in the embodiment, the value of P2 is 8:
SS31: if B2 is greater than or equal to P2, the number of bits of binary numbers corresponding to B2 is 4: at this time, updating the interception length to be 4, intercepting the first four-bit character, namely the first, second, third and fourth-bit character, from the mapping coded data according to the sequence from left to right as a to-be-preceded character string D1, then continuing intercepting the fourth-bit character, namely the fifth, sixth, seventh and eighth-bit character, to the right as a to-be-followed character string D2, and automatically determining that the to-be-preceded character string D1 and the to-be-followed character string are a pre-sequence character string and a post-sequence character string in a selection combination, wherein the mapping coded data refers to mapping coded data which is not subjected to the step S121 and is not intercepted;
SS32: if B2 is less than P2, determining the to-be-preceded string C1 and the to-be-followed string C2 as a preamble string and a follow-up string in a selection combination respectively;
if B1 is less than P1, determining the to-be-preceded string A1 and the to-be-followed string A2 as a preamble string and a follow-up string in a selection combination respectively; the two strings form a selection combination;
S13: sequentially selecting a first selection combination, a second selection combination, a third selection combination and a fourth selection combination from the mapping coding data according to the sequence from left to right, wherein each selection combination is based on the mapping coding data remained after the interception of the last selection combination, and for example, a preamble string and a postamble string in the second selection combination are intercepted from the remained mapping coding data after the interception of the preamble string and the postamble string of the first selection combination;
If a plurality of characters still exist in the residual mapping coding data after the d-th selection combination is selected, temporarily storing the characters as a group choose character strings;
S14: acquiring a first gradient list, a second gradient list and a third gradient list stored in a current configuration mapping module, wherein the first gradient list, the second gradient list and the third gradient list are correspondingly marked as E1, E2 and E3;
s15: according to the sequence of the selection of each selection combination, D selection combinations selected from the mapping coding data are marked as D1, D2, D;
S16: the number of bits of the preamble string in the selected combination D1 is judged, mapping strings of the preamble string and the postamble string of the selected combination D1 are obtained according to the judging result, and meanwhile the preamble string and the postamble string of the selected combination D1 are updated:
S161: if the number of bits of the preamble string in the selection combination D1 is 2, the mapping string of the preamble string and the postamble string in the selection combination D1 is generated according to a preset first generation rule, and the preamble string and the postamble string in the selection combination D1 are updated at the same time, specifically comprising the following steps:
S21: according to the sequence from left to right, firstly judging whether the first character F1 in the preamble string in the selection combination D1 is 0, if the character F1 is 0, taking binary number '10' as a mapping string of the preamble string in the selection combination D1, deleting the character F1 in the preamble string in the selection combination D1, and updating the deleted string into the preamble string of the selection combination D1;
otherwise, taking binary number 11 as a mapping string of the preamble string in the selection combination D1, deleting the character F1 in the preamble string in the selection combination D1, and updating the deleted string into the preamble string of the selection combination D1;
S22: then judging whether the first character F2 in the subsequent character string in the selected combination D1 is 0, if the character F2 is 0, taking binary number '10' as a mapping character string of the subsequent character string in the selected combination D1, deleting the character F2 in the subsequent character string in the selected combination D1, and updating the rest content in the deleted subsequent character string into the subsequent character string of the selected combination D1;
Otherwise, taking binary number 11 as a mapping string of the subsequent strings in the selection combination D1, deleting the character F2 in the subsequent strings in the selection combination D1, and updating the rest content in the subsequent strings after deletion into the subsequent strings of the selection combination D1;
s162: if the number of bits of the preamble string in the selection combination D1 is 3, mapping strings of the preamble string and the postamble string in the selection combination D1 are generated according to a preset second generation rule, and the preamble string and the postamble string in the selection combination D1 are updated at the same time, specifically comprising the following steps:
S31: according to the sequence from left to right, firstly judging whether a character string G1 formed by the first two characters in the preamble string in the selection combination D1 is 10, if the character string G1 is 10, taking a binary number of 20 as a mapping character string of the preamble string in the selection combination D1, deleting the character string G1 in the preamble string in the selection combination D1, and updating the deleted character string into the preamble string of the selection combination D1;
otherwise, taking the binary number '21' as a mapping string of the preamble string in the selection combination D1, deleting the character string G1 in the preamble string in the selection combination D1, and updating the deleted character string into the preamble string of the selection combination D1;
s32: then judging whether the character string G2 formed by the first two characters in the subsequent character string in the selected combination D1 is 10, if the character string G2 is 10, taking the binary number 20 as the mapping character string of the subsequent character string in the selected combination D1, deleting the character string G2 in the subsequent character string in the selected combination D1, and updating the deleted character string into the subsequent character string of the selected combination D1;
S163: if the number of bits of the preamble string in the selection combination D1 is 4, mapping strings of the preamble string and the postamble string in the selection combination D1 are generated according to a preset third generation rule, and the preamble string and the postamble string in the selection combination D1 are updated at the same time, specifically comprising the following steps:
S41: according to the sequence from left to right, firstly judging whether a character string H1 formed by the first three characters in the preamble string in the selection combination D1 is 100, if the character string H1 is 100, taking a binary number '31' as a mapping character string of the preamble string in the selection combination D1, deleting the character string H1 in the preamble string in the selection combination D1, and updating the deleted character string into the preamble string of the selection combination D1;
If the character string H1 is 101, taking the binary number '32' as a mapping character string of the preamble string in the selection combination D1, deleting the character string H1 in the preamble string in the selection combination D1, and updating the deleted character string into the preamble string of the selection combination D1;
if the character string H1 is 110, taking the binary number '33' as a mapping character string of the preamble string in the selection combination D1, deleting the character string H1 in the preamble string in the selection combination D1, and updating the deleted character string into the preamble string of the selection combination D1;
If the character string H1 is 111, the binary number '34' is used as a mapping character string of the preamble string in the selection combination D1, then the character string H1 in the preamble string in the selection combination D1 is deleted, and the deleted character string is updated to the preamble string of the selection combination D1;
S42: according to the sequence from left to right, firstly judging whether a character string H2 formed by the first three characters in the subsequent character string in the selected combination D1 is 100, if the character string H2 is 100, taking a binary number '31' as a mapping character string of the subsequent character string in the selected combination D1, deleting the character string H2 in the subsequent character string in the selected combination D1, and updating the deleted character string into the subsequent character string of the selected combination D1;
If the character string H2 is 101, taking the binary number '32' as a mapping character string of the subsequent character string in the selection combination D1, deleting the character string H2 in the subsequent character string in the selection combination D1, and updating the deleted character string into the subsequent character string of the selection combination D1;
If the character string H2 is 110, taking the binary number '33' as a mapping character string of the subsequent character string in the selection combination D1, deleting the character string H2 in the subsequent character string in the selection combination D1, and updating the deleted character string into the subsequent character string of the selection combination D1;
If the character string H2 is 111, taking the binary number '34' as a mapping character string of the subsequent character string in the selection combination D1, deleting the character string H2 in the subsequent character string in the selection combination D1, and updating the deleted character string into the subsequent character string of the selection combination D1;
S17: splicing the preamble string and the postamble string of the updated selection combination D1 according to the sequence of the preamble string and the postamble string to obtain a selection object of the selection combination D1;
then sequentially converting the mapping strings of the preceding strings and the following strings of the selected combination D1 into 8-bit binary numbers, and splicing the converted 8-bit binary numbers according to the sequence of conversion to obtain the mapping object of the selected combination D1;
s18: sequentially obtaining a selection object and a mapping object of the selection combinations D1, D2, and Dd according to S16 to S17;
S19: according to the sequence of the selected combinations D1, D2, D, splicing the selected objects of the selected combinations D1, D2, D to obtain an optimized mapping sequence of the industrial park;
splicing the mapping objects of the selection combinations D1, D2, dd to obtain a response mapping sequence of the industrial park, wherein if choose character strings exist, the selection character strings are spliced to the mapping objects of the selection combinations Dd to obtain the response mapping sequence of the industrial park;
The optimization mapping sequence and the response mapping sequence of the industrial park generated by the configuration mapping module are transmitted to the local end module;
the enterprise terminal module is used for managing and utilizing water resources by enterprises in the industrial park according to an optimal water resource allocation scheme of the industrial park, and comprises a plurality of enterprise units, wherein one enterprise unit corresponds to one industrial enterprise in the industrial park;
the enterprise terminal module is pre-stored with a first gradient list, a second gradient list and a third gradient list, and elements stored in the first gradient list, the second gradient list and the third gradient list are the same as elements stored in the first gradient list, the second gradient list and the third gradient list in the configuration mapping module;
And the enterprise terminal module restores the transmitted optimization mapping sequence and response mapping sequence of the industrial park according to a preset restoration rule after receiving the optimization mapping sequence and response mapping sequence, wherein the preset restoration rule is as follows:
SSS1: designating the first cutting step length as 8, and cutting the received response mapping sequence of the industrial park into 2d reduction mapping strings according to the sequence from left to right;
marking 2d reduction mapping strings as I1, I2, ii, i=1, 2, i=2 in sequence from left to right according to the position of each reduction mapping string in the response mapping sequence of the industrial park before cutting;
it should be noted that, if after cutting 2d reduction mapping strings, the response mapping sequence of the industrial park still remains a plurality of characters, the response mapping sequence of the industrial park remaining after cutting is calibrated as a compensation string of the industrial park;
SSS2: designating the second cutting step length as 2, and cutting the received optimization mapping sequence of the industrial park into 2d optimization reduction strings according to the sequence from left to right;
according to the position of each optimized reduction string in the optimized mapping sequence of the industrial park before cutting, marking 2d optimized reduction strings as J1, J2, and Ji in sequence from left to right;
SSS3: according to the optimized reduction string J1 and the reduction mapping string I1, an optimized reduction object corresponding to the optimized reduction string J1 can be obtained;
For example, if the optimized reduction string is 0 and the 8-bit binary number corresponding to the reduction mapping string I1 is 00001011, the optimized reduction object corresponding to the optimized reduction string J1 is 10;
SSS4: sequentially obtaining optimized reduction word strings J1, J2, I and Ji according to SSS1 to SSS3, and splicing the optimized reduction word strings J1, J2, I and Ji according to the obtained sequence to obtain mapping coding data of the industrial park, wherein if a compensation word string of the industrial park exists, splicing the compensation word string of the industrial park to the optimized reduction object of Ji to obtain the mapping coding data of the industrial park;
The enterprise terminal module restores the mapping coded data of the industrial park obtained by splicing to obtain the optimal configuration data of the industrial park, and transmits the optimal wastewater discharge and recycling strategies of each industrial enterprise contained in the optimal configuration data of the industrial park to corresponding enterprise units, and the corresponding enterprises execute the current optimal wastewater discharge and recycling strategies;
In the description of the present specification, the descriptions of the terms "one embodiment," "example," "specific example," and the like, mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing is merely illustrative and explanatory of the invention, as various modifications and additions may be made to the particular embodiments described, or in a similar manner, by those skilled in the art, without departing from the scope of the invention or exceeding the scope of the invention as defined in the claims.
The foregoing describes one embodiment of the present invention in detail, but the description is only a preferred embodiment of the present invention and should not be construed as limiting the scope of the invention. All equivalent changes and modifications within the scope of the present invention are intended to be covered by the present invention.

Claims (6)

Translated fromChinese
1.工业园区污水近零排放的水资源优化配置系统,其特征在于,包括:1. The water resource optimization configuration system for near-zero sewage discharge in industrial parks is characterized by including:信息采集模块,用于获取工业园区的优化配置数据,优化配置数据中包含工业园区内各工业企业的最优废水排放和回收利用策略;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;配置映射模块,用于将由管理人员预设定的16个二进制数,按照每个二进制数的位数:2位、3位、4位进行分类,并将这16个二进制数按照分类结果相应的添加到第一、二和三梯度列表中;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.根据权利要求1所述的工业园区污水近零排放的水资源优化配置系统,其特征在于,管理人员预设定的16个二进制数分别为00、01、10、11、100、101、110、111、1000、1001、1010、1011、1100、1101、1110、1111。2. The water resource optimization allocation system for near-zero sewage discharge in an industrial park according to claim 1 is characterized in that the 16 binary numbers preset by the management personnel are 00, 01, 10, 11, 100, 101, 110, 111, 1000, 1001, 1010, 1011, 1100, 1101, 1110, and 1111.3.根据权利要求1所述的工业园区污水近零排放的水资源优化配置系统,其特征在于,从映射编码数据中遴选出若干遴选组合的预设遴选步骤如下: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 preset selection steps for selecting a plurality of selection combinations from the mapping code data are as follows:S12:按照预设遴选步骤从映射编码数据中遴选出第一个遴选组合,步骤如下:S12: Selecting a first selection combination from the mapped coded data according to a preset selection step, the steps are as follows:S121:首先指定截取长度为2,按照从左到右的顺序从映射编码数据中截取出前两位字符即第一、二位字符作为待前序字串A1,然后继续向右截取两位字符即第三、四位字符作为待后序字串A2;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:利用公式B1=PA1+PA2计算获取待前后序字串的遴选值B1,其中,PA1为待前序字串A1转换为十进制数的数值,PA2为待后序字串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:将B1和P1进行大小比较,P1为预设第一遴选阈值:S123: Compare B1 and P1, where P1 is the preset first selection threshold:若B1≥P1,则按照预设终遴选规则遴选从映射编码数据中遴选出第一个遴选组合,预设遴选规则如下;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:更新截取长度为3,按照从左到右的顺序从映射编码数据中截取出前三位字符即第一、二、三位字符作为待前序字串C1,然后继续向右截取三位字符即第四、五、六位字符作为待后序字串C2;SS1: Update the interception length to 3, intercept the first three characters, i.e., the first, second, and third characters, from the mapping code data in order from left to right as the pre-order string C1, and then continue to intercept three characters, i.e., the fourth, fifth, and sixth characters, to the right as the post-order string C2;SS2:按照S122相同步骤,计算此时待前后序字串的遴选值B2;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;SS3:将B2和P2进行大小比较,P2为预设第二遴选阈值:SS3: Compare B2 and P2, where P2 is the preset second selection threshold:SS31:若B2≥P2,更新截取长度为4,按照从左到右的顺序从映射编码数据中截取出前四位字符即第一、二、三、四位字符作为待前序字串D1,然后继续向右截取四位字符即第五、六、七、八位字符作为待后序字串D2,并自动确定待前序字串D1和待后序字串D2为一个遴选组合中的前序字串和后序字串;SS31: If B2≥P2, update the interception length to 4, intercept the first four characters, i.e., the first, second, third, and fourth characters, from the mapped coded data in order from left to right as the to-be-prefixed string D1, and then continue to intercept four characters, i.e., the fifth, sixth, seventh, and eighth characters, to the right as the to-be-postfixed string D2, and automatically determine the to-be-prefixed string D1 and the to-be-postfixed string D2 as the to-be-prefixed string and the to-be-postfixed string in a selection combination;SS32:若B2<P2,则分别确定待前序字串C1和待后序字串C2为一个遴选组合中的前序字串和后序字串;SS32: If B2<P2, then determine the to-be-prefixed-order string C1 and the to-be-postfixed-order string C2 as the to-be-prefixed-order string and the postfixed-order string in a selection combination respectively;若B1<P1,则分别确定待前序字串A1和待后序字串A2为一个遴选组合中的前序字串和后序字串;If B1<P1, then the to-be-prefixed-order string A1 and the to-be-postfixed-order string A2 are respectively determined to be the to-be-prefixed-order string and the postfixed-order string in a selection combination;S13:按照S12按照从左到右的顺序从映射编码数据中依次遴选出第一、二、...、d个遴选组合,其中每个遴选组合都是基于上一个遴选组合截取后剩余的映射编码数据。S13: According to S12, first, second, ..., d selection combinations are selected from the mapping coded data in order from left to right, wherein each selection combination is based on the mapping coded data remaining after the previous selection combination is cut off.4.根据权利要求3所述的工业园区污水近零排放的水资源优化配置系统,其特征在于,确定每个遴选组合的遴选对象和映射对象的步骤如下: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 of determining the selection object and mapping object of each selection combination are as follows:S14:获取当前配置映射模块中存储的第一、二和三梯度列表,对应标记为E1、E2和E3;S14: Obtain the first, second and third gradient lists stored in the current configuration mapping module, marked as E1, E2 and E3 respectively;S15:按照每个遴选组合遴选出的先后顺序,将从映射编码数据中遴选出的d个遴选组合依次标记为D1、D2、...、Dd;S15: according to the order in which each selection combination is selected, mark the d selection combinations selected from the mapping coded data as D1, D2, ..., Dd in sequence;S16:对遴选组合D1中前序字串的位数进行判定,并根据判定结果得到遴选组合D1前序字串、后序字串的映射字串,同时对遴选组合D1的前序字串和后序字串进行更新;S16: determining the number of digits of the pre-order string in the selection combination D1, and obtaining mapping strings of the pre-order string and the post-order string of the selection combination D1 according to the determination result, and updating the pre-order string and the post-order string of the selection combination D1 at the same time;S161:若遴选组合D1中前序字串的位数为2,则按照预设第一生成规则生成遴选组合D1中前序字串和后序字串的映射字串,同时对遴选组合D1中前序字串和后序字串进行更新;S161: if the number of digits of the pre-order string in the selection combination D1 is 2, generating a mapping string of the pre-order string and the post-order string in the selection combination D1 according to a preset first generation rule, and updating the pre-order string and the post-order string in the selection combination D1;S162:若遴选组合D1中前序字串的位数为3,则按照预设第二生成规则生成遴选组合D1中前序字串和后序字串的映射字串,同时对遴选组合D1中前序字串和后序字串进行更新;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 a 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;若遴选组合D1中前序字串的位数为4,则按照预设第三生成规则生成遴选组合D1中前序字串和后序字串的映射字串,同时对遴选组合D1中前序字串和后序字串进行更新;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;S163:若遴选组合D1中前序字串的位数为4,则按照预设第三生成规则生成遴选组合D1中前序字串和后序字串的映射字串,同时对遴选组合D1中前序字串和后序字串进行更新;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 a 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;S17:按照前序字串、后序字串的先后顺序,将更新后遴选组合D1的前序字串和后序字串进行拼接得到遴选组合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;然后依次将遴选组合D1前序字串和后序字串的映射字串转换为8位二进制数,并对转换后的8位二进制数按照其转换的先后顺序进行拼接得到遴选组合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 in the order of their conversion to obtain the mapping object of the selection combination D1;S18:按照S16到S17,依次得到遴选组合D1、D2、...、Dd的遴选对象和映射对象。S18: According to S16 to S17, the selection objects and mapping objects of the selection combinations D1, D2, ..., Dd are obtained in turn.5.根据权利要求4所述的工业园区污水近零排放的水资源优化配置系统,其特征在于,所述S161中,预设第一生成规则如下:5. The water resource optimization configuration system for near-zero discharge of sewage in industrial parks according to claim 4, characterized in that in said S161, the first generation rule is preset as follows:S21:按照从左到右的顺序,首先对遴选组合D1中前序字串内的第一个字符F1进行是否为“0”判定,若字符F1为0,则将二进制数“10”作为遴选组合D1中前序字串的映射字串,然后将遴选组合D1中前序字串内的字符F1删除,将删除后的字串更新为遴选组合D1的前序字串;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 in 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;反之则将二进制数“11”作为遴选组合D1中前序字串的映射字串,然后将遴选组合D1中前序字串内的字符F1删除,将删除后的字串更新为遴选组合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 deleted string is updated as the preceding string of the selection combination D1;S22:然后对遴选组合D1中后序字串内的第一个字符F2进行是否为“0”判定,若字符F2为0,则将二进制数“10”作为遴选组合D1中后序字串的映射字串,然后将遴选组合D1中后序字串内的字符F2删除,将删除后后序字串中剩余内容更新为遴选组合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;反之则将二进制数“11”作为遴选组合D1中后序字串的映射字串,然后将遴选组合D1中后序字串内的字符F2删除,将删除后后序字串中剩余内容更新为遴选组合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.工业园区污水近零排放的水资源优化配置方法,采用权利要求1知5任一所述的工业园区污水近零排放的水资源优化配置系统,其特征在于,包括以下步骤:6. A method for optimizing water resource allocation for near-zero discharge of sewage in industrial parks, using a system for optimizing water resource allocation for near-zero discharge of sewage in industrial parks as claimed in any one of claims 1 to 5, characterized in that it comprises the following steps:步骤一:信息采集模块获取工业园区的优化配置数据,优化配置数据中包含工业园区内各工业企业的最优废水排放和回收利用策略;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;步骤二:将由管理人员预设定的16个二进制数,按照每个二进制数的位数:2位、3位、4位进行分类,并将这16个二进制数按照分类结果相应的添加到第一、二和三梯度列表中;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.
CN202411088322.6A2024-08-092024-08-09 Water resource optimization configuration system and method for near-zero sewage discharge in industrial parksActiveCN118643518B (en)

Priority Applications (1)

Application NumberPriority DateFiling DateTitle
CN202411088322.6ACN118643518B (en)2024-08-092024-08-09 Water resource optimization configuration system and method for near-zero sewage discharge in industrial parks

Applications Claiming Priority (1)

Application NumberPriority DateFiling DateTitle
CN202411088322.6ACN118643518B (en)2024-08-092024-08-09 Water resource optimization configuration system and method for near-zero sewage discharge in industrial parks

Publications (2)

Publication NumberPublication Date
CN118643518A CN118643518A (en)2024-09-13
CN118643518Btrue CN118643518B (en)2024-11-08

Family

ID=92669721

Family Applications (1)

Application NumberTitlePriority DateFiling Date
CN202411088322.6AActiveCN118643518B (en)2024-08-092024-08-09 Water resource optimization configuration system and method for near-zero sewage discharge in industrial parks

Country Status (1)

CountryLink
CN (1)CN118643518B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN119254545B (en)*2024-12-062025-02-25山西能源学院 Security encryption control system based on coal mine equipment operation data

Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN115062297A (en)*2016-01-242022-09-16赛义德·卡姆兰·哈桑Computer security based on artificial intelligence
CN115495439A (en)*2022-09-272022-12-20北京柏睿数据技术股份有限公司Embedding method and tracing method and device of database watermark and electronic equipment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
US11716192B2 (en)*2020-08-242023-08-01Gideon SamidReplica: an improved communication concealment cipher
CN115865523B (en)*2023-02-142023-04-28杭银消费金融股份有限公司Data encryption transmission method for information analysis system
CN118316967B (en)*2024-06-052024-09-10苏州悦涵环保科技有限公司Water quality on-line monitoring system for environment monitoring

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication numberPriority datePublication dateAssigneeTitle
CN115062297A (en)*2016-01-242022-09-16赛义德·卡姆兰·哈桑Computer security based on artificial intelligence
CN115495439A (en)*2022-09-272022-12-20北京柏睿数据技术股份有限公司Embedding method and tracing method and device of database watermark and electronic equipment

Also Published As

Publication numberPublication date
CN118643518A (en)2024-09-13

Similar Documents

PublicationPublication DateTitle
CN118643518B (en) Water resource optimization configuration system and method for near-zero sewage discharge in industrial parks
CN112035841B (en)Intelligent contract vulnerability detection method based on expert rules and serialization modeling
CN115841094A (en)Encoding method, device, equipment, medium and product
CN118246075B (en)Monitoring data management system and method for water treatment device
CN110071871A (en)A kind of large model pool ip address matching process
CN107239467A (en)Data processing method and device based on database
CN115935372A (en) A Vulnerability Detection Method Based on Graph Embedding and Bidirectional Gated Graph Neural Network
CN118199922A (en)Malicious mining domain name detection method based on deep learning
CN119646773B (en)Transparent vector-prioritized vector database watermarking method
CN114860973B (en) A deep image retrieval method for small sample scenes
CN118939651B (en)Method for updating threat data resource catalog and management system
CN111447188B (en) Vectorless text steganography method based on language steganography feature space
CN116501897B (en)Method for constructing knowledge graph based on fuzzy matching
Zhang et al.Coverless text steganography method based on characteristics of word association
CN111199259B (en)Identification conversion method, device and computer readable storage medium
CN117195237A (en) A vulnerability detection system and method for smart contracts
CN112287671B (en) Address resolution method and system based on simhash
CN109829563B (en) A method for evaluating the limit capacity of feeder transmission based on multi-parameter programming
CN114090522B (en)Electronic file identifier definition method, device and equipment
CN115913792B (en) DGA domain name identification method, system and readable medium
CN112417179A (en)Address processing method and device
CN111901125B (en)Method and device for ensuring consistency of homeland space data by applying block chain
CN115801736B (en)IP address library construction loading method and device and IP address query method and device
CN117252160B (en)Document editing method, device, equipment and medium
CN113254975B (en)Digital financial data sharing method

Legal Events

DateCodeTitleDescription
PB01Publication
PB01Publication
SE01Entry into force of request for substantive examination
SE01Entry into force of request for substantive examination
GR01Patent grant
GR01Patent grant

[8]ページ先頭

©2009-2025 Movatter.jp