Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

溶胶-凝胶制备技术与新型催化材料Ⅲ.溶胶粒子表面修饰方法制备催化膜

提出用溶胶粒子表面修饰方法，结合溶胶凝胶技术制备无机催化膜．该方法的基本原理是利用合适的金属配合物在胶粒表面的吸附作用，经溶胶凝胶过程，将活性组分结合到无机膜中．实验测定结果表明：（ＮｉＥＤＴＡ）２－，ＶＯ－３，ＭｏＯ２－４，（Ｐｄ（ＮＨ３）４）２＋，ＰｄＣｌ２－４，ＰｔＣｌ２－６和ＲｈＣｌ３－６可用来修饰ＡｌＯＯＨ溶胶．以Ｐｄ／γＡｌ２Ｏ３催化膜的制备为例，经三次溶胶凝胶过程，可制得无裂缺的厚度为９μｍ的Ｐｄ／γＡｌ２Ｏ３催化膜，膜材料的平均孔直径为６ｎｍ，Ｐｄ被均匀地分布在膜的顶层，其平均粒径为２３ｎｍ．     

Linearization of column responses by correlation chromatography. Separation improvement and reduction of undesired adsorption effects

Summary Experiments and simulations prove that correlation chromatography can greatly reduce the disadvantage of a non-linear response of the chromatographic column. A factor that has been accepted as being an important source of error in correlation or multiplex chromatography, has been shown not to be. Separations affected, improve dramatically when correlation chromatography is used, and a substantial amount of correlation noise only arises when there is a large difference in separation between a conventional chromatogram and a correlogram.A model has been developed for simulating these nonlinearities. It is shown that, especially for correlation chromatography, the simulation results match the practical measurements very well.     

Generalization of Murty's direct algorithm to linear and convex quadratic programming

Murty's algorithm for the linear complementarity problem is generalized to solve the optimality conditions for linear and convex quadratic programming problems with both equality and inequality constraints. An implementation is suggested which provides both efficiency and tight error control. Numerical experiments as well as field tests in various applications show favorable results.The author thanks K. G. Murty for his encouragement and helpful comments.     

模糊线性回归模型的约束最小二乘估计

自Tanaka等1982年提出模糊回归概念以来,该问题已得到广泛的研究。作为主要估计方法之一的模糊最小二乘估计以其与统计最小二乘估计的密切联系更受到人们的重视。本文依据适当定义的两个模糊数之间的距离,提出了模糊线性回归模型的一个约束最小二乘估计方法,该方法不仅能使估计的模糊参数的宽度具有非负性而且估计的模糊参数的中心线与传统的最小二乘估计相一致。最后,通过数值例子说明了所提方法的具体应用。     

新生MnO2对酸性媒介黑T的吸附

以化学法合成的新生MnO2为吸附剂，对水中酸性媒介黑T（染料之一）进行了吸附脱色研究，并探讨了影响吸附的因素。结果表明，酸性媒介黑T的脱色率达95%。且PH是影响染料脱色的主要因素。     

时变线性系统特征根判稳的推广

本文研究了二维时变线性系统零解的稳定性，给出了一些允许系数矩阵主对角元变号，系数矩阵特征根变号的判定稳定性的充分条件。