青藏高原云团东传过程及其中中尺度对流系统的统计特征

利用逐小时风云卫星TBB资料、逐小时中国自动站与CMORPH降水产品融合数据以及国家级地面观测站24小时累积降水量,统计分析2010～2016年夏季,伴随下游地区（104°E以东）降水的青藏高原云团东传过程以及东传过程中镶嵌于云团中的中尺度对流系统（Mesoscale Convective System,简称MCS）特征。结果表明,共出现120次伴随下游降水的高原云团东传过程,6月出现最频繁,但持续时间较长的过程多出现在7月。云团向东传播的主要三条路径是平直东传、沿长江折向东传和复合东传。其中路径二——沿长江折向东传中的过程是高影响过程,因为过程次数较多（46次）,过程平均持续时间较长（62小时）,在下游地区引发的降水日数和暴雨日数最多。属于东传过程的MCS在7月形成最多,集中分布在青藏高原东坡、云贵高原东部、长江沿岸及其以南地区。高原MCS影响长江中下游地区降水主要是通过向东传播的形式实现,因为即使生命史更长的中α尺度对流系统（Meso-α Convective System,简称MαCS）也鲜少直接移动至110°E以东地区。不同区域的中α尺度持续性拉长形对流系统（Permanent Elongated Convective System,简称PECS）的日变化特征显示,东传过程MCS更容易在夜间从高原东坡向东传播至下游地区。在三条路径中,路径二中的东传过程MCS数量最多、在下游地区发展最旺盛并与降水日数和覆盖范围存在更好的对应关系。     

Using Statistical Downscaling to Quantify the GCM-Related Uncertainty in Regional Climate Change Scenarios： A Case Study of Swedish Precipitation

There are a number of sources of uncertainty in regional climate change scenarios. When statistical downscaling is used to obtain regional climate change scenarios, the uncertainty may originate from the uncertainties in the global climate models used, the skill of the statistical model, and the forcing scenarios applied to the global climate model. The uncertainty associated with global climate models can be evaluated by examining the differences in the predictors and in the downscaled climate change scenarios based on a set of different global climate models. When standardized global climate model simulations such as the second phase of the Coupled Model Intercomparison Project （CMIP2） are used, the difference in the downscaled variables mainly reflects differences in the climate models and the natural variability in the simulated climates. It is proposed that the spread of the estimates can be taken as a measure of the uncertainty associated with global climate models. The proposed method is applied to the estimation of global-climate-model-related uncertainty in regional precipitation change scenarios in Sweden. Results from statistical downscaling based on 17 global climate models show that there is an overall increase in annual precipitation all over Sweden although a considerable spread of the changes in the precipitation exists. The general increase can be attributed to the increased large-scale precipitation and the enhanced westerly wind. The estimated uncertainty is nearly independent of region. However, there is a seasonal dependence. The estimates for winter show the highest level of confidence, while the estimates for summer show the least.     

基于谱聚类算法的海底滑坡危险性评价

海底滑坡的危险性评价与分区,对海洋工程设施的选址和危险预防具有指导作用.本文基于无监督机器学习的谱聚类算法对黄河口埕岛海域展开了海底滑坡危险性评价,构建了输入参数为9、输出类别为4、核函数参数为0.08的海底滑坡危险性评价模型.使用该模型进行评价,将研究区分为了海底滑坡危险性高、较高、较低和低的区域.评价结果与地质环境...     

基于时空聚类的出租车载客热点区域挖掘研究

针对出租车运营过程缺少路径优化指导造成运营能力分布不均、空载率高的问题,本文以成都市安装有GPS设备的出租车所采集的轨迹数据为研究对象,以提高出租车效益为目标,采用了一种基于网格的出租车载客热点聚类算法,通过对出租车GPS轨迹数据进行处理和聚类分析,充分挖掘出租车载客热点区域,从而为出租车的运营者和管理者提供信息决策服务。     

新冠肺炎流行病学模型的最优参数化

现如今,新冠肺炎(COVID-19)严重威胁着世界各国人民的生命健康.许多流行病学模型已经被用于为政策制定者和世界卫生组织提供决策参考.为了更加深刻的理解疫情趋势的变化特征,许多参数优化算法被用于反演模型参数.本文提议使用结合了高斯-牛顿法和梯度下降法的Levenberg-Marquardt(LMA)算法来优化模型参数...     

一种高光谱遥感图像快速谱聚类算法

为获得分类效果更优良的遥感图像分类方式并解决高光谱遥感图像分类运算速度缓慢的问题,集成Lanczos算法与谱聚类算法,探讨了高光谱遥感图像谱聚类算法应用于遥感图像分类的可行性,提出了一种面向高光谱遥感图像的快速谱聚类算法;通过对比美国圣地亚哥机场高光谱遥感图像K-均值算法与谱聚类算法的分类结果,发现面向高光谱遥感图像的谱聚类算法易于识别线性地物,且分类的速度能得到较大提升。     

模糊聚类定权法对SLR定轨精度的影响

针对卫星激光测距(satellite laser ranging,SLR)精密定轨过程中存在的测站观测数据合理定权问题,将一种改进的模糊聚类算法引入到SLR观测数据定权中。基于国际激光测距服务(International Laser Ranging Service,ILRS)提供的全球SLR测站性能报告,对测站进行近实时滑动分类定权,改变SLR数据处理中权重的经验或者随意性选取模式。经过LAGEOS1卫星2014年1月至2016年12月3年全球SLR实测数据处理的测试。结果表明,当考虑LAGEOS标准点总数、LAGEOS标准点RMS值以及LAGEOS标准点合格率这3项测站质量控制因素确定的测站权值能最大限度地提高卫星定轨精度和观测数据的使用效率,对参与计算的365个3d弧段数据,91.46%弧段精度得到提高,平均提高约3.7mm,且每个测站的定轨残差RMS也得到了降低。这对于正在迈向毫米级测量精度的SLR技术至关重要。     

A natural language processing and geospatial clustering framework for harvesting local place names from geotagged housing advertisements

Local place names are frequently used by residents living in a geographic region. Such place names may not be recorded in existing gazetteers, due to their vernacular nature, relative insignificance to a gazetteer covering a large area (e.g. the entire world), recent establishment (e.g. the name of a newly-opened shopping center) or other reasons. While not always recorded, local place names play important roles in many applications, from supporting public participation in urban planning to locating victims in disaster response. In this paper, we propose a computational framework for harvesting local place names from geotagged housing advertisements. We make use of those advertisements posted on local-oriented websites, such as Craigslist, where local place names are often mentioned. The proposed framework consists of two stages: natural language processing (NLP) and geospatial clustering. The NLP stage examines the textual content of housing advertisements and extracts place name candidates. The geospatial stage focuses on the coordinates associated with the extracted place name candidates and performs multiscale geospatial clustering to filter out the non-place names. We evaluate our framework by comparing its performance with those of six baselines. We also compare our result with four existing gazetteers to demonstrate the not-yet-recorded local place names discovered by our framework.     

A density-based approach for detecting network-constrained clusters in spatial point events

Existing spatial clustering methods primarily focus on points distributed in planar space. However, occurrence locations and background processes of most human mobility events within cities are constrained by the road network space. Here we describe a density-based clustering approach for objectively detecting clusters in network-constrained point events. First, the network-constrained Delaunay triangulation is constructed to facilitate the measurement of network distances between points. Then, a combination of network kernel density estimation and potential entropy is executed to determine the optimal neighbourhood size. Furthermore, all network-constrained events are tested under a null hypothesis to statistically identify core points with significantly high densities. Finally, spatial clusters can be formed by expanding from the identified core points. Experimental comparisons performed on the origin and destination points of taxis in Beijing demonstrate that the proposed method can ascertain network-constrained clusters precisely and significantly. The resulting time-dependent patterns of clusters will be informative for taxi route selections in the future.