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

Proceedings of the 2022 International Conference on Cyber Security

作者： Ruo nan Wang Jin long Fei Rong kai Zhang State Key Laboratory of Mathematical Engineering and Advanced Computing PLA Strategic Support Force Information Engineering University Zhengzhou China China

ISBN: (纸本)9798400700132

With the continuous development of deep learning, deep neural networks are gradually applied to traffic classification problems. However, the large network structure and parameter number of deep neural networks hinder the application on edge computing devices. Reducing network scale helps relieve computational pressure, this paper proposes a lightweight traffic classification model to provide reliable accuracy and reduce the consumption of computing resources. In this work, we design an F1DCN network, which takes full advantage of the convolution layer parameters and the convolution kernel field of view. The lightweight approach effectively improves the classification performance and saves massive parameters. The model pruning method is applied to find the optimal structure of the network. Experiments on two public datasets show that the proposed model reduce more than 80 % parameters and 45 % FLOPS compared with traditional traffic classification methods, and maintaining more than 95 % classification accuracy.

关键词： Convolutional neural network Lightweight Model pruning Traffic classification

来源：评论

学校读者我要写书评

暂无评论

Audit-LLM: Multi-Agent Collaboration for Log-based Insider Threat Detection

arXiv

引用

arXiv 2024年

作者： Song, Chengyu Ma, Linru Zheng, Jianming Liao, Jinzhi Kuang, Hongyu Yang, Lin Systems Engineering Institute Academy of Military Sciences Beijing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China National University of Defense Technology National Key Laboratory of Information Systems Engineering Changsha China

Log-based insider threat detection (ITD) detects malicious user activities by auditing log entries. Recently, Large Language Models (LLMs) with strong common sense knowledge are emerging in the domain of ITD. Nevertheless, diverse activity types and overlong log files pose a significant challenge for LLMs to directly discern malicious ones within myriads of normal activities. Furthermore, the faithfulness hallucination issue from LLMs aggravates its application difficulty in ITD, as the generated conclusion may not align with user commands and activity context. In response to these challenges, we introduce Audit-LLM, a multi-agent log-based insider threat detection framework comprising three collaborative agents: (i) the Decomposer agent, breaking down the complex ITD task into manageable sub-tasks using Chain-of-Thought (COT) reasoning;(ii) the Tool Builder agent, creating reusable tools for sub-tasks to overcome context length limitations in LLMs;and (iii) the Executor agent, generating the final detection conclusion by invoking constructed tools. To enhance conclusion accuracy, we propose a pair-wise Evidence-based Multi-agent Debate (EMAD) mechanism, where two independent Executors iteratively refine their conclusions through reasoning exchange to reach a consensus. Comprehensive experiments conducted on three publicly available ITD datasets—CERT r4.2, CERT r5.2, and PicoDomain—demonstrate the superiority of our method over existing baselines and show that the proposed EMAD significantly improves the faithfulness of explanations generated by LLMs. 1 2 Copyright © 2024, The Authors. All rights reserved.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Disentangling Ensemble Models on Adversarial Generalization in Image Classification

Disentangling Ensemble Models on Adversarial Generalization ...

引用

International Conference on Electronic engineering and Informatics (EEI)

作者： Chenwei Li Mengyuan Pan Bo Yang Hengwei Zhang State Key Laboratory of Mathematical Engineering and Advanced Computing Henan Key Laboratory of Information Security Zhengzhou China Guizhou University School of Chemistry and Chemical Engineering Guiyang China

Convolutional neural networks are widely used in computer vision and image processing. However, when the original input is added with manually imperceptible perturbations, these deep network models mostly tend to output incorrect predictions. The vulnerability of these models poses great threat to intelligent applications, and these manually imperceptible perturbations are called adversarial examples. Current baseline methods have achieved considerable white-box attack success rate, but black-box rate remains to be improved. To boost the adversarial generalization, ensemble models method is introduced to the process of generating adversarial examples. This paper proposes multiple ensemble strategies with baseline attack methods based on existing ensemble strategy used by former methods. Experiment on ImageNet dataset empirically verifies the optimal ensemble strategy on boosting adversarial generalization.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Binary Function Name Prediction Method Based on Variable Alignment and Translation Model 23

A Binary Function Name Prediction Method Based on Variable A...

引用

Proceedings of the 2023 4th International Conference on Machine Learning and Computer Application

作者： Bing Xia Jiabin Yin Yunxiang Ge Ruinan Yang Key Laboratory of Mathematical Engineering and Advanced Computing ZhongYuan University of Technology China Henan Key Laboratory on Public Opinion Intelligent Analysis ZhongYuan University of Technology China ZhongYuan University of Technology China

ISBN: (纸本)9798400709449

Binary function naming is a code analysis task that generates functional descriptions of functions, and its results can be applied in the fields of malicious code analysis, vulnerability causation analysis, and algorithm governance. Aiming at the shortcomings of the pseudocode abstract syntax tree being difficult to extract and the binary function naming scheme having low accuracy rate, a binary function naming prediction model A2N based on variable alignment and sequence translation model is proposed. First, A2N extracts the function variable features of binary files from debugging information and performs variable alignment with the pseudocode obtained from decompiling; then, it obtains the hierarchical structure of the binary functions and designs the node extraction rules to generate an abstract syntax tree AST for each function; then, extract the paths between the leaf nodes of the AST and serialize the tree structure to represent it; finally, with the help of the neural network translation model, establish a mapping between the AST and the binary function names to realize the prediction function. The experimental results show that compared with Dire, Nero and XFL models, the F1 value of A2N is improved by 84%, 44% and 14% on file-level isolation experiments respectively, and the F1 value reaches 80.94% on function-level isolation experiments.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Boosting Performance and QoS for Concurrent GPU B+trees by Combining-Based Synchronization 23

Boosting Performance and QoS for Concurrent GPU B+trees by C...

引用

28th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, PPoPP 2023

作者： Zhang, Weihua Zhao, Chuanlei Peng, Lu Lin, Yuzhe Zhang, Fengzhe Lu, Yunping School of Computer Science Fudan University China Institute of Big Data Fudan University China State Key Laboratory of Mathematical Engineering and Advanced Computing China Parallel Processing Institute Fudan University China Department of Computer Science Tulane University United States

ISBN: (纸本)9798400700156

Concurrent B+trees have been widely used in many systems. With the scale of data requests increasing exponentially, the systems are facing tremendous performance pressure. GPU has shown its potential to accelerate concurrent B+trees performance. When many concurrent requests are processed, the conflicts should be detected and resolved. Prior methods guarantee the correctness of concurrent GPU B+trees through lock-based or software transactional memory (STM)-based approaches. However, these methods complicate the request processing logic, increase the number of memory accesses and bring execution path divergence. They lead to performance degradation and variance in response time increasing. Moreover, previous methods do not guarantee linearizability among concurrent requests. In this paper, we design a combined-based concurrency control framework, called Eirene, for GPU B+tree to reduce the overhead of conflict detection and resolution. First, a combining-based synchronization method is designed to combine and issue requests. It combines the requests with the same key, constructs their dependence, decides the issued request, and determines their return values. Since only one request for each key is issued, key conflicts are eliminated. Then, an optimistic STM method is used to reduce structure conflicts. The query and the update requests are partitioned into different kernels. For the update kernels, STM is involved only when the number of the retry reaches a threshold. Finally, a locality-aware warp reorganization optimization is proposed to improve memory behavior and reduce conflicts by exploiting the locality among requests. Evaluations on an NVIDIA A100 GPU show that Eirene is efficient (a throughput of 2.4 billion per second) and can guarantee linearizability. Compared to the state-of-the-art GPU B+tree, it can achieve a speedup of 7.43X and reduce the response time variance from 36% to 5%. © 2023 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Exploiting Multiple Features for Hash Codes Learning with Semantic-Alignment-Promoting Variational Auto-encoder 12th

Exploiting Multiple Features for Hash Codes Learning with Se...

引用

12th National CCF Conference on Natural Language Processing and Chinese computing, NLPCC 2023

作者： Chen, Jiayang Su, Qinliang School of Computer Science and Engineering Sun Yat-Sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou China Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Beijing China

ISBN: (纸本)9783031446924

Semantic hashing is an effective technique to empower information retrieval. Currently, considerable efforts have been dedicated to generating high-quality hash codes by modeling document features using generative models and other approaches. However, most of these methods rely solely on a single type of feature, such as TFIDF features, BERT embeddings, etc. As different types of features have distinct but complementary information of documents, e.g. TFIDF mainly contains the keywords information and BERT focuses on the semantics, hash codes generated solely from either may not capture the full essence of the documents. To overcome this challenge, we propose a semantic-alignment-promoting variational auto-encoder to generate hash codes from multiple document features. Specifically, a VAE-based generative model is first developed to model the multiple features. Then, we propose a semantic-alignment-promoting inference network to estimate the parameters of the variational posterior from multiple features. Additionally, the quality of hash codes is further improved by promoting the semantic alignment between the hash codes of connected documents in a constructed connection graph. The results of extensive experiments on three public datasets demonstrate that our proposed model significantly outperforms current state-of-the-art models. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Neighbor Immunization Strategy to Block Virus Spreading on Networks 2

A Neighbor Immunization Strategy to Block Virus Spreading on...

引用

2nd Information Communication Technologies Conference, ICTC 2021

作者： Yaohui, Hao Yingze, Liu Baole, Zhao Qingxian, Wang Information Engineering University State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China Information Engineering University Zhengzhou China

ISBN: (纸本)9780738142876

In order to achieve better effect on blocking virus propagation, a neighbor immunization strategy was proposed and verified in this paper. On email-EU real networks and on scale-free model network, the efficiencies of the neighbor immunization strategy and the random immunization strategy in SIR and SEIR virus spreading models were compared and analyzed by simulation experiment. The result indicates that the neighbor immunization strategy is a feasible and effective. This phenomenon shows that neighbor immunization strategy can improve to the future virus and effectively prevent the virus spreading. © 2021 IEEE.

关键词： Immunization

来源：评论

学校读者我要写书评

暂无评论

Mitigating Barren Plateaus of Variational Quantum Eigensolvers

IEEE Transactions on Quantum Engineering

引用

IEEE Transactions on Quantum engineering 2024年第1期5卷 1-19页

作者： Liu, Xia Liu, Geng Zhang, Hao-Kai Huang, Jiaxin Wang, Xin Thrust of Artificial Intelligence Information Hub Guangzhou510530 China Institute of Information Engineering Chinese Academy of Sciences Key Laboratory of Cyberspace Security Defense Beijing100085 China Baidu Research Institute for Quantum Computing Beijing100193 China Tsinghua University Institute for Advanced Study Beijing100084 China

Variational quantum algorithms (VQAs) are expected to establish valuable applications on near-term quantum computers. However, recent works have pointed out that the performance of VQAs greatly relies on the expressibility of the ansatzes and is seriously limited by optimization issues, such as barren plateaus (i.e., vanishing gradients). This article proposes the state-efficient ansatz (SEA) for accurate ground state preparation with improved trainability. We show that the SEA can generate an arbitrary pure state with much fewer parameters than a universal ansatz, making it efficient for tasks like ground state estimation. Then, we prove that barren plateaus can be efficiently mitigated by the SEA and the trainability can be further improved most quadratically by flexibly adjusting the entangling capability of the SEA. Finally, we investigate a plethora of examples in ground state estimation where we obtain significant improvements in the magnitude of the cost gradient and the convergence speed. © 2020 IEEE.

关键词： Timing circuits

来源：评论

学校读者我要写书评

暂无评论

Can We Half the Work with Double Results: Rethinking Machine Learning Algorithms for Network Intrusion Detection System 9

Can We Half the Work with Double Results: Rethinking Machine...

引用

9th International Conference on advanced Cloud and Big Data, CBD 2021

作者： Li, Shuren Lu, Yifei Li, Jingqi Nanjing University of Science and Technology School of Computer Science and Engineering Nanjing210096 China State Key Lab of Mathematical Engineering and Advanced Computing Wuxi214215 China

ISBN: (纸本)9781665407458

Machine Learning algorithms have been wildly applied in the intrusion detection system(IDS). However, in the IoT environment where the resources are limited and the flow data is of huge amount, we need more efficient and effective ML algorithms to train the detection models. Aiming to have comprehensive performance indicators of the ML algorithms, we compared 15 machine learning for both binary classification and Multi-classification under the criterion of IoT traffic circumstance by indicators in temporal dimension and spatial dimension. We finally suggested using non-linear algorithms, especially tree algorithms training or retraining models to identify malicious network traffic in the IoT IDS. © 2022 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Extraction of Secret Message Based on Uniformly Most Powerful Test

SSRN

引用

SSRN 2022年

作者： Du, Hansong Liu, Jiufen Luo, Xiangyang Zhang, Yi The State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China

As the ultimate goal of steganalysis, secret message extraction is a bottleneck and difficulty that has long plagued the development of steganalysis technology. Existing pioneering work on secret message extraction for adaptive steganography based on STC (Syndrome-Trellis Codes): the method based on randomness test under plaintext embedding may misjudge incorrect steganographic key as correct steganographic key, resulting in the failure of extraction. For this reason, a method for extracting message with 100% accuracy for plaintext embedding is proposed in this manuscript. First, by analyzing the probability distribution of stego images, a theorem is given: For STC-based adaptive steganography algorithm, the sequences extracted by correct and incorrect steganographic keys are statistically different. Then based on this theorem, a uniformly most powerful test model is designed to recover the correct steganographic key. Finally, given the probability of type I and II errors, the sample size and threshold in the hypothesis test are derived. Classic adaptive steganography such as HUGO (Highly Undetectable Steganography) and J-UNIWARD (JPEG Universal Wavelet Relative Distortion) have been conducted experiment, showing that the proposed method can extract message with 100% accuracy and 44 bits sample size, which verifies the correctness of the theorem and the effectiveness of the method. © 2022, The Authors. All rights reserved.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：