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.     

A generalized Bezoutian matrix with respect to a polynomial sequence of interpolatory type

In this note, a generalized Bezoutian matrix with respect to a polynomial sequence of interpolatory type is introduced. The operator representation relative to a pair of dual bases and the generalized Barnett-type factorization formula are derived. An intertwining relation and a Bezoutian reduction to a block diagonal form by congruence via a generalized Vandermonde matrix are presented. Fujiwara-Hermite and Routh-Hurwitz criteria in terms of this generalized Bezout matrix are obtained.     

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     

Similarity retrieval of iconic image database

The perception of spatial relationships among objects in a picture is one of the important selection criteria to discriminate and retrieve the images in an iconic image database system. The data structure called 2D string, proposed by Chang et al., is adopted to represent symbolic pictures. The 2D string preserves the objects' spatial knowledge embedded in images. Since spatial relationship is a fuzzy concept, the capability of similarity retrieval for the retrieval by subpicture is essential. In this paper, similarity measure based on 2D string longest common subsequence is defined. The algorithm for similarity retrieval is also proposed. Similarity retrieval provides the iconic image database with the distinguishing function different from a conventional database.     

Perceptual Temporal Quality Metric for Compressed Video

This paper presents a metric to quantify frame loss according to the impact on perceived temporal quality. This metric particularly aims at measuring the temporal quality degradation caused by both regular and irregular frame loss. Experimental results with subjective viewing demonstrate high performance on prediction of perceptual temporal quality.     

鞍钢现有人造富矿产能及1600万t/a生铁规模的合理炉料结构的探讨

简要介绍了鞍钢现有人造富矿生产能力，分析了鞍钢生产1600万t／a生铁所需要的炉料数量、品种和质量，并提出了解决炉料缺口的方法和措施。     

阳平关砂金矿精选厂尾矿综合回收的研究

本文详细的介绍了陕西省阳平关砂金矿精选厂尾矿金和其他可利用的矿物综合回收方法和最佳分选流程。     

Study of 18-cm long single-sided AC-coupled silicon microstripdetectors

The SSC GEM silicon Central Tracker design incorporated 18-cm long single-sided AC-coupled silicon microstrip ladders. Compared to the 12-cm long ladders considered in the preliminary stages of the tracker design, the 18-cm long ladders have the advantage of reduced cost, channel count and overall power consumption, and led to a simplified tracker assembly. However, such long ships also present the challenge of maintaining satisfactory performance. The increased capacitance and series resistance contribute to lower signal-to-noise ratios, longer time walk, higher power consumption per channel and increased probability of crosstalk to neighboring channels. In this paper, an accurate method to calculate the geometric capacitance of the AC-coupled microstrips is presented and the calculated results are compared with measurements, SPICE simulations are performed to predict the noise, the extent of interstrip capacitive coupling and the dispersion of the detector signal due to the finite series resistance of the metal strips and the long length of the detector. The influence of the preamplifier current and the shaping time on the signal and noise levels is also presented. The study concludes that the 18-cm long ladders can successfully satisfy the performance goals of the GEM silicon Central Tracker