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

International Conference of Young Computer Scientists, Engineers and Educators, ICYCSEE 2015

作者： Zhang Yang Xing Zuocheng Ma Xiao Science and technology on Parallel and distributed processing laboratory National University of Defense Technology

As the big data era is coming,it brings new challenges to the massive data processing.A combination of GPU and CPU on chip is the trend to release the pressure of large scale *** found that there are different memory access characteristics between GPU and *** most important one is that the programs of GPU include a large number of threads,which lead to higher access frequency in cache than the CPU *** the LRU policy favors the programs with high memory access frequency,the programs of GPU can't get the corresponding performance boost even more cache resources are *** LRU policy is not suitable for heterogeneous multi-core *** on the different characteristics of GPU and CPU programs on memory access,this paper proposes an LLC dynamic replacement policy--DIPP(Dynamic Insertion/Promotion Policy) for heterogeneous multi-core *** core idea of the replacement policy is to reduce the miss rate of the program and enhance the overall system performance by limiting the cache resources that GPU can acquire and reducing the thread interferences between *** compare the DIPP replacement policy with LRU and we conduct a classified discussion according to the program results of *** programs enhance 23.29% on the average performance(using arithmetic mean).Large working sets programs can improve 13.95%,compute-intensive programs enhance 9.66% and stream class programs improve 3.8%.

关键词： Big data Heterogeneous Multicore Replacement Policy DIPP

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A simple model for the energy-efficient optimal real-time multiprocessor scheduling

A simple model for the energy-efficient optimal real-time mu...

引用

2012 IEEE International Conference on Computer science and Automation Engineering, CSAE 2012

作者： Wu, Fei Jin, Shiyao Wang, Yuming College of Electronic and Electrical Engineering Shanghai University of Engineering Science Shanghai 201620 China National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781467300865

As the energy consumption of embedded multiprocessor systems becomes increasingly prominent, it becomes an urgent problem of real-time energy-efficient scheduling in multiprocessor systems to reduce system energy consumption while meeting real-time constraints. In this paper, we introduce a unifying energy-efficient real-time scheduling theory with the Deadline Partitioning Fair Dynamic Voltage Frequency Scaling (DPF-DVFS) policy for multiprocessor systems. The proposed model can offer a unifying, extendable, on-line and simple method to realize energy-efficient real-time scheduling with low scheduling overhead. We then present an optimal energy-efficient scheduling algorithm DPF-DVFS-WRAP for periodic tasks. © 2012 IEEE.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Learning from Wireless: a Prospective Approach to Human-Centered Computing

Learning from Wireless: a Prospective Approach to Human-Cent...

引用

International Joint Conference on Neural Networks

作者： Yong Lu Shaohe Lv Xue Yang Xiaodong Wang Minne Li Xingming Zhou Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology

ISBN: (纸本)9781509006212

One of the most important topics in Human-Centered Computing (HCC) is to recognise human's activities. In this paper, the technology of wireless-based activity recognition is introduced. By using wireless signals, one can achieve Non-Line-Of-Sight (NLOS) recognition without carrying any devices. Also, it is easy to deploy a wireless-based recognition system due to the ubiquity of wireless communication systems. The basic idea is to detect different characteristics of signal propagation that correspond to the distinct human behaviors. As a result, action recognition is performed by analyzing the distinguishable features of signal propagation. This paper introduces the basic principles and applications of wireless-based activity recognition, and discusses the challenges and related performance metrics. Finally, open problems are discussed to point out the future research trends.

关键词： Human-centered computing wireless Wireless communication systems Activity recognition recognition system Performance metrics signals Learning Paper technology Human behavior

来源：评论

学校读者我要写书评

暂无评论

Differentially Private and Heterogeneity-Robust Federated Learning With Theoretical Guarantee

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6369-6384页

作者： Wang, Xiuhua Wang, Shuai Li, Yiwei Fan, Fengrui Li, Shikang Lin, Xiaodong Huazhong University of Science and Technology Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Wuhan430074 China University of Electronic Science and Technology of China National Key Laboratory of Wireless Communications Chengdu611731 China Xiamen University of Technology Fujian Key Laboratory of Communication Network and Information Processing Xiamen361024 China University of Guelph School of Computer Science GuelphONN1G 2W1 Canada

Federated learning (FL) is a popular distributed paradigm where enormous clients collaboratively train a machine learning (ML) model under the orchestration of a central server without knowing the clients' private raw data. The development of effective FL algorithms faces multiple practical challenges including data heterogeneity and clients' privacy protection. Despite that numerous attempts have been made to deal with data heterogeneity or rigorous privacy protection, none have effectively tackled both issues simultaneously. In this article, we propose a differentially private and heterogeneity-robust FL algorithm, named DP-FedCVR to mitigate the data heterogeneity by following the client-variance-reduction strategy. Besides, it adopts a sophisticated differential privacy (DP) mechanism where the privacy-amplified strategy is applied, to achieve a rigorous privacy protection guarantee. We show that the proposed DP-FedCVR algorithm maintains its heterogeneity-robustness though DP noises are incorporated, while achieving a sublinear convergence rate for a nonconvex FL problem. Numerical experiments based on image classification tasks are presented to demonstrate that DP-FedCVR provides superior performance over the benchmark algorithms in the presence of data heterogeneity and various DP privacy budgets. © 2020 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

The Parallelized Cuckoo Filter for Cold Data Representation 23

The Parallelized Cuckoo Filter for Cold Data Representation

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Sun, Bowen Luo, Lailong Li, Shangsen Chen, Yingwen Guo, Deke College of Computer National University of Defense Technology China National University of Defense Technology Science and Technology on Information Systems Engineering Laboratory China College of Computer National University of Defense Technology National Lab for Parallel and Distributed Processing China

ISBN: (纸本)9781665494571

Cold data contributes a large portion of the big data today and is usually stored in secondary storage. Various sketch data structures are implemented to represent the stored elements and provide constant-time membership queries. Considering the large volume and infrequent access of cold data, we envision three rationales of cold data representation: 1) parallelized insertion, 2) accurate representation, and 3) constant-time query/deletion. The existing sketches, however, fail to achieve these rationales simultaneously. To this end, we propose a novel sketch named Parallelized cuckoo Filter (PCF) in this paper. PCF divides the standard cuckoo filter into multiple homogenous segments. An additional hash function is introduced to assign an element to a segment. The element will be inserted into the selected segment. With such a design, element insertions in PCF can be naturally parallelized. Besides, as a variant of the cuckoo filter, PCF naturally realizes the accurate representation and constant-time query/deletion requirements. Comprehensive experiments further indicate that PCF achieves the three rationales simultaneously. © 2021 IEEE.

关键词： Hash functions Smart cities Big Data Data structures Standards

来源：评论

学校读者我要写书评

暂无评论

Evaluating matrix multiplication-based convolution algorithm on multi-core digital signal processors

引用

Guofang Keji Daxue Xuebao/Journal of National University of Defense technology 2023年第1期45卷 86-94页

作者： Wang, Qinglin Pei, Xiangdong Liao, Linyu Wang, Haoxu Li, Rongchun Mei, Songzhu Li, Dongsheng College of Computer Science and Technology National University of Defense Technology Changsha410073 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha410073 China

The matrix multiplication-based convolutional algorithm, which can efficiently implement convolutions with different parameters, is the first choice of convolution performance optimization for a given chip. Based on the architecture of Phytium heterogeneous multi-core DSPs(digital signal processors) developed by National University of Defense technology and the characteristic of the matrix multiplication-based convolutional algorithm, a parallel implementation of the matrix multiplication-based convolutional algorithm (called ftmEConv) for different convolutions on multi-core DSPs was proposed. The ftmEConv consists of four parallelized parts(input feature maps transformation, filter transformation, matrix multiplication, and output feature maps transformation), all of which were optimized for multi-core DSPs, and the performance of each part was improved by effectively exploiting the potential of all functional units in DSP cores. The experimental results demonstrate that ftmEConv achieves computational efficiency of up to 42.90%. Compared with other implementations of the matrix multiplication-based convolutional algorithm on heterogeneous chips, ftmEConv gets a speedup of up to 7.79 times. © 2023 National University of Defense technology. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Location-Aware Multi-user Resource Allocation in distributed Clouds

Location-Aware Multi-user Resource Allocation in Distributed...

引用

10th Annual Conference of Advanced Computer Architecture, ACA 2014

作者： Li, Jiaxin Li, Dongsheng Zheng, Jing Quan, Yong National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China Information Center of Logistics Department Beijing China School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9783662444900

Resource allocation for multi-user across multiple data centers is an important problem in cloud computing environments. Many geographically-distributed users may request virtualized resources simultaneously. And the distances from users to allocated resources have much impact on the quality of service (QoS) in multiple data centers environment. Most existing methods do not take all these factors into account when allocating resources. They usually result in poor runtime performance of users' virtual computing environment and the remarkable difference of users' QoS. In this paper, we propose RAMD, a resource allocation algorithm based on multi-stage decision in multiple data centers. The RAMD algorithm allocate VMs to users, taking into account the correlation and interaction between multiple users, so as to minimize the sum of all users' service distances (i.e. determined by user location and network distance of virtual machines). Experimental results show that the algorithm can effectively deal with the cloud resource allocation for multi-user across multiple data centers. It can improve the runtime performance of users' virtualized resources and reduce the difference of QoS. © Springer-Verlag Berlin Heidelberg 2014.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Predicting potential gene ontology from cellular response data 17

Predicting potential gene ontology from cellular response da...

引用

5th International Conference on Bioinformatics and Computational Biology, ICBCB 2017

作者： Hong, Hao Yin, Xiaoyao Li, Fei Guan, Naiyang Bo, Xiaochen Luo, Zhigang Department of Chemistry and Biology National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Department of Biotechnology Beijing Institute of Radiation Medicine Beijing China

ISBN: (纸本)9781450348270

Ontologies have proven to be useful for capturing and organizing knowledge as a hierarchical set of terms and their relationships. However, curating gene ontology data by hand requires specialized knowledge of certain field, which is inefficient. Thus inferring gene ontology from the exponentially increased biological data is getting hot. Based on the Library of Integrated Network-Based Cellular Signatures (LINCS) data we came up with the hypothesis that genes participate in analogous biological processes might affect cells accordantly. By assessing cellular response after genes were knock out we built a similarity matrix with the Gene Set Enrichment Analysis (GSEA) and clustered the genes with affinity propagation algorithm. Next we mapped the cluster result to gene ontology biological process data for annotation and enrichment analysis, which confirmed our hypothesis and made it possible to predict biological processes for unannotated genes from cellular response data after genes are knock out for the first time. We further validated the rationality from the gene ontology molecular function data. © 2017 ACM.

关键词： Gene Ontology

来源：评论

学校读者我要写书评

暂无评论

Simulation research of communication networks based on prim algorithm

Simulation research of communication networks based on prim ...

引用

International Forum on Information technology and Applications

作者： Yang, Chenghui Ren, ChuanJun College of Electrical Engineering Northwest University for Nationalities Lanzhou 730030 China National Laboratory for Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769541150

In order to improve the efficiency of the communication networks, we used the Kruskal algorithm and the Prim algorithm through algorithm comparison and analysis methods of data structure. A dynamic framework for the communication network installed system is built. Moreover, according to the actual framework of the communication network specific issues, the module chooses the Minimum Cost Spanning Tree Prim algorithm ultimately. The assumptions process and outcomes simulation have proper analysis and certification by C language. Experimental results show that the Minimum Cost Spanning Tree of Prim algorithm on the installed system for communication networks dynamic planning process have the advantage of speed and effectively reduce the waste of resources, which not only can ensure efficiency but also can effectively improve communication networks installed cost. © 2010 IEEE.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：