Concurrency and Computation-Practice & Experience最新文献_第2页

Mapping Health Pathways: A Network Analysis for Improved Illness Prediction 绘制健康路径图：改进疾病预测的网络分析

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-28 DOI: 10.1002/cpe.8301

Ankur Kumar Singhal, Anurag Singh

{"title":"Mapping Health Pathways: A Network Analysis for Improved Illness Prediction","authors":"Ankur Kumar Singhal, Anurag Singh","doi":"10.1002/cpe.8301","DOIUrl":"https://doi.org/10.1002/cpe.8301","url":null,"abstract":"<div>\u0000 \u0000 <p>Complex networks and network reconstruction have now become powerful tools for exploring relationships and interactions within systems across various fields to identify patterns and increase predictive accuracy. It provides a structured framework to investigate the relations or connections among individual components or entities within a system. Recently, the importance of the healthcare prediction model in life-saving efforts has increased. A model is proposed for health prediction that uses network reconstruction methods to build a network from available information, representing features as nodes and the relationships between them as edges. Subsequently, a method is introduced to calculate the value of the decision parameter (<span></span><math>\u0000 <semantics>\u0000 <mrow>\u0000 <mi>α</mi>\u0000 </mrow>\u0000 <annotation>$$ alpha $$</annotation>\u0000 </semantics></math>) for predicting an individual's health status. The proposed model shows substantial improvement over the current state of the prediction model. The first aim of the proposed model is to classify an individual into their appropriate class properly. Another contribution of the proposed model is to measure the factors that are responsible for classifying an individual into a class that shows its significance and impact over the existing state-of-the-art. It provides a new dimension to the prediction mode, emphasizing the importance of identifying critical features and their interdependencies for personalized health diagnostics.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737382","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

Weighted Centroid Amorphous Algorithm for Position Error Minimization in WSN

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-28 DOI: 10.1002/cpe.8308

Pujasuman Tripathy, P. M. Khilar

{"title":"Weighted Centroid Amorphous Algorithm for Position Error Minimization in WSN","authors":"Pujasuman Tripathy, P. M. Khilar","doi":"10.1002/cpe.8308","DOIUrl":"https://doi.org/10.1002/cpe.8308","url":null,"abstract":"<div>\u0000 \u0000 <p>Wireless Sensor Networks (WSNs) have numerous applications, one of which is localization. Localization is crucial for determining the position of unknown sensor nodes in the deployment environment. Localization techniques are broadly classified into two categories: range based and range-free. Range-free localization techniques are gaining popularity as they are easy to implement and do not require external hardware. In this proposed work, a hybrid localization algorithm named the Weighted Centroid Amorphous algorithm is proposed to reduce the position error in WSN. Instead of the conventional centroid algorithm, a weighted centroid algorithm is used. The weight in this work is considered as a function of the hop value and hop size estimated by the Amorphous algorithm. Ten nearest beacon nodes are considered to determine the coordinates of a single unknown node. The hop value and hop size of that unknown node are calculated from the 10 nearest beacon nodes, and by using the hop value and hop size, the weight is calculated. After the weight estimation, the weighted sum is calculated, and using the weighted sum, the coordinates of an unknown node are determined. Simulation results indicate that the proposed Weighted Centroid Amorphous method achieves superior accuracy, with rates of 90.41%, 89.57%, and 86.10% compared to the traditional Amorphous, improved Amorphous, and Ensemble approach, respectively.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869173","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

From GPU to CPU (and Beyond): Extending Hardware Support in GPUSPH Through a SYCL-Inspired Interface

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-28 DOI: 10.1002/cpe.8313

Giuseppe Bilotta

引用次数: 0

Toward a Dynamic Allocation Strategy for Deadline-Oriented Resource and Job Management in HPC Systems

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-26 DOI: 10.1002/cpe.8310

Barry Linnert, Cesar Augusto F. De Rose, Hans-Ulrich Heiss

{"title":"Toward a Dynamic Allocation Strategy for Deadline-Oriented Resource and Job Management in HPC Systems","authors":"Barry Linnert, Cesar Augusto F. De Rose, Hans-Ulrich Heiss","doi":"10.1002/cpe.8310","DOIUrl":"https://doi.org/10.1002/cpe.8310","url":null,"abstract":"<p>As high-performance computing (HPC) becomes a tool used in many different workflows, quality of service (QoS) becomes increasingly important. In many cases, this includes the reliable execution of an HPC job and the generation of the results by a certain deadline. The resource and job management system (RJMS) or simply RMS is responsible for receiving the job requests and executing the jobs with a deadline-oriented policy to support the workflows. In this article, we evaluate how well static resource management policies cope with deadline-constrained HPC jobs and explore two variations of a dynamic policy in this context. As the Hilbert curve-based approach used by the SLURM workload manager represents the state-of-the-art in production environments, it was selected as one of the static allocation strategies. The Manhattan median approach as a second allocation strategy was introduced as a research work that aims to minimize the communication overhead of the parallel programs by providing compact partitions more than the Hilbert curve approach. In contrast to the static partitions provided by the Hilbert curve approach and the Manhattan median approach, the leak approach focuses on supporting dynamic runtime behavior of the jobs and assigning nodes of the HPC system on demand at runtime. Since the contiguous leak version also relies on a compact set of nodes, the noncontiguous leak can provide additional nodes at a greater distance from the nodes already used by the job. Our preliminary results clearly show that a dynamic policy is needed to meet the requirements of a modern deadline-oriented RMS scenario.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8310","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869081","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

A Review on Network Covert Channel Construction and Attack Detection

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-26 DOI: 10.1002/cpe.8316

Mrinal Ashish Khadse, Dhananjay Manohar Dakhane

{"title":"A Review on Network Covert Channel Construction and Attack Detection","authors":"Mrinal Ashish Khadse, Dhananjay Manohar Dakhane","doi":"10.1002/cpe.8316","DOIUrl":"https://doi.org/10.1002/cpe.8316","url":null,"abstract":"<div>\u0000 \u0000 <p>A covert network channel is a communication channel in which the message is secretly transmitted to the recipient. Sometimes, covert network channels are vulnerable to multiple attacks. Therefore, the message must be properly secure. In most cases, the covert channel is used to ensure data protection and allow users to freely access the Internet. In this paper, several recent studies are reviewed on covert network channels and examine the existing works from 2015 to 2024. This review article also discusses the undetectability and reliability of different types of covert network channels. Furthermore, a detailed description of the covert network channel's ability to hide in containers is provided. Existing research on covert network channels explains a few techniques for detecting attacks in secret data communication. However, several machine learning and deep learning techniques have been discussed in this article. Additionally, this article describes the accuracy of detection through an overview of current technologies. In addition, various countermeasures to prevent attacks in covert channels are also discussed in detail. However, in this case, the bandwidth limitations, data set limitations, and covert channel capacity are clearly defined, which will help future researchers build covert network channels and detect attacks. Finally, this work considers the challenges faced by covert network channels and the future scope of application.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869101","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

Request Deadline Split and Interference-Aware Request Migration in Edge Cloud

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-24 DOI: 10.1002/cpe.8315

Jie Wang, Huiqun Yu, Guisheng Fan, Jiayin Zhang

{"title":"Request Deadline Split and Interference-Aware Request Migration in Edge Cloud","authors":"Jie Wang, Huiqun Yu, Guisheng Fan, Jiayin Zhang","doi":"10.1002/cpe.8315","DOIUrl":"https://doi.org/10.1002/cpe.8315","url":null,"abstract":"<div>\u0000 \u0000 <p>Edge computing extends computing resources from the data center to the edge of the network to better handle latency-sensitive tasks. However, with the rise of the Internet of Things, edge devices with limited processing capabilities face difficulties in executing requests with fluctuating request peaks. In order to meet the deadline constraints of latency-sensitive tasks, a feasible solution is to offload some latency-sensitive tasks to other nearby edge devices. This article studies the problem of request migration in edge computing systems and minimizes the request deadline violation rate based on actual online arrival patterns, performance interference phenomena, and deadline constraints. Since a request contains multiple services and request migration will lead to changes in server resource competition pressure, we split the problem into three sub-problems, dividing the request deadline to determine the maximum response time of the service, determining the performance of the service under different resource pressures and the request migration strategies. To this end, we propose two deadline splitting methods, a performance interference model under multi-resource pressure, and two heuristic request migration strategies. Since this article considers online edge scenarios, the number and type of requests are black boxes. We conduct simulation experiments and find that our method has only one-third the number of request violations of other methods.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869055","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

Discovering and Ranking Urban Social Clusters Out of Streaming Social Media Datasets

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-24 DOI: 10.1002/cpe.8314

Mete Celik, Ahmet Sakir Dokuz, Alper Ecemis, Emre Erdogmus

{"title":"Discovering and Ranking Urban Social Clusters Out of Streaming Social Media Datasets","authors":"Mete Celik, Ahmet Sakir Dokuz, Alper Ecemis, Emre Erdogmus","doi":"10.1002/cpe.8314","DOIUrl":"https://doi.org/10.1002/cpe.8314","url":null,"abstract":"<div>\u0000 \u0000 <p>Urban social media mining is the process of discovering urban patterns from spatio-temporal social media datasets. Urban social clusters are the clusters formed by the social media posts of users living in cities at a certain time and place. Discovering and identifying urban social clusters is of great importance for urban and regional planning, target audience identification, a better understanding of city dynamics and so forth. Discovering and ranking urban social clusters out of streaming social media datasets require efficient filtering approaches and mining algorithms. In the literature, there are several studies performed that address the discovery of the importance of urban clusters. Most of these studies take into account the spatial expansions over time and the changes in the numbers of elements within clusters when identifying the significance of urban clusters. However, in contrast to these studies, we have also considered cluster temporal formation stability, spatial density variation, and the impact of meta-information on urban social clusters. In this study, Temporal, Spatial, and Meta Important Urban Social Clusters Miner (TSMIUSC-Miner) algorithm is proposed. In the proposed algorithm, urban social clusters are discovered, and their importance relative to each other are compared and ranked. The temporal, spatial and meta importance scores of the clusters are calculated and then, the clusters that satisfy predefined score thresholds are discovered. The performance of the proposed TSMIUSC-Miner algorithm compared with that of a naive approach using real-life streaming Twitter/X dataset. The results showed that the proposed TSMIUSC-Miner algorithm outperforms the naive approach in terms of execution time.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142869057","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 Multiobjective Approach for E-Commerce Website Structure Optimization 电子商务网站结构优化的多目标方法

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-23 DOI: 10.1002/cpe.8302

Shina Panicker, T. V. Vijay Kumar, Divakar Yadav

{"title":"A Multiobjective Approach for E-Commerce Website Structure Optimization","authors":"Shina Panicker, T. V. Vijay Kumar, Divakar Yadav","doi":"10.1002/cpe.8302","DOIUrl":"https://doi.org/10.1002/cpe.8302","url":null,"abstract":"<div>\u0000 \u0000 <p>Complex websites comprise a variety of diverse web entities, which require constant restructuring resonating with the latest trends, shifting consumer expectations and market driven changes. Therefore, designing suitable models to optimally restructure such websites is of paramount importance and must take into consideration several factors about the web entities such as display size, download time, type, location in the page, sales likelihood, discounts, and the ongoing trend. A recent study has taken all these attributes into consideration and designed a model based on the Access Score, Interface Score, and Purchase Score. However, this model suffers from certain drawbacks such as it did not address the underlying cohesiveness between these attributes. Further, it provided a single optimal solution to the adaptive website structure optimization (<i>AWSO</i>) problem and relied on the a priori knowledge of weights. The basis of the new proposed model is that there can be more than one optimal solution to the <i>AWSO</i> problem in the real world. The novel tri-objective optimization model uses <i>NSGA-II</i> algorithm to simultaneously optimize the attributes and finds advantageous trade-off solutions without requiring a priori knowledge of weights. The proposed <i>MO-AWSO</i><sub><i>NSGA-II</i></sub> model is shown to outperform the existing model proving it better suited for the <i>AWSO</i> problem.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737369","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

Workflow Scheduling in Cloud–Fog Computing Environments: A Systematic Literature Review 云雾计算环境中的工作流调度：系统性文献综述

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-22 DOI: 10.1002/cpe.8304

Raouia Bouabdallah, Fairouz Fakhfakh

{"title":"Workflow Scheduling in Cloud–Fog Computing Environments: A Systematic Literature Review","authors":"Raouia Bouabdallah, Fairouz Fakhfakh","doi":"10.1002/cpe.8304","DOIUrl":"https://doi.org/10.1002/cpe.8304","url":null,"abstract":"<div>\u0000 \u0000 <p>The Internet of Things (IoT) facilitates the connectivity of billions of physical devices for exchanging information and enabling a wide range of applications. These applications can be presented in the form of dependent tasks, as outlined in a workflow. These workflows face limitations due to constraints in IoT sensors. To address these limitations, cloud computing has emerged to offer a large capacity of computing and storing with a great capability to adjust resources according to the need. However, cloud computing might not adequately meet the low-latency of IoT workflow requirements when scheduling a workflow composed of IoT tasks due to its centralized nature. Moreover, cloud computing is not ideal for delay-sensitive workflows and may increase communication costs. In response to these challenges, the use of fog computing as an extension to cloud computing scheme is recommended. Fog computing aims to process workflow tasks close to IoT devices. While fog computing offers various advantages, integrating these systems into workflow scheduling remains one of the most formidable challenges in distributed environments. Indeed, significant issues arise due to the timely execution and the resource limitations. In this survey paper, we present a Systematic Literature Review (SLR) on the current state of the art in this domain. We propose a taxonomy to compare and evaluate the existing studies on workflow scheduling approaches in cloud–fog computing environments. This taxonomy encompasses various criteria, including scheduling techniques, performance metrics, workflow dependencies, scheduling policies, and evaluation tools. We highlight certain recommendations for open issues which require more investigations. Our aim is to provide valuable insights for researchers and developers interested in understanding the contributions and challenges of current workflow scheduling approaches in cloud–fog computing environments.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737395","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

WSC: A Crowd-Powered Framework for Mapping Decomposable Complex-Task With Worker-Set WSC：众力驱动的可分解复杂任务与工人集映射框架

IF 1.5 4区计算机科学

Concurrency and Computation-Practice & Experience Pub Date : 2024-10-21 DOI: 10.1002/cpe.8305

Suneel Kumar, Sarvesh Pandey

{"title":"WSC: A Crowd-Powered Framework for Mapping Decomposable Complex-Task With Worker-Set","authors":"Suneel Kumar, Sarvesh Pandey","doi":"10.1002/cpe.8305","DOIUrl":"https://doi.org/10.1002/cpe.8305","url":null,"abstract":"<div>\u0000 \u0000 <p>The crowdsourcing platform serves as an intermediary managing the interaction between a requester who posts a decomposable task and a pool of workers who bid to solve it. Each worker intending to take up the task (partially or fully) decomposes it into multiple independent subtasks and submits it to the platform. Selection of a diverse set of workers (based on the bids received) to solve the decomposable task is challenging as it requires balancing factors like cost and quality while encouraging collaboration. We propose a Worker Set Computation (WSC) methodology to address these challenges by selecting a custom set of potential workers who can collaboratively complete the task with the optimal cost, in an efficient way. The aging technique is employed to dynamically update the weight of each worker, giving more weightage to the feedback received in the recent past. This, in turn, not only favors those workers who were rated well in the immediate past but also ensures that one odd feedback does not influence the overall rating heavily. We compare the performance of the proposed method against the state-of-the-art methods, considering the computational (and budget) requirements, as well as the aging-based worker rating.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"36 28","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142737394","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