skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Control charting methods for autocorrelated cyber vulnerability data
Control charting cyber vulnerabilities is challenging because the same vulnerabilities can remain from period to period. Also, hosts (personal computers, servers, printers, etc.) are often scanned infrequently and can be unavailable during scanning. To address these challenges, control charting of the period-to-period demerits per host using a hybridmoving centerline residual-based and adjusted demerit (MCRAD) chart is proposed. The intent is to direct limited administrator resources to unusual cases when automatic patching is insufficient. The proposed chart is shown to offer superior average run length performance compared with three alternative methods from the literature. The methods are illustrated using three datasets.  more » « less
Award ID(s):
1409214
PAR ID:
10058429
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Quality engineering
Volume:
28
Issue:
3
ISSN:
1436-2457
Page Range / eLocation ID:
313-328
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; ; ; (, IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC))
    Channel charting (CC) has been proposed recently to enable logical positioning of user equipments (UEs) in the neighborhood of a multi-antenna base-station solely from channel-state information (CSI). CC relies on dimensionality reduction of high-dimensional CSI features in order to construct a channel chart that captures spatial and radio geometries so that UEs close in space are close in the channel chart. In this paper, we demonstrate that autoencoder (AE)-based CC can be augmented with side information that is obtained during the CSI acquisition process. More specifically, we propose to include pairwise representation constraints into AEs with the goal of improving the quality of the learned channel charts. We show that such representation-constrained AEs recover the global geometry of the learned channel charts, which enables CC to perform approximate positioning without global navigation satellite systems or supervised learning methods that rely on extensive and expensive measurement campaigns. 
    more » « less
  2. ; (, Proc. 2023 International Conference on Computing, Networking and Communications (ICNC))
    We present a new way of producing a channel chart for cellular wireless communications in polar coordinates. We estimate the angle of arrival θ and the distance between the base station and the user equipment ρ using the MUSIC algorithm and inverse of the root sum squares of channel coefficients (ISQ) or linear regression (LR). We compare this method with the channel charting algorithms principal component analysis (PCA), Samson’s method (SM), and autoencoder (AE). We show that ISQ and LR outperform all three in both performance and complexity. The performance of LR and ISQ are close, with ISQ having less complexity. 
    more » « less
  3. (, Proc. 2023 IEEE International Conference on Communications (ICC))
    We present new ways of producing a channel chart employing model-based approaches. We estimate the angle of arrival θ and the distance between the base station and the user equipment ρ by employing our algorithms, inverse of the root sum squares of channel coefficients (ISQ) algorithm, linear regression (LR) algorithm, and the MUSIC/MUSIC (MM) algorithm. We compare these methods with the channel charting algorithms principal component analysis (PCA), Sammon’s method (SM), and autoencoder (AE) from [1]. We show that ISQ, LR, and MM outperform all three in performance. ISQ and LR have similar performance with ISQ having less complexity than LR. The performance of MM is better than ISQ and LR but it is more complex. Finally, we introduce the rotate-and-sum (RS) algorithm which has about the same performance as the MM algorithm but is less complex due to the avoidance of the eigenvector and eigenvalue analysis and a potential register transfer logic (RTL) implementation. 
    more » « less
  4. (, Proc. 2023 IEEE International Conference on Communications (ICC))
    We present new ways of producing a channel chart employing model-based approaches. We estimate the angle of arrival θ and the distance between the base station and the user equipment ρ by employing our algorithms, inverse of the root sum squares of channel coefficients (ISQ) algorithm, linear regression (LR) algorithm, and the MUSIC/MUSIC (MM) algorithm. We compare these methods with the channel charting algorithms principal component analysis (PCA), Sammon’s method (SM), and autoencoder (AE) from [1]. We show that ISQ, LR, and MM outperform all three in performance. ISQ and LR have similar performance with ISQ having less complexity than LR. The performance of MM is better than ISQ and LR but it is more complex. Finally, we introduce the rotate-and-sum (RS) algorithm which has about the same performance as the MM algorithm but is less complex due to the avoidance of the eigenvector and eigenvalue analysis and a potential register transfer logic (RTL) implementation. 
    more » « less
  5. ; ; ; (, Journal of Applied Statistics)
    In many real-world applications of monitoring multivariate spatio-temporal data that are non-stationary over time, one is often interested in detecting hot-spots with spatial sparsity and temporal consistency, instead of detecting system-wise changes as in traditional statistical process control (SPC) literature. In this paper, we propose an efficient method to detect hot-spots through tensor decomposition, and our method has three steps. First, we fit the observed data into a Smooth Sparse Decomposition Tensor (SSD-Tensor) model that serves as a dimension reduction and de-noising technique: it is an additive model decomposing the original data into: smooth but non-stationary global mean, sparse local anomalies, and random noises. Next, we estimate model parameters by the penalized framework that includes Least Absolute Shrinkage and Selection Operator (LASSO) and fused LASSO penalty. An efficient recursive optimization algorithm is developed based on Fast Iterative Shrinkage Thresholding Algorithm (FISTA). Finally, we apply a Cumulative Sum (CUSUM) Control Chart to monitor model residuals after removing global means, which helps to detect when and where hot-spots occur. To demonstrate the usefulness of our proposed SSD-Tensor method, we compare it with several other methods including scan statistics, LASSO-based, PCA-based, T2-based control chart in extensive numerical simulation studies and a real crime rate dataset. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email