我国乳品加工技术创新体系发展方向的研究

从乳品加工产前、产中、产后三个方面，论述了我国乳品工业在技术方向应优先发展领域和发展方向。     

利用黄河泥沙加固下游大堤

黄河是一条举世闻名的多泥沙河流，善淤、善决、善徒给沿河人民带来对过深重灾难，防洪问题一直是国家的心腹之患。泥沙问题是黄河防洪问题的症结所在。在总结固大堤经验的基础，进行挖河疏浚，淤筑“相对地下河”，已作为黄河治理的一项重大决策付诸实施。     

PMN-PT陶瓷中的氧缺位及其消除

研究了组成中Pb含量的变化对组成为Pbx(Mg1/3Nb2/3)0.65Ti0.35O3的铌镁酸铅-钛酸铅(PMN-PT)陶瓷压电性能的影响,发现化学计量比组成(x=1)的Pbx(Mg1/3Nb2/3)0.65Ti0.35O3陶瓷经常出现压电性能的大幅度退化现象,而A位适量缺Pb能稳定地获得高性能的Pbx(Mg1/3Nb2/3)0.65Ti0.35O3陶瓷。XPS元素价态分析的结果表明,化学计量比的Pbx(Mg1/3Nb2/3)0.65Ti0.35O3陶瓷中含有较多的氧缺位,氧缺位的产生源于MgNb2O6(MN)合成过程中的气氛差异,A位适量缺Pb能有效地消除这种氧缺位而稳定地获得正常的压电性能,其机理被认为是氧缺位与铅缺位的复合。     

SJ—YⅡ—5型高爆速高威力水胶炸药的研制

文章简要分析了我国目前在中硬岩石爆破中工业炸药的使用情况，介绍了山西兴安化学材料厂新研制的一种适用于硬岩爆破的高爆速、高威力水胶炸药新品种，对其性能、爆破效果、经济实用性和安全性等进行了阐述。     

The correlation of texture and magnetic properties in Co-Cr films

This investigation focuses on the correlation between the crystallographic orientation of grains with respect to magnetic properties in Co-Cr films. Based on a distribution measured for the (0002) crystallographic pole densities, modified formulae describing the texture were used to calculate the coercivity Hc, the squareness ratio Rs (Mr⊥/TMs) and the anisotropy field Ha for Co-Cr films. In general, calculated values for the coercive force He agreed well with the measured values. The calculated Rs⊥. values were much larger than the measured ones, however, indicating that the influence of the demagnetizing field and the magnetostriction on the orientation of the magnetization cannot be neglected. On leave from Institute of Computing Technology, Academia Sinica, P.O.Box 2704-6, Beijing, P.R. China.     

粗粒土渗透变形机制浅析

对砂卵砾石的渗透变形的形成条件进行了简要分析，在此基础上对渗透变形的形式进行了简要评价，并提出了渗透变形临界坡降的计算方法。     

永定新河河口潮流动力及泥沙特征初步分析

依据永定新河河口１９９７年潮汐观测资料及河道１９９０～１９９７年潮汐观测资料，通过实测资料的整理分析，初步揭示了永定新河河口潮流动力及泥沙特征，为河道的治理规划提供了科学的依据。     

抗洪抢险措施及效果

结合“９８”抗洪抢险实例，对多种险情作了具体分析，通过汛后调查，对抗洪抢险消险措施和效果进行了总结，为今后进一步做好防洪消险工作提供了经验。     

基于属性相关表的关系模式全部候选关键字求法

本文提出了属性相关表这样一种新的概念，定义了相应的运算并研究了它的有关性质及定理，在此基础上提出了用属性相关表求关系模式全部主属性的等级，并给出了用主属性来组合关系模式全部候选关键字的算法，上述算法的时间复杂度均为Ｏ（ｎ＾２）。     

Efficient Parallel Algorithms for Some Graph Theory Problems

In this paper,a sequential algorithm computing the aww vertex pair distance matrix D and the path matrix Pis given.On a PRAM EREW model with p,1≤p≤n^2,processors,a parallel version of the sequential algorithm is shown.This method can also be used to get a parallel algorithm to compute transitive closure array A^* of an undirected graph.The time complexity of the parallel algorithm is O(n^3/p).If D,P and A^* are known,it is shown that the problems to find all connected components,to compute the diameter of an undirected graph,to determine the center of a directed graph and to search for a directed cycle with the minimum(maximum)length in a directed graph can all be solved in O(n^2/p logp)time.