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

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 critical nodes in software execution network based on complex network

引用

ICIC Express Letters, Part B: Applications 2016年第9期7卷 1879-1884页

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

It is significant for measuring the importance of nodes accurately to improve software stability and robustness in software network. A software execution directed network takes function as a node and relationship of function as an edge in this paper. To nd the critical nodes in the network, a novel method is proposed to measure the nodes' importance by means of depth search mining in software execution. According to the principle of cascading failure, a novel critical nodes metrics FID is dened for nodes measuring and sorting. Critical nodes mining (CNM) algorithm is put forward for calculating FID value of each node and sorting. We choose top-ranking nodes as critical nodes which play an important role in software execution process. Experimental results show that CNM algorithm can measure the critical nodes accurately in software network. © 2016 ICIC International.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Semantic analysis and retrieval of spatial data based on the uncertain ontology model in Digital Earth

引用

International Journal of Digital Earth 2015年第1期8卷 3-16页

作者： Shengtao Sun Lizhe Wang Rajiv Ranjan Aizhi Wu The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and EngineeringYanshan UniversityQinhuangdaoChina Institute of Remote Sensing and Digital Earth Chinese Academy of SciencesBeijingChina Computational Informatics CSIROCanberraACTAustralia College of Vehicles and Energy Yanshan UniversityQinhuangdaoChina

Metadata are the information about and description of *** Digital Earth,metadata become variant and heterogeneous with many *** paper studies uncertain features in the generation and application of metadata,and two types of uncertainties(incomplete and imprecise)are described based on semantic quantitative measurement method semantic relationship quantitative measurement based on possibilistic logic and probability statistic(SRQ-PP).Moreover,in the case study,we apply two types of quantitative measurements based on SRQ-PP to describe incomplete(uncertain)knowledge and imprecise(vague)information separately in spatial data service retrieval,which in turn is helpful to identify additional potential data resources and provide a quantitative analysis of the results.

关键词： metadata semantic ontology uncertainty measurement spatial data digital earth

来源：评论

学校读者我要写书评

暂无评论

A novel collaborative recommendation algorithm integrating probabilistic matrix factorization and neighbor model

引用

Journal of Information and Computational Science 2015年第5期12卷 2011-2019页

作者： Yu, Hongtao Dou, Lisha Zhang, Fuzhi The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Yanshan University Qinhuangdao China

The existing collaborative recommendation algorithms suffer from lower recommendation precision due to the problem of data sparsity. To solve this problem, we propose a novel collaborative recommendation algorithm which integrates the probabilistic matrix factorization and neighbor models. We first propose a method to calculate the similarity between users or items based on the probabilistic matrix factorization model and construct a natural exponential function to compute the weighted similarity. Then we devise a collaborative recommendation algorithm to make recommendations for the target user, which dynamically adjusts the recommendation results for user-and item-based models by the balance adjustment factor. The experimental results on the MovieLens dataset show that the proposed algorithm outperforms the existing algorithms in terms of prediction accuracy. Copyright © 2015 Binary Information Press.

关键词： Exponential functions

来源：评论

学校读者我要写书评

暂无评论

Graph-cluster-mine: weighted closed key path mining in complex software executing network modules

引用

Journal of Computational Information systems 2015年第1期11卷 285-295页

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

Previous key path mining algorithms have high computation complexity in the whole software executing network. But the network can be clustered into modules to find key paths in the module. If simplified strategy, weight and closed checking of paths are considered, interesting weighted closed key paths can be found more efficiently. Therefore, a novel algorithm Graph-Cluster-Mine is proposed. Firstly, weighted complex software executing network is constructed, definition of software executing network modules is given. Secondly, GN algorithm is improved to cluster the network into modules on limiting scale of a module. And DFS is adopted for each module to find paths. Path-Simplified-Bundle and Path-Simplified- Hierarchy strategies are devised to simplify paths. Thirdly, key-Path-Mine and Path-Closed-Checking are developed to mine weighted closed key paths. Experimental results indicate Graph-Cluster-Mine is more efficient in finding weighted closed key paths in complex software executing network. ©, 2014, Journal of Computational Information systems. All right reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Research on Router Algorithm Based on Trust Primary Node in the Environment of P2P Network

Research on Router Algorithm Based on Trust Primary Node in ...

引用

2015 International Conference on Informatics, Control and Automation(ICA 2015)

作者： Jing CHEN Yun WAN Department of Computer College of Information Science and EngineeringYanshan University Key Laboratory of Computer Virtual Technology and System Integration of Hebei Province

The distributed, heterogeneous and anonymous attribute of P2 P networks make the node information sharing facing security problems. In order to prevent malicious and false service of nodes, and improve the retrieval efficiency, the primary node selection algorithm based on trust mechanism is proposed in this paper. Firstly, the network topology based on virtual community is described, and the function of primary node is discussed. Secondly, the primary node is selected according to direct trust value and recommendation trust value of each node in the virtual community. Finally, resource retrieval algorithm is designed according to the selected trust primary node, and the algorithm is experimentally verified. In some certain extent, the results show that the method is able to reduce the fraud of primary node and improve the retrieval efficiency.

关键词： P2P network virtual community Primary node Trust mechanism Router algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on community detection in social network based on Pairwise Merging

引用

Journal of Computational Information systems 2015年第19期11卷 7079-7086页

作者： Chen, Jing Wan, Yun Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao China College of Information Science and Engineering Yanshan University Qinhuangdao China

Community detection has become an important challenge during the past decade. Network is divided into some groups or communities that are densely connected to each other inside while less connected to the nodes outside. Community detection in social networks using hybrid merging of sub-communities is proposed. It is based on the idea of bottom to up. But the initial phase of algorithm resulted in many sub- communities and hybrid merging generated some weak communities. In order to resolve these problems, the algorithm CDPM (Community Detection based on Pairwise Merging of sub-communities) is proposed in this paper. The main idea of the algorithm starts with some small communities. Then, these small communities are extended by using similarity in order to decrease the number of sub-communities. Finally, these sub-communities are merged by pairwise merging which is mainly based on maximization modularity. Meanwhile, checking structure of every community is to avoid the appearance of weak community. The CDPM is proved on two real networks, and the results show that the performance of CDPM is close to real network and the quality of community detection is improved. © 2015 by Binary Information Press.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：