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

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Shang Wu Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology

Attack payloads are often short segments hidden in HTTP requests; thus they can be found by HTTP payload anomaly detection. Deep learning models learn data features during training without manual feature extraction, and better performance has received more attention. Recurrent Neural Network models process sequences directly, which are widely used in payload anomaly detection. However, due to the gradient vanishing problem, RNN has limits on processing the long sequences. Meanwhile, RNN uses its final hidden state for detection and pays more attention to the content of the end of the payload. Besides, deep learning generally lacks interpretability. The paper proposes an unsupervised deep learning model for HTTP payload Anomaly Detection, namely Attention-based Encoder-Decoder Recurrent Neural Networks Anomaly Detection model (AEDRAD). AEDRAD utilizes the encoder-decoder RNN and attention mechanism to detect anomalies by reconstructing the original sequences. AEDRAD filters the fields of HTTP protocol that cannot exist anomalies, focusing on the suspicious segments. Through the encoder-decoder network, the normal payload can be well-reconstructed while the anomaly payload fails. With the attention mechanism, AEDRAD generates practical features for further anomaly detection from a global perspective. Meanwhile, it marks abnormal fragments visually, which is conducive to a subsequent analysis by experts. The experimental results show that AEDRAD significantly outperforms three state-of-the-art unsupervised algorithms on two real datasets.

关键词： Deep learning Training Recurrent neural networks Protocols Focusing Manuals Feature extraction

来源：评论

学校读者我要写书评

暂无评论

parallelization of Fast Monte Carlo Dose Calculation for Radiotherapy Treatment Planning on the ARMv8 Architecture

Parallelization of Fast Monte Carlo Dose Calculation for Rad...

引用

International Conference on Information Science and Technology (ICIST)

作者： Chi Jin Qinglin Wang Yang Zhao Yong Dou Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

Monte Carlo (MC) simulation plays a key role in radiotherapy. Since the simulation time of the MC program cannot fully meet the clinical requirements, we use the ARM-based FT-2000+ multi-core processor for parallelization, which provides an effective solution for accelerating MC dose calculation. In this paper, we implement and verify FT-DPM, which is an OpenMP-based MC Dose Planning Method on FT-2000+. FT-DPM utilizes the parallelism of MC simulation and the advantage of ARM architecture to achieve the parallelization on ARM architecture. Meanwhile, we optimize the original DPM program in terms of memory allocation, data structure and data type. The experiments show that, compared with the original DPM code, FT-DPM obtains very accurate results and reaches the maximum speedups of 155.94 times for the electron case. The parallel program based on FT-2000+ only takes 44.1 seconds to simulate the particle transport of 100 million times, showing good clinical application potential. In addition, the speedup and efficiency of FT-DPM running on different core counts are also discussed.

关键词： Monte Carlo methods Multicore processing Simulation Scalability parallel processing Data structures Load management

来源：评论

学校读者我要写书评

暂无评论

Optimizing Irregular-Shaped Matrix-Matrix Multiplication on Multi-Core DSPs

arXiv

引用

arXiv 2022年

作者： Yin, Shangfei Wang, Qinglin Hao, Ruochen Zhou, Tianyang Mei, Songzhu Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha410073 China

General Matrix Multiplication (GEMM) has a wide range of applications in scientific simulation and artificial intelligence. Although traditional libraries can achieve high performance on large regular-shaped GEMMs, they often behave not well on irregular-shaped GEMMs, which are often found in new algorithms and applications of high-performance computing (HPC). Due to energy efficiency constraints, low-power multi-core digital signal processors (DSPs) have become an alternative architecture in HPC systems. Targeting multi-core DSPs in FTm7032, a prototype CPU-DSPs heterogeneous processor for HPC, an efficient implementation - ftIMM - for three types of irregular-shaped GEMMs is proposed. FtIMM supports automatic generation of assembly micro-kernels, two parallelization strategies, and auto-tuning of block sizes and parallelization strategies. The experiments show that ftIMM can get better performance than the traditional GEMM implementations on multi-core DSPs in FT-m7032, yielding on up to 7.2× performance improvement, when performing on irregular-shaped GEMMs. And ftIMM on multi-core DSPs can also far outperform the open source library on multi-core CPUs in FT-m7032, delivering up to 3.1× higher efficiency. Copyright © 2022, The Authors. All rights reserved.

关键词： Digital signal processors

来源：评论

学校读者我要写书评

暂无评论

CoEdge: A Collaborative Architecture for Efficient Task Offloading among Multiple Edge Service Providers

引用

IEEE Internet of Things Journal 2025年

作者： Xie, Xingrui Cheng, Geyao Liu, Han Luo, Lailong Ren, Bangbang Guo, Deke National University of Defense Technology National Key Laboratory of Information Systems Engineering Hunan Changsha410073 China National University of Defense Technology State Key Laboratory of Complex and Critical Software Environment College of Information and Communication Hubei Wuhan430019 China National University of Defense Technology National Key Laboratory of Information Systems Engineering National Laboratory for Parallel and Distributed Processing Hunan Changsha410073 China

Edge computing is an emerging paradigm poised to process a substantial portion of latency-sensitive and computation-intensive tasks through edge service providers (ESPs). However, these ESPs typically operate independently and locally to serve their registered users. When processing burst tasks, the ESPs have to either scale up their respective capacities by introducing additional hardware or compromise user experience by rejecting some user requests, leading to high commercial investment or service degradation. Inspired by the promise of the win-win situation for ESPs and users, we envision a novel task offloading strategy that realizes the following rationales simultaneously: 1) collaborative service, 2) rapid response, and 3) sustainable profitability, while the existing methods fail to achieve them at one shot. To this end, we report CoEdge, a collaborative architecture for efficient task offloading among multiple ESPs in the edge network, aiming at simultaneously minimizing service delay for users and enhancing service profit for ESPs. To achieve this, CoEdge employs a central optimizer to implement a two-stage strategy that determines the task scheduling and service pricing hierarchically. We then formulate these problems and prove their NP-hardness. Additionally, we also propose efficient approximate algorithms to accommodate large-scale computing scenarios with low complexity. Experimental results using real-world datasets demonstrate that our CoEdge can significantly reduce service delay by 2.87x to 4.15x for users and considerably increase service profit by 32% for ESPs. © 2014 IEEE.

关键词： NP-hard

来源：评论

学校读者我要写书评

暂无评论

A Memory Saving Mechanism Based on Data Transferring for Pipeline parallelism

A Memory Saving Mechanism Based on Data Transferring for Pip...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Wei Jiang Rui Xu Sheng Ma Qiong Wang Xiang Hou Hongyi Lu Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

The correctness and robustness of the neural network model are usually proportional to its depth and width. Currently, the neural network models become deeper and wider to cope with complex applications, which leads to high memory capacity requirement and computer capacity requirements of the training process. The multi-accelerator parallelism is a promising choice for the two challenges, which deploys multiple accelerators in parallel for training neural networks. Among them, the pipeline parallel scheme has a great advantage in training speed, but its memory capacity requirements are relatively higher than other parallel schemes. Aiming at solving this challenge of pipeline parallel scheme, we propose a data transfer mechanism, which effectively reduces the peak memory usage of the training process by real-time data transferring. In the experiment, we implement our design and apply it to Pipedream, a mature pipeline parallel scheme. The memory requirement of training process is reduced by up to 48.5%, and the speed loss is kept within a reasonable range.

关键词： Training Computational modeling Pipelines Neural networks Memory management Bandwidth parallel processing

来源：评论

学校读者我要写书评

暂无评论

Co-designing the Topology/Algorithm to Accelerate distributed Training

Co-designing the Topology/Algorithm to Accelerate Distribute...

引用

IEEE International Conference on Big Data and Cloud Computing (BdCloud)

作者： Xiang Hou Rui Xu Sheng Ma Qiong Wang Wei Jiang Hongyi Lu Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

With the development of Deep Learning (DL), Deep Neural Network (DNN) models have become more complex. At the same time, the development of the Internet makes it easy to obtain large data sets for DL training. Large-scale model parameters and training data enhance the level of AI by improving the accuracy of DNN models. But on the other hand, they also present more severe challenges to the hardware training platform because training a large model needs a lot of computing and memory resources that can easily exceed the capacity of a single processor. In this context, integrating more processors on a hierarchical system to conduct distributed training is a direction for the development of training platforms. In distributed training, collective communication operations (including all-to-all, all-reduce, and all-gather) take up a lot of training time, making the interconnection network between computing nodes one of the most critical factors affecting the system performance. The hierarchical torus topology, combined with the Ring All-Reduce collective communication algorithm, is one of the current mainstream distributed interconnection networks. However, we believe that its communication performance is not the best. In this work, we first designed a new intra-package communication topology, i.e. the switch-based fully connected topology, which shortens the time consumed by cross-node communication. Then, considering the characteristics of this topology, we carefully devised more efficient all-reduce and all-gather communication algorithms. Finally, combined with the torus topology, we implemented a novel distributed DL training platform. Compared with the hierarchical torus, our platform improves communication efficiency and provides 1.16-2.68 times speedup in distributed training of DNN models.

关键词： Training Deep learning Network topology Multiprocessor interconnection Computational modeling Training data Switches

来源：评论

学校读者我要写书评

暂无评论

Surrogate Supervision-based Deep Weakly-supervised Anomaly Detection

Surrogate Supervision-based Deep Weakly-supervised Anomaly D...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Zhiyue Wu Hongzuo Xu Yijie Wang Yongjun Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665424288

Many anomaly detection applications can provide partially observed anomalies, but only limited work is for this setting. Additionally, a number of anomaly detectors focus on learning a particular model of normal/abnormal class. However, the intra-class model might be too complicated to be accurately learned. It is still a non-trivial task to handle data with anomalies/inliers in skewed and heterogeneous distributions. To address these problems, this paper proposes an anomaly detection method to leverage Partially Labeled anomalies via Surrogate supervision-based Deviation learning (denominated PLSD). The original supervision (i.e., known anomalies and a set of explored inliers) is transferred to semantic-rich surrogate supervision signals (i.e., anomaly-inlier and inlier-inlier class) via vector concatenation. Then different relationships and interactions between anomalies and inliers are directly and efficiently learned thanks to the neural network’s connection property. Anomaly scoring is processed via the trained network and the high-efficacy inliers. Extensive experiments show that PLSD significantly prevails state-of-the-art semi/weakly-supervised anomaly detectors.

关键词： Learning systems Conferences Detectors Gaussian distribution Benchmark testing Task analysis Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Word Embedding-based Context-sensitive Network Flow Payload Anomaly Detection

Word Embedding-based Context-sensitive Network Flow Payload ...

引用

International Conference on Applied Machine Learning (ICAML)

作者： Yizhou Li Yijie Wang Li Cheng Hongzuo Xu Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665421263

Payload anomaly detection can discover malicious behaviors hidden in network packets. It is hard to handle payload due to its various possible characters and complex semantic context, and thus identifying abnormal payload is also a non-trivial task. Prior art only uses the n-gram language model to extract features, which directly leads to ultra-high-dimensional feature space and also fails to capture the context semantics fully. Accordingly, this paper proposes a word embedding-based context-sensitive network flow payload anomaly detection method (termed WECAD). First, WECAD obtains the initial feature representation of the payload through the word embedding-based method. Then, we propose a corpus pruning algorithm, which applies the cosine similarity clustering and frequency distribution to prune inconsequential characters. We only keep the essential characters to reduce the calculation space. Subsequently, we propose a context learning algorithm. It employs the co-occurrence matrix transformation technology and introduces the backward step size to consider the order relationship of essential characters. Comprehensive experiments on real-world intrusion detection datasets validate the effectiveness of our method.

关键词： Art Semantics Clustering algorithms Intrusion detection Machine learning Feature extraction Task analysis

来源：评论

学校读者我要写书评

暂无评论

Modeling full information with graph network for joint entity-relation extraction 4

Modeling full information with graph network for joint entit...

引用

4th International Conference on Algorithms, Computing and Artificial Intelligence, ACAI 2021

作者： Wan, Qian Wei, Luona Chen, Xinhai Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Hunan Changsha China College of Systems Engineering National University of Defense Technology Hunan Changsha China Laboratory of Software Engineering for Complex Systems National University of Defense Technology Hunan Changsha China

ISBN: (纸本)9781450385053

Fully capturing contextual information and analyzing the association between entity semantics and type is helpful for joint extraction task: 1) The context can reflect the part of speech and semantics of entity. 2) The entity type is closely related to the relation between entities. Previous research used to simply embed the contextual information into shallow layer of the model, ignoring the association between entity semantics and type. In this paper, we propose a graph network with full-information modeling to explicitly model different-level information in the text. The contextual information of entity is dynamically embedded in each span representation to improve the reasoning ability. To capture the fine-grained association between the semantics and type of entity, the graph network uses the feature of entity types to generate edge information between different nodes. Experimental results show that our model outperforms previous models on the CoNLL04 dataset and obtains competitive results on the SciERC dataset in both entity recognition and relation extraction. Extensive additional experiments further verify the effectiveness of the model. © 2021 ACM.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Accelerate Graph Neural Network Training by Reusing Batch Data on GPUs

Accelerate Graph Neural Network Training by Reusing Batch Da...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Zhejiang Ran Zhiquan Lai Lizhi Zhang Dongsheng Li National Key Laboratory of Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665443326

With the increasing adoption of graph neural networks (GNNs) in the graph-based deep learning community, various graph programming frameworks and models have been developed to improve the productivity of GNNs. The current GNN frameworks choose GPU as an essential tool to accelerate GNN training. However, it is still challenging to train GNNs on large graphs with limited GPU memory. Unlike traditional neural networks, generating mini-batch data by sampling in GNNs requires some complicated tasks such as traversing the graph to select neighboring nodes and gathering their features. This process takes up most of the training and we find the main bottleneck comes from transferring nodes features from CPU to GPU through limited bandwidth. In this paper, We propose a method Reusing Batch Data for the problem of data transmission. This method utilizes the similarity between adjacent mini-batches to reduce repeated data transmission from CPU to GPU. Furthermore, to reduce the overhead introduced by this method, we design a fast algorithm based on GPU to detect repeated nodes’ data and achieve shorter additional computation time. Evaluations on three representative GNN models show that our method can reduce transmission time by up to 60% and speed the end-to-end GNN training by up to 1.79× over the state-ofthe-art baselines. Besides, Reusing Batch Data can effectively save GPU memory footprint by about 19% to 40% while still reducing the training time compared to the static cache strategy.

关键词： Training Productivity Deep learning Design methodology Conferences Graphics processing units Programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：