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

Symposia and Workshops on Ubiquitous, Autonomic and Trusted Computing, UIC-ATC

作者： Ruosong Yang Dianxi Shi Han Li Xiaoyun Mo School of Computer Science National Laboratory for Parallel and Distributed Processing Changsha Hunan

ISBN: (纸本)9781467372121

Nowadays GPS embedded in mobile device such as smartphones can easily identify people's physical locations. However, in daily life people are more concerned about semantic locations (such as dormitories, laboratories, shopping malls, etc.). Usually GPS positioning uses continuous sampling method, which results in a lot of semantically independent sample points. We call these points outliers. How to remove outliers from GPS data and thereby cluster meaningful semantic places is a research challenge in current field of pervasive computing. Aiming at the characteristics of this problem, we first propose a novel approach to add semantic annotations to newly discovered places every day. We use an unsupervised method to discover semantic places, which ensures accuracy of the results and reduces the amount of calculation. Secondly, we discuss the concept of outliers in GPS data collected in daily life, and then eliminate outliers using a density-based method. Moreover, we perform experiments to validate its effectiveness. Thirdly by taking advantage of rule-based inference and reverse geocoding we proposed an approach to calculate the probable semantic labels, which can help user annotate places and reduce the burden on users. Finally, we develop a local System Annotating Semantic Label of Location(SASLL) and by carrying out experiments we demonstrate the validity of our research.

关键词： Semantics Global Positioning System Clustering algorithms Smart phones Roads IEEE 802.11 Standard

来源：评论

学校读者我要写书评

暂无评论

Personalized reputation model in cooperative distributed systems

Personalized reputation model in cooperative distributed sys...

引用

16th IEEE International Conference on parallel and distributed Systems, ICPADS 2010

作者： Liu, Wei Tang, Yang-Bin Wang, Huai-Min School of Computer National Univ. of Defense Technology Changsha Hunan China Institute of Science National Univ. of Defense Technology Changsha Hunan China National Laboratory for Parallel and Distributed Processing Changsha Hunan China

ISBN: (纸本)9780769543079

Reputation systems provide a promising way to build trust relationships between users in distributed cooperation systems, such as file sharing, streaming, distributed computing and social network, through which a user can distinguish good services or users from malicious ones and cooperate with them. However, most reputation models mainly focus on evaluating the quality of services in one dimension, but care less about the preferences of different users. This paper proposes a personalized reputation model which provides each user a personalized trust view on others according to his preferences. In our approach, we aggregate the users' preferences with collaborative filtering method and qualify it with user similarity which is integrated into the computing of reputation value. The experimental results suggest that our model can resist possible kinds of malicious behaviors efficiently. © 2010 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Using redundant threads for fault tolerance of OpenMP programs

Using redundant threads for fault tolerance of OpenMP progra...

引用

2010 International Conference in Information Science and Applications, ICISA 2010

作者： Fu, Hongyi Ding, Yan Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing National University of Defence Tech. Changsha Hunan 410073 China School of Computer National University of Defence Tech. Changsha Hunan 410073 China

ISBN: (纸本)9781424459438

As the wide application of multi-core processor architecture in the domain of high performance computing, fault tolerance for shared memory parallel programs becomes a hot spot of research. For years, checkpointing has been the dominant fault tolerance technology in this field, and recently, many research works have been engaged with it. However, to those programs which deal with large amount of data, checkpointing may induce massive I/O transfer, which will adversely affect scalability. To deal with such a problem, this paper proposes a fault tolerance approach, making use of redundancy, for shared memory parallel programs. Our scheme avoids saving and restoring computational state during the program's execution, hence does not involve I/O operations, so presents explicit advantage over checkpointing in scalability. In this paper, we introduce our approach and the related compiler tool in detail, and give the experimental evaluation result. ©2010 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

High-performance Network Traffic Classification Based on Graph Neural Network 6

High-performance Network Traffic Classification Based on Gra...

引用

6th IEEE Information Technology, Networking, Electronic and Automation Control Conference, ITNEC 2023

作者： Pang, Bo Fu, Yongquan Ren, Siyuan Jia, Yan Harbin Institute of Technology College of Computer Science and Technology Shenzhen China National University of Defense Technology National Key Laboratory for Parallel and Distributed Processing College of Computer Changsha China Peng Cheng Laboratory Shen Zhen China

ISBN: (纸本)9781665460033

Network traffic classification is crucial for network security and network management and is one of the most important network tasks. Current state-of-the-art traffic classifiers are based on deep learning models to automatically extract features from packet streams. Unfortunately, current approaches fail to effectively combine the structural information of traffic packets with the content features of the packets, resulting in limited classification accuracy. In this paper, we propose a graph neural network model for network traffic classification, which can well perceive the interaction feature of packets in traffic. Firstly, we design a graph structure for packets' flows to hold the interaction information between packets, which embeds both packet contents and sequence relationships into a unified graph. Secondly, we propose a graph neural network framework for graph classification to automatically learn the structural features of the packets' flows together with the packets' features. Extensive evaluation results on real-world traffic data show that the proposed model improves the prediction accuracy of improves the prediction accuracy by 2% to 37% for malicious traffic classification. © 2023 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

MixedCache: Enabling Flow Directed Rule-Caching Scheme based on Heterogeneous Cache for OpenFlow 3

MixedCache: Enabling Flow Directed Rule-Caching Scheme based...

引用

2020 3rd International Conference on computer Information Science and Artificial Intelligence, CISAI 2020

作者： Yang, Jialun Yang, Yi Liu, Jiahao Liu, Rulin Qiao, Peng Wang, Baosheng 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

OpenFlow switches in SDN use Multiple Flow Tables (MFTs) for fine-grained flow control. Commodity switches integrate hardware storage resources such as SRAM and TCAM to store flow tables to achieve high-speed lookups. Many increased flow tables are rapidly exhausting these hardware storage resources, which makes the switches have to balance high-speed search and massive storage. The rule-caching scheme is a popular method to solve this problem, which caches the most commonly used rules into hardware storage resources. The existing rule-caching schemes are based on single hardware storage resources, and they cannot flexibly adjust the caching strategy according to the traffic characteristics. Simultaneously, the deployed commodity switches face the problem of difficulty in changing the size of SRAM and TCAM. This paper innovatively proposes the MixedCache scheme, which makes full use of the hardware storage resources in the switch according to the skewed characteristics of network traffic. MixedCache stores the large flows in SRAM by exact match and stores the small flows in the TCAM by wildcard match. MixedCache does not need to change the size of the deployed switch hardware storage resources, but makes full use of existing resources. Compared with the rule-caching scheme based on the exact match, the cache hit rate can increase by up to 15.61%. Compared with the rule-caching scheme based on the wildcard match, the cache hit rate can increase by up to 29.69%. © Published under licence by IOP Publishing Ltd.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

64-bit floating-point FPGA matrix multiplication 05

64-bit floating-point FPGA matrix multiplication

引用

ACM/SIGDA Thirteenth ACM International Symposium on Field Programmable Gate Arrays - FPGA 2005

作者： Dou, Yong Vassiliadis, S. Kuzmanov, G.K. Gaydadjiev, G.N. National Laboratory for Parallel and Distributed Processing Changsha 410073 China Computer Engineering EEMCS TU Delft P.O. Box 5031 2600 GA Delft Netherlands

ISBN: (纸本)9781595930293

We introduce a 64-bit ANSI/IEEE Std 754-1985 floating point design of a hardware matrix multiplier optimized for FPGA implementations. A general block matrix multiplication algorithm, applicable for an arbitrary matrix size is proposed. The algorithm potentially enables optimum performance by exploiting the data locality and reusability incurred by the general matrix multiplication scheme and considering the limitations of the I/O bandwidth and the local storage volume. We implement a scalable linear array of processing elements (PE) supporting the proposed algorithm in the Xilinx Virtex II Pro technology. Synthesis results confirm a superior performance-area ratio compared to related recent works. Assuming the same FPGA chip, the same amount of local memory, and the same I/O bandwidth, our design outperforms related proposals by at least 1.7X and up to 18X consuming the least reconfigurable resources. A total of 39 PEs can be integrated into the xc2vp125-7 FPGA, reaching performance of, e.g., 15.6 GFLOPS with 1600 KB local memory and 400 MB/s external memory bandwidth. Copyright 2005 ACM.

关键词： Field programmable gate arrays

来源：评论

学校读者我要写书评

暂无评论

MCHITS: Monte carlo based method for hyperlink induced topic search on networks

引用

Journal of Networks 2013年第10期8卷 2376-2382页

作者： Jin, Zhaoyan Shi, Dianxi Wu, Quanyuan Fan, Hua National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

Hyperlink Induced Topic Search (HITS) is the most authoritative and most widely used personalized ranking algorithm on networks. The HITS algorithm ranks nodes on networks according to power iteration, and has high complexity of computation. This paper models the HITS algorithm with the Monte Carlo method, and proposes Monte Carlo based algorithms for the HITS computation. Theoretical analysis and experiments show that the Monte Carlo based approximate computing of the HITS ranking reduces computing resources a lot while keeping higher accuracy, and is significantly better than related works. © 2013 ACADEMY PUBLISHER.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

Simulation-based evaluation of the Imagine stream processor with scientific programs

引用

International Journal of High Performance Computing and Networking 2012年第2期7卷 99-110页

作者： Che, Yonggang Xu, Chuanfu Lu, Pingjing Wang, Zhenghua National Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 Hunan China

This paper evaluates the performance and efficiency of Imagine stream processor for scientific programs. It classifies scientific programs into three classes based on their computation to memory access ratios. Typical programs are selected and measured on a simulated Imagine and two general-purpose processors. Comparative analysis is made with special attentions on the computational efficiency, power efficiency and performance bottleneck. The results show that programs in Class 1 attain high performance and high computational efficiency on Imagine. Their performance is only restricted by limited ILP and load imbalance across ALUs. Programs in Class 2 attain moderate performance but non-satisfactory computational efficiency on Imagine due to limited LRF and SRF reuse. Programs in Class 3 attain extremely low performance on Imagine because most of the execution time is spent on DRAM accesses. The estimated power efficiency on Imagine is excellent except for programs in Class 3. Copyright © 2012 Inderscience Enterprises Ltd.

关键词： Computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Efficient deterministic multithreading without global barriers 14

Efficient deterministic multithreading without global barrie...

引用

Proceedings of the 19th ACM SIGPLAN symposium on Principles and practice of parallel programming

作者： Lu, Kai Zhou, Xu Bergan, Tom Wang, Xiaoping Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China University of Washington Computer Science and Engineering United States

ISBN: (纸本)9781450326568

Multithreaded programs execute nondeterministically on conventional architectures and operating systems. This complicates many tasks, including debugging and testing. Deterministic multithreading (DMT) makes the output of a multithreaded program depend on its inputs only, which can totally solve the above problem. However, current DMT implementations suffer from a common inefficiency: they use frequent global barriers to enforce a deterministic ordering on memory accesses. In this paper, we eliminate that inefficiency using an execution model we call deterministic lazy release consistency (DLRC). Our execution model uses the Kendo algorithm to enforce a deterministic ordering on synchronization, and it uses a deterministic version of the lazy release consistency memory model to propagate memory updates across threads. Our approach guarantees that programs execute deterministically even when they contain data races. We implemented a DMT system based on these ideas (RFDet) and evaluated it using 17 parallel applications. Our implementation targets C/C++ programs that use POSIX threads. Results show that RFDet gains nearly 2x speedup compared with DThreads-a start-of-the-art DMT system. Copyright © 2014 ACM.

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：