Method for quickly searching killing chain path based on complex network
The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters repres...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Patent |
| Sprache: | chi ; eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | ZHAO ZHIYUAN ZHAO WEIHU WANG YANG XU QINGZHENG ZHANG LI ZHU FUJING |
| description | The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters representing node types, and calculating a transfer matrix of adjacent node types in the combat network; sequentially multiplying all the transfer matrixes to obtain an arrival matrix; calculating traces reaching the matrix; extracting row and column serial numbers of non-zero elements in the transfer matrix, and constructing a directed network; and calculating to obtain a shortest closed path by using a complex network method, and outputting all non-repeated paths of the killing chain type. The invention also discloses a system for quickly searching the killing chain path based on the complex network. According to the method, a killing chain path is quickly searched for a complex combat network, systematization, scienti |
| format | Patent |
| fullrecord | <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_CN117196130A</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CN117196130A</sourcerecordid><originalsourceid>FETCH-epo_espacenet_CN117196130A3</originalsourceid><addsrcrecordid>eNrjZPDwTS3JyE9RSMsvUigszUzOzqlUKE5NLErOyMxLV8jOzMkB0ckZiZl5CgWJJRkKSYnFqSkK-XkKyfm5BTmpFQp5qSXl-UXZPAysaYk5xam8UJqbQdHNNcTZQze1ID8-tbggMTkVqDLe2c_Q0NzQ0szQ2MDRmBg1AJ3eND8</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Method for quickly searching killing chain path based on complex network</title><source>esp@cenet</source><creator>ZHAO ZHIYUAN ; ZHAO WEIHU ; WANG YANG ; XU QINGZHENG ; ZHANG LI ; ZHU FUJING</creator><creatorcontrib>ZHAO ZHIYUAN ; ZHAO WEIHU ; WANG YANG ; XU QINGZHENG ; ZHANG LI ; ZHU FUJING</creatorcontrib><description>The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters representing node types, and calculating a transfer matrix of adjacent node types in the combat network; sequentially multiplying all the transfer matrixes to obtain an arrival matrix; calculating traces reaching the matrix; extracting row and column serial numbers of non-zero elements in the transfer matrix, and constructing a directed network; and calculating to obtain a shortest closed path by using a complex network method, and outputting all non-repeated paths of the killing chain type. The invention also discloses a system for quickly searching the killing chain path based on the complex network. According to the method, a killing chain path is quickly searched for a complex combat network, systematization, scienti</description><language>chi ; eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES ; PHYSICS ; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><creationdate>2023</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231208&DB=EPODOC&CC=CN&NR=117196130A$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25564,76547</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&date=20231208&DB=EPODOC&CC=CN&NR=117196130A$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>ZHAO ZHIYUAN</creatorcontrib><creatorcontrib>ZHAO WEIHU</creatorcontrib><creatorcontrib>WANG YANG</creatorcontrib><creatorcontrib>XU QINGZHENG</creatorcontrib><creatorcontrib>ZHANG LI</creatorcontrib><creatorcontrib>ZHU FUJING</creatorcontrib><title>Method for quickly searching killing chain path based on complex network</title><description>The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters representing node types, and calculating a transfer matrix of adjacent node types in the combat network; sequentially multiplying all the transfer matrixes to obtain an arrival matrix; calculating traces reaching the matrix; extracting row and column serial numbers of non-zero elements in the transfer matrix, and constructing a directed network; and calculating to obtain a shortest closed path by using a complex network method, and outputting all non-repeated paths of the killing chain type. The invention also discloses a system for quickly searching the killing chain path based on the complex network. According to the method, a killing chain path is quickly searched for a complex combat network, systematization, scienti</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</subject><subject>PHYSICS</subject><subject>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2023</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZPDwTS3JyE9RSMsvUigszUzOzqlUKE5NLErOyMxLV8jOzMkB0ckZiZl5CgWJJRkKSYnFqSkK-XkKyfm5BTmpFQp5qSXl-UXZPAysaYk5xam8UJqbQdHNNcTZQze1ID8-tbggMTkVqDLe2c_Q0NzQ0szQ2MDRmBg1AJ3eND8</recordid><startdate>20231208</startdate><enddate>20231208</enddate><creator>ZHAO ZHIYUAN</creator><creator>ZHAO WEIHU</creator><creator>WANG YANG</creator><creator>XU QINGZHENG</creator><creator>ZHANG LI</creator><creator>ZHU FUJING</creator><scope>EVB</scope></search><sort><creationdate>20231208</creationdate><title>Method for quickly searching killing chain path based on complex network</title><author>ZHAO ZHIYUAN ; ZHAO WEIHU ; WANG YANG ; XU QINGZHENG ; ZHANG LI ; ZHU FUJING</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_CN117196130A3</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>chi ; eng</language><creationdate>2023</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES</topic><topic>PHYSICS</topic><topic>SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR</topic><toplevel>online_resources</toplevel><creatorcontrib>ZHAO ZHIYUAN</creatorcontrib><creatorcontrib>ZHAO WEIHU</creatorcontrib><creatorcontrib>WANG YANG</creatorcontrib><creatorcontrib>XU QINGZHENG</creatorcontrib><creatorcontrib>ZHANG LI</creatorcontrib><creatorcontrib>ZHU FUJING</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>ZHAO ZHIYUAN</au><au>ZHAO WEIHU</au><au>WANG YANG</au><au>XU QINGZHENG</au><au>ZHANG LI</au><au>ZHU FUJING</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Method for quickly searching killing chain path based on complex network</title><date>2023-12-08</date><risdate>2023</risdate><abstract>The invention discloses a method for quickly searching a killing chain path based on a complex network. The method comprises the following steps: acquiring a combat network and a killing chain type character string; splitting the killing chain type character string to obtain single characters representing node types, and calculating a transfer matrix of adjacent node types in the combat network; sequentially multiplying all the transfer matrixes to obtain an arrival matrix; calculating traces reaching the matrix; extracting row and column serial numbers of non-zero elements in the transfer matrix, and constructing a directed network; and calculating to obtain a shortest closed path by using a complex network method, and outputting all non-repeated paths of the killing chain type. The invention also discloses a system for quickly searching the killing chain path based on the complex network. According to the method, a killing chain path is quickly searched for a complex combat network, systematization, scienti</abstract><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | |
| ispartof | |
| issn | |
| language | chi ; eng |
| recordid | cdi_epo_espacenet_CN117196130A |
| source | esp@cenet |
| subjects | CALCULATING COMPUTING COUNTING DATA PROCESSING SYSTEMS OR METHODS, SPECIALLY ADAPTED FORADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORYOR FORECASTING PURPOSES PHYSICS SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE,COMMERCIAL, FINANCIAL, MANAGERIAL, SUPERVISORY OR FORECASTINGPURPOSES, NOT OTHERWISE PROVIDED FOR |
| title | Method for quickly searching killing chain path based on complex network |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T22%3A20%3A56IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=ZHAO%20ZHIYUAN&rft.date=2023-12-08&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3ECN117196130A%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |