Wavefront reduction using graphs,neural networks and genetic algorithm

This paper presents an algorithm for nodal numbering in order to obtain a small wavefront. Element clique graphs are employed as the mathematical models of finite element meshes. A priority function containing five vectors is used, which can be viewed as a generalization of Sloan's function. These vectors represent different connectivity properties of the graph models. Unlike Sloan's algorithm, which uses two fixed coefficients, here, five coefficients are employed, based on an evaluation by artificial neural networks. The networks weights are obtained using a simple genetic algorithm. Examples are included to illustrate the performance of the present hybrid method. Copyright © 2004 John Wiley & Sons, Ltd.     

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.     

论剪切质量的提高

通过对飞剪剪切长度，精度，剪刃间隙和压板机构等参数的优化，来提高钢板的剪切质量。     

固定化微生物脱除工业酸性废气中H_2S的研究

以H 2软性填料作为氧化亚铁硫杆菌的固定化载体 ,构成了固定床生物反应器。在一定操作条件下 ,考察了固定床生物反应器对Fe2 +的氧化速率 ,最大可达 7.6 7g/ (L·h)。并对固定床生物反应器运行中在载体表面形成的络合物进行了研究 ,X射线衍射证明此络合物为黄钾铁矾 [KFe3(SO4 ) 2 (OH) 6]。     

多测井曲线的综合处理合成

测井曲线是地质分层的基础，但在利用单一测井曲线解决复杂地质问题时也存在多解性和局限性。为克服多解性，人们采用多种测井曲线进行地质分层，提高了分层的精度。本文在此基础上提出把多条曲线分别赋予不同的加权因子，然后进行归一化处理，形成一条标准综合参数测井曲线。此综合参数曲线突出了所选的多条测井曲线的公共信息，减少或削弱了单一测井曲线中的偶然误差，提高了综合后测井资料的可信度。该方法可应用于地质分层、岩性分析、含油气预测等诸多领域。应用时要注意，并非所选择的测井曲线种类越多越好，而是要选择那些最能反映地层单元特征信息的测井曲线。     

计算机远程控制系统的设计与实现

介绍了一个计算机远程控制系统的设计与实现，该系统采用客户机／服务器模式，实现远程屏幕的实时传输，采用LZW压缩算法对图像进行压缩传输，在接受方进行解码并且实现了远程文件创建和删除、显示被控制端的主机信息、发送实时消息等功能。采用鼠标，键盘的模拟方式对计算机进行实时控制。     

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.     

天然气管网输配气量优化研究

天然气管网系统管理部门为了明确天然气管网的输气能力和提高天然气管网的利用率，需要对天然气管网系统的输配气量进行优化。为此，以天然气管网系统的最大流量为目标函数，同时考虑了管道强度、节点压力和流量限制等约束条件，建立了天然气管网输配气量优化的数学模型。在研究遗传算法和模拟退火算法的基础上，提出了一种由二者结合构成的具有全域搜索、快速收敛和鲁棒性强等特点的混合遗传算法。结合实例，采用这一新算法求解了天然气管网输配气量优化的数学模型。实例优化结果表明，所建立的数学模型和采用的混合遗传算法是可行和有效的，能够对天然气管网系统输配气量的调度运行起到指导作用。     

Non-pinched, minimum energy distillation designs

Non-pinched, minimum energy solutions are important class of distillation designs that offer the potential advantage of a better trade-off between capital investment and operating costs. In this paper, two important tasks associated with non-pinched distillation designs are studied. Thus the novel contributions of this work to the literature are

(1) A comprehensive methodology for finding non-pinched minimum energy designs.

(2) Understanding of the reasons for the existence of non-pinched distillation designs.

It is shown that the recent shortest stripping line distance approach of Lucia et al. [Lucia, A., Amale, A. and Taylor, R., 2007, Distillation pinch points and more. Comput Chem Eng, available on-line] is capable of systematically and reliably finding non-pinched, minimum energy distillation designs. In addition, we provide an understanding of the reasons behind the existence of non-pinched designs, which include trajectories that follow unstable branches of a pinch point curve in azeotropic systems, the inherent looping structure of trajectories in hydrocarbon separations, and the presence of ancillary constraints in multi-unit processes like extraction/distillation. Several distillation examples are studied and many numerical results and geometric illustrations are presented that show the shortest stripping line distance methodology is indeed a powerful and systematic tool for computing non-pinched, minimum energy designs and that support the underlying reason we provide for the existence of non-pinched designs.     

Note on ‘Construction of Double Sampling s‐Control Charts for Agile Manufacturing’

He and Grigoryan (Quality and Reliability Engineering International 2002; 18 :343–355) formulated the design of a double‐sampling (DS) s control chart as an optimization problem and solved it with a genetic algorithm. They concluded that the DS s control charts can be a more economically preferable alternative in detecting small shifts than traditional s control charts. We explain that, since they only considered the average sample size when the process is in control, their conclusion is questionable. Copyright © 2006 John Wiley & Sons, Ltd.