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

New friend recommendation with user interest and socialization

Journal of Information and Computational Science 2015年第11期12卷 4253-4262页

作者： Huang, Guoyan Chang, Yixin Li, Yakun College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Friend recommendation is popular in social site to help people make new friends and expand their social networks. However, the conventional friend recommendation method is low accuracy for the sparsity of data and cold start. To solve this problem, we propose a new personalized recommendation method with user interest and socialization. This approach incorporating user interest and social information mainly leverages both user-based collaborative filtering method and user topological structure in social networks. Firstly, user interest degree can be obtained to identify the user preferences. Secondly, get the new optimized similarity degree and the target user's nearest neighbor by using social collaborative filtering algorithm. In the end, the final recommendation set of user can be acquired from the highest predicted rating of the candidate collection. The experiments indicate that this proposed method can enhance the Effectiveness and accuracy of recommendation compared with the traditional friend recommendation algorithm. ©, 2015, Binary Information Press. All right reserved.

关键词： Collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

A novel approach to efficiently mine structural patterns from software execution sequence

引用

Journal of Computational Information systems 2015年第3期11卷 1109-1119页

作者： Huang, Guoyan Zhang, Bing Ren, Rong Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Analyzing structure of a software system is not sufficient for understanding its functionality. Certain characteristics of software are often hidden in its structure and can only be discovered when the various execution sequence of the software are identified. Analysis of execution sequence, therefore, becomes an indispensable aid in software comprehension. In this paper, a novel approach to efficiently mine structural patterns from software execution sequence is proposed. First, software execution traces are modeled as sequential patterns. Due to loops, patterns can occur multiple times within a trace, which leads to high cost of time and super complexity of the research. Then, an algorithm is designed to eliminate repetitive patterns (ERP) in software and software sequential pattern mining (SSPM) algorithm is presented to divide software unique sequential patterns into different patterns in order to mine structural characteristics of the software. At last, by the comparative analysis of similarity between different pattern collections, it draws the conclusion that software system can be compartmentalized into n fixed patterns. Experimental results also prove the conclusion well. ©, 2015, Binary Information Press. All right reserved.

关键词： computer software

来源：评论

学校读者我要写书评

暂无评论

Non-human-like characters' facial animation driven by one or two actors

引用

Journal of Information and Computational Science 2015年第10期12卷 3937-3944页

作者： Tang, Yong Liu, Yuhan Guo, Dan Liang, Haiyan Luo, Yanqing Lv, Mengya College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

We present a novel system that can transfer facial expressions from an actor to a non-human-like character. Compared with a lot of previous studies, our system requires no special light conditions or facial markers for actors' performance. More significantly, our work can find vertex correspondences between the human face and characters with dissimilar facial structures by creating local-coordinate systems on the character. Experiments show that in our system not only one actor's performance is accurately transferred to non-human-like characters but also two actors' expressions can be simultaneously retargeted to one non-human-like character. Through our approach, virtual characters can have much more vivid expressions. 1548-7741/Copyright © 2015 Binary Information Press

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of action-driven 3D subtle facial expressions

引用

Journal of Computational Information systems 2014年第5期10卷 2137-2144页

作者： Tang, Yong Liang, Haiyan Guo, Dan Lv, Mengya Zhao, Jing College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

While the large-scale deformations such as the Laplacian deformation method could not synthesize new expressional details, this paper proposes a method for simulating different subtle facial expressions based on the Kinect acquisition system and the facial expressional reconstruction technique. Firstly, we generate the coarse skin textures with pore details and those normal maps. Secondly, we use blending wrinkle maps to render animated details on a human face based on a GPU shader program. Finnaly, according to the action units captured by the Kinect, we calculate the dynamic texture mapping and the weight of wrinkles, and apply the wrinkles function to simulate the motion of wrinkles. Experimental results show that our method can generate facial details in real time. The method suits the fields such as digital entertainment and video conferences. © 2014 Binary Information Press.

关键词： Blending

来源：评论

学校读者我要写书评

暂无评论

IMSPMIS-Stream: incremental mining of top-k short sequential pattern over multiple item set streams

引用

Journal of Computational Information systems 2014年第6期10卷 2305-2312页

作者： Hao, Xiaobing Han, Gaowei Chen, Yuping Wang, Peilong Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

Many previous algorithms in data streams are about single stream, which can only process single items. The algorithms about data streams are always extended by sequential pattern algorithms about static database, they can't satisfy the requirement of scanning streams only once and online mining. Moreover, top-k short sequential pattern hasn't been studied yet. Therefore, IMSPMIS-Stream algorithm is proposed to mine online multiple streams with the single scan by the incremental method in this paper. The streams are continuous transactions, which is also called item set streams. Several streams are mined interactively based on sliding windows at the same time. An approach to count the support of every sub item set is designed to get the support during one scan. The short sequential pattern is deffned, whose item sets are shorter than all the item sets with the same occurring time. When the arrival transactions reach to the capacity of the window, sequential patterns will be output by combining top-k short item sets. The experiments show that the IMSPMIS-Stream algorithm overcomes the memory limitation and its execution time is reduced compared with some previous algorithms under the same conditions. Copyright © 2014 Binary Information Press.

关键词： Information systems

来源：评论

学校读者我要写书评

暂无评论

Mining time-interval weighted closed sequential patterns based on memory indexing

引用

Journal of Computational Information systems 2014年第1期10卷 293-300页

作者： Zeng, Qiang Chen, Dengxi Ren, Jiadong Han, Gaowei College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

General weighted sequential pattern mining algorithms ignore or do not make good use of the time and time-interval information of data elements. Besides some algorithms require to scan the database many times or build temporary databases. To solve these problems, we propose a memory-based algorithm MITWCSpan (Memory Indexing for time-interval Weighted Closed Sequential pattern mining) for timeinterval weighted closed sequential pattern mining. The algorithm takes full account of the importance of the time-interval of data elements. Moreover, an improved index set based on time-interval, p-tidx, is defined. During mining process, the algorithm adopts the find-then-index technique recursively to find the items which can constitute a time-interval weighted sequential pattern and construct p-tidx for the possible sequential pattern. Finally the algorithm uses closing detection to get the whole time-interva l weighted closed sequential patterns. The experimental results show that the algorithm is more efficient in finding more important sequential patterns. Copyright © 2014 Binary Information Press.

关键词： Indexing (of information)

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of an enhanced Ethernet energy saving mechanism in IEEE 802.3az

引用

Journal of Information and Computational Science 2014年第5期11卷 1605-1613页

作者： Zhi, Shengyang Jin, Shunfu Meng, Chao College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

In order to reduce the energy consumption and improve the response performance, by introducing the strategies of sleep-delay, pre-awake and split timing to IEEE 802.3az, an enhanced Ethernet energy saving mechanism is proposed. Considering the digital nature of modern communications, a discrete-time queueing model with multiple-vacation and N-strategy is built. With the method of an embedded Markov chain, we evaluate the energy saving efficiency of the system and the response performance of the data frames mathematically. Numerical experiments and simulation results show that, in the enhanced Ethernet energy saving mechanism, the average packet latency is reduced, while the energy saving ratio is satisfactory. © 2014 by Binary Information Press.

关键词： Energy conservation

来源：评论

学校读者我要写书评

暂无评论

An energy-efficient routing algorithm of zigbee network

引用

Journal of Computational Information systems 2012年第23期8卷 9873-9879页

作者： Liu, Yongshan Chen, Wei Shang, Xuehui Lv, Yongteng Han, Yuanyuan Liu, Chang College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

As regard to the case of extending the lifetime of zigbee network, the defination of node's boundary is proposed. First, all the information for node's boundary is stored when zigbee network is built. Then, the packet between the nodes which are in the node's boundary is transferred directly. The packet between the nodes whose boundaries are adjacent is transferred through the node with maximum energy. The exprimental results show that the new algorithm can efficiently extend the lifetime of zigbee network. ©2012 by Binary Information Press.

关键词： Zigbee

来源：评论

学校读者我要写书评

暂无评论

Density-based clustering for evolving uncertain data stream

引用

Journal of Computational Information systems 2014年第1期10卷 419-426页

作者： He, Haitao Zhao, Jintian The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China

The current clustering algorithms for evolving uncertain data stream are sensitive to user specified threshold, and unstable in noise processing. In this paper, DUStream is presented, a density-based algorithm for discovering clusters in evolving uncertain data stream. Probability distance is introduced as a new similarity measure, giving consideration to probability attribute and distance attribute. Probability Radius is used as a self-adaption dynamic threshold to reduce the effect of user specified input. The experimental results demonstrate the effectiveness and Effciency of the algorithm on Artificial and real data sets. Copyright © 2014 Binary Information Press.

关键词： Probability

来源：评论

学校读者我要写书评

暂无评论

WCSPMPD-stream: Mining weighted closed sequential patterns with pattern decay over data streams

引用

Journal of Computational Information systems 2014年第1期10卷 435-442页

作者： Zeng, Qiang Han, Gaowei Li, Weina Ren, Jiadong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao 066004 China

Many of the previous incremental methods in data streams are deleting the old patterns and adding to the new patterns directly, which may delete useful patterns too early. Both different real data and the data occurring time can lead to the diverse importance, which are not considered at the same time in previous studies. Therefore, WCSPMPD-Stream, a weighted closed sequential pattern algorithm with pattern decay based on sliding windows over data streams is proposed in this paper. Firstly, the sliding windows are separated into several fragments to be mined respectively. Secondly, Time Weight Decay and No Updating Decay methods are designed to control the decay rate. Thirdly, a method of calculating the time weight is defined which varies linearly with the length of time interval between each stream fragment and the current stream fragment. Fourthly, an approach of getting the item weight is defined to calculate any sequence weight by the items in it. Fifthly, a new data structure WFPS-Tree is advanced to store and update the mining results. The experiments show that WCSPMPD-Stream algorithm overcomes the memory limitation and mines patterns with higher interest. And its execution time is reduced compared with the previous algorithms under the same conditions. Copyright © 2014 Binary Information Press.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：