Search NASA⌕ Search

SEARCH · Search NASA

Results for “complex computing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 685 records · Page 38

Using kernel-based statistical distance to study the dynamics of charged particle beams in particle-based simulation codes

Measures of discrepancy between probability distributions (statistical distance) are widely used in the fields of artificial intelligence and machine learning. We describe how certain measures of statistical distance can be implemented as numerical diagnostics for simulations involving charged-particle beams. Related measures of statistical dependence are also described. The resulting diagnostics provide sensitive measures of dynamical processes important for beams in nonlinear or high-intensity systems, which are otherwise difficult to characterize. Here, the focus is on kernel-based methods such as maximum mean discrepancy, which have a well-developed mathematical foundation and reasonable computational complexity. Several benchmark problems and examples involving intense beams are discussed. While the focus is on charged-particle beams, these methods may also be applied to other many-body systems such as plasmas or gravitational systems.

47 OTHER INSTRUMENTATION↗

Unified description of linear screening in dense plasmas

Electron screening of ions is among the most fundamental properties of plasmas, determining the effective ionic interactions that impact all properties of a plasma. With the development of new experimental facilities that probe high-energy-density physics regimes ranging from warm dense matter to hot dense matter, a unified framework for describing dense plasma screening has become essential. Such a unified framework is presented here based on finite-temperature orbital-free density functional theory, including gradient corrections and exchange-correlation effects. We find a new analytic pair potential for the ion-ion interaction that incorporates moderate electronic coupling, quantum degeneracy, gradient corrections to the free energy, and finite temperatures. This potential can be used in large-scale “classical” molecular dynamics simulations, as well as in simpler theoretical models (e.g., integral equations and Monte Carlo), with no additional computational complexity. The new potential theoretically connects limits of Debye-Hückel–Yukawa, Lindhard, Thomas-Fermi, and Bohmian quantum hydrodynamics descriptions. In conclusion, based on this new potential, we predict ionic static structure factors that can be validated using x-ray Thomson scattering data.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Mitigating the Sign Problem through Basis Rotations

Quantum Monte Carlo simulations of quantum many-body systems are plagued by the Fermion sign problem. The computational complexity of simulating Fermions scales exponentially in the projection time β and system size. The sign problem is basis dependent and an improved basis, for fixed errors, leads to exponentially quicker simulations. Herein, we show how to use sign-free quantum Monte Carlo simulations to optimize over the choice of basis on large two-dimensional systems. We numerically illustrate these techniques decreasing the “badness” of the sign problem by optimizing over single-particle basis rotations on one- and two-dimensional Hubbard systems. We find a generic rotation which improves the average sign of the Hubbard model for a wide range of U and densities for L×4 systems. In one example improvement, the average sign (and hence simulation cost at fixed accuracy) for the 16×4 Hubbard model at U/t=4 and n=0.75 increases by exp[8.64(6)β]. For typical projection times of β ≳ 100, this accelerates such simulation by many orders of magnitude.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Autoregressive Neural Network for Simulating Open Quantum Systems via a Probabilistic Formulation

The theory of open quantum systems lays the foundation for a substantial part of modern research in quantum science and engineering. Rooted in the dimensionality of their extended Hilbert spaces, the high computational complexity of simulating open quantum systems calls for the development of strategies to approximate their dynamics. In this Letter, we present an approach for tackling open quantum system dynamics. Using an exact probabilistic formulation of quantum physics based on positive operator-valued measure, we compactly represent quantum states with autoregressive neural networks; such networks bring significant algorithmic flexibility due to efficient exact sampling and tractable density. We further introduce the concept of string states to partially restore the symmetry of the autoregressive neural network and improve the description of local correlations. Efficient algorithms have been developed to simulate the dynamics of the Liouvillian superoperator using a forward-backward trapezoid method and find the steady state via a variational formulation. Our approach is benchmarked on prototypical one-dimensional and two-dimensional systems, finding results which closely track the exact solution and achieve higher accuracy than alternative approaches based on using Markov chain Monte Carlo method to sample restricted Boltzmann machines. Our Letter provides general methods for understanding quantum dynamics in various contexts, as well as techniques for solving high-dimensional probabilistic differential equations in classical setups.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Model orthogonalization and Bayesian forecast mixing via principal component analysis

One can improve predictability in the unknown domain by combining forecasts of imperfect complex computational models using a Bayesian statistical machine learning framework. In many cases, however, the models used in the mixing process are similar. In addition to contaminating the model space, the existence of such similar, or even redundant, models during the multimodeling process can result in misinterpretation of results and deterioration of predictive performance. In this paper we describe a method based on the principal component analysis that eliminates model redundancy. We show that by adding model orthogonalization to the proposed Bayesian model combination framework, one can arrive at better prediction accuracy and reach excellent uncertainty quantification performance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the estimation of statistical uncertainties on powder diffraction and small-angle scattering data from two-dimensional X-ray detectors

Optimal methods are explored for obtaining one-dimensional powder pattern intensities from two-dimensional planar detectors with good estimates of their standard deviations. Methods are described to estimate uncertainties when the same image is measured in multiple frames as well as from a single frame. The importance of considering the correlation of diffraction points during the integration and the resampling process of data analysis is shown. It is found that correlations between adjacent pixels in the image can lead to seriously overestimated uncertainties if such correlations are neglected in the integration process. Off-diagonal entries in the variance–covariance (VC) matrix are problematic as virtually all data processing and modeling programs cannot handle the full VC matrix. It is shown that the off-diagonal terms come mainly from the pixel-splitting algorithm used as the default integration algorithm in many popular two-dimensional integration programs, as well as from rebinning and resampling steps later in the processing. When the full VC matrix can be propagated during the data reduction, it is possible to get accurate refined parameters and their uncertainties at the cost of increasing computational complexity. However, as this is not normally possible, the best approximate methods for data processing in order to estimate uncertainties on refined parameters with the greatest accuracy from just the diagonal variance terms in the VC matrix is explored.

Yang, X.↗

Laminography as a tool for imaging large-size samples with high resolution

Despite the increased brilliance of the new generation synchrotron sources, there is still a challenge with high-resolution scanning of very thick and absorbing samples, such as a whole mouse brain stained with heavy elements, and, extending further, brains of primates. Samples are typically cut into smaller parts, to ensure a sufficient X-ray transmission, and scanned separately. Compared with the standard tomography setup where the sample would be cut into many pillars, the laminographic geometry operates with slab-shaped sections significantly reducing the number of sample parts to be prepared, the cutting damage and data stitching problems. In this work, a laminography pipeline for imaging large samples (>1 cm) at micrometre resolution is presented. The implementation includes a low-cost instrument setup installed at the 2-BM micro-CT beamline of the Advanced Photon Source. Additionally, sample mounting, scanning techniques, data stitching procedures, a fast reconstruction algorithm with low computational complexity, and accelerated reconstruction on multi-GPU systems for processing large-scale datasets are presented. The applicability of the whole laminography pipeline was demonstrated by imaging four sequential slabs throughout an entire mouse brain sample stained with osmium, in total generating approximately 12 TB of raw data for reconstruction.

47 OTHER INSTRUMENTATION↗

Covariance Shaping Over Riemannian Manifolds for Massive MIMO Communication

Acquiring accurate instantaneous channel state information (CSI) is a challenging aspect of massive multi-input multi-output (MIMO) communication. Utilizing statistical information, such as channel covariance matrix, to design statistical beamforming vectors is robust when compared to instantaneous CSI. In this paper, we propose a novel MIMO covariance shaping scheme over Riemannian manifolds. It serves as an effective statistical beamforming solution to a number of close proximity user equipment (UE) that are undergoing substantial channel correlation. Proposed algorithm exploits the Hermitian positive definite nature of covariance matrices lying over Riemannian manifold. We introduce Wasserstein distance function as a Riemannian metric to measure distances between channel covariance matrices. Furthermore, K-means clustering technique is utilized to effectively identify the optimal shape of effective optimal covariance matrices. Our findings suggest that maximizing the geodesic distance between covariance matrices ultimately leads to a corresponding increase in the network throughput, as determined by the beamforming vector used to shape the covariance matrices. Simulation results validate that the proposed solution converges faster than Euclidean-based state-of-the-art, while maintaining the same computational complexity. Finally, the sum rate performance asymptotically achieves full capacity for two-UE case and more than 96% of the upper bound exhaustive search benchmark for multi-UE scenario.

42 ENGINEERING↗

Scalable Prediction of Energy Consumption using Incremental Time Series Clustering

Time series datasets are a canonical form of high velocity Big Data, and often generated by pervasive sensors, such as found in smart infrastructure. Performing predictive analytics on time series data can be computationally complex, and requires approximation techniques. In this paper, we motivate this problem using a real application from the smart grid domain. We propose an incremental clustering technique, along with a novel affinity score for determining cluster similarity, which help reduce the prediction error for cumulative time series within a cluster. We evaluate this technique, along with optimizations, using real datasets from smart meters, totaling ~700,000 data points, and show the efficacy of our techniques in improving the prediction error of time series data within polynomial time.

Simmhan, Yogesh↗

Adaptive Anomaly Detection for Dynamic Clinical Event Sequences

Over the past decade, health information technology (IT) has enabled the amount of digital information stored in electronic health records (EHRs) to expand greatly. However, according to some studies, hazards in health IT can lead to changes in clinical decisions, care processes, and care outcomes, as well as other issues. Thus, the effects of health IT hazards on patient safety have been at the forefront of recent patient safety research. Nonetheless, hazard detection in health IT remains a challenge. In this paper, the authors assume that safety-related issues in health IT would exhibit anomalous characteristics in EHR data. Although all hazards will exhibit some anomalous characteristics, not all anomalies can be regarded as hazards. The authors hypothesize that errors in health IT could lead to interruptions in the sequence of clinical actions. To this end, the problem of detecting anomalous sequences in big EHR data is considered. This paper focuses on dynamic event sequences, which are a series of clinical actions in motion. The authors propose an adaptive anomaly detection approach that uses higher-order network representation to detect anomalous sequences. Furthermore, the authors propose a contiguous subsequence anomaly detection approach that identifies abnormal subsequences in the detected anomalous sequences. The proposed approaches are tested by using synthetic and real-world EHR data. The proposed methods outperform existing state of the art anomaly detection techniques. To reduce the computational complexity associated with the operational implementation of the proposed approaches, the Apache Spark environment was leveraged, and a much shorter run time together with improved performance were achieved, especially for data with more than 60,000 sequences.

Niu, Haoran↗

Pseudonymization at Scale: OLCF’s Summit Usage Data Case Study

The analysis of vast amounts of data and the processing of complex computational jobs have traditionally relied upon high performance computing (HPC) systems, which offer reliable and efficient management of large-scale computational and data resources. Understanding these analyses’ needs is paramount for designing solutions that can lead to better science, and similarly, understanding the characteristics of the user behavior on those systems is important for improving user experiences on HPC systems. A common approach to gathering data about user behavior is to extract workload characteristics from system log data available only to system administrators. Recently at Oak Ridge Leadership Computing Facility (OLCF), however, we unveiled user behavior about the Summit supercomputer by collecting data from a user’s point of view with ordinary Unix commands.In this paper, we discuss the process, challenges, and lessons learned while preparing this dataset for publication and submission to an open data challenge. The original dataset contains personal identifiable information (PII) about the users of OLCF which needed be masked prior to publication, and we determined that anonymization, which scrubs PII completely, destroyed too much of the structure of the data to be interesting for the data challenge. We instead chose to pseudonymize the dataset, which reduced the linkability of the dataset to the users’ identities. Pseudonymization is significantly more computationally expensive than anonymization, and the size of our dataset, which is approximately 175 million lines of raw text, necessitated the development of a parallelized workflow that could be reused on different HPC machines. We demonstrate the scaling behavior of the workflow on two leadership class HPC systems at OLCF, and we show that we were able to bring the overall makespan time from an impractical 20+ hours on a single node down to around 2 hours. As a result of this work, we release the entire pseudonymized dataset and make the workflows and source code publicly available.

Maheshwari, Ketan↗

Fast Vehicle Turning-Movement Counting using Localization-based Tracking

Despite the high utility of traffic volume and turning movement data, such data is still hard to come by for the vast majority of roadways and intersections in nearly ev- ery city. Edge computing devices offer a promising tool for recording turning movement data if lightweight algorithms can be designed to run in real-time with relatively modest computational complexity. To that end, this work presents Vehicle Turning-Movement Counting using Localization- based Tracking (LBT-Count). This method is fast because it never performs detection on a full frame. Instead, only a few portions of the image are cropped and used to de- tect objects within the frame. The method achieves com- petitive performance on the public evaluation server for Track 1 of the AI City Challenge (7th overall on the first 50% of data). Furthermore, we show that LBT-Count is 52% faster than an analogous counting algorithm utilizing a traditional tracking-by-detection framework on available challenge data.

42 ENGINEERING↗

PARVMEC: An Efficient, Scalable Implementation of the Variational Moments Equilibrium Code

The ability to sustain magnetically confined plasma in a state of stable equilibrium is crucial for optimal and cost-effective operations of fusion devices like tokamaks and stellarators. The Variational Moments Equilibrium Code (VMEC) is the de-facto serial application used by fusion scientists to compute magnetohydrodynamics (MHD) equilibria and study the physics of three dimensional plasmas in confined configurations. Modern fusion energy experiments have larger system scales with more interactive experimental workflows, both demanding faster analysis turnaround times on computational workloads that are stressing the capabilities of sequential VMEC. In this paper, we present PARVMEC, an efficient, parallel version of its sequential counterpart, capable of scaling to thousands of processors on distributed memory machines. PARVMEC is a non-linear code, with multiple numerical physics modules, each with its own computational complexity. A detailed speedup analysis supported by scaling results on 1,024 cores of a Cray XC30 supercomputer is presented. Depending on the mode of PARVMEC execution, speedup improvements of one to two orders of magnitude are reported. PARVMEC equips fusion scientists for the first time with a state-of-theart capability for rapid, high fidelity analyses of magnetically confined plasmas at unprecedented scales.

Seal, Sudip K↗

Semantic Framework for Spatial Query Reformulation for Disaster Monitoring Applications

In disasters, since time is of the essence, quick decision making based on actionable insights is desired. In our earlier work, we have demonstrated that the spatial relationships-based queries can play a vital role in the disaster response phase. However, we found that the utilization of spatial relationships rules (i.e. encoded spatial knowledge) via rule reasoning process do not scale well with the increased number of image regions. Most of the available Resource Description Framework (RDF) triplestores do not support rule reasoning due to the computational complexity and undecidable nature of the rule reasoning process. In this paper, we propose an alternative approach for utilizing spatial knowledge encoded in the form of spatial relationship rules. The proposed approach reformulates the spatial query by expanding it with the configuration encoded in the corresponding spatial relationship rule. The preliminary results are promising and show the applicability of the proposed approach during the time critical events such as flood disaster.

Kurte, Kuldeep↗

Model Reduction for Fast Assessment of Grid Impact of High Penetration PV

A key challenge in properly analyzing the impact of solar photovoltaics (PV) during planning, interconnection and operation in the distribution grid is computational complexity. Such studies require the use of Quasi-Steady-Time-Series (QSTS) power flow to capture the complex interaction of PV with voltage regulating equipment and protection devices and a large number of scenario studies are needed to capture location specific constraints and uncertainties. In addition, a typical distribution feeder can have thousands of nodes and there can be thousands of such feeders in a given utility system. To solve this problem, a new and systematic method for distribution network reduction is proposed. The objective is to reduce the size of distribution systems by more than 80% while preserving the accuracy of power flow results. To this end, an extended Ward-equivalent method has been proposed to create an equivalent circuit. Moreover, load and PV aggregation based on the backward sweep method has been developed to further simplify the feeder. The proposed method is tested with a modified IEEE 123-node distribution test system. The simulation results demonstrate the high efficiency and accuracy of the proposed approach for distribution network reduction.

reduced order systems, load flow, load modeling, v↗

Relevance Vector Machine Image Reconstruction Algorithm for Electrical Capacitance Tomography With Explicit Uncertainty Estimates

We present a Relevance Vector Machine (RVM) based algorithm for electrical capacitance tomography (ECT) applications that can concurrently provide image reconstruction results and uncertainty estimates about the reconstruction. To illustrate the RVM operation in ECT, we simulate typical ECT scenarios, making explicit the connection between the reconstructed pixel values and the corresponding uncertainty estimates in each case. We compare the RVM reconstruction performance with that of the Iterative Landweber Method (ILM) and the least absolute shrinkage and selection operator (LASSO) in all the considered scenarios. The results show that, in addition to the key advantage of providing uncertainty measures, RVM can achieve similar reconstruction results with either lower or similar computational complexity.

42 ENGINEERING↗

Online Dynamic Mode Decomposition Based System Identification of Multi-Zone Building HVAC Systems

Many works have recently been conducted to reduce the electricity consumption of smart buildings and allow them to support various grid services. Most of these works require accurate system models for the various appliances in the building including heating, ventilation, and air conditioning (HVAC) units. In this paper, we investigate a recursive data-driven system identification strategy to construct the thermal model for a time-varying building with a multi-zone HVAC unit. The online dynamic mode decomposition (DMD)-based strategy is employed to identify the multi-zone thermal building dynamics, where a simple information update (rank-1) is selected to avoid computational complexity. The DMD-based identification strategy is validated using a real gymnasium building equipped with a 4-zone HVAC unit, and its performance is compared with that of the traditional nuclear-norm subspace identification (N2SID) strategy.

Wu, Tumin [University of Tennessee, Knoxville (UTK↗

Really Embedding Domain-Specific Languages into C++

The following topics are dealt with: program compilers; optimising compilers; parallel processing; software engineering; learning (artificial intelligence); multiprocessing systems; shared memory systems; optimisation; computational complexity; specification languages.

Finkel, Hal J.↗