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,729 records · Page 96

ADoSPSiQS (Automated Detection of Symmetry-Protected Subspaces in Quantum Simulations ) [SWR-23-55]

Symmetry-protected subspaces in quantum systems are subspaces demarcated by a conserved quantity of that quantum system. We introduce two classical algorithms, which efficiently compute and elucidate features of these subspaces. The first algorithm explores the entire symmetry-protected subspace of an initial state in time complexity linear to the size of the subspace by closing local basis state-to-basis state transitions. The second algorithm determines, with bounded error, if a given measurement outcome of a dynamically-generated state is within the symmetry-protected subspace of the state in which the dynamical system is initialized. This software is paired with the paper of the same name at https://arxiv.org/pdf/2302.08586.pdf.

Rotello, Caleb↗

Canopy 2.1 User Guide

Canopy is a visual analytic software suite, developed by researchers at the Pacific Northwest National Laboratory (PNNL), to support intelligence analysts’ ability to efficiently analyze massive amounts of multimedia data. Canopy incorporates state-of-the-art computer vision algorithms and interactive visualizations so that analysts can comprehend and articulate the big picture, thereby reducing their workload and ultimately the effort of identifying the critical intelligence for decision makers.

Canopy↗

Pathway Aggregation in the Risk Assessment of Proliferation Resistance and Physical Protection (PR&PP) of Nuclear Energy Systems

The framework for Proliferation Resistance and Physical Protection (PR & PP) evaluation is to define a set of challenges, to obtain the system responses, and to assess the outcomes. The assessment of outcomes heavily relies on pathways, defined as sequences of events or actions that could potentially be followed by a State or a group of individuals in order to achieve a proliferation objective, with the defined threats as initiating events. There may be large number of segments connecting pathway stages (e.g. acquisition, processing, and fabrication for PR) which can lead to even larger number of pathways or scenarios through possible different combinations of segment connections, each with associated probabilities contributing to the overall risk. Clustering of these scenarios in specified stage attribute intervals is important for their tractable analysis and outcome assessment. A software tool for scenario generation and clustering (OSUPR) is developed that utilizes the PRCALC code developed at the Brookhaven National Laboratory for scenario generation and the K- means, mean shift and adaptive mean shift algorithms as possible clustering schemes. The results of the study using the Example Sodium Fast Breeder as an example system show that clustering facilitates the probabilistic or deterministic analysis of scenarios to identify system vulnerabilities and communication of the major risk contributors to stakeholders. The results of the study also show that the mean shift algorithm has the most potential for assisting the analysis of the scenarios generated by PRCALC.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Fission Meter Information Barrier Attribute Measurement System: FY2018 Office of Nuclear Verification FNI/UKC Task 2 Documentation Package

The ORTEC Fission Meter is a neutron multiplicity detector developed by Oak Ridge, TN based Advanced Measurement Technology (AMETEK), ORTEC Division. Data analysis techniques developed for neutron multiplicity detectors allows determination of mass and multiplication of unknown objects of special nuclear material (SNM). This can be done based on the physics of fission neutrons with little or no a priori information about the object. The articulating panel design and “5-Mode Counter” neutron multiplicity data-acquisition hardware were licensed to ORTEC by Lawrence Livermore National Laboratory in 2005 based on a 2004 prototype. The “5-Mode Counter” development started in 2000 in order to produce a compact neutron multiplicity file containing the full neutron count timing distribution. Development of this hardware along with the prototype detector design continued through 2004. Photographs of the Fission Meter are shown in Figure 1. In 2011, the Lawrence Livermore National Laboratory developed a software-based information barrier (IB) for the Fission Meter to control transmission of some for potential use in treaty applications. This IB was extended over the next several years to include improvements to the algorithms, more automated processing, and list mode data acquisition and processing. This report provides design and operational documentation for the Fission Meter and the Information Barrier additions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Implementation of fuel management multi-cycle optimization capabilities in RAVEN optimization framework

Optimization in nuclear fuel-management assists the core reload engineer with finding optimal out-of-core and in-core strategies. RAVEN is INL’s open source software that is equipped with fuel-management optimization capabilities including single-cycle, single- and multi-objective optimization of pressurized water reactors (PWRs) loading patterns (LP) of a fresh core using genetic algorithm (GA) and non-dominated sorting genetic algorithm (NSGA-II). In practice, however, medium and long term planning of fuel-management needs a multi-cycle approach, where the history and availability of fuel assemblies is considered in the optimization process. In this paper, we present a description of an initial expansion of RAVEN fuel-management optimization capabilities for a multi-cycle optimization framework. N-th cycle optimization capabilities that account for the unique history of recycled fuel assembly in the core were added. The multi-cycle optimization approach taken is formulated as a cycle-wise optimization problem where out-of-core decisions are used to onset each cycle optimization. Out-of-core decisions are managed externally to the in-core optimization by a fuel inventory management module. A proof-of-concept optimization problem is also presented.

42 - ENGINEERING↗

Numerical Methods for Forward and Inverse Problems in Discontinuous Media

The research emphasis under this grant's funding is in the area of algebraic multigrid methods. The research has two main branches: 1) exploring interdisciplinary applications in which algebraic multigrid can make an impact and 2) extending the scope of algebraic multigrid methods with algorithmic improvements that are based in strong analysis.The work in interdisciplinary applications falls primarily in the field of biomedical imaging. Work under this grant demonstrated the effectiveness and robustness of multigrid for solving linear systems that result from highly heterogeneous finite element method models of the human head. The results in this work also give promise to medical advances possible with software that may be developed. Research to extend the scope of algebraic multigrid has been focused in several areas. In collaboration with researchers at the University of Colorado, Lawrence Livermore National Laboratory, and Los Alamos National Laboratory, the PI developed an adaptive multigrid with subcycling via complementary grids. This method has very cheap computing costs per iterate and is showing promise as a preconditioner for conjugate gradient. Recent work with Los Alamos National Laboratory concentrates on developing algorithms that take advantage of the recent advances in adaptive multigrid research. The results of the various efforts in this research could ultimately have direct use and impact to researchers for a wide variety of applications, including, astrophysics, neuroscience, contaminant transport in porous media, bi-domain heart modeling, modeling of tumor growth, and flow in heterogeneous porous media. This work has already led to basic advances in computational mathematics and numerical linear algebra and will continue to do so into the future.

97 MATHEMATICS AND COMPUTING↗

flowVS: channel-specific variance stabilization in flow cytometry

Abstract Background Comparing phenotypes of heterogeneous cell populations from multiple biological conditions is at the heart of scientific discovery based on flow cytometry (FC). When the biological signal is measured by the average expression of a biomarker, standard statistical methods require that variance be approximately stabilized in populations to be compared. Since the mean and variance of a cell population are often correlated in fluorescence-based FC measurements, a preprocessing step is needed to stabilize the within-population variances. Results We present a variance-stabilization algorithm, called flowVS, that removes the mean-variance correlations from cell populations identified in each fluorescence channel. flowVS transforms each channel from all samples of a data set by the inverse hyperbolic sine (asinh) transformation. For each channel, the parameters of the transformation are optimally selected by Bartlett’s likelihood-ratio test so that the populations attain homogeneous variances. The optimum parameters are then used to transform the corresponding channels in every sample. flowVS is therefore an explicit variance-stabilization method that stabilizes within-population variances in each channel by evaluating the homoskedasticity of clusters with a likelihood-ratio test. With two publicly available datasets, we show that flowVS removes the mean-variance dependence from raw FC data and makes the within-population variance relatively homogeneous. We demonstrate that alternative transformation techniques such as flowTrans, flowScape, logicle, and FCSTrans might not stabilize variance. Besides flow cytometry, flowVS can also be applied to stabilize variance in microarray data. With a publicly available data set we demonstrate that flowVS performs as well as the VSN software, a state-of-the-art approach developed for microarrays. Conclusions The homogeneity of variance in cell populations across FC samples is desirable when extracting features uniformly and comparing cell populations with different levels of marker expressions. The newly developed flowVS algorithm solves the variance-stabilization problem in FC and microarrays by optimally transforming data with the help of Bartlett’s likelihood-ratio test. On two publicly available FC datasets, flowVS stabilizes within-population variances more evenly than the available transformation and normalization techniques. flowVS-based variance stabilization can help in performing comparison and alignment of phenotypically identical cell populations across different samples. flowVS and the datasets used in this paper are publicly available in Bioconductor.

60 APPLIED LIFE SCIENCES↗

BuildingIQ Technology Field Validation

This document describes a field validation and verification of the BuildingIQ Predictive Energy Optimization (PEO) technology based on a five-site study. BuildingIQ describes its PEO technology as a software-as-a-service (SaaS) platform that optimizes commercial building HVAC control for system efficiency, occupant comfort, and cost. It is targeted for use in large, complex buildings, and integrates with the building automation system (BAS) to conduct supervisory control. The PEO algorithm defines optimal space air temperature setpoints that are automatically implemented at the variable air volume (VAV) terminal units when possible, or through supply air temperature and duct static pressure setpoints at the air handling unit (AHU) level. The optimization is built upon a learned predictive model that provides a 24-hour ahead forecast of the building’s power profile, using weather forecasts and historical operational data; this model is updated every 4 to 6 hours. Demand-responsive load reductions may also be implemented.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Computationally efficient implementation of combustion chemistry in parallel PDF calculations

In parallel calculations of combustion processes with realistic chemistry, the serial in situ adaptive tabulation (ISAT) algorithm [S.B. Pope, Computationally efficient implementation of combustion chemistry using in situ adaptive tabulation, Combustion Theory and Modelling, 1 (1997) 41-63; L. Lu, S.B. Pope, An improved algorithm for in situ adaptive tabulation, Journal of Computational Physics 228 (2009) 361-386] substantially speeds up the chemistry calculations on each processor. To improve the parallel efficiency of large ensembles of such calculations in parallel computations, in this work, the ISAT algorithm is extended to the multi-processor environment, with the aim of minimizing the wall clock time required for the whole ensemble. Parallel ISAT strategies are developed by combining the existing serial ISAT algorithm with different distribution strategies, namely purely local processing (PLP), uniformly random distribution (URAN), and preferential distribution (PREF). The distribution strategies enable the queued load redistribution of chemistry calculations among processors using message passing. They are implemented in the software x2f{sub m}pi, which is a Fortran 95 library for facilitating many parallel evaluations of a general vector function. The relative performance of the parallel ISAT strategies is investigated in different computational regimes via the PDF calculations of multiple partially stirred reactors burning methane/air mixtures. The results show that the performance of ISAT with a fixed distribution strategy strongly depends on certain computational regimes, based on how much memory is available and how much overlap exists between tabulated information on different processors. No one fixed strategy consistently achieves good performance in all the regimes. Therefore, an adaptive distribution strategy, which blends PLP, URAN and PREF, is devised and implemented. It yields consistently good performance in all regimes. In the adaptive parallel ISAT strategy, the type and extent of redistribution is determined 'on the fly' based on the prediction of future simulation time. Compared to the PLP/ISAT strategy where chemistry calculations are essentially serial, a speed-up factor of up to 30 is achieved. The study also demonstrates that the adaptive strategy has acceptable parallel scalability.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tracking materials science data lineage to manage millions of materials experiments and analyses

Abstract In an era of rapid advancement of algorithms that extract knowledge from data, data and metadata management are increasingly critical to research success. In materials science, there are few examples of experimental databases that contain many different types of information, and compared with other disciplines, the database sizes are relatively small. Underlying these issues are the challenges in managing and linking data across disparate synthesis and characterization experiments, which we address with the development of a lightweight data management framework that is generally applicable for experimental science and beyond. Five years of managing experiments with this system has yielded the Materials Experiment and Analysis Database (MEAD) that contains raw data and metadata from millions of materials synthesis and characterization experiments, as well as the analysis and distillation of that data into property and performance metrics via software in an accompanying open source repository. The unprecedented quantity and diversity of experimental data are searchable by experiment and analysis attributes generated by both researchers and data processing software. The search web interface allows users to visualize their search results and download zipped packages of data with full annotations of their lineage. The enormity of the data provides substantial challenges and opportunities for incorporating data science in the physical sciences, and MEAD’s data and algorithm management framework will foster increased incorporation of automation and autonomous discovery in materials and chemistry research.

Soedarmadji, Edwin↗

Helical Tomotherapy-Based STAT Stereotactic Body Radiation Therapy: Dosimetric Evaluation for a Real-Time SBRT Treatment Planning and Delivery Program

Stereotactic body radiation therapy (SBRT) treatments have high-dose gradients and even slight patient misalignment from the simulation to treatment could lead to target underdosing or organ at risk (OAR) overdosing. Daily real-time SBRT treatment planning could minimize the risk of geographic miss. As an initial step toward determining the clinical feasibility of developing real-time SBRT treatment planning, we determined the calculation time of helical TomoTherapy-based STAT radiation therapy (RT) treatment plans for simple liver, lung, and spine SBRT treatments to assess whether the planning process was fast enough for practical clinical implementation. Representative SBRT planning target volumes for hypothetical liver, peripheral lung, and thoracic spine lesions and adjacent OARs were contoured onto a planning computed tomography scan (CT) of an anthropomorphic phantom. Treatment plans were generated using both STAT RT 'full scatter' and conventional helical TomoTherapy 'beamlet' algorithms. Optimized plans were compared with respect to conformality index (CI), heterogeneity index (HI), and maximum dose to regional OARs to determine clinical equivalence and the number of required STAT RT optimization iterations and calculation times were determined. The liver and lung dosimetry for the STAT RT and standard planning algorithms were clinically and statistically equivalent. For the liver lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.04 and 1.04 and HI of 1.03 and 1.03, respectively. For the lung lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.05 and 1.03 and HI of 1.05and 1.05, respectively. For spine lesions, 'full scatter' and 'beamlet' algorithms showed a CI of 1.15 and 1.14 and HI of 1.22 and 1.14, respectively. There was no difference between treatment algorithms with respect to maximum doses to the OARs. The STAT RT iteration time with current treatment planning systems is 45 sec, and the treatment planning required 3 iterations or 135 sec for STAT RT liver and lung SBRT plans and 7 iterations or 315 sec for STAT RT spine SBRT plans. Helical TomoTherapy-based STAT RT treatment planning with the 'full scatter' algorithm provides levels of dosimetric conformality, heterogeneity, and OAR avoidance for SBRT treatments that are clinically equivalent to those generated with the Helical TomoTherapy 'beamlet' algorithm. STAT RT calculation times for simple SBRT treatments are fast enough to warrant further investigation into their potential incorporation into an SBRT program with daily real-time planning. Development of methods for accurate target and OAR determination on megavoltage computed tomography scans incorporating high-resolution diagnostic image co-registration software and CT detector-based exit dose measurement for quality assurance are necessary to build a real-time SBRT planning and delivery program.

61 RADIATION PROTECTION AND DOSIMETRY↗

Scaling Semantic Graph Databases in Size and Performance

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grained data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.

Aggregation↗

Quantum Software Engineering (Dagstuhl Seminar 24512)

The Dagstuhl Seminar 24512 on "Quantum Software Engineering" was held from December 15 to 20, 2024. It brought together 26 participants from industry and academia from 13 different countries, including senior and junior researchers as well as practitioners in the field of Quantum Software Engineering. The aim of the seminar was to advance software engineering methods and tools for the engineering of hybrid quantum systems by promoting personal interaction and open discussion among researchers who are already working in this emerging area of knowledge. The first day of the seminar was devoted to the topic "When software engineering meets quantum mechanics", while the second day focused on "Quantum software engineering and its challenges." During both days, 16 invited presentations were given. The rest of the seminar was organized into three working groups to address the topics "Quantum Software Design, Modelling and Architecturing", "Adaptive Hybrid Quantum Systems", and "Quantum Software Quality Assurance". The seminar was a very fruitful experience for all participants both in terms of scientific outcomes and in terms of the personal relationships that were generated to jointly address future experiences.

97 MATHEMATICS AND COMPUTING↗

Implementation of Relativistic Coupled Cluster Theory for Massively Parallel GPU-Accelerated Computing Architectures

In this paper, we report reimplementation of the core algorithms of relativistic coupled cluster theory aimed at modern heterogeneous high-performance computational infrastructures. The code is designed for parallel execution on many compute nodes with optional GPU coprocessing, accomplished via the new ExaTENSOR back end. The resulting ExaCorr module is primarily intended for calculations of molecules with one or more heavy elements, as relativistic effects on the electronic structure are included from the outset. In the current work, we thereby focus on exact two-component methods and demonstrate the accuracy and performance of the software. The module can be used as a stand-alone program requiring a set of molecular orbital coefficients as the starting point, but it is also interfaced to the DIRAC program that can be used to generate these. We therefore also briefly discuss an improvement of the parallel computing aspects of the relativistic self-consistent field algorithm of the DIRAC program.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Accurate Consensus-based Distributed Averaging with Variable Time Delay in Support of Distributed Secondary Control Algorithms

We report that distributed secondary control has been widely used in hierarchical control structures, where multiple distributed generators (DGs) need to coordinate to regulate system voltage and frequency. In these systems, consensus algorithms determine the average of a group of dynamic states (e.g. voltages measured by a group of DGs). To be useful, consensus algorithms must be computationally efficient, stable and accurate. In practice, numerous practical implementation challenges significantly affect the consensus equilibrium. In this paper, we quantify the accuracy deviations of the distributed average observer algorithms proposed in the literature to demonstrate the problems with the state-of-the-art distributed averaging techniques. A novel approach is proposed that achieves accurate average tracking in the presence of time-varying communication delays among agents. In our implementation, time synchronization of all distributed controllers is enabled by a novel software platform, called Resilient Information Architecture Platform for the Smart Grid (RIAPS). The proposed distributed average observer is implemented on hardware controllers and its effectiveness is validated in a controller hardware-in-the-loop testbed.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Electrodynamics Coupled-Cluster at Scale: High-Performance Implementation for Complex Systems

Coupled-cluster theory (CC) is a highly accurate and versatile method for simulating complex interactions within quantum systems. The extension of CC theory to model mixed electron-photon processes with quantum electrodynamics (QED) has improved our capability to predict cavity-modified chemistry, a field where photons are used as cost-effective and eco-friendly alternatives to catalyze/inhibit chemical reactions. However, calculations with CC methods, even without incorporating QED effects, are often prohibitively expensive. Simulations of larger systems require scalable infrastructures that exist for traditional CC methods but not for QED-CC methods. As such, we present a GPU-enabled, high-performance, open-source implementation of the quantum electrodynamics coupled-cluster method with single and double excitations (QED-CCSD) within the ExaChem quantum chemistry software package. ExaChem relies on the Tensor Algebra for Many-body Methods (TAMM) infrastructure: a parallel heterogeneous tensor library designed to achieve scalable performance on modern heterogeneous supercomputing platforms. Furthermore, we discuss theoretical foundations, algorithmic details, and numerical benchmarks to showcase the larger systems that ExaChem can simulate and how the integration of photonic degrees-of-freedom alters their ground-state properties.

Basis sets↗

Scaling methods for accelerating kinetic Monte Carlo simulations of chemical reaction networks

Various kinetic Monte Carlo algorithms become inefficient when some of the population sizes in a system are large, which gives rise to a large number of reaction events per unit time. In this work, we present a new acceleration algorithm based on adaptive and heterogeneous scaling of reaction rates and stoichiometric coefficients. The algorithm is conceptually related to the commonly used idea of accelerating a stochastic simulation by considering a subvolume λΩ (0 < λ < 1) within a system of interest, which reduces the number of reaction events per unit time occurring in a simulation by a factor 1/λ at the cost of greater error in unbiased estimates of first moments and biased overestimates of second moments. Our new approach offers two unique benefits. First, scaling is adaptive and heterogeneous, which eliminates the pitfall of overaggressive scaling. Second, there is no need for an a priori classification of populations as discrete or continuous (as in a hybrid method), which is problematic when discreteness of a chemical species changes during a simulation. The method requires specification of only a single algorithmic parameter, N c , a global critical population size above which populations are effectively scaled down to increase simulation efficiency. The method, which we term partial scaling, is implemented in the open-source BioNetGen software package. We demonstrate that partial scaling can significantly accelerate simulations without significant loss of accuracy for several published models of biological systems. Finally, these models characterize activation of the mitogen-activated protein kinase ERK, prion protein aggregation, and T-cell receptor signaling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Thermochimica

Thermochimica is a software library that determines a unique combination of phases and their compositions at thermochemical equilibrium. Thermochimica can be used for stand-alone calculations or it can be directly coupled to other codes. This release of the software does not have a graphical user interface (GUI) and it can be executed from the command line or from an Application Programming Interface (API). Also, it is not intended for thermodynamic model development or for constructing phase diagrams. The main purpose of the software is to be directly coupled with a multi-physics code to provide material properties and boundary conditions for various physical phenomena. Significant research efforts have been dedicated to enhance computational performance through advanced algorithm development, such as improved estimation techniques and non-linear solvers. Various useful parameters can be provided as output from Thermochimica, such as: determination of which phases are stable at equilibrium, the mass of solution species and phases at equilibrium, mole fractions of solution phase constituents, thermochemical activities (which are related to partial pressures for gaseous species), chemical potentials of solution species and phases, and integral Gibbs energy (referenced relative to standard state). The overall goal is to provide an open source computational tool to enhance the predictive capability of multi-physics codes without significantly impeding computational performance.

Simunovic, Srdjan↗