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

IEEE International Conference on Automation Science and engineering

作者： Xin Luo Shuai Li Institute of Green and Intelligent Technology Shenzhen Engineering Laboratory for Mobile Internet Application Middleware Technology of Shenzhen University Shenzhen China Department of Computing Hong Kong Polytechnic University Hong Kong China

Latent factor (LF) models have proven to be accurate and efficient in extracting hidden knowledge from high-dimensional and sparse (HiDS) matrices. However, most LF models fail to fulfill the non-negativity constraints that reflect the non-negative nature of industrial data. Yet existing non-negative LF models for HiDS matrices suffer from slow convergence leading to considerable time cost. An alternating direction method-based non-negative latent factor (ANLF) model decomposes a non-negative optimization process into small sub-tasks. It updates each LF non-negatively based on the latest state of those trained before, thereby achieving fast convergence and maintaining high prediction accuracy and scalability. This paper theoretically analyze the characteristics of an ANLF model, and presents detailed empirical study regarding its performance on several HiDS matrices arising from industrial applications currently in use. Therefore, its capability of addressing HiDS matrices is validated in both theory and practice.

关键词： LF HiDS practice

来源：评论

学校读者我要写书评

暂无评论

Dynamic resource provision for cloud broker with multiple reserved instance terms 1

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Zhang, Jiangtao Chen, Shi Huang, Hejiao Wang, Xuan Du, Dingzhu School of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen518055 China Public Service Platform of Mobile Internet Application Security Industry Shenzhen518057 China Shenzhen Key Laboratory of Internet of Information Collaboration Shenzhen518055 China Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application Shenzhen518055 China Department of Computer Science University of Texas at Dallas RichardsonTX75080 United States

ISBN: (数字)9783319271194

ISBN: (纸本)9783319271187

Relying on the knowledge of the pricing benefit of long-term reserved resource and multiplexing gains, cloud broker strives to minimize its cost by utilizing infrastructure resources from public cloud service provider. Different reserved instance terms accompanied by different prices are provisioned by the provider. How to choose the appropriate ones from various terms to meet the dynamic user demands at the least cost is a great challenge. This paper addresses the challenge by two algorithms. Extensive real world traces driven evaluations show that the heuristic algorithm runs about twice as fast as the approximation one, while both algorithms can save almost the same resource cost up to 27%. © Springer International Publishing Switzerland 2015.

关键词： Costs

来源：评论

学校读者我要写书评

暂无评论

Outsourcing Two-Party Privacy Preserving K-Means Clustering Protocol in Wireless Sensor Networks

Outsourcing Two-Party Privacy Preserving K-Means Clustering ...

引用

International Conference on mobile Ad-hoc and Sensor Networks, MSN

作者： Xiaoyan Liu Zoe L. Jiang S. M. Yiu Xuan Wang Chuting Tan Ye Li Zechao Liu Yabin Jin Junbin Fang Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application HKSAR The University of Hong Kong China Public Service Platform of Mobile Internet Application Security Industry Jinan University

Nowadays wireless sensor network (WSN) is widely used in human-centric applications and environmental monitoring. Different institutes deploy their own WSNs for data collection and processing. It becomes a challenging problem when institutes collaborate to do data mining while intend to keep data privacy on each side. Privacy preserving data mining (PPDM) is used to solve the above problem, which enables multiple parties owning confidential data to run a data mining algorithm on their combined data, without revealing any unnecessary information to each other. However, due to the huge amount of data collected and the complexity of data mining algorithms, it is preferable to outsource most of the computations to the cloud. In this paper, we consider a scenario in which two parties with weak computational power need jointly run a k-means clustering protocol, at the same time outsource most of the computation of the protocol to the cloud. As a result, each party can have the correct result calculated by the data from both parties with most of the computation outsourced to the cloud. As for privacy, the data owned by one party should be kept confidential from both the other party and the cloud.

关键词： Clustering algorithms Encryption Data privacy Protocols Privacy Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A DNA-based cryptosystem with length-fixed sticker model

引用

Journal of Computational and Theoretical Nanoscience 2015年第12期12卷 5421-5424页

作者： Lin, Xuheng Ming, Zhong Guo, Ju Yan, Zhixiang Tan, Rendy Sun, Heng Department of Computer Science Jinan University Guangzhou510632 China Shenzhen Engineering Laboratory for Mobile Internet Application Middleware Technology Shenzhen University Shenzhen518060 China College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China Institute of Urology Nanchang University Nanchang330006 China China National Genebank Shenzhen518083 China

As the computing power of computers is developed faster and faster nowadays, the traditional cryptosystems are challenged. In this paper, the traditional sticker model is modified to design a new cryptosystem. As a novel branch of interdisciplinary science, DNA computing has great superiority in not only encrypting speed but complexity thanks to DNA Watson-Crick complementary nature and its parallel processing capability. The modified sticker model has the advantage of fixed length which makes the substrands easier to be held and manipulated. The new cryptosystem uses Xor and ringshiftleft operations to encrypt the data. The time complexity of the encryption algorithm depends on the time of biological operations. What's more, all substrands, staples and stickers are reusable in the LFSM. Copyright © 2015 American Scientific Publishers All rights reserved.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Towards automatic consistency checking between web application and its mobile application 26

Towards automatic consistency checking between web applicati...

引用

26th International Conference on Software engineering and Knowledge engineering, SEKE 2014

作者： Chen, Xiangping Xu, Zhensheng Institute of Advanced Technology Sun Yat-sen University National Engineering Research Center of Digital Life Guangzhou China Shenzhen Engineering Laboratory for Mobile Internet Application Middleware Technology Shenzhen China Research Institute Sun Yat-sen University in Shenzhen Shenzhen China School of Information Science and Technology Sun Yat-sen University National Engineering Research Center of Digital Life Guangzhou China

With the increasing usage of mobile devices in daily life, a lot of websites delivered another mobile application version of application with the same services. If the mobile application is inconsistent with the web application, it may imply possible error or misleading information in the mobile application. This paper proposes an approach for automatic consistency checking between mobile application and its web application. Our approach starts from the generation of page and link information by crawling content from web application and simulating user actions in Android application. Page matching and consistency checking algorithms are proposed and used to find out inconsistency in page, element and link. The validation tool is used in 3 mobile application containing more than 300 pages. The result shows that our approach can find out inconsistency with acceptable precision and recall. Copyright © 2014 by Knowledge Systems Institute Graduate School.

关键词： Black-Box Consistency checking mobile application

来源：评论

学校读者我要写书评

暂无评论

Using Kuliback-Leibler divergence to model opponents in poker 28

Using Kuliback-Leibler divergence to model opponents in poke...

引用

28th AAAI Conference on Artificial Intelligence, AAAI 2014

作者： Zhang, Jiajia Wang, Xuan Yao, Lin Li, Jingpeng Shen, Xuedong Intelligence Computing Research Center Harbin Institute of Technology Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application China Intelligence Computing Research Center Harbin Institute of Technology Public Service Platform of Mobile Internet Application Security Industry China School of Electronics Engineering and Computer Science Peking University China C302 HIT Campus Shenzhen University Town NanShan District XiLi Shenzhen518055 China IER Building Soutn Area Shenzhen High-Tech Industrial Park Shenzhen518055 China

ISBN: (纸本)9781577356653

Opponent modeling is an essential approach for building competitive computer agents in imperfect information games. This paper presents a novel approach to develop opp onent modeling techniques. The approach applies neural networks which are separately trained on different datasct to build K- model clustering opponent models. KullbackL eibler (KL) divergence is used to exploit a safety mode on opponent modeling. Given a parameter d that controls the max divergence between a model's centre point and the units belong to it, the approach is proved to provide a lower bound of expected payoff which is above the minimax payo ff for correctly clustered players. Even for the players that are incorrectly clustered, the lower bound can also be unlimi ted approximated with sufficient history data, In our experi ments, agent with the novel model shows an improved class ification efficiency of opponent modeling comparing with relative researches. And also, the new agent performs better when playing against poker agent HITSZ-CS-13 which participate Annual Computer Poker Competition of 2013. © Copyright 2014. Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Computer games

来源：评论

学校读者我要写书评

暂无评论

SLA aware cost efficient virtual machines placement in cloud computing

SLA aware cost efficient virtual machines placement in cloud...

引用

IEEE International Conference on Performance, Computing and Communications (IPCCC)

作者： Jiangtao Zhang Zhixiang He Hejiao Huang Xuan Wang Chonglin Gu Lingmin Zhang School of Computer Science and Technology Harbin Institute of Technology Shenzhen Graduate School Shenzhen China Public Service Platform of Mobile Internet Application Security Industry Shenzhen China Shenzhen Key Laboratory of Internet of Information Collaboration Shenzhen China Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application Shenzhen China

ISBN: (纸本)9781479975761

Servers and network contribute about 60% to the total cost of data center in cloud computing. How to efficiently place virtual machines so that the cost can be saved as much as possible, while guaranteeing the quality of service plays a critical role in enhancing the competitiveness of service cloud provider. Considering the heterogeneous servers and the random property of multiple resources requirements of virtual machines, the problem is formulated as a multi-objective nonlinear programming in this paper. Virtual machine cluster with higher traffic is made staying together. This reduces the communication delay while saving the inter-server bandwidth consumption, especially the relatively scarce higher level bandwidth, by exploiting the topology information of data center. At the same time, statistic multiplex and newly defined “similarity” techniques are leveraged to consolidate virtual machines. The violation of resource capacity is kept at any designated minimal probability. Thus the quality of service will not be deteriorated while saving servers and network cost. An offline and an online algorithms are proposed to address this problem. Experiments compared with several baseline algorithms show the validity of the new algorithms: more cost is cut down at less computation effort.

关键词： Bandwidth Servers Cloud computing Topology Multiplexing Correlation Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

A New Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products

A New Predicate Encryption Supporting Disjunctions, Polynomi...

引用

中国密码学会2014年密码算法学术会议

作者： Zhi-hui Liu Zoe L. Jiang Xuan Wang S.M. Yiu Shenzhen Graduate School Harbin Institute of Technology Shenzhen 518055 China Public Service Platform of Mobile Internet Application Security Industry Shenzhen 518055 Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application Shenzhen 518055 The University of Hong Kong Hong Kong SAR China

Predicate encryption allows flexible fine-grained control over access to encrypted data and achieves attribute *** [1] supporting inner product is the most expressive predicate encryption scheme currently with large amount of pre-process and huge expenses of *** our scheme,we propose a new predicate encryption which prepares the ciphertext C for each attribute values one by one,and later transforms to the ciphertexts C’ corresponding to different *** can greatly reduce the pre-processing time and the storage from O(2n ) to O(n ) compared to KSW [1],where n is the total number of attribute values in one record of a table (In the enterprise development database,n is dozens or even hundreds).The security of our scheme is against chosen-plaintext attacks in the standard model.

关键词： Predicate encryption Inner product Encrypted database CPA secure

来源：评论

学校读者我要写书评

暂无评论

An Example-Driven Approach for Automatic Extension of Monitoring Model

An Example-Driven Approach for Automatic Extension of Monito...

引用

International Conference on Digital Home (ICDH)

作者： Yuqin He Xiangping Chen School of Information Science and Technology Sun Vat-sen University National Engineering Research Center of Digital Life Corporation Limited Guangzhou China Shenzhen Engineering Laboratory for Mobile Internet Application Middleware Technology Shenzhen China Institute of Advanced Technology Sun Yat-sen University Guangzhou China

ISBN: (纸本)9781479942831

Digital home refers to the use of computer and information technology to control home appliances and features. Management applications of home devices are building based on runtime information of the devices. The runtime model can be built using data from monitoring tools and analysis tools for specific platform. In order to construct runtime model from data provided from both monitoring tools and analysis tools, we propose an example-driven approach for automatic extension of monitoring model. Because analysis results conform to the same meta-model, the meta-model can be inferred from enough examples. Our approach first generates a meta-model of analysis result examples, and then generates the model transformation for synthesis of existing model and analysis results. A validation algorithm is proposed for automatically updating of meta-model based on analysis result.

关键词： Monitoring Runtime Analytical models Data models Servers Computational modeling Androids

来源：评论

学校读者我要写书评

暂无评论

Using risk dominance strategy in poker

引用

Journal of Information Hiding and Multimedia Signal Processing 2014年第3期5卷 555-566页

作者： Zhang, Jia Jia Wang, Xuan Yao, Lin Li, Jing Peng Shen, X.D. Department of ShenZhen Graduate School Harbin Institute of Technology Shenzhen Applied Technology Engineering Laboratory for Internet Multimedia Application HIT Part of XiLi University Town NanShan 518055 ShenZhen GuangDong China Department of ShenZhen Graduate School Harbin Institute of Technology Public Service Platform of Mobile Internet Application Security Industry HIT Part of XiLi University Town NanShan 518055 ShenZhen GuangDong China Department of ShenZhen Graduate School Harbin Institute of Technology HIT Part of XiLi University Town NanShan 518055 ShenZhen GuangDong China

Risk dominance strategy is a complementary part of game theory decision strategy besides payoff dominance. It is widely used in decision of economic behavior and other game conditions with risk characters. In research of imperfect information games, the rationality of risk dominance strategy has been proved while it is also wildly adopted by human players. In this paper, a decision model guided by risk dominance is introduced. The novel model provides poker agents of rational strategies which is relative but not equals simply decision of "bluffing or no". Neural networks and specified probability tables are applied to improve its performance. In our experiments, agent with the novel model shows an improved performance when playing against our former version of poker agent named HITSZ_CS_13 which participated Annual Computer Poker Competition of 2013. The macroscopical results and analysis of details all cofirms the effectiveness of works provided in this paper. © 2014.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：