神经网络法计算镉（Ⅱ）,羟基及碳酸根三元体系的形态分布

采用前馈线笥网络ＢＰ算法，计算了Ｃｄ６２＋－ＯＨ＾－ＣＯ＾２－３三元体系的累积稳定常数。用Ｈｏｐｆｉｅｌｄ反馈网络研究了体系中络合物的形态分布。溶液中溶解的ＣＯ２对ｌｇβ１的计算结果有重要影响，对ｌｇβ２，ｌｇβ３，ｌｇβ４的结果影响不大。     

一种漂移室定位子性能反常现象的研究

研究了一种漂移室定位子性能的反常现象,它关系到定位子的使用寿命．着重测量了暗电流和随机噪声与时间、高压及温度的关系.     

不良导体热系数和热体散热率测量方法研究(英文)

本文介绍一种直接测量散热率新方法．进而测出不良导体的热系数。该方法，减小了由间接测量散热率所带来的误差，实验装置简单，操作方便，参数少，测量结果的精确性和重复性都有较大提高，更重要的是这一新的实验方法突出了物理思想。     

第I类非自共轭锥上的Gamma函数

本文将Ｇａｍｍａ函数及Ｓｉｅｇｅｌ积分推广到一般的第Ｉ类非自共轭锥上．作为其应用，显式给出了以这些锥为底的管状域（或第一类Ｓｉｅｇｅｌ域）的Ｃａｕｃｈｙ Ｓｚｅｇ¨ｏ核和形式Ｐｏｉｓｏｎ核．     

三种胺羧配合物的113Cd NMR研究

该文对Cd-HEDTA(N-(2-羟基乙基)乙二胺-N',N',N'-三乙酸),Cd-PDTA(1,2丙二胺四乙酸)和Cd-DTPA(二乙三胺五乙酸)的¹¹³Cd NMR谱和自旋晶格弛豫时间T₁,及NOE因子进行了研究.结果表明,Cd-HEDTA和Cd-PDTA结构与Cd-EDTA类似,Cd-PDTA双线归因于其可能的两种异构体.Cd-DTPA大的化学位移表明其具有七配位的五角双锥结构.在这种结构中DTPA可用三个氮原子参加配位.对¹¹³Cd自旋晶格弛豫时间分析表明,Cd-DTPA配合物中质子偶极作用机理的贡献较大,这归因于Cd DTPA有更多的乙酸根亚甲基质子参与偶极作用.     

Browder-Petryshyn 型的严格伪压缩映射的粘滞迭代逼近方法

主要研究Browder-Petryshyn型的严格伪压缩映射的粘滞迭代逼近过程,证明了Browder-Petryshyn型的严格伪压缩映射的不动点集F(T)是闭凸集．在q-一致光滑且一致凸的Banach空间中,对于严格伪压缩映射T,利用徐洪坤在2004年引进的粘滞迭代得到的序列弱收敛于T的某个不动点．同时证明了Hilbert空间中Browder-Petryshyn型的严格伪压缩映射的相应迭代序列强收敛到T的某个不动点,其结果推广与改进了徐洪坤2004年的相应结果．     

A Construction of Optimal Constant Composition Codes

In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].     

Analysis method of the effect of fabrication errors on a planar waveguide demultiplexer

The impact of fabrication errors on a planar waveguide demultiplexer is analyzed based on an analytical method. The explicit expression of the transfer function taking into account phase and amplitude errors is presented in order to analyze the loss and crosstalk of the demultiplexer caused by fabrication errors. A basic requirement for the demultiplexer with a certain crosstalk criterion can be easily obtained. Using an etched diffraction grating demultiplexer as an example, it is shown that the analytical results have a good agreement with results from a numerical method.     

On potentially <Emphasis Type="Italic">H</Emphasis>-graphic sequences

For given a graph H, a graphic sequence π = (d ₁, d ₂,..., d _n) is said to be potentially H-graphic if there is a realization of π containing H as a subgraph. In this paper, we characterize the potentially (K ₅ − e)-positive graphic sequences and give two simple necessary and sufficient conditions for a positive graphic sequence π to be potentially K ₅-graphic, where K _r is a complete graph on r vertices and K _r-e is a graph obtained from K _r by deleting one edge. Moreover, we also give a simple necessary and sufficient condition for a positive graphic sequence π to be potentially K ₆-graphic. Project supported by National Natural Science Foundation of China (No. 10401010).