Reading the play : adaptation by prediction of agent motion

An adaptive agent improves its performance by learning from experience. This paper describes an approach to adaptation based on modelling dynamic elements of the environment in order to make predictions of likely future state. This approach is akin to an elite sports player being able to “read the play”, allowing for decisions to be made based on predictions of likely future outcomes. Modelling of the agent‟s likely future state is performed using Markov Chains and a technique called “Motion and Occupancy Grids”. The experiments in this paper compare the performance of the planning system with and without the use of this predictive model. The results of the study demonstrate a surprising decrease in performance when using the predictions of agent occupancy. The results are derived from statistical analysis of the agent‟s performance in a high fidelity simulation of a world leading real robot soccer team.

Optical techniques for real-time binary multiplication

An optical system which performs the multiplication of binary numbers is described and proof-of-principle experiments are performed. The simultaneous generation of all partial products, optical regrouping of bit products, and optical carry look-ahead addition are novel features of the proposed scheme which takes advantage of the parallel operations capability of optical computers. The proposed processor uses liquid crystal light valves (LCLVs). By space-sharing the LCLVs one such system could function as an array of multipliers. Together with the optical carry look-ahead adders described, this would constitute an optical matrix-vector multiplier.

Multi-modal deformable medical image registration

Non-rigid image registration is an essential tool required for overcoming the inherent local anatomical variations that exist between images acquired from different individuals or atlases. Furthermore, certain applications require this type of registration to operate across images acquired from different imaging modalities. One popular local approach for estimating this registration is a block matching procedure utilising the mutual information criterion. However, previous block matching procedures generate a sparse deformation field containing displacement estimates at uniformly spaced locations. This neglects to make use of the evidence that block matching results are dependent on the amount of local information content. This paper presents a solution to this drawback by proposing the use of a Reversible Jump Markov Chain Monte Carlo statistical procedure to optimally select grid points of interest. Three different methods are then compared to propagate the estimated sparse deformation field to the entire image including a thin-plate spline warp, Gaussian convolution, and a hybrid fluid technique. Results show that non-rigid registration can be improved by using the proposed algorithm to optimally select grid points of interest.

A data mining approach for fault diagnosis: An application of anomaly detection algorithm

Rolling-element bearing failures are the most frequent problems in rotating machinery, which can be catastrophic and cause major downtime. Hence, providing advance failure warning and precise fault detection in such components are pivotal and cost-effective. The vast majority of past research has focused on signal processing and spectral analysis for fault diagnostics in rotating components. In this study, a data mining approach using a machine learning technique called anomaly detection (AD) is presented. This method employs classification techniques to discriminate between defect examples. Two features, kurtosis and Non-Gaussianity Score (NGS), are extracted to develop anomaly detection algorithms. The performance of the developed algorithms was examined through real data from a test to failure bearing. Finally, the application of anomaly detection is compared with one of the popular methods called Support Vector Machine (SVM) to investigate the sensitivity and accuracy of this approach and its ability to detect the anomalies in early stages.

Structure of 2-(2,6-dimethoxyphenyl)-2,5- dimethylbicyclo[3.2.1]octane-6,8-dione

C18H2204, orthorhombic, P212~21, a = 7.343 (4), b = 11.251 (4), c = 19.357 (4)A, Z = 4, Dr, ' = 1.20, D e = 1.254 g cm -3, F(000) = 648, p(MoKa) = 0.94 cm -~. X-ray intensity data were collected on a Nonius CAD-4 diffractometer and the structure was solved by direct methods. Full-matrix least-squares refinement gave R = 0.052 (R w = 0.045) for 1053 observed reflections. The stereochemical configuration at C(2) has been shown to be 2-exo-methyl-2-endo-(2,6-dimethoxyphenyl), i.e. (3) in contrast to the structure (2) assigned earlier based on its ~H NMR data.

Dynamic Bayesian network inferencing for non-homogeneous complex systems

Dynamic Bayesian Networks (DBNs) provide a versatile platform for predicting and analysing the behaviour of complex systems. As such, they are well suited to the prediction of complex ecosystem population trajectories under anthropogenic disturbances such as the dredging of marine seagrass ecosystems. However, DBNs assume a homogeneous Markov chain whereas a key characteristics of complex ecosystems is the presence of feedback loops, path dependencies and regime changes whereby the behaviour of the system can vary based on past states. This paper develops a method based on the small world structure of complex systems networks to modularise a non-homogeneous DBN and enable the computation of posterior marginal probabilities given evidence in forwards inference. It also provides an approach for an approximate solution for backwards inference as convergence is not guaranteed for a path dependent system. When applied to the seagrass dredging problem, the incorporation of path dependency can implement conditional absorption and allows release from the zero state in line with environmental and ecological observations. As dredging has a marked global impact on seagrass and other marine ecosystems of high environmental and economic value, using such a complex systems model to develop practical ways to meet the needs of conservation and industry through enhancing resistance and/or recovery is of paramount importance.

Structure of 2-(2,6-Dimethoxyphenyl)-2,5-dimethylbicyclo[3.2. l]octane-6,8-dione

C18H2204, orthorhombic, P212~21, a = 7.343 (4), b = 11.251 (4), c = 19.357 (4)A, Z = 4, Dr, ' = 1.20, D e = 1.254 g cm -3, F(000) = 648, p(Mo Ka) = 0.94 cm -~. X-ray intensity data were collected on a Nonius CAD-4 diffractometer and the structure was solved by direct methods. Full-matrix least-squares refinement gave R = 0.052 (R w = 0.045) for 1053 observed reflections. The stereochemical configuration at C(2) has been shown to be 2-exo-methyl-2-endo- (2,6-dimethoxyphenyl), i.e. (3) in contrast to the structure (2) assigned earlier based on its ~H NMR data.

The need for cost-effectiveness analyses of antimicrobial stewardship programmes: A structured review

The cost effectiveness of antimicrobial stewardship (AMS) programmes was reviewed in hospital settings of Organisation for Economic Co-operation and Development (OECD) countries, and limited to adult patient populations. In each of the 36 studies, the type of AMS strategy and the clinical and cost outcomes were evaluated. The main AMS strategy implemented was prospective audit with intervention and feedback (PAIF), followed by the use of rapid technology, including rapid polymerase chain reaction (PCR)-based methods and matrix-assisted laser desorption/ionisation time-of-flight (MALDI-TOF) technology, for the treatment of bloodstream infections. All but one of the 36 studies reported that AMS resulted in a reduction in pharmacy expenditure. Among 27 studies measuring changes to health outcomes, either no change was reported post-AMS, or the additional benefits achieved from these outcomes were not quantified. Only two studies performed a full economic evaluation: one on a PAIF-based AMS intervention; and the other on use of rapid technology for the selection of appropriate treatment for serious Staphylococcus aureus infections. Both studies found the interventions to be cost effective. AMS programmes achieved a reduction in pharmacy expenditure, but there was a lack of consistency in the reported cost outcomes making it difficult to compare between interventions. A failure to capture complete costs in terms of resource use makes it difficult to determine the true cost of these interventions. There is an urgent need for full economic evaluations that compare relative changes both in clinical and cost outcomes to enable identification of the most cost-effective AMS strategies in hospitals.

Structure of pentacyclo[7.4.2.02,6.06,15.011,14]pentadec-4-ene-7,13-dione, a novel pentacyclic C15 quinane system

C 15H 1602 (a synthetic precursor to dodecahedrane), monoclinic, P21/n, a = 12.171 (5), b = 6.976(5), c = 13.868 (3) A, B = 102.56 (3) ° , Z = 4, D m = 1.30, D c = 1.318 g cm -3, F(000) = 488, g(Mo K¢t) = 0.92 cm- 1. Intensity data were collected on a Nonius CAD-4 diffractometer and the structure was solved by direct methods. Full-matrix least-squares refinement gave R = 0.077 (R w = 0.076) for 1337 observed reflections. All the five-membered rings are cis fused and have envelope (C s symmetry) conformations.

Stochastic modelling of flexible manufacturing systems

Mathematical modelling plays a vital role in the design, planning and operation of flexible manufacturing systems (FMSs). In this paper, attention is focused on stochastic modelling of FMSs using Markov chains, queueing networks, and stochastic Petri nets. We bring out the role of these modelling tools in FMS performance evaluation through several illustrative examples and provide a critical comparative evaluation. We also include a discussion on the modelling of deadlocks which constitute an important source of performance degradation in fully automated FMSs.

Optimal control of arrivals to queues with delayed queue length information

We consider discrete-time versions of two classical problems in the optimal control of admission to a queueing system: i) optimal routing of arrivals to two parallel queues and ii) optimal acceptance/rejection of arrivals to a single queue. We extend the formulation of these problems to permit a k step delay in the observation of the queue lengths by the controller. For geometric inter-arrival times and geometric service times the problems are formulated as controlled Markov chains with expected total discounted cost as the minimization objective. For problem i) we show that when k = 1, the optimal policy is to allocate an arrival to the queue with the smaller expected queue length (JSEQ: Join the Shortest Expected Queue). We also show that for this problem, for k greater than or equal to 2, JSEQ is not optimal. For problem ii) we show that when k = 1, the optimal policy is a threshold policy. There are, however, two thresholds m(0) greater than or equal to m(1) > 0, such that mo is used when the previous action was to reject, and mi is used when the previous action was to accept.

On a programmable signal processor for VLSI

This paper presents a method of designing a programmable signal processor based on a bit parallel matrix vector matrix multiplier (linear transformer). The salient feature of this design is that the efficiency of the direct vector matrix multiplier is improved and VLSI design is made much simpler by trading off the more expensive arithematic operation (multiplication) for 'cheaper' manipulation (addition/subtraction) of the data.

A stochastic dynamical system for image segmentation

Image segmentation is formulated as a stochastic process whose invariant distribution is concentrated at points of the desired region. By choosing multiple seed points, different regions can be segmented. The algorithm is based on the theory of time-homogeneous Markov chains and has been largely motivated by the technique of simulated annealing. The method proposed here has been found to perform well on real-world clean as well as noisy images while being computationally far less expensive than stochastic optimisation techniques

Asymptotics of the invariant measure in mean field models with jumps

We consider the asymptotics of the invariant measure for the process of spatial distribution of N coupled Markov chains in the limit of a large number of chains. Each chain reflects the stochastic evolution of one particle. The chains are coupled through the dependence of transition rates on the spatial distribution of particles in the various states. Our model is a caricature for medium access interactions in wireless local area networks. Our model is also applicable in the study of spread of epidemics in a network. The limiting process satisfies a deterministic ordinary differential equation called the McKean-Vlasov equation. When this differential equation has a unique globally asymptotically stable equilibrium, the spatial distribution converges weakly to this equilibrium. Using a control-theoretic approach, we examine the question of a large deviation from this equilibrium.