<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2023-4-288-307</article-id><article-id custom-type="edn" pub-id-type="custom">BQTEIR</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1822</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>Discrete Mathematics in Relation to Computer Science</subject></subj-group></article-categories><title-group><article-title>Алгоритм предсказания связей в саморегулирующейся сети с адаптивной топологией на базе теории графов и машинного обучения</article-title><trans-title-group xml:lang="en"><trans-title>Algorithm for link prediction in self-regulating network with adaptive topology based on graph theory and machine learning</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1345-1874</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Павленко</surname><given-names>Евгений Юрьевич</given-names></name><name name-style="western" xml:lang="en"><surname>Pavlenko</surname><given-names>Evgeny Y.</given-names></name></name-alternatives><email xlink:type="simple">pavlenko@ibks.spbstu.ru</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Санкт-Петербургский политехнический университет Петра Великого</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Peter the Great St. Petersburg Polytechnic University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2023</year></pub-date><pub-date pub-type="epub"><day>11</day><month>12</month><year>2023</year></pub-date><volume>30</volume><issue>4</issue><fpage>288</fpage><lpage>307</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Павленко Е.Ю., 2023</copyright-statement><copyright-year>2023</copyright-year><copyright-holder xml:lang="ru">Павленко Е.Ю.</copyright-holder><copyright-holder xml:lang="en">Pavlenko E.Y.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://www.mais-journal.ru/jour/article/view/1822">https://www.mais-journal.ru/jour/article/view/1822</self-uri><abstract><p>В статье представлена графовая модель функционирования сети с адаптивной топологией, где узлы сети представляют собой вершины графа, а обмен данными между узлами представлен в виде ребер. Динамический характер сетевого взаимодействия осложняет решение задачи мониторинга и контроля функционирования сети с адаптивной топологией, которую необходимо выполнять для обеспечения гарантированно корректного сетевого взаимодействия. Значимость решения такой задачи обосновывается созданием современных информационных и киберфизических систем, в основе которых лежат сети с адаптивной топологией. Динамический характер связей между узлами, с одной стороны, позволяет обеспечивать саморегуляцию сети, с другой стороны, существенно осложняет контроль за работой сети в связи с невозможностью выделения единого шаблона сетевого взаимодействия. На базе разработанной модели функционирования сети с адаптивной топологией предложен графовый алгоритм предсказания связей, распространенный на случай с одноранговыми сетями. В основу алгоритма положены значимые параметры узлов сети, харатеризующие как их физические характеристики (уровень сигнала, заряд батареи), так и их характеристики как объектов сетевого взаимодействия (характеристики центральности вершин графа). Корректность и адекватность разработанного алгоритма подтверждена экспериментальными результатами по моделированию одноранговой сети с адаптивной топологией и ее саморегуляции при удалении различных узлов.</p></abstract><trans-abstract xml:lang="en"><p>The paper presents a graph model of the functioning of a network with adaptive topology, where the network nodes represent the vertices of the graph, and data exchange between the nodes is represented as edges. The dynamic nature of network interaction complicates the solution of the task of monitoring and controlling the functioning of a network with adaptive topology, which must be performed to ensure guaranteed correct network interaction. The importance of solving such a problem is justified by the creation of modern information and cyber-physical systems, which are based on networks with adaptive topology. The dynamic nature of links between nodes, on the one hand, allows to provide self-regulation of the network, on the other hand, significantly complicates the control over the network operation due to the impossibility of identifying a single pattern of network interaction. On the basis of the developed model of network functioning with adaptive topology, a graph algorithm for link prediction is proposed, which is extended to the case of peer-to-peer networks. The algorithm is based on significant parameters of network nodes, characterizing both their physical characteristics (signal level, battery charge) and their characteristics as objects of network interaction (characteristics of centrality of graph nodes). Correctness and adequacy of the developed algorithm is confirmed by experimental results on modeling of a peer-to-peer network with adaptive topology and its self-regulation at removal of various nodes.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>моделирование</kwd><kwd>сети с адаптивной топологией</kwd><kwd>графовая модель</kwd><kwd>предсказание связей</kwd><kwd>метрики центральности</kwd></kwd-group><kwd-group xml:lang="en"><kwd>modeling</kwd><kwd>networks with adaptive topology</kwd><kwd>graph model</kwd><kwd>link prediction</kwd><kwd>centrality metrics</kwd></kwd-group><funding-group><funding-statement xml:lang="ru">Исследование выполнено за счет гранта Российского научного фонда № 22-21-20008. Исследование выполнено за счет гранта Санкт-Петербургского научного фонда в соответствии с соглашением от 15 апреля 2022 г. №61/220.</funding-statement><funding-statement xml:lang="en">The research is funded by the Russian Science Foundation, project no. 22-21-20008. The research is funded by the grant of the St. Petersburg Science Foundation in accordance with the agreement of April 15, 2022 № 61/220.</funding-statement></funding-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">V. Student and R. Dhir, “A study of ad hoc network: A review,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, no. 3, pp. 135–138, 2013.</mixed-citation><mixed-citation xml:lang="en">V. Student and R. Dhir, “A study of ad hoc network: A review,” International Journal of Advanced Research in Computer Science and Software Engineering, vol. 3, no. 3, pp. 135–138, 2013.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">V. Amulya, “Cyber Physical Systems by Using Wireless Sensor Networks,” International Journal of Science and Research, vol. 7, no. 4, pp. 1380–1396, 2018.</mixed-citation><mixed-citation xml:lang="en">V. Amulya, “Cyber Physical Systems by Using Wireless Sensor Networks,” International Journal of Science and Research, vol. 7, no. 4, pp. 1380–1396, 2018.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">V. L. Narasimhan, A. A. Arvind, and K. Bever, “Greenhouse asset management using wireless sensor-actor networks,” in International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM'07), 2007, pp. 9–14.</mixed-citation><mixed-citation xml:lang="en">V. L. Narasimhan, A. A. Arvind, and K. Bever, “Greenhouse asset management using wireless sensor-actor networks,” in International Conference on Mobile Ubiquitous Computing, Systems, Services and Technologies (UBICOMM'07), 2007, pp. 9–14.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">T. Taleb, D. Bottazzi, M. Guizani, and H. Nait-Charif, “Angelah: a framework for assisting elders at home,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 4, pp. 480–494, 2009.</mixed-citation><mixed-citation xml:lang="en">T. Taleb, D. Bottazzi, M. Guizani, and H. Nait-Charif, “Angelah: a framework for assisting elders at home,” IEEE Journal on Selected Areas in Communications, vol. 27, no. 4, pp. 480–494, 2009.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">P. Mohan, V. N. Padmanabhan, and R. Ramjee, “Nericell: rich monitoring of road and traffic conditions using mobile smartphones,” in Proceedings of the 6th ACM conference on Embedded network sensor systems, 2008, pp. 323–336.</mixed-citation><mixed-citation xml:lang="en">P. Mohan, V. N. Padmanabhan, and R. Ramjee, “Nericell: rich monitoring of road and traffic conditions using mobile smartphones,” in Proceedings of the 6th ACM conference on Embedded network sensor systems, 2008, pp. 323–336.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">A. Thiagarajan et al., “Vtrack: accurate, energy-aware road traffic delay estimation using mobile phones,” in Proceedings of the 7th ACM conference on embedded networked sensor systems, 2009, pp. 85–98.</mixed-citation><mixed-citation xml:lang="en">A. Thiagarajan et al., “Vtrack: accurate, energy-aware road traffic delay estimation using mobile phones,” in Proceedings of the 7th ACM conference on embedded networked sensor systems, 2009, pp. 85–98.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">S. Mathur et al., “Parknet: drive-by sensing of road-side parking statistics,” in Proceedings of the 8th international conference on Mobile systems, applications, and services, 2010, pp. 123–136.</mixed-citation><mixed-citation xml:lang="en">S. Mathur et al., “Parknet: drive-by sensing of road-side parking statistics,” in Proceedings of the 8th international conference on Mobile systems, applications, and services, 2010, pp. 123–136.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">J. Wang, Z. Li, M. Li, Y. Liu, and Z. Yang, “Sensor network navigation without locations,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 7, pp. 1436–1446, 2012.</mixed-citation><mixed-citation xml:lang="en">J. Wang, Z. Li, M. Li, Y. Liu, and Z. Yang, “Sensor network navigation without locations,” IEEE Transactions on Parallel and Distributed Systems, vol. 24, no. 7, pp. 1436–1446, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">E. Y. Pavlenko, “Functional Model of Adaptive Network Topology of Large-Scale Systems Based on Dynamical Graph Theory,” Automatic Control and Computer Sciences, vol. 56, no. 8, pp. 1016–1024, 2022.</mixed-citation><mixed-citation xml:lang="en">E. Y. Pavlenko, “Functional Model of Adaptive Network Topology of Large-Scale Systems Based on Dynamical Graph Theory,” Automatic Control and Computer Sciences, vol. 56, no. 8, pp. 1016–1024, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Z. Stanfield, M. Coşkun, and M. Koyutürk, “Drug response prediction as a link prediction problem,” Scientific reports, vol. 7, no. 1, p. 40321, 2017.</mixed-citation><mixed-citation xml:lang="en">Z. Stanfield, M. Coşkun, and M. Koyutürk, “Drug response prediction as a link prediction problem,” Scientific reports, vol. 7, no. 1, p. 40321, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">T. J. Lakshmi and S. D. Bhavani, “Link prediction approach to recommender systems,” Computing, 2023, doi: 10.1007/s00607-023-01227-0.</mixed-citation><mixed-citation xml:lang="en">T. J. Lakshmi and S. D. Bhavani, “Link prediction approach to recommender systems,” Computing, 2023, doi: 10.1007/s00607-023-01227-0.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">M. Nickel, K. Murphy, V. Tresp, and E. Gabrilovich, “A review of relational machine learning for knowledge graphs,” Proceedings of the IEEE, vol. 104, no. 1, pp. 11–33, 2015.</mixed-citation><mixed-citation xml:lang="en">M. Nickel, K. Murphy, V. Tresp, and E. Gabrilovich, “A review of relational machine learning for knowledge graphs,” Proceedings of the IEEE, vol. 104, no. 1, pp. 11–33, 2015.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">N. N. Daud, S. H. Ab Hamid, M. Saadoon, F. Sahran, and N. B. Anuar, “Applications of link prediction in social networks: A review,” Journal of Network and Computer Applications, vol. 166, p. 102716, 2020.</mixed-citation><mixed-citation xml:lang="en">N. N. Daud, S. H. Ab Hamid, M. Saadoon, F. Sahran, and N. B. Anuar, “Applications of link prediction in social networks: A review,” Journal of Network and Computer Applications, vol. 166, p. 102716, 2020.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Z. Qiu, J. Wu, W. Hu, B. Du, G. Yuan, and P. Yu, “Temporal link prediction with motifs for social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 3, pp. 3145–3158, 2023.</mixed-citation><mixed-citation xml:lang="en">Z. Qiu, J. Wu, W. Hu, B. Du, G. Yuan, and P. Yu, “Temporal link prediction with motifs for social networks,” IEEE Transactions on Knowledge and Data Engineering, vol. 35, no. 3, pp. 3145–3158, 2023.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">H. Nassar, A. R. Benson, and D. F. Gleich, “Neighborhood and PageRank methods for pairwise link prediction,” Social Network Analysis and Mining, vol. 10, no. 1, p. 63, 2020.</mixed-citation><mixed-citation xml:lang="en">H. Nassar, A. R. Benson, and D. F. Gleich, “Neighborhood and PageRank methods for pairwise link prediction,” Social Network Analysis and Mining, vol. 10, no. 1, p. 63, 2020.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">X.-H. Yang, X. Yang, F. Ling, H.-F. Zhang, D. Zhang, and J. Xiao, “Link prediction based on local major path degree,” Modern Physics Letters B, vol. 32, no. 29, pp. 1850348–306, 2018.</mixed-citation><mixed-citation xml:lang="en">X.-H. Yang, X. Yang, F. Ling, H.-F. Zhang, D. Zhang, and J. Xiao, “Link prediction based on local major path degree,” Modern Physics Letters B, vol. 32, no. 29, pp. 1850348–306, 2018.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">S. Kumar, A. Mallik, and B. S. Panda, “Link prediction in complex networks using node centrality and light gradient boosting machine,” World Wide Web, vol. 25, no. 6, pp. 2487–2513, 2022.</mixed-citation><mixed-citation xml:lang="en">S. Kumar, A. Mallik, and B. S. Panda, “Link prediction in complex networks using node centrality and light gradient boosting machine,” World Wide Web, vol. 25, no. 6, pp. 2487–2513, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">J. Cheriyan and G. P. Sajeev, “m-PageRank: A novel centrality measure for multilayer networks,” Advances in Complex Systems, vol. 23, no. 5, p. 2050012, 2020.</mixed-citation><mixed-citation xml:lang="en">J. Cheriyan and G. P. Sajeev, “m-PageRank: A novel centrality measure for multilayer networks,” Advances in Complex Systems, vol. 23, no. 5, p. 2050012, 2020.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">F. Feng, X. Liu, B. Yong, R. Zhou, and Q. Zhou, “Anomaly detection in ad-hoc networks based on deep learning model: A plug and play device,” Ad Hoc Networks, vol. 84, pp. 82–89, 2019.</mixed-citation><mixed-citation xml:lang="en">F. Feng, X. Liu, B. Yong, R. Zhou, and Q. Zhou, “Anomaly detection in ad-hoc networks based on deep learning model: A plug and play device,” Ad Hoc Networks, vol. 84, pp. 82–89, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">R. Meddeb, F. Jemili, B. Triki, and O. Korbaa, “Anomaly-based behavioral detection in mobile Ad-Hoc networks,” Procedia Computer Science, vol. 159, pp. 77–86, 2019.</mixed-citation><mixed-citation xml:lang="en">R. Meddeb, F. Jemili, B. Triki, and O. Korbaa, “Anomaly-based behavioral detection in mobile Ad-Hoc networks,” Procedia Computer Science, vol. 159, pp. 77–86, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in Advances in Neural Information Processing Systems 31 (NeurIPS 2018), 2018, pp. 5165–5175.</mixed-citation><mixed-citation xml:lang="en">M. Zhang and Y. Chen, “Link prediction based on graph neural networks,” in Advances in Neural Information Processing Systems 31 (NeurIPS 2018), 2018, pp. 5165–5175.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">B. P. Chamberlain et al., “Graph Neural Networks for Link Prediction with Subgraph Sketching.” 2023.</mixed-citation><mixed-citation xml:lang="en">B. P. Chamberlain et al., “Graph Neural Networks for Link Prediction with Subgraph Sketching.” 2023.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">M. Niu, L. Liu, and J. Shu, “Link Quality Prediction for Wireless Networks: Current Status and Future Directions,” in Proceedings of the 2023 8th International Conference on Intelligent Information Technology, 2023, pp. 52–56.</mixed-citation><mixed-citation xml:lang="en">M. Niu, L. Liu, and J. Shu, “Link Quality Prediction for Wireless Networks: Current Status and Future Directions,” in Proceedings of the 2023 8th International Conference on Intelligent Information Technology, 2023, pp. 52–56.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">J. Chen, Y. Han, D. Li, and J. Nie, “Link prediction and route selection based on channel state detection in UASNs,” International Journal of Distributed Sensor Networks, vol. 7, no. 1, p. 939864, 2011.</mixed-citation><mixed-citation xml:lang="en">J. Chen, Y. Han, D. Li, and J. Nie, “Link prediction and route selection based on channel state detection in UASNs,” International Journal of Distributed Sensor Networks, vol. 7, no. 1, p. 939864, 2011.</mixed-citation></citation-alternatives></ref><ref id="cit25"><label>25</label><citation-alternatives><mixed-citation xml:lang="ru">H. Shao, L. Wang, H. Liu, and R. Zhu, “A link prediction method for MANETs based on fast spatio-temporal feature extraction and LSGANs,” Scientific Reports, vol. 12, no. 1, p. 16896, 2022.</mixed-citation><mixed-citation xml:lang="en">H. Shao, L. Wang, H. Liu, and R. Zhu, “A link prediction method for MANETs based on fast spatio-temporal feature extraction and LSGANs,” Scientific Reports, vol. 12, no. 1, p. 16896, 2022.</mixed-citation></citation-alternatives></ref><ref id="cit26"><label>26</label><citation-alternatives><mixed-citation xml:lang="ru">F. Harary and G. Gupta, “Dynamic graph models,” Mathematical and Computer Modelling, vol. 25, no. 7, pp. 79–87, 1997.</mixed-citation><mixed-citation xml:lang="en">F. Harary and G. Gupta, “Dynamic graph models,” Mathematical and Computer Modelling, vol. 25, no. 7, pp. 79–87, 1997.</mixed-citation></citation-alternatives></ref><ref id="cit27"><label>27</label><citation-alternatives><mixed-citation xml:lang="ru">L. K. Ketshabetswe, A. M. Zungeru, M. Mangwala, J. M. Chuma, and B. Sigweni, “Communication protocols for wireless sensor networks: A survey and comparison,” Heliyon, vol. 5, no. 5, p. E01591, 2019.</mixed-citation><mixed-citation xml:lang="en">L. K. Ketshabetswe, A. M. Zungeru, M. Mangwala, J. M. Chuma, and B. Sigweni, “Communication protocols for wireless sensor networks: A survey and comparison,” Heliyon, vol. 5, no. 5, p. E01591, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit28"><label>28</label><citation-alternatives><mixed-citation xml:lang="ru">D. Kandris, C. Nakas, D. Vomvas, and G. Koulouras, “Applications of wireless sensor networks: an up-to-date survey,” Applied system innovation, vol. 3, no. 1, p. 14, 2020.</mixed-citation><mixed-citation xml:lang="en">D. Kandris, C. Nakas, D. Vomvas, and G. Koulouras, “Applications of wireless sensor networks: an up-to-date survey,” Applied system innovation, vol. 3, no. 1, p. 14, 2020.</mixed-citation></citation-alternatives></ref><ref id="cit29"><label>29</label><citation-alternatives><mixed-citation xml:lang="ru">M. Kim, S. Park, and W. Lee, “Energy and distance-aware hopping sensor relocation for wireless sensor networks,” Sensors, vol. 19, no. 7, p. 1567, 2019.</mixed-citation><mixed-citation xml:lang="en">M. Kim, S. Park, and W. Lee, “Energy and distance-aware hopping sensor relocation for wireless sensor networks,” Sensors, vol. 19, no. 7, p. 1567, 2019.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
