首页 > 最新文献

Concurrency and Computation-Practice & Experience最新文献

英文 中文
Towards Workload-Tailored Optimization of Job Scheduling Policies in HPC Environments 面向高性能计算环境的作业调度策略优化
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-04 DOI: 10.1002/cpe.70532
João Pedro M. N. dos Santos, José Eduardo Henriques da Silva, Antônio Tadeu A. Gomes

Supercomputers play a pivotal role in advancing research and development across diverse scientific and engineering domains. However, configuring job scheduling in these systems to ensure maximum productivity and cost-effectiveness is a challenge. Workload simulation emerges as a crucial tool in this context, offering a mechanism to explore job scheduling configurations in the presence of expected user behaviors. In this paper, we focus on simulation-based optimization applied to tuning job scheduling configurations. We introduce a discrete-event simulator that utilizes two strategies to accommodate real workload traces under varying job scheduling policies: Job shaping and job splitting. Our findings from evaluating the proposed strategies on a real-world case study suggest that they allow the effective accommodation of the real workload traces used as input to the simulation of incompatible policies. By plugging the simulator into an evolutionary optimization algorithm, we also demonstrate the flexibility of the proposed strategies in helping with the proper exploration of the job scheduling configuration space.

超级计算机在推动不同科学和工程领域的研究和发展方面发挥着关键作用。然而,在这些系统中配置作业调度以确保最大的生产力和成本效益是一个挑战。在这种情况下,工作负载模拟成为一个关键工具,它提供了一种机制,可以在预期用户行为存在的情况下探索作业调度配置。在本文中,我们着重于基于仿真的优化应用于调优作业调度配置。我们介绍了一个离散事件模拟器,它利用两种策略来适应不同作业调度策略下的实际工作负载跟踪:作业塑造和作业拆分。我们在实际案例研究中评估建议的策略的结果表明,它们允许有效地适应用作不兼容策略模拟输入的实际工作负载跟踪。通过将模拟器插入到进化优化算法中,我们还展示了所提出策略在帮助正确探索作业调度配置空间方面的灵活性。
{"title":"Towards Workload-Tailored Optimization of Job Scheduling Policies in HPC Environments","authors":"João Pedro M. N. dos Santos,&nbsp;José Eduardo Henriques da Silva,&nbsp;Antônio Tadeu A. Gomes","doi":"10.1002/cpe.70532","DOIUrl":"https://doi.org/10.1002/cpe.70532","url":null,"abstract":"<p>Supercomputers play a pivotal role in advancing research and development across diverse scientific and engineering domains. However, configuring job scheduling in these systems to ensure maximum productivity and cost-effectiveness is a challenge. Workload simulation emerges as a crucial tool in this context, offering a mechanism to explore job scheduling configurations in the presence of expected user behaviors. In this paper, we focus on simulation-based optimization applied to tuning job scheduling configurations. We introduce a discrete-event simulator that utilizes two strategies to accommodate real workload traces under varying job scheduling policies: Job shaping and job splitting. Our findings from evaluating the proposed strategies on a real-world case study suggest that they allow the effective accommodation of the real workload traces used as input to the simulation of incompatible policies. By plugging the simulator into an evolutionary optimization algorithm, we also demonstrate the flexibility of the proposed strategies in helping with the proper exploration of the job scheduling configuration space.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.70532","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145983656","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
Deep Learning-Based Road Optimization Using UAVs for Disaster Areas 基于深度学习的无人机灾区道路优化
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-02 DOI: 10.1002/cpe.70539
Mehmet Serhat Ceylan, Gül Fatma Türker

Disaster management, disaster preparedness, disaster risk reduction, and post-disaster recovery processes are of strategic importance today in terms of increasing their effectiveness. Technological innovations and tools play an important role in the effective implementation of these processes. The rapid development of artificial intelligence and UAV technologies has enabled their effective use in disaster situations, and the integration of artificial intelligence has increased the competence of these tools. In this study, the detection of open roads and the optimization of the shortest route to reach the target were carried out in the context of disaster management. For this purpose, computer vision techniques were used to detect the condition of roads using image data obtained from UAVs, and the shortest route to reach the target point was determined. A unique dataset representing the disaster situation was created for model training. The image segmentation process was performed using current YOLO models. In the shortest route optimization phase, Dijkstra, A*, BFS, and DFS algorithms were applied. As a result of comparing the models developed in the route finding process, it was determined that YOLOv9e-seg provided the fastest and most accurate results with an average processing speed of 624 ms and a mAP value of 84.4%. Among the shortest path algorithms, Dijkstra and A* were found to provide the fastest access to the target point with average times of 385 and 387 ms, respectively. These results demonstrate that the developed model is successful in accurately determining the shortest path using a UAV in earthquake-affected areas.

灾害管理、备灾、减少灾害风险和灾后恢复过程在提高其有效性方面具有战略重要性。技术创新和工具在有效实施这些进程方面发挥着重要作用。人工智能和无人机技术的快速发展使其能够在灾害情况下有效使用,人工智能的集成提高了这些工具的能力。在本研究中,在灾害管理的背景下进行了开放道路的检测和到达目标的最短路线的优化。为此,利用计算机视觉技术,利用无人机获取的图像数据检测道路状况,确定到达目标点的最短路径。为模型训练创建了一个代表灾难情况的唯一数据集。图像分割过程使用当前的YOLO模型进行。在最短路径优化阶段,采用Dijkstra、A*、BFS和DFS算法。通过对在寻路过程中建立的模型进行比较,确定YOLOv9e-seg提供最快和最准确的结果,平均处理速度为624 ms, mAP值为84.4%。在最短路径算法中,Dijkstra算法和A*算法到达目标点的速度最快,平均时间分别为385 ms和387 ms。结果表明,所建立的模型能够成功地利用无人机在地震灾区准确地确定最短路径。
{"title":"Deep Learning-Based Road Optimization Using UAVs for Disaster Areas","authors":"Mehmet Serhat Ceylan,&nbsp;Gül Fatma Türker","doi":"10.1002/cpe.70539","DOIUrl":"https://doi.org/10.1002/cpe.70539","url":null,"abstract":"<div>\u0000 \u0000 <p>Disaster management, disaster preparedness, disaster risk reduction, and post-disaster recovery processes are of strategic importance today in terms of increasing their effectiveness. Technological innovations and tools play an important role in the effective implementation of these processes. The rapid development of artificial intelligence and UAV technologies has enabled their effective use in disaster situations, and the integration of artificial intelligence has increased the competence of these tools. In this study, the detection of open roads and the optimization of the shortest route to reach the target were carried out in the context of disaster management. For this purpose, computer vision techniques were used to detect the condition of roads using image data obtained from UAVs, and the shortest route to reach the target point was determined. A unique dataset representing the disaster situation was created for model training. The image segmentation process was performed using current YOLO models. In the shortest route optimization phase, Dijkstra, A*, BFS, and DFS algorithms were applied. As a result of comparing the models developed in the route finding process, it was determined that YOLOv9e-seg provided the fastest and most accurate results with an average processing speed of 624 ms and a mAP value of 84.4%. Among the shortest path algorithms, Dijkstra and A* were found to provide the fastest access to the target point with average times of 385 and 387 ms, respectively. These results demonstrate that the developed model is successful in accurately determining the shortest path using a UAV in earthquake-affected areas.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145904608","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
PLRAC: A PUF Characteristic Based Lightweight Remote Attestation for Container PLRAC:基于PUF特性的容器轻量级远程认证
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-02 DOI: 10.1002/cpe.70534
XinFeng He, Tanxin Zou

Container-based cloud technology has been widely used in the digital transformation of enterprises, and the combination of cloud computing and container technology has achieved efficient resource management. However, container technology also has security weaknesses and vulnerabilities and is vulnerable to cyberattacks. Most of the existing security studies focus on specific vulnerabilities and subsystems and fail to provide reliable verification of the overall security of container environments. To solve this problem, the concept of container-oriented PUF (CPUF) is proposed, which draws upon the characteristics of PUF. By integrating the PCR value from TPM with container attributes and encapsulating them through TEE, a unique and hardware-secure container identity is generated, which enables container integrity verification. Simultaneously, a lightweight remote attestation for container (PLRAC) is proposed in this paper based on TEE and CPUF as the foundation of trusted root. By integrating PUF and TEE technology, this scheme achieves a low-cost, high-efficiency remote verification mechanism for container, effectively detecting whether containers have been tampered with or compromised. We formally verified the security of this scheme using the AVISPA tool and, combined with theoretical analysis, demonstrated its resistance to typical attacks such as replay and forgery. Performance evaluations indicate that compared to other authentication schemes, PLRAC reduces communication overhead by up to approximately 21.5% while providing additional security properties, such as anonymity and uniqueness.

基于容器的云技术在企业数字化转型中得到了广泛应用,云计算与容器技术的结合实现了高效的资源管理。然而,容器技术也存在安全弱点和漏洞,容易受到网络攻击。现有的安全研究大多集中在特定的漏洞和子系统上,无法对容器环境的整体安全性提供可靠的验证。为了解决这一问题,借鉴了面向容器的PUF的特点,提出了面向容器的PUF的概念。通过将来自TPM的PCR值与容器属性集成,并通过TEE封装它们,可以生成一个惟一的、硬件安全的容器标识,从而实现容器完整性验证。同时,本文提出了一种基于TEE和CPUF作为可信根基础的轻量级容器远程认证(PLRAC)。该方案通过融合PUF和TEE技术,实现了一种低成本、高效率的容器远程验证机制,有效检测容器是否被篡改或泄露。我们使用AVISPA工具正式验证了该方案的安全性,并结合理论分析证明了该方案对重放和伪造等典型攻击的抵抗能力。性能评估表明,与其他身份验证方案相比,PLRAC将通信开销减少了大约21.5%,同时提供了额外的安全属性,例如匿名性和唯一性。
{"title":"PLRAC: A PUF Characteristic Based Lightweight Remote Attestation for Container","authors":"XinFeng He,&nbsp;Tanxin Zou","doi":"10.1002/cpe.70534","DOIUrl":"https://doi.org/10.1002/cpe.70534","url":null,"abstract":"<div>\u0000 \u0000 <p>Container-based cloud technology has been widely used in the digital transformation of enterprises, and the combination of cloud computing and container technology has achieved efficient resource management. However, container technology also has security weaknesses and vulnerabilities and is vulnerable to cyberattacks. Most of the existing security studies focus on specific vulnerabilities and subsystems and fail to provide reliable verification of the overall security of container environments. To solve this problem, the concept of container-oriented PUF (CPUF) is proposed, which draws upon the characteristics of PUF. By integrating the PCR value from TPM with container attributes and encapsulating them through TEE, a unique and hardware-secure container identity is generated, which enables container integrity verification. Simultaneously, a lightweight remote attestation for container (PLRAC) is proposed in this paper based on TEE and CPUF as the foundation of trusted root. By integrating PUF and TEE technology, this scheme achieves a low-cost, high-efficiency remote verification mechanism for container, effectively detecting whether containers have been tampered with or compromised. We formally verified the security of this scheme using the AVISPA tool and, combined with theoretical analysis, demonstrated its resistance to typical attacks such as replay and forgery. Performance evaluations indicate that compared to other authentication schemes, PLRAC reduces communication overhead by up to approximately 21.5% while providing additional security properties, such as anonymity and uniqueness.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145904609","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
Enhanced Pothole Detection in Complex Environments Using ARCH-RTDETR: A Lightweight and Efficient Approach 基于ARCH-RTDETR的复杂环境凹坑检测:一种轻量级、高效的方法
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-02 DOI: 10.1002/cpe.70541
Zhihai Liu, Ruijie Liu, Wenhao Sun, Jinfeng Ma

Detecting potholes in complex environments poses challenges such as varying illumination, shadows, and occlusions. Traditional methods often suffer from insufficient detection accuracy and poor real-time performance. To enhance detection robustness without sacrificing inference speed, this paper adopts the RT-DETR (Real-Time Detection Transformer) framework—which requires no NMS (Non-Maximum Suppression) post-processing and features an efficient hybrid encoder—as its foundation. We propose the lightweight and efficient ARCH-RTDETR detection model. The model introduces targeted enhancements to the backbone, feature-fusion module, and multi-scale architecture. Specifically, an AFGCA (Adaptive Fusion Global Context Attention) mechanism strengthens sensitivity to subtle cues; RepBN (Reparameterized Batch Normalization) is deeply integrated into the AIFI (Adaptive Instance Feature Integration) module to optimize feature distributions and increase multi-scale representational capacity; and the proposed CA-HSFPN (Coordinate Attention-guided Hierarchical Scale Feature Pyramid Network) improves the effectiveness of cross-scale feature fusion. Experiments on diverse datasets show that ARCH-RTDETR achieves an average detection accuracy of 85%, outperforming the RT-DETR baseline by 2.9%, while also improving detection precision and inference efficiency. These results indicate strong potential for deployment in intelligent transportation systems. This research provides a technical reference for small object detection, addressing the low efficiency of traditional manual inspections and the high detection latency of existing equipment in intelligent transportation systems, thereby offering a reliable technical solution for road safety assurance.

在复杂的环境中探测坑洼会带来一些挑战,比如不同的光照、阴影和遮挡。传统的检测方法往往存在检测精度不足、实时性差的问题。为了在不牺牲推理速度的情况下增强检测鲁棒性,本文采用RT-DETR(实时检测变压器)框架作为基础,该框架不需要NMS(非最大抑制)后处理,并具有高效的混合编码器。提出了一种轻量级、高效的ARCH-RTDETR检测模型。该模型对主干、特征融合模块和多尺度体系结构进行了有针对性的增强。具体来说,AFGCA (Adaptive Fusion Global Context Attention)机制增强了对微妙线索的敏感性;RepBN (Reparameterized Batch Normalization)深度集成到AIFI (Adaptive Instance Feature Integration)模块中,优化特征分布,增加多尺度表征能力;CA-HSFPN (Coordinate Attention-guided Hierarchical Scale Feature Pyramid Network)提高了跨尺度特征融合的有效性。在不同数据集上的实验表明,ARCH-RTDETR平均检测准确率达到85%,比RT-DETR基线提高2.9%,同时也提高了检测精度和推理效率。这些结果表明在智能交通系统中部署的巨大潜力。本研究为小物体检测提供了技术参考,解决了智能交通系统中传统人工检测效率低、现有设备检测时延高的问题,为道路安全保障提供了可靠的技术解决方案。
{"title":"Enhanced Pothole Detection in Complex Environments Using ARCH-RTDETR: A Lightweight and Efficient Approach","authors":"Zhihai Liu,&nbsp;Ruijie Liu,&nbsp;Wenhao Sun,&nbsp;Jinfeng Ma","doi":"10.1002/cpe.70541","DOIUrl":"https://doi.org/10.1002/cpe.70541","url":null,"abstract":"<div>\u0000 \u0000 <p>Detecting potholes in complex environments poses challenges such as varying illumination, shadows, and occlusions. Traditional methods often suffer from insufficient detection accuracy and poor real-time performance. To enhance detection robustness without sacrificing inference speed, this paper adopts the RT-DETR (Real-Time Detection Transformer) framework—which requires no NMS (Non-Maximum Suppression) post-processing and features an efficient hybrid encoder—as its foundation. We propose the lightweight and efficient ARCH-RTDETR detection model. The model introduces targeted enhancements to the backbone, feature-fusion module, and multi-scale architecture. Specifically, an AFGCA (Adaptive Fusion Global Context Attention) mechanism strengthens sensitivity to subtle cues; RepBN (Reparameterized Batch Normalization) is deeply integrated into the AIFI (Adaptive Instance Feature Integration) module to optimize feature distributions and increase multi-scale representational capacity; and the proposed CA-HSFPN (Coordinate Attention-guided Hierarchical Scale Feature Pyramid Network) improves the effectiveness of cross-scale feature fusion. Experiments on diverse datasets show that ARCH-RTDETR achieves an average detection accuracy of 85%, outperforming the RT-DETR baseline by 2.9%, while also improving detection precision and inference efficiency. These results indicate strong potential for deployment in intelligent transportation systems. This research provides a technical reference for small object detection, addressing the low efficiency of traditional manual inspections and the high detection latency of existing equipment in intelligent transportation systems, thereby offering a reliable technical solution for road safety assurance.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145904610","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 Python/Fortran Implementation of the Lattice-Boltzmann Kernel on Multiple GPU Using the OpenACC Framework 使用OpenACC框架在多GPU上实现Lattice-Boltzmann内核的Python/Fortran实现
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-02 DOI: 10.1002/cpe.70518
Carlos Junqueira-Junior, Erwan Zamora Medina, Noureddine Taibi, Simon Marié

The increasing availability of GPU accelerated architectures for high-performance computing presents new opportunities for scientific software but also challenges due to the complexity of porting legacy codes to accelerator platforms. Directive-based programming models such as OpenACC offer a minimally intrusive pathway to exploit GPU acceleration without requiring extensive rewriting of existing codes. The current work presents a comprehensive performance and portability study of a LatticeBoltzmann Method solver (PyLB) originally written in Python, Mpi4Py, and Fortran for CPU architectures, which is ported to GPUs using OpenACC directives applied to the Fortran routines. The performance of the solver is evaluated on NVIDIA V100, A100, and H100 GPUs available on the Jean Zay supercomputer from Institute for Development and Resources in Intensive Scientific Computing (IDRIS) in France. Roofline analysis and extensive strong and weak scalability tests are conducted, showing that the GPU-enabled version of PyLB scales efficiently across multiple GPUs. The solver achieves performance on the H100 GPU equivalent to thousands of CPU cores and shows strong energy and carbon efficiency advantages over traditional CPU-based simulations. The implementation is validated using classical benchmarks, including the decaying Taylor-Green vortex and the flow over a 3-D sphere. The results confirm the physical accuracy of the GPU port while highlighting its computational and environmental advantages.

用于高性能计算的GPU加速架构的日益可用性为科学软件提供了新的机会,但由于将遗留代码移植到加速器平台的复杂性,也带来了挑战。基于指令的编程模型(如OpenACC)提供了一种侵入性最小的途径来利用GPU加速,而不需要大量重写现有代码。目前的工作提出了一个全面的性能和可移植性研究的晶格玻尔兹曼方法求解器(PyLB),最初写在Python, Mpi4Py,和Fortran的CPU架构,它被移植到gpu使用OpenACC指令应用于Fortran例程。求解器的性能在法国集约科学计算发展与资源研究所(IDRIS) Jean Zay超级计算机上可用的NVIDIA V100, A100和H100 gpu上进行了评估。进行了rooline分析和广泛的强弱可伸缩性测试,表明支持gpu的PyLB版本可以有效地跨多个gpu扩展。求解器在H100 GPU上实现了相当于数千个CPU内核的性能,与传统的基于CPU的模拟相比,显示出强大的能源和碳效率优势。使用经典基准验证了该实现,包括衰减的泰勒-格林漩涡和三维球体上的流动。结果证实了GPU端口的物理精度,同时突出了其计算和环境优势。
{"title":"A Python/Fortran Implementation of the Lattice-Boltzmann Kernel on Multiple GPU Using the OpenACC Framework","authors":"Carlos Junqueira-Junior,&nbsp;Erwan Zamora Medina,&nbsp;Noureddine Taibi,&nbsp;Simon Marié","doi":"10.1002/cpe.70518","DOIUrl":"https://doi.org/10.1002/cpe.70518","url":null,"abstract":"<p>The increasing availability of GPU accelerated architectures for high-performance computing presents new opportunities for scientific software but also challenges due to the complexity of porting legacy codes to accelerator platforms. Directive-based programming models such as OpenACC offer a minimally intrusive pathway to exploit GPU acceleration without requiring extensive rewriting of existing codes. The current work presents a comprehensive performance and portability study of a LatticeBoltzmann Method solver (PyLB) originally written in Python, Mpi4Py, and Fortran for CPU architectures, which is ported to GPUs using OpenACC directives applied to the Fortran routines. The performance of the solver is evaluated on NVIDIA V100, A100, and H100 GPUs available on the Jean Zay supercomputer from Institute for Development and Resources in Intensive Scientific Computing (IDRIS) in France. Roofline analysis and extensive strong and weak scalability tests are conducted, showing that the GPU-enabled version of PyLB scales efficiently across multiple GPUs. The solver achieves performance on the H100 GPU equivalent to thousands of CPU cores and shows strong energy and carbon efficiency advantages over traditional CPU-based simulations. The implementation is validated using classical benchmarks, including the decaying Taylor-Green vortex and the flow over a 3-D sphere. The results confirm the physical accuracy of the GPU port while highlighting its computational and environmental advantages.</p>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1002/cpe.70518","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145909216","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 Multi-Task Learning V-Net Model for Working Length Prediction in Volumetric Dental Cone Beam Computed Tomography Images 基于多任务学习的V-Net模型的牙体锥形束ct图像工作长度预测
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2026-01-02 DOI: 10.1002/cpe.70537
Jing Li, Yue Qiu, Yongcun Zhang, Huan Liu, Xiangyu Chen, Huanhuan Li, Zijian Liu

The prevalence of pulpal and periapical diseases exceeds 50% in the general population. Root canal treatment is currently recognized as the gold standard treatment, in which precise measurement of working length (WL) is critical for treatment success. In this study, a total of 100 eligible extracted teeth were collected and scanned using cone-beam computed tomography (CBCT) to obtain high-resolution three-dimensional images. For WL calculation, we employed a V-net-based segmentation network for simulated paths of the root canal file, incorporating an encoder–decoder structure and a multi-task learning strategy, and achieved a sensitivity of 94.7%. Ablation studies revealed that integrating the decoder's mask branch, key point branch, and boundary branch significantly improved the segmentation accuracy. The WL calculation comprised three stages: skeleton extraction and noise suppression, branch extraction and generation of the simulated paths of the root canal file, and length calculation based on three-dimensional spline curves. The model achieved an average prediction error of 0.28 mm and an accuracy of 86.67% in WL prediction. These findings indicate that this V-net-based multi-branch framework for precise WL estimation from CBCT holds substantial clinical application potential. Future work will focus on enhancing generalization and addressing challenges posed by calcified or anatomically complex root canals.

在一般人群中,牙髓和根尖周围疾病的患病率超过50%。根管治疗是目前公认的金标准治疗,其中工作长度(WL)的精确测量是治疗成功的关键。本研究收集了100颗符合条件的拔牙,并使用锥形束计算机断层扫描(CBCT)进行扫描,获得高分辨率的三维图像。对于WL计算,我们采用基于v -net的根管文件模拟路径分割网络,结合编码器-解码器结构和多任务学习策略,实现了94.7%的灵敏度。研究表明,将解码器的掩膜分支、关键点分支和边界分支相结合,可以显著提高分割精度。WL计算包括三个阶段:骨架提取和噪声抑制、根管锉模拟路径的分支提取和生成、基于三维样条曲线的长度计算。模型的平均预测误差为0.28 mm,预测精度为86.67%。这些发现表明,这种基于v -net的多分支框架可以从CBCT中精确估计WL,具有巨大的临床应用潜力。未来的工作将集中在加强推广和解决钙化或解剖复杂的根管带来的挑战。
{"title":"A Multi-Task Learning V-Net Model for Working Length Prediction in Volumetric Dental Cone Beam Computed Tomography Images","authors":"Jing Li,&nbsp;Yue Qiu,&nbsp;Yongcun Zhang,&nbsp;Huan Liu,&nbsp;Xiangyu Chen,&nbsp;Huanhuan Li,&nbsp;Zijian Liu","doi":"10.1002/cpe.70537","DOIUrl":"https://doi.org/10.1002/cpe.70537","url":null,"abstract":"<div>\u0000 \u0000 <p>The prevalence of pulpal and periapical diseases exceeds 50% in the general population. Root canal treatment is currently recognized as the gold standard treatment, in which precise measurement of working length (WL) is critical for treatment success. In this study, a total of 100 eligible extracted teeth were collected and scanned using cone-beam computed tomography (CBCT) to obtain high-resolution three-dimensional images. For WL calculation, we employed a V-net-based segmentation network for simulated paths of the root canal file, incorporating an encoder–decoder structure and a multi-task learning strategy, and achieved a sensitivity of 94.7%. Ablation studies revealed that integrating the decoder's mask branch, key point branch, and boundary branch significantly improved the segmentation accuracy. The WL calculation comprised three stages: skeleton extraction and noise suppression, branch extraction and generation of the simulated paths of the root canal file, and length calculation based on three-dimensional spline curves. The model achieved an average prediction error of 0.28 mm and an accuracy of 86.67% in WL prediction. These findings indicate that this V-net-based multi-branch framework for precise WL estimation from CBCT holds substantial clinical application potential. Future work will focus on enhancing generalization and addressing challenges posed by calcified or anatomically complex root canals.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145904829","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
TracePath: Modeling and Analyzing Competency Trajectories With Graph-Based Learning Analytics Over a Hybrid Polystore TracePath:在混合Polystore上使用基于图的学习分析建模和分析能力轨迹
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2025-12-29 DOI: 10.1002/cpe.70508
Abdelkader Ouared, Madeth May, Claudine Piau-Toffolon, Nicolas Dugué

A competency-based approach supported by personalized learning paths and prompt feedback accelerates skill development by continuously adapting to learners' needs and maintaining high levels of engagement. Capturing and understanding learner competency development through interaction data offers the potential for early intervention and optimized educational design, yet introduces challenges related to scalability and complexity. We present TracePath, a novel graph-based framework that models learner trajectories as directed graphs, where nodes correspond to competencies or learner states and edges denote transitions such as validation or rejection events. This approach uncovers common learning pathways, identifies bottlenecks, and supports predictive analytics. At the core, a generic metamodel formalizes Competency Transition Graphs (CTGs), enabling comprehensive graph-based analytics implemented over a hybrid polystore architecture that integrates both relational and NoSQL databases. Our design decouples data extraction from graph exploration, allowing efficient querying, clustering, and pattern matching to deliver timely and explainable learning insights. Empirical validation using real-world data from the écri+ e-certification project demonstrates TracePath's effectiveness in providing scalable, dynamic, and low-latency learning analytics to support personalized education.

以能力为基础的方法,由个性化的学习路径和及时的反馈支持,通过不断适应学习者的需求和保持高水平的参与,加速技能的发展。通过交互数据捕捉和理解学习者能力的发展,为早期干预和优化教育设计提供了可能,但也带来了与可扩展性和复杂性相关的挑战。我们提出了一种新的基于图的框架TracePath,它将学习者轨迹建模为有向图,其中节点对应于能力或学习者状态,边缘表示验证或拒绝事件等过渡。这种方法揭示了常见的学习途径,识别瓶颈,并支持预测分析。在核心部分,通用元模型形式化了能力转换图(ctg),支持在集成关系数据库和NoSQL数据库的混合多存储体系结构上实现全面的基于图的分析。我们的设计将数据提取与图形探索分离,允许高效的查询、聚类和模式匹配,以提供及时且可解释的学习见解。使用来自电子认证项目的实际数据的经验验证证明了TracePath在提供可伸缩、动态和低延迟的学习分析以支持个性化教育方面的有效性。
{"title":"TracePath: Modeling and Analyzing Competency Trajectories With Graph-Based Learning Analytics Over a Hybrid Polystore","authors":"Abdelkader Ouared,&nbsp;Madeth May,&nbsp;Claudine Piau-Toffolon,&nbsp;Nicolas Dugué","doi":"10.1002/cpe.70508","DOIUrl":"https://doi.org/10.1002/cpe.70508","url":null,"abstract":"<div>\u0000 \u0000 <p>A competency-based approach supported by personalized learning paths and prompt feedback accelerates skill development by continuously adapting to learners' needs and maintaining high levels of engagement. Capturing and understanding learner competency development through interaction data offers the potential for early intervention and optimized educational design, yet introduces challenges related to scalability and complexity. We present <span>TracePath</span>, a novel graph-based framework that models learner trajectories as directed graphs, where nodes correspond to competencies or learner states and edges denote transitions such as validation or rejection events. This approach uncovers common learning pathways, identifies bottlenecks, and supports predictive analytics. At the core, a generic metamodel formalizes Competency Transition Graphs (CTGs), enabling comprehensive graph-based analytics implemented over a hybrid polystore architecture that integrates both relational and NoSQL databases. Our design decouples data extraction from graph exploration, allowing efficient querying, clustering, and pattern matching to deliver timely and explainable learning insights. Empirical validation using real-world data from the <span>écri+</span> e-certification project demonstrates TracePath's effectiveness in providing scalable, dynamic, and low-latency learning analytics to support personalized education.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145905214","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 Cache Friendly LSM Tree Based on Extendible Hash 一种基于可扩展哈希的缓存友好LSM树
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2025-12-29 DOI: 10.1002/cpe.70522
Tao Cai, Qiujing Huang, Jianfei Dai, Dejiao Niu, Yikang Deng

The LSM-tree based on extendible hashing has been adopted in key-value storage systems due to its high write throughput, good scalability, and balanced read-write performance. However, it faces several challenges when accessing SSTables, including low cache efficiency, uneven data distribution across hash buckets, and frequent directory expansions. To address these issues, this paper proposes a cache-friendly LSM-tree based on extendible hashing. To solve the problem that similar keys in SSTables are not stored adjacently in SSTables, a key-to-value mapping strategy based on Locality-Sensitive Hashing (LSH) is employed. Second, to address the uneven data distribution across hash buckets in extendible hashing, a logically uniform extendible hashing scheme is designed, along with a novel HTable structure to replace the traditional SSTables in LSM-tree. In addition, an HTable indexing strategy based on the LSH-Cuckoo filter is proposed to accurately locate the target HTable. Based on the Intel Optane DC Persistent Memory driver, a prototype of a cache-friendly key-value storage system named DLMS was implemented on non-volatile memory (NVM), and evaluated using the YCSB benchmark. Experimental results show that, compared to the LSM-tree-based storage system RocksDB, DLMS achieves an average improvement of 9.8% in read throughput and 11.9% in write throughput, while reducing insertion latency by 7.8%.

基于可扩展哈希的LSM-tree具有高写吞吐量、良好的可扩展性和均衡的读写性能,被广泛应用于键值存储系统中。然而,它在访问sstable时面临几个挑战,包括缓存效率低、跨散列桶的数据分布不均匀以及频繁的目录扩展。为了解决这些问题,本文提出了一种基于可扩展散列的缓存友好型lsm树。为了解决sstable中相似的键在sstable中不相邻存储的问题,采用了基于LSH (Locality-Sensitive hash)的键值映射策略。其次,为了解决可扩展哈希中数据分布不均匀的问题,设计了逻辑上统一的可扩展哈希方案,并采用新颖的HTable结构取代LSM-tree中传统的sstable结构。此外,提出了一种基于LSH-Cuckoo滤波器的HTable索引策略,以准确定位目标HTable。基于Intel Optane DC Persistent Memory驱动程序,在非易失性内存(NVM)上实现了一个缓存友好型键值存储系统DLMS的原型,并使用YCSB基准测试对其进行了评估。实验结果表明,与基于lsm树的存储系统RocksDB相比,DLMS的读吞吐量平均提高了9.8%,写吞吐量平均提高了11.9%,插入延迟降低了7.8%。
{"title":"A Cache Friendly LSM Tree Based on Extendible Hash","authors":"Tao Cai,&nbsp;Qiujing Huang,&nbsp;Jianfei Dai,&nbsp;Dejiao Niu,&nbsp;Yikang Deng","doi":"10.1002/cpe.70522","DOIUrl":"https://doi.org/10.1002/cpe.70522","url":null,"abstract":"<div>\u0000 \u0000 <p>The LSM-tree based on extendible hashing has been adopted in key-value storage systems due to its high write throughput, good scalability, and balanced read-write performance. However, it faces several challenges when accessing SSTables, including low cache efficiency, uneven data distribution across hash buckets, and frequent directory expansions. To address these issues, this paper proposes a cache-friendly LSM-tree based on extendible hashing. To solve the problem that similar keys in SSTables are not stored adjacently in SSTables, a key-to-value mapping strategy based on Locality-Sensitive Hashing (LSH) is employed. Second, to address the uneven data distribution across hash buckets in extendible hashing, a logically uniform extendible hashing scheme is designed, along with a novel HTable structure to replace the traditional SSTables in LSM-tree. In addition, an HTable indexing strategy based on the LSH-Cuckoo filter is proposed to accurately locate the target HTable. Based on the Intel Optane DC Persistent Memory driver, a prototype of a cache-friendly key-value storage system named DLMS was implemented on non-volatile memory (NVM), and evaluated using the YCSB benchmark. Experimental results show that, compared to the LSM-tree-based storage system RocksDB, DLMS achieves an average improvement of 9.8% in read throughput and 11.9% in write throughput, while reducing insertion latency by 7.8%.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145905215","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
Enhancing Wildfire Preparedness and Response: A Drone Network-Based Early Warning System for Bushfires 加强野火准备和响应:基于无人机网络的森林火灾预警系统
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2025-12-28 DOI: 10.1002/cpe.70528
Mana Saleh Al Reshan, Choudapur Atheeq, Mohammed Abdul Haque Farquad, Hamad Ali Abosaq, Altaf Choudapur, Mohamed A. Elmagzoub, Mousa Alalhareth, Asadullah Shaikh

The existence of Bushfire is a significant problem. So not only are environmental threats to life and society a risk, but also the threatening of the safety of all. Thus it is extremely critical to detect these fires in time. This identification can assist in the successful application of fire management. Existing approaches might not be effective under conditions such as bad weather. A decrease in visible light also can affect accuracy. These techniques focus on the identification of fires during early stages. We introduce an innovative method in this study. The early detection of bushfires is achieved through UAVs. Each drone in the network has a thermal image camera onboard to provide real-time surveillance of the assigned area. The drones are also equipped with sensors that detect smoke and other indications of potential fire. A control network receives up-to-the-minute information from drones. Machine learning algorithms are used to interpret this data. The aim is to detect potential fires. The above detailed evaluations were captured using the eBee X and DJI Matrice 300 RTK. This study was carried out in a dedicated area provided by a National Park and involved the use of fixed and multirotor UAVs. State of the art sensor system could be successfully deployed on board the UAVs. The integrated technology was comprised of a Sequoia+ multispectral camera, H20T Quad Sensor and PGS 813 Gas Sensor. These were test burns, including controlled prescribed burning and fire simulations. They highlighted the system's impressive ability to detect bushfires in their early stages. The system has provided a quantum leap in preventive fire management. And it has heightened cost-mindedness in real-world settings. This enhancement is due to its high-quality monitoring and precise detection of fire signs. The proposed method might be a useful and powerful tool for proactive fire fighting and early warning, such as fighting wildfire and related scenarios.

森林大火的存在是一个重大问题。因此,环境威胁不仅对生命和社会构成威胁,而且对所有人的安全构成威胁。因此,及时发现这些火灾是至关重要的。这种识别有助于消防管理的成功应用。现有的方法在恶劣天气等条件下可能无效。可见光的减少也会影响精度。这些技术侧重于在火灾的早期阶段识别火灾。在本研究中,我们引入了一种创新的方法。丛林大火的早期探测是通过无人机实现的。网络中的每架无人机都有一个热成像摄像头,可以对指定区域进行实时监控。无人机还配备了传感器,可以探测烟雾和其他潜在火灾迹象。控制网络接收来自无人机的最新信息。机器学习算法被用来解释这些数据。目的是探测潜在的火灾。上述详细评估是使用eBee X和DJI matrix 300 RTK捕获的。这项研究是在一个国家公园提供的专用区域进行的,涉及使用固定和多旋翼无人机。最先进的传感器系统可以成功地部署在无人机上。该集成技术由红杉+多光谱相机、H20T四轴传感器和PGS 813气体传感器组成。这些都是试验燃烧,包括受控的规定燃烧和火灾模拟。他们强调了该系统在早期发现森林火灾的令人印象深刻的能力。该系统为预防性火灾管理提供了一个巨大的飞跃。而且,它还提高了现实环境中的成本意识。这种增强是由于其高质量的监测和精确的探测火灾迹象。提出的方法可能是一个有用的和强大的工具,主动灭火和早期预警,如扑灭野火和相关场景。
{"title":"Enhancing Wildfire Preparedness and Response: A Drone Network-Based Early Warning System for Bushfires","authors":"Mana Saleh Al Reshan,&nbsp;Choudapur Atheeq,&nbsp;Mohammed Abdul Haque Farquad,&nbsp;Hamad Ali Abosaq,&nbsp;Altaf Choudapur,&nbsp;Mohamed A. Elmagzoub,&nbsp;Mousa Alalhareth,&nbsp;Asadullah Shaikh","doi":"10.1002/cpe.70528","DOIUrl":"https://doi.org/10.1002/cpe.70528","url":null,"abstract":"<div>\u0000 \u0000 <p>The existence of Bushfire is a significant problem. So not only are environmental threats to life and society a risk, but also the threatening of the safety of all. Thus it is extremely critical to detect these fires in time. This identification can assist in the successful application of fire management. Existing approaches might not be effective under conditions such as bad weather. A decrease in visible light also can affect accuracy. These techniques focus on the identification of fires during early stages. We introduce an innovative method in this study. The early detection of bushfires is achieved through UAVs. Each drone in the network has a thermal image camera onboard to provide real-time surveillance of the assigned area. The drones are also equipped with sensors that detect smoke and other indications of potential fire. A control network receives up-to-the-minute information from drones. Machine learning algorithms are used to interpret this data. The aim is to detect potential fires. The above detailed evaluations were captured using the eBee X and DJI Matrice 300 RTK. This study was carried out in a dedicated area provided by a National Park and involved the use of fixed and multirotor UAVs. State of the art sensor system could be successfully deployed on board the UAVs. The integrated technology was comprised of a Sequoia+ multispectral camera, H20T Quad Sensor and PGS 813 Gas Sensor. These were test burns, including controlled prescribed burning and fire simulations. They highlighted the system's impressive ability to detect bushfires in their early stages. The system has provided a quantum leap in preventive fire management. And it has heightened cost-mindedness in real-world settings. This enhancement is due to its high-quality monitoring and precise detection of fire signs. The proposed method might be a useful and powerful tool for proactive fire fighting and early warning, such as fighting wildfire and related scenarios.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145905156","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
Enhanced Model for Edible Mushroom Recognition Based on Belief Measure-Weighted Fusion 基于信念加权融合的食用菌识别增强模型
IF 1.5 4区 计算机科学 Q3 COMPUTER SCIENCE, SOFTWARE ENGINEERING Pub Date : 2025-12-28 DOI: 10.1002/cpe.70520
Shuai Yang, Hang Wang, Liucheng Huang, Xiaojian Ma

Accurate discrimination of edible mushrooms is critical for food safety, yet it remains challenging due to the high visual similarity between edible and toxic species, leading to frequent misidentification by conventional vision-based systems. In this paper, we propose a novel Belief Measure-Weighted Fusion enhanced model that integrates Dempster–Shafer evidence theory into mushroom recognition for the first time. Our enhanced model consists of two core components: a Probabilistic Classification Module with Parallel Color Representation that extracts multidimensional features through complementary color spaces and produces diversified soft predictions; and a multisource classification decision fusion (MCDF) Module that effectively reconciles and integrates conflicting evidence from these predictions. A key innovation within MCDF is the belief cosine similarity coefficient (BCSC), which quantitatively assesses inter-evidence conflict, enabling an adaptive evidence fusion method that enhances robustness and decision reliability. Extensive experiments on a hybrid dataset containing challenging species show consistent performance gains across six mainstream deep networks, demonstrating strong generalization. This work not only bridges evidence theory with practical mushroom identification but also offers a transferable framework for recognizing visually similar species in wild food contexts.

准确识别食用菌对食品安全至关重要,但由于食用菌和有毒菌在视觉上的高度相似性,导致传统的基于视觉的系统经常错误识别,因此仍然具有挑战性。本文首次将Dempster-Shafer证据理论整合到蘑菇识别中,提出了一种新的信念测度加权融合增强模型。我们的增强模型由两个核心部分组成:一个具有平行颜色表示的概率分类模块,通过互补色空间提取多维特征并产生多样化的软预测;以及一个多源分类决策融合(MCDF)模块,可以有效地协调和整合来自这些预测的相互冲突的证据。MCDF中的一个关键创新是信念余弦相似系数(BCSC),它定量评估证据间冲突,使自适应证据融合方法增强了鲁棒性和决策可靠性。在包含挑战性物种的混合数据集上进行的大量实验表明,在六种主流深度网络中,性能得到了一致的提升,证明了强大的泛化能力。这项工作不仅将证据理论与实际的蘑菇鉴定联系起来,而且为识别野生食物环境中视觉上相似的物种提供了一个可转移的框架。
{"title":"Enhanced Model for Edible Mushroom Recognition Based on Belief Measure-Weighted Fusion","authors":"Shuai Yang,&nbsp;Hang Wang,&nbsp;Liucheng Huang,&nbsp;Xiaojian Ma","doi":"10.1002/cpe.70520","DOIUrl":"https://doi.org/10.1002/cpe.70520","url":null,"abstract":"<div>\u0000 \u0000 <p>Accurate discrimination of edible mushrooms is critical for food safety, yet it remains challenging due to the high visual similarity between edible and toxic species, leading to frequent misidentification by conventional vision-based systems. In this paper, we propose a novel Belief Measure-Weighted Fusion enhanced model that integrates Dempster–Shafer evidence theory into mushroom recognition for the first time. Our enhanced model consists of two core components: a Probabilistic Classification Module with Parallel Color Representation that extracts multidimensional features through complementary color spaces and produces diversified soft predictions; and a multisource classification decision fusion (MCDF) Module that effectively reconciles and integrates conflicting evidence from these predictions. A key innovation within MCDF is the belief cosine similarity coefficient (BCSC), which quantitatively assesses inter-evidence conflict, enabling an adaptive evidence fusion method that enhances robustness and decision reliability. Extensive experiments on a hybrid dataset containing challenging species show consistent performance gains across six mainstream deep networks, demonstrating strong generalization. This work not only bridges evidence theory with practical mushroom identification but also offers a transferable framework for recognizing visually similar species in wild food contexts.</p>\u0000 </div>","PeriodicalId":55214,"journal":{"name":"Concurrency and Computation-Practice & Experience","volume":"38 1","pages":""},"PeriodicalIF":1.5,"publicationDate":"2025-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145905151","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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1