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

International Conference on Computer Supported Cooperative Work in Design

作者： Mingyu Liu Yijie Wang Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha Hunan P.R.China

ISBN: (纸本)9781728165981

Class incremental learning is widely applied in the classification scenarios as the number of classes is usually dynamically changing. However, the existing algorithms increase computational cost to implement class incremental learning in order to increase classification quality. In this paper, we propose a nested hierarchy algorithm based on OCSVM for class incremental learning, called NH-CIL. We reuse support vectors to eliminate redundant instances and catch the key ones to replace the whole model because of the generalization ability of OCSVM. When a new class arrives, NH-CIL adopts OCSVM on the new class and the old classes respectively to get the corresponding sketching supports vectors. Then NH-CIL reuses these two kinds of sketching support vectors to build a binary sub-classifier. These two steps are repeatedly nested to form a hierarchy classification model in a bottom-up manner while the number of classes increases. On the contrary, the testing phase is in a top-down manner. NH-CIL can be used as a flexible approach in the classification scenarios during the collaborative information processing. We conduct the experiments on 8 real-world benchmark datasets to compare NH-CIL with some other class incremental learning algorithms, e.g. SD-CIL, HS-CIL and OP-CIL. The experiment results show that NH-CIL averagely achieves more than 5.1%, 8.6% and 11.6% accuracy improvement and 39.8%, 24.7% and 12.6% efficiency improvement over SD-CIL, HS-CIL and OP-CIL, respectively.

关键词： Machine learning algorithms Computational modeling Heuristic algorithms Conferences Support vector machine classification Information processing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

A survey on approaches and applications of knowledge representation learning 5

A survey on approaches and applications of knowledge represe...

引用

5th IEEE International Conference on Data science in Cyberspace, DSC 2020

作者： Li, Chenchen Li, Aiping Wang, Ye Tu, Hongkui Song, Yichen National University of Defense Technology College of Computer ChangSha China National University of Defense Technology College of Computer Science and Technology on Parallel and Distributed Processing Laboratory ChangSha China

ISBN: (纸本)9781728195582

Knowledge representation learning (KRL) is one of the important research topics in artificial intelligence and Natural language processing. It can efficiently calculate the semantics of entities and relations in a low-dimensional space, and effectively solve the problem of data sparsity, which significantly improve the performance of knowledge acquisition, fusion and reasoning and so on. Starting from the five perspectives of distance-based, semantic matching, bilinear-based, neural network model and additional information model, this paper first introduces the overall framework and specific model design, and then correspondingly introduces the experimental evaluation tasks, metrics and benchmark datasets of each model. On this basis, how to apply KRL to various downstream tasks is summarized. © 2020 IEEE.

关键词： Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

A Retina-LGN-V1 Structure-like Spiking Neuron Network for Image Feature Extraction 21

A Retina-LGN-V1 Structure-like Spiking Neuron Network for Im...

引用

Proceedings of the 2021 5th International Conference on Video and Image processing

作者： Sheng Ji Qijun Gu Ye Yuan Peng Zhao Tao Fang Hong Huo Xin Niu Department of Automation_School of Electronic Information and Electrical Engineering_Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University China College of Computer Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology China

ISBN: (纸本)9781450385893

SNNs have achieved great attention in recent years as they contain neurons more like those in the brain and use spikes to encode and transmit information efficiently among neurons with lower energy consumption. A Retina-LGN-V1 structure-like spiking neuron network (RLVSL-SNN) is proposed in this paper. It is inspired by the structure of mammalian primary visual pathway, and simulates different biological structures of Retina, LGN and V1. Noise reduction circuit and light adaptation circuit are also simulated for enhancing the robustness of its extracted features. RLVSL-SNN is a bio-plausible neuron network as it has firing rates of neurons in each layer that are similar to those of biological experiments. Besides, a full-connected SNN (FC SNN) is implemented following RLVSL-SNN for classification to evaluate the extracted features. The additive spiking timing dependent plasticity (STDP) learning rules and the ANN-to-SNN conversion method are utilized to train RLVSL-SNN and FC SNN, respectively. The experiments on MNIST dataset have verified that RLVSL-SNN is comparable to AlexNet for classification by features from spikes.

关键词： Additive Spiking Timing Dependent Plasticity Learning Primary Visual Pathway Image Classification Spiking Neural Network

来源：评论

学校读者我要写书评

暂无评论

Neutronic calculations of the China dual-functional lithium–lead test blanket module with the parallel discrete ordinates code Hydra

引用

Nuclear science and Techniques 2020年第8期31卷 1-12页

作者： Guang-Chun Zhang Jie Liu Liang-Zhi Cao Hong-Chun Wu Xian-Bao Yuan Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense TechnologyChangsha 410073China Laboratory of Software Engineering for Complex Systems National University of Defense TechnologyChangsha 410073China School of Nuclear Science and Technology Xi’an Jiaotong UniversityXi’an 710049China College of Mechanical and Power Engineering China Three Gorges UniversityYichang 443002China

The China dual-functional lithium–lead test blanket module(DFLL-TBM) is a liquid Li Pb blanket concept developed by the Institute of Nuclear Energy Safety technology of the Chinese Academy of sciences for testing in ITER to validate relevant tritium breeding and shielding technologies. In this study, neutronic calculations of DFLL-TBM were carried out using a massively parallel three-dimensional transport code, Hydra, with the Fusion Evaluated Nuclear Data Library/MG. Hydra was developed by the Nuclear Engineering Computational Physics Lab based on the discrete ordinates method and has been devoted to neutronic analysis and shielding evaluation for nuclear facilities. An in-house Monte Carlo code(MCX) was employed to verify the discretized calculation model used by Hydra for the DFLL-TBM calculations. The results showed two key aspects:(1) In most material zones,Hydra solutions are in good agreement with the reference MCX results within 1%, and the maximal relative difference of the neutron flux is merely 3%, demonstrating the correctness of the calculation model;(2) while the current DFLL-TBM design meets the operation shielding requirement of ITER for 4 years, it does not satisfy the tritium self-sufficiency requirement. Compared to the two-step approach, Hydra produces higher accuracies as it does not rely on the homogenization technique during the calculation process. The parallel efficiency tests of Hydra using the DFLL-TBM model also showed that this code maintains a high parallel efficiency on O(100) processors and, as a result, is able to significantly improve computing performance through parallelization. Parameter studies have been carried out by varying the thickness of the beryllium armor layer and the tritium breeding zone to understand the influence of the beryllium layer and breeding zone thickness on tritium breeding performance. This establishes a foundation for further improvement in the tritium production performance of DFLL-TBM.

关键词： Discrete ordinates method DFLL-TBM Neutronic analysis Tritium breeding performance

来源：评论

学校读者我要写书评

暂无评论

Word-level BERT-CNN-RNN Model for Chinese Punctuation Restoration 6

Word-level BERT-CNN-RNN Model for Chinese Punctuation Restor...

引用

6th IEEE International Conference on Computer and Communications, ICCC 2020

作者： Zhang, Zhe Liu, Jie Chi, Lihua Chen, Xinhai Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha China College of Computer Science and Electronic Engineering Hunan University Changsha China

ISBN: (纸本)9781728186351

Punctuation restoration in speech recognition has a wide range of application scenarios. Despite the widespread success of neural networks methods at performing punctuation restoration for English, there have been only limited attempts for Chinese punctuation restoration. Due to the differences between Chinese and English in terms of grammar and basic semantic units, existing methods for English is not suitable for Chinese punctuation restoration. To tackle this problem, we propose a hybrid model combining the kernel of Bidirectional Encoder Representations from Transformers (BERT), Convolution Neural Network (CNN) and Recurrent Neural Network (RNN). This model employs a flexible structure and special CNN design which can extract word-level features for Chinese language. We compared the performance of the hybrid model with five widely-used punctuation restoration models on the public dataset. Experimental results demonstrate that our hybrid model is simple and efficient. It outperforms other models and achieves an accuracy of 69.1%. © 2020 IEEE.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

A Novel Deep Neural Network Model for Credit Risk Prediction of Chinese Farmers

A Novel Deep Neural Network Model for Credit Risk Prediction...

引用

IEEE International Conference on Data science in Cyberspace (DSC)

作者： Yalong Xie Aiping Li Ziniu Liu Kai Chen Hongkui Tu College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory College of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665418164

China is a big agricultural county with more than 500 million rural population. In China, farmers usually loan from rural commercial banks or rural credit cooperatives. It is crucial for the national economic development and the improvement of people's standard of living that how to reasonably use funds to subsidize the agricultural population and reduce the risk of rural loans. At present, credit risk prediction of farmers mainly depends on the experience of experts in the business field, and there is little published research on using artificial intelligence methods to solve this problem. This paper presents a complete set of methods, including data collection, feature selection, etc. We propose a novel deep neural network model named DNN-CRP for credit risk prediction of Chinese framers. Experiments on an actual credit loan dataset of Chinese farmers are presented, and experimental results show that the comprehensive performance of the DNN-CRP model is better than current state-of-the-art models. It is believed that the DNN-CRP model proposed in this paper can help banks improve the efficiency of the credit loan business of farmers and reduce credit risks.

关键词： Deep learning Sensitivity Neural networks Sociology Predictive models Data collection Data models

来源：评论

学校读者我要写书评

暂无评论

A Complexity-Reduced Block-Selective Algebraic Multigrid Method for Implicitly Coupled Velocity-Pressure System on High Performance Computers

SSRN

引用

SSRN 2023年

作者： Liang, Yuechao Guo, Xiao-Wei Li, Chao Yuan, Fan Song, Min Zhang, Qingyang Chen, Xinhai Liu, Jie Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China Institute for Quantum Information State Key Laboratory of High Performance Computing College of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Mathematics and Computational Sciences Xiangtan University Xiangtan411105 China College of Computer Science and Technology National University of Defense Technology Changsha410073 China

The implicitly coupled pressure-based algorithm is widely acknowledged for its superior convergence and robustness in solving incompressible flow problems. However, the increased expansion scale of equations and difficulty in solving the resulting equation system has limited the widespread use of the coupling algorithm. This paper presents an optimized block-SAMG method, referred to as Red-SAMG, to significantly reduce computational complexity and memory consumption. Our approach employs a parallel modified independent set algorithm, allowing each process to perform matrix coarsening individually. An aggressive coarsening strategy further reduces complexity to address larger-scale problems. We conducted numerical experiments on a serial two-dimensional backward-facing step case and a parallel three-dimensional tunnel between rod bundles in the reactor core problem. The results demonstrate that the Red-SAMG method with aggressive coarsening reduces solution time by 12\% on the backward-facing step case. For large-scale three-dimensional problems under the same parallel conditions, the Red-SAMG method shortens the solution time by 14\% compared to the existing SAMG method. The Red-SAMG method with aggressive coarsening further reduces solution time by 49\%. Our optimized Red-SAMG method effectively reduces the complexity of the linear system arising from the implicitly coupled algorithm. The aggressive coarsening strategy also represents a significant advancement in improving the computational efficiency of the SAMG method. © 2023, The Authors. All rights reserved.

关键词： Coarsening

来源：评论

学校读者我要写书评

暂无评论

NUMA-aware FFT-based Convolution on ARMv8 Many-core CPUs

NUMA-aware FFT-based Convolution on ARMv8 Many-core CPUs

引用

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

作者： Xiandong Huang Qinglin Wang Shuyu Lu Ruochen Hao Songzhu Mei Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China School of Computer Science National University of Defense Technology Changsha China University of Pittsburgh Pittsburgh USA

Convolutional Neural Networks (CNNs), one of the most representative algorithms of deep learning, are widely used in various artificial intelligence applications. Convolution operations often take most of the computational overhead of CNNs. The FFT-based algorithm can improve the efficiency of convolution by reducing its algorithm complexity, there are a lot of works about the high-performance implementation of FFT-based convolution on many-core CPUs. However, there is no optimization for the non-uniform memory access (NUMA) characteristics in many-core CPUs. In this paper, we present a NUMA-aware FFT-based convolution implementation on ARMv8 many-core CPUs with NUMA architectures. The implementation can reduce a number of remote memory access through the data reordering of FFT transformations and the three-level parallelization of the complex matrix multiplication. The experiment results on a ARMv8 many-core CPU with NUMA architectures demonstrate that our NUMA-aware implementation has much better performance than the state-of-the-art work in most cases.

关键词： Deep learning Recurrent neural networks Convolution Computer architecture Complexity theory Convolutional neural networks Kernel

来源：评论

学校读者我要写书评

暂无评论

A Novel Interactive Recurrent Attention Network for Emotion-Cause Pair Extraction

A Novel Interactive Recurrent Attention Network for Emotion-...

引用

作者： Xiangyu Jia Xinhai Chen Qian Wan Jie Liu Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

Unlike Emotion Cause Extraction(ECE) task which consists of pre-annotate emotions and passage, emotion-cause pair extraction(ECPE) aims at extracting potential emotions and corresponding causes in the document without the need for pre-annotations. Traditional ECPE solutions divide the extracting emotions and causes operation into two separate parts. However, separating the bidirectional dependence between emotion and cause may lose a lot of potentially useful information. In this paper, we propose a novel interactive recurrent attention network(IRAN). Our approach focuses on the bidirectional impact between emotions and causes, and extracts emotions and causes simultaneously. The information in the document can be fully exploited through multiple modeling and information extraction. Our emotion-specific transformation and distance fusion correlation can adaptively focus on the emotions and the distance, gracefully incorporate them into a distinguishable neural network attention framework. The experimental results show that our proposed model achieves better performance than other widely-used models on the ECPE corpus.

关键词： Natural language processing Deep learning Sentiment analysis Text mining Emotion-cause pair extraction

来源：评论

学校读者我要写书评

暂无评论

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Symmetric Encryption for Cloud Storage

MMDSSE: Multi-client and Multi-keyword Dynamic Searchable Sy...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Panyu Wu Zhenfu Cao Jiachen Shen Xiaolei Dong Yihao Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Shanghai Key Laboratory of Trustworthy Computing East China Normal University Shanghai China Research Center for Basic Theories of Intelligent Computing Research Institute of Basic Theories Zhejiang Lab Hangzhou China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing China Science and Technology on Parallel and Distributed Processing Laboratory (PDL) Changsha China Shandong University Jinan China University of Aizu Fukushima Japan

Since data outsourcing poses privacy concerns with data leakage, searchable symmetric encryption (SSE) has emerged as a powerful solution that enables clients to perform query operations on encrypted data while preserving their privacy. Dynamic SSE schemes have been proposed to handle update operations. However, it is shown that updates might increase the risk of information leakage. Meanwhile, to meet the requirement of real-world applications, it is desirable to have the searchable encryption scheme which supports both multiple clients and multi-keyword queries. To address these issues, this paper proposes MMDSSE, a multi-client forward secure dynamic SSE scheme that supports multi-keyword queries. MMDSSE allows the clients narrow down the results by providing an arbitrary subset of the entire archive, and thus suitable for cloud storage environment. Security analysis and experimental evaluations show that MMDSSE is secure and efficient.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：