长江中下游地区夏季降水的水汽路径的客观定量化研究

本文根据中国台站降水资料和NCEP/NCAR再分析资料, 研究了长江中下游地区夏季降水的水汽路径并给出了客观定量化的定义。结果表明:(1)影响长江中下游地区夏季降水的水汽路径主要是来自南界的水汽输送, 据此定义了南界水汽路径的面积、中心强度、向东延伸格点的位置以及边界强度等指标;(2)对各个指标的时间演化特征进行了分析, 南界水汽路径的面积指标和中心强度指标有下降的趋势, 各个指标在20世纪90年代前后都有一个明显的转折, 面积指标、中心强度指标、边界纬向强度指标都有明显的年代际的变化;(3)对各指标与中国夏季降水和前冬海表温度进行相关分析, 夏季南界水汽路径影响我国不同地区的降水, 南界水汽路径的面积指标、中心强度指标与前一年冬季西太平洋的海温呈显著负相关, 与赤道中太平洋和东太平洋前一年冬季的海温呈显著正相关, 即前冬东太平洋发生El Ni?o时, 有利于夏季西太平洋水汽输送增强, 进而有利于长江中下游地区夏季降水偏多。     

基于SAR数据的森林生物量估测研究进展

森林生物量是地表碳循环研究的重要组成部分,对其进行准确估测对区域乃至全球的森林状况和气候环境问题有重要意义.合成孔径雷达(SAR)以其独特的成像机制、全天候全天时的成像特点以及对森林冠层的穿透能力,在森林资源调查和森林制图研究领域发挥着巨大的作用.该文首先总结了林业上传统的森林生物量估测方法和基于光学遥感和激光雷达(LiDAR)数据的森林生物量估测方法;然后重点阐述了利用SAR后向散射(不同极化方式)、干涉相干性及极化干涉等信息进行森林生物量反演的方法;最后总结了利用SAR数据进行森林生物量估测的发展趋势.     

Study on applying optimal path to land valuation

As an important role in the urban land price system, the basic land price appraisal directs and reflects all kinds of land price in the real estate market. Using geographic information systems (GIS) with algorithms and powerful analysis functions to valuate land will improve the rationality and convenience of land valuation. The objective of the study on basic land price using the optimal path algorithm is to decrease the manmade error, enhance automatization, avoid make inconvenience by roadblock object.     

An optimum vehicular path algorithm for traffic network based on hierarchical spatial reasoning

Human beings’ intellection is the characteristic of a distinct hierarchy and can be taken to construct a heuristic in the shortest path algorithms. It is detailed in this paper how to utilize the hierarchical reasoning on the basis of greedy and directional strategy to establish a spatial heuristic, so as to improve running efficiency and suitability of shortest path algorithm for traffic network. The authors divide urban traffic network into three hierarchies and set forward a new node hierarchy division rule to avoid the unreliable solution of shortest path. It is argued that the shortest path, no matter distance shortest or time shortest, is usually not the favorite of drivers in practice. Some factors difficult to expect or quantify influence the drivers’ choice greatly. It makes the drivers prefer choosing a less shortest, but more reliable or flexible path to travel on. The presented optimum path algorithm, in addition to the improvement of the running efficiency of shortest path algorithms up to several times, reduces the emergence of those factors, conforms to the intellection characteristic of human beings, and is more easily accepted by drivers. Moreover, it does not require the completeness of networks in the lowest hierachy and the applicability and fault tolerance of the algorithm have improved. The experiment result shows the advantages of the presented algorithm. The authors argued that the algorithm has great potential application for navigation systems of large-scale traffic networks.     

A fewest-turn-and-shortest path algorithm based on breadth-first search

Many cognitive studies have indicated that the path simplicity may be as important as its distance travelled. However, the optimality of paths for current navigation system is often judged purely on the distance travelled or time cost, and not the path simplicity. To balance these factors, this paper presented an algorithm to compute a path that not only possesses fewest turns but also is as short as possible by utilizing the breadth-first-search strategy. The proposed algorithm started searching from a starting point, and expanded layer by layer through searching zero-level reachable points until the endpoint is found, and then deleted unnecessary points in the reverse direction. The forward searching and backward cleaning strategies were presented to build a hierarchical graph of zero-level reachable points, and form a fewest-turn-path graph (G*). After that, a classic Dijkstra shortest path algorithm was executed on the G* to obtain a fewest-turn-and-shortest path. Comparing with the shortest path in Baidu map, the algorithm in this work has less than half of the turns but the nearly same length. The proposed fewest-turn-and-shortest path algorithm is proved to be more suitable for human beings according to human cognition research.     

The development of integrated terrestrial and marine pathways in the Argo-Saronic region,Greece

Least cost path applications can be a powerful tool for understanding connectivity across a landscape. A limitation to this method is its difficulty in integrating terrestrial, marine, and cultural factors – all of which would have been at play in the prehistoric Aegean. This study looks at a method of modeling pathways that integrates major factors (land, sea, and culture) that would be in play while considering medium- to long-distance travel in the Aegean. This test case explores the possible relationships between proposed routes for communication and identified coastal sites with parameters modeled in geographic information system that affect travel in cultural, marine, and terrestrial contexts. The methods presented have significance beyond the Late Bronze Age Aegean. The development of a methodology that incorporates marine, cultural, and terrestrial environments provides a mechanism by which specific hypotheses regarding complex communication routes may be addressed in regions of the world where there is an intensive interplay between terrestrial and marine geographies.     

宁德一号井数字化气氡干扰因素分析研究

对宁德一井数字化气氡观测资料分析研究结果显示,恒流泵和脱气装置的正常与否对于获得真实可靠的观测结果具有重要作用,保障气氡观测仪器的正常是数字化气氡观测的重要环节之一.研究结果表明,宁德一号井数字化气氡变化特征主要受气温、水位的影响,分析和排除这些因素的影响是数字化气氡观测资料分析和应用的基础.     

红山地震台震相到时准确测定

利用工具软件对选取的红山地震台波形数据进行分析处理,从波形包含的频率成分特征上可以区分地脉动、干扰、地震;利用Fourier变换、滤波、复时谱分析、高斯小波分析、莫莱小波分析、DB小波分析等手段,综合分析处理可准确标注地震震相.     

格尔木地震台前兆观测干扰分析

对格尔木地震台2008-2012年各前兆测项干扰进行分析,认为环境干扰主要是雷电和气压突变;关闭自流井泄流口、仪器的现场维护或房屋维修、调零和月度标定等引起人为干扰;观测技术系统干扰包括各种原因的重启仪器和开机冲击、供电和仪器设备故障、线路干扰等.     

关键路径法在地震监测设施建设定额编制中的应用

从项目管理角度出发,介绍关键路径法在项目管理中应用的基本原则和方法,并在《地震监测设施建设标准定额体系研究》项目管理中实际应用,不仅在计划制定期间求得工期、资源、成本的优化,而且在计划的执行过程中,通过信息反馈,进行有效的监督、控制和调整,保证项目在预定期望中的目标实现,通过识别并严格执行关键路径,提高项目管理的效率,压缩项目实施进度.