A self-tuning adaptive trend extraction method for process monitoring and diagnosis

Trend analysis is an efficient tool for process monitoring and diagnosis. However, the performances of a trend-based diagnosis system depend on the reliability of the trends extracted from the signals. One challenge in trend analysis is to design algorithms able to adapt themselves to the varying conditions of background noise and artefacts occurring non-deterministically on a same signal. Moreover, while long term trends such as decreasing/increasing have been extensively studied other subtle changes such as slow drifts and step-like transients have received little attention. In this paper, an adaptive on-line trend-extraction method is presented. It extends a former algorithm based on a linear segmentation to filter the signal and extract trends. In this version, the tuning parameters are not set to a fixed value for a given signal but can self-adapt on-line according to an estimation of the noise variance. An increasing or decreasing trend is detected if the variations on the signal are significantly higher than the level of the background noise. An initialisation phase is proposed to automatically set the initial values of the parameters, making the algorithm a self-tuned algorithm with minimal user intervention.The method was evaluated on a set of simulated data with various levels of background noise. It was also applied on real physiological data recorded from babies hospitalised in a Neonate Intensive Care Unit. It showed improved performances compared to the non adaptive algorithm, whatever the level of noise corrupting the data.     

Local search versus Path Relinking in metaheuristics: Redesigning Meta-RaPS with application to the multidimensional knapsack problem

Most heuristics for discrete optimization problems consist of two phases: a greedy-based construction phase followed by an improvement (local search) phase. Although the best solutions are usually generated after the improvement phase, there is usually a high computational cost for employing a local search algorithm. This paper seeks another alternative to reduce the computational burden of a local search while keeping solution quality by embedding intelligence in metaheuristics. A modified version of Path Relinking is introduced to replace the local search in the improvement phase of Meta-RaPS (Meta-Heuristic for Randomized Priority Search) which is currently classified as a memoryless metaheuristic. The new algorithm is tested using the 0–1 multidimensional knapsack problem, and it is observed that it could solve even the largest benchmark problems in significantly less time while maintaining solution quality compared to other algorithms in the literature.     

Data interpolation for participatory sensing systems

In this paper, we study the problem of applying data interpolation techniques in Participatory Sensing (PS) systems using an air quality/pollution monitoring application as an example. While traditional environmental monitoring systems consist of very few static measuring stations, PS systems rely on the participation of many mobile stations. As a result, the structure of the data provided by each system is different and instead of a multivariate time series with a few gaps in the same space, now we have a multivariate time-space series with many gaps in time and space. First, two data interpolation techniques, Markov Random Fields and kriging, are analyzed. After showing the trade-offs and superiority of kriging, this technique is used to perform a one-variable data interpolation. Then, the problems of cokriging for multivariate interpolation are introduced and Principal Component Analysis and Independent Component Analysis are utilized along with kriging to overcome these problems. Finally, an alternative approach to interpolate data in time and space is proposed, which is really useful for PS systems. The results indicate that the accuracy of the estimates improves with the amount of data, i.e., one variable, multiple variables, and space and time data. Also, the results clearly show the advantage of a PS system compared with a traditional measuring system in terms of the precision and granularity of the information provided to the users.     

基于生长的自组织映射的数据挖掘

在数据挖掘应用中,基于自生成神经网络的方法被认为是比基于固定网络方法更好的一种替代方法。介绍了自组织映射(SOM)算法和生长的自组织映射(GSOM)模型,证明了GSOM的功能可以扩展成最近原型分类,并给出了其在数据挖掘中的一个应用。     

融合多源信息的地表气温插值研究

为了提高地表气温的插值精度,提出了融合多源信息的地表气温插值方法,该方法以地表气温和辅助信息之间显著相关为前提条件,利用多元地统计（拟协同克里金、基于局部变化均值的简单克里金、带外部漂移的克里金）来实现多源信息的融合。对中国720多个气象站2008年8月的月平均地表气温进行了空间插值实验,实验结果表明,综合考虑两种辅助信息的SKlm和KED插值方法最优,其原因在于：1）地表气温和海拔及地表温度显著相关,海拔反映地表气温的总体趋势,而地表温度更侧重反映它的局部趋势,综合考虑它们能更准确地预测地表气温。2）SKlm和KED均是基于非二阶平稳的插值方法,而地表气温的空间分布往往呈非平稳性,因此它们要优于其他方法。     

Adaptive local kriging to retrieve slant-range surface motion maps of the Wenchuan earthquake

Kriging is a widely used technique for raster data interpolation from point samples, such as in the generation of digital elevation models and geochemical maps. The quality of the result depends on both spatial distribution of the sampled values and nature of the semivariogram model, which fits an empirical global function to the sample data set to predict values at the unknown locations. However, such a semivariogram model may not be suitable for data sets with complex local trends in spatial distribution, such as those observed in differential interferometric synthetic aperture radar (DInSAR) data of the Wenchuan earthquake. Here we propose a modified kriging method, adaptive local kriging (ALK), for the retrieval of data lost through decoherence in Advanced Land Observing Satellite (ALOS) phased array L-band synthetic aperture radar (PALSAR) DInSAR data, within the intensely deformed fault zone of the 2008 Wenchuan earthquake. In ALK, a series of dynamic linear local semivariogram models is used rather than a global semivariogram for the whole data set. The localized adaptive approach ensures accurate interpolation in the areas of good DInSAR data with small decoherence gaps and avoids drastic errors in the extensive decoherence gaps; the overall value prediction is thus significantly improved, as confirmed by comparison with the original DInSAR data and fidelity verification experiments.     

Incremental LR parsers

Summary The concept of incremental parsing is briefly introduced. An algorithm which augments an LR parser with the capability of reanalyzing a limited part of a modified program is illustrated. The algorithm operates on a sequence of configurations representing the parse of the old input and finds the smallest part of the sequence which must be recomputed to obtain the parse of the new input.The implementation is discussed: a suitable data structure and a version of the algorithm which operates upon it are introduced; finally the problem of realizing efficient incremental parsers is faced, showing a modification to the basic algorithm which enable the reanalysis to be performed in linear time.Work supported by C.N.R., Italy     

Improving the performance of predictive process modeling for large datasets

Advances in Geographical Information Systems (GIS) and Global Positioning Systems (GPS) enable accurate geocoding of locations where scientific data are collected. This has encouraged collection of large spatial datasets in many fields and has generated considerable interest in statistical modeling for location-referenced spatial data. The setting where the number of locations yielding observations is too large to fit the desired hierarchical spatial random effects models using Markov chain Monte Carlo methods is considered. This problem is exacerbated in spatial-temporal and multivariate settings where many observations occur at each location. The recently proposed predictive process, motivated by kriging ideas, aims to maintain the richness of desired hierarchical spatial modeling specifications in the presence of large datasets. A shortcoming of the original formulation of the predictive process is that it induces a positive bias in the non-spatial error term of the models. A modified predictive process is proposed to address this problem. The predictive process approach is knot-based leading to questions regarding knot design. An algorithm is designed to achieve approximately optimal spatial placement of knots. Detailed illustrations of the modified predictive process using multivariate spatial regression with both a simulated and a real dataset are offered.     

Automatic devices for monitoring environmentally induced auto-oxidative degradation of artistic materials in conservation sites

This paper describes an automatic device for in situ and continuous monitoring of the ageing process occurring in natural and synthetic resins widely used in art and in the conservation and restoration of cultural artefacts. The results of tests carried out under accelerated ageing conditions are also presented. This easy-to-assemble palm-top device, essentially consists of oscillators based on quartz crystal resonators coated with films of the organic materials whose response to environmental stress is to be addressed. The device contains a microcontroller which selects at pre-defined time intervals the oscillators and records and stores their oscillation frequency. The ageing of the coatings, caused by the environmental stress and resulting in a shift in the oscillation frequency of the modified crystals, can be straightforwardly monitored in this way. The kinetics of this process reflects the level of risk damage associated with a specific microenvironment.

In this case, natural and artificial resins, broadly employed in art and restoration of artistic and archaeological artefacts (dammar and Paraloid B72), were applied onto the crystals. The environmental stress was represented by visible and UV radiation, since the chosen materials are known to be photochemically active, to different extents. In the case of dammar, the results obtained are consistent with previous data obtained using a bench-top equipment by impedance analysis through discrete measurements and confirm that the ageing of this material is reflected in the gravimetric response of the modified quartz crystals. As for Paraloid B72, the outcome of the assays indicates that the resin is resistant to visible light, but is very sensitive to UV irradiation. The use of a continuous monitoring system, apart from being obviously more practical, is essential to identify short-term (i.e. reversible) events, like water vapour adsorption/desorption processes, and to highlight ageing trends or sudden changes of such trends.     

Comparative study of the tropospheric ozone derived from satellite data using different interpolation techniques

Tropospheric ozone (TO) has been derived from the Aura/Ozone Monitoring Instrument (OMI) and the Aura/Microwave Limb Sounder (MLS) over the Indian sub-continent region using a tropospheric ozone residual (TOR) technique. The TO was initially retrieved at a horizontal spatial resolution following that of the Aura/MLS (300 km), which has a lower horizontal spatial resolution than that of the Aura/OMI (25 km). To overcome the limitations imposed by data at a lower spatial resolution, we have introduced a 2D rectangular interpolation (RI) algorithm for effective resampling of data to higher horizontal spatial resolutions. The performance of this algorithm has been evaluated by comparison against existing standard techniques such as nearest neighbourhood (NN) and kriging interpolation as well as comparison against in situ ozonesonde observations. Gridded TO estimates were subsequently generated for the region of interest at 25, 50, and 100 km horizontal spatial resolutions for further study.     

Hybrid multilayered perceptron networks

This paper introduces a modified multilayered perception network (MLP) called the Hybrid Multilayered Perceptron (HMLP) network to improve the performance of a MLP network. The convergence rate of the proposed network is further improved by proposing a modified version of the recursive prediction error algorithm as the training algorithm. The capability of the proposed network architecture trained using the modified recursive prediction error algorithm was demonstrated using simulated and real data sets. The results indicated that the proposed network provides a significant improvement over a standard MLP network. These additional linear input connections do not significantly increase the complexity of the MLP network since the connections are linear. In fact, by using the linear input connections, the number of hidden nodes required by the standard MLP network model can be reduced, which will also reduce computational load. The performance of the HMLP network was also compared with Radial Basis Function (RBF) and Hybrid Radial Basis Function (HRBF) networks. It was found that the proposed HMLP network was much more efficient than both RBF and HRBF networks.     

Heterogeneous forest classification by creating mixed vegetation classes using EO-1 Hyperion

Hyperspectral satellite data is an efficient tool in vegetation mapping; however, previous studies indicate that classifying heterogeneous forests might be difficult. In this study, we propose a mapping method for a heterogeneous forest using the data of the Earth Observing-1 (EO-1) Hyperion supplemented by field survey. We introduced a band reduction method to raise classification accuracy of the Support Vector Machine classification algorithm and compared the results to the one reduced by principal component analysis (PCA), stepwise discriminant analysis (SDA), and the original data set. We also used a modified version of the Vegetation–Impervious–Soil model to create mixed vegetation classes consisting of the commonly mixing species in the area and classified them using Decision Tree classification method. We managed to achieve 84.28% approximately using our band reduction method which is 2.36% increase compared to PCA (81.92%), 1.43% compared to the SDA (82.85%), and 7.61% compared to the original data set (76.67%). Introducing the mixed vegetation classes raised the overall accuracy even higher (85.79%).     

Multi-objective optimization of two stage thermoelectric cooler using a modified teaching–learning-based optimization algorithm

Teaching–learning-based optimization (TLBO) is a recently developed heuristic algorithm based on the natural phenomenon of teaching–learning process. In the present work, a modified version of the TLBO algorithm is introduced and applied for the multi-objective optimization of a two stage thermoelectric cooler (TEC). Two different arrangements of the thermoelectric cooler are considered for the optimization. Maximization of cooling capacity and coefficient of performance of the thermoelectric cooler are considered as the objective functions. An example is presented to demonstrate the effectiveness and accuracy of the proposed algorithm. The results of optimization obtained by using the modified TLBO are validated by comparing with those obtained by using the basic TLBO, genetic algorithm (GA), particle swarm optimization (PSO) and artificial bee colony (ABC) algorithms.     

An alternate quantum adiabatic evolution for the Deutsch–Jozsa problem

Deutsch–Jozsa algorithm has been implemented via quantum adiabatic evolutions by Das et al. (Phys Rev A 65:062310, 2002) and Wei et al. (Phys Lett A 354:271, 2006). In the latter literature, the authors have shown a modified version of the adiabatic evolution which can improve the performance of the algorithm of S. Das et al’s to constant time. In this paper, we also improve the algorithm of S. Das et al’s in a constant time but by using a different construction of adiabatic evolution, i.e., adding ancillary qubits. The algorithm in this paper provides an alternative option to potential users.     

An Approximate Median Polish Algorithm for Large Multidimensional Data Sets

Exploratory data analysis is a widely used technique to determine which factors have the most influence on data values in a multi-way table, or which cells in the table can be considered anomalous with respect to the other cells. In particular, median polish is a simple yet robust method to perform exploratory data analysis. Median polish is resistant to holes in the table (cells that have no values), but it may require many iterations through the data. This factor makes it difficult to apply median polish to large multidimensional tables, since the I/O requirements may be prohibitive. This paper describes a technique that uses median polish over an approximation of a datacube, easing the burden of I/O. The cube approximation is achieved by fitting log-linear models to the data. The results obtained are tested for quality, using a variety of measures. The technique scales to large datacubes and proves to give a good approximation of the results that would have been obtained by median polish in the original data.     

Parametric image alignment using enhanced correlation coefficient maximization

In this work we propose the use of a modified version of the correlation coefficient as a performance criterion for the image alignment problem. The proposed modification has the desirable characteristic of being invariant with respect to photometric distortions. Since the resulting similarity measure is a nonlinear function of the warp parameters, we develop two iterative schemes for its maximization, one based on the forward additive approach and the second on the inverse compositional method. As it is customary in iterative optimization, in each iteration the nonlinear objective function is approximated by an alternative expression for which the corresponding optimization is simple. In our case we propose an efficient approximation that leads to a closed form solution (per iteration) which is of low computational complexity, the latter property being particularly strong in our inverse version. The proposed schemes are tested against the Forward Additive Lucas-Kanade and the Simultaneous Inverse Compositional algorithm through simulations. Under noisy conditions and photometric distortions our forward version achieves more accurate alignments and exhibits faster convergence whereas our inverse version has similar performance as the Simultaneous Inverse Compositional algorithm but at a lower computational complexity.     

Integrating AVHRR satellite data and NOAA ground observations to predict surface air temperature: a statistical approach

Ground station temperature data are not commonly used simultaneously with the Advanced Very High Resolution Radiometer (AVHRR) to model and predict air temperature or land surface temperature. Technology was developed to acquire near-synchronous datasets over a 1?000?000?km² region with the goal of improving the measurement of air temperature at the surface. This study compares several statistical approaches that combine a simple AVHRR split window algorithm with ground meterological station observations in the prediction of air temperature. Three spatially dependent (kriging) models were examined, along with their non-spatial counterparts (multiple linear regressions). Cross-validation showed that the kriging models predicted temperature better (an average of 0.9°C error) than the multiple regression models (an average of 1.4°C error). The three different kriging strategies performed similarly when compared to each other. Errors from kriging models were unbiased while regression models tended to give biased predicted values. Modest improvements seen after combining the data sources suggest that, in addition to air temperature modelling, the approach may be useful in land surface temperature modelling.     

Classification of remotely-sensed imagery using an indicator kriging approach: application to the problem of calcite-dolomite mineral mapping

A new image classification technique for analysis of remotely-sensed data based on geostatistical indicator kriging is introduced. Conventional classification techniques require ground truth information, use only the spectral characteristics of an unknown pixel in comparison, rely on a Gaussian probability distribution for the spectral signature of the training data, and work on a pixel support or spatial resolution without allowing classification on larger or smaller volumes. The indicator kriging classifier overcomes such problems because: (1) it relies on spectral information from laboratory studies rather than on ground truth data, (2) through the kriging estimation variances an estimate of uncertainly is derived, (3) it incorporates spatial aspects because it uses local estimation techniques, (4) it is distribution-free, (5) and may be applied on different supports if the data are corrected for support changes. Comparison of classification results applied to the problem of mapping calcite and dolomite from GER imaging spectrometry data shows that indicator kriging performs better than the conventional classification algorithms and gives insight in the accuracy of the results without prior field knowledge     

Improved cache performance in Monte Carlo transport calculations using energy banding

We present an energy banding algorithm for Monte Carlo (MC) neutral particle transport simulations which depend on large cross section lookup tables. In MC codes, read-only cross section data tables are accessed frequently, exhibit poor locality, and are typically too much large to fit in fast memory. Thus, performance is often limited by long latencies to RAM, or by off-node communication latencies when the data footprint is very large and must be decomposed on a distributed memory machine. The proposed energy banding algorithm allows maximal temporal reuse of data in band sizes that can flexibly accommodate different architectural features. The energy banding algorithm is general and has a number of benefits compared to the traditional approach. In the present analysis we explore its potential to achieve improvements in time-to-solution on modern cache-based architectures.     

A two-stage fuzzy multi-objective framework for segmentation of 3D MRI brain image data

Segmentation of Magnetic Resonance Imaging (MRI) brain image data has a significant impact on the computer guided medical image diagnosis and analysis. However, due to limitation of image acquisition devices and other related factors, MRI images are severely affected by the noise and inhomogeneity artefacts which lead to blurry edges in the intersection of the intra-organ soft tissue regions, making the segmentation process more difficult and challenging. This paper presents a novel two-stage fuzzy multi-objective framework (2sFMoF) for segmenting 3D MRI brain image data. In the first stage, a 3D spatial fuzzy c-means (3DSpFCM) algorithm is introduced by incorporating the 3D spatial neighbourhood information of the volume data to define a new local membership function along with the global membership function for each voxel. In particular, the membership functions actually define the underlying relationship between the voxels of a close cubic neighbourhood and image data in 3D image space. The cluster prototypes thus obtained are fed into a 3D modified fuzzy c-means (3DMFCM) algorithm, which further incorporates local voxel information to generate the final prototypes. The proposed framework addresses the shortcomings of the traditional FCM algorithm, which is highly sensitive to noise and may stuck into a local minima. The method is validated on a synthetic image volume and several simulated and in-vivo 3D MRI brain image volumes and found to be effective even in noisy data. The empirical results show the supremacy of the proposed method over the other FCM based algorithms and other related methods devised in the recent past.