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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on a denoising smoothing algorithm for 3D scattered point cloud

引用

ICIC Express Letters 2014年第9期8卷 2403-2409页

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

In order to effectively eliminate outliers and noise points in 3D scattered point cloud, a denoising smoothing algorithm which is the combination of removing outliers algorithm and trilateral filter is proposed. This is accomplished by rejecting outliers, correcting the normal direction and moving noise points along the modified normal direction within local adaptive neighborhoods. First, the outliers are removed by the method of mathematical statistics, on this basis, estimating normal direction and curvature of point cloud by covariance analysis method. Then, correct the normal direction by combining trilateral filter weighting factor with adaptive optimal neighborhood function. Finally, calculate position offset of data points in the direction of normal amendment by trilateral filter weighting factor in order to smooth the point cloud. Experimental results show that the proposed method is simple and effective, successfully removing noise from point cloud while preserving inherent geometric features. © 2014 ISSN 1881-803X.

关键词： Bandpass filters

来源：评论

学校读者我要写书评

暂无评论

Real-time simulation of large-scale water environments with interacting objects

引用

Journal of Computational Information systems 2015年第9期11卷 3257-3264页

作者： Li, Ying Peng, Jingxuan Fan, Fuding Lv, Mengya Zhang, Lihui Zhao, Jing Tang, Yong The 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 Department of Information Engineering Environmental Management College of China Qinhuangdao China

We present a new GPU scheme for real-time simulation in large-scale water environments with physics-based object interaction. To improve the simulation efficiency, we divide surface waves into ambient waves and interactive waves. A fast and stable Verlet integration method is applied to solve the wave equation to simulate the propagation of interactive waves. To solve the problem that the interactive area caused by the moving object is uncertain, we propose a moving grid suited to LOD (Levels of Detail) surface with multiple resolutions, which reduces the computation cost. The extension of multiple moving grids makes the interaction of water and various objects possible. We propose a volume conservation based method to generate interactive waves and apply rigid body dynamics to demonstrate the effect of water reaction against the object. Experimental results show that our approach achieves higher visual realism and performance. ©, 2015, Binary Information Press. All right reserved.

关键词： Wave equations

来源：评论

学校读者我要写书评

暂无评论

Occlusion avoidance approach based on depth image of visual object

引用

ICIC Express Letters, Part B: Applications 2015年第11期6卷 3103-3108页

作者： Zhang, Shihui Sang, Yu Zhang, Xiaojun School of Information Science and Engineering Yanshan University No. 438 Hebei Avenue Qinhuangdao China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Avenue Qinhuangdao China E and A College Hebei Normal University of Science and Technology No. 360 West Hebei Street Qinhuangdao China

Occlusion avoidance is a more challenging problem in visual field. An occlusion avoidance approach based on depth image of visual object is proposed in this paper. Firstly, the occlusion detection is implemented for the depth image of visual object in current view, and then the occlusion boundary and nether adjacent boundary are obtained to construct occlusion region. Secondly, the occlusion region is segmented into several sub-regions by connecting the corner of occlusion boundary with its nether adjacent boundary point, and the triangular mesh model of each sub-region is established. Thirdly, the candidate observation direction set is determined by utilizing the normal vector of each triangle in triangular mesh model. Finally, the next best view is confirmed based on the candidate observation direction set to realize the occlusion avoidance function. Compared with the existing methods, the proposed approach does not need the priori knowledge of visual object or limit the camera position on a fixed surface. Experimental results demonstrate its feasibility and effectiveness. © 2015 ICIC International.

关键词： Mesh generation

来源：评论

学校读者我要写书评

暂无评论

VT-SGN:Spiking Graph Neural Network for Neuromorphic Visual-Tactile Fusion

引用

IEEE Transactions on Haptics 2024年 PP卷 PP-PP页

作者： Wu, Peiliang Zhang, Haozhe Li, Yao Chen, Wenbai Gao, Guowei Yanshan University School of Information Science and Engineering Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao066004 China Beijing Information Science and Technology University School of Automation Beijing100192 China

Current issues with neuromorphic visual-tactile perception include limited training network representation and inadequate cross-modal fusion. To address these two issues, we proposed a dual network called visual-tactile spiking graph neural network (VT-SGN) that combines graph neural networks and spiking neural networks to jointly utilize the neuromorphic visual and tactile source data. First, the neuromorphic visual-tactile data were expanded spatiotemporally to create a taxel-based tactile graph in the spatial domain, enabling the complete exploitation of the irregular spatial structure properties of tactile information. Subsequently, a method for converting images into graph structures was proposed, allowing the vision to be trained alongside graph neural networks and extracting graph-level features from the vision for fusion with tactile data. Finally, the data were expanded into the time domain using a spiking neural network to train the model and propagate it backwards. This framework effectively utilizes the structural differences between sample instances in the spatial dimension to improve the representational power of spiking neurons, while preserving the biodynamic mechanism of the spiking neural network. Additionally, it effectively solves the morphological variance between the two perceptions and further uses complementary data between visual and tactile. To demonstrate that our approach can improve the learning of neuromorphic perceptual information, we conducted comprehensive comparative experiments on three datasets to validate the benefits of the proposed VT-SGN framework by comparing it with state-of-the-art studies. © 2008-2011 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Cluster-based superseding nearest neighbor queries on uncertain data

引用

Journal of Convergence Information technology 2012年第17期7卷 392-401页

作者： Liu, Wenyuan Li, Wei Du, Ying Chen, Zijun He, Yourui College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China College of Economics and Management Yanshan University Qinhuangdao Hebei 066004 China The Key Lab. for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao Hebei 066004 China

Recently, query processing based on uncertain data is becoming research focuses. Cluster-based superseding nearest neighbor (CSNN) query algorithm on uncertain data is proposed in this paper. We divide the instances of each object into k clusters by applying the clustering algorithm k-means, and then store these clustered objects in R-tree like index structures. Ranked list will be retrieved through traversing R-tree, which could include instances, clusters, or objects. While unfolding the ranked list, the superseding graph G will be constructed gradually based on the superseding relationship. The final result sets will be found through pruning and validating the superseding graph G. Finally, the experimental results show that the algorithm is efficient and effective.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Frequent closed itemsets mining using ITBitree

引用

International Journal of Advancements in Computing technology 2012年第17期4卷 271-279页

作者： Ren, Jiadong Song, Wei Yu, Shiying College of Information Science and Engineering Yanshan University Qinhuangdao Hebei 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Qinhuangdao City 066004 China Hebei Provincial S and T Management Information Center 159 Dongfeng Road Shijiazhuang Hebei 050021 China

The set of frequent closed itemsets is much smaller than the one of all frequent itemsets. Meanwhile it retains the completeness. In this paper, we propose an ITBitree-based algorithm, called ITBitreeFCIM (ITBitree Frequent Closed Itemsets Miner), for mining the frequent closed itemsets directly. A novel structure termed ITBitree (Itemset Tidset Binary Tree) is defined to store the transaction and itemset information. Frequent closed itemsets are generated directly by searching the right nodes in each layer and the right nodes in their respective search space deeply from this tree using top-down strategy. For the items with same support in the adjacent layers or the items with the same Tids, we use item merging technique to prune the search space. The searched space is used to avoid the generation of duplicates and enormous closure checks. In the process we do not need to check whether a candidate itemset is closed, so we save a lot of time. The experiment proofs the efficiency of the proposed approach.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：