Search NASA⌕ Search

SEARCH · Search NASA

Results for “Network Performance”

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

Decarbonizing the grid: Utilizing demand-side flexibility for carbon emission reduction through locational marginal emissions in distribution networks

Decarbonization of the electric grid has become an important world-wide priority and is actively happening in many ways by introducing innovations and new technologies from the generation sectors to the demand sectors. In particular, one promising pathway toward such net-zero carbon emissions is to utilize the demand-side flexibility with the increasing number of flexible loads in distribution networks. In this paper, we explore a load shifting strategy with the emerging concept of location marginal emissions (LMEs) to reduce carbon emissions. LMEs measure the impact of carbon emissions including the locational aspect in more granular way and thus provide a novel mechanism for the system operator and load aggregators to design the LME-based load shifting strategy, which can efficiently guide consumers and thus adjust their consumption behaviors. Simulation case studies on the IEEE test networks are performed to validate the capability of the proposed load shifting method to reduce carbon emissions. We also compare this with other relevant strategies to discuss multiple scenarios and corresponding results. Finally, while each provides a different level of flexibility, all the explored strategies tested have led to solutions that have lower carbon emissions, indicating the great potential of demand-side flexibility in reducing carbon emissions for future distribution networks.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Analysis and modification of a single-mesh gear fatigue rig for use in diagnostic studies

A single-mesh gear fatigue rig was analyzed and modified for use in gear mesh diagnostic research. The fatigue rig allowed unwanted vibration to mask the test-gear vibration signal, making it difficult to perform diagnostic studies. Several possible sources and factors contributing to the unwanted components of the vibration signal were investigated. Sensor mounting location was found to have a major effect on the content of the vibration signal. In the presence of unwanted vibration sources, modal amplification made unwanted components strong. A sensor location was found that provided a flatter frequency response. This resulted in a more useful vibration signal. A major network was performed on the fatigue rig to reduce the influence of the most probable sources of the noise in the vibration signal. The slave gears were machined to reduce weight and increase tooth loading. The housing and the shafts were modified to reduce imbalance, looseness, and misalignment in the rotating components. These changes resulted in an improved vibration signal, with the test-gear mesh frequency now the dominant component in the signal. Also, with the unwanted sources eliminated, the sensor mounting location giving the most robust representation of the test-gear meshing energy was found to be at a point close to the test gears in the load zone of the bearings.

Zakrajsek, James J.↗

Benchmarking the performance of uncertainty quantification methods for neural network-based interatomic potentials

Machine-learned interatomic potentials (ML-IAPs) continue to gain popularity as accurate, computationally efficient replacements for traditional, physics-based interatomic potentials and expensive ab initio methods. Uncertainty quantification (UQ) of ML-IAPs is a growing area of research as UQ is critical in many applications of IAPs, such as developing curated datasets, active learning-based data augmentation, self-improving models, and estimating the uncertainty of molecular dynamics simulations. In this paper, we construct and benchmark a series of different neural network potentials (NNPs) with varying network architectures to determine the performance of these models with respect to both the mean and uncertainty calibration error. Each NNP method is specifically designed to predict either epistemic or aleatoric uncertainty with particular focus on the differences in behavior between the epistemic and aleatoric uncertainty estimates. We benchmark these methods using multiple datasets common in the ML-IAP literature. The results show that the aleatoric uncertainty from single-shot model architectures is a competitive alternative to ensemble-based epistemic uncertainty predictions in regions of sufficient data-density. However, in regions where the representative data is sparse, aleatoric uncertainty models tend to overpredict and epistemic methods tend to underpredict the actual model error. We conclude that the type of UQ is crucial when discussing performance of probabilistic model results as different methods have different performance characteristics depending on the regime in which they are evaluated. Therefore, the type of UQ method should be carefully evaluated against both the data characteristics and requirements for the intended application.

97 MATHEMATICS AND COMPUTING↗

Argonne Leadership Computing Facility: 2021 Operational Assessment Report

This Operational Assessment Report describes how the Argonne Leadership Computing Facility (ALCF) met or exceeded every one of its goals for calendar year (CY) 2021 as an advanced scientific computing center. In CY 2021, the ALCF operated its production resource, Theta, an Intel-based Cray XC40 system (11.7-petaflops) augmented with 24 NVIDIA DGX A100-based nodes (3.9-petaflops) that supports diverse workloads, integrating data analytics with artificial intelligence (AI) training and learning in a single platform. In 2021, we began deploying Polaris, our newest 40- petaflops system, and augmented this powerful testbed system with an additional 28 nodes to support the integration of real-time experiments and HPC resources. We also deployed our two largest storage systems yet, named Grand and Eagle, that will bring new services to our users and will power data-driven research for years to come. Last year, Theta delivered a total of 20.8 million node-hours to 16 Innovative and Novel Computational Impact on Theory and Experiment (INCITE) projects and 7.2 million node-hours to ASCR Leadership Computing Challenge (ALCC) projects (32 awarded during the 2020–2021 ALCC year and 17 awarded during the 2021–2022 ALCC year), as well as substantial support to Director’s Discretionary (DD) projects (5.5 million node-hours). As Table ES.1 shows, Theta performed exceptionally well in terms of overall availability (95.1 percent), scheduled availability (99.4 percent), and utilization (98.1 percent; Table 2.1). As of the submission date of this document, ALCF’s user community has published 249 papers in high-quality, peer-reviewed journals and technical proceedings. At the 2021 International Conference for High Performance Computing, Networking, Storage and Analysis (SC’21), Argonne researchers won two HPCwire Readers’ Choice Awards and were part of a Gordon Bell Prize finalist team recognized for developing an AI-enabled, multi-resolution simulation framework for studying complex biomolecular machines. Their framework was used to observe the SARS-CoV-2 replication-transcription machinery in action, by directly integrating experimental data. ALCF also provided a comprehensive program of high-performance computing (HPC) support services to help our community make productive use of the facility’s diverse and growing collection of resources. We are now entering the exascale era, with exascale machines being planned for national laboratories across the country, including Aurora at Argonne National Laboratory (Argonne) in 2023. ALCF researchers have been leading and guiding numerous strategic activities that will push the boundaries of what’s possible in computational science and engineering and allow us to deliver science on day one.

97 MATHEMATICS AND COMPUTING↗

Neural network-based classification and regression of magnetohydrodynamic modes in tokamaks

We present a machine learning-based magnetohydrodynamic (MHD) classifier and regressor that utilizes real or complex-valued 3D magnetic sensor array data to determine neoclassical tearing mode (NTM) onset times in tokamaks with millisecond accuracy. The input dataset consists of poloidal profiles of complex Fourier amplitudes with an n = 1 toroidal mode number from 144 human-labeled ITER Baseline Scenario discharges in the DIII-D tokamak, spanning both tearing-dominated and sawtooth-dominated regimes. Since m, n = 2,1 NTMs frequently emerge alongside sawteeth at the same frequency in this scenario, the focus is on isolating the m = 1 and m = 2 components of the n = 1 MHD mode near the tearing onset. To improve model regularization and prediction stability, singular value decomposition was applied to balance the sawtooth and tearing datasets. The enriched datasets facilitated training neural networks that learn the key distinguishing features of sawtooth and tearing modes in the poloidal profiles of their magnetic amplitude and phase. When the modes occur independently, the networks achieve perfect classification due to the modes’ distinct characteristics and low measurement noise. In the more experimentally relevant case where both modes coexist, the networks maintain exceptional performance across key metrics. Tests on synthetic data with known ground truth demonstrate the superior accuracy of the neural network trained on complex-valued input compared to models using real amplitude, phase, or pseudo-complex data, achieving both a mean time delay and standard deviation below 1 ms. Notably, standard linear regression methods fitting the dominant singular modes to the data closely match the neural network’s performance. Applying these methods across a broad range of H-mode scenarios will enable future studies to systematically identify dominant NTM triggers as scenario-specific variables, paving the way for more effective tearing mode avoidance strategies in future fusion reactor designs.

machine learning↗

Performance Comparison of Object Detection Networks for Shrapnel Identification in Ultrasound Images

Ultrasound imaging is a critical tool for triaging and diagnosing subjects but only if images can be properly interpreted. Unfortunately, in remote or military medicine situations, the expertise to interpret images can be lacking. Machine-learning image interpretation models that are explainable to the end user and deployable in real time with ultrasound equipment have the potential to solve this problem. We have previously shown how a YOLOv3 (You Only Look Once) object detection algorithm can be used for tracking shrapnel, artery, vein, and nerve fiber bundle features in a tissue phantom. However, real-time implementation of an object detection model requires optimizing model inference time. Here, we compare the performance of five different object detection deep-learning models with varying architectures and trainable parameters to determine which model is most suitable for this shrapnel-tracking ultrasound image application. We used a dataset of more than 16,000 ultrasound images from gelatin tissue phantoms containing artery, vein, nerve fiber, and shrapnel features for training and evaluating each model. Every object detection model surpassed 0.85 mean average precision except for the detection transformer model. Overall, the YOLOv7tiny model had the higher mean average precision and quickest inference time, making it the obvious model choice for this ultrasound imaging application. Other object detection models were overfitting the data as was determined by lower testing performance compared with higher training performance. In summary, the YOLOv7tiny object detection model had the best mean average precision and inference time and was selected as optimal for this application. Next steps will implement this object detection algorithm for real-time applications, an important next step in translating AI models for emergency and military medicine.

60 APPLIED LIFE SCIENCES↗

Differential Network Analyses of Alzheimer’s Disease Identify Early Events in Alzheimer’s Disease Pathology

In late-onset Alzheimer’s disease (AD), multiple brain regions are not affected simultaneously. Comparing the gene expression of the affected regions to identify the differences in the biological processes perturbed can lead to greater insight into AD pathogenesis and early characteristics. We identified differentially expressed (DE) genes from single cell microarray data of four AD affected brain regions: entorhinal cortex (EC), hippocampus (HIP), posterior cingulate cortex (PCC), and middle temporal gyrus (MTG). We organized the DE genes in the four brain regions into region-specific gene coexpression networks. Differential neighborhood analyses in the coexpression networks were performed to identify genes with low topological overlap (TO) of their direct neighbors. The low TO genes were used to characterize the biological differences between two regions. Our analyses show that increased oxidative stress, along with alterations in lipid metabolism in neurons, may be some of the very early events occurring in AD pathology. Cellular defense mechanisms try to intervene but fail, finally resulting in AD pathology as the disease progresses. Furthermore, disease annotation of the low TO genes in two independent protein interaction networks has resulted in association between cancer, diabetes, renal diseases, and cardiovascular diseases.

60 APPLIED LIFE SCIENCES↗

Network Configuration Analysis for Formation Flying Satellites

The performance of two networks to support autonomous multi-spacecraft formation flying systems is presented. Both systems are comprised of a ten-satellite formation, with one of the satellites designated as the central or 'mother ship.' All data is routed through the mother ship to the terrestrial network. The first system uses a TCP/EP over ATM protocol architecture within the formation, and the second system uses the IEEE 802.11 protocol architecture within the formation. The simulations consist of file transfers using either the File Transfer Protocol (FTP) or the Simple Automatic File Exchange (SAFE) Protocol. The results compare the IP queuing delay, IP queue size and IP processing delay at the mother ship as well as end-to-end delay for both systems. In all cases, using IEEE 802.11 within the formation yields less delay. Also, the throughput exhibited by SAFE is better than FTP.

Knoblock, Eric J.↗

Catalytic DNA Polymerization Can Be Expedited by Active Product Release**

Abstract The sequence‐specific hybridization of DNA facilitates its use as a building block for designer nanoscale structures and reaction networks that perform computations. However, the strong binding energy of Watson–Crick base pairing that underlies this specificity also causes the DNA dehybridization rate to depend sensitively on sequence length and temperature. This strong dependency imposes stringent constraints on the design of multi‐step DNA reactions. Here we show how an ATP‐dependent helicase, Rep‐X, can drive specific dehybridization reactions at rates independent of sequence length, removing the constraints of equilibrium on DNA hybridization and dehybridization. To illustrate how this new capacity can speed up designed DNA reaction networks, we show that Rep‐X extends the range of conditions where the primer exchange reaction, which catalytically adds a domain provided by a hairpin template to a DNA substrate, proceeds rapidly.

Moerman, Pepijn G.↗

Catalytic DNA Polymerization Can Be Expedited by Active Product Release**

Abstract The sequence‐specific hybridization of DNA facilitates its use as a building block for designer nanoscale structures and reaction networks that perform computations. However, the strong binding energy of Watson–Crick base pairing that underlies this specificity also causes the DNA dehybridization rate to depend sensitively on sequence length and temperature. This strong dependency imposes stringent constraints on the design of multi‐step DNA reactions. Here we show how an ATP‐dependent helicase, Rep‐X, can drive specific dehybridization reactions at rates independent of sequence length, removing the constraints of equilibrium on DNA hybridization and dehybridization. To illustrate how this new capacity can speed up designed DNA reaction networks, we show that Rep‐X extends the range of conditions where the primer exchange reaction, which catalytically adds a domain provided by a hairpin template to a DNA substrate, proceeds rapidly.

59 BASIC BIOLOGICAL SCIENCES↗

ELM: AN ALGORITHM TO ESTIMATE THE ALPHA ABUNDANCE FROM LOW-RESOLUTION SPECTRA

We have investigated a novel methodology using the extreme learning machine (ELM) algorithm to determine the α abundance of stars. Applying two methods based on the ELM algorithm—ELM+spectra and ELM+Lick indices—to the stellar spectra from the ELODIE database, we measured the α abundance with a precision better than 0.065 dex. By applying these two methods to the spectra with different signal-to-noise ratios (S/Ns) and different resolutions, we found that ELM+spectra is more robust against degraded resolution and ELM+Lick indices is more robust against variation in S/N. To further validate the performance of ELM, we applied ELM+spectra and ELM+Lick indices to SDSS spectra and estimated α abundances with a precision around 0.10 dex, which is comparable to the results given by the SEGUE Stellar Parameter Pipeline. We further applied ELM to the spectra of stars in Galactic globular clusters (M15, M13, M71) and open clusters (NGC 2420, M67, NGC 6791), and results show good agreement with previous studies (within 1σ). A comparison of the ELM with other widely used methods including support vector machine, Gaussian process regression, artificial neural networks, and linear least-squares regression shows that ELM is efficient with computational resources and more accurate than other methods.

79 ASTRONOMY AND ASTROPHYSICS↗

Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data

A restricted Boltzmann machine (RBM) is a generative model that could be used in effectively balancing a cybersecurity dataset because the synthetic data a RBM generates follows the probability distribution of the training data. RBM training can be performed using contrastive divergence (CD) and quantum annealing (QA). QA-based RBM training is fundamentally different from CD and requires samples from a quantum computer. We present a real-world application that uses a quantum computer. Specifically, we train a RBM using QA for cybersecurity applications. The D-Wave 2000Q has been used to implement QA. RBMs are trained on the ISCX data, which is a benchmark dataset for cybersecurity. For comparison, RBMs are also trained using CD. CD is a commonly used method for RBM training. Our analysis of the ISCX data shows that the dataset is imbalanced. We present two different schemes to balance the training dataset before feeding it to a classifier. The first scheme is based on the undersampling of benign instances. The imbalanced training dataset is divided into five sub-datasets that are trained separately. A majority voting is then performed to get the result. Our results show the majority vote increases the classification accuracy up from 90.24% to 95.68%, in the case of CD. For the case of QA, the classification accuracy increases from 74.14% to 80.04%. In the second scheme, a RBM is used to generate synthetic data to balance the training dataset. We show that both QA and CD-trained RBM can be used to generate useful synthetic data. Balanced training data is used to evaluate several classifiers. Among the classifiers investigated, K-Nearest Neighbor (KNN) and Neural Network (NN) perform better than other classifiers. They both show an accuracy of 93%. Our results show a proof-of-concept that a QA-based RBM can be trained on a 64-bit binary dataset. The illustrative example suggests the possibility to migrate many practical classification problems to QA-based techniques. Further, we show that synthetic data generated from a RBM can be used to balance the original dataset.

97 MATHEMATICS AND COMPUTING↗

The Promise of Ka-Band for Deep Space Communications

This talk briefly describes why there is a performance advantage over X-band and its limitations. The total advantage of a factor of 14.4 or 11.6 db, less the stochastic atmospheric effects can be used in several ways, smaller apertures, reduced RF power, greater data return through higher transmission rates, or shorter DSN track times at those same higher rates.

Ka-Band Spacecraft Communications Deep Space Netwo↗

First principles calculation of finite temperature magnetism in Fe and Fe3C

Density functional calculations have proven to be a useful tool in the study of ground state properties of many materials. The investigation of finite temperature magnetism, on the other hand, has to rely usually on the usage of empirical models that allow the large number of evaluations of the systems Hamiltonian that are required to obtain the phase space sampling needed to obtain the free energy, specific heat, magnetization, susceptibility, and other quantities as function of temperature. We have demonstrated a solution to this problem that harnesses the computational power of today s large massively parallel computers by combining a classical Wang Landau Monte-Carlo calculation [F. Wang and D. P. Landau, Phys. Rev. Lett. 86, 2050 (2001)] with our first principles multiple scattering electronic structure code [Y. Wang et al., Phys. Rev. Lett. 75, 2867 (1995)] that allows the energy calculation of constrained magnetic states [M. Eisenbach et al., Proceedings of the Conference on High Performance Computing, Networking, Storage and Analysis (ACM, New York, 2009)]. We present our calculations of finite temperature properties of Fe and Fe3C using this approach and we find the Curie temperatures to be 980 and 425K, respectively.

36 MATERIALS SCIENCE↗

Structured hints : extracting and abstracting domain expertise.

We propose a new framework for providing information to help optimize domain-specific application codes. Its design addresses problems that derive from the widening gap between the domain problem statement by domain experts and the architectural details of new and future high-end computing systems. The design is particularly well suited to program execution models that incorporate dynamic adaptive methodologies for live tuning of program performance and resource utilization. This new framework, which we call 'structured hints', couples a vocabulary of annotations to a suite of performance metrics. The immediate target is development of a process by which a domain expert describes characteristics of objects and methods in the application code that would not be readily apparent to the compiler; the domain expert provides further information about what quantities might provide the best indications of desirable effect; and the interactive preprocessor identifies potential opportunities for the domain expert to evaluate. Our development of these ideas is progressing in stages from case study, through manual implementation, to automatic or semi-automatic implementation. In this paper we discuss results from our case study, an examination of a large simulation of a neural network modeled after the neocortex.

97 MATHEMATICS AND COMPUTING↗

Influence of building heat distribution temperatures on the energy performance and sizing of 5th generation district heating and cooling networks

This paper investigates the energy performance and sizing criteria of 5th generation district heating and cooling (5GDHC) networks as a function of the heat distribution temperature in the building systems connected to the district network. An energy simulation model of a 5GDHC network was developed in Modelica for a case study located in Denmark. Calculations were carried out for four different building heating systems. Simulation results show that reducing the heat distribution temperatures from 70 °C to 23 °C leads to around 40% annual electric energy savings (from 10.4 kWh/m 2 to 6.2 kWh/m 2 ) for the operation of the heat pumps. Heat distribution temperatures of 23 °C cause higher water mass flow rates through the network, leading to annual electric energy consumption for the circulation pumps that are almost doubled (from 0.16 kWh/m 2 to 0.3 kWh/m 2 ) compared to the reference case at 70 °C. Furthermore, the paper discusses how the results obtained from the Danish case study can be generalized and applied to other cases using a simplified mathematical approach. In conclusion, it is found that about 1.5% of electric energy savings can be achieved for each temperature degree reduction in the heat distribution system.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Advanced Scientific Computing Research Network Requirements: ASCR Network Requirements Review Final Report

The Energy Sciences Network (ESnet) is the primary provider of network connectivity for the U.S. Department of Energy (DOE) Office of Science (SC), the single largest supporter of basic research in the physical sciences in the United States. In support of SC programs, ESnet regularly updates and refreshes its understanding of the networking requirements of the instruments, facilities, scientists, and science programs that it serves. This focus has helped ESnet to be a highly successful enabler of scientific discovery for over 25 years. In October 2012, ESnet and the Office of Advanced Scientific Computing Research (ASCR) of the DOE SC organized a review to characterize the networking requirements of the programs funded by the ASCR program office. The requirements identified at the review are summarized in the Findings section, and are described in more detail in the body of the report.

97 MATHEMATICS AND COMPUTING↗