复杂网络的亚线性评估,用于广泛探索关键场景和决策的配置

A. Delbem, A. Saraiva, J. London, R. Fanucchi
{"title":"复杂网络的亚线性评估,用于广泛探索关键场景和决策的配置","authors":"A. Delbem, A. Saraiva, J. London, R. Fanucchi","doi":"10.1109/CSCI54926.2021.00142","DOIUrl":null,"url":null,"abstract":"Artificial Intelligence in Complex Networks has contributed to several relevant fields involving energy systems, computer networks, environment, agriculture, health, and social organizations. However, investigations concerning multiple heterogeneous networks have been less frequent. Mixed systems usually require fine-grained data to retain a sufficient amount of details from each network. This type of modeling may enable the investigation of emerging behaviors or synergies. For example, a decision making may require the search for an improved network configuration (involving coarse and fine modifications on devices, procedures, and settings) with the lowest possible cost to soon mitigate effects from climate changes or other types of \"attacks\" (from economic crises, calamities, and recent pandemics). The generation of robust configurations for heterogeneous networks involves some challenges, pointed out in this paper. Among them, the efficient calculus of load flows has been one of the main challenges. To overcome it, we propose a load flow algorithm with sublinear time complexity for the construction and evaluation of several configurations. The new algorithm scales well and can deal with nonlinear dynamics in evaluations of entire sets of fine-grained network models that it may involve.","PeriodicalId":206881,"journal":{"name":"2021 International Conference on Computational Science and Computational Intelligence (CSCI)","volume":"87 46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Sublinear evaluation of complex networks for extensive exploration of configurations for critical scenarios and decision making\",\"authors\":\"A. Delbem, A. Saraiva, J. London, R. Fanucchi\",\"doi\":\"10.1109/CSCI54926.2021.00142\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Artificial Intelligence in Complex Networks has contributed to several relevant fields involving energy systems, computer networks, environment, agriculture, health, and social organizations. However, investigations concerning multiple heterogeneous networks have been less frequent. Mixed systems usually require fine-grained data to retain a sufficient amount of details from each network. This type of modeling may enable the investigation of emerging behaviors or synergies. For example, a decision making may require the search for an improved network configuration (involving coarse and fine modifications on devices, procedures, and settings) with the lowest possible cost to soon mitigate effects from climate changes or other types of \\\"attacks\\\" (from economic crises, calamities, and recent pandemics). The generation of robust configurations for heterogeneous networks involves some challenges, pointed out in this paper. Among them, the efficient calculus of load flows has been one of the main challenges. To overcome it, we propose a load flow algorithm with sublinear time complexity for the construction and evaluation of several configurations. The new algorithm scales well and can deal with nonlinear dynamics in evaluations of entire sets of fine-grained network models that it may involve.\",\"PeriodicalId\":206881,\"journal\":{\"name\":\"2021 International Conference on Computational Science and Computational Intelligence (CSCI)\",\"volume\":\"87 46 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 International Conference on Computational Science and Computational Intelligence (CSCI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSCI54926.2021.00142\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Computational Science and Computational Intelligence (CSCI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSCI54926.2021.00142","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

复杂网络中的人工智能对能源系统、计算机网络、环境、农业、卫生和社会组织等多个相关领域做出了贡献。然而,对多个异构网络的研究却很少。混合系统通常需要细粒度的数据来保留来自每个网络的足够数量的细节。这种类型的建模可以对新出现的行为或协同作用进行调查。例如,一项决策可能需要以尽可能低的成本寻找改进的网络配置(包括对设备、程序和设置进行粗细修改),以尽快减轻气候变化或其他类型的“攻击”(来自经济危机、灾难和最近的流行病)的影响。本文指出了异构网络鲁棒配置的生成所面临的一些挑战。其中,有效的潮流计算一直是主要的挑战之一。为了克服这一问题,我们提出了一种具有亚线性时间复杂度的负荷流算法,用于构建和评估几种配置。新算法具有良好的可扩展性,可以处理可能涉及的整组细粒度网络模型的非线性动态评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Sublinear evaluation of complex networks for extensive exploration of configurations for critical scenarios and decision making
Artificial Intelligence in Complex Networks has contributed to several relevant fields involving energy systems, computer networks, environment, agriculture, health, and social organizations. However, investigations concerning multiple heterogeneous networks have been less frequent. Mixed systems usually require fine-grained data to retain a sufficient amount of details from each network. This type of modeling may enable the investigation of emerging behaviors or synergies. For example, a decision making may require the search for an improved network configuration (involving coarse and fine modifications on devices, procedures, and settings) with the lowest possible cost to soon mitigate effects from climate changes or other types of "attacks" (from economic crises, calamities, and recent pandemics). The generation of robust configurations for heterogeneous networks involves some challenges, pointed out in this paper. Among them, the efficient calculus of load flows has been one of the main challenges. To overcome it, we propose a load flow algorithm with sublinear time complexity for the construction and evaluation of several configurations. The new algorithm scales well and can deal with nonlinear dynamics in evaluations of entire sets of fine-grained network models that it may involve.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信