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

Effective and Robust Detection of Adversarial Examples via Benford-Fourier Coefficients

Machine Intelligence Research 2023年第5期20卷 666-682页

作者： Cheng-Cheng Ma Bao-Yuan Wu Yan-Bo Fan Yong Zhang Zhi-Feng Li National Laboratory of Pattern Recognition Institute of AutomationChinese Academy of SciencesBeijing 100190China School of Artificial Intelligence University of Chinese Academy of SciencesBeijing 100049China School of Data Science The Chinese University of Hong KongShenzhen 518172China Shenzhen Research Institute of Big Data Shenzhen 518172China AI Lab Tencent Inc.Shenzhen 518057China

Adversarial example has been well known as a serious threat to deep neural networks(DNNs).In this work,we study the detection of adversarial examples based on the assumption that the output and internal responses of one DNN model for both adversarial and benign examples follow the generalized Gaussian distribution(GGD)but with different parameters(i.e.,shape factor,mean,and variance).GGD is a general distribution family that covers many popular distributions(e.g.,Laplacian,Gaussian,or uniform).Therefore,it is more likely to approximate the intrinsic distributions of internal responses than any specific ***,since the shape factor is more robust to different databases rather than the other two parameters,we propose to construct discriminative features via the shape factor for adversarial detection,employing the magnitude of Benford-Fourier(MBF)coefficients,which can be easily estimated using ***,a support vector machine is trained as an adversarial detector leveraging the MBF *** experiments in terms of image classification demonstrate that the proposed detector is much more effective and robust in detecting adversarial examples of different crafting methods and sources compared to state-of-the-art adversarial detection methods.

关键词： Adversarial defense adversarial detection generalized Gaussian distribution Benford-Fourier coefficients image classification

来源：评论

学校读者我要写书评

暂无评论

Filtering Influential Features for Adolescent Positive Mental Health 20

Filtering Influential Features for Adolescent Positive Menta...

引用

20th International Computer Conference on Wavelet Active Media Technology and Information Processing, ICCWAMTIP 2023

作者： Yi, Cao Shimin, Cai Tao, Zhou University of Electronic Science and Technology of China Complex Lab Chengdu611731 China Big Data Research Center University of Electronic Science and Technology of China Chengdu611731 China

ISBN: (纸本)9798350318982

Adolescents' positive mental health is deeply associated with their growth. Identifying the factors that contribute to the positive mental health of junior and senior high school students is crucial for supporting youth development in the long run. Leveraging questionnaire data, this paper utilizes machine learning algorithms and fusion methods for feature selection to examine the factors that influence the onset of adolescent positive mental health. The influential features are ranked by importance. Then, machine learning algorithms in a heuristic form are employed to assess the predictive power of the fused features. The best f1-score of the classifiers reaches 0.844. It illustrates the effectiveness of feature filtering and provides valuable references for educational administrators to potential interventions. © 2023 IEEE.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

A RECEPTIVE ENHANCED BASED MULTI-SCALE FEATURE FUSION NETWORK 18

A RECEPTIVE ENHANCED BASED MULTI-SCALE FEATURE FUSION NETWOR...

引用

18th International Conference on Interfaces and Human Computer Interaction 2024, IHCI 2024, the 17th International Conference on Game and Entertainment Technologies 2024, GET 2024 and the 18th International Conference on Computer Graphics, Visualization, Computer Vision and Image Processing 2024, CGVCVIP 2024, Part of the 18th Multi Conference on Computer science and Information Systems 2024, MCCSIS 2024

作者： Mao, Guojun Zhang, Xinchao Fujian Provincial Key Lab of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China School of Computer Science and Mathematics Fujian University of Technology Fuzhou350118 China

ISBN: (纸本)9789898704580

Camouflaged Object Detection (COD) aims to identify target objects with high similarity to the surrounding environment in complex scenes, and has high application value in military, medical and other fields. This paper proposes a Receptive enhanced based Multi-scale feature fusion network, termed as RMNet. Firstly, it uses the popular pyramid visual network PVTv2 for feature extraction. By overlaying the target area amplification module OAA and deep interaction guidance module DIDM on it, the position ability for camouflaged objects in complex scenes is improved;Secondly, design an enhanced receptive field module REM to enhance the edge perception ability of camouflaged objects;Finally, the feature fusion module MCFM are designed through cross scale hierarchical connections between adjacent levels, effectively improving the accuracy of camouflage object detection. The presented model is evaluated on three highly challenging benchmark datasets, including CAMO, CHAMELEON and COD10K. The evaluation results show that compared with the current popular methods, our method demonstrates superior performance. © 2024 Interfaces and Human Computer Interaction. All Rights Reserved.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

ICH-SCNet: Intracerebral Hemorrhage Segmentation and Prognosis Classification Network Using CLIP-guided SAM mechanism

ICH-SCNet: Intracerebral Hemorrhage Segmentation and Prognos...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Yu, Xinlei Elazab, Ahmed Ge, Ruiquan Jin, Hui Jiang, Xinchen Jia, Gangyong Wu, Qing Shi, Qinglei Wang, Changmiao Hangzhou Dianzi University School of Computer Science Hangzhou China Shenzhen University School of Biomedical Engineering Shenzhen China Chinese University of Hong Kong Shenzhen School of Management and Economics Shenzhen China Chinese University of Hong Kong Shenzhen School of Medicine Shenzhen China Shenzhen Research Institute of Big Data Medical Big Data Lab Shenzhen China

ISBN: (纸本)9798350386226

Intracerebral hemorrhage (ICH) is the most fatal subtype of stroke and is characterized by a high incidence of disability. Accurate segmentation of the ICH region and prognosis prediction are critically important for developing and refining treatment plans for post-ICH patients. However, existing approaches address these two tasks independently and predominantly focus on imaging data alone, thereby neglecting the intrinsic correlation between the tasks and modalities. This paper introduces a multi-task network, ICH-SCNet, designed for both ICH segmentation and prognosis classification. Specifically, we integrate a SAM-CLIP cross-modal interaction mechanism that combines medical text and segmentation auxiliary information with neuroimaging data to enhance cross-modal feature recognition. Additionally, we develop an effective feature fusion module and a multi-task loss function to improve performance further. Extensive experiments on an ICH dataset reveal that our approach surpasses other state-of-the-art methods. It excels in the overall performance of classification tasks and outperforms competing models in all segmentation task metrics. © 2024 IEEE.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Towards Redundancy-Free Recommendation Model Training via Reusable-aware Near-Memory Processing 24

Towards Redundancy-Free Recommendation Model Training via Re...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Liu, Haifeng Zheng, Long Huang, Yu Huang, Haoyan Liao, Xiaofei Hai, Jin 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 Zhejiang Lab Hangzhou311121 China

ISBN: (纸本)9798400706011

The memory-intensive embedding layer in recommendation model continues to be the performance bottleneck. While prior works have attempted to improve the embedding layer performance by exploiting the data locality to cache the frequently accessed embedding vectors and their partial sums. However, these solutions rely on the static cache, which is inapplicable in the embedding training scenario where the embedding vectors are updated frequently. To this end, this paper proposes ReFree, a redundancy-free near-memory processing (NMP) solution for recommendation model training. Specifically, ReFree identifies the reusable data in realtime for both embedding layer forward and backward stages and leverages a lightweight NMP architecture to enable redundancy-free near-memory acceleration of the entire embedding training process. Evaluation results on real-world datasets show that ReFree outperforms the state-of-the-art solutions by 10.9× and reduces 5.3× energy consumption on average. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

How Graph Neural Networks Learn: Lessons from Training Dynamics 41

How Graph Neural Networks Learn: Lessons from Training Dynam...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Yang, Chenxiao Wu, Qitian Wipf, David Sun, Ruoyu Yan, Junchi School of Artificial Intelligence Department of Computer Science and Engineering MoE Lab of AI Shanghai Jiao Tong University China Amazon Web Services United States School of Data Science The Chinese University of Hong Kong Shenzhen China Shenzhen International Center for Industrial and Applied Mathematics Shenzhen Research Institute of Big Data China

A long-standing goal in deep learning has been to characterize the learning behavior of black-box models in a more interpretable manner. For graph neural networks (GNNs), considerable advances have been made in formalizing what functions they can represent, but whether GNNs will learn desired functions during the optimization process remains less clear. To fill this gap, we study their training dynamics in function space. In particular, we find that the gradient descent optimization of GNNs implicitly leverages the graph structure to update the learned function, as can be quantified by a phenomenon which we call kernel-graph alignment. We provide theoretical explanations for the emergence of this phenomenon in the overparameterized regime and empirically validate it on real-world GNNs. This finding offers new interpretable insights into when and why the learned GNN functions generalize, highlighting their limitations in heterophilic graphs. Practically, we propose a parameter-free algorithm that directly uses a sparse matrix (i.e. graph adjacency) to update the learned function. We demonstrate that this embarrassingly simple approach can be as effective as GNNs while being orders-of-magnitude faster. Copyright 2024 by the author(s)

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

SpaHet: A Software/Hardware Co-design for Accelerating Heterogeneous-Sparsity based Sparse Matrix Multiplication 24

SpaHet: A Software/Hardware Co-design for Accelerating Heter...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Huang, Haoqin Yao, Pengcheng An, Zhaozeng Sun, Yufei Hu, Ao Xu, Peng Zheng, Long Liao, Xiaofei Jin, Hai 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 Zhejiang Lab Hangzhou311121 China

ISBN: (纸本)9798400706011

Sparse general matrix-matrix multiplication is widely used in data mining applications. Its irregular memory access patterns limit the performance of general-purpose processors, thus motivating many FPGA-based hardware innovations in recent years. Nevertheless, existing accelerators fail to efficiently support heterogeneous input matrix sparsity, which is universal in various real-world applications. With in-depth experimental analysis, we observe that their performance is bottlenecked by their fixed tiling mechanisms, which only alleviate the irregularity of one input matrix. Based on the observation, we propose SpaHet, a software/hardware co-design to accelerate heterogeneous-sparsity based sparse matrix multiplication. SpaHet adopts a dual-adaptive sliding window mechanism to cover the reuse characteristics of both input matrices simultaneously. With a specialized exploration algorithm, the window-based mechanism can automatically find the optimal tiling strategy instead of applying a fixed one based on empirical experience. A sparsity-aware merge tree is also proposed to maximize the output matrix reuse via accumulating intermediate results thoroughly. Our results on a Xilinx Alveo U280 accelerator card show that SpaHet outperforms state-of-the-art CPU-, GPU- and FPGA-based solutions by 7.71×, 1.1×, and 2.74× in performance, respectively. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchronous Graph Neural Network 24

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchrono...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Yu, Hui Zhang, Yu He, Ligang He, Donghao Li, Qikun Zhao, Jin Liao, Xiaofei Jin, Hai Gu, Lin Liu, Haikun 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 Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798400706011

Asynchronous Graph Neural Network (AGNN) has attracted much research attention because it enables faster convergence speed than the synchronous GNN. However, existing software/hardware solutions suffer from redundant computation overhead and excessive off-chip communications for AGNN due to irregular state propagations along the dependency chains between vertices. This paper proposes a chain-driven asynchronous accelerator, CDA-GNN, for efficient AGNN inference. Specifically, CDA-GNN proposes a chain-driven asynchronous execution approach into novel accelerator design to regularize the vertex state propagations for fewer redundant computations and off-chip communications and also designs a chain-aware data caching method to improve data locality for AGNN. We have implemented and evaluated CDA-GNN on a Xilinx Alveo U280 FPGA card. Compared with the cutting-edge software solutions (i.e., Dorylus and AMP) and hardware solutions (i.e., BlockGNN and FlowGNN), CDA-GNN improves the performance of AGNN inference by an average of 1,173x, 182.4x, 10.2x, and 7.9x and saves energy by 2,241x, 242.2x, 12.4x, and 8.9x, respectively. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

An enhanced genetic algorithm for computation task offloading in MEC scenario

引用

International Journal of Wireless and Mobile Computing 2023年第2期25卷 118-127页

作者： Zhao, Jiacheng Li, Wenzao Liu, Hantao Yu, Peizhen Li, Hanyun Wen, Zhan School of Communication Engineering Chengdu University of Information Technology Sichuan Chengdu China Chengdu University of Information Technology Sichuan Chengdu China Network and Data Security Key Lab of Sichuan Pro. University of Electronic Science and Technology of China Sichuan Chengdu China Educational Informationisation and Big Data Centre Education Department of Sichuan Province Sichuan Chengdu China

The explosive growth of Internet of Things (IoT) and 5G communication technologies has driven the increasing computing demands for wireless devices. Mobile edge computing in the 5G scenario is a promising solution for energy-efficient and low latency applications. However, due to limited bandwidth, the selection of appropriate computing tasks greatly affects the user experience and system performance. Under the wireless bandwidth constraint, the reasonable choice of offloading objects is an NP-hard problem. The genetic algorithm has a great ability to solve this problem, but the performance of the algorithm varies with different scenarios. This paper proposes a task offloading strategy based on an enhanced genetic algorithm for small-scale computing tasks with an ultra-dense terminal distribution. Numerical experiments show that the convergence speed and optimisation effect of the enhanced genetic algorithm are significantly improved compared to the conventional genetic algorithm. © 2023 Inderscience Enterprises Ltd.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：