泌阳凹陷层序地层样式和油气评价

在建立泌阳凹陷层序序列的基础上，系统研究了核桃园组的旋回结构。考虑箕状盆地结构、构造活动特征以及沉积物供源方式。分别论述了盆地陡坡、深凹和缓坡的层序地层样式，指出不同地形区的层序地层叠置样式主控因素是有差异的。综合层序地层学和石油地质分析结果，提出了岩性油气藏勘探的有利区带。     

凸轮逆序测量方法

目前各杂志所发表的关于凸轮测量的文章，所讨论的均是凸轮的顺序测量方法，有关凸轮的逆序测量(反求工程)方法，尚未见于文字。本文将对凸轮的逆序测量方法进行探讨。     

非常规开采顺序在鸡冠嘴金矿二期采区的应用

针对鸡冠嘴金矿二期采区矿体(群)延深较大、走向较短、在垂向上中部较厚、品位较高呈“菱形”变化的特点，通过技术经济比较和岩石力学研究论证，并结合国内、外类似矿山的生产实践，提出并采用了不同于常规的首先开采矿体(群)中部的开采方法，从而为提高矿山生产初期的经济效益，尽早偿还基建贷款提供了一条新的成功经验。     

陆相断陷湖盆中层序边界的形成机理及其识别特征研究

陆相断陷湖盆中层序边界是由于沉积物表面高出沉积基准面或盆地基准面、沉积物发生剥蚀或无沉积作用所形成的，其产生机理主要有边界断层停止活动、断块翘倾活动、湖盆整体抬升和湖平面下降。层序边界在地震特征上、测井曲线上、钻井剖面中的岩性、岩相特征、古生物组合、微量元素的变化上均有明显的特征。利用这些特征，在济阳坳陷下第三系中识别出9个三级层序。     

Chrestenson函数序列的生成方法及其数学分析

本文提出了适于三种序号的Ｃｈｒｅｓｔｅｎｓｏｎ函数序列的复制方法，对其复制过程进行了数学分析，并指出当Ｃｈｒｅｓｔｅｎｓｏｎ函数退化为Ｗａｌｓｈ函数时，此方法即为复制理论中的平移复制方法。     

A Standard Model-Theoretic Approach to Operational Semantics of Recursive Programs

In this paper we try to introduce a new approach to operational semantics of recursive programsby using ideas in the“priority method”which is a fundamental tool in Recursion Theory.In lieu ofmodelling partial functions by introducing undefined values in a traditional approach,we shall define apriority derivation tree for every term,and by respecting the rule“attacking the subterm of thehighest priority first”we define transition relations,computation sequences etc.directly based on astandard interpretation which includes no undefined value in its domain.Finally,we prove that ournew approach generates the same operational semantics as the traditional one.It is also pointed outthat we can use our strategy to refute a claim of Loeckx and Sieber that the opperational semanticsof recursive programs cannot be built based on predicate logic.     

筛查基因突变的新技术——循环双脱氧指纹图谱法及其应用

建立了适用于大批量标本基因突变筛查的双脱氧指纹图谱法即ｄｄＦ。该技术民测定ＤＮＡ序列的双脱氧末端终止法及ＳＳＣＰ二者长处于一身，即只作一个双脱氧末端终止反应，然后将反应产物在与ＳＳＣＰ相同的电泳条件下进行聚丙烯酰胺凝胶电泳，这样有突变的样品不会漏检，阳性检出率高达１００％。     

A genetic algorithm for the optimisation of assembly sequences

This paper describes a Genetic Algorithm (GA) designed to optimise the Assembly Sequence Planning Problem (ASPP), an extremely diverse, large scale and highly constrained combinatorial problem. The modelling of the ASPP problem, which has to be able to encode any industrial-size product with realistic constraints, and the GA have been designed to accommodate any type of assembly plan and component. A number of specific modelling issues necessary for understanding the manner in which the algorithm works and how it relates to real-life problems, are succinctly presented, as they have to be taken into account/adapted/solved prior to Solving and Optimising (S/O) the problem. The GA has a classical structure but modified genetic operators, to avoid the combinatorial explosion. It works only with feasible assembly sequences and has the ability to search the entire solution space of full-scale, unabridged problems of industrial size. A case study illustrates the application of the proposed GA for a 25-components product.     

Nonlinear suboptimal filtration of pseudorandom sequences

The critical importance of studies of alternative methods of representation and processing of signals constructed from pseudorandom sequences of maximal period is demonstrated. For the first time, it is proposed that a multidimensional nonlinear finite-difference representation of an arbitrary pseudorandom sequence be employed. A suboptimal algorithm for nonlinear discrete Kalman filtration of a pseudorandom sequence is obtained. A numerical example of filtration of a sequence formed on the basis of a given recurrence rule is considered and its efficiency is demonstrated.     

前向人工神经网络模型用于时间序列分析

介绍前向人工神经网络模型，并与传统的统计学线性模型进行比较。为了适应时间序列变量的特点，对逆传播模型进行了改进，并对太阳黑子活动的观察值这一典型的时间序列进行了分析，并检验了模型的预测能力，取得了较好的结果