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.     

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.     

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

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

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

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

Modeling alternative zoning strategies in forest management

To satisfy public demands for environmental values, forest companies are facing the prospect of a reduction in wood supply and increases in costs. Some Canadian provincial governments have proposed intensifying silviculture in special zones dedicated to timber production as the means for pushing out the forest possibility frontiers. In this paper, we compare the traditional two‐zone land allocation framework which includes ecological reserves and integrated forest management zones with the triad — a three‐zone scheme which adds a zone dedicated to intensive timber production. We compare the solutions of the mixed‐integer linear programs formulated under both land‐allocation frameworks. We explore through sensitivity analysis the conditions under which the triad regime can offset the impact on timber production from increased environmental demands. We show that under the realistic conditions characteristic to Coastal British Columbia, higher environmental demands may be satisfied under the triad regime without increasing the financial burdens on the industry or reducing its wood supply. This occurs, however, only if regulatory constraints in timber production zone are flexible.     

基于遗传算法的BP网络在导弹武器系统元器件贮存可靠性预测中的应用

针对目前BP神经网络在应用中,网络结构难以确定以及网络极易陷入局部解问题,用遗传算法优化神经网络的连接权和网络结构,并在遗传进化过程中引入交叉概率和变异概率与个体的适度值相联系,改进了操作算子,而且在交叉操作后又引入模拟退火机制,提高遗传算法的局部搜索能力.建立了基于改进遗传算法的BP网络贮存可靠性预测模型,并以某型导弹武器系统的元器件进行实例分析,计算结果表明,该方法预测的准确性高,且预测结果稳定.     

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.     

A parallel and scalable algorithm for ADI method with pre-propagation and message vectorization

It is hard to implement the ADI method in an efficient way on distributed-memory parallel computers. We propose “P-scheme” which parallelizes a tridiagonal linear system of equations for the ADI method, but its effectiveness is limited to the cases where the problem size is large enough mainly because of the communication cost of the propagation phase of the scheme.

In order to overcome this difficulty, we propose an improved version of the P-scheme with “message vectorization” which aggregates several communication messages into one and alleviates the communication cost. Also we evaluate the effectiveness of message vectorization for the ADI method and show that the improved version of the P-scheme works well even for smaller problems and linear and super-linear speedups can be achieved for 8194 × 8194 and 16,386 × 16,386 problems, respectively.     

Estimation for the number of components in a mixture model using stepwise split-and-merge EM algorithm

The main difficulty with EM algorithm for mixture model concerns the number of components, say g. This is the question of model selection, and the EM algorithm itself could not estimate g. On the contrary, the algorithm requires g to be specified before the remaining parameters can be estimated. To solve this problem, a new algorithm, which is called stepwise split-and-merge EM (SSMEM) algorithm, is proposed. The SSMEM algorithm alternately splits and merges components, estimating g and other parameters of components simultaneously. Also, two novel criteria are introduced to efficiently select the components for split or merge. Experimental results on simulated and real data demonstrate the effectivity of the proposed algorithm.