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

Models of parallel computation :a survey and classification

中国高等学校学术文摘·计算机科学 2007年第2期1卷 156-165页

作者： ZHANG Yunquan CHEN Guoliang SUN Guangzhong MIAO Qiankun Laboratory of Parallel Computing Institute of SoftwareChinese Academy of SciencesBeijing 100080China State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100080China Anhui Province-MOST Key Co-Lab of High Performance Computing and Its Applications Department of Computer Science and TechnologyUniversity of Science and Technology of ChinaHefei 230027China

In this paper,the state-of-the-art parallel computational model research is *** will introduce various models that were developed during the past *** to their targeting architecture features,especially memory organization,we classify these parallel computational models into three *** models and their characteristics are discussed based on three generations *** believe that with the ever increasing speed gap between the CPU and memory systems,incorporating non-uniform memory hierarchy into computational models will become *** the emergence of multi-core CPUs,the parallelism hierarchy of current computing platforms becomes more and more *** this complicated parallelism hierarchy in future computational models becomes more and more important.A semi-automatic toolkit that can extract model parameters and their values on real computers can reduce the model analysis complexity,thus allowing more complicated models with more parameters to be *** memory and hierarchical parallelism will be two very important features that should be considered in future model design and research.

关键词： parallel computational models hierarchicalmemory hierarchical parallelism three generations memorymodel

来源：评论

学校读者我要写书评

暂无评论

A novel mesh quad-segmentation algorithm

A novel mesh quad-segmentation algorithm

引用

2nd International Multi-Symposiums on computer and Computational sciences 2007, IMSCCS'07

作者： Qian, Jiang Ye, Xiuzi Fang, Cuihao Zhang, Sanyuan Zhang, Yin State Key Lab. of CAD and CG College of Computer Science Zhejiang University Hangzhou 310027 China

ISBN: (纸本)0769530397

Great efforts have been devoted to seamless quadrangulation of triangular mesh for its practical application in constructing surface patches. This type of algorithm sets up a parameterization on the triangular mesh and a re-meshing is carried out then to the quadrangulate mesh. The paper proposes a novel algorithm to quadsegment the triangular mesh. Our algorithm combines the techniques of parameterization with re-triangulation and clustering which segment the triangular mesh instead of remeshing based on the parameterization results. Thus the algorithm avoids the process of solving linear systems of equations and local parameterization for adjusments. Also, the robustness of the algorithms is enhanced because ofthe possible ill-conditioned status of linear systems of equations arises in the previous algorithms. ©2007 IEEE.

关键词： Triangulation

来源：评论

学校读者我要写书评

暂无评论

Towards location-aware topology in both unstructured and structured P2P systems

Towards location-aware topology in both unstructured and str...

引用

36th International Conference on Parallel Processing in Xi'an, ICPP

作者： Qiu, Tongqing Chen, Guihai Ye, Mao Chan, Edward Zhao, Ben Y. State Key Lab. of Novel Software Nanjing University Department of Computer Science City University of Hong Kong Department of Computer Science UC Santa Barbara

ISBN: (纸本)076952933X

A self-organizing peer-to-peer system is built upon an application level overlay, whose topology is independent of underlying physical network. A well-routed message path in such systems may result in a long delay and excessive traffic due to the mismatch between logical and physical networks. In order to solve this problem, we present a family of Peer-exchange Routing Optimization Protocols (PROP) to reconstruct the overlay. It includes two policies: PROP-G for generic condition and PROP-O for optimized one. Both theoretical analysis and simulation experiments show that these two protocols greatly reduce the average latency of the overlay and achieve a location-aware topology with low overhead. Their overall performance can be further improved if combined with other recent approaches. Specifically, PROP-G can be easily applied to both structured and unstructured systems without the loss of their primary characteristics, such as efficient routing and anonymity. PROP-O, on the other hand, is more efficient, especially in a heterogeneous environment where nodes have different processing capabilities. © 2007 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Physically based simulation of fluid mixtures

Physically based simulation of fluid mixtures

引用

2007 10th IEEE International Conference on computer Aided Design and computer Graphics, CAD/Graphics 2007

作者： Wu, Enhua State Key Lab of Computer Science Institute of Software Chinese Academy of Sciences Beijing China Department of Computer and Information Science Faculty of Science and Technology University of Macau Macao China

ISBN: (纸本)9781424415793

In our daily life, we may often see various natural phenomena of fluid mixtures, like pouring honey/ink into water, Coca Cola into strong wine etc. In fluid simulation, since fluids can not hold the shear stress, their shapes usually vary drastically in their dynamics. Interaction among multiple fluids in different features becomes even more difficult. Since the late 90s of the last century, graphics researchers have simulated lots of natural effects on fluid simulation for animating such as smoke, fire or water. However, little attention has been paid to demonstrating the effect of fluid mixtures. In the fluid mixture simulation, interactions among fluid mixtures in different kinds would generate comprehensive behavior. To investigate the interaction behavior in physically-based simulation of the fluids, it is of importance to build physically correct models to represent the varying interactions among the fluid mixtures. In this talk, stress will be put on the physically based simulation of fluid mixtures, in particular the mixture in two fluids, or binary mixtures. We will introduce the fundamental principle of the physics in the fluid mixture phenomena, and then the primary solutions to the simulation. The approaches we have proposed for the solution to the fluid mixture simulation will be introduced in detail, with various simulation results to be demonstrated. In some of the methods, advantage is taken with the Graphics Processing Unit (GPU) to achieve real-time computation for the simulation. Roughly in terms of the miscibility of binary mixtures, the fluid mixture can be categorized into immiscible mixtures such as bubbles in liquid or oil in water, and miscible mixtures such as honey dissolving in water. The visual appearance of the mixture physically roots in two opposite processes: the diffusing and the demixing. The diffusing process leads to the dissolving effect such as honey dissolving in water, while the demixing process leads to the separation (or de

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Interactive point cloud blending by drag-and-drop

引用

Journal of Zhejiang University-science A(Applied Physics & Engineering) 2007年第10期8卷 1633-1641页

作者： ZOU Wan-hong?1, DING Zhan1, YE Xiu-zi1, CHEN Zhi-yang2 (1state key lab. of CAD and CG, School of computer science and Technology, Zhejiang University, Hangzhou 310027, China) (2Software College, Zhejiang University of Technology, Hangzhou 310014, China) State Key Lab. of CAD CG School of Computer Science Technology Zhejiang University Hangzhou 310027 China Software College Zhejiang University of Technology Hangzhou 310014 China

With the rapid development of 3D digital photography and 3D digital scanning devices, massive amount of point samples can be generated in acquisition of complex, real-world objects, and thus create an urgent need for advanced point-based processing and editing. In this paper, we present an interactive method for blending point-based geometries by dragging-and- dropping one point-based model onto another model’s surface metaphor. We first calculate a blending region based on the polygon of interest when the user drags-and-drops the model. Radial basis function is used to construct an implicit surface which smoothly interpolates with the transition regions. Continuing the drag-and-drop operation will make the system recalculate the blending regions and reconstruct the transition regions. The drag-and-drop operation can be compound in a constructive solid geometry (CSG) manner to interactively construct a complex point-based model from multiple simple ones. Experimental results showed that our method generates good quality transition regions between two raw point clouds and can effectively reduce the rate of overlapping during the blending.

关键词： Drag-and-drop Point cloud model Interactive blending Geometry modeling

来源：评论

学校读者我要写书评

暂无评论

Deforming surface simplification based on feature preservation

Deforming surface simplification based on feature preservati...

引用

6th International Conference of Entertainment Computing, ICEC 2007

作者： Shixue, Zhang Enhua, Wu Dept. of Computer and Information Science University of Macau Macao China State Key Lab. of Computer Science Institute of Software Chinese Academy of Sciences China

ISBN: (纸本)3540748725

In computer graphics, methods for mesh simplification are common. However, most of them focus on static meshes, only few works have been proposed for simplifying deforming surfaces. In this paper, we propose a new method for the multiresolution representation of time-varying meshes based on deformation area and feature preservation. Our method uses the famous QEM (quadric error metric) as our basic metric. The idea is to modify the edge collapse cost by adding the deformation and sharp feature weight to the aggregated quadrics errors when computing the unified edge contraction sequence, then adjust this sequence slightly for each frame to get a minimum geometry distortion. Our approach is fast, easy to implement, and as a result good quality dynamic approximations with well-preserved fine details can be generated at any given frame. © ERIP International Federation for Information Processing 2007.

关键词： computer graphics

来源：评论

学校读者我要写书评

暂无评论

BDI agents using evolving artificial neural network for intelligent planning in etching tools

引用

Journal of Harbin Institute of Technology (New Series) 2007年第SUPPL. 2期14卷 135-138页

作者： Xu, Hua Jia, Peifa State Key Lab. of Intelligent Technology and Systems Tsinghua University Beijing 100084 China Dept. of Computer Science and Technology Tsinghua University Beijing 100084 China

Multi robot cooperation in etching tools is a complex application since dynamic state changes of all the cooperative robots should be considered in making control decisions. So it is difficult for traditional agent-based method (such as belief decision intention (BDI) method) to schedule cooperative etching robots. A dynamic intelligent planning method is required to improve the quality of the decision making process. According to the etching cooperative robot system requirements, this paper proposes a dynamic and intelligent planning method on the base of hybrid BDI agent architecture, which is with evolving artificial neural network (NN) in building the intelligence especially in planning process. As the input of the NN, the working states of every robot can be got easily. And the control decisions for every cooperative robot can be easily made by itself with the evolving neural network. It has been demonstrated effective in actual applications.

关键词： Robot applications

来源：评论

学校读者我要写书评

暂无评论

Mining the impact factors of threads and participators on usenet using link analysis

Mining the impact factors of threads and participators on us...

引用

11th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2007

作者： Hongbo, Liu Jiaxin, Wang Yannan, Zhao Zehong, Yang State Key Lab. of Intelligent Technology and System Department of Computer Science and Technology Tsinghua University Beijing China

ISBN: (纸本)9783540717003

Usenet is a world-wide distributed discussion system, and it is one of the representative resources on Internet. The structure of newsgroup on Usenet forms gradually along with the evolution of the newsgroup and could provide helpful information for the users. In this paper, we present a method to evaluate the impact factors of participators and threads based on the structure of newsgroup. Some analysis and experimental results on real data sets are also provided. The impact factors could provide useful intrinsic information of the newsgroup and can be used in some applications to help access information more efficiently on the Usenet. The method can be also applied on other discussion systems, such as web forums, bulletin board systems, and so on. © Springer-Verlag Berlin Heidelberg 2007.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Multi-resolution hierarchical point cloud segmenting

Multi-resolution hierarchical point cloud segmenting

引用

2nd International Multi-Symposiums on computer and Computational sciences 2007, IMSCCS'07

作者： Wanhong, Zou Xiuzi, Ye College of Computer Science and Technology State Key Lab. of CAD/CG Zhejiang University Hangzhou 310027 China

ISBN: (纸本)0769530397

Segmentation is a fundamental issue in point cloud geometry process. It has encountered two difficulties. From one side, those efficient mesh based segmentation algorithms could not be applied to cloud, as point cloud doesn't have topology information;the other difficulty is that the existing point cloud segmentation algorithm could not process large scale models directly. In this paper, we introduce a technique to directly segment a large-scale point cloud into distinct parts. We first construct a simplified approximate geometry model for point cloud based on point cloud's boundary volume hierarchy. This new geometry model is a simplified point model enhanced with topology information. We implement a segmentation algorithm to decompose the simplified model into several parts, and then a new simplified model with better approximation is constructed for each of the segmented parts. Next hierarchy segmentation can be done on these simplified models with better resolution. Our experiment results show that the algorithm is robust and efficient. © 2007 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Regularized clustering for documents

Proceedings of the 30th Annual International ACM SIGIR Confe...

引用

Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR'07 2007年 95-102页

作者： Wang, Fei Zhang, Changshui Li, Tao State Key Lab of Intelligent Tech. and Systems Department of Automation Tsinghua University Beijing 100084 China School of Computer Science Florida International University Miami FL 33199 United States

ISBN: (纸本)1595935975

In recent years, document clustering has been receiving more and more attentions as an important and fundamental technique for unsupervised document organization, automatictopic extraction, and fast information retrieval or filtering. In this paper, we propose a novel method for clustering documents using regularization. Unlike traditional globally regularized clustering methods, our method first construct a local regularized linear label predictor for each document vector, and then combine all those local regularizers with a global smoothness regularizer. So we call our algorithm Clustering with Local and Global Regularization (CLGR). We will show that the cluster memberships of the documents can be achieved by eigenvalue decomposition of a sparse symmetric matrix, which can be efficiently solved by iterative methods. Finally our experimental evaluations on several datasets are presented to show the superiorities of CLGR over traditional document clustering methods. Copyright 2007 ACM.

关键词： Information retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：