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

作者： Chen, Peixin Wu, Yilun Su, Jinshu Wang, Xiaofeng College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

The key escrow problem and high computational cost are the two major problems that hinder the wider adoption of hierarchical identity-based signature (HIBS) scheme. HIBS schemes with either escrow-free (EF) or online/offline (OO) model have been proved secure in our previous work. However, there is no much EF or OO scheme that has been evaluated experimentally. In this letter, several EF/OO HIBS schemes are considered. We study the algorithmic complexity of the schemes both theoretically and experimentally. Scheme performance and practicability of EF and OO models are discussed. © Copyright 2016 The Institute of Electronics, Information and Communication Engineers.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

A novel L1 cache based on volatile STT-RAM 20th

A novel L1 cache based on volatile STT-RAM

引用

20th Annual Conference on Computer Engineering and Technology, NCCET 2016

作者： Hongguang, Zhang Minxuan, Zhang College of Computer National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811031588

Spin-transfer torque random access memory (STT-RAM) is one of the most promising substitutes for universal main memory and cache due to its excellent scalability, high density and low leakage power. Nevertheless, the current non-volatile STT-RAM cache architecture also has some drawbacks, such as long write latency and high write energy, which limit the application of STTRAM in the top level cache design. To solve these problems, we relax the retention time of STT-RAM to explore its different write performance, and propose a novel STT-RAM L1 cache architecture implemented with volatile STT-RAM as well as its related refresh scheme. The performance of proposed design is the same as SRAM L1 cache while its overall power consumption is only 63.8% of the latter one. © Springer Nature Singapore Pte Ltd. 2016.

关键词： Static random access storage

来源：评论

学校读者我要写书评

暂无评论

A supervised approach for tag hierarchy construction in open source communities 15

A supervised approach for tag hierarchy construction in open...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Gu, Chongming Yin, Gang Wang, Tao Yang, Cheng Wang, Huaimin Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China

ISBN: (纸本)9781450336413

The massive amounts of open source software provide sufficient reusable resources for software development. Most of the OSS communities adopt a kind of categorization or tagging mechanism to organize the software. However, the categorization often too coarse, while the tags are flat and fail to capture the inter-relation among them. In this paper, we propose a novel approach to reveal the latent relations between tags and build a tag hierarchy to help locate resources. We firstly build a co-occurrence network, based on which we compare the connotations of tags and construct a preliminary hierarchy. Then we leverage the domain knowledge of category in SourceForge to optimize and improve the relations between tags. At the end, we demonstrate the effectiveness of the constructed tag hierarchy with quantitative evaluation, which suggest the validation of our approach. © 2015 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Personalized mobile application discovery 1

Personalized mobile application discovery

引用

1st International Workshop on Crowd-Based Software Development Methods and Technologies, CrowdSoft 2014

作者： Yang, Cheng Wang, Tao Yin, Gang Wang, Huaimin Wu, Ming Xiao, Ming Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China

ISBN: (纸本)9781450332248

With the dramatic growing of mobile application markets, users can find apps with any function they desire in these markets. However, the huge amounts of apps make it quite a challenge for users to discover good applications efficiently. Previous studies recommend applications based on the download history, user ratings or app usage records. Most of these studies fail to capture users' personal interests in mobile applications precisely. In this paper, we leverage apps as features for describing user's personal interests and propose a novel approach to do personalized recommendation. We introduce a Small-Crowd model to distinguish apps at reflecting users' personal interests, and design a weighting method to rank the installed apps for users by combining the global download information with fine-grained app usage records. The extensive experiments validate the effectiveness of our approach which outperforms state-of-the-art method. Copyright 2014 ACM.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Topology awareness algorithm for virtual network mapping

引用

Journal of Zhejiang University-Science C(Computers and Electronics) 2012年第3期13卷 178-186页

作者： Xiao-ling LI Huai-min WANG Chang-guo GUO Bo DING Xiao-yong LI Wen-qi BI Shuang TAN National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology.Changsha 410073China School of Computer National University of Defense TechnologyChangsha 410073China China Electronic Systems Engineering Corporation Beijing 100039China The Northern Institute of Electronic Equipment of China Beijing 100083China

Network virtualization is recognized as an effective way to overcome the ossification of the Internet. However, the virtual network mapping problem (VNMP) is a critical challenge, focusing on how to map the virtual networks to the substrate network with efficient utilization of infrastructure resources. The problem can be divided into two phases: node mapping phase and link mapping phase. In the node mapping phase, the existing algorithms usually map those virtual nodes with a complete greedy strategy, without considering the topology among these virtual nodes, resulting in too long substrate paths (with multiple hops). Addressing this problem, we propose a topology awareness mapping algorithm, which considers the topology among these virtual nodes. In the link mapping phase, the new algorithm adopts the k-shortest path algorithm. Simulation results show that the new algorithm greatly increases the long-term average revenue, the acceptance ratio, and the long-term revenue-to-cost ratio (R/C).

关键词： Network virtualization Ossification Virtual network (VN) mapping Substrate network (SN) Topology awareness Acceptance ratio

来源：评论

学校读者我要写书评

暂无评论

Evaluating bug severity using crowd-based knowledge: An exploratory study 15

Evaluating bug severity using crowd-based knowledge: An expl...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Yin, Gang Wang, Tao Yu, Yue Wang, Huaimin Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

In bug tracking system, the high volume of incoming bug reports poses a serious challenge to project managers. Triaging these bug reports manually consumes time and resources which leads to delaying the resolution of important bugs. StackOverow is the most popular crowdsourcing Q&A community with plenty of bug-related posts. In this paper, we explore the correlation between bug severity and the crowd attributes of linked posts. Two typical types of projects' bug repositories are studied here, e.g. Mozilla (user-centric project) and Eclipse (developer-centric project). Our results show that the bug severity is consistent with the crowd- based knowledge both in Mozilla and Eclipse, i.e. the linked posts of severe bugs have higher score etc. in StackOverow than non-severe bugs. This interesting phenomenon inspires us that we can optimize the existing evaluation methods of bug severity by incorporating the crowd-based knowledge from a third-party in future. © 2015 ACM.

关键词： StackOverflow crowd-based knowledge Bugzilla Bug severity

来源：评论

学校读者我要写书评

暂无评论

Exploring the use of @-mention to assist software development in GitHub 15

Exploring the use of @-mention to assist software developmen...

引用

7th Asia-Pacific Symposium on Internetware, Internetware 2015

作者： Zhang, Yang Wang, Huaimin Yin, Gang Wang, Tao Yu, Yue Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450336413

Recently, many researches propose that social media tools can promote the collaboration among developers, which are beneficial to the software development. Nevertheless, there is little empirical evidence to confirm that using @-mention has indeed a beneficial impact on the issues in GitHub. In this paper, we analyze the data from GitHub and give some insights on how @-mention is used in the issues (general- issues and pull-requests). Our statistical results indicate that, @-mention attracts more participants and tends to be used in the difficult issues. @-mention favors the solving process of issues by enlarging the visibility of issues and facilitating the developers' collaboration. In addition to this global study, our study also build a @-network based on the @-mention database we extract. Through the @-network, we can mine the relationships and characteristics of developers in GitHub's issues. © 2015 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

A distributed paging RAM grid system for wide-area memory sharing 20

A distributed paging RAM grid system for wide-area memory sh...

引用

20th IEEE International parallel and distributed processing Symposium, IPDPS 2006

作者： Chu, Rui Xiao, Nong Zhuang, Yongzhen Liu, Yunhao Lu, Xicheng National Key Laboratory for Parallel and Distributed Processing ChangSha HuNan China Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong

ISBN: (纸本)1424400546

Memory-intensive applications often suffer from the poor performance of disk swapping when memory is inadequate. Remote memory sharing schemes, which provide a remote memory that is faster than the local hard disk, are able to improve the performance of such applications. Due to the limitation of being applicable within single clusters only, however, most of the previous remote memory mechanisms, such as the network memory scheme, fail to be extendable into a large scale, distributed, heterogeneous, and dynamic environment. In this work, we propose a service-oriented grid memory sharing scheme, distributed Paging RAM Grid (DPRG). We study the properties and criteria of large scale memory sharing, and then design major operations and optimizations to fit the usage of grid systems. We collect trace from our grid environment, and evaluate DPRG through comprehensive trace-driven simulations. Results show that DPRG significantly outperforms existing remote memory sharing schemes and supports grid computing applications effectively. © 2006 IEEE.

关键词： Storage allocation (computer)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：