Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “performance bound”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
NASA NTRS2005

Performance Analysis on Fault Tolerant Control System

In a fault tolerant control (FTC) system, a parameter varying FTC law is reconfigured based on fault parameters estimated by fault detection and isolation (FDI) modules. FDI modules require some time to detect fault occurrences in aero-vehicle dynamics. In this paper, an FTC analysis framework is provided to calculate the upper bound of an induced-L(sub 2) norm of an FTC system with existence of false identification and detection time delay. The upper bound is written as a function of a fault detection time and exponential decay rates and has been used to determine which FTC law produces less performance degradation (tracking error) due to false identification. The analysis framework is applied for an FTC system of a HiMAT (Highly Maneuverable Aircraft Technology) vehicle. Index Terms fault tolerant control system, linear parameter varying system, HiMAT vehicle.

Shin, Jong-Yeob↗
DOE OSTI2021

Complete set of bound negative-parity states in the neutron-rich nucleus 18 N

High-resolution γ -ray spectroscopy of N 18 is performed with the Advanced GAmma Tracking Array, following deep-inelastic processes induced by an O 18 beam on a Ta 181 target. Six states are newly identified, which together with the three known excitations exhaust all negative-parity excited states expected in N 18 below the neutron threshold. Spin and parities are proposed for all located states on the basis of decay branchings and comparison with large-scale shell-model calculations performed in the p-sd space, with the YSOX interaction. Of particular interest is the location of the 0 1 - and 1 2 - excitations, which provide strong constrains for cross-shell p-sd matrix elements based on realistic interactions and help to simultaneously reproduce the ground and first-excited states in N 16 and N 18 , for the first time. Overall, understanding the N 18 structure may also have significant impact on neutron-capture cross-section calculations in r-process modeling including light neutron-rich nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2025

HPC Campaign Management: Remote data access with user-defined error bound using ADIOS and ZFP

Remote access to large-scale scientific datasets, like those generated by combustion simulations or other high-performance computing (HPC) applications, presents a significant challenge. Downloading entire datasets is often impractical due to their size and the bandwidth limitations of typical networks. To address this challenge, we propose a novel approach that enables efficient remote access to large datasets distributed across multiple facilities. Our method enables technologies to download only the data values of a select variable, in a select region of interest, to a user-defined accuracy. For this purpose, we extended the ADIOS IO library to provide read functions with user-defined accuracy, a remote data server that understands multidimensional selections of specific variables, steps and accuracy from an ADIOS dataset, and which uses lossy compression on the remote site to reduce the data to be transferred back to the client. In addition, our extension of the ADIOS library collects metadata from multiple datasets in small files called Campaign Archives, which can be shared among project participants on any HPC, cloud or laptop, and which can easily facilitate the discovery of content and pointers to the data location as well as remote access to the data by local tools as if data was local. This feature called Campaign Management, enables a group of scientists to manage related datasets stored in multiple files, across multiple facilities as if it was in a single file/database. We demonstrate the effectiveness of our approach using a 1.5 TB dataset from the S3D combustion simulation on Frontier at the Oak Ridge Leadership Facility. Even a single variable from this dataset, at 64 GB, is too large to be processed on a standard laptop. We show two different reading patterns for 2D plots and 3D visualization, with careful settings that a scientist studying combustion data would do and show that running the same Python scripts on Frontier directly takes comparable time than running them on the local laptop with remote access to the data on Frontier.

Podhorszki, Norbert [ORNL] (ORCID:000000019647542X↗
DOE OSTI2021

SOMAFOAM: An OpenFOAM based solver for continuum simulations of low-temperature plasmas

Here, we report the development of SOMAFOAM, a finite volume framework for performing continuum simulations of low-temperature plasmas. The primary goal of this work is to discuss the features of SOMAFOAM along with representative results provided as examples for a range of operating conditions and geometries. This includes plasma and plasma–dielectric systems operating in direct current, radio frequency, and microwave regimes from pressures as low as 100 mTorr to atmospheric pressure. The code has several useful features including the ability to run massively parallel simulations using arbitrary geometries, structured/unstructured meshes, choice of models such as drift–diffusion/full-momentum at runtime, and species-dependent timesteps to name a few. The verification/validation studies presented include comparison with previously published continuum simulations (low-pressure direct current and radio frequency plasma), with experiments (Gaseous Electronics Conference Reference Cell and microwave microplasma ignited in a split ring resonator), and previously published kinetic simulations (low-pressure radio frequency plasma). Other examples provided include a direct current atmospheric pressure microplasma bounded by dielectric sidewalls and a helium–nitrogen plasma ignited using a needle electrode facing a dielectric. The performance of the code is also discussed with serial and distributed memory parallel runs demonstrated up to 512 cores. The design and implementation of the code in a modular object-oriented framework allows for easy extension and seamless coupling with other codes and can be expected to play an important role in both academia and industry.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1996

Experimental and Analytical Study of Two-Phase Flow in Microgravity

Design of the two-phase flow systems which are anticipated to be utilized in future spacecraft thermal management systems requires a knowledge of two-phase flow and heat transfer parameters in reduced gravities. A program has been initiated by NASA to design a two-phase test loop and to perform a series of experiments to study the effect of gravity on the Critical Heat Flux (CHF) and onset of instability. The test loop is also instrumented to generate data for two-phase pressure drop. In addition to low gravity airplane trajectory testing, the experimental program consisted of a set of laboratory tests which were intended to generate data under the bounding conditions (+1 g and -1 g) in order to plan the test matrix. One set of airplane trajectory tests has been performed and several modifications to the test set-up have been identified. Preliminary test results have been used to demonstrate the applicability of the earth gravity models for prediction of the two-phase friction pressure drop.

McQuillen, John B.↗
DOE OSTI2021

Elucidation of Agonist and Antagonist Dynamic Binding Patterns in ER-α by Integration of Molecular Docking, Molecular Dynamics Simulations and Quantum Mechanical Calculations

Estrogen receptor alpha (ERα) is a ligand-dependent transcriptional factor in the nuclear receptor superfamily. Many structures of ERα bound with agonists and antagonists have been determined. However, the dynamic binding patterns of agonists and antagonists in the binding site of ERα remains unclear. Therefore, we performed molecular docking, molecular dynamics (MD) simulations, and quantum mechanical calculations to elucidate agonist and antagonist dynamic binding patterns in ERα. 17β-estradiol (E2) and 4-hydroxytamoxifen (OHT) were docked in the ligand binding pockets of the agonist and antagonist bound ERα. The best complex conformations from molecular docking were subjected to 100 nanosecond MD simulations. Hierarchical clustering was conducted to group the structures in the trajectory from MD simulations. The representative structure from each cluster was selected to calculate the binding interaction energy value for elucidation of the dynamic binding patterns of agonists and antagonists in the binding site of ERα. The binding interaction energy analysis revealed that OHT binds ERα more tightly in the antagonist conformer, while E2 prefers the agonist conformer. The results may help identify ERα antagonists as drug candidates and facilitate risk assessment of chemicals through ER-mediated responses.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1997

Performance Data Gathering and Representation from Fixed-Size Statistical Data

The two commonly-used performance data types in the super-computing community, statistics and event traces, are discussed and compared. Statistical data are much more compact but lack the probative power event traces offer. Event traces, on the other hand, are unbounded and can easily fill up the entire file system during program execution. In this paper, we propose an innovative methodology for performance data gathering and representation that offers a middle ground. Two basic ideas are employed: the use of averages to replace recording data for each instance and 'formulae' to represent sequences associated with communication and control flow. The user can trade off tracing overhead, trace data size with data quality incrementally. In other words, the user will be able to limit the amount of trace data collected and, at the same time, carry out some of the analysis event traces offer using space-time views. With the help of a few simple examples, we illustrate the use of these techniques in performance tuning and compare the quality of the traces we collected with event traces. We found that the trace files thus obtained are, indeed, small, bounded and predictable before program execution, and that the quality of the space-time views generated from these statistical data are excellent. Furthermore, experimental results showed that the formulae proposed were able to capture all the sequences associated with 11 of the 15 applications tested. The performance of the formulae can be incrementally improved by allocating more memory at runtime to learn longer sequences.

Yan, Jerry C.↗
NASA NTRS1993

Interdisciplinary technology

The 'computational test-cell' will enable the incorporation of new methodologies, such as concurrent engineering and probabilistic methods, into the propulsion design process. This will provide the capability to conduct credible, interdisciplinary analyses of new propulsion concepts and designs. Probabilistic methods can be used as the basis for reliability-based design. Recently methods have been devised that provide the capability of simulating the performance of propulsion systems at several levels of resolution. These methods make it possible to quantify uncertainty and to establish confidence bounds for the calculated values. The introduction of reliability-based design methodology along with probabilistic analyses will provide a tool to reduce the design space for new systems and to reduce our dependence on hardware testing for proof-of-concept and system integration demonstrations. The resulting simulations will reduce the need for testing and identify potential operational problems early in the design process. This capability will make it possible to compute the expected performance, stability, reliability, and life of propulsion components, subsystems, and systems at design and off-design conditions, to bring life cycle cost trade-offs early into the design process and to determine optimum designs to satisfy specified mission requirements.

Nichols, Lester D.↗
DOE OSTI2023

TopoSZ: Preserving Topology in Error-Bounded Lossy Compression

Existing error-bounded lossy compression techniques control the pointwise error during compression to guarantee the integrity of the decompressed data. However, they typically do not explicitly preserve the topological features in data. When performing post hoc analysis with decompressed data using topological methods, preserving topology in the compression process to obtain topologically consistent and correct scientific insights is desirable. In this paper, we introduce TopoSZ, an error-bounded lossy compression method that preserves the topological features in 2D and 3D scalar fields. Specifically, we aim to preserve the types and locations of local extrema as well as the level set relations among critical points captured by contour trees in the decompressed data. The main idea is to derive topological constraints from contour-tree-induced segmentation from the data domain, and incorporate such constraints with a customized error-controlled quantization strategy from the SZ compressor (version 1.4). In conclusion, our method allows users to control the pointwise error and the loss of topological features during the compression process with a global error bound and a persistence threshold.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Topology-Dependent Performance of Free-Space Photonic Quantum Networks Under Noise

Photonic quantum communication enables secure and high-fidelity information transfer beyond classical limits, with direct relevance to emerging quantum networks operating in free-space environments. While physical-layer models of depolarizing noise, Gamma–Gamma turbulence statistics, entanglement swapping, and decoy-state QKD security bounds are individually well established, prior work typically treats these components in isolation or under fixed network assumptions. In this work, we develop a unified topology-aware analytical framework that simultaneously integrates free-space optical link budgets, turbulence-induced visibility degradation, depolarizing qubit noise, multi-hop entanglement cascade dynamics, teleportation fidelity thresholds, CHSH nonlocality certification, and asymptotic decoy-state secret key rate bounds across star, mesh, and ring graph structures. Rather than introducing new physical channel models, we demonstrate that identical physical links exhibit fundamentally different end-to-end performance once embedded within different network topologies. Mesh architectures minimize visibility cascade through hop-count reduction but incur quadratic hardware scaling. Star topologies minimize link count but concentrate noise and synchronization overhead at the hub. Ring configurations offer linear hardware scaling with multiplicative fidelity degradation. The results establish topology as a first-order design parameter in near-term free-space quantum networks operating without full quantum repeater infrastructures. While motivated by distributed multi-agent architectures, the framework applies broadly to terrestrial, airborne, and satellite-assisted photonic quantum communication systems.

QKD↗
DOE OSTI2021

Toward exascale whole-device modeling of fusion devices: Porting the GENE gyrokinetic microturbulence code to GPU

GENE solves the five-dimensional gyrokinetic equations to simulate the development and evolution of plasma microturbulence in magnetic fusion devices. The plasma model used is close to first principles and computationally very expensive to solve in the relevant physical regimes. In order to use the emerging computational capabilities to gain new physics insights, several new numerical and computational developments are required. Here, we focus on the fact that it is crucial to efficiently utilize GPUs (graphics processing units) that provide the vast majority of the computational power on such systems. In this paper, we describe the various porting approaches considered and given the constraints of the GENE code and its development model, justify the decisions made, and describe the path taken in porting GENE to GPUs. We introduce a novel library called gtensor that was developed along the way to support the process. Performance results are presented for the ported code, which in a single node of the Summit supercomputer achieves a speed-up of almost 15× compared to running on central processing unit (CPU) only. Typical GPU kernels are memory-bound, achieving about 90% of peak. Our analysis shows that there is still room for improvement if we can refactor/fuse kernels to achieve higher arithmetic intensity. We also performed a weak parallel scalability study, which shows that the code runs well on a massively parallel system, but communication costs start becoming a significant bottleneck.

Germaschewski, K. (ORCID:0000000284956354)↗
DOE OSTI2020

Radioactive Source Localization via Bayesian Particle Filter

In the event of a misplaced radioactive source or other emergency situation, measuring a radiation field, mapping its distribution, and determining a source location are essential tasks to ameliorating the situation. However, radiation fields may be extremely hazardous to human surveyors and minimizing received radiation doses is just as essential. Robots appear to be a potential solution to these problems. Beyond simply measuring radiation, the robot's computer processing capabilities offer a way to apply complex data analysis methods to radiation measurements in real-time. Methods which predict likely source locations can then feed this information into other processes, potentially improving path planning and enabling more efficient measurements. Given a robot mounted with a gamma-ray detector, can we: develop a methodology to account for detector performance across a wide range of source angles, distances, and photon energies? operate an autonomously navigating robot to effectively survey and characterize an area of interest? implement a data analysis method, conventionally used in measurements of motion, for source localization purposes? An open-source TurtleBot 3 robot, running Robot Operating System (ROS) on Ubuntu 16.04 LTS, was fitted with a Kromek GR1{sup R} Cadmium Zinc Telluride (CZT) solid-state gamma-ray detector. As a part of ROS, the packages OpenSlam, gmapping, and amcl were used to perform Simultaneous Localization and Mapping (SLAM), determining the robot's position and mapping the surrounding area. Data was acquired via Lidar mounted on top the TurtleBot 3. Detector Calibration Fit: The equation was fit to 365 counts of various energies, distances, and angles. A MATLAB{sup R} program was written to simulate measurements taken a robot on a random walk, with count data and positions discretized into finite element pixels. Using this program, a sample of 100 runs was performed on a map with a simulated source at the center, with a total of 200 of 2 pixels each. Similarly, multiple runs of the filter were performed on recorded robot measurement data. In both simulation and real tests, when corrected for errors (particles placed outside of bounds or on the robot, and simulation-specific errors), corresponding t-tests of predicted x and y-coordinates were within a 95% confidence interval of the actual position. For the real trial, these positions are slightly skewed right in the x-axis as the robot remained mainly to the left side of the source within the sample area. These simulations demonstrate potential validity for the usage of a particle filter as method of radioactive source localization. In the future, true real-time implementation and data fusion may further augment the performance of the robot to localize lost sources. Additionally, identification of multiple sources, determination of source types, and usage of a collimator are areas to potentially be explored.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2024

Observational constraints on early dark energy

In this paper, we review and update constraints on the Early Dark Energy (EDE) model from cosmological data sets, in particular Planck PR3 and PR4 cosmic microwave background (CMB) data and large-scale structure (LSS) data sets including galaxy clustering and weak lensing data from the Dark Energy Survey, Subaru Hyper Suprime-Cam and KiDS+VIKING-450, as well as BOSS/eBOSS galaxy clustering and Lyman-[Formula: see text] forest data. We detail the fit to CMB data, and perform the first analyses of EDE using the CAMSPEC and Hillipop likelihoods for Planck CMB data, rather than Plik, both of which yield a tighter upper bound on the allowed EDE fraction than that found with Plik. We then supplement CMB data with LSS data in a series of new analyses. All these analyses are concordant in their Bayesian preference for [Formula: see text]CDM over EDE, as indicated by marginalized posterior distributions. We perform a series of tests of the impact of priors in these results, and compare with frequentist analyses based on the profile likelihood, finding qualitative agreement with the Bayesian results. All these tests suggest prior volume effects are not a determining factor in analyses of EDE. This work provides both a review of existing constraints and several new analyses.

Astronomy & Astrophysics↗
NASA NTRS1996

Constructing Space-Time Views from Fixed Size Statistical Data: Getting the Best of Both Worlds

Many performance monitoring tools are currently available to the super-computing community. The performance data gathered and analyzed by these tools fall under two categories: statistics and event traces. Statistical data is much more compact but lacks the probative power event traces offer. Event traces, on the other hand, can easily fill up the entire file system during execution such that the instrumented execution may have to be terminated half way through. In this paper, we propose an innovative methodology for performance data gathering and representation that offers a middle ground. The user can trade-off tracing overhead, trace data size vs. data quality incrementally. In other words, the user will be able to limit the amount of trace collected and, at the same time, carry out some of the analysis event traces offer using spacetime views for the entire execution. Two basic ideas are employed: the use of averages to replace recording data for each instance and "formulae" to represent sequences associated with communication and control flow. With the help of a few simple examples, we illustrate the use of these techniques in performance tuning and compare the quality of the traces we collected vs. event traces. We found that the trace files thus obtained are, in deed, small, bounded and predictable before program execution and that the quality of the space time views generated from these statistical data are excellent. Furthermore, experimental results showed that the formulae proposed were able to capture 100% of all the sequences associated with 11 of the 15 applications tested. The performance of the formulae can be incrementally improved by allocating more memory at run-time to learn longer sequences.

Schmidt, Melisa↗
NASA NTRS1997

Constructing Space-Time Views from Fixed Size Statistical Data: Getting the Best of both Worlds

Many performance monitoring tools are currently available to the super-computing community. The performance data gathered and analyzed by these tools fall under two categories: statistics and event traces. Statistical data is much more compact but lacks the probative power event traces offer. Event traces, on the other hand, can easily fill up the entire file system during execution such that the instrumented execution may have to be terminated half way through. In this paper, we propose an innovative methodology for performance data gathering and representation that offers a middle ground. The user can trade-off tracing overhead, trace data size vs. data quality incrementally. In other words, the user will be able to limit the amount of trace collected and, at the same time, carry out some of the analysis event traces offer using space-time views for the entire execution. Two basic ideas arc employed: the use of averages to replace recording data for each instance and formulae to represent sequences associated with communication and control flow. With the help of a few simple examples, we illustrate the use of these techniques in performance tuning and compare the quality of the traces we collected vs. event traces. We found that the trace files thus obtained are, in deed, small, bounded and predictable before program execution and that the quality of the space time views generated from these statistical data are excellent. Furthermore, experimental results showed that the formulae proposed were able to capture 100% of all the sequences associated with 11 of the 15 applications tested. The performance of the formulae can be incrementally improved by allocating more memory at run-time to learn longer sequences.

Schmidt, Melisa↗
NASA NTRS1991

Experimental study of adaptive pointing and tracking for large flexible space structures

This paper describes an experimental study of adaptive pointing and tracking control for flexible spacecraft conducted on a complex ground experiment facility. The algorithm used in this study is based on a multivariable direct model reference adaptive control law. Several experimental validation studies were performed earlier using this algorithm for vibration damping and robust regulation, with excellent results. The current work extends previous studies by addressing the pointing and tracking problem. As is consistent with an adaptive control framework, the plant is assumed to be poorly known to the extent that only system level knowledge of its dynamics is available. Explicit bounds on the steady-state pointing error are derived as functions of the adaptive controller design parameters. It is shown that good tracking performance can be achieved in an experimental setting by adjusting adaptive controller design weightings according to the guidelines indicated by the analytical expressions for the error.

Boussalis, D.↗
DOE OSTI2021

Model predictive combustion control of a Gasoline Compression Ignition engine

Gasoline Compression Ignition is a novel combustion concept that derives its superiority from the high compression ratio of a compression ignition engine as well as the properties of gasoline fuel, such as longer ignition delay and higher volatility compared to diesel. Here, this combustion concept was experimentally tested on a 12.4L Class 8 truck engine. Based on these experimental data, prior efforts by the authors focused on the development of an engine model for a heavy-duty engine operating on a low-reactivity fuel. This engine model was leveraged within this study to investigate a combustion control strategy at different engine conditions and injection methods and was augmented to incorporate cycle-to-cycle combustion variations. State estimation is performed by means of a Kalman filter which feeds into a model predictive controller. The model predictive controller chooses control actions based on a predefined cost function under consideration of bounds reflecting physical constraints. The engine model was utilized to establish a state-space model that serves the Kalman filter and model predictive controller for estimation and prediction. A comparative study investigating control actions and engine behavior was performed with and without limiting in-cylinder peak pressure as well as combustion noise, which is of particular interest for early pilot injection strategies. In addition, the proposed control architecture was investigated at two different levels of cycle-to-cycle variations and compared to the performance of a control structure with input disturbance rejection. For increased cycle-to-cycle variations, disturbance estimation reduces state fluctuations and control effort. In general, this investigation highlights control aspects specific to a compression-ignited combustion regime with low-reactivity fuel. The control algorithm is able to maintain the desired references for brake mean effective pressure and combustion phasing while controlling peak in-cylinder pressure and combustion noise.

42 ENGINEERING↗
NASA NTRS2000

Molecular Simulations in Astrobiology

One of the main goals of astrobiology is to understand the origin of cellular life. The most direct approach to this problem is to construct laboratory models of protocells. Such efforts, currently underway in the NASA Astrobiology Program, are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures that are capable of performing protocellular functions. Many of these functions, such as importing nutrients, capturing energy and responding to changes in the environment, are carried out by proteins bound to membranes. We use computer simulations to address the following questions about these proteins: (1) How do small proteins self-organize into ordered structures at water-membrane interfaces and insert into membranes? (2) How do peptides form membrane-spanning structures (e.g. channels)? (3) By what mechanisms do such structures perform their functions? The simulations are performed using the molecular dynamics method. In this method, Newton's equations of motion for each atom in the system are solved iteratively. At each time step, the forces exerted on each atom by the remaining atoms are evaluated by dividing them into two parts. Short-range forces are calculated in real space while long-range forces are evaluated in reciprocal space, using a particle-mesh algorithm which is of order O(NInN). With a time step of 2 femtoseconds, problems occurring on multi-nanosecond time scales (10(exp 6)-10(exp 8) time steps) are accessible. To address a broader range of problems, simulations need to be extended by three orders of magnitude, which requires algorithmic improvements and codes scalable to a large number of processors. Work in this direction is in progress. Two series of simulations are discussed. In one series, it is shown that nonpolar peptides, disordered in water, translocate to the nonpolar interior of the membrane and fold into helical structures (see Figure). Once in the membrane, the peptides exhibit orientational flexibility with changing conditions, which may have provided a mechanism of transmitting signals between the protocell and its environment. In another series of simulations, the mechanism by which a simple protein channel efficiently mediates proton transport across membranes was investigated. This process is a key step in cellular bioenergetics. In the channel under study, proton transport is gated by four histidines that occlude the channel pore. The simulations identify the mechanisms by which protons move through the gate.

Pohorille, Andrew↗