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

arXiv 2021年

作者： Cai, Ruichu Wu, Fengzhu Li, Zijian Wei, Pengfei Yi, Lingling Zhang, Kun School of Computing Guangdong University of Technology Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application Guangzhou510006 China School of Computing Guangdong University of Technology Guangzhou510006 China School of Computing Guangdong University of Technology Guangzhou510006 China Co. Ltd Department of Philosophy Carnegie Mellon University PittsburghPA15213 United States

—Recent years have witnessed tremendous interest in deep learning on graph-structured data. Due to the high cost of collecting labeled graph-structured data, domain adaptation is important to supervised graph learning tasks with limited samples. However, current graph domain adaptation methods are generally adopted from traditional domain adaptation tasks, and the properties of graph-structured data are not well utilized. For example, the observed social networks on different platforms are controlled not only by the different crowd or communities but also by the domain-specific policies and the background noise. Based on these properties in graph-structured data, we first assume that the graph-structured data generation process is controlled by three independent types of latent variables, i.e., the semantic latent variables, the domain latent variables, and the random latent variables. Based on this assumption, we propose a disentanglement-based unsupervised domain adaptation method for the graph-structured data, which applies variational graph auto-encoders to recover these latent variables and disentangles them via three supervised learning modules. Extensive experimental results on two real-world datasets in the graph classification task reveal that our method not only significantly outperforms the traditional domain adaptation methods and the disentangled-based domain adaptation methods but also outperforms the state-of-the-art graph domain adaptation algorithms. © 2021, CC BY.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Ppt4J: Patch Presence Test for Java Binaries

arXiv

引用

arXiv 2023年

作者： Pan, Zhiyuan Hu, Xing Xia, Xin Zhan, Xian Lo, David Yang, Xiaohu The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China Software Engineering Application Technology Lab Huawei Hangzhou China The Hong Kong Polytechnic University Hong Kong Hong Kong School of Computing and Information Systems Singapore Management University Singapore

The number of vulnerabilities reported in open source software has increased substantially in recent years. Security patches provide the necessary measures to protect software from attacks and vulnerabilities. In practice, it is difficult to identify whether patches have been integrated into software, especially if we only have binary files. Therefore, the ability to test whether a patch is applied to the target binary, a.k.a. patch presence test, is crucial for practitioners. However, it is challenging to obtain accurate semantic information from patches, which could lead to incorrect results. In this paper, we propose a new patch presence test framework named Ppt4J (Patch Presence Test for Java Binaries). Ppt4J is designed for open-source Java libraries. It takes Java binaries (i.e. bytecode files) as input, extracts semantic information from patches, and uses feature-based techniques to identify patch lines in the binaries. To evaluate the effectiveness of our proposed approach Ppt4J, we construct a dataset with binaries that include 110 vulnerabilities. The results show that Ppt4J achieves an F1 score of 98.5% with reasonable efficiency, improving the baseline by 14.2%. Furthermore, we conduct an in-the-wild evaluation of Ppt4J on JetBrains IntelliJ IDEA. The results suggest that a third-party library included in the software is not patched for two CVEs, and we have reported this potential security problem to the vendor. © 2023, CC BY-NC-ND.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Robust Graph Structure Learning with the Alignment of Features and Adjacency Matrix

arXiv

引用

arXiv 2023年

作者： Lv, Shaogao Wen, Gang Liu, Shiyu Wei, Linsen Li, Ming Department of Statistics and Data Science Nanjing Audit University China University of Electronic Science and Technology of China China School of Astronautics Northwestern Polytechnical University China Key Laboratory of Intelligent Education Technology and Application of Zhejiang Province Zhejiang Normal University Jinhua China Key Laboratory of Scientific and Engineering Computing Ministry of Education Shanghai Jiao Tong University China

To improve the robustness of graph neural networks (GNN), graph structure learning (GSL) has attracted great interest due to the pervasiveness of noise in graph data. Many approaches have been proposed for GSL to jointly learn a clean graph structure and corresponding representations. To extend the previous work, this paper proposes a novel regularized GSL approach, particularly with an alignment of feature information and graph information, which is motivated mainly by our derived lower bound of node-level Rademacher complexity for GNNs. Additionally, our proposed approach incorporates sparse dimensional reduction to leverage low-dimensional node features that are relevant to the graph structure. To evaluate the effectiveness of our approach, we conduct experiments on real-world graphs. The results demonstrate that our proposed GSL method outperforms several competitive baselines, especially in scenarios where the graph structures are heavily affected by noise. Overall, our research highlights the importance of integrating feature and graph information alignment in GSL, as inspired by our derived theoretical result, and showcases the superiority of our approach in handling noisy graph structures through comprehensive experiments on real-world datasets. Copyright © 2023, The Authors. All rights reserved.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “Existence ofSolutions to Non-Coercivity Quasilinear Elliptic Problem”

引用

Journal of Function Spaces 2021年第1期2021卷

作者： Jimao Xiawu Shuibo Huang Yingyuan Mi Maoji Ri School of Mathematics and Computer Science Northwest Minzu University Lanzhou Gansu 730030 *** Key Laboratory of Streaming Data Computing Technologies and Application Northwest Minzu University Lanzhou Gansu 730030 ***

来源：评论

学校读者我要写书评

暂无评论

Training of Spiking Neural Network joint Curriculum Learning Strategy

arXiv

引用

arXiv 2023年

作者： Tang, Lingling Chu, Jielei Gong, Zhiguo Li, Tianrui The School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu611756 China National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University Chengdu611756 China The State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China

Starting with small and simple concepts, and gradually introducing complex and difficult concepts is the natural process of human learning. Spiking Neural Networks (SNNs) aim to mimic the way humans process information, but current SNNs models treat all samples equally, which does not align with the principles of human learning and overlooks the biological plausibility of SNNs. To address this, we propose a CL-SNN model that introduces Curriculum Learning(CL) into SNNs, making SNNs learn more like humans and providing higher biological interpretability. CL is a training strategy that advocates presenting easier data to models before gradually introducing more challenging data, mimicking the human learning process. We use a confidence-aware loss to measure and process the samples with different difficulty levels. By learning the confidence of different samples, the model reduces the contribution of difficult samples to parameter optimization automatically. We conducted experiments on static image datasets MNIST, Fashion-MNIST, CIFAR10, and neuromorphic datasets N-MNIST, CIFAR10-DVS, DVS-Gesture. The results are promising. To our best knowledge, this is the first proposal to enhance the biologically plausibility of SNNs by introducing CL. Copyright © 2023, The Authors. All rights reserved.

关键词： Curricula

来源：评论

学校读者我要写书评

暂无评论

Coordinate Attention Based 3D-CNN Using Ghost Multi-Scale for Diagnosing Alzheimer’s Disease

Coordinate Attention Based 3D-CNN Using Ghost Multi-Scale fo...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Xiaolu Lin Pinya Lu Jie Pan Hongqin Yang Xuemei Ding Fujian Provincial Engineering Research Center for Public Service Big Data Mining and Application Fujian Provincial University Engineering Research Center for Big Data Analysis and Application Fujian Normal University Fuzhou China Xiamen Jingyi Zhikang Technology Co. Ltd Xiamen China Fujian Provincial Key Laboratory for Photonics Technology Key Laboratory of OptoElectronic Science and Technology for Medicine of Ministry of Education Fujian Normal University Fuzhou China School of Computing Engineering and Intelligent Systems Ulster University Derry-Londonderry NI UK

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Alzheimer's disease (AD) is a neurodegenerative disease and mild cognitive impairment (MCI) is the early stage of AD. Previous studies have predominantly focused on binary classification using 3 dimensional - convolutional neural network (3D-CNN) for AD diagnosis, with limited progress in multi-classification. Moreover, the current 3D-CNNs often adopt a single-scale architecture with massive parameters growth. Additionally, obtaining precise location information of brain imaging data is crucial for improving the classification accuracy with 3D-CNN. Hence, we propose a multi-scale 3D-CNN based on coordinate attention mechanism to marvelously capture and integrate 3D features with fewer parameters, improving the accuracy of AD diagnosis. A total of 447 cognitively normal (CN), 512 MCI, and 358 AD sMRI images from the Alzheimer's Disease Neuroimaging Initiative datasets are used for multi-class classification task, yielding a classification accuracy of 92.8%. The model merely involves 2.41 M parameters and achieves the best classification results with the least number of parameters when compared to other representative CNN architectures including ResNet 18, ResNet 34, ConvNeXt tiny, and VGG 11. Through the ablation experiment, the addition of attention mechanism and the multi-scale classification enhances the classification performance by 4.5% and 1.5%, respectively. Furthermore, our model outperforms the other six existing studies in terms of accuracy for classifying AD vs. MCI vs. CN. Overall, this study underscores the efficacy of our approach for AD diagnosis, showcasing its utility in diagnosing AD patients and providing novel insights for diagnosing other neurological disorder diseases.

关键词： Neuroimaging Accuracy Attention mechanisms Three-dimensional displays Resonance Convolutional neural networks Alzheimer's disease

来源：评论

学校读者我要写书评

暂无评论

SDGFormer: An Efficient Convolution Network Structurally Similar to Transformer

SDGFormer: An Efficient Convolution Network Structurally Sim...

引用

IEEE International Conference on Multimedia and Expo (ICME)

作者： Chaohao Wen Xun Gong School of Computing and Artificial Intelligence SWJTU Chengdu China Engineering Research Center of Sustainable Urban Intelligent Transportation Ministry of Education China National Engineering Laboratory of Integrated Transportation Big Data Application Technology SWJTU Chengdu China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province SWJTU Chengdu China

Deep Neural Networks (DNN) have achieved extraordinary success in many visual recognition tasks. Visual Transformer (ViT), which is derived from Natural Language Processing (NLP), has achieved state-of-the-art (SOTA) results on many tasks due to its capability of capturing long-range dependencies in visual data. However, Existing ViT models are challenging to deploy on devices due to their massive computational consumption, huge memory overhead, and reliance on large datasets. In this work, we address these issues by replacing some computationally expensive and memory-intensive modules in ViT with standard Convolutional Neural Network (CNN) modules. Firstly, we propose an efficient Self-Attention module called SDG-Attention (SDGA) with linear space and time complexity, and an economical FeedForward Network (FFN) composed of group convolution and shuffle channel (SFFN). Then, we develop a lightweight CNN model with SDGA and SFFN, SDGFormer, which embraces several priors of ViT and is LayerNorm-Free. We evaluate SDGFormer on ImageNet-1K and Mini-ImageNet, and the SDGFormer-S achieves a comparable top-1 accuracy of 77.6% on ImageNet-1K with 9.1M parameters and 1.6 GFlops regimes. Moreover, our SDGFormer-T achieves SOTA performance on Mini-ImageNet with 83.3% accuracy, demonstrating good generalization on small datasets without extra data.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Transformer-Based Hierarchical Dynamic Decoders for Salient Object Detection

SSRN

引用

SSRN 2023年

作者： Zheng, Qingping Zheng, Ling Deng, Jiankang Li, Ying Shang, Changjing Shen, Qiang School of Computer Science National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Shaanxi Provincial Key Laboratory of Speech & Image Information Processing Northewestern Polytechnical University Shaanxi Xi’an710129 China Fuzhou Institute of Data Technology Fujian350200 China Department of Computing Imperial College London LondonSW7 2AZ United Kingdom

HighlightsTransformer-Based Hierarchical Dynamic Decoders for Salient Object DetectionQingping Zheng, Ling Zheng, Jiankang Deng, Ying Li, Changjing Shang, Qiang Shen• T-HDDNet employs dynamic upsampling and fusion for data-driven salient object detection.• T-HDDNet uses a spatially sensitive loss to learn salient object structures, yielding a high-resolution map.• Our method exceeds benchmarks at 22.19G MACs and 27M Params, reducing costs compared to the top model. © 2023, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

StarGAT: Star-Shaped Hierarchical Graph Attentional Network for Heterogeneous Network Representation Learning

StarGAT: Star-Shaped Hierarchical Graph Attentional Network ...

引用

IEEE International Conference on data Mining (ICDM)

作者： Wen-Zhi Li Ling Huang Chang-Dong Wang Yu-Xin Ye School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Province Key Laboratory of Computational Science Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education China College of Mathematics and Informatics South China Agricultural University Guangzhou China Guangdong Provincial Key Laboratory of Public Finance and Taxation with Big Data Application Guangzhou China College of Computer Science and Technology Jilin University Changchun China

ISBN: (纸本)9781665423991

Many real-world graphs can be viewed as Heterogeneous Networks or Heterogeneous Information Networks (HINs) for that they comprise a diversity of node types and relation types. Due to the efficient representation ability of Graph Neural Network and the idea of random walk, many recent studies apply graph representation learning to HINs and achieve satisfactory results. However, these works either treat different node types in a metapath equally, which is inconsistent with the original graph semantic information for that different node types should have different statuses, or only consider the first-order (node-level) and second-order (metapath-level, a.k.a. link-level) information aggregation while ignoring the higher-order relations. To tackle these two problems, we propose a novel Star-Shaped Hierarchical Graph Attentional Network (StarGAT) model to boost representation learning in HINs. Specifically, we assume nodes in HINs can be categorized into a star-shaped structure including one center node type and a bunch of auxiliary node types in a specific task; and we encode node-level, link-level and motif-level attentions in a hierarchical manner to capture richer semantic information. Extensive experiments on three datasets illustrate the model effectiveness.

关键词： Representation learning Conferences Semantics Heterogeneous networks Graph neural networks data mining Task analysis

来源：评论

学校读者我要写书评

暂无评论

DNN Task Assignment in UAV Networks: A Generative AI Enhanced Multi-Agent Reinforcement Learning Approach

arXiv

引用

arXiv 2024年

作者： Tang, Xin Chen, Qian Weng, Wenjie Liao, Binhan Wang, Jiacheng Cao, Xianbin Li, Xiaohuan Guangxi University Key Laboratory of Intelligent Networking and Scenario System School of Information and Communication Guilin University of Electronic Technology Guilin541004 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Architecture and Transportation Engineering Guilin University of Electronic Technology Guilin541004 China National Engineering Laboratory for Comprehensive Transportation Big Data Application Technology Guangxi Nanning530001 China College of Computing and Data Science Nanyang Technological University 639798 Singapore School of Electronic and Information Engineering The Key Laboratory of Advanced Technology of Near Space Information System Ministry of Industry and Information Technology of China Beihang University Beijing100191 China

Unmanned Aerial Vehicles (UAVs) possess high mobility and flexible deployment capabilities, prompting the development of UAVs for various application scenarios within the Internet of Things (IoT). The unique capabilities of UAVs give rise to increasingly critical and complex tasks in uncertain and potentially harsh environments. The substantial amount of data generated from these applications necessitates processing and analysis through deep neural networks (DNNs). However, UAVs encounter challenges due to their limited computing resources when managing DNN models. This paper presents a joint approach that combines multiple-agent reinforcement learning (MARL) and generative diffusion models (GDM) for assigning DNN tasks to a UAV swarm, aimed at reducing latency from task capture to result output. To address these challenges, we first consider the task size of the target area to be inspected and the shortest flying path as optimization constraints, employing a greedy algorithm to resolve the subproblem with a focus on minimizing the UAV’s flying path and the overall system cost. In the second stage, we introduce a novel DNN task assignment algorithm, termed GDM-MADDPG, which utilizes the reverse denoising process of GDM to replace the actor network in multi-agent deep deterministic policy gradient (MADDPG). This approach generates specific DNN task assignment actions based on agents’ observations in a dynamic environment. Simulation results indicate that our algorithm performs favorably compared to benchmarks in terms of path planning, Age of Information (AoI), energy consumption, and task load balancing. Copyright © 2024, The Authors. All rights reserved.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：