合成氨工艺参数优化技术开发及应用

以氨净值为响应值,影响响应值的17个过程参数为变量,经逐步回归选入触媒温度左3,触媒温度左4,循环CH_4%,H/N,NH_3%(进口)5个过程参数建立预测方程,并根据该方程对响应值的拟合结果和误差分布对样本进行分类。在此基础上,采取图形显示技术和统计分析的方法对分类样本集的过程参数进行比对分析,由此获取优类信息制订优化的工艺参数方案,经仿真验证后用于指导合成氨装置的生产试验。试验结果与试验前的对照期比较,氨净值均值由13.86提高到14.54,吨氨气耗减少15.9887m~3,吨氨电耗减少15.8kWh,节能效益十分明显     

流程工业CIMS中综合优化问题的研究

文章首先提出了流程工业及其CIMS中的各种优化问题;;小结了各种解决优化问题的求解技术.在此基础上提出了一种基于多级优化的一种流程工业CIMS结构.最后;;作者提出了一种解决流程工业CIMS多目标优化问题的最大熵优化技术     

用水信用与风险管理系统

系统采用Oracle数据库作为开发平台,VB.net为开发工具研制而成。系统借鉴银行和电力企业信用等级评价的规则,结合水司水费收缴的历史纪录及各客户的实际情况,运用自动采集程序,从原有的营销系统和财务系统自动录入数据,再通过优化的模糊概率、神经网络程序,对用户进行交纳水费信用等级评定,建立客户交纳水费风险预警机制。     

Expansion of a matrix in terms of external products of configuration vectors

The paper proposes a neural-net iterative algorithm that allows us to represent any random symmetrical N×N matrix as a weighted Hebbian series of configuration vectors with a given accuracy. The iterative algorithm is shown to demonstrate the fastest convergence when the vectors of expansion are stable nods of the N-dimensional space corresponding to the extremums of the neural-net energy functional. It so proves that all conclusions about neural networks and optimization algorithms that are based on Hebbian matrices are true for any other type of matrix. The text was submitted by the author in English.     

Combinatorial optimization under uncertainty

In this paper, the general problem of Euclidean combinatorial optimization under uncertainty is formulated for the first time and the concepts of a stochastic multiset, a multiset of fuzzy numbers, a stochastic Euclidean combinatorial set, and general Euclidean combinatorial set of fuzzy stochastic numbers that combines the properties of both types of uncertainty are introduced. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 5, pp. 35–44, September–October 2008.     

Analytical benchmarks for topological optimization IV: square-shaped line support

Michell’s problem of optimizing truss topology for stress or compliance constraints under a single load condition is solved analytically for plane trusses having a square-shaped line support. Geometrical characteristics of the Hencky nets giving the truss layout are expressed in terms of Lommel functions. Analytically derived truss volumes for the above problem are compared with those of trusses supported along circles of equivalent area. Some general implications of the results are also discussed.     

智能仪表的可靠性设计与评估技术

本文主要探讨智能仪表设计中最常采用的几种可靠性设计技术及其具体应用,详细介绍了其中的可靠性预计与可靠性分配技术具体方法和步骤,比较了现有的几种可靠性评估技术.     

供应链集成化模型与优化

本文建立了一个包括供应商、制造商、销售商 在内的集成化模型,这一模型含有线性状态方程和神经网络非线性模型,提出了库存成本、 供应成本、生产水平等在内的供应链目标函数和约束条件．对于供应链集成化模型采用模拟 退火方法进行优化,并以辽化公司为背景进行了初步条件的仿真工作．     

Form finding of shells by structural optimization

Shell structures are known to be extremely parameter sensitive; even small changes of the initial design, e.g., to the shape of the shell, may drastically change the internal stress state. The ideal case for concrete shells is a pure membrane stress state in compression for all loading conditions. Since in many realistic situations the solution for an optimal shape is not obvious, the need for form finding methods is evident. This paper presents computational methods of structural optimization as a general tool for the form finding of shells. The procedure as a synthesis of design modelling, structural analysis and mathematical optimization is discussed with special emphasis on the modelling stage. Several examples show the power of the approach and the similarities to experimental solutions.     

Optimizing multiple dimensional queries simultaneously in multidimensional databases

Some significant progress related to multidimensional data analysis has been achieved in the past few years, including the design of fast algorithms for computing datacubes, selecting some precomputed group-bys to materialize, and designing efficient storage structures for multidimensional data. However, little work has been carried out on multidimensional query optimization issues. Particularly the response time (or evaluation cost) for answering several related dimensional queries simultaneously is crucial to the OLAP applications. Recently, Zhao et al. first exploited this problem by presenting three heuristic algorithms. In this paper we first consider in detail two cases of the problem in which all the queries are either hash-based star joins or index-based star joins only. In the case of the hash-based star join, we devise a polynomial approximation algorithm which delivers a plan whose evaluation cost is $ O(n^{\epsilon }$) times the optimal, where n is the number of queries and is a fixed constant with . We also present an exponential algorithm which delivers a plan with the optimal evaluation cost. In the case of the index-based star join, we present a heuristic algorithm which delivers a plan whose evaluation cost is n times the optimal, and an exponential algorithm which delivers a plan with the optimal evaluation cost. We then consider a general case in which both hash-based star-join and index-based star-join queries are included. For this case, we give a possible improvement on the work of Zhao et al., based on an analysis of their solutions. We also develop another heuristic and an exact algorithm for the problem. We finally conduct a performance study by implementing our algorithms. The experimental results demonstrate that the solutions delivered for the restricted cases are always within two times of the optimal, which confirms our theoretical upper bounds. Actually these experiments produce much better results than our theoretical estimates. To the best of our knowledge, this is the only development of polynomial algorithms for the first two cases which are able to deliver plans with deterministic performance guarantees in terms of the qualities of the plans generated. The previous approaches including that of [ZDNS98] may generate a feasible plan for the problem in these two cases, but they do not provide any performance guarantee, i.e., the plans generated by their algorithms can be arbitrarily far from the optimal one. Received: July 21, 1998 / Accepted: August 26, 1999