Comparison of the Ordovician-Carboniferous Boundary Between Korea and NE China: Implications for Correlation and Tectonic Evolution

There is a great hiatus between Ordovician and Carboniferous strata in the Northeast China and Korean Peninsula. In order to understand geology and tectonic evolution, and to find out the similarities and differences in both regions, two sections in the Western Hill near Beijing in NE China and several sections in the Korean Peninsula were selected to examine their geologic boundaries between Lower and Upper Paleozoic strata to compare their characteristic features. At four sites in the two sections in the Western Hill near Beijing were examined their contact relations. The Hui Yu section is the same horizon where one site is top of a quarry hill and the other of down hill. Mid-Carboniferous Qingshuijian Formation rests on the Ordovician Majiagou Formation. Limestone beds are more commonly intercalated with shale and sandstone at site 2 of the Hui Yu section, while at site 1, conglomerate beds are dominant. Site 1 of the Se Shu Fen section shows eroded and concealed karst topography and conglomerate beds are intercalated within shale beds. Silurian and Devonian strata are absent in these areas. In the Korean Peninsula, most O-C contacts occur between Ordovician limestone formation and Carboniferous strata, although Silurian strata occur beneath the Carboniferous strata in the Jeongseon area and Pyeongnam Basin. Most contact relations are parallel unconformity and angular unconformity is rarely seen. The O-C relations in both regions are similar to each other, and these indicate that the Korean Peninsula was located near or belonged to the Sino-Korean paraplatform during Paleozoic time.     

基于Pfafstetter规则的流域编码算法并行化方法

流域编码是以子流域划分进行流域相关研究的重要内容。Pfafstetter 流域编码以编码唯一、顾及流域拓扑关系及编码效率高等优点而被广泛采用。本文在流域相关研究的分析范围不断增大、数据精度越来越高的需求背景下,以Pfafstetter 编码为基础,对流域编码并行化方法进行研究。首先,分析了Pfafstetter 编码不全面和码位不一致的问题,改进了Pfafstetter 编码规则;然后,从数据并行的角度,讨论了并行计算环境下的数据划分及并行化策略,进而设计了流域编码并行算法;最后,利用长江中上游流域SRTM数据,在集群系统上对流域编码并行算法的正确性和并行性能进行了测试。实验结果表明,本文设计实现的流域编码并行算法可获取与实际较为一致的计算结果,且提高了编码计算效率,可为基于子流域划分的流域分析并行化提供参考。     

���μ���������Ԥ��Ĵ����벢��ģʽ�о�

??????μ???????????????????????????????????????????????????????????????з????????????????????????????????????????????????????￡?????????????????????????????????????????????????????????????????????Ч?????б????????????????????????????????????????????????????     

应用改进并行遗传算法反求水文地质参数研究

利用单纯形法局部搜索速度快和遗传算法全局寻优的特点,同时为了克服两种方法各自的弊病,提出采用混合单纯形技术的并行遗传算法(Hybrid Simplex Parallel Genetic Algorithm,SPGA)进行水文地质逆问题的求解。详细阐述了SPGA算法的具体操作和实现,并将该方法应用于水源地的地下水模拟反演中。计算结果表明,SPGA算法在水文地质参数寻优计算中具有比较好的可靠性和计算效率。     

InSAR高程模型及其精度分析

提出了一种改进的InSAR高程模型，建立了高程和干涉相位的直接关系，并对公式推导中一般采用的平行射线近似处理方法所引入的高程误差进行了量化分析。结果表明，对于星载雷达而言，平行射线近似误差不能忽略。给出了近似误差与基线参数的确定性关系及相应的误差传播曲线，有助于误差纠正和重建高精度DEM。另外，基于改进的高程模型，推导出了高程测量误差传播公式，明确了基线长度和方向对测高精度的影响，对合理选择干涉像对具有指导意义。     

Massively parallel spatial point pattern analysis: Ripley’s K function accelerated using graphics processing units

This study presents a massively parallel spatial computing approach that uses general-purpose graphics processing units (GPUs) to accelerate Ripley’s K function for univariate spatial point pattern analysis. Ripley’s K function is a representative spatial point pattern analysis approach that allows for quantitatively evaluating the spatial dispersion characteristics of point patterns. However, considerable computation is often required when analyzing large spatial data using Ripley’s K function. In this study, we developed a massively parallel approach of Ripley’s K function for accelerating spatial point pattern analysis. GPUs serve as a massively parallel platform that is built on many-core architecture for speeding up Ripley’s K function. Variable-grained domain decomposition and thread-level synchronization based on shared memory are parallel strategies designed to exploit concurrency in the spatial algorithm of Ripley’s K function for efficient parallelization. Experimental results demonstrate that substantial acceleration is obtained for Ripley’s K function parallelized within GPU environments.     

多视密集匹配并行传播GPU-PatchMatch算法

针对多视密集匹配的效率较低的问题,提出了GPU-PatchMatch多视密集匹配算法。该算法使用GPU提高PatchMatch的计算效率;同时充分利用稀疏场景信息,对深度信息进行规则初始化;为提高传播效率,使用了金字塔红黑板并行传播深度信息。最后在DTU、Strecha和Vaihigen数据集上进行了试验,并与常用的多视密集匹配算法进行对比。试验结果表明,本文算法在重建效率上有较大提高,与CPU算法(PMVS、MVE、OpenMVS)相比有7倍以上提升,与GPU算法相比也有2.5倍以上提升,表明本文算法的有效性。     

Finite‐element analysis of laminated rubber bearing of building frame under seismic excitation

Finite element analysis is carried out for a building frame supported by laminated rubber bearings to simultaneously investigate global displacement and local stress responses under seismic excitation. The frame members and the rubber bearings are discretized into hexahedral solid elements with more than 3 million degrees of freedom. The material property of rubber is represented by the Ogden model, and the frame is assumed to remain in elastic range. It is shown that the time histories of non‐uniform stress distribution and rocking behavior of the rubber bearings under a frame subjected to seismic excitation can be successfully evaluated, and detailed responses of base and frame can be evaluated through large‐scale finite element analysis. Copyright © 2015 John Wiley & Sons, Ltd.     

藏北羌塘盆地晚三叠世地层特征与对比

羌塘盆地上三叠统日干配错组、土门各拉组和肖茶卡组、那底岗日组分别分布于南、北羌塘凹陷。在以往研究和笔者在中国地质调查局青藏重点沉积盆地油气资源潜力分析项目工作基础上,通过对各地层单元的详细研究和区域对比,从古生物、岩石组合、沉积系列、地层单元的接触关系、年代地层进行了综合分析。结果显示北羌塘凹陷那底岗日组与南羌塘凹陷日干配错组和土门各拉组的时代主要为晚三叠世诺利期—瑞替期,三者为羌塘晚三叠世诺利期—瑞替期裂陷盆地形成过程中的同期异相的火山-沉积系列。北羌塘凹陷肖茶卡组的是残留陆表海沉积产物,其时代主要为晚三叠世卡尼期-诺利期早期,与那底岗日组、日干配错组和土门各拉组均为上下对比关系。