ㄇ形梁剪力滞效应的解析解

精确分析ㄇ形梁在纵横向荷载共同作用下,其横断面上正应力分布规律对于计算其有效宽度有重要意义,应用力法原理,先将ㄇ形梁和翼板截开成矩形截面梁和平面应力板,在截面上代之以赘余的分布剪力,对于平面应力板,通过利用板变形的对称性来简化其边界条件,然后假设一个满足板的控制方程的Airy应力函数求得板的应力和位移,再利用Timoshenko梁理论求得梁的挠度和转角,根据截面上梁与板的纵向位移相等的变形协调条件便可最终确定截面上的分布剪力,给出的数值算例验证了方法的有效性,并与铜陵长江公路大桥主梁的模型有限元结果和试验结果作了对比,解析解法还可用来检验其他各种数值计算方法的精度,并可推广到其他多跨薄壁结构梁桥的膜应力分析中。     

Range of the Applicability of the Wilkins Method to the Investigation of the Dynamic Stress-Strain State of Anisotropic Elastic Axisymmetric Shells

The exactness and stability of the Wilkins method in the investigation of the stress-strain state of axisymmetric anisotropic elastic shells, including thick-walled ones, have been studied for different values of artificial viscosity, pulse load rise and fall time, and different deformation process durations. A comparison of numerical calculations, performed by means of an application software package developed by V. A. Romashchenko on the basis of the Wilkins method, with experimental results, known numerical data, and with calculations using the computation kernel LS-DYNA 3D has been carried out.     

带隔板底水油藏油井临界产量计算公式

本给出了带隔板底水油藏油井的监界产量计算公式，它适用于所有带隔板底水油藏的油井。     

给水管网计算中的数据转换方法

在给水管网计算中,通过建立环-管段矩阵、环-节点矩阵以及输入节点流量、节点坐标等少量数据,通过计算和数据转换,便可求得经济管径、管段设计流量、节点水压值、水厂供水量、管网造价、年费用折算值等。采用该方法进行管网计算,可以减少40%～70%的计算时间。     

Proving termination of GHC programs

A transformational approach for proving termination of parallel logic programs such as GHC programs is proposed. A transformation from GHC programs to term rewriting systems is developed; it exploits the fact that unifications in GHC-resolution correspond to matchings. The termination of a GHC program for a class of queries is implied by the termination of the resulting rewrite system. This approach facilitates the applicability of a wide range of termination techniques developed for rewrite systems in proving termination of GHC programs. The method consists of three steps: (a) deriving moding information from a given GHC program, (b) transforming the GHC program into a term rewriting system using the moding information, and finally (c) proving termination of the resulting rewrite system. Using this method, the termination of many benchmark GHC programs such as quick-sort, merge-sort, merge, split, fair-split and append, etc., can be proved. This is a revised and extended version of Ref. 12). The work was partially supported by the NSF Indo-US grant INT-9416687 Kapur was partially supported by NSF Grant nos. CCR-8906678 and INT-9014074. M. R. K. Krishna Rao, Ph.D.: He currently works as a senior research fellow at Griffith University, Brisbane, Australia. His current interests are in the areas of logic programming, modular aspects and noncopying implementations of term rewriting, learning logic programs from examples and conuterexamples and dynamics of mental states in rational agent architectures. He received his Ph.D in computer science from Tata Institute of Fundamental Research (TIFR), Bombay in 1993 and worked at TIFR and Max Planck Institut für Informatik, Saarbrücken until January 1997. Deepak Kapur, Ph.D.: He currently works as a professor at the State University of New York at Albany. His research interests are in the areas of automated reasoning, term rewriting, constraint solving, algebraic and geometric reasoning and its applications in computer vision, symbolic computation, formal methods, specification and verification. He obtained his Ph.D. in Computer Science from MIT in 1980. He worked at General Electric Corporate Research and Development until 1987. Prof. Kapur is the editor-in-chief of the Journal of Automated Reasoning. He also serves on the editorial boards of Journal of Logic Programming, Journal on Constraints, and Journal of Applicable Algebra in Engineering, Communication and Computer Science. R. K. Shyamasundar, Ph.D.: He currently works as a professor at Tata Institute of Fundamental Research (TIFR), Bombay. His current intersts are in the areas of logic programming, reactive and real time programming, constraint solving, formal methods, specification and verification. He received his Ph.D in computer science from Indian Institute of Science, Bangalore in 1975 and has been a faculty member at Tata Institute of Fundamental Research since then. He has been a visiting/regular faculty member at Technological University of Eindhoven, University of Utrecht, IBM TJ Watson Research Centre, Pennsylvania State University, University of Illinois at Urbana-Champaign, INRIA and ENSMP, France. He has served on (and chaired) Program Committees of many International Conferences and has been on the Editorial Committees.     

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.     

考虑变质量湍流影响的水平井流入动态分析

在水平井生产过程中,井筒内管流与地层渗流互相制约、互相影响、互为边界条件,从而构成了一个完整的水动力学体系。根据水平井生产时井筒内管流与油藏的相互作用关系,建立了水平井筒存在压力梯度的变质量湍流与地层渗流的耦合计算新方法。关于井筒内流的计算;应用了经典的k_εM湍流模型,关于地层的渗流计算,采用了有限元法。通过耦合模拟获得了井筒内湍流场流速分布及总压能损耗的规律,根据耦合模拟计算结果绘出了较为准确的水平井流入动态曲线。该计算方法为描述水平井流入动态、评价水平井产能、确定合理生产制度提供了可靠的手段.     

并行哈夫曼编码器的硬件设计与实现

文章设计了一种并行编码的哈夫曼硬件编码器，它采用了流水线和并行编码方法，使得在一个时钟周期内可以编码一个字节的数据，在编码时显著降低了工作频率。文章给出了关键部分的实现方案并分析了实验结果。     

一种新的TDRSS扩频调制方式的研究

本文讨论跟踪及数字中继卫星系统（TDRSS）一种新通信体制，即并行MSK扩频系统，发射端采用长短码正交扩频的平衡调制，接收端采用一种简单解扩方式简化了并行MSK信号的解调，同时用短码全“1”引导长码同步的方法大大减小了长码的捕获时间，实验结果证明了良好的伪码同步性能。