Structural and properties of nanocrystalline WO3/TiO2-based humidity sensors elements prepared by high energy activation

Nanocrystalline WO₃/TiO₂-based powders have been prepared by the high energy activation method with WO₃ concentration ranging from 1 to 10 mol%. The samples were thermal treated in a microwave oven at 600 °C for 20 min and their structural and micro-structural characteristics were evaluated by X-ray diffraction, Raman spectroscopy, EXAFS measurements at the Ti K-edge, and transmission electron microscopy. Nitrogen adsorption isotherms and H₂ Temperature Programmed Reduction were also carried out for physical characterization. The crystallite and particle mean sizes ranged from 30 to 40 nm and from 100 to 190 nm, respectively. Good sensor response was obtained for samples with at least 5 mol% WO₃ activated for at least 80 min. Ceramics heat-treated in microwave oven for 20 min have shown similar sensor response as those prepared in conventional oven for 120 min, which is highly cost effective. These results indicate that WO₃/TiO₂ ceramics can be used as a humidity sensor element.     

分布式视频编码虚拟依赖信道模型研究

视频信息固有的非平稳特性,如冲突区域等,使时域预测技术变得非常复杂.在分布式视频编码(DVC)中,由于解码端不能获取当前编码帧的信息,精确地对时域相关噪声进行建模变得更为困难.文中以虚拟依赖信道模型为切入点对如何降低时域相关噪声进行了研究.首先对DVC虚拟依赖信道进行了建模,并对影响边信息的主要因素进行了分析,分析结果表明在变换域中不同的频率子带对时域相关噪声的敏感度不同.在此基础上提出了一种新的基于小波变换域的虚拟依赖信道模型VCMDWT,基于分类编码的思想对较为平稳的LL子带进行Wyner-Ziv编码,对非平稳的高频子带进行SPIHT帧内编码.实验结果表明,与基于像素域的方法相比,所提出的VCMDWT模型能够得到更稳定的虚拟信道,提高DVC系统的率失真性能达到2.6dBs以上.     

Model predictive control for systems with stochastic multiplicative uncertainty and probabilistic constraints

Robust predictive control handles constrained systems that are subject to stochastic uncertainty but propagating the effects of uncertainty over a prediction horizon can be computationally expensive and conservative. This paper overcomes these issues through an augmented autonomous prediction formulation, and provides a method of handling probabilistic constraints and ensuring closed loop stability through the use of an extension of the concept of invariance, namely invariance with probability p.     

Suppressing intersample behavior in iterative learning control

Iterative Learning Control (ILC) is a control strategy to improve the performance of digital batch repetitive processes. Due to its digital implementation, discrete time ILC approaches do not guarantee good intersample behavior. In fact, common discrete time ILC approaches may deteriorate the intersample behavior, thereby reducing the performance of the sampled-data system. In this paper, a generally applicable multirate ILC approach is presented that enables to balance the at-sample performance and the intersample behavior. Furthermore, key theoretical issues regarding multirate systems are addressed, including the time-varying nature of the multirate ILC setup. The proposed multirate ILC approach is shown to outperform discrete time ILC in realistic simulation examples.     

Tracking control for boundary controlled parabolic PDEs with varying parameters: Combining backstepping and differential flatness

The combination of backstepping-based state-feedback control and flatness-based trajectory planning and feedforward control is considered for the design of an exponentially stabilizing tracking controller for a linear diffusion-convection-reaction system with spatially and temporally varying parameters and nonlinear boundary input. For this, in a first step the backstepping transformation is utilized to determine a state-feedback controller, which transforms the original distributed-parameter system into an appropriately chosen exponentially stable distributed-parameter target system of a significantly simpler structure. In a second step, the flatness property of the target system is exploited in order to determine the feedforward controller, which allows us to realize the tracking of suitably prescribed trajectories for the system output. This results in a systematic procedure for the design of an exponentially stabilizing tracking controller for the considered general linear diffusion-convection-reaction system with varying parameters, whose applicability and tracking performance is evaluated in simulation studies.     

Stabilizing switching design for switched linear systems: A state-feedback path-wise switching approach

This paper addresses the problem of switching stabilization for discrete-time switched linear systems. Based on the abstraction-aggregation methodology, we propose a state-feedback path-wise switching law, which is a state-feedback concatenation from a finite set of switching paths each defined over a finite time interval. We prove that the set of state-feedback path-wise switching laws is universal in the sense that any stabilizable switched linear system admits a stabilizing switching law in this set. We further develop a computational procedure to calculate a stabilizing switching law in the set.     

A comment on “Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding”

A geodesic distance-based approach to build the neighborhood graph for isometric embedding is proposed to deal with the highly twisted and folded manifold by Wen et al. [Using locally estimated geodesic distance to optimize neighborhood graph for isometric data embedding, Pattern Recognition 41 (2008) 2226-2236]. This comment is to identify the error in their example and the ineffectiveness of their algorithm.     

A genetic algorithm with gene rearrangement for K-means clustering

In this paper, a new clustering algorithm based on genetic algorithm (GA) with gene rearrangement (GAGR) is proposed, which in application may effectively remove the degeneracy for the purpose of a more efficient search. A new crossover operator that exploits a measure of similarity between chromosomes in a population is also presented. Adaptive probabilities of crossover and mutation are employed to prevent the convergence of the GAGR to a local optimum. Using the real-world data sets, we compare the performance of our GAGR clustering algorithm with K-means algorithm and other GA methods. An application of the GAGR clustering algorithm in unsupervised classification of multispectral remote sensing images is also provided. Experiment results demonstrate that the GAGR clustering algorithm has high performance, effectiveness and flexibility.     

Combining feature spaces for classification

In this paper we offer a variational Bayes approximation to the multinomial probit model for basis expansion and kernel combination. Our model is well-founded within a hierarchical Bayesian framework and is able to instructively combine available sources of information for multinomial classification. The proposed framework enables informative integration of possibly heterogeneous sources in a multitude of ways, from the simple summation of feature expansions to weighted product of kernels, and it is shown to match and in certain cases outperform the well-known ensemble learning approaches of combining individual classifiers. At the same time the approximation reduces considerably the CPU time and resources required with respect to both the ensemble learning methods and the full Markov chain Monte Carlo, Metropolis-Hastings within Gibbs solution of our model. We present our proposed framework together with extensive experimental studies on synthetic and benchmark datasets and also for the first time report a comparison between summation and product of individual kernels as possible different methods for constructing the composite kernel matrix.     

Stable local dimensionality reduction approaches

Dimensionality reduction is a big challenge in many areas. A large number of local approaches, stemming from statistics or geometry, have been developed. However, in practice these local approaches are often in lack of robustness, since in contrast to maximum variance unfolding (MVU), which explicitly unfolds the manifold, they merely characterize local geometry structure. Moreover, the eigenproblems that they encounter, are hard to solve. We propose a unified framework that explicitly unfolds the manifold and reformulate local approaches as the semi-definite programs instead of the above-mentioned eigenproblems. Three well-known algorithms, locally linear embedding (LLE), laplacian eigenmaps (LE) and local tangent space alignment (LTSA) are reinterpreted and improved within this framework. Several experiments are presented to demonstrate the potential of our framework and the improvements of these local algorithms.