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.     

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方法的解是单调无振荡的,并且数值耗散也是比较小的.     

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

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

爆破条件对爆破震动信号分析中小波包时频特征的影响

非平稳信号的小波包分析是在小波变换基础上发展起来的 ,它对小波分析中没有细分的高频部分进一步分解 ,从而能够对信号局部信息进行更为精细的掌握。爆破条件是影响爆破震动时频特征分布的主要因素之一。本研究中 ,针对在不同段药量、不同微差间隔时间及近似相同的其它条件下产生的爆破震动信号 ,运用小波包分析方法对其进行了时频分析 ,主要探讨了段药量、段微差间隔时间对爆破震动时频分布的影响规律。段药量对爆破震动波形时频特征的影响主要体现在各层小波包主振频带内的细节信号峰值质点振速方面 ,各细节信号的峰值质点振速随段药量增加而增大 ,但主振频带分布保持基本的一致性 ,同一主振频带下小波包细节信号的阻尼比也趋于一致 ;段微差时间间隔对爆破震动时频特征的影响主要表现在 :延长各主振频带小波包细节信号的振动持时 ,不同微差单段波形的叠加增加了主振频带个数 (优势频率个数 )并使各频带内的优势频率值有微弱增大的趋势     

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

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

网壳结构内扩安装法施工内力特性分析

本文针对目前国内常用的网壳内扩安装法，全过程跟踪分析了构件在用内扩法安装期间的施工内力特性及其变化规律，得出了网壳结构设计计算必须考虑施工内力的影响等重要结论。