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 1,081 records · Page 60

Terascale Optimal PDE Simulations

The Terascale Optimal PDE Solvers (TOPS) Integrated Software Infrastructure Center (ISIC) was created to develop and implement algorithms and support scientific investigations performed by DOE-sponsored researchers. These simulations often involve the solution of partial differential equations (PDEs) on terascale computers. The TOPS Center researched, developed and deployed an integrated toolkit of open-source, optimal complexity solvers for the nonlinear partial differential equations that arise in many DOE application areas, including fusion, accelerator design, global climate change and reactive chemistry. The algorithms created as part of this project were also designed to reduce current computational bottlenecks by orders of magnitude on terascale computers, enabling scientific simulation on a scale heretofore impossible.

97 MATHEMATICS AND COMPUTING↗

TriKota v 1.0

The TriKota software is a library that allows the Dakota Optimization Toolkit to be easily accessed from a computer code that is already interfaced to the solution algorithms in the Trilinos framework. It is a class of code known as an adapter. TriKota also supplies examples so that new applications can quickly make use of it’s capabilities.The TriKota package is meant to enable more rapid development and a broader use of optimization and uncertainty quantification algorithms. As a general-purpose mathematical software, the uses will span many application areas that seek to perform computational design and analysis.

SALINGER, ANDREW↗

Root Cause Correlation Analysis of Software Failures via Orthogonal Defect Classification and Natural Language Processing

Systems theoretic process analysis (STPA) is becoming an increasingly popular technique to assess how complex digital software systems can fail. Rather than defining failures by their observable failure events, which may be sparse especially for safety rated nuclear digital instrumentation and control systems (DI&C), failures are defined as postulated unsafe actions under specific contextual conditions. This permits a top-down analysis of system hazards and identifies whether imposed constraints and requirements can sufficiently address undesirable hazards. However, STPA is a qualitative approach at identifying inadequacies in the development process and cannot currently be used to quantify unsafe action likelihoods for probabilistic risk assessment. Therefore, in this work, we examine the root causes of software failure and explore whether a consistent correlation can be linked to specific unsafe action classes. We implement Lbl2Vec, an unsupervised document classification and retrieval algorithm, on a database of 4,096 software defect reports acquired from various open-source software systems. By analyzing sentence structure, embedded labels, and word vectors, we show that certain defect types positively correlate to specific unsafe action classes over others. The correlations developed can be used to estimate the failure probability of safety intended DI&C systems which provides a licensing basis for nuclear plant modernization efforts.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Root Cause Correlation Analysis of Software Failures via Orthogonal Defect Classification and Natural Language Processing

Systems theoretic process analysis (STPA) is becoming an increasingly popular technique to assess how complex digital software systems can fail. Rather than defining failures by their observable failure events, which may be sparse especially for safety rated nuclear digital instrumentation and control systems (DI&C), failures are defined as postulated unsafe actions under specific contextual conditions. This permits a top-down analysis of system hazards and identifies whether imposed constraints and requirements can sufficiently address undesirable hazards. However, STPA is a qualitative approach at identifying inadequacies in the development process and cannot currently be used to quantify unsafe action likelihoods for probabilistic risk assessment. Therefore, in this work, we examine the root causes of software failure and explore whether a consistent correlation can be linked to specific unsafe action classes. We implement Lbl2Vec, an unsupervised document classification and retrieval algorithm, on a database of 4,096 software defect reports acquired from various open-source software systems. By analyzing sentence structure, embedded labels, and word vectors, we show that certain defect types positively correlate to specific unsafe action classes over others. The correlations developed can be used to estimate the failure probability of safety intended DI&C systems which provides a licensing basis for nuclear plant modernization efforts.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, TomPeterka↗

TESS

Computing a Voronoi or Delaunay tessellation from a set of points is a core part of the analysis of many simulated and measured datasets. As the scale of simulations and observations surpasses billions of particles, a distributed-memory scalable parallel algorithm is the only feasible approach. The primary contribution of this software is a distributed-memory parallel Delaunay and Voronoi tessellation algorithm based on existing serial computational geometry libraries that automatically determines which neighbor points need to be exchanged among the subdomains of a spatial decomposition. Other contributions include the addition of periodic and wall boundary conditions.

Dmitriy Morozov, Tom Peterka↗

Comparison of two software systems for quantification of myocardial blood flow in patients with hypertrophic cardiomyopathy

Backgorund: Quantification of myocardial blood flow (MBF) by positron emission tomography (PET) is important for investigation of angina in hypertrophic cardiomyopathy (HCM). Several software programs exist for MBF quantification, but they have been mostly evaluated in patients (with normal cardiac geometry), referred for evaluation of coronary artery disease (CAD). Software performance has not been evaluated in HCM patients who frequently have hyperdynamic LV function, LV outflow tract (LVOT) obstruction, small LV cavity size, and variation in the degree/location of LV hypertrophy. Aim: We compared results of MBF obtained using PMod, which permits manual segmentation, to those obtained by FDA-approved QPET software which has an automated segmentation algorithm. Methods: {sup 13}N-ammonia PET perfusion data were acquired in list mode at rest and during pharmacologic vasodilation, in 76 HCM patients and 10 non-HCM patients referred for evaluation of CAD (CAD group.) Data were resampled to create static, ECG-gated and 36-frame-dynamic images. Myocardial flow reserve (MFR) and MBF (in ml/min/g) were calculated using QPET and PMod softwares. Results: All HCM patients had asymmetric septal hypertrophy, and 50% had evidence of LVOT obstruction, whereas non-HCM patients (CAD group) had normal wall thickness and ejection fraction. PMod yielded significantly higher values for global and regional stress-MBF and MFR than for QPET in HCM. Reasonably fair correlation was observed for global rest-MBF, stress-MBF, and MFR using these two softwares (rest-MBF: r = 0.78; stress-MBF: r = 0.66.; MFR: r = 0.7) in HCM patients. Agreement between global MBF and MFR values improved when HCM patients with high spillover fractions (> 0.65) were excluded from the analysis (rest-MBF: r = 0.84; stress-MBF: r = 0.72; MFR: r = 0.8.) Regionally, the highest agreement between PMod and QPET was observed in the LAD territory (rest-MBF: r = 0.82, Stress-MBF: r = 0.68) where spillover fraction was the lowest. Unlike HCM patients, the non-HCM patients (CAD group) demonstrated excellent agreement in MBF/MFR values, obtained by the two softwares, when patients with high spillover fractions were excluded (rest-MBF: r = 0.95; stress-MBF: r = 0.92; MFR: r = 0.95). Conclusions: Anatomic characteristics specific to HCM hearts contribute to lower correlations between MBF/MFR values obtained by PMod and QPET, compared with non-HCM patients. These differences indicate that PMod and QPET cannot be used interchangeably for MBF/MFR analyses in HCM patients.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A Regression Method for Comparing Launch Zone Ranges Derived From Different Sources

In modern fighter aircraft air-to-air missile launch acceptable ranges (LARs) are provided to the pilot for his launch decision. These LARs are calculated in the avionic software, using very simple algebraic equations and algorithms, that attempt to model complex missile behavior. Frequently these algorithms are revised to reflect inaccuracies discovered, when comparisons are made with missile six degree-of-freedom (6-DOF) simulations. The process of modifying this software has become expensive. In the past, these simple LAR generators were modified based only on subjective judgmental approach, with little regard to the missile range design limits. With reduced budgets a more rational methodology should be taken to assess whether or not simple fighter LAR generators need to be modified. Any LAR generator can produce large amounts of range (minimum and maximum) data over the board engagement limits of modem fighter and air-to-air missiles. This infinite population lends itself to some statistical methodology to access simple LAR accuracy and the need for software modification. The methodology should produce statistical parameters for use in the decision making process of modifying a simple fighter LAR generator. This paper presents a regression method, based on a missile range design limit philosophy. Acceptance criteria from the regression method are given that provide simple statistical parameters to aid in this decision making process.

Flight Testing↗

Advanced Reference Counting Pointers for Better Performance

A computer program implements reference counting pointers (RCPs) that are lock-free, thread-safe, async-safe, and operational on a multiprocessor computer. RCPs are powerful and convenient means of managing heap memory in C++ software. Most prior RCP programs use locks to ensure thread safety and manage concurrency. The present program was developed in a continuing effort to explore ways of using the C++ programming language to develop safety-critical and mission- critical software. This effort includes exploration of lock-free algorithms because they offer potential to avoid some costly and difficult verification problems. Unlike previously published RCP software, the present program does not use locks (meaning that no thread can block progress on another thread): Instead, this program implements algorithms that exploit capabilities of central-processing- unit hardware so as to avoid locks. Once locks are eliminated, it becomes possible to realize the other attributes mentioned in the first sentence. In addition to the abovementioned attributes, this program offers several advantages over other RCP programs that use locks: It is smaller (and, hence, is faster and uses less memory), it is immune to priority inversion, and there is no way for it to cause a C++ exception.

Reinholtz, William↗

Adaptive IV&V for Increasingly Complex Software Systems

As NASA software systems continue to innovate, becoming more complex and nondeterministic, the need for the NASA IV&V Program to become systemically adaptive to ensure mission success is paramount. To ensure adaptability within resource constraints, IV&V has developed an agile, risk-based approach to identify, characterize, scope, focus, and prioritize mission assurance activities. This risk based adaptive framework has been applied to trends such as increased reliance on data driven algorithms for safety and mission critical software behavior, use of MBSE in system design, and application of agile principles to embedded software development. The framework is enabled by continuous innovation of new approaches such as software only test beds, assurance design tools, and initiatives that augment IV&V assurance methods with artificial intelligence and machine learning techniques. This presentation will highlight the trends the NASA IV&V Program is seeing, the innovative steps it is taking to address those challenges, and how it is postured to address evolving risk and constantly changing and new technologies.

Wesley W Deadrick↗

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

There are several reasons why the performance of current distributed and heterogeneous systems is often disappointing. For example, the characteristics of the application may be input sensitive and evolve during execution causing dramatic changes in memory reference patterns, resource requirements, or degree of concurrency between different phases of the computation. Or, the system may change dynamically with nodes failing or appearing, some network links severed and other links established with different latencies and bandwidths. Another important reason for poor performance is the fairly compartmentalized approach to optimization: applications, compilers, operating systems and hardware configurations are designed and optimized in isolation and without the knowledge of instance specific information and needs of a running application. There is too little information flow across these boundaries and no global optimization is even attempted. For example, most operating systems services like paging, virtual-to-physical page mapping, I/O, or data layout in disks, provide little or no application customization. Similarly, the off-the-shelf hardware used by most commercial systems is optimized to give best average-case performance. To address this problem, we have proposed application-centric computing, or Smart Applications (SAS). In the SAS executable, the compiler embeds most run-time system services, and a performance-optimizing feedback loop that monitors the application's performance and adaptively reconfigures the application and the OS/system platform. At run-time, after incorporating the code's input and determining the system's resources and state, the SAS performs an *instance* specific optimization, which is more tractable than a global generic optimization between application, OS and system. The overriding philosophy of SAS is ``measure, compare, and adapt if beneficial.'' That is, the application will continually monitor its performance and the available resources to determine if, and by how much, performance could be improved if the application was restructured. Then, if the potential performance benefit outweighs the projected overhead costs, the application will restructure itself and the underlying system accordingly. The SAS framework includes performance monitoring and modeling components and mechanisms for performing the actual restructuring at various levels including: (i) algorithmic adaptation, (ii) run-time software optimization (e.g., input sensitivity analysis, etc.), (iii) tuning reconfigurable OS services (scheduling policy, page size, etc), and (iv) system configuration (e.g., selecting which, and how many, computational resources to use). SmartApps is being developed in the STAPL infrastructure. STAPL (the Standard Template Adaptive Parallel Library) is a framework for developing highly-optimizable, adaptable, and portable parallel and distributed applications. It consists of a relatively new and still evolving collection of generic parallel algorithms and distributed containers and a run-time system (RTS) through which the application and compiler interact with the OS and hardware.

97 MATHEMATICS AND COMPUTING↗

Intelligent Medical Systems for Aerospace Emergency Medical Services

The purpose of this project is to develop a portable, hands free device for emergency medical decision support to be used in remote or confined settings by non-physician providers. Phase I of the project will entail the development of a voice-activated device that will utilize an intelligent algorithm to provide guidance in establishing an airway in an emergency situation. The interactive, hands free software will process requests for assistance based on verbal prompts and algorithmic decision-making. The device will allow the CMO to attend to the patient while receiving verbal instruction. The software will also feature graphic representations where it is felt helpful in aiding in procedures. We will also develop a training program to orient users to the algorithmic approach, the use of the hardware and specific procedural considerations. We will validate the efficacy of this mode of technology application by testing in the Johns Hopkins Department of Emergency Medicine. Phase I of the project will focus on the validation of the proposed algorithm, testing and validation of the decision making tool and modifications of medical equipment. In Phase 11, we will produce the first generation software for hands-free, interactive medical decision making for use in acute care environments.

Epler, John↗

Systems aspects of COBE science data compression

A general approach to compression of diverse data from large scientific projects has been developed and this paper addresses the appropriate system and scientific constraints together with the algorithm development and test strategy. This framework has been implemented for the COsmic Background Explorer spacecraft (COBE) by retrofitting the existing VAS-based data management system with high-performance compression software permitting random access to the data. Algorithms which incorporate scientific knowledge and consume relatively few system resources are preferred over ad hoc methods. COBE exceeded its planned storage by a large and growing factor and the retrieval of data significantly affects the processing, delaying the availability of data for scientific usage and software test. Embedded compression software is planned to make the project tractable by reducing the data storage volume to an acceptable level during normal processing.

Freedman, I.↗

Passive neutron coincidence counting with plastic scintillators for the characterization of radioactive waste drums

The quantification of radioactive material is essential in the fields of safeguards, criticality control of nuclear processes, dismantling of nuclear facilities and components, or radioactive waste characterization. The Nuclear Measurement Laboratory (LMN) of CEA is involved in the development of time-correlated neutron detection techniques using plastic scintillators. Usually, 3He proportional counters are used for passive neutron coincidence counting owing to their high thermal neutron capture efficiency and gamma insensitivity. However, the global {sup 3}He shortage in the past few years has made these detectors extremely expensive. In addition, contrary to {sup 3}He counters for which a few tens of microseconds are needed to thermalize fast neutrons, in view to maximize the {sup 3}He(n,p){sup 3}H capture cross section, plastic scintillators are based on elastic scattering and therefore the light signal is formed within a few nanoseconds, correlated pulses being detected within a few dozen- or hundred nanoseconds. This time span reflects fission particles time of flight, which allows reducing accordingly the duration of the coincidence gate and thus the rate of random coincidences, which may totally blind fission coincidences when using {sup 3}He counters in case of a high (α,n) reaction rate. However, plastic scintillators are very sensitive to gamma rays, requiring the use of a thick metallic shield to reduce the corresponding background. Cross talk between detectors is also a major issue, which consists on the detection of one particle by several detectors due to elastic or inelastic scattering, leading to true but undesired coincidences. Data analysis algorithms are tested to minimize cross-talk in simultaneously activated detectors. The distinction between useful fission coincidences and the correlated background due to cross-talk, (α,n) and induced (n,2n) or (n,n'γ) reactions, is achieved by measuring 3-fold coincidences. The performances of a passive neutron coincidence counting system for radioactive waste drums using plastic scintillators have been studied using the Monte Carlo radiation transport code MCNPX-PoliMi v2.0 coupled to data processing algorithms developed with ROOT data analysis software. In addition to the correlated background, accidental coincidences are taken into account in the simulation by randomly merging pulses from different calculations with fission and (α,n) sources. (authors)

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Simulator for concurrent processing data flow architectures

A software simulator capability of simulating execution of an algorithm graph on a given system under the Algorithm to Architecture Mapping Model (ATAMM) rules is presented. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented is capable of determining the performance of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of the ATAMM Simulator. Simulated results are shown to be comparable to the experimental results of the Advanced Development Model System.

Malekpour, Mahyar R.↗

Hardening of DOE UQ Codes for Ultra-Deep Proactive Geosteering in Oilfield Service

The primary objective of this project was to harden the DOE uncertainty quantification (UQ) code to solve the inverse problem for the geosteering service in the oilfield drilling and exploration. The primary focus is to verify the feasibility of using QUESO to solve geosteering inverse problems through statistical inversion. QUESO is a software library developed by QUEST, a DOE's Scientific Discovery through Advanced Computing (SciDAC) institute. In the process of drilling a borehole, geosteering is the act of adjusting the well trajectory on the fly to reach the geological targets or to keep the wellbore within desired formation. Geosteering inversion is to infer underground formation structure using measurements such as azimuthal resistivity logging data. The geosteering process relies on the real-time reconstruction of the subsurface earth model, and a robust and efficient inversion algorithm is always necessary to satisfy the job requirement. The new generation of azimuthal resistivity geosteering tool is capable of detecting multiple formation boundaries 20-100 ft away, and the corresponding geosteering inversion problem can be very challenging as many parameters need to be inverted within such a large depth of investigation. The success of the project will support US energy security by helping to advance subsurface modeling and characterization technologies in oilfield applications. An effective subsurface inversion algorithm and the implementation as a software package will promote the usage of ultra-deep azimuthal resistivity measurements, which can help well placement in complicated underground environments, reduce costs and risks of drilling, and increase oil and gas production. It will help medium and small size independent service companies and tool manufactures to enter the more advanced and lucrative directional drilling area. In addition, by hardening the QUESO code and building a transparent interface for easy manipulation of the QUESO functions, we provide a user-friendly tool for a larger scientific and industry communities that rely heavily on modeling and simulation tools for forecasting, parameter studies, design, and decision making. These are all activities that can strongly benefit from meaningful representations of modeling uncertainty supported by our product.

58 GEOSCIENCES↗

A dataflow analysis tool for parallel processing of algorithms

A graph-theoretic design process and software tool is presented for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described using a dataflow graph and are intended to be executed repetitively on a set of identical parallel processors. Typical applications include signal processing and control law problems. Graph analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool is shown to facilitate the application of the design process to a given problem.

Jones, Robert L., III↗

G-Guidance Interface Design for Small Body Mission Simulation

The G-Guidance software implements a guidance and control (G and C) algorithm for small-body, autonomous proximity operations, developed under the Small Body GN and C task at JPL. The software is written in Matlab and interfaces with G-OPT, a JPL-developed optimization package written in C that provides G-Guidance with guaranteed convergence to a solution in a finite computation time with a prescribed accuracy. The resulting program is computationally efficient and is a prototype of an onboard, real-time algorithm for autonomous guidance and control. Two thruster firing schemes are available in G-Guidance, allowing tailoring of the software for specific mission maneuvers. For example, descent, landing, or rendezvous benefit from a thruster firing at the maneuver termination to mitigate velocity errors. Conversely, ascent or separation maneuvers benefit from an immediate firing to avoid potential drift toward a second body. The guidance portion of this software explicitly enforces user-defined control constraints and thruster silence times while minimizing total fuel usage. This program is currently specialized to small-body proximity operations, but the underlying method can be generalized to other applications.

Acikmese, Behcet↗