Basin information service architecture construction method and device, computer equipment and product

Abstract

The invention relates to the technical field of watershed information, and discloses a watershed information service architecture construction method and device, computer equipment and a product, and the watershed information service architecture construction method comprises the steps: extracting keywords from a watershed scene file, and obtaining a watershed scene; extracting a plurality of keywords from the drainage basin service file to obtain a plurality of service nodes; performing clustering analysis on the plurality of service nodes to obtain a drainage basin service domain; for each drainage basin service domain, dividing the service nodes into a drainage basin first-level service process and a drainage basin second-level service process based on the correlation between the service nodes in the service node set; and constructing a drainage basin information service tree by taking the drainage basin scenery as a root node, taking the drainage basin service domain as a child node of the drainage basin scenery, taking the drainage basin primary service process as a child node of the drainage basin service domain and taking the drainage basin secondary service process as a child node of the drainage basin primary service process. The drainage basin information service management efficiency can be improved.

Description

Technical Field

[0001] The present invention relates to the field of watershed information technology, and in particular to a method, device, computer equipment and product for constructing a watershed information business architecture. Background Art

[0002] In the watershed information model, the business architecture (BA) is a structured expression of the watershed business, which can comprehensively cover the watershed business scope, connect the watershed strategy with the actual operation, and provide support for the subsequent architecture.

[0003] At present, the scale, relevance and complexity of river basin informatization construction are gradually increasing. However, the existing river basin information is scattered and difficult to couple. The unreasonable business architecture is not convenient for the operation and management of river basin business, resulting in low efficiency in river basin information business management. Summary of the invention

[0004] In view of this, the present invention provides a method, device, computer equipment and product for constructing a watershed information service architecture to improve the efficiency of watershed information service management.

[0005] In a first aspect, the present invention provides a method for constructing a watershed information business architecture, which includes: extracting keywords from a watershed vision file to obtain a watershed vision; extracting multiple keywords from a watershed business file to obtain multiple business nodes; performing cluster analysis on multiple business nodes to obtain multiple groups of business node sets, identifying the business activities of each business node set, and obtaining corresponding watershed business domains; for each watershed business domain, based on the correlation between each business node in the business node set, dividing the business nodes into watershed-level business processes and watershed-level business processes; constructing a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed-level business process as the child node of the watershed business domain, and the watershed-level business process as the child node of the watershed-level business process.

[0006] In this implementation, the problem of constructing the watershed information business architecture is transformed into the problem of constructing the watershed information business tree. Based on the watershed vision, the research objectives of watershed information can be clarified; the business nodes are divided through watershed business to achieve clear resource allocation and department division; based on the watershed business domain, the business nodes in the watershed business domain are analyzed for relevance, which can efficiently organize the business nodes in the watershed business domain. By using the watershed vision, watershed business domain, watershed first-level business process and watershed second-level business process to construct the watershed information business tree in a hierarchical manner, a clear hierarchical relationship can be obtained, similar businesses can be merged and unified for management, and business management efficiency can be effectively improved, resource waste can be reduced, and duplication of work can be reduced.

[0007] In an optional implementation, for each watershed business domain, based on the correlation between each business node in the business node set, the business nodes are divided into watershed-level business processes and watershed-level business processes, including: for each watershed business domain, based on the correlation between each business node in the business node set, a business domain graph connecting all business nodes is generated; based on the degree of correlation of the business nodes, the business domain graph is converted into a maximum spanning tree containing all business nodes; the watershed-level business processes and the watershed-level business processes are divided from the maximum spanning tree according to the business ratio, and the business ratio is the ratio of the number of watershed-level business processes to the number of watershed-level business processes; the edges connecting the watershed-level business processes are deleted in the maximum spanning tree to obtain multiple groups of connected watershed-level business processes and watershed-level business processes.

[0008] In an optional embodiment, based on the correlation between each business node in the business node set, a business domain graph connecting all business nodes is generated, including: counting the frequency of every two business nodes appearing in the same flow domain business file; if the frequency of two business nodes is greater than zero, the two business nodes are connected, and the frequency is used as the edge weight to generate a business domain graph.

[0009] In this implementation, the frequency of simultaneous occurrence of business nodes is used as data reflecting the association relationship between business nodes. The data is easy to obtain and a business process diagram that accurately represents the association relationship between business nodes can be generated.

[0010] In an optional implementation, based on the relevance of the business nodes, converting the business domain graph into a maximum spanning tree containing all business nodes includes: selecting a business node ki with the largest edge weight in the business domain graph, selecting a business node kj with the largest edge weight connected to the business node ki, and adding the business node ki, the business node kj and the edge (ki, kj) to the spanning tree; for the business nodes in the spanning tree, repeatedly selecting a business node with the largest connected edge weight until all business nodes are added to the spanning tree to obtain a maximum spanning tree.

[0011] In this implementation, based on the business process diagram, the association relationship between business nodes is further evaluated according to the frequency, the business process diagram is simplified, the tree relationship between business nodes is clarified, and a maximum spanning tree that accurately represents the association relationship between business nodes can be generated.

[0012] In an optional implementation, dividing the first-level business process of the watershed and the second-level business process of the watershed from the maximum spanning tree according to the business ratio includes: obtaining the number of businesses of the business nodes in the business node set; determining a first number of the first-level business processes of the watershed based on the business ratio; calculating the degree of each business node in the maximum spanning tree, calculating the sum of the edge weights connected to each business node, and calculating the contribution of each business node based on the product of the degree and the sum of the edge weights; sorting the business nodes according to the contribution, selecting the first number of business nodes with the largest contribution as the first-level business processes of the watershed, and the other business nodes as the second-level business processes of the watershed.

[0013] In this implementation, the frequency of occurrence and the number of connected business nodes are used as data to evaluate the association between business nodes, and the business nodes are divided into basin-level business processes and basin-level business processes. The division problem of basin-level business processes and basin-level business processes is converted into an application tree clustering problem, which can clarify the hierarchical relationship between business nodes.

[0014] In an optional implementation, the watershed vision is taken as the root node, the watershed business domain is taken as the child node of the watershed vision, the watershed first-level business process is taken as the child node of the watershed business domain, and the watershed second-level business process is taken as the child node of the watershed first-level business process. The watershed information business tree is constructed, including: taking the watershed vision as the root node, and taking multiple watershed business domains as child nodes of the watershed vision; for each watershed business domain, taking the watershed first-level business process in the corresponding business node set as the child node of the watershed business domain; for each watershed first-level business process, taking the directly or indirectly connected watershed second-level business process as the child node of the watershed first-level business process, to construct the watershed information business tree.

[0015] In this implementation method, the problem of building the watershed information business architecture is transformed into the problem of constructing the watershed information business tree. Based on the watershed vision, the watershed is divided according to the watershed business, and the levels of business nodes are divided according to the correlation between business nodes. A hierarchical watershed information architecture is generated to achieve unified organizational management of similar businesses and coordinated scheduling and management of highly related businesses, thereby improving business management efficiency. This can better support the construction of digital twin watersheds, identify and solve complex problems in watershed management.

[0016] In a second aspect, the present invention provides a device for constructing a watershed information business architecture, which includes: a watershed vision extraction module, which is used to extract keywords from a watershed vision file to obtain a watershed vision; a business node extraction module, which is used to extract multiple keywords from a watershed business file to obtain multiple business nodes; a watershed business domain extraction module, which is used to perform cluster analysis on multiple business nodes to obtain multiple groups of business node sets, identify the business activities of each business node set, and obtain the corresponding watershed business domain; a business node division module, which is used to divide the business nodes into watershed-level business processes and watershed-level business processes for each watershed business domain based on the correlation between each business node in the business node set; a business tree construction module, which is used to construct a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed-level business process as the child node of the watershed business domain, and the watershed-level business process as the child node of the watershed-level business process.

[0017] In a third aspect, the present invention provides a computer device, comprising: a memory and a processor, the memory and the processor are communicatively connected to each other, computer instructions are stored in the memory, and the processor executes the method for constructing a watershed information business architecture according to the first aspect or any corresponding embodiment thereof by executing the computer instructions.

[0018] In a fourth aspect, the present invention provides a computer-readable storage medium having computer instructions stored thereon, the computer instructions being used to enable a computer to execute the method for constructing a watershed information business architecture according to the first aspect or any corresponding embodiment thereof.

[0019] In a fifth aspect, the present invention provides a computer program product, comprising computer instructions for causing a computer to execute the method for constructing a watershed information service architecture according to the first aspect or any corresponding embodiment thereof. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] In order to more clearly illustrate the specific implementation methods of the present invention or the technical solutions in the prior art, the drawings required for use in the specific implementation methods or the description of the prior art will be briefly introduced below. Obviously, the drawings described below are some implementation methods of the present invention. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0021] Figure 1 is a flow chart of a method for constructing a watershed information service architecture according to an embodiment of the present invention; Figure 2 is a schematic diagram of a watershed information service architecture according to an embodiment of the present invention; Figure 3is a flowchart of another method for constructing a watershed information service architecture according to an embodiment of the present invention; Figure 4 is a schematic diagram of a business domain diagram according to an embodiment of the present invention; Figure 5 is a schematic diagram of a maximum spanning tree according to an embodiment of the present invention; Figure 6 is a schematic diagram of adjusting a spanning tree according to an embodiment of the present invention; Figure 7 is a structural block diagram of a device for constructing a watershed information service architecture according to an embodiment of the present invention; Figure 8 It is a schematic diagram of the hardware structure of a computer device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0022] In order to make the purpose, technical solution and advantages of the embodiments of the present invention clearer, the technical solution in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative work are within the scope of protection of the present invention.

[0023] The watershed information model of this application includes business architecture, data architecture, application architecture, technical architecture, security architecture, etc. The watershed information business architecture can provide business guidance and contextual watershed information for other architectures such as watershed information data architecture, application architecture, technical architecture, security architecture, etc. The watershed information business architecture can drive the data architecture and application architecture.

[0024] Therefore, a reasonable watershed information business architecture can reduce resource waste, reduce duplication of work, increase cross-departmental collaboration, and improve business management efficiency.

[0025] According to an embodiment of the present invention, an embodiment of a method for constructing a watershed information business architecture is provided. It should be noted that the steps shown in the flowchart of the accompanying drawings can be executed in a computer system such as a set of computer executable instructions, and although a logical order is shown in the flowchart, in some cases, the steps shown or described can be executed in an order different from that shown here.

[0026] In this embodiment, a method for constructing a watershed information service architecture is provided. Figure 1 is a flow chart of a method for constructing a watershed information service architecture according to an embodiment of the present invention. It should be noted that if there are substantially the same results, this embodiment is not based on Figure 1 The process sequence shown is limited. Figure 1 As shown, the process includes the following steps: Step S101, extracting keywords from the watershed vision file to obtain the watershed vision.

[0027] Among them, the basin vision documents include national policy documents, legal and regulatory documents, news documents, corporate planning documents and historical research report documents related to basin data and information.

[0028] Collect various watershed vision documents, use keyword extraction algorithm to extract keywords from the watershed vision documents, and obtain the watershed vision.

[0029] Among them, the keyword detection algorithm can be one or more of the TF-IDF (term frequency–inverse document frequency) algorithm, the LDA (Latent Dirichlet Allocation) algorithm, the TextRank algorithm, the KeyBERT algorithm, etc.

[0030] In one implementation, the TF-IDF algorithm is used to extract keywords from the watershed vision document. TF-IDF is a weighted technology used for information retrieval and text mining. The TF-IDF algorithm is used to evaluate the importance of a word to a watershed vision document, and the most important keyword is extracted as the watershed vision.

[0031] In a specific example, the basin vision can ensure the quality and quantity of the project, the safety of life and property, the improvement of power generation efficiency, ecological and environmental protection, sustainable use of water resources, shipping safety, and the reasonable resettlement of immigrants.

[0032] Step S102: extract multiple keywords from the watershed service file to obtain multiple service nodes.

[0033] Among them, the watershed business files include system architecture design files, workflow diagram files, performance evaluation report files, data flow diagram files, etc. related to the watershed business.

[0034] Collect a variety of watershed business files, use keyword extraction algorithm to extract multiple keywords from the watershed business files, and obtain multiple business nodes.

[0035] In one implementation, a TF-IDF algorithm is used to extract multiple keywords k1, k2, ..., kn with high importance from the watershed service files as service nodes.

[0036] Step S103 , cluster analysis is performed on multiple service nodes to obtain multiple groups of service node sets, and the service activities of each service node set are identified to obtain corresponding watershed service domains.

[0037] A clustering algorithm is used to perform cluster analysis on multiple business nodes, identify business nodes with similar business activities among the multiple business nodes, and obtain multiple business node sets ds1, ds2, ..., dsm with similar business activities.

[0038] Furthermore, the business activities corresponding to each business node set are identified to obtain the flow domains d1, d2, ..., dm of the business node set.

[0039] Specifically, the 2-3 words with the highest frequency of occurrence in the service node set are identified, and the 2-3 words are combined to form the name of the watershed service domain. In the actual application process, the word order of each word can be adjusted with manual assistance or artificial intelligence assistance to obtain the name of the watershed service domain with a reasonable word order.

[0040] In a specific example, the watershed business domain may be water conservancy project construction, flood control and drought relief, hydropower generation, ecological and environmental protection, water administration, shipping and transportation, and immigration management.

[0041] Step S104: for each watershed service domain, based on the correlation between each service node in the service node set, the service nodes are divided into watershed primary service processes and watershed secondary service processes.

[0042] Consider the correlation between business nodes in each watershed business domain respectively, and take a preset number of business nodes with the greatest correlation with other business nodes as the first-level business process of the watershed, and take a preset number of business nodes with the greatest correlation with the first-level business process of the watershed as the second-level business process of the watershed corresponding to the first-level business process of the watershed.

[0043] In a specific example, the basin-level business processes can be basin environmental assessment, investment decision-making planning, design and technical management, fund management and fundraising, supervision and evaluation management, water situation forecast, water disaster warning, water situation rehearsal, emergency plan, pumped storage, hydropower, water-wind-solar multi-energy complementary power generation, tidal power generation, water environment monitoring, water pollution, water ecological protection, comprehensive management, water resources management, water resources protection, river and lake management, administrative licensing services, supervision and law enforcement, safety management, maritime supervision, waterway maintenance, dispatching and command, anchorage management, policy formulation guidance, fund management compensation, resettlement planning implementation, supervision and evaluation, industrial development, etc.

[0044] The secondary business processes of the river basin can be engineering construction control, bidding and procurement, construction implementation, delivery and commissioning, early warning monitoring and risk investigation, flood storage and detention area utilization, reservoir safety during the flood season, emergency response and rescue, weather forecasting, power generation and dispatching, power distribution and sales, water resource protection and utilization, water environment impact assessment, soil and water conservation, sand mining management, communication and information security, ship lock and ship lift operation and maintenance, population relocation, employment placement, social security, infrastructure construction, etc.

[0045] Step S105, construct a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed first-level business process as the child node of the watershed business domain, and the watershed second-level business process as the child node of the watershed first-level business process.

[0046] Take a river basin vision as the root node and multiple river basin business domains as child nodes of the river basin vision. For each river basin business domain, take the river basin-level business process in the corresponding business node set as the child node of the river basin business domain. For each river basin-level business process, take the corresponding river basin-level business process as the child node of the river basin-level business process to build a river basin information business tree.

[0047] The constructed watershed information business tree is used as the watershed information business architecture of this application. The watershed information business architecture includes four parts: watershed vision, watershed business domain, watershed first-level business process and watershed second-level business process. Among them, the first layer of the watershed information business architecture is the watershed vision, the second layer is the watershed business domain, the third layer is the watershed first-level business process, and the fourth layer is the watershed second-level business process.

[0048] See also Figure 2 , Figure 2 FIG. 1 is a schematic diagram of a watershed information service architecture according to an embodiment of the present invention. Figure 2 As shown, the first layer of the basin information business architecture is the basin vision; the second layer of the basin business domain includes hydropower generation, shipping and transportation, etc.; the third layer of the basin-level business processes corresponding to hydropower generation include water resources monitoring, power generation management, etc., and the third layer of the basin-level business processes corresponding to shipping and transportation include shipping services, etc.; the fourth layer of the basin-level business processes corresponding to water resources monitoring include meteorological monitoring, etc., the fourth layer of the basin-level business processes corresponding to power generation management include power generation scheduling, etc., and the fourth layer of the basin-level business processes corresponding to shipping services include shipping information sharing, etc.

[0049] The method for constructing a watershed information business architecture provided in this embodiment converts the watershed information business architecture construction problem into the watershed information business tree construction problem. Based on the watershed vision, it can clarify the research objectives of watershed information; divide the business nodes through watershed business to achieve clear resource allocation and department division; based on the watershed business domain, the business nodes in the watershed business domain are analyzed for relevance, and the business nodes in the watershed business domain can be efficiently organized. By constructing a watershed information business tree hierarchically using the watershed vision, watershed business domain, watershed first-level business process, and watershed second-level business process, a clear hierarchical relationship can be obtained, similar businesses can be merged and unified for management, and business management efficiency can be effectively improved, resource waste can be reduced, and duplication of work can be reduced.

[0050] In this embodiment, a method for constructing a watershed information service architecture is provided. Figure 3 is a flowchart of another method for constructing a watershed information service architecture according to an embodiment of the present invention. It should be noted that if there are substantially the same results, this embodiment is not based on Figure 3 The process sequence shown is limited. Figure 3 As shown, the process includes the following steps: Step S301, extracting keywords from the watershed vision file to obtain the watershed vision.

[0051] Collect various basin vision files, use keyword extraction algorithm to extract keywords from basin vision files, and get basin vision. Figure 1 Step S101 of the illustrated embodiment will not be described in detail here.

[0052] In a specific example, the TF-IDF algorithm is used to extract keywords from the watershed vision file, and the detection result shows that "improving power generation efficiency and shipping safety" is the watershed vision.

[0053] Step S302: extract multiple keywords from the watershed service file to obtain multiple service nodes.

[0054] Collect multiple watershed business files, use keyword extraction algorithms to extract multiple keywords from the watershed business files, and obtain multiple business nodes. Figure 1 Step S102 of the illustrated embodiment will not be described in detail here.

[0055] In a specific example, the TF-IDF algorithm is used to extract multiple keywords from the watershed business file, and "water resources monitoring, power generation management, meteorological monitoring, power generation scheduling, shipping information sharing, and shipping services" are obtained as business nodes.

[0056] Step S303 , cluster analysis is performed on multiple service nodes to obtain multiple groups of service node sets, and the service activities of each service node set are identified to obtain corresponding watershed service domains.

[0057] Use clustering algorithms to perform cluster analysis on multiple business nodes, identify business nodes with similar business activities among multiple business nodes, and obtain multiple business node sets with similar business activities. Identify the business activities corresponding to each business node set, and obtain the watershed business domain of the business node set. For details, please refer to Figure 1 Step S103 of the illustrated embodiment will not be described in detail here.

[0058] In a specific example, "water resources monitoring, power generation management, meteorological monitoring, power generation scheduling, shipping information sharing, shipping services" are clustered, and the business node sets with similar business activities are identified as: [water resources monitoring, power generation management, meteorological monitoring, power generation scheduling] and [shipping information sharing, shipping services]. The words with the highest number of occurrences in each business node set are combined to obtain the basin business domain corresponding to [water resources monitoring, power generation management, meteorological monitoring, power generation scheduling] as "hydropower generation", and the basin business domain corresponding to [shipping information sharing, shipping services] as "shipping services".

[0059] Step S304: for each watershed service domain, based on the correlation between each service node in the service node set, the service nodes are divided into watershed primary service processes and watershed secondary service processes.

[0060] Consider the correlation between business nodes in each watershed business domain respectively, and take a preset number of business nodes with the greatest correlation with other business nodes as the first-level business process of the watershed, and take a preset number of business nodes with the greatest correlation with the first-level business process of the watershed as the second-level business process of the watershed corresponding to the first-level business process of the watershed.

[0061] The present application processes the watershed service domains separately, and divides the service nodes corresponding to each watershed service domain. Specifically, the above step S304 includes: Step S3041: Based on the correlation between each business node in the business node set, a business domain graph connecting all business nodes is generated.

[0062] In some optional implementations, the above step S3041 includes: Step a1, counting the frequency of every two service nodes appearing in the same watershed service file.

[0063] Specifically, for service nodes k1, k2, ... kn, the frequency kij of each two service nodes ki and service nodes kj appearing in the same flow domain file is counted.

[0064] In a specific example, the frequency of every two business nodes in "water resources monitoring, power generation management, meteorological monitoring, power generation scheduling, shipping information sharing, and shipping services" appearing in the same river basin business file is counted, and the results are (water resources monitoring, power generation management) 115, (water resources monitoring, meteorological monitoring) 899, (water resources monitoring, power generation scheduling) 166, (water resources monitoring, shipping information sharing) 12, (water resources monitoring, shipping services) 11, (power generation management, meteorological monitoring) 78, (power generation management, power generation scheduling) 1050, (power generation management, shipping information sharing) 8, (power generation management, shipping services) 7, (meteorological monitoring, power generation management) 96, (meteorological monitoring, shipping information sharing) 5, (meteorological monitoring, shipping services) 4, (power generation scheduling, shipping information sharing) 3, (power generation scheduling, shipping services) 2, (shipping information sharing, shipping services) 1590.

[0065] Step a2: If the frequency of two business nodes is greater than zero, the two business nodes are connected and the frequency is used as the edge weight to generate a business domain graph.

[0066] Determine whether kij is greater than zero. If kij is greater than zero, connect business node ki and business node kj, and use the frequency kij as the weight w(ki,kj) of the edge (ki,kj).

[0067] Traverse all business nodes in the business node set to generate graph Gi. Determine whether graph Gi is a connected graph. If graph Gi is a connected graph, directly use graph Gi as the business domain graph; if graph Gi is a disconnected graph, add as few edges with a weight of 0.1 as possible to graph Gi until graph Gi is a connected graph and obtains the business domain graph.

[0068] In a specific example, when the frequency kij of traversing all business nodes in the business node set of the watershed business domain "hydropower generation" is greater than zero, "water resource monitoring" and "generation scheduling" are connected, and the weight becomes 115. Traverse all business nodes to obtain a graph Gi, where the graph Gi is a connected graph and the graph Gi is used as the business domain graph. Please refer to Figure 4 , Figure 4 It is a schematic diagram of a business domain diagram according to an embodiment of the present invention.

[0069] In this implementation, the frequency of simultaneous occurrence of business nodes is used as data reflecting the association relationship between business nodes. The data is easy to obtain and a business process diagram that accurately represents the association relationship between business nodes can be generated.

[0070] Step S3042: based on the relevance of the service nodes, convert the service domain graph into a maximum spanning tree including all service nodes.

[0071] In some optional implementations, the above step S3042 includes: Step b1, select a service node ki with the largest edge weight in the service domain graph, select a service node kj with the largest edge weight connected to service node ki, and add service node ki, service node kj and edge (ki, kj) to the spanning tree.

[0072] Specifically, determine the edge with the largest weight in the business process graph, select the node with the smaller number among the two business nodes with the largest edge weight as the starting node, add it to the spanning tree, and mark it as visited. Select an edge with the largest edge weight from the visited nodes, add the other node of the edge to the spanning tree, mark it as visited, and add the edge of the two business nodes to the spanning tree.

[0073] In a specific example, in the above business process diagram, the final largest edge is selected as edge 1050, and the business node "power generation scheduling" corresponding to edge 1050 is selected as the starting node, added to the spanning tree, and marked as visited. For "power generation scheduling", select edge 1050 with the largest weight, add another business node "power generation management" to the spanning tree, and mark it as visited. Add the 1050 edges of "power generation scheduling" and "power generation management" to the spanning tree.

[0074] Step b2, repeating step b1, for the service nodes in the spanning tree, selecting a service node with the largest connected edge weight, until all service nodes are added to the spanning tree, and a maximum spanning tree is obtained.

[0075] Repeat step b1 until all service nodes are added to the spanning tree and all service nodes are marked as visited, then a maximum spanning tree is obtained.

[0076] In a specific example, for "Power Generation Scheduling" and "Power Generation Scheduling" in the spanning tree, select the 166 edges with the largest weight from the edges that are not added to the spanning tree, add another service node "Water Resources Monitoring" to the spanning tree, and mark it as visited. Add the 166 edges of "Power Generation Management" and "Water Resources Monitoring" to the spanning tree. For "Power Generation Scheduling", "Power Generation Scheduling", and "Water Resources Monitoring" in the spanning tree, select the 899 edges with the largest weight from the edges that are not added to the spanning tree, add another service node "Meteorological Monitoring" to the spanning tree, and mark it as visited. Add the 899 edges of "Water Resources Monitoring" and "Meteorological Monitoring" to the spanning tree. All service nodes are added to the spanning tree to obtain the maximum spanning tree. Please refer to Figure 5 , Figure 5 is a schematic diagram of a maximum spanning tree according to an embodiment of the present invention.

[0077] In this implementation, based on the business process diagram, the association relationship between business nodes is further evaluated according to the frequency, the business process diagram is simplified, the tree relationship between business nodes is clarified, and a maximum spanning tree that accurately represents the association relationship between business nodes can be generated.

[0078] Step S3043, dividing the first-level business process of the watershed and the second-level business process of the watershed from the maximum spanning tree according to the business ratio, where the business ratio is the ratio of the number of the first-level business process of the watershed to the number of the second-level business process of the watershed.

[0079] In some optional implementations, the above step S3043 includes: Step c1, obtaining the service number of the service node in the service node set.

[0080] In a specific example, for a service node set whose watershed service domain is “hydropower generation”, the service number of the service node is 4.

[0081] Step c2: determine the first quantity of the first-level business processes in the watershed based on the business ratio.

[0082] The business ratio is obtained, the business nodes are divided according to the business ratio, and a first number of the first-level business processes in the watershed and a second number of the second-level business processes in the watershed are determined.

[0083] The business ratio is the ratio of the number of first-level business processes in the watershed to the number of second-level business processes in the watershed. In the specific application process, due to the number limit of business nodes, business nodes generally cannot be strictly divided according to the business ratio. Therefore, it is ensured that the ratio of the first number and the second number after division is less than or equal to the business ratio.

[0084] In a specific example, the service ratio P is less than 1:2. Since the number of services of the service node is 4, the service ratio is set to 1:3. It is determined that the first number of the first-level service processes in the watershed is 1, and the second number of the second-level service processes in the watershed is 2.

[0085] Step c3, calculate the degree of each service node in the maximum spanning tree, calculate the sum of the edge weights connected to each service node, and calculate the contribution of each service node based on the product of the degree and the sum of the edge weights.

[0086] The degree of a business node is the number of edges directly connected to the business node. The degree of each business node is Dki, the sum of the edge weights connected to each business node is Ski, and the contribution of each business node is Cki=Dki×Ski.

[0087] In a specific example, for the service node "water resource monitoring", the degree is 2, the sum of the edge weights is 899+166=1065, and the contribution is 2×1065=2130. For the service node "power generation management", the degree is 2, the sum of the edge weights is 1050+166=1216, and the contribution is 2×1216=2432. Similarly, the contribution of the service node "power generation scheduling" is 1×1050=1050, and the contribution of the service node "meteorological monitoring" is 1×899=899.

[0088] Step c4, sorting the business nodes according to their contribution, selecting the first number of business nodes with the largest contribution as the first-level business processes of the watershed, and using the other business nodes as the second-level business processes of the watershed.

[0089] In a specific example, the business nodes are sorted according to their contribution, and the business node with the largest contribution, "power generation management", is selected as the first-level business process of the river basin, and the other business nodes, "power generation scheduling, water resources monitoring, and meteorological monitoring", are selected as the second-level business processes of the river basin.

[0090] In this implementation, the frequency of occurrence and the number of connected business nodes are used as data to evaluate the association between business nodes, and the business nodes are divided into basin-level business processes and basin-level business processes. The division problem of basin-level business processes and basin-level business processes is converted into an application tree clustering problem, which can clarify the hierarchical relationship between business nodes.

[0091] Step S3044, deleting the edges connecting the first-level business processes of the watershed in the maximum spanning tree, and obtaining multiple groups of connected first-level business processes of the watershed and second-level business processes of the watershed.

[0092] When there are multiple watershed-level first-level business processes in the maximum spanning tree, and there are connecting edges between the multiple watershed-level first-level business processes, the edges are deleted to obtain independent first-level business processes for each watershed and corresponding second-level business processes for each watershed.

[0093] Furthermore, each basin-level secondary business process that is directly or indirectly connected to the basin-level primary business process is regarded as a sub-node of the basin-level primary business process.

[0094] In a specific example, see Figure 6 , Figure 6 FIG. 1 is a schematic diagram of adjusting a spanning tree according to an embodiment of the present invention. Figure 6 ,exist Figure 5Based on the above, "power generation management" is determined as the first-level business process of the river basin, and "power generation dispatching, water resources monitoring, and meteorological monitoring" are determined as the second-level business processes of the river basin. "Power generation dispatching, water resources monitoring" directly connected to "power generation management" and "meteorological monitoring" indirectly connected to "power generation management" are both made into sub-nodes of "power generation management". Figure 5 The maximum spanning tree of Figure 6 The spanning tree shown.

[0095] Step S305, construct a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed first-level business process as the child node of the watershed business domain, and the watershed second-level business process as the child node of the watershed first-level business process.

[0096] The basin vision is taken as the root node, and multiple basin business domains are taken as child nodes of the basin vision. For each basin business domain, the basin-level business process in the corresponding business node set is taken as the child node of the basin business domain. For each basin-level business process, the directly or indirectly connected basin-level business process is taken as the child node of the basin-level business process to construct a basin information business tree.

[0097] The method for constructing a watershed information business architecture provided in this embodiment converts the problem of constructing a watershed information business architecture into the problem of constructing a watershed information business tree. The watershed vision is extracted through a keyword extraction algorithm. Based on the watershed vision, the research objectives of the watershed information can be clarified. Through a clustering algorithm, the business nodes are divided using watershed business to achieve clear resource allocation and department division. Based on the watershed business domain, the business nodes within the watershed business domain are analyzed for correlation, so that the business nodes within the watershed business domain can be efficiently organized.

[0098] The problem of constructing the watershed information business architecture is transformed into the problem of constructing the watershed information business tree. Based on the watershed vision, the watershed business is divided, and the levels of business nodes are divided according to the relationship between business nodes. A hierarchical watershed information architecture is generated to achieve unified organization and management of similar businesses, coordinated scheduling and management of highly related businesses, improve business management efficiency, reduce resource waste, reduce duplication of work, and increase cross-departmental collaboration, which can further support the maximization of watershed ecological benefits and the improvement of water resources management efficiency. At the same time, it can better support the construction of digital twin watersheds, identify and solve complex problems in watershed management.

[0099] In this embodiment, a device for constructing a watershed information service architecture is also provided, and the device is used to implement the above-mentioned embodiments and preferred implementation modes, and the descriptions that have been made will not be repeated. As used below, the term "module" can implement a combination of software and / or hardware of a predetermined function. Although the devices described in the following embodiments are preferably implemented in software, the implementation of hardware, or a combination of software and hardware, is also possible and conceivable.

[0100] This embodiment provides a device for constructing a watershed information service architecture. Figure 7 As shown, Figure 7 is a structural block diagram of a device for constructing a watershed information service architecture according to an embodiment of the present invention, and the device for constructing a watershed information service architecture includes: The watershed vision extraction module 701 is used to extract keywords from the watershed vision file to obtain the watershed vision.

[0101] The service node extraction module 702 is used to extract multiple keywords from the watershed service file to obtain multiple service nodes.

[0102] The watershed business domain extraction module 703 is used to perform cluster analysis on the multiple business nodes to obtain multiple groups of business node sets, identify the business activities of each of the business node sets, and obtain the corresponding watershed business domain.

[0103] The service node division module 704 is used to divide the service nodes into a first-level service flow and a second-level service flow for each watershed service domain based on the correlation between each service node in the service node set.

[0104] The business tree construction module 705 is used to construct a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed first-level business process as the child node of the watershed business domain, and the watershed second-level business process as the child node of the watershed first-level business process.

[0105] The further functional description of each of the above modules is the same as that of the above corresponding embodiments and will not be repeated here.

[0106] The watershed information service architecture construction device in this embodiment is presented in the form of a functional unit, where the unit refers to an ASIC (Application Specific Integrated Circuit) circuit, a processor and memory that executes one or more software or fixed programs, and / or other devices that can provide the above functions.

[0107] The embodiment of the present invention also provides a computer device having the above Figure 7The watershed information business architecture construction device shown.

[0108] See also Figure 8 , Figure 8 is a schematic diagram of the structure of a computer device provided by an optional embodiment of the present invention, such as Figure 8 As shown, the computer device includes: one or more processors 10, a memory 20, and interfaces for connecting various components, including high-speed interfaces and low-speed interfaces. Various components are connected to each other using different buses for communication, and can be installed on a common mainboard or installed in other ways as needed. The processor can process the instructions executed in the computer device, including instructions stored in or on the memory to display the graphical information of the GUI on an external input / output device (such as, a display device coupled to the interface). In some optional embodiments, if necessary, multiple processors and / or multiple buses can be used together with multiple memories and multiple memories. Similarly, multiple computer devices can be connected, and each device provides some necessary operations (for example, as a server array, a group of blade servers, or a multi-processor system). Figure 8 A processor 10 is taken as an example.

[0109] The processor 10 may be a central processing unit, a network processor or a combination thereof. The processor 10 may further include a hardware chip. The hardware chip may be a dedicated integrated circuit, a programmable logic device or a combination thereof. The programmable logic device may be a complex programmable logic device, a field programmable gate array, a general purpose array logic or any combination thereof.

[0110] The memory 20 stores instructions executable by at least one processor 10, so that the at least one processor 10 executes the method shown in the above embodiment.

[0111] The memory 20 may include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application required for at least one function; the data storage area may store data created according to the use of the computer device, etc. In addition, the memory 20 may include a high-speed random access memory, and may also include a non-transient memory, such as at least one disk storage device, a flash memory device, or other non-transient solid-state storage device. In some optional embodiments, the memory 20 may optionally include a memory remotely arranged relative to the processor 10, and these remote memories may be connected to the computer device via a network. Examples of the above-mentioned network include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

[0112] The memory 20 may include a volatile memory, such as a random access memory; the memory may also include a non-volatile memory, such as a flash memory, a hard disk or a solid state drive; the memory 20 may also include a combination of the above types of memory.

[0113] The computer device also includes an input device 30 and an output device 40. The processor 10, the memory 20, the input device 30 and the output device 40 may be connected via a bus or other means. Figure 8 The example of connecting through bus is taken in the following.

[0114] The input device 30 can receive input digital or character information, and generate key signal input related to the user settings and function control of the computer device, such as a touch screen, a keypad, a mouse, a track pad, a touch pad, an indicator bar, one or more mouse buttons, a trackball, a joystick, etc. The output device 40 may include a display device, an auxiliary lighting device (e.g., an LED) and a tactile feedback device (e.g., a vibration motor), etc. The above-mentioned display device includes but is not limited to a liquid crystal display, a light emitting diode, a display and a plasma display. In some optional embodiments, the display device may be a touch screen.

[0115] The embodiment of the present invention also provides a computer-readable storage medium. The method according to the embodiment of the present invention can be implemented in hardware, firmware, or can be implemented as a computer code that can be recorded in a storage medium, or can be implemented as a computer code that is originally stored in a remote storage medium or a non-temporary machine-readable storage medium and will be stored in a local storage medium through a network download, so that the method described herein can be stored in such software processing on a storage medium using a general-purpose computer, a dedicated processor, or programmable or dedicated hardware. Among them, the storage medium can be a magnetic disk, an optical disk, a read-only storage memory, a random access memory, a flash memory, a hard disk or a solid-state hard disk, etc.; further, the storage medium can also include a combination of the above types of memories. It can be understood that a computer, a processor, a microprocessor controller, or programmable hardware includes a storage component that can store or receive software or computer code. When the software or computer code is accessed and executed by a computer, a processor, or hardware, the method shown in the above embodiment is implemented.

[0116] A part of the present invention may be applied as a computer program product, such as a computer program instruction, which, when executed by a computer, can call or provide the method and / or technical solution according to the present invention through the operation of the computer. Those skilled in the art should understand that the existence of the computer program instruction in a computer-readable medium includes, but is not limited to, a source file, an executable file, an installation package file, etc., and accordingly, the way in which the computer program instruction is executed by the computer includes, but is not limited to: the computer directly executes the instruction, or the computer compiles the instruction and then executes the corresponding compiled program, or the computer reads and executes the instruction, or the computer reads and installs the instruction and then executes the corresponding installed program. Here, the computer-readable medium may be any available computer-readable storage medium or communication medium accessible to the computer.

[0117] Although the embodiments of the present invention have been described in conjunction with the accompanying drawings, those skilled in the art may make various modifications and variations without departing from the spirit and scope of the present invention, and such modifications and variations are all within the scope defined by the appended claims.

Claims

1. A method for constructing a watershed information service architecture, characterized in that: The method comprises: Extract keywords from the basin vision document to obtain the basin vision; Extract multiple keywords from the watershed business file to obtain multiple business nodes; Performing cluster analysis on the plurality of service nodes to obtain a plurality of service node sets, identifying the service activities of each of the service node sets, and obtaining corresponding watershed service domains; For each watershed service domain, based on the correlation between each service node in the service node set, the service nodes are divided into a watershed primary service process and a watershed secondary service process; A watershed information business tree is constructed by taking the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed first-level business process as the child node of the watershed business domain, and the watershed second-level business process as the child node of the watershed first-level business process.

2. The method for constructing a watershed information service architecture according to claim 1, characterized in that: For each watershed service domain, based on the correlation between each service node in the service node set, the service nodes are divided into a watershed primary service process and a watershed secondary service process, including: For each watershed service domain, based on the correlation between each service node in the service node set, a service domain graph connecting all service nodes is generated; Based on the relevance of the service nodes, converting the service domain graph into a maximum spanning tree including all service nodes; Dividing the first-level business process of the watershed and the second-level business process of the watershed from the maximum spanning tree according to the business ratio, wherein the business ratio is the ratio of the number of the first-level business process of the watershed to the number of the second-level business process of the watershed; In the maximum spanning tree, the edges connecting the first-level business processes of the watershed are deleted to obtain multiple groups of connected first-level business processes of the watershed and second-level business processes of the watershed.

3. The method for constructing a watershed information service architecture according to claim 2, characterized in that: The generating of a business domain graph connecting all business nodes based on the correlation between each business node in the business node set comprises: Count the frequency of every two business nodes appearing in the same basin business file; If the frequency of the two service nodes is greater than zero, the two service nodes are connected, and the frequency is used as an edge weight to generate the service domain graph.

4. The method for constructing a watershed information service architecture according to claim 2, characterized in that: The converting the service domain graph into a maximum spanning tree including all service nodes based on the relevance of the service nodes comprises: Select a service node ki with the largest edge weight in the service domain graph, select a service node kj with the largest edge weight connected to the service node ki, and add the service node ki, the service node kj and the edge (ki, kj) to the spanning tree; For the service nodes in the spanning tree, a service node with the largest weight of the connected edges is repeatedly selected until all service nodes are added to the spanning tree, thereby obtaining the maximum spanning tree.

5. The method for constructing a watershed information service architecture according to claim 2, characterized in that: The dividing of the first-level service flow of the watershed and the second-level service flow of the watershed from the maximum spanning tree according to the service ratio includes: Obtaining the number of services of the service node in the service node set; Determine a first number of the first-level business processes in the watershed based on the business ratio; Calculating the degree of each service node in the maximum spanning tree, calculating the sum of edge weights connected to each service node, and calculating the contribution of each service node based on the product of the degree and the sum of edge weights; The business nodes are sorted according to the contribution, a first number of the business nodes with the largest contribution are selected as the primary business process of the watershed, and other business nodes are used as the secondary business process of the watershed.

6. The method for constructing a watershed information service architecture according to any one of claims 2 to 5, characterized in that: The construction of a watershed information service tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed primary business process as the child node of the watershed business domain, and the watershed secondary business process as the child node of the watershed primary business process includes: The watershed vision is used as a root node, and a plurality of the watershed business domains are used as child nodes of the watershed vision; For each of the watershed service domains, the watershed-level service process in the corresponding service node set is used as a child node of the watershed service domain; For each of the first-level business processes in the watershed, the second-level business processes in the watershed that are directly or indirectly connected are used as child nodes of the first-level business processes in the watershed to construct the watershed information business tree.

7. A device for constructing a watershed information service architecture, characterized in that: The device comprises: The watershed vision extraction module is used to extract keywords from the watershed vision file to obtain the watershed vision; A business node extraction module is used to extract multiple keywords from the watershed business file to obtain multiple business nodes; A watershed business domain extraction module is used to perform cluster analysis on the plurality of business nodes to obtain a plurality of business node sets, identify the business activities of each of the business node sets, and obtain the corresponding watershed business domain; A business node division module, for each watershed business domain, based on the correlation between each business node in the business node set, divides the business nodes into a watershed primary business process and a watershed secondary business process; The business tree construction module is used to construct a watershed information business tree with the watershed vision as the root node, the watershed business domain as the child node of the watershed vision, the watershed first-level business process as the child node of the watershed business domain, and the watershed second-level business process as the child node of the watershed first-level business process.

8. A computer device, characterized in that: include: A memory and a processor, wherein the memory and the processor are communicatively connected to each other, the memory stores computer instructions, and the processor executes the method for constructing a watershed information business architecture according to any one of claims 1 to 6 by executing the computer instructions.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores computer instructions, and the computer instructions are used to enable a computer to execute the method for constructing a watershed information service architecture according to any one of claims 1 to 6.

10. A computer program product, characterized in that It includes computer instructions, and the computer instructions are used to enable a computer to execute the method for constructing a watershed information business architecture according to any one of claims 1 to 6.

Images