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

arXiv 2017年

作者： Wu, Ancong Zheng, Wei-Shi Lai, Jian-Huang School of Electronics and Information Technology Sun Yat-sen University Guangzhou China Collaborative Innovation Center of High Performance Computing National University of Defense Technology Changsha410073 China School of Data and Computer Science Sun Yat-sen University Guangzhou China Ministry of Education China Guangdong Province Key Laboratory of Information Security China

Person re-identification (re-id) aims to match people across non-overlapping camera views. So far the RGB-based appearance is widely used in most existing works. However, when people appeared in extreme illumination or changed clothes, the RGB appearance-based re-id methods tended to fail. To overcome this problem, we propose to exploit depth information to provide more invariant body shape and skeleton information regardless of illumination and color change. More specifically, we exploit depth voxel covariance descriptor and further propose a locally rotation invariant depth shape descriptor called Eigen-depth feature to describe pedestrian body shape. We prove that the distance between any two covariance matrices on the Riemannian manifold is equivalent to the Euclidean distance between the corresponding Eigen-depth features. Furthermore, we propose a kernelized implicit feature transfer scheme to estimate Eigendepth feature implicitly from RGB image when depth information is not available. We find that combining the estimated depth features with RGB-based appearance features can sometimes help to better reduce visual ambiguities of appearance features caused by illumination and similar clothes. The effectiveness of our models was validated on publicly available depth pedestrian datasets as compared to related methods for person re-identification. Copyright © 2017, The Authors. All rights reserved.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

A Forward-Secure Multi-Receiver Signcryption Scheme

引用

Journal of Harbin Institute of technology(New Series) 2016年第5期23卷 53-61页

作者： Zhimin Yu Zhengjun Jing Hua Yang Chunsheng Gu Key Laboratory of Cloud Computing and Intelligent Information Processing of Changzhou City Jiangsu University of Technology Changzhou Jiangsu 213001 China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China

In order to protect historical ciphertext when the private key leaked in the broadcasting system,the forward-secure multi-receiver signcryption scheme is designed based on the generic graded multilinear mapping encoding structure,which effectively prevents illegal access from intruder to the ciphertext in the past time period when the private key in current time period is *** the generalization of the existing multilinear mapping encoding system,it proposes the generic graded multilinear mapping encoding structure and the generic graded decision Diffie-Hellman *** of the generic graded multilinear mapping encoding system adopted,almost all candidate multilinear mapping encoding systems can automatically adapt to our *** the assumption of generic graded decision Diffie-Hellman problem,it has proved that the scheme has the information confidentiality and unforgeability in the current time *** putting forward the security model of forward-secure multi-receiver signcryption scheme,and under the assumption of generic graded decision Diffie-Hellman problem,it has proved that the scheme has the message forward-confidentiality and *** with other forward-secure public key encryption schemes,the relationship between our scheme and time periods is sub-linear,so it is less complex.

关键词： multilinear mapping forward-secure multi-receiver signcryption confidentiality unforgeability

来源：评论

学校读者我要写书评

暂无评论

Joint power control and proportional fair scheduling for D2D communication underlaying cellular networks 13

Joint power control and proportional fair scheduling for D2D...

引用

13th IEEE International Conference on Signal Processing, ICSP 2016

作者： Li, Xiaoshuai Lin, Ma Xu, Yubin Rajan, Shankaran Harbin Institute of Technology Communication Research Center Harbin China Key Laboratory of Police Wireless Digital Communication China Ministry of Public Security Harbin China Macquarie University Department of Computing Sydney Australia

ISBN: (纸本)9781509013449

Device-to-Device (D2D) communication appears to be a promising component in 5G networks because of its increased spectral efficiency and reduced communication delay. But it also causes the co-channel interference to cellular networks. In this paper, we propose a new power control and resource scheduling scheme by taking into account the fairness, quality-of-service (QoS) requirements to deal with the issue of co-channel interference. The objective of our work is to maximize the sum of all users logarithmic utility functions. This is a NP-hard problem. We decomposed the optimization problem into two main subproblems. The first one is the problem of power control for a single D2D pair and its possible reuse candidates to maximize the overall throughput while ensuring signal-to-noise-and-interference (SINR) requirements of both D2D pair and its reuse candidates. The second one is the problem of Proportional Fair Scheduling (PFS) of resource for multiple D2D pairs and cellular users with a view to improving the system Fairness. We propose to use the Hungarian algorithm to address this issue. Simulation results showed that the proposed algorithm could significantly improve the system performance in terms of the system fairness and the overall system throughput while satisfying the QoS requirements of both D2D and cellular links. © 2016 IEEE.

关键词： Power control

来源：评论

学校读者我要写书评

暂无评论

Learning to Predict Links by Integrating Structure and Interaction Information in Microblogs

引用

Journal of Computer Science & technology 2015年第4期30卷 829-842页

作者：贾岩涛王元卓程学旗 Key Laboratory of Network Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China

Link prediction in microblogs by using unsupervised methods has been studied extensively in recent years, which aims to find an appropriate similarity measure between users in the network. However, the measures used by existing work lack a simple way to incorporate the structure of the network and the interactions between users. This leads to the gap between the predictive result and the ground truth value. For example, the F 1-measure created by the best method is around 0.2. In this work, we firstly discover the gap and prove its existence. To narrow this gap, we define the retweeting similarity to measure the interactions between users in Twitter, and propose a structural-interaction based matrix factorization model for following-link prediction. Experiments based on the real-world Twitter data show that our model outperforms state-of-the-art methods.

关键词： link prediction microblog structure-interaction retweeting similarity matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Person re-identification by camera correlation aware feature augmentation

arXiv

引用

arXiv 2017年

作者： Chen, Ying-Cong Zhu, Xiatian Zheng, Wei-Shi Lai, Jian-Huang School of Data and Computer Science Sun Yat-sen University Guangzhou510275 China Collaborative Innovation Center of High Performance Computing National University of Defense Technology Changsha410073 China Department of Computer Science and Engineering Chinese University of Hong Kong School of Electronic Engineering and Computer Science Queen Mary University of London United Kingdom Key Laboratory of Machine Intelligence and Advanced Computing Sun Yatsen University Ministry of Education China Guangdong Province Key Laboratory of Information Security China

The challenge of person re-identification (re-id) is to match individual images of the same person captured by different non-overlapping camera views against significant and unknown cross-view feature distortion. While a large number of distance metric/subspace learning models have been developed for re-id, the cross-view transformations they learned are view-generic and thus potentially less effective in quantifying the feature distortion inherent to each camera view. Learning view-specific feature transformations for re-id (i.e., view-specific re-id), an under-studied approach, becomes an alternative resort for this problem. In this work, we formulate a novel view-specific person re-identification framework from the feature augmentation point of view, called Camera coRrelation Aware Feature augmenTation (CRAFT). Specifically, CRAFT performs cross-view adaptation by automatically measuring camera correlation from cross-view visual data distribution and adaptively conducting feature augmentation to transform the original features into a new adaptive space. Through our augmentation framework, view-generic learning algorithms can be readily generalized to learn and optimize view-specific sub-models whilst simultaneously modelling view-generic discrimination information. Therefore, our framework not only inherits the strength of view-generic model learning but also provides an effective way to take into account view specific characteristics. Our CRAFT framework can be extended to jointly learn view-specific feature transformations for person re-id across a large network with more than two cameras, a largely under-investigated but realistic re-id setting. Additionally, we present a domain-generic deep person appearance representation which is designed particularly to be towards view invariant for facilitating cross-view adaptation by CRAFT. We conducted extensively comparative experiments to validate the superiority and advantages of our proposed framework over state-of

关键词： Cameras

来源：评论

学校读者我要写书评

暂无评论

INTELLIGENT INFORMATION network security AND MANAGEMENT

引用

China Communications 2016年第7期13卷 3-6页

作者： Yixian Yang Zhongshan Zhang Wenjing Li Information Security Center(ISC) Beijing University of Posts and Telecommunications(BUPT) National Engineering Laboratory for Disaster Backup and Recovery the School of Computer and Communication Engineering in the University of Science and Technology Beijing(USTB) State Key Lab of Networking and Switching Technologies Network Management Research Center at BUPT National Innovation Research Group of China

Intelligent Information network security and Management(IINSM)is an emerging direction in future Internet architecture research,which has gained significant tractions among academia and *** the rapid development of modern society,intelligent information network with the computer as the core technology is widely used in every aspect of social ***

关键词： DCT INTELLIGENT INFORMATION network security AND MANAGEMENT Simulation DWT DCNN

来源：评论

学校读者我要写书评

暂无评论

Efficient group key management for secure big data in predictable large-scale networks

Efficient group key management for secure big data in predic...

引用

作者： He, Shuangyu Wu, Qianhong Qin, Bo Liu, Jianwei Li, Yan School of Electronics and Information Engineering Beihang University Beijing100191 China State Key Laboratory of Integrated Services Networks Xidian University Xi'an710071 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100193 China Key Laboratory of Cryptographic Technology and Information Security Ministry of Education Shandong University Shandong250100 China Ministry of Education School of Information Renmin University of China Beijing China School of Mathematics and Computing Science Guangxi Key Laboratory of Cryptography and Information Security Guilin University of Electronic Technology Guilin Guangxi541004 China State Key Laboratory of Cryptology P.O. Box 5159 Beijing100878 China Aerospace Hengxing Science and Technology Co. LTD Beijing China

It is challenging to secure group communications among large-scale networks due to their network scale. We observe that in many large-scale networks, the scale of actual group communication is nevertheless predicable and not very large. For instance, although the entire social network (e.g., Facebook) may have billions of users, the members in a concrete group are usually about tens to hundreds. We manage to secure group communication in such scenarios with efficient group management protocols. Technically, we achieve this goal by using a novel dual-ring approach in which two rings of nodes are established, one active and one dummy. When some nodes leave, the remaining nodes can replace these nodes with dummy nodes, minimizing the required communications and computations after the protocol is set up and thus providing significant advantage over existing group key management protocols. Formal security arguments show that our protocols are secure under standard computational assumptions. Thorough analysis confirms that our protocols are efficient in computation and communication. Copyright © 2015 John Wiley & Sons, Ltd.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

Pessimistic multi-granulation rough set in incomplete information system

引用

Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia 2016年第2期39卷 203-208页

作者： Yao, Sheng Zhao, Peng Jin, Haijun Chu, Xiaofang Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University Hefei Anhui230039 China School of Computer Science and Technology Hefei Anhui246011 China Quality and Technical Supervision and Inspection Center of QuZhou QuZhou Zhejiang324000 China Hefei Municipal Public Security Bureau Hefei Anhui230011 China

According to granular computing, Pawlak s rough set theory is based on a single granulation; however, multi-granulation rough set theory is applied to describe an uncertain concept by multiple binary relations. In this paper, the multi-granulation rough set approach with maximal consistent block technique has been introduced into the incomplete information system. Based on this maximal consistent block technique, a new pessimistic multi-granulation rough set in the incomplete information system is proposed. The lower and upper approximations of an uncertain set are defined based on this new model, and some properties are proposed for this new model.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient bandwidth allocation method for single-chip heterogeneous processor 7

An energy-efficient bandwidth allocation method for single-c...

引用

7th International Green and Sustainable computing Conference, IGSC 2016

作者： Zhu, Yatao Zhang, Shuai Ye, Xiaochun Wang, Da Tan, Xu Fan, Dongrui Zhang, Zhimin Li, Hongliang State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing China School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi Jiangsu China

ISBN: (纸本)9781509051175

In recent years, many studies on optimization of energy consumption have focused on heterogeneous processor architectures. Heterogeneous computing model composed of CPU and GPU has developed from co-processing between the chips to CPU and GPU integration on the same die. On the one hand, because GPU can work under low voltage and ultra-low frequency, heterogeneous multi-core processors exhibit better energy efficiency compared to traditional CPU;On the other hand, because GPU usually has little or no shared cache, its memory bandwidth demand will be several times more than that of CPU for the same performance. Considering the constraints of power consumption and memory bandwidth, the contention problems of power and bandwidth among CPU and GPU in heterogeneous processor will inevitably occur. In this paper, energy-efficient bandwidth allocation method for heterogeneous processors allocates bandwidth to CPU and GPU and increases the overall throughput of CPU and GPU. Meanwhile the efficiency of energy consumption of heterogeneous processors is improved. The queuing delay is introduced to build a performance-energy model for heterogeneous processors. According to experience parameters, we analyze how the memory bandwidth allocation of off-chip affects the total throughput and energy efficiency. This paper also explores the change of performance-energy gains with the cache miss ratio of processors and the degree of scarce of available peak bandwidth. Based on the above research, the analytical solution of energy-efficient bandwidth allocation for optimal performance is obtained, and the solution can get more performance-energy gains compared with natural bandwidth allocation. © 2016 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

PIWD: A plugin-based framework for well-designed SPARQL 6

PIWD: A plugin-based framework for well-designed SPARQL

引用

6th Joint International Conference on Semantic technology, JIST 2016

作者： Zhang, Xiaowang Song, Zhenyu Feng, Zhiyong Wang, Xin School of Computer Science and Technology Tianjin University Tianjin China School of Computer Software Tianjin University Tianjin300350 China Tianjin Key Laboratory of Cognitive Computing and Application Tianjin China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China

ISBN: (纸本)9783319501116

In the real world datasets (e.g., DBpedia query log), queries built on well-designed patterns containing only AND and OPT operators (for short, WDAO-patterns) account for a large proportion among all SPARQL queries. In this paper, we present a plugin-based framework for all SELECT queries built on WDAO-patterns, named PIWD. The framework is based on a parse tree called well-designed AND-OPT tree (for short, WDAO-tree) whose leaves are basic graph patterns (BGP) and inner nodes are the OPT operators. We prove that for any WDAOpattern, its parse tree can be equivalently transformed into a WDAOtree. Based on the proposed framework, we can employ any query engine to evaluate BGP for evaluating queries built on WDAO-patterns in a convenient way. Theoretically, we can reduce the query evaluation of WDAO-patterns to subgraph homomorphism as well as BGP since the query evaluation of BGP is equivalent to subgraph homomorphism. Finally, our preliminary experiments on gStore and RDF-3X show that PIWD can answer all queries built on WDAO-patterns effectively and efficiently. © Springer International Publishing AG 2016.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：