Reduced-order output feedback controllers for discrete-time systems

This article considers the stabilization by output feedback controllers for discrete-time systems. The controller can place all of the closed-loop poles within a specified disk D(-α, 1/β), centred at (-α,0) with radius 1/β, where | - α|  + 1/β < 1. The design method involves the decomposition of the system into two portions. The first portion comprises of all of the poles that are lying outside of the specified disk. A reduced-order model is constructed for this portion. The second portion comprises of all of the remaining poles of the system and is characterized by an H_∞-norm bound. The controller design is then accomplished by using H_∞-control theory. It is shown that, subject to the solvability of an algebraic Riccati equation, output feedback controllers can be systematically derived. The order of the controller is low, and can be as low as the number of the open-loop poles that are lying outside of the specified disk. A step-by-step design algorithm is provided. Numerical examples are given to illustrate the attractiveness of the design method.

Application of a discrete event simulation for robust system design of a melt facility

This paper presents a methodology to identify robust operating regions through the selection of controllable factory variables, using discrete event simulation. A casting plant melt facility was used as an industrial test bed to develop these techniques. A robust system design was determined by response surface analysis of key production parameters. Furthermore, robust operating policies that maximise throughput, while minimizing work-in-progress and thus energy consumption were identified.

A new approach for reducing blocking artefacts using linear filter for block based transform coded images

This paper presents a new approach to filtering the reconstructed image of block based transform coded images.

Parallelization of the discrete gradient method of non-smooth optimization and its applications

We investigate parallelization and performance of the discrete gradient method of nonsmooth optimization. This derivative free method is shown to be an effective optimization tool, able to skip many shallow local minima of nonconvex nondifferentiable objective functions. Although this is a sequential iterative method, we were able to parallelize critical steps of the algorithm, and this lead to a significant improvement in performance on multiprocessor computer clusters. We applied this method to a difficult polyatomic clusters problem in computational chemistry, and found this method to outperform other algorithms.

Predicting the distribution of discrete spatial events using artificial neural networks

Although the development of geographic information system (GIS) technology and digital data manipulation techniques has enabled practitioners in the geographical and geophysical sciences to make more efficient use of resource information, many of the methods used in forming spatial prediction models are still inherently based on traditional techniques of map stacking in which layers of data are combined under the guidance of a theoretical domain model. This paper describes a data-driven approach by which Artificial Neural Networks (ANNs) can be trained to represent a function characterising the probability that an instance of a discrete event, such as the presence of a mineral deposit or the sighting of an endangered animal species, will occur over some grid element of the spatial area under consideration. A case study describes the application of the technique to the task of mineral prospectivity mapping in the Castlemaine region of Victoria using a range of geological, geophysical and geochemical input variables. Comparison of the maps produced using neural networks with maps produced using a density estimation-based technique demonstrates that the maps can reliably be interpreted as representing probabilities. However, while the neural network model and the density estimation-based model yield similar results under an appropriate choice of values for the respective parameters, the neural network approach has several advantages, especially in high dimensional input spaces.

Image matching using TI multi-wavelet transform

A multi-resolution image matching technique based on multiwavelets followed by a coarse to fine strategy is presented. The technique addresses the estimation of optimal corresponding points and the corresponding disparity maps in the presence of occlusion, ambiguity and illuminative variations in the two perspective views taken by two different cameras or at different lighting conditions. The problem of occlusion and ambiguity is addressed by a geometric topological refining approach along with the uniqueness constraint whereas the illuminative variation is dealt by using windowed normalized correlation.

Determination of cashmere and wool fibre scale frequency by analysing diameter profiles with fast fourier transform

This paper describes a potentially faster and cheaper method of determining fibre scale frequencies. The method uses the single fibre analyser (SIFAN) to  determine the along the fibre diameter profile. This information is then analysed by the Fast Fourier Transform technique using computer software. The paper shows the close association between the mean scale frequencies determined by this method and the traditional approach using SEM.

Linking discrete event simulation models using HLA

The increasing usage of discrete event simulation packages for modeling and analyzing manufacturing and logistics has led to a need for connecting simulation models together at runtime. One such methodology for linking discrete event simulation models together has been developed for this research and this paper demonstrates the usage of this linking method. A unified simulation model is developed from two submodels developed using different simulation packages.

Lower bounds for stability margin of n-dimensional discrete systems

This paper derives lower bounds for the stability margin of n-dimensional discrete systems in the Roesser’s state space setting. The lower bounds for stability margin are derived based on the MacLaurine series expansion. Numerical examples are given to illustrate the results.

Robust strictly positive real synthesis of polynomial segments for discrete time systems

By using the result of robust strictly positive real synthesis of polynomial segments for continuous time systems, it is proved that, for any two n-th order polynomials a(z) and b(z), the Schur stability of their convex combination is necessary and sufficient for the existence of an n-th order polynomial c(z) such that c(z)/a(z) and c(z)/b(z) are both strictly positive real. We also provide the construction method of c(z). Illustrative examples are provided to show the effectiveness of this method.