首页 > 最新文献

International Journal of Parallel Emergent and Distributed Systems最新文献

英文 中文
A study on Diem and Aptos distributed ledger technology Diem和Aptos分布式账本技术研究
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-07-21 DOI: 10.1080/17445760.2023.2217486
G. A. Pierro, Giacomo Ibba, R. Tonelli
{"title":"A study on Diem and Aptos distributed ledger technology","authors":"G. A. Pierro, Giacomo Ibba, R. Tonelli","doi":"10.1080/17445760.2023.2217486","DOIUrl":"https://doi.org/10.1080/17445760.2023.2217486","url":null,"abstract":"","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43945520","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
Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle 在增广立方体网络中嵌入跨越不相交的环,每个环中有规定的顶点
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-07-17 DOI: 10.1080/17445760.2023.2231162
Weiyan Wu, Eminjan Sabir, Hongwei Qiao
One of the important issues in evaluating an interconnection network is to study the Hamiltonian cycle embedding problems. For a positive integer k, a graph G is said to be spanning k-cyclable if for k prescribed vertices , there exist k disjoint cycles such that the union of spans G, and each contains exactly one vertex of . According to the definition, the problem of finding hamiltonian cycle focuses on k = 1. The notion of spanning cyclability can be applied to the problem of identifying faulty processors and other related issues in interconnection networks. The n-dimensional augmented cube is an important node-symmetric variant of the n-dimensional hypercube . In this paper, we prove that with is spanning k-cyclable for .
评价互连网络的一个重要问题是研究哈密顿循环嵌入问题。对于一个正整数k,如果对于k个规定的顶点,存在k个不相交的环,使得并张成G,并且每个环恰好包含一个顶点,则图G是可张成k循环的。根据定义,寻找哈密顿循环的问题集中在k = 1。跨越可循环性的概念可以应用于互连网络中识别故障处理器和其他相关问题的问题。n维增广立方体是n维超立方体的一个重要的节点对称变体。在本文中,我们证明了对于。
{"title":"Embedding spanning disjoint cycles in augmented cube networks with prescribed vertices in each cycle","authors":"Weiyan Wu, Eminjan Sabir, Hongwei Qiao","doi":"10.1080/17445760.2023.2231162","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231162","url":null,"abstract":"One of the important issues in evaluating an interconnection network is to study the Hamiltonian cycle embedding problems. For a positive integer k, a graph G is said to be spanning k-cyclable if for k prescribed vertices , there exist k disjoint cycles such that the union of spans G, and each contains exactly one vertex of . According to the definition, the problem of finding hamiltonian cycle focuses on k = 1. The notion of spanning cyclability can be applied to the problem of identifying faulty processors and other related issues in interconnection networks. The n-dimensional augmented cube is an important node-symmetric variant of the n-dimensional hypercube . In this paper, we prove that with is spanning k-cyclable for .","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"342 - 361"},"PeriodicalIF":1.1,"publicationDate":"2023-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44136537","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
An adaptive approach for compression format based on bagging algorithm 一种基于装袋算法的自适应压缩格式方法
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-07-13 DOI: 10.1080/17445760.2023.2231291
Huanyu Cui, Qilong Han, Nianbin Wang, Ye Wang
ABSTRACT The traditional parallel Sparse matrix vector multiplication (SpMV) method has been optimized by an application-specific or compression format-specific. However, a single compression format cannot deal with all sparse matrix types effectively in practical applications. To solve this problem, an adaptive compression format based on Bagging ensemble learning algorithm is proposed in this paper. Experiments show that the adaptive compression format has higher prediction and computational performance on NVIDIA V100 and NVIDIA RTX 2080Ti. Compared with SpMV of the four compression formats, SpMV based on adaptive compression format reduces the execution time of 1.5×, 6.6×, 9× and 1.1×, respectively.
摘要传统的并行稀疏矩阵向量乘法(SpMV)方法通过特定应用或特定压缩格式进行了优化。然而,在实际应用中,单一的压缩格式不能有效地处理所有的稀疏矩阵类型。为了解决这一问题,本文提出了一种基于Bagging集成学习算法的自适应压缩格式。实验表明,该自适应压缩格式在NVIDIA V100和NVIDIA RTX 2080Ti上具有较高的预测性能和计算性能。与四种压缩格式的SpMV相比,基于自适应压缩格式的SpMV执行时间分别减少1.5倍、6.6倍、9倍和1.1倍。
{"title":"An adaptive approach for compression format based on bagging algorithm","authors":"Huanyu Cui, Qilong Han, Nianbin Wang, Ye Wang","doi":"10.1080/17445760.2023.2231291","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231291","url":null,"abstract":"ABSTRACT The traditional parallel Sparse matrix vector multiplication (SpMV) method has been optimized by an application-specific or compression format-specific. However, a single compression format cannot deal with all sparse matrix types effectively in practical applications. To solve this problem, an adaptive compression format based on Bagging ensemble learning algorithm is proposed in this paper. Experiments show that the adaptive compression format has higher prediction and computational performance on NVIDIA V100 and NVIDIA RTX 2080Ti. Compared with SpMV of the four compression formats, SpMV based on adaptive compression format reduces the execution time of 1.5×, 6.6×, 9× and 1.1×, respectively.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"401 - 423"},"PeriodicalIF":1.1,"publicationDate":"2023-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42747936","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
Block size, parallelism and predictive performance: finding the sweet spot in distributed learning 块大小、并行性和预测性能:在分布式学习中寻找最佳点
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-06-27 DOI: 10.1080/17445760.2023.2225854
Filipe Oliveira, Davide Carneiro, Miguel Guimarães, Óscar Oliveira, P. Novais
{"title":"Block size, parallelism and predictive performance: finding the sweet spot in distributed learning","authors":"Filipe Oliveira, Davide Carneiro, Miguel Guimarães, Óscar Oliveira, P. Novais","doi":"10.1080/17445760.2023.2225854","DOIUrl":"https://doi.org/10.1080/17445760.2023.2225854","url":null,"abstract":"","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46566985","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
Split consensus for object security 对象安全性的分歧共识
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-06-15 DOI: 10.1080/17445760.2023.2225217
L. Lopriore
We present a set of security mechanisms supporting a form of split consensus between subjects that grant permissions to exert rights to access objects, and subjects that hold these rights. Our solution is based on lock-key pairs. A key specifies a collection of access rights, and a category for each access right. For each category, a lock states whether an access right in that category is valid, or not. We illustrate a few examples of applications, including file security, a form of priority-based access control, access control lists, and capability lists supporting hierarchical object structures.
我们提出了一组安全机制,支持授予访问对象的权限的主体和拥有这些权限的主体之间的一种分裂共识形式。我们的解决方案基于锁钥匙对。键指定访问权限的集合,以及每个访问权限的类别。对于每个类别,锁都会声明该类别中的访问权限是否有效。我们举例说明了一些应用程序,包括文件安全性、一种基于优先级的访问控制形式、访问控制列表和支持分层对象结构的功能列表。
{"title":"Split consensus for object security","authors":"L. Lopriore","doi":"10.1080/17445760.2023.2225217","DOIUrl":"https://doi.org/10.1080/17445760.2023.2225217","url":null,"abstract":"We present a set of security mechanisms supporting a form of split consensus between subjects that grant permissions to exert rights to access objects, and subjects that hold these rights. Our solution is based on lock-key pairs. A key specifies a collection of access rights, and a category for each access right. For each category, a lock states whether an access right in that category is valid, or not. We illustrate a few examples of applications, including file security, a form of priority-based access control, access control lists, and capability lists supporting hierarchical object structures.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"327 - 341"},"PeriodicalIF":1.1,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47416821","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
Omega multistage interconnection network manages double-pattern traffic with a regulator and high-speed forwarding method Omega多级互联网络通过调节器和高速转发方法管理双模式流量
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-06-05 DOI: 10.1080/17445760.2023.2220142
E. Stergiou, D. Liarokapis, S. Margariti, Ilias Bombotsaris
This study proposes a flexible and effective solution for developing high-performance multistage interconnection networks to maximize the performance of parallel computer systems, cloud computing infrastructure, grids, etc. An omega-type multistage interconnection network, consisting of regulated switchboxes, is used as a testbed to handle flexible two-class load patterns. The wormhole routing method and a special forwarding technique controlled by a global regulator are adopted to alleviate internal ‘tree saturation’ caused by periodic hotspot traffic combined with uniform traffic. Simulation experiments prove that this concept reduces packet latency, and an additional layer inserted in the final stage further improves the network’s architecture. GRAPHICAL ABSTRACT
这项研究提出了一种灵活有效的解决方案,用于开发高性能多级互连网络,以最大限度地提高并行计算机系统、云计算基础设施、电网等的性能。由调节开关盒组成的ω型多级互连网络被用作处理灵活的两类负载模式的试验台。采用虫洞路由方法和由全局调节器控制的特殊转发技术来缓解周期性热点流量与均匀流量相结合导致的内部“树饱和”。仿真实验证明,这一概念降低了数据包延迟,并且在最后阶段插入的额外层进一步改进了网络的架构。图形摘要
{"title":"Omega multistage interconnection network manages double-pattern traffic with a regulator and high-speed forwarding method","authors":"E. Stergiou, D. Liarokapis, S. Margariti, Ilias Bombotsaris","doi":"10.1080/17445760.2023.2220142","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220142","url":null,"abstract":"This study proposes a flexible and effective solution for developing high-performance multistage interconnection networks to maximize the performance of parallel computer systems, cloud computing infrastructure, grids, etc. An omega-type multistage interconnection network, consisting of regulated switchboxes, is used as a testbed to handle flexible two-class load patterns. The wormhole routing method and a special forwarding technique controlled by a global regulator are adopted to alleviate internal ‘tree saturation’ caused by periodic hotspot traffic combined with uniform traffic. Simulation experiments prove that this concept reduces packet latency, and an additional layer inserted in the final stage further improves the network’s architecture. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"313 - 326"},"PeriodicalIF":1.1,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46489242","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
Monitoring edge-geodetic numbers of convex polytopes and four networks 凸多面体和四个网络的边大地测量数监测
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-06-05 DOI: 10.1080/17445760.2023.2220143
Ao Tan, Wen Li, Xiumin Wang, X. Li
Foucard, Krishna and Lekshmi introduced a new graph-theoretic concept in the area of network monitoring. Let G be a graph with vertex set , there exists a subset , if deleting any edge in G, one can find that there exist at least two vertices in S whose distance is changed, then we call S is a monitoring edge-geodetic set (MEG-set for short). The minimum size of the MEG-set of G is called the monitoring edge-geodetic number of G (meg(G) for short). In this paper, we study the monitoring edge-geodetic number of some well-known networks, including Ladder, butterfly, circulant and Benes networks and convex polytopes.
Foucard, Krishna和Lekshmi在网络监控领域引入了一个新的图论概念。设G是一个顶点集的图,存在一个子集,如果删除G中的任意一条边,可以发现S中至少存在两个距离发生变化的顶点,则称S为监控边测地集(简称meg集)。G的meg集的最小大小称为G的监测边测地线数(简称meg(G))。本文研究了梯形网、蝶形网、圆形网、贝内斯网和凸多面体网的监测边测地数。
{"title":"Monitoring edge-geodetic numbers of convex polytopes and four networks","authors":"Ao Tan, Wen Li, Xiumin Wang, X. Li","doi":"10.1080/17445760.2023.2220143","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220143","url":null,"abstract":"Foucard, Krishna and Lekshmi introduced a new graph-theoretic concept in the area of network monitoring. Let G be a graph with vertex set , there exists a subset , if deleting any edge in G, one can find that there exist at least two vertices in S whose distance is changed, then we call S is a monitoring edge-geodetic set (MEG-set for short). The minimum size of the MEG-set of G is called the monitoring edge-geodetic number of G (meg(G) for short). In this paper, we study the monitoring edge-geodetic number of some well-known networks, including Ladder, butterfly, circulant and Benes networks and convex polytopes.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"301 - 312"},"PeriodicalIF":1.1,"publicationDate":"2023-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46949791","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
Towards a DISSECT-CF extension for simulating function-as-a-service 模拟功能即服务的DISSECT-CF扩展
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-06-03 DOI: 10.1080/17445760.2023.2220141
D. Sallo, G. Kecskeméti
ABSTRACT Serverless computing is a new way of delivering cloud services that abstracts a user from the burden of managing resources and infrastructure. Although a few serverless simulators have been developed, they do not compare to services that are offered by commercial providers. Developing a comprehensive serverless simulation framework is essential towards evaluating scenarios reliant on the serverless paradigm. This paper focuses on introducing a serverless computing model to the DIScrete event baSed Energy Consumption simulaTor for Clouds and Federations (DISSECT-CF) simulator to enable simulating realistic function-as-a-service (FaaS) solutions. This new model is capable of imitating serverless providers in terms of cost model, associating triggers, extracting performance metrics, and customising the configurations of functions. GRAPHICAL ABSTRACT
摘要无服务器计算是一种提供云服务的新方式,它将用户从管理资源和基础设施的负担中抽象出来。尽管已经开发了一些无服务器模拟器,但它们无法与商业提供商提供的服务相比。开发一个全面的无服务器模拟框架对于评估依赖于无服务器范式的场景至关重要。本文重点介绍了一种无服务器计算模型到DIScrete事件baSed云和联邦能源消耗模拟器(DISSECT-CF)中,以模拟现实的功能即服务(FaaS)解决方案。这种新模型能够在成本模型、关联触发器、提取性能指标和自定义功能配置方面模仿无服务器提供商。图形摘要
{"title":"Towards a DISSECT-CF extension for simulating function-as-a-service","authors":"D. Sallo, G. Kecskeméti","doi":"10.1080/17445760.2023.2220141","DOIUrl":"https://doi.org/10.1080/17445760.2023.2220141","url":null,"abstract":"ABSTRACT Serverless computing is a new way of delivering cloud services that abstracts a user from the burden of managing resources and infrastructure. Although a few serverless simulators have been developed, they do not compare to services that are offered by commercial providers. Developing a comprehensive serverless simulation framework is essential towards evaluating scenarios reliant on the serverless paradigm. This paper focuses on introducing a serverless computing model to the DIScrete event baSed Energy Consumption simulaTor for Clouds and Federations (DISSECT-CF) simulator to enable simulating realistic function-as-a-service (FaaS) solutions. This new model is capable of imitating serverless providers in terms of cost model, associating triggers, extracting performance metrics, and customising the configurations of functions. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"288 - 300"},"PeriodicalIF":1.1,"publicationDate":"2023-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43694321","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
The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs 数据编码、解析可表达性和纠缠对hqnn可训练性的统一影响
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-05-08 DOI: 10.1080/17445760.2023.2231163
Muhammad Kashif, S. Al-Kuwari
Recent advances in quantum computing and machine learning have brought about a promising intersection of these two fields, leading to the emergence of quantum machine learning (QML). However, the integration of quantum computing and machine learning poses several challenges. One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). Recent studies have successfully identified the fundamental causes underlying the existence of BP in QNNs. This paper presents a framework designed to explore the interplay of multiple factors contributing to the BP problem in quantum neural networks (QNNs), which poses a critical challenge for the practical applications of QML. We focus on the combined influence of data encoding, qubit entanglement, and ansatz expressibility in hybrid quantum neural networks (HQNNs) for multi-class classification tasks. Our framework aims to empirically analyze the joint impact of these factors on the training landscape of HQNNs. Our results show that the occurrence of the BP problem in HQNNs is contingent upon the expressibility of the underlying ansatz and the type of the adopted data encoding technique. Additionally, we observe that qubit entanglement also plays a role in exacerbating the BP problem. Leveraging various evaluation metrics for classification tasks, we systematically evaluate the performance of HQNNs and provide recommendations tailored to different constraint scenarios. Our findings emphasize the significance of our framework in addressing the practical success of QNNs.
量子计算和机器学习的最新进展为这两个领域带来了一个有前途的交集,导致了量子机器学习(QML)的出现。然而,量子计算和机器学习的融合带来了一些挑战。其中一个突出的挑战在于QML算法中存在贫瘠高原(BP),特别是在量子神经网络(qnn)中。最近的研究已经成功地确定了BP在qnn中存在的根本原因。本文提出了一个框架,旨在探索导致量子神经网络(QNNs)中BP问题的多种因素的相互作用,这对QML的实际应用提出了关键挑战。研究了混合量子神经网络(HQNNs)中数据编码、量子比特纠缠和ansatz可表达性对多类分类任务的综合影响。我们的框架旨在实证分析这些因素对hqnn训练前景的共同影响。我们的研究结果表明,hqnn中BP问题的发生取决于底层分析的可表达性和采用的数据编码技术的类型。此外,我们观察到量子比特纠缠也在加剧BP问题中起作用。利用分类任务的各种评估指标,我们系统地评估了hqnn的性能,并针对不同的约束场景提供了量身定制的建议。我们的发现强调了我们的框架在解决qnn的实际成功方面的重要性。
{"title":"The unified effect of data encoding, ansatz expressibility and entanglement on the trainability of HQNNs","authors":"Muhammad Kashif, S. Al-Kuwari","doi":"10.1080/17445760.2023.2231163","DOIUrl":"https://doi.org/10.1080/17445760.2023.2231163","url":null,"abstract":"Recent advances in quantum computing and machine learning have brought about a promising intersection of these two fields, leading to the emergence of quantum machine learning (QML). However, the integration of quantum computing and machine learning poses several challenges. One of the prominent challenges lies in the presence of barren plateaus (BP) in QML algorithms, particularly in quantum neural networks (QNNs). Recent studies have successfully identified the fundamental causes underlying the existence of BP in QNNs. This paper presents a framework designed to explore the interplay of multiple factors contributing to the BP problem in quantum neural networks (QNNs), which poses a critical challenge for the practical applications of QML. We focus on the combined influence of data encoding, qubit entanglement, and ansatz expressibility in hybrid quantum neural networks (HQNNs) for multi-class classification tasks. Our framework aims to empirically analyze the joint impact of these factors on the training landscape of HQNNs. Our results show that the occurrence of the BP problem in HQNNs is contingent upon the expressibility of the underlying ansatz and the type of the adopted data encoding technique. Additionally, we observe that qubit entanglement also plays a role in exacerbating the BP problem. Leveraging various evaluation metrics for classification tasks, we systematically evaluate the performance of HQNNs and provide recommendations tailored to different constraint scenarios. Our findings emphasize the significance of our framework in addressing the practical success of QNNs.","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"362 - 400"},"PeriodicalIF":1.1,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42905256","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
Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures 实现拜占庭式故障的及时可证明可靠发送原语的最小同步性
IF 1.1 Q4 COMPUTER SCIENCE, THEORY & METHODS Pub Date : 2023-04-27 DOI: 10.1080/17445760.2023.2199992
Mohamed Ben Othmane, Abderrahim Siam, Moumen Hamouma
Broadcast abstractions are among the most important concepts in the field of fault tolerant distributed computing. These abstractions are used by consensus algorithms as a fundamental building block for ensuring that all correct processes in the system decide the same value. The Timely Provable Reliable Send primitive is among these broadcast abstractions with which we guarantee that messages are delivered correctly and in a timely manner, even in the presence of faulty processes. In this paper, we present an authenticated algorithm implementing provable reliable send primitive with very few eventually synchronous links. In other words, this algorithm assumes that there is a -sink in the system. A -sink is a correct process where the number of incoming eventually timely links that connecting it with correct processes is (including itself). We also show that a -sink is the minimal synchrony assumption for implementing this primitive in a Byzantine system where an authentication mechanism is available. GRAPHICAL ABSTRACT
广播抽象是容错分布式计算领域中最重要的概念之一。共识算法将这些抽象用作基本构建块,以确保系统中所有正确的过程都决定相同的值。Timely Provable Reliable Send原语是这些广播抽象中的一个,我们用它来保证消息以正确、及时的方式传递,即使在存在错误进程的情况下也是如此。在本文中,我们提出了一种认证算法,实现了具有极少数最终同步链路的可证明可靠发送原语。换句话说,该算法假设系统中存在一个-sink。接收器是一个正确的进程,其中传入的最终及时链接的数量是连接它和正确进程的数量(包括它自己)。我们还展示了在拜占庭系统中实现这个原语的最小同步性假设,其中有身份验证机制。图形摘要
{"title":"Minimal synchrony for implementing Timely Provable Reliable Send primitive with Byzantine failures","authors":"Mohamed Ben Othmane, Abderrahim Siam, Moumen Hamouma","doi":"10.1080/17445760.2023.2199992","DOIUrl":"https://doi.org/10.1080/17445760.2023.2199992","url":null,"abstract":"Broadcast abstractions are among the most important concepts in the field of fault tolerant distributed computing. These abstractions are used by consensus algorithms as a fundamental building block for ensuring that all correct processes in the system decide the same value. The Timely Provable Reliable Send primitive is among these broadcast abstractions with which we guarantee that messages are delivered correctly and in a timely manner, even in the presence of faulty processes. In this paper, we present an authenticated algorithm implementing provable reliable send primitive with very few eventually synchronous links. In other words, this algorithm assumes that there is a -sink in the system. A -sink is a correct process where the number of incoming eventually timely links that connecting it with correct processes is (including itself). We also show that a -sink is the minimal synchrony assumption for implementing this primitive in a Byzantine system where an authentication mechanism is available. GRAPHICAL ABSTRACT","PeriodicalId":45411,"journal":{"name":"International Journal of Parallel Emergent and Distributed Systems","volume":"38 1","pages":"280 - 287"},"PeriodicalIF":1.1,"publicationDate":"2023-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46790747","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
期刊
International Journal of Parallel Emergent and Distributed Systems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1