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

Critical node measuring method improved based on pagerank and betweenness

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2381-2387页

作者： Wang, Lei Dong, Jun Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Ave. Qinhuangdao066004 China E&A College Hebei Normal University of Science and Technology No. 360 Hebei Ave. Qinhuangdao066004 China

In software execution network, PageRank and betweenness methods are used to determine the importance of nodes. The experiment results show that the differences between nodes are not strong and cannot reflect the software nodes’ importance degree. In order to solve this problem, this paper adds the entropy weight method to the calculation of node weights, and puts the weights of nodes into the computing of two measuring methods above. Finally, we get the ranking result of nodes’ importance which means we can find out the critical nodes from top ones. Experimental results indicate that the method is efficient for critical node measuring. © 2016 ICIC International.

关键词： Surveying

来源：评论

学校读者我要写书评

暂无评论

Performance analysis of synchronization buffering mechanism in peer-to-peer live streaming systems

引用

ICIC Express Letters, Part B: Applications 2012年第6期3卷 1665-1672页

作者： Jin, Shunfu Liu, Na Ma, Zhanyou College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China College of Science Yanshan University No. 438 Hebei Avenue Qinhuangdao 066004 China

In the peer-to-peer (P2P) live streaming systems, a single stream is decomposed into multiple sub-streams. For the participating nodes, data blocks of different sub-streams are stored in different sub-buffers for synchronization, then forwarded and assembled to the original video stream in chronological order. In this paper, regarding the sub-buffers as multiple queues with homogeneous Poisson arrival processes, the data block forwarding procedure as a polling service, the forwarding suspension in an empty sub-buffer as a service delay state, a symmetric polling model is constructed. By using the method of embedded Markov chain, the mean queueing length and the probability for one queue to be empty when it is visited are derived in steady-state. Moreover, the performance measures in terms of average synchronization buffering length and video continuity level are obtained accordingly. Finally, numerical results are given to demonstrate that an appropriate number of sub-streams and a reasonable time limit for forwarding suspension can enhance the system performance.© 2012 ISSN 2185-2766.

关键词： Synchronization

来源：评论

学校读者我要写书评

暂无评论

Skin panel design for a morphing mechanism

引用

ICIC Express Letters, Part B: Applications 2016年第10期7卷 2161-2167页

作者： Zhao, Qiang Guo, Xliuan Xi, Fengfeng Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province College of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao066004 China Department of Aerospace Engineering Ryerson University TorontoONM5B 2K3 Canada

A segmentation method is proposed to aid rigid skin panel design for an existing modular morphing wing mechanism. The method divides the surface of the modular morphing mechanism into panels through geometry discretization, and then the skin which is made up of these rigid panels will have better rigidity and it will morph more free without any gap. The method comprises three basic morphing types based on the motion of upper platform. Wherein, the mechanism side is firstly divided into a plurality of panels and each of them is approximated to flat, and then shape changes of one panel before and after morphing are analyzed. Therefore, panels can be designed as moveable and fixed patches to achieve seamless morphing. At last, computer simulation is set up to further verify the correctness of the method. © 2016 ICIC International.

关键词： Morphing mechanism Seamless morphing Skin panel Surface segmentation

来源：评论

学校读者我要写书评

暂无评论

Mining weighted frequent traversal pattern from software executing graph

引用

ICIC Express Letters 2015年第11期9卷 2893-2900页

作者： He, Haitao Yin, Tengteng Pei, Caiyan Wu, Hongfei Ren, Jiadong College of Information Science and Engineering 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 School of Mathematics and Information Science and Technology Hebei Normal University of Science and Technology No. 360 West Hebei Street Qinhuangdao China

Mining important patterns in complex software executing network plays an important role in analyzing software security. The general sequential pattern mining algorithms may lead to poor performance due to the lack of consideration on the continuous property of software path traversals and the different importance of functions. To address the issue, a novel approach called weighted frequent traversal pattern miner (WFTPMiner) to mine weighted frequent traversal pattern from software executing graph is presented in this paper. In WFTPMiner, weighted software executing graph (WSEG) is modeled firstly. Secondly, software path traversals are extracted from WSEG by depthfirst- search (DFS) strategy. Thirdly, according to continuity characteristics of software path traversals, a potential frequent suffix sequence tree (PFSS-Tree) is defined to store the potential weighted frequent traversal patterns. A pruning strategy is adopted by PFSSTree. The pruning strategy can prune infrequent patterns effectively. The experimental results show that WFTPMiner has better efficiency compared with some previous algorithms. © 2015 ICIC International.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Point cloud coarse matching method for similar objects

引用

ICIC Express Letters 2016年第9期10卷 2283-2289页

作者： Zhao, Qiang Guo, Xijuan Zhang, Buying Bai, Xinyu Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China Technical Center Shenyang Aircraft Corporation Shenyang110850 China

Point cloud matching is much more difficult when an initial estimate of the relative pose is not known. In order to reduce the effect of relative pose on matching operation and improve the computing speed, this article presents a method to fast match the pose of two similar objects through the covariance of their point cloud coordinates. This paper contains three parts. In the first part, a matrix is constructed through the values of point coordinates of one object and then a set of orthogonal vectors will be obtained through eigenvector of the matrix. Rotation matrix will be obtained by comparing the vectors of two similar objects. In the second part, a description of procedures is given and the complexity of the algorithm is analyzed. In the last part, the experiment shows the proposed method has high computing efficiency and the matching results are acceptable. © 2016 ICIC International.

关键词： Covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Minkowski sum modeling of polyhedra based on VRML

引用

ICIC Express Letters 2013年第2期7卷 455-460页

作者： Zhang, Jianfei Guo, Xijuan Geng, Qingjia Information Science and Engineering College Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province No. 438 Hebei Ave. Qinhuangdao 066004 China Computer and Control Engineering College Qiqihar University No. 42 Wenhua Street Qiqihar 161006 China

On the basis of the introduction to basic methods of the geometry modeling based on virtual reality modeling language (VRML) and the concepts of Minkowski sum computation of polyhedra, we present a method of Minkowski sum computation and three dimensional modeling based on VRML. The method can simplify Minkowski sum computation of general polyhedra, and experimental results indicate that this method can calculate Minkowski sum of general polyhedra much faster and realize three-dimensional representation more accurately. This method can provide important technical references for Minkowski sum visualization of polyhedra. © 2013 ISSN 1881-803X.

关键词： Geometry

来源：评论

学校读者我要写书评

暂无评论

An improved community discovery algorithm in weighted social networks

引用

ICIC Express Letters 2016年第1期10卷 35-41页

作者： Guo, Jingfeng Liu, Miaomiao Liu, Linlin Chen, Xiao College of Information Science and Engineering Yanshan University No. 438 West Hebei Ave Qinhuangdao China College of Information Science and Engineering Northeast Petroleum University No. 199 Fazhan Road Daqing China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 West Hebei Ave Qinhuangdao China

The algorithm AGMA (Automatic Graph Mining Algorithm) is improved and a novel community discovery algorithm, namely CRMA (Clustering Re-clustering Merging Algorithm) is proposed which can realize more reasonable community division for weighted social networks. Firstly, in the re-clustering stage, AGMA neglected the clustering situation of neighbors of current node and it did not take the weights of edges connecting the current node and its unclustered neighbors into account, which led to that some nodes cannot be clustered or their clustering was unreasonable. Aiming to this, the concept of the connection compactness between the node and the community is introduced, and then through clustering and re-clustering each node would be divided into the community that has the largest connection compactness with the node according to the node weight, the edge weight and the friend coecient between the node and the community. Secondly, for community division in some unweighted networks and signed networks, if there are many nodes whose clustered neighbors are less than its unclustered neighbors, the division results of AGMA tend to result in the lower modularity. In view of this problem, the concepts of positive edge weight density, the cluster density and the connection coecient between clusters are proposed. Lastly, communities are merged based on the above three concepts after re-clustering and the modularity is eectively enhanced. The higher correctness and better generality of the improved algorithm are veried through experiments. © 2016 ICIC International.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Geometric algebra support vector machine for pattern recognition

引用

ICIC Express Letters 2013年第3 B期7卷 1031-1035页

作者： Wang, Jinjia Zhang, Cuihua Lu, Haitao Hong, Wenxue College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China College of Electrical Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

Geometric algebra is the promotion of real, complex, quaternion, and has been successfully applied in physics, computer graphics, and other fields. The support vector machine (SVM) has been successfully used in the field of pattern recognition. On the basis of the Clifford support vector machine (CSVM), we improve support vector machine based on the principle of geometric algebra. We research the key technologies in training. The experimental results of the Iris data and Breast Cancer data set prove our ideas, and the correct recognition rates are 96% and 97.8%. © 2013 ICIC International.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A New Dynamic Routing Network for Monocular Depth Estimation 12

A New Dynamic Routing Network for Monocular Depth Estimation

引用

12th International Conference on CYBER technology in Automation, Control, and Intelligent systems, CYBER 2022

作者： Luo, Zhehao Luo, Sijin Liang, Guoyuan Wu, Xinyu Guangdong Provincial Key Lab of Robotics and Intelligent System Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Province Shenzhen China University of Chinese Academy of Sciences Beijing China Guangdong-Hong Kong-Macao Joint Laboratory of Human-Machine Intelligence-Synergy Systems Chinese Academy of Sciences Guangdong Province Shenzhen China Guangdong Provincial Key Laboratory of Computer Vision and Virtual Reality Technology Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Guangdong Province Shenzhen China

ISBN: (数字)9781665472678

ISBN: (纸本)9781665472678

Depth estimation is an essential task for understanding the geometry of 3D scenes. Compared with multi-view-based methods, monocular depth estimation is more challenging for the requirement of integrating not only global information but also local cues from various parts. Recently, numerous Convolutional Neural Networks (CNNs) based approaches relying on pre-defined static architectures have been reported. Although many of them have achieved remarkable improvements in accuracy, there remains problem with the generality of the static model when it comes to diverse scenes. In this paper, a novel deep network with dynamic routing architecture is proposed with a dynamically adjustable structure with respect to different inputs, therefore leading to not only improvements on both accuracy and generality but also decrease of the model parameters. Extensive experiments of monocular depth estimation have been conducted on two well-known challenging datasets (i.e., NYUD-v2 and Make3D) as well as the mixed dataset, and have verified the effectiveness of the proposed dynamic framework. © 2022 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A study on the influence propagation model in topic attention networks

引用

International Journal of Performability Engineering 2017年第5期13卷 721-730页

作者： Chen, Xiao Guo, Jingfeng Tian, Kelun Fan, Chaozhi Pan, Xiao College of Information Science and Engineering YanShan University Qinhuangdao066004 China Qian'An College North China University of Science and Technology Qian'an064400 China College of Economic and Management Shijiazhuang Tiedao University Shijiazhuang050043 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China

The social networks with the complex user relations and huge amount of data and hidden information, bring new opportunities and challenges for the study of information diffusion and influence maximization. In recent years, there are more and more researches on the influence maximization of topic preference. However, most of the existing researches only take the topic as an attribute of the users, and the importance of the topic in network structure is not considered. In view of this situation, firstly, this paper constructed a new topic attention network model fusing the social relation and the topic preference. Secondly, based on connected degree of set pair and Markov random walk model, we propose the calculated method of the topic preference for users, and then mining the seed set with influence by the greedy strategy. Thirdly, we propose the calculated method of the activation probability of the user based on the user relation and the topic preference, and propose the influence maximization algorithm TAN-CELF in topic attention networks. Finally, on Dou-ban network dataset, from three metrics ISST, ISRT and ISRNT, compare with algorithm L-GAUP and CELF, the experimental results show that algorithm TAN-CELF that is proposed by this paper has a higher performance on influence scope. © 2017 Totem Publisher, Inc. All rights reserved.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：