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

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

来源：评论

学校读者我要写书评

暂无评论

Integrated management for network virtualization infrastructure

引用

Journal of the National Institute of information and Communications Technology 2015年第2期62卷 33-43页

作者： Yamada, Kazuhisa Nakao, Akihiro Kanada, Yasusi Saida, Yoshinori Amemiya, Koichiro Future Networking Research Group Media Innovation Laboratory NTT Network Innovation Laboratories Network Japan Interfaculty Initiative in Information Studies Graduate School of Interdisciplinary Information Studies University of Tokyo Network Computer Science Japan Network Research Department Center for Technology Innovation - Information and Telecommunications Network Computer Vision Japan System Integration and Services Technologies Management Division Technological Strategy Planning Department NEC Network Japan Software Laboratory Fujitsu Labratories Ltd. Cloud Computing Network Japan

This paper introduces research and development results of extended functions on our network virtualization infrastructure which achieve advanced network virtualization. Our results achieved to meet five requirements which are resource abstraction, resource isolation, resource elasticity, deep programmability and authentication. In addition, we proposed evolvable architecture and extended network virtualization for edge network and terminals. We also deployed our system on JGN-X testbed.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

VLSI multilayer obstacle-avoiding Steiner minimal tree construction algorithms in X-architecture

引用

Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of computer-Aided Design and computer Graphics 2015年第3期27卷 523-532页

作者： Liu, Genggeng Guo, Wenzhong Chen, Guolong College of Mathematics and Computer Sciences Fuzhou University Fuzhou350116 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350116 China

Steiner minimal tree is a fundamental model in VLSI routing. Further considering X-architecture, the presence of obstacles, and the requirements of multilayer routing, this paper presented an efficient algorithm based on particle swarm optimization for constructing the multilayer obstacle-avoiding X-architecture Steiner minimal tree. Edge transformation was designed to make the particles have the greater ability to change the topology of the routing tree and avoided the obstacles. The new operators combined with union-find set were designed to prevent the generation of the loops. In order to avoid obstacle and discourage the generation of vias, the penalty function related to obstacle-avoiding and vias was proposed. The proposed algorithm finally optimizes the total cost of routing tree which is the most important optimization target of the multilayer routing. The experimental results show that, the proposed algorithm is effective and superior to state-of-the-art multilayer routing algorithms on the total cost. ©, 2015, Institute of Computing Technology. All right reserved.

关键词： Multilayers

来源：评论

学校读者我要写书评

暂无评论

PBNA: An Improved Probabilistic Biological network Alignment Method

引用

Tsinghua Science and Technology 2014年第6期19卷 658-667页

作者： Muwei Zhao Wei Zhong Jieyue He School of Computer Science and Engineering and also with MOE Key Laboratory of Computer Network and Information IntegrationSoutheast University Division of Math and Computer Science University of South Carolina Upstate Spartanburg SC 29303USA

Biological network alignment is an important research topic in the field of bioinformatics. Nowadays almost every existing alignment method is designed to solve the deterministic biological network alignment ***, it is worth noting that interactions in biological networks, like many other processes in the biological realm,are probabilistic events. Therefore, more accurate and better results can be obtained if biological networks are characterized by probabilistic graphs. This probabilistic information, however, increases difficulties in analyzing networks and only few methods can handle the probabilistic information. Therefore, in this paper, an improved Probabilistic Biological network Alignment（PBNA） is proposed. Based on Iso Rank, PBNA is able to use the probabilistic information. Furthermore, PBNA takes advantages of Contributor and Probability Generating Function（PGF） to improve the accuracy of node similarity value and reduce the computational complexity of random variables in similarity matrix. Experimental results on dataset of the Protein-Protein Interaction（PPI） networks provided by Todor demonstrate that PBNA can produce some alignment results that ignored by the deterministic methods, and produce more biologically meaningful alignment results than Iso Rank does in most of the cases based on the Gene Ontology Consistency（GOC） measure. Compared with Prob method, which is designed exactly to solve the probabilistic alignment problem, PBNA can obtain more biologically meaningful mappings in less time.

关键词： probabilistic biological network network alignment protein interaction network

来源：评论

学校读者我要写书评

暂无评论

Grover algorithm for multi-objective searching with iteration auto-controlling

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8794卷 357-364页

作者： Zhu, Wanning Chen, Hanwu Liu, Zhihao Xue, Xilin Department of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing211189 China

This paper presents an improved Grover searching algorithm [1] which can auto-control the iterative processing when the number of target states is unknown. The final amplitude of the target states will be decreased if this number is unknown. So the question is how to perform Grover searching algorithm without the number of target states? As for this question, there are two conventional solutions. One solution tries to find the number of target states before performing the original algorithm. The other solution guesses a random k as the number of target states before performing the original algorithm. Both the two solutions need O(√N) additional times Oracle calls than original algorithm and the answer of the first solution is non-deterministic while the second solution needs to check the correctness of the result. Assuming an operator which can judge the sign of the phases of superposition state, based on this technical, this paper shows a novel solution, which can perform Grover searching algorithm even if the number of target states is unknown. This solution only needs adding one gate, which can judge the sign of phase, and one more time Oracle call than the original algorithm. © 2014 Springer International Publishing Switzerland.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：