On the Consistency of the Normalized Eight-Point Algorithm

A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data (Chojnacki, W., et al. in IEEE Trans. Pattern Anal. Mach. Intell. 25(9):1172–1177, 2003) relies upon adoption of a certain model for statistical data distribution. Under this model, the cost function that underlies the algorithm operating on the normalized data is statistically more advantageous than the cost function that underpins the algorithm using unnormalized data. Here we extend this explanation by introducing a more refined, structured model for data distribution. Under the extended model, the normalized eight-point algorithm turns out to be approximately consistent in a statistical sense. The proposed extension provides a link between the existing statistical rationalization of the normalized eight-point algorithm and the approach of Mühlich and Mester for enhancing total least squares estimation methods via equilibration. The paper forms part of a wider effort to rationalize and interrelate foundational methods in vision parameter estimation.     

线性八元树表示的三维客体群的连通分量标号和计数

本文提出二种算法分别标号和计数线性八元树表示的三维客体群的连通分量.这些操作典型地需要检查线性八元树中诸八分体在三个主方向上的面邻接对.根据这些邻接对,可以建造在计算机中用关联矩阵表示的邻接图.连通分量标号和计数是在关联矩阵上分别执行相应的操作而完成的.连通分量标号的执行时间是O(n+m·logm),而连通分量计数需要O(n)时间,其中m和n分别是线性八元树中八分体和邻接对的数目.     

关于S盒的几点注记

分析了Ｓ盒的平衡性，相关免疫性，严格雪崩性和非线性度的各种可能定义及它们之间的相互关系，提出了要Ｓ盒采用这些准则的定义。     

划分IC缺陷团的聚类算法

大量实验表明了在集成电路（IC）制造过程中形成中的缺陷团之间具有很强的相关性，然而现用于划分缺陷团的方法均忽略了缺陷之间的相关性。因此，得到了缺陷分布规律不能有效地反映缺陷在圆片上的分布，为了提高IC成品率和可靠性仿真和设计的精度，提高缺陷分布模型的准确性，该文提出了划分缺陷团的聚类算法，该方法依据缺陷形成的动力学基础，充分考虑了缺陷团之间的相关性，实验证明该算法用于划分IC的缺陷团是十分有效的。     

双重孔隙介质油藏中的吸渗排油作用

利用美国SSI公司研制的COMPN模拟软件对双重孔隙介质油藏一种重要的开采机理 吸渗排油进行了模拟研究,考察了一个基质岩块为四周裂缝所包围时.在驱动压力和毛管压力的不同平衡(驱动压力和毛管压力的相对大小)关系下的水驱油采收率和水驱油效率的变化规律.     

一种新型基于石英的热光型光开关

一种采用基于石英的平面光波回路技术（PLC）制造的热光型光开关正越来越引起关注，它具有低耦合损耗、高稳定性及适于大规模集成等优点。首先描述了采用热光相移器构成马赫-曾德于涉仪（MZI）结构的热光型光开关，然后讨论2×2MZI热光型开关的工作原理及基本特性，最后介绍了由2×2MZI热光型开关单元构成的大规模光开关阵列以及一种采用悬梁式结构热光相移器的低功率消耗的光开关。     

The effect of particle distribution on damage formation in particulate reinforced metal matrix composites deformed in compression

Image analysis results are reported on the generation of damage in particulate reinforced metal matrix composites during compressive deformation. The technique allows the automated collection of data on the incidence of particle fracture and void formation in the matrix as a function of important microstructural parameters such as local particle volume fraction and particle size. There is a strong relationship between damage and the local volume fraction of the reinforcement proving that damage formation is accentuated in regions of particle clustering. With the SiC reinforced materials examined, there was observed to be a change in dominance of damage mechanism from particle fracture at low local volume fractions to void formation in the matrix within strongly clustered regions. The results are compared with finite element (FE) modelling of the compressive deformation of clustered particles using a simple cluster of equi-spaced particles. The FE results suggest that plastic flow is generally inhibited in clustered regions. In certain highly clustered configurations shielding is such that flow does not occur in the heart of the cluster even at high levels of average plastic strain. The modelling suggests that the change in dominance of damage mechanism is related to the dramatic increase in tensile hydrostatic stresses in the matrix with higher levels of particle clustering.     

两种不同界面结合强度碳/铝复合材料的内耗特性

本文研究了两种不同界面结合强度的碳/铝复合材料经不同次数加载热循环处理后的内耗值及内耗机制。弱界面结合的C/L2复合材料的内耗值变化主要由界面脱粘引起,而强界面结合的C/LD2复合材料的内耗值变化主要由位错运动所致。     

填料萃取塔液泛速度的计算

介绍了三种有代表性的填料萃取塔的液泛速度计算公式，并通过它们用于三种典型的液-液实验体系和两种不同填料的计算结果的比较，对这些公式的适用范围进行了讨论。     

The rank one mixed μ problem and ‘kharitonov-type’ analysis

The general mixed μ problem has been shown to be NP hard, so that the exact solution of the general problem is computationally intractable, except for small problems. In this paper we consider not the general problem, but a particular special case of this problem, the rank one mixed μ problem. We show that for this case the mixed μ problem is equivalent to its upper bound (which is convex), and it can in fact be computed easily (and exactly). This special case is shown to be equivalent to the so-called ‘affine parameter variation’ problem (for a polynomial with perturbed coefficients) which has been examined in detail in the literature, and for which several celebrated ‘Kharitonov-type’ results have been proven.