基于GPU的视点相关自适应细分

利用GPU的强大浮点数计算能力和并行处理能力,提出一种完全基于GPU的视点相关自适应细分内核进行快速细分计算的方法.在GPU中,依次实现视点相关的面片细分深度值计算、基于基函数表的细分表面顶点求值、细分表面绘制等核心步骤,无须与CPU端系统内存进行几何数据交换.视点相关的自适应细分准则在表面绘制精度保持不变的情况下,有效地降低了细分表面的细分深度和细分的计算量,在此基础上完全基于GPU的细分框架使得曲面细分具有快速高效的特点.该方法还可以在局部重要细节用较大深度值进行实时自适应细分,以逼近极限曲面.     

用C-C细分法和流形方法构造G2连续的自由型曲面

通过改进Cotrina等利用流形方法构造n边曲面片的算法,以C-C细分网格奇异点的5一环作为控制网构造出了带有均匀三次B样条边界的n边曲面片,使得该曲面片和C-C细分曲面G^2拼接．在此基础上,讨论了C-C细分曲面中n边域的构造和填充,从而为基于任意拓扑网格构造低次G^2连续曲面的问题给出了一个有效的解决方案,实现了用流形方法构造的曲面和C-C细分曲面的融合．最后,给出了几个具体算例．     

一种改进的六角形砍边细分方法

研究了六角形网格上的曲面细分算法,改进了六角形网格砍边细分算法.在六边形网格的砍边细分过程中,利用对偶砍角法对非六角形网格进行六角形网格化预处理,然后通过计算相邻两个面片的夹角,根据预先设置的阈值,自动对初始混合控制网格上具有尖锐特征的顶点和边分别作标记,然后对这些标记过的边和点进行特殊处理,局部修改细分规则进行迭代细分.实验结果表明,该算法效果好,能更好地保持原始模型的特征.     

细分曲面的GPU完全实现

本文提出一种完全在GPU上实现的细分曲面绘制策略。该方法以扇区为基本单元,利用三种新的枚举坐标对网格顶点进行编码。初始控制网格按扇区分割后,其顶点被编码到一张纹理上,控制顶点不规则性分离到扇区的同时扇区之间又具有松耦合联系,使GPU像素管线的并行性从片段网格内扩展到整个网格。另外,通过三张查找表来降低实时计算量,并且避免了在CPU上预先细分一次。经过实验对比说明,本文方法具有更高的实时性能。     

基于laplacian坐标修正的(√3)细分法

根据原始网格对细分极限曲面的影响分析,提出了基于laplacian坐标修正的(√3)插值网格细分方法.通过插值出面片中心点的laplacian坐标,来对动态生成的中心点进行修正,达到保持原始网格细节的目的.在非封闭网格的边界面片细分方面,指出了原始(√3)细分法的不足,提出了一种新的边界统一细分模式,它可以很好地控制边界面片的增长,而且具有稳定性和易于操作性.实验结果表明,该方法不仅能够让原始网格的细节在极限曲面上得到表达,而且可以得到一个连续光滑的曲面网格.     

NURBS裁剪曲面绘制方法

根据NURBS曲面在u,v参数域的偏导数动态地把NURBS曲面细分成一些四边形区域,然后用双三次Bézier曲面实现这些四边形的C1连续的逼近。完成裁剪曲面绘制这个过程需要由GPU(Graphic Processing Unit)执行两遍。第一遍先由几何着色器实现裁剪曲面的三角化,再由像素着色器生成裁剪纹理。在此基础上执行第二遍,由几何着色器实现双三次Bézier面片的镶嵌,然后由像素着色器根据裁剪纹理绘制出裁剪后的NURBS曲面。采用GPU实现NURBS裁剪曲面的绘制,把大部分的计算从CPU迁移到了GPU。     

基于laplacian坐标修正的sqrt(3)细分法

根据原始网格对细分极限曲面的影响分析,提出了基于laplacian坐标修正的sqrt(3)插值网格细分方法。通过插值出面片中心点的laplacian坐标,来对动态生成的中心点进行修正,达到保持原始网格细节的目的。在非封闭网格的边界面片细分方面,指出了原始3细分法的不足,提出了一种新的边界统一细分模式,它可以很好地控制边界面片的增长,而且具有稳定性和易于操作性。实验结果表明,该方法不仅能够让原始网格的细节在极限曲面上得到表达,而且可以得到一个连续光滑的曲面网格。     

在三角域上构造三次多项式插值曲面

为满足矿山地形的拟合、水流深度的绘制等很多特殊工程数据量大、有一定的光顺要求但又不需要曲面过于凸起饱满这一需求,提出一种C1连续的三次多项式插值曲面,同时有针对性地提出一种一阶偏导数估计算法.首先将空间散乱数据点投影到平面后进行三角划分;其次针对每个三角形,在其每条边上构造一个C1连续的三次多项式曲面片,由这3个曲面片加权平均形成该三角形的曲面片;最后将所有三角形上的曲面片拼合成整体曲面.为使生成的曲面尽可能地贴近数据点所建议的形状,在曲面求解过程中将数据点分成内部点和边界点分别估计偏导数.实验结果表明,该算法计算量小、具有良好的局部性,并给出了新曲面的效果.     

综合几何信息的实时线绘制算法

以三维网格模型的微分几何信息为依据,结合视点相关和视点无关的线绘制方法,提出一种基于GPU的实时绘制算法.基于视点曲率在图像空间中计算提取视点相关特征线,同时利用风格化纹理和主曲率信息绘制视点无关特征线.根据三维模型信息与预设计的风格化纹理,在像素着色器中对视点相关和视点无关的2类特征信息进行计算,然后结合两者结果得到令人满意的绘制结果.实验结果表明,由于所有计算在图像空间由GPU并行完成,可以高效地提取特征线;采用风格化纹理的设计增加了图像空间风格化绘制的可控性,弥补了图像空间算法的风格化可控性差的缺点.此外,文中算法不仅可以进行实时的风格化线绘制,以该算法为基础还可以进行进一步的艺术仿真,如国画的模拟等.     

三维地形场景局部高精度地形快速更新方法

三维地形场景在很多应用中需要通过及时更新局部高精度地形数据来构建重点区域的精细场景,针对局部区域地形数据的动态更新,提出了基于GPU实时网格细分的局部高精度地形的“镶嵌”算法;通过在GPU中对更新区域的地形网格实时插值细分来增加三角面片数,提高地形模型的几何精度,在有效保证更新区域地形绘制精度的同时,并没有增加内存与显存之间的数据传输压力。实验结果表明,更新区域的绘制精度能够满足要求,且执行效率优于现有的常用算法。     

Call for Papers The 6^th International Conference on Grid and Cooperative Computing

Recent years have seen rapid advances in various grid-related technologies, middleware, and applications. The GCC conference has become one of the largest scientific events worldwide in grid and cooperative computing. The 6th international conference on grid and cooperative computing (GCC2007) Sponsored by China Computer Federation (CCF),Institute of Computing Technology, Chinese Academy of Sciences (ICT) and Xinjiang University ,and in Cooperation with IEEE Computer Soceity ,is to be held from August 16 to 18, 2007 in Urumchi, Xinjiang, China.     

煤矿井下安全监控分站的设计及其仿真实现

为了设计一种具有低成本、低功耗、易操作、功能强且可靠性高的煤矿井下安全分站,针对煤矿安全生产实际,文章提出了采用MCS-51系列单片机为核心、具有CAN总线通信接口的煤矿井下安全监控分站的设计方案;首先给出煤矿井下安全监控分站的整体构架设计,然后着重阐述模拟量输入信号处理系统的设计过程,最后说明单片机最小系统及其键盘、显示、报警、通信等各个组成部分的设计;为验证设计方案的可行性与有效性,使用Proteus软件对设计内容进行仿真验证,设计的煤矿井下安全监控分站具有瓦斯、温度等模拟量参数超标报警功能和电机开停、风门开闭等开关量指示功能;仿真结果表明:设计的煤矿井下安全监控分站具有一定的实际应用价值.     

法律信息库系统

本文分析了法律数据库的结构和特点，介绍了采用面向对象设计方法和超文本数据库技术开发和实现法律信息库系统将作为重要网络资源之一为不同用户进行法律咨询服务。     

View-based model-driven architecture for enhancing maintainability of data access services

In modern service-oriented architectures, database access is done by a special type of services, the so-called data access services (DAS). Though, particularly in data-intensive applications, using and developing DAS are very common today, the link between the DAS and their implementation, e.g. a layer of data access objects (DAOs) encapsulating the database queries, still is not sufficiently elaborated, yet. As a result, as the number of DAS grows, finding the desired DAS for reuse and/or associated documentation can become an impossible task. In this paper we focus on bridging this gap between the DAS and their implementation by presenting a view-based, model-driven data access architecture (VMDA) managing models of the DAS, DAOs and database queries in a queryable manner. Our models support tailored views of different stakeholders and are scalable with all types of DAS implementations. In this paper we show that our view-based and model driven architecture approach can enhance software development productivity and maintainability by improving DAS documentation. Moreover, our VMDA opens a wide range of applications such as evaluating DAS usage for DAS performance optimization. Furthermore, we provide tool support and illustrate the applicability of our VMDA in a large-scale case study. Finally, we quantitatively prove that our approach performs with acceptable response times.     

International Journal of Automation and Computing Table of Contents

正~~     

Information for authors

正SCIENCE CHINA Information Sciences(Sci China Inf Sci),cosponsored by the Chinese Academy of Sciences and the National Natural Science Foundation of China,and published by Science China Press,is committed to publishing highquality,original results of both basic and applied research in all areas of information sciences,including computer science and technology;systems science,control science and engineering(published in Issues with odd numbers);information and communication engineering;electronic science and technology(published in Issues with even numbers).Sci China Inf Sci is published monthly in both print and electronic forms.It is indexed by Academic OneFile,Astrophysics Data System(ADS),CSA,Cabells,Current Contents/Engineering,Computing and Technology,DBLP,Digital Mathematics Registry,Earthquake Engineering Abstracts,Engineering Index,Engineered Materials Abstracts,Gale,Google,INSPEC,Journal Citation Reports/Science Edition,Mathematical Reviews,OCLC,ProQuest,SCOPUS,Science Citation Index Expanded,Summon by Serial Solutions,VINITI,Zentralblatt MATH.     

Erratum to: Fast global kernel fuzzy c-means clustering algorithm for consonant/vowel segmentation of speech signal

正Erratum to:J Zhejiang Univ-Sci C(ComputElectron)2014 15(7):551-563doi:10.1631/jzus.C1300320The original version of this article unfortunately contained mistakes.Algorithm 6 should be as follows:Algorithm 6 FGKFCM-F clustering Input:(1)X={x_1,x_2,…,x_N},,x_iR~d,i=1,2,…,N,the dataset;(2)C,1C≤N,the number of clusters;(3)ε0,the stopping criterion;     

Journal of Zhejiang University-SCIENCE C (Computers & Electronics) Total contents

正~~     

A pragmatic multi-method investigation of discrepant technological events: Coping,attributions, and ‘accidental’ learning

Discrepant technological events or situations that entail a problem, a misunderstanding or a difficulty with the Information Technology (IT) being employed, are common in the workplace, and can lead to frustration and avoidance behaviors. Little is known, however, about how individuals cope with these events. This paper examines these events by using a multi-method pragmatic approach informed by coping theory. The results of two studies – a critical incident study and an experiment – serve to build and test, respectively, a theoretical model that posits that individuals use a variety of strategies when dealing with these events: they experience negative emotions, make external attributions, and adopt engagement coping strategies directed at solving the event, eventually switching to a disengagement coping strategy when they feel they have no control over the situation. Furthermore, users’ efforts may result in ‘accidental’ learning as they try to overcome the discrepant IT events through engagement coping. The paper ends with a discussion of the results in light of existing literature, future opportunities for research, and implications for practice.