Search NASA⌕ Search

SEARCH · Search NASA

Results for “Software algorithms”

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 235 records · Page 13

Wake Turbulence Mitigation for Departures (WTMD) Prototype System - Software Design Document

This document describes the software design of a prototype Wake Turbulence Mitigation for Departures (WTMD) system that was evaluated in shadow mode operation at the Saint Louis (KSTL) and Houston (KIAH) airports. This document describes the software that provides the system framework, communications, user displays, and hosts the Wind Forecasting Algorithm (WFA) software developed by the M.I.T. Lincoln Laboratory (MIT-LL). The WFA algorithms and software are described in a separate document produced by MIT-LL.

Sturdy, James L.↗

Performance Evaluation of the CHKED Multi-Elemental Analysis and Software

The Hybrid K-edge Densitometer (HKED) is a high precision safeguards assay system developed by Ottmar and Eberle [1] for quantification of the U and Pu concentrations of dissolver solutions in spent nuclear fuel reprocessing. The HKED measurement supplements traditional destructive assay methods such as Isotope Dilution Mass Spectrometry (IDMS) and is an essential component of the international safeguards program implementation at these facilities. The Canberra Hybrid K-Edge Densitometry (CHKED) software was recently developed by Canberra Industries to better address the changing composition of the nuclear fuel cycle by addition of a multi-elemental analysis capability to the K-Edge transmission measurement. Our evaluation of the CHKED software was performed at the request of the International Atomic Energy Agency (IAEA) to examine the functionality and performance of the CHKED software and algorithms and identify potential areas for improvement of the software. The reader is assumed to be familiar with the HKED technique and its current implementation in safeguards assay of U and Pu in the nuclear fuel cycle. The Canberra Hybrid K-Edge Densitometry CHKED software replicates functionality of the older VMSbased Hybrid K-Edge Densitometer (HKED) software and incorporates additional analysis algorithms and tools. When the traditional HKED analyses are selected, the CHKED software appears to faithfully reproduce the measurement results as reported by the older software. The CHKED software includes a Multi-elemental K-Edge (MEKED) analysis based in part on algorithms devised at Los Alamos National Laboratory. In principle, the MEKED analysis represents a significant advancement over the traditional HKED analysis, providing a capability to analyze the actinide concentrations from complex solutions, such as low U:Pu ratios (e.g., U:Pu = 1:1) including additional minor actinide components such as Np and Am. However, this MEKED analysis is somewhat limited by reliance on a region of interest (ROI) analysis of the spectrum, the need for extensive calibration measurements and a simplistic interpretation of the KED transmission spectrum. Finally, the MEKED algorithm set associated with the CHKED software (V1.0) acquired by Oak Ridge National Laboratory (ORNL) from Canberra Industries does not seem to be “finished” (e.g., the MEKED analysis seems to only determine measurement results for two actinides with while results for the minor actinides appear to be highly dependent on declaration values).

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

HamLib: A Library of Hamiltonians for Benchmarking Quantum Algorithms and Hardware

For a considerable time, large datasets containing problem instances have proven valuable for analyzing computer hardware, software, and algorithms. One notable example of the value of large datasets is ImageNet [1], a vast repository of images that has been instrumental in testing numerous deep learning packages. Similarly, in the domain of computational chemistry and materials science, the availability of extensive datasets such as the Protein Data Bank [2], the Materials Project [3], and QM9 [4] has greatly facilitated the evaluation of new algorithms and software approaches, while also promoting standardization within the field. These well-defined datasets and problem instances, in turn, serve as the foundation for creating benchmarking suites like MLPerf [5] and LINPACK [6], [7]. These suites enable fair and rigorous comparisons of different methodologies and solutions, fostering continuous advancements in various areas of computer science and beyond.

Sawaya, Nicolas PD↗

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA Workshop on Computational Structural Mechanics 1987, part 3

Computational Structural Mechanics (CSM) topics are explored. Algorithms and software for nonlinear structural dynamics, concurrent algorithms for transient finite element analysis, computational methods and software systems for dynamics and control of large space structures, and the use of multi-grid for structural analysis are discussed.

Sykes, Nancy P.↗

fast-matmul

This software provides implementations of fast matrix multiplication algorithms. These algorithms perform fewer floating point operations than the classical cubic algorithm. The software uses code generation to automatically implement the fast algorithms based on high-level descriptions. The code serves two general purposes. The first is to demonstrate that these fast algorithms can out-perform vendor matrix multiplication algorithms for modest problem sizes on a single machine. The second is to rapidly prototype many variations of fast matrix multiplication algorithms to encourage future research in this area. The implementations target sequential and shared memory parallel execution.

Ballard, Grey↗

fast-matmul

This software provides implementations of fast matrix multiplication algorithms. These algorithms perform fewer floating point operations than the classical cubic algorithm. The software uses code generation to automatically implement the fast algorithms based on high-level descriptions. The code serves two general purposes. The first is to demonstrate that these fast algorithms can out-perform vendor matrix multiplication algorithms for modest problem sizes on a single machine. The second is to rapidly prototype many variations of fast matrix multiplication algorithms to encourage future research in this area. The implementations target sequential and shared memory parallel execution.

Grey Ballard, Austin Benson↗

Automating software design system DESTA

'DESTA' is the acronym for the Dialogue Evolutionary Synthesizer of Turnkey Algorithms by means of a natural language (Russian or English) functional specification of algorithms or software being developed. DESTA represents the computer-aided and/or automatic artificial intelligence 'forgiving' system which provides users with software tools support for algorithm and/or structured program development. The DESTA system is intended to provide support for the higher levels and earlier stages of engineering design of software in contrast to conventional Computer Aided Design (CAD) systems which provide low level tools for use at a stage when the major planning and structuring decisions have already been taken. DESTA is a knowledge-intensive system. The main features of the knowledge are procedures, functions, modules, operating system commands, batch files, their natural language specifications, and their interlinks. The specific domain for the DESTA system is a high level programming language like Turbo Pascal 6.0. The DESTA system is operational and runs on an IBM PC computer.

Lovitsky, Vladimir A.↗

Comparison of sleep parameters from wrist-worn ActiGraph and Actiwatch devices

Abstract Sleep and physical activity, two important health behaviors, are often studied independently using different accelerometer types and body locations. Understanding whether accelerometers designed for monitoring each behavior can provide similar sleep parameter estimates may help determine whether one device can be used to measure both behaviors. Three hundred and thirty one adults (70.7 ± 13.7 years) from the Baltimore Longitudinal Study of Aging wore the ActiGraph GT9X Link and the Actiwatch 2 simultaneously on the non-dominant wrist for 7.0 ± 1.6 nights. Total sleep time (TST), wake after sleep onset (WASO), sleep efficiency, number of wake bouts, mean wake bout length, and sleep fragmentation index (SFI) were extracted from ActiGraph using the Cole–Kripke algorithm and from Actiwatch using the software default algorithm. These parameters were compared using paired t-tests, Bland–Altman plots, and Deming regression models. Stratified analyses were performed by age, sex, and body mass index (BMI). Compared to the Actiwatch, the ActiGraph estimated comparable TST and sleep efficiency, but fewer wake bouts, longer WASO, longer wake bout length, and higher SFI (all p < .001). Both devices estimated similar 1-min and 1% differences between participants for TST and SFI (β = 0.99, 95% CI: 0.95, 1.03, and 0.91, 1.13, respectively), but not for other parameters. These differences varied by age, sex, and/or BMI. The ActiGraph and the Actiwatch provide comparable absolute and relative estimates of TST, but not other parameters. The discrepancies could result from device differences in movement collection and/or sleep scoring algorithms. Further comparison and calibration is required before these devices can be used interchangeably.

Liu, Fangyu (ORCID:0000000315541478)↗

Program Aids Simulation Of Neural Networks

Computer program NETS - Tool for Development and Evaluation of Neural Networks - provides simulation of neural-network algorithms plus software environment for development of such algorithms. Enables user to customize patterns of connections between layers of network, and provides features for saving weight values of network, providing for more precise control over learning process. Consists of translating problem into format using input/output pairs, designing network configuration for problem, and finally training network with input/output pairs until acceptable error reached. Written in C.

Baffes, Paul T.↗

Improving AIRS NRT Imagery for the Enhancement of Visualization Services in LANCE

The NASA Goddard Earth Sciences Data and Information Services Center (GES DISC) has been the home of processing, archiving, and distribution services for data from the Atmospheric Infrared Sounder (AIRS) mission since its launch in 2002. AIRS provides data enabling global observations of the atmospheric state. The GES DISC provides service to both AIRS standard products and Near Real-time (NRT) products. The AIRS NRT product is one important element in the Land, Atmosphere Near real-time Capability for EOS (LANCE). The LANCE processing of the AIRS NRT product and the generation of the imagery are performed at the GES DISC. The AIRS NRT imagery are generated by mosaicking and mapping the available AIRS 6-minute retrieval granules to a global cylindrical projection. The images are constantly refreshed when new granules are produced. The AIRS NRT Viewer and LANCE Worldview provide visualization services to online users for AIRS NRT imagery. The imagery include atmospheric temperature, humidity, precipitation, Dust Score, CO, and SO2. The AIRS Applications Development Team at NASA JPL developed a new orbit-based algorithm and software to improve the AIRS NRT imagery. The GES DISC is collaborating with the AIRS Applications Development Team for the implementation of the new algorithm and software. The improvements include image quality, new color palettes, and variable changes. In this presentation, we will detail the improvements and demonstrate visualization of the new imagery.

Ding, Feng↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

Preliminary software development for optical mirror figure control

The maintenance of accurate primary mirror figure in the face of environmental disturbances is the key to the achievement of diffraction-limited performance in a large space telescope. In order to develop the concepts of optical mirror figure control, an experimental program was initiated. A major component in this experiment will be an XDS Sigma 5.7 digital computer which will realize the control algorithm. A software package is described which realizes linear optimal, simplified linear, and iterative optimal control algorithms. The software, in addition, provides for interactive communication between the operator and the computer, and interaction between the computer and the experimental hardware elements. A brief description of a small hybrid computer system is also presented.

Mackinnon, D.↗

Ndarts

Ndarts software provides algorithms for computing quantities associated with the dynamics of articulated, rigid-link, multibody systems. It is designed as a general-purpose dynamics library that can be used for the modeling of robotic platforms, space vehicles, molecular dynamics, and other such applications. The architecture and algorithms in Ndarts are based on the Spatial Operator Algebra (SOA) theory for computational multibody and robot dynamics developed at JPL. It uses minimal, internal coordinate models. The algorithms are low-order, recursive scatter/ gather algorithms. In comparison with the earlier Darts++ software, this version has a more general and cleaner design needed to support a larger class of computational dynamics needs. It includes a frames infrastructure, allows algorithms to operate on subgraphs of the system, and implements lazy and deferred computation for better efficiency. Dynamics modeling modules such as Ndarts are core building blocks of control and simulation software for space, robotic, mechanism, bio-molecular, and material systems modeling.

Jain, Abhinandan↗

Iterative multi-task learning and inference from seismic images

Seismic interpretation aims to extract quantitative and interpretable attributes from a seismic image produced using some migration method to inform characteristics of a subsurface reservoir or target of interest. Current paradigms for computing seismic attributes mostly rely on single-task algorithms. We develop an iterative, multi-task machine learning method to learn and infer multiple attributes from a seismic image. This method is composed of two stages: a multi-task inference stage and a multi-modal, multi-task refinement stage. The basic mechanism of this method is that we train a multi-task inference neural network (NN) to estimate a set of attributes, including a relative geological time (RGT), a denoised higher-resolution (DHR) seismic image, and multiple fault attributes (including probability, dip, and strike), from a low-resolution, noisy seismic image; then we input the inferred attributes to a multi-task refinement NN to enhance the raw inference results iteratively. The two multi-task NNs are trained separately based on synthetic seismic images and associated attributes generated by a geological modeling algorithm. The software we intend to release is a PyTorch implementation of this multi-task learning method for both 2D and 3D cases along with scripts to run the training/validation. The algorithm and software can be a useful tool for automatic seismic interpretation.

Gao, Kai↗

Trajectory Specification Applied to Terminal Airspace

Despite major efforts to automate air traffic control (ATC), it is still performed by humans today. The complexity and safety-criticality of ATC makes it very difficult to safely automate, but it must be automated to increase airspace capacity (the density of traffic that can be safely managed) and airport throughput (the number of arrivals and departures that an airport can safely handle in a given period of time) beyond what is possible with human controllers. This paper presents the Trajectory Specification (TS) concept, which can help to safely automate ATC. TS is a method of specifying aircraft trajectories such that the position at any given time in flight is restricted to a precisely defined bounding space, removing all ambiguity as to where the flight is allowed to be. The bounding space or volume is determined by tolerances relative to a reference trajectory (position as a function of time). The tolerances are dynamic and are based on the aircraft navigation capabilities and the traffic situation. The tolerances can be a piecewise linear function of time or distance along the route, allowing the tolerances to vary as needed, typically increasing with time for departures and decreasing for arrivals. A Trajectory Specification Language (TSL) is proposed for communicating trajectories from aircraft to ATC as requests and from ATC to aircraft as assignments. The TS concept requires a new generation of airborne Flight Management Systems (FMS) that understand the TSL and can fly the assigned trajectories, but this paper focuses on the ATC functions and the prototype ATC algorithms and software that were developed to test the TS concept. Assuming conformance, TS can guarantee safe separation for an arbitrary length of time even in the event of an ATC system or communication outage. It can help to achieve the high level of safety and reliability needed for ATC automation, and it can also reduce the reliance on ATC backup systems for tactical conflict detection and resolution during normal operation. TS can be applied to any controlled airspace, including enroute, terminal, and urban airspace, but this paper presents algorithms and software for arrival spacing and conflict detection and resolution in the terminal airspace serving a major airport. In a fast-time simulation of a full day of traffic in a major terminal airspace, all conflicts were resolved in near real time, demonstrating the computational feasibility and the preliminary operational feasibility of the TS concept. This paper is a compilation of previous papers, and it adds significant information that was omitted from those papers due to length limitations. It also updates some of the results of those earlier papers due to algorithm refinements and corrections of minor software errors.

air traffic control, trajectory↗

Analysis of TRMM Microphysical Measurements: Tropical Rainfall Measuring Mission (TRMM)

SPEC Incorporated participated in three of the four TRMM field campaigns (TEFLUN-A, TEFLUN-B and KWAJEX), installing and operating a cloud particle imager (CPI) and a high volume precipitation spectrometer (HVPS) on the SPEC Learjet in TEFLUN-A, the University of North Dakota Citation in TEFLUN-B and KWAJEX, and a CPI on the NASA DC-8 in KWAJEX. This report presents and discusses new software tools and algorithms that were developed to analyze microphysical data collected during these field campaigns, as well as scientific interpretations of the data themselves. Software algorithms were developed to improve the analysis of microphysical measurements collected by the TRMM aircraft during the field campaigns. Particular attention was paid to developing and/or improving algorithms used to compute particle size distributions and ice water content. Software was also developed in support of production of the TRMM Common Microphysical Product (CMP) data files. CMP data files for TEFLUN-A field campaign were produced and submitted to the DAAC. Typical microphysical properties of convective and stratiform regions from TEFLUN-A and KWAJEX clouds were produced. In general, it was found that in the upper cloud region near -20 to -25 C, stratiform clouds contain very high (greater than 1 per cubic centimeter) concentrations of small ice particles, which are suspected to be a residual from homogeneous freezing and sedimentation of small drops in a convective updraft. In the upper cloud region near -20 to -25 C, convective clouds contain aggregates, which are not found lower in the cloud. Stratiform clouds contain aggregates at all levels, with the majority in the lowest levels. Convective cloud regions contain much higher LWC and drop concentrations than stratiform regions at all levels, and higher LWC in the middle and upper regions. Stratiform clouds contain higher IWC than convective clouds only at the lowest level. Irregular shaped ice particles are found in very high concentrations throughout both convective and stratiform cloud regions. A striking difference in particle shape in cirrus formed in situ, cirrus formed from maritime anvils and cirrus formed from continental anvils. Over 50% of the mass of in situ cirrus ice particles is composed of bullet rosettes, while bullet rosettes are virtually non-existent in maritime and tropical anvils. Tropical anvils are composed of mostly singular, plates, capped columns, and blocky irregular shapes, while continental anvils have a much higher percentage of aggregates, some of which are chains of small spheroidal particles that appear to result from homogeneous freezing of drops. A correlation between high electric fields in continental anvils and the formation of aggregates is hypothesized.

Source record↗

Software Requirement Document: Benchmarking Algorithms for RadioNuclide Identification (BARNI)

The Department of Energy (DOE) Office of Nuclear Smuggling Detection and Deterrence (NSDD) seeks to improve the performance of RadioIsotope Identification Devices (RIIDs). RIIDs enable users to identifying threat nuclides in applications such as secondary search, facility inspection, and emergency response. As part of this effort NSDD has developed Replicative Assessment of Spectroscopic Equipment (RASE), an open-source tool which generates synthetic spectra and analyzes them with vendor’s radionuclide identification software in order to evaluate performance.

61 RADIATION PROTECTION AND DOSIMETRY↗