内编队重力场测量系统轨道参数与载荷指标设计方法

内编队系统通过构造内卫星纯引力轨道完成高精度重力场测量,实现了不依赖于加速度计的重力卫星实施新途径.针对内编队系统轨道参数和载荷指标设计任务,从定性的角度分析了轨道高度、轨道倾角、偏心率等轨道参数的选择原则,以及外卫星定轨精度、内外卫星相对状态测量精度、内卫星非引力干扰抑制精度、系统采样率等载荷指标对内编队重力场测量性能的影响,并建立了这些参数之间的匹配关系.为获取内编队系统轨道参数和载荷指标的定量设计结果,给出了内编队重力场测量数据模拟和反演计算方法.结合轨道参数和载荷指标对重力场测量性能的影响及其匹配关系,提出了由解析推导和数值计算相结合的方法,获取重力场最高反演阶数、大地水准面精度、重力异常精度等重力场测量性能与轨道参数、载荷指标之间的解析关系,并给出了该解析关系的具体数学形式.与解析法、半解析法相比,该公式由解析推导和大量数值计算得到,因而考虑的影响因素更加全面,计算结果更加合理,可用于快速准确设计内编队系统轨道参数和载荷指标.     

Overlapped rectangle image representation and its application to exact legendre moments computation

Linear quadtree is a popular image representation method due to its convenient imaging procedure. However, the excessive emphasis on the symmetry of segmentation, i.e. dividing repeatedly a square into four equal sub-squares, makes linear quadtree not an optimal representation. In this paper, a no-loss image representation, referred to as Overlapped Rectangle Image Representation (ORIR), is presented to support fast image operations such as Legendre moments computation. The ORIR doesn’t importune the symmetry of segmentation, and it is capable of representing, by using an identical rectangle, the information of the pixels which are not even adjacent to each other in the sense of 4-neighbor and 8-neighbor. Hence, compared with the linear quadtree, the ORIR significantly reduces the number of rectangles required to represent an image. Based on the ORIR, an algorithm for exact Legendre moments computation is presented. The theoretical analysis and the experimental results show that the ORIR-based algorithm for exact Legendre moments computation is faster than the conventional exact algorithms.     

基于均值漂移的粒子滤波算法设计及其在导航数据处理中的应用

针对标准粒子滤波算法中存在的计算量大和粒子的权值退化的缺陷,将均值漂移算法和PF算法进行融合,设计基于均值漂移搜索算法的粒子滤波新算法。该算法仍遵从粒子滤波算法的计算框架,基本原理是利用MS算法对粒子的聚类作用,将均值漂移思想融合到粒子滤波算法的重要性采样过程中,对粒子集进行确定性搜索,使每个粒子收敛于局部最优值,这样粒子的状态表示更接近真实的状态分布,因此只需较少的粒子数便可达到未嵌入MS的使用大量粒子数的粒子滤波状态估计的性能,从而在缓解粒子的权值退化的同时提高粒子滤波算法的实时性。大量的数值试验和对GPS/DR组合导航数据处理的结果验证了该方法的有效性。     

与观测方向无关的水平地震动参数计算方法

强震动记录的使用通常不考虑观测方向对于水平地震动参数计算的影响。文中以2008年汶川Ms8.0级地震中绵竹清平台获取的强震动记录为研究对象,对记录进行水平向旋转以模拟观测方向的变化,分析水平向峰值加速度PGA、峰值速度PGV、相对持时DR、绝对持时DA及谱加速度PSA随观测方向的变化情况。结果表明,PGA、PGV及PSA的计算较大依赖于观测方向,而DR和DA则受观测方向影响较小。为此文中提出了一种与观测方向无关的水平地震动参数计算方法,对于计算诸如PGA、PGV等与周期无关的地震动参数时不考虑周期独立;而对于计算诸如PSA等与周期有关的地震动参数时考虑周期独立。     

城市空间智能计算平台研究

该文提出了空间智能平台的概念,阐述了其研究意义和内容,明确了空间智能计算平台核心计算模型的建模对象和目标。在此基础上,分析了宏观数学模型、群体行为模型两种用来构建空间活动模型的建模方法以及适用于空间活动分析的物理环境建模技术。从融合多尺度行为模型、构建城市日常生活模型、验证和校验核心模型以及平衡效率和效果4方面探讨了构建空间智能计算平台的关键技术。从实际功能看,城市空间智能平台是联系宏观复杂问题和微观机制的桥梁,是分析城市问题的工程化实验平台,具有广阔的应用前景。     

可调节经线收敛度和经纬线间隔的伪圆柱投影

令纬度ψ<,j>转换为ψ<,j>后,中央经线方程用一个ψ<,j>的7次幂方程表示,中央经线方程的系数关联着纬线间隔.令经度λ<,i>转换为ξ<,i>后,赤道方程用一个ξ<,i>的7次幂方程表示,赤道方程的系数关联着经线间隔.经线的收敛度由经线方程的收敛系数调节.由此构建可调节经线收敛度和经纬线间隔的伪圆柱投影.用一实例...     

Modelling real earthquake activity with reverse engineering based on evolutionary computation methods

Hazard assessment of dangerous natural phenomena is critical because of their evident results concerning loss of human life and property, especially in dense populated areas. Earthquakes are probably the most devastating phenomenon since their immediate and long-term consequences are severe. This study is focused on the earthquake data analysis in different regions of Greece, characterised by different seismicity levels. In specific, a novel model is proposed based on evolutionary computation methods, such as symbolic regression by genetic programming and genetic algorithms in order to elucidate preliminary hidden mathematical relations and patterns found in the seismological signals under study. Furthermore, the model is calibrated using reverse engineering and closes the loop from the data collection to initial hypothesis. In this way, the model formation is achieved. The presented simulation results qualitatively and quantitatively reveal some of the fundamental characteristics of each studied geographical region located in Greece that stem from its geodynamic properties.     

Shuffled Complex Evolution model calibrating algorithm: enhancing its robustness and efficiency

Shuffled Complex Evolution—University of Arizona (SCE‐UA) has been used extensively and proved to be a robust and efficient global optimization method for the calibration of conceptual models. In this paper, two enhancements to the SCE‐UA algorithm are proposed, one to improve its exploration and another to improve its exploitation of the search space. A strategically located initial population is used to improve the exploration capability and a modification to the downhill simplex search method enhances its exploitation capability. This enhanced version of SCE‐UA is tested, first on a suite of test functions and then on a conceptual rainfall‐runoff model using synthetically generated runoff values. It is observed that the strategically located initial population drastically reduces the number of failures and the modified simplex search also leads to a significant reduction in the number of function evaluations to reach the global optimum, when compared with the original SCE‐UA. Thus, the two enhancements significantly improve the robustness and efficiency of the SCE‐UA model calibrating algorithm. Copyright © 2008 John Wiley & Sons, Ltd.     

A parallel evolutionary strategy based simulation–optimization approach for solving groundwater source identification problems

Groundwater characterization involves the resolution of unknown system characteristics from observation data, and is often classified as an inverse problem. Inverse problems are difficult to solve due to natural ill-posedness and computational intractability. Here we adopt the use of a simulation–optimization approach that couples a numerical pollutant-transport simulation model with evolutionary search algorithms for solution of the inverse problem. In this approach, the numerical transport model is solved iteratively during the evolutionary search. This process can be computationally intensive since several hundreds to thousands of forward model evaluations are typically required for solution. Given the potential computational intractability of such a simulation–optimization approach, parallel computation is employed to ease and enable the solution of such problems. In this paper, several variations of a groundwater source identification problem is examined in terms of solution quality and computational performance. The computational experiments were performed on the TeraGrid cluster available at the National Center for Supercomputing Applications. The results demonstrate the performance of the parallel simulation–optimization approach in terms of solution quality and computational performance.