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

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Confidence Estimation Based on the Explanations of Model's Predictions

Confidence Estimation Based on the Explanations of Model's P...

引用

2023 International Conference on Neuromorphic Computing, ICNC 2023

作者： Wu, Kaiyue Huang, Changwu Yao, Xin Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Department of Computer Science and Engineering Shenzhen518055 China Southern University of Science and Technology Research Institute of Trustworthy Autonomous Systems Shenzhen518055 China

ISBN: (纸本)9798350316889

Estimating the confidence of a machine learning (ML) model plays an important role in minimizing undesirable outcomes and safety risks when using ML models in the real world, especially in high-stake application scenarios. However, the majority of existing confidence estimation methods do not work well without incorporating internal information from the model, such as the gradients, internal representations or checkpoints of its training process, which might compromise the security of the model. To alleviate such limitations, we intend to design a reliable confidence estimation method that requires as little internal model information as possible, yet precisely detecting uncertain samples for the model. In this work, we propose a confidence estimation approach that learns the confidence criterion (that is, the true class probability, TCP) based on the explanations of model's predictions. The proposed approach utilizes the knowledge learned in the model with the leverage of the explanations for model's prediction rather than directly extracting internal information of the model, so that it can be adopted in a wide range of applications. Several experiments, including experiments on different datasets, different models and non-IID (independent and identically distributed) test datasets, are conducted to examine the effectiveness of our confidence estimation method. The experimental results show that our proposed approach provides a reliable confidence estimation and generally performs better than the compared methods, especially in the capability of recognizing when a ML model makes errors. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

STARS Assisted Semi-Grant-Free NOMA Communications

引用

IEEE Transactions on Wireless Communications 2025年第6期24卷 4904-4919页

作者： Xie, Jin Yue, Xinwei Zhao, Jingjing Zou, Yixuan Liu, Yuanwei Liu, Rongke Ding, Zhiguo Key Laboratory of Information and Communication Systems China Beijing Information Science and Technology University Key Laboratory of Modern Measurement and Control Technology Ministry of Education Beijing100101 China Beihang University School of Electronic and Information Engineering Beijing100191 China Queen Mary University of London School of Electronic Engineering and Computer Science LondonE1 4NS United Kingdom The University of Hong Kong Department of Electrical and Electronic Engineering Hong Kong Hong Kong Kyung Hee University Department of Electronic Engineering Gyeonggi-do Yongin-si17104 Korea Republic of Khalifa University Department of Computer and Information Engineering Abu Dhabi United Arab Emirates

This paper investigates the performance of simultaneously transmitting and reflecting surface (STARS) assisted semi-grant-free non-orthogonal multiple access network with randomly distributed users. By deploying STARS, the transmit signals of grant-based user (GBU) and grant-free users (GFUs) can be exquisitely adjusted to reduce interference. We propose a maximum channel scheduling (MCS) protocol that allows a GFU to access GBU’s channel with the assistance of STARS. In particular, the impacts of perfect/imperfect successive interference cancellation (pSIC/ipSIC) on MCS protocol are taken into account. To characterize the performance of STARS aided MCS (STARS-MCS) network, we derive the expressions of outage probability for GBU and GFU with pSIC/ipSIC. By applying convolution theorem and Laplace transform, the asymptotic expressions of outage probability and diversity orders for GBU and GFU are attained. We further design a STARS-based power control (SPC) strategy to eliminate the outage probability error floor and improve the outage performance. Numerical results show that: 1) The performance of STARS-MCS outperforms the existing benchmarks in terms of outage probability and system throughput;2) The SPC strategy can effectively improve the performance of the STARS-MCS network and eliminate the outage probability error floor at high signal-to-noise ratios;and 3) By adjusting reflection and transmission coefficients of STARS, the outage performance of GBU and GFU can be greatly enhanced. © 2025 IEEE. All rights reserved.

关键词： Laplace transforms

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Wireless Federated Learning: A Secrecy Oriented Design via Sequential Artificial Jamming

引用

IEEE Transactions on Vehicular technology 2023年第5期72卷 6412-6427页

作者： Wang, Tianshun Huang, Ning Wu, Yuan Quek, Tony Q. S. University of Macau State Key Laboratory of Internet of Things for Smart City 999078 China University of Macau Department of Computer and Information Science 999078 China University of Macau State Key Lab of Internet of Things for Smart City The Department of Computer and Information Science 999078 China Zhuhai UM Science and Technology Research Institute Zhuhai519031 China Singapore University of Technology and Design Information Systems Technology and Design Pillar 487372 Singapore National Cheng Kung University Tainan701 Taiwan

Wireless federated learning (FL) is envisioned as a promising paradigm of distributed learning in wireless networks without disclosing users' data privacy. However, radio channel leads to a potential risk of eavesdropping attack when sending the trained model data in wireless networks. To address this eavesdropping attack, in this work, we propose an energy-efficient wireless FL by using artificial jamming. Specifically, the group of wireless devices (WDs) adopt the time division multiple access (TDMA) approach to send their locally trained models to the FL server for model aggregation subject to the eavesdropping attack of a malicious node. When one of the WDs sends its local model, all the other WDs send the artificial jamming signals to interfere with the eavesdropper, which helps increase the secrecy throughput of the targeted WD for uploading its local model. Different from many existing studies using stochastic gradient descent (SGD), we adopt the stochastic average gradient (SAG) method in the local training to improve the convergence of FL and derive the corresponding lower bound of the FL convergence rate via SAG. Furthermore, we formulate an optimization problem that aims at minimizing the energy consumption of the WDs by jointly optimizing different WDs' local training time, their uploading transmission time in TDMA and the transmit-powers for providing artificial jamming, as well as the FL configurations of the local/global iterations. We also propose an efficient algorithm for solving this non-convex optimization problem. Numerical results are illustrated to validate the advantages of our design of wireless FL and the corresponding algorithms. In particular, the results demonstrate that our secrecy oriented energy-efficient FL can significantly outperform the other heuristic FL schemes. © 1967-2012 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A distributed Framework for Large-scale Protein-protein Interaction Data Analysis and Prediction Using MapReduce

引用

IEEE/CAA Journal of Automatica Sinica 2022年第1期9卷 160-172页

作者： Lun Hu Shicheng Yang Xin Luo Huaqiang Yuan Khaled Sedraoui MengChu Zhou School of Computer Science and Technology Dongguan University of TechnologyDongguan 523808China School of Computer Science and Technology Wuhan University of TechnologyWuhan 430070China Chongqing Engineering Research Center of Big Data Application for Smart Cities and Chongqing Key Laboratory of Big Data and Intelligent ComputingChongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714China Xinjiang Technical Institute of Physics and Chemistry Chinese Academy of SciencesUrumqi 830000China Center of Research Excellence in Renewable Energy and Power Systems and the Department of Electrical and Computer EngineeringFaculty of EngineeringKing Abdulaziz UniversityJeddah 21589Saudi Arabia Department of Electrical and Computer Engineering New Jersey Institute of TechnologyNewarkNJ 07102 USA

Protein-protein interactions are of great significance for human to understand the functional mechanisms of *** the rapid development of high-throughput genomic technologies,massive protein-protein interaction(PPI)data have been generated,making it very difficult to analyze them *** address this problem,this paper presents a distributed framework by reimplementing one of state-of-the-art algorithms,i.e.,CoFex,using *** do so,an in-depth analysis of its limitations is conducted from the perspectives of efficiency and memory consumption when applying it for large-scale PPI data analysis and *** solutions are then devised to overcome these *** particular,we adopt a novel tree-based data structure to reduce the heavy memory consumption caused by the huge sequence information of *** that,its procedure is modified by following the MapReduce framework to take the prediction task distributively.A series of extensive experiments have been conducted to evaluate the performance of our framework in terms of both efficiency and *** results well demonstrate that the proposed framework can considerably improve its computational efficiency by more than two orders of magnitude while retaining the same high accuracy.

关键词： distributed computing large-scale prediction machine learning MapReduce protein-protein interaction(PPI)

来源：评论

学校读者我要写书评

暂无评论

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for Highly-Effective Drug-Protein Interaction Representation

DrugProtKGE: Weakly Supervised Knowledge Graph Embedding for...

引用

2023 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2023

作者： Qiu, Yanlong Wang, Siqi Yang, Xi Qiu, Xinyuan Wu, Chengkun Cui, Yingbo Yang, Canqun National University of Defense Technology Institute for Quantum Information State Key Laboratory of High-Performance Computing College of Computer Science Hunan Changsha410073 China National Supercomputer Center in Tianjin Tianjin300457 China National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science Hunan Changsha410073 China National University of Defense Technology Department of Biology and Chemistry College of Science Hunan Changsha410073 China

ISBN: (纸本)9798350337488

With the exponential growth of biomedical knowledge in unstructured text repositories such as PubMed, it is imminent to establish a knowledge graph-style, efficient searchable and targeted database that can support the need of information retrieval from researchers and clinicians. To mine knowledge from graph databases, most previous methods view a triple in a graph (see Fig. 1) as the basic processing unit and embed the triplet element (i.e. drugs/chemicals, proteins/genes and their interaction) as separated embedding matrices, which cannot capture the semantic correlation among triple elements. To remedy the loss of semantic correlation caused by disjoint embeddings, we propose a novel approach to learn triple embeddings by combining entities and interactions into a unified representation. Furthermore, traditional methods usually learn triple embeddings from scratch, which cannot take advantage of the rich domain knowledge embedded in pre-trained models, and is also another significant reason for the fact that they cannot distinguish the differences implied by the same entity in the multi-interaction triples. In this paper, we propose a novel fine-tuning based approach to learn better triple embeddings by creating weakly supervised signals from pre-trained knowledge graph embeddings. The method automatically samples triples from knowledge graphs and estimates their pairwise similarity from pre-trained embedding models. The triples are then fed pairwise into a Siamese-like neural architecture, where the triple representation is fine-tuned in the manner bootstrapped by triple similarity scores. Finally, we demonstrate that triple embeddings learned with our method can be readily applied to several downstream applications (e.g. triple classification and triple clustering). We evaluated the proposed method on two open-source drug-protein knowledge graphs constructed from PubMed abstracts, as provided by BioCreative. Our method achieves consistent improvement in both t

关键词： Drug-Protein Interaction Knowledge Graph Embedding Triple Embedding Weakly Supervised Learning

来源：评论

学校读者我要写书评

暂无评论

Deep Semantic and Attentive Network for Unsupervised Video Summarization

引用

ACM Transactions on Multimedia Computing, Communications and Applications 2022年第2期18卷 1–21页

作者： Zhong, Sheng-Hua Lin, Jingxu Lu, Jianglin Fares, Ahmed Ren, Tongwei College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Department of Electrical Engineering Computer Systems Engineering Program Faculty of Engineering at Shoubra Benha University Cairo Egypt State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

With the rapid growth of video data, video summarization is a promising approach to shorten a lengthy video into a compact version. Although supervised summarization approaches have achieved state-of-the-art performance, they require frame-level annotated labels. Such an annotation process is time-consuming and tedious. In this article, we propose a novel deep summarization framework named Deep Semantic and Attentive Network for Video Summarization (DSAVS) that can select the most semantically representative summary by minimizing the distance between video representation and text representation without any frame-level labels. Another challenge associated with video summarization tasks mainly originates from the difficulty of considering temporal information over a long time. Long Short-Term Memory (LSTM) performs well for temporal dependencies modeling but does not work well with long video clips. Therefore, we introduce a self-attention mechanism into our summarization framework to capture the long-range temporal dependencies among the frames. Extensive experiments on two popular benchmark datasets, i.e., SumMe and TVSum, show that our proposed framework outperforms other state-of-the-art unsupervised approaches and even most supervised methods. © 2022 Association for Computing Machinery.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

RuleRAG: Rule-Guided Retrieval-Augmented Generation with Language Models for Question Answering

arXiv

引用

arXiv 2024年

作者： Chen, Zhongwu Xu, Chengjin Wang, Dingmin Huang, Zhen Dou, Yong Jiang, Xuhui Guo, Jian National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology China IDEA Research International Digital Economy Academy Department of Computer Science University of Oxford United Kingdom

Retrieval-augmented generation (RAG) has shown promising potential in knowledge intensive question answering (QA). However, existing approaches only consider the query itself, neither specifying the retrieval preferences for the retrievers nor informing the generators of how to refer to the retrieved documents for the answers, which poses a significant challenge to the QA performance. To address these issues, we propose Rule-guided Retrieval-Augmented Generation with LMs, which explicitly introduces rules for in-context learning (RuleRAG-ICL) to guide retrievers to recall related documents in the directions of rules and uniformly guide generators to reason attributed by the same rules. The combination of queries and rules can be used as fine-tuning data to update retrievers and generators, achieving better rule-based instruction-following ability (RuleRAG-FT). Moreover, most existing RAG datasets were constructed without considering rules and Knowledge Graphs (KGs) are recognized as providing high-quality rules. Therefore, we construct five rule-aware RAG benchmarks for QA, RuleQA, based on KGs to stress the significance of retrieval and reasoning with rules. Experiments on RuleQA demonstrate RuleRAG-ICL improves the retrieval quality of +89.2% in Recall@10 and answer accuracy of +103.1% in Exact Match, and RuleRAG-FT yields more enhancement. In addition, experiments on four existing RAG datasets show RuleRAG is also effective by offering rules in RuleQA to them, further proving the generalization of rule guidance in RuleRAG. Code and RuleQA are at https://***/r/RuleRAG. Copyright © 2024, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

A Synchronous Parallel Method with Parameters Communication Prediction for distributed Machine Learning 19th

A Synchronous Parallel Method with Parameters Communication...

引用

19th EAI International Conference on Collaborative Computing: Networking, Applications and Worksharing, CollaborateCom 2023

作者： Zeng, Yanguo Xue, Meiting Xu, Peiran Shi, Yukun Zeng, Kaisheng Zhang, Jilin Yue, Lupeng School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou310018 China Data Security Governance Zhejiang Engineering Research Center Hangzhou310018 China National University of Defense Technology Changsha China School of Cyberspace HangZhou Dianzi University Hangzhou China Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9783031545306

With the development of machine learning technology in various fields, such as medical care, smart manufacturing, etc., the data has exploded. It is a challenge to train a deep learning model for different application domains with large-scale data and limited resources of a single device. The distributed machine-learning technology, which uses a parameter server and multiple clients to train a model collaboratively, is an excellent method to solve this problem. However, it needs much communication between different devices with limited communication resources. The stale synchronous parallel method is a mainstream communication method to solve this problem, but it always leads to high synchronization delay and low computing efficiency as the inappropriate delay threshold value set by the user based on experience. This paper proposes a synchronous parallel method with parameters communication prediction for distributed machine learning. It predicts the optimal timing for synchronization, which can solve the problem of long synchronization waiting time caused by the inappropriate threshold settings in the stale synchronous parallel method. Moreover, it allows fast nodes to continue local training while performing global synchronization, which can improve the resource utilization of work nodes. Experimental results show that compared with the delayed synchronous parallel method, the training time and quality, and resource usage of our method are both significantly improved. © ICST Institute for computer sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Enhancing Code Representation Learning for Code Search with Abstract Code Semantics

Enhancing Code Representation Learning for Code Search with ...

引用

International Joint Conference on Neural Networks (IJCNN)

作者： Shaojie Zhang Yiwei Ding Enrui Hu Yue Yu Yu Zhang Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Peng Cheng Laboratory Shenzhen China Distributed and Parallel Software Lab Huawei Shenzhen China

ISBN: (数字)9798350359312

ISBN: (纸本)9798350359329

Code representation learning is an important way to encode the semantics of source code through pre-training. The learned representation supports a variety of downstream tasks, such as natural language code search and code defect detection. Inspired by pre-trained models for natural language representation learning, existing approaches often treat the source code or its structural information (e.g., Abstract Syntax Tree or AST) as a plain token sequence. Unlike natural language, programming language has its unique code unit information (e.g., identifiers and expressions) and logic information (e.g., the functionality of a code snippet). To further explore those properties, we propose Abstract Code Embedding (AbCE), a self-supervised learning method that considers the abstract semantics of code logic. Instead of scattered tokens, AbCE treats an entire node or a subtree in an AST as a basic code unit during pre-training, which preserves the entirety of a coding unit. Moreover, AbCE learns the abstract semantics of AST nodes via a self-distillation way. Experimental results show that it achieves significant improvements over state-of-the-art baselines on code search tasks and comparable performance on code clone detection and defect detection tasks even without using contrastive learning or curriculum learning.

关键词： Representation learning Codes Source coding Semantics Natural languages Cloning Syntactics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：