{"title":"On the Use of Embedding Techniques for Modeling User Navigational Behavior in Intelligent Prefetching Strategies","authors":"Tolga Buyuktanir, Mehmet S. Aktas","doi":"10.1002/cpe.8356","DOIUrl":"https://doi.org/10.1002/cpe.8356","url":null,"abstract":"<div>\u0000 \u0000 <p>In today's data-intensive client-server systems, traditional caching methods often fail to meet the demands of modern applications, especially in mobile environments with unstable network conditions. This research addresses the challenge of improving data delivery by proposing an advanced prefetching framework that utilizes various embedding techniques. We explore how to model user navigation using graph-based, autoencoder-based, and sequence-to-sequence-based embedding methods and assess their impact on prefetching accuracy and efficiency. Our study shows that utilizing these embedding techniques with supervised learning models improves prefetching performance. We also present a software architecture that blends supervised and unsupervised learning approaches, along with user-specific and collective learning models, to create a robust prefetching mechanism. The contributions of this study include developing a scalable prefetching solution using machine learning/deep learning algorithms and providing an open-source prototype of the proposed architecture. This paper offers a significant improvement over previous research and provides valuable insights for enhancing the performance of data-intensive applications.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143115843","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":"Density Peak Clustering Algorithm Based on Shared Neighbors and Natural Neighbors and Analysis of Electricity Consumption Patterns","authors":"Qingpeng Li, Xinyue Hu, Jia Zhao, Hao Cao","doi":"10.1002/cpe.8387","DOIUrl":"https://doi.org/10.1002/cpe.8387","url":null,"abstract":"<div>\u0000 \u0000 <p>The Density Peaks Clustering (DPC) algorithm is well-known for its simplicity and efficiency in clustering data of arbitrary shapes. However, it faces challenges such as inconsistent local density definitions and sample assignment errors. This paper introduces the Shared Neighbors and Natural Neighbors Density Peaks Clustering (SN-DPC) algorithm to address these issues. SN-DPC redefines local density by incorporating weighted shared neighbors, which enhances the density contribution from distant samples and provides a better representation of the data distribution. It also establishes a new similarity measure between samples using shared and natural neighbors, which increases intra-cluster similarity and reduces assignment errors, thereby improving clustering performance. Compared with DPC-CE, IDPC-FA, DPCSA, FNDPC, and traditional DPC, SN-DPC demonstrated superior effectiveness on both synthetic and real datasets. When applied to the analysis of electricity consumption patterns, it more accurately identified load consumption patterns and usage habits.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143115492","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":"Application of Artificial Intelligence Advances in Athletics Industry: A Review","authors":"Tao Du, Nan Bi","doi":"10.1002/cpe.8372","DOIUrl":"https://doi.org/10.1002/cpe.8372","url":null,"abstract":"<div>\u0000 \u0000 <p>With the rapid development of Artificial Intelligence (AI) technology, the athletics field is undergoing profound changes. This transformation is reflected not only in the ways of training and competition but also in the overall enhancement of athletes' performance and the efficiency of event management. The introduction of AI has made data analysis feasible, enabling coaches and athletes to gain deeper insights and make more informed decisions. This paper reviews the current applications of AI in the athletics domain and its enhancement of athlete performance and competitive strategies, focusing on the practical applications of AI in event management, performance analysis, injury detection, and personalized training. Furthermore, AI systems support coaches in intelligent analysis by integrating historical data with real-time data, thereby improving the efficiency of tactical decision-making. However, despite the significant achievements in AI applications, a series of challenges remain, including the lack of high-quality datasets, insufficient model interpretability, and ethical and privacy issues. In light of these challenges, we also propose viewpoints on future development directions aimed at promoting the intelligent transformation of the athletics industry.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143115111","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":"Personalized Indicator Based Evolutionary Algorithm for Uncertain Constrained Many-Objective Optimization Problem With Interval Functions","authors":"Jie Wen, Qian Wang, Haozhe Dong, Zhihua Cui","doi":"10.1002/cpe.8317","DOIUrl":"https://doi.org/10.1002/cpe.8317","url":null,"abstract":"<div>\u0000 \u0000 <p>In practical engineering problems, uncertainties due to prediction errors and fluctuations in equipment efficiency often lead to constrained many-objective optimization problem with interval parameters (ICMaOPs). These problems pose significant challenges for evolutionary algorithms, particularly in balancing solution convergence, diversity, feasibility, and uncertainty. To address these challenges, a personalized indicator-based evolutionary algorithm (PI-ICMaOEA) specifically designed for ICMaOPs is proposed. The PI-ICMaOEA integrates a comprehensive quality indicator that encapsulates convergence, diversity, uncertainty, and feasibility factors, converting multiple objectives in high-dimensional search spaces into a single evaluative metric. Each factor's weight is personalized assigned based on individual performance, objective dimension, and the evolving conditions of the population. By prioritizing individuals with excellent indicator values for mating and environmental selection, PI-ICMaOEA effectively enhances selection pressure in high-dimensional spaces. Comparative simulations demonstrate that PI-ICMaOEA is highly competitive, offering a robust solution for balancing convergence, diversity, uncertainty, and feasibility in ICMaOPs.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114775","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}
Jintao Jiao, Lei Guo, Wensen Yu, Sheng Yang, Shaozi Li
{"title":"An Efficient Lattice-Based Heterogeneous Signcryption Scheme for VANETs","authors":"Jintao Jiao, Lei Guo, Wensen Yu, Sheng Yang, Shaozi Li","doi":"10.1002/cpe.8384","DOIUrl":"https://doi.org/10.1002/cpe.8384","url":null,"abstract":"<div>\u0000 \u0000 <p>Nowadays, vehicular ad-hoc networks (VANETs) offer increased convenience to drivers and enable intelligent traffic management. However, the public wireless transmission channel in VANETs brings challenges related to security vulnerabilities and privacy leakage, in addition, vehicles produced by different manufacturers may use different cryptosystems such as certificateless cryptosystems (CLCs) and identity-based cryptosystems (IBC). To address privacy leakage during cross-cryptosystem communication in VANETs, we propose a lattice-based heterogeneous signcryption scheme named LHS-C2I. The scheme facilitates secure multi-cryptosystem bidirectional communication as CLC-based vehicles to IBC-based vehicles and IBC-based vehicles to CLC-based vehicles. The confidentiality and authenticity of LHS-C2I help to prevent the users from privacy leakage during cross-cryptosystem communication and to authenticate the message integrity and the sender's identity legitimacy. The proposed scheme is proven to achieve Indistinguishability under Chosen Ciphertext Attack (IND-CCA2) and Existential Unforgeability against Adaptive Chosen Messages Attack (EUF-CMA) within the random oracle model. Performance analysis demonstrates that LHS-C2I outperforms existing schemes in terms of computational overhead, communication overhead, and overall security features. It is particularly well-suited for scenarios requiring secure communication across different cryptosystems in VANETs.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114774","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 Reliable and Secure Permissioned Blockchain-Assisted Data Transfer Mechanism in Healthcare-Based Cyber-Physical Systems","authors":"P. Vinayasree, A. Mallikarjuna Reddy","doi":"10.1002/cpe.8378","DOIUrl":"https://doi.org/10.1002/cpe.8378","url":null,"abstract":"<div>\u0000 \u0000 <p>Healthcare systems are highly sensitive to cyberattacks as these systems possess most of the sensitive information compared to other systems relying on internet facilities. Due to the stronger security merits and efficiency of blockchain, it is integrated with the healthcare sector to ensure reliable data transfer. However, to improve the reliability and efficiency of the integrated system, a permissioned blockchain-based security framework combining several techniques is proposed. To enable storing and validating blocks containing medical data on the blockchain, the miner is administered using the delegated proof of stake (DPoS) consensus protocol. This protocol is efficient in choosing the miner from the list of participants. Then, the blocks are created using recursive indexing with an Even–Rodeh (RI-ER) coding hashing scheme. This algorithm is an indexing scheme that is much more efficient than the normal hashing algorithms. The validation process is carried out by the miner using the hash values provided to the users. By using the kidney disease dataset from Kaggle, the performance of the proposed method is evaluated. The performance analysis proved the effectiveness of the proposed approach compared to other schemes.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114714","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":"Comparative Aerodynamic Analysis and Parallel Performance of 2D CFD Simulations of a VAWT Using Sliding Mesh Interface Method","authors":"Hüseyin Can Önel, Ali Ata Adam, Nilay Sezer Uzol","doi":"10.1002/cpe.8353","DOIUrl":"https://doi.org/10.1002/cpe.8353","url":null,"abstract":"<div>\u0000 \u0000 <p>With rapid advancements in computer hardware and numerical modeling methods, Computational Fluid Dynamics (CFD) has gained prominence in simulating complex flows. As parallel computation becomes an industry standard, the computational efficiency of simulations has become critical. The flow around a Vertical Axis Wind Turbine (VAWT), characterized by complex dynamics and challenging rotating geometry, serves as an intriguing case for CFD studies. This study employs the open-source CFD solvers SU2 and OpenFOAM to simulate the incompressible, unsteady, and turbulent flow around an H-type Darrieus VAWT in two dimensions. Spatial and temporal discretization parameters are examined to balance computational cost and accuracy, revealing notable effects on power predictions. Simulations conducted under identical conditions allow for a comparison of the predictions and parallel performances of SU2 and OpenFOAM across three distinct tip speed ratios (TSRs). The findings show that discretization parameters behave differently at various TSRs. While power predictions from SU2 and OpenFOAM generally align with experimental data and with each other, discrepancies arise at lower TSRs, with thrust predictions showing better consistency. Although OpenFOAM provides a faster solution across all parallel configurations, SU2 demonstrates superior parallel scalability, achieving higher speedup and efficiency.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 3","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143114713","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":"Correction to “A DSEL for High Throughput and Low Latency Software-Defined Radio on Multicore CPUs”","authors":"","doi":"10.1002/cpe.8354","DOIUrl":"https://doi.org/10.1002/cpe.8354","url":null,"abstract":"<p>A. Cassagne, R. Tajan, O. Aumage, C. Leroux, D. Barthou, and C. Jégo, “A DSEL for high throughput and low latency software-defined radio on multicore CPUs,” <i>Computation: Practice and Experience</i> 35, no. 23 (2023): e7820, https://doi.org/10.1002/cpe.7820.</p><p>The original title of the article is: “A DSEL for high throughput and low latency software-defined radio on multicore CPUs.”</p><p>“<b>StreamPU:</b>” has been added at the beginning of the original title like this: “StreamPU: A DSEL for high throughput and low latency software-defined radio on multicore CPUs.”</p><p>We apologize for this error.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.8354","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143112963","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}
Bin Zhang, Yuejuan Wei, Shuqui Zang, Qing Li, Yan Qiang
{"title":"An Echo Pressure Model Based on Mutil-Gaussian Beam Theory for Measuring the Liquid Level in Special Field","authors":"Bin Zhang, Yuejuan Wei, Shuqui Zang, Qing Li, Yan Qiang","doi":"10.1002/cpe.8335","DOIUrl":"https://doi.org/10.1002/cpe.8335","url":null,"abstract":"<div>\u0000 \u0000 <p>In aviation, petroleum and chemical industries and other special areas of production, since the liquid in containers mostly are flammable, explosive, volatile, and corrosive mixtures, the accurate measurement of the liquid level is essential to the real-time control and production process. In this study, an approximation algorithm based on echo pressure model for measuring the liquid level in special field is proposed in this paper. According to the model, a complete lateral incident ultrasonic measurement system is constructed for the inductive liquid level detection technology in special applications, an algorithm model of the echo pressure is established, which provides the determination of the liquid level relying on the characteristic curve of the echo pressure. The model in this study converts complex interaction problems of sound fields into the echo pressure calculation, which quickly determines performance parameters of sound fields, and a virtual reflection method is used to calculate the sound pressure of the receiving transducer in different states, which reduces computational complexity, finally, through the simulation and experiment, the algorithm is validated. The results are consistent with expectations, and the algorithm can be further applied in practice.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120397","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":"FPM-SSD: Fast Parallel Multi-Scale Smooth Signed Distance Surface Reconstruction","authors":"Mingxiu Tuo, Chenglei Jia, Siyu Jin, Shunli Zhang","doi":"10.1002/cpe.8360","DOIUrl":"https://doi.org/10.1002/cpe.8360","url":null,"abstract":"<div>\u0000 \u0000 <p>Smooth signed distance surface reconstruction remains a popular technique for generating watertight surfaces from discrete point clouds. However, it frequently encounters issues with geometric detail loss when reconstructing complicated models. In this paper, we introduce a novel reconstruction technique for multi-scale smooth signed distance surfaces based on Gaussian curvature. Initially, the point cloud data is fitted using the moving least squares to calculate the Gaussian curvature. After that, a curvature-adaptive octree is constructed based on the Gaussian curvature, which can dynamically adjust the local resolution. Geometric information can be captured more effectively, improving the accuracy of surface reconstruction. Finally, implicit functions are adopted to perform global fitting, and the zero-level set is obtained through the octree isosurface extraction algorithm. In solving the iterative linear system, multi-thread techniques are implemented for parallel computation to enhance the execution performance of the algorithm. Experimental results demonstrate that the curvature-adaptive octree based on Gaussian curvature, can effectively capture complex geometric details, and the algorithm accomplishes high-precision surface reconstruction at different scales. Furthermore, multi-thread technology enhances local and global computing performance, ensuring the algorithm's effectiveness in processing large-scale data.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"37 2","pages":""},"PeriodicalIF":1.5,"publicationDate":"2024-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143120400","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}