多波长数据线性回归光度法同时测定钙和镁

本文研究了酸性铬蓝K体系用于同时测定钙和慎的显色条件，借助多波长线性回归法处理数据，提出光度测定钙和镁的简便方法，免去了分离手续。应用于三个水样中钙、镁含量的测定，结果满意。     

A MODIFIED HOMOGENEOUS AND SELF-DUAL LINEAR PROGRAMMING ALGORITHM

ＡＭＯＤＩＦＩＥＤＨＯＭＯＧＥＮＥＯＵＳＡＮＤＳＥＬＦ－ＤＵＡＬＬＩＮＥＡＲＰＲＯＧＲＡＭＭＩＮＧＡＬＧＯＲＩＴＨＭ￥ＧＵＯＴｉａｎｄｅ（ＭａｔｈｅｍａｔｉｃｓＤｅｐａｒｔｍｅｎｔ，ＱｕｆｕＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｑｕｆｕ２７３１６５，Ｃｈ...     

商空间的基

通过引入一个熟知的线性空间作桥梁，揭示了商空闻R^n／S基与矩阵A之间的关系。     

再议网络图的逻辑同构变换

图对同一个逻辑问题可有不同的表达方式，在必要时需进行逻辑同构变换＾［１］。本文对“节点型网络向箭线型网络的逻辑风构变换”的研究进行了补充，增加了三种情况的图开有子模，进一步谁了逐节生长法的通用性。同时，提出了箭线型网络向节点型网络逆向变换的算法；逐线收缩法。     

中立型多滞量微分系统Runge-Kutta方法的A(a)稳定性分析

在中立型多滞量线性微分方程系统的理论解的基础上,讨论Runge-Kutta 方法的稳定性,得到一个)(aA稳定的充分条件。     

线性谐振子的计算机代数计算

采用计算机代数方法，通过Mathematica软件计算线性谐振子的波函数，几率密度和几率最大值的位置。计算方法简单、通用，易于推广。     

Estimation and testing of time-varying coefficient regression models in the presence of linear restrictions

A linear regression model with random walk coefficients is extended to allow for linear restrictions between the coefficients to be satisfied at each point in time. Estimation in this model is shown to be no more involved than estimation in the standard model. It is also demonstrated how, after a slight modification to the testing problem, classical test procedures may be applied to the problem of testing for such restrictions. The performance of the Lagrange Multiplier test for a variety of different restrictions is then investigated via simulation. An empirical application involving testing for homogeneity in a random walk coefficient version of the AIDS model is given.     

二部分有向图的计数公式

应用置换群的Burnside引理,导出非标定二部分竞赛图和二部分完全有向图的计数公式.     

A ROBUST DECOMPOSITION OF LINEAR PROGRAMMING USING A GOAL-PARTITIONING METHOD

The Dantzig/Wolfe linear programming decomposition algorithm has had important economicinterpretations as well as a widespread impact on solving large scale linear programming problem.Inthis paper we consider a similar underlying structure,where however there is only one couplinginequality or equation.With this simplification,we demonstrate how to achieve an equitable partitionof the overall coupling resource to individual subproblem constraints through a simple iterationprocedure which appears to be very efficient.     

Algorithm of graph isomorphism with threedimensional DNA graph structures

ResearchonDNAcomputingwasinitializedin1994 ,whenAdleman[1] proposedamethodofsolvingasmallinstanceoftheHamiltonianPathproblembyalaboratoryexperimentinvolvingDNAmolecules .Later,Lipton[2 ] demonstratedhowalargeclassofNP completeproblemscouldbesolvedbyencodingtheprobleminDNAmolecules .Inparticular ,LiptonshowedonefamousNP problem ,theso called“satisfiability”problem (SAT)andsubsequentlytheotherNP problemscouldbeencodedandsolvedusingmolecules .TheadvantagesofDNAcomputingareitsmassivepa…