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

Analysis on impact of node failure in software execution network

Journal of Computational Information systems 2015年第6期11卷 2217-2225页

作者： He, Haitao Ren, Rong Zhang, Bing 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

One or few failure nodes will cause cascading failure in software network, which would bring about security issues. Thus, analyzing nodes becomes an indispensable aid in software security. In this paper, software execution process is abstracted as weighted complex network. Based on this, a cascading failure diffusion analyzing (CFDA) algorithm is put forward to evaluate the impact of node failure on software during its runtime dynamically. It explores nodes' failure spreading range and the number of infected nodes by malicious attacks on high in-strength nodes and strong failure propagation probability nodes in software execution networks respectively. Meanwhile, the propagation behavior of cascading failures in the software system is studied. The experiment results prove that strong failure propagation ability nodes under attack have greater devastating impact on software than others. Copyright © 2015 Binary Information Press.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Improving neighbourhood quality for CHUCKY: An empirical study

引用

Journal of Computational Information systems 2015年第16期11卷 5967-5977页

作者： Zhao, Fengda Yang, Ke 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

Vulnerability discovery is at the centre of attention in computer security. Most vulnerability detection methods need considerable human auditing, thus making vulnerability detection inefficient and unreliable. Similar neighbourhood-based missing check detection method solves this problem to some degree. However, semantic noises that degrade the quality of the neighbourhood list remain. To reduce these noises, we firstly define a q-gram-based name similarity to measure the correlation of function names or file names. The context similarity of function is then defined to measure the commonness of two functional working environment. Finally, two filters are proposed: one is the naive neighbourhood filter which filters irrelative functions by name similarity;the other is the improved integrate neighbourhood filter, which awards strong correlated functions by recognising remarkable name and context similarity. The filter-based methods are experimentally evaluated in five widely used open-source software and are compared with the original method. Result shows that the improved neighbourhood rank lists are more accurate than the original list. © 2015 by Binary Information Press

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

Road network information based edge bundling

引用

Journal of Information and Computational Science 2015年第13期12卷 4909-4918页

作者： Nie, Junlan Zhang, Jikai Xin, Shuyue Guo, Dongliang 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

To solve edge confusion problems in the geo-related graph visualization, here we present an edge bundling algorithm based on the road network information. First, the improved Dijkstra shortest path algorithm is employed to calculate the related path of original edges, and slicing quadratic Bezier curves are fitted out to replace original edges according to these path information. And then, the curve segments that satisfy conditions are merged together according to the control point consolidation strategy and thickened according to their weights, which simplifies the bundling result and also effectively shows the heat of each path;Finally, for the interested curves in the human-computer interaction, highlighted transition colors are introduced to character their directivity, and the effect is intuitive. The experimental results show that, our algorithm can effectively bundle original edges, which reduces the confusion degree of the graph. Meanwhile, the bundling result is more close to the original path, which improves the readability and understandability of the graph effectively. ©, 2015, Journal of Information and Computational Science. All right reserved.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

Grid resource dynamic replication strategy based on access frequency and time cost

引用

Journal of Computational Information systems 2015年第6期11卷 1973-1982页

作者： Zhang, Zhongping He, Long The School of Information Science and Engineering Yanshan University Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

Data grid provides a large amount of computing resources and storage space to handle data-intensive applications. Because of the limitation of available resources and the production of large-scale workload in grid, the effective use of grid resources has become a major challenge. Data replication can reduce the bandwidth consumption, improve the fault-tolerant ability and enhance the extensibility. A grid resources dynamic replication strategy based on the access frequency and time cost is given in this paper. The proposed strategy deletes the file by considering two important parameters: access frequency and transmission costs. In the replica selection strategy, the best replica is selected by considering the waiting time of the replica request queue in the storage and the data transfer time. The simulated results with OptorSim show that the proposed replication strategy gives better performance compared with DHRA algorithm. Copyright © 2015 Binary Information Press.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

The synthesis of dynamic junction over-constrained parallel-parallel mechanism based on the weighted directed graph theory

引用

ICIC Express Letters 2013年第11期7卷 3057-3065页

作者： Guo, Xijuan Zhang, Dayu Geng, Qingjia Zhang, Wenyuan The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

Several dynamic junction over-constrained parallel-parallel mechanisms are proposed in this paper with a new method based on graph theory synthesis. This kind of mechanism is the pivotal part of the equivalent mechanism in helicopter automatic tilting device. The purpose of synthesis is that the synthesis result is helpful to optimize the structure and optimal design for helicopter automatic tilting device, and the reason why a graph method is chosen is that it can be programmed easily. The characteristic of "Dynamic Junction" is proposed relative to fixed junction. Because the joint of connecting two parallel mechanisms is dynamic, these two mechanisms can motion relatively. A mount of permutation and combination calculating processes are needed because of dynamic characteristic. In this view, choosing a synthesis method which can program easily in computer is appropriate. The graph method is the best choice. However, classic graph method is difficult to discriminate the graph isomorphism and limited to apply in spatial mechanism. Therefore, this paper proposed a new graph way. First, mechanism is modeled in weighted directed graph, then based on equal freedom of degree, many other graph models are got which have the same motion characteristic. Finally many target mechanisms can be derived by those models. The new method avoids the problem of classic graph method and is easy to program and run in computer, it is proved effectively because several dynamic junction over-constrained parallel-parallel mechanisms are successfully synthesized by it. © 2013 ISSN 1881-803X.

关键词： Dynamics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A virtualized data center energy-saving mechanism based on switching operating mode of physical servers and reserving virtual machines

A virtualized data center energy-saving mechanism based on s...

引用

作者： Yin, Chunxia Liu, Jian Jin, Shunfu College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao China Ocean College of Hebei Agricultural University Qinhuangdao China Institute of Computing Technology Chinese Academy of Sciences Beijing China

The energy consumption of virtualized data centers has grown very fast in last several years. Because a large number of hosts are running in an idle state, virtualized data centers waste a large amount of electric energy. To save more energy for virtualized data centers, an energy-saving mechanism is proposed based on switching operating mode of physical servers and reserving virtual machines (VMs). The main idea is that when the amount of idle VMs reaches twice of a specified threshold, half of these idle VMs are reserved to process the new task that is about to arrive, and the physical server which hosts the other half of the idle VMs is switched to the sleep mode. From the perspective of task arrival rate and sleep parameters, we use two-dimensional Markov processes to analyze the proposed energy-saving mechanisms. By using matrix geometry solutions, we theoretically estimate energy consumption and response performance. According to the numerical experiments, the proposed energy-saving mechanism obviously cut down electric energy consumption and ensures response performance. Finally, the specified threshold for the amount of VMs is optimized by building a cost function. © 2020 John Wiley & Sons, Ltd.

关键词： Cost functions

来源：评论

学校读者我要写书评

暂无评论

Mining maximal frequent patterns based on hierarchical bit vector and stack principle

引用

Journal of Computational Information systems 2015年第1期11卷 369-376页

作者： Wang, Qian Ren, Jiadong He, Haitao Huang, Guoyan 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

Maximal frequent pattern mining usually adopts a global pattern growth way, and a maximal frequent pattern can be obtained unless most of its subsets are checked to be frequent. An algorithm for mining maximal frequent patterns based on hierarchical bit vector and stack principle, called MaxPat HB, is proposed in this paper. Different with the traditional thinking of "test after connection", MaxPat HB adopts an individual pattern growth way and uses another thought of "testing while growing" which can efficiently gain the specified maximal frequent pattern and decrease the scale of candidate generation. The original data is converted to hierarchical bit vectors and maximal frequent patterns are mined hierarchically according to item unit. Candidate itemset generation adopts the stack principle, the push and pop operation is imitated by transforming bit values in a vector. Logic calculations between bit vectors are faster than the matches between strings, and the hierarchical structure can extremely reduce the searching space. Experiment result shows its high efficiency and good scalability. ©, 2014, Journal of Computational Information systems. All right reserved.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：