Mesh结构P/G布线网络层次化快速分析方法

本文提出了一个基于网络划分的P／G布线网络层次化快速分析方法。其中，对于子网运算，通过对Cholesky分解法三角化对称正定阵的图模型分析，并基于Mesh结构网络的自身特点，提出了一个基于图顶点排序的加速子网分析运算策略；并用基于MPI的并行结构实现了P／G布线网络分析的并行运算。     

Serial deployment of attention during visual search.

This study examined whether objects are attended in serial or in parallel during a demanding visual search task. A component of the event-related potential waveform, the N2pc wave, was used as a continuous measure of the allocation of attention to possible targets in the search arrays. Experiment 1 demonstrated that the relative allocation of attention shifts rapidly, favoring one item and then another. In Experiment 2, a paradigm was used that made it possible to track the absolute allocation of attention to individual items. This experiment showed that attention was allocated to one object for 100-150 ms before attention began to be allocated to the next object. These findings support models of attention that posit serial processing in demanding visual search tasks. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Windows 95/98环境下PC机并行打印端口控制步进电机的研究

介绍了在Windows95／98环境下利用IBM-PC机打印端口控制步进电机运动的实现方法，并给出了关键程序的实现代码。     

智能工作站主机的MMPIS实验模型研究──一个全互连式结构MMPIS硬件环境的设计与实现

本文介绍中日国际合作开发研究的Ａ１型智能网（Ａ１型ＩＮ）智能工作站（ＩＷ）主机的并行推理硬件结构的实验模型设计与实现，给出了一种并行推理硬件支持环境实现方案和该方案在实现中若干问题的解决方法。     

货郎担问题最优并行启发式算法

本文给出了满足三角不等式的货郎担问题的并行启发式算法，在ＳＩＭＤ ＣＲＥＶ ＰＲＡＭ并行机上该算法使用Ｏ（ｎ＾３／ｌｏｇ＾２ｎ）台处理器需Ｏ熄ｌｏｇ＾２ｎ）时间，这里ｎ是给定城市的个数，因而该并行算法是最优的。     

Spectral multidomain approximation of elliptic problems with mixed conditions on the interfaces

The multidomain technique for elliptic problems, that allows the fulfillment of the interface conditions by means of a suitable combination of the continuity of the solution and of its normal derivative, is considered. Some choices of this combination are investigated and, in particular, a choice that allows the solution of the multidomain problem through two solutions for each subproblem, is proposed. The scheme has been discretized with a collocation method and some numerical tests are reported. Moreover the method is compared with the more classical Dirichlet/Neumann one as well as with the capacitance matrix method.This research has been supported by a grant from M.P.I. (40%).     

最小生成树的高效异步并行算法

在ＭＩＭＤ－ＳＭ并行计算模型上，本文给出了时间复杂性为Ｏ（ｎ（ｎ／ｐ＋ｌｏｇｐ））的最小生成树的异步并行算法，其中ｎ，ｐ（１≤ｐ≤ｎ）分别表示图的顶点数和处理机的个数。     

Sidle的远程执行设备

Ｓｉｄｌｅ系统是运行在ＳＵＮ工作站网络上的一组实用程序，利用空闲的处理机资源进行大粒度的并行计算．同其它远程执行设备相比，它能支持程序内部并行和嵌套的远程执行，允许一个服务员机接受多个远程执行任务．本文介绍了这些特点和透明性的实现方法．     

令牌多环网性能—可靠性综合评价

网络的性能与可靠性已分别得到广泛的研究,然而,怎样分析具有容错机制的环网的性能仍属有待开拓的研究领域,本文提出了一种分析具有自修复机制的多环网络系统的方法,并给出了报文传输时间分布的拉氏变换式,平均等待时间及平均队列长度公式,分析结果可用于评估故障与修复过程对实时令牌环网的实时响应特性的影响,对基于LAN的分布式实时系统设计具有指导意义。     

A feasibility study of a direct-mapping parallel processing method to solve linear equations in load-flow calculation

With the growing size and complexity of power systems, system analysis—such as transients calculation—takes much time. Hence, fast calculation methods are required. Although parallel processing is a hopeful method, there have been difficulties in the parallel solution of linear equations which appear in power-flow calculations by the Newton-Raphson method. This paper aims at the fast calculation of the power-flow problem by means of parallel processing. In order to improve the suitability to the parallel solution of the differential equation in transients calculation, we assume the use of a direct-mapping parallel processing machine to map directly the network of a power system onto a network of processors. Under this assumption, we propose a new parallel-processing-oriented method in which the linear equation is solved by linear iterations between nodes with Aitken acceleration. We simulate the method on three model power systems and compare this Parallel Iterative Method (PIN) with a Parallel Direct Method (PDM) which uses the banded matrix according to the number of operations required. As a result, we can expect that PIM may solve linear equations faster than PDM with m processors, although the PIM might be inferior to the PDM with m × m processors, where m denotes the half-band width of the banded matrix.