Method and system for identifying atmospheric pollution transmission key nodes based on complex network
A complex network and key transmission technology, applied in the field of identification of key nodes of air pollution transmission, can solve problems such as lack of theoretical basis, low connection accuracy, and non-representative
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0068] According to a method for identifying key nodes of air pollution transmission based on a complex network provided by the present invention, it includes: figure 1 as shown,
[0069] Step M1: Grid a specific area (such as the Yangtze River Delta area) and abstract it into a regional complex network. Each grid point after gridding is a node in the complex network; figure 2 shown;
[0070] Step M2: Use the HYSPLIT atmospheric trajectory model to output the flow of the airflow trajectory in the region (such as the Yangtze River Delta region). The grid points passed by each trajectory can construct the relationship between nodes in the regional complex network, and obtain the relationship with the airflow adjacency matrix of trajectory weights;
[0071] Step M3: The pollutant concentration (PM 2.5 , ozone, etc.) The monitoring data is transferred to each node by the interpolation method of pollutant concentration, and the adjacency matrix with pollution transmission weigh...
Embodiment 2
[0097] Embodiment 1 is a modification of embodiment 2
[0098] The traditional PageRank algorithm is to evenly distribute the PageRank value of webpage A to webpages B, C, and D (as long as webpage A has links to webpages B, C, and D)
[0099] The formula for PageRank looks like this:
[0100]
[0101] Among them: N is the number of web pages in the entire network; d is the probability of searching for other pages backwards, and 1-d is the probability that a user randomly browses to a new URL. L(P j ) for page P j The number of pages pointed to (using an adjacency matrix to represent the relationship between nodes in the network); M(P i ) to point to page P i page collection; PageRank(P j ) for page P j PageRank value;
[0102] After iterative calculation, the PageRank value of each webpage will eventually converge to a stable value, which is the final PageRank value of the webpage, as shown below:
[0103]
[0104] Stack all PageRank(Pi) into vector p. Given an...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com