CN110034961B - Seepage rate calculation method taking OODA chain as element - Google Patents

Seepage rate calculation method taking OODA chain as element Download PDF

Info

Publication number
CN110034961B
CN110034961B CN201910290049.8A CN201910290049A CN110034961B CN 110034961 B CN110034961 B CN 110034961B CN 201910290049 A CN201910290049 A CN 201910290049A CN 110034961 B CN110034961 B CN 110034961B
Authority
CN
China
Prior art keywords
node
nodes
edges
calculating
ooda
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
Application number
CN201910290049.8A
Other languages
Chinese (zh)
Other versions
CN110034961A (en
Inventor
李永刚
刘晋宇
张治中
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201910290049.8A priority Critical patent/CN110034961B/en
Publication of CN110034961A publication Critical patent/CN110034961A/en
Application granted granted Critical
Publication of CN110034961B publication Critical patent/CN110034961B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/10—Complex mathematical operations
    • G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/12—Discovery or management of network topologies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/14—Network analysis or design
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
    • H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Data Mining & Analysis (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Operations Research (AREA)
  • Algebra (AREA)
  • Evolutionary Biology (AREA)
  • Databases & Information Systems (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a permeability calculation method taking an OODA chain as a cell body, which is characterized in that the OODA chain in a complex network formed by OODA is used as a motif for calculation, and the permeability taking the OODA chain as the cell body is obtained by calculating the number of the motifs in the network when the node connection probability is P. The method measures the connectivity of the network according to the number of the effective motifs in the network, can calculate the characteristic that the connectivity of the network changes along with the connection between the nodes, has important reference value for researching the permeability of an OODA network or other similar networks, and has long-term significance for the field of applying an OODA theory.

Description

Seepage rate calculation method taking OODA chain as element
Technical Field
The invention belongs to the field of tactical internet, and particularly relates to a permeability calculation method taking an OODA chain as a unit.
Background
The concept of the OODA cycle was proposed by John Boyd (John Boyd) in the university of America and the basic idea of its theory is that an armed conflict can be seen as a cyclic process of "observe-adjust-decide-act" that opponents can more quickly and better complete than each other. Both parties start with the observation, observing themselves, the observation environment and the enemy. Based on observation, relevant external information is obtained, the system is adjusted in time according to the perceived external threat, a response decision is made, and corresponding action is taken. Boyder considers that the speed of the decision cycle process of enemy and my is obviously divided into a fast speed and a slow speed. The goal of the own party should be to complete an OODA cycle first and then take action quickly to interfere with, prolong, interrupt the enemy's OODA cycle. One tactic is to enter and control the OODA circulatory system of an enemy, so that the enemy can respond to the environmental weakness. Through long-term development, the OODA cycle theory is widely applied to a military operational command theory system. The complex network is generally utilized to model a military combat system, nodes in the network represent platforms such as investigation, command and combat in a battlefield, the performance of the combat platform after certain attacks on the combat platform in the actual battlefield can be predicted by researching the relationship among various nodes in the model, meanwhile, some important nodes can be protected preferentially, and important nodes of an enemy can be struck preferentially. The OODA theory is widely applied to the fields such as business strategy, city management, network security, etc., in addition to the military field, and thus it is of great significance to study various characteristics of a complex network composed of OODA loops.
Percolation theory was the earliest one used to study connectivity in porous media, the mathematical model of this physical problem was a three-dimensional network composed of N × N nodes, adjacent nodes were connected by a probability P, the probability of the existence of a path between the top and bottom of the network was calculated when the probability P was calculated, and then percolation theory became a simplified model for studying phase change problems in statistical physics. By applying percolation theory, some characteristics of a complex network constructed according to certain rules can be obtained more easily, such as the permeability threshold P of the networkCWhen the connection probability P between the nodes is higher than a threshold value, the network is subjected to phase change, and various relevant characteristics of the network are obviously changed.
In a complex network formed by an OODA theory, an OODA chain is used as a unit body, and the expression that nodes in the network are connected by a probability P is calculated according to a percolation theory is a new research point. After the network is attacked, the connection among the nodes can be considered to be interfered, the connection probability is reduced, and when the connection probability P among the nodes is lower than the threshold value PC, the motif in the network can be rapidly reduced, so that the network is broken down.
Disclosure of Invention
In view of this, an object of the present invention is to provide a method for calculating a permeability rate using an OODA chain as a component, in which a percolation theory is applied to a complex network formed by OODA chains, and the permeability rate is calculated using the OODA chain as a component, so as to obtain a relationship between network connectivity and node connectivity.
One of the purposes of the invention is realized by the following technical scheme:
the permeability calculation method taking an OODA chain as a component comprises the following steps:
the method comprises the following steps: o (ob) exists in the networkservice, O' (origin), D (future), A (act)4 types of nodes, the total number of which is N, wherein the O type of nodes have NOWherein the O' -type node has NO’Wherein the D-type node has NDWherein the type A node has NAEach type of node has 16 edges, wherein eight edges of OO, OO ', OD, O' D, DD, DA, DO and AO are communicated with each other with probability P, and the other eight edges are not communicated with each other, and N is setMFor the number of motifs in the network when the probability of connectivity is maximum (P ═ 1), the total number N of motifs when P ═ 1 is calculatedM；
Step two: respectively calculating the number of the four motifs by using an algorithm psi and an algorithm phi;
step three: calculating the permeability W which is the sum N of the number of 4 motifs when the side communication probability is PPAnd NMThe ratio of.
Further, in the second step, the algorithm Ψ comprises the following steps:
s21: calculating the number of edges between an initial O node and an O' node;
s22: judging whether an edge exists between the ODs, if not, executing the step 23, and if so, executing the step S24;
s23: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is not communicated with the D node;
s24: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is communicated with the D node;
s25: calculating the number of edges between the i D nodes and the A node;
s26: calculating the number of edges between the j nodes A and the initial nodes O;
s27: multiplying the above results by NOThe number of motifs of 4 nodes can be obtained.
Further, the algorithm Φ comprises the following steps:
s31: calculating the number of edges which are communicated with an initial O 'node and are not connected to the same O' node;
s32: calculating the number of edges between the k O' nodes and the D node;
s33: calculating the number of edges between the i D nodes and the A node;
s34: calculating the number of edges between the j nodes A and the initial nodes O;
s35: multiplying the above results by NOThe number of motif 3 of 3 nodes can be obtained.
It is another object of the present invention to provide a computer apparatus, which includes a memory, a processor and a computer program stored in the memory and capable of running on the processor, wherein the processor implements the method when executing the computer program.
It is a further object of the present invention to provide a computer readable storage medium, having stored thereon a computer program, which, when executed by a processor, performs the method as described above.
The invention has the beneficial effects that:
the method takes an OODA chain in a complex network formed by OODA as a motif for calculation, and obtains the network permeability taking the OODA as a unit by calculating the effective motif quantity in the network when the node connection probability is P. The method measures the connectivity of the network according to the number of the effective motifs in the network, can calculate the characteristic that the connectivity of the network changes along with the connection between the nodes, has important reference value for researching the permeability of an OODA network or other similar networks, and has long-term significance for the field of applying an OODA theory.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims hereof.
Drawings
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail with reference to the accompanying drawings, in which:
FIG. 1 is a diagram of a complex network consisting of OODA;
FIG. 2 is a schematic diagram of 4 motifs present in the network;
FIG. 3 is a flow chart of the calculation of permeability using OODA chains as elements.
Detailed Description
Hereinafter, preferred embodiments of the present invention will be described in detail with reference to the accompanying drawings. It should be understood that the preferred embodiments are illustrative of the invention only and are not limiting upon the scope of the invention.
As shown in fig. 3, the method for calculating the permeability using an OODA chain as a unit according to the present invention includes the steps of:
the method comprises the following steps: utilizing computer network, simulating 4 types of nodes of O (object), O (origin), D (node) and A (act) in network environment, wherein the total number of the nodes is N, the O type node has NOWherein the O' -type node has NO’Wherein the D-type node has NDWherein the type A node has NAEach type of node has 16 edges, wherein eight edges of OO, OO ', OD, O' D, DD, DA, DO and AO are communicated with each other with probability P, and the other eight edges are not communicated with each other, and N is setMFor the number of motifs in the network when the probability of connectivity is maximum (P ═ 1), the total number N of motifs when P ═ 1 is calculatedM；
Step two: respectively calculating the number of the four motifs by using an algorithm psi and an algorithm phi; (shown in FIG. 2)
Step three: calculating the permeability W which is the sum N of the number of 4 motifs when the side communication probability is PPAnd NMThe ratio of.
In the second step, the algorithm Ψ comprises the following steps:
s21: calculating the number of edges between an initial O node and an O' node;
s22: judging whether an edge exists between the ODs, if not, executing Step 3, and if so, executing Step 4;
s23: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is not communicated with the D node;
s24: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is communicated with the D node;
s25: calculating the number of edges between the i D nodes and the A node;
s26: calculating the number of edges between the j nodes A and the initial nodes O;
s27: multiplying the above results by NOThe number of motifs of 4 nodes can be obtained.
Wherein the algorithm Φ comprises the following steps:
s31: calculating the number of edges which are communicated with an initial O 'node and are not connected to the same O' node;
s32: calculating the number of edges between the k O' nodes and the D node;
s33: calculating the number of edges between the i D nodes and the A node;
s34: calculating the number of edges between the j nodes A and the initial nodes O;
s35: multiplying the above results by NOThe number of motif 3 shown in fig. 2 of 3 nodes can be obtained.
The specific embodiment is as follows: when P is 1, each type of connectable node is necessarily connected, and thus only motif 2 exists in the network, and the total number of motifs NM＝NO*NO’*ND*NA(ii) a Let NPThe number of motifs in the network when the connection probability is P is N, and the number of each motif is NP1，NP2，NP3,NP4，NP＝NP1+NP2+NP3,+NP4。
Figure BDA0002024629690000041
Figure BDA0002024629690000042
Figure BDA0002024629690000051
Figure BDA0002024629690000052
With NP1And NP3The description is given for the sake of example.
In NP1In (1),
Figure BDA0002024629690000053
represents an NONode and K NO’Probability of node connection;
Figure BDA0002024629690000054
represents K NO’Node and i NDNodes are connected and i are NDNode and initial NOProbability of non-connection of nodes;
Figure BDA0002024629690000055
represents i NDNode and J NAProbability of node connection; 1- (1-P)JRepresents J NANode and initial NOProbability of node connection.
In NP3In (1),
Figure BDA0002024629690000056
represents an NONode and i NDNodes are connected and i are NDNode and initial NOThe nodes do not share any NO’The probability of connection; the following is the same as the above.
The permeability can be obtained by the above calculation:
Figure BDA0002024629690000057
the invention is characterized in that OODA chains in a complex network formed by OODA are used as motif to calculate, and the permeability taking OODA as a unit is obtained by calculating the number of motifs in the network when the node connection probability is P. In general, the calculation of the permeability rate is that nodes in the network are connected with a certain probability, when the probability exceeds a certain threshold value, huge clusters (most points in the network are connected) appear in the network, the method can be used for simulating a military network combat system, when the network receives attacks and interference, the connection between the nodes can be considered to be weakened, when the connection probability is reduced to be below the threshold value, no huge clusters exist in the network, and in addition, in practical application, the method can also be used for simulating the spread of epidemic diseases.
According to the design concept of the method, the invention can also provide a computer device, in particular to a permeability calculation device taking an OODA chain as a unit body.
It should be recognized that embodiments of the present invention can be realized and implemented by computer hardware, a combination of hardware and software, or by computer instructions stored in a non-transitory computer readable memory. The methods may be implemented in a computer program using standard programming techniques, including a non-transitory computer-readable storage medium configured with the computer program, where the storage medium so configured causes a computer to operate in a specific and predefined manner, according to the methods and figures described in the detailed description. Each program may be implemented in a high level procedural or object oriented programming language to communicate with a computer system. However, the program(s) can be implemented in assembly or machine language, if desired. In any case, the language may be a compiled or interpreted language. Furthermore, the program can be run on a programmed application specific integrated circuit for this purpose.
Further, the operations of processes described herein can be performed in any suitable order unless otherwise indicated herein or otherwise clearly contradicted by context. The processes described herein (or variations and/or combinations thereof) may be performed under the control of one or more computer systems configured with executable instructions, and may be implemented as code (e.g., executable instructions, one or more computer programs, or one or more applications) collectively executed on one or more processors, by hardware, or combinations thereof. The computer program includes a plurality of instructions executable by one or more processors.
Further, the method may be implemented in any type of computing platform operatively connected to a suitable interface, including but not limited to a personal computer, mini computer, mainframe, workstation, networked or distributed computing environment, separate or integrated computer platform, or in communication with a charged particle tool or other imaging device, and the like. Aspects of the invention may be embodied in machine-readable code stored on a non-transitory storage medium or device, whether removable or integrated into a computing platform, such as a hard disk, optically read and/or write storage medium, RAM, ROM, or the like, such that it may be read by a programmable computer, which when read by the storage medium or device, is operative to configure and operate the computer to perform the procedures described herein. Further, the machine-readable code, or portions thereof, may be transmitted over a wired or wireless network. The invention described herein includes these and other different types of non-transitory computer-readable storage media when such media include instructions or programs that implement the steps described above in conjunction with a microprocessor or other data processor. When the single sign-on method and the technical programming of the integrated management system are realized according to the invention, the invention also comprises the computer per se.
A computer program can be applied to input data to perform the functions described herein to transform the input data to generate output data that is stored to non-volatile memory. The output information may also be applied to one or more output devices, such as a display. In a preferred embodiment of the invention, the transformed data represents physical and tangible objects, including particular visual depictions of physical and tangible objects produced on a display.
Finally, the above embodiments are only intended to illustrate the technical solutions of the present invention and not to limit the present invention, and although the present invention has been described in detail with reference to the preferred embodiments, it will be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions, and all of them should be covered by the claims of the present invention.

Claims (3)

1. The permeability calculation method taking an OODA chain as a unit body is characterized by comprising the following steps: the method comprises the following steps:
the method comprises the following steps: let the network have 4 types of nodes, O (origin), D (node), A (act), and the total number is N, wherein the O type node has NOWherein the O' -type node has NO’Wherein the D-type node has NDWherein the type A node has NAEach type of node has 16 edges, wherein eight edges of OO, OO ', OD, O' D, DD, DA, DO and AO are communicated with each other with probability P, and the other eight edges are not communicated with each other, and N is setMCalculating the total number N of motifs when the connection probability is maximum and the number of motifs in the network is 1 when the connection probability is maximumM；
Step two: respectively calculating the number of the four motifs by using an algorithm psi and an algorithm phi;
step three: calculating the permeability W which is the sum N of the number of 4 motifs when the side communication probability is PPAnd NMThe ratio of (A) to (B);
in the second step, the algorithm Ψ comprises the following:
s21: calculating the number of edges between an initial O node and an O' node;
s22: judging whether edges exist among the ODs, if not, executing S23, and if so, executing S24;
s23: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is not communicated with the D node;
s24: calculating the number of edges that k O' nodes are communicated with the D node and the initial O node is communicated with the D node;
s25: calculating the number of edges between the i D nodes and the A node;
s26: calculating the number of edges between the j nodes A and the initial nodes O;
s27: multiplying the above results by NOThe number of motifs of 4 nodes can be obtained;
the algorithm Φ includes the following:
s31: calculating the number of edges which are communicated with an initial O 'node and are not connected to the same O' node;
s32: calculating the number of edges between the k O' nodes and the D node;
s33: calculating the number of edges between the i D nodes and the A node;
s34: calculating the number of edges between the j nodes A and the initial nodes O;
s35: multiplying the above results by NOThe number of motif 3 of 3 nodes can be obtained.
2. A computer apparatus comprising a memory, a processor, and a computer program stored on the memory and capable of running on the processor, wherein: the processor, when executing the computer program, implements the method of claim 1.
3. A computer-readable storage medium having stored thereon a computer program, characterized in that: the computer program, when executed by a processor, implements the method of claim 1.
CN201910290049.8A 2019-04-11 2019-04-11 Seepage rate calculation method taking OODA chain as element Active CN110034961B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910290049.8A CN110034961B (en) 2019-04-11 2019-04-11 Seepage rate calculation method taking OODA chain as element

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910290049.8A CN110034961B (en) 2019-04-11 2019-04-11 Seepage rate calculation method taking OODA chain as element

Publications (2)

Publication Number Publication Date
CN110034961A CN110034961A (en) 2019-07-19
CN110034961B true CN110034961B (en) 2022-02-15

Family

ID=67238082

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910290049.8A Active CN110034961B (en) 2019-04-11 2019-04-11 Seepage rate calculation method taking OODA chain as element

Country Status (1)

Country Link
CN (1) CN110034961B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111176822B (en) * 2020-01-02 2023-05-09 中国航空工业集团公司西安航空计算技术研究所 OODA (on-off-line architecture) multi-task intelligent application-oriented embedded public software operation method
CN111506349A (en) * 2020-04-30 2020-08-07 中科院计算所西部高等技术研究院 Calculation board card with OODA (on-off-the-digital-analog) multiprocessor
CN111586144A (en) * 2020-04-30 2020-08-25 中科院计算所西部高等技术研究院 Computer group construction method with OODA fractal mechanism

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104598709A (en) * 2013-10-31 2015-05-06 大连智友软件科技有限公司 Detection data fusion method based on extended OODA model
CN106899442A (en) * 2017-03-16 2017-06-27 大连大学 Charge network survivability Measurement Method based on operation link efficiency
CN106953754A (en) * 2017-03-16 2017-07-14 大连大学 Charge network survivability Measurement Method based on operation link entropy
CN107783545A (en) * 2016-08-25 2018-03-09 大连楼兰科技股份有限公司 Post disaster relief rotor wing unmanned aerial vehicle obstacle avoidance system based on OODA ring multi-sensor information fusions

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10817814B2 (en) * 2016-08-26 2020-10-27 Conduent Business Services, Llc System and method for coordinating parking enforcement officer patrol in real time with the aid of a digital computer

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104598709A (en) * 2013-10-31 2015-05-06 大连智友软件科技有限公司 Detection data fusion method based on extended OODA model
CN107783545A (en) * 2016-08-25 2018-03-09 大连楼兰科技股份有限公司 Post disaster relief rotor wing unmanned aerial vehicle obstacle avoidance system based on OODA ring multi-sensor information fusions
CN106899442A (en) * 2017-03-16 2017-06-27 大连大学 Charge network survivability Measurement Method based on operation link efficiency
CN106953754A (en) * 2017-03-16 2017-07-14 大连大学 Charge network survivability Measurement Method based on operation link entropy

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
一种基于OODA环的武器装备体系建模方法;张昱 等;《系统仿真学报》;20130725;全文 *

Also Published As

Publication number Publication date
CN110034961A (en) 2019-07-19

Similar Documents

Publication Publication Date Title
CN110034961B (en) Seepage rate calculation method taking OODA chain as element
Peng et al. A moving-target defense strategy for cloud-based services with heterogeneous and dynamic attack surfaces
Hahn et al. A multi-layered and kill-chain based security analysis framework for cyber-physical systems
EP2912802B1 (en) Method and device for simulating network resiliance against attacks
Masood et al. Design of a mathematical model for the Stuxnet virus in a network of critical control infrastructure
CN107566387A (en) Cyber-defence action decision method based on attacking and defending evolutionary Game Analysis
EP3827380A1 (en) Secure exploration for reinforcement learning
Alpar Analysis of a new simple one dimensional chaotic map
Chi et al. Privacy partition: A privacy-preserving framework for deep neural networks in edge networks
Zhao et al. Stability-based analysis and defense against backdoor attacks on edge computing services
CN108733898A (en) Attack Defence Antagonism Simulation System method and analogue system based on architectural framework data
CN111475838A (en) Graph data anonymizing method, device and storage medium based on deep neural network
CN107395598B (en) Self-adaptive defense method for inhibiting virus propagation
CN115580430A (en) Attack tree-pot deployment defense method and device based on deep reinforcement learning
Miah et al. Concealing Cyber-Decoys using Two-Sided Feature Deception Games.
Chen et al. An improved acquaintance immunization strategy for complex network
WO2022252039A1 (en) Method and apparatus for adversarial attacking in deep reinforcement learning
Ganzfried et al. Parallel algorithm for approximating Nash equilibrium in multiplayer stochastic games with application to naval strategic planning
Zhang et al. A coverage control algorithm based on probability model for three-dimensional wireless sensor networks
CN111723941B (en) Rule generation method and device, electronic equipment and storage medium
CN103200034A (en) Network user structure disturbance method based on spectral constraint and sensitive area partition
CN107135221B (en) Method for progressively solving K maximum probability attack path
He et al. Effects of interdependencies on game-theoretic defense of cyber-physical infrastructures
Chen et al. Data-Centric Defense: Shaping Loss Landscape with Augmentations to Counter Model Inversion
Amado et al. Reinforcement learning applied to RTS games

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