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

International Conference on Machine Learning and Applications (ICMLA)

作者： Xiang Zhang Naiyang Guan Zhigang Luo Xuejun Yang College of Computer National University of Defense Technology Changsha China National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China The State key Laboratory of High Performance Computing National University of Defense Technology Changsha China

This paper formulates multi-label learning as a constrained projective non-negative matrix factorization (CPNMF) problem which concentrates on a variant of the original projective NMF (PNMF) and explicitly introduces an auxiliary basis to learn the semantic subspace and boosts its discriminating ability by exploiting labeled and unlabeled examples together. Particularly, it propagates labels of the labeled examples to the unlabeled ones by enforcing coefficients of examples sharing identical semantic contents to be identical based on a hard constraint, i.e., embedding the class indicator of labeled examples into their coefficients. CPNMF preserves the geometrical structure of dataset via manifold regularization meanwhile captures the inherent structure of labels by using label correlations. We developed a multiplicative update rule (MUR) based algorithm to optimize CPNMF and proved its convergence. Experiments of image annotation on Corel dataset, text categorization on Rcv1v2 dataset, and text clustering on two popular text corpuses suggest the effectiveness of CPNMF.

关键词： Conferences

来源：评论

学校读者我要写书评

暂无评论

A full-pipelined architecture of the schnorr-euchner MIMO sphere decoder

引用

9th FTRA InternationalConference on Future Information technology, FutureTech 2014

作者： Guo, Lei Zeng, Shirong Dou, Yong Jiang, Jingfei National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

ISBN: (纸本)9783642550379

Multiple-input and multiple-output (MIMO) is an important approach in high-rate wireless communications. The Schnorr-Euchner (SE) sphere-decoding algorithm enables fast detection for receivers by recursive tree searching with optimized expanding order. In this paper, we propose a looped-pipeline architecture for an SE MIMO detector that processes multiple groups of data in parallel. The full-pipelined design has a short critical path that provides a maximum working frequency of 229 MHz on FPGA. High throughput is achieved at a relatively low cost. © 2014 Springer-Verlag Berlin Heidelberg.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

An Efficient Identity-Based Key Agreement Protocol in a Multiple PKG Environment

引用

Wuhan University Journal of Natural sciences 2014年第5期19卷 455-460页

作者： ZHOU Huan WANG Xiaofeng SU Jinshu School of Computer National University of Defense Technology National Laboratory for Parallel and Distributed Processing National University of Defense Technology

Identity-based key agreement protocol affords a natural way to combine the participant＇s identity with its public key. However, most of them just consider the key agreement in a single private key generator （PKG） environment. In addition, the existing key agreement protocols have a great computing overhead for mobile computing which is more and more popular today. This paper proposes a new identity based key agreement protocol. With the help of mathematical tools, we make our protocol applied in multiple PKG environment. It also satisfies all the security properties which is set for key agreement protocol. Moreover, some of its time-consuming operations can be delivered to untrusted public computation resources, so its computing complexity can be greatly reduced.

关键词： key agreement identity based public computation multiple PKG environment

来源：评论

学校读者我要写书评

暂无评论

A survey on activity recognition using wireless signals

引用

Ruan Jian Xue Bao/Journal of Software 2015年 26卷 39-48页

作者： Yang, Xue Lü, Shao-He Zhang, Min Wang, Xiao-Dong Zhou, Xing-Ming National Key Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

Activity recognition has broad application prospects in many fields including pervasive computing and human-computer interaction. In this paper, the technology of wireless-based activity recognition is introduced. By using wireless signals, one can achieve non-line-of-sight recognition without carrying any devices. Also, it is easy to deploy a wireless-based recognition system due to the ubiquity of wireless communication system. The basic idea is that, as a specific propagation path is formed when the signal is blocked, reflected or scattered at body, one can detect the different characteristics of propagation that correspond to the distinct human behaviors. As a result, action recognition is performed by analyzing the distinguishable features of signal propagation. The basic principles and applications of wireless-based activity recognition are reviewed, and the challenges and related performance metrics are presented. Finally, open problems are discussed to point out the future research trends. © Copyright 2015, Institute of Software, the Chinese Academy of sciences. All right reserved.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Exploring the patterns of social behavior in Github 1

Exploring the patterns of social behavior in Github

引用

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

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

ISBN: (纸本)9781450332248

Social coding paradigm is reshaping the distributed soft- ware development with a surprising speed in recent years. Github, a remarkable social coding community, attracts a huge number of developers in a short time. Various kinds of social networks are formed based on social activities among developers. Why this new paradigm can achieve such a great success in attracting external developers, and how they are connected in such a massive community, are interesting questions for revealing power of social coding paradigm. In this paper, we firstly compare the growth curves of project and user in GitHub with three traditional open source software communities to explore differences of their growth modes. We find an explosive growth of the users in GitHub and introduce the Diffusion of Innovation theory to illustrate intrinsic sociological basis of this phenomenon. Secondly, we construct follow-networks according to the follow behaviors among developers in GitHub. Finally, we present four typical social behavior patterns by mining follow-networks containing independence-pattern, group-pattern, star-pattern and hub-pattern. This study can provide several instructions of crowd collaboration to newcomers. According to the typical behavior patterns, the community manager could design corresponding assistive tools for developers. Copyright 2014 ACM.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Investigating social media in GitHub's pull-requests: A case study on ruby on rails 1

Investigating social media in GitHub's pull-requests: A case...

引用

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

作者： Zhang, Yang Yin, Gang Yu, Yue Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781450332248

In GitHub, pull-request mechanism is an outstanding social development method by integrating with many social media. Many studies have explored that social media has an important effect on software development. @-mention as a typical social media, is a useful tool in social platform. In this paper, we made a quantitative analysis of @-mention in pull-requests of the project Ruby on Rails. First, we make a convictive statistics of the popularity of pull-request mechanism in GitHub. Then we investigate the current situation of @-mention in the Ruby on Rails. Our empirical analysis results find some insights of @-mention. Copyright 2014 ACM.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

A exploratory study of @-mention in GitHub's Pull-requests 21

A exploratory study of @-mention in GitHub's Pull-requests

引用

21st Asia-Pacific Software Engineering Conference, APSEC 2014

作者： Zhang, Yang Yin, Gang Yu, Yue Wang, Huaimin National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9781479974252

Pull-request mechanism is an outstanding social development method in GitHub. @-mention is a social media tool that deeply integrated with pull-request mechanism. Recently, many research results show that social media tools can promote the collaborative software development, but few work focuses on the impacts of @-mention. In this paper, we conduct an exploratory study of @-mention in pull-request based software development, including its current situation and benefits. We obtain some interesting findings which indicate that @-mention is beneficial to the processing of pull-request. Our work also proposes some possible research directions and problems of the @-mention. It helps the developers and researchers notice the significance of @-mention in the pull-request based software development. © 2014 IEEE.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

RTC: Link schedule based MAC design in multi-hop wireless network

RTC: Link schedule based MAC design in multi-hop wireless ne...

引用

International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (QSHINE)

作者： Xuan Dong Yinjia Huo Chunsheng Zhu Shaohe Lv Wenxiang Li Xiaodong Wang Department of Electrical and Computer Engineering The University of British Columbia Vancouver BC Canada National Laboratory of Parallel and Distributed Processing National University of Defense Technology Changsha China Engineering Research Center for Metallurgical Automation and Detecting Technology of Ministry of Education Wuhan University of Science and Technology Wuhan China

ISBN: (纸本)9781479982172

The performance of an ad-hoc network is greatly limited by collisions due to hidden terminals. In this paper, we propose a receiver tracking contention (RTC) scheme, which achieves high throughput by allowing the receivers to assist for channel contention. In RTC, link is the basic unit for channel access contention. Specifically, transmitter is used to contend for the channel and receiver is used to announce the potential collision. Based on INT message coding scheme, transmitter and its corresponding receiver can be well coordinated. In such mechanism, hidden terminals are avoided and exposed terminals are encouraged to transmit simultaneously. Based on OFDM modulation, RTC packets several subcarriers as subcontention unit and operates channel contention over multiple subcontention units. Furthermore, each subcontention unit maintains a transmission set, where collision-free links are allowed to merged into the transmission set In this case, the transmission set of subcontention unit can be aggregated after each contention period. When the subcontention unit i is the smallest index of non-empty subcontention unit, the transmission set of unit i will win the channel contention and transmitters of unit i will start to transmit in the following data transmission period. Analysis and simulation results show that RTC achieves a notable throughput gain over Back2f as high as 190% through simulation.

关键词： Receivers OFDM Transmitters Electronics packaging

来源：评论

学校读者我要写书评

暂无评论

An abstract domain to infer symbolic ranges over nonnegative parameters

An abstract domain to infer symbolic ranges over nonnegative...

引用

作者： Wu, Xueguang Chen, Liqian Wang, Ji National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

The value range information of program variables is useful in many applications such as compiler optimization and program analysis. In the framework of abstract interpretation, the interval abstract domain infers numerical bounds for each program variable. However, in certain applications such as automatic parallelization, symbolic ranges are often desired. In this paper, we present a new numerical abstract domain, namely the abstract domain of parametric ranges, to infer symbolic ranges over nonnegative parameters for each program variable. The new domain is designed based on the insight that in certain contexts, program procedures often have nonnegative parameters, such as the length of an input list and the size of an input array. The domain of parametric ranges seeks to infer the lower and upper bounds for each program variable where each bound is a linear expression over nonnegative parameters. The time and memory complexity of the domain operations of parametric ranges is O(nm) where n is the number of program variables and m is the number of nonnegative parameters. On this basis, we show the application of parametric ranges to infer symbolic ranges of the sizes of list segments in programs manipulating singly-linked lists. Finally, we show preliminary experimental results. © 2014 Elsevier B.V. All rights reserved.

关键词： Model checking

来源：评论

学校读者我要写书评

暂无评论

Tag recommendation for open source software

引用

Frontiers of Computer science 2014年第1期8卷 69-82页

作者： Tao WANG Huaimin WANG Gang YIN Charles X. LING Xiao LI Peng ZOU National Laboratory for Parallel and Distributed Processing College of Computer Department of Computer Science The University of Western Ontario London N6A5B7 Canada Academy of Equipment Beijing 101400 China

Nowadays open source software becomes highly popular and is of great importance for most software engi- neering activities. To facilitate software organization and re- trieval, tagging is extensively used in open source communi- ties. However, finding the desired software through tags in these communities such as Freecode and ohloh is still chal- lenging because of tag insufficiency. In this paper, we propose TRG （tag recommendation based on semantic graph）, a novel approach to discovering and enriching tags of open source software. Firstly, we propose a semantic graph to model the semantic correlations between tags and the words in software descriptions. Then based on the graph, we design an effec- tive algorithm to recommend tags for software. With com- prehensive experiments on large-scale open source software datasets by comparing with several typical related works, we demonstrate the effectiveness and efficiency of our method in recommending proper tags.

关键词： open source software semantic graph tag rec-ommendation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：