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硬件环境的设计与实现

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

反应离化团束（RICB）法生长CN硬质薄膜

用反应离化团束（ＲＩＣＢ）法，以低分子量聚乙烯为蒸发材料，氨气为反应气体，在ＮａＣｌ（１００）和Ｓｉ（１００）衬底上淀积Ｃ－Ｎ薄膜，透射电子衍射（ＴＥＭ）分析表明薄膜中含有β－Ｃ３Ｎ４晶粒，Ｘ射线光电子谱（ＸＰＳ）和红外吸收谱（ＩＲ）表明存在Ｃ，Ｎ原子的化学键合。     

眼球的自动定位

提出了一种由粗到细自动定位人脸的一个重要特征即眼球圆心的方法，该方法综合运用局部二值化，霍夫变换，像纱聚类，边缘提取等技术，对均匀或非均匀光照下拍摄或戴眼镜的照片都能获得很高的定位精度，适用于处理证件照。     

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

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

脉冲化学沉积非晶态Ni—P合金原子分布函数研究

采用Ｘ射线衍射分析技术，研究了脉冲化学镀非晶态Ｎｉ－Ｐ合金的原子分布和函数，得出其短程有序原子集团的尺度为０．７５４ｎｍ，约为熔体激冷法获得的非晶态Ｎｉ－Ｐ合金短程有序畴的１／２。并利用脉冲化学沉积非晶态合金的微机制择这一结果进行了解释。     

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%).     

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

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