部分真值表在环形分配器设计中的应用

目前步进电机以五相居多，硬件环形分配器用卡罗图来进行设计，则显得复杂冗赘，如果从步进电机运行的规律中找出约束条件，建立部分真值表，便可以直接写出控制逻辑函数，这对于设计相数、拍数较多的步进电机的环形分配器极为方便，这种设计思路在进行数字电路工程设计中也是可以值得借鉴的。     

H-空间与拟向量变分不等式

本在Hausdorff locally convex H-空间上建立了一个新的不动点定理；利用局部交性质，在Hausdorff locally convex H-空间上建立了相应的拟向量变分不等式．     

构筑产学研结合立体网络的研究与实践

从校内“局域网”、社会“城域网”以及全球“因特网”三个方面探讨产学研结合立体网络的构建。联系工作实际，探索校企合作建设产学研基地和网络的有效途径。     

充分挖掘高校档案资源更好地为地方经济服务

为使高校档案工作能更好地为地方经济服务，必须提高认识，拓宽思路，提升服务的自觉性；内练素质，外树形象，不断提高挖掘和利用的水平；切实解决好标准化建设、与地方政府的沟通、经费投入、复合型人才培养、数据库建设等问题。     

Symmetry of the Barochronous Motions of a Gas

We study the system of nonlinear differential equations which expresses the constancy of the algebraic invariants of the Jacobian matrix for smooth vector fields in three-dimensional space. This system is equivalent to the equations of gas dynamics which describe the barochronous motions of a gas (the pressure and density depend only on the time). We present the results of computation of the admissible local Lie group and construction of the general solution of the system. We mention a few new problems that arise here.     

凸规划的极大熵函数序列及其收敛性

为了消除凸规划问题中极大熵方法所导致的数值病态，该文应用Lagrange乘子法及赋范原理，给出一类凸规划问题的极大熵函数序列，并证明该序列一致收敛于凸规划的最优解。     

Fuzzy Entropy： Axiomatic Definition and Neural Networks Model

The measure of uncertainty is adopted as a measure of information. The measures of fuzziness are known as fuzzy information measures. The measure of a quantity of fuzzy information gained from a fuzzy set or fuzzy system is known as fuzzy entropy. Fuzzy entropy has been focused and studied by many researchers in various fields. In this paper, firstly, the axiomatic definition of fuzzy entropy is discussed. Then, neural networks model of fuzzy entropy is proposed, based on the computing capability of neural networks. In the end, two examples are discussed to show the efficiency of the model.     

论数字时代地方文献目录之编制

从咨访文献学家、选择合适人才、搜集地方文献书目信息等角度探讨了关于编制地方文献目录的问题。     

Structure theorem for tournaments omitting N5

A finite tournament T is tight if the class of finite tournaments omitting T is well‐quasi‐ordered. We show here that a certain tournament N₅ on five vertices is tight. This is one of the main steps in an exact classification of the tight tournaments, as explained in [10]; the third and final step is carried out in [11]. The proof involves an encoding of the indecomposable tournaments omitting N₅ by a finite alphabet, followed by an application of Kruskal's Tree Theorem. This problem arises in model theory and in computational complexity in a more general form, which remains open: the problem is to give an effective criterion for a finite set {T₁,…,T_k} of finite tournaments to be tight in the sense that the class of all finite tournaments omitting each of T₁,…,T_k is well‐quasi‐ordered. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 165–192, 2003