一种基于规则网格的地形简化算法

为了进一步研究层次细节技术在实时绘制大规模地形场景中的有效应用,提高海量数据三维地形的重建速度,基于DEM数据及视觉相关地形简化的特点,提出了一种基于网格划分的实时简化算法.该方法首先将DEM栅格数据分成以视点为中心的数据块,利用视觉相关的误差简化算法实现了DEM数据的快速动态分层与地形平滑,其次利用三角剖分方法最终消除了裂缝,对实际数据的实验结果验证了本算法的有效性.该算法能有效地对地形数据进行多分辨率简化,简化后的地形不仅保留了地形表面特征,还能满足实时漫游的需求,可以高效地消除场景漫游过程中图像的跳跃.     

基于连续细节层次的地形动态生成技术

研究地形实时生成技术,采用连续细节层次快速绘制技术,按照地形的局部起伏程度和用户视点信息动态确定绘制时的地形网格。算法采用基于视角的误差度量方法,将静态误差在屏幕上的投影转换为该误差相对于视点的夹角。采用自顶向下搜索层次四叉树的方法以获得恒定的帧频,并利用相邻帧之间的连续性和三角形扇形结构提高地形的实时绘制速度,实验结果证明了算法的有效性,基于视角的误差度量方法和层次四叉树结构可以有效减少时绘制时     

基于地形的自适应压缩和实时可视化

提出了一种具有高压缩比的海量地形自适应压缩算法,此算法基于地形变化的特征将整数小波变换和限制四叉树三角化方法相结合。高效的计算速度和多分辨率分析的优良特性使得它能够在任何视点下有效地降低小波系数,并且能使用快速更新策略对地形进行实时渲染,小波系数表明了多分辨率的地形变化。模拟结果表明此算法能有效压缩数据,实时连续地渲染海量地形。     

移动最小二乘增量式多视点云数据融合算法

在散乱数据点移动最小二乘曲面拟合的基础上,提出了一种增量式多视点云数据融合算法.将算法中多视点云数据作为对同一物体表面二维流形的一次采样,采样数据中包含匹配误差、冗余和畸变,把多视点云数据融合问题转换为由包含误差的散乱数据点恢复二维流形的过程.对每一幅当前处理的点云,寻找当前点云与已增量式融合的点云数据的重叠部分,在重叠部分数据集上构造移动最小二乘曲面,将重叠部分的每一个在移动最小二乘曲面上的对应点合并到当前已增量式融合的点云数据集中,从而实现了增量式多视点云数据的融合.实验证明,该算法是一种有效的多视点云数据融合算法,并且可从较大匹配误差、噪声、畸变的多视点云数据中获得较好的融合效果.     

桥梁参数化建模系统的虚拟地形及数据组织

结合桥梁参数化3维建模系统的需要,提出快速的虚拟地形生成算法.该算法利用分形理论丰富地形细节,通过四叉树存储不规则三角网,提高点在三角形的检索速度,使用稀疏控制点剖分检索到的三角形,实现桥梁模型和地形的合理叠加;通过点在三角形的查找实现视点与地形的快速碰撞检测,从而控制了视点范围;采用树状结构有效组织地形、天空球和桥梁模型等数据,最终生成以桥梁为主的逼真场景.     

一种面向交互应用的多视点视频编码方案

视点切换是交互式多视点视频应用需要解决的难题之一,该文为此提出一种交互式多视点视频的编码方案。通过消除预测帧之间的相关性,改善视点切换的性能,以共享关键帧和时-空预测编码方式,在时间和空间上去除多视点视频数据的冗余,提高编码效率。该方案不增加任何辅助数据,即可在任意的P帧上进行快速视点切换,具有极低的视点切换延时,并且兼顾了编码效率和单一视点的解码代价。采用H.264/AVC编码器实现该方案,并得到满意的测试结果。     

大数据量三维地形实时可视化的扩展算法

针对大数据量三维地形实时可视化问题,本文在传统实时优化自适应网络(real-time optimal adaptive mesh, ROAM)算法的基础上进行扩展,提出了一种视点相关的适合大数据量三维地形实时绘制的简单高效的算法.该算法是通过基于线性四叉树索引的数据管理模式进行管理和组织数据,并根据地形复杂度的不同对高程数据间隔提取然后渲染地形,从而大大降低了大范围三维地形的复杂度和计算量,同时该算法支持拓扑结构和多分辨率,有效地简化了地形模型的绘制,提高了三维地形实时渲染效率.并用微软基础类(Microsoft Foundation Classes, MFC),结合Open Graphics Library (OpenGL)开发了一个程序实例,进一步验证算法的有效性.     

基于GA-SVM算法永磁同步直线电机变载荷进给位置误差的预测

针对永磁同步直线电机精密进给过程中,受到齿槽效应、端部效应及摩擦力扰动等非线性因素的影响,位置误差难以预测问题,提出了一种基于遗传算法(GA)优化支持向量机(SVM)算法永磁直线电机变载荷位置误差预测模型的方法。通过测量各种情况下永磁直线电机在运动过程中的位置变化情况,利用遗传算法优化支持向量机算法建立预测模型。该模型采用实验台运行的正弦轨迹数据为训练样本,三角波轨迹数据为测试样本。选取各种情形的正弦波轨迹数据和三角波轨迹数据进行仿真预测和验证。以各种情况的正弦波信号的指令位置、指令速度和电流作为模型的输入,以三角波信号的位置误差作为输出。结果表明,经过遗传算法优化支持向量机建立的位置误差预测模型,在拟合和预测精度上要优于未经过算法优化的位置误差预测模型。     

基于GA-SVM算法永磁同步直线电机变载荷进给位置误差预测

针对永磁同步直线电机精密进给过程中,受到齿槽效应、端部效应及摩擦力扰动等非线性因素的影响,位置误差难以预测问题,提出了一种基于遗传算法(GA)优化支持向量机(SVM)算法永磁直线电机变载荷位置误差预测模型的方法。通过测量各种情况下永磁直线电机在运动过程中的位置变化情况,利用遗传算法优化支持向量机算法建立预测模型。该模型采用实验台运行的正弦轨迹数据为训练样本,三角波轨迹数据为测试样本。选取各种情形的正弦波轨迹数据和三角波轨迹数据进行仿真预测和验证。以各种情况的正弦波信号的指令位置、指令速度和电流作为模型的输入,以三角波信号的位置误差作为输出。结果表明,经过遗传算法优化支持向量机建立的位置误差预测模型,在拟合和预测精度上要优于未经过算法优化的位置误差预测模型。     

基于时空冗余及不等错误保护的分布式多视点视频编码容错传输

在分布式多视点视频编码(distributed multi-view video coding,DMVC)数据传输过程中,编码方式不同导致K帧与WZ帧受信道误码影响也不相同,因此提出了一种DMVC整体容错传输框架,针对K帧及WZ帧特性设计了不同的容错保护传输方案并进行有效融合。针对K帧的容错传输问题,首先根据左、右相邻视点的对应K帧,利用DIBR算法产生的空间边信息对丢失块进行初始修复;然后根据K帧同一视点内的相邻已解码帧,生成它的时间参考帧,对K帧的丢失块进行重修复。针对WZ帧的容错传输问题,提出了基于不等错误保护(unequal error protection,UEP)的编码算法,根据不同频带的各个比特面的重要性不同,对低频带、高比特面进行更加合理的码率分配,在不增加编码端复杂度的前提下提高了WZ帧的误码容错性能。实验结果表明:在K帧和WZ帧均出现丢包的情况下(丢包率为5%～15%),相比K帧采用传统的帧内错误隐藏加WZ帧采用参考文献码率的算法,本文方案对视频序列重建图像的BD-PSNR平均提升了2.39～4.68 d B,且随着丢包率的增加,提升效果更加显著。     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.