Compact difference approximation with consistent boundary condition

For simulating multi-scale complex flow fields it should be noted that all the physical quantities we are interested in must be simulated well. With limitation of the computer resources it is preferred to use high order accurate difference schemes. Because of their high accuracy and small stencil of grid points computational fluid dynamics (CFD) workers pay more attention to compact schemes recently. For simulating the complex flow fields the treatment of boundary conditions at the far field boundary points and near far field boundary points is very important. According to authors' experience and published results some aspects of boundary condition treatment for far field boundary are presented, and the emphasis is on treatment of boundary conditions for the upwind compact schemes. The consistent treatment of boundary conditions at the near boundary points is also discussed. At the end of the paper are given some numerical examples. The computed results with presented method are satisfactory.     

脲酶高产菌的筛选和产酶条件的研究

从红壤稻田分离产胞外脲酶活性高的细菌、放线菌和真菌各20株.细菌、放线菌、真菌产脲酶活力的平均值分别为0.764,1.104,0.847μmol/min.产脲酶能力大小为:放线菌>真菌>细菌.我们研究了一株放线菌Dactylosprangiumaurantiacum产胞外脲酶的条件.结果表明:该菌产酶的最佳培养时间为42h;产酶的最佳培养温度为28℃;产酶的最佳起始pH为7;葡萄糖、鼠李糖和甘露糖等碳源对产酶有利;硝酸铵、氯化铵和硫酸铵对产酶有利;钙、镁等金属离子能促进产酶.     

具有混合边界条件的地下水污染模型的强解存在性

给出具有混合边界条件的地下水污染模型的弱解和强解定义，用积分估计法得到了强解（如果存在）的先验一致估计，利用半－Ｇａｌｅｒｋｉｎ方法和紧性原理证明了上述方程组强解的局部存在性     

主理想整环上的线性方程组

对主理想整环上的线性方程组作了初步探讨，推广了域上线性方程组的已知结果，并给出求解的几种新方法。     

超对称量子力学中─维形状不变势与严格解

找到几个具有形状不变性的一维势，用超对称量子力学理论求得其束缚态能量的严格表达式．给出已知所有形状不变势中束缚态数为有限者的数目，丰富了形状不变势的家族．     

手写印刷体汉字识别中特征及提取方法的改进

通过对汉字整体结构的分析及描述，在传统的特征点基础上，我们双提出了一种新的特征点，并对常用的特征点判别方法进行了改进。这种方法可以应用于印刷汉字及允许一定变形的手写体汉字，经实验表明，提取精度较高。     

有限补空间与可数补空间的若干讨论

本文讨论了有限补空间与可数补空间的连通性、分离性、紧性及可数性等拓扑不变性质．     

故障诊断中几种征兆自动获取技术研究

研究了故障诊断系统中几种诊断征兆的自动获取机制，给出了对不同类型的征兆实现自动获取的有效方法．着重研究了轴心轨迹图形的自动识别问题，提出了利用图形的不变性矩特征的识别技术，构造了基于不变性特征矩的特征向量，定义了特征矩向量之间的距离，提出了置信度的度量方法．通过对轴心轨迹的仿真和实际识别，表明该方法是可行的     

我院男篮队员篮球意识的现状及培养

运用文献资料法与实地观察法，以漳州师范学院男篮运动员为研究对象，分析了该校男篮运动员的篮球意识现状，提出了培养和改善篮球意识的措施及方法。     

A QUANTIFIER-ELIMINATION BASED HEURISTIC FOR AUTOMATICALLY GENERATING INDUCTIVE ASSERTIONS FOR PROGRAMS

A method using quantifier-elimination is proposed for automatically generating programinvariants/inductive assertions.Given a program,inductive assertions,hypothesized as parameterizedformulas in a theory,are associated with program locations.Parameters in inductive assertions arediscovered by generating constraints on parameters by ensuring that an inductive assertion is indeedpreserved by all execution paths leading to the associated location of the program.The method can beused to discover loop invariants-properties of variables that remain invariant at the entry of a loop.Theparameterized formula can be successively refined by considering execution paths one by one;heuristicscan be developed for determining the order in which the paths are considered.Initialization of programvariables as well as the precondition and postcondition,if available,can also be used to further refinethe hypothesized invariant.The method does not depend on the availability of the precondition andpostcondition of a program.Constraints on parameters generated in this way are solved for possiblevalues of parameters.If no solution is possible,this means that an invariant of the hypothesizedform is not likely to exist for the loop under the assumptions/approximations made to generate theassociated verification condition.Otherwise,if the parametric constraints are solvable,then undercertain conditions on methods for generating these constraints,the strongest possible invariant of thehypothesized form can be generated from most general solutions of the parametric constraints.Theapproach is illustrated using the logical languages of conjunction of polynomial equations as well asPresburger arithmetic for expressing assertions.