Search NASA⌕ Search

SEARCH · Search NASA

Results for “High Performance Networking”

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 1,405 records · Page 78

Geometric consideration of nanostructures for energy storage systems

Battery performance and its fade are determined by various aspects such as the transport of ions and electrons through heterogeneous internal structures; kinetic reactions at the interfaces; and the corresponding interplay between mechanical, chemical, and thermal responses. The fundamental factor determining this complex multiscale and multiphysical nature of a battery is the geometry of active materials. In this work, we systematically consider the tradeoffs among a selection of limiting geometries of media designed to store ions or other species via a diffusion process. Specifically, we begin the investigation by considering diffusion in spheres, rods, and plates at the particle level, in order to assess the effects of geometry, diffusivity, and rate on capacity. Then, the study is extended to considering of the volume fraction and particle network, as well as kinetics at the interface with electrolyte. Our study suggests that, in terms of overall bulk level material performance, thin film batteries may generate the highest energy density with high power capability when they are implemented at nanoscales or with highly diffusion materials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accelerating rejection-based simulation of biochemical reactions with bounded acceptance probability

Stochastic simulation of large biochemical reaction networks is often computationally expensive due to the disparate reaction rates and high variability of population of chemical species. An approach to accelerate the simulation is to allow multiple reaction firings before performing update by assuming that reaction propensities are changing of a negligible amount during a time interval. Species with small population in the firings of fast reactions significantly affect both performance and accuracy of this simulation approach. It is even worse when these small population species are involved in a large number of reactions. We present in this paper a new approximate algorithm to cope with this problem. It is based on bounding the acceptance probability of a reaction selected by the exact rejection-based simulation algorithm, which employs propensity bounds of reactions and the rejection-based mechanism to select next reaction firings. The reaction is ensured to be selected to fire with an acceptance rate greater than a predefined probability in which the selection becomes exact if the probability is set to one. Our new algorithm improves the computational cost for selecting the next reaction firing and reduces the updating the propensities of reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

On Analytics of File Transfer Rates over Dedicated Wide-Area Connections

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.

Sen, Satyabrata↗

Evaluating online-learning in memristive neuromorphic circuits

In this work we present an implementation of spike-timing-dependent plasticity (STDP) in both a high level simulation and at a circuit level. It is verified that the high level simulation captures the behavior of the circuit implementation. We use the simulation to assess the effectiveness of STDP for online-learning, and find that STDP enables networks to improve performance online after training.

Wyer, Austin↗

Delta: Data Reduction for Integrated Application Workflows

Integrated Application Workflows (IAWs) run multiple simulation workflow components concurrently on an HPC resource connecting these components using compute area resources and compensating for any performance or data processing rate mismatches. These IAWs require high frequency and high volume data transfers between compute nodes and staging area nodes during the lifetime of a large parallel computation. The available network band-width between the two areas may not be enough to efficiently support the data movement. As the processing power available to compute resources increases, the requirements for this data transfer will become more difficult to satisfy and perhaps will not be satisfiable at all since network capabilities are not expanding at a comparable rate. Furthermore, energy consumption in HPC environments is expected to grow by an order of magnitude as exascale systems become a reality. The energy cost of moving large amounts of data frequently will contribute to this issue. It is necessary to reduce the volume of data without reducing the quality of data when it is being processed and analyzed. Delta resolves the issue by addressing the lifetime data transfer operations. Delta removes subsequent identical copies of already transmitted data during transfers and restores those copies once the data has reached the destination. Delta is able to identify duplicated information and determine the most space efficient way to represent it. Initial tests show about 50% reduction in data movement while maintaining the same data quality and transmission frequency.

97 MATHEMATICS AND COMPUTING↗

A Business Case for Advanced Outage Management

The Department of Energy’s (DOE) Light Water Reactor Sustainability (LWRS) Program develops and validates technologies that will make the U.S. operating nuclear fleet more efficient and competitive. The program has developed a standard methodology for determining the impact of new technologies in order to assist nuclear power plant (NPP) operators in building sound business cases. This paper presents a generic business case for implementation of technology that supports Advanced Outage Management (AOM). The analysis presented demonstrates that advanced communication and networking and analytical technologies will allow NPP to conduct outages with fewer people in management roles and the remaining people can be more effective and more productive. The benefits are quantified with a rough order of magnitude that provides directional guidance to NPPs that are interested in developing a similar business case. Advanced Outage Management is enabled by a suite of technologies, which are described in further detail in the body of this report. They include: • Mobile Work Packages (MWP) • Computer Based Procedures (CBP) • Personal Digital Assistants (PDA) also referred to as smart devices • Barcode readers • High bandwidth wireless networks • Collaboration software (i.e., OneNote) • Advanced digital displays • Advanced data analytics All the hardware necessary to implement AOM as envisioned in this report is readily available today. Configuration to perform within the plant systems and regulatory boundaries would need to be developed by the NPP. 1. The resulting business case demonstrates benefits in two major categories: 2. Reduction in resources required to manage the outage, a. Increased productivity in outage work that reduces the likelihood of schedule overruns: b. reduce likelihood of bulk work resulting in outage delays c. improved management of critical path single issues, d. improved management of emergent work (improve time to collect data and prepare response) It is important to note that in order to realize these benefits at the scale described in this report requires the plant to rethink how technologies can disrupt current processes; how data might be captured, processed, analyzed and presented with little or no human intervention. In many cases, technology be fully utilized in a way that not only aides productivity, but is utilized towards “work destruction” – elimination of work that is currently performed through a human interface.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Deep Learning Predicts Stress–Strain Relations of Granular Materials Based on Triaxial Testing Data

This study presents an AI-based constitutive modelling framework wherein the prediction model directly learns from triaxial testing data by combining discrete element modelling (DEM) and deep learning. A constitutive learning strategy is proposed based on the generally accepted frame-indifference assumption in constructing material constitutive models. The low-dimensional principal stress-strain sequence pairs, measured from discrete element modelling of triaxial testing, are used to train recurrent neural networks, and then the predicted principal stress sequence is augmented to other high-dimensional or general stress tensor via coordinate transformation. Through detailed hyperparameter investigations, it is found that long short-term memory (LSTM) and gated recurrent unit (GRU) networks have similar prediction performance in constitutive modelling problems, and both satisfactorily predict the stress responses of granular materials subjected to a given unseen strain path. Furthermore, the unique merits and ongoing challenges of data-driven constitutive models for granular materials are discussed.

42 ENGINEERING↗

Modeling the contributions of global air temperature, synoptic-scale phenomena and soil moisture to near-surface static energy variability using artificial neural networks

Abstract. The static energy content of the atmosphere is increasing on a global scale, but exhibits important subglobal and subregional scales of variability and is a useful parameter for integrating the net effect of changes in the partitioning of energy at the surface and for improving understanding of the causes of so-called warming holes (i.e., locations with decreasing daily maximum air temperatures ( T ) or increasing trends of lower magnitude than the global mean). Further, measures of the static energy content (herein the equivalent potential temperature, θ e ) are more strongly linked to excess human mortality and morbidity than air temperature alone, and have great relevance in understanding causes of past heat-related excess mortality and making projections of possible future events that are likely to be associated with negative human health and economic consequences. New nonlinear statistical models for summertime daily maximum and minimum θ e are developed and used to advance understanding of drivers of historical change and variability over the eastern USA. The predictor variables are an index of the daily global mean temperature, daily indices of the synoptic-scale meteorology derived from T and specific humidity ( Q ) at 850 and 500 hPa geopotential heights ( Z ), and spatiotemporally averaged soil moisture ( SM ). SM is particularly important in determining the magnitude of θ e over regions that have previously been identified as exhibiting warming holes, confirming the key importance of SM in dictating the partitioning of net radiation into sensible and latent heat and dictating trends in near-surface T and θ e . Consistent with our a priori expectations, models built using artificial neural networks (ANNs) out-perform linear models that do not permit interaction of the predictor variables (global T , synoptic-scale meteorological conditions and SM ). This is particularly marked in regions with high variability in minimum and maximum θ e , where more complex models built using ANN with multiple hidden layers are better able to capture the day-to-day variability in θ e and the occurrence of extreme maximum θ e . Over the entire domain, the ANN with three hidden layers exhibits high accuracy in predicting maximum θ e > 347 K. The median hit rate for maximum θ e >347 K is > 0.60, while the median false alarm rate is ≈ 0.08.

54 ENVIRONMENTAL SCIENCES↗

Proceedings of the 13th Space Photovoltaic Research and Technology Conference (SPRAT 13)

The Thirteenth Space Photovoltaic Research and Technology (SPRAT) Conference included 38 technical papers, 6 program reviews and 5 workshop discussions. The effects of shrinking research and development budgets were evident in the focus and tone of this SPRAT. Most attendees appeared to be oriented toward near term, system oriented projects and fewer were involved in long term, high risk research. It was generally agreed that space power requirements would continue to move toward smaller (less than 2kW) power levels. Most future applications are believed to be in traditional orbits (LEO, GEO) although interesting opportunities may be found in high radiation, mid-altitude orbits useful for global communication networks. New solar cell devices and materials will be difficult to introduce unless they are mission enabling, or offer significant cost and/or performance benefits. Many factors influence the selection of type of array.

Source record↗

Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks

Portfolio methods support the combination of different algorithms and heuristics, including stochastic local search (SLS) heuristics, and have been identified as a promising approach to solve computationally hard problems. While successful in experiments, theoretical foundations and analytical results for portfolio-based SLS heuristics are less developed. This article aims to improve the understanding of the role of portfolios of heuristics in SLS. We emphasize the problem of computing most probable explanations (MPEs) in Bayesian networks (BNs). Algorithmically, we discuss a portfolio-based SLS algorithm for MPE computation, Stochastic Greedy Search (SGS). SGS supports the integration of different initialization operators (or initialization heuristics) and different search operators (greedy and noisy heuristics), thereby enabling new analytical and experimental results. Analytically, we introduce a novel Markov chain model tailored to portfolio-based SLS algorithms including SGS, thereby enabling us to analytically form expected hitting time results that explain empirical run time results. For a specific BN, we show the benefit of using a homogenous initialization portfolio. To further illustrate the portfolio approach, we consider novel additive search heuristics for handling determinism in the form of zero entries in conditional probability tables in BNs. Our additive approach adds rather than multiplies probabilities when computing the utility of an explanation. We motivate the additive measure by studying the dramatic impact of zero entries in conditional probability tables on the number of zero-probability explanations, which again complicates the search process. We consider the relationship between MAXSAT and MPE, and show that additive utility (or gain) is a generalization, to the probabilistic setting, of MAXSAT utility (or gain) used in the celebrated GSAT and WalkSAT algorithms and their descendants. Utilizing our Markov chain framework, we show that expected hitting time is a rational function - i.e. a ratio of two polynomials - of the probability of applying an additive search operator. Experimentally, we report on synthetically generated BNs as well as BNs from applications, and compare SGSs performance to that of Hugin, which performs BN inference by compilation to and propagation in clique trees. On synthetic networks, SGS speeds up computation by approximately two orders of magnitude compared to Hugin. In application networks, our approach is highly competitive in Bayesian networks with a high degree of determinism. In addition to showing that stochastic local search can be competitive with clique tree clustering, our empirical results provide an improved understanding of the circumstances under which portfolio-based SLS outperforms clique tree clustering and vice versa.

Mengshoel, Ole J.↗

Deep Neural Network for Precision Multi-band Infrared Image Segmentation

Image segmentation is one of the fundamental steps in computer vision. Separating targets from background clutter with high precision is a challenging operation for both humans and computers. Currently, segmenting objects from IR images is done by tedious manual work. The implementation of a Deep Neural Network (DNN) to perform precision segmentation of multi-band IR video images is presented. A customized pix2pix DNN with multiple layers of generative encoder/decoder and discriminator architecture is used in the IR image segmentation process. Real and synthetic images and ground truths are employed to train the DNN. Iterative training is performed to achieve optimum accuracy of segmentation using a minimal number of training data. Special training images are created to enhance the missing features and to increase the segmentation accuracy of the objects. Retraining strategies are developed to minimize the DNN training time. Single pixel accuracy has been achieved in IR target boundary segmentation using DNNs. The segmentation accuracy between the customized pix2pix DNN and simple thresholding, GraphCut, simple neural network and ResNet models are compared.

Torres, Gil↗

Selecting a Classification Ensemble and Detecting Process Drift in an Evolving Data Stream

We characterize the commercial behavior of a group of companies in a common line of business using a small ensemble of classifiers on a stream of records containing commercial activity information. This approach is able to effectively find a subset of classifiers that can be used to predict company labels with reasonable accuracy. Performance of the ensemble, its error rate under stable conditions, can be characterized using an exponentially weighted moving average (EWMA) statistic. The behavior of the EWMA statistic can be used to monitor a record stream from the commercial network and determine when significant changes have occurred. Results indicate that larger classification ensembles may not necessarily be optimal, pointing to the need to search the combinatorial classifier space in a systematic way. Results also show that current and past performance of an ensemble can be used to detect when statistically significant changes in the activity of the network have occurred. The dataset used in this work contains tens of thousands of high level commercial activity records with continuous and categorical variables and hundreds of labels, making classification challenging.

Ensemble classifiers↗

A Case Study of MPI Over Long Distance Connections

Scientific workflows are increasingly being distributed across wide-area networks, and their code executions are expected to span across geographically dispersed computing systems. MPI has been extensively used to support communications for distributed computations, typically, over compute clusters and high-performance systems within a single facility. We present a case study of performance of MPI basic operations over long distance connections, wherein TCP is used for the underlying transport. We present measurements of execution times of MPI codes that utilize MPI Sendrecv operations over emulated 10Gbps connections with 0-366ms round-trip times, including the longest one spanning the globe. They demonstrate that basic MPI codes can be sustained over long distance connections under external packet loss rates up to 10%. They also highlight the qualitative effects of losses which manifest as increased execution times as a consequence of TCP’s loss recovery process.

Rao, Nageswara S.↗

Core-collapse contamination in photometric samples of Type Ia Supernovae

This is an exciting time for cosmology with type Ia supernovae (SNe Ia). The recentlyconcluded Dark Energy Survey SN programme (DES-SN) has obtained the largest anddeepest high-redshift cosmological SN Ia sample, and the Vera Rubin Observatory isexpected to observe at least one order of magnitude more SNe Ia in the next decade.In both these experiments, only a limited fraction (.10 per cent) of the SNe can bespectroscopically classified. This leaves us with large ‘photometric’ SN samples, withthe potential for significant contamination by core-collapse SNe that may bias SN Iacosmological measurements. This thesis demonstrates how this contamination can bemodelled and accounted for in current and future cosmological analyses.First, I present state-of-the-art simulations of the SN universe. These are designedto accurately model the population of SNe Ia, peculiar SNe Ia and core-collapse SNe, aswell as their host galaxies. To improve the diversity and quality of the simulated corecollapseSNe, I build a new library of core-collapse SN templates using spectroscopicand photometric (optical and near-ultraviolet) data of 67 core-collapse SNe from theliterature. I account for our incomplete knowledge of core-collapse SN properties bygenerating a set of SN simulations (rather than a single one), each exploring differentmodelling choices and template libraries. I then characterise selection effects in theDES-SN survey and incorporate them in the simulations, thus obtaining a series ofDES-like simulated SN samples that can be compared to the observed DES-SN data.The agreement between the simulations and data is excellent across many observed SNproperties, including Hubble residuals. These simulations are the first to reproduce theobserved photometric SN and host galaxy properties in high-redshift surveys with no fine-tuning of the input parameters.I use my simulation framework to train and test the performance of SuperNNova,a photometric SN classifier based on recurrent neural networks. I explore differenttraining and validation strategies and show that, across all the DES-SN simulationstested, SuperNNova reduces core-collapse SN contamination to 0.8–3.5 per cent. Ithen show that biases due to contamination on the equation-of-state of dark energy,w, are < 0:008 when using our reference SuperNNova model. This compares to anexpected statistical uncertainty on w from the DES-SN sample of 0:039, thus showing that contamination is not a limiting systematic for the cosmological analysis of theDES-SN sample.The results presented in this thesis are the foundation of the DES SN Ia cosmologicalanalysis; they also provide important implications for the future of SN cosmology,as they demonstrate that contamination is not expected to significantly degrade thecosmological figure of merit of the Rubin SN Ia analysis.

79 ASTRONOMY AND ASTROPHYSICS↗

Real-time confinement regime detection in fusion plasmas with convolutional neural networks and high-bandwidth edge fluctuation measurements

Abstract A real-time detection of the plasma confinement regime can enable new advanced plasma control capabilities for both the access to and sustainment of enhanced confinement regimes in fusion devices. For example, a real-time indication of the confinement regime can facilitate transition to the high-performing wide-pedestal (WP) quiescent H-mode, or avoid unwanted transitions to lower confinement regimes that may induce plasma termination. To demonstrate real-time confinement regime detection, we use the 2D beam emission spectroscopy (BES) diagnostic system to capture localized density fluctuations of long wavelength turbulent modes in the edge region at a 1 MHz sampling rate. BES data from 330 discharges in either L-mode, H-mode, quiescent H (QH)-mode, or WP QH-mode were collected from the DIII-D tokamak and curated to develop a high-quality database to train a deep-learning classification model for real-time confinement detection. We utilize the 6×8 spatial configuration with a time window of 1024 µ s and recast the input to obtain spectral-like features via fast Fourier transform preprocessing. We employ a shallow 3D convolutional neural network for the multivariate time-series classification task and utilize a softmax in the final dense layer to retrieve a probability distribution over the different confinement regimes. Our model classifies the global confinement state on 44 unseen test discharges with an average F 1 score of 0.94, using only ∼1 ms snippets of BES data at a time. This activity demonstrates the feasibility for real-time data analysis of fluctuation diagnostics in future devices such as ITER, where the need for reliable and advanced plasma control is urgent.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Adaptive behavior and different thermal experiences of real people: A Bayesian neural network approach to thermal preference prediction and classification

Various observed and unquantifiable factors affect the thermal comfort of occupants in indoor environments and can lead to high uncertainty in the prediction and classification of their thermal preferences. The behavioral adaptation of occupants, by operating window systems for example, changes their thermal experience and expectations and therefore contributes to even higher prediction uncertainty. In this study, we applied a Bayesian neural network (BNN) algorithm to build a predictive model for occupant thermal preference using the ASHRAE Global Thermal Comfort Database II. The Bayesian method allows us to synthesize prior knowledge and available measurements into a unified modeling framework. It also offers a way to express and quantify uncertainty. Here we have performed a systematic study to test the efficiency and robustness of different BNN model configurations. In this study, the results show that the BNN model outperforms conventional thermal comfort models such as Predicted Mean Vote (PMV) and adaptive comfort model. The BNN model tends to produce more confident “prefer cooler” predictions with high possibility and low uncertainty. In contrast, the BNN model produces less certain predictions for “prefer no change” and “prefer warmer” across all occupants. Our findings suggest that linking occupants’ subjective evaluation measures and window opening/closing behavior to thermal comfort modeling effectively improves predictive performance.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A framework to evaluate machine learning crystal stability predictions

The rapid adoption of machine learning in various scientific domains calls for the development of best practices and community agreed-upon benchmarking tasks and metrics. We present Matbench Discovery as an example evaluation framework for machine learning energy models, here applied as pre-filters to first-principles computed data in a high-throughput search for stable inorganic crystals. We address the disconnect between (1) thermodynamic stability and formation energy and (2) retrospective and prospective benchmarking for materials discovery. Alongside this paper, we publish a Python package to aid with future model submissions and a growing online leaderboard with adaptive user-defined weighting of various performance metrics allowing researchers to prioritize the metrics they value most. To answer the question of which machine learning methodology performs best at materials discovery, our initial release includes random forests, graph neural networks, one-shot predictors, iterative Bayesian optimizers and universal interatomic potentials. We highlight a misalignment between commonly used regression metrics and more task-relevant classification metrics for materials discovery. Accurate regressors are susceptible to unexpectedly high false-positive rates if those accurate predictions lie close to the decision boundary at 0 eV per atom above the convex hull. The benchmark results demonstrate that universal interatomic potentials have advanced sufficiently to effectively and cheaply pre-screen thermodynamic stable hypothetical materials in future expansions of high-throughput materials databases.

Riebesell, Janosh↗