Examining Robustness and Vulnerability of Networked Systems最新文献

筛选
英文 中文
Bilinear Markovian Processes of Search for Stationary and Moving Objects 静止和运动目标搜索的双线性马尔可夫过程
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-209
P. Pardalos, V. Yatsenko, Michael B. Fenn, A. Chikrii
{"title":"Bilinear Markovian Processes of Search for Stationary and Moving Objects","authors":"P. Pardalos, V. Yatsenko, Michael B. Fenn, A. Chikrii","doi":"10.3233/978-1-61499-391-9-209","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-209","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"41 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":"125075320","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}
引用次数: 1
Monotonic and Non-Monotonic Infections on Networks 网络上的单调和非单调感染
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-93
A. Gutfraind
{"title":"Monotonic and Non-Monotonic Infections on Networks","authors":"A. Gutfraind","doi":"10.3233/978-1-61499-391-9-93","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-93","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"36 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":"131629690","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
Distributed Computer Attack Detection System for Corporate Networks 企业网络分布式计算机攻击检测系统
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-243
V. Sargsyan, Arman Sargsyan, Armen Ghazaryan
{"title":"Distributed Computer Attack Detection System for Corporate Networks","authors":"V. Sargsyan, Arman Sargsyan, Armen Ghazaryan","doi":"10.3233/978-1-61499-391-9-243","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-243","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"91 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":"122503484","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
Evaluation of the Reliability of Repairable s - t Networks by Fast Simulation Method 基于快速仿真的可修s - t网络可靠性评估
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-120
N. Kuznetsov
{"title":"Evaluation of the Reliability of Repairable s - t Networks by Fast Simulation Method","authors":"N. Kuznetsov","doi":"10.3233/978-1-61499-391-9-120","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-120","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"20 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":"125140131","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
On Data Clustering: Exact and Approximate Solutions 关于数据聚类:精确和近似解
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-65
P. Festa
{"title":"On Data Clustering: Exact and Approximate Solutions","authors":"P. Festa","doi":"10.3233/978-1-61499-391-9-65","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-65","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"182 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":"131379154","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}
引用次数: 1
On Risk-Averse Weighted k-Club Problems 关于风险厌恶加权k俱乐部问题
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-231
M. Rysz, F. M. Pajouh, P. Krokhmal, E. Pasiliao
{"title":"On Risk-Averse Weighted k-Club Problems","authors":"M. Rysz, F. M. Pajouh, P. Krokhmal, E. Pasiliao","doi":"10.3233/978-1-61499-391-9-231","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-231","url":null,"abstract":"In this work, we consider a risk-averse maximum weighted k-club problems. It is assumed that vertices of the graph have stochastic weights whose joint distribution is known. The goal is to find the k-club of minimum risk contained in the graph. A stochastic programming framework that is based on the formalism of coherent risk measures is used to find the corresponding subgraphs. The selected representation of risk of a subgraph ensures that the optimal solutions are maximal k-clubs. A combinatorial branch-and-bound solution algorithm is proposed and solution performances are compared with an equivalent mathematical programming counterpart problem for instances with k = 2.","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"21 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":"121171846","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}
引用次数: 1
Multiobjective Particle Swarm Optimization for a Multicast Routing Problem 多目标粒子群算法求解组播路由问题
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-161
Y. Marinakis, A. Migdalas
{"title":"Multiobjective Particle Swarm Optimization for a Multicast Routing Problem","authors":"Y. Marinakis, A. Migdalas","doi":"10.3233/978-1-61499-391-9-161","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-161","url":null,"abstract":"Routing has always been of immense importance in communication networks due to its impact on the network performance. The significance of scalable and adaptive routing has sky-rocked during the las ...","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"27 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":"126346526","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
Security in Wireless Networks: A Tutorial 无线网络安全:教程
Examining Robustness and Vulnerability of Networked Systems Pub Date : 1900-01-01 DOI: 10.3233/978-1-61499-391-9-272
Satish Vadlamani, Hugh R. Medal, B. Eksioglu
{"title":"Security in Wireless Networks: A Tutorial","authors":"Satish Vadlamani, Hugh R. Medal, B. Eksioglu","doi":"10.3233/978-1-61499-391-9-272","DOIUrl":"https://doi.org/10.3233/978-1-61499-391-9-272","url":null,"abstract":"","PeriodicalId":264408,"journal":{"name":"Examining Robustness and Vulnerability of Networked Systems","volume":"423 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":"126714140","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
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学术官方微信
小红书