集群计算机上基于BSP模型的并行算法及其程序设计

文章分析了BSP模型和集群计算机的特点，给出了在集群计算机根据BSP模型设计并行算法及其软件的原则，举例说明了利用BSP模型代价公式定性分析并行算法性能的方法，并利用实验结果验证了得出的结论。结果表明模型的成功地抽象出了集群计算中影响算法性能的诸种因素，并通过代价公式反映出来，利用代价公式可以基本准确地估计并行算法代价，这对集群计算机上的并行算法及其软件及设计和优化具有重要的指导意义。     

椭圆型偏微分方程的加法Schwarz方法

1.引 言 古典加法Schwarz方法(ASM)对于一般问题收敛很慢,在大多数情况下, ASM只能作为预条件子.另一方面,ASM的并行性能非常好,尤其适合大规模粗粒度并行计算,近年来随着并行机系统及并行计算的兴起,ASM重新受到重视.许多学者研究了怎样提高ASM的收敛速度[1,2,4].他们发现加法Schwarz方法之所以收敛慢是由于在内边界上采用     

General Solution for the Dynamic Modeling of Parallel Robots

In this paper, we present a general method to calculate the inverse and direct dynamic models of parallel robots. The models are expressed in a closed form by a single equation in which all the elements needed are expressed. The solution is given in terms of the dynamic models of the legs, the dynamics of the platform and some Jacobian matrices. The proposed method is applied in this paper on two parallel robots with different structures. Categories (2), (3).     

Hardware system of the Earth Simulator

The Earth Simulator (ES), developed under the Japanese government’s initiative “Earth Simulator project”, is a highly parallel vector supercomputer system. In this paper, an overview of ES, its architectural features, hardware technology and the result of performance evaluation are described.

In May 2002, the ES was acknowledged to be the most powerful computer in the world: 35.86 teraflop/s for the LINPACK HPC benchmark and 26.58 teraflop/s for an atmospheric general circulation code (AFES). Such a remarkable performance may be attributed to the following three architectural features; vector processor, shared-memory and high-bandwidth non-blocking interconnection crossbar network.

The ES consists of 640 processor nodes (PN) and an interconnection network (IN), which are housed in 320 PN cabinets and 65 IN cabinets. The ES is installed in a specially designed building, 65 m long, 50 m wide and 17 m high. In order to accomplish this advanced system, many kinds of hardware technologies have been developed, such as a high-density and high-frequency LSI, a high-frequency signal transmission, a high-density packaging, and a high-efficiency cooling and power supply system with low noise so as to reduce whole volume of the ES and total power consumption.

For highly parallel processing, a special synchronization means connecting all nodes, Global Barrier Counter (GBC), has been introduced.     

An immune oriented multi-agent system for biological image processing

In this article, we present a parallel image processing system based on the concept of reactive agents. Our system lies in the oRis language, which allows to describe finely and simply the agents’ behaviors to detect image features. We also present a method of segmentation using a multi-agent system, and two biological applications made with oRis. The stopping of this multi-agent system is implemented through a technique issued from immunology: the apoptosis.     

高可用度的冗余UPS

简述通信行业标准《通信局(站)电源系统总技术要求》(YD/T1051)对UPS可用度的要求,介绍适用于电信系统的高可用度冗余UPS。     

抗窄带干扰宽带中频数字接收机的设计与实现

讨论了存在强干扰条件下MSK中频数字接收机的频域窄带干扰抑制、伪码快速捕获、MSK相干解调等实现方法。具体实现中提出了基于功率估计的码捕获门限实时调整方案，解决了动态干扰条件下的快速码捕获问题。基于FPGA DSP硬件设计和软件可编程数字信号处理算法，接收机具有较强的适应性和稳定性。     

一种产生式系统的并行推理模型

1.引言 在人工智能领域中,产生式系统是一种比较有效的知识表示方法,并得到了广泛应用。目前许多较为成功的专家系统都是用产生式系统实现的~[1]。随着应用领域的不断扩士其知识座的抓橄称渐增     

Sub-optimal solutions to track detection problem using graph theoretic concepts

This paper demonstrates how the problem of tracking targets, which appear as either straight or curved lines in two-dimensional display images (or data images) can be formulated in terms of a directed weighted graph model and how dynamic programming techniques can be efficiently applied to reach an optimal or sub-optimal solution. In general, track detection algorithms providing optimal solutions have good detective ability, but most of them suffer from the inability to detect discontinuous lines or to resolve efficiently pairs of crossing lines. A sub-optimal solution is provided that efficiently overcomes these weaknesses. We focus on modeling the track detection problem in terms of a graph, formulating fast sequential/parallel sub-optimal track detection algorithms and testing them on simulated data in order to show their detective ability. Moreover, we specify the conditions under which sub-optimal algorithms can perform at least as well as their corresponding optimal algorithms. This is significant for the track detection problem where fast, accurate and real-time detection is considered a necessity.