首页 > 最新文献

Concurrency and Computation-Practice & Experience最新文献

英文 中文
Research on the Application of Improved BERT-DPCNN Model in Chinese News Text Classification
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-27 DOI: 10.1002/cpe.8338
Heda Wang, Shuyan Zhang

This paper introduces an enhanced BERT-DPCNN model for the task of Chinese news text classification. The model addresses the common challenge of balancing accuracy and computational efficiency in existing models, especially when dealing with large-scale, high-dimensional text data. To tackle this issue, the paper proposes an improved BERT-DPCNN model that integrates BERT's pre-trained language model with DPCNN's efficient convolutional structure to capture deep semantic information and key features from the text. Additionally, the paper incorporates the zebra optimization algorithm (ZOA) to dynamically optimize the model's hyperparameters, overcoming the limitations of manual tuning in traditional models. By automatically optimizing hyperparameters such as batch size, learning rate, and the number of filters through ZOA, the model's classification performance is significantly enhanced. Experimental results demonstrate that the improved ZOA-BERT-DPCNN model outperforms traditional methods on the THUCNEWS Chinese news dataset, not only verifying its effectiveness in news text classification tasks but also showcasing its potential to enhance classification performance.

{"title":"Research on the Application of Improved BERT-DPCNN Model in Chinese News Text Classification","authors":"Heda Wang,&nbsp;Shuyan Zhang","doi":"10.1002/cpe.8338","DOIUrl":"https://doi.org/10.1002/cpe.8338","url":null,"abstract":"<div>\u0000 \u0000 <p>This paper introduces an enhanced BERT-DPCNN model for the task of Chinese news text classification. The model addresses the common challenge of balancing accuracy and computational efficiency in existing models, especially when dealing with large-scale, high-dimensional text data. To tackle this issue, the paper proposes an improved BERT-DPCNN model that integrates BERT's pre-trained language model with DPCNN's efficient convolutional structure to capture deep semantic information and key features from the text. Additionally, the paper incorporates the zebra optimization algorithm (ZOA) to dynamically optimize the model's hyperparameters, overcoming the limitations of manual tuning in traditional models. By automatically optimizing hyperparameters such as batch size, learning rate, and the number of filters through ZOA, the model's classification performance is significantly enhanced. Experimental results demonstrate that the improved ZOA-BERT-DPCNN model outperforms traditional methods on the THUCNEWS Chinese news dataset, not only verifying its effectiveness in news text classification tasks but also showcasing its potential to enhance classification performance.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120162","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reliability Assessment of Multiprocessor System Based on Exchanged Crossed Cube Networks
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-26 DOI: 10.1002/cpe.8325
Xuanli Liu, Weibei Fan, Jing He, Zhijie Han, Chi-Hung Chi

With the increasingly widespread application of multiprocessor systems, some processors in multiprocessor systems are inevitably prone to malfunctions. The reliability and effectiveness of the system are key issues. As a standard for measuring system fault tolerance, connectivity, and edge connectivity have many drawbacks. Therefore, Haray proposed conditional connectivity by restricting the connected components in disconnected subgraphs GF$$ G-F $$ to satisfy certain properties, where G$$ G $$ and F$$ F $$ represent the interconnection network and its set of faulty vertices, respectively. Restricted connectivity is a special type of conditional connectivity. Exchanged crossed cube, as a deformation of hypercube, has more favorable properties, such as smaller diameter, smaller link size, and lower cost. We prove that the 2-restricted connectivity of the exchanged crossed cubes ECQ(s,t)$$ mathrm{ECQ}left(s,tright) $$ is 4s4$$ 4s-4 $$ for 2st$$ 2le sle t $$.

{"title":"Reliability Assessment of Multiprocessor System Based on Exchanged Crossed Cube Networks","authors":"Xuanli Liu,&nbsp;Weibei Fan,&nbsp;Jing He,&nbsp;Zhijie Han,&nbsp;Chi-Hung Chi","doi":"10.1002/cpe.8325","DOIUrl":"https://doi.org/10.1002/cpe.8325","url":null,"abstract":"<div>\u0000 \u0000 <p>With the increasingly widespread application of multiprocessor systems, some processors in multiprocessor systems are inevitably prone to malfunctions. The reliability and effectiveness of the system are key issues. As a standard for measuring system fault tolerance, connectivity, and edge connectivity have many drawbacks. Therefore, Haray proposed conditional connectivity by restricting the connected components in disconnected subgraphs <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 <mo>−</mo>\u0000 <mi>F</mi>\u0000 </mrow>\u0000 <annotation>$$ G-F $$</annotation>\u0000 </semantics></math> to satisfy certain properties, where <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>G</mi>\u0000 </mrow>\u0000 <annotation>$$ G $$</annotation>\u0000 </semantics></math> and <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>F</mi>\u0000 </mrow>\u0000 <annotation>$$ F $$</annotation>\u0000 </semantics></math> represent the interconnection network and its set of faulty vertices, respectively. Restricted connectivity is a special type of conditional connectivity. Exchanged crossed cube, as a deformation of hypercube, has more favorable properties, such as smaller diameter, smaller link size, and lower cost. We prove that the 2-restricted connectivity of the exchanged crossed cubes <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mtext>ECQ</mtext>\u0000 <mo>(</mo>\u0000 <mi>s</mi>\u0000 <mo>,</mo>\u0000 <mi>t</mi>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation>$$ mathrm{ECQ}left(s,tright) $$</annotation>\u0000 </semantics></math> is <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>4</mn>\u0000 <mi>s</mi>\u0000 <mo>−</mo>\u0000 <mn>4</mn>\u0000 </mrow>\u0000 <annotation>$$ 4s-4 $$</annotation>\u0000 </semantics></math> for <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>2</mn>\u0000 <mo>≤</mo>\u0000 <mi>s</mi>\u0000 <mo>≤</mo>\u0000 <mi>t</mi>\u0000 </mrow>\u0000 <annotation>$$ 2le sle t $$</annotation>\u0000 </semantics></math>.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143119789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
REHAS: Robust and Efficient Hyperelliptic Curve-Based Authentication Scheme for Internet of Drones
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-26 DOI: 10.1002/cpe.8333
Bhanu Pratap, Ayush Singh, Pawan Singh Mehra

Internet of Drones (IoD) is one of the most beneficial and has many versatile applications like Surveillance and Security, Delivery and Logistics, Environmental Monitoring, Agriculture, and so forth. The IoD network is crucial for collecting sensitive data like geo-coordinates, vehicle traffic data, and property details while surveying the various deployment locations in smart cities. The communication between users and drones can be compromised over insecure wireless channels by multiple attacks such as Man-in-the-middle-attack, Denial of Service, and so forth. Many schemes have already been propounded in the field of IoD. Still, many of them cannot address the resource constraints problem of drones, and existing protocols have higher computation and communication costs. Therefore, this paper has proposed a robust and efficient Hyper-Elliptic Curve-based authentication scheme (REHAS), which provides a session key for secure communication. Artificial Identities are generated using a hash function and random numbers. Fuzzy Extractor is used for user biometric authentication, which makes the smart device secure when lost. HECC is used with a smaller bit size of 80 bits rather than ECC of 160 bits. The security of the REHAS has been ensured using Scyther simulation. Furthermore, the resilience, safety, and robustness of REHAS are ensured by Informal security analysis. Lastly, a comparative study of the REHAS has been performed with other related Authentication and key agreement (AKA) protocols regarding communication cost, Computation cost, and security features, demonstrating that REHAS incurred less computation cost (6.7171 ms), communication overhead (1696 bits), and energy consumption (22.5 mJ) than other existing AKA schemes.

{"title":"REHAS: Robust and Efficient Hyperelliptic Curve-Based Authentication Scheme for Internet of Drones","authors":"Bhanu Pratap,&nbsp;Ayush Singh,&nbsp;Pawan Singh Mehra","doi":"10.1002/cpe.8333","DOIUrl":"https://doi.org/10.1002/cpe.8333","url":null,"abstract":"<div>\u0000 \u0000 <p>Internet of Drones (IoD) is one of the most beneficial and has many versatile applications like Surveillance and Security, Delivery and Logistics, Environmental Monitoring, Agriculture, and so forth. The IoD network is crucial for collecting sensitive data like geo-coordinates, vehicle traffic data, and property details while surveying the various deployment locations in smart cities. The communication between users and drones can be compromised over insecure wireless channels by multiple attacks such as Man-in-the-middle-attack, Denial of Service, and so forth. Many schemes have already been propounded in the field of IoD. Still, many of them cannot address the resource constraints problem of drones, and existing protocols have higher computation and communication costs. Therefore, this paper has proposed a robust and efficient Hyper-Elliptic Curve-based authentication scheme (REHAS), which provides a session key for secure communication. Artificial Identities are generated using a hash function and random numbers. Fuzzy Extractor is used for user biometric authentication, which makes the smart device secure when lost. HECC is used with a smaller bit size of 80 bits rather than ECC of 160 bits. The security of the REHAS has been ensured using Scyther simulation. Furthermore, the resilience, safety, and robustness of REHAS are ensured by Informal security analysis. Lastly, a comparative study of the REHAS has been performed with other related Authentication and key agreement (AKA) protocols regarding communication cost, Computation cost, and security features, demonstrating that REHAS incurred less computation cost (6.7171 ms), communication overhead (1696 bits), and energy consumption (22.5 mJ) than other existing AKA schemes.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143119790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
AI Based Resource Management for 5G Network Slicing: History, Use Cases, and Research Directions
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-20 DOI: 10.1002/cpe.8327
Monika Dubey, Ashutosh Kumar Singh, Richa Mishra

5G, 6G, and beyond networks promise to support vertical industrial services with strict QoS parameters, but the hardware-based "one-size-fits-all" model of legacy networks lacks the flexibility needed for diverse services. The foundation of 5G networks lies in softwarization, with network slicing, Software Defined Networking (SDN), and Network Function Virtualisation (NFV) serving as its core components. The network-slicing-based shared network environment necessitates an intelligent and flexible resource management approach. In this case, traditional approaches are no longer suitable for dealing with a dynamic network environment. With recent advancements, AI-based approaches have the potential to manage resources autonomously. This paradigm shift underscores the need for deep and extensive investigation. However, existing literature on this subject is fragmented and lacks a cohesive overview of network slicing. To address these gaps, our review paper aims to provide a comprehensive scope of network slicing in a unified manner. In this sequence at first, this paper presented a conceptual overview of network slicing and enabling technologies, including SDN, NFV, and edge computing. Secondly, this paper identifies the relevant phases of resource management and presents AI-based resource management for network traffic classification, admission, allocation, and scheduling. Finally, it also discusses the deployment of network slicing-enabled key use cases and their practical deployment, the research gap, and open research challenges. To the best of our knowledge, this is the first attempt to critically analyze and present a consolidated review of the state of the art in network slicing resource management modules and network slicing-enabled key industrial use cases. This paper aims to guide researchers in developing innovative solutions and assist network players in the practical deployment of network slices for industrial applications.

{"title":"AI Based Resource Management for 5G Network Slicing: History, Use Cases, and Research Directions","authors":"Monika Dubey,&nbsp;Ashutosh Kumar Singh,&nbsp;Richa Mishra","doi":"10.1002/cpe.8327","DOIUrl":"https://doi.org/10.1002/cpe.8327","url":null,"abstract":"<div>\u0000 \u0000 <p>5G, 6G, and beyond networks promise to support vertical industrial services with strict QoS parameters, but the hardware-based \"one-size-fits-all\" model of legacy networks lacks the flexibility needed for diverse services. The foundation of 5G networks lies in softwarization, with network slicing, Software Defined Networking (SDN), and Network Function Virtualisation (NFV) serving as its core components. The network-slicing-based shared network environment necessitates an intelligent and flexible resource management approach. In this case, traditional approaches are no longer suitable for dealing with a dynamic network environment. With recent advancements, AI-based approaches have the potential to manage resources autonomously. This paradigm shift underscores the need for deep and extensive investigation. However, existing literature on this subject is fragmented and lacks a cohesive overview of network slicing. To address these gaps, our review paper aims to provide a comprehensive scope of network slicing in a unified manner. In this sequence at first, this paper presented a conceptual overview of network slicing and enabling technologies, including SDN, NFV, and edge computing. Secondly, this paper identifies the relevant phases of resource management and presents AI-based resource management for network traffic classification, admission, allocation, and scheduling. Finally, it also discusses the deployment of network slicing-enabled key use cases and their practical deployment, the research gap, and open research challenges. To the best of our knowledge, this is the first attempt to critically analyze and present a consolidated review of the state of the art in network slicing resource management modules and network slicing-enabled key industrial use cases. This paper aims to guide researchers in developing innovative solutions and assist network players in the practical deployment of network slices for industrial applications.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143117455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Quantum-Inspired Source-Distributed Opportunistic Routing Protocol for Reliable Routing in Underwater Wireless Sensor Networks
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-19 DOI: 10.1002/cpe.8330
T. R. Chenthil, G. Balachandran, S. Ranjith, E. Sakthivel

Underwater Wireless Sensor Networks (UWSNs) play a pivotal role in various applications, ranging from environmental monitoring to disaster prevention, necessitating robust and efficient communication protocols tailored to the challenging underwater environment. This paper introduces the Quantum-Inspired Void-Based Source Distributed Opportunistic Routing Protocol (QIVSORP) to address the inherent limitations of classical routing protocols in UWSNs. Motivated by the unique challenges posed by underwater conditions, QIVSORP leverages principles from quantum mechanics to enhance routing efficiency. The protocol employs a source-distributed approach, utilizing quantum entanglement, superposition, and opportunistic routing strategies to enable adaptive and reliable data transmission in underwater scenarios. QIVSORP incorporates void-based forwarding, adaptive decision-making, and multipath routing to dynamically adjust routing decisions based on real-time network conditions. The protocol's source-informed decisions and opportunistic forwarding contribute to the adaptability and reliability of communication in dynamic underwater environments. QIVSORP achieves outstanding performance metrics: maintaining a Packet Delivery Ratio (PDR) of 98.9% with 50 nodes and 80% with 400 nodes, reducing end-to-end delays to 12 ms at 50 nodes, 15 ms at 100 nodes, and 52 ms at 600 nodes, and demonstrating energy efficiency ranging from 0.2 to 200 J per delivered packet across varying node densities. These results highlight the QIVSORP's capability to optimize communication in dynamic underwater environments effectively.

{"title":"A Quantum-Inspired Source-Distributed Opportunistic Routing Protocol for Reliable Routing in Underwater Wireless Sensor Networks","authors":"T. R. Chenthil,&nbsp;G. Balachandran,&nbsp;S. Ranjith,&nbsp;E. Sakthivel","doi":"10.1002/cpe.8330","DOIUrl":"https://doi.org/10.1002/cpe.8330","url":null,"abstract":"<div>\u0000 \u0000 <p>Underwater Wireless Sensor Networks (UWSNs) play a pivotal role in various applications, ranging from environmental monitoring to disaster prevention, necessitating robust and efficient communication protocols tailored to the challenging underwater environment. This paper introduces the Quantum-Inspired Void-Based Source Distributed Opportunistic Routing Protocol (QIVSORP) to address the inherent limitations of classical routing protocols in UWSNs. Motivated by the unique challenges posed by underwater conditions, QIVSORP leverages principles from quantum mechanics to enhance routing efficiency. The protocol employs a source-distributed approach, utilizing quantum entanglement, superposition, and opportunistic routing strategies to enable adaptive and reliable data transmission in underwater scenarios. QIVSORP incorporates void-based forwarding, adaptive decision-making, and multipath routing to dynamically adjust routing decisions based on real-time network conditions. The protocol's source-informed decisions and opportunistic forwarding contribute to the adaptability and reliability of communication in dynamic underwater environments. QIVSORP achieves outstanding performance metrics: maintaining a Packet Delivery Ratio (PDR) of 98.9% with 50 nodes and 80% with 400 nodes, reducing end-to-end delays to 12 ms at 50 nodes, 15 ms at 100 nodes, and 52 ms at 600 nodes, and demonstrating energy efficiency ranging from 0.2 to 200 J per delivered packet across varying node densities. These results highlight the QIVSORP's capability to optimize communication in dynamic underwater environments effectively.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143116663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GPU Acceleration of the Boys Function Evaluation in Computational Quantum Chemistry
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-19 DOI: 10.1002/cpe.8328
Satoki Tsuji, Yasuaki Ito, Koji Nakano, Akihiko Kasagi

The Boys function, a mathematical integral function, plays a pivotal role and is frequently evaluated in ab initio molecular orbital computations. The main contribution of this paper is to accelerate the bulk evaluation of the Boys function through the effective utilization of GPUs. The proposed GPU implementation addresses GPU-specific programming issues such as warp divergence and coalesced/stride access to global memory, and we employ the optimal numerical evaluation method from four methods based on input values to ensure efficient computation with sufficient accuracy. Moreover, to consider actual computation of molecular integrals, we have implemented and evaluated the proposed method in two scenarios: single evaluation, which computes a single value of the Boys function for a single input, and incremental evaluation, which computes multiple values of the Boys function incrementally. The execution time of the proposed GPU implementation was evaluated for both scenarios using an NVIDIA A100 Tensor Core GPU. As a result, the GPU-accelerated bulk evaluation has achieved a throughput of computing the values of the Boys function 17.7×109$$ 17.7times 1{0}^9 $$ times per second for the single evaluation and 97.7×109$$ 97.7times 1{0}^9 $$ times per second for the incremental evaluation, respectively. Our parallelized CPU and GPU implementation is available at https://github.com/sstsuji/Boys-function-GPU-library.

{"title":"GPU Acceleration of the Boys Function Evaluation in Computational Quantum Chemistry","authors":"Satoki Tsuji,&nbsp;Yasuaki Ito,&nbsp;Koji Nakano,&nbsp;Akihiko Kasagi","doi":"10.1002/cpe.8328","DOIUrl":"https://doi.org/10.1002/cpe.8328","url":null,"abstract":"<p>The Boys function, a mathematical integral function, plays a pivotal role and is frequently evaluated in ab initio molecular orbital computations. The main contribution of this paper is to accelerate the bulk evaluation of the Boys function through the effective utilization of GPUs. The proposed GPU implementation addresses GPU-specific programming issues such as warp divergence and coalesced/stride access to global memory, and we employ the optimal numerical evaluation method from four methods based on input values to ensure efficient computation with sufficient accuracy. Moreover, to consider actual computation of molecular integrals, we have implemented and evaluated the proposed method in two scenarios: single evaluation, which computes a single value of the Boys function for a single input, and incremental evaluation, which computes multiple values of the Boys function incrementally. The execution time of the proposed GPU implementation was evaluated for both scenarios using an NVIDIA A100 Tensor Core GPU. As a result, the GPU-accelerated bulk evaluation has achieved a throughput of computing the values of the Boys function <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>17</mn>\u0000 <mo>.</mo>\u0000 <mn>7</mn>\u0000 <mo>×</mo>\u0000 <mn>1</mn>\u0000 <msup>\u0000 <mrow>\u0000 <mn>0</mn>\u0000 </mrow>\u0000 <mrow>\u0000 <mn>9</mn>\u0000 </mrow>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ 17.7times 1{0}^9 $$</annotation>\u0000 </semantics></math> times per second for the single evaluation and <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mn>97</mn>\u0000 <mo>.</mo>\u0000 <mn>7</mn>\u0000 <mo>×</mo>\u0000 <mn>1</mn>\u0000 <msup>\u0000 <mrow>\u0000 <mn>0</mn>\u0000 </mrow>\u0000 <mrow>\u0000 <mn>9</mn>\u0000 </mrow>\u0000 </msup>\u0000 </mrow>\u0000 <annotation>$$ 97.7times 1{0}^9 $$</annotation>\u0000 </semantics></math> times per second for the incremental evaluation, respectively. Our parallelized CPU and GPU implementation is available at \u0000https://github.com/sstsuji/Boys-function-GPU-library.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8328","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143116662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cloud Elasticity of Microservices-Based Applications: A Survey
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-16 DOI: 10.1002/cpe.8329
Mohamed Hedi Fourati, Soumaya Marzouk, Mohamed Jmaiel

Elasticity is an essential treatment in Cloud environment employed in academic and industrial contexts. The main purpose of elasticity is to reduce the deployment cost while optimizing computing resources. Multiple studies were conducted to tackle classic applications using monolithic architecture deployed with virtual machines (VMs). However, with the spread of microservice pattern, recent studies have been investigating this new trend using containers. This paper classifies and discusses existing approaches dealing with cloud elasticity. It provides a novel taxonomy for elastic approaches while focusing on microservices-based solutions. We additionally specify the strength and the shortcomings of each class of works. As a conclusion, we report the challenges for microservices-based applications elasticity and provide requirements for future investigations.

{"title":"Cloud Elasticity of Microservices-Based Applications: A Survey","authors":"Mohamed Hedi Fourati,&nbsp;Soumaya Marzouk,&nbsp;Mohamed Jmaiel","doi":"10.1002/cpe.8329","DOIUrl":"https://doi.org/10.1002/cpe.8329","url":null,"abstract":"<div>\u0000 \u0000 <p>Elasticity is an essential treatment in Cloud environment employed in academic and industrial contexts. The main purpose of elasticity is to reduce the deployment cost while optimizing computing resources. Multiple studies were conducted to tackle classic applications using monolithic architecture deployed with virtual machines (VMs). However, with the spread of microservice pattern, recent studies have been investigating this new trend using containers. This paper classifies and discusses existing approaches dealing with cloud elasticity. It provides a novel taxonomy for elastic approaches while focusing on microservices-based solutions. We additionally specify the strength and the shortcomings of each class of works. As a conclusion, we report the challenges for microservices-based applications elasticity and provide requirements for future investigations.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143115949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis and Fuzzy Neural Networks-Based Inertia Coefficient Adjustment Strategy of Power Converters 基于模糊神经网络的变流器惯性系数调整策略分析
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-14 DOI: 10.1002/cpe.8311
Xing Dongfeng, Tian Mingxing

With the development of new energy generation technology and power electronic technology, power electronic equipment occupies an increasing proportion of the power system, and its control flexibility makes the power system complicated, bringing problems such as low inertia, low damping, high harmonics, low reliability, and weak anti-interference ability. Especially the influence of converter on inertia of power system, even causing excessive frequency fluctuations, leading to the collapse of the power system. In view of the inertia problem of converters, this article starts with the principle of converters and analyzes the inertia transmission characteristics of different types of converters in power systems by three types of control strategies. Based on the influence of the inertia parameters of converters on system frequency and power, a converter inertia target function is established, and a neural network adaptive adjustment strategy for converter inertia coefficient is proposed to achieve self-adaptive optimization of converter output power and system frequency. The corresponding converter model is established, and the simulation circuit and control model are built by Simulink to verify the inertia transfer characteristics. The simulation results show the correctness of the relevant theories and provide theoretical support for the inertia design of high-proportion power electronic systems.

随着新能源发电技术和电力电子技术的发展,电力电子设备在电力系统中所占的比例越来越大,其控制的灵活性使得电力系统变得复杂,带来了低惯量、低阻尼、高谐波、可靠性低、抗干扰能力弱等问题。尤其是变流器对电力系统惯性的影响,甚至造成频率波动过大,导致电力系统崩溃。针对变流器的惯性问题,本文从变流器的原理入手,通过三种控制策略分析了电力系统中不同类型变流器的惯性传输特性。基于变流器惯性参数对系统频率和功率的影响,建立了变流器惯性目标函数,并提出了变流器惯性系数的神经网络自适应调节策略,以实现变流器输出功率和系统频率的自适应优化。建立了相应的变流器模型,并通过 Simulink 建立了仿真电路和控制模型,验证了惯性传递特性。仿真结果表明了相关理论的正确性,为高比例电力电子系统的惯性设计提供了理论支持。
{"title":"Analysis and Fuzzy Neural Networks-Based Inertia Coefficient Adjustment Strategy of Power Converters","authors":"Xing Dongfeng,&nbsp;Tian Mingxing","doi":"10.1002/cpe.8311","DOIUrl":"https://doi.org/10.1002/cpe.8311","url":null,"abstract":"<div>\u0000 \u0000 <p>With the development of new energy generation technology and power electronic technology, power electronic equipment occupies an increasing proportion of the power system, and its control flexibility makes the power system complicated, bringing problems such as low inertia, low damping, high harmonics, low reliability, and weak anti-interference ability. Especially the influence of converter on inertia of power system, even causing excessive frequency fluctuations, leading to the collapse of the power system. In view of the inertia problem of converters, this article starts with the principle of converters and analyzes the inertia transmission characteristics of different types of converters in power systems by three types of control strategies. Based on the influence of the inertia parameters of converters on system frequency and power, a converter inertia target function is established, and a neural network adaptive adjustment strategy for converter inertia coefficient is proposed to achieve self-adaptive optimization of converter output power and system frequency. The corresponding converter model is established, and the simulation circuit and control model are built by Simulink to verify the inertia transfer characteristics. The simulation results show the correctness of the relevant theories and provide theoretical support for the inertia design of high-proportion power electronic systems.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868628","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improving the End-to-End Protection in E-Voting Using BVM—Blockchain-Based E-Voting Mechanism
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-13 DOI: 10.1002/cpe.8324
Sweta Gupta, Kamlesh Kumar Gupta, Piyush Kumar Shukla

Voting has always been a crucial topic of public attention for democratic reasons. The ease of use and low cost are the result of e-voting being frequently used for such important decision outcomes. However, the tremendous authority and intervening data in current e-voting systems make it risky and difficult to achieve correct equity and clarity in e-voting. So, by combining e-voting with blockchain technology, these issues can be resolved while providing reorganization and intervention-resistant characteristics. A voter's improper manipulation, frequent voting, or non-party voting, may also undermine fairness. A verifier is therefore required to check the e-voting mechanism in order to ensure its effectiveness and control the process equality and fairness. In this paper, a Blockchain-based e-Voting Mechanism (BVM) is developed for providing the end to end security and fairness for transparent voting. This mechanism also provides a zero-knowledge proof (ZP) based verifier to inspect the voting procedure against voter's mis-operations and uses a novel Improved Master-key Administration (IMA) based public key cryptography to attack prevention. The utilization of blockchain technology ensures transparency, anonymity, confidentiality, authentication, tamper resistance, and a high level of data integrity, making it a promising choice for modernizing and enhancing the electoral process. Also, the performance of BVM has been compared with similar voting mechanisms and analyzed based on time complexity, security analysis, performance factors like delay and throughput, and anti-attack examination.

{"title":"Improving the End-to-End Protection in E-Voting Using BVM—Blockchain-Based E-Voting Mechanism","authors":"Sweta Gupta,&nbsp;Kamlesh Kumar Gupta,&nbsp;Piyush Kumar Shukla","doi":"10.1002/cpe.8324","DOIUrl":"https://doi.org/10.1002/cpe.8324","url":null,"abstract":"<div>\u0000 \u0000 <p>Voting has always been a crucial topic of public attention for democratic reasons. The ease of use and low cost are the result of e-voting being frequently used for such important decision outcomes. However, the tremendous authority and intervening data in current e-voting systems make it risky and difficult to achieve correct equity and clarity in e-voting. So, by combining e-voting with blockchain technology, these issues can be resolved while providing reorganization and intervention-resistant characteristics. A voter's improper manipulation, frequent voting, or non-party voting, may also undermine fairness. A verifier is therefore required to check the e-voting mechanism in order to ensure its effectiveness and control the process equality and fairness. In this paper, a Blockchain-based e-Voting Mechanism (BVM) is developed for providing the end to end security and fairness for transparent voting. This mechanism also provides a zero-knowledge proof (ZP) based verifier to inspect the voting procedure against voter's mis-operations and uses a novel Improved Master-key Administration (IMA) based public key cryptography to attack prevention. The utilization of blockchain technology ensures transparency, anonymity, confidentiality, authentication, tamper resistance, and a high level of data integrity, making it a promising choice for modernizing and enhancing the electoral process. Also, the performance of BVM has been compared with similar voting mechanisms and analyzed based on time complexity, security analysis, performance factors like delay and throughput, and anti-attack examination.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
HRCUNet: Hierarchical Region Contrastive Learning for Segmentation of Breast Tumors in DCE-MRI HRCUNet:用于 DCE-MRI 中乳腺肿瘤分离的分层区域对比学习
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2024-11-12 DOI: 10.1002/cpe.8319
Jiezhou He, Zhiming Luo, Wei Peng, Songzhi Su, Xue Zhao, Guojun Zhang, Shaozi Li

Segmenting breast tumors from dynamic contrast-enhanced magnetic resonance images is a critical step in the early detection and diagnosis of breast cancer. However, this task becomes significantly more challenging due to the diverse shapes and sizes of tumors, which make it difficult to establish a unified perception field for modeling them. Moreover, tumor regions are often subtle or imperceptible during early detection, exacerbating the issue of extreme class imbalance. This imbalance can lead to biased training and challenge accurately segmenting tumor regions from the predominant normal tissues. To address these issues, we propose a hierarchical region contrastive learning approach for breast tumor segmentation. Our approach introduces a novel hierarchical region contrastive learning loss function that addresses the class imbalance problem. This loss function encourages the model to create a clear separation between feature embeddings by maximizing the inter-class margin and minimizing the intra-class distance across different levels of the feature space. In addition, we design a novel Attention-based 3D Multi-scale Feature Fusion Residual Module to explore more granular multi-scale representations to improve the feature learning ability of tumors. Extensive experiments on two breast DCE-MRI datasets demonstrate that the proposed algorithm is more competitive against several state-of-the-art approaches under different segmentation metrics.

从动态增强磁共振图像中分割乳腺肿瘤是早期发现和诊断乳腺癌的关键步骤。然而,由于肿瘤的形状和大小不同,很难建立统一的感知场来对其进行建模,因此这项任务变得更加具有挑战性。此外,在早期发现时,肿瘤区域往往是微妙的或难以察觉的,这加剧了极端类别不平衡的问题。这种不平衡会导致有偏差的训练和挑战准确分割肿瘤区域从主要的正常组织。为了解决这些问题,我们提出了一种分层区域对比学习方法用于乳腺肿瘤分割。我们的方法引入了一种新的分层区域对比学习损失函数来解决类不平衡问题。这个损失函数鼓励模型通过最大化类间边界和最小化跨不同级别特征空间的类内距离来创建特征嵌入之间的明确分离。此外,我们设计了一种新颖的基于注意力的三维多尺度特征融合残差模块,探索更细粒度的多尺度表征,以提高肿瘤的特征学习能力。在两个乳腺DCE-MRI数据集上的大量实验表明,该算法在不同的分割指标下比几种最先进的方法更具竞争力。
{"title":"HRCUNet: Hierarchical Region Contrastive Learning for Segmentation of Breast Tumors in DCE-MRI","authors":"Jiezhou He,&nbsp;Zhiming Luo,&nbsp;Wei Peng,&nbsp;Songzhi Su,&nbsp;Xue Zhao,&nbsp;Guojun Zhang,&nbsp;Shaozi Li","doi":"10.1002/cpe.8319","DOIUrl":"https://doi.org/10.1002/cpe.8319","url":null,"abstract":"<div>\u0000 \u0000 <p>Segmenting breast tumors from dynamic contrast-enhanced magnetic resonance images is a critical step in the early detection and diagnosis of breast cancer. However, this task becomes significantly more challenging due to the diverse shapes and sizes of tumors, which make it difficult to establish a unified perception field for modeling them. Moreover, tumor regions are often subtle or imperceptible during early detection, exacerbating the issue of extreme class imbalance. This imbalance can lead to biased training and challenge accurately segmenting tumor regions from the predominant normal tissues. To address these issues, we propose a hierarchical region contrastive learning approach for breast tumor segmentation. Our approach introduces a novel hierarchical region contrastive learning loss function that addresses the class imbalance problem. This loss function encourages the model to create a clear separation between feature embeddings by maximizing the inter-class margin and minimizing the intra-class distance across different levels of the feature space. In addition, we design a novel Attention-based 3D Multi-scale Feature Fusion Residual Module to explore more granular multi-scale representations to improve the feature learning ability of tumors. Extensive experiments on two breast DCE-MRI datasets demonstrate that the proposed algorithm is more competitive against several state-of-the-art approaches under different segmentation metrics.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142868390","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Concurrency and Computation-Practice & Experience
全部 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