Pub Date : 2024-01-01Epub Date: 2022-08-19DOI: 10.1007/s40489-022-00338-2
Luna L Wattel, Reubs J Walsh, Lydia Krabbendam
While research on the prevalence of co-occurring autism spectrum conditions (ASC) and trans gender modality (TGM) is available, less is known about the underlying mechanism of this association. Insight is needed to improve treatment of trans autistic people. This review provides an overview of theories on the ASC-TGM link and the available evidence for/against them published between January 2016 and October 2020. A systematic search was performed in PubMed, PsycINFO, Web of Science, and Scopus. This resulted in 36 studies, in which 15 theories were identified. Results indicate all theories lack substantial empirical support. Unlikely and promising theories were identified. The most promising theories were those on resistance to social norms and weakened sex differences. Future directions are provided.
{"title":"Theories on the Link Between Autism Spectrum Conditions and Trans Gender Modality: a Systematic Review.","authors":"Luna L Wattel, Reubs J Walsh, Lydia Krabbendam","doi":"10.1007/s40489-022-00338-2","DOIUrl":"10.1007/s40489-022-00338-2","url":null,"abstract":"<p><p>While research on the prevalence of co-occurring autism spectrum conditions (ASC) and trans gender modality (TGM) is available, less is known about the underlying mechanism of this association. Insight is needed to improve treatment of trans autistic people. This review provides an overview of theories on the ASC-TGM link and the available evidence for/against them published between January 2016 and October 2020. A systematic search was performed in PubMed, PsycINFO, Web of Science, and Scopus. This resulted in 36 studies, in which 15 theories were identified. Results indicate all theories lack substantial empirical support. Unlikely and promising theories were identified. The most promising theories were those on resistance to social norms and weakened sex differences. Future directions are provided.</p>","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"22 1","pages":"275-295"},"PeriodicalIF":3.8,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11127869/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82387353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-06DOI: 10.1080/17445760.2023.2272280
Francesco Salzano, Remo Pareschi
We describe implementing and testing a security monitoring system for Blockchain-based applications by performing Log Analysis through natural language processing (NLP) techniques and enabling queries via REST API. The study focuses on the Hyperledger Fabric framework, a highly reliable and scalable open-source software platform for private blockchains. The real-time monitoring system aims to detect and prevent attack scenarios on the network structure and smart contracts, such as DDOS, Sybil, and Eclipse. The vulnerability analysis is extended to inspecting Docker containers to detect network-based attacks. Although the case study focuses on Hyperledger Fabric, the techniques used are general and applicable to all Blockchain-based systems and fulfill the need to provide adequate monitoring capabilities for blockchain implementations.
{"title":"Enhancing blockchain security through natural language processing and real-time monitoring","authors":"Francesco Salzano, Remo Pareschi","doi":"10.1080/17445760.2023.2272280","DOIUrl":"https://doi.org/10.1080/17445760.2023.2272280","url":null,"abstract":"We describe implementing and testing a security monitoring system for Blockchain-based applications by performing Log Analysis through natural language processing (NLP) techniques and enabling queries via REST API. The study focuses on the Hyperledger Fabric framework, a highly reliable and scalable open-source software platform for private blockchains. The real-time monitoring system aims to detect and prevent attack scenarios on the network structure and smart contracts, such as DDOS, Sybil, and Eclipse. The vulnerability analysis is extended to inspecting Docker containers to detect network-based attacks. Although the case study focuses on Hyperledger Fabric, the techniques used are general and applicable to all Blockchain-based systems and fulfill the need to provide adequate monitoring capabilities for blockchain implementations.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135684360","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}
Pub Date : 2023-10-24DOI: 10.1080/17445760.2023.2273452
Dmitry A. Zaitsev, Tatiana R. Shmeleva, Zeyu Zhou, Ding Liu
The reliability of consensus protocols establishes the basis for cryptocurrency cybersecurity. Formal and simulation techniques are appreciated for the verification of proof-of-work agreement protocols, because the formal techniques development process frequently requires a series of assumptions, leading to somewhat unrealistic models. A conventional colored Petri net model, presented by the authors in a previous study, allowed us to refine the Keller and Böhme consensus protocol by applying the simulation technique. In this study, we developed a reenterable colored Petri net model representing a general construct for model-driven development and refinement of consensus protocols and the corresponding software. A considerable benefit of a reenterable model is the invariance of its structure with respect to the net topology, number of attached nodes, and parameters of their software and hardware, which are represented as the marking of dedicated places. Switching of topology tags associated with dynamic objects represents the basic principle of reenterable model functioning. It is shown that, having the same characteristics, in bounds of admissible error of some 2-3%, the reenterable model results in 6 times speed-up of the simulation process and a drastic decrease in time for model editing, especially when the number of nodes exceeds a hundred. Thus, a reenterable model is a valuable complement to possible formal models that allows us to obtain express-evaluations of characteristics in a rather short time and with an acceptable level of adequacy.
{"title":"Verification of cryptocurrency consensus protocols: reenterable colored Petri net model design","authors":"Dmitry A. Zaitsev, Tatiana R. Shmeleva, Zeyu Zhou, Ding Liu","doi":"10.1080/17445760.2023.2273452","DOIUrl":"https://doi.org/10.1080/17445760.2023.2273452","url":null,"abstract":"The reliability of consensus protocols establishes the basis for cryptocurrency cybersecurity. Formal and simulation techniques are appreciated for the verification of proof-of-work agreement protocols, because the formal techniques development process frequently requires a series of assumptions, leading to somewhat unrealistic models. A conventional colored Petri net model, presented by the authors in a previous study, allowed us to refine the Keller and Böhme consensus protocol by applying the simulation technique. In this study, we developed a reenterable colored Petri net model representing a general construct for model-driven development and refinement of consensus protocols and the corresponding software. A considerable benefit of a reenterable model is the invariance of its structure with respect to the net topology, number of attached nodes, and parameters of their software and hardware, which are represented as the marking of dedicated places. Switching of topology tags associated with dynamic objects represents the basic principle of reenterable model functioning. It is shown that, having the same characteristics, in bounds of admissible error of some 2-3%, the reenterable model results in 6 times speed-up of the simulation process and a drastic decrease in time for model editing, especially when the number of nodes exceeds a hundred. Thus, a reenterable model is a valuable complement to possible formal models that allows us to obtain express-evaluations of characteristics in a rather short time and with an acceptable level of adequacy.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"64 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135315540","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}
Blockchains enhance trust in decentralized systems through components like distributed consensus, peer-to-peer communication, and trustless computing. Deployed in real networks, they must ensure security and dependability at each level. This paper introduces security and dependability concepts in three key layers: consensus protocols, network infrastructures, and smart contract applications, derived from distributed systems theory and adapted to blockchains. It evaluates these attributes across eight famous blockchains, assuming realistic network deployments and Byzantine fault scenarios to reveal system strengths and weaknesses. The aim is to establish a comprehensive framework for blockchain assessments, providing insight into design choices and potential security issues.
{"title":"Security and dependability analysis of blockchain systems in partially synchronous networks with Byzantine faults","authors":"Stefano De Angelis, Federico Lombardi, Gilberto Zanfino, Leonardo Aniello, Vladimiro Sassone","doi":"10.1080/17445760.2023.2272777","DOIUrl":"https://doi.org/10.1080/17445760.2023.2272777","url":null,"abstract":"Blockchains enhance trust in decentralized systems through components like distributed consensus, peer-to-peer communication, and trustless computing. Deployed in real networks, they must ensure security and dependability at each level. This paper introduces security and dependability concepts in three key layers: consensus protocols, network infrastructures, and smart contract applications, derived from distributed systems theory and adapted to blockchains. It evaluates these attributes across eight famous blockchains, assuming realistic network deployments and Byzantine fault scenarios to reveal system strengths and weaknesses. The aim is to establish a comprehensive framework for blockchain assessments, providing insight into design choices and potential security issues.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135316405","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}
Pub Date : 2023-10-10DOI: 10.1080/17445760.2023.2266875
Nils Kohl, Daniel Bauer, Fabian Böhm, Ulrich Rüde
AbstractThis paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with 1.6⋅1011 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability.Keywords: Matrix-free finite elementshybrid tetrahedral gridsblock-structured gridsparallel data structures AcknowledgmentsThe authors gratefully acknowledge the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 https://i10git.cs.fau.de/hyteg/hyteg2 https://gauss-allianz.de/en/project/title/CoMPS3 https://www.nhr-verein.deAdditional informationFundingThe authors gratefully acknowledge funding through the joint BMBF project CoMPSFootnote2 (grant 16ME0647K). The authors would like to thank the NHR-Verein e.V.Footnote3 for supporting this work/project within the NHR Graduate School of National High Performance Computing (NHR). The Gauss Centre for Supercomputing e.V. funded this project by providing computing time on the GCS Supercomputer HPE Apollo Hawk at the High Performance Computing Center Stuttgart (grant TN17/44103). NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683.
摘要本文提出了在块结构混合四面体网格上实现无矩阵有限元方法的有效数据结构。它提供了从非结构化四面体粗网格的规则细化中出现的所有几何子对象的完整分类，并描述了有效的迭代模式和用于将系数映射到内存地址的分析线性化函数。这个基础可以实现快速、极端可扩展、无矩阵、迭代求解，特别是通过设计实现几何多网格方法。将其应用于富伽辽金离散化的变系数Stokes系统和用nsamdsamlec边元离散化的旋度-旋度问题，显示了实现的灵活性。最后，用无矩阵全多网格求解器解决了一个包含1.6⋅1011个(超过1000亿个)未知数、涉及32000多个过程的curl-curl问题，证明了它的极端可扩展性。关键词:无矩阵有限元混合四面体网格块结构网格并行数据结构致谢作者感谢Friedrich-Alexander-Universität Erlangen- n rnberg (FAU) Erlangen国家高性能计算中心(NHR@FAU)提供的科学支持和HPC资源。披露声明作者未报告潜在的利益冲突。作者感谢BMBF联合项目compsfootno2的资助(授权号16ME0647K)。作者要感谢NHR- verein e.v.对NHR国家高性能计算研究生院(NHR)内这项工作/项目的支持。高斯超级计算中心e.V.通过在斯图加特高性能计算中心的GCS超级计算机HPE阿波罗鹰上提供计算时间为该项目提供资金(拨款TN17/44103)。国家人权基金由联邦和巴伐利亚州当局提供。NHR@FAU硬件部分由德国研究基金会(DFG)资助- 440719683。
{"title":"Fundamental data structures for matrix-free finite elements on hybrid tetrahedral grids","authors":"Nils Kohl, Daniel Bauer, Fabian Böhm, Ulrich Rüde","doi":"10.1080/17445760.2023.2266875","DOIUrl":"https://doi.org/10.1080/17445760.2023.2266875","url":null,"abstract":"AbstractThis paper presents efficient data structures for the implementation of matrix-free finite element methods on block-structured, hybrid tetrahedral grids. It provides a complete categorization of all geometric sub-objects that emerge from the regular refinement of the unstructured, tetrahedral coarse grid and describes efficient iteration patterns and analytical linearization functions for the mapping of coefficients to memory addresses. This foundation enables the implementation of fast, extreme-scalable, matrix-free, iterative solvers, and in particular geometric multigrid methods by design. Their application to the variable-coefficient Stokes system subject to an enriched Galerkin discretization and to the curl-curl problem discretized with Nédélec edge elements showcases the flexibility of the implementation. Finally, the solution of a curl-curl problem with 1.6⋅1011 (more than one hundred billion) unknowns on more than 32,000 processes with a matrix-free full multigrid solver demonstrates its extreme-scalability.Keywords: Matrix-free finite elementshybrid tetrahedral gridsblock-structured gridsparallel data structures AcknowledgmentsThe authors gratefully acknowledge the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU).Disclosure statementNo potential conflict of interest was reported by the author(s).Notes1 https://i10git.cs.fau.de/hyteg/hyteg2 https://gauss-allianz.de/en/project/title/CoMPS3 https://www.nhr-verein.deAdditional informationFundingThe authors gratefully acknowledge funding through the joint BMBF project CoMPSFootnote2 (grant 16ME0647K). The authors would like to thank the NHR-Verein e.V.Footnote3 for supporting this work/project within the NHR Graduate School of National High Performance Computing (NHR). The Gauss Centre for Supercomputing e.V. funded this project by providing computing time on the GCS Supercomputer HPE Apollo Hawk at the High Performance Computing Center Stuttgart (grant TN17/44103). NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136296345","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}
Pub Date : 2023-09-29DOI: 10.1080/17445760.2023.2263621
Jordi Vallverdú, Max Talanov
AbstractThe ‘neuropunk revolution’ represents an innovative approach focused on the integration of human–machine interfaces through nerve and neural pathways. This cutting-edge concept seeks to push the boundaries of human–machine interaction by exploring the intricate connections between the human nervous system and artificial technologies. Neuropunk delves into the realm of cyborg technologies, blurring the lines between humans and machines and opening up new possibilities for augmenting human capabilities. By tapping into nerve and neural pathways, neuropunk envisions a future where individuals can seamlessly interface with technology, leading to enhanced sensory perception, cognitive abilities, and physical performance. This concept encapsulates a rebellious and unconventional spirit, challenging traditional notions of the human body and its relationship with technology. This paper discusses the challenges and potential of neuropunk, exploring the fusion of scientific exploration, technological innovation, and a punk-inspired ethos in advancing human–machine integration. It highlights the emergence of real-time neurosimulations and neuromorphic computing as key tools to achieve these aspirations. Additionally, the integration of neurological and hormonal bioinspiration is examined as a promising approach to the design of neural interfaces, fostering more efficient and effective technologies that align better with the human body. Finally, the paper addresses ethical considerations and research tasks to responsibly navigate the neuropunk revolution, ensuring a future that maximizes the benefits of neural interfaces while mitigating potential risks and promoting ethical principles.Keywords: BCIneurosimulationreal-time neurosimulationneurointerfaceneuroprosthesis Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingResearch of Prof. Jordi Vallverdú has been able thanks to an ICREA Acadèmia grant. Research of Max Talanov has been partially supported by the Kazan Federal University Strategic Academic Leadership Program (‘PRIORITY-2030’).
{"title":"Neuropunk revolution in short","authors":"Jordi Vallverdú, Max Talanov","doi":"10.1080/17445760.2023.2263621","DOIUrl":"https://doi.org/10.1080/17445760.2023.2263621","url":null,"abstract":"AbstractThe ‘neuropunk revolution’ represents an innovative approach focused on the integration of human–machine interfaces through nerve and neural pathways. This cutting-edge concept seeks to push the boundaries of human–machine interaction by exploring the intricate connections between the human nervous system and artificial technologies. Neuropunk delves into the realm of cyborg technologies, blurring the lines between humans and machines and opening up new possibilities for augmenting human capabilities. By tapping into nerve and neural pathways, neuropunk envisions a future where individuals can seamlessly interface with technology, leading to enhanced sensory perception, cognitive abilities, and physical performance. This concept encapsulates a rebellious and unconventional spirit, challenging traditional notions of the human body and its relationship with technology. This paper discusses the challenges and potential of neuropunk, exploring the fusion of scientific exploration, technological innovation, and a punk-inspired ethos in advancing human–machine integration. It highlights the emergence of real-time neurosimulations and neuromorphic computing as key tools to achieve these aspirations. Additionally, the integration of neurological and hormonal bioinspiration is examined as a promising approach to the design of neural interfaces, fostering more efficient and effective technologies that align better with the human body. Finally, the paper addresses ethical considerations and research tasks to responsibly navigate the neuropunk revolution, ensuring a future that maximizes the benefits of neural interfaces while mitigating potential risks and promoting ethical principles.Keywords: BCIneurosimulationreal-time neurosimulationneurointerfaceneuroprosthesis Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingResearch of Prof. Jordi Vallverdú has been able thanks to an ICREA Acadèmia grant. Research of Max Talanov has been partially supported by the Kazan Federal University Strategic Academic Leadership Program (‘PRIORITY-2030’).","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135199757","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}
Pub Date : 2023-09-29DOI: 10.1080/17445760.2023.2263142
Shibsankar Bala, Somesh Gorai, Pradyut Sarkar, Monish Chatterjee
AbstractSurvivability of Elastic Optical Networks (EONs) from a link failure is an important problem. Shared Backup Path Protection (SBPP) is widely used for protection against a link failure. Backup Spectrum Reservation with Multi Path Protection (BSR-MPP) was introduced to increase backup spectrum sharing by reserving backup spectrum and employing protection with multiple backup paths. We propose a new polynomial-time strategy, Blocking Aware Survivable Path Provisioning (BASPP) that shares backup resources like SBPP and BSR-MPP but can reduce request blocking when opportunity of sharing resources does not exist. Since we address the offline problem of Survivable Routing, Modulation and Spectrum Allocation in EONs, we also propose an Integer Linear Program formulation. Results show appreciable reduction in bandwidth blocking ratio by using BASPP over existing strategies.Keywords: Elastic optical networksroutingmodulationspectrum allocationsurvivabilityblocking aware Disclosure statementNo potential conflict of interest was reported by the author(s).
摘要弹性光网络在链路故障时的生存性是一个重要的问题。共享备份路径保护(Shared Backup Path Protection, SBPP)被广泛用于链路故障保护。BSR-MPP (Backup Spectrum Reservation with Multi - Path Protection)是通过预留备份频谱和采用多路径保护来增加备份频谱的共享。我们提出了一种新的多项式时间策略——阻塞感知生存路径分配(BASPP)，该策略可以共享SBPP和BSR-MPP等备份资源，但可以在不存在共享资源的机会时减少请求阻塞。由于我们解决了EONs中可生存路由、调制和频谱分配的离线问题，我们还提出了一个整数线性规划公式。结果表明，与现有策略相比，使用BASPP可显著降低带宽阻塞率。关键词:弹性光网络路由调制频谱分配生存性阻塞感知披露声明作者未报告潜在的利益冲突。
{"title":"Blocking aware offline survivable path provisioning of connection requests in elastic optical networks","authors":"Shibsankar Bala, Somesh Gorai, Pradyut Sarkar, Monish Chatterjee","doi":"10.1080/17445760.2023.2263142","DOIUrl":"https://doi.org/10.1080/17445760.2023.2263142","url":null,"abstract":"AbstractSurvivability of Elastic Optical Networks (EONs) from a link failure is an important problem. Shared Backup Path Protection (SBPP) is widely used for protection against a link failure. Backup Spectrum Reservation with Multi Path Protection (BSR-MPP) was introduced to increase backup spectrum sharing by reserving backup spectrum and employing protection with multiple backup paths. We propose a new polynomial-time strategy, Blocking Aware Survivable Path Provisioning (BASPP) that shares backup resources like SBPP and BSR-MPP but can reduce request blocking when opportunity of sharing resources does not exist. Since we address the offline problem of Survivable Routing, Modulation and Spectrum Allocation in EONs, we also propose an Integer Linear Program formulation. Results show appreciable reduction in bandwidth blocking ratio by using BASPP over existing strategies.Keywords: Elastic optical networksroutingmodulationspectrum allocationsurvivabilityblocking aware Disclosure statementNo potential conflict of interest was reported by the author(s).","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135195386","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}
Pub Date : 2023-09-25DOI: 10.1080/17445760.2023.2261192
Caixi Xue, Shuming Zhou, Hong Zhang, Qifan Zhang
AbstractThe fault tolerability of the network is usually measured by the classical or generalized connectivity of the graph. For any subset S⊆V(G) with |S|≥2, a tree T is called an S-tree if S⊆V(T). Furthermore, any two S-tree T1 and T2 are internally disjoint if E(T1)∩E(T2)=∅ and V(T1)∩V(T2)=S. We denote by κG(S) the maximum number of pairwise internally disjoint S-trees in G. For an integer k≥2, the generalized k-connectivity of a graph G is defined as κk(G)=min{κG(S)|S⊆V(G) and |S|=k}. In this paper, we establish the generalized 4-connectivity of the Cayley graph CTn generated by complete graphs.Keywords: Fault tolerabilitygeneralized connectivityCayley graphscomplete graphs Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was partly supported by the National Natural Science Foundation of China (Nos. 61977016, 61572010, and 62277010), Natural Science Foundation of Fujian Province, China (Nos. 2020J01164, 2017J01738). This work was also partly supported by China Scholarship Council (CSC No. 202108350054).
{"title":"The generalized 4-connectivity of complete-transposition graphs","authors":"Caixi Xue, Shuming Zhou, Hong Zhang, Qifan Zhang","doi":"10.1080/17445760.2023.2261192","DOIUrl":"https://doi.org/10.1080/17445760.2023.2261192","url":null,"abstract":"AbstractThe fault tolerability of the network is usually measured by the classical or generalized connectivity of the graph. For any subset S⊆V(G) with |S|≥2, a tree T is called an S-tree if S⊆V(T). Furthermore, any two S-tree T1 and T2 are internally disjoint if E(T1)∩E(T2)=∅ and V(T1)∩V(T2)=S. We denote by κG(S) the maximum number of pairwise internally disjoint S-trees in G. For an integer k≥2, the generalized k-connectivity of a graph G is defined as κk(G)=min{κG(S)|S⊆V(G) and |S|=k}. In this paper, we establish the generalized 4-connectivity of the Cayley graph CTn generated by complete graphs.Keywords: Fault tolerabilitygeneralized connectivityCayley graphscomplete graphs Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was partly supported by the National Natural Science Foundation of China (Nos. 61977016, 61572010, and 62277010), Natural Science Foundation of Fujian Province, China (Nos. 2020J01164, 2017J01738). This work was also partly supported by China Scholarship Council (CSC No. 202108350054).","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135864485","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}
Pub Date : 2023-09-05DOI: 10.1080/17445760.2023.2234157
M. Margenstern
In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with five states under the relaxation of the assumption of rotation invariance for the rules. The result is different from that of a previous paper of the author with six states but with rotationally invariant rules. Here, the structures is more constrained than in the quoted paper with six states and rotation invariance of the rules.
{"title":"A strongly universal cellular automaton on the heptagrid with five states, but with not rotation invariance of the rules","authors":"M. Margenstern","doi":"10.1080/17445760.2023.2234157","DOIUrl":"https://doi.org/10.1080/17445760.2023.2234157","url":null,"abstract":"In this paper, we prove that there is a strongly universal cellular automaton on the heptagrid with five states under the relaxation of the assumption of rotation invariance for the rules. The result is different from that of a previous paper of the author with six states but with rotationally invariant rules. Here, the structures is more constrained than in the quoted paper with six states and rotation invariance of the rules.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45198789","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}
Pub Date : 2023-09-04DOI: 10.1080/17445760.2023.2253951
Xuemin Wu, Liqiong Xu
{"title":"Fault-tolerance of enhanced hypercubes with faulty subcubes","authors":"Xuemin Wu, Liqiong Xu","doi":"10.1080/17445760.2023.2253951","DOIUrl":"https://doi.org/10.1080/17445760.2023.2253951","url":null,"abstract":"","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"1 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41566992","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}
扫码关注我们
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号