基于模式理论光栅椭偏参数反演的数值模拟

将一种广泛用于求解系统优化问题的方法——正单纯形法，求解光栅的椭偏方程。首先，利用求解光栅的傅立叶模式理论对TE和TM波的复反射系数进行求解。然后计算出其相应的椭偏参数(△，Ψ)，并在该值的基础上加入不同偏差的随机高斯噪声，将加入噪声后的值(△m，Ψm)作为模拟测量值。最后使用优化算法进行反演。通过对几种常用面形光栅椭偏参数的数值模拟，一方面表明傅立叶模式理论计算光栅的椭偏参数不仅精度高。而且速度快；另一方面表明利用正单纯形法得到的光栅参数值很接近于正演时假设的参数值，从而从理论上证明了利用椭偏法测量光栅各种光学参数的可行性。     

用金字塔图法匹配边界图象的三眼立体视觉方法

本文在分析了双眼立体视觉面临的本质困难之后，提出了用金字塔图法匹配特征基元的三眼立体视觉方法，这种方法由于建筑在透视投影几何原理的稳固基础上，无须任何先验限制，也不以图象相似性为基础，故可较好地解决精度与匹配难度的矛盾，且运用金字塔图法进行匹配传播使在保证精度的基础上，匹配速度大大提高，对计算机人工图象的匹配结果表明，误匹配率几乎为零，且有较高的匹配速度和精度。     

Classification of hand postures against complex backgrounds using elastic graph matching

A system for person-independent classification of hand postures against complex backgrounds in video images is presented. The system employs elastic graph matching, which has already been successfully applied for object and face recognition. We use the bunch graph technique to model variance in hand posture appearance between different subjects and variance in backgrounds. Our system does not need a separate segmentation stage but closely integrates finding the object boundaries with posture classification.     

实验应变／应力模态分析若干问题的进展评述

本文评述了实验应变／应力模态分析进展的若干基本问题。主要是：应变响应与位移响应的关系；应变频响函数矩阵的特点及其测量方法；应变模态的加权正交性及其识别方法；以及其他问题。     

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

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

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

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

Kripke Semantics for Modal Substructural Logics

We introduce Kripke semantics for modal substructural logics, and provethe completeness theorems with respect to the semantics. Thecompleteness theorems are proved using an extended Ishihara's method ofcanonical model construction (Ishihara, 2000). The framework presentedcan deal with a broad range of modal substructural logics, including afragment of modal intuitionistic linear logic, and modal versions ofCorsi's logics, Visser's logic, Méndez's logics and relevant logics.     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.