PARTITION MONITORING METHOD AND MODEL FOR CONCRETE DAM OPERATION KEY PART

Abstract

The partition monitoring method for concrete dam operation key parts provided by the disclosure firstly utilizes the extracted monitoring data time-frequency vector to partition the concrete dam key parts, and on this basis, obtains time series measurement data of different types of monitoring instruments with high temporal and spatial correlation, so as to establish a graph structure. Then, the dependence of time dimension and variable dimension of multivariate time series data is captured, and the relationship between further learning and representation of graph attention network is provided. Furthermore, the final feature representation of time series measured data is obtained, and finally the anomaly score is calculated through the final feature representation to detect anomalies. The complementary mutual verification of multiple measuring points of monitoring instruments with various types is realized. The structural integrity and spatial distribution law of concrete dams are fully embodied.

Claims

1. A partition monitoring method for concrete dam operation key parts, comprising: dividing the concrete dam operation key parts into partitions, and obtaining time series measurement data of monitoring instruments with different types in one of the partitions; establishing graph structures on the time series measurement data in a time dimension and a variable dimension respectively to obtain a time feature graph and a variable feature graph; inputting the time feature graph and the variable feature graph into a time graph attention network and a variable graph attention network respectively to obtain a time attention matrix and a variable attention matrix; splicing and inputting the time series measurement data, the time attention matrix and the variable attention matrix into a gated convolution network to obtain a target feature; calculating an abnormal score according to the target feature, and judging a concrete dam operation is abnormal if the abnormal score exceeds a preset threshold.

2. The partition monitoring method for concrete dam operation key parts according to claim 1, wherein the dividing the concrete dam operation key parts into partitions comprises: constructing a measuring point time-frequency vector space-time data matrix according to a measuring point time-frequency vector and a measuring point space vector of the concrete dam operation key parts; applying Gaussian mixture clustering to the measuring point time-frequency vector space-time data matrix, and taking spatial information of concrete dam safety measuring points as a prior knowledge of component quantity, and constructing a division model of the concrete dam operation key parts under a spatial constraint; iteratively optimizing and solving parameters of the division model of the concrete dam operation key parts by applying an expectation maximization algorithm to obtain an iteratively optimized division model of the concrete dam operation key parts; dividing the concrete dam operation key parts by using the iteratively optimized division model of the concrete dam operation key parts.

3. The partition monitoring method for concrete dam operation key parts according to claim 2, wherein obtaining the measuring point time-frequency vector comprises: decomposing monitoring data of a historical concrete dam structure by a wavelet packet transform, and calculating wavelet packet coefficients of an M layer; extracting a time domain vector for each of low-frequency coefficients in the wavelet packet coefficients of the M layer; calculating a wavelet energy spectrum of each of the wavelet packet coefficients in the M layer and extracting a frequency domain vector; respectively normalizing the time domain vector corresponding to a plurality of the low-frequency coefficients and the frequency domain vector corresponding to a plurality of the wavelet packet coefficients to obtain a normalized time domain vector and a normalized frequency domain vector, and calculating and obtaining the measuring point time-frequency vector according to the normalized time domain vector and the normalized frequency domain vector.

4. The partition monitoring method for concrete dam operation key parts according to claim 1, wherein the establishing graph structures on the time series measurement data in a time dimension and a variable dimension respectively to obtain a time feature graph and a variable feature graph comprises: setting an embedding vector for each of variables in the time series measurement data; calculating correlation of the variables according to embedding vectors corresponding to any two variables; connecting any one of the variables with top K neighbor variables with a greatest correlation of the any one of the variables by first edges in a spatial graph to obtain the variable feature graph; setting an embedding vector and a position code at each of time points in a sliding time window for the time series measurement data; calculating time correlation according to embedding vectors corresponding to any two time points; connecting data at any one of the time points with top K neighbor time points with a greatest time correlation of the data at any one of the time points by second edges in the spatial graph to obtain the time feature graph.

5. The partition monitoring method for concrete dam operation key parts according to claim 1, wherein the inputting the time feature graph and the variable feature graph into a time graph attention network and a variable graph attention network respectively to obtain a time attention matrix and a variable attention matrix comprises: respectively inputting the variable feature graph into a multi-head attention module, an intra-indicator attention module and an inter-indicator attention module in the variable graph attention network, capturing a variable dependence between multivariate time measured data, a correlation of all the measuring points under the monitoring instruments with same types and a correlation of all the measuring points under the monitoring instruments with different types; splicing an output of the multi-head attention module, an output of the intra-indicator attention module and an output of the inter-indicator attention module to obtain the variable attention matrix; inputting the time feature graph into the time graph attention network, aggregating data of neighbor time points to update a feature representation of each one of the time points by combining the position code and using the multi-head attention module, and obtaining the time attention matrix.

6. The partition monitoring method for concrete dam operation key parts according to claim 1, wherein the calculating an abnormal score according to the target feature comprises: inputting the target feature into a prediction module and a reconstruction module to obtain a prediction value and a reconstruction probability; calculating the abnormal score according to the prediction value and the reconstruction probability.

7. The partition monitoring method for concrete dam operation key parts according to claim 6, wherein the prediction module is a multi-layer perceptron.

8. The partition monitoring method for concrete dam operation key parts according to claim 6, wherein the reconstruction module comprises a discriminator and an autoencoder.

9. The partition monitoring method for concrete dam operation key parts according to claim 6, wherein a calculation formula for the calculating the abnormal score according to the prediction value and the reconstruction probability is: $\mathrm{score}=\underset{i=1}{\overset{N}{.Math.}}\frac{\left(1-p_i\right)+{{}_2\left(x_i-{\hat{x}}_i\right)}^2}{1+{}_2}$ wherein, {circumflex over (x)}.sub.i is the prediction value, X.sub.i is a measured value, .sub.2 is a superparameter for balancing the prediction module and the reconstruction module, and p.sub.i is the reconstruction probability.

10. An partition monitoring model for concrete dam operation key parts, comprising: a data acquisition module configured for dividing the concrete dam operation key parts into partitions and obtaining time series measurement data of monitoring instruments with different types in one of the partitions; a feature graph construction module configured for establishing graph structures on the time series measurement data in a time dimension and a variable dimension respectively to obtain a time feature graph and a variable feature graph; an attention mechanism module configured for inputting the time feature graph and the variable feature graph into a time graph attention network and a variable graph attention network respectively to obtain a time attention matrix and a variable attention matrix; a target feature acquisition module configured for splicing and inputting the time series measurement data, the time attention matrix and the variable attention matrix into a gated convolution network to obtain a target feature; an anomaly detection module configured for calculating an abnormal score according to the target feature, wherein the anomaly detection module judges a concrete dam operation being abnormal if the abnormal score exceeds a preset threshold.

Description

BRIEF DESCRIPTION OF THE DRAWINGS

[0048] In order to make the contents of the disclosure more clearly understood, the disclosure will be further described in detail according to specific embodiments of the disclosure and with the accompanying drawings, in which:

[0049] FIG. 1 is a flowchart of a partition monitoring method for concrete dam operation key parts according to embodiments of the disclosure;

[0050] FIG. 2 is an F-GAT network architecture diagram;

[0051] FIG. 3 is a frame diagram of countermeasure generation network;

[0052] FIG. 4 is a framework of multi-indicator graph attention network model for concrete dam key parts;

[0053] FIG. 5 is a schematic diagram of horizontal radial displacement monitoring data of normal vertical measuring points;

[0054] FIG. 6A is a schematic diagram of horizontal tangential displacement monitoring data of typical normal vertical measuring points (C4-A19-PL-0102);

[0055] FIG. 6B is a schematic diagram of horizontal tangential displacement monitoring data of typical normal vertical measuring points (C4-A22-PL-0102);

[0056] FIG. 7 is a schematic diagram of monitoring data of opening and closing degree of transverse seam of the seam gauge;

[0057] FIG. 8A is a schematic diagram of abnormal detection results of horizontal tangential displacement monitoring data of typical normal vertical measuring points at some time stamps;

[0058] FIG. 8B is a schematic diagram of abnormal detection results of horizontal tangential displacement monitoring data of typical normal vertical measuring points at other some time stamps;

[0059] FIG. 9A is a schematic diagram of abnormal detection result of the monitoring data of opening and closing degree of the transverse seam of the seam gauge at some time stamps;

[0060] FIG. 9B is a schematic diagram of abnormal detection result of the monitoring data of opening and closing degree of the transverse seam of the seam gauge at other some time stamps;

[0061] FIG. 10 is a schematic diagram of similarity matrix of arch crown beam partition monitoring model on an upper part of dam body.

DETAILED DESCRIPTION OF THE EMBODIMENTS

[0062] The core of the embodiment is to provide a partition monitoring method and model for concrete dam operation key parts, the complementary mutual verification of multiple measuring points of monitoring instruments with various types is realized, the structural integrity and spatial distribution law of concrete dams are fully embodied.

[0063] In order to make those skilled in the art better understand the scheme of the disclosure, the disclosure will be further described in detail with attached drawings and specific embodiments. Apparently, the described embodiment is only a part of the embodiment of the disclosure, not all of the embodiment. Based on the embodiments in the disclosure, all other embodiments obtained by those skilled in the art without creative efforts belong to the protection scope of the disclosure.

[0064] According to the design principles and technical requirements, various types of monitoring instruments are arranged at the key parts of the concrete dam for the same monitoring effect, and the effects of mutual backup and mutual verification are achieved. Based on this, on the basis of dividing the concrete dam operation key parts, this embodiment establishes a partition monitoring method for the key parts with complementary mutual verification of multiple measuring points of multi-type monitoring instruments, so as to online judge of the operational behavior of concrete dams.

[0065] Please refer to FIG. 1, which is a flowchart of a partition monitoring method for concrete dam operation key parts according to the disclosure. The specific operation steps are as follows. [0066] S101: the concrete dam operation key parts are divided into partitions, and time series measurement data of monitoring instruments with different types in one of the partitions is obtained.

[0067] According to the time-space feature matrix of monitoring data of concrete dam, the monitoring data of various types and multi-measuring points involved in the concrete dam operation key parts are usually multivariate time series data. The multivariate time series data consists of a set of univariate time series data. The indicators represented by each univariate time series data have unique attributes, and these indicators are interrelated through linear and nonlinear relationships. [0068] S102: the time series measurement data is established graph structures in a time dimension and a variable dimension respectively to obtain a time feature graph and a variable feature graph. [0069] S103: the time feature graph and the variable feature graph are inputted into a time graph attention network and a variable graph attention network respectively to obtain a time attention matrix and a variable attention matrix. [0070] S104: the time series measurement data, the time attention matrix and the variable attention matrix are spliced and inputted into a gated convolution network to obtain a target feature. [0071] S105: an abnormal score is calculated according to the target feature, and a concrete dam operation is judged to be abnormal if the abnormal score exceeds a preset threshold.

[0072] Based on the above embodiment, step S101 is described in detail in the embodiment.

[0073] Wherein, the specific methods for dividing the concrete dam operation key parts into partitions includes the following. [0074] Step a, time-frequency vector space-time data matrix of measuring points is constructed according to the measuring point time-frequency vector and the measuring point space vector of the concrete dam operation key parts; the idea of constructing the spatio-temporal feature matrix of measuring points of the concrete dam is as follows: [0075] (1) Measured values time-frequency vector of the measuring points: the time-frequency vector of monitoring data of a specific measuring point in a certain period of time is extracted and expressed as n-dimensional vector:

x.sub.i=(x.sub.i1,x.sub.i2, . . . ,x.sub.in)

[0076] Where, x.sub.i is the time-frequency vector of the measured data of a certain measuring point in a period of time, x.sub.in is a time-frequency vector of the measured data of this measuring point, and the time-frequency vector extracted according to Chapter 3, n=24.

[0077] The extracting the time-frequency vector includes: [0078] the monitoring data of historical concrete dam structure are decomposed by wavelet packet transform, and the wavelet packet coefficient of the M layer is calculated; [0079] a time domain vector is extracted from each low-frequency coefficient in the M layer wavelet packet coefficient; [0080] the wavelet energy spectrum of each wavelet packet coefficient in the M layer is calculated and the frequency domain vector is extracted;

[0081] The time domain vectors corresponding to multiple low-frequency coefficients and frequency domain vectors corresponding to multiple wavelet packet coefficients are normalized respectively, and the time-frequency vectors are calculated according to the normalized time domain vectors and frequency domain vectors. [0082] (2) The measuring point space vector: each of the measuring points has space attribute, and the three-dimensional space vector is represented as s(i)=(n.sub.i,e.sub.i,h.sub.i,d.sub.i). Where n.sub.i and e.sub.i respectively represent the horizontal coordinates of layout location of the measuring points; h.sub.i represents the vertical coordinate of layout position of the measuring point; d.sub.i represents the type of monitoring instrument to which the measuring point belongs. [0083] (3) Measuring point space-time vector: combining measuring point time-frequency vector and measuring point space vector to form measuring point space-time vector is expressed as:

[00002]$x_i={\left[x_{i1},x_{i2},...,x_{\mathrm{in}}.Math.s\left(i\right)\right]}_{i=1,2,...,n}$ [0084] (4) Time-space matrix of monitoring data: the time-space matrix is used to represent the collection of various types of measuring points for monitoring items such as deformation, stress-strain, seepage, etc. in a certain structural part of the concrete dam:

[00003]$R_n=\left[\begin{array}{ccccc}{x}_{11}& x_{12}& L& x_{1n}& s\left(1\right)\\ x_{21}& x_{22}& L& x_{2n}& s\left(2\right)\\ M& M& & M& M\\ x_{i1}& x_{i2}& L& x_{\mathrm{in}}& s\left(n\right)\end{array}\right]$

[0085] Where, Rn represents the time-frequency vector space-time matrix of monitoring data of all measuring points in a certain structural part. [0086] Step b: Gaussian mixed clustering is applied to the time-frequency vector space-time data matrix of the measuring points, and the spatial information of the safety measuring points of the concrete dam is takes as the prior knowledge of the component quantity, and a division model of the concrete dam operation key parts under spatial constraints is constructed; according to the time-space correlation analysis of the measured values of measuring points of concrete dams, the similarity feature of the measured values of measuring points of the same monitoring project or different monitoring projects are also quite different under various conditions such as the same spatial position, symmetrical position and different elevation positions. But generally speaking, combined with the first law of geography, Everything is related to other things, but similar things are more closely related, and the relevant technical specifications such as the structural parts of concrete dams and the layout of monitoring systems, the feature similarity of the measured values of measuring points at the same or similar parts is higher. For Gaussian mixture model, the closer the spatial positions of the measuring points are, the greater the probability that the measured values belong to the same Gaussian distribution component. Therefore, taking the spatial information of the safety measuring points of the concrete dam as the prior knowledge of the division model of the concrete dam operation key parts is to put the product between the distance feature and the component weight into the hidden feature vector.

[0087] The measured data set of the safety measuring points of the concrete dam X=(x.sub.1, x.sub.2, . . . x.sub.N) and the spatial nearest measuring point data of the measured data set of the safety measuring points X=(x.sub.1, x.sub.2, . . . , x.sub.N) are obtained; the spatial distance of the safety measuring point q=(q.sub.1, q.sub.2, . . . , q.sub.N) is obtained, where

[00004]$q_k={\left(n_k^2+e_k^2+h_k^2\right)}^{\frac{1}{2}},$

n.sub.k, e.sub.k, h.sub.k respectively represent the three-dimensional coordinate information of the measuring points, k=1 . . . N; a spatial distance feature Q=(Q.sub.1, Q.sub.2, . . . , Q.sub.N) is calculated according to the spatial distance of the safety measuring point, where,

[00005]$Q_k=\frac{q_{\max }-q_k}{q_{\max }-q_{\min }},$

q.sub.max and q.sub.min are the maximum value and the minimum value of q respectively; component weight {w.sub.1, w.sub.2, . . . , w.sub.C} is obtained according to the types of monitoring instruments of safety measuring points, and hidden feature vector Z=(Z.sub.1, Z.sub.2, . . . , Z.sub.n) is calculated according to the component weights and the spatial distance feature, where, Z.sub.i=(z.sub.i1, z.sub.i2, . . . z.sub.iC), i=1, . . . , N, the value of z.sub.ij depends on the spatial distance feature and component weight of the measuring point, in one embodiment, z.sub.ij=w.sub.j*Q.sub.i, C is the number of components in the division model of concrete dam operation key parts; the joint probability density of (X,X,Z) is calculated as

[00006]$P\left(X,\stackrel{\_}{X},Z.Math.\right)=\underset{i,j}{.Math.}{\left(w_j{f}_j\left(x_i,{}_j\right)w_j{f}_j\left({\stackrel{\_}{x}}_i,{}_j\right)\right)}^{z_{\mathrm{ij}}};$

the log-likelihood function of all data is calculated as:

[00007]$L\left(\right)=\underset{i=1}{\overset{N}{.Math.}}\underset{j=1}{\overset{C}{.Math.}}{z}_{\mathrm{ij}}\left(\log w_j+\log f_j\left(x_i,{}_j\right)+\log w_j{f}_j\left({\stackrel{\_}{x}}_i,{}_j\right)\right).$ [0088] Step c: an expectation maximization algorithm is applied to iteratively optimize and solve the parameters of the partition model of the concrete dam operation key parts;

[0089] The number C of model components and the mean and covariance matrix of each component are initialized, and make the component weight,

[00008]$w_j^{\left(k\right)}=\frac{1}{C},$

k=0; the expectation maximization algorithm is used to calculate the parameters of the division model of concrete dam operation key parts; after removing the k iteration, the division model of the concrete dam operation key parts with components with a component weight of 0, and k=k+1; steps 2-4 are repeated until the model converges, and the model parameters and component numbers of concrete dam operation key parts being iteratively optimized are get.

[0090] The applying the expectation maximization algorithm to calculate the parameters of the partition model of the concrete dam operation key parts includes: [0091] according to the current parameters, the posterior distribution .sub.ji of each sample x.sub.j belonging to each Gaussian mixture component is calculated; [0092] the parameters {(.sub.i, .sub.i, .sub.i)|1ik} are updated according to the posterior distribution:

[00009]${}_i=\frac{\underset{j=1}{\overset{m}{.Math.}}{}_{\mathrm{ji}}{x}_j}{\underset{j=1}{\overset{m}{.Math.}}{}_{\mathrm{ji}}}{}_i=\frac{\underset{j=1}{\overset{m}{.Math.}}{}_{\mathrm{ji}}\left(x_j-{}_i\right){\left(x_j-{}_i\right)}^T}{\underset{j=1}{\overset{m}{.Math.}}{}_{\mathrm{ji}}}{}_i=\frac{1}{m}\underset{j=1}{\overset{m}{.Math.}}{}_{\mathrm{ji}}$ [0093] Step d: the concrete dam operation key parts are divided by using the iteratively optimized the concrete dam operation key parts division model.

[0094] Based on the above embodiment, step S102 is described in detail in the embodiment.

[0095] The occurrence of abnormal operation of the concrete dam shows that the monitoring data of each indicator changes in time dimension. Therefore, for the monitoring data in the same time window, two graph structures are used to explicitly model the dependence of time and variable dimensions respectively. The details are as follows: [0096] (1) Variable feature graph. Before constructing the variable feature graph, it is necessary to randomly initialize a representation vector for each variable to reduce the decline in the accuracy of the model due to different data types and value ranges. In the hidden representation space composed of embedded vectors, the closer the vectors are, the more similar they are, and the stronger the correlation (that is, the correlation between different types of concrete dam safety monitoring instruments) between their corresponding variables is. Graph attention network needs data with explicit graph structure as input, so the graph structure is constructed by taking N variables in the input time window as N nodes. Firstly, the similarity relationship between nodes is calculated according to the initial representation vectors of nodes, and then the largest node pairs are selected, and the sparse directed graph structure is obtained after edge connection. The specific steps are as follows.

[0097] First, an embedding vector v.sub.i.sup.d, i{1, 2, . . . , N} is set for each variable, where d represents the dimension of the vector, and different values are set according to the actual situation. The initial value of the vector is given randomly, and the specific value is obtained by continuous adjustment through back propagation in the training process of the model. The correlation of variables can be calculated by embedding vectors, for variable i and variable j, the correlation is calculated by formula (1):

[00010]$\begin{array}{cc}{e}_{\mathrm{ji}}=f\left(v_i,v_j\right)=\frac{v_j^T{v}_j}{{\mathrm{Pv}}_{i}P.Math.{\mathrm{Pv}}_{j}P}& \left(1\right)\end{array}$ [0098] In the formula (1), f (v.sub.i,v.sub.j) is a method to arbitrarily calculating similarity, to construct a directed graph, it is necessary to use asymmetric similarity calculation method and cosine similarity to calculate similarity. After all variables are pairwise combined to calculate similarity, for any variable i, the top k neighbor variables j with the greatest similarity are selected, and i and j are connected by edges in the spatial graph, corresponding to the column where i is located in the spatial adjacency matrix A, which is expressed by formula (2):

[00011]$\begin{array}{cc}{A}_{\mathrm{ji}}=\{\begin{array}{cc}1& \mathrm{if}j\mathrm{TopK}\left(\left\{e_{\mathrm{ki}}:k\left\{1,2,.Math.,N\right\}\right\}\right)\\ 0& \mathrm{else}\end{array}& \left(2\right)\end{array}$

[0099] Where, the value of K can be given by the user according to the specific situation to adjust the sparsity of the graph. The adjacency matrix A can be given directly by the user when there is prior information about the graph structure. In some special scenarios, the adjacency matrix can be set to a matrix with all values of 1, that is, a fully connected graph can be constructed. [0100] (2) Time feature graph. In order to explicitly model the time information between data, the time feature graph in the input time window is constructed by similar steps to the above-mentioned variable feature graph. Time graph is different from variable graph in the setting of embedding vector and composition mode. In variable graph, embedding vectors is to reduce the influence of different variable data types and value ranges on model accuracy. In the time feature graph, besides assuming a corresponding embedding vector for each time point in the sliding window, it is also necessary to introduce Positional Encoding to represent the time and position differences of data. The embedding vector of each node is u.sub.i.sup.d, i{1, 2, . . . , }, The initial value of u.sub.i is also given randomly, and then the final representation is obtained through training and learning.

[0101] For the time series in the input sliding window, a position code p{right arrow over (e)}.sub.j.sup.(i) is given to the vector at any time stamp j, and is calculated by formula (3):

[00012]$\begin{array}{cc}p{\stackrel{.fwdarw.}{e}}_j^{\left(i\right)}={f\left(j\right)}^i:=\{\begin{array}{cc}\sin \left({}_k.Math.j\right),& \mathrm{if}i=2k,\\ \cos \left({}_k.Math.j\right),& \mathrm{if}i=2k+1\end{array}{}_k=\frac{1}{{1000}^{2k/d}}& \left(3\right)\end{array}$

[0102] In the formula, d is the dimension of position coding, which needs to be the same as the variable dimension of the current position, that is, d=N, and d needs to be a multiple of 2. Different from taking each variable as a node in the above variable feature graph, in order to construct an explicit time graph structure, it is necessary to take the data at each moment as a node in the graph. The specific form of position coding is calculated by formula (4):

[00013]$\begin{array}{cc}p{\stackrel{.fwdarw.}{e}}_j={\left[\begin{array}{c}\sin \left({}_1.Math.t\right)\\ \cos \left({}_1.Math.t\right)\\ \sin \left({}_2.Math.t\right)\\ \cos \left({}_2.Math.t\right)\\ .Math.\\ \sin \left({}_{N/2}.Math.t\right)\\ \cos \left({}_{N/2}.Math.t\right)\end{array}\right]}_{N1}& \left(4\right)\end{array}$

[0103] After assigning a position code to each time point, a time graph is constructed by calculating the similarity between embedding vectors at different time points. It it calculated by formula (5):

[00014]$\begin{array}{cc}{e}_{\mathrm{ji}}^{}=f\left(u_i,u_j\right)=\frac{u_i^T{u}_j}{.Math.u_i.Math..Math..Math.u_j.Math.}& \left(5\right)\end{array}$

[0104] The pairwise similarity between different time points shows the similarity degree between different timestamps. When constructing a time graph, similar to the above-mentioned variable graph, for data i with any time stamp, K neighbor time points j with the greatest similarity are selected and connected by edges, and the constructed time adjacency matrix is calculated by formula (6):

[00015]$\begin{array}{cc}{A}_{\mathrm{ji}}^{}=\{\begin{array}{cc}1& \mathrm{if}j\mathrm{TopK}\left(\left\{e_{\mathrm{ki}}^{}:k\left\{1,2,.Math.,\right\}\right\}\right)\\ 0& \mathrm{else}\end{array}& \left(6\right)\end{array}$

[0105] In the formula, A.sup., the value of K is also specified by the user, which is generally the same as the sparsity of the spatial adjacency matrix.

[0106] Based on the above embodiment, step S103 is described in detail in this embodiment:

[0107] After the construction of graph structure data, graph attention network is used to learn the information of time dimension and variable dimension. After learning, each node in the graph structure will get a final representation vector, which contains the information of the current node and its adjacent nodes. Graph attention layer includes parallel variable graph attention network and time graph attention network, which is used to capture the dependencies of different dimensions in data at the same time. At the same time, by improving the attention mechanism in the variable graph attention layer, the indicator correlation in the data is explicitly captured. The details are as follows: [0108] (1) Variable Graph Attention Network (F-GAT). The constructed variable feature graph is used as the input of F-GAT, and the information in the graph is further mined through the attention mechanism. First, assume that the feature of F-GAT in the l-layer is expressed as H.sup.l, and the initial input formula (7) is:

[00016]$\begin{array}{cc}{H}^0=\left(\hat{X}{W}_{\mathrm{in}}\right).Math..Math.V& \left(7\right)\end{array}$

[0109] In the formula, {circumflex over (X)}=[x.sub.t+1, x.sub.t+2, . . . , x.sub.t].sup.N is the input series with length at the time stamp t, W.sub.in.sup.d is the learnable transformation matrix of the input data, is the splicing operation, and V is the matrix formed by the node representation vectors.

[0110] The framework of F-GAT is shown in FIG. 2, which includes three modules: multi-head attention, intra-indicator attention and inter-indicator attention. The multi-head attention module mainly models the variable dependence between multivariate time series, and the intra-indicator attention and inter-indicator attention is used to capture the indicator correlation between different time series. Specifically, the intra-indicator attention correlation is the correlation of all measuring points under the same type of monitoring instrument. For example, the deformation monitoring project of concrete dam includes many types of monitoring instruments, such as normal vertical line, surface deformation observation, static leveling, seam gauge, etc., the range of intra-indicator attention refers to all the measuring points included in the monitoring instruments such as normal vertical line. The correlation of inter-indicator attention is the correlation of different types of monitoring instruments, for example, the deformation monitoring project of concrete dam includes many types of monitoring instruments such as normal vertical line, surface deformation observation, static leveling, seam gauge, etc. The range of inter-indicator attention is normal vertical line measuring point, surface deformation observation point, static leveling point, seam gauge and other types of monitoring instruments.

[0111] The multi-head attention module updates the feature representation of each node by aggregating the neighbor node information of the target node, and is calculated by formula (8):

[00017]$\begin{array}{cc}{h}_{{\mathrm{att}}_i}^{l+1}={.Math..Math.}_{s=1}^S\underset{j{N}_i}{.Math.}{}_{\mathrm{ij}}^{\mathrm{ls}}{W}_{\mathrm{att}}^{\mathrm{ls}}{h}_j^l& \left(8\right)\end{array}$

[0112] Where, h.sub.att.sub.i.sup.l+1 is the feature representation of the node i in the l+1 layer, is the splicing operation, S represents the number of attention heads, .sub.ij.sup.ls represents the attention score of node i and node j in the s attention head in the l layer, w.sub.off.sup.ls is the learnable weight matrix of the s attention head in the l layer, h.sub.j.sup.lH.sup.l is the feature representation of the node j in the l layer, and ={j|A.sub.ij>0} B is the set of neighbor nodes of node i in the adjacency matrix A representing the variable feature graph above. The attention score is calculated by formulas (8), (9) and (10):

[00018]$\begin{array}{cc}{}_{\mathrm{ij}}^{\mathrm{ls}}=\mathrm{attention}\left(i,j\right)=\frac{\exp \left(\left(i,j\right)\right)}{\underset{kN\left(i\right).Math.\left\{i\right\}}{.Math.}\exp \left(\left(i,k\right)\right)}& \left(9\right)\\ \left(i,j\right)=\mathrm{LeakyReLU}\left(a^T\left(g_i^{\mathrm{ls}}.Math..Math.g_i^{\mathrm{ls}}\right)\right)& \left(10\right)\\ g_i^{\mathrm{ls}}=v_i.Math..Math.W_{\mathrm{att}}^{\mathrm{ls}}{h}^l& \left(11\right)\end{array}$

[0113] Where, a.sup.T is a learnable bias vector, is a concatenation operation, and LeakyReLU is a nonlinear activation function.

[0114] The traditional graph attention network fails to consider the indicator correlation of multivariate time series, so it loses some important information of variable dimension. Neighboring nodes with different dependencies have different influences on the central node. In this section, by adding two relational attention modules, namely, intra-indicator attention and inter-indicator attention, the effectiveness of the model in modeling the dependence of variables between series is improved. The adjacency matrix of intra-indicator attention diagram and inter-indicator attention diagram is defined by formulas (12) and (13):

[00019]$\begin{array}{cc}{A}_{\mathrm{intra}}^{\mathrm{ij}}=\{\begin{array}{c}1,j{C}_{\mathrm{intra}}^i\\ 0,\mathrm{else}\end{array}& \left(12\right)\\ A_{\mathrm{inter}}^{\mathrm{ij}}=\{\begin{array}{c}1,j{C}_{\mathrm{inter}}^i\\ 0,\mathrm{else}\end{array}& \left(13\right)\end{array}$

[0115] Where, C.sub.intra.sup.l={j|m.sub.i=m.sub.j} and C.sub.i.sup.inter={j|m.sub.im.sub.j} are the candidate sets, that is, C.sub.intra.sup.i represents node that belong to the same indicator as node i, and C.sub.i.sup.inter represents node that have different monitoring indicators from node i. It should be noted that when |C.sub.intra.sup.i|>K or |C.sub.i.sup.inter|>K, the adjacency matrix needs to be constructed using the TopK operation to select the indicator of the top K maximum cosine similarity.

[0116] Then, the multi-indicator correlations between different time series are clearly captured by two relational attention modules. The feature of the intra-indicator attention module is calculated by formula (14), formula (15) and formula (16):

[00020]$\begin{array}{cc}{h}_{{\mathrm{intra}}_i}^{l+1}=\underset{j{}_{{\mathrm{intra}}_i}}{.Math.}{}_{{\mathrm{intra}}_i}^{\mathrm{lj}}{W}_{\mathrm{intra}}^l{h}_j^l& \left(14\right)\\ {}_{{\mathrm{intra}}_i}^{\mathrm{lj}}=\frac{\exp \left(g_{{\mathrm{intra}}_i}^{\mathrm{lj}}\right)}{\underset{j{}_{{\mathrm{intra}}_i}}{.Math.}\exp \left(g_{{\mathrm{intra}}_i}^{\mathrm{lk}}\right)}& \left(15\right)\\ g_{{\mathrm{intra}}_i}^{\mathrm{lj}}=\left(\mathrm{ReLU}\left(\left(v_i.Math..Math.v_j\right)W_{\mathrm{intra}1}^l+b_{\mathrm{intra}1}^l\right)W_{\mathrm{intra}2}^l\right)& \left(16\right)\end{array}$

[0117] In the formula, h.sub.intra.sub.i.sup.l+1, is the feature representation of node i at the l+1-layer, ={j|A.sub.intra.sup.ij>0} is the set of intra-indicator neighbor nodes of node i, .sub.intra.sub.i.sup.lj, is the attention scores of node i and node j at the l-layer, W.sub.intra.sup.l, W.sub.intra1.sup.l and W.sub.intra2.sup.l are the weight matrices of the l-layer, and b.sub.intra1.sup.l is the bias vector of the l-layer. Similarly, the feature representation h.sub.intra.sub.i.sup.l+1 of the inter-indicator attention module can be calculated, and ={j|A.sub.intra.sup.ij>0} is the inter-indicator neighbor node set of node i. The final output h.sub.i.sup.l+1 of the variable graph attention layer is obtained by splicing the inputs of three attention modules, and is calculated by formulas (17) and (18):

[00021]$\begin{array}{cc}{h}_i^{l+1}=\mathrm{ReLU}\left(W_{\mathrm{out}}^{l+1}{o}_i^{l+1}+b_{\mathrm{out}}^{l+1}\right)& \left(17\right)\\ o_i^{l+1}=h_{{\mathrm{att}}_i}^{l+1}.Math.h_{{\mathrm{intra}}_i}^{l+1}.Math.h_{{\mathrm{inter}}_i}^{l+1}& \left(18\right)\end{array}$

[0118] In the formula, h.sub.i.sup.l+1 is the final representation of node i at the l+1 layer, W.sub.out.sup.l+1 is the weight matrix of the l+1 layer, b.sub.out.sup.l+1 is the offset vector of the l+1 layer, is the splicing operation, and of o.sub.i.sup.l+1 is obtained by splicing the intermediate feature h.sub.att.sub.i.sup.l+1, h.sub.intra.sub.i.sup.l+1, and h.sub.inter.sub.i.sup.l+1 at the l+1 layer. [0119] (2) Time graph attention network (T-GAT). Assume that Z is the feature representation of T-GAT in l layer, and the initial input of T-GAT is z.sup.0=({circumflex over (x)}.sub.in)U, where W.sub.in.sup.d is the learnable transformation matrix of input data and U is the matrix composed of node feature vectors. The time graph attention layer takes the above-mentioned time graph structure as input, combines the position coding, and uses the multi-head attention module to aggregate the information of neighboring nodes to update the feature representation of each time point, and calculates by formula (19):

[00022]$\begin{array}{cc}{z_i^{l+1}=.Math.}_{s=1}^S\underset{j\left(i\right).Math.\left\{i\right\}}{.Math.}{}_{\mathrm{ij}}^{{\mathrm{ls}}^{}}{W}_{\mathrm{att}}^{{\mathrm{ls}}^{}}p\stackrel{.fwdarw.}{e_j}{z}_j^l& \left(19\right)\end{array}$

[0120] In the formula, z.sub.i.sup.l+1 is the feature representation of node i in the l+1 layer, is the splicing operation, S represents the number of attention heads, ={j|A.sub.ij>0} is the set of neighbor nodes of node i in the adjacency matrix A of the time graph above, .sub.ij.sup.ls is the attention fraction of node i and node j at the s attention head in the l layer, and W.sub.att.sup.ls is the weight matrix of the s attention head in the l layer, z.sub.j.sup.tZ.sup.l is the feature representation of node j at the l layer, and the calculation steps of .sub.ij.sup.lz are similar to the above steps of .sub.ij.sup.ls, which can be calculated by formulas (20), (21) and (22):

[00023]$\begin{array}{cc}{}_{\mathrm{ij}}^{{\mathrm{ls}}^{}}=\frac{\exp \left(\left(i,j\right)\right)}{\underset{k\left(g\right).Math.\left\{i\right\}}{.Math.}\exp \left(\left(i,k\right)\right)}& \left(20\right)\\ \left(i,j\right)=\mathrm{LeakyReLU}\left(a^T\left(c_i^{\mathrm{ls}}.Math..Math.c_j^{\mathrm{ls}}\right)\right)& \left(21\right)\\ c_i^{\mathrm{ls}}=u_i.Math..Math.W_{\mathrm{att}}^{{\mathrm{la}}^{}}p{\stackrel{.fwdarw.}{e}}_i{z}^l& \left(22\right)\end{array}$

[0121] In the formula, .sub.ij.sup.ls represents the attention fraction of node i and node j at the s attention head in the l layer of the time graph, w.sub.att.sup.ls is the learnable weight matrix of the s attention head in the l layer of the time graph attention module, a.sup.T is the learnable bias vector, is the splicing operation, and LeakyReLU is the nonlinear activation function.

[0122] Based on the above embodiment, step S104 is described in detail in this embodiment:

[0123] The output of the variable graph attention network is a N dimensional matrix, and one row of the matrix represents the relationship between a node in the variable feature graph and its neighboring nodes captured by the graph attention network. Similarly, the output of the time graph attention network is a N dimensional matrix. The output of two graph attention layers is spliced with the original time series data to form a 3N dimensional matrix, and one row of the matrix represents a 3N dimensional feature vector with a timestamp in the input time window. Finally, the 3N dimensional matrix is used as the input of the Gated Convolution Network (GRU), GRU, as a variant of circular convolution network, can capture the series pattern information in the data well and get the target feature.

[0124] Based on the above embodiment, step S105 is described in detail in the embodiment: [0125] the target feature is inputted into a prediction module and a reconstruction module to obtain a prediction value and a reconstruction probability, and the anomaly score is calculated according to the prediction value and the reconstruction probability, the details are as follows:

[0126] In order to take advantage of both reconstruction-based and prediction-based models, the loss function of MTS-GAT contains two objectives: capturing the distribution of the whole input data in the reconstruction module and accurately predicting the value at the next timestamp in the prediction module. The input of the reconstruction module and the prediction module at time t is the output of X.sub.XGRU. The loss function of joint optimization is defined by formula (23):

[00024]$\begin{array}{cc}={}_1{}_{\mathrm{rec}}+\left(1-{}_1\right){}_{\mathrm{pred}}& \left(23\right)\end{array}$

[0127] Where, is the loss function of the reconstruction module, is the loss function of the prediction module, and .sub.1 is the hyperparameter that balances the weights of the two modules.

[0128] The prediction module uses to predict the observed value at the next time stamp. In this section, Multilayer Perceptron (MLP) is used as the prediction module, and the loss function is defined by formula (24):

[00025]$\begin{array}{cc}{}_{\mathrm{pred}}=\sqrt{\underset{i=1}{\overset{N}{.Math.}}{\left(x_{i,t+1}-{\hat{x}}_{i,+1}\right)}^2}& \left(24\right)\end{array}$ [0129] In the formula, x.sub.i,t+1 is the measured value at t+1 time of the i time series, and {circumflex over (x)}.sub.i,t+1 is the predicted value at t+1 time of the i series.

[0130] The reconstruction module is to learn the reconstruction probability of the input data. In order to enhance the robustness of the model, two discriminators D.sub.E() and D.sub.D() are used for adversarial training of autoencoder G.sub.A as a reconstruction-based model. The encoder G.sub.E() and the decoder G.sub.D() of G.sub.A can be regarded as two generators. The model is shown in FIG. 3, for a given input , z is the potential representation of the autoencoder, p(z) represents the prior distribution of z, and the posterior distribution q(z) generated by the autoencoder in the potential space is calculated by formula (25):

[00026]$\begin{array}{cc}q\left(z\right)={}_{x_t}q\left(z.Math.{}_t\right)p_d\left({}_t\right)d{}_t& \left(25\right)\end{array}$

[0131] In the formula, q(z|) represents the code distribution, and p.sub.d() represents the input data distribution. The countermeasure network D.sub.E() is used to adjust the posterior distribution q(z) to satisfy the prior distribution p(z), that is, the loss function is maximized, which is calculated by formula (26):

[00027]$\begin{array}{cc}{}_{D_E}={}_{z.Math.p\left(z\right)}\left[\log \left(D_E\left(z\right)\right)\right]+{}_{{}_t.Math.p_d\left({}_t\right)}\left[\log \left(1-D_E\left(G_E\left({}_t\right)\right)\right)\right]& \left(26\right)\end{array}$

[0132] The corresponding generator G.sub.E() mixes D.sub.E(), that is, the loss function minimized, and is calculated by formula (27):

[00028]$\begin{array}{cc}{}_{G_E}={}_{{}_t{p}_d\left({}_t\right)}\left[\log \left(1-D_E\left(G_E\left({}_t\right)\right)\right)\right]& \left(27\right)\end{array}$

[0133] Similarly, the countermeasure network D.sub.D() avoids the over-fitting problem of the model by increasing the difference between the input data and the reconstructed data, that is, the loss function is maximized, and is calculated by formula (28):

[00029]$\begin{array}{cc}{}_{D_E}={}_{{}_t{p}_d\left({}_t\right)}\left[\log \left(D_D\left({}_t\right)\right)+\log \left(1-D_D\left(G_A\left({}_t\right)\right)\right)\right]& \left(28\right)\end{array}$

[0134] The corresponding generator G.sub.D() needs to minimize the loss function , which is calculated by formula (29):

[00030]$\begin{array}{cc}{}_{G_D}={}_{{}_t{p}_d\left({}_t\right)}\left[\log \left(1-D_D\left(G_A\left({}_t\right)\right)\right)\right]& \left(29\right)\end{array}$

[0135] The reconstruction of the input data is represented as =G.sub.D(G.sub.E()). Finally, and are used as anti-regularization to ensure the robustness of the reconstructed model, and the loss function of the reconstructed model is defined by formulas (30) and (31):

[00031]$\begin{array}{cc}{}_{\mathrm{rec}}={}_r+{}_{G_E}+{}_{G_D}& \left(30\right)\\ {}_r={}_{{}_t{p}_d\left({}_t\right)}{.Math.{}_t-G_A\left({}_t\right).Math.}_1& \left(31\right)\end{array}$

[0136] Where, represents reconstruction loss.

[0137] For the i univariate time series, at any time stamp t, the prediction module generates the prediction value {circumflex over (x)}.sub.i, and the reconstruction module generates the reconstruction probability p.sub.i. The final abnormal score for each timestamp balances the weight of the two modules by formula (32):

[00032]$\begin{array}{cc}\mathrm{score}=\underset{i=1}{\overset{N}{.Math.}}\frac{\left(1-p_i\right)+{{}_2\left(x_i-{\hat{x}}_i\right)}^2}{1+{}_2}& \left(32\right)\end{array}$

[0138] In the formula, x.sub.l is the measured value, and .sub.2 is the hyperparameter for balancing the two modules. In the anomaly detection stage, when the anomaly score of a timestamp is greater than the given anomaly threshold, the timestamp is marked as abnormal timestamp, otherwise it is normal timestamp. The selection of abnormal threshold is made on the verification set by the peaks-over-threshold (POT) algorithm.

[0139] Based on the above embodiment, FIG. 4 is the framework of the multi-indicator graph attention network model of the concrete dam key parts provided by an embodiment of the disclosure, and the specific model may include: [0140] a data acquisition module is configured for obtaining the time series measurement data of monitoring instruments with different types in concrete dam structure monitoring; [0141] a feature graph construction module is configured for establishing graph structures on the time series measurement data in a time dimension and a variable dimension respectively to obtain a time feature graph and a variable feature graph; [0142] an attention mechanism module is configured for inputting the time feature graph and the variable feature graph into a time graph attention network and a variable graph attention network respectively to obtain a time attention matrix and a variable attention matrix; [0143] a target feature acquisition module is configured for splicing and inputting the time series measurement data, the time attention matrix and the variable attention matrix into a gated convolution network to obtain a target feature; [0144] an anomaly detection module configured for calculating an abnormal score according to the target feature, where the anomaly detection module judges a concrete dam operation being abnormal if the abnormal score exceeds a preset threshold.

[0145] The partition monitoring model for the concrete dam operation key parts in the embodiment is used to realize the above-mentioned partition monitoring method for concrete dam operation key parts. Therefore, the specific implementation of the partition monitoring model for concrete dam operation key parts can be seen in the embodiment of the partition monitoring method for concrete dam operation key parts mentioned above. For example, data acquisition module, feature graph construction module, attention mechanism module, target feature acquisition module, and anomaly detection module are respectively used to realize steps S101, S102, S103, S104 and S105 in the above-mentioned partition monitoring method for the concrete dam operation key parts. Therefore, the specific implementation can refer to the corresponding descriptions of each part of the embodiments, and will not be repeated here.

[0146] The embodiment firstly extracts the structure monitoring data time-frequency vector of concrete dam and establishes the monitoring data time-frequency vector space-time matrix of concrete dam. Then, combined with the typical time-frequency vectors of structural monitoring data identified in real time, a key part partition method based on data time-frequency vectors is proposed to dynamically divide the concrete dams key parts. On this basis, the arch crown beam area on the upper part of the dam body is selected, including the dam body with the elevation from 1190 m to 1245 m from the 19 #dam section to the 25 #dam section. Four types of monitoring instruments, such as normal vertical line, surface deformation observation point, static level and seam gauge, are arranged in this key part to monitor the deformation effect. The normal vertical line and surface deformation observation points include C4-A19-PL-0102, C4-A22-PL-0102, C4-A25-PL-0102, C4-A19A25-TP-01 and C4-A19A25-TP-02, totally 20 measuring points, which are use for monitoring that horizontal radial and tangential displacements of the part. Static level includes 7 measuring points, that is, 1245-SL4-0309, which are used to monitor the vertical displacement of the part. The seam gauge includes 10 measuring points, that is, C4-A19-J-33, C4-A25-J-31, C4-A22-KZ-J-0409, which are used to monitor the opening and closing degree of the transverse seam in this part and the opening and closing degree of the seam-crossing area where the seismic reinforcement is laid on the upstream and downstream surfaces.

[0147] On the basis of preprocessing the original measured data, firstly, four kinds of monitoring instruments and six kinds of monitoring data used in the experiment are fitted (normal vertical line, radial displacement and tangential displacement of surface deformation observation points are regarded as one kind of data respectively). The data time series spans from Jan. 1 to Dec. 31, 2021, so 365 time stamps are set in total. Typical monitoring data process lines are shown in FIG. 5 to FIG. 7.

[0148] Through model training, it is found that the horizontal tangent displacement monitoring data of two measuring points (C4-A22-PL-01 and C4-A22-PL-02) of the normal vertical line of dam section 22 and the transverse seam opening and closing degree monitoring data of 7 measuring points of the seam gauge C4-A22-KZ-J-05 have 13 times of high abnormal scores. As shown in FIGS. 8A, 8B and FIGS. 9A, 9B, the red vertical lines in the figures are marked with 13 abnormal time stamps, which are the monitoring data of Mar. 26, Mar. 27, Mar. 28, Mar. 29, Mar. 30, Mar. 31, Apr. 2, Apr. 3, May 27, May 28, Aug. 25 and Aug. 26, 2021 respectively. After docking with the operation log of the on-site monitoring system, it is found that the top eight abnormal timestamps (that is, from March 26th to April 3rd) is due to the lack of monitoring data caused by the failure of the automatic monitoring acquisition module before March 2021, which leads to the change of measured values being identified and the anomaly score being high, and the detection result is abnormal. The next five abnormal timestamps (that is, from May 27 to May 28, and from August 24 to August 26), on the basis of excluding the data anomalies due to the failure of the monitoring system, analyze the reasons for the anomalies as follows: during the period from May 21 to Jun. 1, and from Aug. 20 to Aug. 30, 2021, two earthquakes with the maximum magnitude of 6.4 and the maximum magnitude of 3.6 occurred in Yangbi County, Yunnan Province, respectively, there are many aftershocks in the next 10 days. The abnormal score of the monitoring data of the concrete dam caused by special working conditions is too large and is recognized as abnormal. From FIGS. 8A, 8B and FIGS. 9A, 9B, it can be seen that there are apparent changes on May 27 and May 28.

[0149] After determining the abnormal time points of monitoring data, all the monitoring data in the upper area of the arch crown beam from May 27 to May 28 are selected to establish a similarity matrix, and the correlation between abnormal measuring points is further analyzed. As shown in FIG. 10, the horizontal axis and the vertical axis are all measuring points, representing the correlation between two measuring points, which is expressed by similarity, and the range of values is [0, 1], where 0 represents complete dissimilarity, 1 represents complete similarity, and the color depth represents the level of similarity. It can be seen that there are relatively few squares with dark colors in the figures, indicating that most deformation measuring points do not appear abnormal from May 27 to May 28, so it can be judged that the deformation behavior of this key part is normal.

[0150] The specific embodiment of the disclosure also provides a partition monitoring apparatus for the concrete dam operation key parts, including: a memory for storing computer programs; a processor for implementing the steps of the partition monitoring method for the concrete dam operation key parts when executing the computer program.

[0151] The specific embodiment of the disclosure also provides a computer-readable storage medium, on which a computer program is stored, when the computer program is executed by a processor, the steps of the above-mentioned partition monitoring method for the concrete dam operation key parts are realized.

[0152] It should be understood by those skilled in the art that embodiments of the disclosure can be provided as a method, a system, or a computer program product. Therefore, the disclosure can take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the disclosure may take the form of a computer program product implemented on one or more computer usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) having computer usable program codes embodied therein.

[0153] The disclosure is described with reference to flowcharts and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the disclosure. It should be understood that each flow and/or block in the flowchart and/or block diagram, and combinations of the flow and/or block in the flowchart and/or block diagram can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor or other programmable data processing apparatus to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing apparatus produce device for implementing the functions specified in one flowchart or flowcharts and/or one block or blocks.

[0154] These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction device that implement the functions specified in one flowchart or flowcharts and/or one block or blocks.

[0155] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus, such that a series of operational steps are performed on the computer or other programmable apparatus to produce a computer-implemented process, such that the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one flowchart or flowcharts and/or one block or blocks.

[0156] Apparently, the above-mentioned embodiment is only an example for clear explanation, not a limitation of the implementation. For those skilled in the art, other changes and variants in different forms can be made on the basis of the above description. It is not necessary and impossible to exhaust all the embodiments here. However, the apparent changes or variants caused by this are still within the scope of protection created by the disclosure.