Concurrency and Computation: Practice and Experience最新文献_第5页

Block chain enabled auditing with optimal multi‐key homomorphic encryption technique for public cloud computing environment 区块链审计，公共云计算环境下最优的多密钥同态加密技术

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-09 DOI: 10.1002/cpe.7128

Venkata Naga Rani Bandaru, P. Visalakshi

{"title":"Block chain enabled auditing with optimal multi‐key homomorphic encryption technique for public cloud computing environment","authors":"Venkata Naga Rani Bandaru, P. Visalakshi","doi":"10.1002/cpe.7128","DOIUrl":"https://doi.org/10.1002/cpe.7128","url":null,"abstract":"Cloud storage is a significant cloud computing (CC) service which enables the client to save and retrieve the data at anytime and anywhere. Due to the increased demand and familiarity of the CC environment, different kinds of security threats and susceptibilities are raised. Data integrity and privacy are the major problems in CC environment where the data can be saved in distinct geographic regions. So, privacy preservation and data integrity become important factors of the user concern related to the CC environment. Several auditing protocols are majorly dependent upon the conventional public key infrastructure, which led to high computational complexity and it is unsuitable for the setting of multiple users. To resolve these issues, this study develops a new block chain enabled auditing with optimal multi‐key homomorphic encryption (BEA‐OMKHE) technique for public cloud environment. The proposed BEA‐OMKHE technique aims to assure data integrity, security, and auditing in public cloud storage. Besides, an OMKHE technique is derived to accomplish data integrating into the cloud environment by the design of end to end encryption system. A secure generation of keys and encryption processes are carried out by the use of MKHE technique; thereby the data becomes highly secure. In addition, the choice of keys is performed by the improved beetle antenna search optimization (IBAS) algorithm. Therefore, the proposed BEA‐OMKHE technique offers an efficient way of enhancing the data integrity in CC method. The performance validation of the BEA‐OMKHE technique takes place and the results are inspected under various aspects. The comparative result analysis ensured the betterment of the BEA‐OMKHE technique interms of different measures such as communication cost, encryption time, decryption time, computation cost, privacy preserving rate, and authentication accuracy.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"150 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87272427","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

F‐SWIR: Rumor Fick‐spreading model considering fusion information decay in social networks F - SWIR:考虑融合信息衰减的谣言传播模型

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-09 DOI: 10.1002/cpe.7166

Weimin Li, Dingmei Wei, Xiaokang Zhou, Shaohua Li, Qun Jin

{"title":"F‐SWIR: Rumor Fick‐spreading model considering fusion information decay in social networks","authors":"Weimin Li, Dingmei Wei, Xiaokang Zhou, Shaohua Li, Qun Jin","doi":"10.1002/cpe.7166","DOIUrl":"https://doi.org/10.1002/cpe.7166","url":null,"abstract":"The spread of rumors has a major negative impact on social stability. Traditional rumor spreading models are mostly based on infectious disease models and do not consider the influence of individual differences and the network structure on rumor spreading. In this paper, we propose a rumor Fick‐spreading model that integrates information decay in social networks. The dissemination of rumors in social networks is random and uncertain and is affected by the dissemination capabilities of individuals and the network environment. The rumor Fick‐transition coefficient and Fick‐transition gradient are defined to determine the influence of the individual transition capacity and the network environment on rumor propagation, respectively. The Fick‐state transition probability is used to describe the probability of change of an individual's state. Moreover, an information decay function is defined to characterize the self‐healing probability of individuals. According to the different roles and reactions of users during rumor dissemination, the user state and the rumor dissemination rules among users are refined, and the influence of the network structure on the rumor dissemination is ascertained. The experimental results demonstrate that the proposed model outperforms other rumor spread models.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"35 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73126309","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

A methodology for assessing computation/communication overlap of MPI nonblocking collectives 一种评估MPI非阻塞集体计算/通信重叠的方法

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-05 DOI: 10.1002/cpe.7168

Alexandre Denis, Julien Jaeger, E. Jeannot, Florian Reynier

{"title":"A methodology for assessing computation/communication overlap of MPI nonblocking collectives","authors":"Alexandre Denis, Julien Jaeger, E. Jeannot, Florian Reynier","doi":"10.1002/cpe.7168","DOIUrl":"https://doi.org/10.1002/cpe.7168","url":null,"abstract":"By allowing computation/communication overlap, MPI nonblocking collectives (NBC) are supposed to improve application scalability and performance. However, it is known that to actually get overlap, the MPI library has to implement progression mechanisms in software or rely on the network hardware. These mechanisms may be present or not, adequate or perfectible, they may have an impact on communication performance or may interfere with computation by stealing CPU cycles. From a user point of view, assessing and understanding the behavior of an MPI library concerning computation/communication overlap is difficult. In this article, we propose a methodology to assess the computation/communication overlap of NBC. We propose new metrics to measure how much communication and computation do overlap, and to evaluate how they interfere with each other. We integrate these metrics into a complete methodology. We compare our methodology with state of the art metrics and benchmarks, and show that ours provides more meaningful informations. We perform experiments on a large panel of MPI implementations and network hardware and show when and why overlap is efficient, nonexistent or even degrades performance.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"39 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89351200","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

Niyama: Node scheduling for cloud workloads with resource isolation Niyama:具有资源隔离的云工作负载的节点调度

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-05 DOI: 10.1002/cpe.7196

Meghana Thiyyakat, Subramaniam Kalambur, D. Sitaram

{"title":"Niyama: Node scheduling for cloud workloads with resource isolation","authors":"Meghana Thiyyakat, Subramaniam Kalambur, D. Sitaram","doi":"10.1002/cpe.7196","DOIUrl":"https://doi.org/10.1002/cpe.7196","url":null,"abstract":"Cloud providers place tasks from multiple applications on the same resource pool to improve the resource utilization of the infrastructure. The consequent resource contention has an undesirable effect on latency‐sensitive tasks. In this article, we present Niyama—a resource isolation approach that uses a modified version of deadline scheduling to protect latency‐sensitive tasks from CPU bandwidth contention. Conventionally, deadline scheduling has been used to schedule real‐time tasks with well‐defined deadlines. Therefore, it cannot be used directly when the deadlines are unspecified. In Niyama, we estimate deadlines in intervals and secure bandwidth required for the interval, thereby ensuring optimal job response times. We compare our approach with cgroups: Linux's default resource isolation mechanism used in containers today. Our experiments show that Niyama reduces the average delay in tasks by 3 ×$$ times $$ –20 ×$$ times $$ when compared to cgroups. Since Linux's deadline scheduling policy is work‐conserving in nature, there is a small drop in the server‐level CPU utilization when Niyama is used naively. We demonstrate how the use of core reservation and oversubscription in the inter‐node scheduler can be used to offset this drop; our experiments show a 1.3 ×$$ times $$ –2.24 ×$$ times $$ decrease in delay in job response time over cgroups while achieving high CPU utilization.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"90 8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87728387","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

An efficient enhanced prefix hash tree model for optimizing the storage and image deduplication in cloud 一种高效的增强前缀哈希树模型，用于优化云存储和图像重复数据删除

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-05 DOI: 10.1002/cpe.7199

G. Sujatha, R. Raj

引用次数: 0

Research on the application of artificial intelligence in computer network technology in the era of big data 大数据时代人工智能在计算机网络技术中的应用研究

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-04 DOI: 10.1002/cpe.7262

Zhenyu Xu

引用次数: 4

FogiRecruiter: A fog‐enabled selection mechanism of crowdsourcing for disaster management FogiRecruiter:灾难管理众包的雾启用选择机制

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-03 DOI: 10.1002/cpe.7207

Riya Samanta, S. Ghosh

引用次数: 1

Detection and localization of image tampering in digital images with fused features 融合特征数字图像篡改检测与定位

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-03 DOI: 10.1002/cpe.7191

Mohassin Ahmad, F. Khursheed

{"title":"Detection and localization of image tampering in digital images with fused features","authors":"Mohassin Ahmad, F. Khursheed","doi":"10.1002/cpe.7191","DOIUrl":"https://doi.org/10.1002/cpe.7191","url":null,"abstract":"In digital forensics, image tamper detection and localization have attracted increased attention in recent days, where the standard methods have limited description ability and high computational costs. As a result, this research introduces a novel picture tamper detection and localization model. Feature extraction, tamper detection, as well as tamper localization are the three major phases of the proposed model. From the input digital images, a group of features like “Scale‐based Adaptive Speeded Up Robust Features (SA‐SURF), Discrete Wavelet Transform (DWT) based Patched Local Vector Pattern (LVP) features, HoG feature with harmonic mean based PCA and MBFDF” are extracted. Then, with this extracted feature strain the “optimized Convolutional Neural Network (CNN)” will be trained in the tamper detection phase. Since it is the key decision‐maker about the presence/absence of tamper, its weighting parameters are fine‐tuned via a novel improved Sea‐lion Customized Firefly algorithm (ISCFF) model. This ensures the enhancement of detection accuracy. Once an image is recognized to have tampers, then it is essential to identify the tamper localization. In the tamper localization phase, the copy‐move tampers are localized using the SIFT features, splicing tampers are localized using the DBN and the noise inconsistency is localized with a newly introduced threshold‐based tamper localization technique. The simulation outcomes illustrate that the adopted model attains better tamper detection as well as localization performance over the existing methods.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"24 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84515170","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Detection and categorization of acute intracranial hemorrhage subtypes using a multilayer DenseNet‐ResNet architecture with improved random forest classifier 基于多层DenseNet - ResNet结构和改进随机森林分类器的急性颅内出血亚型检测和分类

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-02 DOI: 10.1002/cpe.7167

B. M. Jenefer, K. Senathipathi, Aarthi, Annapandi

{"title":"Detection and categorization of acute intracranial hemorrhage subtypes using a multilayer DenseNet‐ResNet architecture with improved random forest classifier","authors":"B. M. Jenefer, K. Senathipathi, Aarthi, Annapandi","doi":"10.1002/cpe.7167","DOIUrl":"https://doi.org/10.1002/cpe.7167","url":null,"abstract":"In this article, the detection and categorization of acute intracranial hemorrhage (ICH) subtypes using a multilayer DenseNet‐ResNet architecture with improved random forest classifier (IRF) is proposed to detect the subtypes of intracerebral hemorrhage with high accuracy and less computational time. Here, the brain CT images are taken from the physionet repository publicly dataset. Then the images are preprocessed to eliminate the unwanted noises. After that, the image features are extracted by using multilayer densely connected convolutional network (DenseNet) combined with residual network (ResNet) architecture with multiple convolutional layers. The subtypes are epidural hemorrhage (EDH), subarachnoid hemorrhage (SAH), intraparenchymal hemorrhage (IPH), subdural hemorrhage (SDH), intraventricular hemorrhage (IVH) are classified by using an IRF classifier with high accuracy. The simulation process is carried out in MATLAB site. The proposed multilayer‐DenseNet‐ResNet‐IRF attains higher accuracy 23.44%, 31.93%, 42.83%, 41.9% is compared with the existing methods, such as deep learning algorithm for automatic detection and classification of acute intracranial hemorrhages in head CT scans (ICH‐DC‐2D‐CNN), fusion‐based deep learning along nature‐inspired algorithm for the diagnosis of intracerebral hemorrhage (ICH‐DC‐FSVM), and detection of intracranial hemorrhage on CT scan images using convolutional neural network (ICH‐DC‐CNN) and double fully convolutional networks (FCNs), respectively.","PeriodicalId":10584,"journal":{"name":"Concurrency and Computation: Practice and Experience","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-08-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82397746","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

Efficient privacy protection authentication protocol for vehicle network in 5G 5G车载网络高效隐私保护认证协议

Concurrency and Computation: Practice and Experience Pub Date : 2022-08-02 DOI: 10.1002/cpe.7247

Guixian Zhang, Xiaoyu Zhao, Menglu Chen, Shuyi Ma

引用次数: 3