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

In-rank: An entropy-based informative nodes mining method in complex software network

ICIC Express Letters 2016年第7期10卷 1683-1689页

作者： Ren, Jiadong Li, Yanling Wu, Hongfei Liu, Yang Zhang, Peng College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China

It is a fundamental issue to find a small subset of influential individuals in a complex network such that they can spread information to the largest scope of nodes in the network. Informative functions in complex software network can lead maximum information propagation scope, and mining such function nodes is important to understand the system’s topology structure and information transfer flows. In this paper, a novel topk informative nodes mining approach based on global information in directed-weighted complex software network is proposed. Firstly, we map functions and call relationships between them as a Directed-Weighted Function Call Network (DWFCN). Secondly, an algorithm path-compute based on Software Executing Path Sequence (SEPS) generated by Depth-First-Search strategy is used to compute the software executing paths and get nodes’ information Accessible Set (AS). Thirdly, algorithm Entropy-Compute is proposed to calculate each source node’s information entropy in each information transfer flow process. Finally, an Informative Node Rank (IN-Rank) algorithm is put forward to mine most informative nodes. Experimental results show that our new method is accurate and effective. © 2016, ICIC Express Letters Office. All rights reserved.

关键词： Mining

来源：评论

学校读者我要写书评

暂无评论

Research on load balancing strategy based on middleware

引用

ICIC Express Letters 2014年第9期8卷 2655-2661页

作者： Gu, Xiaoying Liu, Yongshan Man, Yubao Department of Information Science and Engineering Qinhuangdao 066004 China The Key Lab. for Computer Virtual Tech. and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave Qinhuangdao 066004 China Data Industry Research Lab Qinhuangdao 066004 China

According to the former research achievements about load balancing strategy, considering the load distribution, the load condition of service node and the number of user connections, we propose a load balancing strategy based on middleware. According to the cluster service load and the number of user connections, the requests from user will be reasonably allocated to each service node by using middleware technology, then service node and requested user establish a temporary connection, after all the requests of this user are processed by this node. Experiments show that, this strategy reduces the number of requests for allocation, improves the resource utilization rate of cluster system and load balancing degree, and effectively suppresses the load jitter of system. © 2014 ISSN 1881-803X.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

BAT: Mining Binary-API Topic for Multi-service Application Development

BAT: Mining Binary-API Topic for Multi-service Application D...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Pengfei He Linlin Liu Dianlong You Limin Shen Zhen Chen School of Information Science and Engineering Yanshan University Qinhuangdao China National Science Libraries Chinese Academy of Sciences Beijing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China

With the growing popularity of API-driven multiservice application (mashup) development, the burgeoning web APIs have left developers drowning in the sea of web API selections. Matching developers with the most appropriate APIs is the key to improving user satisfaction and promoting more popular web applications. As a result, more and more researchers pay attention to web API recommender systems based on collaborative filtering. However, employing collaborative filtering to recommend APIs is challenging due to the severe sparsity of mashup and API interactions. To address this problem, we propose a probabilistic generative model, called the Binary-API Topic model (BAT), to parameterize mashups and APIs. Technically, BAT is equipped with a mechanism to extract binary-APIs and predict unknown pairwise interactions. To improve generality and capture more relevance from a limited number of interactions, we learn binary-API topics by directly modeling the generation of API co-occurrence patterns across the repository (all mashup collections from ***). The main advantage of BAT is that it preserves API co-occurrence patterns in model learning and exploits the rich global relevance. Finally, through extensive experiments, we demonstrate that BAT can achieve the highest performance on the sparse real-world data set.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An efficient collision detection algorithm of convex polygons based on Minkowski sum

引用

ICIC Express Letters 2013年第2期7卷 461-464页

作者： Geng, Qingjia Guo, Xijuan Zhang, Jianfei Zhang, Buying The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Computer Hebei Normal University of Science and Technology No. 360 West Hebei St. Qinhuangdao 066004 China

Collision detection is a hot research topic in the field of path planning of mobile robot, virtual assembly simulation, and so on. Fast and accurate collision detection has become one of the most key technologies of restricting their development. The study method based on Minkowski sum is an effective method for accurate collision detection through accurate numerical calculations. This paper presents a new efficient collision detection algorithm of convex polygons based on Minkowski sum, which uses the minimum separation distance to detect whether two convex polygons collide or not. The algorithm's performance is also analyzed and verified by experiment in the paper. Compared with the traditional collision detection algorithms based on the Minkowski sum, the algorithm's calculation is simpler and execution performance is higher. © 2013 ISSN 1881-803X.

关键词： Motion planning

来源：评论

学校读者我要写书评

暂无评论

A DAG-based algorithm of mining frequent closed itemsets in high dimensional datasets

引用

International Journal of Advancements in Computing technology 2012年第19期4卷 213-222页

作者： Dong, Jun Chen, Shuai Chen, Jing Huang, Guoyan Ren, Jiadong College of Information Science and Engineering Yanshan University 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China Production Management Department Shanghai Aircraft Manufacturing Co.Ltd 200436 China

Algorithms based on row enumeration always scan and construct conditional transposed tables, which increases the execution time and space cost. To address this problem, we adopt the DAG (Directed Acyclic Graph) to compress the dataset to save the memory space. In DAG, each node is related to a rowid, and each two nodes have a corresponding directed edge which stores the common items of the two rowids. Each row is given an integer according to its coming order and the DAG follows that order. A directed acyclic graph records the relation between rows and items by doing AND(&) operation with the nodes' binary code of the edges. We also present DAGHDDM which is a new approach for mining frequent closed itemsets in high dimensional datasets. In this algorithm, we adopt the BitTable to compress the dataset firstly, and then construct DAG according to the BitTable. We increase the same items of the adjacent edges to implement pattern growth, traverse the DAG in reversal way and adopt a close-checking method to generate all frequent closed itemsets. It scans the dataset only once and does not generate candidate itemsets. The experimental results show that the proposed DAGHDDM algorithm can decrease the cost of time.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

A PTV method based on SIFT feature points matching for velocimetry measurement of oil-water two-phase flow in horizontal pipelines

International Journal of Signal Processing, Image Processing...

引用

International Journal of Signal Processing, Image Processing and Pattern Recognition 2015年第12期8卷 195-206页

作者： Kong, Weihang Li, Lei Kong, Lingfu Li, Yingwei Xie, Na School of Information Science and Engineering Yanshan University QinhuangdaoHebei China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Hebei China Information Department of Library Yanshan University QinhuangdaoHebei China

Due to the advantages of scale invariant feature transform (SIFT) feature points on the invariant to image scale, brightness, rotation, occlusion, noise and so on, this paper proposes a Particle Tracking Velocimetry (PTV) method, based on SIFT feature points matching for velocity measurement of oil-water two-phase flow in horizontal pipelines. The oil-water two-phase flow with large droplet diameter, oil droplets overlap, ununiform lighting, and the centroid position of oil droplets can’t be obtained only by using traditional PTV methods through morphological processing. However, in this paper, the algorithm can directly achieve the average velocity of the flow field according to the positions of correctly matched SIFT feature points, and there is no need to extract the centroid coordinates of each oil droplet. The experimental results show that the proposed algorithm not only can be used in the average velocity measurement of oil-water two- phase flow in horizontal pipelines, but also can reach 95% in the measuring accuracy when the matching feature points are enough sufficient. © 2015 SERSC.

关键词： Velocity measurement

来源：评论

学校读者我要写书评

暂无评论

An improved Wu-Huberman community discovery algorithm based on edge points

引用

ICIC Express Letters 2013年第11期7卷 2949-2955页

作者： Guo, Jingfeng Wang, Xiaolin Zuo, Mengfei Lv, Jiaguo College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

There are two critical questions in the Wu-Huberman algorithm: one is picking two poles and the other is setting the threshold. By further studying the two questions, we present a method that makes the discovery of communities more precise and the scope of application of the algorithm wider. The method picks the edge nodes of two communities as two poles and finds the largest gap using the core nodes of communities, which can discover communities of arbitrary size instead of roughly the same size. © 2013 ISSN 1881-803X.

关键词： Poles

来源：评论

学校读者我要写书评

暂无评论

Mining important nodes in directed-weighted software network based on semi-global structure information

引用

ICIC Express Letters 2015年第10期9卷 2859-2866页

作者： Ren, Jiadong Wu, Hongfei Yin, Tengteng Liu, Yang He, Haitao College of Information Science and Engineering Yanshan University No. 438 West Hebei Ave. Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 West Hebei Ave. Qinhuangdao China

Software’s control flow graph can be treated as a complex software network, and a tiny fraction of key function nodes has considerable influence on the stability, reliability and robustness of the network. Identifying the top-k key nodes accurately and effectively has become an important topic in software engineering. In this paper, directedweighted function dependency network (DWFDN) is adopted to represent the function and relationship of function calling or dependency. The weight on a direct edge indicates the frequency of function calling. Weighted semi-global structure information (the weight, the relative position of a function node and the topological structure among its neighbor nodes) is taken into consideration in our approach. From the perspective of accumulating and propagating vulnerabilities, key function callers and function callees are mined respectively. Case studies on real software date show the utility of the approach. © 2015, ICIC International.

关键词： Software reliability

来源：评论

学校读者我要写书评

暂无评论

An efficient Subspace Clustering Algorithm based on Attribute Relativity and DBSCAN

引用

ICIC Express Letters 2014年第6期8卷 1677-1682页

作者： Zeng, Qiang Bai, Yunyue He, Haitao Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

In the high-dimensional data traditional clustering algorithms tend to break down because of the curse of dimensionality, high cost of time, etc. This paper proposes a novel algorithm AReSUBCLU, an Effective Subspace Clustering Algorithm based on Attribute Relativity and DBSCAN. Active attribute is defined to reduce the dimension of data, and a subspace search tree which is constructed by attribute correlation matrix is defined to generate subspaces. Firstly, this method uses DBSCAN with the technique of weighted threshold to cluster on every active attribution. Secondly, the correlation matrix is constructed by computing the covariance of attributes. And the subspace search tree is constructed by the matrix which is used to measure the relativity of attributions. The set of nodes in each root branch of the tree is the interesting subspaces that the algorithm discovers. Finally, the subspace clusters are obtained through merging every cluster of active dimension with the usage of similarity of cluster. Evaluation with synthetic and real-world datasets demonstrates that AReSUBCLU has a good clustering quality, and capability of discovering subspace clusters of arbitrary shapes. © 2014 ISSN 1881-803X.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

LoBa-Min-Min-SPA: Grid load balance using SPA

引用

Open Automation and Control systems Journal 2013年第1期5卷 87-95页

作者： Zhang, Zhongping Wen, Lijuan Wang, Zhiping College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei 066004 China Foreign Language College of Dalian Jiaotong University Dalian Liaoning 116052 China

In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward LoBa-Min-Min algorithm, which is based on load balance. This algorithm first used Min-Min algorithm preliminary scheduling, then according to the standard of reducing Makespan, the tasks on heavy-loaded resources would be assigned to resources that need less time to load balance, raise resource utilization rate, and achieve lesser completion time. We used benchmark of instance proposed by Braun et al. to prove feasibility and effectiveness of the algorithm. At Last, We introduced the SPA and gave the experimental results of Min-Min-SPA and LoBa-Min-Min-SPA. © Zhang et al.;Licensee Bentham Open.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：