Geometrically non-linear analysis of laminated composite structures using a 4-node co-rotational shell element with enhanced strains

To demonstrate the solutions of linear and geometrically non-linear analysis of laminated composite plates and shells, the co-rotational non-linear formulation of the shell element is presented. The combinations of an enhanced assumed strain (EAS) in the membrane strains and assumed natural strains (ANS) in the shear strains improve the behavior of 4-node shell element. To secure computational efficiency in the incremental non-linear analysis, the present element uses the form of the resultant forces pre-integrated through the thickness. The transverse shear stiffness of the laminates is defined by an equilibrium approach instead of the shear correction factor. Numerical examples of this study show very good agreement with the references.     

循环码译码的Dixon结式方法

针对纠错码译码就是非线性方程组的求解问题,提出利用Dixon结式方法对译码方程进行消元以得到接收数据中的错位多项式.首先,根据纠错码的纠错能力和接收数据得到伴随式矩阵并通过该矩阵的秩确定接收码字中错误位的个数.然后,根据错位个数和伴随多项式构造译码方程.译码时,将其中一个错位变元作为隐藏变元,利用Dixon结式方法进行消元.最后,得到的Dixon结式就是关于隐藏变元的多项式.该多项式去掉多余因子后就是错位多项式,利用Chien搜索法即可求解出错误位置.当错位较多时,采用逐次计算结式的方法以筛除计算过程中的多余因子和重因子.另外,根据不同错位个数得到的错位多项式,提出了构造一类循环码错位多项式符号解的猜想,该猜想可以大大提高译码效率.实验验证了结式理论在纠错码译码方面的应用是有效的且有助于降低对芯片性能的要求.     

降维变分方法

依据能量原理建立降维变分法,该方法将物体离散为条,在一定约束下,一条独立求解能量极值,可有效简化数值计算,本文研究分条离散方法,极值约束,边界条件处理并给出证明.更重要的,该方法揭示了新的物体形变运动规律.在此也做了分析.     

Three kinds of extraneous factors in Dixon resultants

Dixon resultant is a basic elimination method which has been used widely in the high technology fields of automatic control, robotics, etc. But how to remove extraneous factors in Dixon resultants has been a very difficult problem. In this paper, we discover some extraneous factors by expressing the Dixon resultant in a linear combination of original polynomial system. Furthermore, it has been proved that the factors mentioned above include three parts which come from Dixon derived polynomials, Dixon matrix and the resulting resultant expression by substituting Dixon derived polynomials respectively. This work was supported by the National Key Basic Special Funds of China (Grant No. 2004CB318003), the Knowledge Innovation Project of the Chinese Academy of Sciences (Grant No. KJCX2-YW-S02), the National Natural Science Foundation of China (Grant No. 90718041), Shanghai Leading Academic Discipline Project (Grant No. B412) and the Doctor Startup Foundation of East China Normal University (Grant No. 790013J4)     

人力资本培训投资的博弈分析

针对人力资本组合投资模式仅定性分析职员和企业对人力资本投资行为的特点，应用博弈论进行了相应的定量分析，将贝克尔投资模式与组合投资模式相结合，建立了确定企业投资比率的计算公式，为企业进行人力资本培训投资提供了定量的决策依据。     

The Computational Complexity of the Chow Form

We present a bounded probability algorithm for the computation of the Chowforms of the equidimensional components of an algebraic variety. In particular, this gives an alternative procedure for the effective equidimensional decomposition of the variety, since each equidimensional component is characterized by its Chow form. The expected complexity of the algorithm is polynomial in the size and the geometric degree of the input equation system defining the variety. Hence it improves (or meets in some special cases) the complexity of all previous algorithms for computing Chow forms. In addition to this, we clarify the probability and uniformity aspects, which constitutes a further contribution of the paper. The algorithm is based on elimination theory techniques, in line with the geometric resolution algorithm due to M. Giusti, J. Heintz, L. M. Pardo, and their collaborators. In fact, ours can be considered as an extension of their algorithm for zero-dimensional systems to the case of positive-dimensional varieties. The key element for dealing with positive-dimensional varieties is a new Poisson-type product formula. This formula allows us to compute the Chow form of an equidimensional variety from a suitable zero-dimensional fiber. As an application, we obtain an algorithm to compute a subclass of sparse resultants, whose complexity is polynomial in the dimension and the volume of the input set of exponents. As another application, we derive an algorithm for the computation of the (unique) solution of a generic overdetermined polynomial equation system.     

矢量合成移相器

描述一种可靠性、价格、能耗和体积诸方面都优于机械相位调节器的新型电控移相器，它的工作原理基于矢量合成，故定名为矢量合成移相器。并已在兰州重离子加速器相位稳定系统０号、４号、６号机柜中代替机械相位调节器，取得了令人满意的结果。     

Periodic decomposition of integer valued functions

We study those functions that can be written as a finite sum of periodic integer valued functions. On ℤ we give three different characterizations of these functions. For this we prove that the existence of a real valued periodic decomposition of a ℤ → ℤ function implies the existence of an integer valued periodic decomposition with the same periods. This result depends on the representation of the greatest common divisor of certain polynomials with integer coefficients as a linear combination of the given polynomials where the coefficients also belong to ℤ[x]. We give an example of an ℤ → {0, 1} function that has a bounded real valued periodic decomposition but does not have a bounded integer valued periodic decomposition with the same periods. It follows that the class of bounded ℤ → ℤ functions has the decomposition property as opposed to the class of bounded ℝ → ℤ functions. If the periods are pairwise commensurable or not prescribed, then we get more general results. Supported by OTKA grants T 43623 and K 61908.     

GEOMETRICAL METHOD TO DETERMINE THE CENTER OF A PARALLEL FORCE SYSTEM

在求平行力系中心位置的过程中,要用到合力矩定理. 现有方法把合力的作用点设为平行力系中心,较难理解. 该文应用合力矩定理时,把合力作用点假设为合力作用线上任意一点,平行力系合力作用线总是通过一个固定点的物理意义非常明确.