关于康托集类光栅的实验探究

设计制作了康托集分形衍射光栅,通过对康托集分形光栅3个阶段的夫琅禾费衍射现象的观察,根据惠更斯-菲涅耳原理,得到了一维康托集分形光栅的夫琅禾费衍射光强分布特性.     

BP神经网络-FTIR方法测定苯乙烯-丙烯酸丁酯共聚物中单体含量

利用红外特征峰波数偏移值与单体含量间的非线性定量关系,BP人工神经网络-FTIR法在较宽的含量范围(10%-90%之间)之内,准确测定了苯乙烯-丙烯酸丁酯共聚物中丙烯酸丁酯单体含量,回收率在97.3%-101.8%之间.     

Simple, expedient methods for the determination of water and electrolyte contents of cellulose solvent systems

The concentrations of water, W, and electrolytes present in solutions of LiCl in N,N-dimethylacetamide, LiCl/DMAc, and of tetrabutylammonium fluoride. x-hydrate in DMSO, TBAF.xW/DMSO can be accurately and expediently determined by three independent methods, UV–vis, FTIR and EMF measurement. The first relies on the use of solvatochromic probes whose spectra are sensitive to solution composition. It is applicable to W/LiCl/DMAc solutions but not to TBAF.xW/DMSO, because the charge-transfer complex bands of the probes are suppressed by strong interactions with the latter electrolyte. Integration of ν_OH band of water may be employed in order to determine [W], hence [electrolyte] by weight difference. EMF measurement uses ion-selective electrodes in order to determine [electrolyte], hence [W] by weight difference. Results of the latter method were in excellent agreement with those of FTIR. The reason for the failure of Karl Fischer titration is addressed, and the relevance of the results obtained to functionalization of cellulose under homogenous solution conditions is briefly commented on.     

集群计算机上基于BSP模型的并行算法及其程序设计

文章分析了BSP模型和集群计算机的特点，给出了在集群计算机根据BSP模型设计并行算法及其软件的原则，举例说明了利用BSP模型代价公式定性分析并行算法性能的方法，并利用实验结果验证了得出的结论。结果表明模型的成功地抽象出了集群计算中影响算法性能的诸种因素，并通过代价公式反映出来，利用代价公式可以基本准确地估计并行算法代价，这对集群计算机上的并行算法及其软件及设计和优化具有重要的指导意义。     

条件概率关系数据库模型

现实世界中大量存在着的不确定性信息，关系数据库模型仅视它们为空值，有必要增强其处理这类信息的能力，文章在总结前人工作的基础上推广关系数据库模型，创建有效处理随机型不确定性信息的条件概念关系数据库模型，该模型通过在关系模式中增加一个条件概率测度属性，为每条记录指定适当的条件概率的途径，来表示不确定性信息。文中以对象码为基本工具，创建了条件概率关系结构；以特征函数为基本工具，定义了一套基于该结构的代数运算规则。条件概率的语意比概率的语意广泛，灵活，因而该模型能有效克服概率关系模型的许多不足。     

移动IP综述

论述了移动IP的概念和发展过程，分析了国内外对移动IP研究的重点问题及其方法，对移动IP的发展方向进行了归纳和总结，并提出了有关用的问题。     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Newton-Leibniz integration for ket-bra operators in quantum mechanics and derivation of entangled state representations

Newton-Leibniz integration rule only applies to commuting functions of continuum variables, while operators made of Dirac’s symbols (ket versus bra, e.g., |q〉〈q| of continuous parameter q) in quantum mechanics are usually not commutative. Therefore, integrations over the operators of type |〉〈| cannot be directly performed by Newton-Leibniz rule. We invented an innovative technique of integration within an ordered product (IWOP) of operators that made the integration of non-commutative operators possible. The IWOP technique thus bridges this mathematical gap between classical mechanics and quantum mechanics, and further reveals the beauty and elegance of Dirac’s symbolic method and transformation theory. Various applications of the IWOP technique, including constructing the entangled state representations and their applications, are presented.     

Multiple image encryption using an aperture-modulated optical system

A multiple image cryptosystem based on different apertures in an optical set-up under a holographic arrangement is proposed. The system is a security architecture that uses different pupil aperture mask in the encoding lens to encrypt different images. Based on this approach multiple encryption is achieved by changing the pupil aperture arrangement of the optical system among exposures. In addition to the classical speckle phase mask, the geometrical parameters characterizing the apertures are introduced to increase the system security. Even when an illegal user steals the speckle phase mask, the system cannot be broken into without the correct pupil geometrical parameters. The experimental set-up is based on a volume photorefractive BSO crystal as storing device. Information retrieval is done via a phase conjugation operation. We also have to stress that the multiple storage under this scheme, is only possible with the help of the aperture mask. Simulation and experimental results are further introduced to verify the proposed method.     

Spectral line suppression and sideband narrowing via quantum interference

We reveal that for a realistic system, interference effects are obtained such as the suppression of central line and inner sidebands and the narrowing of the outer fluorescence sidebands. For this purpose, we consider a spontaneous decay from an excited state to a metastable state when the excited and metastable states are resonantly coupled to an auxiliary metastable state by a laser field and a microwave field, respectively. The fluorescence spectrum evolves from a five-peaked structure into a doublet of ultrasharp lines as the ratio of the laser field Rabi frequency to the microwave Rabi frequency is decreased. The physical origin is presented in terms of dressed states.