The rapid growth in digital image sharing, driven by advancements in internet and communication technologies, has raised concerns about image integrity, especially in sensitive fields like healthcare. This paper presents a fully blind fragile watermarking technique for authenticating and self-recovering color and grayscale medical images. The approach applies the Discrete Wavelet Transform (DWT) to the cover image, and the resulting subbands are divided into 3×3 blocks. One authentication and four recovery watermarks are then embedded into the least significant bits (LSBs) of each block. During the extraction phase, if tampering is detected, the model accurately localizes the altered areas, and a three-level recovery process, including a new inpainting technique, is used to recover the original image. Results based on two publically available datasets demonstrate that this method delivers high-quality watermarked images, achieves optimal watermark extraction accuracy, and maintains high sensitivity to various attacks. Additionally, it provides precise tamper localization and delivers high-quality recovered images, even with tampering rates as high as 60%.

Cyber-attack detection is crucial for securing Industrial Internet of Things (IIoT) systems. This study introduces advanced deep learning methodologies to identify potential cyber-attacks effectively in IIoT devices. Three novel stacked deep learning architectures, namely the StackMean, StackMax, and StackRF algorithms. These architectures aggregate and enhance the results of individual deep learning models. Specifically, StackMean computes average predicted class probabilities, StackMax selects maximum predicted class probabilities for more aggressive predictions, and StackRF leverages a random forest to aggregate base models. Theoretical analysis suggests that the proposed stacked deep learning model can boost detection accuracy compared to standalone single deep learning models. Moreover, these stacked models offer increased robustness against adversarial attacks by reducing reliance on specific neural network structures. Additionally, the synthetic minority oversampling technique (SMOTE) algorithm is integrated to address class imbalance challenges in the training dataset. Performance validation is conducted using three publicly available datasets. The detection performance is evaluated using five statistical scores. The results consistently indicate the superiority of the proposed stacked deep learning models over existing techniques. The effectiveness of the SMOTE algorithm is demonstrated through its ability to expand decision regions and minimize false negative signals during attack predictions. In addition, a statistical test is employed to compare the accuracy of individual models with the stacked models, demonstrating that the stacked models exhibit improved accuracy. By combining cutting-edge stacked deep learning architectures with strategic data augmentation techniques, this research significantly contributes to the robustness of cyber-attack detection within IIoT systems.

Accurate wind speed (WS) prediction in the Red Sea is essential for enhancing maritime operations, climate analysis, and monitoring ecosystems. Due to the region's complex oceanic and atmospheric patterns, this work introduces new models based on Transformer architectures to improve WS forecasting. Transformers are employed for their strength in handling sequential data and capturing time dependencies. A stacked model called StackedTrans has been developed to boost performance further and integrate multiple Transformer layers. The model's effectiveness is tested with WS data collected from ten locations across the Red Sea and evaluated using five statistical metrics. The results indicate that the StackedTrans model consistently outperforms other methods, such as LSTM, BiLSTM, GRU, BIGRU, and single Transformer models. The StackedTrans architecture performed a notable R2 score of 99.96, demonstrating its high precision in WS prediction

Addressing the statistical challenge of computing the multivariate normal (MVN) probability in high dimensions holds significant potential for enhancing various applications. For example, the critical task of detecting confidence regions where a process probability surpasses a specific threshold is essential in diverse applications, such as pinpointing tumor locations in magnetic resonance imaging (MRI) scan images, determining hydraulic parameters in groundwater flow issues, and forecasting regional wind power to optimize wind turbine placement, among numerous others. One common way to compute high-dimensional MVN probabilities is the Separation-of-Variables (SOV) algorithm. This algorithm is known for its high computational complexity of O(n3) and space complexity of O(n2), mainly due to a Cholesky factorization operation for an n×n covariance matrix, where n represents the dimensionality of the MVN problem. This work proposes a high-performance computing framework that allows scaling the SOV algorithm and, subsequently, the confidence region detection algorithm. The framework leverages parallel linear algebra algorithms with a task-based programming model to achieve performance scalability in computing process probabilities, especially on large-scale systems. In addition, we enhance our implementation by incorporating Tile Low-Rank (TLR) approximation techniques to reduce algorithmic complexity without compromising the necessary accuracy. To evaluate the performance and accuracy of our framework, we conduct assessments using simulated data and a wind speed dataset. Our proposed implementation effectively handles high-dimensional multivariate normal (MVN) probability computations on shared and distributed-memory systems using finite precision arithmetics and TLR approximation computation. Performance results show a significant speedup of up to 20X in solving the MVN problem using TLR approximation compared to the reference dense solution without sacrificing the application’s accuracy. The qualitative results on synthetic and real datasets demonstrate how we maintain high accuracy in detecting confidence regions even when relying on TLR approximation to perform the underlying linear algebra operations.

We present the design and scalable implementation of an exascale climate emulator for addressing the escalating computational and storage requirements of high-resolution Earth System Model simulations. We utilize the spherical harmonic transform to stochastically model spatio-temporal variations in climate data. This provides tunable spatio-temporal resolution and significantly improves the fidelity and granularity of climate emulation, achieving an ultra-high spatial resolution of $0.034^{\circ}(\sim 3.5 \mathbf{~ k m})$ in space. Our emulator, trained on 318 billion hourly temperature data points from a 35 -year and 31 billion daily data points from an 83-year global simulation ensemble, generates statistically consistent climate emulations. We extend linear solver software to mixed-precision arithmetic GPUs, applying different precisions within a single solver to adapt to different correlation strengths. The PaRSEC runtime system supports efficient parallel matrix operations by optimizing the dynamic balance between computation, communication, and memory requirements. Our BLAS3-rich code is optimized for systems equipped with four different families and generations of GPUs, scaling well to achieve 0.976 EFlop/s on 9, 025 nodes (36,100 AMD MI250X multichip module (MCM) GPUs) of Frontier (nearly full system), 0.739 EFlop/s on 1,936 nodes (7,744 Grace-Hopper Superchips (GH200)) of Alps, 0.243 EFlop/s on 1,024 nodes (4,096 A100 GPUs) of Leonardo, and 0.375 EFlop/s on 3,072 nodes (18,432 V100 GPUs) of Summit.

HPC-based applications often have complex workflows with many software dependencies that hinder their portability on contemporary HPC architectures. In addition, these applications often require extraordinary efforts to deploy and execute at performance potential on new HPC systems, while the users expert in these applications generally have less expertise in HPC and related technologies. This paper provides a dynamic solution that facilitates containerization for transferring HPC software onto diverse parallel systems . The study relies on the HPC Workflow as a Service (HPCWaaS) paradigm proposed by the EuroHPC eFlows4HPC project. It offers to deploy workflows through containers tailored for any of a number of specific HPC systems. Traditional container image creation tools rely on OS system packages compiled for generic architecture families (x86_64, amd64, ppc64, …) and specific MPI or GPU runtime library versions. The containerization solution proposed in this paper leverages HPC Builders such as Spack or Easybuild and multi-platform builders such as buildx to create a service for automating the creation of container images for the software specific to each hardware architecture, aiming to sustain the overall performance of the software. We assess the efficiency of our proposed solution for porting the geostatistics ExaGeoStat software on various parallel systems while preserving the computational performance. The results show that the performance of the generated images is comparable with the native execution of the software on the same architectures. On the distributed-memory system, the containerized version can scale up to 256 nodes without impacting performance.

Maximum likelihood estimation is an essential tool in the procedure to impute missing data in climate/weather applications. By defining a particular statistical model, the maximum likelihood estimation can be used to understand the underlying structure of given geospatial data. The Gaussian random field has been widely used to describe geospatial data, as one of the most popular models under the hood of maximum likelihood estimation. Computation of Gaussian log-likelihood demands operations on a dense symmetric positive definite matrix, often parameterized by the Matérn correlation function. This computation of the log-likelihood requires$\mathcal{O}(n^{2})$storage and$\mathcal{O}(n^{3})$operations, which can be a huge task considering that the number of geographical locations,$n$, now commonly reaches into the millions. However, despite its appealing theoretical properties, the assumptions of Gaussianity may be unrealistic since real data often show signs of skewness or have some extreme values. Herein, we consider the Tukey${g-}$and$-h$(TGH) random field as an example of a non-Gaussian random field that shows more robustness in modeling geospatial data by including two more parameters to incorporate skewness and heavy tail features in the model. This work provides the first HPC implementation of the TGH random field's inference on parallel hardware architectures. Using task-based programming models associated with dynamic runtime systems, our implementation leverages the high concurrency of current parallel systems. This permits to run the exact log-likelihood evaluation of the Tukey g-and-h (TGH) random fields for a decent number of geospatial locations. To tackle large-scale problems, we provide additionally an implementation of the given model using two different low-rank approximations. We compress the aforementioned positive-definite symmetric matrix for computing the log-likelihood and rely on the Tile Low-Rank (TLR) and the Hierarchical Off-Diagonal Low-Rank (HODLR) matrix approximations. We assess the performance and accuracy of the proposed implementations using synthetic datasets up to$800K$and a$300K$precipitation data of Germany to demonstrate the advantage of using non-Gaussian over Gaussian random fields. Moreover, by relying on TLR/HODLR matrix computations, we can now solve for larger matrix sizes while preserving the required accuracy for prediction. We show the performance superiority of TLR over HODLR matrix computations when calculating the TGH likelihoods and predictions. Our TLR-based approximation shows a speedup up to$7.29X$and$2.96X$on shared-memory and distributed-memory systems, respectively, compared to the exact implementation.

We extend the capability of space-time geostatistical modeling using algebraic approximations, illustrating application-expected accuracy worthy of double precision from majority low-precision computations and low-rank matrix approximations. We exploit the mathematical structure of the dense covariance matrix whose inverse action and determinant are repeatedly required in Gaussian log-likelihood optimization. Geostatistics augments first-principles modeling approaches for the prediction of environmental phenomena given the availability of measurements at a large number of locations; however, traditional Cholesky-based approaches grow cubically in complexity, gating practical extension to continental and global datasets now available. We combine the linear algebraic contributions of mixed-precision and low-rank computations within a tile based Cholesky solver with on-demand casting of precisions and dynamic runtime support from PaRSEC to orchestrate tasks and data movement. Our adaptive approach scales on various systems and leverages the Fujitsu A64FX nodes of Fugaku to achieve up to 12X performance speedup against the highly optimized dense Cholesky implementation.

Summary Dust, or particulate matter (PM2.5), is among the most harmful pollutants negatively affecting human health. Predicting indoor PM2.5 concentrations is essential to achieve acceptable indoor air quality. This study aims to investigate data‐driven models to accurately predict PM 2.5 pollution. Notably, a comparative study has been conducted between twenty‐one machine learning and deep learning models to predict PM2.5 levels. Specifically, we investigate the performance of machine learning and deep learning models to predict ambient PM2.5 concentrations based on other ambient pollutants, including SO, NO, O, CO, and PM10. Here, we applied Bayesian optimization to optimally tune hyperparameters of the Gaussian process regression with different kernels and ensemble learning models (i.e., boosted trees and bagged trees) and investigated their prediction performance. Furthermore, to further enhance the forecasting performance of the investigated models, dynamic information has been incorporated by introducing lagged measurements in the construction of the considered models. Results show a significant improvement in the prediction performance when considering dynamic information from past data. Moreover, three methods, namely, random forest (RF), decision tree, and extreme gradient boosting, are applied to assess variables contribution and revealed that lagged PM2.5 data contribute significantly to the prediction performance and enables the construction of parsimonious models. Hourly concentration levels of ambient air pollution from the air quality monitoring network located in Seoul are employed to verify the prediction effectiveness of the studied models. Six measurements of effectiveness are used for assessing the prediction quality. Results showed that deep learning models are more efficient than the other investigated machine learning models (i.e., SVR, GPR, bagged and boosted trees, RF, and XGBoost). Also, the results showed that the bidirectional long short term memory (BiLSTM) and bidirectional gated recurrent units (BiGRU) networks produce higher performance than the investigated machine learning models (i.e., SVR, GPR, bagged and boosted trees, RF, and XGBoost) and deep learning models (i.e., LSTM, GRU, and convolutional neural network).

Summary Precisely detecting land cover changes aids in improving the analysis of the dynamics of the landscape and plays an essential role in mitigating the effects of desertification. Mainly, sensing desertification is challenging due to the high correlation between desertification and like‐desertification events (e.g., deforestation). An efficient and flexible deep learning approach is introduced to address desertification detection through Landsat imagery. Essentially, a generative adversarial network (GAN)‐based desertification detector is designed and for uncovering the pixels influenced by land cover changes. In this study, the adopted features have been derived from multi‐temporal images and incorporate multispectral information without considering image segmentation preprocessing. Furthermore, to address desertification detection challenges, the GAN‐based detector is constructed based on desertification‐free features and then employed to identify atypical events associated with desertification changes. The GAN‐detection algorithm flexibly learns relevant information from linear and nonlinear processes without prior assumption on data distribution and significantly enhances the detection's accuracy. The GAN‐based desertification detector's performance has been assessed via multi‐temporal Landsat optical images from the arid area nearby Biskra in Algeria. This region is selected in this work because desertification phenomena heavily impact it. Compared to some state‐of‐the‐art methods, including deep Boltzmann machine (DBM), deep belief network (DBN), convolutional neural network (CNN), as well as two ensemble models, namely, random forests and AdaBoost, the proposed GAN‐based detector offers superior discrimination performance of deserted regions. Results show the promising potential of the proposed GAN‐based method for the analysis and detection of desertification changes. Results also revealed that the GAN‐driven desertification detection approach outperforms the state‐of‐the‐art methods.

Geostatistical modeling, one of the prime motivating applications for exascale computing, is a technique for predicting desired quantities from geographically distributed data, based on statistical models and optimization of parameters. Spatial data are assumed to possess properties of stationarity or non-stationarity via a kernel fitted to a covariance matrix. A primary workhorse of stationary spatial statistics is Gaussian maximum log-likelihood estimation (MLE), whose central data structure is a dense, symmetric positive definite covariance matrix of the dimension of the number of correlated observations. Two essential operations in MLE are the application of the inverse and evaluation of the determinant of the covariance matrix. These can be rendered through the Cholesky decomposition and triangular solution. In this contribution, we reduce the precision of weakly correlated locations to single- or half- precision based on distance. We thus exploit mathematical structure to migrate MLE to a three-precision approximation that takes advantage of contemporary architectures offering BLAS3-like operations in a single instruction that are extremely fast for reduced precision. We illustrate application-expected accuracy worthy of double-precision from a majority half-precision computation, in a context where uniform single-precision is by itself insufficient. In tackling the complexity and imbalance caused by the mixing of three precisions, we deploy thePaRSECruntime system.PaRSECdelivers on-demand casting of precisions while orchestrating tasks and data movement in a multi-GPU distributed-memory environment within a tile-based Cholesky factorization. Application-expected accuracy is maintained while achieving up to$1.59X$by mixing FP64/FP32 operations on 1536 nodes ofHAWKor 4096 nodes ofShaheen II, and up to$2.64X$by mixing FP64/FP32/FP16 operations on 128 nodes ofSummit, relative to FP64-only operations. This translates into up to 4.5, 4.7, and 9.1 (mixed) PFlop/s sustained performance, respectively, demonstrating a synergistic combination of exascale architecture, dynamic runtime software, and algorithmic adaptation applied to challenging environmental problems.

Accurately forecasting solar irradiance is indispensable in optimally managing and designing photovoltaic systems. It enables the efficient integration of photovoltaic systems in the smart grid. This paper introduces an innovative deep attention-driven model for solar irradiance forecasting. Notably, an extended version of the variational autoencoder (VAE) is introduced by amalgamating the desirable characteristics of the bidirectional LSTM (BiLSTM) and attention mechanism with the VAE model. Specifically, the introduced approach enables the conventional VAE’s ability to model temporal dependencies by incorporating BiLSTM at the VAE’s encoder side to better extract and learn temporal dependencies embed on the solar irradiance concentration measurements. In addition, the self-attention mechanism is embedded in the VAE’s encoder side following the BiLSTM to highlight pertinent features. The performance of the proposed model is evaluated through comparisons with the recurrent neural network (RNN), gated recurrent unit (GRU), LSTM, and BiLSTM. Measurements of solar irradiance in the US and Turkey are used to evaluate the investigated models. Results confirm the superior performance of the proposed model for solar irradiance forecasting over the other models (i.e., RNN, GRU, LSTM, and BiLSTM).

The demand for solar energy has rapidly increased throughout the world in recent years. However, anomalies in photovoltaic (PV) plants can reduce performances and result in serious consequences. Developing reliable statistical approaches able to detect anomalies in PV plants is vital to improving the management of these plants. Here, we present a statistical approach for detecting anomalies in the DC part of PV plants and partial shading. Firstly, we model the monitored PV plant. Then, we employ a generalized likelihood ratio test, which is a powerful anomaly detection tool, to check the residuals from the model and reveal anomalies in the supervised PV array. The proposed strategy is illustrated via actual measurements from a 9.54 PV plant.

Modeling and inferring spatial relationships and predicting missing values of environmental data are some of the main tasks of geospatial statisticians. These routine tasks are accomplished using multivariate geospatial models and the cokriging technique. The latter requires the evaluation of the expensive Gaussian log-likelihood function, which has impeded the adoption of multivariate geospatial models for large multivariate spatial datasets. However, this large-scale cokriging challenge provides a fertile ground for supercomputing implementations for the geospatial statistics community as it is paramount to scale computational capability to match the growth in environmental data coming from the widespread use of different data collection technologies. In this article, we develop and deploy large-scale multivariate spatial modeling and inference on parallel hardware architectures. To tackle the increasing complexity in matrix operations and the massive concurrency in parallel systems, we leverage low-rank matrix approximation techniques with task-based programming models and schedule the asynchronous computational tasks using a dynamic runtime system. The proposed framework provides both the dense and the approximated computations of the Gaussian log-likelihood function. It demonstrates accuracy robustness and performance scalability on a variety of computer systems. Using both synthetic and real datasets, the low-rank matrix approximation shows better performance compared to exact computation, while preserving the application requirements in both parameter estimation and prediction accuracy. We also propose a novel algorithm to assess the prediction accuracy after the online parameter estimation. The algorithm quantifies prediction performance and provides a benchmark for measuring the efficiency and accuracy of several approximation techniques in multivariate spatial modeling.

Geostatistics represents one of the most challenging classes of scientific applications due to the desire to incorporate an ever increasing number of geospatial locations to accurately model and predict environmental phenomena. For example, the evaluation of the Gaussian log-likelihood function, which constitutes the main computational phase, involves solving systems of linear equations with a large dense symmetric and positive definite covariance matrix. Cholesky, the standard algorithm, requires O(n^3) floating point operators and has an O(n^2) memory footprint, where n is the number of geographical locations. Here, we present a mixed-precision tile algorithm to accelerate the Cholesky factorization during the log-likelihood function evaluation. Under an appropriate ordering, it operates with double-precision arithmetic on tiles around the diagonal, while reducing to single-precision arithmetic for tiles sufficiently far off. This translates into an improvement of the performance without any deterioration of the numerical accuracy of the application. We rely on the StarPU dynamic runtime system to schedule the tasks and to overlap them with data movement. To assess the performance and the accuracy of the proposed mixed-precision algorithm, we use synthetic and real datasets on various shared and distributed-memory systems possibly equipped with hardware accelerators. We compare our mixed-precision Cholesky factorization against the double-precision reference implementation as well as an independent block approximation method. We obtain an average of 1.6X performance speedup on massively parallel architectures while maintaining the accuracy necessary for modeling and prediction.

Maximum likelihood estimation is an important statistical technique for estimating missing data, for example in climate and environmental applications, which are usually large and feature data points that are irregularly spaced. In particular, the Gaussian log-likelihood function is the de facto model, which operates on the resulting sizable dense covariance matrix. The advent of high performance systems with advanced computing power and memory capacity have enabled full simulations only for rather small dimensional climate problems, solved at the machine precision accuracy. The challenge for high dimensional problems lies in the computation requirements of the log-likelihood function, which necessitates O(n2) storage and O(n3) operations, where n represents the number of given spatial locations. This prohibitive computational cost may be reduced by using approximation techniques that not only enable large-scale simulations otherwise intractable, but also maintain the accuracy and the fidelity of the spatial statistics model. In this paper, we extend the Exascale GeoStatistics software framework (i.e., ExaGeoStat1) to support the Tile Low-Rank (TLR) approximation technique, which exploits the data sparsity of the dense covariance matrix by compressing the off-diagonal tiles up to a user-defined accuracy threshold. The underlying linear algebra operations may then be carried out on this data compression format, which may ultimately reduce the arithmetic complexity of the maximum likelihood estimation and the corresponding memory footprint. Performance results of TLR-based computations on shared and distributed-memory systems attain up to 13X and 5X speedups, respectively, compared to full accuracy simulations using synthetic and real datasets (up to 2M), while ensuring adequate prediction accuracy.

Accurate detection of changes in land cover leads to better understanding of the dynamics of landscapes. This letter reports the development of a reliable approach to detecting changes in land cover based on remote sensing and radiometric data. This approach integrates the multivariate exponentially weighted moving average (MEWMA) chart with support vector machines (SVMs) for accurate and reliable detection of changes to land cover. Here, we utilize the MEWMA scheme to identify features corresponding to changed regions. Unfortunately, MEWMA schemes cannot discriminate between real changes and false changes. If a change is detected by the MEWMA algorithm, then we execute the SVM algorithm that is based on features corresponding to detected pixels to identify the type of change. We assess the effectiveness of this approach by using the remote-sensing change detection database and the SZTAKI AirChange benchmark data set. Our results show the capacity of our approach to detect changes to land cover.

We presentExaGeoStat, a high performance software for geospatial statistics in climate and environment modeling. In contrast to simulation based on partial differential equations derived from first-principles modeling,ExaGeoStatemploys a statistical model based on the evaluation of the Gaussian log-likelihood function, which operates on a large dense covariance matrix. Generated by the parametrizable Matérn covariance function, the resulting matrix is symmetric and positive definite. The computational tasks involved during the evaluation of the Gaussian log-likelihood function become daunting as the number$n$of geographical locations grows, as${\mathcal O}(n^2)$storage and${\mathcal O}(n^3)$operations are required. While many approximation methods have been devised from the side of statistical modeling to ameliorate these polynomial complexities, we are interested here in the complementary approach of evaluating the exact algebraic result by exploiting advances in solution algorithms and many-core computer architectures. Using state-of-the-art high performance dense linear algebra libraries associated with various leading edge parallel architectures (Intel KNLs, NVIDIA GPUs, and distributed-memory systems),ExaGeoStatraises the game for statistical applications from climate and environmental science.ExaGeoStatprovides a reference evaluation of statistical parameters, with which to assess the validity of the various approaches based on approximation. The software takes a first step in the merger of large-scale data analytics and extreme computing for geospatial statistical applications, to be followed by additional complexity reducing improvements from the solver side that can be implemented under the same interface. Thus, a single uncompromised statistical model can ultimately be executed in a wide variety of emerging exascale environments.

This paper presents a computer vision-based methodology for human action recognition. First, the shape based pose features are constructed based on area ratios to identify the human silhouette in images. The proposed features are invariance to translation and scaling. Once the human body features are extracted from videos, different human actions are learned individually on the training frames of each class. Then, we apply the Adaboost algorithm for the classification process. We assessed the proposed approach using the UR Fall Detection dataset. In this study six classes of activities are considered namely: walking, standing, bending, lying, squatting, and sitting. Results demonstrate the efficiency of the proposed methodology.

Fault detection is important for safe operation of various modern engineering systems. Partial least square (PLS) has been widely used in monitoring highly correlated process variables. Conventional PLS-based methods, nevertheless, often fail to detect incipient faults. In this paper, we develop new PLS-based monitoring chart, combining PLS with multivariate memory control chart, the multivariate exponentially weighted moving average (MEWMA) monitoring chart. The MEWMA are sensitive to incipient faults in the process mean, which significantly improves the performance of PLS methods and widen their applicability in practice. Using simulated distillation column data, we demonstrate that the proposed PLS-based MEWMA control chart is more effective in detecting incipient fault in the mean of the multivariate process variables, and outperform the conventional PLS-based monitoring charts.

The paper concerns the detection of fall events based on human silhouette shape variations. The detection of fall events is addressed from the statistical point of view as an anomaly detection problem. Specifically, the paper investigates the multivariate exponentially weighted moving average (MEWMA) control chart to detect fall events. Towards this end, a set of ratios for five partial occupancy areas of the human body for each frame are collected and used as the input data to MEWMA chart. The MEWMA fall detection scheme has been successfully applied to two publicly available fall detection databases, the UR fall detection dataset (URFD) and the fall detection dataset (FDD). The monitoring strategy developed was able to provide early alert mechanisms in the event of fall situations.

Fault detection is essential for safe operation of various engineering systems. Principal component analysis (PCA) has been widely used in monitoring highly correlated process variables. Conventional PCA-based methods, nevertheless, often fail to detect small or incipient faults. In this paper, we develop new PCA-based monitoring charts, combining PCA with multivariate memory control charts, such as the multivariate cumulative sum (MCUSUM) and multivariate exponentially weighted moving average (MEWMA) monitoring schemes. The multivariate control charts with memory are sensitive to small and moderate faults in the process mean, which significantly improves the performance of PCA methods and widen their applicability in practice. Using simulated data, we demonstrate that the proposed PCA-based MEWMA and MCUSUM control charts are more effective in detecting small shifts in the mean of the multivariate process variables, and outperform the conventional PCA-based monitoring charts.

This paper presents a statistical technique for detecting signs of abnormal situation generated by the influx of patients at emergency department (ED). The monitoring strategy developed was able to provide early alert mechanisms in the event of abnormal situations caused by abnormal patient arrivals to the ED. More specifically, This work proposed the application of autoregressive moving average (ARMA) models combined with the generalized likelihood ratio (GLR) test for anomaly-detection. ARMA was used as the modelling framework of the ARMA-based GLR anomaly-detection methodology. The GLR test was applied to the uncorrelated residuals obtained from the ARMA model to detect anomalies when the data did not fit the reference ARMA model. The ARMA-based GLR hypothesis testing scheme was successfully applied to the practical data collected from the database of the pediatric emergency department (PED) at Lille regional hospital center, France.