The Geology and Habitability of Terrestrial Planets: Fundamental Requirements for Life

The current approach to the study of the origin of life and to the search for life elsewhere is based on two assumptions. First, life is a purely physical phenomenon closely linked to specific environmental conditions. From this, we hypothesise that when these environmental conditions are met, life will arise and evolve. If these assumptions are valid, the search for life elsewhere should be a matter of mapping what we know about the range of environments in which life can exist, and then simply trying to find these environments elsewhere. Second, life can be clearly distinguished from the non-living world. While a single feature of a living organism left in the rock record is not always sufficient to determine unequivocally whether life was present, life often leaves multiple structural, mineralogical and chemical biomarkers that, in sum, support a conclusion that life was present. Our understanding of the habitats that can sustain or have sustained life has grown tremendously with the characterisation of extremophiles. In this chapter, we highlight the range of environments that are known to harbour life on Earth, describe the environments that existed during the period of time when life originated on Earth, and compare these habitats to the suitable environments that are found elsewhere in our solar system, where life could have arisen and evolved.     

农村人力资源开发与当前农村经济发展的关系分析

结合新增长理论 ,对农村经济发展进行历史分析 ,认为我国农村经济发展的障碍在于农村人力资本匮乏。因而要解决“三农”问题 ,使农村经济持续、健康、稳定地发展 ,当前最紧迫的任务是千方百计开发农村人力资源 ,其中尤其是要搞好农村各种教育 ,形成雄厚的农村人力资本 ;进而提出了相应的政策建议。     

适于低轨卫星IP网络的单核共享树组播算法(英文)

为了解决低轨卫星IP网络中现有典型源组播算法的信道资源浪费问题,本文提出了一套单核共享树组播算法,即核心群合并共享树(CCST)和加权核心群合并共享树(w-CCST)算法。CCST 算法包括动态近似中心(DAC)选核方法和核心群合并组播路径构建方法。DAC方法专为周期、规律运动的低轨卫星网络提出,不需要复杂的星上计算。在核心群合并方法中,以核节点作为初始核心群,通过核心群和剩余组成员的最短路径方法逐步扩展直至整棵组播树构建完成,从而使得组播树的树代价最小,大大提高了网络的带宽利用率和组播传输效率。w-CCST 算法中所提出的加权因子可以调整树代价和端到端传播时延之间的折衷程度,因此,可以通过调整加权因子来适度增大树代价、降低端到端传播时延以支持某些端到端时延要求苛刻的实时组播业务。最后,与低轨卫星 IP 网络中典型算法进行了性能比较,仿真结果说明,CCST 算法的平均树代价比其它算法显著降低,w-CCST 算法的平均端到端传播时延小于 CCST 算法。     

在地球扁率摄动下的卫星编队飞行控制

卫星编队飞行的难点之一是在干扰力环境下控制队形。采用了一种基于线性二次调节器(LQR)的最优控制方法，对低轨道地球卫星所受的地球扁率摄动(J2力)加以模拟，并在模拟的地球低轨道J2力环境中。对几种卫星编队进行了模拟控制，从控制精度和能量消耗的角度对控制方法进行了分析，提出了卫星编队飞行中相对距离控制和绝对距离控制需要注意的问题。     

Core-based Shared Tree Multicast Routing Algorithms for LEO Satellite IP Networks

A new core-based shared tree algorithm, viz core-cluster combination-based shared tree （CCST） algorithm and the weighted version （i.e. w-CCST algorithm） are proposed in order to resolve the channel resources waste problem in typical source-based multicast routing algorithms in low earth orbit （LEO） satellite IP networks. The CCST algorithm includes the dynamic approximate center （DAC） core selection method and the core-cluster combination multicast route construction scheme. Without complicated onboard computation, the DAC method is uniquely developed for highly dynamic networks of periodical and regular movement. The core-cluster combination method takes core node as the initial core-cluster, and expands it stepwise to construct an entire multicast tree at the lowest tree cost by a shortest path scheme between the newly-generated core-cluster and surplus group members, which results in great bandwidth utilization. Moreover, the w-CCST algorithm is able to strike a balance between performance of tree cost and that of end-to-end propagation delay by adjusting the weighted factor to meet strict end-to-end delay requirements of some real-time multicast services at the expense of a slight increase in tree cost. Finally, performance comparison is conducted between the proposed algorithms and typical algorithms in LEO satellite IP networks. Simulation results show that the CCST algorithm significantly decreases the average tree cost against to the others, and also the average end-to-end propagation delay ofw-CCST algorithm is lower than that of the CCST algorithm.     

基于空中发射点的在线诸元计算方法研究

现代战争的快节奏要求弹道导弹具有快速机动发射能力,采用伪卫星组合制导的弹道导弹随机快速发射需要诸元在线计算。提出了一种基于空中发射点的在线诸元计算方法,该方法具有计算量小、制导方法误差小的特点,可用于陆基机动弹道导弹或潜射弹道导弹的快速发射。     

双频双星座地基增强系统精度和完好性算法

针对单频单星座地基增强系统（GBAS）无法满足飞机III类精密进近与着陆导航性能需求的问题，提出了将北斗导航卫星系统（BDS）与全球定位系统（GPS）进行融合，构建一种新型的基于GPS/BDS的双频双星座GBAS。首先，分析了GBAS的工作原理，并对Hatch滤波器的误差进行了分析，给出了一种适用于双频GBAS的无码载偏离载波相位平滑伪距算法；然后，对机载完好性算法进行了研究，给出了H0和H1假设下的机载保护级计算方法；最后，进行了系统验证实验，实验结果表明，单星座GBAS不能满足飞机III类精密进近与着陆导航的性能需求，GPS和BDS融合后可见卫星个数得到提升，优化了卫星几何分布，进而使得系统的可用性由80.6081%提升到大于99.9999%。     

基于空间卫星综合应用系统的天气预报业务框架构建

围绕空间卫星综合应用系统，在介绍天气预报业务系统基本框架的基础上，着重分析了天气预报业务化框架、网络的技术特点，以及天气预报业务的一些技术和方法．     

基于测量确定性或诊断性参数对剩余使用寿命的判定

在测量确定性或诊断性参数基础上,介绍了发生故障前在使用寿命的扩散分布过程中对剩余寿命评估的方法。在使用中当不能测量寿命(确定性)参数,但能测量某些诊断性参数(一个或几个),而这些参数能间接的反映了项目寿命的消耗时,那么必须进行预先研究适应于寿命(确定性)参数极限值的诊断性参数极限值,然后就能按照使用中测量的诊断性参数来预测该项目的剩余使用寿命。在这种情况下提出了剩余使用寿命预测的数学模型。     

卫星星座优化设计的分布式遗传算法

遗传算法在区域卫星星座的优化设计中可以得到很好的结果。但使用遗传算法时，往往计算量很大，星座规模较大时会带来计算上的困难。充分利用计算机网络的空闲计算资源进行分布式计算可以解决这一问题，文章提出了相应的分布式计算模型，给出了实现方法，算例表明分布式遗传算法效率很高，该分布式计算方法也可以推广到其他应用领域。