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

International Conference on Autonomic and Trusted Computing

作者： Ding, Yanrong Wang, Xiaodong Shen, Hu Guo, Pengyu National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769542720

Nested Circular Directional MAC, a modified medium access control protocol of DMAC protocol, is proposed in this paper to support both directional antennas and omni-directional antennas simultaneously in one Ad Hoc network. Omni-directional antennas follow the RTS/CTS mechanism which is multi-hop and directional antennas follow the DRTS/DCTS mechanism, ensuring the asymmetric communication effectively. In order to resolve new deafness problem and hidden terminal problem, the directional antennas also use circular DRTS and nested antenna circumrotation. Simulation results show that NCDMAC supports hybrid antennas effectively and is better than MMAC and Circular-MAC in terms of increasing throughput, but it also increases the communication delay. © 2010 IEEE.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

A distributed Approach to Consistent Order Delivery of Concurrent Events in Asynchronous DVEs

A Distributed Approach to Consistent Order Delivery of Concu...

引用

2010 2nd International Conference on Education technology and Computer(第二届IEEE教育技术与计算机国际会议 ICETC 2010)

作者： Hangjun Zhou Wei Zhang Yuxing Peng Sikun Li Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing Key Laboratory of Science and Technology for National Defence of Parallel and Distributed Processing

ISBN: (纸本)9781424463671;9781424463688;9781424463701

In large-scale asynchronous distributed virtual environments(DVEs), one of the difficult problems is to deliver the concurrent events in a consistent order at each node. Generally, the previous consistency control approaches can be classified into two categories: causal order and time stamped order. However, causal order approaches can merely preserve the cause-effect relation of events and time stamped order approaches seem intrinsically complex to be used in serverless large-scale asynchronous DVEs. In this paper, we proposed a novel distributed algorithm to identify the concurrent events and preserve the consistent order delivery of them at different nodes. Simulation studies are also carried out to compare the performance of this algorithm with that of the previous ones. The results show that the new algorithm can effectively deliver the concurrent events in consistent order at each node and is more efficient than the previous algorithms in large-scale asynchronous DVEs.

关键词： distributed virtual environments concurrent events distributed consistency algorithm

来源：评论

学校读者我要写书评

暂无评论

A technical capability evaluation model based concept and prerequisite relation in computer education 33

A technical capability evaluation model based concept and pr...

引用

33rd International Conference on Software Engineering and Knowledge Engineering, SEKE 2021

作者： Luo, Jiwen Wang, Tao Chang, Junsheng Guo, Xiaoting National Key Laboratory for Parallel and Distributed Processing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)1891706527

Effectively assessing the results of users' online learning and enhancing social recognition has become a major development direction for online education platforms. For computer education, this article constructs a technical capability assessment model. This model integrates professional concepts in the field of computer science and extracts knowledge concepts from educational resources. The model first extracts candidate concepts, then uses a graph propagation algorithm to quantify candidate concepts and obtains concepts from them, and finally uses prerequisite relationships to further quantify the concepts mastered by students. The model combines the prerequisite relationship among concepts to quantify the skills that students have mastered. It can not only effectively evaluate the user's skill mastery but also lays a foundation for subsequent course recommendations and career recommendations for users. The model is tested in the real learning environment of 250 students. This model has been proved to own certain practicability and reliability by Kendall rank correlation coefficient, which is used as an evaluation index. © 2021 Knowledge Systems Institute Graduate School. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

HESA: The construction and evaluation of hierarchical software feature repository 25

HESA: The construction and evaluation of hierarchical softwa...

引用

25th International Conference on Software Engineering and Knowledge Engineering, SEKE 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Li, Xiang Yang, Cheng National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)1891706330

Nowadays, the demand for software resources on different granularity is becoming prominent in software engineering field. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software features, a kind of important knowledge for software reuse, are ideal materials to characterize software resources. Our preliminary study shows that the effectiveness of feature-related tasks, such as software resource retrieval and feature location, will be greatly improved, if a multi-grained feature repository is available. In this paper, we construct a Hierarchical rEpository of Software feAture (HESA), in which a novel hierarchical clustering approach is proposed. For a given domain, we first aggregate a large number of feature descriptions from multiple online software repositories. Then we cluster these descriptions into a flexible hierarchy by mining their hidden semantic structures. Finally, we implement an online search engine on HESA and conduct a user study to evaluate our approach quantitatively. The results show that HESA can organize software features in a more reasonable way compared to the classic and the state-of-the-art approaches. Copyright © 2013 by Knowledge Systems Institute Graduate School.

关键词： Computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Providing information services for wireless sensor networks through cloud computing

Providing information services for wireless sensor networks ...

引用

2012 7th IEEE Asia-Pacific Services Computing Conference, APSCC 2012

作者： You, Pengfei Peng, Yuxing Gao, Hang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha China

ISBN: (纸本)9780769548975

Wireless sensor networks (WSN) is a critical technology for information gathering covering many areas, including health-care, transportation, air traffic control and environment monitoring. Despite wide use, the fast increasing data emanating from WSN is not fully utilized due to the limitation for structure of WSN itself. Along with the further development of WSN, the data form which is not be efficiently managed and applied to supply information services for users. As the emerging IT technology, cloud computing supplies powerful utilization ability for IT resources, which makes many traditional applications migrate to cloud computing. In this paper, we propose a framework integrating cloud computing paradigm and WSN, which fully uses data process ability and service model for cloud computing. In the framework, data form WSN are efficiently utilized and managed, depending on which, information services for WSN are well provided to users. © 2012 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Tree-Structured parallel Regeneration for Multiple Data Losses in distributed Storage Systems Based on Erasure Codes

引用

China Communications 2013年第4期10卷 113-125页

作者：孙伟东王意洁裴晓强 National Key Laboratory for Parallel and Distributed Processing School of Computer National University of Defense Technology

To reduce the time required to complete the regeneration process of erasure codes, we propose a Tree-structured parallel Regeneration (TPR) scheme for multiple data losses in distributed storage systems. Under the scheme, two algorithms are proposed for the construction of multiple regeneration trees, namely the edge-disjoint algorithm and edge-sharing algorithm. The edge-disjoint algorithm constructs multiple independent trees, and is simple and appropriate for environments where newcomers and their providers are distributed over a large area and have few intersections. The edge-sharing algorithm constructs multiple trees that compete to utilize the bandwidth, and make a better utilization of the bandwidth, although it needs to measure the available band-width and deal with the bandwidth changes; it is therefore difficult to implement in practical systems. The parallel regeneration for multiple data losses of TPR primarily includes two optimizations: firstly, transferring the data through the bandwidth optimized-paths in a pipe-line manner; secondly, executing data regeneration over multiple trees in parallel. To evaluate the proposal, we implement an event-based simulator and make a detailed comparison with some popular regeneration methods. The quantitative comparison results show that the use of TPR employing either the edge-disjoint algorithm or edge-sharing algorithm reduces the regeneration time significantly.

关键词： distributed storage system erasure code replication regeneration tree

来源：评论

学校读者我要写书评

暂无评论

An integration framework of cloud computing with wireless sensor networks

An integration framework of cloud computing with wireless se...

引用

7th International Conference on Ubiquitous Information Technologies and Applications, CUTE 2012

作者： You, Pengfei Li, Huiba Peng, Yuxing Li, Ziyang National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology 410073 Changsha China

ISBN: (纸本)9789400758568

Wireless sensor networks (WSN) is a key technology extensively applied in many fields, such as transportation, health-care and environment monitoring. Despite rapid development, the exponentially increasing data emanating from WSN is not efficiently stored and used. Besides, the data from multiple different types and locations of WSN needs to be well analyzed, fused and supplied to various types of clients, such as PC, workstation and smart phone. The emerging cloud computing technology provides scalable data process and storage power and some types of connectable services, which can helpfully utilize sensor data from WSN. In this paper, we propose an integration framework of cloud computing with WSN, in which sensor data is transmitted from WSN to cloud, and processed and stored in cloud, then mined and analyzed so as to be supplied to various clients. By applying virtualization and cloud storage technology, and Infrastructure as a Service (IaaS) and Software as a Service (SaaS) of cloud service model, the framework can fully process and store mass sensor data from multiple types of WSN. Besides, it efficiently mines and analyzes sensor data, based on which the data applications are well supplied to various types of clients in form of services. © 2013 Springer Science+Business Media.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Asycome: A JointCloud Data Asynchronous Collaboration Mechanism Based on Blockchain 3rd

Asycome: A JointCloud Data Asynchronous Collaboration Mechan...

引用

3rd International Conference on Blockchain and Trustworthy Systems, Blocksys 2021

作者： Li, Linhui Shi, Peichang Fu, Xiang Zhang, Shengtian Zhong, Tao Chen, Ming National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811679926

In the Internet of Everything (IoE), due to its issues of complexity and heterogeneity, message delay cannot be guaranteed, and it is not enough to leverage a centralized model for data collaboration. By leveraging the features of blockchain and asynchronous consensus algorithms, a new trust collaboration model can be established in an untrusted environment. Besides, the scalability issue of blockchain poses a challenge to data asynchronous collaboration. In this paper, we propose Asycome, a JointCloud data asynchronous collaboration mechanism based on Directed Acyclic Graph (DAG). This mechanism introduces the new Gossip about gossip protocol, driven by message-transmitting events, to keep data synchronized in an asynchronous environment. Through two stages of voting and committing. Transactions on the same time series do not need to reach the final confirmed state before proceeding to the next transaction processing. Over time, all transactions are connected to the DAG, ensuring that the consensus is finally reached. We evaluated the performance of the mechanism with experiments on throughput and latency. And the feasibility of Asycome is analyzed from the liveness and security. The results show that higher throughput, lower latency, and Asynchronous Byzantine Fault Tolerance (ABFT) characteristics can meet the technical requirements of complex and asynchronous data collaboration of the IoE to some extent. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Modeling complex relationship paths for knowledge graph completion

Modeling complex relationship paths for knowledge graph comp...

引用

作者： Zeng, Ping Tan, Qingping Meng, Xiankai Zhang, Haoyu Xu, Jianjun College of Computer National University of Defense Technology Changsha China National Key Laboratory for Parallel and Distributed Processing Changsha China

Determining the validity of knowledge triples and filling in the missing entities or relationships in the knowledge graph are the crucial tasks for large-scale knowledge graph completion. So far, the main solutions use machine learning methods to learn the low-dimensional distributed representations of entities and relationships to complete the knowledge graph. Among them, translationmodels obtain excellent performance. However, the proposed translation models do not adequately consider the indirect relationships among entities, affecting the precision of the representation. Based on the long short-term memory neural network and existing translation models, we propose a multiple-module hybrid neural network model called TransP. By modeling the entity paths and their relationship paths, TransP can effectively excavate the indirect relationships among the entities, and thus, improve the quality of knowledge graph completion tasks. Experimental results show that TransP outperforms state-of-the-art models in the entity prediction task, and achieves the comparable performance with previous models in the relationship prediction task. © 2018 The Institute of Electronics, Information and Communication Engineers.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：