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

2023 IEEE International Conference on Web services, ICWS 2023

作者： Liu, Yi Liu, Jianxun Zhang, Xiangping Hu, Haize Hunan University of Science and Technology Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan411201 China Hunan University of Humanities Science and Technology School of Informationn Loudi417000 China Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan411201 China

ISBN: (纸本)9798350304855

Code completion, which can accelerate the software development process and improve the quality of software products, is an essential part of today's integrated development environments. It has become an important research topic in the field of software engineering. Recent studies have shown that the method of code completion based on the Abstract Syntax Tree (AST) learns syntactic information about the code, which helps to improve the accuracy of code completion. However, when modeling neural networks for ASTs, the sequencing operation of nodes leads to the loss of their hierarchical structure information. Meanwhile, traditional neural networks cannot predict many Out-of-Vocabulary (OoV) words in the terminal node values of AST. To alleviate the above problem, in this paper, we propose a Multiple-Path Learning neural network model for code completion (MPL) based on an AST by learning from a large-scale corpus. In this model, multiple paths such as context path, root path, and terminal node path are established to understand different code features required for node prediction and improve code representation ability. Based on the principle of program local repeatability, it also adopts a replication mechanism to copy the appropriate OoV words from the local terminal node path as the prediction result, further improving the prediction accuracy. The experimental results show that the MPL model has better performance than existing methods on the code completion task. © 2023 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

JSRevealer: A Robust Malicious JavaScript Detector against Obfuscation

JSRevealer: A Robust Malicious JavaScript Detector against O...

引用

International Conference on Dependable systems and Networks (DSN)

作者： Kunlun Ren Weizhong Qiang Yueming Wu Yi Zhou Deqing Zou Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jinyinhu Laboratory Wuhan China Nanyang Technological University Singapore 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

Due to the convenience and popularity of Web applications, they have become a prime target for attackers. As the main programming language for Web applications, many methods have been proposed for detecting malicious JavaScript, among which static analysis-based methods play an important role because of their high effectiveness and efficiency. However, obfuscation techniques are commonly used in JavaScript, which makes the features extracted by static analysis contain many useless and disguised features, leading to many false positives and false negatives in detection results. In this paper, we propose a novel method to find out the essential features related to the semantics of JavaScript code. Specifically, we develop JS-Revealer, a robust, effective, scalable, and interpretable detector for malicious JavaScript. To test the capabilities of JSRevealer, we conduct comparative experiments with four other state-of-the-art malicious JavaScript detection tools. The experimental results show that JSRevealer has an average F1 of 84.8% on the data obfuscated by different obfuscators, which is 21.6%, 22.3%, 18.7%, and 22.9% higher than the tools CUJO, ZOZZLE, JAST, and JSTAP, respectively. Moreover, the detection results of JSRevealer can be interpreted, which can provide meaningful insights for further security research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mining World Indicators for Analyzing and Modeling the Development of Countries

引用

ACM/IMS Transactions on Data Science 2021年第4期2卷 1–27页

作者： Huang, Hong Chi, Mingyuan Song, Yu Jin, Hai The National Engineering Research Center for Big Data Technology and System Key Laboratory of Service Computing Technology and System Ministry of Education School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China

The world indicators released by the World Bank or other organizations usually give the basic public knowledge about the world. However, separate and static index lacks the complex interplay among different indicators and thus cannot help us have an overall understanding of the world. To this end, we study the world indicators from a different angle. Firstly, we discover that there exist correlations between indicators either from a static view or from a dynamic view. Moreover, taking the trade and diplomatic relationships into consideration, we construct a multi-relational network to depict the interactions between different countries, and propose a Multiple Relations to Vector (MR2vec) model to study world indicators from a network perspective. The experimental results show the changes of world indicators are predictable with the proposed model, and our proposed MR2vec has wide adaptability in predicting multi-relation networks. © 2022 Copyright held by the owner/author(s).

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Attack by Yourself: Effective and Unnoticeable Multi-Category Graph Backdoor Attacks with Subgraph Triggers Pool

arXiv

引用

arXiv 2024年

作者： Li, Jiangtong Liu, Dongyi Cheng, Dawei Jiang, Changjun School of Computer Science and Technology Tongji University Shanghai China Key Laboratory of Embedded System and Service Computing Ministry of Education China

Graph Neural Networks (GNNs) have achieved significant success in various real-world applications, including social networks, finance systems, and traffic management. Recent researches highlight their vulnerability to backdoor attacks in node classification, where GNNs trained on a poisoned graph misclassify a test node only when specific triggers are attached. These studies typically focus on single attack categories and use adaptive trigger generators to create node-specific triggers. However, adaptive trigger generators typically have a simple structure, limited parameters, and lack category-aware graph knowledge, which makes them struggle to handle backdoor attacks across multiple categories as the number of target categories increases. We address this gap by proposing a novel approach for Effective and Unnoticeable Multi-Category (EUMC) graph backdoor attacks, leveraging subgraph from the attacked graph as category-aware triggers to precisely control the target category. To ensure the effectiveness of our method, we construct a Multi-Category Subgraph Triggers Pool (MC-STP) using the subgraphs of the attacked graph as triggers. We then exploit the attachment probability shifts of each subgraph trigger as category-aware priors for target category determination. Moreover, we develop a "select then attach" strategy that connects suitable category-aware trigger to attacked nodes for unnoticeability. Extensive experiments across different real-world datasets confirm the efficacy of our method in conducting multi-category graph backdoor attacks on various GNN models and defense strategies. © 2024, CC BY-NC-SA.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Information Security Evaluation by Information Flow Analysis Based on Stochastic Petri Nets

Information Security Evaluation by Information Flow Analysis...

引用

2024 IEEE International Conference on systems, Man, and Cybernetics, SMC 2024

作者： Tu, Hanqian Xiang, Dongming Lin, Wang Liu, Guanjun Zhejiang Sci-Tech University Department of Computer Science and Technology Hangzhou310018 China Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Key Laboratory of Embedded System and Service Computing Ministry of Education Department of Computer Science Shanghai201804 China

ISBN: (纸本)9781665410205

The Petri-net-based information flow analysis offers an effective approach for detecting information leakage by the concept of non-interference. Although the related studies propose efficient solutions, they lack quantitative evaluation on information leakage. In this paper, we propose a novel method for quantitative evaluation of information security based on stochastic labeled Petri nets (SLPNs) and information flow analysis. Specifically, we introduce four different levels of security metrics, and provide a methodology for evaluating the information security. Furthermore, a case study is presented to show the feasibility of our method. © 2024 IEEE.

关键词： Information leakage

来源：评论

学校读者我要写书评

暂无评论

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZERO-SHOT IMAGE RECOGNITION

CONSISTENT REPRESENTATION LEARNING ACROSS MODALITIES FOR ZER...

引用

2021 IEEE International Conference on Multimedia and Expo, ICME 2021

作者： Wang, Yu Zhao, Sev-Jue Key Laboratory of Embedded System and Service Computing Ministry of Education China HaiBa Technology China

ISBN: (纸本)9781665438643

Zero-shot learning (ZSL) recently has drawn widespread attention due to the demand for scalability of object recognition in real scenes. Existing approaches typically focus on directly learning various mapping functions from the visual space to the semantic space or vice versa. However, these methods fail to explicitly capture consistent representations reflecting the nature of different modalities of the same object, which results in the deterioration of the domain shift problem in the ZSL context during the testing stage. To this end, a consistent representation learning mechanism across visual modalities and the associated semantic modalities based on common subspace learning is proposed in this paper. We further impose an orthogonal constraint on the subspace for informative representations, as well as 21-norm regularization terms on projection matrices for automatic feature selection. Finally, an iterative process based on the ALM algorithm with an alternating direction strategy is displayed to resolve the proposed formulation. Extensive experimental results on four popular datasets demonstrate that our algorithm is promising. © 2021 IEEE

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Prototype Guided Personalized Federated Intrusion Detection system 10

Prototype Guided Personalized Federated Intrusion Detection ...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Cheng, Long Yan, Huiru Zhou, Hanlin Wang, Ying Tang, Haichuan Fang, Fang North China Electric Power University State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Control and Computer Engineering Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China Ai Lab of Crrc Academy Beijing China

ISBN: (纸本)9798331520861

Preventing network attacks and protecting user privacy are consistently hot research topics in the Internet of Things (IoT) and edge computing fields. Recent advancements in Federated Learning (FL) have shown promise in addressing these challenges. FL allows various clients to collaboratively build an intrusion detection system (IDS) without sharing their private data. However, most existing methods train a single intrusion detection model for all clients and assume that the training and test data distribution are identical, leading to unsatisfactory detection accuracy and generalization abilities in practice. To overcome these challenges, this paper introduces a prototype-guided personalized FL approach named PG-FedIDS. We propose two novel mechanisms within this method. Firstly, we utilize class prototypes as auxiliary information carriers to generate personalized models for each client, rather than generating a single global model as in previous works. Secondly, we propose a prototype-guided ensemble learning strategy, which can leverage the global knowledge in prototypes to enhance detection accuracy and generalization abilities for each client. We conduct extensive experiments on two benchmark datasets with different evaluation test settings. The results demonstrate that our PG-FedIDS achieves promising detection accuracy and consistently outperforms other FL baselines. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Using Experience Classification for Training Non-Markovian Tasks

arXiv

引用

arXiv 2023年

作者： Miao, Ruixuan Lu, Xu Tian, Cong Yu, Bin Duan, Zhenhua Institute of Computing Theory and Technology State Key Laboratory of Integrated Services Networks Xidian University China

Unlike the standard Reinforcement Learning (RL) model, many real-world tasks are non-Markovian, whose rewards are predicated on state history rather than solely on the current state. Solving a non-Markovian task, frequently applied in practical applications such as autonomous driving, financial trading, and medical diagnosis, can be quite challenging. We propose a novel RL approach to achieve non-Markovian rewards expressed in temporal logic LTLf (Linear Temporal Logic over Finite Traces). To this end, an encoding of linear complexity from LTLf into MDPs (Markov Decision Processes) is introduced to take advantage of advanced RL algorithms. Then, a prioritized experience replay technique based on the automata structure (semantics equivalent to LTLf specification) is utilized to improve the training process. We empirically evaluate several benchmark problems augmented with non-Markovian tasks to demonstrate the feasibility and effectiveness of our approach. Copyright © 2023, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Reliability-Aware DQN-based Optimization Method of Initial Mapping Solutions in Optical Network-on- Chip (ONoC) 21

Reliability-Aware DQN-based Optimization Method of Initial M...

引用

21st International Conference on Optical Communications and Networks, ICOCN 2023

作者： Niu, Yuxiang Li, Hui Liu, Feiyang Xidian University State Key Laboratory of Integrated Services Network School of Telecommunications Engineering Xi'an China Hangzhou Institute of Technology Xidian University Hangzhou China Xi'an Aeronautics Computing Technique Research Institute Avic Xi'an China

ISBN: (纸本)9798350343502

Optical Network-on-Chip (ONoC) provides a promising solution for on-chip communication with higher bandwidth and lower latency, compared to traditional Electrical Network-on-Chip (ENoC). However, the reliability challenges (such as insertion loss and crosstalk) exist in ONoC. As for this issue, reliability-aware mapping can be considered. This work proposes a reliability-aware DQN-based optimization method of initial mapping solutions in ONoC, to generate better initial mapping solutions. This optimization method of initial mapping solutions can be combined with existing mapping algorithms, further improving the mapping performance. The evaluation results show that for a given core graph and network topology, our proposed method generates better solutions compared to the traditional random method. Also, the proposed method is helpful for finding the optimal mapping solution more efficiently when combined with the existing mapping algorithms. © 2023 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Automatic skin lesion classification using a novel densely connected convolutional network integrated with an attention module

引用

Journal of Ambient Intelligence and Humanized computing 2023年第7期14卷 8943-8956页

作者： Shan, Pufang Chen, Jialei Fu, Chong Cao, Lin Tie, Ming Sham, Chiu-Wing School of Computer Science and Engineering Northeastern University Shenyang110819 China Engineering Research Center of Security Technology of Complex Network System Ministry of Education Shenyang China Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Northeastern University Shenyang110819 China School of Information and Communication Engineering Beijing Information Science and Technology University Beijing100101 China Science and Technology on Space Physics Laboratory Beijing100076 China School of Computer Science The University of Auckland Auckland New Zealand

Automated skin lesion classification in dermoscopy images remains challenging due to the existence of artefacts and intrinsic cutaneous features, diversity of lesion morphology, insufficiency of training data, and class imbalance problem. To address these challenges, we propose a new densely connected convolutional network termed AttDenseNet-121, which is obtained by integrating the convolutional block attention module (CBAM) into DenseNet-121. CBAM is a simple yet efficient attention module, which is further improved by adding a novel pooling layer (multiscale-pooling) to effectively enhance its attention capability. The optimized CBAM strengthens the representation power of DenseNet-121 by emphasizing meaningful features and suppressing unnecessary ones, thus significantly enhancing the classification performance. Besides, to handle the imbalanced dataset, we employ an improved focal loss function rather than the traditional cross-entropy loss function to train AttDenseNet-121. The improved focal loss is calculated from a different perspective compared with the original focal loss. It makes the distribution of positive samples and negative samples in each batch the same as that in the original data, successfully mitigating the negative influence of class imbalance on this multi-class classification task. We conduct extensive experiments on the public benchmark dataset (HAM10000) and the results indicate that our proposed method achieves superior performance compared with that of the baselines and state-of-the-art algorithms. © 2022, The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：