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

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Liu, Bingxun Yin, Gang Wang, Tao Zhang, Fang Wang, Huaimin National Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

As the rapid growth of open source software, how to choose software from many alternatives becomes a great challenge. Traditional ranking approaches mainly focus on the characteristics of the software themselves, such as qualities, security, reliable and so on. In this paper we investigate the market demands for software engineers, and propose a novel approach for ranking software by analyzing the market requirements for special software. At the same time we conclude the characteristics of software advertisements and analyze the reasons that why these situations emerge and tendency of software market requirements. As industries always need to balance several different factors for selecting software, the market demands can be a good indicator for ranking software and software evaluating. This paper provides quite a different perspective and some interesting inferences on software market requirements, and it can be a valuable supplement for traditional ranking methods, as well as software evaluating. © 2015 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Unified Contextualized Knowledge Embedding Method for Static and Temporal Knowledge Graph

引用

IEEE/ACM Transactions on Audio Speech and Language Processing 2024年 33卷 82-95页

作者： Gao, Yifu Qiao, Linbo Huang, Zhen Kan, Zhigang He, Yongquan Li, Dongsheng National University of Defense Technology National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology Changsha410000 China Intelligent Game and Decision Lab Beijing China Meituan Beijing100102 China

Recent years, there is a growing interest in knowledge graph embedding (KGE), which maps symbolic entities and relations into low-dimensional vector space to effectively represent structured data from the knowledge graph. In addition, the concept of temporal knowledge graph is proposed to document dynamically changing facts in the real world. Existing works attempt to incorporate temporal information into static KGE methods to accomplish temporal knowledge representations. However, existing static or temporal KGE approaches focus on the single query fact and ignore the query-relevant contextual information in the graph structure. This paper moves beyond the traditional way of scoring facts in distinct vector space and proposes a unified framework with pre-trained language models (PLM) to learn dynamic contextualized static/temporal knowledge graph embeddings, called CoS/TKGE. Given the query-specific subgraph, our model transforms it into an input sequence and uses the PLM to obtain the contextualized knowledge representations, which is flexible adaptive to the input graph contexts. We reformulate the link prediction task as a mask prediction problem to fine-tune the pre-trained language model. And the contrastive learning technique is employed to align dynamic contextual embeddings with static global embeddings. Experimental results on three widely used static and temporal KG datasets show the superiority of our model. © 2014 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research of context situation awareness technology

Research of context situation awareness technology

引用

作者： Shi, Dianxi Wu, Zhendong Ding, Bo Yan, Huining National Key Laboratory for Parallel and Distributed Processing School of Computer Science National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9780769546698

Context situation, which means a snapshot of the status of the real world, is formed by integrating a large amount of contexts collected from various resources. How to get the context situation and use the situation to provide better services is a challenging issue. In this paper, we focused on this challenge on the basis of the mobile cloud computing architecture. An abstract model is proposed in this paper to uniformly collect the context and send them to cloud. A rule-based large-scale context aggregation algorithm is also proposed which utilizes the MapReduce computing paradigm. Finally, a large-scale context management framework based on the abstract model and the context aggregation algorithm is proposed, and a real-time traffic demo is implemented to verify the validity of the framework. © 2012 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Ladder: A Blockchain Model of Low-Overhead Storage 3rd

Ladder: A Blockchain Model of Low-Overhead Storage

引用

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

作者： Chen, Peng Zhang, Xunhui Liu, Hui Xiang, Liangliang Shi, Peichang National Key Laboratory of Parallel and Distributed Processing College of Computer Science National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811679926

Emerging blockchain accounting mechanism allow mutually distributed parties to transport trusted information and ensure the correctness of data. Every blockchain node stores the complete block locally. Although this measure improves security, it causes huge storage overhead. We present Ladder, a multi-level low-overhead storage model for blockchain, which can greatly reduce the storage overhead of nodes while ensuring that the blockchain cannot be tampered easily and the block information is complete. Ladder distinguishes the retrieved frequency and importance of different blocks by value-density, dividing them into Hot-Blocks, Warm-Blocks and Cold-Blocks adopting different storage strategies respectively. Through experimental verification of time and space cost of different storage strategies, Ladder can greatly reduce the local storage overhead of nodes. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Resource Allocation with Dynamic Substrate Network in Data Centre Networks

引用

China Communications 2013年第9期10卷 130-142页

作者：李小玲王怀民丁博李小勇刘惠 National Key Laboratory for Parallel and Distributed Processing School of Computer ScienceNational University of Defense Technology

The resource allocation problem in data centre networks refers to a map of the workloads provided by the cloud users/tenants to the Substrate Network(SN)which are provided by the cloud *** studies consider the dynamic arrival and departure of the workloads,while the dynamics of the substrate are *** this paper,we first propose the resource allocation with the dynamic SN,and denote it as ***,we propose an efficient mapping algorithm for *** performance of the proposed algorithm is evaluated by performing simulation *** results show that the proposed algorithm can effectively solve the GraphMap-DS.

关键词： resource allocation data centrenetwork workload substrate algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on accelerating CEE-DGCNN event extraction algorithm based on multi-CPU platform 2

Research on accelerating CEE-DGCNN event extraction algorith...

引用

2020 2nd International Conference on Electronics and Communication, Network and Computer technology, ECNCT 2020

作者： Li, Yan Jiang, Jinfei Xu, Jinwei Gao, Zikai Dou, Yong Zhou, Haifang Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha410005 China Department of Computational Science National University of Defense Technology Changsha410005 China

With the development of the Internet, the volume of information is expanding rapidly, and the complex information makes it particularly important to extract information quickly and intelligently. Event extraction algorithm is such a kind of fast and accurate information acquisition algorithm. With the development of deep learning in recent years, deep learning also shines in the field of time extraction. CEE-DGCNN network is an efficient and accurate event extraction algorithm for Chinese text. At present, the acceleration research on deep learning in the academic community mainly focuses on GPU, FPGA and other platforms. In fact, compared with these platforms, CPU is more versatile. Considering that the algorithm should have universality and universality in industrial application, this paper makes an in-depth analysis of CEE-DGCNN algorithm to study its acceleration on CPU. Experiments were carried out on x86 and ARM architectures respectively, and good acceleration effects were achieved. © 2020 Published under licence by IOP Publishing Ltd.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Unified weighted label propagation algorithm using connection factor 12th

Unified weighted label propagation algorithm using connectio...

引用

12th International Conference on Advanced Data Mining and Applications, ADMA 2016

作者： Wang, Xin Jian, Songlei Lu, Kai Wang, Xiaoping College of Computer National University of Defense Technology Changsha China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9783319495859

With the social networks getting increasingly larger, fast community detection algorithms like the label propagation algorithm, are attracting more attention. But the label propagation algorithm deals vertices with no proper weight, which leads to the loss in the performance. We propose the connection factor of the vertex to measure its influence on the local connectivity. The connection factor can reveal the topological structure feature, and we propose a unified weight to modify the original label propagation algorithm. Experiments show that our Unified Weighted LPA has an average performance promotion from 5% to 10 %, in the best case more than 30%. © Springer International Publishing AG 2016.

关键词： Population dynamics

来源：评论

学校读者我要写书评

暂无评论

An efficient SIMD compression format for sparse matrix-vector multiplication

An efficient SIMD compression format for sparse matrix-vecto...

引用

作者： Chen, Xinhai Xie, Peizhen Chi, Lihua Liu, Jie Gong, Chunye Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China Institute of Advanced Science and Technology Hunan Institute of Traffic Engineering Hengyang China

Sparse matrix-vector multiplication (SpMV) is an essential kernel in sparse linear algebra and has been studied extensively on all modern processor and accelerator architectures. Compressed Sparse Row (CSR) is a frequently used format for sparse matrices storage. However, CSR-based SpMV has poor performance on processors with vector units. In order to take full advantage of SIMD acceleration technology in SpMV, we proposed a new matrix storage format called CSR-SIMD. The new storage format compresses the non-zero elements into many variable-length data fragments with consecutive memory access addresses. Thus, the data locality of sparse matrix A and dense vector x expands and the floating-point operations for each fragment can be completely calculated by vectorized implementation on wide SIMD units. Our experimental results indicate that CSR-SIMD has better storage efficiency and low-overhead for format conversion. Besides, the new format achieves high scalability on wide SIMD units. In comparison with the CSR-based and BCSR-based SpMV, CSR-SIMD obtains better performance on FT1500A, Intel Xeon, and Intel Xeon Phi. © 2018 John Wiley & Sons, Ltd.

关键词： Storage efficiency

来源：评论

学校读者我要写书评

暂无评论

Effective hierarchical routing algorithm for large-scale wireless mobile networks

引用

Journal of Networks 2014年第2期9卷 344-352页

作者： Yan, Guofeng Peng, Yuxing Hu, Ying Liu, Junyi School of Computer and Communication Hunan Institute of Engineering Hunan 411104 China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha 410073 China School of Computer National University of Defense Technology Changsha 410073 China

The growing interest in wireless mobile network techniques has resulted in many routing protocol proposals. The unpredictable motion and the unreliable behavior of mobile nodes is one of the key issues in wireless mobile network. Virtual mobile node (VMN) consists of robust virtual nodes that are both predictable and reliable. Based on VMN, in this paper, we present a hierarchical routing algorithm, i.e., EHRA-WAVE, for large-scale wireless mobile networks. By using mobile WAVE technology, a routing path can be found rapidly between VMNs without accurate topology information. We introduce the routing algorithm and the implementation issues of the proposed EHRA-WAVE routing algorithm. Finally, we evaluate the performance of EHRA-WAVE through experiments, and compare the performance on VMN failure and message delivery ratio using hierarchical and non-hierarchical routing methods. However, due to the large amounts WAVE flooding, EHRA-WAVE results in too large load which would impede the application of the EHRA-WAVE algorithm. Therefore, the further routing protocol focuses on minimizing the number of WAVE using hierarchical structures in large-scale wireless mobile networks. © 2014 Academy Publisher.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：