CN110034961A - It take OODA chain as the infiltration rate calculation method of first body - Google Patents
It take OODA chain as the infiltration rate calculation method of first body Download PDFInfo
- Publication number
- CN110034961A CN110034961A CN201910290049.8A CN201910290049A CN110034961A CN 110034961 A CN110034961 A CN 110034961A CN 201910290049 A CN201910290049 A CN 201910290049A CN 110034961 A CN110034961 A CN 110034961A
- Authority
- CN
- China
- Prior art keywords
- node
- calculated
- ooda
- network
- motif
- 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.)
- Granted
Links
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)
- Environmental & Geological Engineering (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Life Sciences & Earth Sciences (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
It is the infiltration rate calculation method of first body that the invention discloses a kind of with OODA chain, it is calculated the OODA chain in the complex network being made of OODA as motif, it is calculated by connecting motif quantity when probability is P in network to node, has obtained the infiltration rate with OODA for first body.The present invention measures the connectivity of network with the quantity of motif effective in network, the connectivity of network can be calculated with the characteristic for contacting variation between node, there is important reference value for the infiltration rate of research OODA network or other similar networks, equally there is far-reaching significance for the field of application OODA theory.
Description
Technical field
The invention belongs to Tactical Internet field, in particular to a kind of take OODA chain as the infiltration rate calculation method of first body.
Background technique
The concept of OODA circulation is proposed by U.S. army colonel John Bo Yide (John Boyd), and theoretical is basic
Viewpoint is: armed conflict, which can be regarded as, opposing sides to haggle mutually who can more rapid and better complete " observation-adjustment-decision-row
It is dynamic " cyclic program.Both sides are from, observe oneself, environment of observation and enemy.Based on observation, obtain relevant outer
Portion's information adjusts system according to the outside threat perceived in time, makes reply decision, and takes corresponding action.Bo Yide recognizes
To oppose, the speed of my this decision cyclic process is obviously divided into speed.The target of one's own side should take the lead in completing one
OODA circulation, then swing into action, interferes, extends, interrupting the OODA of enemy to recycle.Wherein, a kind of tactics are to enter
And the OODA circulatory system of enemy is manipulated, make enemy is powerless for external world's variation to make any reaction.By developing for a long time,
OODA Cyclical Theory is widely used in military combat command theory system.Usually military combat system is built using complex network
Mould, with platforms such as investigation, commander and operations in the node on behalf battlefield in network, by between nodes various in research model
Relationship, can predict that in practical battlefield optimal in structure, while also can be to some important by certain performance after attacking
Node carries out priority protection, is preferentially hit enemy's important node.OODA theory is other than being applied to military field, all
Such as Business Strategy, city management, network security field are also widely used, therefore study and recycle the complex web constituted by OODA
The various characteristics of network are of great significance.
Exceeding infiltration theory to be is the reachability problem being used in research porous media, the mathematical modulo of this physical problem earliest
The three-dimensional network that type is made of N*N*N node, adjacent node are communicated with probability P, network top and bottom when calculating probability P
Between there are the probability of access, exceed seep the theoretical simplified model for becoming and studying Phase-change Problems in Statistical Physics later, as people will
Exceed infiltration theory to be introduced into the research of complex network, many flow models in porous media, such as explode flow model in porous media, corepercolation, k-
Core percolation etc. is suggested.Exceed infiltration theory by application, according to some spies for the complex network that certain rule is constituted
Property can be obtained relatively easily, such as the infiltration rate threshold value P of networkC, when the connected probability P between node is higher than threshold value, network
It can undergo phase transition, significant change can occur for various correlation properties.
In with the complex network of OODA Theory framework, it is first body with OODA chain, is calculated in network according to infiltration theory is exceeded
Performance after each node is connected to probability P is a new research point.Network is after being attacked, it is believed that between each node
Connection be interfered, connected probability reduces, the motif when the connection probability P between each node is lower than threshold value PC, in network
It can sharply reduce, and then make periods of network disruption.
Summary of the invention
In view of this, an object of the present invention be to provide it is a kind of with OODA chain be first body infiltration rate calculation method, be by
Exceed and seep in the theoretical complex network for being applied to be made of OODA, is that first body carries out infiltration rate calculating with OODA chain, to obtain network
Relationship between connectivity and Connectivity.
An object of the present invention is achieved through the following technical solutions:
This kind is the infiltration rate calculation method of first body with OODA chain, comprising the following steps:
Step 1: setting in network there are O (observe), O ' (orient), D (decide), 4 seed type of A (act)
Node, sum is N, wherein O-shaped node has NOA, wherein O ' type node has NO’A, wherein D type node has NDIt is a, wherein A type
Node has NAIt is a, there are 16 kinds of sides between all types of nodes, wherein OO, OO ', OD, O ' D, DD, DA, this eight kinds of sides DO, AO are with probability P
It communicates, in addition eight kinds of sides are not communicated with, if NMFor connection maximum probability (P=1) when network in motif quantity, calculate P=1 when
The total N of motifM；
Step 2: the quantity of four kinds of motif is calculated separately using algorithm Ψ and algorithm Φ；
Step 3: calculating infiltration rate W, infiltration rate W is side connected probability the sum of quantity of 4 kinds of motif N when being PPWith NMThe ratio between.
Further, in the step 2, algorithm Ψ the following steps are included:
S21: the quantity on side between an initial O node and O ' node is calculated；
S22: judge to whether there is side between OD, then execute 23 if it does not exist, then execute S24 if it exists；
S23: it calculates k O ' node and is communicated with D node and initial O node and the disconnected number of edges amount of this D node；
S24: the number of edges amount that k O ' node is communicated with D node and initial O node is connected to this D node is calculated；
S25: the quantity on side between i D node and A node is calculated；
S26: the quantity on side between j A node and initial O node is calculated；
S27: result above is multiplied multiplied by NOThe quantity of the motif of 4 nodes a kind of can be obtained.
Further, algorithm Φ the following steps are included:
S31: the quantity that an initial O node communicated with O ' node and be not attached to the side of the same O ' node is calculated；
S32: the quantity on side between k O ' node and D node is calculated；
S33: the quantity on side between i D node and A node is calculated；
S34: the quantity on side between j A node and initial O node is calculated；
S35: result above is multiplied multiplied by NOThe quantity of the motif 3 of 3 nodes can be obtained.
The second object of the present invention is to provide a kind of computer installation, including memory, processor and it is stored in memory
Computer program that is upper and can running on a processor, the processor realize side above-mentioned when executing the computer program
Method.
The third object of the present invention is to provide a kind of computer readable storage medium, stores computer program thereon, institute
It states and realizes method above-mentioned when computer program is executed by processor.
The beneficial effects of the present invention are:
The present invention is calculated the OODA chain in the complex network being made of OODA as motif, general by connecting to node
Effective motif quantity when rate is P in network is calculated, and the network infiltration rate with OODA for first body has been obtained.The present invention is with net
The quantity of effective motif measures the connectivity of network in network, can calculate the connectivity of network and become with contacting between node
The characteristic of change has important reference value for the infiltration rate of research OODA network or other similar networks, for application
The field of OODA theory equally has far-reaching significance.
Other advantages, target and feature of the invention will be illustrated in the following description to a certain extent, and
And to a certain extent, based on will be apparent to those skilled in the art to investigating hereafter, Huo Zheke
To be instructed from the practice of the present invention.Target and other advantages of the invention can be wanted by following specification and right
Book is sought to be achieved and obtained.
Detailed description of the invention
To make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction with attached drawing to the present invention make into
The detailed description of one step, in which:
The complex network figure that Fig. 1 is made of OODA；
Fig. 2 is 4 kinds of motif schematic diagrames present in network；
Fig. 3 is the infiltration rate calculation flow chart with OODA chain for first body.
Specific embodiment
Hereinafter reference will be made to the drawings, and a preferred embodiment of the present invention will be described in detail.It should be appreciated that preferred embodiment
Only for illustrating the present invention, rather than limiting the scope of protection of the present invention.
As shown in figure 3, of the invention take OODA chain as the infiltration rate calculation method of first body, comprising the following steps:
Step 1: computer network is utilized, simulates that there are O (observe), O ' (orient), D in a network environment
(decide), the node of 4 seed type of A (act), sum is N, wherein O-shaped node has NOA, wherein O ' type node has NO’It is a,
Wherein D type node has NDA, wherein A type node has NAIt is a, there are 16 kinds of sides between all types of nodes, wherein OO, OO ', OD, O ' D, DD,
This eight kinds of sides DA, DO, AO are communicated with probability P, and in addition eight kinds of sides are not communicated with, if NMWhen to connect maximum probability (P=1) in network
The quantity of motif, the total N of motif when calculating P=1M；
Step 2: the quantity of four kinds of motif is calculated separately using algorithm Ψ and algorithm Φ；(shown in Fig. 2)
Step 3: calculating infiltration rate W, infiltration rate W is side connected probability the sum of quantity of 4 kinds of motif N when being PPWith NMThe ratio between.
Wherein in step 2, algorithm Ψ the following steps are included:
S21: the quantity on side between an initial O node and O ' node is calculated；
S22: judge to whether there is side between OD, then execute Step 3 if it does not exist, then execute Step 4 if it exists；
S23: it calculates k O ' node and is communicated with D node and initial O node and the disconnected number of edges amount of this D node；
S24: the number of edges amount that k O ' node is communicated with D node and initial O node is connected to this D node is calculated；
S25: the quantity on side between i D node and A node is calculated；
S26: the quantity on side between j A node and initial O node is calculated；
S27: result above is multiplied multiplied by NOThe quantity of the motif of 4 nodes a kind of can be obtained.
Wherein, algorithm Φ the following steps are included:
S31: the quantity that an initial O node communicated with O ' node and be not attached to the side of the same O ' node is calculated；
S32: the quantity on side between k O ' node and D node is calculated；
S33: the quantity on side between i D node and A node is calculated；
S34: the quantity on side between j A node and initial O node is calculated；
S35: result above is multiplied multiplied by NOThe quantity of motif 3 shown in Fig. 2 of 3 nodes can be obtained.
Specific embodiment: as P=1, each type can connecting node necessarily connect, therefore there is only motif in network
2, motif total amount NM=NO*NO’*ND*NA；If NPFor the quantity for connecting motif in network when probability is P, the number of various motif
Amount is respectively NP1, NP2, NP3,NP4, NP=NP1+NP2+NP3,+NP4。
With NP1And NP3For be illustrated.
In NP1In,Indicate a NONode and K NO’The probability that node is connected；Indicate K NO’Node and i NDNode is connected and i NDSection
Point and initial NOThe disjunct probability of node；Indicate i NDNode and J are a
NAThe probability that node is connected；1-(1-P)JIndicate J NANode and initial NOThe probability that node is connected.
In NP3In,Indicate a NONode and i NDNode phase
Connection and i NDNode and initial NONode is not common with any one NO’Connected probability；It is subsequent with it is upper similarly.
By calculating available infiltration rate above:
Innovation of the invention is to calculate the OODA chain in the complex network being made of OODA as motif, leads to
It crosses and the motif quantity in network when node connection probability is P is calculated, obtained the infiltration rate with OODA for first body.Total
For, the calculating of infiltration rate is exactly that nodes are connected with certain probability, when probability is more than certain threshold value, meeting in network
There is huge cluster (the most point in network is connected), this can be used for simulation military network combat system-of-systems, work as net
Network receives attack and interference, it is believed that the connection between node weakens, when connection probability drops to threshold value hereinafter, in network just not
Huge cluster is had, in addition in practical application, can be used for simulating epiphytotics propagation.
According to the design philosophy of the above method, the present invention can also provide a kind of computer installation, specifically a kind of
It take OODA chain as the infiltration rate computing device of first body, for device other than input/output module, most crucial is computing module, calculates mould
Block includes the submodule that algorithm Ψ, algorithm Φ and infiltration rate may be implemented and calculate, after obtaining related data, by above-mentioned module into
Row relevant calculation finally obtains infiltration rate data.
It should be appreciated that the embodiment of the present invention can be by computer hardware, the combination of hardware and software or by depositing
The computer instruction in non-transitory computer-readable memory is stored up to be effected or carried out.Standard volume can be used in the method
Journey technology-includes that the non-transitory computer-readable storage media configured with computer program is realized in computer program,
In configured in this way storage medium computer is operated in a manner of specific and is predefined --- according in a particular embodiment
The method and attached drawing of description.Each program can with the programming language of level process or object-oriented come realize with department of computer science
System communication.However, if desired, the program can be realized with compilation or machine language.Under any circumstance, which can be volume
The language translated or explained.In addition, the program can be run on the specific integrated circuit of programming for this purpose.
In addition, the operation of process described herein can be performed in any suitable order, unless herein in addition instruction or
Otherwise significantly with contradicted by context.Process described herein (or modification and/or combination thereof) can be held being configured with
It executes, and is can be used as jointly on the one or more processors under the control of one or more computer systems of row instruction
The code (for example, executable instruction, one or more computer program or one or more application) of execution, by hardware or its group
It closes to realize.The computer program includes the multiple instruction that can be performed by one or more processors.
Further, the method can be realized in being operably coupled to suitable any kind of computing platform, wrap
Include but be not limited to PC, mini-computer, main frame, work station, network or distributed computing environment, individual or integrated
Computer platform or communicated with charged particle tool or other imaging devices etc..Each aspect of the present invention can be to deposit
The machine readable code on non-transitory storage medium or equipment is stored up to realize no matter be moveable or be integrated to calculating
Platform, such as hard disk, optical reading and/or write-in storage medium, RAM, ROM, so that it can be read by programmable calculator, when
Storage medium or equipment can be used for configuration and operation computer to execute process described herein when being read by computer.This
Outside, machine readable code, or part thereof can be transmitted by wired or wireless network.When such media include combining microprocessor
Or other data processors realize steps described above instruction or program when, invention as described herein including these and other not
The non-transitory computer-readable storage media of same type.When total management system single-point logging method according to the present invention
When with technology programming, the invention also includes computers itself.
Computer program can be applied to input data to execute function as described herein, to convert input data with life
At storing to the output data of nonvolatile memory.Output information can also be applied to one or more output equipments as shown
Device.In the preferred embodiment of the invention, the data of conversion indicate physics and tangible object, including the object generated on display
Reason and the particular visual of physical objects are described.
Finally, it is stated that the above examples are only used to illustrate the technical scheme of the present invention and are not limiting, although referring to compared with
Good embodiment describes the invention in detail, those skilled in the art should understand that, it can be to skill of the invention
Art scheme is modified or replaced equivalently, and without departing from the objective and range of the technical program, should all be covered in the present invention
Scope of the claims in.
Claims (5)
1. taking OODA chain as the infiltration rate calculation method of first body, it is characterised in that: the described method comprises the following steps:
Step 1: setting in network there are O (observe), O ' (orient), D (decide), the node of 4 seed type of A (act),
Its sum is N, wherein O-shaped node has NOA, wherein O ' type node has NO’A, wherein D type node has NDIt is a, wherein A type node
There is NAIt is a, there are 16 kinds of sides between all types of nodes, wherein OO, OO ', OD, O ' D, DD, DA, this eight kinds of sides DO, AO are communicated with probability P,
Other eight kinds of sides are not communicated with, if NMFor connection maximum probability (P=1) when network in motif quantity, calculate P=1 when motif
Total NM；
Step 2: the quantity of four kinds of motif is calculated separately using algorithm Ψ and algorithm Φ；
Step 3: calculating infiltration rate W, infiltration rate W is side connected probability the sum of quantity of 4 kinds of motif N when being PPWith NMThe ratio between.
2. according to claim 1 take OODA chain as the infiltration rate calculation method of first body, it is characterised in that: the step 2
In, algorithm Ψ the following steps are included:
S21: the quantity on side between an initial O node and O ' node is calculated；
S22: judge to whether there is side between OD, then execute S23 if it does not exist, then execute S24 if it exists；
S23: it calculates k O ' node and is communicated with D node and initial O node and the disconnected number of edges amount of this D node；
S24: the number of edges amount that k O ' node is communicated with D node and initial O node is connected to this D node is calculated；
S25: the quantity on side between i D node and A node is calculated；
S26: the quantity on side between j A node and initial O node is calculated；
S27: result above is multiplied multiplied by NOThe quantity of the motif of 4 nodes a kind of can be obtained.
3. according to claim 1 or 2 take OODA chain as the infiltration rate calculation method of first body, it is characterised in that: algorithm Φ packet
Include following steps:
S31: the quantity that an initial O node communicated with O ' node and be not attached to the side of the same O ' node is calculated；
S32: the quantity on side between k O ' node and D node is calculated；
S33: the quantity on side between i D node and A node is calculated；
S34: the quantity on side between j A node and initial O node is calculated；
S35: result above is multiplied multiplied by NOThe quantity of the motif3 of 3 nodes can be obtained.
4. a kind of computer installation, can run on a memory and on a processor including memory, processor and storage
Computer program, it is characterised in that: the processor is realized when executing the computer program such as any one of claim 1-3 institute
The method stated.
5. a kind of computer readable storage medium, stores computer program thereon, it is characterised in that: the computer program quilt
Processor realizes the method according to claim 1 when executing.
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 true CN110034961A (en) | 2019-07-19 |
| CN110034961B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111176822A (en) * | 2020-01-02 | 2020-05-19 | 中国航空工业集团公司西安航空计算技术研究所 | OODA multi-task intelligent application-oriented embedded public software operation method |
| CN111813453A (en) * | 2020-04-30 | 2020-10-23 | 中科院计算所西部高等技术研究院 | Calculation board card with OODA (on-off-the-digital-analog) multiprocessor |
| CN111866188A (en) * | 2020-04-30 | 2020-10-30 | 中科院计算所西部高等技术研究院 | Computer group construction method with OODA fractal mechanism |
Citations (5)
| 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 |
| US20180060790A1 (en) * | 2016-08-26 | 2018-03-01 | Conduent Business Services, Llc | System And Method For Coordinating Parking Enforcement Officer Patrol In Real Time With The Aid Of A Digital Computer |
| 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 |
-
2019
- 2019-04-11 CN CN201910290049.8A patent/CN110034961B/en active Active
Patent Citations (5)
| 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 |
| US20180060790A1 (en) * | 2016-08-26 | 2018-03-01 | Conduent Business Services, Llc | System And Method For Coordinating Parking Enforcement Officer Patrol In Real Time With The Aid Of A Digital Computer |
| 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)
| Title |
|---|
| 张昱 等: "一种基于OODA环的武器装备体系建模方法", 《系统仿真学报》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111176822A (en) * | 2020-01-02 | 2020-05-19 | 中国航空工业集团公司西安航空计算技术研究所 | OODA multi-task intelligent application-oriented embedded public software operation method |
| CN111176822B (en) * | 2020-01-02 | 2023-05-09 | 中国航空工业集团公司西安航空计算技术研究所 | OODA (on-off-line architecture) multi-task intelligent application-oriented embedded public software operation method |
| CN111813453A (en) * | 2020-04-30 | 2020-10-23 | 中科院计算所西部高等技术研究院 | Calculation board card with OODA (on-off-the-digital-analog) multiprocessor |
| CN111866188A (en) * | 2020-04-30 | 2020-10-30 | 中科院计算所西部高等技术研究院 | Computer group construction method with OODA fractal mechanism |
| CN111866188B (en) * | 2020-04-30 | 2022-05-17 | 中科院计算所西部高等技术研究院 | Computer group construction method with OODA fractal mechanism |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110034961B (en) | 2022-02-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2020259502A1 (en) | Method and device for generating neural network model, and computer-readable storage medium | |
| CN110034961A (en) | It take OODA chain as the infiltration rate calculation method of first body | |
| CN107943874A (en) | Knowledge mapping processing method, device, computer equipment and storage medium | |
| CN113052334A (en) | Method and system for realizing federated learning, terminal equipment and readable storage medium | |
| CN112580217A (en) | Communication system structure parameterization modeling method based on complex network | |
| CN113688383B (en) | Attack defense testing method based on artificial intelligence and artificial intelligence analysis system | |
| CN112491818A (en) | Power grid transmission line defense method based on multi-agent deep reinforcement learning | |
| AU2005281762B2 (en) | A system and a method for mission planning | |
| JP2022013823A (en) | Method for predicting health status of decentralized network with artificial neural network | |
| CN112312299A (en) | Service unloading method, device and system | |
| CN115022067B (en) | Network security defense method and device under game-based asymmetric information | |
| CN109977998B (en) | Information processing method and apparatus, storage medium, and electronic apparatus | |
| CN111371604A (en) | Equipment system network reconstruction method, system, machine readable medium and equipment | |
| Huang et al. | Network defense strategy selection based on best-response dynamic evolutionary game model | |
| CN113568782B (en) | Dynamic recovery method for combat equipment system, electronic equipment and storage medium | |
| JP2018171448A (en) | Learning device, learning method, learning program, moving image distribution device, object action device, object action program, and moving image generation device | |
| CN112817898A (en) | Data transmission method, processor, chip and electronic equipment | |
| CN115690267B (en) | Animation processing method, device, equipment, storage medium and product | |
| CN116702583B (en) | Method and device for optimizing performance of block chain under Internet of things based on deep reinforcement learning | |
| CN113342523B (en) | Battle architecture balance analysis method, device, equipment and medium | |
| CN110032695A (en) | It is a kind of based on OODA ring using command node as the charge net infiltration rate calculation method of maincenter | |
| Anbar et al. | PHLAME: Hierarchical locality exploitation using the PGAS model | |
| CN116486108B (en) | Image processing method, device, equipment and storage medium | |
| CN114727407B (en) | Resource allocation method, device and equipment | |
| CN110390354B (en) | Prediction method and device for defense capability of deep network |
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 |