COMPUTING MAXIMUM CLIQUES OF CIRCULAR ARCS IN PARALLEL*

Given a set S of n proper circular arcs, it is required to identify a largest cardinality subset K[S] of S each two of whose members intersect. This paper describes an optimal parallel algorithm to compute K[S]. The algorithm is not based on any previously known sequential solution, and is designed for the CREW PRAM model of computation. It uses 0(n/logn) processors and runs in O(logn) time. An interesting feature of the algorithm is that it transforms the computational geometric problem at hand, to a problem involving computations on 0-1 matrices, and then transforms the latter back into a ray shooting problem in computational geometry.     

三维标量场并行等值面提取与绘制技术

通过研究并行等值面提取与绘制的各项关键技术要点,面向三维标量场的特点,在sort-last并行绘制模式的基础上提出一个三维标量场并行等值面提取与绘制框架.该框架在任务分配时采用静态分配的模式,在等值面提取时采用Marching Tetrahedra等值面提取算法,在并行绘制与场景合成时采用预先构建绘制节点控制模型的混合场景并行绘制合成算法.实验结果表明,该框架能够有效地提高大规模时变三维标量场的等值面提取与绘制效率,满足实际应用的需要.     

基于CAE的平流式换热器无模成型工艺开发

为实现高效的平流式换热器柔性弯曲制造,避免模具对制品的损伤,采用仿真与试验相结合的方法实现平流式换热器无模弯曲工艺开发.与传统的换热器绕弯成型技术相比,该成型过程无须弯曲模,而是通过控制换热器两端的运动轨迹实现弯曲成型,改变相应的运动轨迹能实现不同的弯曲半径.在成型原理分析的基础上,建立无模弯曲成型过程的有限元仿真模型,并基于仿真结果确定合理的弯曲速度、夹头长度和中性层半径等工艺参数.设计并制造无模弯曲成型试验装置,并研究翅片结构等因素对成型质量的影响.     

岩石高边坡稳定性并行计算及其应用

在高地震烈度区的岩石高边坡抗震安全评价需要大规模数值计算,而现有商业软件无法有效解决这类复杂的工程问题,因此,本文开发了解决岩石高边坡接触稳定性问题的对等架构并行计算程序,并应用于泰山公司抽水蓄能电站上水库左岸边坡的静力和动力稳定性评价。在数值建模过程中,将岩石边坡滑块体、地质结构面、库水作用以及近场地基作为岩石高边坡动力接触系统。在稳定性安全评价中结合了有限元法、极限平衡法和接触算法,考虑影响高边坡稳定性的多种复杂因素,通过计算特定滑动面的安全系数或安全系数时程,基于现行水电工程水工建筑物抗震设计规范,完成了岩石高边坡稳定性评价,回避了求解复杂岩体材料非线性的问题。计算结果显示,所开发的程序具有较高的并行计算效率,对解决复杂岩石高边坡稳定问题具有显著的优势。     

RAFNet: RGB-D attention feature fusion network for indoor semantic segmentation

Semantic segmentation based on the complementary information from RGB and depth images has recently gained great popularity, but due to the difference between RGB and depth maps, how to effectively use RGB-D information is still a problem. In this paper, we propose a novel RGB-D semantic segmentation network named RAFNet, which can selectively gather features from the RGB and depth information. Specifically, we construct an architecture with three parallel branches and propose several complementary attention modules. This structure enables a fusion branch and we add the Bi-directional Multi-step Propagation (BMP) strategy to it, which can not only retain the feature streams of the original RGB and depth branches but also fully utilize the feature flow of the fusion branch. There are three kinds of complementary attention modules that we have constructed. The RGB-D fusion module can effectively extract important features from the RGB and depth branch streams. The refinement module can reduce the loss of semantic information and the context aggregation module can help propagate and integrate information better. We train and evaluate our model on NYUDv2 and SUN-RGBD datasets, and prove that our model achieves state-of-the-art performances.     

基于SaaS的矿震远程预警系统关键技术初探

现有的矿震预警系统都是以独立形式运行于各矿区,相互之间没有关联,重复投资严重,且矿震数据海量繁杂,仅依靠现场分析无法满足实时预警需求。文章基于感知矿山物联网示范工程(夹河矿),对采用云计算SaaS模式构建的矿震远程预警系统关键技术进行了相关研究:首先给出了系统整体框架,然后重点探讨了该系统所涉及的三个关键技术,包括基于SaaS的矿震预警专家分析软件架构、多源SaaS数据库构建技术以及基于MapReduce的并发数据过滤接收技术。现场应用表明,所构建的系统已基本具备全国统一远程矿震预警系统的架构,能满足多矿区远程矿震预警的基本要求。     

XVM虚拟环境下并行程序的性能评测

该文引入speedup作为并行程序的性能评测指标,分析了并行程序在不同类型和不同数量的客户虚拟机中运行的性能差异,实验表明,MPI并行程序在xVM虚拟化环境中的运行性能接近非虚拟化本地主机的性能,在半虚拟化环境中的并行程序性能超过全虚拟化环境中的并行程序性能。     

顶底板围岩不稳的缓倾斜中厚以上矿体的采矿新方案

密集平行束孔落矿的底盘漏斗采矿方案的特点是:用密集严行束孔落矿;凿岩与出矿水平合二为一;实行“掘井、劈漏、落矿三位一体”的回采工艺。该方案结构简单、采切比低、工人劳动强度低,适于开采缓倾斜顶底围岩不稳固的中厚以上矿体。     

Parallel heap: An optimal parallel priority queue

We describe a new parallel data structure, namely parallel heap, for exclusive-read exclusive-write parallel random access machines. To our knowledge, it is the first such data structure to efficiently implement a truly parallel priority queue based on a heap structure. Employing p processors, the parallel heap allows deletions of (p) highest priority items and insertions of (p) new items, each in O(log n) time, where n is the size of the parallel heap. Furthermore, it can efficiently utilize processors in the range 1 through n.This work was supported by U.S. Army's PM-TRADE contract N61339-88-g-0002, Florida High Technology and Industry grant 11-28-716, and Georgia State University's internal research support during spring and summer quarters, 1991.     

Randomized range-maxima in nearly-constant parallel time

Given an array ofn input numbers, therange-maxima problem is that of preprocessing the data so that queries of the type what is the maximum value in subarray [i..j] can be answered quickly using one processor. We present a randomized preprocessing algorithm that runs inO(log^* n) time with high probability, using an optimal number of processors on a CRCW PRAM; each query can be processed in constant time by one processor. We also present a randomized algorithm for a parallel comparison model. Using an optimal number of processors, the preprocessing algorithm runs inO( (n)) time with high probability; each query can be processed inO ( (n)) time by one processor. (As is standard, (n) is the inverse of Ackermann function.) A constant time query can be achieved by some slowdown in the performance of the preprocessing stage.