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

20th European Conference on computer systems, EuroSys 2025, co-located 30th ACM International Conference on Architectural Support for Programming Languages and Operating systems, ASPLOS 2025

作者： Qi, Hao Luo, Kang He, Ligang Zhang, Yu Cai, Minzhi Dai, Jingxin He, Bingsheng Jin, Hai Zhang, Zhan Zhao, Jin Yue, Hengshan Yu, Hui Liao, Xiaofei 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 Huazhong University of Science and Technology China Department of Computer Science University of Warwick United Kingdom National University of Singapore Singapore Zhejiang Lab China Jilin University China

ISBN: (纸本)9798400711961

Hypergraph Pattern Mining (HPM) aims to identify all the instances of user-interested subhypergraphs (patterns) in hypergraphs, which has been widely used in various applications. However, existing solutions either need significant enumeration overhead because they extend subhypergraphs at the granularity of vertices, or suffer from massive redundant computations because they often need to repeatedly fetch and process the same incident hyperedges for different vertices. This paper presents an overlap-centric system named OHMiner to efficiently support HPM. OHMiner proposes an overlap-centric execution model to determine the subhypergraphs isomorphism through computing and comparing overlaps among hyperedges using set operations. This model aims to efficiently handle the vertices that collectively share the same incident hyperedges. To automatically and precisely retrieve an arbitrary pattern’s overlapping semantics without performing redundant set computations, OHMiner further proposes a redundancy-free compiler, which constructs an Overlap Intersection Graph (OIG) for the pattern, optimizes the OIG, and generates an overlap-centric execution plan to guide the procedure of HPM. Moreover, OHMiner designs an overlap-centric parallel execution engine, which adopts an incremental overlap-pruned approach to fast validate candidates for HPM. Additionally, it proposes a degree-aware data store to support efficient generation of candidates. Through evaluating OHMiner on a broad range of real-world hypergraphs with various patterns, our experimental results show that OHMiner outperforms the state-of-the-art HPM system by 5.4×-22.2×. © 2025 Copyright held by the owner/author(s).

关键词： Compiler

来源：评论

学校读者我要写书评

暂无评论

3DGCformer: 3-Dimensional Graph Convolutional transformer for multi-step origin–destination matrix forecasting

引用

Applied Intelligence 2025年第6期55卷 1-18页

作者： Huang, Yiou Deng, Hao Zhao, Shengjie School of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

Forecasting Human mobility is of great significance in the simulation and control of infectious diseases like COVID-19. To get a clear picture of potential future outbreaks, it is necessary to forecast multi-step Origin–Destination (OD) matrices for a relatively long period in the future. However, multi-step Origin–Destination Matrix Forecasting (ODMF) is a non-trivial problem. First, previous ODMF models only forecast the OD matrix for the next time-step, and they cannot perform well on long-term multi-step forecasts due to error accumulation. Second, many ODMF methods capture spatial and temporal dependencies with separate modules, which is insufficient to model spatio-temporal correlations in the time-varying OD matrix sequence. To address the challenges in multi-step ODMF, we propose 3-Dimensional Graph Convolutional Transformer (3DGCformer). As an enhancement of the original 3DGCN, we propose a novel Origin–Destination Feature Propagation (ODFP) rule between 3DGCN layers and integrate 2 3DGCNs with different spatio-temporal graphs and corresponding feature propagation rules to model the formation of OD flows in a more comprehensive way. For multi-step forecasts, 3DGCformer uses Transformer to capture long-term global temporal dependency, and adapt its decoder using labeled tokens to avoid error accumulation and improve time efficiency. To avoid information loss as the number of regions increases, we propose a patch embedding approach to convert data from 3DGCNs to the Transformer module. We perform extensive experiments on 4 real-world human mobility datasets, and the results show that our proposed model outperforms the state-of-the-art methods. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2025.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Subnetwork-based federated few-shot semantic segmentation of organ images

引用

Optoelectronics Letters 2025年

作者： Wu Junpeng Zhao Meng Zhang Huanping Key Laboratory of Computer Vision and System of Ministry of Education， School of Computer Science and Engineering， Tianjin University of Technology

Federated learning(FL)， as a distributed learning paradigm， allows multiple medical institutions to collaborate on learning without the need to centralize all client data. However， existing methods pay little attention to more challenging medical image semantic segmentation tasks， especially in the scenario of the imbalanced dataset in federated few-shot learning. In this paper， we propose a subnetwork-based federated few-shot organ image segmentation method. Firstly， individual clients train using local training samples and then upload local model gradients to the server. The server utilizes their respective local model gradients to update the subnetwork maintained on the server and generate aggregation weights for forming personalized model parameters. Through this method， we can learn the similarities between different clients to address data heterogeneity issues. In addition， to enhance the communication efficiency between clients and the server， we have also designed a personalized layer aggregation strategy， which only transmits partial layer model parameters during the communication process to improve communication efficiency. Finally， we conducted experiments on ABD-MRI and ABD-CT datasets to demonstrate the effectiveness of our method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Review on Binary Code Analysis Datasets 18th

A Review on Binary Code Analysis Datasets

引用

18th International Conference on Wireless Artificial Intelligent Computing systems and Applications, WASA 2024

作者： Huang, Zhijian Song, Shuguang Liu, Han Kuang, Hongyu Zhang, Jingjing Hu, Pengfei National Key Laboratory of Science and Technology on Information System Security Systems Engineering Institute Academy of Military Sciences Beijing China School of Computer Science and Technology Shandong University Qingdao China

ISBN: (纸本)9783031714696

Binary code analysis serves as the foundation for research in vulnerability discovery, software protection, and malicious code analysis. However, analyzing binary files is challenging due to the lack of high-level semantic information, leading to heavy dependence on analysts’ expertise and significantly impacting the efficiency of binary code analysis. Recent years has witnessed the blossom of machine learning models for binary analysis, but few researches address the problem of binary code datasets. In this paper, we review all the existing and available datasets, and make classification according to their application. We set up experiments to illustrate how dataset quality could affect the performance of machine learning models in binary function recognition. Based on the experimental evaluation, we present a discussion on the ground truth as well as quality evaluation problems for binary code datasets. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Multi-level Multi-task representation learning with adaptive fusion for multimodal sentiment analysis

引用

Neural Computing and Applications 2025年第3期37卷 1491-1508页

作者： Zhu, Chuanbo Chen, Min Li, Haomin Zhang, Sheng Liang, Han Sun, Chao Liu, Yifan Chen, Jincai Wuhan National Laboratory for Optoelectronics Huazhong University of Science and Technology Hubei Wuhan430074 China School of Computer Science and Engineering South China University of Technology Guangdong Guangzhou510641 China Pazhou Laboratory Guangdong Guangzhou510640 China School of Computer Science and Technology Huazhong University of Science and Technology Hubei Wuhan430074 China Key Laboratory of Information Storage System Ministry of Education of China Hubei Wuhan430074 China

Multimodal sentiment analysis is an active task in multimodal intelligence, which aims to compute the user’s sentiment tendency from multimedia data. Generally, each modality is a specific and necessary perspective to express human sentiment, providing complementary and consensus information unavailable in a single modality. Nevertheless, the heterogeneous multimedia data often contain inconsistent and conflicting sentiment semantics that limits the model performance. In this work, we propose a Multi-level Multi-task Representation Learning with Adaptive Fusion (MuReLAF) network to bridge the semantic gap among different modalities. Specifically, we design a modality adaptive fusion block to adjust modality contributions dynamically. Besides, we build a multi-level multimodal representations framework to obtain modality-specific and modality-shared semantics by the multi-task learning strategy, where modality-specific semantics contain complementary information and modality-shared semantics include consensus information. Extensive experiments are conducted on four publicly available datasets: MOSI, MOSEI, SIMS, and SIMSV2(s), demonstrating that our model exhibits superior or comparable performance to state-of-the-art models. The achieved accuracies are 86.28%, 86.07%, 84.46%, and 82.78%, respectively, showcasing improvements of 0.82%, 0.84%, 1.75%, and 1.83%. Further analyses also indicate the effectiveness of our model in sentiment analysis. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Multi-task learning

来源：评论

学校读者我要写书评

暂无评论

MeHyper: Accelerating Hypergraph Neural Networks by Exploring Implicit Dataflows 31

MeHyper: Accelerating Hypergraph Neural Networks by Explorin...

引用

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

作者： Zhao, Wenju Yao, Pengcheng Chen, Dan Zheng, Long Liao, Xiaofei Wang, Qinggang Ma, Shaobo Li, Yu Liu, Haifeng Xiao, Wenjing Sun, Yufei Zhu, Bing Jin, Hai Xue, Jingling 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 Guangxi University School of Computer Electronics and Information NanNing530004 China University of New South Wales School of Computer Science and Engineering SydneyNSW2052 Australia

ISBN: (纸本)9798331506476

Hypergraph Neural Networks (HGNNs) are increasingly utilized to analyze complex inter-entity relationships. Traditional HGNN systems, based on a hyperedge-centric dataflow model, independently process aggregation tasks for hyperedges and vertices, leading to significant computational redundancy. This redundancy arises from recalculating shared information across different tasks. For the first time, we identify and harness implicit dataflows (i.e., dependencies) within HGNNs, introducing the microedge concept to effectively capture and reuse intricate shared information among aggregation tasks, thereby minimizing redundant computations. We have developed a new microedge-centric dataflow model that processes shared information as fine-grained microedge aggregation tasks. This dataflow model is supported by the Read-Process-Activate-Generate execution model, which aims to optimize parallelism among these tasks. Furthermore, our newly developed MeHyper, a microedge-centric HGNN accelerator, incorporates a decoupled pipeline for improved computational parallelism and a hierarchical feature management strategy to reduce off-chip memory accesses for large volumes of intermediate feature vectors generated. Our evaluation demonstrates that MeHyper substantially outperforms the leading CPUbased system PyG-CPU and the GPU-based system HyperGef, delivering performance improvements of 1,032.23 × and 10.51 ×, and energy efficiencies of 1,169.03 × and 9.96 ×, respectively. © 2025 IEEE.

关键词： Redundancy

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multiobjective Optimization for Traveling Salesman Problem: A Deep Reinforcement Learning Algorithm via Transfer Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第4期6卷 896-908页

作者： Gao, Le-Yang Wang, Rui Jia, Zhao-Hong Liu, Chuang Anhui University School of Computer Science and Technology Hefei230039 China National University of Defense Technology College of System Engineering Changsha410073 China Xiangjiang Laboratory Changsha410205 China Anhui University School of Internet Hefei230039 China

A wide range of real applications can be modelled as the multiobjective traveling salesman problem (MOTSP), one of typical combinatorial optimization problems. Meta-heuristics can be used to address MOTSP. However, due to involving iteratively searching large solution space, they often entail significant computation time. Recently, deep reinforcement learning (DRL) algorithms have been employed in generating approximate optimal solutions to the single objective traveling salesman problems, as well as MOTSPs. This study proposes a multiobjective optimization algorithm based on DRL, called multiobjective pointer network (MOPN), where the input structure of the pointer network is redesigned to be applied to MOTSP. Furthermore, a training strategy utilizing a representative model and transfer learning is introduced to enhance the performance of MOPN. The proposed MOPN is insensitive to problem scale, meaning that a trained MOPN can address MOTSPs with different scales. Compared to meta-heuristics, MOPN takes much less time on forward propagation to obtain the pareto front. To verify the performance of our model, extensive experiments are conducted on three different MOTSPs to compare the MOPN with two state-of-the-art DRL models and two multiobjective meta-heuristics. Experimental results demonstrate that the proposed MOPN obtains the best solution with the least training time among all the compared DRL methods. © 2024 IEEE.

关键词： Traveling salesman problem

来源：评论

学校读者我要写书评

暂无评论

Handwritten W-Net for High-Frequency Guided Single-Image Super-Resolution

引用

IEEE Access 2025年 13卷 73124-73134页

作者： Yang, Xiang Fang, Chen Xie, Xiaolan Dong, Minggang Guilin University of Technology College of Computer Science and Engineering Guangxi Guilin541004 China Guilin University of Technology Guangxi Key Laboratory of Embedded Technology and Intelligent System Guangxi Guilin541004 China Guilin University of Technology College of Physics and Electronic Information Engineering Guangxi Guilin541004 China

Super-resolution (SR) imaging involves converting low-resolution images into corresponding high-resolution data in specific scenarios. Recent advances in intelligent image reconstruction algorithms have been accompanied by impressive visual outcomes in SR generative adversarial networks (GANs). However, existing research has methodological limitations owing to the constraints posed by the model architecture and loss guidance used for optimization. Consequently, unnatural artifacts often appear in the complex backgrounds of images, leading to unappealing visual results. To address these problems, we propose an enhanced U-Net, called the handwritten W-Net (HW-Net) architecture, as well as a loss function that uses high-frequency components for guidance. The former improves the best approximate representation of image regions, whereas the latter guides the generation of SR images with more detailed features. We experimentally implemented a biased strategy called parameter transfer, which is suitable for hybrid parameter models. This approach facilitates the blending of weight parameters between similar but different models, significantly improving the peak signal-to-noise ratio and structural similarity index measure metrics without sacrificing the learned perceptual image patch similarity. Across nine SR benchmark datasets, the proposed combinations, with and without parameter transfer, demonstrated excellent performance across multiple evaluation metrics, surpassing the state-of-the-art SRGAN. © 2013 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

PPDO:a privacy-preservation-aware delay optimization task-offloading algorithm for collaborative edge computing

引用

Frontiers of Information Technology & Electronic engineering 2025年第1期26卷 27-41页

作者： Chao JING Jianwu XU College of Computer Science and Engineering Guilin University of TechnologyGuilin 541004China Guangxi Key Laboratory of Embedded Technology and Intelligent System Guilin 541004China

Although collaborative edge computing(CEC)systems are beneficial in enhancing the performance of mobile edge computing(MEC),the issue of user privacy leakage becomes prominent during task *** address this issue,we design a privacy-preservation-aware delay optimization task-offloading algorithm(PPDO)in a CEC *** considering location and usage pattern privacy protection,we establish a privacy task model to interfere with the edge server and ensure user *** address the extra delay arising from privacy protection,we subsequently leverage a Markov decision processing(MDP)policy-iteration-based algorithm to minimize delays without compromising *** simultaneously accelerate the MDP operation,we develop an extension that improves the PPDO by optimizing the action ***,a comprehensive simulation was conducted using the edge user allocation(EUA)*** results demonstrated that PPDO achieves an optimal trade-off between privacy protection and delay with a minimum delay compared with existing ***,we examined the advantages and disadvantages of improving PPDO.

关键词： Collaborative edge computing Task offloading Privacy protection Markov decision process

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：