Concurrency and Computation-Practice & Experience最新文献

{"title":"Attribute expansion relation extraction approach for smart engineering decision-making in edge environments","authors":"Mengmeng Cui,&nbsp;Yuan Zhang,&nbsp;Zhichen Hu,&nbsp;Nan Bi,&nbsp;Tao Du,&nbsp;Kangrong Luo,&nbsp;Juntong Liu","doi":"10.1002/cpe.8253","DOIUrl":"https://doi.org/10.1002/cpe.8253","url":null,"abstract":"<div>\u0000 \u0000 <p>In sedimentology, the integration of intelligent engineering decision-making with edge computing environments aims to furnish engineers and decision-makers with precise, real-time insights into sediment-related issues. This approach markedly reduces data transfer time and response latency by harnessing the computational power of edge computing, thereby bolstering the decision-making process. Concurrently, the establishment of a sediment knowledge graph serves as a pivotal conduit for disseminating sediment-related knowledge in the realm of intelligent engineering decision-making. Moreover, it facilitates a comprehensive exploration of the intricate evolutionary and transformative processes inherent in sediment materials. By unveiling the evolutionary trajectory of life on Earth, the sediment knowledge graph catalyzes a deeper understanding of our planet's history and dynamics. Relationship extraction, as a key step in knowledge graph construction, implements automatic extraction and establishment of associations between entities from a large amount of sedimentary literature data. However, sedimentological literature presents multi-source heterogeneous features, which leads to a weak representation of hidden relationships, thus decreasing the accuracy of relationship extraction. In this article, we propose an attribute-extended relation extraction approach (AERE), which is specifically designed for sedimentary relation extraction scenarios. First, context statements containing sediment entities are obtained from the literature. Then, a cohesive hierarchical clustering algorithm is used to extend the relationship attributes between sediments. Finally, mine the relationships between entities based on AERE. The experimental results show that the proposed model can effectively extract the hidden relations and exhibits strong robustness in dealing with redundant noise before and after sentences, which in turn improves the completeness of the relations between deposits. After the relationship extraction, a proprietary sediment knowledge graph is constructed with the extracted triads.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674342","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}

{"title":"ClusFC-IoT: A clustering-based approach for data reduction in fog-cloud-enabled IoT","authors":"Atefeh Hemmati,&nbsp;Amir Masoud Rahmani","doi":"10.1002/cpe.8284","DOIUrl":"https://doi.org/10.1002/cpe.8284","url":null,"abstract":"<div>\u0000 \u0000 <p>The Internet of Things (IoT) is an ever-expanding network technology that connects diverse objects and devices, generating vast amounts of heterogeneous data at the network edge. These vast volumes of data present significant challenges in data management, transmission, and storage. In fog-cloud-enabled IoT, where data are processed at the edge (fog) and in the cloud, efficient data reduction strategies become imperative. One such method is clustering, which groups similar data points together to reduce redundancy and facilitate more efficient data management. In this paper, we introduce ClusFC-IoT, a novel two-phase clustering-based approach designed to optimize the management of IoT-generated data. In the first phase, which is performed in the fog layer, we used the K-means clustering algorithm to group the received data from the IoT layer based on similarity. This initial clustering creates distinct clusters, with a central data point representing each cluster. Incoming data from the IoT side is assigned to these existing clusters if they have similar characteristics, which reduces data redundancy and transfers to the cloud layer. In a second phase performed in the cloud layer, we performed additional K-means clustering on the data obtained from the fog layer. In this secondary clustering phase, we stabilized the similarities between the clusters created in the fog layer further optimized the data display, and reduced the redundancy. To verify the effectiveness of ClusFC-IoT, we implemented it using four different IoT data sets in Python 3. The implementation results show a reduction in data transmission compared to other methods, which makes ClusFC-IoT very suitable for resource-constrained IoT environments.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674100","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}

{"title":"Multiscale spatial-temporal transformer with consistency representation learning for multivariate time series classification","authors":"Wei Wu,&nbsp;Feiyue Qiu,&nbsp;Liping Wang,&nbsp;Yanxiu Liu","doi":"10.1002/cpe.8234","DOIUrl":"https://doi.org/10.1002/cpe.8234","url":null,"abstract":"<div>\u0000 \u0000 <p>Multivariate time series classification holds significant importance in fields such as healthcare, energy management, and industrial manufacturing. Existing research focuses on capturing temporal changes or calculating time similarities to accomplish classification tasks. However, as the state of the system changes, capturing spatial-temporal consistency within multivariate time series is key to the ability of the model to classify accurately. This paper proposes the MSTformer model, specifically designed for multivariate time series classification tasks. Based on the Transformer architecture, this model uniquely focuses on multiscale information across both time and feature dimensions. The encoder, through a designed learnable multiscale attention mechanism, divides data into sequences of varying temporal scales to learn multiscale temporal features. The decoder, which receives the spatial view of the data, utilizes a dynamic scale attention mechanism to learn spatial-temporal consistency in a one-dimensional space. In addition, this paper proposes an adaptive aggregation mechanism to synchronize and combine the outputs of the encoder and decoder. It also introduces a multiscale 2D separable convolution designed to learn spatial-temporal consistency in two-dimensional space, enhancing the ability of the model to learn spatial-temporal consistency representation. Extensive experiments were conducted on 30 datasets, where the MSTformer outperformed other models with an average accuracy rate of 85.6%. Ablation studies further demonstrate the reliability and stability of MSTformer.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142674243","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}

{"title":"QoS prediction of cloud services by selective ensemble learning on prefilling-based matrix factorizations","authors":"Chengying Mao,&nbsp;Jifu Chen,&nbsp;Dave Towey,&nbsp;Zhuang Zhao,&nbsp;Linlin Wen","doi":"10.1002/cpe.8282","DOIUrl":"10.1002/cpe.8282","url":null,"abstract":"<div>\u0000 \u0000 <p>When selecting services from a cloud center to build applications, the quality of service (QoS) is an important nonfunctional attribute to be considered. However, in actual application scenarios, the QoS details for many services may not be available. This has led to a situation where prediction of the missing QoS records for services has become a key problem for service selection. This article presents a selective ensemble learning (SEL) framework for prefilling-based matrix factorization (PFMF) predictors. In each PFMF predictor, the improved collaborative filtering is defined by examining the stability of the QoS records when measuring the similarity of users (or services), and then used to prefill empty records in the initial QoS matrix. To ensure the diversity of the basic PFMF predictors, various prefilled QoS matrices are constructed for the matrix factorization. In this process, different reference weights are assigned to the original and the prefilled QoS records. Finally, particle swarm optimization is used to set the ensemble weights for the basic PFMF predictors. The proposed SEL on PFMF (SEL-PFMF) algorithm is validated on a public dataset, where its prediction performance outperforms the state-of-the-art algorithms, and also shows good stability.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142265702","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}

{"title":"Federated learning based multi-head attention framework for medical image classification","authors":"Naima Firdaus,&nbsp;Zahid Raza","doi":"10.1002/cpe.8280","DOIUrl":"10.1002/cpe.8280","url":null,"abstract":"<p>In this study, we propose a novel Federated Learning Based Multi-Head Attention (FBMA) framework for image classification problems considering the Independent and Identically Distributed (IID) and Non-Independent and Identically Distributed (Non-IID) medical data. The FBMA architecture integrates FL principles with the Multi-Head Attention mechanism, optimizing the model performance and ensuring privacy. Using Multi-Head Attention, the FBMA framework allows the model to selectively focus on important regions of the image for feature extraction, and using FL, FBMA leverages decentralized medical institutions to facilitate collaborative model training while maintaining data privacy. Through rigorous experimentation on medical image datasets: MedMNIST Dataset, MedicalMNIST Dataset, and LC25000 Dataset, each partitioned into Non-IID data distribution, the proposed FBMA framework exhibits high-performance metrics. The results highlight the efficacy of our proposed FBMA framework, indicating its potential for real-world applications where image classification demands both high accuracy and data privacy.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 27","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142265704","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}

{"title":"FRC-SGAN based anomaly event recognition for computer night vision in edge and cloud environment","authors":"Charles Prabu V,&nbsp;Pandiaraja Perumal","doi":"10.1002/cpe.8232","DOIUrl":"10.1002/cpe.8232","url":null,"abstract":"<div>\u0000 \u0000 <p>Anomaly event recognition and identification has a crucial part in several areas, particularly in night vision environments. Conventional techniques of event recognition are hugely based upon data extracted from certain images for classification purposes. This needs users to select suitable features to establish the feature depictions for actual images per definite situations. Manual feature selection is laborious as well as heuristic tasks and the features obtained in this manner generally have worse robustness. Here, a Faster Region-based Convolutional fused Social Generative Adversarial Network (FRC-SGAN) is designed for anomaly event recognition in a night vision environment. At the cloud, key frame extraction, pre-processing, feature extraction, human detection (HD) and anomalous event recognition are carried out. Initially, input video from the database is subjected to perform pre-processing. The visibility enhancement is utilized for pre-processing. Thereafter, features like ResNet features, texture features and statistical features are extracted. Then, HD is accomplished by DeepJoint segmentation with chord distance. Finally, anomalous detection is done by FRC-SGAN that is the incorporation of Fast Regional Convolutional Neural Network (FR-CNN) and Social Generative Adversarial Network (SGAN). In addition, FRC-SGAN acquired 90.8% of accuracy, 89.7% of precision, and 89.2% of recall.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142265708","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}

{"title":"Obstacle avoidance planning for industrial robots based on singular manifold splitting configuration space","authors":"Yibo Liu,&nbsp;Xuyan Zhang,&nbsp;Chaoqun Wu,&nbsp;Minghui Yang","doi":"10.1002/cpe.8245","DOIUrl":"10.1002/cpe.8245","url":null,"abstract":"<div>\u0000 \u0000 <p>Obstacle avoidance planning is the primary element in ensuring safe robot applications such as welding, assembly, and drilling. The states in the configuration space (C-space) provide the pose information of any part of the manipulator and are preferentially considered in motion planning. However, it is difficult to express the environmental information directly in the high dimensional C-space, limiting the application of C-space obstacle avoidance planning. This paper proposes a singular manifold splitting C-space method and designs a compatible obstacle avoidance strategy. The specific method is as follows: first, according to the specific structure of industrial robots, arm-wrist separation obstacle avoidance planning is proposed to fix the robot as a 3R manipulator to reduce the dimension of C-space. Next, the C-space is segmented according to the singular manifolds, and the unique domain is delineated to complete the streamlining of the volume of the C-space. Then, with the help of the point cloud, the obstacles are enveloped and mapped to the unique domain to construct the pseudo-obstacle map. Industrial robots' obstacle avoidance planning is completed based on the pseudo-obstacle map combined with an improved Rapidly-Exploring Random Trees (RRT) algorithm. This method dramatically improves the efficiency of obstacle avoidance planning in the C-space and avoids the effect of singularities on industrial robots. Finally, the effectiveness of the method is verified by physical experiments.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196613","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}

{"title":"Inverse design of a novel multiport power divider based on hybrid neural network","authors":"Siyue Sun,&nbsp;Ma Zhu,&nbsp;Baojun Qi,&nbsp;Chen Liu","doi":"10.1002/cpe.8276","DOIUrl":"10.1002/cpe.8276","url":null,"abstract":"<div>\u0000 \u0000 <p>In this study, we propose an inverse design approach based on a neural network for a novel multiport power divider (MP-PD) with complex geometry. The inverse design approach is obtaining geometry from the desired physical performance to address the challenge of conventional methods. We develop a hybrid neural network model for this inverse design. The backbone architecture incorporates a bidirectional long short-term memory module, a multihead self-attention module, and convolutional modules. This hybrid neural network is employed to capture the feature of physical performance and learn the relationship between the geometric structure of the proposed MP-PD and its corresponding physical performance. Consider the design of the power divider as an end-to-end methodology that directly maps design requirements to optimal geometric parameters. The neural network transfers the designed process into multiple-input-multiple-output. We adopt the network model to successfully predict 20 geometric parameters of MP-PDs for two distinct operating frequencies. The two operating frequencies are those utilized in real engineering applications, which are 3.5 GHz in the 5G band and 2.45 GHz in the trackside communication band. The predicted MP-PD improves the return loss and bandwidth by 8.05 dB and 0.25 GHz, respectively, over the desired performance. The experiments and comparisons demonstrate the effectiveness and accuracy of our inverse design approach. The efficiency and flexibility of design are also significantly improved by the hybrid neural network model.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196594","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}

{"title":"Applications of blockchain technology in privacy preserving and data security for real time (data) applications","authors":"Sushama A. Deshmukh,&nbsp;Smita Kasar","doi":"10.1002/cpe.8277","DOIUrl":"10.1002/cpe.8277","url":null,"abstract":"<div>\u0000 \u0000 <p>Blockchain (BC) technology has been incorporated into the infrastructure of different kinds of applications that require transparency, reliability, security, and traceability. However, the BC still has privacy issues because of the possibility of privacy leaks when using publicly accessible transaction information, even with the security features offered by BCs. Specifically, certain BCs are implementing security mechanisms to address data privacy to prevent privacy issues, facilitates attack-resistant digital data sharing and storage platforms. Hence, this proposed review aims to give a comprehensive overview of BC technology, to shed light on security issues related to BC, and to emphasize the privacy requirements for existing applications. Many proposed BC applications in asset distribution, data security, the financial industry, the Internet of Things, the healthcare sector, and AI have been explored in this article. It presents necessary background knowledge about BC and privacy strategies for obtaining these security features as part of the evaluation. This survey is expected to assist readers in acquiring a complete understanding of BC security and privacy in terms of approaches, ideas, attributes, and systems. Subsequently, the review presents the findings of different BC works, illustrating several efforts that tackled privacy and security issues. Further, the review offers a positive strategy for the previously described integration of BC for security applications, emphasizing its possible significant gaps and potential future development to promote BC research in the future.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196595","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}

{"title":"A self-stabilizing distributed algorithm for the 1-MIS problem under the distance-3 model","authors":"Hirotsugu Kakugawa,&nbsp;Sayaka Kamei,&nbsp;Masahiro Shibata,&nbsp;Fukuhito Ooshita","doi":"10.1002/cpe.8281","DOIUrl":"10.1002/cpe.8281","url":null,"abstract":"<div>\u0000 \u0000 <p>Fault-tolerance and self-organization are critical properties in modern distributed systems. Self-stabilization is a class of fault-tolerant distributed algorithms which has the ability to recover from any kind and any finite number of transient faults and topology changes. In this article, we propose a self-stabilizing distributed algorithm for the 1-MIS problem under the unfair central daemon assuming the distance-3 model. Here, in the distance-3 model, each process can refer to the values of local variables of processes within three hops. Intuitively speaking, the 1-MIS problem is a variant of the maximal independent set (MIS) problem with improved local optimizations. The time complexity (convergence time) of our algorithm is <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>O</mi>\u0000 <mo>(</mo>\u0000 <mi>n</mi>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation>$$ O(n) $$</annotation>\u0000 </semantics></math> steps and the space complexity is <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>O</mi>\u0000 <mo>(</mo>\u0000 <mi>log</mi>\u0000 <mi>n</mi>\u0000 <mo>)</mo>\u0000 </mrow>\u0000 <annotation>$$ Oleft(log nright) $$</annotation>\u0000 </semantics></math> bits, where <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>n</mi>\u0000 </mrow>\u0000 <annotation>$$ n $$</annotation>\u0000 </semantics></math> is the number of processes. Finally, we extend the notion of 1-MIS to <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>p</mi>\u0000 </mrow>\u0000 <annotation>$$ p $$</annotation>\u0000 </semantics></math>-MIS for each nonnegative integer <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>p</mi>\u0000 </mrow>\u0000 <annotation>$$ p $$</annotation>\u0000 </semantics></math>, and compare the set sizes of <span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>p</mi>\u0000 </mrow>\u0000 <annotation>$$ p $$</annotation>\u0000 </semantics></math>-MIS (<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>p</mi>\u0000 <mo>=</mo>\u0000 <mn>0</mn>\u0000 <mo>,</mo>\u0000 <mn>1</mn>\u0000 <mo>,</mo>\u0000 <mn>2</mn>\u0000 <mo>,</mo>\u0000 <mi>…</mi>\u0000 </mrow>\u0000 <annotation>$$ p=0,1,2,dots $$</annotation>\u0000 </semantics></math>) and the maximum independent set.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 26","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142196596","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}