乡镇供水工程设计中应注意的若干问题

乡镇供水作为水利开发建设中的一个新领域，设计工作是龙头，有许多技术问题需要研究和探索，阐述了乡镇供水工程设计应注意的若干问题，并对设计中存在的一些具体问题进行了分析和探讨。     

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

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

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

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

On the determination of optimal transition profile of a stepped bar in tension or in torsion by BEM

The objective is to have uniformly distributed tangential stresses on the transition profile of a stepped bar subjected to tensile and torsional loading using an axisymmetric boundary element formulation. The transition curve is represented by the Langragian interpolation polynomial with progressive degrees to avoid shape distortion during the optimization procedure. The calculated result is compared with that obtained by fluid dynamics given in the literature. It is seen that the transition curve obtained in this paper is reasonable.     

鲁奇加压气化炉的火层控制

通过对影响气化炉火层各因素的分析，理论与实际相结合，推导出现见性控制气化炉火层的经验式，应用于生产实际中，起到了指导生产的作用。     

用超声波技术测量螺栓轴向紧固应力

超声波速度会因材料中加载应力而产生微小的变化，这一现象特别适用于测量螺栓的轴向应力。根据螺栓的轴向应力与超声波传播时间变化率的关系，作者研究了一种可直接测量螺栓轴同应力的仪器。实验结果显示，本项技术十分适合现场的实际应用。     

抗洪抢险措施及效果

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

机器人腕力传感器的动态负载效应

本文从时域和频域两方面研究机器人腕力传感器在加载情况下的动态响应，进行动态建模和频谱分析，探讨负载效应的影响。     

Error in the UNITY substitution rule for subscripted operators

UNITY, introduced by Chandy and Misra [ChM88], is a programming logic intended to reason about temporal properties of distributed programs. Despite the fact that UNITY does not have the full power of, for example, linear temporal logic, it enjoys popularity due to its simplicity.There was however a serious problem with the Substitution Rule. The logic is incomplete without the rule, and with the rule it is inconsistent.     

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.