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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Data stream clustering algorithm based on spatial directed graph

引用

Advances in Information Sciences and Service Sciences 2012年第20期4卷 241-249页

作者： Ren, Jiadong Yuan, Xuemei Dong, Jun 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

Recently, the grid-density based clustering has become one of the major issues among all of the clustering approaches, it has special advantages over other clustering algorithms, such as less computation and the ability of clustering with arbitrarily shape, which are particularly useful for the data stream clustering. This paper defines a spatial directed graph named Grid-Based Graph (GBG) to store the non-empty grids in data space, and proposes a data stream clustering algorithm based on spatial directed graph GBGSClu (Grid-Based Graph Stream Clustering). GBG graph composes of vertices and directed edges, if a vertex A has a neighboring dense vertex B, and then there is a directed edge from vertex B to A in GBG. The algorithm maps the data stream into the non-empty vertices online, updates the vertices' feature vectors with the arriving of data stream, deletes the sparse vertices every gap time, generates GBG graph when the clustering quest coming and finally clusters on the current structure. The eventual clustering results can be obtained by only checking the vertices' in-degree which can reduce the computation needed in clustering. The validity and efficiency of GBGSClu algorithm have been tested and verified by clustering on real and synthetic datasets.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Rain scenes rendering algorithm combining metaball with mass-spring surface

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and technology Edition) 2013年第SUPPL.1期43卷 230-234页

作者： Lyu, Meng-Ya Zheng, Xuan Tang, Yong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China The Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao 066004 China

To solve the problems such as unreal effects, incomplete details in the rain scene, an algorithm to simulate water surface after rain hitting by combining Meatball with mass-spring water surface was presented. First, the raindrops model was estabished with particle system combining textures, and the water surface model was established with the mass-spring model. Secondly, the algorithm animated half globular bubbles after rain hitting with Meatball. Thirdly, water splash was simulated by means of the particle system and a gradual thinning and syncretizing technique. Finally, with the help of Cg language, the reflection and the refraction effect on the water surface, globular bubbles and water splash were simulated. The experiment shows that this approach can be used to simulate rain scenes efficiently and realistically.

关键词： Rain

来源：评论

学校读者我要写书评

暂无评论

A Recurrence method of attribute reduction based on rough set

引用

ICIC Express Letters 2013年第3 B期7卷 1025-1030页

作者： Zhang, Tao Lu, Jing Chen, Nan Gao, Zhi College of Information 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 Foreign Languages Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China Institute of Electrical Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao 066004 China

According to the classical rough set, the attribute reduction set may be far from satisfactory due to the non-existence of core in the attribute reduction process of decision table. Aiming at this issue, this paper puts forward a recurrence method of attribute reduction;first find out the starting attributes with the highest division as the basic one, and then add the remaining attributes gradually to refine the undivided equivalence class until the non-existence of the samples which must be separated. The paper theoretically proved the relation between the traditional method and recurrence method of attribute reduction on the existence of core. The reliability of the new method was analyzed and illustrated by experiments. © 2013 ICIC International.

关键词： Decision tables

来源：评论

学校读者我要写书评

暂无评论

Correlation technology of suturing procedure in virtual surgery

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (Engineering and technology Edition) 2013年第SUPPL.1期43卷 16-20页

作者： Lyu, Meng-Ya Han, Yu-Fang Tang, Yong College of Information Science and Engineering Yanshan University Qinhuangdao 066004 China Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China

Aiming at the difficulty of achieving interactive simulation between soft tissue and suture, a method to simulate suturing procedure in virtual surgery was proposed. Firstly, mass-spring model was used as the physical model for soft tissue. In order to perform the relative motion between two masses of soft tissue realistically, an internal friction coefficient was introduced first. Secondly, the interaction of suture and soft tissue was aralyzed. A simple linear mass-spring model with following the leader algorithm was used to model the suture. A stress aralysis was carried out, when the suture touch the soft tissue, so the interaction process was close to physical reality. The movement of the whole suture computed by following the leader algorithm gave good performance in suture's rigidity characteristics. Finally, the interaction of the two deformable objects in a continuous pattern suture was considered, for each node of the soft tissue model, the node that attached to it was stored. This information can be used to compute the soft tissue deformation well. Experiment shows that it is realistical to simulate the soft tissue deformation and suture. meanwhile, the simulation is in real time.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

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

引用

Journal of Convergence Information technology 2012年第21期7卷 467-476页

作者： Huang, Guoyan Chen, Shuai Ren, Shenyuan Dong, Jun 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 College of Computer Science Sichuan University Chengdu Sichuan 610000 China

In order to fully utilize the minimum support threshold to prune the rowset search space and avoid scanning the whole dataset in close-checking, we proposed two new data structure, Rowset-Itemset-Hybrid-Search-Tree (RIHS-Tree) and Frequent-Closed-Itemset-Rowset-Tree (FCIR-Tree). The former stores the rowsets which share common rowid prefixes, according to some predefined order of rowids. Each path from the root node to the leaf node represents a rowset in which the rowids increase. The later also stores the large rowsets which also share common rowid prefixes. The corresponding closed itemsets are stored in the nodes carrying the last rowids in rowsets. Moreover, a new algorithm, RIHS-Tree-based algorithm for mining frequent closed patterns (FCIM-RIHS), is proposed. We translate the whole dataset into a transposed table, construct RIHS-Tree according to the rowsets in the transposed table and use a bottom-up search strategy to traverse RIHS-Tree. In the process of mining, we use the rowsets-inclusion strategy to implement pattern growth and then obtain large rowsets with their corresponding frequent closed itemsets. In FCIR-Tree, if the nodes in the subtree rooted by the nodes carrying the last rowid in the rowsets do not contain the found itemsets, the found itemsets are frequent closed itemsets. The experiment results with dataset demonstrate that FCIM-RIHS has highly efficiency.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A novel grouping aggregation algorithm for online analytical processing

引用

2012 National Conference on Information technology and computer Science, CITCS 2012

作者： Chen, Wei Liu, Yongshan Wang, Ning College of Information Science and Engineering Yanshan University Qinhuangdao China Key Laboratory for Computer Virtual Technology and System Integration of HeBei Province Qinhuangdao China

ISBN: (纸本)9789491216381

As regard to improve the efficiency of grouping aggregation calculation, the data is compressed by using binary encoding, and the dimension hierarchical grouping attribute set encodings of each dimension table are calculated by using the dimension hierarchy tree. Then different encodings are put into temporary table to be sorted and grouped, and the grouping sequence numbers of fact table records which satisfy the query conditions are computed. Finally, the buffer is located by the grouping sequence number and the grouping aggregation calculation is completed. Theoretical analysis and experimental results show that the proposed algorithm can significantly improve the efficiency of grouping aggregation calculation. © 2012. The authors - Published by Atlantis Press.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Multi-resolution terrain rendering seamlessly by function curve fitting

引用

Journal of Computational Information systems 2012年第24期8卷 10399-10409页

作者： Nie, Junlan Guo, Dongliang Kong, Lingfu Wang, Yanfen The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province Yanshan University Qinhuangdao 066004 China

During the process of real-time multi-resolution terrain rendering, avoiding cracks between LOD (Level of Detail) has always been a tedious task that requires extra complicated handling. In this paper, we propose a novel algorithm called Function Curve Fitting (FCF) to repair T-junction cracks of regular data-based LODs. FCF, as a time-efficient algorithm, uses regular grid as rendering element, could be conveniently integrated with existing algorithms and achieve seamless meshes with excellent image quality and frame rates. Compared with other existing LOD crack-repairing algorithms based on terrain rendering, the experiments on surface quality and rendering performance demonstrate the effectiveness of our FCF approach. © 2011 by Binary Information Press.

关键词： Curve fitting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：