CN113342523B - Battle architecture balance analysis method, device, equipment and medium - Google Patents
Battle architecture balance analysis method, device, equipment and medium Download PDFInfo
- Publication number
- CN113342523B CN113342523B CN202110625087.1A CN202110625087A CN113342523B CN 113342523 B CN113342523 B CN 113342523B CN 202110625087 A CN202110625087 A CN 202110625087A CN 113342523 B CN113342523 B CN 113342523B
- Authority
- CN
- China
- Prior art keywords
- degree
- node
- architecture
- combat
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5083—Techniques for rebalancing the load in a distributed system
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application relates to a combat architecture balance analysis method, a device, equipment and a medium, wherein the method comprises the following steps: acquiring a node set of a topology of a combat architecture; the node set comprises nodes of a topology of the combat architecture; performing degree aggregation degree-based balance analysis processing according to the node set to obtain degree aggregation degree-based balance values of the combat architecture; performing equilibrium analysis processing based on the medium aggregation degree according to the node set to obtain equilibrium value based on the medium aggregation degree of the combat architecture; and carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture. In practical application examples, the method is effective and high in accuracy, achieves the effect of effectively and accurately acquiring the balance of the combat architecture, and can provide reliable data reference for performance evaluation of the combat architecture.
Description
Technical Field
The present application relates to the field of data processing technologies, and in particular, to a method, an apparatus, a device, and a medium for analyzing balance of a combat architecture.
Background
The combat architecture is characterized in that various system elements playing different combat roles, executing different task activities and playing different functions are mutually associated by establishing various interconnection relations such as command relations, communication relations, organization relations and resource flow relations according to a set mode, and the combat system is driven to effectively operate and play combat efficacy by utilizing efficient processing of information and data and orderly interaction of personnel and materials. The high and new technology represented by the Internet of things and artificial intelligence is widely applied to military, various novel combat patterns such as mosaic combat and distributed combat are generated, a modern combat system is promoted to rapidly develop towards the decentralization and flattening directions, and a higher equilibrium requirement is provided for the combat system structure, so that the combat system structure must have a structural organization relationship with uniform layout and load balance, and the task aim can be achieved more flexibly and autonomously in the future combat process.
The current research on the field of combat architecture is mainly focused on design optimization, modeling simulation, engineering application and the like. However, in the process of implementing the invention, the inventor finds that in the traditional operational architecture analysis method, the analysis results of structural properties such as equilibrium, expansibility and the like are relatively lacking, the requirements of the development of the modern operational architecture cannot be completely met, and the technical problem that the equilibrium of the operational architecture cannot be effectively and accurately obtained exists.
Disclosure of Invention
In view of the foregoing, it is desirable to provide a combat architecture equalization analysis method, a combat architecture equalization analysis apparatus, a computer device, and a computer-readable storage medium that can effectively and accurately acquire equalization of a combat architecture.
In order to achieve the above object, the embodiment of the present invention adopts the following technical scheme:
in one aspect, an embodiment of the present invention provides a method for analyzing balance of a combat architecture, including the steps of:
acquiring a node set of a topology of a combat architecture; the node set comprises nodes of a topology of the combat architecture;
performing degree aggregation degree-based balance analysis processing according to the node set to obtain degree aggregation degree-based balance values of the combat architecture;
performing equilibrium analysis processing based on the medium aggregation degree according to the node set to obtain equilibrium value based on the medium aggregation degree of the combat architecture;
and carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture.
In another aspect, there is also provided an operation architecture balance analysis device, including:
the node acquisition module is used for acquiring a node set of the topology of the combat architecture; the node set comprises nodes of a topology of the combat architecture;
the degree balancing module is used for carrying out degree aggregation degree-based balancing analysis processing according to the node set to obtain degree aggregation degree-based balancing values of the combat architecture;
the medium number balancing module is used for carrying out balance analysis processing based on the medium number aggregation degree according to the node set to obtain a balance value based on the medium number aggregation degree of the combat architecture;
and the balance analysis module is used for carrying out weighted summation processing on the balance value based on the degree aggregation degree and the balance value based on the medium aggregation degree to obtain a balance analysis result based on the aggregation degree of the combat architecture.
In yet another aspect, there is also provided a computer device comprising a memory storing a computer program and a processor implementing the steps of any of the above-described combat architecture balance analysis methods when the computer program is executed.
In yet another aspect, there is also provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the above-described combat architecture balance analysis method of any of the above.
One of the above technical solutions has the following advantages and beneficial effects:
according to the balance analysis method, the device, the equipment and the medium of the battle architecture, the structural balance analysis judging method is researched and designed from two angles of degree polymerization and medium polymerization based on the mutual polymerization degree of structural elements by aiming at the balance analysis problem of the battle architecture, firstly, a node set of the topology of the battle architecture is obtained, then balance analysis processing based on the degree polymerization degree and balance analysis processing based on the medium polymerization degree are respectively carried out, and weighted summation is carried out on the balance value based on the degree polymerization degree and the balance value based on the medium polymerization degree, so that a balance analysis result based on the polymerization degree of the battle architecture is obtained. In practical application examples, the validity and the accuracy of the method are fully verified, the effect of effectively and accurately acquiring the balance of the combat architecture is achieved, and reliable data reference can be provided for combat architecture construction development planning and structural performance evaluation.
Drawings
FIG. 1 is a flow diagram of a method of operational architecture equalization analysis in one embodiment;
FIG. 2 is a schematic diagram of an acquisition flow of an equilibrium value based on degree aggregation in one embodiment;
FIG. 3 is a schematic diagram of an acquisition flow of a balanced value based on a degree of medium aggregation in one embodiment;
FIG. 4 is a schematic diagram of a minimum recursion unit of a DCell model in one embodiment;
FIG. 5 is a schematic diagram of a DCell model with a one-layer recursive structure in one embodiment;
FIG. 6 is E in one embodiment 1 A schematic diagram of the situation as a function of the increase of L;
FIG. 7 is E in one embodiment 2 A schematic diagram of the situation as a function of the increase of L;
fig. 8 is E when l=0 in one embodiment 1 And E is 2 Schematic diagram of the situation as a function of N;
fig. 9 shows E when l=1 in one embodiment 1 And E is 2 Varying with NA situation schematic;
FIG. 10 is a schematic diagram of E as N increases in one embodiment;
FIG. 11 is a graph of E as a function of w in one embodiment 1 A schematic diagram of the situation as a function of the increase in (a);
fig. 12 is a schematic block diagram of a combat architecture balance analysis device according to an embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein in the description of the application is for the purpose of describing particular embodiments only and is not intended to be limiting of the application.
In addition, the technical solutions of the embodiments of the present application may be combined with each other, but it is necessary to be based on the fact that those skilled in the art can implement the technical solutions, and when the technical solutions are contradictory or cannot be implemented, it should be considered that the technical solutions are not combined, and are not within the scope of protection claimed by the present application.
The battle system structure provides specifications and constraints for structural elements and interconnection relations forming the battle system from different perspectives of battle, system, capability, technology and the like, and forms a structural topology taking the structural elements as nodes and the interconnection relations as links. Traditional mainstream architecture modeling tools, including DoDAF (department of defense architecture framework), UAF (universal identity authentication framework) and SysML (Systems Modeling Language, system modeling language), all describe the combat architecture topology in a variety of graphical ways, such as combat resource flow model (OV-2), combat activity model (OV-5), system interface model (SV-1), and system resource flow model (SV-2) in DoDAF.
In practical application, in order to meet the current new development requirements, the combat system needs to change the traditional structural setting, the specific functions of the original single structural elements are distributed and configured on a plurality of structural elements, and the structural elements are mutually coordinated and closely matched to execute the same tasks and play the same roles, namely, form a combat system structure with higher equilibrium, and are expressed on the system structure topology, namely, the combat system structure has lower polymerization degree.
The degree of aggregation is a key feature of the combat architecture and is a measure of the degree of centralization of the various structural elements in the combat architecture. From the two angles of functional tasks and interconnection relation, the degree of polymerization can be further divided into degree of polymerization and degree of mesogenic polymerization: the degree aggregation degree is the system structure aggregation degree determined based on the node degree, the higher the node degree aggregation degree is, the greater the task centralization degree of the system structure is, and the more unbalanced the function task distribution is; the degree of betweenness is the degree of polymerization of the architecture determined based on the betweenness of the nodes, the higher the degree of polymerization of the betweenness of the nodes, the greater the degree of relationship centralization of the architecture, and the more unbalanced the relationship flow setting.
In order to analyze and judge whether the combat architecture can face various novel combat patterns, task activities and functions are executed relatively uniformly, and based on the mutual aggregation degree among the architecture elements, the application provides a combat architecture equalization analysis method which can be used as a reference for combat architecture efficiency evaluation and construction planning. In summary, the application designs a combat architecture equalization analysis method capable of effectively and accurately acquiring equalization of a combat architecture aiming at the technical problem that equalization of the combat architecture cannot be effectively and accurately acquired in the traditional combat architecture analysis method.
Referring to fig. 1, in one aspect, the present invention provides a method for analyzing balance of a combat architecture, including steps S12 to S18 as follows:
s12, acquiring a node set of topology of a combat architecture; the set of nodes includes nodes of the topology of the combat architecture.
It will be appreciated that data of the topology of the combat architecture can be provided to the computer device for performing the combat architecture equalization analysis by means of data upload, online download, online monitoring or copying, etc. For the structure topology of any combat architecture, the data of the topology can comprise all the nodes in the structure topology, the interconnection relations among the nodes and all other association relations. The set of all nodes of the topology of the combat architecture is called a node set.
And S14, carrying out balance analysis processing based on the degree aggregation according to the node set to obtain a balance value based on the degree aggregation of the combat architecture.
It will be appreciated that the degree aggregation is largely dependent on the number of associations of the various structural elements of the combat architecture, i.e., the degree of the various nodes in the topology of the combat architecture. When any two nodes are directly connected through a certain link, the two nodes are adjacent nodes. The degree of a certain node is equal to the number of all nodes adjacent to the node.
The degree of the node represents the number of other structural elements interacted with the corresponding structural element in the process of executing the function, and reflects the task centering degree of the structural element in the combat system. However, the degree of the nodes is not equal to the degree of task centering, and when the degree of a certain node is determined, the more the total number of nodes is, the lower the degree of task centering is. Therefore, by performing the degree-polymerization-based balance analysis processing, the influence of the scale of the combat architecture can be shielded and the degree balance among the components in the combat architecture can be accurately analyzed by using the degree-polymerization-based balance value obtained.
And S16, carrying out equilibrium analysis processing based on the medium aggregation degree according to the node set to obtain equilibrium value based on the medium aggregation degree of the combat architecture.
It will be appreciated that the degree of aggregation of the bets is largely dependent on the ratio of the number of relationship flow paths through each structural element to the total number of relationship flow paths, i.e. bets for each node in the topology of the combat architecture. When a relationship flow between any two nodes needs to pass through some intermediate nodes and links in sequence, the node sequence formed is called a relationship flow path. In the context of the decentralization requirement, each structural element should have an equal role, and in order to ensure interconnection efficiency, it may be set that a relational flow path is established between any two nodes via a minimum number of intermediate nodes and links.
The equilibrium analysis processing based on the degree of polymerization of the bets is performed, and the obtained equilibrium value based on the degree of polymerization of the bets can be used for accurately analyzing the bets equilibrium among all the structural elements in the combat architecture.
And S18, carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture.
It can be understood that the combat architecture with high degree of polymerization has more structural elements with larger association relation number, and the structural elements need to interact with more other structural elements in the system operation process, so that the structural elements are more likely to be the bottleneck of the system operation and the target of important attack of enemy.
And the combat architecture with high medium aggregation degree has more structural elements with larger deviation of the relation flow, and the relation flow flowing through the structural elements is obviously more than other structural elements, so that the conditions of congestion, locking and the like, which reduce the system efficiency, are easy to cause, and the structural elements can influence the effective operation of the system if the structural elements are failed or damaged. Degree aggregation and betting aggregation reflect the balance of the combat architecture in terms of functional task allocation and relational flow setting of the architectural elements, respectively.
Therefore, the balance value of the battle system structure based on the degree of aggregation and the degree of betting aggregation is calculated, and then weighted and summed, so that the balance value of the battle system structure based on the degree of aggregation can be obtained and recorded as the balance value. Specifically, a balance value E based on degree polymerization degree is set 1 And a balance value E based on the degree of polymerization of the medians 2 The weights of (2) are w respectively 1 And w 2 And w is 1 +w 2 =1, based on degree of polymerizationThe equalization analysis result is denoted as E, and there are:
E＝w 1 ×E 1 +w 2 ×E 2 (1)
easily known 0<E is less than or equal to 1, and when the E value is larger, the task centering degree or the relation centering degree of each structural element is lower, and the balance of the whole combat system structure is better. Weight w 1 And w 2 The specific value of (2) can be selected according to the balance analysis requirements of different combat architectures.
For example, the selection criteria may include: in w 1 +w 2 =1, provided; if analysis demands pay more attention to judging whether the association relation between the nodes is set to be balanced or not, considering the balance value E based on the degree aggregation degree 1 Equilibrium value E based on medium polymerization degree 2 The judgment of the system structure equilibrium analysis result E is more important; if analysis requirements pay more attention to judging whether resource flows flowing through all nodes are balanced, considering that the balance value E is based on the degree of medium aggregation 2 Value E is taken by the balance based on degree polymerization degree 1 The judgment of the system structure equilibrium analysis result E is more important; if consider E 1 Relative to E 2 The determination of the result E is more important, then w 1 >w 2 And E is 1 The more important, w 1 The larger should be; on the contrary, w 1 <w 2 And E is 2 The more important, w 2 The larger should be.
According to the balance analysis method of the combat architecture, the structure balance analysis judgment method is researched and designed from two angles of degree polymerization degree and medium polymerization degree based on the mutual polymerization degree of structural elements by aiming at the balance analysis problem of the combat architecture, firstly, a node set of the topology of the combat architecture is obtained, then balance analysis processing based on the degree polymerization degree and balance analysis processing based on the medium polymerization degree are respectively carried out, and weighted summation is carried out on balance values based on the degree polymerization degree and balance values based on the medium polymerization degree, so that a balance analysis result based on the polymerization degree of the combat architecture is obtained. In practical application examples, the validity and the accuracy of the method are fully verified, the effect of effectively and accurately acquiring the balance of the combat architecture is achieved, and reliable data reference can be provided for combat architecture construction development planning and structural performance evaluation.
Referring to fig. 2, in one embodiment, regarding the above step S14, the following processing steps S141 and S149 may be specifically included:
s141, respectively determining adjacent node sets of all nodes according to the node sets;
s143, determining the degree of each node according to each adjacent node set;
s145, determining the degree aggregation degree of each node according to the ratio of the degree of each node to the total node number of the node set;
s147, extracting the maximum value of the degrees of polymerization as the maximum degree of polymerization, and respectively subtracting the maximum degree of polymerization from the degree of polymerization to obtain the degree balance difference of each node;
and S149, calculating the average value of the degree differences of the degree equilibrium differences of each degree, and then calculating the difference value between 1 and the average value of the degree differences to obtain the equilibrium value based on the degree polymerization degree.
Specifically, nodes = { node n And 1 is less than or equal to N is less than or equal to N, and represents a node set of a topology of a combat architecture, such as a combat node set in OV-2, a combat activity set in OV-5, a system node set in SV-2 and the like. Wherein n= |nodes| represents the total node number. With node n Bor represents any node n Is used for the adjacent node set of the (B) n Bor represents a set node of neighboring nodes n Number of elements of Bor, i.e. arbitrary node n Is a degree of (f).
To mask the impact of the scale of the combat architecture, arbitrary node nodes can be defined n Degree of polymerization of (2) is equal to node n The ratio of the number of degrees to the total number of nodes N, recorded as node n Deg, there is
node n .deg＝|node n .Bor|/N (2)
Degree to all nodesThe degree of polymerization takes the maximum value max { node ] n The deg|1 is not less than N is not less than N, and the degree polymerization degree of each node is subtracted to obtain the degree equilibrium difference of a single node, which is recorded as node n D, the following steps are:
node n .D＝max{node n .deg}-node n .deg (3)
on this basis, define the battle architecture equilibrium value based on degree polymerization (namely the equilibrium value based on degree polymerization) as: 1 and the difference of the degree equilibrium difference average value of the node is recorded as E 1 The following steps are:
substituting the formula (2) into the formula (3) and substituting the formula (4) to obtain
The equilibrium of the combat architecture can be judged according to the degree polymerization degree analysis by utilizing the method (5), and 0 is easy to know<E 1 Not more than 1, and E 1 The larger the value is, the better the degree balance among all the structural elements in the combat architecture is, and when the topology of the combat architecture is a full-connected network, E can be obtained 1 ＝1。
Through the steps, the equilibrium value based on the degree aggregation degree of the combat architecture can be rapidly and accurately obtained, and the equilibrium value based on the degree aggregation degree of different combat architectures can be obtained according to different N values in the processing modes aiming at the topology of the combat architecture with different total node numbers. Other variations of the above formulas are possible, as long as the required degree-polymerization-based balance value can be accurately obtained.
Referring to fig. 3, in one embodiment, regarding the above step S16, the following processing steps S161 to S165 may be specifically included:
s161, calculating the betweenness of each node by adopting a set processing algorithm according to the node set; the degree of aggregation of the bets of each node is respectively equal to the bets of the corresponding nodes;
s163, extracting the maximum value of the medium number polymerization degrees as the maximum medium number polymerization degree, and respectively carrying out subtraction operation on the maximum medium number polymerization degree and the medium number polymerization degrees to obtain medium number equilibrium difference of each node;
s165, after the medium number difference average value of each medium number equilibrium difference is calculated, the difference value between 1 and the medium number difference average value is calculated, and the equilibrium value based on the medium number polymerization degree is obtained.
It will be understood that the set processing algorithm refers to a processing algorithm for calculating the bets of each node in a certain structural model, and may be implemented by a program application. Specifically, the bets of the nodes represent the ratio of the number of relationship streams carried by the corresponding structural element, which is equivalent to the degree of relationship centralization of the structural element in the combat architecture. Any node can be defined herein n The degree of mesogenic polymerization of (2) is equal to node n The number of medium of (C) is recorded as node n .med。
The degree of aggregation of the bets for all nodes takes a maximum value max { node ] n The med|1 is not less than N is not less than N, and the difference of the medium number equilibrium of the single node can be obtained by subtracting the medium number polymerization degree of each node, and is recorded as node n M, then there is:
node n .M＝max{node n .med}—node n .med (6)
on the basis, defining the battle system structure equilibrium value based on the medium aggregation degree (namely the equilibrium value based on the medium aggregation degree) as follows: 1 and the difference of the mean value of the medium number equilibrium difference of the nodes is marked as E 2 The following steps are:
substituting the formula (6) into the formula (7) to obtain:
balancing value E based on medium polymerization degree 2 The range of the values is as follows: 0<E 2 ≤1，E 2 The higher the value, the better the medium number balance among the structural elements, and when the topology of the combat architecture is a full-connected network, the medium number balance difference of each node is equal to 0, at the moment E 2 =1, the architecture has the lowest degree of relational centralization.
Through the steps, the equilibrium value based on the betweenness aggregation degree of the combat architecture can be rapidly and accurately obtained, and the equilibrium value based on the betweenness aggregation degree of different combat architectures can be obtained according to different N values in the processing modes aiming at the topology of the combat architecture with different total node numbers. Other variations of the above formulas are possible, as long as the required equilibrium value based on the degree of polymerization of the bets can be accurately obtained.
In one embodiment, regarding the step S161 described above, the following processing steps may be specifically included:
selecting a current node as a starting point of traversal processing, and traversing all unselected nodes as end points;
invoking a processing algorithm based on a breadth-first algorithm, and calculating the shortest path between the starting point and each end point;
updating the number of the relation flow paths passing through each node in the shortest path according to the recorded node serial numbers on the shortest path between the two nodes and assigning the number to the betweenness array; the betweenness array is used for recording betweenness of each node;
updating the starting point by using the next node, returning to the step of executing the step of selecting the current node as the starting point of the traversing process, and traversing all the unselected nodes as the ending point until all the nodes are traversed as the starting point;
dividing each element of the betweenness array with the total relation flow path number to update the algorithm, and outputting betweenness of each node.
It will be appreciated that in the present embodiment, two algorithms are provided for enabling calculation of the bets of the nodes. Specifically, a global variable length array Path may be invoked in the algorithm for recording the node sequence number on the shortest Path between two nodes. Calling an array Selected and Media with the length of N, wherein the Selected element is 0 or 1, and the Selected element is used for recording whether a certain node is traversed; the elements of Media (i.e., a medium array) are floating point variables that record the medium of each node. R is an integer type variable for recording the total number of relational flow paths.
Algorithm 1 traverses each node as a starting point, denoted node m The method comprises the steps of carrying out a first treatment on the surface of the For each starting point, all nodes not selected as starting points are traversed as end points, denoted nodes n The method comprises the steps of carrying out a first treatment on the surface of the Algorithm 2 (i.e., breadth-first algorithm-based processing algorithm) is invoked to calculate the node m And node n And continuously updating the number of the relation flow paths passing through each node in the shortest Path according to the Path and assigning the relation flow paths to corresponding elements of Media. When all nodes are traversed as starting points, dividing each element of Media by the total relation flow quantity R, and updating the algorithm to obtain the betweenness of each node.
In one embodiment, regarding the step of calculating the shortest path between the start point and each end point by invoking the processing algorithm based on the breadth-first algorithm, the following processing steps may be specifically included:
creating a linked list structure body based on a breadth-first algorithm; the linked list structure body is used for recording nodes to be traversed except for the starting point, and the attribute of the linked list structure body comprises the serial numbers of the nodes and the serial numbers of the connected previous nodes;
adding adjacent nodes of the starting point into a linked list structure body, and setting the sequence number of the previous node of each adjacent node as the starting point;
judging the end point of each node in the linked list structure one by one;
If the judging result is the end point, the node serial numbers on the shortest paths are sequentially recorded into a node serial number array according to the attribute of the linked list structure body from the end point to the start point, and the shortest paths between the start point and the end points are determined.
Specifically, a linked list structure NodeList is first created to record nodes that need to be traversed except for the starting point, so as to determine whether the nodes are end points, and the structure attribute of the node comprises the sequence number seq of the node and the sequence number prev of the previous node connected with the node. Then, neighboring nodes of the start point are added to the NodeList, and the sequence number prev of the previous node of each neighboring node is set as the start point. And then judging whether the nodes in the NodeList are end points one by one. If the result is yes, according to the structure body attribute of the NodeList, the node serial numbers on the shortest Path are sequentially recorded into the Path according to the sequence from the end point to the starting point, and the algorithm program returns a successful identification of traversing processing, for example, returns a value of 1. A success flag indicates that the shortest path calculation between the start point and each end point was successful.
The shortest path between the output starting point and each end point can be efficiently calculated through the processing steps.
In one embodiment, regarding the above-mentioned procedure of calling the breadth-first algorithm, the step of calculating the shortest path between the start point and each end point may specifically further include the following procedure:
If the judging result is not the end point, adding the adjacent nodes of the current node to the tail of the linked list structure body, and setting the serial number of each adjacent node as the current node.
Specifically, if the above determination result about whether the node is the destination is not yes, adding the neighboring nodes of the current node to the end of the NodeList queue, and setting prev of each neighboring node as the current node. The calculation processing of the next node can be efficiently entered through the processing steps.
In one embodiment, regarding the above-mentioned procedure of calling the breadth-first algorithm, the step of calculating the shortest path between the start point and each end point may specifically further include the following procedure:
if the end point is not found yet after the traversal is finished, returning a failure identifier of the traversal process; the failure flag is used to indicate that the shortest path between the start point and each end point fails to calculate.
Specifically, at the end of the traversal process of algorithm 2 above, if no endpoint is still found, the algorithm program may return a failure flag, e.g., return a value of 0. When the endpoint can not be found through the processing steps, the program calculation is jumped out to carry out corresponding indication, and the waste of calculation resources is avoided.
In one embodiment, in order to more intuitively and fully describe the above-described method for analyzing structural balance of a combat architecture, the following is an example of the method proposed by the present invention, taking structural balance analysis of an intelligent combat architecture to which the above-described method is applied as an example. It should be noted that, the embodiments given in the present specification are only illustrative, and not the only limitation of the specific embodiments of the present invention, and those skilled in the art may implement the structural balance analysis on different combat systems by using the above-mentioned method for analyzing the structural balance of combat systems under the illustration of the embodiments provided by the present invention.
In view of the better expansibility and flattening characteristics of the recursive hierarchical structure, it is assumed that a certain intelligent combat system adopts a typical recursive hierarchical structure model DCell as a structural topology. A higher level network topology in the recursion hierarchy is formed by interconnecting a plurality of lower level recursion units according to a recursion rule, and a recursion unit for constructing a higher level network topology is also formed. The DCell establishes the minimum recursion unit according to the node connection mode of the star-shaped graph, as shown in fig. 4, takes the node connection mode of the complete graph as a recursion rule, and a pair of structural elements are directly connected between any two recursion units at the same level, as shown in fig. 5.
The minimum recursion unit node number of the combat architecture is recorded as K, the recursion level number is recorded as L, and E corresponding to different K is obtained according to the construction mode of the algorithm and the DCell model when K=2, 3, 4 or 5,L =0, 1, 2, 3 or 4 1 And E is 2 The values change as L increases, as shown in fig. 6 and fig. 7, respectively, where l=0 is the minimum recursion unit. It can be found that E 1 And E is 2 The value increases along with the increase of the number L of the recursion layers and reaches the maximum value 1 rapidly, which shows that the structural balance of the system based on the degree polymerization degree and the medium polymerization degree is improved rapidly along with the increase of the structural scale of the DCell model. L in FIG. 7E when=1 and k=3 2 The reduction in value is caused by the expansion of the difference in the equilibrium of bets of the operational nodes in this case, E as L increases 2 The value still has a growing trend.
To compare corresponding E of the same structural scale 1 And E is 2 In the variation, the calculation result when the number of recursion layers L is determined and the number of nodes N is increased is given as shown in fig. 8 and 9. Fig. 8 shows the result change situation of l=0, where the structure topology is a star-shaped graph, and when the number of nodes increases, the obtained equilibrium value is in a decreasing trend no matter based on the degree polymerization degree or the medium number polymerization degree, which indicates that as the structure scale increases, only the DCell minimum recursion unit is adopted as the structure topology, and the equilibrium of the combat architecture is lower. Fig. 9 shows the result change situation of l=1, where the structure topology connects a plurality of minimum recursion units in a complete graph, and the increase of the number of nodes gradually balances the equalization difference of the star graph, so that the obtained equalization value starts to decline slightly and then rises again with the increase of the structure scale.
According to the formula (1), E is required to be set in order to obtain the balance comprehensive value of the combat architecture based on the polymerization degree 1 And E is 2 Is a weight of (2). Fig. 10 shows when l= 0,w 1 ＝w 2 When=0.5, the value of E varies with the increase of N, and it can be seen that E will 1 And E is 2 Setting the same weight, and obtaining E capable of neutralizing E 1 And E is connected with 2 Is especially when E 1 And E is connected with 2 When the phase difference is large, as in the case of n=4.
To analyze the effect of weight change on the calculation results, fig. 11 gives l=0, n=6, and l=1, n=36, w 1 E takes value along with w when increasing from 0.1 to 0.9 with 0.1 as step length 1 In the case of change by increase in (w) 2 The step size is reduced from 0.9 to 0.1 by 0.1, which is not shown in the figure. When l=0, n=6, it can be seen from fig. 8 that E 1 The value is smaller than E 2 And E is 1 Simultaneous E of weight increase 2 The weight will decrease, resulting in the E value of FIG. 11 being given as w 1 The increase in (c) gradually decreases. When l=1, n=36, rootAs can be seen from FIG. 9E 1 The value is greater than E 2 Thus, E in FIG. 11 takes on value as w 1 The increase in (2) is gradually increasing. Fig. 11 also shows that the change in E value is more gradual when l=1, n=36 than when l=0, n=6, because E is when l=1, n=36 1 And E is connected with 2 The difference between (c) is smaller than when l=0 and n=6.
The effectiveness and the accuracy of the battle system structure balance analysis method are verified through the calculation example, and a reference can be provided for battle system construction development planning and structural performance analysis evaluation.
It should be understood that, although the steps in the flowcharts of fig. 1 to 3 are shown in order as indicated by the arrows, these steps are not necessarily performed in order as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Furthermore, at least a portion of the steps of fig. 1-3 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor does the order in which the sub-steps or stages are performed necessarily occur sequentially, but may be performed alternately or alternately with at least a portion of the sub-steps or stages of other steps or other steps.
Referring to fig. 12, in one embodiment, there is further provided a combat architecture balance analysis apparatus 100, including a node acquisition module 11, a degree balance module 13, a betting balance module 15, and a balance analysis module 17. Wherein, the node acquisition module 11 is used for acquiring a node set of topology of the combat architecture; the set of nodes includes nodes of the topology of the combat architecture. The degree balancing module 13 is configured to perform a degree aggregation degree-based balancing analysis process according to the node set, so as to obtain a degree aggregation degree-based balancing value of the combat architecture. The betweenness balancing module 15 is used for carrying out balancing analysis processing based on betweenness aggregation according to the node set to obtain balancing value based on betweenness aggregation of the combat architecture. The balance analysis module 17 is configured to perform weighted summation processing on the balance value based on the degree aggregation degree and the balance value based on the medium aggregation degree, so as to obtain a balance analysis result based on the degree aggregation of the combat architecture.
The above-mentioned battle architecture balance analysis device 100, through cooperation of the modules, starts from two angles of degree aggregation and medium aggregation based on the mutual aggregation degree between the structural elements, and researches and designs a structural balance analysis judgment method, firstly obtains a node set of topology of the battle architecture, then respectively performs balance analysis processing based on degree aggregation and balance analysis processing based on medium aggregation, and performs weighted summation on balance values based on degree aggregation and balance values based on medium aggregation, thereby obtaining balance analysis results based on aggregation of the battle architecture. In practical application examples, the validity and the accuracy of the method are fully verified, the effect of effectively and accurately acquiring the balance of the combat architecture is achieved, and reliable data reference can be provided for combat architecture construction development planning and structural performance evaluation.
In one embodiment, the degree balancing module 13 may include a neighbor sub-module, a degree aggregation sub-module, a degree difference sub-module, and a degree value sub-module. The adjacent point sub-module is used for respectively determining adjacent node sets of all the nodes according to the node sets. The node degree submodule is used for determining the degree of each node according to each adjacent node set. The degree aggregation submodule is used for determining the degree aggregation degree of each node according to the ratio of the degree of each node to the total node number of the node set. The degree difference submodule is used for extracting the maximum value of the degrees of polymerization degrees as the maximum degree of polymerization degree, and subtracting the maximum degree of polymerization degree from the degrees of polymerization degree to obtain the degree balance difference of each node. The degree value sub-module is used for calculating the degree difference average value of the degree equilibrium difference of each degree, and then calculating the difference value between 1 and the degree difference average value to obtain the equilibrium value based on the degree polymerization degree.
In one embodiment, the betting balance module 15 may include a betting sub-module, a betting difference sub-module, and a betting value sub-module. The node intermediate sub-module is used for calculating the intermediate number of each node by adopting a set processing algorithm according to the node set; the degree of aggregation of the bets of each node is equal to the bets of the corresponding nodes. The medium number difference submodule is used for extracting the maximum value in the medium number polymerization degrees as the maximum medium number polymerization degree, and subtracting the maximum medium number polymerization degree from each medium number polymerization degree to obtain the medium number equilibrium difference of each node. And the medium number value sub-module is used for calculating the medium number difference average value of each medium number equilibrium difference, and then calculating the difference value between 1 and the medium number difference average value to obtain the equilibrium value based on the medium number polymerization degree.
In one embodiment, the node sub-module may be specifically configured to select a current node as a starting point of the traversal process, and traverse all unselected nodes as an end point; invoking a processing algorithm based on a breadth-first algorithm, and calculating the shortest path between the starting point and each end point; updating the number of the relation flow paths passing through each node in the shortest path according to the recorded node serial numbers on the shortest path between the two nodes and assigning the number to the betweenness array; the betweenness array is used for recording betweenness of each node; updating the starting point by using the next node, returning to execute the step of selecting the current node as the starting point of the traversing process, and traversing all the unselected nodes as the end points until all the nodes are traversed as the starting points; dividing each element of the betweenness array with the total relation flow path number to update the algorithm, and outputting betweenness of each node.
In one embodiment, the node sub-module may be specifically configured to create a linked list structure based on the breadth-first algorithm when used to invoke a processing algorithm based on the breadth-first algorithm to calculate a shortest path between a start point and each end point; the linked list structure is used for recording nodes to be traversed except for the starting point, and the attribute of the linked list structure comprises the sequence number of the node and the sequence number of the connected previous node. And adding adjacent nodes of the starting point into the linked list structure body, and setting the sequence number of the previous node of each adjacent node as the starting point; judging the end point of each node in the linked list structure one by one; and when the judging result is the end point, according to the attribute of the linked list structure body, sequentially recording the node serial numbers on the shortest path into a node serial number array according to the sequence from the end point to the start point, and determining the shortest path between the start point and each end point.
In one embodiment, the node sub-module is further specifically configured to, when the processing algorithm based on the breadth-first algorithm is used to call, calculate a shortest path between a start point and each end point, add neighboring nodes of the current node to a tail end of a linked list structure body when the discrimination result is not the end point, and set a sequence number of each neighboring node as the current node.
In one embodiment, the node sub-module is further configured to, when being configured to invoke a processing algorithm based on a breadth-first algorithm, calculate a shortest path between a starting point and each end point, and specifically, return a failure identifier of the traversal process when the end point is not found yet at the end of the traversal; the failure flag is used to indicate that the shortest path between the start point and each end point fails to calculate.
For specific limitations of the combat architecture balance analysis apparatus 100, reference may be made to the corresponding limitations of the combat architecture balance analysis method hereinabove, and will not be described in detail herein. The respective modules in the above-described combat architecture balance analysis apparatus 100 may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be stored in a memory of the above device, or may be stored in software, so that the processor may call and execute operations corresponding to the above modules, where the above device may be, but is not limited to, various data computing and analyzing devices existing in the art.
In yet another aspect, a computer device is provided, including a memory storing a computer program and a processor, where the processor, when executing the computer program, may implement the steps of: acquiring a node set of a topology of a combat architecture; the node set comprises nodes of a topology of the combat architecture; performing degree aggregation degree-based balance analysis processing according to the node set to obtain degree aggregation degree-based balance values of the combat architecture; performing equilibrium analysis processing based on the medium aggregation degree according to the node set to obtain equilibrium value based on the medium aggregation degree of the combat architecture; and carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture.
In one embodiment, the processor, when executing the computer program, may further implement the steps or sub-steps added to the embodiments of the combat architecture equalization analysis method described above.
In yet another aspect, there is also provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of: acquiring a node set of a topology of a combat architecture; the node set comprises nodes of a topology of the combat architecture; performing degree aggregation degree-based balance analysis processing according to the node set to obtain degree aggregation degree-based balance values of the combat architecture; performing equilibrium analysis processing based on the medium aggregation degree according to the node set to obtain equilibrium value based on the medium aggregation degree of the combat architecture; and carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture.
In one embodiment, the computer program, when executed by the processor, may also implement the steps or sub-steps added to the embodiments of the combat architecture equalization analysis method described above.
Those skilled in the art will appreciate that implementing all or part of the above-described methods may be accomplished by way of a computer program, which may be stored on a non-transitory computer readable storage medium, that when executed may comprise the steps of the embodiments of the methods described above. Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus dynamic random access memory (Rambus DRAM, RDRAM for short), and interface dynamic random access memory (DRDRAM), among others.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The foregoing examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the application. It should be noted that it is possible for those skilled in the art to make several variations and modifications without departing from the spirit of the present application, which fall within the protection scope of the present application. The scope of the application is therefore intended to be covered by the appended claims.
Claims (7)
1. A method for analyzing the structural balance of a combat architecture, comprising the steps of:
acquiring a node set of a topology of a combat architecture; the set of nodes includes nodes of a topology of the combat architecture;
respectively determining adjacent node sets of the nodes according to the node sets;
determining the degree of each node according to each adjacent node set;
Determining the degree aggregation degree of each node according to the ratio of the degree of each node to the total node number of the node set;
extracting the maximum value of the degree polymerization degrees as the maximum degree polymerization degree, and respectively carrying out subtraction operation on the maximum degree polymerization degree and the degree polymerization degree to obtain the degree balance difference of each node;
after calculating the degree difference average value of each degree balance difference, calculating the difference value between 1 and the degree difference average value to obtain the balance value of the combat architecture based on the degree aggregation degree;
selecting the current node as a starting point of traversal processing, and traversing all unselected nodes as end points; invoking a processing algorithm based on a breadth-first algorithm, and calculating the shortest path between the starting point and each end point; updating the number of the relation flow paths passing through each node in the shortest path according to the recorded node serial numbers on the shortest path between two nodes and assigning the number to a betweenness array; the betweenness array is used for recording betweenness of each node; updating the starting point by using the next node, returning to the step of executing the selected current node as the starting point of the traversing process, traversing all unselected nodes as the ending point until all nodes are traversed as the starting point; dividing each element of the betweenness array with the total relation flow path number and updating an algorithm to output betweenness of each node; the degree of aggregation of the bets of the nodes is equal to the bets of the corresponding nodes respectively;
Extracting the maximum value of the medium number polymerization degrees as the maximum medium number polymerization degree, and respectively carrying out subtraction operation on the maximum medium number polymerization degree and the medium number polymerization degrees to obtain medium number equilibrium difference of each node;
after calculating the medium difference average value of each medium balance difference, calculating the difference value between 1 and the medium difference average value to obtain the balance value of the combat architecture based on the medium aggregation degree;
and carrying out weighted summation processing on the equilibrium value based on the degree aggregation degree and the equilibrium value based on the medium aggregation degree to obtain an equilibrium analysis result based on the aggregation degree of the combat architecture.
2. The method of claim 1, wherein the step of invoking a breadth-first algorithm-based processing algorithm to calculate a shortest path between the starting point and each of the ending points comprises:
creating a linked list structure body based on a breadth-first algorithm; the linked list structure is used for recording nodes to be traversed except for a starting point, and the attribute of the linked list structure comprises the sequence number of the node and the sequence number of the connected previous node;
Adding adjacent nodes of the starting point into the linked list structure body, and setting the sequence number of the previous node of each adjacent node as the starting point;
judging the end point of each node in the linked list structure one by one;
if the judging result is the end point, according to the attribute of the linked list structure body, the node serial numbers on the shortest path are sequentially recorded into a node serial number array according to the sequence from the end point to the start point, and the shortest path between the start point and each end point is determined.
3. The method of claim 2, wherein the step of invoking a breadth-first algorithm-based processing algorithm to calculate a shortest path between the starting point and each of the end points, further comprises:
if the judging result is not the end point, adding the adjacent nodes of the current node to the tail of the linked list structure body, and setting the serial number of each adjacent node as the current node.
4. A method of battle architecture balance analysis according to claim 2 or 3, wherein the step of invoking a breadth-first algorithm based processing algorithm to calculate a shortest path between the start point and each of the end points further comprises:
If the end point is not found yet after the traversal is finished, returning a failure identifier of the traversal process; the failure flag is used for indicating that the shortest path between the starting point and each of the ending points is calculated to be failed.
5. An operational architecture balance analysis device, comprising:
the node acquisition module is used for acquiring a node set of the topology of the combat architecture; the set of nodes includes nodes of a topology of the combat architecture;
a degree equalization module comprising:
the adjacent point sub-module is used for respectively determining adjacent node sets of the nodes according to the node sets;
the node degree submodule is used for determining the degree of each node according to each adjacent node set;
the degree aggregation sub-module is used for determining the degree aggregation degree of each node according to the ratio of the degree of each node to the total node number of the node set;
the degree difference submodule is used for extracting the maximum value of the degree aggregation degrees as the maximum degree aggregation degree, and subtracting the maximum degree aggregation degree from the degree aggregation degree to obtain the degree balance difference of each node;
The degree value sub-module is used for calculating the degree difference average value of each degree balance difference, and then calculating the difference value between 1 and the degree difference average value to obtain the balance value of the combat architecture based on the degree aggregation degree;
a medium equalization module comprising:
and the meson module is as follows: the method comprises the steps of selecting the current node as a starting point of traversal processing, and traversing all unselected nodes as end points; invoking a processing algorithm based on a breadth-first algorithm, and calculating the shortest path between the starting point and each end point; updating the number of the relation flow paths passing through each node in the shortest path according to the recorded node serial numbers on the shortest path between two nodes and assigning the number to a betweenness array; the betweenness array is used for recording betweenness of each node; updating the starting point by using the next node, returning to the step of executing the selected current node as the starting point of the traversing process, traversing all unselected nodes as the ending point until all nodes are traversed as the starting point; dividing each element of the betweenness array with the total relation flow path number and updating an algorithm to output betweenness of each node; the degree of aggregation of the bets of the nodes is equal to the bets of the corresponding nodes respectively;
The medium number difference submodule is used for extracting the maximum value in the medium number polymerization degrees as the maximum medium number polymerization degree, and subtracting the maximum medium number polymerization degree from the medium number polymerization degrees to obtain medium number equilibrium difference of the nodes;
the medium number value sub-module is used for calculating the medium number difference average value of each medium number equilibrium difference, and then calculating the difference value between 1 and the medium number difference average value to obtain the equilibrium value of the combat architecture based on the medium number polymerization degree;
and the balance analysis module is used for carrying out weighted summation processing on the balance value based on the degree aggregation degree and the balance value based on the medium aggregation degree to obtain a balance analysis result based on the aggregation degree of the combat architecture.
6. A computer device comprising a memory and a processor, the memory storing a computer program, characterized in that the processor, when executing the computer program, implements the steps of the combat architecture equalization analysis method of any of claims 1 to 4.
7. A computer readable storage medium having stored thereon a computer program, characterized in that the computer program when executed by a processor implements the steps of the combat architecture equalization analysis method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110625087.1A CN113342523B (en) | 2021-06-04 | 2021-06-04 | Battle architecture balance analysis method, device, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110625087.1A CN113342523B (en) | 2021-06-04 | 2021-06-04 | Battle architecture balance analysis method, device, equipment and medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113342523A CN113342523A (en) | 2021-09-03 |
| CN113342523B true CN113342523B (en) | 2023-10-03 |
Family
ID=77473996
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110625087.1A Active CN113342523B (en) | 2021-06-04 | 2021-06-04 | Battle architecture balance analysis method, device, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113342523B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506192A (en) * | 2016-10-09 | 2017-03-15 | 中国电子科技集团公司第三十六研究所 | A kind of method and apparatus of identification network key node |
| CN107707412A (en) * | 2017-11-08 | 2018-02-16 | 大连大学 | Commander based on more attribute weights controls network modeling method |
| CN108319779A (en) * | 2018-02-01 | 2018-07-24 | 大连大学 | Command and control cascade failure model method for building up based on m rank adjacency matrix |
| CN110061870A (en) * | 2019-04-10 | 2019-07-26 | 重庆邮电大学 | Efficiency estimation method is combined with side based on node in a kind of Tactical Internet |
| CN112580217A (en) * | 2020-12-25 | 2021-03-30 | 北京机电工程研究所 | Communication system structure parameterization modeling method based on complex network |
| CN112702208A (en) * | 2020-12-28 | 2021-04-23 | 西北工业大学 | Relationship-based method for generating striking link of heterogeneous multi-layer combat system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108243044B (en) * | 2016-12-27 | 2021-08-24 | 山东财兜信息科技有限公司 | Service deployment method and device |
-
2021
- 2021-06-04 CN CN202110625087.1A patent/CN113342523B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106506192A (en) * | 2016-10-09 | 2017-03-15 | 中国电子科技集团公司第三十六研究所 | A kind of method and apparatus of identification network key node |
| CN107707412A (en) * | 2017-11-08 | 2018-02-16 | 大连大学 | Commander based on more attribute weights controls network modeling method |
| CN108319779A (en) * | 2018-02-01 | 2018-07-24 | 大连大学 | Command and control cascade failure model method for building up based on m rank adjacency matrix |
| CN110061870A (en) * | 2019-04-10 | 2019-07-26 | 重庆邮电大学 | Efficiency estimation method is combined with side based on node in a kind of Tactical Internet |
| CN112580217A (en) * | 2020-12-25 | 2021-03-30 | 北京机电工程研究所 | Communication system structure parameterization modeling method based on complex network |
| CN112702208A (en) * | 2020-12-28 | 2021-04-23 | 西北工业大学 | Relationship-based method for generating striking link of heterogeneous multi-layer combat system |
Non-Patent Citations (7)
| Title |
|---|
| "Node centrality in weighted networks: Generalizing degree and shortest paths.";Opsahl, Tore, Filip Agneessens, and John Skvoretz.;《Social networks》;全文 * |
| "一种作战体系动态演化模型";温睿;马亚平;王峥;王飞;;《系统仿真学报》(07);全文 * |
| "信息化条件下作战体系节点重要性指标的选择";李茂林;龙建国;刘伟涛;;《火力与指挥控制》(08);全文 * |
| "基于复杂理论的作战网络关键边评估方法";邱原;邢焕革;;《兵工自动化》(08);全文 * |
| "基于自然连通度的复杂网络抗毁性研究";王班;马润年;王刚;;《计算机仿真》(08);全文 * |
| 丁泽柳,郭得科,申建伟,等；."面向云计算的数据中心网络拓扑研究".《国防科技大学学报》.2011,全文. * |
| 裴玉龙,张枭,塔建；."城市多模式公交拓扑网络的构建及特征分析".《交通科技与经济》.2019,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113342523A (en) | 2021-09-03 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111478811B (en) | Network key point analysis method based on double-layer information flow transmission | |
| CN107391542B (en) | Open source software community expert recommendation method based on file knowledge graph | |
| US11546361B2 (en) | Method and apparatus for organizing and detecting swarms in a network | |
| KR102060435B1 (en) | Method and apparatus of blockchain smart contract using proof-of-repuation-of-network as consensus algorithm | |
| CN111371856B (en) | Cloud computing task scheduling method and device, cloud computing system and server | |
| CN112565272A (en) | Method and device for blocking minimum Steiner tree of double-layer network and computer equipment | |
| CN111352712A (en) | Cloud computing task tracking processing method and device, cloud computing system and server | |
| CN110428015A (en) | A kind of training method and relevant device of model | |
| CN114401136A (en) | Rapid anomaly detection method for multiple attribute networks | |
| Mukhin et al. | Method for efficiency increasing of distributed classification of the images based on the proactive parallel computing approach | |
| Aloqaily et al. | Towards blockchain-based hierarchical federated learning for cyber-physical systems | |
| KR102189811B1 (en) | Method and Apparatus for Completing Knowledge Graph Based on Convolutional Learning Using Multi-Hop Neighborhoods | |
| CN111478813B (en) | Network key point analysis method based on single-layer information flow transmission | |
| CN113342523B (en) | Battle architecture balance analysis method, device, equipment and medium | |
| CN110889493A (en) | Method and device for adding disturbance aiming at relational network | |
| CN110034961A (en) | It take OODA chain as the infiltration rate calculation method of first body | |
| CN116881916A (en) | Malicious user detection method and device based on heterogeneous graph neural network | |
| CN114692168B (en) | Cloud service application program vulnerability analysis method and system based on attack big data | |
| CN113342524B (en) | Operational architecture reliability analysis method, device, equipment and medium | |
| CN115242659A (en) | High-order collective influence-based hyper-network node analysis method | |
| CN110851541B (en) | Method and device for generating risk characteristics based on relational graph | |
| CN116933841A (en) | Operator fusion method and device, electronic equipment and computer readable medium | |
| CN114238992A (en) | Threat vulnerability mining method based on big information security data and information security system | |
| Wallis et al. | QUDOS: quorum-based cloud-edge distributed DNNs for security enhanced industry 4.0 | |
| Cai et al. | Identification of Key Nodes in Distributed Access Control 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |