Maintenance strategy optimization using a continuous-state partially observable semi-Markov decision process

Due to the limitation of current condition monitoring technologies, the estimates of asset health states may contain some uncertainties. A maintenance strategy ignoring this uncertainty of asset health state can cause additional costs or downtime. The partially observable Markov decision process (POMDP) is a commonly used approach to derive optimal maintenance strategies when asset health inspections are imperfect. However, existing applications of the POMDP to maintenance decision-making largely adopt the discrete time and state assumptions. The discrete-time assumption requires the health state transitions and maintenance activities only happen at discrete epochs, which cannot model the failure time accurately and is not cost-effective. The discrete health state assumption, on the other hand, may not be elaborate enough to improve the effectiveness of maintenance. To address these limitations, this paper proposes a continuous state partially observable semi-Markov decision process (POSMDP). An algorithm that combines the Monte Carlo-based density projection method and the policy iteration is developed to solve the POSMDP. Different types of maintenance activities (i.e., inspections, replacement, and imperfect maintenance) are considered in this paper. The next maintenance action and the corresponding waiting durations are optimized jointly to minimize the long-run expected cost per unit time and availability. The result of simulation studies shows that the proposed maintenance optimization approach is more cost-effective than maintenance strategies derived by another two approximate methods, when regular inspection intervals are adopted. The simulation study also shows that the maintenance cost can be further reduced by developing maintenance strategies with state-dependent maintenance intervals using the POSMDP. In addition, during the simulation studies the proposed POSMDP shows the ability to adopt a cost-effective strategy structure when multiple types of maintenance activities are involved.

'State' of play : Queensland report

A number of recent legislative amendments impact on property law practice in Queensland. Property Law (Mortgagor Protection) Amendment Act 2008 (Qld) Body Corporate and Community Management Amendment Act 2009 (Qld) Residential Tenancies and Rooming Accommodation Act 2008 (Qld) Sustainable Planning Act 2009 (Qld) Vegetation Management and Other Legislation Amendment Bill 2009 (Qld) Property Agents and Motor Dealers Act 2000 (Qld)

State convergence in the initialisation of stream ciphers

An initialisation process is a key component in modern stream cipher design. A well-designed initialisation process should ensure that each key-IV pair generates a different key stream. In this paper, we analyse two ciphers, A5/1 and Mixer, for which this does not happen due to state convergence. We show how the state convergence problem occurs and estimate the effective key-space in each case.

Critical gap estimation by numerical and statistical highest likelihood search

Many traffic situations require drivers to cross or merge into a stream having higher priority. Gap acceptance theory enables us to model such processes to analyse traffic operation. This discussion demonstrated that numerical search fine tuned by statistical analysis can be used to determine the most likely critical gap for a sample of drivers, based on their largest rejected gap and accepted gap. This method shares some common features with the Maximum Likelihood Estimation technique (Troutbeck 1992) but lends itself well to contemporary analysis tools such as spreadsheet and is particularly analytically transparent. This method is considered not to bias estimation of critical gap due to very small rejected gaps or very large rejected gaps. However, it requires a sufficiently large sample that there is reasonable representation of largest rejected gap/accepted gap pairs within a fairly narrow highest likelihood search band.

A Python package for Bayesian estimation using Markov Chain Monte Carlo

Markov chain Monte Carlo (MCMC) estimation provides a solution to the complex integration problems that are faced in the Bayesian analysis of statistical problems. The implementation of MCMC algorithms is, however, code intensive and time consuming. We have developed a Python package, which is called PyMCMC, that aids in the construction of MCMC samplers and helps to substantially reduce the likelihood of coding error, as well as aid in the minimisation of repetitive code. PyMCMC contains classes for Gibbs, Metropolis Hastings, independent Metropolis Hastings, random walk Metropolis Hastings, orientational bias Monte Carlo and slice samplers as well as specific modules for common models such as a module for Bayesian regression analysis. PyMCMC is straightforward to optimise, taking advantage of the Python libraries Numpy and Scipy, as well as being readily extensible with C or Fortran.

School system as axiological medium : the state's primary macro-proposing context and its expanding moral role in Australia

This paper analyses the Australian Values Education Program (VEP) within the framework of late-classical political economy. using analytical methods from systemic functional linguistics and critical discourse analysis, we demonstrate that the VEP is an unwitting restatement of the principles of ideology as developed by the likes of Destutt de Tracy and the Young Hegelians. We conclude that the sudden shock of globalisation and the post-national cultures this has entailed is in many ways similar to the shock of formal nationalism that emerged in the late-Seventeenth and early- Eighteenth centuries. The overall result of the VEP for the Australian school system is a massive procedural burden that is unlikely to produce the results at which the program is aimed.

Model selection and error estimation

We study model selection strategies based on penalized empirical loss minimization. We point out a tight relationship between error estimation and data-based complexity penalization: any good error estimate may be converted into a data-based penalty function and the performance of the estimate is governed by the quality of the error estimate. We consider several penalty functions, involving error estimates on independent test data, empirical VC dimension, empirical VC entropy, and margin-based quantities. We also consider the maximal difference between the error on the first half of the training data and the second half, and the expected maximal discrepancy, a closely related capacity estimate that can be calculated by Monte Carlo integration. Maximal discrepancy penalty functions are appealing for pattern classification problems, since their computation is equivalent to empirical risk minimization over the training data with some labels flipped.

Fast rates for estimation error and oracle inequalities for model section

We consider complexity penalization methods for model selection. These methods aim to choose a model to optimally trade off estimation and approximation errors by minimizing the sum of an empirical risk term and a complexity penalty. It is well known that if we use a bound on the maximal deviation between empirical and true risks as a complexity penalty, then the risk of our choice is no more than the approximation error plus twice the complexity penalty. There are many cases, however, where complexity penalties like this give loose upper bounds on the estimation error. In particular, if we choose a function from a suitably simple convex function class with a strictly convex loss function, then the estimation error (the difference between the risk of the empirical risk minimizer and the minimal risk in the class) approaches zero at a faster rate than the maximal deviation between empirical and true risks. In this paper, we address the question of whether it is possible to design a complexity penalized model selection method for these situations. We show that, provided the sequence of models is ordered by inclusion, in these cases we can use tight upper bounds on estimation error as a complexity penalty. Surprisingly, this is the case even in situations when the difference between the empirical risk and true risk (and indeed the error of any estimate of the approximation error) decreases much more slowly than the complexity penalty. We give an oracle inequality showing that the resulting model selection method chooses a function with risk no more than the approximation error plus a constant times the complexity penalty.

PTZ camera pose estimation by tracking a 3D target

We present a technique for estimating the 6DOF pose of a PTZ camera by tracking a single moving target in the image with known 3D position. This is useful in situations where it is not practical to measure the camera pose directly. Our application domain is estimating the pose of a PTZ camerso so that it can be used for automated GPS-based tracking and filming of UAV flight trials. We present results which show the technique is able to localize a PTZ after a short vision-tracked flight, and that the estimated pose is sufficiently accurate for the PTZ to then actively track a UAV based on GPS position data.

A Raman spectroscopic study of the different vanadate-groups in solid-state compounds, model case : mineral phases vésigniéite, BaCu3(VO4)2(OH)2, and volborthite, Cu3V2O7(OH)2•2H2O

Raman spectroscopy has been used to study vanadates in the solid state. The molecular structure of the vanadate minerals vésigniéite [BaCu3(VO4)2(OH)2] and volborthite [Cu3V2O7(OH)2·2H2O] have been studied by Raman spectroscopy and infrared spectroscopy. The spectra are related to the structure of the two minerals. The Raman spectrum of vésigniéite is characterized by two intense bands at 821 and 856 cm−1 assigned to ν1 (VO4)3− symmetric stretching modes. A series of infrared bands at 755, 787 and 899 cm−1 are assigned to the ν3 (VO4)3− antisymmetric stretching vibrational mode. Raman bands at 307 and 332 cm−1 and at 466 and 511 cm−1 are assigned to the ν2 and ν4 (VO4)3− bending modes. The Raman spectrum of volborthite is characterized by the strong band at 888 cm−1, assigned to the ν1 (VO3) symmetric stretching vibrations. Raman bands at 858 and 749 cm−1 are assigned to the ν3 (VO3) antisymmetric stretching vibrations; those at 814 cm−1 to the ν3 (VOV) antisymmetric vibrations; that at 508 cm−1 to the ν1 (VOV) symmetric stretching vibration and those at 442 and 476 cm−1 and 347 and 308 cm−1 to the ν4 (VO3) and ν2 (VO3) bending vibrations, respectively. The spectra of vésigniéite and volborthite are similar, especially in the region of skeletal vibrations, even though their crystal structures differ.