This article presents an analysis of the method of construction and results for a classifier intended to identify vehicles using low-frequency acoustic data collected by a distributed sensor network. This data is collected as part of a venture intended to explore data analytics and multisensor fusion techniques for the monitoring of activities at a test bed nuclear facility located at Oak Ridge National Laboratory in Oak Ridge, Tennessee. We describe the associated target signature and design a classifier based on a multilayer perceptron, followed by an analysis of its results. We discuss how overall accuracy is not the only consideration in constructing this classifier, and how for this application, it is actually desirable to operate at a lower level of accuracy in exchange for a reduction in the false alarm rate, as well as how this relates to the actual deployment of the classifier in practical use.

Estimates of the power level of a nuclear reactor based on measurements from an independent monitoring sensor system can help in the compliance verification of its declared operations. We present a three-level fusion method to estimate the power level of a nuclear reactor using features derived from infrared, electromagnetic, and acoustic sensor measurements collected in proximity to the reactor. Based on a simplified analytical model of the secondary coolant system of the reactor, we identify partial regression functions of the power level in terms of the temperature difference between inlet and outlet of coolant pipes, and the activity levels of four fans and four pumps, which are estimated as features from the sensor measurements. The power level estimator employs a combination of aggregate and complementary fusion steps at three levels to incorporate the multi-modal features in a structure that reflects the secondary cooling system and its partial regression functions. Using the measurements from a test campaign at an operational reactor, we show that this estimator achieves 3.47% or lower root mean square error under 5-fold cross validation. More generally, these results illustrate a progressive reduction in estimation error as additional modalities are appropriately incorporated, and that the fuser outperforms single modality features and their sub-combinations.

Cognitive radar framework has recently been proposed in radar signal processing to develope algorithms for target detection, tracking, and waveform design in the presence of nonstationary environmental (clutter) characteristics. In this framework, there are the three main steps: sensing the environmental changes, learning the new environmental statistical characteristics, and adapting the radar algorithms to the new characteristics. Here, we focus on the second step of the framework to identify the new clutter characteristics after a change is detected in the environment. We form a dictionary of various clutter distributions and identify the distribution of the new clutter data through matching pursuit using probabilistic similarity and distance measures under sparsity constraints. Specifically, we use inner-product as a similarity measure, and we apply three different L 1 -norm type probabilistic distance measures. We both numerically and analytically analyze their clutter-distribution identification performances and show that Kulczynski is the best distance measure for distribution identification.

Titan was the flagship supercomputer at the Oak Ridge Leadership Computing Facility (OLCF). It was deployed in late 2012, became the fastest supercomputer in the world and was retired on August 2, 2019. With Titan's mission complete, this paper provides a first-order examination of the usage of its critical resources (CPU, Memory, GPU, and I/O) over a five-year production period (2015-2019). In particular, we show quantitatively that the majority of CPU time was spent on the large-scale jobs, which is consistent with the policy of driving ground-breaking science through leadership computing. We also corroborate the general observation of the low CPU-memory usage with 95% jobs utilizing only 15% or less available memory. Additionally, we correlate the increase of total job submissions and the decrease of GPU-enabled jobs during 2016 with the GPU reliability issue which impacted the large-scale runs. We further show the surprising read/write ratio over the five-year period, which contradicts the general mindset of the large-scale simulation machines being “write-heavy”. This understanding will have potential impact on how we design our next-generation large-scale storage systems. We believe that our analyses and findings are going to be of great interest to the high-performance computing (HPC) community at large.

Radiation source detection is an important problem in homeland security-related applications. Deploying a network of detectors is expected to provide improved detection due to the combined, albeit dispersed, capture area of multiple detectors. Recently, localization-based detection algorithms provided performance gains beyond the simple “aggregated” area as a result of localization being enabled by the networked detectors. We propose the following three localization-based detection approaches: 1) source-attractor radiation detection (SRD); 2) triangulation-based radiation source detection (TriRSD); and 3) the ratio of square distance-based radiation source detection (ROSD-RSD). We use canonical datasets from Domestic Nuclear Detection Office's intelligence radiation sensors systems tests to assess the performance of these methods. Extensive results illustrate that SRD outperforms TriRSD and ROSD-RSD, and other existing detection algorithms based on the sequential probability ratio test and maximum likelihood estimation in terms of both false alarm and detection rates.

Target detection is one fundamental problem in many sensor network-based applications, and is typically tackled in two separate stages for sensor deployment and data fusion. We propose an integrated solution, referred to as SSEM, which combines 2-level clustering-based sensor deployment and Source Strength Estimate Map-based data fusion for the detection of a single static or moving target. SSEM conducts the first level of clustering to determine a sensor deployment scheme and the second level of clustering to divide the deployed sensors into multiple subsets. For each sensor, the source strength is estimated at each grid point of the entire region based on a signal attenuation model, and for each subset of sensors, the target location is estimated using a strength distribution map-based statistical analysis method. A final detection decision is made by thresholding the clustering degree of the target location estimates computed by all subsets of sensors. Compared with traditional grid-based target detection methods, SSEM significantly reduces the computation complexity and improves the detection performance through an integrated optimization strategy. Extensive simulation results show the performance superiority of the proposed solution over several well-known methods for target detection.

File transfers between the decentralized storage sites over dedicated wide-area connections are becoming increasingly important in high-performance computing and big data scenarios. Designing such scientific workflows for large file transfers is extremely challenging as they depend on the file, I/O, host, and local- and wide-area network subsystems, and their interactions. To gain insights into file-transfer rate profiles, we develop polynomial, bagging, and boosting regression models for Lustre and XFS file transfer measurements, which are collected using XDD over a suite of 10 Gbps connections with 0-366 ms round trip times (RTTs). In addition to overall trends and analytics, these regressions also provide file-transfer rate estimates for RTTs and number of parallel flows at which measurements might not have been collected. They show that bagging and boosting techniques provide closer data fits than the polynomial regression. We develop probabilistic bounds on the generalization error of these methods, which combined with the cross-validation error establish that former two are more accurate estimators than the polynomial regression. In addition, we present a method to efficiently determine the number of parallel flows to achieve a peak file-transfer rate using fewer than full sweep measurements; in our measurements, the peak is achieved in 96% of cases with 15-25% of measurements of a full sweep.

Multi-resolution grid computation is a technique used to speed up source localization with a Maximum Likelihood Estimation (MLE) algorithm. In the case where the source is located midway between grid points, the MLE algorithm may choose an incorrect location, causing following iterations of the search to close in on an area that does not contain the source. To address this issue, we propose a modification to multi-resolution MLE that expands the search area by a small percentage between two consecutive MLE iterations. At the cost of slightly more computation, this modification allows consecutive iterations to accurately locate the target over a larger portion of the field than a standard multi-resolution localization. The localization and computation performance of our approach is compared to both standard multi-resolution and single-resolution MLE algorithms. Tests are performed using seven data sets representing different scenarios of a single radiation source located within an indoor field of detectors. Results show that our method (i) significantly improves the localization accuracy in cases that caused initial grid selection errors in traditional MLE algorithms, (ii) does not have a negative impact on the localization accuracy in other cases, and (iii) requires a negligible increase in computation time relative to the increase in localization accuracy.

ide-area data transfers in high-performance computing infrastructures are increasingly being carried over dynamically provisioned dedicated network connections that provide high capacities with no competing traffic. We present extensive TCP throughput measurements and time traces over a suite of physical and emulated 10 Gbps connections with 0-366 ms round-trip times (RTTs). Contrary to the general expectation, they show significant statistical and temporal variations, in addition to the overall dependencies on the congestion control mechanism, buffer size, and the number of parallel streams. We analyze several throughput profiles that have highly desirable concave regions wherein the throughput decreases slowly with RTTs, in stark contrast to the convex profiles predicted by various TCP analytical models. We present a generic throughput model that abstracts the ramp-up and sustainment phases of TCP flows, which provides insights into qualitative trends observed in measurements across TCP variants: (i) slow-start followed by well-sustained throughput leads to concave regions; (ii) large buffers and multiple parallel streams expand the concave regions in addition to improving the throughput; and (iii) stable throughput dynamics, indicated by a smoother Poincare map and smaller Lyapunov exponents, lead to wider concave regions. These measurements and analytical results together enable us to select a TCP variant and its parameters for a given connection to achieve high throughput with statistical guarantees.

Dedicated wide-area network connections are increasingly employed in high-performance computing and big data scenarios. One might expect the performance and dynamics of data transfers over such connections to be easy to analyze due to the lack of competing traffic. However, non-linear transport dynamics and end-system complexities (e.g., multi-core hosts and distributed filesystems) can in fact make analysis surprisingly challenging. We present extensive measurements of memory-tomemory and disk-to-disk file transfers over 10 Gbps physical and emulated connections with 0-366 ms round trip times (RTTs). For memory-to-memory transfers, profiles of both TCP and UDT throughput as a function of RTT show concave and convex regions; large buffer sizes and more parallel flows lead to wider concave regions, which are highly desirable. TCP and UDT both also display complex throughput dynamics, as indicated by their Poincarέmaps and Lyapunov exponents. For diskto-disk transfers, we determine that high throughput can be achieved via a combination of parallel I/O threads, parallel network threads, and direct I/O mode. Our measurements also show that Lustre filesystems can be mounted over long-haul connections using LNet routers, although challenges remain in jointly optimizing file I/O and transport method parameters to achieve peak throughput.

Most existing radar algorithms are developed under the assumption that the environment (clutter) is stationary. However, in practice, the characteristics of the clutter can vary enormously depending on the radar-operational scenarios. If unaccounted for, these nonstationary variabilities may drastically hinder the radar performance. Therefore, to overcome such shortcomings, we develop a data-driven method for target detection in nonstationary environments. In this method, the radar dynamically detects changes in the environment and adapts to these changes by learning the new statistical characteristics of the environment and by intelligibly updating its statistical detection algorithm. Specifically, we employ drift detection algorithms to detect changes in the environment; incremental learning, particularly learning under concept drift algorithms, to learn the new statistical characteristics of the environment from the new radar data that become available in batches over a period of time. The newly learned environment characteristics are then integrated in the detection algorithm. We use Monte Carlo simulations to demonstrate that the developed method provides a significant improvement in the detection performance compared with detection techniques that are not aware of the environmental changes.

We propose a peak-to-average power ratio (PAPR)-constrained Pareto-optimal waveform-design approach for an orthogonal frequency division multiplexing (OFDM) radar signal to detect a target using the space-time adaptive processing (STAP) technique. The use of an OFDM signal does not only increase the frequency diversity of our system but also enable us to adaptively design the OFDM coefficients in order to further improve the system performance. First, we develop a parametric OFDM-STAP measurement model by considering the effects of signal-dependent clutter and colored noise. Then, we observe that the resulting STAP performance can be improved by maximizing the output signal-to-interference-plus-noise ratio (SINR) with respect to the signal parameters. However, in practical scenarios, the computation of output SINR depends on the estimated values of the spatial and temporal frequencies and target-scattering responses. Therefore, we formulate a PAPR-constrained multiobjective-optimization problem to design the OFDM spectral parameters by simultaneously optimizing four objective functions: maximizing the output SINR, minimizing two separate Cramér-Rao bounds (CRBs) on the normalized spatial and temporal frequencies, and minimizing the trace of the CRB matrix on the target-scattering coefficient estimations. We present several numerical examples to demonstrate the achieved performance improvement due to the adaptive waveform design.

We propose an algorithm to directly synthesize in time-domain a constant-envelope transmit waveform that achieves the optimal performance in detecting an extended target in the presence of signal-dependent interference. This approach is in contrast to the traditional indirect methods that synthesize the transmit signal following the computation of the optimal energy spectral density. Additionally, we aim to maintain a good autocorrelation property of the designed signal. Therefore, our waveform design technique solves a bi-objective optimization problem in order to simultaneously improve the detection and autocorrelation performances, which are in general conflicting in nature. We demonstrate this compromising characteristics of the detection and autocorrelation performances with numerical examples. Furthermore, in the absence of the autocorrelation criterion, our designed signal is shown to achieve a near-optimum detection performance.

We propose a method to detect a target in the presence of multipath reflections, employing sequential transmission of multiple frequencies in a slow-time (pulse-to-pulse) approach. First, we develop a parametric measurement model that accounts for the multipath components at multiple frequencies as well as Doppler shifts. Then, we develop a statistical detection test and analytically evaluate its performance characteristics. Based on the performance analysis, we propose an adaptive algorithm to select the best combination from a subset of frequencies that maximizes the detection performance. Our numerical examples show that the sequential approach requires more coherent pulses to match the performance of the simultaneous usage of multiple carriers in OFDM format. We also study the extent of performance degradation due to employing a subset of available frequencies.

We address the problem of detecting a target moving in clutter environment using an orthogonal frequency division multiplexing (OFDM) radar. The broadband OFDM signal provides frequency diversity to improve the performance of the system. First, we develop a parametric model that accounts for the measurements at multiple frequencies including the Doppler shift. Then, we present a statistical detection test and evaluate its performance characteristics. Based on this, we propose an algorithm to adaptively design the parameters for the next transmitting waveform. Numerical examples illustrate our analytical results, demonstrating the achieved performance improvement due to the OFDM signaling method and adaptive waveform design.

We analyze the performance of a sensor system based on the head-related transfer function (HRTF) modeling of human hearing, in finding the direction of a source in 3-D space. Thus, this system has only two sensors with a few nearby reflectors. First, we present a parametric measurement model that incorporates the diffractions associated with the head shape and the multipath reflections related to the external ear (pinna). Then, we compute the asymptotic Cramer-Rao bound on the 3-D direction estimate for a stochastic source signal of unknown parametrized spectrum. We provide a few numerical examples to illustrate our analytical results.