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

BinaryAI: Binary Software Composition Analysis via Intelligent Binary Source Code Matching

学校读者我要写书评

暂无评论

BinaryAI: Binary Software Composition Analysis via Intellige...

International Conference on Software Engineering (ICSE)

作者： Ling Jiang Junwen An Huihui Huang Qiyi Tang Sen Nie Shi Wu Yuqun Zhang Research Institute of Trustworthy Autonomous Systems Southern University of Science and Technology Shenzhen China Southern University of Science and Technology Shenzhen China Tencent Security Keen Lab Shanghai China Department of Computer Science and Engineering Southern University of Science and Technol-ogy Shenzhen China Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

While third-party libraries (TPLs) are extensively reused to enhance productivity during software development, they can also introduce potential security risks such as vulnerability propagation. Software composition analysis (SCA), proposed to identify reused TPLs for reducing such risks, has become an essential procedure within modern DevSecOps. As one of the mainstream SCA techniques, binary-to-source SCA identifies the third-party source projects contained in binary files via binary source code matching, which is a major challenge in reverse engineering since binary and source code exhibit substantial disparities after compilation. The existing binary-to-source SCA techniques leverage basic syntactic features that suffer from redundancy and lack robustness in the large-scale TPL dataset, leading to inevitable false positives and compromised recall. To mitigate these limitations, we introduce BinaryAI, a novel binary-to-source SCA technique with two-phase binary source code matching to capture both syntactic and semantic code features. First, BinaryAI trains a transformer-based model to produce function-level embeddings and obtain similar source functions for each binary function accordingly. Then by applying the link-time locality to facilitate function matching, BinaryAI detects the reused TPLs based on the ratio of matched source functions. Our experimental results demonstrate the superior performance of BinaryAI in terms of binary source code matching and the downstream SCA task. Specifically, our embedding model outperforms the state-of-the-art model CodeCMR, i.e., achieving 22.54% recall@l and 0.34 MRR compared with 10.75% and 0.17 respectively. Additionally, BinaryAI outperforms all existing binary-to-source SCA tools in TPL detection, increasing the precision from 73.36% to 85.84% and recall from 59.81% to 64.98% compared with the well-recognized commercial SCA product Black Duck. E-https://***

关键词： Codes Source coding Semantics Redundancy Syntactics Transformers Software

A Lightweight Ultrasound Image Denoiser Using Parallel Attention Modules and Capsule Generative Adversarial Network

学校读者我要写书评

暂无评论

Informatics in Medicine Unlocked 2024年 50卷

作者： Sivaanpu, Anparasy Punithakumar, Kumaradevan Thanikasalam, Kokul Noga, Michelle Zheng, Rui Ta, Dean Lou, Edmond H.M. Le, Lawrence H. Department of Radiology and Diagnostic Imaging University of Alberta Edmonton Alberta Canada Department of Computer Science University of Jaffna Jaffna Sri Lanka School of Information Science and Technology ShanghaiTech University Shanghai 201210 China Department of Biomedical Engineering School of Information Science and Technology Fudan University Shanghai China Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada State Key Laboratory of Integrated Chips and Systems Fudan University Shanghai China

The quality of ultrasound (US) imaging has been constrained by its limited contrast and resolution, inherent speckle noise, and the presence of other artifacts. Existing traditional and deep learning-based US denoising approaches have many limitations, such as reliance on manual parameter configurations, poor performance for unknown noise levels, the requirement for a large number of training data, and high computational expense. To address these challenges, we propose a novel Generative Adversarial Network (GAN) based denoiser. Capsule networks are utilized in both the generator and discriminator of the proposed GAN to capture intricate sparse features with less complexity. In addition, bias components are removed from all neurons of the generator to handle the unknown noise levels. A parallel attention module is also included in the proposed model to further enhance denoising performance. The proposed approach is trained in a semi-supervised manner and can thus be trained with fewer labeled images. Experimental evaluation on publicly available HC18 and BUSI datasets showed that the proposed approach achieved state-of-the-art denoising performance, with PSNR values of 33.86 and 34.16, and SSIM indices of 0.91 and 0.90, respectively. Moreover, experiments showed that the proposed approach is lightweight and more than twice as fast as similar denoisers. © 2024

关键词： Capsule Network Generative Adversarial Network Image denoising Semi-supervision Ultrasound image

Multi-objective Aerial Collaborative Secure Communication Optimization via Generative Diffusion Model-enabled Deep Reinforcement Learning

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhang, Chuang Sun, Geng Li, Jiahui Wu, Qingqing Wang, Jiacheng Niyato, Dusit Liu, Yuanwei The College of Computer Science and Technology Jilin University Changchun130012 China The Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China The College of Computer Science and Technology Jilin University Changchun130012 China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The Department of Electronic Engineering Shanghai Jiao Tong University Shanghai China The College of Computing and Data Science Nanyang Technological University 639798 Singapore The School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

Due to flexibility and low-cost, unmanned aerial vehicles (UAVs) are increasingly crucial for enhancing coverage and functionality of wireless networks. However, incorporating UAVs into next-generation wireless communication systems poses significant challenges, particularly in sustaining high-rate and long-range secure communications against eavesdropping attacks. In this work, we consider a UAV swarm-enabled secure surveillance network system, where a UAV swarm forms a virtual antenna array to transmit sensitive surveillance data to a remote base station (RBS) via collaborative beamforming (CB) so as to resist mobile eavesdroppers. Specifically, we formulate an aerial secure communication and energy efficiency multi-objective optimization problem (ASCEE-MOP) to maximize the secrecy rate of the system and to minimize the flight energy consumption of the UAV swarm. To address the non-convex, NP-hard and dynamic ASCEE-MOP, we propose a generative diffusion model-enabled twin delayed deep deterministic policy gradient (GDMTD3) method. Specifically, GDMTD3 leverages an innovative application of diffusion models to determine optimal excitation current weights and position decisions of UAVs. The diffusion models can better capture the complex dynamics and the trade-off of the ASCEE-MOP, thereby yielding promising solutions. Simulation results highlight the superior performance of the proposed approach compared with traditional deployment strategies and some other deep reinforcement learning (DRL) benchmarks. Moreover, performance analysis under various parameter settings of GDMTD3 and different numbers of UAVs verifies the robustness of the proposed approach. Copyright © 2024, The Authors. All rights reserved.

关键词： Energy efficiency

MF-MOS: A Motion-Focused Model for Moving Object Segmentation

学校读者我要写书评

暂无评论

MF-MOS: A Motion-Focused Model for Moving Object Segmentatio...

IEEE International Conference on Robotics and Automation (ICRA)

作者： Jintao Cheng Kang Zeng Zhuoxu Huang Xiaoyu Tang Jin Wu Chengxi Zhang Xieyuanli Chen Rui Fan School of Electronic and Information Engineering South China Normal University Foshan China Department of Computer Science Aberystwyth University Aberystwyth U.K. Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Hong Kong China School of Internet of Things Engineering Jiangnan University Wuxi China College of Intelligence Science and Technology National University of Defense Technology Changsha China College of Electronics & Information Engineering Shanghai Research Institute for Intelligent Autonomous Systems the State Key Laboratory of Intelligent Autonomous Systems and Frontiers Science Center for Intelligent Autonomous Systems Tongji University Shanghai China

ISBN: (数字)9798350384574

ISBN: (纸本)9798350384581

Moving object segmentation (MOS) provides a reliable solution for detecting traffic participants and thus is of great interest in the autonomous driving field. Dynamic capture is always critical in the MOS problem. Previous methods capture motion features from the range images directly. Differently, we argue that the residual maps provide greater potential for motion information, while range images contain rich semantic guidance. Based on this intuition, we propose MF-MOS, a novel motion-focused model with a dual-branch structure for LiDAR moving object segmentation. Novelly, we decouple the spatial-temporal information by capturing the motion from residual maps and generating semantic features from range images, which are used as movable object guidance for the motion branch. Our straightforward yet distinctive solution can make the most use of both range images and residual maps, thus greatly improving the performance of the LiDAR-based MOS task. Remarkably, our MF-MOS achieved a leading IoU of 76.7% on the MOS leaderboard of the SemanticKITTI dataset upon submission, demonstrating the current state-of-the-art performance. The implementation of our MF-MOS has been released at https://***/SCNU-RISLAB/MF-MOS.

关键词： Laser radar Semantics Dynamics Object segmentation Data augmentation Data models Reliability

DSDFormer: An Innovative Transformer-Mamba Framework for Robust High-Precision Driver Distraction Identification

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Chen, Junzhou Zhang, Zirui Yu, Jing Huang, Heqiang Zhang, Ronghui Xu, Xuemiao Sheng, Bin Yan, Hong Guangdong Provincial Key Laboratory of Intelligent Transportation System School of Intelligent Systems Engineering Sun Yat-Sen University Guangzhou510275 China The School of Computer Science and Engineering South China University of Technology China The Department of Computer Science and Engineering Shanghai Jiao Tong University China The Department of Electrical Engineering City University of Hong Kong Kowloon Hong Kong

Driver distraction remains a leading cause of traffic accidents, posing a critical threat to road safety globally. As intelligent transportation systems evolve, accurate and real-time identification of driver distraction has become essential. However, existing methods struggle to capture both global contextual and fine-grained local features while contending with noisy labels in training datasets. To address these challenges, we propose DSDFormer, a novel framework that integrates the strengths of Transformer and Mamba architectures through a Dual State Domain Attention (DSDA) mechanism, enabling a balance between long-range dependencies and detailed feature extraction for robust driver behavior recognition. Additionally, we introduce Temporal Reasoning Confident Learning (TRCL), an unsupervised approach that refines noisy labels by leveraging spatiotemporal correlations in video sequences. Our model achieves state-of-the-art performance on the AUC-V1, AUC-V2, and 100-Driver datasets and demonstrates real-time processing efficiency on the NVIDIA Jetson AGX Orin platform. Extensive experimental results confirm that DSDFormer and TRCL significantly improve both the accuracy and robustness of driver distraction detection, offering a scalable solution to enhance road safety. Copyright © 2024, The Authors. All rights reserved.

关键词： Highway accidents

Adaptive Discriminative Regularization for Visual Classification

学校读者我要写书评

暂无评论

arXiv 2022年

作者： Zhao, Qingsong Wang, Yi Dou, Shuguang Gong, Chen Wang, Yin Zhao, Cairong Ji, Xiaopeng Jiang, Xinyang Department of Computer Science and Technology Tongji University Shanghai201804 China Shanghai AI Laboratory Shanghai200232 China Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information School of Computer Science and Engineering Ministry of Education Nanjing University of Science and Technology Nanjing210094 China The State Key Lab of CAD&CG Zhejiang University China Shanghai China

How to improve discriminative feature learning is central in classification. Existing works address this problem by explicitly increasing inter-class separability and intra-class compactness, whether by constructing positive and negative pairs for contrastive learning or posing tighter class separating margins. These methods do not exploit the similarity between different classes as they adhere to independent identical distributions assumption in data. In this paper, we embrace the real-world data distribution setting that some classes share semantic overlaps due to their similar appearances or concepts. Regarding this hypothesis, we propose a novel regularization to improve discriminative learning. We first calibrate the estimated highest likelihood of one sample based on its semantically neighboring classes, then encourage the overall likelihood predictions to be deterministic by imposing an adaptive exponential penalty. As the gradient of the proposed method is roughly proportional to the uncertainty of the predicted likelihoods, we name it adaptive discriminative regularization (ADR), trained along with a standard cross entropy loss in classification. Extensive experiments demonstrate that it can yield consistent and non-trivial performance improvements in a variety of visual classification tasks (over 10 benchmarks). Furthermore, we find it is robust to long-tailed and noisy label data distribution. Its flexible design enables its compatibility with mainstream classification architectures and losses. © 2022, CC BY.

关键词： Image classification

Adaptive Student Inference Network for Efficient Single Image Super-Resolution

学校读者我要写书评

暂无评论

Adaptive Student Inference Network for Efficient Single Imag...

IEEE International Conference on Data Mining (ICDM)

作者： Kang Miao Zhao Zhang Jiahuan Ren Mingbo Zhao Haijun Zhang Richang Hong School of Computer Science and Information Engineering Hefei University of Technology Hefei China Key Laboratory of Knowledge Engineering with Big Data (Ministry of Education) & Intelligent Interconnected Systems Laboratory of Anhui Province Hefei University of Technology Hefei China Yunnan Key Laboratory of Software Engineering Kunming China School of Information Science and Technology Donghua University Shanghai China Department of Computer Science Harbin Institute of Technology (Shenzhen) Shenzhen China

Recent advances in single image super-resolution (SISR) have achieved remarkable performance through deep learning. However, the high computational cost hinders the deployment of SISR models on edge devices. Instead of proposing new SISR models, a new trend is emerging to improve network efficiency by reducing parameters, FLOPs, and inference time through slight modifications to the original models. However, recent methods usually focus on reducing only one of three metrics, i.e., FLOPs, parameters and inference time, which inevitably increases the other two metrics. In this paper, we propose a novel Adaptive Student Inference Network (ASIN) on popular SISR models, which aims at reducing FLOPs and inference time while maintaining the number of parameters and restoring clearer high-resolution images. Specifically, our ASIN divides a SISR model into three components (head, body and tail) and adopts various strategies for each part. For head and tail parts, to ensure the restored images contain more detailed information, a novel auxiliary Enhanced Teacher Network (ETNet) is designed, which is trained with the ground-truth images to obtain more prior knowledge to guide student network to extract more accurate textures using a new knowledge distillation method. For the body part, owing to the varying difficulties of the reconstructions in different regions, we propose an Adaptive Depth Predicted Module (ADPM) to dynamically shorten average depth of network to reduce the computational cost of overall network. Extensive experiments on two datasets demonstrate the effectiveness and state-of-the-art performance of our ASIN compared to its counterparts.

关键词：

Graph Prompt Learning: A Comprehensive Survey and Beyond

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Sun, Xiangguo Zhang, Jiawen Wu, Xixi Cheng, Hong Xiong, Yun Li, Jia Department of Systems Engineering and Engineering Management Shun Hing Institute of Advanced Engineering The Chinese University of Hong Kong Hong Kong Hong Kong University of Science and Technology Guangzhou China Shanghai Key Laboratory of Data Science School of Computer Science Fudan University China

Artificial General Intelligence (AGI) has revolutionized numerous fields, yet its integration with graph data, a cornerstone in our interconnected world, remains nascent. This paper presents a pioneering survey on the emerging domain of graph prompts in AGI, addressing key challenges and opportunities in harnessing graph data for AGI applications. Despite substantial advancements in AGI across natural language processing and computer vision, the application to graph data is relatively underexplored. This survey critically evaluates the current landscape of AGI in handling graph data, highlighting the distinct challenges in cross-modality, cross-domain, and cross-task applications specific to graphs. Our work is the first to propose a unified framework for understanding graph prompt learning, offering clarity on prompt tokens, token structures, and insertion patterns in the graph domain. We delve into the intrinsic properties of graph prompts, exploring their flexibility, expressiveness, and interplay with existing graph models. A comprehensive taxonomy categorizes over 100 works in this field, aligning them with pre-training tasks across node-level, edge-level, and graph-level objectives. Additionally, we present, ProG, a Python library, and an accompanying website, to support and advance research in graph prompting. The survey culminates in a discussion of current challenges and future directions, offering a roadmap for research in graph prompting within AGI. Through this comprehensive analysis, we aim to catalyze further exploration and practical applications of AGI in graph data, underlining its potential to reshape AGI fields and beyond. ProG and the website can be accessed by https: //***/WxxShirley/Awesome-Graph-Prompt, and https://***/sheldonresearch/ProG, respectively. Copyright © 2023, The Authors. All rights reserved.

关键词： Websites

Four infinite families of ternary cyclic codes with a square-root-like lower bound

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Chen, Tingfang Ding, Cunsheng Li, Chengju Sun, Zhonghua The Department of Computer Science and Engineering The Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong The Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai200062 China The National Mobile Communications Research Laboratory Southeast University China The School of Mathematics Hefei University of Technology Anhui Hefei230601 China

Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. Inspired by the recent work on binary cyclic codes published in IEEE Trans. Inf. Theory, vol. 68, no. 12, pp. 7842-7849, 2022, and the arXiv paper arXiv:2301.06446, the objectives of this paper are the construction and analyses of four infinite families of ternary cyclic codes with length n = 3m − 1 for odd m and dimension k ∈ {n/2, (n + 2)/2} whose minimum distances have a square-root-like lower bound. Their duals have parameters [n, k⊥, d⊥], where k⊥ ∈ {n/2, (n − 2)/2} and d⊥ also has a square-root-like lower bound. These families of codes and their duals contain distance-optimal cyclic codes. Copyright © 2023, The Authors. All rights reserved.

关键词：