数字化地图印刷一种随机挂网计算模型

基于彩色图像像素3刺激值与相应网点面积率之间的α幂修正的Neugebauer方程,建立由常规的调幅网为基础的调频挂网计算模型,以此实现分色胶片随机挂网     

Long-term behavior and statistical characterization of BeiDou signal-in-space errors

GPS Solutions - We derive orbit and clock errors for BeiDou satellites from March 1, 2013, to September 30, 2016 by comparing broadcast ephemerides with the precise ephemerides produced by Wuhan...     

An enhanced approach for surface flow routing over drainage‐constrained triangulated irregular networks

The accuracy and efficiency of the simulations in distributed hydrological models must depend on the proper estimation of flow directions and paths. Numerous studies have been carried out to delineate the drainage patterns based on gridded digital elevation models (DEMs). The triangulated irregular network (TIN) has been increasingly applied in hydrological applications due to the advantages of high storage efficiency and multi‐scale adaptive performance. Much of the previous literature focuses mainly on filling the depressions on gridded DEMs rather than treating the special cases in TIN structures, which has hampered its applications to hydrological models. This study proposes a triangulation‐based solution for the removal of flat areas and pits to enhance the simulation of flow routing on triangulated facet networks. Based on the drainage‐constrained TIN generated from only a gridded DEM by the compound point extraction (CPE) method, the inconsistent situations including flat triangles, V‐shape flat edges and sink nodes are respectively identified and rectified. The optimization algorithm is an iterative process of TIN reconstruction, in which the flat areas are generalized into their center points and the pits are rectified by embedding break lines. To verify the proposed algorithm and investigate the potential for flow routing, flow paths of steepest descent are derived by the vector‐based tracking algorithm based on the optimized TIN. A case study of TIN optimization and flow path tracking was performed on a real‐world DEM. The outcomes indicate that the proposed approach can effectively solve the problem of inconsistencies without a significant loss in accuracy of the terrain model.     

大跨度三塔斜拉桥主塔施工测量技术研究

蒙华铁路洞庭湖大桥是世界最大跨度的三塔铁路斜拉桥,对大桥主塔的测量精度要求极高。本文主要介绍了蒙华铁路洞庭湖三塔斜拉桥主塔的施工测量控制技术,针对斜拉桥塔座、塔柱、索导管等关键结构的控制测量,结合洞庭湖大桥的工程施工特点进行研究,并对三维极坐标放样及全站仪天顶测距法进行精度分析。     

历史时期(1765-1980年)西藏水旱雪灾规律的探讨

本文利用近千份藏文灾情历史档案和清政府驻西藏办事大臣有泰的日记和联豫的奏稿,以及西藏气象观测记录(1951—1980年),对西藏高原历史时期的水、旱、雪灾作了初步探讨,主要结论如下: 1.近百年来藏南的水旱灾是交替出现的,有三个多水期(1883—1906,1916—1934,1947—1962)和三个干旱期(1907—1915,1935—1946,1963—1980)。干旱期有逐渐加长的趋势。 2.西藏除了有变干的总趋势外,水旱灾还有明显的3.8—2.6年的周期。这与普遍存在的“准两年脉动”周期大体上一致。 3.藏南农区的降水量即使高于常年的一倍也不易形成洪水泛滥和大面积的内涝,但年降水量比常年少100mm以上就可造成严重干旱,农业生产大幅度减产。 4.造成西藏干旱的原因很多也很复杂,除高原气候近期有变干暖的总趋势外,近20年来水浇地和有效灌溉面积的扩大,以及农作物的种植比例不适当,象过份扩大冬小麦种植面积等亦会造成农业干旱。 5.19世纪以来,藏北高原共发生15次严重大雪灾,其中尤以1828—1829年,1927—1928年,1887—1888年三次雪灾最为严重。但近50年,发生的雪灾较过去有所减轻。不过,1967—1968年雪灾也较为严重。     

地理空间关系描述与集成推理

地理要素的空间关系在GIS空间数据建模、空间分析、地图自动综合等方面起着重要的作用,研究如何快速判断要素间空间关系是否发生变化,从而有效维护空间关系具有重要的科学意义.本文对目前现有的有关地理空间关系描述及其集成推理的研究成果进行了综合分析与分类,分析了它们的适应性与特点,并就本研究方向存在的问题和今后需要解决的问题提出了一些看法和思路.     

自适应Lp估计及其在SLR数据预处理中的应用

本文简要介绍了自适应Ｌｐ估计的有关理论和求解方法，并对ＳＬＲ数据的测量误差作了统计分析。发现ＳＬＲ数据的测量误差服从ｐ值不定的ｐ范分布。本文ＳＬＲ数据预处理实例表明自适应Ｌｐ估计能给出比ＬＳ估计更为稳健有效的拟合参数。当观测值粗差高达６６％时，自适应Ｌｐ估计仍能给出可靠的拟合参数，效果明显优于传统的ＬＳ估计。     

地形图数字化快速修测系统

本文论述了建立利用多种资料进行地形图数字化快速修测系统的基本原理及其基本功能。利用坐标变换和整体平差的方法，有效地解决了各种控制资料的坐标系不同和精度不一致的问题，确保了修测精度。     

航空摄影最佳曝光量的选择

分解力是评定影象质量的重要指标。本文介绍利用改进后的国产9 w测微密度仪,测定航空软片静态分解力与曝光量的关系。以最大分解力所相应的曝光量作为确定航摄软片感光度的基准,以此为基础,确定航摄底片的最大密度( D _max )、最小密度( D _min )、影象反差(△ D )和平均密度( D _R )本文对国产1022T、1022P、柯达2402、2412等航摄软片进行了研究,其试验结果可作为今后修改航摄规范的基础。     

Tile‐based polygon overlay of vector data in a virtual globe

The demand for analysis of large‐scale data has increased with increased access to spatial vector data. Polygon overlay of vector data in a virtual globe requires proprietary data structures and proprietary analysis algorithms. A vector data structure is designed for rapid polygon overlay in a virtual globe by recording the metadata of the triangles (TriMeta) that constitute polygons. A polygon overlay algorithm is proposed based on this data structure. The overlay of two complex GIS polygons is transformed into the intersection computation of their 3D triangular presentations. The intersection computation of two sets of triangles is reduced considerably by utilizing TriMeta to filter out the disjoint triangle pairs and rapidly identify the contained triangle. The new method improves the overlay efficiency in a virtual globe because the amount of computation required to calculate the intersections of two large polygons and drape the intersections onto a terrain surface is reduced.