检索结果-内蒙古大学图书馆

Pothole Detection: A Study of Ensemble Learning and Decision Framework

International Journal of Advanced Computer Science and Applications 2025年第4期16卷 67-79页

作者： Gorro, Ken D. Ranolo, Elmo B. Ilano, Anthony S. Balijon, Deofel P. Center for Cloud Computing Big Data and Artificial Intelligence Philippines College of Computing Artificial Intelligence and Sciences of Cebu Normal University Philippines

This study investigates the potential use of ensemble learning (YOLOv9 and Mask R-CNN) and Multi-Criteria Decision Making for pothole detection system. A series of experiments were conducted, including variations in confidence thresholds, IoU thresholds, dynamic weight configurations, camera angles and MCDM criteria, to assess their effects on detection performance. The YOLOv9 model achieved a mean Average Precision (mAP) of 0.908 at 0.5 IoU and an F1 score of 0.58 at a confidence threshold of 0.282, indicating a strong balance between precision and recall. However, adjusting IoU thresholds showed that lower thresholds improved recall but resulted in false positives, while higher thresholds improved precision but reduced recall. Dynamic weight configurations were explored, with balanced weights (wY = 0.5, wM = 0.5) yielding the best overall performance, while uneven weights allowed trade-offs between precision and recall based on specific application needs. The MCDM framework refined detection outputs by evaluating pothole features such as size, position, depth, and shape. The proposed algorithm has the potential to be widely used in practical applications. Overfitting is the main drawback of the proposed algorithm, but this is dependent on the use case where the pothole detection will be used. © (2025), (Science and Information Organization). All rights reserved.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

Science China(Information Sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Edge data Caching With Failure Tolerance and Popularity Awareness

引用

IEEE Transactions on Mobile computing 2025年第6期24卷 5357-5369页

作者： Luo, Ruikun Zhang, Zujia He, Qiang Xu, Mengxi Chen, Feifei Dai, Xiaohai Wu, Song Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Deakin University School of Information Technology GeelongVIC3125 Australia

In the mobile edge computing environment, caching data in edge storage systems can significantly reduce data retrieval latency for users while saving the costs incurred by cloud-edge data transmissions for app vendors. Existing edge data caching (EDC) methods prioritize popular data and aim to minimize users’ data retrieval latency and system storage costs jointly. However, these EDC methods often rely on the assumption that data popularity always follows certain distributions. As a result, they cannot properly adapt to the fluctuations in data popularity due to user mobility or unexpected increases in user demands. Meanwhile, unlike cloud data centers, complex and fragile edge servers are more likely to experience physical failures or network outages, presenting new challenges for EDC strategies. Specifically, when an edge server fails or experiences an outage, cached data may become temporarily unavailable, leading to increased latency as requests are redirected to alternative servers or the cloud. In this paper, to enable uncertainty-aware edge data caching (uEDC), we first model the problem as a robust optimization problem and propose an optimal algorithm named uEDC-B to find the optimal uEDC solution. To address the high computational complexity of uEDC-B, we introduce an approximate algorithm named uEDC-L based on linear decision rules. Theoretical analysis and extensive experiments on a real-world dataset demonstrate that the proposed methods outperform two state-of-the-art approaches in handling the uncertainties in data popularity and edge server failure with a significant performance improvement of 59.27% in data retrieval latency and 55.07% in data caching cost. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading 23

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Duan, Zhuohui Feng, Hao Liu, Haikun Liao, Xiaofei Jin, Hai Li, Bangyu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133458

The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world application. In this paper, we introduce AegonKV, a "three-birds-one-stone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. AegonKV leverages offload-friendly data structures and hardware/software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems. © 2025 FAST. All Rights Reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

引用

Frontiers of Computer Science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

AccelES: Accelerating Top-K SpMV for Embedding Similarity via Low-bit Pruning 31

AccelES: Accelerating Top-K SpMV for Embedding Similarity vi...

引用

31st IEEE International Symposium on High Performance Computer Architecture, HPCA 2025

作者： Zhai, Jiaqi Shi, Xuanhua Huang, Kaiyi Ye, Chencheng Hu, Weifang He, Bingsheng Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China National University of Singapore School of Computing 119077 Singapore

ISBN: (纸本)9798331506476

In the realm of recommendation systems, achieving real-time performance in embedding similarity tasks is often hindered by the limitations of traditional Top-K sparse matrix-vector multiplication (SpMV) methods, which suffer from high latency due to inefficient memory access patterns. This paper identifies these critical gaps and introduces AccelES, a novel approach that significantly enhances the efficiency of Top-K SpMV. Our method employs a two-stage calculation scheme: the first stage utilizes a compact, low-bit dataset to quickly identify the most relevant entries, while the second stage performs full-precision calculations solely on this pruned subset, thereby minimizing computational overhead. Furthermore, AccelES incorporates innovative matrix representations, Ultra-CSR and Random-CSR, which optimize memory bandwidth utilization. Experimental results demonstrate that AccelES accelerates performance, surpassing state-of-the-art FPGA, GPU, and CPU solutions by factors of 3.4×, 2.5×, and 153.3×, respectively, under controlled conditions. These advancements not only enhance processing speed but also significantly improve real-time performance in recommendation systems, establishing AccelES as a pivotal contribution to the field of Top-K sparse matrix-vector multiplication. © 2025 IEEE.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Fine-tuning non-intrusive load monitoring model through user interaction: A practical approach to appliance recognition with limited labeled data

引用

Applied Energy 2025年 391卷

作者： Pusceddu, Gabriella Manca, Simone Massidda, Luca Italy National Research Center in High Performance Computing Big Data and Quantum Computing Casalecchio Di Reno Italy

A novel fine-tuning method is introduced for Non-Intrusive Load Monitoring (NILM), using transfer learning to adapt pre-trained deep learning models for deferrable appliances with distinct short cycles (such as washing machines and dishwashers). This approach enhances model generalization by using limited user-labeled data with readily available, low-frequency aggregate consumption data from smart meters. The method eliminates the need for high-frequency sampling or intrusive sub-metering, and high accuracy in deployable NILM applications. The results show that high accuracy in appliance state recognition is achieved with minimal user interaction, requiring only a small number of labeled appliance activations. The method achieves competitive results compared to state-of-the-art methods, providing a practical and effective NILM solution suitable for widespread adoption by consumers and utility companies. © 2025 Elsevier Ltd

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Improving spatial clustering through a weight system on multilevel permanent museum attraction probability

引用

Quality and Quantity 2025年 1-30页

作者： Distefano, Veronica De Iaco, Sandra Maggio, Sabrina Department of Economic Sciences University of Salento Lecce Italy European Centre for Living Technology Ca’ Foscari University of Venice Venice Italy National Centre for HPC Big Data and Quantum Computing Bologna Italy National Biodiversity Future Center Palermo Italy

Museums are extensively distributed all over the Italian territory. In this context, the identification of spatial patterns, referred to specific characteristics of museums evaluated at regional level, can support the enhancement of the cultural and natural heritage as well as the social and economic growth. In the literature, many studies were focused on the visitors’ profile or on the managerial performance and economic efficiency of the museums. However, none of them analysed the effects of the permanent presence of museums and their spatial contiguity by using both spatial machine learning models and statistical models. To this aim an innovative approach, which combines multilevel binary model and spatial clustering, as a machine learning unsupervised technique, is proposed to investigate the pattern recognition of the permanent museums all over the Italian territory and provide relevant information in terms of similarity among the spatial cluster formed. The logit of the museums to remain open all over the year, also with respect to different types of institution (private/public) and a different spatial/geographical constraints are jointly considered. In addition, a weight system is defined in order to introduce a regional measure of museums prevalence with respect to other types of cultural institutions. The ISTAT microdata concerning the Italian survey on museums and cultural entities are considered. The results highlight the great potentiality of this spatial clustering approach in delivering a better understanding of the role of museums as factor of challenge of urban development, providing in the meantime suggestions for tourism providers and museum managers. © The Author(s), under exclusive licence to Springer Nature B.V. 2024.

关键词： Bootstrap technique Clustering validation measures Multilevel model Odds ratios Spatial clustering

来源：评论

学校读者我要写书评

暂无评论

Towards High-throughput and Low-latency Billion-scale Vector Search via CPU/GPU Collaborative Filtering and Re-ranking 23

Towards High-throughput and Low-latency Billion-scale Vector...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Tian, Bing Liu, Haikun Tang, Yuhang Xiao, Shihai Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Xuecang Zhu, Junhua Zhang, Yu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd. China

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present FusionANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of FusionANNS lies in CPU/GPU collaborative filtering and re-ranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN;2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy. © 2025 FAST. All Rights Reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Hybrid forecasting of demand flexibility: A top-down approach for thermostatically controlled loads

引用

Energy and AI 2025年 20卷

作者： Massidda, Luca Marrocu, Marino CRS4 Center for Advanced Studies Research and Development in Sardinia Italy National Research Center in High Performance Computing Big Data and Quantum Computing Italy

Demand-side flexibility is crucial to balancing supply and demand, as renewable energy sources are increasingly integrated into the energy mix, and heating and transport systems are becoming more and more electrified. Historically, this balancing has been managed from the supply side. However, the shift towards renewable energy sources limits the controllability of traditional fossil fuel plants, increasing the importance of demand response (DR) techniques to achieve the required flexibility. Aggregators participating in flexibility markets need to accurately forecast the adaptability they can offer, a task complicated by numerous influencing variables. Based on a top-down approach, this study addresses the problem of forecasting electricity demand in the presence of flexibility from thermostatically controlled loads. We propose a hybrid model that combines data-driven techniques for probabilistic estimation of electricity consumption with a disaggregation of electricity consumption to identify the fraction of thermal loads, subject to flexibility, which is simulated by a virtual battery model. The technique is applied to a synthetic dataset that simulates the response of a European neighborhood to demand response interventions. The results demonstrate the model's ability to accurately predict both the reduction in electricity demand during DR events and the subsequent rebound in consumption. The model achieves a mean absolute percentage error (MAPE) lower than 17.0%, comparable to the accuracy without flexibility. The results obtained are compared with a direct data-driven approach, demonstrating the validity and effectiveness of our model. © 2025

关键词： Demand response

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：