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

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 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

PPSS: A Privacy-Preserving Supervision Scheme Based on Blockchain

PPSS: A Privacy-Preserving Supervision Scheme Based on Block...

引用

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

作者： Ming Chen Peichang Shi Xiang Fu Feng Jiang Fei Gao Penghui Ma Jinzhu Kong National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha China Key Laboratory of Software Engineering for Complex Systems College of Computer Science National University of Defense Technology Changsha China Kylin Software Co.LTD Changsha China Zhejiang Lab Hangzhou China

In JointCloud Computing, multi-party participation introduces complexity and uncertainty. For all participants in JointCloud Computing, both continuous supervision and necessary privacy protection are required. Traditional supervision methods usually adopt the centralized information interaction mode, which has such defects as collusion of interests, single point of failure, privacy disclosure, etc. Building a decentralized supervision mechanism has become a new research direction. In this paper, we propose PPSS, a privacy-preserving supervision scheme based on blockchain, which decentralizes the supervision of the participants in JointCloud Computing, and combines the “double encryptions” and “threshold encryption” technologies to provide privacy protection. While making full use of the decentralization of the blockchain, a committee is established to carry out the analysis and decision-making tasks in terms of supervision and privacy protection. Experimental results indicate that PPSS can balance performance and security by reasonably configuring the committee.

关键词： Privacy Uncertainty Decision making Buildings Reliability engineering Blockchains Complexity theory

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

LTKT: Knowledge Tracing Based on Positive and Negative Learning Transfers

SSRN

引用

SSRN 2023年

作者： Xu, Jia Tang, Rongrong Lv, Pin Yu, Minghe Yu, Ge Chen, Enhong School of Computer Electronics and Information Guangxi University GuangXi Nanning530004 China Key Laboratory of Parallel Distributed and Intelligent Computing Education Department of Guangxi Zhuang Autonomous Region Guangxi530004 China Northeastern University Shenyang110819 China University of Science and Technology of China Hefei230088 China

Knowledge Tracing (KT) is a critical but challenging problem for many educational applications. As an essential part of educational psychology, the propagated influence among pedagogical concepts (i.e., learning transfer) is important for optimizing KT tasks. However, existing KT methods only consider the positive learning transfer and neglect the negative learning transfer. To this end, in this paper, we propose a novel deep knowledge tracing model, called positive and negative Learning Transfers based Knowledge Tracing (LTKT). To the best of our knowledge, LTKT makes the first attempt to concurrently utilize the positive and negative learning transfer relations among concepts to improve KT results. First, LTKT employs a statistical-based approach to construct a learning transfer graph (LTG). Then, LTKT quantifies the impact of an exercise's practice result on the knowledge state of the concept via a direct learning effect component, after which a learning transfer effect component is carefully designed to quantify the impact of the practice result on the knowledge states of neighboring concepts based on the positive and negative learning transfer relations modeled by LTG. We conduct extensive experiments on public real-world datasets, and the experimental results show that LTKT outperforms all state-of-the-art KT methods and has good interpretability. © 2023, The Authors. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

MilKBQA: A Complex Knowledge Base Question Answering Dataset on Chinese Military Field

MilKBQA: A Complex Knowledge Base Question Answering Dataset...

引用

IEEE International Conference on Data science in Cyberspace (DSC)

作者： Pike Xu Tiejun Li Zhen Huang Min Guo Jiezhong He Ding Sun Institute of Computer National University of Defense Technology Changsha China Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China School of Computer National University of Defense Technology Changsha China

ISBN: (纸本)9781665418164

Facts in military field tend to involve elements of time, space, quantity, status, and so on. Existing methods of representing knowledge in the form of triples fail to adequately express these facts, and also cause obstacles to knowledge storage and updating. Furthermore, question answering on these facts introduces new complexity dimension, which are complicated to be supported by existing corpus. Thus, we construct a Chinese knowledge base for military field covering entities and events centric knowledge, referred as MilKB. It consists of 965 entities and 3,017 facts. Moreover, we classify the natural questions into 26 types and construct a complex question answering dataset derived from MilKB, referred as MilKBQA. It consists of 2,829 question-answer pairs, in which 600 are event-centric ones. Experiments with three recent strong baseline models demonstrate that MilKBQA requires further research.

关键词： Triples (Data structure) Conferences Knowledge based systems Cyberspace Knowledge representation Data science Cognition

来源：评论

学校读者我要写书评

暂无评论

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI Cardinality

MDPPC: Efficient Scalable Multiparty Delegated PSI and PSI C...

引用

Annual Conference on Privacy, Security and Trust, PST

作者： Yihao Yang Xiaolei Dong Jiachen Shen Zhenfu Cao Yunbo Yang Jun Zhou Liming Fang Zhe Liu Chunpeng Ge Chunhua Su Zongyang Hou 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 Print-Rite Technology Development Co. Ltd. Of Zhuhai China

Private Set Intersection (PSI) is one of the most important functions in secure multiparty computation (MPC). PSI protocols have been a practical cryptographic primitive and there are many privacy-preserving applications based on PSI protocols such as computing conversion of advertising and distributed computation. Private Set Intersection Cardinality (PSI-CA) is a useful variant of PSI protocol. PSI and PSI-CA allow several parties, each holding a private set, to jointly compute the intersection and cardinality, respectively without leaking any additional information. Nowadays, most PSI protocols mainly focus on two-party settings, while in multiparty settings, parties are able to share more valuable information and thus more desirable. On the other hand, with the advent of cloud computing, delegating computation to an untrusted server becomes an interesting problem. However, most existing delegated PSI protocols are unable to efficiently scale to multiple clients. In order to solve these problems, this paper proposes MDPPC, an efficient PSI protocol which supports scalable multiparty delegated PSI and PSI-CA operations. Security analysis shows that MDPPC is secure against semi-honest adversaries and it allows any number of colluding clients. For 15 parties with set size of 2 20 on server side and 2 16 on clients side, MDPPC costs only 81 seconds in PSI and 80 seconds in PSI-CA, respectively. The experimental results show that MDPPC has high scalability.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：