测井曲线拐点在测井层序地层分析中的应用研究

在层序地层学研究中，层序界面的划分是基础和重要的环节，而利用测井资料分析可以进行层序界面划分和进行较长期基准面旋回识别。测井曲线的值是深度的函数，测井曲线的一阶导数表示了曲线变化的趋势和变化的快慢，在某一范围内，当一阶导数呈现符号转换时，相对应的深度点的测井值即为该范围内极大（极小）值；测井曲线的二阶导数则表示曲线的凹凸性，在某一范围内，当二阶导数呈现符号转换时，相对应的深度点代表了测井曲线的拐点，即反映曲线凹凸性变化的转折点，亦即地层的分界面。基于以上特点，提出利用测井曲线拐点进行层序界面划分的原理和方法，并结合岩心和录井资料，对白音查干凹陷达28井腾格尔组不同级次沉积旋回、地层垒积、旋回特征随沉积厚度变化特点和不同级次基准面旋回进行研究，最后得到该地层单井测井层序地层分析结果。     

对ADSL接入方式铜缆可用线对率的分析

指出了为发展ADSL而提高市话音频铜线电缆的传输质量和维护水平的必要性,分析了铜线电缆线对有关指标参数低劣的原因和对传输ADSL的影响,并提出了一些改进的意见。     

GS-08乙苯脱氢催化剂在广石化的应用

乙苯脱氢催化剂GS-08催化剂在广州石化总研制的首次应用。     

龙滩工程按正常蓄水位400m方案一次建成效益巨大

2003年11月龙滩工程将实现大江截流，随着工程建设的全面推进，越发显出实施龙滩水电站正常蓄水位400m一次建成方案的重要性和紧迫性。相对分期建设而言，400m水位一次建成，工程效益大、增加投资少、无后期加高过程中的各种技术难题，基本不影响电站的初期发电效益，水轮机设计与运行问题少、机组运行条件好，电站规模效益与社会综合效益巨大，有利于移民安置和库区经济的发展，对国家、地方、企业均十分有利，因此应尽快决策实施400m一次建成方案。     

采用注视控制器实现复杂运动的仿真

注视控制器是3DS MAX软件的众多控件之一，它能使多个物体彼此间产生运动约束。通过使用注视控制器功能，笔者成功制作出八足爬壁式仿生机械昆虫的运动场景动画，并使该仿生机械昆虫各足的行走动作符合机械零件作平面复杂运动时所应遵守的正确运动规律。由此证明，3DS MAX软件注视控制器对正确模拟特殊机械装置的复杂运动可产生极大作用。     

动态规划模型在生产存贮中的应用

利用动态规划模型研究了生产管理中生产存贮问题的数学模型，给出了动态规划的最优性原理和动态规划基本方程，并给出了该数学模型求解的一个实例。     

On inversive maximal period polynomials over finite fields

Over finite field GF(q) withq a power of an odd primep, we characterize inversive maximal period polynomials in terms of polynomials of orderq + 1, and then we study some properties of polynomials of orderq + 1.This paper was written while the author was visiting the Institute of Information Processing, Austrian Academy of Sciences, AustriaThe author would like to thank the Institute of Information Processing, Austrian Academy of Sciences, Austria, for its hospitality and for using its facilities     

用RAFA方法定量解析芳烃混合物的EEM

本文介绍了降秩因子分析(RAFA)方法,它是从一个多组分混合物中直接定量计算其中某一组分,而不必知道其它组分的物种及含量的一种定量分析的数学方法。它适用于双线性的数据。本实验首先将荧光分光光度计与外接计算机相连,以获得样品的激发-发射矩阵(EEM),再用RAFA方法对蒽、萘、菲、芘、芴、(艹屈)六种标样的一至五组分的混合物进行定量分析,获得满意的结果。     

Node-pair reliability of network systems with small distances between adjacent nodes

A new method for computing the node-pair reliability of network systems modeled by random graphs with nodes arranged in sequence is presented. It is based on a recursive algorithm using the “sliding window” technique, the window being composed of several consecutive nodes. In a single step, the connectivity probabilities for all nodes included in the window are found. Subsequently, the window is moved one node forward. This process is repeated until, in the last step, the window reaches the terminal node. The connectivity probabilities found at that point are used to compute the node-pair reliability of the network system considered. The algorithm is designed especially for graphs with small distances between adjacent nodes, where the distance between two nodes is defined as the absolute value of the difference between the nodes’ numbers. The maximal distance between any two adjacent nodes is denoted by Γ(G), where G symbolizes a random graph. If Γ(G)=2 then the method can be applied for directed as well as undirected graphs whose nodes and edges are subject to failure. This is important in view of the fact that many algorithms computing network reliability are designed for graphs with failure-prone edges and reliable nodes. If Γ(G)=3 then the method's applicability is limited to undirected graphs with reliable nodes. The main asset of the presented algorithms is their low numerical complexity—O(n), where n denotes the number of nodes.