滇西施甸地区晚泛非运动的地层学和岩石学响应

保山地块的寒武系露头少,研究范围有限。长期以来,地学界对寒武系与奥陶系之间的接触关系存在较大争议,有人认为是整合接触,有人认为是假整合接触,囿于过去的工作精度,目前尚无定论。近年来,在保山施甸地区开展1∶5万区调工作时发现,区内普遍缺失早奥陶世沉积,仅在施甸半坡一带有中奥陶统,在大寨一带,中上奥陶统蒲缥组直接平行不整合在上寒武统保山组之上,结合晚寒武世—早奥陶世业已存在的岩浆活动,认为这是晚泛非运动的远程响应。     

利用流水线技术的遥感影像并行处理

针对现有的OpenMP和直接的线程并行法难以对遥感影像处理链进行加速的问题,引入流水线概念对复杂的功能链进行并行加速,提出了基于流水线技术的遥感影像并行处理方法。影像处理实验验证了流水线在遥感影像多级连续处理方面的优势。     

针铁矿对湖泊草、藻来源可溶有机质的非均质吸附

为探究富营养化湖泊中自生源可溶有机质(DOM)在泥水界面的吸附行为,以马来眼子菜(Potamogeton malaianus)和铜绿微囊藻(Microcystis aeruginosa)释放的DOM为代表,考察针铁矿对草、藻源DOM中不同组分的吸附特征.三维荧光平行因子分析表明类富里酸组分C1和类胡敏酸组分C4的含量很低,而类蛋白物质(类酪氨酸组分C2和类色氨酸组分C3)分别占草、藻源DOM荧光组成的70%和93%. 2种DOM均可被针铁矿吸附,吸附过程符合伪一级动力学.通过等温线拟合发现针铁矿吸附藻源DOM的非线性更强,饱和吸附量(23.77 mg/g)高于草源DOM(19.10 mg/g).特别地,类蛋白组分呈现非线性吸附,而类腐殖物质的吸附近似线性,且针铁矿对于DOM各荧光组分的吸附量顺序为:C3>C2> C4> C1,此非均质吸附特征与DOM组分的初始含量、分子大小、芳香性及有效吸附位点有关.红外光谱证实氨基、羧基和羟基是吸附过程中的重要官能团.因此,草、藻源DOM显著改变了针铁矿表面的有机物质组成,影响湖泊沉积物的生物地球化学行为.     

统计费用网络流相位解缠并行处理

针对雷达干涉测量(InSAR)相位解缠中的单机计算资源不足和相对运算效率不高的问题,提出了数据并行处理策略。以统计费用网络流相位解缠为例,分析了该算法的数据划分方法,构建了并行运算实验系统,实现了统计费用网络流相位解缠并行处理,并从解缠效果、内存使用量和运算效率3个方面对实验结果进行了分析。     

Parallelized combined finite-discrete element (FDEM) procedure using multi-GPU with CUDA

This paper focuses on the efficiency of finite discrete element method (FDEM) algorithmic procedures in massive computers and analyzes the time-consuming part of contact detection and interaction computations in the numerical solution. A detailed operable GPU parallel procedure was designed for the element node force calculation, contact detection, and contact interaction with thread allocation and data access based on the CUDA computing. The emphasis is on the parallel optimization of time-consuming contact detection based on load balance and GPU architecture. A CUDA FDEM parallel program was developed with the overall speedup ratio over 53 times after the fracture from the efficiency and fidelity performance test of models of in situ stress, UCS, and BD simulations in Intel i7-7700K CPU and the NVIDIA TITAN Z GPU. The CUDA FDEM parallel computing improves the computational efficiency significantly compared with the CPU-based ones with the same reliability, providing conditions for achieving larger-scale simulations of fracture.     

并行处理技术在地理信息数据处理中的应用

随着地理信息存储量的飞速增长,传统的单进程、集中式的数据处理方式已不能满足基于网络的地理信息服务的效能要求。分析对比了OpenMP,MPI和MapReduce等主流并行编程模式,将关系型数据库与分布式空间数据管理系统相结合,提出了面向并行处理的地理信息存储模型和数据组织模型,将该模型与传统模型进行了对比分析,并基于MapReduce实现了地理空间数据并行处理框架,选取了矢量数据装载、影像数据装载以及数据切片作为典型数据处理案例开展对比实验,该技术方案的处理效率均数倍于传统技术方案。实验表明,该模型能够很好地支持并行处理框架,可为分布式环境下数据处理中心构建提供一个有效解决方案。     

A parallel algorithm for coverage optimization on multi-core architectures

Location siting is an important part of service provision, with much potential to impact operational efficiency, safety, security, system reliability, etc. A class of location models seeks to optimize coverage of demand for service that is continuously distributed across space. Decision-making and planning contexts include police/fire resource allocation for a community, siting cellular towers to support cell phone signal transmission, locating emergency warning sirens to alert the public of severe weather and other related dangers, and many others as well. When facilities can be sited anywhere in continuous space to provide coverage to an entire region, this is a very computationally challenging problem to solve because potential demand for service is everywhere and there are an infinite number of potential facility sites to consider. This article develops a new parallel solution approach for this location coverage optimization problem through an iterative bounding scheme on multi-core architectures. The developed approach is applied to site emergency warning sirens in Dublin, Ohio, and fire stations in Elk Grove, California. Results demonstrate the effectiveness and efficiency of the proposed approach, enabling real-time analysis and planning. This work illustrates that the integration of cyberinfrastructure can significantly improve computational efficiency in solving challenging spatial optimization problems, fitting the themes of this special issue: cyberinfrastructure, GIS, and spatial optimization.     

A new model of edge-to-edge contact for three dimensional discontinuous deformation analysis

A robust contact theory can be regarded as key to three dimensional discontinuous deformation analyses (3D-DDA). Not only must this theory provide an efficient algorithm to judge the type and location of contacts but also it must be able to present comprehensive formulations for every kind of contact (open, sliding and locked contact). There are six types of contact in three dimensional discontinuous deformation analyses (vertex-to-vertex, vertex-to-edge, vertex-to-face, edge-to-edge, edge-to-face and face-to-face) that can be converted to vertex-to-face and edge-to-edge contacts. This paper presents a new model of edge-to-edge contact to three dimensional discontinuous deformation analyses (3D-DDA). This new model considers both kinds of edge-to-edge contact (cross-over and parallel edge-to-edge contact) and presents a criterion for inter-penetration. Sub matrices of normal and shear spring and friction force are derived by geometrical analysis and penalty method. This new model is implemented in a 3D-DDA computer programme, and the example results demonstrate the validity of the model.     

Parallelization of the flow-path network model using a particle-set strategy

High-performance simulation of flow dynamics remains a major challenge in the use of physical-based, fully distributed hydrologic models. Parallel computing has been widely used to overcome efficiency limitation by partitioning a basin into sub-basins and executing calculations among multiple processors. However, existing partition-based parallelization strategies are still hampered by the dependency between inter-connected sub-basins. This study proposed a particle-set strategy to parallelize the flow-path network (FPN) model for achieving higher performance in the simulation of flow dynamics. The FPN model replaced the hydrological calculations on sub-basins with the movements of water packages along the upstream and downstream flow paths. Unlike previous partition-based task decomposition approaches, the proposed particle-set strategy decomposes the computational workload by randomly allocating runoff particles to concurrent computing processors. Simulation experiments of the flow routing process were undertaken to validate the developed particle-set FPN model. The outcomes of hourly outlet discharges were compared with field gauged records, and up to 128 computing processors were tested to explore its speedup capability in parallel computing. The experimental results showed that the proposed framework can achieve similar prediction accuracy and parallel efficiency to that of the Triangulated Irregular Network (TIN)-based Real-Time Integrated Basin Simulator (tRIBS).     

遥感影像并行处理的数据划分及其路径优化算法

研究了一种基于数据划分的遥感影像并行处理的路径优化算法,用于解决将并行技术应用于海量遥感影像分布式存储和处理领域时其处理模型所具有的多路可达性所引起的路径动态、最优选择问题。在栅格数据可分解性分析及并行模型数据态、元素、相对信息量和映射等8个基本定义和6个性质的基础上,给出并行处理一般数学模型。以该模型为基础获得在一般并行处理情况下,以平均计算代价变量的比值作为控制横向并行与纵向并行选择方式的标志,并进一步给出四叉树索引并行生成、基于四叉树的目标检测并行处理等具体示例。最后,通过试验验证了算法的有效性,分析了算法的特点及影响因素。