合成氨扩能改造中锅炉存在的问题及采取的措施

针对天脊集团年产30万t合成氨扩能改造,给2台225t/h高压锅炉带来的除氧器热量过剩、锅炉给水温度升高、主蒸汽温度降低等一系列问题,分析了产生问题的原因,从节约能源、提高锅炉效率考虑,提出了相应的解决问题的办法:利用热量分流、改造省煤器管、增加二级过热器受热面积。经过3年多的生产实践证明,取得了良好的效果。     

三峡水电站ALSTOM机组低水头运行稳定性分析

混流式水轮机的水力稳定性与机组水力工况密切相关。以三峡电站左岸6号机组稳定性试验为例，分析了ALSTOM机组的低水头运行稳定性。根据试验分析结果，可将机组运行工况划分为小负荷区、涡带振动区、大负荷运行区。小负荷区机组效率较低，机组不宜在此区间运行；大负荷区机组运行稳定性最佳，但机组应避开强涡带工况区和特殊频率振动区运行。     

The solution of the inverse problem of gravitational potential using a set of measurements of different field elements

A numerical solution of the inverse problem of the gravitational field at a single point is obtained using six field elements for a point, a spherical cap, a differential spherical sector and a vertical segment. In the system of six equations obtained, the unknowns are the mass of the body, the depth of its center, and the second, third, and fourth degree moments. The accuracy of the solution of this system is ten times higher than when using three field elements. __________ Translated from Izmeritel’naya Tekhnika, No. 5, pp. 3–8, May, 2007.     

RanGen: A Random Network Generator for Activity-on-the-Node Networks

In this paper, we describe RanGen, a random network generator for generating activity-on-the-node networks and accompanying data for different classes of project scheduling problems. The objective is to construct random networks which satisfy preset values of the parameters used to control the hardness of a problem instance. Both parameters which are related to the network topology and resource-related parameters are implemented. The network generator meets the shortcomings of former network generators since it employs a wide range of different parameters which have been shown to serve as possible predictors of the hardness of different project scheduling problems. Some of them have been implemented in former network generators while others have not.     

A new distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks

In recent years, constructing a virtual backbone by nodes in a connected dominating set (CDS) has been proposed to improve the performance of ad hoc wireless networks. In general, a dominating set satisfies that every vertex in the graph is either in the set or adjacent to a vertex in the set. A CDS is a dominating set that also induces a connected sub‐graph. However, finding the minimum connected dominating set (MCDS) is a well‐known NP‐hard problem in graph theory. Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a poor approximation ratio, and from high time complexity and message complexity. In this paper, we present a new distributed approximation algorithm that constructs a MCDS for wireless ad hoc networks based on a maximal independent set (MIS). Our algorithm, which is fully localized, has a constant approximation ratio, and O(n) time and O(n) message complexity. In this algorithm, each node only requires the knowledge of its one‐hop neighbours and there is only one shortest path connecting two dominators that are at most three hops away. We not only give theoretical performance analysis for our algorithm, but also conduct extensive simulation to compare our algorithm with other algorithms in the literature. Simulation results and theoretical analysis show that our algorithm has better efficiency and performance than others. Copyright © 2005 John Wiley & Sons, Ltd.     

Probabilistic output admissible set for systems with time-varying uncertainties

This paper considers time-varying uncertain constrained systems, and develops a method for computing a probabilistic output admissible (POA) set. This set consists of the initial states probabilistically assured to satisfy the constraint. The time-invariant counterpart has already been investigated in Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear]. We first define the POA set for time-varying uncertainties with finite dimensional probability space. Then, we show that an algorithm similar to Hatanaka and Takaba [Computations of probabilistic output admissible set for uncertain constrained systems, Automatica 44 (2) (2008), to appear] provides the POA set also in the time-varying case, as long as an upper bound of a what we call future output admissibility (FOA) index is available. We moreover present two methods for computing the upper bound of the FOA index: probabilistic and deterministic methods. A numerical simulation demonstrates the effectiveness of our algorithm.     

Analysis of an algorithm for solution of conditional optimization problems with linear-fractional objective functions over permutations

A method is considered to solve a conditional optimization problem with a linear-fractional objective function over permutations. The performance of sub algorithms to solve this problem is evaluated. The practical efficiency of the algorithm is analyzed by conducting numerical experiments. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 4, pp. 133–146, July–August 2007.     

抽水蓄能机组PSS参数设计与现场试验

围绕广东电网的暂态稳定问题进行了广东电网主要运行方式下的动稳定分析计算,得出抽水蓄能机组的机电振荡频率及其阻尼情况。根据广东电网和南方电网的振荡频率落在0．3～2．0 Hz的低频段上的特点,并结合蓄能电厂机组的参数与特性,经BPA潮流、稳定计算程序和小扰动动态稳定分析程序计算分析比较,对蓄能机组的PSS参数进行了初步设计。通过现场试验对抽水蓄能机组的PSS参数进行优化整定,检验PSS的性能以及在工况调整和转换过程中的适应能力。     

A new stereological principle for test lines in three-dimensional space

A new principle is presented to generate isotropic uniform random (IUR) test lines hitting a geometric structure in three-dimensional space (3D). The principle therefore concerns the estimation of surface area, volume, membrane thickness, etc., of arbitrary structures with piecewise smooth boundary. The principle states that a point-sampled test line on an isotropic plane through a fixed point in 3D is effectively an invariant test line in 3D. Particular attention is devoted to the stereology of particles, where an alternative to the surfactor method is obtained to estimate surface area. An interesting case arises when the particle is convex. The methods are illustrated with synthetic examples.