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 793 records · Page 44

Characteristics of a New X-Ray Imaging System for Interventional Procedures: Improved Image Quality and Reduced Radiation Dose

PurposeTo compare image quality and radiation exposure between a new angiographic imaging system and the preceding generation system during uterine artery embolization (UAE).Materials and MethodsIn this retrospective, IRB-approved two-arm study, 54 patients with symptomatic uterine fibroids were treated with UAE on two different angiographic imaging systems. The new system includes optimized acquisition parameters and real-time image processing algorithms. Air kerma (AK), dose area product (DAP) and acquisition time for digital fluoroscopy (DF) and digital subtraction angiography (DSA) were recorded. Body mass index was noted as well. DF image quality was assessed objectively by image noise measurements. DSA image quality was rated by two blinded, independent readers on a four-rank scale. Statistical differences were assessed with unpaired t tests and Wilcoxon rank-sum tests.ResultsThere was no significant difference between the patients treated on the new (n = 36) and the old system (n = 18) regarding age (p = 0.10), BMI (p = 0.18), DF time (p = 0.35) and DSA time (p = 0.17). The new system significantly reduced the cumulative AK and DAP by 64 and 72%, respectively (median 0.58 Gy and 145.9 Gy*cm{sup 2} vs. 1.62 Gy and 526.8 Gy*cm{sup 2}, p < 0.01 for both). Specifically, DAP for DF and DSA decreased by 59% (75.3 vs. 181.9 Gy*cm{sup 2}, p < 0.01) and 78% (67.6 vs. 312.2 Gy*cm{sup 2}, p < 0.01), respectively. The new system achieved a significant decrease in DF image noise (p < 0.01) and a significantly better DSA image quality (p < 0.01).ConclusionsThe new angiographic imaging system significantly improved image quality and reduced radiation exposure during UAE procedures.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Comparison of seven performance measures in a time-delayed manipulation task

Real-time performance data was collected during a pick-up task carried out with a Rancho master-slave manipulator using a minicomputer-based data taker. In addition to the usual task-time measurements, computer algorithms to integrate the energy consumed and to count and time the number of moves were implemented. In addition to these measures, several derived measures such as the fraction of time moving (MRATIO) and mean time per move (MBAR) were obtained in an off-line analysis. Preliminary results of the time delay experiment indicate that two new measures, MRATIO and MBAR, are almost an order of magnitude more sensitive than task time, the conventional measure, in determining performance changes with transmission delays in the range from 0.0 to 1.0s.

Hill, J. W.↗

Adaptive Load-Balancing Algorithms using Symmetric Broadcast Networks

In a distributed computing environment, it is important to ensure that the processor workloads are adequately balanced, Among numerous load-balancing algorithms, a unique approach due to Das and Prasad defines a symmetric broadcast network (SBN) that provides a robust communication pattern among the processors in a topology-independent manner. In this paper, we propose and analyze three efficient SBN-based dynamic load-balancing algorithms, and implement them on an SGI Origin2000. A thorough experimental study with Poisson distributed synthetic loads demonstrates that our algorithms are effective in balancing system load. By optimizing completion time and idle time, the proposed algorithms are shown to compare favorably with several existing approaches.

Das, Sajal K.↗

An Advanced Synchronized Time Digital Grid Twin Testbed for Relay Misoperation Analysis of Electrical Fault Type Detection Algorithms

Distributed energy resources and the number of relays are expected to rise in modern electrical grids; consequently, relay misoperations are also expected to grow. Relays can detect electrical fault types using an internal algorithm and can display the result using light indicators on the front of the relay. However, some relays’ internal algorithms for predicting types of electrical faults could be improved. This study assesses a relay’s external and internal algorithms with an Advanced Synchronized Time Digital Grid Twin (ASTDGT) testbed with paired relays. A misoperation relay analysis focused on measuring the accuracy of using the boundary admittance (the external algorithm) versus the set-default (the internal algorithm) relay method to determine the electrical fault types was performed. In this study, the internal and external relay algorithms were assessed with a synchronized time digital grid twin testbed using a real-time simulator. This testbed evaluated two sets of logic at the same time with the digital grid twin and paired relays in the loop. Different types of electrical faults were simulated, and the relays’ recorded events and electrical fault light indicator states were collected from the human–machine interfaces. This ASTDGT testbed with paired relays successfully evaluated the relay algorithm misoperations. The boundary admittance method had an accuracy of 100% for line-to-line, line-to-ground, and line-to-line ground faults.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Use of common time base for checkpointing and rollback recovery in a distributed system

An approach to checkpointing and rollback recovery in a distributed computing system using a common time base is proposed. A common time base is established in the system using a hardware clock synchronization algorithm. This common time base is coupled with the idea of pseudo-recovery points to develop a checkpointing algorithm that has the following advantages: reduced wait for commitment for establishing recovery lines, fewer messages to be exchanged, and less memory requirement. These advantages are assessed quantitatively by developing a probabilistic model.

Ramanathan, Parameswaran↗

Dynamical approach study of spurious steady-state numerical solutions of nonlinear differential equations. I - The dynamics of time discretization and its implications for algorithm development in computational fluid dynamics

Spurious stable as well as unstable steady state numerical solutions, spurious asymptotic numerical solutions of higher period, and even stable chaotic behavior can occur when finite difference methods are used to solve nonlinear differential equations (DE) numerically. The occurrence of spurious asymptotes is independent of whether the DE possesses a unique steady state or has additional periodic solutions and/or exhibits chaotic phenomena. The form of the nonlinear DEs and the type of numerical schemes are the determining factor. In addition, the occurrence of spurious steady states is not restricted to the time steps that are beyond the linearized stability limit of the scheme. In many instances, it can occur below the linearized stability limit. Therefore, it is essential for practitioners in computational sciences to be knowledgeable about the dynamical behavior of finite difference methods for nonlinear scalar DEs before the actual application of these methods to practical computations. It is also important to change the traditional way of thinking and practices when dealing with genuinely nonlinear problems. In the past, spurious asymptotes were observed in numerical computations but tended to be ignored because they all were assumed to lie beyond the linearized stability limits of the time step parameter delta t. As can be seen from the study, bifurcations to and from spurious asymptotic solutions and transitions to computational instability not only are highly scheme dependent and problem dependent, but also initial data and boundary condition dependent, and not limited to time steps that are beyond the linearized stability limit.

Yee, H. C.↗

Space–time reduced order model for large-scale linear dynamical systems with application to Boltzmann transport problems

A classical reduced order model for dynamical problems involves spatial reduction of the problem size. However, temporal reduction accompanied by the spatial reduction can further reduce the problem size without losing much accuracy, which results in a considerably more speed-up than the spatial reduction only. Recently, a novel space–time reduced order model for dynamical problems has been developed [17], where the space–time reduced order model shows an order of a hundred speed-up with a relative error of 10 –4 for small academic problems. However, in order for the method to be applicable to a large-scale problem, an efficient space–time reduced basis construction algorithm needs to be developed. Here we present the incremental space–time reduced basis construction algorithm. The incremental algorithm is fully parallel and scalable. Additionally, the block structure in the space–time reduced basis is exploited, which enables the avoidance of constructing the reduced space–time basis. These novel techniques are applied to a large-scale particle transport simulation with million and billion degrees of freedom. The numerical example shows that the algorithm is scalable and practical. Also, it achieves a tremendous speed-up, maintaining a good accuracy. Finally, error bounds for space-only and space–time reduced order models are derived.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Accuracy versus run time in an adiabatic quantum search

Adiabatic quantum algorithms are characterized by their run time and accuracy. The relation between the two is essential for quantifying adiabatic algorithmic performance yet is often poorly understood. We study the dynamics of a continuous time, adiabatic quantum search algorithm and find rigorous results relating the accuracy and the run time. Proceeding with estimates, we show that under fairly general circumstances the adiabatic algorithmic error exhibits a behavior with two discernible regimes: The error decreases exponentially for short times and then decreases polynomially for longer times. We show that the well-known quadratic speedup over classical search is associated only with the exponential error regime. We illustrate the results through examples of evolution paths derived by minimization of the adiabatic error. We also discuss specific strategies for controlling the adiabatic error and run time.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Temporal parallelization of edge plasma simulations using the parareal algorithm and the SOLPS code

We show that numerical modelling of edge plasma physics may be successfully parallelized in time. The parareal algorithm has been employed for this purpose and the SOLPS code package coupling the B2.5 finite-volume fluid plasma solver with the kinetic Monte-Carlo neutral code Eirene has been used as a test bed. The complex dynamics of the plasma and neutrals in the scrape-off layer (SOL) region makes this a unique application. It is demonstrated that a significant computational gain (more than an order of magnitude) may be obtained with this technique. The use of the IPS framework for event-based parareal implementation optimizes resource utilization and has been shown to significantly contribute to the computational gain.

97 MATHEMATICS AND COMPUTING↗

Real-time combined heat and power operational strategy using a hierarchical optimization algorithm

Existing attempts to optimize the operation of combined heat and power (CHP) systems for building applications have two major limitations: the electrical and thermal loads are obtained from historical weather profiles; and the CHP system models ignore transient responses by using constant equipment efficiencies. This article considers the transient response of a building combined with a hierarchical CHP optimal control algorithm to obtain a real-time integrated system that uses the most recent weather and electric load information. This is accomplished by running concurrent simulations of two transient building models. The first transient building model uses current as well as forecast input information to obtain short-term predictions of the thermal and electric building loads. The predictions are then used by an optimization algorithm (i.e. a hierarchical controller that decides the amount of fuel and of electrical energy to be allocated at the current time step). In a simulation, the actual physical building is not available and, hence, to simulate a real-time environment, a second, building model with similar but not identical input loads are used to represent the actual building. A state-variable feedback loop is completed at the beginning of each time step by copying (i.e. measuring, the state variable from the actual building and restarting the predictive model using these ‘measured’ values as initial conditions). The simulation environment presented in this article features non-linear effects such as the dependence of the heat exchanger effectiveness on their operating conditions. Finally, the results indicate that the CHP engine operation dictated by the proposed hierarchical controller with uncertain weather conditions has the potential to yield significant savings when compared with conventional systems using current values of electricity and fuel prices.

42 ENGINEERING↗

Real-time flutter analysis

The important algorithm issues necessary to achieve a real time flutter monitoring system; namely, the guidelines for choosing appropriate model forms, reduction of the parameter convergence transient, handling multiple modes, the effect of over parameterization, and estimate accuracy predictions, both online and for experiment design are addressed. An approach for efficiently computing continuous-time flutter parameter Cramer-Rao estimate error bounds were developed. This enables a convincing comparison of theoretical and simulation results, as well as offline studies in preparation for a flight test. Theoretical predictions, simulation and flight test results from the NASA Drones for Aerodynamic and Structural Test (DAST) Program are compared.

Walker, R.↗

Mapping agroecological zones and time lag in vegetation growth by means of Fourier analysis of time series of NDVI images

Examples are presented of applications of a fast Fourier transform algorithm to analyze time series of images of Normalized Difference Vegetation Index values. The results obtained for a case study on Zambia indicated that differences in vegetation development among map units of an existing agroclimatic map were not significant, while reliable differences were observed among the map units obtained using the Fourier analysis.

Menenti, M.↗

Validation of Microgrid Algorithms using At-Scale Simulation and Emulation Real-Time (ASSERT) Framework

This paper presents a novel framework for validating microgrid algorithms using a At-Scale Simulation and Emulation Real-Time (ASSERT) setup. The proposed universal microgrid validation framework was developed at Advanced Research on Integrated Energy Systems (ARIES) platform at National Renewable Energy Laboratory in Golden, Colorado, USA. As the number of intercommunicating devices grow in power systems, along with more integration of inverter-based resources, developing and validating microgrid operation and control algorithms is becoming complex and time-consuming task. The ASSERT framework is designed to provide a comprehensive, accurate, and efficient solution for validating microgrid algorithms. It combines at-scale simulations and real-time emulation to create a virtual environment that closely mimics the behavior of a physical microgrids which are characteristic of future smart distribution systems, such as: (1) increasing variability in the physical size of new energy technologies; (2) requiring control large numbers of interconnected devices, and (3) integrating diverse technologies that have not previously worked together. The paper describes the technical details of the ASSERT framework, its validation process, and its benefits over traditional validation methods. The framework's ability to validate the performance of various algorithms is demonstrated through a case study, which shows that it can effectively identify the weaknesses of an algorithm and optimize its performance. Overall, the ASSERT framework is a promising tool that can significantly enhance the development and validation of microgrid algorithms, leading to more reliable and efficient microgrid operation.

at-scale↗

Scheduling Tasks In Parallel Processing

Algorithms sought to minimize time and cost of computation. Report describes research on scheduling of computations tasks in system of multiple identical data processors operating in parallel. Computational intractability requires use of suboptimal heuristic algorithms. First algorithm called "list heuristic", variation of classical list scheduling. Second algorithm called "cluster heuristic" applied to tightly coupled tasks and consists of four phases. Third algorithm called "exchange heuristic", iterative-improvement algorithm beginning with initial feasible assignment of tasks to processors and periods of time. Fourth algorithm is iterative one for optimal assignment of tasks and based on concept called "simulated annealing" because of mathematical resemblance to aspects of physical annealing processes.

Price, Camille C.↗

Development of ML FPGA Filter for Particle Identification and Tracking in Real Time

Real-time data processing is a frontier field in experimental particle physics. Machine Learning methods are widely used and have proven to be very powerful in particle physics. The growing computational power of modern FPGA boards allows us to add more sophisticated algorithms for real time data processing. Many tasks could be solved using modern Machine Learning (ML) algorithms which are naturally suited for FPGA architectures. The FPGA-based machine learning algorithm provides an extremely low, sub-microsecond, latency decision and makes information-rich data sets for event selection. We report work has started to evaluate an FPGA based Machine Learning (ML) algorithm for a real-time particle identification and tracking with Transition Radiation Detector (TRD) and e/m calorimeter. The first target is the GlueX experiment, with a plan to build a TRD based on GEM technology. GlueX trigger latency is 3.3 μs.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Xopt and Badger: a machine learning ecosystem for real-time accelerator control and optimization

Machine learning (ML)-based black-box optimization algorithms have demonstrated significant improvements in accelerator optimization speed, often by orders of magnitude. However, deploying these algorithms in real-time facility control remains challenging due to the specialized expertise and infrastructure required. To bridge this gap, we introduce the Xopt ecosystem, a versatile suite of tools designed to make advanced ML-based optimization accessible to the broader accelerator community. This ecosystem includes Xopt, a modular Python framework that facilitates the integration of ML-based optimization algorithms with arbitrary control problems, and Badger, a graphical user interface built on top of Xopt, which enables seamless deployment of ML algorithms in real-time control systems. The Xopt ecosystem has been successfully applied towards solving challenging real-time control problems at leading international accelerator facilities, including SLAC, LBNL, Argonne, Fermilab, BNL, DESY, and ESRF, demonstrating its effectiveness in real-world optimization tasks. In this presentation, we provide an overview of Xopt’s capabilities and illustrate its impact through case studies from SLAC accelerator facilities including LCLS, LCLS-II, and FACET-II.

Roussel, Ryan [SLAC]↗

Framework and algorithms for illustrative visualizations of time-varying flows on unstructured meshes

Photo- and physically realistic techniques are often insufficient for visualization of fluid flow simulations, especially for 3D and time-varying studies. Substantial research effort has been dedicated to the development of non-photorealistic and illustration-inspired visualization techniques for compact and intuitive presentation of such complex datasets. However, a great deal of work has been reproduced in this field, as many research groups have developed specialized visualization software. Additionally, interoperability between illustrative visualization software is limited due to diverse processing and rendering architectures employed in different studies. In this investigation, a framework for illustrative visualization is proposed, and implemented in MarmotViz, a ParaView plug-in, enabling its use on a variety of computing platforms with various data file formats and mesh geometries. Region-of-interest identification and feature-tracking algorithms incorporated into this tool are described. Implementations of multiple illustrative effect algorithms are also presented to demonstrate the use and flexibility of this framework. Here, by providing an integrated framework for illustrative visualization of CFD data, MarmotViz can serve as a valuable asset for the interpretation of simulations of ever-growing scale.

42 ENGINEERING↗