番禺30-1砂岩强水驱气藏储层非均质性研究

针对垂向非均质性严重且边底水能量强的番禺30-1气田面临的潜在开发问题，通过岩心分析及测井二次解释，对其夹层特征及储层非均质性等进行了研究，划分出19个流动单元并定量描述了各流动单元的特征参数，建立了该气田的精细地质模型。综合评价表明，新建的地质模型具有较高的精度，为该气藏合理开发提供了坚实的地质基础。     

基于EPF10K30的ISA接口设计

随着计算机技术日新月异的发展。计算机控制已经深入到了各个领域，特别是在工业控制领域，计算机通过ISA总线与接口电路进行通信，然后由接口电路去控制被控设备，从而完成预期的控制工作．     

应用MSP50C30设计电子语音导游机

文章在简要介绍了MSP50C30的结构和特性的基础上，给出了利用MSP50C30设计电子语音导游机的硬件电路和软件编程方法。     

High Accuracy Analysis of the Adini's Nonconforming Element

Received September 14, 2000; revised September 25, 2001     

Ni-Fe-C对YG30硬质合金与45#钢TIG焊过程中η相形成的影响

采用Ni—Fe—C合金作为填充金属，实现了YG30硬质合金与45^#钢的TIG焊。采用光学显微镜、扫描电镜、电子探针、X射线衍射和显微硬度等方法对焊后试样的焊接接头进行了分析。结果表明：(1)采用Ni—Fe—C合金可以获得YG30硬质合金与45^#钢TIG焊的焊接接头；(2)在Ni—Fe合金的基础上加入适量的C可以抑制YG30／焊缝界面侧大块η相的形成；(3)由于C的扩散而引起的W—Co—C体系的贫碳与YG30／焊缝处高浓度Fe的出现是η相形成的重要原因，YG30／焊缝界面侧形成的η相为M6C型和M12C型复合碳化物。     

A Hermitian Box-scheme for One-dimensional Elliptic Equations – Application to Problems with High Contrasts in the Ellipticity

We introduce a new box-scheme, called ``hermitian box-scheme' on the model of the one-dimensional Poisson problem. The scheme combines features of the box-scheme of Keller, [20], [13], with the hermitian approximation of the gradient on a compact stencil, which is characteristic of compact schemes, [9], [21]. The resulting scheme is proved to be 4th order accurate for the primitive unknown u and its gradient p. The proved convergence rate is 1.5 for (u,p) in the discrete L ² norm. The connection with a non standard mixed finite element method is given. Finally, numerical results are displayed on pertinent 1-D elliptic problems with high contrasts in the ellipticity, showing in practice convergence rates ranging from 1 to 2.5 in the discrete H ¹ norm. This work has been performed with the support of the GDR MOMAS, (ANDRA, CEA, EDF, BRGM and CNRS): Modélisation pour le stockage des déchets radioactifs. The author thanks especially A. Bourgeat for his encouragements and his interest in this work.     

新型哈氏合金G—30的耐蚀性能与工业应用

文章叙述了新型镍基耐蚀哈氏合金G-30在不同介质中的耐蚀性能以及工业应用,综合分析了该合金应用的经济性及前景。     

The Berlekamp-Massey Algorithm revisited

We propose a slight modification of the Berlekamp-Massey Algorithm for obtaining the minimal polynomial of a given linearly recurrent sequence. Such a modification enables to explain it in a simpler way and to adapt it to lazy evaluation. partially supported by the Galois Theory and Explicit Methods in Arithmetic Project HPRN-CT-2000-00114 partially supported by the European Union funded project RAAG CT-2001-00271