Transparent management method and system for simulation operation compensation information of new energy power plant

Abstract

The invention provides a new energy power plant simulation operation compensation information transparent management method and system, and relates to the technical field of new energy power management, and the method comprises the steps: constructing a scatter set for the actual and theoretical power generation curves of a new energy power plant in a two-dimensional phase space, forming a closed boundary, extracting vertex coordinates, and calculating a topology deviation amount to determine a compensation amount; fourier transform is carried out on the vertex coordinates to generate a phase angle sequence, phase angle segments are divided based on a topological form, and a hierarchical key is generated in combination with a local deviation amount; performing partition encryption on the compensation amount binary data to form a layered information packet; and returning corresponding information according to the query identity level. Transparent management of compensation information is realized, the right to know of each party is guaranteed, and the data security is improved.

Description

Technical Field

[0001] This invention relates to the field of new energy power management technology, and in particular to a method and system for transparent management of compensation information during simulated operation of new energy power plants. Background Technology

[0002] As the global energy transition deepens, the proportion of renewable energy generation in the power system continues to increase. Due to the volatility and intermittency of renewable energy generation, to ensure the safe and stable operation of the power grid, grid dispatching departments typically regulate the power output of renewable energy plants according to system demand, causing their output to deviate from their theoretical maximum capacity. To compensate for the economic losses of renewable energy plants, a reasonable simulated operation compensation mechanism needs to be established to ensure the fairness and transparency of the compensation process.

[0003] Traditional compensation management for simulated operation of new energy power plants has significant shortcomings. Existing compensation calculation methods are mostly based on simple power difference integration, failing to fully consider the topological characteristics of the power generation curve in two-dimensional phase space. This results in insufficient accuracy in compensation calculations and an inability to accurately reflect the difference between actual and theoretical power generation states. Compensation information management lacks an effective hierarchical encryption mechanism. Compensation data is either overly disclosed, leading to the leakage of commercial information, or overly confidential, preventing relevant parties from effectively supervising the process, resulting in insufficient transparency. The storage and retrieval methods for compensation information are relatively simple, making it difficult to provide differentiated information access services based on different user permission levels. This affects the credibility of the compensation process and the acceptance of compensation results by all parties. Summary of the Invention

[0004] This invention provides a method and system for transparent management of compensation information in simulated operation of new energy power plants, which can solve the problems in the prior art.

[0005] A first aspect of this invention provides a method for transparent management of compensation information during simulated operation of new energy power plants, comprising: Obtain the actual and theoretical power generation curves of new energy power plants during the dispatch period; Construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The phase angle is extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The compensation amount is converted into binary data, and the binary data is assigned to each topological partition based on the geometric center coordinates of the topological partition. The binary data of each topological partition is encrypted using a hierarchical encryption key set and encapsulated into a hierarchical information packet. The topology partition level is determined based on the query identity, and the content of the corresponding level is decrypted from the hierarchical information packet and returned.

[0006] In one optional embodiment, a scatter set is constructed in two-dimensional phase space by comparing the actual power generation curve power with the theoretical power generation curve power. Boundary points are iteratively selected to form a closed boundary, and the vertex coordinate sequence is extracted. The topological deviation between the closed boundary area and the reference area is calculated, and the compensation amount is calculated based on the positive or negative sign of the topological deviation, including: The actual power generation curve and the theoretical power generation curve are sampled at time intervals to obtain the actual power sampling sequence and the theoretical power sampling sequence. The actual power sampling sequence is used as the abscissa and the theoretical power sampling sequence is used as the ordinate to generate coordinate points in the two-dimensional phase space to form a scatter set. Iteratively select boundary points from the scattered point set and connect them to form a closed boundary. Extract the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arrange them in order to form a vertex coordinate sequence. The length of each boundary segment is calculated based on the coordinate difference between adjacent vertices in the vertex coordinate sequence. The area of ​​the convex polygon with closed boundary is obtained by summing the lengths of each boundary segment and the corresponding vertex coordinates using the polygon area formula. Determine the diagonal between the origin and the maximum power point in the scatter plot in the two-dimensional phase space, and calculate the area of ​​the right triangle formed by the diagonal, the horizontal axis, and the vertical axis as the reference area. The topological deviation is obtained by subtracting the reference area from the area of ​​the convex polygon. The compensation amount is obtained by multiplying the topological deviation by the positive or negative compensation coefficient, depending on the sign of the topological deviation.

[0007] In one optional embodiment, iteratively selecting boundary points from the scatter set and connecting them to form a closed boundary, and extracting the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arranging them in sequence to form a vertex coordinate sequence includes: Calculate the Euclidean distance from each coordinate point in the scatter set to the origin of the two-dimensional phase space, and select the coordinate point with the largest Euclidean distance as the initial boundary point; Starting from the initial boundary point, calculate the connection vector formed by the initial boundary point and the remaining coordinate points in the scatter set. Calculate the angle between each connection vector and the positive direction of the horizontal axis of the two-dimensional phase space. Select the coordinate point with the smallest angle value from all angles as the first subsequent boundary point. Connect the initial boundary point and the first subsequent boundary point as the first boundary line segment. Taking the first subsequent boundary point as the new starting point, calculate the connection vector formed by the first subsequent boundary point and the remaining unvisited coordinate points in the scatter set. Calculate the angle between each connection vector and the extension direction of the first boundary line segment. Select the coordinate point with the smallest angle value from all angles as the second subsequent boundary point. Connect the first subsequent boundary point and the second subsequent boundary point as the second boundary line segment. The process is repeated iteratively until the next boundary point returns to the initial boundary point to form a closed boundary. All boundary points on the closed boundary are extracted in the order of connection to form a vertex coordinate sequence.

[0008] In one optional embodiment, the phase angles are extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviations of the topological partitions, and a hash operation is performed to generate a hierarchical encryption key set, including: Perform discrete Fourier transforms on the x-coordinate and y-coordinate components of the vertex coordinate sequence to obtain the x-coordinate frequency domain coefficient sequence and the y-coordinate frequency domain coefficient sequence, respectively. Calculate the amplitude of each frequency component in the frequency domain coefficient sequence of the horizontal axis and the frequency domain coefficient sequence of the vertical axis, select the frequency components whose amplitude exceeds the preset amplitude threshold as the target frequency component set, extract the phase angle corresponding to each frequency component in the target frequency component set, and form the initial phase angle sequence. Based on the closed boundary topology, the initial phase angle sequence is divided into multiple phase angle segments. For each phase angle segment, the phase angle value within the phase angle segment is numerically fused with the local deviation of the corresponding topology partition to obtain the characteristic phase angle sequence of the topology partition. A hash operation is then performed on the characteristic phase angle sequence to generate the partition key of the topology partition. The partition keys of all topological partitions are arranged according to the spatial order of the topological partitions within the closed boundary to form a hierarchical encryption key set as the encryption key.

[0009] In one optional embodiment, dividing the initial phase angle sequence into multiple phase angle segments based on the topological morphology of the closed boundary includes: The closed boundary is divided into multiple boundary segments along the perimeter direction according to the vertex number sequence, and the local deviation between the boundary segment and the reference area is calculated for each boundary segment. Set a set of deviation level thresholds, compare all boundary segments with each threshold in the set of deviation level thresholds according to the absolute value of the local deviation, and merge continuous boundary segments with the absolute value of the local deviation in the same threshold range into a topological partition. The total number of topological partitions obtained by merging boundary segments of the closed boundary is counted, and the total number of phase angles in the initial phase angle sequence is obtained. Calculate the ratio of the total number of phase angles in the initial phase angle sequence to the total number of topology partitions, and round the ratio up to obtain the phase angle quota for each topology partition; According to the spatial order of the topological partitions in the closed boundary, starting from the beginning of the initial phase angle sequence, phase angles are extracted sequentially according to the phase angle quota to form a phase angle segment. The phase angle segment is then associated with the corresponding topological partition until all phase angles in the initial phase angle sequence have been divided into phase angle segments.

[0010] In one optional embodiment, the compensation amount is converted into binary data, the binary data is assigned to each topological partition based on the geometric center coordinates of the topological partition, and the binary data of each topological partition is encrypted using a hierarchical encryption key set to encapsulate it into a hierarchical information packet, including: The compensation amount is quantized and encoded into binary data according to a preset precision. The geometric center coordinates of each topological partition in the closed boundary in the two-dimensional phase space are obtained. The total number of bits in the binary data and the total number of topological partitions are moduloed. Based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data, and a spatial mapping table from bits to topological partitions is constructed. Iterate through each bit of the binary data, look up the corresponding topology partition identifier from the spatial mapping table according to the index position of the bit, and assign the bit to the corresponding topology partition to form multiple bit sets, each bit set corresponding to a topology partition; For each topology partition's bit set, the partition key for the corresponding topology partition is obtained from the hierarchical encryption key set. The partition key is then used as the encryption key to perform an XOR operation on the binary data within the bit set to obtain the encrypted data block corresponding to the topology partition. All encrypted data blocks of the topology partitions are bound to the geometric center coordinates of the corresponding topology partitions. The binding results are arranged according to the spatial order of the topology partitions within the closed boundary and encapsulated to form a hierarchical information package containing spatial location information.

[0011] In one optional embodiment, based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data, and a spatial mapping table from bit to topological partition is constructed, including: Perform a modulo operation between the total number of bits in the binary data and the total number of topological partitions to obtain the modulo remainder, and then determine whether the modulo remainder is zero. When the remainder after modulo operation is zero, a one-to-one mapping relationship is established between the bit index of the binary data and the spatial order of the topological partition in an ascending order. When the remainder after modulo operation is not zero, the x-coordinate and y-coordinate values ​​of the geometric center coordinates of each topological partition are concatenated as input, and a hash operation is performed to generate a hash value sequence of the topological partitions. The hash value sequence is sorted according to the numerical value to obtain the arrangement order of the topological partitions. The bit indexes of binary data are mapped to the topological partitions according to their sorting order, thus constructing a spatial mapping table from bits to topological partitions.

[0012] A second aspect of this invention provides a transparent management system for compensation information during simulated operation of new energy power plants, comprising: The data acquisition unit is used to acquire the actual power generation curve and theoretical power generation curve of new energy power plants during the dispatch period; The deviation calculation unit is used to construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The key generation unit is used to extract the phase angle by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The hierarchical encryption unit is used to convert the compensation amount into binary data, assign the binary data to each topological partition based on the geometric center coordinates of the topological partition, and perform encryption operations on the binary data of each topological partition using the hierarchical encryption key set, and encapsulate it into a hierarchical information packet. The hierarchical decryption unit is used to determine the topology partition level based on the query identity, decrypt the hierarchical information packet, and return the content of the corresponding level.

[0013] A third aspect of the present invention provides an electronic device, comprising: processor; Memory used to store processor-executable instructions; The processor is configured to invoke instructions stored in the memory to execute the aforementioned method.

[0014] A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, implement the aforementioned method.

[0015] In this embodiment of the invention, by constructing a scatter set of actual power generation curves and theoretical power generation curves in a two-dimensional phase space and extracting closed boundaries, the deviation of power generation curves is visualized and quantified, making the calculation of compensation amount more objective and scientific, and avoiding the errors that may be caused by simply comparing power differences in traditional methods. Based on the topological morphology of closed boundaries, a new hierarchical encryption key generation mechanism is constructed by extracting phase angle sequences and performing segmentation processing. This mechanism is closely related to the characteristics of the power generation data itself, enhancing data security, while ensuring the correlation between encryption strength and the actual situation of power production. The geometric center coordinates of the topological partition are used to classify the binary compensation data, and the hierarchical encryption key set is combined to realize the hierarchical encapsulation of compensation information. This ensures that users with different permissions can only obtain information content of the corresponding level, which not only ensures the transparency and openness of compensation information, but also effectively prevents the leakage of sensitive data. Attached Figure Description

[0016] Figure 1 This is a flowchart illustrating the transparent management method for compensation information during simulated operation of new energy power plants, as described in an embodiment of the present invention. Figure 2 This is a flowchart of the topology encryption process. Detailed Implementation

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

[0018] The technical solution of the present invention will be described in detail below with reference to specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments.

[0019] Figure 1 This is a flowchart illustrating the transparent management method for compensation information during simulated operation of new energy power plants, as described in this embodiment of the invention. Figure 1 As shown, the method includes: Obtain the actual and theoretical power generation curves of new energy power plants during the dispatch period; Construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The phase angle is extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The compensation amount is converted into binary data, and the binary data is assigned to each topological partition based on the geometric center coordinates of the topological partition. The binary data of each topological partition is encrypted using a hierarchical encryption key set and encapsulated into a hierarchical information packet. The topology partition level is determined based on the query identity, and the content of the corresponding level is decrypted from the hierarchical information packet and returned.

[0020] In one optional implementation, the new energy power plant collects power generation data at fixed time intervals during the dispatch period. The time interval is set to 5 minutes, and the dispatch period is set to 24 hours, totaling 288 power sampling points. The actual power generation curve records the real output power of the wind turbine generator or photovoltaic array, while the theoretical power generation curve is calculated based on meteorological forecast data, equipment rated capacity, and historical power generation efficiency. Taking a wind farm as an example, during the dispatch period from 0:00 to 24:00 on a certain day, the actual power generation curve at 8:30 has a power sampling value of 12.3 MW, while the corresponding theoretical power generation curve has a predicted power value of 15.7 MW. Using the actual power values ​​at the 288 moments as the horizontal axis and the corresponding theoretical power values ​​as the vertical axis, 288 scatter points are formed in a two-dimensional phase space. The coordinate format of the scatter points is a numerical pair of actual power values ​​and theoretical power values.

[0021] In a two-dimensional phase space, the outermost boundary points of a scatter plot need to be identified. For example, boundary point identification uses an iterative implementation of the convex hull algorithm. Initially, the scatter point with the smallest x-coordinate is selected as the starting boundary point. The polar angle of the line connecting the starting boundary point to all other scatter points is calculated. The polar angle is defined as the angle between the connecting line and the positive horizontal direction, ranging from 0 to 360 degrees. The scatter point with the smallest polar angle is selected as the next boundary point, and the previous boundary point is updated to the current boundary point. This polar angle calculation and boundary point selection operation is repeated until a newly selected boundary point returns to the starting boundary point, forming a closed path. Assuming a total of 36 boundary points are identified, their coordinate values ​​in the two-dimensional phase space are extracted and arranged according to the order in which they were identified, forming a vertex coordinate sequence. The first element of the vertex coordinate sequence corresponds to the starting boundary point, with coordinates of (2.1 MW, 3.5 MW), the second element has coordinates of (3.8 MW, 6.2 MW), and so on.

[0022] The closed boundary area is obtained by summing the triangles formed by adjacent vertices and the origin in the vertex coordinate sequence. The calculation involves multiplying the x-coordinate of the i-th vertex by the y-coordinate of the (i+1)-th vertex, subtracting the product of the y-coordinate and x-coordinate of the i-th vertex, and summing the results for all vertices in sequence. The absolute value of this sum is divided by 2 to obtain the closed boundary area. The reference area is defined as the area enclosed by the theoretical power generation curve and the horizontal axis. It is calculated by multiplying the power value of the theoretical power generation curve in each time interval by the width of the time interval and then summing the results. The topology deviation equals the closed boundary area minus the reference area. A positive topology deviation indicates that the actual power generation exceeds the theoretical prediction, while a negative topology deviation indicates that the actual power generation is lower than the theoretical prediction. For this wind farm, the calculated closed boundary area is 328.6 square megawatt-hours, the reference area is 315.2 square megawatt-hours, and the topology deviation is 13.4 square megawatt-hours. The compensation amount is calculated by multiplying the topology deviation by the unit electricity price, which is set at 450 yuan per megawatt-hour. A positive topology deviation indicates that the power plant receives a reward, while a negative topology deviation indicates that the power plant has to pay compensation. The calculated compensation amount for this wind farm is 6030 yuan.

[0023] Frequency domain features are extracted by performing a Discrete Fourier Transform (DFT) on the vertex coordinate sequence. The x and y coordinate values ​​in the vertex coordinate sequence are treated as the real and imaginary parts of complex numbers, respectively, constructing 36 complex values. A DFT is performed on the complex number sequence to obtain 36 frequency domain complex values, each containing two attributes: amplitude and phase angle. The phase angle of these 36 frequency domain complex values ​​is extracted. The phase angle is calculated by dividing the imaginary part of the frequency domain complex value by its real part and then taking the arctangent function, with a value range of -180 degrees to 180 degrees. The 36 phase angles are arranged in frequency domain index order to form an initial phase angle sequence. The first element of the initial phase angle sequence is 23.7 degrees, the second element is -67.4 degrees, and the third element is 102.8 degrees.

[0024] The topological morphology of a closed boundary is analyzed by identifying inflection points through changes in the curvature of the lines connecting the boundary points. The curvature of a polygonal line segment formed by three adjacent boundary points is equal to the change angle of the tangent direction at the middle boundary point divided by the average length of the two boundary line segments. All boundary points in the vertex coordinate sequence are traversed, and the curvature value at each boundary point is calculated. Boundary points whose absolute curvature value exceeds a preset threshold of 0.15 radians per megawatt-hour are identified as inflection points. Assuming six inflection points are identified, these inflection points divide the closed boundary into six topological partitions, which are connected by these inflection points. The initial 36 phase angles of the phase angle sequence are evenly divided according to the number of topological partitions (6). The first six phase angles belong to the first phase angle segment, the 7th to 12th phase angles belong to the second phase angle segment, and so on, forming six phase angle segments.

[0025] The local deviation of a topology partition is obtained by calculating the average vertical distance between the scattered points within the partition and the theoretical curve. All scattered points within the partition are traversed, and the difference between the theoretical power value at the corresponding time point and the ordinate value is calculated. The absolute value of this difference is the vertical distance. The sum of all vertical distances is divided by the number of scattered points to obtain the local deviation of the partition. The first partition contains 8 scattered points, with a calculated local deviation of 2.7 MW. The second partition contains 5 scattered points, with a local deviation of 1.9 MW. The phase angle values ​​within each phase angle segment are averaged. The average value for the first phase angle segment is -12.5 degrees. This value is then fused with the local deviation of 2.7 MW for the first partition. The fusion method involves dividing the average phase angle by 10 and adding it to the local deviation, resulting in a fused value of 1.45 MW. The six fusion results are concatenated into a string containing "1.45, 3.21, -0.87, 2.66, 1.03, -1.52". A hash operation is performed on this string to generate a 256-bit hash value. The hash value is then segmented according to the number of topological partitions (6). The first 42 bits are used as the partition key for the first topological partition, bits 43 to 84 are used as the partition key for the second topological partition, and so on, forming a hierarchical encryption key set consisting of six partition keys.

[0026] The compensation amount of 6030 yuan is quantized and encoded with a preset precision of 0.01 yuan, resulting in a value of 603000 points. This is converted to binary data, yielding a 20-bit binary sequence "10010011011001110000". The geometric center coordinates of the six topological partitions are calculated. The geometric center coordinates of a topological partition are equal to the average of the x-coordinates and y-coordinates of all boundary points within the partition. The geometric center coordinates of the first topological partition are (6.8 MW, 9.3 MW). A modulo operation is performed between the total number of bits (20) and the total number of topological partitions (6), resulting in a remainder of 2. If the remainder is not zero, the x-coordinates and y-coordinates of the geometric center coordinates of the six topological partitions are concatenated and converted into a string. The string for the first topological partition is "6.8, 9.3". A hash operation is then performed on this string to generate numerical identifiers. The numerical identifiers for the six topological partitions are 47592, 23871, 65308, 12456, 89021, and 34729, respectively. Sort the data by numerical identifiers from smallest to largest, resulting in the topological partitions in the order of partition 4, partition 2, partition 6, partition 1, partition 3, and partition 5. Assign the 20 bits of the binary data to the topological partitions in this order: the first bit to partition 4, the second bit to partition 2, the third bit to partition 6, and the seventh bit back to partition 4, forming a set of 6 bits.

[0027] The partition key for each topology partition is obtained from the hierarchical encryption key set; the partition key for partition 4 is 42 bits. The bit set for partition 4 contains 4 bits. The first 4 bits of the partition key are XORed with the binary data in the bit set, resulting in the encrypted data block for partition 4 being "1101". The encrypted data blocks of the six topology partitions are then bound to the corresponding geometric center coordinates of each partition. The binding result for partition 4 is the combination of the encrypted data block "1101" and the geometric center coordinates (5.2 MW, 7.6 MW). The Euclidean distance from the geometric center coordinates of the six topology partitions to the origin of the two-dimensional phase space is calculated. The Euclidean distance is equal to the square root of the sum of the squares of the x-coordinate and y-coordinate values. The Euclidean distance for partition 4 is 9.24 MW. The binding results of the six topological partitions are arranged in ascending order of Euclidean distance. The total number of topological partitions (6) and the index information of the geometric center coordinates of each topological partition are added to the beginning of the sorted sequence. This is then encapsulated into a hierarchical information package. The data structure of the hierarchical information package is "number of partitions|coordinate index|partition 1 data|partition 2 data|...|partition 6 data".

[0028] The identity verification process uses a digital certificate carried in the query request. This digital certificate contains the queryer's permission level identifier. A correspondence is established between the permission level identifier and the topology partition level: Level 1 permission allows access to the content of topology partitions 1-2, Level 2 permission allows access to the content of topology partitions 1-4, and Level 3 permission allows access to all six topology partitions. If the topology partition level determined based on the query identity is Level 2, encrypted data blocks of topology partitions 1-4 are extracted from the hierarchical information packet. The corresponding partition key is obtained from the hierarchical encryption key set, and an XOR operation is performed to decrypt the encrypted data block. The decrypted bits are concatenated according to their original order of origin, converted to decimal values, and divided by a quantization precision of 100 to obtain a partial compensation amount. The partial compensation amount and the geometric center coordinates of the corresponding topology partition are returned to the queryer.

[0029] In one optional implementation, a scatter set is constructed in two-dimensional phase space by comparing the actual power generation curve power with the theoretical power generation curve power. Boundary points are iteratively selected to form a closed boundary, and the vertex coordinate sequence is extracted. The topological deviation between the closed boundary area and the reference area is calculated, and the compensation amount is calculated based on the positive or negative sign of the topological deviation, including: The actual power generation curve and the theoretical power generation curve are sampled at time intervals to obtain the actual power sampling sequence and the theoretical power sampling sequence. The actual power sampling sequence is used as the abscissa and the theoretical power sampling sequence is used as the ordinate to generate coordinate points in the two-dimensional phase space to form a scatter set. Iteratively select boundary points from the scattered point set and connect them to form a closed boundary. Extract the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arrange them in order to form a vertex coordinate sequence. The length of each boundary segment is calculated based on the coordinate difference between adjacent vertices in the vertex coordinate sequence. The area of ​​the convex polygon with closed boundary is obtained by summing the lengths of each boundary segment and the corresponding vertex coordinates using the polygon area formula. Determine the diagonal between the origin and the maximum power point in the scatter plot in the two-dimensional phase space, and calculate the area of ​​the right triangle formed by the diagonal, the horizontal axis, and the vertical axis as the reference area. The topological deviation is obtained by subtracting the reference area from the area of ​​the convex polygon. The compensation amount is obtained by multiplying the topological deviation by the positive or negative compensation coefficient, depending on the sign of the topological deviation.

[0030] In one specific implementation, the actual power generation curve and the theoretical power generation curve are sampled. The actual power generation curve and the theoretical power generation curve are sampled at fixed time intervals (e.g., 15 minutes) to obtain the actual power sampling sequence P_real={p_real_1, p_real_2, ..., p_real_n} and the theoretical power sampling sequence P_theo={p_theo_1, p_theo_2, ..., p_theo_n}, where n is the number of sampling points. For example, for 24 hours of operation data of a wind farm, sampling at 15-minute intervals yields 96 sampling points.

[0031] A scatter set is constructed in a two-dimensional phase space, with the actual power sampling sequence P_real as the x-axis and the theoretical power sampling sequence P_theo as the y-axis, forming n coordinate points {(p_real_1, p_theo_1), (p_real_2, p_theo_2), ..., (p_real_n, p_theo_n)}. These points together constitute the scatter set S. This mapping method can intuitively reflect the correlation between actual power and theoretical power.

[0032] The process involves iteratively selecting boundary points from a scatter set to form a closed boundary. Boundary points located on the periphery are selected from the scatter set S, and the point with the lowest y-coordinate in the scatter set is chosen as the starting point. Other points are then selected according to their polar angles, and this process iteratively constructs the convex hull. In this way, a series of boundary points are obtained, which are connected in a specific order to form a closed convex polygon boundary B.

[0033] Extract the vertex coordinate sequence V={(v_x_1, v_y_1), (v_x_2, v_y_2), ..., (v_x_m, v_y_m)} on the closed boundary B, where m is the number of vertices on the boundary, m≤n. The vertices are arranged in a clockwise or counterclockwise direction to ensure the integrity of the polygon boundary.

[0034] Based on the vertex coordinate sequence V, the area A_poly of a convex polygon with a closed boundary is calculated. The calculation method adopts the polygon area formula, and the area contribution is calculated by sequentially processing each pair of adjacent vertices. The specific calculation process is as follows: For each pair of adjacent vertices (v_x_i, v_y_i) and (v_x_i+1, v_y_i+1) (when i=m, the next vertex is i=1), calculate the area of ​​the triangle formed by these two points and the origin, and sum the areas of all triangles. Using the coordinate cross product method, A_poly is equal to the absolute value of half of the sum of the cross products of the coordinates of all vertices.

[0035] Determine the reference area A_base. In the two-dimensional phase space, find the maximum power point P_max = (p_real_max, p_theo_max) in the scatter set S, where p_real_max and p_theo_max are the maximum values ​​of the actual power and theoretical power, respectively. Determine a diagonal line using the origin (0, 0) and the maximum power point P_max. This diagonal line, together with the horizontal and vertical axes, forms a right triangle. The area of ​​this triangle, A_base = p_real_max × p_theo_max ÷ 2, serves as the reference area. This reference area represents the power distribution under ideal conditions.

[0036] The topology deviation ΔA = A_poly - A_base is calculated, reflecting the overall degree of deviation between the actual power generation curve and the theoretical power generation curve. When ΔA > 0, it indicates that the actual power generation exceeds the theoretical expectation; when ΔA < 0, it indicates that the actual power generation is lower than the theoretical expectation.

[0037] The compensation amount M is calculated based on the sign of the topology deviation ΔA. When ΔA > 0, it indicates that the generator has over-generated electricity and should receive positive compensation; the calculation is M = ΔA × k_pos, where k_pos is the positive compensation coefficient. When ΔA < 0, it indicates that the generator has under-generated electricity and should pay negative compensation; the calculation is M = ΔA × k_neg, where k_neg is the negative compensation coefficient. The value of the compensation coefficient can be determined according to electricity market rules and electricity pricing policies.

[0038] In a practical application, the daily power generation data of a photovoltaic power station was analyzed. Sampling was conducted at 10-minute intervals, obtaining 144 sampling points each for actual and theoretical power. Using this method, a scatter plot was constructed, and the closed boundary was extracted. The area of ​​the convex polygon, A_poly, was calculated to be 15628 kW. 2 The base area A_base = 15000kW 2 Topological deviation ΔA = 628kW 2Since ΔA>0, it indicates that the actual power generation of the power plant is higher than the theoretical expectation. According to the positive compensation coefficient k_pos=0.1 yuan / kW², the compensation amount M=62.8 yuan is calculated. The compensation amount can serve as an important reference for power transaction settlement, providing an objective and fair economic compensation plan for power generation companies and grid companies.

[0039] In one optional implementation, iteratively selecting boundary points from the scatter set and connecting them to form a closed boundary, and extracting the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arranging them in sequence to form a vertex coordinate sequence includes: Calculate the Euclidean distance from each coordinate point in the scatter set to the origin of the two-dimensional phase space, and select the coordinate point with the largest Euclidean distance as the initial boundary point; Starting from the initial boundary point, calculate the connection vector formed by the initial boundary point and the remaining coordinate points in the scatter set. Calculate the angle between each connection vector and the positive direction of the horizontal axis of the two-dimensional phase space. Select the coordinate point with the smallest angle value from all angles as the first subsequent boundary point. Connect the initial boundary point and the first subsequent boundary point as the first boundary line segment. Taking the first subsequent boundary point as the new starting point, calculate the connection vector formed by the first subsequent boundary point and the remaining unvisited coordinate points in the scatter set. Calculate the angle between each connection vector and the extension direction of the first boundary line segment. Select the coordinate point with the smallest angle value from all angles as the second subsequent boundary point. Connect the first subsequent boundary point and the second subsequent boundary point as the second boundary line segment. The process is repeated iteratively until the next boundary point returns to the initial boundary point to form a closed boundary. All boundary points on the closed boundary are extracted in the order of connection to form a vertex coordinate sequence.

[0040] In one specific implementation, the scattered point set data to be processed is acquired during the process of iteratively selecting boundary points in the scattered point set and connecting them to form a closed boundary. The scattered point set data can be acquired by a coordinate acquisition device or read from a database, and contains multiple two-dimensional coordinate points, each consisting of an abscissa value and a ordinate value.

[0041] After acquiring the scatter plot data, calculate the Euclidean distance from each coordinate point in the scatter plot to the origin of the two-dimensional phase space. For each coordinate point (x, y) in the scatter plot, its Euclidean distance to the origin (0, 0) can be expressed as the square root of the sum of the squares of the x-coordinate and y-coordinate of that point. After calculation, compare the Euclidean distance values ​​of all points and select the coordinate point with the largest Euclidean distance as the initial boundary point.

[0042] Starting from the initial boundary point, calculate the connection vector formed by this point and all other coordinate points in the scatter plot. For the initial boundary point P0(x0, y0) and any other point P(x, y), the connection vector can be represented as (x-x0, y-y0). Calculate the angle between each connection vector and the positive direction of the horizontal axis of the two-dimensional phase space, with the angle value ranging from 0 to 360 degrees. By comparing all the angles, select the coordinate point with the smallest angle value as the first subsequent boundary point, and mark the line connecting the initial boundary point and the first subsequent boundary point as the first boundary line segment.

[0043] Starting from the first subsequent boundary point P1, calculate the connection vector formed by it and the remaining unvisited coordinate points in the scatter plot. For each connection vector, calculate the angle between it and the extension direction of the first boundary segment. The extension direction can be understood as the direction vector of the first boundary segment. Select the coordinate point with the smallest angle value from all angles as the second subsequent boundary point P2, and mark the line connecting the first and second subsequent boundary points as the second boundary segment.

[0044] The process is iteratively executed as described above. Each time, starting from the newly determined boundary point, the angle between the connection vector formed with the unvisited point and the extension direction of the previous boundary segment is calculated. The point with the smallest angle is selected as the next boundary point, and the current point is connected to the next boundary point to form a new boundary segment. During the iteration, visited boundary points need to be recorded to avoid duplicate selection.

[0045] The iterative process continues until the next selected boundary point becomes the initial boundary point P0, at which point a closed boundary is formed. All boundary points on the closed boundary are extracted in the order of connection, forming a vertex coordinate sequence. This vertex coordinate sequence contains the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary, arranged according to the order of boundary point connection.

[0046] To improve the robustness of the algorithm, judgment conditions can be set to handle special cases. For example, when there are multiple minimum values ​​for the calculated included angle, the distances of these points to the current starting point are further compared, and the point with the closest distance is selected as the next boundary point. In addition, to avoid the inability to form a closed boundary due to data anomalies, a maximum iteration limit can be set.

[0047] When encountering situations where the scattered points are unevenly distributed or contain noisy points, a preprocessing step can be added during the selection of boundary points. For example, density clustering can be used to remove outliers, or smoothing can be used to reduce the jagged features of the boundaries.

[0048] When the scatter plot is large, spatial index structures such as quadtrees or R-trees can be used to accelerate the search for nearest neighbors and improve the computational efficiency of the algorithm. Furthermore, to address the specific needs of different application scenarios, specific weighting factors can be introduced during the boundary point selection process to make the generated boundaries more suitable for the application requirements.

[0049] In one optional implementation, the phase angles are extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviations of the topological partitions, and a hash operation is performed to generate a hierarchical encryption key set, including: Perform discrete Fourier transforms on the x-coordinate and y-coordinate components of the vertex coordinate sequence to obtain the x-coordinate frequency domain coefficient sequence and the y-coordinate frequency domain coefficient sequence, respectively. Calculate the amplitude of each frequency component in the frequency domain coefficient sequence of the horizontal axis and the frequency domain coefficient sequence of the vertical axis, select the frequency components whose amplitude exceeds the preset amplitude threshold as the target frequency component set, extract the phase angle corresponding to each frequency component in the target frequency component set, and form the initial phase angle sequence. Based on the closed boundary topology, the initial phase angle sequence is divided into multiple phase angle segments. For each phase angle segment, the phase angle value within the phase angle segment is numerically fused with the local deviation of the corresponding topology partition to obtain the characteristic phase angle sequence of the topology partition. A hash operation is then performed on the characteristic phase angle sequence to generate the partition key of the topology partition. The partition keys of all topological partitions are arranged according to the spatial order of the topological partitions within the closed boundary to form a hierarchical encryption key set as the encryption key.

[0050] In one specific implementation, a vertex coordinate sequence of a closed boundary is obtained. This vertex coordinate sequence consists of multiple vertex coordinate points, each of which includes an abscissa component and a ordinate component. The abscissa and ordinate components of the vertex coordinate sequence are then subjected to discrete Fourier transforms to obtain a frequency domain coefficient sequence for the abscissa and a frequency domain coefficient sequence for the ordinate.

[0051] Suppose the vertex coordinate sequence is {(x1, y1), (x2, y2), ..., (x... n y n )}, where n is the number of vertices. For the x-coordinate sequence {x1, x2, ..., x}, n} and the sequence of ordinates {y1, y2, ..., y} n Perform discrete Fourier transforms on each of the given values ​​to obtain the frequency domain coefficient sequence {X1, X2, ..., X}. n} and the frequency domain coefficient sequence {Y1, Y2, ..., Y} on the ordinate nEach frequency domain coefficient contains amplitude and phase information.

[0052] Calculate the amplitude of each frequency component in the frequency domain coefficient sequence on both the horizontal and vertical axes. For each frequency component k, calculate its amplitude |X|. k | and |Y k The frequency components whose amplitude exceeds a preset amplitude threshold are selected as the target frequency component set. For example, the amplitude threshold is set to twice the average amplitude, and the target frequency component set is determined by comparing the amplitude of each frequency component with this threshold.

[0053] Extract the phase angle corresponding to each frequency component from the target frequency component set to form an initial phase angle sequence. Assume the target frequency component set contains m frequency components, and the corresponding phase angle sequence is {θ1, θ2, ..., θ...}. m}, where θ i This represents the phase angle of the i-th target frequency component.

[0054] Based on the topological morphology of the closed boundary, the initial phase angle sequence is divided into multiple phase angle segments. The division method can be based on the geometric features of the boundary, such as corners, curvature changes, or uniform segmentation. For example, the segmentation points can be determined based on the Euclidean distance or angular changes between vertices, dividing the initial phase angle sequence {θ1, θ2, ..., θ...} into segments. m The segment is divided into p phase angle segments.

[0055] For each phase angle segment, the phase angle values ​​within the segment are numerically fused with the local deviation of the corresponding topological partition. The local deviation can be obtained by calculating the deviation between the boundary region corresponding to the phase angle segment and the ideal boundary shape (such as a circle or polygon). Specifically, for the j-th phase angle segment, the weighted sum θ of all phase angles within that segment is calculated. j _sum, then the local deviation δ of the corresponding topological partition. j The characteristic phase angle value φ is obtained by fusion. j .

[0056] Fusion operations can be performed using weighted summation, product, or composite functions. For example, φ can be used. j = α·θ j _sum + β·δ j Where α and β are weighting coefficients. For the feature phase angle sequence {φ1, φ2, ..., φ...} p Perform a hash operation to generate the partition key for the topology partition. A secure hash algorithm such as SHA-256 can be selected to ensure the security and uniqueness of the key.

[0057] The partition keys of all topological partitions are arranged according to the spatial order of the topological partitions within the closed boundary to form a hierarchical encryption key set, which serves as the final encryption key. The spatial order can be clockwise or counterclockwise, or based on other sorting rules of the topological partitions.

[0058] Furthermore, the number and division method of phase angle segments are adjusted according to the complexity of the boundary. For simple boundaries, fewer segments are used, while for complex boundaries, the number of segments is increased to capture more detailed features. Simultaneously, the selection strategy for amplitude thresholds and the weighting coefficients of numerical fusion can be adjusted for different application scenarios to optimize the key generation effect.

[0059] This key generation method based on boundary topological features can effectively convert boundary shape information into encryption keys, providing new technical means for fields such as image encryption and identity authentication.

[0060] like Figure 2 The diagram shown illustrates the topology encryption process.

[0061] In one optional implementation, dividing the initial phase angle sequence into multiple phase angle segments based on the topological morphology of the closed boundary includes: The closed boundary is divided into multiple boundary segments along the perimeter direction according to the vertex number sequence, and the local deviation between the boundary segment and the reference area is calculated for each boundary segment. Set a set of deviation level thresholds, compare all boundary segments with each threshold in the set of deviation level thresholds according to the absolute value of the local deviation, and merge continuous boundary segments with the absolute value of the local deviation in the same threshold range into a topological partition. The total number of topological partitions obtained by merging boundary segments of the closed boundary is counted, and the total number of phase angles in the initial phase angle sequence is obtained. Calculate the ratio of the total number of phase angles in the initial phase angle sequence to the total number of topology partitions, and round the ratio up to obtain the phase angle quota for each topology partition; According to the spatial order of the topological partitions in the closed boundary, starting from the beginning of the initial phase angle sequence, phase angles are extracted sequentially according to the phase angle quota to form a phase angle segment. The phase angle segment is then associated with the corresponding topological partition until all phase angles in the initial phase angle sequence have been divided into phase angle segments.

[0062] In one specific implementation, the closed boundary is divided into multiple boundary segments along its perimeter according to the vertex numbers. The closed boundary can be understood as a closed figure formed by connecting multiple vertices, each vertex having a unique number, and adjacent vertices connected by edges. For example, for a closed boundary with N vertices, starting from vertex numbered 1, the edges between adjacent vertices are defined as boundary segments sequentially in a clockwise or counterclockwise direction until returning to the starting vertex, forming a complete closed boundary.

[0063] For each boundary segment, calculate the local deviation between the boundary segment and the reference area. The reference area can be chosen as the average area of ​​the region inside the closed boundary or a standard area under ideal conditions. The local deviation can be calculated using various methods, such as the distance from the boundary segment to the center of the reference area, the angle between the boundary segment and the reference area boundary, or the difference between the area of ​​the region containing the boundary segment and the reference area. For example, the local deviation of the boundary segment can be obtained by calculating the difference between the area of ​​the region corresponding to each boundary segment and the reference area. If the area of ​​the region corresponding to the boundary segment is greater than the reference area, the deviation is positive; otherwise, the deviation is negative.

[0064] A set of deviation grading thresholds is defined, containing multiple increasing threshold values, to grade local deviations. For example, the threshold set can be {T1, T2, T3, ..., Tk}, where T1 < T2 < T3 < ... < Tk. All boundary segments are compared with the thresholds in the deviation grading threshold set according to the absolute value of their local deviations. Consecutive boundary segments with local deviation absolute values ​​within the same threshold range are merged into a single topological partition. If the absolute values ​​of local deviations of multiple consecutive boundary segments are all greater than or equal to Ti and less than Ti+1, these consecutive boundary segments are merged into a single topological partition.

[0065] Suppose there is a closed boundary consisting of 8 boundary segments, with calculated local deviations of {2.1, 2.3, 5.6, 5.8, 1.2, 1.5, 4.2, 4.5}, and a set of deviation thresholds of {2.0, 4.0, 6.0}. By comparing the absolute values ​​of the local deviations with the thresholds, boundary segments 1 and 2 can be merged into one topological partition (deviation in the range [2.0, 4.0)), boundary segments 3 and 4 into one topological partition (deviation in the range [4.0, 6.0)), boundary segments 5 and 6 into one topological partition (deviation less than 2.0), and boundary segments 7 and 8 into one topological partition (deviation in the range [4.0, 6.0)).

[0066] The total number of topological partitions obtained by merging boundary segments of the closed boundary is counted, and the total number of phase angles in the initial phase angle sequence is obtained. Continuing with the above embodiment, by merging consecutive boundary segments, four topological partitions are obtained. Assume that the initial phase angle sequence contains 20 phase angles.

[0067] Calculate the ratio of the total number of phase angles in the initial phase angle sequence to the total number of topological partitions, and round the ratio up to obtain the phase angle quota for each topological partition. Following the spatial order of the topological partitions within the closed boundary, starting from the beginning of the initial phase angle sequence, extract phase angles sequentially according to the phase angle quota to form a phase angle segment. Associate each phase angle segment with its corresponding topological partition until all phase angles in the initial phase angle sequence have been assigned to a phase angle segment.

[0068] For example, in the stability analysis of power systems, the node topology of the power system can be represented as a closed boundary, the transmission lines between nodes as boundary segments, and the initial phase angle sequence as the voltage phase angle of each node. Using this method, the voltage phase angle sequence can be divided into multiple segments based on the characteristics of the power system topology. Each segment corresponds to a group of nodes with similar characteristics in the system, thereby enabling partitioned control and management of the power system.

[0069] Through the above steps, a method for dividing the initial phase angle sequence into multiple phase angle segments based on the topological morphology of the closed boundary was realized, so that the phase angle segments match the topological morphological features of the closed boundary, providing a foundation for subsequent analysis and processing based on phase angle segments.

[0070] In one optional implementation, the compensation amount is converted into binary data, and the binary data is assigned to each topological partition based on the geometric center coordinates of the topological partition. A hierarchical encryption key set is used to perform encryption operations on the binary data of each topological partition, and the resulting hierarchical information packet includes: The compensation amount is quantized and encoded into binary data according to a preset precision. The geometric center coordinates of each topological partition in the closed boundary in the two-dimensional phase space are obtained. The total number of bits in the binary data and the total number of topological partitions are moduloed. Based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data, and a spatial mapping table from bits to topological partitions is constructed. Iterate through each bit of the binary data, look up the corresponding topology partition identifier from the spatial mapping table according to the index position of the bit, and assign the bit to the corresponding topology partition to form multiple bit sets, each bit set corresponding to a topology partition; For each topology partition's bit set, the partition key for the corresponding topology partition is obtained from the hierarchical encryption key set. The partition key is then used as the encryption key to perform an XOR operation on the binary data within the bit set to obtain the encrypted data block corresponding to the topology partition. All encrypted data blocks of the topology partitions are bound to the geometric center coordinates of the corresponding topology partitions. The binding results are arranged according to the spatial order of the topology partitions within the closed boundary and encapsulated to form a hierarchical information package containing spatial location information.

[0071] In one specific implementation, the compensation amount of 6030 yuan is quantized and encoded with a preset precision of 0.01 yuan. The quantization encoding multiplies the compensation amount by the reciprocal of the precision, 100, to obtain the integer value 603000. This integer value is then converted to binary data. The decimal number 603000 is divided by 2, and the integer part is 301500. The remainder is 0 and recorded as the least significant bit of the binary data. 301500 is then divided by 2, and the integer part is 150750. The remainder is 0 and recorded as the second least significant bit of the binary data. This process of dividing by 2 and recording the remainder is repeated until the integer part is 0. The recorded remainders are then arranged in reverse order to obtain the binary data "10010011011001110000". The total number of bits in the binary data is 20.

[0072] The closed boundary was divided into 6 topological partitions through topological analysis. Each topological partition consists of an area enclosed by several boundary points. The sum of the x-coordinates of all boundary points in the first topological partition, divided by the number of boundary points, yields the x-coordinate of the geometric center of the first topological partition: 6.8 MW. The sum of the y-coordinates of all boundary points in the first topological partition, divided by the number of boundary points, yields the y-coordinate of the geometric center of the first topological partition: 9.3 MW. Therefore, the geometric center coordinates of the first topological partition are (6.8 MW, 9.3 MW). The geometric center coordinates of the remaining five topological partitions were calculated in the same manner. The geometric center coordinates of the second topological partition are (8.2 MW, 11.5 MW), the third topological partition is (10.6 MW, 14.7 MW), the fourth topological partition is (5.2 MW, 7.6 MW), the fifth topological partition is (12.3 MW, 16.8 MW), and the sixth topological partition is (7.5 MW, 10.1 MW).

[0073] The total number of bits in the binary data, 20, is moduloed by the total number of topological partitions, 6. 20 divided by 6 results in an integer part of 3 and a remainder of 2. The modulo remainder is also 2. If the remainder is not zero, the order of the topological partitions needs to be generated based on the geometric center coordinates. The x-coordinate of the geometric center of the first topological partition, 6.8, is concatenated with its y-coordinate, 9.3, to form the string "6.8, 9.3". A hash operation is then performed on this string to generate the numerical hash value 47592. The hash operation is implemented by multiplying the encoded value of each character in the string by a power of 31, then summing the results and taking the modulo. The encoded value of the character "6", 54, is multiplied by 31 to the power of 0 to get 54; the encoded value of the character ".", 46, is multiplied by 31 to the power of 1 to get 1426; and the encoded value of the character "8", 56, is multiplied by 31 to the power of 2 to get 53816. After all characters have been calculated, the hash value is summed and modulo taken to obtain 47592. The same hash operation was performed on the geometric center coordinates of the remaining five topological partitions. The hash value of the second topological partition was 23871, the hash value of the third topological partition was 65308, the hash value of the fourth topological partition was 12456, the hash value of the fifth topological partition was 89021, and the hash value of the sixth topological partition was 34729. The six hash values ​​were then sorted in ascending order: 12456, 23871, 34729, 47592, 65308, and 89021. The corresponding topological partition order was: fourth topological partition, second topological partition, sixth topological partition, first topological partition, third topological partition, and fifth topological partition.

[0074] The bit indices of the binary data are numbered sequentially starting from 0. Index 0 corresponds to the most significant bit "1" in the binary data "10010011011001110000", index 1 corresponds to the second most significant bit "0", and so on, up to index 19 which corresponds to the least significant bit "0". A mapping relationship is established between the bit indices and the topological partitions according to the order of the partitions. Bits at index 0 are mapped to the 4th topological partition, bits at index 1 to the 2nd, bits at index 2 to the 6th, bits at index 3 to the 1st, bits at index 4 to the 3rd, and bits at index 5 to the 5th. Bits at index 6 cycle back to the beginning of the sequence and are mapped to the 4th topological partition, bits at index 7 to the 2nd, and so on, continuing the cyclic mapping until bits at index 19 are mapped to the 1st topological partition. The constructed spatial mapping table records the correspondence between 20 bit indices and topology partition identifiers. The 0th record of the spatial mapping table maps index 0 to the 4th topology partition, the 1st record maps index 1 to the 2nd topology partition, and the 2nd record maps index 2 to the 6th topology partition.

[0075] Traversing the 20 bits of the binary data, the identifier of the 4th topological partition is found in the spatial mapping table based on index 0, and the bit "1" corresponding to index 0 is assigned to the 4th topological partition. The identifier of the 2nd topological partition is found in the spatial mapping table based on index 1, and the bit "0" corresponding to index 1 is assigned to the 2nd topological partition. After traversal, the bit set of the 4th topological partition contains 4 bits corresponding to indices 0, 6, 12, and 18, with bit values ​​"1", "0", "1", and "0" respectively, concatenating them to form the bit sequence "1010". The bit set of the 2nd topological partition contains 4 bits corresponding to indices 1, 7, 13, and 19, with bit values ​​"0", "1", "1", and "0" respectively, concatenating them to form the bit sequence "0110". The bit set of the 6th topological partition contains 3 bits corresponding to indices 2, 8, and 14, with bit values ​​"0", "0", and "0" respectively, concatenating them to form the bit sequence "000". The bit set of the first topological partition contains 3 bits corresponding to indices 3, 9, and 15, with bit values ​​of "1", "1", and "1" respectively, which are concatenated to form the bit sequence "111". The bit set of the third topological partition contains 3 bits corresponding to indices 4, 10, and 16, with bit values ​​of "0", "0", and "1" respectively, which are concatenated to form the bit sequence "001". The bit set of the fifth topological partition contains 3 bits corresponding to indices 5, 11, and 17, with bit values ​​of "0", "1", and "1" respectively, which are concatenated to form the bit sequence "011".

[0076] The hierarchical encryption key set contains partition keys corresponding to 6 topological partitions. The partition key for the 4th topological partition is a 42-bit binary sequence. The bit set "1010" for the 4th topological partition is 4 bits long. The first 4 bits "1100" are extracted from the 42-bit partition key and used as the encryption key. An XOR operation is performed between the bit set "1010" and the encryption key "1100". The bit "1" at index 0 is XORed with the 0th bit "1" of the encryption key to get "0", the bit "0" at index 1 is XORed with the 1st bit "1" of the encryption key to get "1", the bit "1" at index 2 is XORed with the 2nd bit "0" of the encryption key to get "1", and the bit "0" at index 3 is XORed with the 3rd bit "0" of the encryption key to get "0". The result of the XOR operation is "0110", which is used as the encrypted data block for the 4th topological partition. The bit sets of the remaining five topology partitions are processed in the same way. The partition key of the second topology partition is truncated to the first 4 bits as "1010", which is XORed with the bit set "0110" to obtain the encrypted data block "1100". The partition key of the sixth topology partition is truncated to the first 3 bits as "101", which is XORed with the bit set "000" to obtain the encrypted data block "101". The partition key of the first topology partition is truncated to the first 3 bits as "010", which is XORed with the bit set "111" to obtain the encrypted data block "101". The partition key of the third topology partition is truncated to the first 3 bits as "110", which is XORed with the bit set "001" to obtain the encrypted data block "111". The partition key of the fifth topology partition is truncated to the first 3 bits as "100", which is XORed with the bit set "011" to obtain the encrypted data block "111".

[0077] Bind the encrypted data block "101" of the first topology partition to the geometric center coordinates (6.8 MW, 9.3 MW). The binding data structure is "partition identifier|encrypted data|x-coordinate|y-coordinate". The binding result for the first topology partition is "1|101|6.8|9.3". Complete the binding operation for the remaining 5 topology partitions in the same way. The binding result for the second topology partition is "2|1100|8.2|11.5", the binding result for the third topology partition is "3|111|10.6|14.7", the binding result for the fourth topology partition is "4|0110|5.2|7.6", the binding result for the fifth topology partition is "5|111|12.3|16.8", and the binding result for the sixth topology partition is "6|101|7.5|10.1". The distances from the geometric center coordinates of the six topological partitions to the origin of the two-dimensional phase space were calculated. The distance to the geometric center coordinates of the first topological partition (6.8 MW, 9.3 MW) is equal to the square root of the sum of the squares of the x-coordinate value (6.8) and the y-coordinate value (9.3), resulting in 11.51 MW. The distances for the second and third topological partitions are 14.15 MW, 18.18 MW, 9.24 MW, 20.89 MW, and 12.53 MW, respectively. The binding results of the six topological partitions were arranged in ascending spatial order of distance, as follows: fourth topological partition, first topological partition, sixth topological partition, second topological partition, third topological partition, and fifth topological partition. The arranged binding results are concatenated in order. The total number of topological partitions (6) and the index information of the geometric center coordinates of each topological partition are added to the beginning of the concatenated sequence. This is then encapsulated into a hierarchical information package: "6|4,1,6,2,3,5|4|0110|5.2|7.6|1|101|6.8|9.3|6|101|7.5|10.1|2|1100|8.2|11.5|3|111|10.6|14.7|5|111|12.3|16.8".

[0078] In one optional implementation, based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data, and a spatial mapping table from bits to topological partitions is constructed, including: Perform a modulo operation between the total number of bits in the binary data and the total number of topological partitions to obtain the modulo remainder, and then determine whether the modulo remainder is zero. When the remainder after modulo operation is zero, a one-to-one mapping relationship is established between the bit index of the binary data and the spatial order of the topological partition in an ascending order. When the remainder after modulo operation is not zero, the x-coordinate and y-coordinate values ​​of the geometric center coordinates of each topological partition are concatenated as input, and a hash operation is performed to generate a hash value sequence of the topological partitions. The hash value sequence is sorted according to the numerical value to obtain the arrangement order of the topological partitions. The bit indexes of binary data are mapped to the topological partitions according to their sorting order, thus constructing a spatial mapping table from bits to topological partitions.

[0079] In one specific implementation, the binary data to be processed and its total number of bits are obtained, along with the topological partition information and its total number in the spatial region. The topological partition information includes the boundary coordinates and geometric center coordinates of each partition.

[0080] After obtaining the total number of bits in the binary data and the total number of topological partitions, a modulo operation is performed. For example, assuming the total number of bits in the binary data is 128 and the total number of topological partitions is 16 regions, the result of the modulo operation is 128% 16 = 0, that is, the remainder is zero.

[0081] When the remainder after modulo operation is zero, a direct sequential mapping method is used to establish a mapping relationship between the bits of the binary data and the topological partitions in ascending order of their indices. For example, the bit with index 0 is mapped to the first topological partition, the bit with index 1 is mapped to the second topological partition, and so on. This mapping method is simple and efficient, and is suitable when the total number of bits is an integer multiple of the number of topological partitions.

[0082] If the modulo remainder is not zero, a hash mapping method based on the geometric center coordinates is required. For example, assuming the total number of bits in the binary data is 130 and the total number of topological partitions is 16 regions, the modulo operation result is 130 % 16 = 2, and the modulo remainder is not zero. In this case, it is necessary to extract the geometric center coordinates of each topological partition and perform a hash operation to determine the arrangement order of the partitions.

[0083] Specifically, the geometric center coordinates of each topological partition are extracted from the spatial database. For example, the geometric center coordinates of the first topological partition are (12.5, 35.6). The x-coordinate value 12.5 and the y-coordinate value 35.6 are concatenated to form the string "12.535.6" and used as the input to the hash function. The same operation is performed for all topological partitions to generate the input string.

[0084] Perform a hash algorithm, such as SHA-256, on the input string for each topology partition to generate a hash value. Perform the same operation on all topology partitions to generate a sequence of hash values.

[0085] After generating the hash value sequence, sort the hash values ​​according to their numerical values ​​to obtain the order of the topological partitions. For example, suppose the sorted order is: Partition 3, Partition 1, Partition 5, Partition 2, etc.

[0086] Based on the sorted topological partition order, establish a mapping relationship between binary data bits and topological partitions. For example, the bit with index 0 is mapped to the first sorted topological partition (i.e., the original 3rd partition), the bit with index 1 is mapped to the second sorted topological partition (i.e., the original 1st partition), and so on.

[0087] The established mapping relationship is saved as a spatial mapping table from bits to topology partitions. This mapping table contains the index of each bit in the binary data and its corresponding topology partition identifier.

[0088] The above implementation method realizes a technical solution for establishing an effective mapping between the bits of binary data and topological partitions, which can adapt to scenarios with different total number of bits and number of topological partitions, and improves the efficiency of data processing and spatial analysis.

[0089] The transparent management system for compensation information in simulated operation of new energy power plants according to embodiments of the present invention includes: The data acquisition unit is used to acquire the actual power generation curve and theoretical power generation curve of new energy power plants during the dispatch period; The deviation calculation unit is used to construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The key generation unit is used to extract the phase angle by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The hierarchical encryption unit is used to convert the compensation amount into binary data, assign the binary data to each topological partition based on the geometric center coordinates of the topological partition, and perform encryption operations on the binary data of each topological partition using the hierarchical encryption key set, and encapsulate it into a hierarchical information packet. The hierarchical decryption unit is used to determine the topology partition level based on the query identity, decrypt the hierarchical information packet, and return the content of the corresponding level.

[0090] A third aspect of the present invention provides an electronic device, comprising: processor; Memory used to store processor-executable instructions; The processor is configured to invoke instructions stored in the memory to execute the aforementioned method.

[0091] A fourth aspect of the present invention provides a computer-readable storage medium having stored thereon computer program instructions that, when executed by a processor, implement the aforementioned method.

[0092] This invention can be a method, apparatus, system, and / or computer program product. The computer program product may include a computer-readable storage medium having computer-readable program instructions loaded thereon for performing various aspects of the invention.

[0093] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.

Claims

1. A method for transparent management of compensation information during simulated operation of new energy power plants, characterized in that, include: Obtain the actual and theoretical power generation curves of new energy power plants during the dispatch period; Construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The phase angle is extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The compensation amount is converted into binary data, and the binary data is assigned to each topological partition based on the geometric center coordinates of the topological partition. The binary data of each topological partition is encrypted using a hierarchical encryption key set and encapsulated into a hierarchical information packet. The topology partition level is determined based on the query identity, and the content of the corresponding level is decrypted from the hierarchical information packet and returned.

2. The method according to claim 1, characterized in that, A scatter set is constructed in two-dimensional phase space by comparing the actual power generation curve with the theoretical power generation curve. Boundary points are iteratively selected to form a closed boundary, and the vertex coordinate sequence is extracted. The topological deviation between the closed boundary area and the reference area is calculated. The compensation amount is calculated based on the sign of the topological deviation, including: The actual power generation curve and the theoretical power generation curve are sampled at time intervals to obtain the actual power sampling sequence and the theoretical power sampling sequence. The actual power sampling sequence is used as the abscissa and the theoretical power sampling sequence is used as the ordinate to generate coordinate points in the two-dimensional phase space to form a scatter set. Iteratively select boundary points from the scattered point set and connect them to form a closed boundary. Extract the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arrange them in order to form a vertex coordinate sequence. The length of each boundary segment is calculated based on the coordinate difference between adjacent vertices in the vertex coordinate sequence. The area of ​​the convex polygon with closed boundary is obtained by summing the lengths of each boundary segment and the corresponding vertex coordinates using the polygon area formula. Determine the diagonal between the origin and the maximum power point in the scatter plot in the two-dimensional phase space, and calculate the area of ​​the right triangle formed by the diagonal, the horizontal axis, and the vertical axis as the reference area. The topological deviation is obtained by subtracting the reference area from the area of ​​the convex polygon. The compensation amount is obtained by multiplying the topological deviation by the positive or negative compensation coefficient, depending on the sign of the topological deviation.

3. The method according to claim 2, characterized in that, Iteratively select boundary points from the scatter set and connect them to form a closed boundary. Extract the x-coordinate and y-coordinate values ​​of each boundary point on the closed boundary and arrange them in order to form a vertex coordinate sequence, including: Calculate the Euclidean distance from each coordinate point in the scatter set to the origin of the two-dimensional phase space, and select the coordinate point with the largest Euclidean distance as the initial boundary point; Starting from the initial boundary point, calculate the connection vector formed by the initial boundary point and the remaining coordinate points in the scatter set. Calculate the angle between each connection vector and the positive direction of the horizontal axis of the two-dimensional phase space. Select the coordinate point with the smallest angle value from all angles as the first subsequent boundary point. Connect the initial boundary point and the first subsequent boundary point as the first boundary line segment. Taking the first subsequent boundary point as the new starting point, calculate the connection vector formed by the first subsequent boundary point and the remaining unvisited coordinate points in the scatter set. Calculate the angle between each connection vector and the extension direction of the first boundary line segment. Select the coordinate point with the smallest angle value from all angles as the second subsequent boundary point. Connect the first subsequent boundary point and the second subsequent boundary point as the second boundary line segment. The process is repeated iteratively until the next boundary point returns to the initial boundary point to form a closed boundary. All boundary points on the closed boundary are extracted in the order of connection to form a vertex coordinate sequence.

4. The method according to claim 1, characterized in that, The phase angles are extracted by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviations of the topological partitions, and a hash operation is performed to generate a hierarchical encryption key set, including: Perform discrete Fourier transforms on the x-coordinate and y-coordinate components of the vertex coordinate sequence to obtain the x-coordinate frequency domain coefficient sequence and the y-coordinate frequency domain coefficient sequence, respectively. Calculate the amplitude of each frequency component in the frequency domain coefficient sequence of the horizontal axis and the frequency domain coefficient sequence of the vertical axis, select the frequency components whose amplitude exceeds the preset amplitude threshold as the target frequency component set, extract the phase angle corresponding to each frequency component in the target frequency component set, and form the initial phase angle sequence. Based on the closed boundary topology, the initial phase angle sequence is divided into multiple phase angle segments. For each phase angle segment, the phase angle value within the phase angle segment is numerically fused with the local deviation of the corresponding topology partition to obtain the characteristic phase angle sequence of the topology partition. A hash operation is then performed on the characteristic phase angle sequence to generate the partition key of the topology partition. The partition keys of all topological partitions are arranged according to the spatial order of the topological partitions within the closed boundary to form a hierarchical encryption key set as the encryption key.

5. The method according to claim 4, characterized in that, Based on the topological morphology of the closed boundary, the initial phase angle sequence is divided into multiple phase angle segments, including: The closed boundary is divided into multiple boundary segments along the perimeter direction according to the vertex number sequence, and the local deviation between the boundary segment and the reference area is calculated for each boundary segment. Set a set of deviation level thresholds, compare all boundary segments with each threshold in the set of deviation level thresholds according to the absolute value of the local deviation, and merge continuous boundary segments with the absolute value of the local deviation in the same threshold range into a topological partition. The total number of topological partitions obtained by merging boundary segments of the closed boundary is counted, and the total number of phase angles in the initial phase angle sequence is obtained. Calculate the ratio of the total number of phase angles in the initial phase angle sequence to the total number of topology partitions, and round the ratio up to obtain the phase angle quota for each topology partition; According to the spatial order of the topological partitions in the closed boundary, starting from the beginning of the initial phase angle sequence, phase angles are extracted sequentially according to the phase angle quota to form a phase angle segment. The phase angle segment is then associated with the corresponding topological partition until all phase angles in the initial phase angle sequence have been divided into phase angle segments.

6. The method according to claim 1, characterized in that, The compensation amount is converted into binary data. Based on the geometric center coordinates of the topological partitions, the binary data is assigned to each topological partition. A hierarchical encryption key set is used to perform encryption operations on the binary data of each topological partition, and the resulting hierarchical information packet includes: The compensation amount is quantized and encoded into binary data according to a preset precision. The geometric center coordinates of each topological partition in the closed boundary in the two-dimensional phase space are obtained. The total number of bits in the binary data and the total number of topological partitions are moduloed. Based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data, and a spatial mapping table from bits to topological partitions is constructed. Iterate through each bit of the binary data, look up the corresponding topology partition identifier from the spatial mapping table according to the index position of the bit, and assign the bit to the corresponding topology partition to form multiple bit sets, each bit set corresponding to a topology partition; For each topology partition's bit set, the partition key for the corresponding topology partition is obtained from the hierarchical encryption key set. The partition key is then used as the encryption key to perform an XOR operation on the binary data within the bit set to obtain the encrypted data block corresponding to the topology partition. All encrypted data blocks of the topology partitions are bound to the geometric center coordinates of the corresponding topology partitions. The binding results are arranged according to the spatial order of the topology partitions within the closed boundary and encapsulated to form a hierarchical information package containing spatial location information.

7. The method according to claim 6, characterized in that, Based on the modulo result, a mapping relationship is established between the geometric center coordinates of each topological partition and the bit index of the binary data. A spatial mapping table from bit to topological partition is constructed, including: Perform a modulo operation between the total number of bits in the binary data and the total number of topological partitions to obtain the modulo remainder, and then determine whether the modulo remainder is zero. When the remainder after modulo operation is zero, a one-to-one mapping relationship is established between the bit index of the binary data and the spatial order of the topological partition in an ascending order. When the remainder after modulo operation is not zero, the x-coordinate and y-coordinate values ​​of the geometric center coordinates of each topological partition are concatenated as input, and a hash operation is performed to generate a hash value sequence of the topological partitions. The hash value sequence is sorted according to the numerical value to obtain the arrangement order of the topological partitions. The bit indexes of binary data are mapped to the topological partitions according to their sorting order, thus constructing a spatial mapping table from bits to topological partitions.

8. A transparent management system for compensation information in simulated operation of new energy power plants, used to implement the method described in any one of claims 1-7, characterized in that, include: The data acquisition unit is used to acquire the actual power generation curve and theoretical power generation curve of new energy power plants during the dispatch period; The deviation calculation unit is used to construct a scatter set of actual power generation curve power and theoretical power generation curve power in two-dimensional phase space, iteratively select boundary points to form a closed boundary and extract vertex coordinate sequence, calculate the topological deviation between the closed boundary area and the reference area, and calculate the compensation amount according to the positive or negative sign of the topological deviation. The key generation unit is used to extract the phase angle by performing a Fourier transform on the vertex coordinate sequence to form an initial phase angle sequence. Based on the topological shape of the closed boundary, the initial phase angle sequence is divided into phase angle segments. The phase angle segments are numerically fused with the local deviation of the topological partition, and a hash operation is performed to generate a hierarchical encryption key set. The hierarchical encryption unit is used to convert the compensation amount into binary data, assign the binary data to each topological partition based on the geometric center coordinates of the topological partition, and perform encryption operations on the binary data of each topological partition using the hierarchical encryption key set, and encapsulate it into a hierarchical information packet. The hierarchical decryption unit is used to determine the topology partition level based on the query identity, decrypt the hierarchical information packet, and return the content of the corresponding level.

9. An electronic device, characterized in that, include: processor; Memory used to store processor-executable instructions; The processor is configured to invoke instructions stored in the memory to execute the method according to any one of claims 1 to 7.

10. A computer-readable storage medium having computer program instructions stored thereon, characterized in that, When the computer program instructions are executed by the processor, they implement the method described in any one of claims 1 to 7.

Images