Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/23903Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Gao, H | - |
| dc.contributor.author | Dong, H | - |
| dc.contributor.author | Wang, Z | - |
| dc.contributor.author | Han, F | - |
| dc.date.accessioned | 2022-01-07T19:47:48Z | - |
| dc.date.available | 2022-01-07T19:47:48Z | - |
| dc.date.issued | 2021-06-16 | - |
| dc.identifier.citation | Gao, H., Dong, H., Wang, Z. and Han, F. (2021) 'Recursive Minimum-Variance Filter Design for State-Saturated Complex Networks With Uncertain Coupling Strengths Subject to Deception Attacks', IEEE Transactions on Cybernetics, 0 (in press), pp. 1-12. doi: 10.1109/TCYB.2021.3067822. | en_US |
| dc.identifier.issn | 2168-2267 | - |
| dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/23903 | - |
| dc.description.sponsorship | National Natural Science Foundation of China (Grant Number: 61873058 and 61933007); China Post-Doctoral Science Foundation (Grant Number: 2017M621242 and 2020T130092); Natural Science Foundation of Heilongjiang Province of China (Grant Number: ZD2019F001); Fundamental Research Funds for Undergraduate Universities affiliated to Heilongjiang Province (Grant Number: 2018QNL-30); Engineering and Physical Sciences Research Council EPSRC of the U.K.; Royal Society of the U.K.; Alexander von Humboldt Foundation of Germany. | en_US |
| dc.format.extent | 1 - 12 | - |
| dc.format.medium | Print-Electronic | - |
| dc.language.iso | en_US | en_US |
| dc.publisher | IEEE | en_US |
| dc.rights | © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | - |
| dc.subject | complex networks (CNs) | en_US |
| dc.subject | coupling uncertainties | en_US |
| dc.subject | deception attacks | en_US |
| dc.subject | recursive filtering (RF) | en_US |
| dc.subject | state saturations | en_US |
| dc.title | Recursive Minimum-Variance Filter Design for State-Saturated Complex Networks With Uncertain Coupling Strengths Subject to Deception Attacks | en_US |
| dc.type | Article | en_US |
| dc.identifier.doi | https://doi.org/10.1109/TCYB.2021.3067822 | - |
| dc.relation.isPartOf | IEEE Transactions on Cybernetics | - |
| pubs.publication-status | Published | - |
| pubs.volume | 0 | - |
| dc.identifier.eissn | 2168-2275 | - |
| Appears in Collections: | Dept of Computer Science Research Papers | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| FullText.pdf | © 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. | 953.09 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.