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

arXiv 2023年

作者： Wen, Xin-Cheng Chen, Yupan Gao, Cuiyun Zhang, Hongyu Zhang, Jie M. Liao, Qing School of Computer Science and Technology Harbin Institute of Technology Shenzhen China School of Big Data and Software Engineering Chongqing University China Department of Informatics King’s College London United Kingdom Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies China Peng Cheng Laboratory China

Prior studies have demonstrated the effectiveness of Deep Learning (DL) in automated software vulnerability detection. Graph Neural Networks (GNNs) have proven effective in learning the graph representations of source code and are commonly adopted by existing DL-based vulnerability detection methods. However, the existing methods are still limited by the fact that GNNs are essentially difficult to handle the connections between long-distance nodes in a code structure graph. Besides, they do not well exploit the multiple types of edges in a code structure graph (such as edges representing data flow and control flow). Consequently, despite achieving state-of-the-art performance, the existing GNN-based methods tend to fail to capture global information (i.e., long-range dependencies among nodes) of code graphs. To mitigate these issues, in this paper, we propose a novel vulnerability detection framework with grAph siMplification and enhanced graph rePresentation LEarning, named AMPLE. AMPLE mainly contains two parts: 1) graph simplification, which aims at reducing the distances between nodes by shrinking the node sizes of code structure graphs;2) enhanced graph representation learning, which involves one edge-aware graph convolutional network module for fusing heterogeneous edge information into node representations and one kernel-scaled representation module for well capturing the relations between distant graph nodes. Experiments on three public benchmark datasets show that AMPLE outperforms the state-of-the-art methods by 0.39%-35.32% and 7.64%-199.81% with respect to the accuracy and F1 score metrics, respectively. The results demonstrate the effectiveness of AMPLE in learning global information of code graphs for vulnerability detection. © 2023, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

F2A2: flexible fully-decentralized approximate actor-critic for cooperative multi-agent reinforcement learning

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 8447-8521页

作者： Wenhao Li Bo Jin Xiangfeng Wang Junchi Yan Hongyuan Zha School of Data Science The Chinese University of Hong Kong Shenzhen Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China School of Software Engineering Shanghai Research Institute for Intelligent Autonomous Systems Tongji University Shanghai China School of Computer Science and Technology Key Laboratory of Mathematics and Engineering Applications Ministry of Education East China Normal University Shanghai China Department of Computer Science and Engineering Key Laboratory of Artificial Intelligence Ministry of Education Shanghai Jiao Tong University Shanghai China

Traditional centralized multi-agent reinforcement learning (MARL) algorithms are sometimes unpractical in complicated applications due to non-interactivity between agents, the curse of dimensionality, and computation complexity. Hence, several decentralized MARL algorithms are motivated. However, existing decentralized methods only handle the fully cooperative setting where massive information needs to be transmitted in training. The block coordinate gradient descent scheme they used for successive independent actor and critic steps can simplify the calculation, but it causes serious bias. This paper proposes a exible fully decentralized actor-critic MARL framework, which can combine most of the actor-critic methods and handle large-scale general cooperative multi-agent settings. A primal-dual hybrid gradient descent type algorithm framework is designed to learn individual agents separately for decentralization. From the perspective of each agent, policy improvement and value evaluation are jointly optimized, which can stabilize multi-agent policy learning. Furthermore, the proposed framework can achieve scalability and stability for the large-scale environment. This framework also reduces information transmission by the parameter sharing mechanism and novel modeling-other-agents methods based on theory-of-mind and online supervised learning. Sufficient experiments in cooperative Multi-agent Particle Environment and StarCraft II show that the proposed decentralized MARL instantiation algorithms perform competitively against conventional centralized and decentralized methods.

关键词： cooperative MARL decentralized actor-critic primal-dual method

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT ONLINE labEL CONSISTENT HASHING FOR LARGE-SCALE CROSS-MODAL RETRIEVAL

EFFICIENT ONLINE LABEL CONSISTENT HASHING FOR LARGE-SCALE CR...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Yi, Jinhan Liu, Xin Cheung, Yiu-Ming Xu, Xing Fan, Wentao He, Yi Department of Computer Science and Technology Huaqiao University Xiamen361021 China Xiamen Key Lab. of Computer Vision and Pattern Recognition Fujian Key Lab. of Big Data Intelligence and Security China Department of Computer Science Hong Kong Baptist University Kowloon Hong Kong School of Computer Science and Engineering University of Electronic Science and Technology of China China Provincial Key Laboratory for Computer Information Processing Technology Soochow University China

ISBN: (纸本)9781665438643

Existing cross-modal hashing still faces three challenges: (1) Most batch-based methods are unsuitable for processing large-scale and streaming data. (2) Current online methods often suffer from insufficient semantic association, while lacking flexibility to learn the hash functions for varying streaming data. (3) Existing supervised methods always require much computation time or accumulate large quantization loss to learn hash codes. To address above challenges, we present an efficient Online label Consistent Hashing (OLCH) for cross-modal retrieval, which aims to incrementally learn hash codes for the current arriving data, while updating the hash functions at a streaming manner. To be specific, an online semantic representation learning framework is designed to adaptively preserve the semantic similarity across different modalities, and a mini-batch online gradient descent approach associated with forward-backward splitting is developed to optimize the hash functions. Accordingly, the hash codes are adaptively learned online with the high discriminative capability, while avoiding high computation complexity to process the streaming data. Experimental results show its outstanding performance in comparison with the-state-of-arts. © 2021 IEEE computer Society. All rights reserved.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

Boosting Fine-Grained Visual Anomaly Detection with Coarse-Knowledge-Aware Adversarial Learning

arXiv

引用

arXiv 2024年

作者： Fang, Qingqing Su, Qinliang Lv, Wenxi Xu, Wenchao Yu, Jianxing School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Department of Computing The Hong Kong Polytechnic University Hong Kong School of Artificial Intelligence Sun Yat-sen University Guangdong China Pazhou Lab Guangzhou510330 China

Many unsupervised visual anomaly detection methods train an auto-encoder to reconstruct normal samples and then leverage the reconstruction error map to detect and localize the anomalies. However, due to the powerful modeling and generalization ability of neural networks, some anomalies can also be well reconstructed, resulting in unsatisfactory detection and localization accuracy. In this paper, a small coarsely-labeled anomaly dataset is first collected. Then, a coarse-knowledge-aware adversarial learning method is developed to align the distribution of reconstructed features with that of normal features. The alignment can effectively suppress the auto-encoder’s reconstruction ability on anomalies and thus improve the detection accuracy. Considering that anomalies often only occupy very small areas in anomalous images, a patch-level adversarial learning strategy is further developed. Although no patch-level anomalous information is available, we rigorously prove that by simply viewing any patch features from anomalous images as anomalies, the proposed knowledge-aware method can also align the distribution of reconstructed patch features with the normal ones. Experimental results on four medical datasets and two industrial datasets demonstrate the effectiveness of our method in improving the detection and localization performance. Copyright © 2024, The Authors. All rights reserved.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Quantus: An Explainable AI Toolkit for Responsible Evaluation of Neural Network Explanations and Beyond

引用

Journal of Machine Learning Research 2023年 24卷

作者： Hedström, Anna Weber, Leander Bareeva, Dilyara Krakowczyk, Daniel Motzkus, Franz Samek, Wojciech Lapuschkin, Sebastian Höhne, Marina M.-C. Understandable Machine Intelligence Lab TU Berlin Berlin10587 Germany Department of Electrical Engineering and Computer Science TU Berlin Berlin10587 Germany Department of Artificial Intelligence Fraunhofer Heinrich-Hertz-Institute Berlin10587 Germany Department of Computer Science University of Potsdam Potsdam14476 Germany BIFOLD – Berlin Institute for the Foundations of Learning and Data Berlin10587 Germany

The evaluation of explanation methods is a research topic that has not yet been explored deeply, however, since explainability is supposed to strengthen trust in artificial intelligence, it is necessary to systematically review and compare explanation methods in order to confirm their correctness. Until now, no tool with focus on XAI evaluation exists that exhaustively and speedily allows researchers to evaluate the performance of explanations of neural network predictions. To increase transparency and reproducibility in the field, we therefore built Quantus—a comprehensive, evaluation toolkit in Python that includes a growing, wellorganised collection of evaluation metrics and tutorials for evaluating explainable methods. The toolkit has been thoroughly tested and is available under an open-source license on PyPi (or on https://***/understandable-machine-intelligence-lab/Quantus/). © 2023 Anna Hedström, Leander Weber, Dilyara Bareeva, Daniel Krakowczyk, Franz Motzkus, Wojciech Samek, Sebastian Lapuschkin, and Marina M.-C. Höhne.

关键词： Open systems

来源：评论

学校读者我要写书评

暂无评论

Vulnerability Detection with Graph Simplification and Enhanced Graph Representation Learning

Vulnerability Detection with Graph Simplification and Enhanc...

引用

International Conference on software engineering (ICSE)

作者： Xin-Cheng Wen Yupan Chen Cuiyun Gao Hongyu Zhang Jie M. Zhang Qing Liao School of Computer Science and Technology Harbin Institute of Technology Shenzhen China Peng Cheng Laboratory and Guangdong Provincial Key Laboratory Novel Security Intelligence Technologies School of Big Data and Software Engineering Chongqing University China Department of Informatics King's College London UK Peng Cheng Laboratory

Prior studies have demonstrated the effectiveness of Deep Learning (DL) in automated software vulnerability detection. Graph Neural Networks (GNNs) have proven effective in learning the graph representations of source code and are commonly adopted by existing DL-based vulnerability detection methods. However, the existing methods are still limited by the fact that GNNs are essentially difficult to handle the connections between long-distance nodes in a code structure graph. Besides, they do not well exploit the multiple types of edges in a code structure graph (such as edges representing data flow and control flow). Consequently, despite achieving state-of-the-art performance, the existing GNN-based methods tend to fail to capture global information (i.e., long-range dependencies among nodes) of code graphs. To mitigate these issues, in this paper, we propose a novel vulnerability detection framework with grAph siMplification and enhanced graph rePresentation LEarning, named AMPLE. AMPLE mainly contains two parts: 1) graph simplification, which aims at reducing the distances between nodes by shrinking the node sizes of code structure graphs; 2) enhanced graph representation learning, which involves one edge-aware graph convolutional network module for fusing heterogeneous edge information into node representations and one kernel-scaled representation module for well capturing the relations between distant graph nodes. Experiments on three public benchmark datasets show that AMPLE outperforms the state-of-the-art methods by 0.39%-35.32% and 7.64%-199.81% with respect to the accuracy and F1 score metrics, respectively. The results demonstrate the effectiveness of AMPLE in learning global information of code graphs for vulnerability detection.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Implicit Supervision-Assisted Graph Collaborative Filtering for Third-Party Library Recommendation

引用

IEEE Transactions on Services Computing 2025年第3期18卷 1459-1471页

作者： Lianrong Chen Mingdong Tang Naidan Mei Fenfang Xie Guo Zhong Qiang He School of Information Science and Technology Guangdong University of Foreign Studies Guangzhou China Unicom (Guangdong) Industry Internet Company Guangzhou China 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 Computing Technologies Swinburne University of Technology Melbourne VIC Australia

Third-party libraries (TPLs) play a crucial role in software development. Utilizing TPL recommender systems can aid software developers in promptly finding useful TPLs. A number of TPL recommendation approaches have been proposed and among them graph neural network (GNN)-based recommendation is attracting the most attention. However, GNN-based approaches generate node representations through multiple convolutional aggregations, which is prone to introducing noise, resulting in the over-smoothing issue. In addition, due to the high sparsity of labelled data, node representations may be biased in real-world scenarios. To address these issues, this paper presents a TPL recommendation method named Implicit Supervision-assisted Graph Collaborative Filtering (ISGCF). Specifically, it takes the App-TPL interaction relationships as input and employs a popularity-debiased method to generate denoised App and TPL graphs. This reduces the noise introduced during graph convolution and alleviates the over-smoothing issue. It also employs a novel implicitly-supervised loss function to exploit the labelled data to learn enhanced node representations. Extensive experiments on a large-scale real-world dataset demonstrate that ISGCF achieves a significant performance advantage over other state-of-the-art TPL recommendation methods in Recall, NDCG and MAP. The experiments also validate the superiority of ISGCF in mitigating the over-smoothing problem.

关键词： Vectors Noise Training Collaborative filtering Recommender systems Libraries Predictive models Graph neural networks Electronic mail Convolution

来源：评论

学校读者我要写书评

暂无评论

Empirical Study of Computational intelligence Approaches for the Early Detection of Autism Spectrum Disorder 5th

Empirical Study of Computational Intelligence Approaches for...

引用

5th International Conference on Intelligent Computing and Applications, ICICA 2019

作者： Khatun, Mst. Arifa Ali, Md. Asraf Ahmed, Md. Razu Noori, Sheak Rashed Haider Sahayadhas, Arun Department of Computer Science and Engineering Daffodil International University Dhaka Bangladesh Department of Software Engineering Daffodil International University Dhaka Bangladesh Artificial Intelligence Research Lab Vels Institute of Science Technology and Advanced Studies Chennai India

ISBN: (纸本)9789811555657

The objective of the research is to develop a predictive model that can significantly enhance the detection and monitoring performance of Autism Spectrum Disorder (ASD) using four supervised learning techniques. In this study, we applied four supervised-based classification techniques to the clinical ASD data obtained from 704 patients. Then, we compared the four machine learning (ML) algorithms performance across tenfold cross-validation, ROC curve, classification accuracy, F1 measure, precision, recall, and specificity. The analysis findings indicate that Support Vector Machine (SVM) achieved the uppermost performance than the other classifiers in terms of accuracy (85%), f1 measure (87%), precision (87%), and recall (88%). Our work presents a significant predictive model for ASD that can effectively help the ASD patients and medical practitioners. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

LF-YOLOv7: Improved YOLOv7 Based on Lightweight Modules and Novel Feature Fusion for Object Detection on Drone-Captured Scenarios

LF-YOLOv7: Improved YOLOv7 Based on Lightweight Modules and ...

引用

International Conference on Computational science and Computational intelligence (CSCI)

作者： Wangyu Jiang Le Wang Guojun Mao Meng Sun Fayaz Ali Dharejo Ghulam Ali Mallah Fujian Provincial Key Lab of Big Data Mining&Applications Fujian University of Technology Fuzhou Fujian Province China Department of Electrical Engineering and Computer Science Khalifa Univeristy AbuDhabi UAE Department of Computer Science Shah Abdul Latif University Khairpur Pakistan

ISBN: (数字)9798350361513

ISBN: (纸本)9798350372304

To address challenges in drone-captured images, including small-sized objects, multiple scales, and object diversity, we propose a novel lightweight and feature fusion based object detection model, called LF-YOLOv7. Firstly, a comprehensive high-resolution refinement design is investigated through simultaneously restructuring the head and optimizing the backbone, achieving more accurate assignment of multiple anchor boxes of different sizes and higher spatial resolution with lightweight mode. Furthermore, we present a new feature fusion module SM-BiFPN, which effectively integrates shallow details through cross-layer connections and enables the model to obtain more feature information related to small objects. Experimental evaluation shows that our method achieves a more competitive results than the benchmark and other compared state-of-the-art models in terms of mAP50 and the number of parameters.

关键词： Cross layer design Head Accuracy Scientific computing Computational modeling Object detection Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Reverse Games for the Resource Ecosystem in Cloud-Edge Computing

引用

IEEE Transactions on Consumer Electronics 2024年

作者： Pei, Manlin Wang, Chenyu Wang, Xia Zheng, Zhigao Huang, Jianhui Wang, Shengling Guo, Yufei School of Computer and Information Technology Beijing Jiaotong University Beijing China Department of Computer Science Georgia State University United States Beijing University of Technology School of Statistics and Data Science Faculty of Science Beijing China Institute of Artificial Intelligence School of Computer Science National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Hubei Luojia Laboratory Wuhan University Wuhan China Chinese Academy of Sciences Institute of Computing Technology Beijing China Beijing Normal University School of Artificial Intelligence Beijing China George Washington University Department of Statistics United States

Edge computing has emerged as a killer technology for a hyper-connected world due to its distributed architecture and customer-proximity property. Combined edge nodes with the cloud data center, a cloud-edge computing paradigm is formed, whose resource ecosystem calls for competitive pricing and optimal resource allocation. However, it is not feasible to realize global information-based optimization since some information is kept private to their owners. To solve this challenge, this paper develops the user-independent hierarchical reverse game and the user-assisted hierarchical reverse game to depict the relationship among the resource provider, the resource tenant, and the resource user. The aim is to seek the optimal strategies for players without revealing any private information. The common trait of both games is to force the players to report the optimal strategies based on their actual private information. This salient trait can produce privacy-preservation optimization since there is no requirement for the players to release their individual information directly, and the optimal strategies of other players can be deduced naturally. The difference between the user-independent hierarchical reverse game and the user-assisted one is that the game rules are stipulated entirely by the provider and the tenants (edge nodes) in the former, while some game rules can be customized according to the advice of users in the latter. This leads the user-independent hierarchical reverse game is more concise and easy to guarantee the incentive compatibility constraint, while the user-assisted hierarchical reverse game can attract more users since the game rules can adapt to their economic status, requirements, and preferences. © 1975-2011 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：