相干源二维波达方向估计

本文分析了平面阵接收信号的协方差矩阵，发现它可分解为一个广义对称矩阵与一个非广义对称矩阵之和，利用信号协方差矩阵的这一结构特征，重点研究了相干源二维波达方向（DOA）估计．该方法通过构造一个差矩阵，求出其本特征值对应的任一特征向量，利用谱函数估计相干源二维DOA．简要分析了二维DOA估计的分维处理。     

逻辑程序的一种并行执行模型

本文基于静态相关性分析和动态调整相结合的方法，提出了一种逻辑程序的执行模型，它不仅开发了“与“并行，同进也开发了一定的“或“并行，从而有效地加速了逻辑程序的执行。     

GIS中矢量图形的结构分析与VC++中的实现

简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。     

Orientation-based unique representation for planar curves and shapes

This paper presents an orientation-based representation for planar curves and shapes. The new representation can uniquely represent all types, of planar shapes, be it convex, nonconvex, polygonal, smoothly curved, or piecewise smooth shapes. It is based on a new parameterization, theabsolute integral orientation. This representation is invariant under translation and rotation. The absolute integral orientation is a parameter invariant under scaling. As a result, matching of similar shapes (i.e., determination of the relative orientation and the scaling factor) using the absolute integral orientation as the parameter is easier than using the arclength as the parameter. In addition, the new representation has the feature of adaptive sampling, making it more compact and efficient than arc-length-based representations.     

Measurements of turbulent mass transport of a circular wall jet

The results of a laboratory investigation on the turbulence characteristics of a circular three-dimensional turbulent wall jet are presented. Measurements were taken up to 50 nozzle diameters using combined particle image velocimetry and planar laser induced fluorescence. The results showed that the induced turbulence was still evolving in the present range and had not achieved similarity. While the turbulent intensity for both velocity and concentration increased downstream, the turbulent mass transport showed a decline over distance for both the streamwise and spanwise directions, implying weakening dispersion from the jet core.     

转移法色交换

将图Ｇ的着色由一种变为中一种，通常用Ｋｅｍｐｅ法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。     

GaAs亚微米自对准工艺技术研究

总结了在５０ｍｍＧａＡｓ圆片上实现自对准介质膜隔离等平面工艺技术的研究，着重描述了离子注入、自对准亚微米难熔栅制备、钝化介质膜生长、干法刻蚀、电阻和电容制备等关键工艺的研究结果。这套工艺的均匀性、重复性好，在５０ｍｍＧａＡｓ圆片上获得了满意的成品率。采用这套工艺已成功地研制出多种性能良好的ＧａＡｓＩＣ和ＧａＡｓ功率ＭＥＳＦＥＴ，证明国家自然科学基金委员会这一重大课题的选择对发展我国ＧａＡｓＩＣ确实具有重大意义。     

Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.