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 469 records · Page 26

Development of a Near Real-Time Hail Damage Swath Identification Algorithm for Vegetation

Every year in the Midwest and Great Plains, widespread greenness forms in conjunction with the latter part of the spring-summer growing season. This prevalent greenness forms as a result of the high concentration of agricultural areas having their crops reach their maturity before the fall harvest. This time of year also coincides with an enhanced hail frequency for the Great Plains (Cintineo et al. 2012). These severe thunderstorms can bring damaging winds and large hail that can result in damage to the surface vegetation. The spatial extent of the damage can relatively small concentrated area or be a vast swath of damage that is visible from space. These large areas of damage have been well documented over the years. In the late 1960s aerial photography was used to evaluate crop damage caused by hail. As satellite remote sensing technology has evolved, the identification of these hail damage streaks has increased. Satellites have made it possible to view these streaks in additional spectrums. Parker et al. (2005) documented two streaks using the Moderate Resolution Imaging Spectroradiometer (MODIS) that occurred in South Dakota. He noted the potential impact that these streaks had on the surface temperature and associated surface fluxes that are impacted by a change in temperature. Gallo et al. (2012) examined at the correlation between radar signatures and ground observations from storms that produced a hail damage swath in Central Iowa also using MODIS. Finally, Molthan et al. (2013) identified hail damage streaks through MODIS, Landsat-7, and SPOT observations of different resolutions for the development of a potential near-real time applications. The manual analysis of hail damage streaks in satellite imagery is both tedious and time consuming, and may be inconsistent from event to event. This study focuses on development of an objective and automatic algorithm to detect these areas of damage in a more efficient and timely manner. This study utilizes the MODIS sensor aboard the NASA Aqua satellite. Aqua was chosen due to an afternoon orbit over the United States when land surface temperatures are relatively warm and improve the contrast between damaged and undamaged areas. This orbit is also similar to the orbit of the Suomi-National Polar-orbiting Partnership (NPP) satellite. The Suomi NPP satellite hosts the Visible Infrared Imaging Radiometer Suite (VIIRS) instrument, which is the next generation of a MODIS-like sensor in polar orbit.

MODIS VIIRS↗

An averaging analysis of discrete-time indirect adaptive control

An averaging analysis of indirect, discrete-time, adaptive control systems is presented. The analysis results in a signal-dependent stability condition and accounts for unmodeled plant dynamics as well as exogenous disturbances. This analysis is applied to two discrete-time adaptive algorithms: an unnormalized gradient algorithm and a recursive least-squares (RLS) algorithm with resetting. Since linearization and averaging are used for the gradient analysis, a local stability result valid for small adaptation gains is found. For RLS with resetting, the assumption is that there is a long time between resets. The results for the two algorithms are virtually identical, emphasizing their similarities in adaptive control.

Phillips, Stephen M.↗

Two-tier model reduction of viscoelastically damped finite element models

Transient simulations of linear viscoelastically damped structures necessitate critical computational resources to directly integrate the full-order finite element model with time-stepping algorithms. Traditional modal reduction techniques are not directly applicable to these systems since viscoelastic materials depend on time and frequency. A more appropriate reduction basis is obtained from the nonlinear, complex eigenvalue problem, whose eigenvectors capture the appropriate kinematics and enable frequency-based mode selection; unfortunately, the computational cost is prohibitive for computing these modes from large-scale engineering models. To address this shortcoming, this work proposes a novel two-tier reduction procedure to reduce the upfront cost of solving the complex, nonlinear eigenvalue problem. The first reduction step reduces the full-order model with real mode shapes linearized about various centering frequencies to capture the kinematics over a full range of viscoelastic material behavior (glassy, rubbery, and glass-transition zones). This tier-one reduction preserves time-temperature superposition and allows the equations to depend parametrically on operating temperature. The second-level reduction then solves the complex, nonlinear eigenmode solutions in the tier-one reduced space about a fixed temperature to further reduce the equations-of-motion. The method is demonstrated on a cantilevered sandwich plate to display its accuracy and efficiency in comparison to full-order model predictions.

97 MATHEMATICS AND COMPUTING↗

Time domain simulation of the response of geometrically nonlinear panels subjected to random loading

The response of composite panels subjected to random pressure loads large enough to cause geometrically nonlinear responses is studied. A time domain simulation is employed to solve the equations of motion. An adaptive time stepping algorithm is employed to minimize intermittent transients. A modified algorithm for the prediction of response spectral density is presented which predicts smooth spectral peaks for discrete time histories. Results are presented for a number of input pressure levels and damping coefficients. Response distributions are calculated and compared with the analytical solution of the Fokker-Planck equations. RMS response is reported as a function of input pressure level and damping coefficient. Spectral densities are calculated for a number of examples.

Moyer, E. Thomas, Jr.↗

Measuring the Loschmidt Amplitude for Finite-Energy Properties of the Fermi-Hubbard Model on an Ion-Trap Quantum Computer

Calculating the equilibrium properties of condensed-matter systems is one of the promising applications of near-term quantum computing. Recently, hybrid quantum-classical time-series algorithms have been proposed to efficiently extract these properties from a measurement of the Loschmidt amplitude ⟨ ψ | e − i H ^ t | ψ ⟩ from initial states | ψ ⟩ and a time evolution under the Hamiltonian H ^ up to short times t . In this work, we study the operation of this algorithm on a present-day quantum computer. Specifically, we measure the Loschmidt amplitude for the Fermi-Hubbard model on a 16 -site ladder geometry (32 orbitals) on the Quantinuum H2-1 trapped-ion device. We assess the effect of noise on the Loschmidt amplitude and implement algorithm-specific error-mitigation techniques. By using a thus-motivated error model, we numerically analyze the influence of noise on the full operation of the quantum-classical algorithm by measuring expectation values of local observables at finite energies. Finally, we estimate the resources needed for scaling up the algorithm. Published by the American Physical Society 2024

Physics↗

Parallel processing for digital picture comparison

In picture processing an important problem is to identify two digital pictures of the same scene taken under different lighting conditions. This kind of problem can be found in remote sensing, satellite signal processing and the related areas. The identification can be done by transforming the gray levels so that the gray level histograms of the two pictures are closely matched. The transformation problem can be solved by using the packing method. Researchers propose a VLSI architecture consisting of m x n processing elements with extensive parallel and pipelining computation capabilities to speed up the transformation with the time complexity 0(max(m,n)), where m and n are the numbers of the gray levels of the input picture and the reference picture respectively. If using uniprocessor and a dynamic programming algorithm, the time complexity will be 0(m(3)xn). The algorithm partition problem, as an important issue in VLSI design, is discussed. Verification of the proposed architecture is also given.

Cheng, H. D.↗

Intelligent Experiments through Real-Time AI: Fast Data Processing and Autonomous Detector Control for High-Energy Nuclear Experiments

The aim of this project is to develop software and hardware for fast real-time data processing and autonomous detector control and calibration for the sPHENIX and the future EIC experiments. Below summarizes Georgia Tech team efforts in the past year: 1. We developed a real-time clustering algorithm and FPGA-based pipeline architecture for processing fired pixel data from ALPIDE sensors in sPHENIX experiments. Our Columnar Clustering Co-Design introduces a hardware-aware, stream-friendly approach that segments pixel data by column pairs using a Column Pair Clustering (CPC) strategy, followed by Cluster Stitching to merge adjacent subclusters. Implemented in Vitis HLS, the pipeline comprises five stages—read-in, subclustering, stitching, analysis, and write-out—connected by tagged HLS streams with custom end-of-event signaling for robust synchronization. We designed a pipelined dataflow model optimized for throughput, low latency, and minimal buffering, enabling scalable clustering across events of arbitrary size. Our system maintains spatial precision via center-of-mass and shape key extraction and efficiently handles edge cases such as fragmented or nested clusters. Compared against DBSCAN in both software and hardware, our approach demonstrates competitive performance under FPGA constraints. 2. We also conducted a comprehensive algorithm-to-hardware co-design of connected component analysis tailored for sPHENIX experiments, focusing on real-time, low-latency processing using FPGAs and High-Level Synthesis (HLS). Starting from a Python-based particle tracking pipeline, the team translated the core logic—graph traversal via DFS and Union-Find—into an HLS-compatible C++ model, replacing dynamic memory and recursion with static arrays and pipelined control flow. The final design includes a fully streamed and dataflow-compatible Union-Find kernel optimized across five iterations, incorporating loop pipelining, array partitioning, AXI/FIFO interface tuning, and function flattening. Experimental results show up to 14.8× speedup over the CPU baseline, reducing per-graph latency to 1.58 μs and demonstrating strong resource efficiency with only ~7k LUTs and zero BRAM usage. The design maintains functional correctness against the Python reference using a Python-based C-simulation framework and Mean Squared Error metrics. This work validates the potential of HLS-driven FPGA designs for edge-level HEP data acquisition, laying a scalable foundation for future integration with real-time detector pipelines and multi-graph processing systems.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Preliminary Development and Evaluation of Lightning Jump Algorithms for the Real-Time Detection of Severe Weather

Previous studies have demonstrated that rapid increases in total lightning activity (intracloud + cloud-to-ground) are often observed tens of minutes in advance of the occurrence of severe weather at the ground. These rapid increases in lightning activity have been termed "lightning jumps." Herein, we document a positive correlation between lightning jumps and the manifestation of severe weather in thunderstorms occurring across the Tennessee Valley and Washington D.C. A total of 107 thunderstorms were examined in this study, with 69 of the 107 thunderstorms falling into the category of non-severe, and 38 into the category of severe. From the dataset of 69 isolated non-severe thunderstorms, an average peak 1 minute flash rate of 10 flashes/min was determined. A variety of severe thunderstorm types were examined for this study including an MCS, MCV, tornadic outer rainbands of tropical remnants, supercells, and pulse severe thunderstorms. Of the 107 thunderstorms, 85 thunderstorms (47 non-severe, 38 severe) from the Tennessee Valley and Washington D.C tested 6 lightning jump algorithm configurations (Gatlin, Gatlin 45, 2(sigma), 3(sigma), Threshold 10, and Threshold 8). Performance metrics for each algorithm were then calculated, yielding encouraging results from the limited sample of 85 thunderstorms. The 2(sigma) lightning jump algorithm had a high probability of detection (POD; 87%), a modest false alarm rate (FAR; 33%), and a solid Heidke Skill Score (HSS; 0.75). A second and more simplistic lightning jump algorithm named the Threshold 8 lightning jump algorithm also shows promise, with a POD of 81% and a FAR of 41%. Average lead times to severe weather occurrence for these two algorithms were 23 minutes and 20 minutes, respectively. The overall goal of this study is to advance the development of an operationally-applicable jump algorithm that can be used with either total lightning observations made from the ground, or in the near future from space using the GOES-R Geostationary Lightning Mapper.

Schultz, Christopher J.↗

Execution time supports for adaptive scientific algorithms on distributed memory machines

Optimizations are considered that are required for efficient execution of code segments that consists of loops over distributed data structures. The PARTI (Parallel Automated Runtime Toolkit at ICASE) execution time primitives are designed to carry out these optimizations and can be used to implement a wide range of scientific algorithms on distributed memory machines. These primitives allow the user to control array mappings in a way that gives an appearance of shared memory. Computations can be based on a global index set. Primitives are used to carry out gather and scatter operations on distributed arrays. Communications patterns are derived at runtime, and the appropriate send and receive messages are automatically generated.

Berryman, Harry↗

The Athena++ Adaptive Mesh Refinement Framework: Design and Magnetohydrodynamic Solvers

The design and implementation of a new framework for adaptive mesh refinement calculations are described. It is intended primarily for applications in astrophysical fluid dynamics, but its flexible and modular design enables its use for a wide variety of physics. The framework works with both uniform and nonuniform grids in Cartesian and curvilinear coordinate systems. It adopts a dynamic execution model based on a simple design called a "task list" that improves parallel performance by overlapping communication and computation, simplifies the inclusion of a diverse range of physics, and even enables multiphysics models involving different physics in different regions of the calculation. We describe physics modules implemented in this framework for both nonrelativistic and relativistic magnetohydrodynamics (MHD). These modules adopt mature and robust algorithms originally developed for the Athena MHD code and incorporate new extensions: support for curvilinear coordinates, higher-order time integrators, more realistic physics such as a general equation of state, and diffusion terms that can be integrated with super-time-stepping algorithms. The modules show excellent performance and scaling, with well over 80% parallel efficiency on over half a million threads. The source code has been made publicly available.

79 ASTRONOMY AND ASTROPHYSICS↗

Energy management of three-dimensional minimum-time intercept

A real-time computer algorithm to control and optimize aircraft flight profiles is described and applied to a three-dimensional minimum-time intercept mission. The proposed scheme has roots in two well known techniques: singular perturbations and neighboring-optimal guidance. Use of singular-perturbation ideas is made in terms of the assumed trajectory-family structure. A heading/energy family of prestored point-mass-model state-Euler solutions is used as the baseline in this scheme. The next step is to generate a near-optimal guidance law that will transfer the aircraft to the vicinity of this reference family. The control commands fed to the autopilot (bank angle and load factor) consist of the reference controls plus correction terms which are linear combinations of the altitude and path-angle deviations from reference values, weighted by a set of precalculated gains. In this respect the proposed scheme resembles neighboring-optimal guidance. However, in contrast to the neighboring-optimal guidance scheme, the reference control and state variables as well as the feedback gains are stored as functions of energy and heading in the present approach. Some numerical results comparing open-loop optimal and approximate feedback solutions are presented.

Kelley, H. J.↗

Bayesian Blocks: A New Method to Analyze Photon Counting Data

A Bayesian analysis of photon-counting data leads to a new time-domain algorithm for detecting localized structures (bursts), revealing pulse shapes, and generally characterizing intensity variations. The raw counting data -- time-tag events (TTE), time-to-spill (TTS) data, or binned counts -- is converted to a maximum likelihood segmentation of the observation into time intervals during which the photon arrival rate is perceptibly constant -- i.e. has a fixed intensity without statistically significant variations. The resulting structures, Bayesian Blocks, can be thought of as bins with arbitrary spacing determined by the data. The method itself sets no lower limit to the time scale on which variability can be detected. We have applied the method to RXTE data on Cyg X-1, yielding information on this source's short-time-scale variability.

Scargle, Jeffrey D.↗

SpaceCube 2.0: An Advanced Hybrid Onboard Data Processor

The SpaceCube 2.0 is a compact, high performance, low-power onboard processing system that takes advantage of cutting-edge hybrid (CPU/FPGA/DSP) processing elements. The SpaceCube 2.0 design concept includes two commercial Virtex-5 field-programmable gate array (FPGA) parts protected by gradiation hardened by software" technology, and possesses exceptional size, weight, and power characteristics [5x5x7 in., 3.5 lb (approximately equal to 12.7 x 12.7 x 17.8 cm, 1.6 kg) 5-25 W, depending on the application fs required clock rate]. The two Virtex-5 FPGA parts are implemented in a unique back-toback configuration to maximize data transfer and computing performance. Draft computing power specifications for the SpaceCube 2.0 unit include four PowerPC 440s (1100 DMIPS each), 500+ DSP48Es (2x580 GMACS), 100+ LVDS high-speed serial I/Os (1.25 Gbps each), and 2x190 GFLOPS single-precision (65 GFLOPS double-precision) floating point performance. The SpaceCube 2.0 includes PROM memory for CPU boot, health and safety, and basic command and telemetry functionality; RAM memory for program execution; and FLASH/EEPROM memory to store algorithms and application code for the CPU, FPGA, and DSP processing elements. Program execution can be reconfigured in real time and algorithms can be updated, modified, and/or replaced at any point during the mission. Gigabit Ethernet, Spacewire, SATA and highspeed LVDS serial/parallel I/O channels are available for instrument/sensor data ingest, and mission-unique instrument interfaces can be accommodated using a compact PCI (cPCI) expansion card interface. The SpaceCube 2.0 can be utilized in NASA Earth Science, Helio/Astrophysics and Exploration missions, and Department of Defense satellites for onboard data processing. It can also be used in commercial communication and mapping satellites.

Lin, Michael↗

SU-E-J-60: Evaluation of Temporal Lag in Radiotherapy Gating for Tumor Motion Trajectories

Purpose: Evaluating timing differences between LINAC beam ON/OFF and the estimation of tumor positioning using gating systems is essential for establishing confidence when treating with gating during radiotherapy, and is an annual requirement of TG-142. Temporal discrepancies between the trajectories of external marker surrogates and beam delivery may vary depending upon the type of external marker motion, which is quantified in this work for several trajectories. Methods: A precise robotic 3D motion stage performed several trajectories typically used for gating phantoms, including sinusoidal and Lujan-type motion; a commercial respiratory motion simulator was also employed. The true motions were monitored using variable resistors. The beam ON/OFF was controlled separately by two RPM (Varian) systems, an integrated version delivered by a Varian Truebeam LINAC and version 1.6 delivered by a Varian Trilogy, and measured using a diode. The resistor and diode signals were read by a multichannel digital oscilloscope, and timing differences between beam ON/OFF as measured by the diode and the phantom motion were determined using a peak detection algorithm. Results: Timing differences between beam ON/OFF and 3D stage motion peaks (diode—true motion timing) were computed to be 79.4 & 57.7ms for sinusoidal motion and 109.1 & 63.6ms for Lujan-type motion on the Truebeam LINAC, for beam ON and OFF, respectively. Timing differences for the Trilogy LINAC were 34.4 & 55.2ms for the sinusoidal motion and 29.0 & 26.3ms for the Lujan-type motion, for beam ON and OFF, respectively. With the commercial motion simulator, the timing differences were found to be −9ms and −78ms for beam ON/OFF, respectively, with the Truebeam, and −97.6ms and −60.9ms for beam ON/OFF, respectively, with the Trilogy. Conclusion: Setup-dependent temporal lags were found using this methodology. These discrepancies have the potential to influence quality assurance on gating systems and ultimately the treatment dose during radiotherapy. NIH National Institute of Biomedical Imaging and Bioengineering grant T32 EB002103-21.

60 APPLIED LIFE SCIENCES↗

A high-order adaptive algorithm for multispecies gaseous flows on mapped domains

We report a fourth-order accurate finite-volume method is developed and verified for solving strongly nonlinear, time-dependent, compressible, thermally perfect, and multispecies gaseous flows on mapped grids that are adaptively refined in space and time. The algorithm introduces a new scheme for numerical flux calculations in order to cope with the nonlinear, spatially and temporally varying thermodynamic and transport properties of the gaseous mixture. The fourth-order numerical error convergence and solution accuracy are verified using Couette flow, species mass diffusion bubble, and vortex convection and diffusion problem. The thermally perfect, multispecies functionality is validated using a one-dimensional shock tube and two-dimensional shock box problem. Results are obtained for the Mach reflection problem where a strong shock propagates in the multispecies gaseous flow along a ramp and are compared to the solution of the shock propagation in a single species, calorically perfect, gaseous flow over the same ramp. The validated algorithm is then applied to simulate a relatively complex flow configuration to examine the secondary flow mixing due to the double air jets along with the main inlet where a premixed fuel mixture flows in. Future investigations will focus on three-dimensional configurations.

42 ENGINEERING↗

Harmonic analysis of spacecraft power systems using a personal computer

The effects that nonlinear devices such as ac/dc converters, HVDC transmission links, and motor drives have on spacecraft power systems are discussed. The nonsinusoidal currents, along with the corresponding voltages, are calculated by a harmonic power flow which decouples and solves for each harmonic component individually using an iterative Newton-Raphson algorithm. The sparsity of the harmonic equations and the overall Jacobian matrix is used to an advantage in terms of saving computer memory space and in terms of reducing computation time. The algorithm could also be modified to analyze each harmonic separately instead of all at the same time.

Williamson, Frank↗

AC compensation of 3D magnetic diagnostic signals in DIII-D and National Spherical Torus Experiment-Upgrade (NSTX-U) for real-time application

A time domain algorithm has been developed to remove the vacuum pickup generated by both coil current (DC) and induced vessel current (AC) in real time from three dimensional (3D) magnetic diagnostic signals in the National Spherical Torus Experiment-Upgrade (NSTX-U) and DIII-D tokamaks. The possibility of detecting 3D plasma perturbations in real time is essential in modern and future tokamaks to avoid and control MHD instabilities. The presence of vacuum field pickup, due to toroidally asymmetric (3D) coils or to misalignment between sensors and axisymmetric (2D) coils, pollutes the measured plasma 3D field, making the detection of the magnetic field produced by the plasma challenging. Although the DC coupling between coils and sensors can be easily calculated and removed, the AC part is more difficult. Here, an algorithm based on a layered low-pass filter approach for the AC compensation and its application for DIII-D and NSTX-U data is presented, showing that this method reduces the vacuum pickup to the noise level. Comparison of plasma response measurements with and without vacuum compensation shows that accurate mode locking detection and plasma response identification require precise AC and DC compensations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗