基于改进“当前”统计模型和AKF的机动目标跟踪

采用"当前"统计模型设计Kalman滤波算法,实现对机动目标的自适应跟踪;并针对"当前"统计模型对机动目标跟踪中存在的缺陷,提出改进的"当前"统计模型,根据滤波估计值对最大加速度进行自适应调整,使得系统噪声方差随着目标运动情况自适应变化;此算法在没有增加任何计算量的基础上有效提高了机动目标的跟踪性能.通过对实际交通视频的仿真实验验证了算法的有效性.     

机动目标的多模型跟踪与预报算法

以文献 [1]所给严格的最小二乘递推 (R2 LS)算法为基础 ,并结合多模型和模型重新初始化技术 ,提出了一种机动目标的多模型跟踪与预报 (MMTP)算法 .由于该算法中的大量运算可离线完成 ,因而极大地减少了在线计算量 ,使得MMTP算法能满足实时要求 .     

一种适于非线性非高斯目标跟踪的MRIMMPF算法

为解决粒子滤波应用到IMM算法时计算量过大的问题,融合交互式多模型和粒子滤波,提出了一种采用多速率方法的交互式多模型粒子滤波(multirate interacting multiple model particle filter,MRIMMPF)算法.该算法采用多模型结构来跟踪任意机动的目标;使用一种3模型、one-third速率/全速率跟踪算法,一个one-third速率模型处理非机动或微弱机动,2个全速率模型用于机动模式,以处理非线性、非高斯问题.仿真结果表明,MRIMMPF算法在性能上并不低于交互多模型粒子滤波(IMMPF)算法,但是计算量明显减小.     

一种强机动目标自适应跟踪算法

针对强机动目标跟踪精度不高的问题,提出了一种强机动目标自适应跟踪算法(HMIMM-CV/CAT)。首先通过机动检测区别目标的机动性能,分别应用Kalman滤波和交互多模算法对目标进行跟踪。其次对机动段交互多模算法,给出一组转弯模型离散模型集,在目标机动时通过角速度估计在离散模型集中遴选出一个最匹配的模型参加交互计算,使模型更加逼近目标真实运动模式,且不增加参与交互运算模型数量。蒙特卡罗仿真结果表明,该算法与几种类似算法相比,更加适用于强机动目标。     

基于IMM算法的高机动目标航迹滤波在ADS-B中的应用

为提高ADS-B航迹报文的准确性,采用交互多模型算法通过对航迹建立与实际运动轨迹相匹配的模型,来降低建模误差,从而提高航迹追踪和预测的准确度。高精度的报文是ADS-B系统向周围设备实时广播的基本保障,传统的单一机动目标建模和滤波方式运动模式高频率切换时会引起较大误差从而导致报文信息的丢失或错误。本文引入交互式多模型(IMM)算法建立多个常用目标运动模型并模拟2组机动目标高频切换的飞行状态,最后通过与单模型的经典卡尔曼滤波仿真结果对比验证IMM算法在高机动目标建模和滤波方面的优越性。     

稳健的交互多模型转移概率选择算法

交互多模算法(IMM)是机动目标跟踪中最常使用的方法之一,但其计算量大、过程较复杂.针对交互多模型转移概率矩阵选取问题,结合目标机动检测理论,提出稳健的交互多模型转移概率选择算法.该方法通过判别机动和非机动目标,确定转移概率矩阵主对角线元素值,并进行了仿真实验.结果显示,新方法简便可靠,提高了总体的滤波效果.     

主/被动雷达模糊自适应IMM融合跟踪算法

在主/被动雷达复合制导背景下,提出一种基于模糊自适应交互多模型(IMM)的分布式融合算法。该算法将交互多模型和模糊推理的优点相结合,通过模糊推理机制在线调节模型集合中部分模型的参数,使这些模型对不同的目标机动模式有更强的自适应能力。避免了传统交互多模型算法的模型冲突问题,大大减少了计算量。数字仿真结果表明了算法的有效性。     

微小卫星姿态确定系统多信息融合滤波技术

采用微小卫星姿态动力学,并针对太阳敏感器/磁强计/卫星导航系统(GPS)接收机多姿态信息融合的特点,提出一种基于融合反馈模式的改进联邦滤波姿态确定方法,各子滤波器只完成量测更新,由主滤波器完成时间更新与预测信息的分配.给出了由四元数描述卫星姿态的误差状态方程和各子系统的量测方程,基于磁强计测量信息,对微小卫星的主要干扰源剩磁进行建模.仿真结果分析表明:基于剩磁建模的姿态动力学模型可有效提高姿态确定的精度;改进联邦滤波算法减少了系统的计算量,保证了可靠性.     

基于多模型GGIW-CPHD滤波的群目标跟踪算法

针对伽马高斯逆威夏特-概率假设密度(GGIW-CPHD)滤波算法跟踪机动群目标误差较大的问题,提出基于最适高斯近似(BFG)和强跟踪的多模型GGIW-CPHD滤波的群跟踪算法.首先,在对群目标量测分割的基础上,采用BFG方法实现CPHD预测阶段的多模型融合.其次,利用强跟踪滤波(STF)中的渐消因子来修正GGIW分量的预测协方差矩阵.最后,在CPHD更新阶段完成群质心和扩展状态估计的基础上,利用多个模型对应的似然函数完成模型概率的更新.实验结果表明:所提算法能够在GGIW-CPHD框架下实现多个模型的交互,有效降低机动阶段时群目标的状态估计误差,并能有效处理群目标的合并和衍生情况.     

机动目标空间群生成算法

提出了一种机动目标的空间群生成算法,该算法的思想是定义空间群目标间的多种特征相似度,通过一级融合获得的信息,计算目标多种特征相似度矩阵并融合求得合群结果。该方法用特征相似度空间属性计算代替了测量空间的目标属性计算,提高了可靠性。该算法的时间复杂度仅为O(n2)。仿真实验表明,该算法具有较高的合群效率,结果可信。     

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.