Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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,387 records · Page 77

Investigation of a digitizer for the plastic scintillation detectors of time-of-flight mass measurements

A CAEN DT5742 digitizer has been investigated to process the fast signals from the photomultiplier tubes of the time-of-flight detectors for fast ion beams. A test setup consisting of two plastic scintillation detectors and a pulsed laser source provided signals which were recorded by the digitizer and systematically analyzed with different algorithms to derive the amplitude, rise time and arrival time of the detection signal. To obtain the best amplitude and time resolutions, various optimization techniques including peak fitting and signal smoothing, interpolation improvement, and time-walk correction by amplitude and rise time have been performed and compared in detail. Here we compared the time resolutions obtained by three digital algorithms of leading-edge, zero-crossing constant-fraction (ZC-CFD) and direct constant-fraction discriminations. Finally, we found that the best time-of-flight resolution between two PMTs can be achieved as 12 ps by the method using sample minimum for peak location and using the time-walk-resistant ZC-CFD with 4-point interpolation for timing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Denoising Seismic Waveforms Using a Wavelet-Transform-Based Machine-Learning Method

Seismic waveform data recorded at stations can be thought of as a superposition of the signal from a source of interest and noise from other sources. Frequency‐based filtering methods for waveform denoising do not result in desired outcomes when the targeted signal and noise occupy similar frequency bands. Recently, denoising techniques based on deep‐learning convolutional neural networks (CNNs), in which a recorded waveform is decomposed into signal and noise components, have led to improved results. These CNN methods, which use short‐time Fourier transform representations of the time series, provide signal and noise masks for the input waveform. These masks are used to create denoised signal and designaled noise waveforms, respectively. However, advancements in the field of image denoising have shown the benefits of incorporating discrete wavelet transforms (DWTs) into CNN architectures to create multilevel wavelet CNN (MWCNN) models. The MWCNN model preserves the details of the input due to the good time–frequency localization of the DWT. In this report we use a data set of over 382,000 constructed seismograms recorded by the University of Utah Seismograph Stations network to compare the performance of CNN and MWCNN‐based denoising models. Evaluation of both models on constructed test data shows that the MWCNN model outperforms the CNN model in the ability to recover the ground‐truth signal component in terms of both waveform similarity and preservation of amplitude information. Model evaluation of real‐world data shows that both the CNN and MWCNN models outperform standard band‐pass filtering (BPF; average improvement in signal‐to‐noise ratio of 9.6 and 19.7 dB, respectively, with respect to BPF). Evaluation of continuous data suggests the MWCNN denoiser can improve both signal detection capabilities and phase arrival time estimates.

58 GEOSCIENCES↗

Gravitational wave burst source direction estimation using time and amplitude information

In this article we study two problems that arise when using timing and amplitude estimates from a network of interferometers (IFOs) to evaluate the direction of an incident gravitational wave burst. First, we discuss an angular bias in the least squares timing-based approach that becomes increasingly relevant for moderate to low signal-to-noise ratios. We show how estimates of the arrival time uncertainties in each detector can be used to correct this bias. We also introduce a stand-alone parameter estimation algorithm that can improve the arrival time estimation and provide root-sum-squared strain amplitude (h{sub rss}) values for each site. In the second part of the paper we discuss how to resolve the directional ambiguity that arises from observations in three non co-located IFOs between the true source location and its mirror image across the plane containing the detectors. We introduce a new, exact relationship among the h{sub rss} values at the three sites that, for sufficiently large signal amplitudes, determines the true source direction regardless of whether or not the signal is linearly polarized. Both the algorithm estimating arrival times, arrival time uncertainties, and h{sub rss} values and the directional follow-up can be applied to any set of gravitational wave candidates observed in a network of three non co-located IFOs. As a case study we test the methods on simulated waveforms embedded in simulations of the noise of the LIGO and Virgo detectors at design sensitivity.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Real-time calibration of a feedback trap

Feedback traps use closed-loop control to trap or manipulate small particles and molecules in solution. They have been applied to the measurement of physical and chemical properties of particles and to explore fundamental questions in the non-equilibrium statistical mechanics of small systems. These applications have been hampered by drifts in the electric forces used to manipulate the particles. Although the drifts are small for measurements on the order of seconds, they dominate on time scales of minutes or slower. Here, we show that a recursive maximum likelihood (RML) algorithm can allow real-time measurement and control of electric and stochastic forces over time scales of hours. Simulations show that the RML algorithm recovers known parameters accurately. Experimental estimates of diffusion coefficients are also consistent with expected physical properties.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A generalized approach for determining electric machine drive switching schemes using evolutionary optimization algorithms

The number of inverter switching events in one fundamental cycle of an electric machine can be limited by many factors such as inverter switching frequency, rotational speed, and computational time required by control algorithms. Even at low and moderate speeds, switching harmonics cause distortion in the phase current, which can lead to increased torque ripple and core losses when compared to operation with ideal waveforms. Furthermore, as rotational speed increases and voltage limitations are encountered, overmodulation schemes must be implemented to overcome increasing reactance and back-EMF (or pseudo back-EMF). The goal of this paper is to establish a framework and demonstrate methods for determining optimal switching times for a set number of switching events in a fundamental cycle using particle swarm optimization and multivariable fitness functions.

Burress, Timothy↗

An Optimization Framework for Dynamic, Distributed Real-Time Systems

Abstract. This paper presents a model that is useful for developing resource allocation algorithms for distributed real-time systems .that operate in dynamic environments. Interesting aspects of the model include dynamic environments, utility and service levels, which provide a means for graceful degradation in resource-constrained situations and support optimization of the allocation of resources. The paper also provides an allocation algorithm that illustrates how to use the model for producing feasible, optimal resource allocations.

Eckert, Klaus↗

Thermo Field Dynamics on a Quantum Computer

In this project we develop a quantum algorithm to realize finite temperature simulation on a quantum computer. As quantum computers use real-time evolution we did not use the imaginary time methods popular on classical algorithms. Instead, we implemented a real-time therom field dynamics formalism, which has the added benefit of being able to compute quantities that are both time-and temperature-dependent. To implement thermo field dynamics we apply a unitary transformation [1] to discrete quantum mechanical operators to make new Hamiltoni-ans with encoded temperature dependence. The method works normally for fermions, which have a finite representation, but needs some modification to work with bosons. These Hamilto-nians are then processed into a Pauli matrix representation in order to be used as input for IBM's Qiskit package [2]. We then use IBM's quantum simulator to calculate an approximation to the Hamiltonaian's ground state energy via the variational quantum eigensolver (VQE) algorithm [3]. This approximation is then compared to a classically calculated value for the exact energy. The thermo field dynamics quantum algorithm has general applications to material science, high-energy physics and nuclear physics, particularly in those situations involving realtime evolution at high temperature.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scaling behavior of quantum nanosystems: Emergence of quasi-particles, collective modes, and mixed exchange symmetry states

Examples of quantum nanosystems are graphene nanoribbons, molecular wires, and superconducting nanoparticles. The objective of the multiscale theory presented here is to provide a new perspective on the coupling of processes across scales in space and time underlying the dynamics of these systems. The long range objective for this multiscale approach is to serve as an efficient computational algorithm. Long space-time dynamics is derived using a perturbation expansion in the ratio {epsilon} of the nearest-neighbor distance to a nanometer-scale characteristic length and a theorem on the equivalence of long time-averages and expectation values. This dynamics is shown to satisfy a coarse-grained wave equation (CGWE) which takes a Schroedinger-like form with modified masses and interactions. The scaling of space and time is determined by the orders of magnitude of various contributions to the N-body potential. If the spatial scale of the coarse-graining is too large, the CGWE would imply an unbounded growth of gradients; if it is too short, the system's size would display uncontrolled growth inappropriate for the bound states of interest, i.e., collective motion or migration within a stable nanoassembly. The balance of these two extremes removes arbitrariness in the choice of the scaling of space-time. Since the long-scale dynamics of each Fermion involves its interaction with many others, we hypothesize that the solutions of the CGWE have mean-field character to good approximation, i.e., can be factorized into single-particle functions. This leads to a coarse-grained mean-field approximation that is distinct in character from traditional Hartree-Fock theory. A variational principle is used to derive equations for the single-particle functions. This theme is developed and used to derive an equation for low-lying disturbances from the ground state corresponding to long wavelength density disturbances or long-scale migration. An algorithm for the efficient simulation of quantum nanosystems is suggested.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Resource utilization model for the algorithm to architecture mapping model

The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories.

Stoughton, John W.↗

Resilient NdFeB magnet recycling under the impacts of COVID-19 pandemic: Stochastic programming and Benders decomposition

Neodymium-iron-boron (NdFeB) magnets are the most powerful magnets per unit volume sold in the commercial market. Despite the increasing demand for clean energy applications such as electric vehicles and wind turbines, disruptive events including the COVID-19 pandemic have caused significant uncertainties in the supply and demand for NdFeB magnets. Therefore, this study aims to alleviate the risk of supply shortage for NdFeB magnets and the containing critical materials, rare-earth elements (REEs), through the development of a resilient reverse supply chain and logistics network design. We develop scenarios to model the unique impact of the COVID-19 pandemic on the proposed business, incorporating both disruption intensity and recovery rate. We formulate a chance-constrained two-stage stochastic programming model to maximize the profit while guaranteeing the network resiliency against disruption risks. To solve the problem in large-scale instances, we develop an efficient Benders decomposition algorithm that reduces the computational time by 98.5% on average compared to the default CPLEX algorithm. When applied to the United States, the model suggests the optimal facility locations, processing capacities, inventory levels, and material flows for NdFeB magnet recyclers that could meet 99.7% of the demand. To the best of our knowledge, this study is the first to incorporate the impacts of the COVID-19 pandemic to design a resilient NdFeB magnet recycling supply chain and logistics network, leveraging risk-averse stochastic programming.

42 ENGINEERING↗

Distributed-Memory Parallel Symmetric Nonnegative Matrix Factorization

We develop the first distributed-memory parallel implementation of Symmetric Nonnegative Matrix Factorization (SymNMF), a key data analytics kernel for clustering and dimensionality reduction. Our implementation includes two different algorithms for SymNMF, which give comparable results in terms of time and accuracy. The first algorithm is a parallelization of an existing sequential approach that uses solvers for non symmetric NMF. The second algorithm is a novel approach based on the Gauss-Newton method. It exploits second-order information without incurring large computational and memory costs. We evaluate the scalability of our algorithms on the Summit system at Oak Ridge National Laboratory, scaling up to 128 nodes (4,096 cores) with 70% efficiency. Additionally, we demonstrate our software on an image segmentation task.

Eswar, Srinivas↗

A finite element method for diffusion dominated unsteady viscous flows

A general conforming finite element scheme for computing viscous flows is presented which is of second-order accuracy in space and time. Viscous terms are treated implicitly and advection terms are treated explicitly in the time marching segment of the algorithm. A method for solving the algebraic equations at each time step is given. The method is demonstrated on two test problems, one of them being a plane vortex flow for which asymptotic methods are used to obtain suitable numerical boundary conditions at each time step.

Gunzburger, M. D.↗

Development of iterative techniques for the solution of unsteady compressible viscous flows

A research effort was initiated at Georgia Tech in February 1991 on the development of efficient techniques for the computation of 2-D and 3-D unsteady compressible flow problems. It was found that in 2-D unsteady viscous flow applications, the generalized minimal residual (GMRES) scheme was able to significantly improve the accuracy and stability characteristics of an existing 2-D ADI (Alternating Direction Implicit) time marching scheme. That is, the GMRES/ADI combination allowed 10 to 20 times larger time steps compared to an ADI scheme. Because the GMRES algorithm requires 5 to 10 times the CPU work compared to the ADI scheme, the combined GMRES/ADI scheme yields a net factor of 2 savings in CPU cost. During the past year, we also experimented with GMRES/multigrid/ADI combination. The purpose of this combination was to compute the low frequency components of the change in the flow properties from one time step to the next on a coarse grid. This strategy reduces the memory requirements of the GMRES method roughly by a factor of 4-8 for steady flow problems.

Sankar, Lakshmi N.↗

Taxi Time Prediction at Charlotte Airport Using Fast-Time Simulation and Machine Learning Techniques

Accurate taxi time prediction is required for enabling efficient runway scheduling that can increase runway throughput and reduce taxi times and fuel consumptions on the airport surface. Currently NASA and American Airlines are jointly developing a decision-support tool called Spot and Runway Departure Advisor (SARDA) that assists airport ramp controllers to make gate pushback decisions and improve the overall efficiency of airport surface traffic. In this presentation, we propose to use Linear Optimized Sequencing (LINOS), a discrete-event fast-time simulation tool, to predict taxi times and provide the estimates to the runway scheduler in real-time airport operations. To assess its prediction accuracy, we also introduce a data-driven analytical method using machine learning techniques. These two taxi time prediction methods are evaluated with actual taxi time data obtained from the SARDA human-in-the-loop (HITL) simulation for Charlotte Douglas International Airport (CLT) using various performance measurement metrics. Based on the taxi time prediction results, we also discuss how the prediction accuracy can be affected by the operational complexity at this airport and how we can improve the fast time simulation model before implementing it with an airport scheduling algorithm in a real-time environment.

airport surface traffic↗

Sensor Data Quality and Angular Rate Down-Selection Algorithms on SLS EM-1

The NASA Space Launch System Block 1 launch vehicle is equipped with an Inertial Navigation System (INS) and multiple Rate Gyro Assemblies (RGA) that are used in the Guidance, Navigation, and Control (GN&C) algorithms. The INS provides the inertial position, velocity, and attitude of the vehicle along with both angular rate and specific force measurements. Additionally, multiple sets of co-located rate gyros supply angular rate data. The collection of angular rate data, taken along the launch vehicle, is used to separate out vehicle motion from flexible body dynamics. Since the system architecture uses redundant sensors, the capability was developed to evaluate the health (or validity) of the independent measurements. A suite of Sensor Data Quality (SDQ) algorithms is responsible for assessing the angular rate data from the redundant sensors. When failures are detected, SDQ will take the appropriate action and disqualify or remove faulted sensors from forward processing. Additionally, the SDQ algorithms contain logic for down-selecting the angular rate data used by the GNC software from the set of healthy measurements. This paper explores the trades and analyses that were performed in selecting a set of robust fault-detection algorithms included in the GN&C flight software. These trades included both an assessment of hardware-provided health and status data as well as an evaluation of different algorithms based on time-to-detection, type of failures detected, and probability of detecting false positives. We then provide an overview of the algorithms used for both fault-detection and measurement down selection. We next discuss the role of trajectory design, flexible-body models, and vehicle response to off-nominal conditions in setting the detection thresholds. Lastly, we present lessons learned from software integration and hardware-in-the-loop testing.

Park, Thomas↗

SU-E-J-252: A Motion Algorithm to Extract Physical and Motion Parameters of a Mobile Target in Cone-Beam Computed Tomographic Imaging Retrospective to Image Reconstruction

Purpose: A motion algorithm was developed to extract actual length, CT-numbers and motion amplitude of a mobile target imaged with cone-beam-CT (CBCT) retrospective to image-reconstruction. Methods: The motion model considered a mobile target moving with a sinusoidal motion and employed three measurable parameters: apparent length, CT number level and gradient of a mobile target obtained from CBCT images to extract information about the actual length and CT number value of the stationary target and motion amplitude. The algorithm was verified experimentally with a mobile phantom setup that has three targets with different sizes manufactured from homogenous tissue-equivalent gel material embedded into a thorax phantom. The phantom moved sinusoidal in one-direction using eight amplitudes (0–20mm) and a frequency of 15-cycles-per-minute. The model required imaging parameters such as slice thickness, imaging time. Results: This motion algorithm extracted three unknown parameters: length of the target, CT-number-level, motion amplitude for a mobile target retrospective to CBCT image reconstruction. The algorithm relates three unknown parameters to measurable apparent length, CT-number-level and gradient for well-defined mobile targets obtained from CBCT images. The motion model agreed with measured apparent lengths which were dependent on actual length of the target and motion amplitude. The cumulative CT-number for a mobile target was dependent on CT-number-level of the stationary target and motion amplitude. The gradient of the CT-distribution of mobile target is dependent on the stationary CT-number-level, actual target length along the direction of motion, and motion amplitude. Motion frequency and phase did not affect the elongation and CT-number distributions of mobile targets when imaging time included several motion cycles. Conclusion: The motion algorithm developed in this study has potential applications in diagnostic CT imaging and radiotherapy to extract actual length, size and CT-numbers distorted by motion in CBCT imaging. The model provides further information about motion of the target.

60 APPLIED LIFE SCIENCES↗

ARM Data Integrator

The Atmospheric Radiation Measurement (ARM) Data Integrator (ADI) streamlines the development of scientific algorithms and analysis of time-series NetCDF data, and improves the content and consistency of the output data products produced by these algorithms. The framework automates the process of retrieving and preparing data for analysis, and allows users to design output data products through a graphical interface. It also provides a modular, flexible software development architecture that scientists can use to generate C, Python, and IDL source code templates that embed the pre and post processing logic allowing the scientist to focus on only their science. The input data, preprocessing, and output data specifications of algorithms are defined through a graphical interface and stored in a database. ADI implements workflow for data integration and supports user access to data through a library of software modules. Data preprocess capabilities supported include automated retrieval of data from input files, merging the retrieved data into appropriately sized chunks, and transformation of the data onto a common coordinate system grid. Through the graphical interface, users can view the details of both their data products and those in the ARM catalog and allows developers to use existing data product to build new data products. Views of the output data products include an overlay of how the design meets ARM archive's data standards providing the user with a visual cue indicating where their output violates an archive standard. The ADI libraries access the information provided through the GUI via a Postgres database. The ADI framework and its supporting components can significantly decrease the time and cost of implementing scientific algorithms while improving the ability of scientists to disseminate their results.

Source record↗

ARM Data Integrator

The Atmospheric Radiation Measurement (ARM) Data Integrator (ADI) streamlines the development of scientific algorithms and analysis of time-series NetCDF data, and improves the content and consistency of the output data products produced by these algorithms. The framework automates the process of retrieving and preparing data for analysis, and allows users to design output data products through a graphical interface. It also provides a modular, flexible software development architecture that scientists can use to generate C, Python, and IDL source code templates that embed the pre and post processing logic allowing the scientist to focus on only their science. The input data, preprocessing, and output data specifications of algorithms are defined through a graphical interface and stored in a database. ADI implements workflow for data integration and supports user access to data through a library of software modules. Data preprocess capabilities supported include automated retrieval of data from input files, merging the retrieved data into appropriately sized chunks, and transformation of the data onto a common coordinate system grid. Through the graphical interface, users can view the details of both their data products and those in the ARM catalog and allows developers to use existing data product to build new data products. Views of the output data products include an overlay of how the design meets ARM archive's data standards providing the user with a visual cue indicating where their output violates an archive standard. The ADI libraries access the information provided through the GUI via a Postgres database. The ADI framework and its supporting components can significantly decrease the time and cost of implementing scientific algorithms while improving the ability of scientists to disseminate their results.

Source record↗