CN113722728B - Intelligent government affair information management method based on block chain - Google Patents
Intelligent government affair information management method based on block chain Download PDFInfo
- Publication number
- CN113722728B CN113722728B CN202110928425.9A CN202110928425A CN113722728B CN 113722728 B CN113722728 B CN 113722728B CN 202110928425 A CN202110928425 A CN 202110928425A CN 113722728 B CN113722728 B CN 113722728B
- Authority
- CN
- China
- Prior art keywords
- data
- government
- node
- government affair
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 13
- 238000012795 verification Methods 0.000 claims abstract description 11
- 238000011217 control strategy Methods 0.000 claims abstract description 5
- 230000005540 biological transmission Effects 0.000 claims description 142
- 239000013598 vector Substances 0.000 claims description 48
- 239000011159 matrix material Substances 0.000 claims description 21
- 238000000034 method Methods 0.000 claims description 12
- 230000008439 repair process Effects 0.000 claims description 12
- 238000004891 communication Methods 0.000 claims description 6
- 238000013507 mapping Methods 0.000 claims description 6
- 230000010354 integration Effects 0.000 claims description 5
- 238000013500 data storage Methods 0.000 claims description 4
- 230000011218 segmentation Effects 0.000 claims description 4
- 206010033799 Paralysis Diseases 0.000 claims description 3
- 238000005516 engineering process Methods 0.000 description 7
- 238000004422 calculation algorithm Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/60—Protecting data
- G06F21/604—Tools and structures for managing or administering access control systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2221/00—Indexing scheme relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/21—Indexing scheme relating to G06F21/00 and subgroups addressing additional information or applications relating to security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F2221/2141—Access rights, e.g. capability lists, access control lists, access tables, access matrices
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Health & Medical Sciences (AREA)
- General Health & Medical Sciences (AREA)
- General Physics & Mathematics (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Educational Administration (AREA)
- Primary Health Care (AREA)
- Automation & Control Theory (AREA)
- Bioethics (AREA)
- Computer Hardware Design (AREA)
- Computer Security & Cryptography (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a block chain-based intelligent government affair information management method, which comprises the following steps: and receiving government data and access authority configuration sent by the second government node, generating a government data block based on the government data and the access authority configuration, and verifying the government data block to issue the government data block to a government block chain network. Receiving a data access request sent by a first government service node, and verifying the data access request based on access authority configuration and an access control strategy; and authorizing the data access request and generating a corresponding data access record when the data access request passes the verification. And transmitting the target government affair data from the second government affair node to the first government affair node. And generating an access record block based on the data access record, verifying the access record block, and transmitting the access record block to the government block network to update the government block chain network when the access record block passes the verification.
Description
Technical Field
The invention relates to the field of blockchains and intelligent government affairs, in particular to an intelligent government affair information management method based on blockchains.
Background
Blockchains are an organic combination of sophisticated computer technologies such as distributed data storage, point-to-point transmission, consensus mechanisms, encryption algorithms, and the like. The block chain technology is a brand new distributed infrastructure and calculation mode for verifying and storing data by utilizing a block chain data structure, generating and updating the data by utilizing a distributed node consensus algorithm, ensuring the safety of data transmission and access by utilizing a cryptography technology, and programming and operating the data by utilizing an intelligent contract formed by an automatic script code.
The construction content of the intelligent government affairs mainly comprises government affair cloud infrastructure unified management and scheduling, information resource integration and sharing, business integration and cooperative intelligent application and service, intelligent decision based on big data processing, a safety guarantee system and the like, and the intelligent government affairs are based on the electronic government affairs, so that the intelligent government affairs can integrate information resources of multiple departments in a large range, integrate functions of various business systems and provide intelligent services which are dynamically combined according to requirements.
With the promotion of e-government construction work and the wide application of government service platforms, the contradiction between data sharing and safety efficiency is increasingly prominent, and meanwhile, the problems of information leakage and the like exist.
Disclosure of Invention
In view of the above, the present invention provides a block chain-based intelligent government information management method, which includes the following steps:
s1, receiving government affair data and access authority configuration sent by a second government affair node, generating a government affair data block based on the government affair data and the access authority configuration, and then verifying the government affair data block; and when the government affair data block passes the verification, the government affair data block is issued to the government affair block chain network.
S2, receiving a data access request for target government affair data sent by a first government affair node, and verifying the data access request based on access authority configuration and access control strategy; and authorizing the data access request and generating a corresponding data access record when the data access request passes the verification.
S3, acquiring coordinate points of the first government node and the second government node based on the positions of the first government node and the second government node, calculating tangent values of the coordinate points of the second government node and the coordinate points of the first government node according to the coordinate points of the first government node and the second government node to obtain a standard path direction angle, and then taking the second government node as a target government node.
And S4, taking all government nodes in the communication range of the target government node as candidate government nodes, acquiring coordinate points of all candidate government nodes, and then calculating tangent values of the coordinate points of each candidate government node and the coordinate points of the first government node based on the coordinate points of each candidate government node and the coordinate points of the first government node to obtain a reference path direction angle of each candidate government node.
S5, calculating the deviation of each reference path direction angle and the standard path direction angle, taking the candidate government affair node corresponding to the reference path direction angle with the minimum deviation as a path node, and taking the path node as a target government affair node.
S6, repeating the steps S4-S5 until a first government affair node exists in the communication range of the target government affair node, sequentially connecting a second government affair node, all path nodes and the first government affair node to obtain a shortest data transmission path, and then transmitting the target government affair data from the second government affair node to the first government affair node according to the data quantity of the target government affair data and the shortest data transmission path.
And S7, generating an access record block based on the data access record, verifying the access record block, and transmitting the access record block to a government block network to update a government block chain network when the access record block passes the verification.
According to a preferred embodiment, the first government node is a government node where a data requester of government data is located; the second government node is a government node where a data provider of government data is located; the government affair node is a network node in a government affair block chain network.
According to a preferred embodiment, transmitting the target government affair data from the second government affair node to the first government affair node according to the data amount of the target government affair data and the shortest data transmission path includes:
comparing the data volume of the target government affair data with a data volume threshold value, and transmitting the target government affair data from the second government affair node to the first government affair node according to the shortest data transmission path when the data volume of the target government affair data is smaller than the data volume threshold value;
when the data volume of the target government affair data is larger than a data volume threshold value, carrying out data segmentation on the target government affair data to divide the target government affair data into a plurality of government affair data segments with different data volumes, arranging all the government affair data segments according to the data volumes from large to small, and then setting the sequence number of each government affair data segment based on the arrangement sequence;
acquiring a plurality of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path, arranging the shortest data transmission path and the candidate data transmission paths according to the path length of the data transmission paths from small to large, and then setting the sequence number of each data transmission path based on the arrangement sequence;
and selecting a corresponding data transmission path for each government data segment according to the sequence number of the data transmission path and the sequence number of the government data segment, and transmitting each government data segment from the second government node to the first government node through the corresponding data transmission path.
According to a preferred embodiment, the data division of the target government affair data to obtain a plurality of government affair data segments includes:
taking the target government affair data as first government affair data, extracting the data structure characteristics of the first government affair data to obtain a data structure characteristic matrix of the first government affair data, and dividing the first government affair data into a plurality of first government affair sub-data based on the data structure characteristic matrix of the first government affair data;
arranging all the first government affair sub-data from large to small according to the data volume to generate a first government affair sub-data sequence, selecting a first government affair data section from the first government affair sub-data sequence, and integrating all the first government affair sub-data except the first government affair data section in the first government affair data to obtain second government affair data;
comparing the data quantity of the second government affair data with a data quantity threshold, dividing the second government affair data into a plurality of second government affair sub-data according to the data structure characteristics of the second government affair data when the data quantity of the second government affair data is larger than the data quantity threshold, arranging all the second government affair sub-data from large to small according to the data quantity to generate a second government affair sub-data sequence, and then selecting a second government affair data segment from the second government affair sub-data sequence;
data integration is carried out on all second government affair sub-data except for the second government affair data segment in the second government affair data so as to obtain third government affair data;
performing N iterations on the steps until the data volume of the Nth government data is smaller than a data volume threshold value, stopping data division on the Nth government data so as to divide the target government data into a plurality of government data segments with different data volumes;
setting sequence numbers for each government data segment according to the iteration sequence of each government data segment; the sequence number of the first government affair data section is one, the sequence number of the second government affair data section is two, and the sequence number of the Nth government affair data section is N.
According to a preferred embodiment, selecting the first segment of government affair data from the first sequence of government affair sub-data comprises:
traversing all the first government affair sub-data according to the arrangement sequence of the first government affair sub-data in the first government affair sub-data sequence, taking the traversed first government affair sub-data as first target government affair sub-data, and comparing the data quantity of the first target government affair sub-data with a data quantity threshold value;
stopping traversing and taking the first target government affair sub-data as a first government affair data segment when the data volume of the first target government affair sub-data is smaller than or equal to a data volume threshold value;
when the data volume of the first target government affair sub data is larger than a data volume threshold value, taking the next first government affair sub data in the first government affair sub data sequence as first target government affair sub data;
repeating the steps until the data volume of the first target government affair sub-data is less than or equal to the data volume threshold value.
According to a preferred embodiment, extracting the data structure feature of the first government data to obtain the data structure feature matrix of the first government data includes:
acquiring all data nodes of first government affair data, wherein the data nodes are data storage units;
connecting all the data nodes based on the distribution condition of the data nodes to generate a data structure tree of the first government affair data, and taking the data nodes with sub-nodes in the data structure tree of the first government affair data as characteristic data nodes to obtain a plurality of characteristic data nodes;
acquiring all characteristic data nodes, acquiring Euclidean distance between the characteristic data nodes and each data node, and taking the data nodes with Euclidean distance smaller than a preset distance threshold as associated data nodes of the characteristic data nodes;
counting the number of associated data nodes of each feature data node, taking the feature data nodes with the number of the associated data nodes being greater than or equal to a first preset threshold value as core feature data nodes, and taking the feature data nodes with the number of the associated data nodes being less than the first preset threshold value as edge feature data nodes;
and acquiring a data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node.
According to a preferred embodiment, the acquiring the data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node includes:
acquiring positions of core feature data nodes and edge feature data nodes in a data structure tree;
taking the core feature data nodes with the number of the sub-nodes smaller than a second preset threshold value as first core feature nodes, and taking the core feature data nodes with the number of the sub-nodes larger than or equal to the second preset threshold value as second core feature nodes;
taking edge characteristic data nodes with the number of the sub-nodes being smaller than a second preset threshold value as first edge characteristic nodes, and taking edge characteristic data nodes with the number of the sub-nodes being larger than or equal to the second preset threshold value as second edge characteristic nodes;
initializing each first core feature node by using a unit vector, and mapping the unit vector to a multidimensional vector space to obtain a feature vector of each first edge feature node; initializing each first edge characteristic node by using a zero vector, and mapping the zero vector to a multidimensional vector space to obtain a characteristic vector of each first edge characteristic node;
the method comprises the steps of obtaining feature vectors of sub-nodes of each second core feature node, and accumulating the feature vectors of all the sub-nodes of each second core feature node to obtain the feature vector of each second core feature node; the feature vector of the sub-node of each second edge feature node is obtained, and the feature vectors of all the sub-nodes of each second edge feature node are accumulated to obtain the feature vector of each second edge feature node;
and performing matrix expansion according to the feature vectors of all the second core feature nodes and the feature vectors of all the second edge feature nodes to generate a data structure feature matrix of the first government data.
According to a preferred embodiment, selecting the data transmission path for each of the government affair data segments according to the sequence number of the data transmission path and the sequence number of the government affair data segments includes:
acquiring the sequence numbers of each data transmission path and each government data segment, and taking the government data segments with the same sequence numbers and the data transmission paths as a data transmission pair to obtain a plurality of data transmission pairs; the data transmission path comprises a shortest data transmission path and a candidate data transmission path;
traversing all the data transmission pairs, taking the traversed data transmission pair as a target data transmission pair, taking a data transmission path in the target data transmission pair as a target data transmission path, and taking a government affair data segment in the target data transmission pair as a target government affair data segment;
judging whether the target data transmission pair has data missing and node missing or not; the data loss is that the corresponding government data segment is damaged or lost; the node missing is that the node of the corresponding data transmission path is crashed or paralyzed;
when the target data transmission pair does not have data missing or node missing, queuing the target government affair data segment on a node of a target data transmission path, and transmitting the target government affair data segment from a second government affair node to a first government affair node through the target data transmission path;
when the target data transmission pair has data missing or node missing, queuing the target government data segment on the node of the target data transmission path, and judging whether the target data transmission pair completes data repair and node repair within a preset time threshold;
when data repair and node repair are completed within a preset time threshold, transmitting a target government affair data segment from a second government affair node to a first government affair node through a target data transmission path; and when the data restoration and the node restoration are not completed within the preset time threshold, reselecting a data transmission path for the target government data segment.
According to a preferred embodiment, the obtaining a number of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path comprises:
taking other nodes except the first government service node and the second government service node in the shortest data transmission path as path nodes; traversing all path nodes, and taking the path node being traversed as a target path node;
acquiring a data transmission path from a second government node to a target path node in the shortest data transmission path, taking the data transmission path as a first candidate sub-path, and generating a second candidate sub-path according to a coordinate point of a target coordinate node and a coordinate point of the first government node;
connecting the first candidate sub-path and the second candidate sub-path through a target path node to obtain a candidate data transmission path;
repeating the steps until all the path nodes are traversed to obtain a plurality of candidate access path connections.
The invention has the following beneficial effects: the invention provides a safe and reliable environment for data interconnection and interworking of cross-level and cross-department through the block chain technology, autonomously authorizes an access party and access data, completes data sharing through a block chain network, and ensures the safety and reliability of data transmission. In addition, the invention utilizes the blockchain technology to process the collaborative flow of the government affair system, realizes scientific decision and efficient command, effectively improves the government affair service management level, shortens the circulation working time, improves the business approval efficiency and realizes the fine management.
Drawings
Fig. 1 is a flowchart of a blockchain-based intelligent government information management method in accordance with an exemplary embodiment.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments.
Referring to fig. 1, in one embodiment, a blockchain-based intelligent government information management method may include:
s1, receiving government affair data and access authority configuration sent by a second government affair node, generating a government affair data block based on the government affair data and the access authority configuration, and then verifying the government affair data block; and when the government affair data block passes the verification, publishing the government affair data block to a government affair block chain network.
The government affair data is data related to government affairs, the access authority is configured as the authority required for accessing the government affair data, and the government affair data block comprises the government affair data, the access authority configuration of the government affair data and the like.
S2, receiving a data access request for target government affair data sent by a first government affair node, and verifying the data access request based on access authority configuration and access control strategy; and authorizing the data access request and generating a corresponding data access record when the data access request passes the verification.
The data access request is used for requesting to access the target government affair data, and the access control strategy is used for verifying the access authority configuration of the data requesting party.
The first government node is the government node where the data request party of the government data is located; the second government node is a government node where a data provider of government data is located; the government node is a network node in a government blockchain network.
S3, acquiring coordinate points of the first government node and the second government node based on the positions of the first government node and the second government node, calculating tangent values of the coordinate points of the second government node and the coordinate points of the first government node according to the coordinate points of the first government node and the second government node to obtain a standard path direction angle, and then taking the second government node as a target government node.
And calculating the tangent angle of the coordinate point of the second government node and the coordinate point of the first government node according to the tangent value of the coordinate point of the second government node and the coordinate point of the first government node, and taking the tangent angle of the coordinate point of the second government node and the coordinate point of the first government node as a standard path direction angle.
And S4, taking all government nodes in the communication range of the target government node as candidate government nodes, acquiring coordinate points of all candidate government nodes, and then calculating tangent values of the coordinate points of each candidate government node and the coordinate points of the first government node based on the coordinate points of each candidate government node and the coordinate points of the first government node to obtain a reference path direction angle of each candidate government node.
And taking the tangent angle of the coordinate point of the candidate government node and the coordinate point of the first government node as a reference path direction angle according to the tangent angle of the coordinate point of the candidate government node and the coordinate point of the first government node.
S5, calculating the deviation of each reference path direction angle and the standard path direction angle, taking the candidate government affair node corresponding to the reference path direction angle with the minimum deviation as a path node, and taking the path node as a target government affair node.
The deviation of the reference path direction angle from the standard path direction angle is the difference between the reference path direction angle and the standard path direction angle.
S6, repeating the steps S4-S5 until a first government affair node exists in the communication range of the target government affair node, sequentially connecting a second government affair node, all path nodes and the first government affair node to obtain a shortest data transmission path, and then transmitting the target government affair data from the second government affair node to the first government affair node according to the data quantity of the target government affair data and the shortest data transmission path.
In one embodiment, transmitting the target government affair data from the second government affair node to the first government affair node according to the data amount of the target government affair data and the shortest data transmission path includes:
comparing the data volume of the target government affair data with a data volume threshold value, and transmitting the target government affair data from the second government affair node to the first government affair node according to the shortest data transmission path when the data volume of the target government affair data is smaller than the data volume threshold value;
when the data volume of the target government affair data is larger than a data volume threshold value, carrying out data segmentation on the target government affair data to divide the target government affair data into a plurality of government affair data segments with different data volumes, arranging all the government affair data segments according to the data volumes from large to small, and then setting the sequence number of each government affair data segment based on the arrangement sequence;
acquiring a plurality of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path, arranging the shortest data transmission path and the candidate data transmission paths according to the path length of the data transmission paths from small to large, and then setting the sequence number of each data transmission path based on the arrangement sequence;
and selecting a corresponding data transmission path for each government data segment according to the sequence number of the data transmission path and the sequence number of the government data segment, and transmitting each government data segment from the second government node to the first government node through the corresponding data transmission path.
In one embodiment, performing data segmentation on the target government affair data to obtain a plurality of government affair data segments includes:
taking the target government affair data as first government affair data, extracting the data structure characteristics of the first government affair data to obtain a data structure characteristic matrix of the first government affair data, and dividing the first government affair data into a plurality of first government affair sub-data based on the data structure characteristic matrix of the first government affair data;
arranging all the first government affair sub-data from large to small according to the data volume to generate a first government affair sub-data sequence, selecting a first government affair data section from the first government affair sub-data sequence, and integrating all the first government affair sub-data except the first government affair data section in the first government affair data to obtain second government affair data;
comparing the data quantity of the second government affair data with a data quantity threshold, dividing the second government affair data into a plurality of second government affair sub-data according to the data structure characteristics of the second government affair data when the data quantity of the second government affair data is larger than the data quantity threshold, arranging all the second government affair sub-data from large to small according to the data quantity to generate a second government affair sub-data sequence, and then selecting a second government affair data segment from the second government affair sub-data sequence;
data integration is carried out on all second government affair sub-data except for the second government affair data segment in the second government affair data so as to obtain third government affair data;
performing N iterations on the steps until the data volume of the Nth government data is smaller than a data volume threshold value, stopping data division on the Nth government data so as to divide the target government data into a plurality of government data segments with different data volumes;
setting sequence numbers for each government data segment according to the iteration sequence of each government data segment; the sequence number of the first government affair data section is one, the sequence number of the second government affair data section is two, and the sequence number of the Nth government affair data section is N.
And N is the iteration number when the data volume of the government affair data is smaller than the data volume threshold value.
In one embodiment, selecting the first segment of government affair data from the first sequence of government affair sub-data includes:
traversing all the first government affair sub-data according to the arrangement sequence of the first government affair sub-data in the first government affair sub-data sequence, taking the traversed first government affair sub-data as first target government affair sub-data, and comparing the data quantity of the first target government affair sub-data with a data quantity threshold value;
stopping traversing and taking the first target government affair sub-data as a first government affair data segment when the data volume of the first target government affair sub-data is smaller than or equal to a data volume threshold value;
when the data volume of the first target government affair sub data is larger than a data volume threshold value, taking the next first government affair sub data in the first government affair sub data sequence as first target government affair sub data;
repeating the steps until the data volume of the first target government affair sub-data is less than or equal to the data volume threshold value.
In one embodiment, extracting the data structure feature of the first government data to obtain the data structure feature matrix of the first government data includes:
acquiring all data nodes of first government affair data, wherein the data nodes are data storage units;
connecting all the data nodes based on the distribution condition of the data nodes to generate a data structure tree of the first government affair data, and taking the data nodes with sub-nodes in the data structure tree of the first government affair data as characteristic data nodes to obtain a plurality of characteristic data nodes;
acquiring all characteristic data nodes, acquiring Euclidean distance between the characteristic data nodes and each data node, and taking the data nodes with Euclidean distance smaller than a preset distance threshold as associated data nodes of the characteristic data nodes;
counting the number of associated data nodes of each feature data node, taking the feature data nodes with the number of the associated data nodes being greater than or equal to a first preset threshold value as core feature data nodes, and taking the feature data nodes with the number of the associated data nodes being less than the first preset threshold value as edge feature data nodes;
and acquiring a data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node.
In one embodiment, obtaining the data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node includes:
acquiring positions of core feature data nodes and edge feature data nodes in a data structure tree;
taking the core feature data nodes with the number of the sub-nodes smaller than a second preset threshold value as first core feature nodes, and taking the core feature data nodes with the number of the sub-nodes larger than or equal to the second preset threshold value as second core feature nodes;
taking edge characteristic data nodes with the number of the sub-nodes being smaller than a second preset threshold value as first edge characteristic nodes, and taking edge characteristic data nodes with the number of the sub-nodes being larger than or equal to the second preset threshold value as second edge characteristic nodes;
initializing each first core feature node by using a unit vector, and mapping the unit vector to a multidimensional vector space to obtain a feature vector of each first edge feature node; initializing each first edge characteristic node by using a zero vector, and mapping the zero vector to a multidimensional vector space to obtain a characteristic vector of each first edge characteristic node;
the method comprises the steps of obtaining feature vectors of sub-nodes of each second core feature node, and accumulating the feature vectors of all the sub-nodes of each second core feature node to obtain the feature vector of each second core feature node; the feature vector of the sub-node of each second edge feature node is obtained, and the feature vectors of all the sub-nodes of each second edge feature node are accumulated to obtain the feature vector of each second edge feature node;
and performing matrix expansion according to the feature vectors of all the second core feature nodes and the feature vectors of all the second edge feature nodes to generate a data structure feature matrix of the first government data.
The first preset threshold value and the second preset threshold value are preset according to actual conditions.
In one embodiment, selecting the data transmission path for each government data segment according to the sequential numbering of the data transmission paths and the sequential numbering of the government data segments comprises:
acquiring the sequence numbers of each data transmission path and each government data segment, and taking the government data segments with the same sequence numbers and the data transmission paths as a data transmission pair to obtain a plurality of data transmission pairs; the data transmission path comprises a shortest data transmission path and a candidate data transmission path;
traversing all the data transmission pairs, taking the traversed data transmission pair as a target data transmission pair, taking a data transmission path in the target data transmission pair as a target data transmission path, and taking a government affair data segment in the target data transmission pair as a target government affair data segment;
judging whether the target data transmission pair has data missing and node missing or not; the data loss is that the corresponding government data segment is damaged or lost; the node missing is that the node of the corresponding data transmission path is crashed or paralyzed;
when the target data transmission pair does not have data missing or node missing, queuing the target government affair data segment on a node of a target data transmission path, and transmitting the target government affair data segment from a second government affair node to a first government affair node through the target data transmission path;
when the target data transmission pair has data missing or node missing, queuing the target government data segment on the node of the target data transmission path, and judging whether the target data transmission pair completes data repair and node repair within a preset time threshold;
when data repair and node repair are completed within a preset time threshold, transmitting a target government affair data segment from a second government affair node to a first government affair node through a target data transmission path; and when the data restoration and the node restoration are not completed within the preset time threshold, reselecting a data transmission path for the target government data segment.
In one embodiment, obtaining a number of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path includes:
taking other nodes except the first government service node and the second government service node in the shortest data transmission path as path nodes; traversing all path nodes, and taking the path node being traversed as a target path node;
acquiring a data transmission path from a second government node to a target path node in the shortest data transmission path, taking the data transmission path as a first candidate sub-path, and generating a second candidate sub-path according to a coordinate point of a target coordinate node and a coordinate point of the first government node;
connecting the first candidate sub-path and the second candidate sub-path through a target path node to obtain a candidate data transmission path;
repeating the steps until all the path nodes are traversed to obtain a plurality of candidate access path connections.
And S7, generating an access record block based on the data access record, verifying the access record block, and transmitting the access record block to a government block network to update a government block chain network when the access record block passes the verification.
The invention provides a safe and reliable environment for cross-level and cross-department data interconnection in government departments through the blockchain technology, autonomously authorizes an access party and access data, completes data sharing through a blockchain network, and ensures the safety and reliability of data transmission. In addition, the invention utilizes the blockchain technology to process the collaborative flow of the government affair system, realizes scientific decision and efficient command, effectively improves the government affair service management level, shortens the circulation working time, improves the business approval efficiency and realizes the fine management.
The foregoing embodiments are merely illustrative of the technical concept and features of the present invention, and are intended to enable those skilled in the art to understand the present invention and to implement the same according to the present invention, not to limit the scope of the present invention. All changes and modifications that come within the meaning and range of equivalency of the invention are to be embraced within their scope.
Claims (8)
1. The intelligent government affair information management method based on the block chain is characterized by comprising the following steps of:
s1, receiving government affair data and access authority configuration sent by a second government affair node, generating a government affair data block based on the government affair data and the access authority configuration, and then verifying the government affair data block; when the government affair data block passes the verification, the government affair data block is issued to a government affair block chain network;
s2, receiving a data access request for target government affair data sent by a first government affair node, and verifying the data access request based on access authority configuration and access control strategy; authorizing the data access request and generating a corresponding data access record when the data access request passes the verification;
s3, acquiring coordinate points of the first government node and the second government node based on the positions of the first government node and the second government node, calculating tangent values of the coordinate points of the second government node and the coordinate points of the first government node according to the coordinate points of the first government node and the second government node to obtain a standard path direction angle, and then taking the second government node as a target government node;
s4, taking all government nodes in the communication range of the target government node as candidate government nodes, acquiring coordinate points of all candidate government nodes, and then calculating tangent values of the coordinate points of each candidate government node and the coordinate points of the first government node based on the coordinate points of each candidate government node and the coordinate points of the first government node to obtain a reference path direction angle of each candidate government node;
s5, calculating the deviation of each reference path direction angle and the standard path direction angle, taking the candidate government affair node corresponding to the reference path direction angle with the minimum deviation as a path node, and taking the path node as a target government affair node;
s6, repeating the steps S4-S5 until a first government affair node exists in the communication range of the target government affair node, sequentially connecting a second government affair node, all path nodes and the first government affair node to obtain a shortest data transmission path, and then transmitting the target government affair data from the second government affair node to the first government affair node according to the data quantity of the target government affair data and the shortest data transmission path; transmitting the target government affair data from the second government affair node to the first government affair node according to the data quantity of the target government affair data and the shortest data transmission path comprises: comparing the data volume of the target government affair data with a data volume threshold value, and transmitting the target government affair data from the second government affair node to the first government affair node according to the shortest data transmission path when the data volume of the target government affair data is smaller than the data volume threshold value; when the data volume of the target government affair data is larger than a data volume threshold value, carrying out data segmentation on the target government affair data to divide the target government affair data into a plurality of government affair data segments with different data volumes, arranging all the government affair data segments according to the data volumes from large to small, and then setting the sequence number of each government affair data segment based on the arrangement sequence; acquiring a plurality of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path, arranging the shortest data transmission path and the candidate data transmission paths according to the path length of the data transmission paths from small to large, and then setting the sequence number of each data transmission path based on the arrangement sequence; selecting a corresponding data transmission path for each government data segment according to the sequence number of the data transmission path and the sequence number of the government data segment, and transmitting each government data segment from the second government node to the first government node through the corresponding data transmission path;
and S7, generating an access record block based on the data access record, verifying the access record block, and transmitting the access record block to a government block network to update a government block chain network when the access record block passes the verification.
2. The method of claim 1, wherein the data splitting of the target government data to obtain a plurality of government data segments comprises:
taking the target government affair data as first government affair data, extracting the data structure characteristics of the first government affair data to obtain a data structure characteristic matrix of the first government affair data, and dividing the first government affair data into a plurality of first government affair sub-data based on the data structure characteristic matrix of the first government affair data;
arranging all the first government affair sub-data from large to small according to the data volume to generate a first government affair sub-data sequence, selecting a first government affair data section from the first government affair sub-data sequence, and integrating all the first government affair sub-data except the first government affair data section in the first government affair data to obtain second government affair data;
comparing the data quantity of the second government affair data with a data quantity threshold, dividing the second government affair data into a plurality of second government affair sub-data according to the data structure characteristics of the second government affair data when the data quantity of the second government affair data is larger than the data quantity threshold, arranging all the second government affair sub-data from large to small according to the data quantity to generate a second government affair sub-data sequence, and then selecting a second government affair data segment from the second government affair sub-data sequence;
data integration is carried out on all second government affair sub-data except for the second government affair data segment in the second government affair data so as to obtain third government affair data;
performing N iterations on the steps until the data volume of the Nth government data is smaller than a data volume threshold value, stopping data division on the Nth government data so as to divide the target government data into a plurality of government data segments with different data volumes;
setting sequence numbers for each government data segment according to the iteration sequence of each government data segment; the sequence number of the first government affair data section is one, the sequence number of the second government affair data section is two, and the sequence number of the Nth government affair data section is N.
3. The method of claim 2, wherein selecting a first segment of government affair data from the first sequence of government affair sub-data comprises:
traversing all the first government affair sub-data according to the arrangement sequence of the first government affair sub-data in the first government affair sub-data sequence, taking the traversed first government affair sub-data as first target government affair sub-data, and comparing the data quantity of the first target government affair sub-data with a data quantity threshold value;
stopping traversing and taking the first target government affair sub-data as a first government affair data segment when the data volume of the first target government affair sub-data is smaller than or equal to a data volume threshold value;
when the data volume of the first target government affair sub data is larger than a data volume threshold value, taking the next first government affair sub data in the first government affair sub data sequence as first target government affair sub data;
repeating the steps until the data volume of the first target government affair sub-data is less than or equal to the data volume threshold value.
4. The method of claim 3, wherein extracting the data structure characteristics of the first government data to obtain the data structure characteristics matrix of the first government data comprises:
acquiring all data nodes of first government affair data, wherein the data nodes are data storage units;
connecting all the data nodes based on the distribution condition of the data nodes to generate a data structure tree of the first government affair data, and taking the data nodes with sub-nodes in the data structure tree of the first government affair data as characteristic data nodes to obtain a plurality of characteristic data nodes;
acquiring all characteristic data nodes, acquiring Euclidean distance between the characteristic data nodes and each data node, and taking the data nodes with Euclidean distance smaller than a preset distance threshold as associated data nodes of the characteristic data nodes;
counting the number of associated data nodes of each feature data node, taking the feature data nodes with the number of the associated data nodes being greater than or equal to a first preset threshold value as core feature data nodes, and taking the feature data nodes with the number of the associated data nodes being less than the first preset threshold value as edge feature data nodes;
and acquiring a data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node.
5. The method of claim 4, wherein obtaining a data structure feature matrix of the first government affair data based on the core feature data node and the edge feature data node comprises:
acquiring positions of core feature data nodes and edge feature data nodes in a data structure tree;
taking the core feature data nodes with the number of the sub-nodes smaller than a second preset threshold value as first core feature nodes, and taking the core feature data nodes with the number of the sub-nodes larger than or equal to the second preset threshold value as second core feature nodes;
taking edge characteristic data nodes with the number of the sub-nodes being smaller than a second preset threshold value as first edge characteristic nodes, and taking edge characteristic data nodes with the number of the sub-nodes being larger than or equal to the second preset threshold value as second edge characteristic nodes;
initializing each first core feature node by using a unit vector, and mapping the unit vector to a multidimensional vector space to obtain a feature vector of each first edge feature node; initializing each first edge characteristic node by using a zero vector, and mapping the zero vector to a multidimensional vector space to obtain a characteristic vector of each first edge characteristic node;
the method comprises the steps of obtaining feature vectors of sub-nodes of each second core feature node, and accumulating the feature vectors of all the sub-nodes of each second core feature node to obtain the feature vector of each second core feature node; the feature vector of the sub-node of each second edge feature node is obtained, and the feature vectors of all the sub-nodes of each second edge feature node are accumulated to obtain the feature vector of each second edge feature node;
and performing matrix expansion according to the feature vectors of all the second core feature nodes and the feature vectors of all the second edge feature nodes to generate a data structure feature matrix of the first government data.
6. The method of claim 5, wherein selecting the data transmission path for each of the government data segments based on the sequential numbering of the data transmission paths and the sequential numbering of the government data segments comprises:
acquiring the sequence numbers of each data transmission path and each government data segment, and taking the government data segments with the same sequence numbers and the data transmission paths as a data transmission pair to obtain a plurality of data transmission pairs; the data transmission path comprises a shortest data transmission path and a candidate data transmission path;
traversing all the data transmission pairs, taking the traversed data transmission pair as a target data transmission pair, taking a data transmission path in the target data transmission pair as a target data transmission path, and taking a government affair data segment in the target data transmission pair as a target government affair data segment;
judging whether the target data transmission pair has data missing and node missing or not; the data loss is that the corresponding government data segment is damaged or lost; the node missing is that the node of the corresponding data transmission path is crashed or paralyzed;
when the target data transmission pair does not have data missing or node missing, queuing the target government affair data segment on a node of a target data transmission path, and transmitting the target government affair data segment from a second government affair node to a first government affair node through the target data transmission path;
when the target data transmission pair has data missing or node missing, queuing the target government data segment on the node of the target data transmission path, and judging whether the target data transmission pair completes data repair and node repair within a preset time threshold;
when data repair and node repair are completed within a preset time threshold, transmitting a target government affair data segment from a second government affair node to a first government affair node through a target data transmission path; and when the data restoration and the node restoration are not completed within the preset time threshold, reselecting a data transmission path for the target government data segment.
7. The method of claim 6, wherein obtaining a number of candidate data transmission paths from the second government node to the first government node based on the shortest data transmission path comprises:
taking other nodes except the first government service node and the second government service node in the shortest data transmission path as path nodes; traversing all path nodes, and taking the path node being traversed as a target path node;
acquiring a data transmission path from a second government node to a target path node in the shortest data transmission path, taking the data transmission path as a first candidate sub-path, and generating a second candidate sub-path according to a coordinate point of a target coordinate node and a coordinate point of the first government node;
connecting the first candidate sub-path and the second candidate sub-path through a target path node to obtain a candidate data transmission path;
repeating the steps until all the path nodes are traversed to obtain a plurality of candidate access path connections.
8. The method of claim 7, wherein the first government node is a government node in which a data requester of government data is located; the second government node is a government node where a data provider of government data is located; the government affair node is a network node in a government affair block chain network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110928425.9A CN113722728B (en) | 2021-08-13 | 2021-08-13 | Intelligent government affair information management method based on block chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110928425.9A CN113722728B (en) | 2021-08-13 | 2021-08-13 | Intelligent government affair information management method based on block chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113722728A CN113722728A (en) | 2021-11-30 |
| CN113722728B true CN113722728B (en) | 2023-09-15 |
Family
ID=78675754
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110928425.9A Active CN113722728B (en) | 2021-08-13 | 2021-08-13 | Intelligent government affair information management method based on block chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113722728B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117575276A (en) * | 2023-12-07 | 2024-02-20 | 山邮数字科技(山东)有限公司 | Intelligent government affair information resource management system based on blockchain |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104575075A (en) * | 2015-01-14 | 2015-04-29 | 合肥革绿信息科技有限公司 | City road network vehicle coordinate correcting method and device based on plough satellite |
| CN109858258A (en) * | 2018-12-28 | 2019-06-07 | 北京市天元网络技术股份有限公司 | Government data based on block chain exchanges method and device |
| CN110597832A (en) * | 2019-09-12 | 2019-12-20 | 腾讯云计算（北京）有限责任公司 | Government affair information processing method and device based on block chain network, electronic equipment and storage medium |
| WO2020000778A1 (en) * | 2018-06-28 | 2020-01-02 | 平安科技（深圳）有限公司 | Government service processing method and apparatus, computer device and readable storage medium |
| CN111861736A (en) * | 2020-08-06 | 2020-10-30 | 深圳壹账通智能科技有限公司 | Block chain-based government affair data processing method and device and computer equipment |
-
2021
- 2021-08-13 CN CN202110928425.9A patent/CN113722728B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104575075A (en) * | 2015-01-14 | 2015-04-29 | 合肥革绿信息科技有限公司 | City road network vehicle coordinate correcting method and device based on plough satellite |
| WO2020000778A1 (en) * | 2018-06-28 | 2020-01-02 | 平安科技（深圳）有限公司 | Government service processing method and apparatus, computer device and readable storage medium |
| CN109858258A (en) * | 2018-12-28 | 2019-06-07 | 北京市天元网络技术股份有限公司 | Government data based on block chain exchanges method and device |
| CN110597832A (en) * | 2019-09-12 | 2019-12-20 | 腾讯云计算（北京）有限责任公司 | Government affair information processing method and device based on block chain network, electronic equipment and storage medium |
| CN111861736A (en) * | 2020-08-06 | 2020-10-30 | 深圳壹账通智能科技有限公司 | Block chain-based government affair data processing method and device and computer equipment |
Non-Patent Citations (2)
| Title |
|---|
| 一种混合路径规划方法在装甲车辆CGF中的应用;邓青;薛青;陈琳;陈俊;;兵器装备工程学报(第07期);全文 * |
| 区块链在政务领域中的应用;龚炜;;电子技术与软件工程(第05期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113722728A (en) | 2021-11-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107193490B (en) | Distributed data storage system and method based on block chain | |
| US9110724B2 (en) | Selecting computing nodes in cloud service using replication topologies | |
| Wang et al. | Circuit oram: On tightness of the goldreich-ostrovsky lower bound | |
| KR20190077765A (en) | Method of storing data using block-chain and Cloud System using thereof | |
| CN113722728B (en) | Intelligent government affair information management method based on block chain | |
| CN116610896B (en) | Manufacturing service supply and demand matching method based on subgraph isomorphism | |
| Cancela et al. | Rare event analysis by Monte Carlo techniques in static models | |
| CN113900810A (en) | Distributed graph processing method, system and storage medium | |
| CN109858285B (en) | Block chain data processing method, device, equipment and medium | |
| CN111260475A (en) | Data processing method, block chain node point equipment and storage medium | |
| Kabulov et al. | Systematic analysis of blockchain data storage and sharing technology | |
| CN112364022B (en) | Information deduction management method, device, computer equipment and readable storage medium | |
| CN113886817A (en) | Host intrusion detection method and device, electronic equipment and storage medium | |
| CN107257356B (en) | Social user data optimal placement method based on hypergraph segmentation | |
| CN117376092A (en) | Fault root cause positioning method, device, equipment and storage medium | |
| Liu et al. | Emergency scheduling optimization simulation of cloud computing platform network public resources | |
| CN116938523A (en) | Blockchain system, operating method, electronic device and storage medium | |
| TWI814556B (en) | A model protection method, data processing method, device, equipment and medium | |
| CN115758477A (en) | Novel data integrity verification method | |
| CN113469377B (en) | Federal learning auditing method and device | |
| CN113242305B (en) | Cross-chain transaction processing method, device, computer equipment and medium | |
| CN115426221A (en) | Gateway device of Internet of things | |
| Liu et al. | OverlapShard: Overlap-based sharding mechanism | |
| CN112541834B (en) | Identifier processing method, device and system for hydropower industry digital object | |
| CN113254218A (en) | Resource deployment method, system, equipment and storage medium of model |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20230822 Address after: 518000 Room 201, building A, 1 front Bay Road, Shenzhen Qianhai cooperation zone, Shenzhen, Guangdong Applicant after: Shenzhen Fa Natural Information Technology Co.,Ltd. Address before: 610000 Tianfu Software Park, Tianhua 2nd Road, Wuhou District, Chengdu, Sichuan Applicant before: Liu Yingsen |
|
| TA01 | Transfer of patent application right | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |