基于四元数的空间全方位算法研究

基于误差四元数的概念,研究了四元数扰动对姿态角和四元数转换精度的影响,提出了姿态角和四元数的全方位转换算法.该算法将姿态角和四元数的转换范围由-90°~90°的传统转换空间拓展到-180°~180°空间,使基于全角度算法的姿态控制比非全角度算法有抗扰动的能力,并通过论证和仿真证明了算法的正确性.     

引信球转子运动的四元数数学模型数值仿真

为寻求准确高效地描述引信球转子运动规律的数值仿真算法,分别采用Runge-Kutta方法和Gear方法,利用四元数数学模型对两种引信球转子运动进行了数值仿真。结果表明:与强非线性的欧拉角数学模型相比,线性的引信球转子四元数模型能避免章动角趋近于0°或180°时的奇异性问题;采用Runge-Kutta方法耗用机时为Gear方法的1/3左右。     

基于四元数法的空空导弹数学模型建模研究

空空导弹的运动方程通常用一组基于欧拉角的微分方程来表示,但欧拉角方程有时具有奇异性,会使得微分方程不可求解,而采用四元数法则可以有效克服这一问题。本文以现有基于欧拉角的空空导弹六自由度数学模型为基础,用导弹各个坐标系之间的转换关系以及四元数来表示刚体的平移和转动,把已知的欧拉角导弹模型转换为四元数导弹模型。以样例导弹为对象,分别将欧拉角模型和四元数法模型在Matlab环境下进行了仿真,结果表明四元数法模型与欧拉角模型的仿真结果一致,并且四元数法模型具有更快的运行速度。     

Unity3 D随机寻路算法设计

在深入研究欧拉角与四元数的转换、插值运算等相关数学理论的基础上,设计了一个随机寻路算法,通过位置插值运算的方式对游戏对象进行逐帧位置更新,通过欧拉角与四元数相互转换的方式来完成游戏对象的角度更新,从而成功解决了游戏对象在逐帧移动过程中的位置和角度匹配问题,实现了游戏对象在场景中的随机游走功能.该算法能有效应用在各类场景游戏开发中,简化游戏的开发进程.     

坐式垂直起降无人机的一种姿态解算算法的设计

固定翼模式水平飞行的坐式垂直起降无人机克服了传统固定翼无人机起降条件要求高的缺点,继承了其总体效率高的优点,拥有巨大的发展潜力和非常广阔的应用前景。坐式垂直起降无人机在起降阶段姿态变化范围大,所使用的姿态传感器在俯仰方向的角度变化超过90°时,根据四元数转换出的欧拉角会出现奇异点,即万向节死锁。从解算算法出发,提出了一种更改旋转顺序的方法,避免奇异点出现。结果表明,此方法可以很好地应用在垂直起降无人机的姿态解算上。     

立方系材料织构精确分析方法

为了解决由于织构漫散度给织构分析带来的估算误差,以达到对材料织构进行更为精确的分析,采用从极图求算ODF(orientation distribution function)中的"二步法"作为基本原理,选择以1°为最小间隔单位划分欧拉空间,对欧拉空间所有取向点的取向密度进行了求算,并建立了相应的分析系统. 利用该分析系统对鞍钢生产的IF钢冷轧和退火样品进行了计算,并与已成熟的以欧拉角5°为最小间隔单位的ODF求算系统对比. 结果表明:以欧拉角1°为最小单位的ODF取向密度分析系统比以欧拉角5°为最小单位的ODF取向密度分析能更确切地表示织构的分布情况.     

基于最小二乘法MEMS惯性传感器姿态解算算法

针对MEMS惯性传感器在测量时出现误差不稳定和外界磁场变化所造成的姿态角误差较大问题,提出一种基于最小二乘法MEMS惯性传感器姿态解算算法.采用静态六位置法对三轴加速度计标定,对三轴加速度计建立误差模型,利用最小二乘法确定误差参数.根据欧拉角法中倾斜角和航向角分开求解特点,减小磁场变化干扰,再对欧拉角中存在的奇异值问题进行改进,分为一般姿态值和奇异值状态姿态值两种滤波模式.实验结果证明,通过对三轴加速计的标定补偿和欧拉角的奇异值问题改进后得到的姿态角精度高,并且在遇到磁场变化时稳定性优于四元数法,不会出现奇异值.     

克服欧拉方程奇异性的方法研究

通过一个具体算例对四元数法和双欧法进行了研究和比较,澄清了四元数法应用中的几个问题,并且发现双欧法比四元数法能更好地克服欧拉方程的奇异性。     

基于四元数的近景摄影测量相对定向的研究

本文简要叙述了近景摄影测量相对定向时采用四元数构成旋转矩阵的方法,分析了四元数法与传统的欧拉角法的区别,说明了由四元数构成的旋转矩阵具有很强的收敛性。     

欧拉恒等式的推广

受用四元数证明欧拉恒等式的启发,利用八元数导出了一个恒等式,从而推广了欧拉恒等式--即欧拉四平方定理.     

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.