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

2013 International Conference on Vehicle and Mechanical Engineering and Information Technology, VMEIT 2013

作者： Peng, Xian Wu Liu, Jian Xun Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan 411201 China

ISBN: (纸本)9783037858202

Spiking neural P systems are a new class of bio-inspired computing devices incorporating the ideas of spiking neural networks into P systems. Homogeneous spiking neural P systems are a variant of spiking neural P systems, where each neuron has the same set of rules. The universality of homogeneous spiking neural P systems without delays is investigated and proved. This paper provides an answer to an open problem formulated by Zeng Xiangxiang, etal. © (2013) Trans Tech Publications, Switzerland.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Clustering-based collaborative filtering approach for mashups recommendation over big data

Clustering-based collaborative filtering approach for mashup...

引用

2013 16th IEEE International Conference on Computational Science and Engineering, CSE 2013

作者： Hu, Rong Dou, Wanchun Liu, Jianxun State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Sci and Tec Xiangtan Hunan China

ISBN: (纸本)9781479948970

Spurred by services computing and Web 2.0, more and more mashups are emerging on the Internet. The overwhelming mashups become too large to be effectively recommended by traditional methods. In view of this challenge, we propose a clustering-based collaborative filtering approach for mashup recommendation over big data. This approach mainly divided into two phases: clustering and collaborative filtering. By using clustering techniques, the data size is reduced so that the computation time of collaborative filtering algorithm is decreased significantly. Several experiments are done to verify the efficient of the proposed approach at the end of this paper. © 2013 IEEE.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Collaborative Filtering Approach for Multi-functional Service Recommendation

A Hybrid Collaborative Filtering Approach for Multi-function...

引用

International Conference on Cloud and Green Computing

作者： Rong Hu Wanchun Dou Jianxun Liu State Key Laboratory for Novel Software Technology Nanjing University Key Laboratory of Knowledge Processing & Networked Manufacturing Hunan University of Sci & Tec

ISBN: (纸本)9781479913626

As the increasing numbers of various multi-functional Cloud services are rapidly evolving in the Cloud market, how to recommend ideal multi-functional services becomes a great challenge. Due to its simplicity and promising results, collaborative filtering has been one of the most dominant methods used in recommender systems. The fundamental assumption of collaborative filtering is that users rated items similarly will rate other items similarly. However, with regards to a multi-functional service, a user may only use one of the functions and give a post-rating. Such a rating emotionally expresses the user's preference on the function rather than on the whole service. Therefore, it is appropriate to measure similarity at the granularity of functions' ratings. In our proposed approach, each user's rating is assigned to a function according to the usage record. Then, a hybrid user-based and item-based collaborative filtering algorithm is used to recommend multi-functional services. Such approach is experimentally verified at the end of this paper.

关键词： Hybrid collaborative filtering Multi-functional service Recommendation User-based Item-based

来源：评论

学校读者我要写书评

暂无评论

Distributed data integration in content-centric networks

引用

Journal of Networks 2013年第9期8卷 1950-1959页

作者： Liao, Zhuhua Yi, Aiping Zhang, Guoqing Key Laboratory of Knowledge Processing and Networked Manufacturing College of Hunan Province 411201 China School of Foreign Language Hunan University of Science and Technology 411201 China Institute of Computing Technology of Chinese Academy of Sciences Beijing 100190 China

The integration of fragmented data seriously impedes the distributed data exploitation in content-centric networks. It requires dealing with the dynamics, semantics and efficiency problems in the data integration. In this paper, a novel scheme is proposed to integrate the fragmented named data into semantic data sequences which can quickly response to users in the content-centric network. In order to perform semantic and efficient integration of fragmented data in the network, diverse integration strategies of fragmented data driven by query are presented at first. And then the data integration algorithms building on the contentcentric network are introduced based on semantic guider nodes. Finally, the experiments demonstrated that the proposed scheme can efficiently integrate the fragmented data distributed in the content-centric network and efficiently response to users. © 2013 ACADEMY PUBLISHER.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

Performing balanced ternary logic and arithmetic operations with spiking neural P systems with anti-spikes

Performing balanced ternary logic and arithmetic operations ...

引用

2012 International Conference on manufacturing Engineering and Process, ICMEP 2012

作者： Peng, Xian Wu Fan, Xiao Ping Liu, Jian Xun College of Information Science and Engineering Central South University Changsha Hunan China Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan Hunan China

ISBN: (纸本)9783037854051

Spiking neural P systems are a class of distributed and parallel computing models inspired by P systems and spiking neural networks. Spiking neural P system with anti-spikes can encode the balanced ternary three digits in a natural way using three states called anti-spikes, no-input and spikes. In this paper we use this variant of SN P system to simulate universal balanced ternary logic gates including AND, OR and NOT gate and to perform some basic balanced ternary arithmetic operations like addition and subtraction on balanced ternary integers. This paper provides an applicational answer to an open problem formulated by L. Pan and Gh. PǍun. © (2012) Trans Tech Publications.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

A trustworthiness fusion model for service cloud platform based on D-S evidence theory 11

A trustworthiness fusion model for service cloud platform ba...

引用

Proceedings of the 2011 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing

作者： Hu, Rong Liu, Jianxun Liu, Xiaoqing Frank Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan Hunan China Department of Computer Science Missouri University of Science and Technology Rolla United States

ISBN: (纸本)9780769543956

Trustworthiness plays an important role in service selection and usage. However, it is not easy to define and compute the service trustworthiness because of its subject meaning and also the different views on it. In this paper, we describe the meaning of trustworthiness and the computation method for trustworthiness fusion. Through extracting trustworthiness from service provider, service requestor and service broker, we creatively adopted D-S (Dempster-Shafer) evident theory to fuse the tripartite trustworthiness. Finally, we completed some comparison experiments on our web service supermarket platform and certified the efficiency of our method. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

WSRank: A method for web service ranking in cloud environment

WSRank: A method for web service ranking in cloud environmen...

引用

9th IEEE Int. Conf. on Dependable, Autonomic and Secure Comput., DASC 2011, incl. 9th Int. Conf. on Pervasive Intelligence and Computing, PICom 2011, 9th Int. Symp. on Embedded Computing, EmbeddedCom 2011, 1st Int. Conf. on Cloud and Green Comput.CGC

作者： Hu, Rong Dou, Wanchun Liu, Xiaoqing Frank Liu, Jianxun State Key Laboratory for Novel Software Technology Nanjing University Nanjing Jiangsu China Department of Computer Science Missouri University of Science and Technology Rolla MO United States Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan Hunan China

ISBN: (纸本)9780769546124

For services that have similar functionalities, if they are published by different cloud platforms, it is a challenge to evaluate them, for satisfying different end users' personal preferences. In view of this challenge, a method for web service ranking, named WSRank, is investigated in cloud environment in this paper. It aims at ranking different Web services published by different cloud platforms, taking advantage of Page Rank principle. At last, a case study and experiment are presented to demonstrate the feasibility of the method. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Personalized searching for web service using user interests

Personalized searching for web service using user interests

引用

作者： Hu, Rong Dou, Wanchun Liu, Xiaoqing Frank Liu, Jianxun State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Department of Computer Science Missouri University of Science and Technology Rolla MO United States Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan Hunan China

ISBN: (纸本)9780769546124

Users usually have different prospective even they input a same keyword to search Web services. It is a challenge to personalize web service search engine as more and more keyword-like Web services becoming available on Internet. User interest plays an important role in personalizing search result. Therefore, through interest extraction, Web service search engine is personalized. At last, an experiment is presented to demonstrate the feasibility of the method. © 2011 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A modified mountain clustering algorithm based on hill valley function

引用

Journal of Networks 2011年第6期6卷 916-922页

作者： Wang, Junnian Liu, Dunshun Liu, Chao Hunan Universities Key Laboratory of Knowledge Processing and Networked Manufacturing Hunan University of Science and Technology Xiangtan 411201 China School of Information and Electrical Engineering Hunan University of Science and Technology Xiangtan 411201 China

A modified mountain clustering algorithm based on the hill valley function is proposed. Firstly, the mountain function is constructed on the data space, with estimating the parameter by a correlation self-comparison method, and database's mountain function values are computed. Secondly, the hill valley function is introduced to partition the data distributed on each peak. If the hill valley function' value of two datum equal to 0, it means these two datum are on the same mountain and belong to the same cluster, otherwise they are not. Finally, the data in a cluster with maximum mountain function value is selected as the cluster centre of this cluster. The testing of four databases indicate that the proposed clustering algorithm can categorise the data numbers in each cluster and find all the cluster centres exactly, and no need priori parameters and stopping criterion correlating to the database. © 2011 ACADEMY PUBLISHER.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Constructing method for Web services implicit relationship graph

引用

Jisuanji Jicheng Zhizao Xitong/Computer Integrated manufacturing Systems, CIMS 2011年第8期17卷 1670-1676页

作者： Qin, Shi-Gang Liu, Jian-Xun Qin, Zu-Ze Department of Automobile Engineering Hunan Electrical College of Technology Xiangtan 411101 China Key Laboratory of Knowledge Processing and Networked Manufacturing College of Hunan Province Hunan University of Science and Technology Xiangtan 411201 China

To solve the adaptive invoking problem of Web service implicit relationship, a constructing method for Web services implicit relationship graph from the perspectives of the invoking logics was proposed. In this method, Web service was simplified as a tri-tuple. The triple relationships corresponding to a set of Web services were decomposed into two types of binary relationships: output patterns set and input pattern set. Services links were the edges of Web services implicit relationship graph and was the result from the linking operation of output patterns set and input pattern set. Algorithms of constructing the pattern set and Web services implicit relationship graph were put forward. The effectiveness of the proposed method was verified by experiment.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：