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

arXiv 2024年

作者： Xie, Jinxia Zhong, Bineng Mo, Zhiyi Zhang, Shengping Shi, Liangtao Song, Shuxiang Ji, Rongrong Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education China Guangxi Key Lab of Multi-Source Information Mining & Security China Guangxi Normal University Guilin541004 China Guangxi Key Laboratory of Machine Vision and Intelligent Control Wuzhou University China School of Computer Science and Technology Harbin Institute of Technology China Media Analytics and Computing Lab School of Informatics Xiamen University China

The rich spatio-temporal information is crucial to capture the complicated target appearance variations in visual tracking. However, most top-performing tracking algorithms rely on many hand-crafted components for spatio-temporal information aggregation. Consequently, the spatio-temporal information is far away from being fully explored. To alleviate this issue, we propose an adaptive tracker with spatio-temporal transformers (named AQATrack), which adopts simple autoregressive queries to effectively learn spatio-temporal information without many hand-designed components. Firstly, we introduce a set of learnable and autoregressive queries to capture the instantaneous target appearance changes in a sliding window fashion. Then, we design a novel attention mechanism for the interaction of existing queries to generate a new query in current frame. Finally, based on the initial target template and learnt autoregressive queries, a spatio-temporal information fusion module (STM) is designed for spatio-temporal formation aggregation to locate a target object. Benefiting from the STM, we can effectively combine the static appearance and instantaneous changes to guide robust tracking. Extensive experiments show that our method significantly improves the tracker’s performance on six popular tracking benchmarks: LaSOT, LaSOText, TrackingNet, GOT-10k, TNL2K, and *** and models will be here. Copyright © 2024, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Ppt4j: Patch Presence Test for Java Binaries

Ppt4j: Patch Presence Test for Java Binaries

引用

International Conference on Software Engineering (ICSE)

作者： Zhiyuan Pan Xing Hu Xin Xia Xian Zhan David Lo Xiaohu Yang 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 China School of Computing and Information Systems Singapore Management University Singapore

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

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 forJava 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.

关键词： Java Semantics Feature extraction Libraries security Software measurement data mining

来源：评论

学校读者我要写书评

暂无评论

When ChatGPT Meets Smart Contract Vulnerability Detection: How Far Are We?

arXiv

引用

arXiv 2023年

作者： Chen, Chong Su, Jianzhong Chen, Jiachi Wang, Yanlin Bi, Tingting Yu, Jianxing Wang, Yanli Lin, Xingwei Chen, Ting Zheng, Zibin Sun Yat-sen University China The State Key Laboratory of Blockchain and Data Security Zhejiang University China University of Western Australia Australia Zhejiang University China University of Electronic Science and Technology of China China

With the development of blockchain technology, smart contracts have become an important component of blockchain applications. Despite their crucial role, the development of smart contracts may introduce vulnerabilities and potentially lead to severe consequences, such as financial losses. Meanwhile, large language models, represented by ChatGPT, have gained great attentions, showcasing great capabilities in code analysis tasks. In this paper, we presented an empirical study to investigate the performance of ChatGPT in identifying smart contract vulnerabilities. Initially, we evaluated ChatGPT’s effectiveness using a publicly available smart contract dataset. Our findings discover that while ChatGPT achieves a high recall rate, its precision in pinpointing smart contract vulnerabilities is limited. Furthermore, ChatGPT’s performance varies when detecting different vulnerability types. We delved into the root causes for the false positives generated by ChatGPT, and categorized them into four groups. Second, by comparing ChatGPT with other state-of-the-art smart contract vulnerability detection tools, we found that ChatGPT’s F-score is lower than others for 3 out of the 7 vulnerabilities. In the case of the remaining 4 vulnerabilities, ChatGPT exhibits a slight advantage over these tools. Finally, we analyzed the limitation of ChatGPT in smart contract vulnerability detection, revealing that the robustness of ChatGPT in this field needs to be improved from two aspects: its uncertainty in answering questions;and the limited length of the detected code. In general, our research provides insights into the strengths and weaknesses of employing large language models, specifically ChatGPT, for the detection of smart contract vulnerabilities. Copyright © 2023, The Authors. All rights reserved.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

BSL: Understanding and Improving Softmax Loss for Recommendation

arXiv

引用

arXiv 2023年

作者： Wu, Junkang Chen, Jiawei Wu, Jiancan Shi, Wentao Zhang, Jizhi Wang, Xiang MoE Key Laboratory of Brain-inspired Intelligent Perception and Cognition University of Science and Technology of China Hefei China The State Key Laboratory of Blockchain and Data Security Zhejiang Unversity China Institute of Artificial Intelligence Institute of Dataspace Hefei Comprehensive National Science Center China

Loss functions steer the optimization direction of recommendation models and are critical to model performance, but have received relatively little attention in recent recommendation research. Among various losses, we find Softmax loss (SL) stands out for not only achieving remarkable accuracy but also better robustness and fairness. Nevertheless, the current literature lacks a comprehensive explanation for the efficacy of SL. Toward addressing this research gap, we conduct theoretical analyses on SL and uncover three insights: 1) Optimizing SL is equivalent to performing Distributionally Robust Optimization (DRO) on the negative data, thereby learning against perturbations on the negative distribution and yielding robustness to noisy negatives. 2) Comparing with other loss functions, SL implicitly penalizes the prediction variance, resulting in a smaller gap between predicted values and and thus producing fairer results. Building on these insights, we further propose a novel loss function Bilateral SoftMax Loss (BSL) that extends the advantage of SL to both positive and negative sides. BSL augments SL by applying the same Log-Expectation-Exp structure to positive examples as is used for negatives, making the model robust to the noisy positives as well. Remarkably, BSL is simple and easy-to-implement — requiring just one additional line of code compared to SL. Experiments on four real-world datasets and three representative backbones demonstrate the effectiveness of our proposal. The code is available at https://***/junkangwu/BSL. Copyright © 2023, The Authors. All rights reserved.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Efficient Adaptive Label Refinement for label noise learning

引用

Neurocomputing 2025年 639卷

作者： Zhang, Wenzhen Cheng, Debo Lu, Guangquan Zhou, Bo Li, Jiaye Zhang, Shichao School of Computer Science and Engineering Guangxi Normal University Guangxi Guilin541004 China Guangxi Key Lab of Multi-Source Information Mining & Security Guangxi Normal University Guangxi Guilin541004 China Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guangxi Guilin541004 China School of Computer Science and Technology Hainan University Hainan Haikou570228 China Guangxi Collaborative Innovation Center of Modern Sericulture and Silk Hechi University Guangxi Hechi546300 China The State Key Laboratory of Blockchain and Data Security Zhejiang University Zhejiang Hangzhou310027 China

Deep neural networks are highly susceptible to overfitting noisy labels, which leads to degraded performance. Existing methods address this issue by employing complex manually designed strategies, aiming to achieve optimal partitioning in each iteration to avoid fitting noisy labels while thoroughly learning clean samples. However, this often results in models that are overly sensitive to hyperparameters and challenging to train. To address this issue, we decouple the tasks of avoiding fitting incorrect labels and thoroughly learning clean samples, proposing a simple yet highly applicable method called Adaptive Label Refinement (ALR). First, inspired by label refurbishment techniques, we update the original hard labels to soft labels using the model's predictions to reduce the risk of fitting incorrect labels. Then, by introducing entropy loss, the model adaptively ’harden’ the high-confidence soft labels based on the confidence differences, guiding the model to focus more on learning from clean samples. This approach is simple and efficient, requiring no auxiliary datasets and minimal hyperparameter tuning, making it more adaptable than existing methods that require careful adjustments for different datasets. We validate ALR's effectiveness through experiments on benchmark datasets with artificial label noise (CIFAR-10/100) and real-world datasets with inherent noise (ANIMAL-10N, Clothing1M, WebVision). The results show that ALR outperforms state-of-the-art methods. © 2025

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

Advanced Maximal Biclique Enumeration on GPUs Using Bitmaps

引用

IEEE Transactions on Computers 2025年

作者： Pan, Zhe He, Shuibing Li, Xu Zhang, Xuechen Wang, Rui Yin, Yanlong Chen, Gang Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou310027 China Zhejiang University College of Computer Science and Technology Hangzhou310027 China Hangzhou310051 China Washington State University Vancouver School of Engineering and Computer Science VancouverWA98686 United States

Maximal biclique enumeration (MBE) in bipartite graphs is an important problem in data mining with many real-world applications. Parallel MBE algorithms for GPUs are needed for MBE acceleration leveraging its many computing cores. However, enumerating maximal bicliques using GPUs has three main challenges including large memory requirement, thread divergence, and load imbalance. In this paper, we propose GMBE+, an advanced GPU solution for the MBE problem. To overcome the challenges, we design (1) a node-reuse approach to reduce GPU memory usage with advanced node pruning, (2) a bitmap-based set intersection approach to minimize thread divergence, and (3) a load-aware task scheduling framework to achieve load balance among threads within GPU warps, facilitated by a novel set union approach. Our experiments reveal that GMBE+ is 1.2× faster than the latest GPU-based MBE algorithm GMBE on average when running on the same NVIDIA A100 GPU. © 1968-2012 IEEE.

关键词： Memory architecture

来源：评论

学校读者我要写书评

暂无评论

NegCPARBP: Enhancing Privacy Protection for Cross-Project Aging-Related Bug Prediction Based on Negative database

引用

IEEE Transactions on Emerging Topics in Computing 2025年

作者： Zhao, Dongdong Liu, Zhihui Zhang, Fengji Liu, Lei Keung, Jacky Wai Yu, Xiao Wuhan University of Technology School of Computer Science and Artificial Intelligence Wuhan China Wuhan University of Technology Chongqing Research Institute Chongqing China City University of Hong Kong Department of Computer Science Hong Kong Xi'an Jiaotong University School of Electronic Science and Engineering Xi'an China Zhejiang University State Key Laboratory of Blockchain and Data Security Hangzhou China

The emergence of Aging-Related Bugs (ARBs) poses a significant challenge to software systems, resulting in performance degradation and increased error rates in resourceintensive systems. Consequently, numerous ARB prediction methods have been developed to mitigate these issues. However, in scenarios where training data is limited, the effectiveness of ARB prediction is often suboptimal. To address this problem, CrossProject Aging-Related Bug Prediction (CPARBP) is proposed, which utilizes data from other projects (i.e., source projects) to train a model aimed at predicting potential ARBs in a target project. However, the use of source-project data raises privacy concerns and discourages companies from sharing their data. Therefore, we propose a method called Cross-Project AgingRelated Bug Prediction based on Negative database (NegCPARBP) for privacy protection. NegCPARBP first converts the feature vector of a software file into a binary string. Secondly, the corresponding Negative dataBase (NDB) is generated based on this binary string, containing data that is significantly more expressive from the original feature vector. Furthermore, to ensure more accurate prediction of ARB-prone and ARB-free files based on privacy-protected data (i.e., maintain the data utility), we propose a novel negative database generation algorithm that captures more information about important features, using information gain as a measure. Finally, NegCPARBP extracts a new feature vector from the NDB to represent the original feature vector, facilitating data sharing and ARB prediction objectives. Experimental results on Linux, MySQL, and NetBSD datasets demonstrate that NegCPARBP achieves a high defense against attacks (privacy protection performance reaching 0.97) and better data utility compared to existing privacy protection methods. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

data Governance: Status, Technologies, Applications and Development Trends 8

Data Governance: Status, Technologies, Applications and Deve...

引用

8th International Conference on data Science in Cyberspace, DSC 2023

作者： Zhu, Haiyang Chen, Xiaofeng Li, Suyan Wang, Yejin Fang, Xinwei Zhu, Minfeng Zhejiang University Wuchan Zhongda Digital Technology Co. Ltd. The State Key Lab of Cad&cg Hangzhou China Zhejiang University Hangzhou Qulian Technology Co. Ltd. The State Key Laboratory of Blockchain and Data Security Hangzhou China Zhejiang Institute of Mechanical & Electrical Engineering Hangzhou China Wuchan Zhongda Digital Technology Co. Ltd. Hangzhou China School of Medicine Zhejiang University Sir Run Run Shaw Hospital Department of Internet and Artificial Intelligence Hangzhou China Zhejiang University Hangzhou China

ISBN: (纸本)9798350331035

data governance involves legal, policy, technologies, and standards measures to ensure security, accuracy, integrity, consistency, and accessibility of data, with the primary objective of unlocking its latent value. In this context, the study initiates by scrutinizing the present status of data governance, subsequently identifying pivotal challenges through the lens of computer sciences. Moreover, to effectively grapple with the intricacies of high-dimensional data, data incompletion, and data redundancy within the realm of data governance, we present a compendium of data governance technology methodologies, encompassing data dimensionality reduction, data imputation, data deduplication, and data visualization. Further enhancing our discourse, we shed light on the typical scenarios of large-scale supply chain enterprises, elucidating data analysis and data intelligence applications. The convergence of these insights seeks to provide a comprehensive overview both data governance technology research and real-world application. © 2023 IEEE.

关键词： blockchain data Deduplication data Dimensionality Reduction data Governance data imputation data Intelligence

来源：评论

学校读者我要写书评

暂无评论

Towards Unified Token Learning for Vision-Language Tracking

arXiv

引用

arXiv 2023年

作者： Zheng, Yaozong Zhong, Bineng Liang, Qihua Li, Guorong Ji, Rongrong Li, Xianxian The Key Laboratory of Education Blockchain and Intelligent Technology Ministry of Education Guangxi Normal University Guilin541004 China The Guangxi Key Laboratory of Multi-Source Information Mining and Security Guangxi Normal University Guilin541004 China The School of Computer Science and Technology Key Laboratory of Big Data Mining and Knowledge Management University of Chinese Academy of Sciences Beijing100049 China Media Analytics and Computing Lab Department of Artificial Intelligence School of Informatics Xiamen University 361005 China

In this paper, we present a simple, flexible and effective vision-language (VL) tracking pipeline, termed MMTrack, which casts VL tracking as a token generation task. Traditional paradigms address VL tracking task indirectly with sophisticated prior designs, making them over-specialize on the features of specific architectures or mechanisms. In contrast, our proposed framework serializes language description and bounding box into a sequence of discrete tokens. In this new design paradigm, all token queries are required to perceive the desired target and directly predict spatial coordinates of the target in an auto-regressive manner. The design without other prior modules avoids multiple sub-tasks learning and hand-designed loss functions, significantly reducing the complexity of VL tracking modeling and allowing our tracker to use a simple cross-entropy loss as unified optimization objective for VL tracking task. Extensive experiments on TNL2K, LaSOT, LaSOText and OTB99-Lang benchmarks show that our approach achieves promising results, compared to other state-of-the-arts. Copyright © 2023, The Authors. All rights reserved.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Sustainability Forecasting for Deep Learning Packages

Sustainability Forecasting for Deep Learning Packages

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Junxiao Han Yunkun Wang Zhongxin Liu Lingfeng Bao Jiakun Liu David Lo Shuiguang Deng School of Computer & Computing Science Hangzhou City University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China The State Key Laboratory of Blockchain and Data Security Zhejiang University Hangzhou China School of Computing and Information Systems Singapore Management University Singapore Singapore

ISBN: (数字)9798350330663

ISBN: (纸本)9798350330670

Deep Learning (DL) technologies have been widely adopted to tackle various tasks. In this process, through software dependencies, a multi-layer DL supply chain (SC) is formed, with DL frameworks acting as the root, DL packages acting as the bridge nodes, and downstream DL projects acting as the periphery. However, most Open Source Software (OSS) projects may fail. Considering the crucial position of DL packages in the DL SC, to foster the sustainable development of DL SCs and DL packages, we aim to forecast the long-term sustainability of DL packages. Here, sustained activity is adopted as the main proxy of sustainability, and the sustainability status is classified as “sus-tainable” or “dormant”. Relatedly, a DL package is considered as “sustainable” if it has sustained activity in its last 12 months. Otherwise, it is deemed as “dormant”. To this end, we propose an approach that begins with obtaining longitudinal features for each DL package in each month. Then, we develop a model to forecast the sustainability of DL packages by incorporating the longitudinal features, which can aptly predict sustainability with an accuracy of up to 0.81. Subsequently, an interpretable module is developed to interpret the determinants (i.e., important features) that impact the sustainability of DL packages. Finally, we generate sustainability trajectories for each DL package to better understand the monthly changes of their sustainability status. Our findings uncover that for most DL packages, fewer but more centralized developers and a balanced collaboration are more likely to help sustain the DL packages. Furthermore, although some DL packages are sustainable, their sustainability trajectories present statistically decreasing trends over time. Based on the findings, we shed light on the dynamic sustainability of DL packages, highlight future research directions, and provide practical suggestions to DL package maintainers, developers, users, and software engineering researchers.

关键词： Deep learning Supply chains Predictive models Market research Trajectory Sustainable development Task analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：