从混联法生产中提取镓的研究

针对联合法厂家资源的分布特点,提出采用化学法和树脂吸附法相结合的方式实现同时回收烧结法和拜尔法循环母液中镓的新工艺,并通过小试和扩试结果分析,阐述了该工艺的可行性。     

凸轮逆序测量方法

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

高压静电除垢技术在发电厂汽轮机凝汽器中的应用

汽轮机凝汽器的除垢问题通常采用化学方法或物理方法,这些除垢措施有一定的局限性。介绍了一种利用高压静电除垢技术。     

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

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

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

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

三(明)钢烧结厂电除尘灰的气力输送

三钢烧结厂130m^2烧结机电除尘输灰首次采用了气力输送系统。该系统由气源、输送、管路、灰库及控制五部分组成，本文介绍了系统的工作原理及运行调试情况。系统投产后，运行平稳，达到了设计要求。     

Si相的析出状态对Al—Si合金性能的影响

控制Si相的析出状态,会对Al-Si(1wt％)合金的性能产生不同的影响。本文阐述通过不同的热处理工艺改变了Al-Si(1wt％)合金的机械、物理性能,获得了高形变强化率、高塑性变形能力、高拉伸强度的工艺,还讨论了具有上述高拉伸强度的微细丝在半导体器件应用中所具有的优越性。     

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.