A combined programming and iteration algorithm for finite element analysis of three-dimensional contact problems

Comparing with two-dimensional contact problems, three-dimensional frictional contact problems are more difficult to deal with, because of the unknown slip direction of the tangential force and enormous computing time. In order to overcome these difficulties, a combined PQP (Parametric Quadratic Programming) and iteration method is derived in this paper. The iteration algorithm, which alleviates the difficulty of unknown slip direction, is used along with the PQP method to cut down computing costs. Numerical example is given to demonstrate the validity of the present algorithm. The project supported by the Machinary and Electronics Ministry of China     

横向位移双曝光散斑图维纳谱的信息分布

讨论了横向位移双曝光散斑图维纳谱的信息分布，并由此导出杨氏纹图的一般表达式。讨论了条纹可见度与应变，面内转动，照明光束直径与条纹图图空间坐标的关系，指出了在条纹可见度影响下最大可见条纹数目。还讨论了散斑衬比与衍射晕的关系。     

Several parameters of generalized Mycielskians

The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μ_m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μ_m(G).     

SiO2-羟基表面上金属原子的第一性原理研究

采用第一性原理方法研究了SiO2-羟基表面上几种金属原子的吸附性质,发现In和Ga在SiO2-羟基表面上的结合很弱,而Fe,Co,Ni在该表面上与Si,O形成强的化学键.等势能面和扩散势垒计算表明In(Ga)的扩散激活能只有0.1-0.3 eV,表明这两种原子容易在表面上扩散.这些结果可以定性地解释纳米合成中的一些实验现象.     

计算全息图产生的锥面波在激光准直中的应用

本文提出了用计算全息图产生锥面波的方法.将全息图置于激光光路中,它的衍射图样中心在空间形成了一条准直线.文中对锥面波的传播、准直精度及准直距离作了理论分析,给出了实验结果.     

COMPLETE EXTREMAL SURFACES OF MIXED TYPE IN 3-DIMENSIONAL MINKOWSKI SPACE

ＣＯＭＰＬＥＴＥＥＸＴＲＥＭＡＬＳＵＲＦＡＣＥＳＯＦＭＩＸＥＤＴＹＰＥＩＮ３－ＤＩＭＥＮＳＩＯＮＡＬＭＩＮＫＯＷＳＫＩＳＰＡＣＥ￥ＧＵＣＨＡＯＨＡＯ（ＩｎｓｔｉｔｕｔｅｏｆＭａｔｈｅｍａｔｉｃｓ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓｈａｎｇｈａｉ２００...     

Super-Wavelets and Decomposable Wavelet Frames

A wavelet frame is called decomposable whenever it is equivalent to a superwavelet frame of length greater than one. Decomposable wavelet frames are closely related to some problems on super-wavelets. In this article we first obtain some necessary or sufficient conditions for decomposable Parseval wavelet frames. As an application of these conditions, we prove that for each n > 1 there exists a Parseval wavelet frame which is m-decomposable for any 1 < m ≤ n, but not k-decomposable for any k > n. Moreover, there exists a super-wavelet whose components are non-decomposable. Similarly we also prove that for each n > 1, there exists a Parseval wavelet frame that can be extended to a super-wavelet of length m for any 1 < m ≤ n, but can not be extended to any super-wavelet of length k with k > n. The connection between decomposable Parseval wavelet frames and super-wavelets is investigated, and some necessary or sufficient conditions for extendable Parseval wavelet frames are given.     

Specular reflectance of cold-rolled aluminum surfaces

The specular reflectance of cold-rolled aluminum surface is studied using a fiber optic system. An approximation for the determination of surface roughness is presented.