炼钢厂成本分析信息系统的开发设计

文章介绍了包钢炼钢厂生产管理信息系统中成本分析子系统的可行性分析以及具体的数据归集流程,详细介绍了该系统的开发环境以及该系统的模块和数据库的结构、功能及其具体的设计思想;简要介绍了Oraele Develop数据库开发应用的一些特点.     

企业开展质量成本研究工作的思考

质量成本是指企业为保证产品质量而支出的一切费用，以及产品质量未达到规定的标准而造成的一切损失的总和。开展质量成本研究工作是企业深化质量管理和成本管理的一条有效途径。     

Superconductivity and Structure

The degree of the isolation of the CuO₂ planes (e.g. distance or bond valence to the apical coordination) has been shown by quantitative algorithms to be the major factor in determining aspects of the doping curves. They include the magnitude of the optimal number of doped holes (h_op) and the corresponding T _cop. It is shown that the roots of these phenomenological laws lie in a related structural dependence of super-exchange. The latter is expressed in the pseudo-gap or Neel temperature of the undoped parent compound. A fruitful language can be developed which deals with a buildup of complex quantum chemical features by bringing two holes into vicinity of a super-exchange O, forming a “local” Cu₂O₇ pair. Structural considerations also dictate that stress is relieved by alternate orthogonal pair orientation. This leads to plaid patterns with primary and secondary channels of charge. The presence of these two types of charge channels is involved in the mechanism of superconducting charge transport. Similar structuring of doped charge into plaid patterns of “local” pairs has been proposed for “all” high T _c superconductivity. STM now gives pictorial representation of the remnants of such an electronic crystal structure. The response of these bond-ordering motifs to structural details is further discussed. These ideas supply organization to the manifold experimental situation and provide opportunities for a unifying theory for high T _c superconductivity in terms of real space structuring of “local” pairs, largely on crystal-chemical principles.     

转炉合金最小成本控制模型

介绍了基于合金最小成本的转炉炼钢钢水成分调整模型工应用于宝钢炼钢在线生产控制的情况。模型给出了在满足目标成分等工艺要求下，成本最小的合金投入组合及合金投入量；计算了合金加入钢包后引起钢水温度、重量等的变化，为降低生产成本（合金投入），提高出钢成分控制精度提供了有效的途径。     

某大型有色冶炼厂建筑物评估值的确定方法

为科学合理估算工程造价以确定重置成本，从而保证评估结果的客观、可靠，结合某大型有色冶炼厂的实际情况对估算工程造价的几种方法进行了分析，并对所采用的重置成本法作了具体介绍。     

小型加氢站网络的成本分析

在2008年之前,上海的燃料电池汽车数量将达到百辆级规模,为了示范运行这些车辆,迫切需要建立一个有若干个加氢站组成的小型网络来提供加氢服务,为此需要确定投资运营成本。本文通过建立氢气运输成本模型(HTCM)和加氢站成本模型(HSCM),以90辆燃料电池轿车和10辆燃料电池公交车为服务对象,对由4种不同类型共5个加氢站组成的小型网络为案例,计算了每个加氢站的投资运行成本、氢气使用成本。结果表明,整个加氢站网络的年均总成本大约为769万元,而氢气的最终使用成本依据不同的供氢方式在30~77元/kg之间。     

运用模糊数学原理估算水利水电工程的成本

为了适应水利水电工程成本快速估价的需要,提出了一种建立在模糊数学基本原理基础上的估价模型,克服了工程量清单计价方法计算繁琐的缺点。通过实例说明了该方法的科学性、合理性及实用性。     

太平湾电站二期防护提工程施工中几个问题的处理

针对防护堤的设计和施工,分析了设计原则和施工中遇到的问题,阐述了在施工中遇到的问题的解决方案。     

“一二三”工段成本管理法在实践中的运用

本文从当前工段成本管理的形势出发 ,阐述了实施“一二三”工段成本管理法的必要性、主要内容及实施效果。     

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.