发布求助
文献互助 智能选刊 最新文献

Examining Robustness and Vulnerability of Networked Systems最新文献

筛选
英文 中文
A Survey of Interdependency Models for Critical Infrastructure Networks 关键基础设施网络相互依赖模型综述
Examining Robustness and Vulnerability of Networked Systems Pub Date : 2017-02-07 DOI: 10.3233/978-1-61499-391-9-1
Joydeep Banerjee, Arun Das, Arunabha Sen
{"title":"A Survey of Interdependency Models for Critical Infrastructure Networks","authors":"Joydeep Banerjee, Arun Das, Arunabha Sen","doi":"10.3233/978-1-61499-391-9-1","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-1","url":null,"abstract":"The critical infrastructures of the nation such as the power grid and the communication network are highly interdependent. Also, it has been observed that there exists complex interdependent relationships between individual entities of the power grid and the communication network that further obfuscates the analysis, and mitigation of faults in such multi-layered networks. In recent years, the research community has made significant efforts towards gaining insight and understanding of the interdependency relations in such multi-layered networks, and accordingly, a number of models have been proposed and analyzed towards realizing this goal. In this chapter we study existing interdependency models proposed in the recent literature and discuss their approach, and inherent features, towards modeling interdependent multi-layer networks. We also provide a brief discussion into the drawbacks of each of these models and propose an alternate model that addresses these drawbacks by capturing the interdependency relationships using a combination of conjunctive and disjunctive relations.","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115355366","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
Variable Neighborhood Search for Edge-Ratio Network Clustering 边比网络聚类的可变邻域搜索
Examining Robustness and Vulnerability of Networked Systems Pub Date : 2014-06-01 DOI: 10.3233/978-1-61499-391-9-51
S. Cafieri, P. Hansen, N. Mladenović
{"title":"Variable Neighborhood Search for Edge-Ratio Network Clustering","authors":"S. Cafieri, P. Hansen, N. Mladenović","doi":"10.3233/978-1-61499-391-9-51","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-51","url":null,"abstract":"Edge-ratio clustering was introduced in [Cafieri et al., Phys.Rev. E 81(2):026105, 2010], as a criterion for optimal graph bipartitioning in hierarchical divisive algorithms for cluster identification in networks. Exact algorithms to perform bipartitioning maximizing the edge-ratio were shown to be too time consuming to be applied to large datasets. In this paper, we present a Variable Neighborhood Search (VNS)-based heuristic for hierarchical divisive edge ratio network clustering. We give a full description including the structure of some algorithmic procedures which are used to implement the main steps of the heuristic. Computational results show that the proposed algorithm is very efficient in terms of quality of the bipartitions, moreover the computing time is much smaller than that one for exact algorithms.","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125064260","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Approximation Algorithms for Detecting Critical Nodes 关键节点检测的近似算法
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-289
M. Ventresca, D. Aleman
{"title":"Approximation Algorithms for Detecting Critical Nodes","authors":"M. Ventresca, D. Aleman","doi":"10.3233/978-1-61499-391-9-289","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-289","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132321515","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Robust Networked Control Systems with Communication Constraints 具有通信约束的鲁棒网络控制系统
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-176
S. Mehta, W. MacKunis, J. Curtis
{"title":"Robust Networked Control Systems with Communication Constraints","authors":"S. Mehta, W. MacKunis, J. Curtis","doi":"10.3233/978-1-61499-391-9-176","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-176","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132804028","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis and Design of Robust Network Clusters with Bounded Diameter 鲁棒有界直径网络簇的分析与设计
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-141
F. M. Pajouh, Alexander Veremyev, V. Boginski
{"title":"Analysis and Design of Robust Network Clusters with Bounded Diameter","authors":"F. M. Pajouh, Alexander Veremyev, V. Boginski","doi":"10.3233/978-1-61499-391-9-141","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-141","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"203 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131873541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Hybrid Metaheuristic for the Maximum k-Plex Problem 最大k-Plex问题的混合元启发式
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-83
K. R. Gujjula, Krishnan Ayalur Seshadrinathan, A. Meisami
{"title":"A Hybrid Metaheuristic for the Maximum k-Plex Problem","authors":"K. R. Gujjula, Krishnan Ayalur Seshadrinathan, A. Meisami","doi":"10.3233/978-1-61499-391-9-83","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-83","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124066319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Using GRASP for the Cover by s-Defective Independent Sets Problem 用GRASP求解s-缺陷独立集覆盖问题
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-17
Austin Buchanan, Nannan Chen, Xin Ma
{"title":"Using GRASP for the Cover by s-Defective Independent Sets Problem","authors":"Austin Buchanan, Nannan Chen, Xin Ma","doi":"10.3233/978-1-61499-391-9-17","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-17","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116010961","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance 跳跃约束有向斯坦纳树问题的局部搜索及其在无人机多目标监视中的应用
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-26
O. Burdakov, P. Doherty, Jonas Kvarnström
{"title":"Local Search for Hop-Constrained Directed Steiner Tree Problem with Application to UAV-Based Multi-Target Surveillance","authors":"O. Burdakov, P. Doherty, Jonas Kvarnström","doi":"10.3233/978-1-61499-391-9-26","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-26","url":null,"abstract":"We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be app ...","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123725351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Hop-Constrained Tree-Shaped Networks 跳数约束的树形网络
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-192
Marta S. R. Monteiro, D. Fontes, F. Fontes
{"title":"Hop-Constrained Tree-Shaped Networks","authors":"Marta S. R. Monteiro, D. Fontes, F. Fontes","doi":"10.3233/978-1-61499-391-9-192","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-192","url":null,"abstract":"Hop constraints are used to limit the number of links between two given points in a network, this way improving the quality of service by increasing the availability and reliability of the network. They have been applied to a limited number of problems, although their application can be of the greatest importance both from the academical and practical points-of-view. In this work, we survey relevant and recent works on hop-constrained problems focusing on problems with tree shaped solutions.","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121277882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Optimal Balanced Packing Using Phi-Function Technique 利用pi函数技术优化平衡填料
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-251
Y. Stoyan, P. Stetsyuk, T. Romanova
{"title":"Optimal Balanced Packing Using Phi-Function Technique","authors":"Y. Stoyan, P. Stetsyuk, T. Romanova","doi":"10.3233/978-1-61499-391-9-251","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-251","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121998395","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书