提高陆地导航仪定位精度的一种新方法

在地面上测量车辆行驶距离的方法有两种:这就是利用里程计或加速度计.里程计测量车轮的转数并输出一系列脉冲,但里程计的刻度系数易受路况的影响,需要不断地进行修正,而加速度计具有短时间内高精度测量的优点.本文主要叙述了里程计与加速度计组合导航的设计原理、公式及数字仿真结果。     

陆用捷联惯导系统中里程计刻度因子的在线辨识

提出陆用捷联惯导系统中里程计刻度因子的在线辨识算法．该算法利用捷联惯导系统在初始对准结束后，刚转入导航工作状态的短时间内，惯导解算精度高的特点，通过加速度计的测量值，采用渐消记忆最小二乘递推算法对里程计的刻度因子进行在线辨识．仿真试验表明，该算法有较强的工程实用性，能有效地解决里程计测量路程的误差积累问题，从而提高整个陆用捷联惯导系统的定位精度．     

车载GPS/DR组合导航系统的研究及其滤波算法

给出了基于ＧＰＳ与ＤＲ组合的车辆导航系统的设计，建立了该系统的数学模型，利用卡尔曼滤波器对各子系统进行滤波处理，最后对系统进行信息综合及传感器误差校正．试验结果表明，该系统具有良好的导航与定位性能     

车载GPS／DR组合导航系统的厂家及其滤波算法

给出了基于ＧＰＳ与ＤＲ组合的车辆导航系统的设计，建立了该系统的数学模型，利用卡尔曼滤波器对各子系统进行滤波处理，最后对系统进行信息综合及传感器误差校正，试验结果表明，系统具有良好的导航与定位性能。     

四阶龙格库塔法在激光陀螺捷联惯性导航系统中的应用

在激光捷联惯性导航系统中,应用四阶龙格库塔法求解载体速度增量,有效地解决了载体转动过程中三轴陀螺角速度变化对速度的影响,通过与三轴加速度计实测的X,Y,Z方向的加速度叠加,大大减少了导航中速度的累积误差,保证了捷联惯性导航系统在地理坐标系东北天中实时测量载体的三轴运动速度,以及载体航向、横滚、俯仰的快速实时输出,提高了纯惯性导航系统姿态精度和定位精度.动静态寻北、导航实验及捆绑载体测量其姿态跟踪性能的测试结果表明,寻北精度CEP小于0.5密位,横滚、俯仰精度误差小于0.3密位,里程计组合导航精度误差小于1‰.     

车载GPS/DR/电子地图组合定位导航研究

针对单一导航定位手段的精度和使用范围在车辆导航定位技术中的局限性,提出了采用GPS、DR与电子地图组合导航的方案.经过对GPS/DR/电子地图组合导航定位方法地深入研究,表明GPS/DR电子地图组合导航是一种较为理想的车辆导航方式,它克服了GPS信号受阻时定位间断或失效的缺点,又避免了航位推算定位误差随时间的积累,提高了导航定位的精度并扩展了使用范围.     

车载GPS/DR/GIS组合导航系统改善定位精度仿真研究

本文提出了ＧＰＳ、ＤＲ和ＧＩＳ相结合的新型车辆导航系统，建立了该系统的数学模型，并对其导航定位精度，用１３个状态推广卡尔曼滤波进行了模拟仿真分析，理论和实验结果表明，此组合导航系统，提高了车辆导航定位精度和工作可靠性。     

霍尔里程计性能测试

在接近实际工况时,对研制出的霍尔里程计输出特性进行测试,检测霍尔里程计的各项功能、性能及环境适应性等特征,确保里程计在各种工况下的性能稳定、持久、可靠、适应、兼容性等各项功能正常.结果显示霍尔里程计实测值满足了设计的技术指标,最终满足INS/霍尔里程计组合导航系统精准定位的要求;选取闭合路线进行行车测试,在未加载与加载霍尔里程计两种情况下,分别测试其组合导航系统的导航能力,结果发现未加载霍尔里程计时,导航轨迹发生的漂移较大;而加载霍尔里程计时,导航能力大大提高,行驶轨迹相比未加载里程计时的漂移量要小的多,基本符合实际的行车路线.从而验证出在无GPS状态下加载霍尔里程计使得INS/霍尔里程计组合导航系统精准度得以提升,提高了整个系统的定位精度和导引可靠性.     

陆用捷联惯导系统/里程计自主式组合导航技术

利用里程计辅助捷联惯导系统构成一种自主式组合导航系统.用捷联惯导系统解算出的速度和里程计所测量的速度之差作为观测量,利用闭环卡尔曼滤波技术进行误差估计与校正,并给出了仿真结果.仿真结果表明,该组合导航系统可有效地减小速率、经度和纬度、航向角和姿态角及航迹推算下的位置等导航参数的累积误差.     

基于EKF的DR/激光测距组合导航算法研究

航位推算（Dead Reckoning,DR）是一种常用的导航定位技术,其推算过程是一个累加过程,传感器的误差随时间的延长而积累,为此,将航位推算与激光测距组合起来用于智能车辆导航,确保系统在任何时候都能为运动智能车辆提供较为准确的导航信息。扩展卡尔曼滤波（Extended Kalman Filter,EKF）为一种非线性滤波器,是智能车辆组合导航系统中一种有效的数据融合方法。本文将EKF方法用于智能车辆组合导航的状态估计,仿真实验结果表明,EKF滤波能够有效地提高智能车辆的导航精度。     

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.     

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).     

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.     

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.