参数三次B样条曲线的一种整体光顺方法

本文在能量法的基础上，提出了一种新的目标函数，给出了参数三次Ｂ样条曲线的一种新的整体光顺方法。利用这种方法得到的曲线不仅具有较小的应变能，而且曲率变化比较均匀，具有很好的光顺效果。该方法能推广到对曲面的光顺。     

在酸性介质中N-H伪酸Mannich反应机理的量子化学研究

用量子化学中的ＳＣＦ－ＭＯＡＭ１方法，全优化计算了以苯并唑酮为伪酸组分的（Ｎ－Ｈ酸）Ｍａｎｎｉｃｈ反应的反应物、过渡态和产物络合物的分子几何构型、电子结构和生成热。根据计算所得各反应的活化能，提出了该反应在酸性介质中的机理，即甲醛首先与苯并唑酮作用，其产物再与二甲胺作用生成Ｍａｎｎｉｃｈ碱，并就其缘由进行了讨论。     

迭代回归法计算T型电位滴定中试液含量

本文将迭代回归法计算Ｔ型电位滴定中，叙述了其原理及数学推导，并运算了一批实验数据，结果表明，该法准确度较高，且不需空白溶液校正。     

基于非线性规划的指数自回归模型的辨识

讨论了指数自回归模型的辨识问题，证明了该模型最小二乘估计的目标函数的非凸性，并给出了使该函数为凸的条件，最后给出了辨识该模型的算法及该算法的收敛性，并以数值例子加以说明。     

NUMERICAL SIMULATIONS OF WHOLE FIELD BEHAVIOR FOR ROUND BUOYANT JET

ＮＵＭＥＲＩＣＡＬＳＩＭＵＬＡＴＩＯＮＳＯＦＷＨＯＬＥＦＩＥＬＤＢＥＨＡＶＩＯＲＦＯＲＲＯＵＮＤＢＵＯＹＡＮＴＪＥＴＬｉＷｅｉ，ＨｕａｉＷｅｎ－ｘｉｎ（ＷｕｈａｎＵｎｉｖｅｒｓｉｔｙｏｆＨｙｄｒａｕｌｉｃａｎｄＥｌｅｃｔｒｉｃＥｎｇｉｎｅｅｒｉｎｇ，...     

牙鲆淋巴囊肿病的PCR诊断方法研究

以中国养殖牙鲆 (Paralichthysolivaceus)淋巴囊肿病毒 (Lymphocystisdiseasevirus,LCDVcn)主要衣壳蛋白 (majorcapsidprotein ,MCP)基因的中间保守序列为目标基因 ,设计了一对特异性引物。该引物可扩增出 172bp的病毒DNA片段 ,其最小DNA检出量为 0 0 183ng。用PCR法从人工感染淋巴囊肿病毒 3天的牙鲆血、鳃、肝、脾、肠、胃及自然发病牙鲆的肿瘤中 ,分别检测到了LCDV的存在。本实验结果证明 ,PCR法对于早期检测LCDV是十分有效的。     

An eight‐node hybrid‐stress solid‐shell element for geometric non‐linear analysis of elastic shells

This paper presents eight‐node solid‐shell elements for geometric non‐linear analysis of elastic shells. To subdue shear, trapezoidal and thickness locking, the assumed natural strain method and an ad hoc modified generalized laminate stiffness matrix are employed. A selectively reduced integrated element is formulated with its membrane and bending shear strain components taken to be constant and equal to the ones evaluated at the element centroid. With the generalized stresses arising from the modified generalized laminate stiffness matrix assumed to be independent from the ones obtained from the displacement, an extended Hellinger–Reissner functional can be derived. By choosing the assumed generalized stresses similar to the assumed stresses of a previous solid element, a hybrid‐stress solid‐shell element is formulated. Commonly employed geometric non‐linear homogeneous and laminated shell problems are attempted and our results are close to those of other state‐of‐the‐art elements. Moreover, the hybrid‐stress element converges more readily than the selectively reduced integrated element in all benchmark problems. Copyright © 2002 John Wiley & Sons, Ltd.     

A 3D contact smoothing method using Gregory patches

In this work, a method is developed for smoothing three‐dimensional contact surfaces. The method can be applied to both regular and irregular meshes. The algorithm employs Gregory patches to interpolate finite element nodes and provide tangent plane continuity between adjacent patches. The resulting surface interpolation is used to calculate gaps and contact forces, in a variationally consistent way, such that contact forces due to normal and frictional contact vary smoothly as slave nodes transition from one patch to the next. This eliminates the ‘chatter’ which typically occurs in a standard contact algorithm when a slave node is situated near a master facet edge. The elimination of this chatter provides a significant improvement in convergence behaviour, which is illustrated by a number of numerical examples. Furthermore, smoothed surfaces also provide a more accurate representation of the actual surface, such that resulting stresses and forces can be more accurately computed with coarse meshes in many problems. This fact is also demonstrated by the numerical examples. Published in 2002 by John Wiley & Sons, Ltd.     

Mg-Si基热电化合物的研究现状

重点综述了Mg-Si基热电化合物的基本特性，该体系热电材料的制备方法与掺杂改性的研究进展，并提出了要重点解决的问题。     

A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems

The even-flow harvest scheduling problem arises when the forestry agency has evolved into a rigid non-declining even-flow policy. In this paper, we investigate model formulation and solution strategies for the even-flow harvest scheduling problem. A multiple-objective linear programming problem is formulated for even-flow harvest scheduling problems with multiple-site classes and multiple periods. The aim of this problem is to simultaneously maximize a desired harvest-volume per hectare for each period of planning horizon and the total economic return. A block diagonal constraint structure, with many sets of network sub-problems and a set of coupling constraints, is identified in this linear programming problem. A longest path method for each of network sub-problems and a primal-dual steepest-edge algorithm for the entire problem are developed. The developed algorithm has been coded in Borland C++ and implemented on a personal computer. An illustrative example is used to display the detailed procedure for the developed algorithm and a real-world case study is used to show the trade-off between desired even-flow harvest volume policy and total economic return. Results show the potential benefits of this approach.