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 955 records · Page 53

Counterrotating prop-fan simulations which feature a relative-motion multiblock grid decomposition enabling arbitrary time-steps

Improvements are presented of a computer algorithm developed for the time-accurate flow analysis of rotating machines. The flow model is a finite volume method utilizing a high-resolution approximate Riemann solver for interface flux definitions. The numerical scheme is a block LU implicit iterative-refinement method which possesses apparent unconditional stability. Multiblock composite gridding is used to orderly partition the field into a specified arrangement of blocks exhibiting varying degrees of similarity. Block-block relative motion is achieved using local grid distortion to reduce grid skewness and accommodate arbitrary time step selection. A general high-order numerical scheme is applied to satisfy the geometric conservation law. An even-blade-count counterrotating unducted fan configuration is chosen for a computational study comparing solutions resulting from altering parameters such as time step size and iteration count. The solutions are compared with measured data.

Janus, J. Mark↗

Scheduling time-critical graphics on multiple processors

This paper describes an algorithm for the scheduling of time-critical rendering and computation tasks on single- and multiple-processor architectures, with minimal pipelining. It was developed to manage scientific visualization scenes consisting of hundreds of objects, each of which can be computed and displayed at thousands of possible resolution levels. The algorithm generates the time-critical schedule using progressive-refinement techniques; it always returns a feasible schedule and, when allowed to run to completion, produces a near-optimal schedule which takes advantage of almost the entire multiple-processor system.

Meyer, Tom W.↗

Heuristic-based scheduling algorithm for high level synthesis

A new scheduling algorithm is proposed which uses a combination of a resource utilization chart, a heuristic algorithm to estimate the minimum number of hardware units based on operator mobilities, and a list-scheduling technique to achieve fast and near optimal schedules. The schedule time of this algorithm is almost independent of the length of mobilities of operators as can be seen from the benchmark example (fifth order digital elliptical wave filter) presented when the cycle time was increased from 17 to 18 and then to 21 cycles. It is implemented in C on a SUN3/60 workstation.

Mohamed, Gulam↗

Exact and heuristic algorithms for minimizing Tardy/Lost penalties on a single-machine scheduling problem

This paper addresses minimizing Tardy/Lost penalties with common due dates on a single machine. According to this penalty criterion, if tardiness of a job exceeds a predefined value, the job will be lost and penalized by a fixed value. The problem is formulated as an integer programming model, and a heuristic algorithm is constructed. Then, using the proposed dominance rules and lower bounds, we develop two dynamic programming algorithms as well as a branch and bound. Experimental results show that the heuristic algorithm has an average optimality gap less than 2 % in all problem sizes. Instances up to 250 jobs with low variety of process times are optimally solved and for high process time varieties, the algorithms solved all instances up to 75 jobs.

97 MATHEMATICS AND COMPUTING↗

The Design and Evaluation of the Lighting Imaging Sensor Data Applications Display (LISDAD)

The design and evaluation of the Lightning Imaging Sensor Data Applications Display (LISDAD). The ultimate goal of the LISDAD system is to quantify the utility of total lightning information in short-term, severe-weather forecasting operations. To this end, scientists from NASA, NWS, and MIT organized an effort to study the relationship of lightning and severe-weather on a storm-by-storm, and even cell-by-cell basis for as many storms as possible near Melbourne, Florida. Melbourne was chosen as it offers a unique combination of high probability of severe weather and proximity to major relevant sensors - specifically: NASA's total lightning mapping system at Kennedy Space Center (the LDAR system at KSC); a NWS/NEXRAD radar (at Melbourne); and a prototype Integrated Terminal Weather System (ITWS, at Orlando), which obtains cloud-to-ground lightning Information from the National Lightning Detection Network (NLDN), and also uses NSSL's Severe Storm Algorithm (NSSL/SSAP) to obtain information about various storm-cell parameters. To assist in realizing this project's goal, an interactive, real-time data processing system (the LISDAD system) has been developed that supports both operational short-term weather forecasting and post facto severe-storm research. Suggestions have been drawn from the operational users (NWS/Melbourne) in the design of the data display and its salient behavior. The initial concept for the users Graphical Situation Display (GSD) was simply to overlay radar data with lightning data, but as the association between rapid upward trends in the total lightning rate and severe weather became evident, the display was significantly redesigned. The focus changed to support the display of time series of storm-parameter data and the automatic recognition of cells that display rapid changes in the total-lightning flash rate. The latter is calculated by grouping discrete LDAR radiation sources into lightning flashes using a time-space association algorithm. Specifically, the GSD presents the user with the Composite Maximum Reflectivity obtained from the NWS/NEXRAD. Superimposed upon this background image are placed small black circles indicating the locations of storm cells identified by the NSSL/SSA. The circles become cyan if lightning is detected within the storm-cell; if the cell has lightning rates indicative of a severe-storm, the circle turns red. This paper will: (1) review the design of LISDAD system; (2) present some examples of its data display; and shown results of the lightning based severe-weather prediction algorithm.

Boldi, B.↗

Small-angle Coulomb collision model for particle-in-cell simulations

We construct and investigate a set of stochastic differential equations that incorporate the physics of velocity-dependent small-angle Coulomb collisions among the plasma particles in a particle-in-cell simulation. Each particle is scattered stochastically from all the other particles in a simulation cell modeled as one or more Maxwellians. Total energy and momentum are conserved by linear transformation of the velocity increments. In two test simulations the proposed 'particle-moment' collision algorithm performs well with time steps as large as 10% of the relaxation time - far larger than a particle-pairing collision algorithm, in which pairs of particles are scattered from one another, requires to achieve the same accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Neural Generalized Predictive Control: A Newton-Raphson Implementation

An efficient implementation of Generalized Predictive Control using a multi-layer feedforward neural network as the plant's nonlinear model is presented. In using Newton-Raphson as the optimization algorithm, the number of iterations needed for convergence is significantly reduced from other techniques. The main cost of the Newton-Raphson algorithm is in the calculation of the Hessian, but even with this overhead the low iteration numbers make Newton-Raphson faster than other techniques and a viable algorithm for real-time control. This paper presents a detailed derivation of the Neural Generalized Predictive Control algorithm with Newton-Raphson as the minimization algorithm. Simulation results show convergence to a good solution within two iterations and timing data show that real-time control is possible. Comments about the algorithm's implementation are also included.

Soloway, Donald↗

Finding Fast Transients in Real Time Using a Novel Light-curve Analysis Algorithm

The current data acquisition rate of astronomical transient surveys and the promise for significantly higher rates in the next decade necessitate the development of novel approaches to analyze astronomical data sets and promptly detect objects of interest. The Deeper, Wider, Faster (DWF) program is a survey focused on the identification of fast-evolving transients, such as fast radio bursts, gamma-ray bursts, and supernova shock breakouts. It employs multifrequency simultaneous coverage of the same part of the sky over several orders of magnitude. Using the Dark Energy Camera mounted on the 4 m Blanco telescope, DWF captures a 20 s g -band exposure every minute, at a typical seeing of ~1'' and an air mass of ~1.5. These optical data are collected simultaneously with observations conducted over the entire electromagnetic spectrum—from radio to γ -rays—as well as cosmic-ray observations. In this paper, we present a novel real-time light-curve analysis algorithm, designed to detect transients in the DWF optical data; this algorithm functions independently from, or in conjunction with, image subtraction. We present a sample of fast transients detected by our algorithm, as well as a false-positive analysis. Our algorithm is customizable and can be tuned to be sensitive to transients evolving over different timescales and flux ranges.

79 ASTRONOMY AND ASTROPHYSICS↗

Real-time support for high performance aircraft operation

The feasibility of real-time processing schemes using artificial neural networks (ANNs) is investigated. A rationale for digital neural nets is presented and a general processor architecture for control applications is illustrated. Research results on ANN structures for real-time applications are given. Research results on ANN algorithms for real-time control are also shown.

Vidal, Jacques J.↗

An Efficient Area-Based Algorithm for SAR Radiometric Terrain Correction and Map Projection

This article presents a projection algorithm based on the representation of radar samples as area elements, rather than point elements as traditionally done in previous works. Each area element in the geographic grid (geogrid) is associated with a set of samples in the radar grid that intersect completely or partially the area element according to the topography and the radar geometry. Accurate geocoding with adaptive multi-looking is achieved by successively assigning the weighted average of the radar samples to the corresponding geogrid elements. Analogously, the slant-range projection of geocoded data is improved by projecting the geogrid pixels onto the radar grid according to their projected area. When our slant-range projection approach is used within previously-published radiometric terrain correction (RTC) algorithms, the processing time is significantly reduced, performing 3.6 to 5.2 times faster over multi-looked data and up to 8.9 over single-look data. We demonstrate the strength of the area projection algorithm for RTC and geocoding using UAVSAR and Sentinel-1 data, and evaluate the results in the context of the upcoming NISAR mission.

Shiroma, Gustavo H↗

Performance Evaluation of Distributed Energy Resource Management Algorithm in Large Distribution Networks

This paper presents performance evaluation of hierarchical optimization and control for distributed energy resource management system (DERMS) in large distribution networks via an advanced hardware-in-the-loop (HIL) platform. The HIL platform provides realistic testing in a laboratory envi-ronment, including the accurate modeling of a full-scale dis-tribution system of 11,000 nodes, the DERMS software con-troller, and 90 power hardware photovoltaics (PVs) and bat-tery inverters. The applied DERMS algorithm is designed based on a real-time optimal power flow algorithm and im-plemented with acceleration design that performs fast dis-patch of simulated PVs and real physical hardware DER devices every 4 seconds.

distributed energy management system (DERMS)↗

A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

36 MATERIALS SCIENCE↗

Anomaly Identification of Synchronized Voltage Waveform for Situational Awareness of Low Inertia Systems

Inverter-based resources (IBRs) such as photovoltaics (PVs), wind turbines, and battery energy storage systems (BESSs) are widely deployed in low-carbon power systems. However, these resources typically do not provide the inertia needed for grid stability, resulting in a low-inertia power system. IBRs and lack of inertia have been known to cause anomalies such as waveform distortions and wideband oscillations in power systems due to the limited inertia level, leading to increased generation trips and load shedding. Here, to achieve effective anomaly identification, this paper proposes a synchro-waveform-based algorithm utilizing real-time synchronized voltage waveform measurements from waveform measurement units (WMUs). In the proposed method, different physical characteristics, as well as statistical features, are extracted from synchronized voltage waveform measurements to filter anomalies. Then, the anomaly identification approach based on the random forest is developed and deployed into the FNET/GridEye system considering trade-offs among accuracy, computational burden, and deployment cost. Moreover, four WMUs are specially designed and deployed on Kauai Island to receive instantaneous synchronized voltage waveform measurements. To verify the performance of the proposed algorithm, different experiments are carried out with collected field test data. The result demonstrates that the performance of the proposed synchro-waveform-based anomaly categorization algorithm can accurately identify anomalies 95.35% of the time, which has comparable performance among benchmarking algorithms.

Situational awareness↗

Computationally efficient Bayesian estimation of graphical networks for omics data

Graphical networks are useful, widely-used modeling approaches to represent complex biological processes with biological measurements generated by platforms such as mass spectrometry. Bayesian analyses of graphical networks for omics data have several advantages over their frequentist counterparts, such as the inclusion of prior knowledge in the estimation of models. However, Bayesian approaches to date have only been feasible for data with a couple hundred biomolecules due to prohibitive computational time, but omics data often contains tens of thousands of biomolecules. Here, we present and illustrate a more computationally efficient approach named BPlane (Bayesian PseudoLikelihood-based Algorithm for Network Estimation) to extend Bayesian modeling capabilities for larger-sized datasets, such as most untargeted proteomics data. Via simulation, we demonstrate that BPlane produces substantial computational savings over a current state-of-the-art Bayesian algorithm while maintaining competitive edge detection accuracy. On a SARS-CoV2 proteomics data with 7000 proteins, the competing algorithm takes three times as long to complete the first iteration as BPlane takes to converge after over 100 iterations.

EM algorithm↗

A Novel Multiple-Time Scale Integrator for the Hybrid Monte Carlo Algorithm

Hybrid Monte Carlo simulations that implement the fermion action using multiple terms are commonly used. By the nature of their formulation they involve multiple integration time scales in the evolution of the system through simulation time. These different scales are usually dealt with by the Sexton-Weingarten nested leapfrog integrator. In this scheme the choice of time scales is somewhat restricted as each time step must be an exact multiple of the next smallest scale in the sequence. A novel generalisation of the nested leapfrog integrator is introduced which allows for far greater flexibility in the choice of time scales, as each scale now must only be an exact multiple of the smallest step size.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Real-time soft tissue motion estimation for lung tumors during radiotherapy delivery

Purpose: To provide real-time lung tumor motion estimation during radiotherapy treatment delivery without the need for implanted fiducial markers or additional imaging dose to the patient.Methods: 2D radiographs from the therapy beam's-eye-view (BEV) perspective are captured at a frame rate of 12.8 Hz with a frame grabber allowing direct RAM access to the image buffer. An in-house developed real-time soft tissue localization algorithm is utilized to calculate soft tissue displacement from these images in real-time. The system is tested with a Varian TX linear accelerator and an AS-1000 amorphous silicon electronic portal imaging device operating at a resolution of 512 × 384 pixels. The accuracy of the motion estimation is verified with a dynamic motion phantom. Clinical accuracy was tested on lung SBRT images acquired at 2 fps.Results: Real-time lung tumor motion estimation from BEV images without fiducial markers is successfully demonstrated. For the phantom study, a mean tracking error <1.0 mm [root mean square (rms) error of 0.3 mm] was observed. The tracking rms accuracy on BEV images from a lung SBRT patient (≈20 mm tumor motion range) is 1.0 mm.Conclusions: The authors demonstrate for the first time real-time markerless lung tumor motion estimation from BEV images alone. The described system can operate at a frame rate of 12.8 Hz and does not require prior knowledge to establish traceable landmarks for tracking on the fly. The authors show that the geometric accuracy is similar to (or better than) previously published markerless algorithms not operating in real-time.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Privacy-preserving Average Consensus Algorithm with Beaver Triple

A privacy-preserving average consensus algorithm is designed based on the Beaver triple technique against passive adversaries. The Beaver triple technique is integrated into a restructure of the discrete-time average consensus algorithm to preserve the privacy of initial values of agents in a multiagent system. The performance of the algorithm is theoretically analyzed.

Wang, Peng [Shanghai Jiao Tong University, China]↗

The Real Time Display Builder (RTDB)

The Real Time Display Builder (RTDB) is a prototype interactive graphics tool that builds logic-driven displays. These displays reflect current system status, implement fault detection algorithms in real time, and incorporate the operational knowledge of experienced flight controllers. RTDB utilizes an object-oriented approach that integrates the display symbols with the underlying operational logic. This approach allows the user to specify the screen layout and the driving logic as the display is being built. RTDB is being developed under UNIX in C utilizing the MASSCOMP graphics environment with appropriate functional separation to ease portability to other graphics environments. RTDB grew from the need to develop customized real-time data-driven Space Shuttle systems displays. One display, using initial functionality of the tool, was operational during the orbit phase of STS-26 Discovery. RTDB is being used to produce subsequent displays for the Real Time Data System project currently under development within the Mission Operations Directorate at NASA/JSC. The features of the tool, its current state of development, and its applications are discussed.

Kindred, Erick D.↗