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

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Contextual Dual Learning Algorithm with Listwise Distillation for Unbiased Learning to Rank

arXiv

引用

arXiv 2024年

作者： Yu, Lulu Bi, Keping Ni, Shiyu Guo, Jiafeng CAS Key Lab of Network Data Science and Technology ICT CAS China University of Chinese Academy of Sciences Beijing China

Unbiased Learning to Rank (ULTR) aims to leverage biased implicit user feedback (e.g., click) to optimize an unbiased ranking model. The effectiveness of the existing ULTR methods has primarily been validated on synthetic datasets. However, their performance on real-world click data remains unclear. Recently, Baidu released a large publicly available dataset of their web search logs. Subsequently, the NTCIR-17 ULTRE-2 task released a subset dataset extracted from it. We conduct experiments on commonly used or effective ULTR methods on this subset to determine whether they maintain their effectiveness. In this paper, we propose a Contextual Dual Learning Algorithm with Listwise Distillation (CDLA-LD) to simultaneously address both position bias and contextual bias. We utilize a listwise-input ranking model to obtain reconstructed feature vectors incorporating local contextual information and employ the Dual Learning Algorithm (DLA) method to jointly train this ranking model and a propensity model to address position bias. As this ranking model learns the interaction information within the documents list of the training set, to enhance the ranking model’s generalization ability, we additionally train a pointwise-input ranking model to learn the listwise-input ranking model’s capability for relevance judgment in a listwise manner. Extensive experiments and analysis confirm the effectiveness of our approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

FL-GNN: Efficient Fusion of Fuzzy Neural network and Graph Neural network 27

FL-GNN: Efficient Fusion of Fuzzy Neural Network and Graph N...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Du, Boyu Zhou, Jingya Liu, Ling She, Xiaolong School of Computer Science and Technology Soochow University China Engineering Lab.of Big Data and Intelligence of Jiangsu Province Soochow University China State Key Lab.for Novel Software Technology Nanjing University China School of Computer Science Georgia Institute of Technology United States

ISBN: (纸本)9781643685489

Graph Neural networks (GNNs) have become an important graph feature learning paradigm that is extensively applied to graph inference ***, GNNs still have limitations in some aspects such as representation capability, interpretability, *** this end, this paper introduces a novel hybrid Fuzzy-Logic Graph Neural network (FL-GNN) that synergistically combines Fuzzy Neural network (FNN) and GNN to effectively capture and aggregate local information flows within the ***-GNN exhibits three distinctive ***, we incorporate a specialized structure fuzzy rule to enhance FL-GNN's graph inference capability, surpassing representative GNN ***, we augment the interpretability of FL-GNN by integrating analytical exploration methods from two perspectives: Fuzzy Inference System and Message Passing Algorithm (MPA).Lastly, we refine the structure of FL-GNN based on MPA to optimize its calculation complexity and consequently improve learning *** results show that FL-GNN outperforms existing representative graph neural networks for graph inference tasks. © 2024 The Authors.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerators 31

GoPIM: GCN-Oriented Pipeline Optimization for PIM Accelerato...

引用

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

作者： Yang, Siling He, Shuibing Wang, Wenjiong Yin, Yanlong Wu, Tong Chen, Weijian Zhang, Xuechen Sun, Xian-He Feng, Dan The State Key Laboratory of Blockchain and Data Security Zhejiang University China Zhejiang Lab China Institute of Blockchain and Data Security China Zhejiang Key Laboratory of Big Data Intelligent Computing China Washington State University Vancouver United States Illinois Institute of Technology United States Huazhong University of Science and Technology China Wuhan National Laboratory for Optoelectronics China

ISBN: (纸本)9798331506476

Graph convolutional networks (GCNs) are popular for a variety of graph learning tasks. ReRAM-based processing-in-memory (PIM) accelerators are promising to expedite GCN training owing to their in-situ computing capability. However, existing accelerators can be severely underutilized even with pipelines, due to the oversight of the skewed execution times of various GCN stages and the ignorance of skewed degrees of graph vertices. In this work, we propose GOPIM, a GCN-oriented pipeline optimization for PIM accelerators to expedite GCN training. First, GOPIM proposes an ML-based scheme that allocates crossbar resources to the most needed stages to streamline the overall pipeline. Second, GOPIM utilizes a selective vertex updating technique that evenly distributes vertices on crossbars by interleaved mapping. These techniques collectively reduce the overall execution time without losing much accuracy. We also provide a practical architecture design for GOPIM. Our experimental results show that, GoPIM achieves up to 191 × speedup and 16.1 × energy saving, compared to the state-of-the-art work. © 2025 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MedX-Net: Hierarchical Transformer with Large Kernel Convolutions for 3D Medical Image Segmentation

MedX-Net: Hierarchical Transformer with Large Kernel Convolu...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Lu, Lin Zou, Qingzhi Key Laboratory of Computing Power Network and Information Se-curity Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9781665410205

Due to the exceptional performance of Transform-ers in 2D medical image segmentation, recent work has also introduced them into 3D medical segmentation tasks. For instance, Swin UNETR and other hierarchical Transformers have reintroduced prior knowledge from several convolutional networks, further enhancing the volume segmentation capabilities of models. The efficacy of these hybrid methodologies is primarily attributed to the substantial quantity of parameters and the nonlocal self-attention mechanism with a large receptive field. We argue that the behavior of these methods' large receptive fields can be simulated by employing fewer parameters through the utilization of depth-wise convolutions with large kernel. Within this manuscript, we introduce a lightweight volume segmentation model called MedX-Net, which uses convolutional network modules to simulate hierarchical Transformers for robust volume segmentation. Firstly, inspired by the hierarchical Transformer module of Swin UNETR, we investigate large-kernel depth-wise convolutions with different sizes to achieve a reduced model parameter count while maintaining a large global receptive field. Secondly, we replace the multilayer perceptron (MLP) in the hierarchical Transformer module with Inverted Bottleneck with Depthwise Convolution Enhancement(DWCE) to improve model performance with fewer activation and normalization layers, further reducing the parameter count. We validate the effectiveness and efficiency of our model for volume segmentation on three public datasets: Synapse, BTCV and ACDC. On the Synapse dataset, compared to Swin UNETR, our model achieves an improvement from 83.48% to 87.21% in Dice score. Compared to the result of 86.57% achieved by nnFormer, our model achieves superior performance while reducing the model parameter count by 64%. © 2024 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Maximizing Area Coverage in Privacy-Preserving Worker Recruitment: A Prior Knowledge-Enhanced Geo-indistinguishable Approach

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5138-5151页

作者： Zhang, Pengfei Cheng, Xiang Zhang, Zhikun Zhu, Youwen Zhang, Ji Anhui University of Science and Technology State Key Laboratory of Digital Intelligent Technology for Unmanned Coal Mining the School of Computer Science and Engineering Anhui University of Science and Technology Huainan232001 China Yunnan University of Finance and Economics Yunnan Key Laboratory of Service Computing Yunnan 650221 China Key Laboratory of Equipment Data Security and Guarantee Technology Ministry of Education Key Laboratory of Computing Power Network and Information Security Ministry of Education China Beijing University of Posts and Telecommunications China Zhejiang University China Nanjing University of Aeronautics and Astronautics China University of Southern Queensland China

Worker recruitment for area coverage maximization, typically requires participants to upload location information, which can deter potential participation without proper protection. While existing studies resort to geo-indistinguishability to address this concern, they primarily focus on either specific task locations (Target Coverage) or operate under pre-defined recruitment quotas for an interested region (Area Coverage). These focuses not only yield suboptimal area coverage when scaled but also fail to leverage valuable prior knowledge in the form of participants’ noisy historical registered locations, to enhance both location obfuscation and worker identification processes. To address these limitations, we present WILTON, which optimizes area coverage under geo-indistinguishability by recruiting the minimum number of participants through the strategic utilization of noisy prior knowledge. In WILTON, to generate obfuscated locations, we propose a probabilistic and weight-aware input perturbation mechanism, which groups and weights prior locations rather than using only personal prior locations. To privately identify the recruited workers, we design a grid-based worker identification method, which provides a worst-case performance guarantee of ratio (Formula Presented) to the optimum. We provide a theoretical analysis of the privacy, utility, and complexity guarantees of WILTON. Experimental results over two real-world datasets and one synthetic dataset show that WILTON surpasses the state-of-the-arts by at least 8% in area coverage improvement. © 2005-2012 IEEE.

关键词： Knowledge acquisition

来源：评论

学校读者我要写书评

暂无评论

Broadband Optical Coupler based on the Helical Long-Period Gratings Inscribed in Seven-Core Fibers

引用

Journal of Lightwave technology 2025年第12期43卷 5820-5828页

作者： Chen, Siyu Jiang, Chen Ma, Yuehui Zhao, Yunhe Fan, Xiaolong Mou, Chengbo Liu, Yunqi Shanghai University Key Laboratory of Specialty Fiber Optics and Optical Access Networks Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai 200444 China Advanced Photonic Technology Lab Nanjing210023 China Shanghai Maritime University Institute of Logistics Science and Engineering Shanghai201306 China

We propose a broadband optical coupler based on cladding mode coupling of identical helical long-period gratings (HLPGs) inscribed in different cores of seven-core fibers (SCFs). The influence of the surrounding refractive index and offset distance between the input grating and tapping grating on the coupling efficiency of the coupler was investigated numerically and experimentally. A total peak coupling efficiency of 75.7% was achieved experimentally under the conditions of a surrounding refractive index of 1.454 and an offset distance of 90 mm when the light is launched into the center core of the SCF. The proposed optical coupler could have promising applications in multi-core fiber amplifiers and space-division multiplexing optical communications. © 1983-2012 IEEE.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

Knowledge-Enhanced Self-Supervised Prototypical network for Few-Shot Event Detection

Knowledge-Enhanced Self-Supervised Prototypical Network for ...

引用

2022 Findings of the Association for Computational Linguistics: EMNLP 2022

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences School of Computer Science and Technology University of Chinese Academy of Sciences China

Prototypical network based joint methods have attracted much attention in few-shot event detection, which carry out event detection in a unified sequence tagging framework. However, these methods suffer from the inaccurate prototype representation problem, due to two main reasons: the number of instances for calculating prototypes is limited;And, they do not well capture the relationships among event prototypes. To deal with this problem, we propose a Knowledge-Enhanced self-supervised Prototypical network, called KE-PN, for few-shot event detection. KE-PN adopts hybrid rules, which can automatically align event types to an external knowledge base, i.e., FrameNet, to obtain more instances. It proposes a self-supervised learning method to filter out noisy data from enhanced instances. KE-PN is further equipped with an auxiliary event type relationship classification module, which injects the relationship information into representations of event prototypes. Extensive experiments on three benchmark datasets, i.e., FewEvent, MAVEN, and ACE2005 demonstrate the state-of-the-art performance of KE-PN. © 2022 Association for Computational Linguistics.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

DenoiseRep: Denoising Model for Representation Learning 38

DenoiseRep: Denoising Model for Representation Learning

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Xu, Zhengrui Wang, Guan'an Huang, Xiaowen Sang, Jitao School of Computer Science and Technology Beijing Jiaotong University China Beijing Key Lab of Traffic Data Analysis and Mining Beijing Jiaotong University China Ministry of Education China

The denoising model has been proven a powerful generative model but has little exploration of discriminative tasks. Representation learning is important in discriminative tasks, which is defined as "learning representations (or features) of the data that make it easier to extract useful information when building classifiers or other predictors" [4]. In this paper, we propose a novel Denoising Model for Representation Learning (DenoiseRep) to improve feature discrimination with joint feature extraction and denoising. DenoiseRep views each embedding layer in a backbone as a denoising layer, processing the cascaded embedding layers as if we are recursively denoise features step-by-step. This unifies the frameworks of feature extraction and denoising, where the former progressively embeds features from low-level to high-level, and the latter recursively denoises features step-by-step. After that, DenoiseRep fus es the parameters of feature extraction and denoising layers, and theoretically demonstrates its equivalence before and after the fusion, thus making feature denoising computation-free. DenoiseRep is a label-free algorithm that incrementally improves features but also complementary to the label if available. Experimental results on various discriminative vision tasks, including re-identification (Market-1501, DukeMTMC-reID, MSMT17, CUHK-03, vehicleID), image classification (ImageNet, UB200, Oxford-Pet, Flowers), object detection (COCO), image segmentation (ADE20K) show stability and impressive improvements. We also validate its effectiveness on the CNN (ResNet) and Transformer (ViT, Swin, Vmamda) architectures. Code is available at https://***/wangguanan/DenoiseRep. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

TrustRAG: An Information Assistant with Retrieval Augmented Generation

arXiv

引用

arXiv 2025年

作者： Fan, Yixing Yan, Qiang Wang, Wenshan Guo, Jiafeng Zhang, Ruqing Cheng, Xueqi Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

Retrieval-Augmented Generation (RAG) has emerged as a crucial technique for enhancing large models with real-time and domain-specific knowledge. While numerous improvements and open-source tools have been proposed to refine the RAG framework for accuracy, relatively little attention has been given to improving the trustworthiness of generated results. To address this gap, we introduce TrustRAG, a novel framework that enhances RAG from three perspectives: indexing, retrieval, and generation. Specifically, in the indexing stage, we propose a semantic-enhanced chunking strategy that incorporates hierarchical indexing to supplement each chunk with contextual information, ensuring semantic completeness. In the retrieval stage, we introduce a utility-based filtering mechanism to identify high-quality information, supporting answer generation while reducing input length. In the generation stage, we propose fine-grained citation enhancement, which detects opinion-bearing sentences in responses and infers citation relationships at the sentence-level, thereby improving citation accuracy. We open-source the TrustRAG framework and provide a demonstration studio designed for excerpt-based question answering tasks 1. Based on these, we aim to help researchers: 1) systematically enhancing the trustworthiness of RAG systems and (2) developing their own RAG systems with more reliable outputs. © 2025, CC BY.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：