关键词： 原子吸收光谱   多元混合干扰   化学计量学  

摘要： 研究了火焰原子吸收光谱分析中多元混合干扰效应的计算消除方法．提出用多项式作为定量描述主测元素与干扰元素之间关系的通用数学模型，并对计算机自动寻找适宜的数学模型作了探讨。运用和尝试了一种新的下降算法──搜索法。本文是对多元统计方法在原子光谱分析中的应用的探索。在对多组分体系进行分析时，利用其元素间相互干扰时所形成的体系总吸光度与各组分浓度间的函数关系，用增量法去形成所需的系数矩阵，从而实现了在单波长处进行多元统计分析。

关键词： 数学模型   半空间分割法   特征映射   算法   CIMS   计算机集成制造系统  

摘要： 本文在建立半空间分割法数学模型的基础上，通过实例研究其算法。

关键词： 酶   催化反应   动力学系统   数学分析   拟合算法  

摘要： 本文对米氏机理速率方程进行了数学上合理的分析与推导,得到三个简化模式。以第一个模式作为示例,成功地应用了非线性最小二乘法—Marquardt方法对尿素酶催化反应进行了数据拟合计算分析,所得结果k_1,k_2,k_3,米氏常数和最大速率的平均值分别是5.2mM/s,3.5s^(-1),6.2s^(-1),1.89mM和1.23mM/s,和大多数文献的数据相吻合,结果令人满意。

关键词： 神经网络   结构学习   线性规划   参数学习算法  

摘要： 结构学习是用神经网络解决问题的关键所在.结构学习比参数学习更困难,其本身就包含有参数学习的过程.本文讨论前馈网络的结构学习问题,在网络结构分析的基础上,应用数学规划技术,给出一种融结构学习和参数学习为一体的算法.所给的算法往往能求到最优结构的网络.

关键词： Magnetic Resonance Spectroscopy   Adenosine Triphosphate   Algorithms   Brain Chemistry   Cytosol   Humans   Hydrogen-Ion Concentration   Magnesium   Mathematics   Occipital Lobe   Phosphocreatine  

摘要： Free cytosolic [Mg2+] can be assessed in vivo by P-31 MRS from the chemical shift of beta-ATP which in turn depends on the fraction of total ATP complexed to Mg2+ ions, The reliability of these in vive measurements depends on the availability of an appropriate in vitro calibration to determine the limits of chemical shifts of unbound ATP and Mg-ATP complexes, using solutions that mimic the in vive cytosolic conditions as far as possible, We used an algorithm and software to allow a quantitative definition of the Mg2+-binding molecules to build a semi-empirical equation that correlates the chemical shift of the beta-ATP signal to the [Mg2+] taking into account the amount of Mg2+ bound to all other constituents in solution, Our experiments resulted in a simple and reliable equation directly usable to assess in vive the free cytosolic magnesium concentration of human brain by P-31 MRS. Our method is also flexible enough to make it suitable for in vive measurements of [Mg2+] in other organs and tissues.

关键词： 对话系统   识别语言   述评   语言识别   相互关系   对话模型   语义规则   形式化   分级系统   数学算法  

关键词： Algebra   algorithms  

摘要： This paper demonstrates how certain logic and combinatorial tasks can be solved using CNNs. A design method is proposed for solving combinatorial tasks on a CNN, It can be used to simulate cellular automata on a CNN, to prove the self-reproducing capability of the CNNUM and for sorting, histogram calculation, parity analysis and minimum Hamming distance computation. These solutions are especially useful since they can serve as subroutines of more complex CNNUM algorithms. As an important real-life application the lay-out of printed circuit boards is designed with the CNNUM at an extremely high speed.