Evolving artificial neural network ensembles

Using a coordinated group of simple solvers to tackle a complex problem is not an entirely new idea. Its root could be traced back hundreds of years ago when ancient Chinese suggested a team approach to problem solving. For a long time, engineers have used the divide-and-conquer strategy to decompose a complex problem into simpler sub-problems and then solve them by a group of solvers. However, knowing the best way to divide a complex problem into simpler ones relies heavily on the available domain knowledge. It is often a manual process by an experienced engineer. There have been few automatic divide-and-conquer methods reported in the literature. Fortunately, evolutionary computation provides some of the interesting avenues to automatic divide-and-conquer methods. An in-depth study of such methods reveals that there is a deep underlying connection between evolutionary computation and ANN ensembles. Ideas in one area can be usefully transferred into another in producing effective algorithms. For example, using speciation to create and maintain diversity had inspired the development of negative correlation learning for ANN ensembles, and an in-depth study of diversity in ensembles. This paper will review some of the recent work in evolutionary approaches to designing ANN ensembles.     

Structured optimal and robust control with multiple criteria: a convex solution

In this paper, the design of controllers that incorporate structural and multiobjective performance requirements is considered. The control structures under study cover nested, chained, hierarchical, delayed interaction and communications, and symmetric systems. Such structures are strongly related to several modern-day and future applications including integrated flight propulsion systems, platoons of vehicles, micro-electro-mechanical systems, networked control, control of networks, production lines and chemical processes. It is shown that the system classes presented have the common feature that all stabilizing controllers can be characterized by convex constraints on the Youla-Kucera parameter. Using this feature, a solution to a general optimal performance problem that incorporates time domain and frequency domain constraints is obtained. A synthesis procedure is provided which at every step yields a feasible controller together with a measure of its performance with respect to the optimal. Convergence to the optimal performance is established. An example of a multinode network congestion control problem is provided that illustrates the effectiveness of the developed methodology.     

Two‐phase production of cyclohexene and cyclooctene oxides in water as an approach to pollution prevention

Liquid–liquid two‐phase epoxidation from cyclohexene and cyclooctene in aqueous potassium peroxymonosulfate (commercially available as Oxone^®) solution was studied as an application in pollution prevention. To avoid potential emissions of volatile organic compounds an aqueous solution was employed to replace the usual chlorinated solvents used in epoxide production. A droplet column reactor and stirred tank reactor were used to investigate two‐phase synthesis of epoxide. An aqueous Oxone^® solution was used to oxidize a dispersion of alkene droplets and form epoxide. The study of aqueous epoxidation in both reactors showed that the epoxidation of alkenes can be represented as a first order reaction with respect to alkene. The salting out effect of Oxone^® concentration was studied in both reactors and found to be very similar at optimal conditions. In comparing the two reactors, it was found that the droplet column reactor produces larger quantities of product per unit reactor volume for the same reaction time. The objective of this study is to provide an alternative reactor design and synthesis route that can meet pollution prevention goals. Copyright © 2004 Society of Chemical Industry     

Evaluation of image similarity by histogram intersection

Colour is the most widely used attribute in image retrieval and object recognition. A technique known as histogram intersection has been widely studied and is considered to be effective for color‐image indexing. The key issue of this algorithm is the selection of an appropriate color space and optimal quantization of the selected color space. The goal of this article is to measure the model performance in predicting human judgment in similarity measurement for various images, to explore the capability of the model with a wide set of color spaces, and to find the optimal quantization of the selected color spaces. Six color spaces and twelve quantization levels are involved in evaluating the performance of histogram intersection. The categorical judgment and rank order experiments were conducted to measure image similarity. The CIELAB color space was found to perform at least as good as or better than the other color spaces tested, and the ability to predict image similarity increased with the number of bins used in the histograms, for up to 512 bins (8 per channel). With more than 512 bins, further improvement was negligible for the image datasets used in this study. © 2005 Wiley Periodicals, Inc. Col Res Appl, 30, 265–274, 2005; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/col.20122     

基于因特网的远程校准技术进展

远程校准是信息技术特别是计算机网络技术与传统的计量测试技术结合的必然产物。本文介绍与之有关的一些概念及国外开展相应项目的情况。结合我们自己的一个实验装置．对在我国开展远程校准工作的必要性和可行性提出一些看法。     

用保形样条方法求解非定常对流扩散方程

在欧拉-拉格朗日分裂方法的基础上,本文发展了一种固定网格上的欧拉-拉格朗日分裂方法.保形样条方法(SPSM)被用来解决倒特征线插值问题.通过求解几个有精确解的例子,说明SPSM方法的解是单调无振荡的,并且数值耗散也是比较小的.     

往复式压缩机管道的防振设计

分析了往复式压缩机管道产生振动的原因及影响因素,提出解决管道振动的方法及对策。     

基于神经PID网络的串级调节系统研究

本文提出了一种神经PID网络控制器，并利用它构成串级调节系统。在给出网络结构和计算公式的基础上，进行了计算机仿真。仿真结果表明，神经PID网络控制器构成的串级调节系统具有良好的动态和静态性能及很强的抗扰能力。     

利用马铃薯淀粉下脚液生产饮料工艺的研究

本实验尝试从马铃薯中提取蛋白质等成份，并适当添加姜汁，制成一种新型饮料，对饮料生产的工艺条件作了详细探讨，成功地解决了马铃薯褐变及沉淀等问题，确定了最佳配方及工艺。     

苯并口恶嗪-环氧化合物-胺类催化剂体系开环聚合反应的研究

采用TLC，GPC，1H－NMR及IR等分析方法，对苯并恶嗪－环氧化合物－胺类催化剂体系的聚合反应进行了研究，表征了产物结构，并探讨了聚合反应机理，结果表明，苯并恶唪－环氧化合物体系在胺类催化剂如苄胺，咪唑的作用下，能发生开环聚合反应，生成低分子量的聚合物。