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

Proceedings of the 60th Annual ACM/IEEE Design Automation Conference

作者： Zihan Jiang Fubing Mao Yapu Guo Xu Liu Haikun Liu Xiaofei Liao Hai Jin Wei Zhang 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 Wuhan China Department of Electronic and Computer Engineering HKUST Hong Kong

ISBN: (纸本)9798350323481

Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of processing vertices influenced by updates. To address this issue, we propose ACGraph, a novel streaming graph processing approach for monotonic graph algorithms. It maintains dependence trees during runtime, and makes affected vertices processed in a top-to-bottom order in the hierarchy of the dependence trees, thus normalizing the state propagation order and coalescing of multiple propagation to the same vertices. Experimental results show that ACGraph reduces the number of updates by 50% on average, and achieves the speedup of 1.75~7.43× over state-of-the-art systems.

关键词： graph processing

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks for Vulnerability Detection: A Counterfactual Explanation

arXiv

引用

arXiv 2024年

作者： Chu, Zhaoyang Wan, Yao Li, Qian Wu, Yang Zhang, Hongyu Sui, Yulei Xu, Guandong Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology China School of Electrical Engineering Computing and Mathematical Sciences Curtin University Australia School of Big Data and Software Engineering Chongqing University China School of Computer Science and Engineering University of New South Wales Australia School of Computer Science University of Technology Sydney Australia National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

Vulnerability detection is crucial for ensuring the security and reliability of software systems. Recently, Graph Neural Networks (GNNs) have emerged as a prominent code embedding approach for vulnerability detection, owing to their ability to capture the underlying semantic structure of source code. However, GNNs face significant challenges in explainability due to their inherently black-box nature. To this end, several factual reasoning-based explainers have been proposed. These explainers provide explanations for the predictions made by GNNs by analyzing the key features that contribute to the outcomes. We argue that these factual reasoning-based explanations cannot answer critical what-if questions: "What would happen to the GNN's decision if we were to alter the code graph into alternative structures?" Inspired by advancements of counterfactual reasoning in artificial intelligence, we propose CFExplainer, a novel counterfactual explainer for GNN-based vulnerability detection. Unlike factual reasoning-based explainers, CFExplainer seeks the minimal perturbation to the input code graph that leads to a change in the prediction, thereby addressing the what-if questions for vulnerability detection. We term this perturbation a counterfactual explanation, which can pinpoint the root causes of the detected vulnerability and furnish valuable insights for developers to undertake appropriate actions for fixing the vulnerability. Extensive experiments on four GNN-based vulnerability detection models demonstrate the effectiveness of CFExplainer over existing state-of-the-art factual reasoning-based explainers. © 2024, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Parallel fault diagnosis using hierarchical fuzzy Petri net by reversible and dynamic decomposition mechanism

引用

Frontiers of Information technology & Electronic Engineering 2025年第1期26卷 93-108页

作者： Yinhong XIANG Kaiqing ZHOU Arezoo SARKHEYLI-HÄGELE Yusliza YUSOFF Diwen KANG Azlan Mohd ZAIN School of Communication and Electronics Engineering Jishou UniversityJishou 416000China Internet of Things and People Research Center Department of Computer Science and Media TechnologyMalmöUniversityMalmö20506Sweden Faculty of Computing Universiti Teknologi MalaysiaSkudai 81310Malaysia

The state space explosion,a challenge analogous to that encountered in a Petri net(PN),has constrained the extensivestudy of fuzzy Petri nets(FPNs).Current reasoning algorithms employing FPNs,which operate through forward,backward,andbidirectional mechanisms,are *** algorithms streamline the inference process by eliminating irrelevant componentsof the ***,as the scale of the FPN grows,the complexity of these algorithms escalates sharply,posing a significantchallenge for practical *** address the state explosion issue,this work introduces a parallel bidirectional reasoningalgorithm for an FPN that utilizes reverse and decomposition strategies to optimize the implementation *** algorithminvolves hierarchically dividing a large-scale FPN into two sub-FPNs,followed by a converse operation to generate the reversalsub-FPN for the *** detailed mapping between the original and reversed FPNs is thoroughly *** operations are then conducted on the left-sub-FPN and the resulting reversal right-sub-FPN,with the final resultderived by computing the Euclidean distance between the outcomes from the output places of the two sub-FPNs.A case study ispresented to illustrate the implementation process,demonstrating the algorithm’s significant enhancement of inference efficiencyand substantial reduction in execution time.

关键词： Fuzzy Petri net(FPN) State explosion Decomposition Parallel Bidirectional reasoning

来源：评论

学校读者我要写书评

暂无评论

On the Outage of Far-Reach Communications via RIS-Empowered Satellites

On the Outage of Far-Reach Communications via RIS-Empowered ...

引用

2024 IEEE Pacific Rim Conference on Communications, computers and Signal Processing, PACRIM 2024

作者： Wang, Fan Jiang, Ruihong Liu, Yuan Bao, Tingnan Peng, Mugen Beijing University of Posts and Telecommunications State Key Laboratory of Networking and Switching Technology Beijing100876 China Research Center for Space Computing System Zhejiang Laboratory Hangzhou311100 China School of Electrical Engineering and Computer Science University of Ottawa OttawaON Canada

ISBN: (纸本)9798350362312

The rising demand for reliable, high-bandwidth satellite communications in far-reach areas drives the integration of low earth orbit (LEO) satellites into future 6G networks. In this paper, we investigate the deployment of reconfigurable intelligent surface (RIS) technology and rate splitting multiple access (RSMA) within LEO satellite systems to improve communication quality and system capacity. We derive closed-form expressions for outage probability (OP) and reliable throughput that validate the theoretical advantages of these technologies under various signal-to-noise ratio conditions. Numerical results demonstrate that, compared with traditional space division multiple access (SDMA) and non-orthogonal multiple access (NOMA) approaches, our RSMA and RIS-integrated framework significantly can reduce OP and enhance reliable throughput with an appropriate power-splitting factor, showcasing its superiority in RIS-enabled satellite communication scenarios. © 2024 IEEE.

关键词： Satellite communication systems

来源：评论

学校读者我要写书评

暂无评论

DarkSAM: fooling segment anything model to segment nothing 24

DarkSAM: fooling segment anything model to segment nothing

引用

Proceedings of the 38th International Conference on Neural Information Processing Systems

作者： Ziqi Zhou Yufei Song Minghui Li Shengshan Hu Xianlong Wang Leo Yu Zhang Dezhong Yao Hai Jin National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Cluster and Grid Computing Lab and School of Computer Science and Technology Huazhong University of Science and Technology School of Cyber Science and Engineering Huazhong University of Science and Technology School of Software Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System and Services Computing Technology and System Lab and Hubei Engineering Research Center on Big Data Security and Hubei Key Laboratory of Distributed System Security and School of Cyber Science and Engineering Huazhong University of Science and Technology School of Information and Communication Technology Griffith University

ISBN: (纸本)9798331314385

Segment Anything Model (SAM) has recently gained much attention for its outstanding generalization to unseen data and tasks. Despite its promising prospect, the vulnerabilities of SAM, especially to universal adversarial perturbation (UAP) have not been thoroughly investigated yet. In this paper, we propose DarkSAM, the first prompt-free universal attack framework against SAM, including a semantic decoupling-based spatial attack and a texture distortion-based frequency attack. We first divide the output of SAM into foreground and background. Then, we design a shadow target strategy to obtain the semantic blueprint of the image as the attack target. DarkSAM is dedicated to fooling SAM by extracting and destroying crucial object features from images in both spatial and frequency domains. In the spatial domain, we disrupt the semantics of both the foreground and background in the image to confuse SAM. In the frequency domain, we further enhance the attack effectiveness by distorting the high-frequency components (i.e., texture information) of the image. Consequently, with a single UAP, DarkSAM renders SAM incapable of segmenting objects across diverse images with varying prompts. Experimental results on four datasets for SAM and its two variant models demonstrate the powerful attack capability and transferability of DarkSAM. Our codes are available at: https://***/CGCL-codes/DarkSAM.

关键词：

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

How to Select Pre-Trained Code Models for Reuse? A Learning ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhangqian Bi Yao Wan Zhaoyang Chu Yufei Hu Junyi Zhang Hongyu Zhang Guandong Xu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is compu-tationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks.

关键词： Phase change materials Analytical models Adaptation models Codes Costs Computational modeling Training data Machine learning Software Software development management

来源：评论

学校读者我要写书评

暂无评论

HYPERBOLIC HYPERGRAPH NEURAL NETWORKS FOR MULTI-RELATIONAL KNOWLEDGE HYPERGRAPH REPRESENTATION

arXiv

引用

arXiv 2024年

作者： Li, Mengfan Shi, Xuanhua Qiao, Chenqi Zhang, Teng Jin, Hai 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 Wuhan430074 China

Knowledge hypergraphs generalize knowledge graphs using hyperedges to connect multiple entities and depict complicated relations. Existing methods either transform hyperedges into an easier-to-handle set of binary relations or view hyperedges as isolated and ignore their adjacencies. Both approaches have information loss and may potentially lead to the creation of sub-optimal models. To fix these issues, we propose the Hyperbolic Hypergraph Neural Network (H2GNN), whose essential component is the hyper-star message passing, a novel scheme motivated by a lossless expansion of hyperedges into hierarchies. It implements a direct embedding that consciously incorporates adjacent entities, hyper-relations, and entity position-aware information. As the name suggests, H2GNN operates in the hyperbolic space, which is more adept at capturing the tree-like hierarchy. We compare H2GNN with 15 baselines on knowledge hypergraphs, and it outperforms state-of-the-art approaches in both node classification and link prediction tasks. Copyright © 2024, The Authors. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

An improved reconfigurable logic in resistive random access memory

引用

Integration 2022年 87卷 169-175页

作者： Zhao, Yi Chen, Hui Liu, Peng Wu, Jigang Luo, Dongxiang The Center for High Performance Computing and Data Science School of Computer Science and Technology Guangdong University of Technology Guangdong510006 China School of Chemistry and Chemical Engineering/Institute of Clean Energy and Materials/Guangzhou Key Laboratory for Clean Energy and Materials/Huangpu Hydrogen Innovation Center Guangzhou University Guangzhou510006 China Institute of Semiconductors South China Normal University Guangzhou510631 China

Emerging non-volatile devices have shown great potential in computing in-memory (CIM). This work proposes a logic design method based on the complementary resistance switching (CRS) structure, which is connected by two anti-serially memristors. Three logics including AND, OR, and NIMP can be implemented in one step. Moreover, XOR logic can be implemented in two steps. Based on the proposed design, a 1-bit full adder is implemented with the fewer number of memristors and operation steps compared with existing works. The feasibility and correctness of our design are verified by the SPICE simulations with the Voltage Threshold Adaptive Memristor (VTEAM) model. In addition, we evaluate the ISCAS’85 benchmark circuit based on the proposed logic. Compared with existing methods, the performance and area overhead have been improved by the proposed method. © 2022 Elsevier B.V.

关键词： Memristors

来源：评论

学校读者我要写书评

暂无评论

Self-Supervised Video Representation Learning with Motion-Contrastive Perception

Self-Supervised Video Representation Learning with Motion-Co...

引用

2022 IEEE International Conference on Multimedia and Expo, ICME 2022

作者： Liu, Jinyu Cheng, Ying Zhang, Yuejie Zhao, Rui-Wei Feng, Rui School of Computer Science Shanghai Collaborative Innovation Center of Intelligent Visual Computing Fudan University China Academy for Engineering and Technology Fudan University China

ISBN: (数字)9781665485630

ISBN: (纸本)9781665485630

Visual-only self-supervised learning has achieved significant improvement in video representation learning. Existing related methods encourage models to learn video representations by utilizing contrastive learning or designing specific pretext tasks. However, some models are likely to focus on the background, which is unimportant for learning video representations. To alleviate this problem, we propose a new view called long-range residual frame to obtain more motion-specific information. Based on this, we propose the Motion-Contrastive Perception Network (MCPNet), which consists of two branches, namely, Motion Information Perception (MIP) and Contrastive Instance Perception (CIP), to learn generic video representations by focusing on the changing areas in videos. Specifically, the MIP branch aims to learn fine-grained motion features, and the CIP branch performs contrastive learning to learn overall semantics information for each instance. Experiments on two benchmark datasets UCF-101 and HMDB-51 show that our method outperforms current state-of-the-art visual-only self-supervised approaches. © 2022 IEEE.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：