奥里油在电力工业的应用及环保处理

委内瑞拉富藏奥里油约469亿t，中国政府与委内瑞拉政府签订了合作生产和供应每年650万t奥里油的合作协议。介绍了奥里油的特性和在全球以及中国的应用情况，分析了奥里油燃烧发电带来的特殊的环保问题和处理方法。     

工程招投标中的违法现象及对策

在分析工程招投标中的违法现象及产生原因的基础上，提出相应对策和减少违法投标的措施。     

关于项目管理中施工进度控制的研究

阐述了项目管理中施工进度控制的地位与作用，分析了影响工程进度的因素，提出项目进度控制需做好的工作，以提高进度控制水平，确保合同工期的实现。     

MITI projects on recycling

MITI has actively done R&D on industrial technology for waste and reclamation and so there are many research items from small scale to large scale. However, Ecofactory and researches on recycling of metallic materials are introduced here. Ecofactory was proposed by the Mechanical Engineering Laboratory and is now at the stage of the Leading Research, a new research scheme in AISt. Researches on recycling of metallic materials are being done with subsidy. Those researches should contribute to both the preservatin of the global environment and effective recycling of waste materials.Abbreviations AIST Agency of Industrial Science and Technology - MITI Ministry of International Trade and Industry - NEDO New Energy and Industrial Technology Development Organization     

节流式差压流量计的发展和现状

文章介绍节流式差压流量计的特点及标准化进程，煤气流量测量中存在的难点以及正在试图解决的途径。     

乌江渡水电站扩建工程开挖爆破对原水电站建筑物震动影响的控制研究

为确保原有的乌江渡水电站水工建筑物和发电设备以及扩建工程建筑物的施工安全,加快扩建工程施工进度,本扩建工程施工中对关键部位开挖所产生的爆破震动影响实施全面而有效的实时爆破监控,并根据监控成果的研究指导开挖爆破作业,以确定符合实际的安全爆破震动参数。     

重点建设工程档案管理工作探讨

针对重点建设工程档案的管理现状,提出了明确岗位责任、加强制度建设以及夯实基础工作的档案管理理念。     

Recursive solution of inverse natural convection problems by means of mode reduction

 A recursive method based on the Kalman filtering is developed to solve inverse natural convection problems of estimating the unsteady nonuniform wall heat flux from temperature measurements in the flow. By employing the Karhunen–Loève Galerkin procedure that reduces the Boussinesq equation to a small set of ordinary differential equations, the computational difficulties associated with the Kalman filtering for the partial differential equations are overcome. The present method is assessed through several numerical experiments, and is found to yield satisfactory results. Received 20 January 2001 / Accepted 31 May 2001     

On finding optimal and near-optimal lineal spanning trees

The search for good lineal, or depth-first, spanning trees is an important aspect in the implementation of a wide assortment of graph algorithms. We consider the complexity of findingoptimal lineal spanning trees under various notions of optimality. In particular, we show that several natural problems, such as constructing a shortest or a tallest lineal tree, are NP-hard. We also address the issue of polynomial-time, near-optimization strategies for these difficult problems, showing that efficient absolute approximation algorithms cannot exist unlessP = NP.This author's research was supported in part by the Sandia University Research Program and by the National Science Foundation under Grant M IP-8603879.This author's research was supported in part by the National Science Foundation under Grants ECS-8403859 and MIP-8603879.