Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 775 records · Page 43

Implementation and test of an automated control hunting fault correction algorithm in a fault detection and diagnostics tool

Control hunting due to improper proportional–integral–derivative (PID) parameters in the building automation system (BAS) is one of the most common faults identified in commercial buildings. It can cause suboptimal performance and early failure of heating, ventilation, and air conditioning (HVAC) equipment. Commercial fault detection and diagnostics (FDD) software represents one of the fastest growing market segments in smart building technologies in the United States. Implementation of PID retuning procedures as an auto-correction algorithm and integration into FDD software has the potential to mitigate control hunting across a heterogeneous portfolio of buildings with different BAS in a scalable way. This paper presents the development, implementation, and field testing of an automated control hunting fault correction algorithm based on lambda tuning open-loop rules. The algorithm was developed in a commercial FDD software and successfully tested among nine variable air volume boxes in an office building in the United States. The paper shows the feasibility of using FDD tools to automatically correct control hunting faults, discusses scalability considerations, and proposes a path forward for the HVAC industry and academia to further improve this technology.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Using a Genetic Algorithm to Optimize Configurations in a Data-Driven Application

Users of highly-configurable software systems often want to optimize a particular objective such as improving a functional outcome or increasing system performance. One approach is to use an evolutionary algorithm. However, many applications today are data-driven, meaning they depend on inputs or data which can be complex and varied. Hence, a search needs to be run (and re-run) for all inputs, making optimization a heavy-weight and potentially impractical process. In this paper, we explore this issue on a data-driven highly-configurable scientific application. We build an exhaustive database containing 3,000 configurations and 10,000 inputs, leading to almost 100 million records as our oracle, and then run a genetic algorithm individually on each of the 10,000 inputs. We ask if (1) a genetic algorithm can find configurations to improve functional objectives; (2) whether patterns of best configurations over all input data emerge; and (3) if we can we use sampling to approximate the results. We find that the original (default) configuration is best only 34% of the time, while clear patterns emerge of other best configurations. Out of 3,000 possible configurations, only 112 distinct configurations achieve the optimal result at least once across all 10,000 inputs, suggesting the potential for lighter weight optimization approaches. We show that sampling of the input data finds similar patterns at a lower cost.

Sinha, Urjoshi↗

ISAVS: Interactive Scalable Analysis and Visualization System

Modern science is inundated with ever increasing data sizes as computational capabilities and image acquisition techniques continue to improve. For example, simulations are tackling ever larger domains with higher fidelity, and high-throughput microscopy techniques generate larger data that are fundamental to gather biologically and medically relevant insights. As the image sizes exceed memory, and even sometimes local disk space, each step in a scientific workflow is impacted. Current software solutions enable data exploration with limited interactivity for visualization and analytic tasks. Furthermore analysis on HPC systems often require complex hand-written parallel implementations of algorithms that suffer from poor portability and maintainability. We present a software infrastructure that simplifies end-to-end visualization and analysis of massive data. First, a hierarchical streaming data access layer enables interactive exploration of remote data, with fast data fetching to test analytics on subsets of the data. Second, a library simplifies the process of developing new analytics algorithms, allowing users to rapidly prototype new approaches and deploy them in an HPC setting. Third, a scalable runtime system automates mapping analysis algorithms to whatever computational hardware is available, reducing the complexity of developing scaling algorithms. Here, we demonstrate the usability and performance of our system using a use case from neuroscience: filtering, registration, and visualization of tera-scale microscopy data. We evaluate the performance of our system using a leadership-class supercomputer, Shaheen II.

97 MATHEMATICS AND COMPUTING↗

Parallel Nonnegative CP Decomposition of Dense Tensors

The CP tensor decomposition is a low-rank approximation of a tensor. We present a distributed-memory parallel algorithm and implementation of an alternating optimization method for computing a CP decomposition of dense tensors that can enforce nonnegativity of the computed low-rank factors. The principal task is to parallelize the Matricized-Tensor Times Khatri-Rao Product (MTTKRP) bottleneck subcomputation. The algorithm is computation efficient, using dimension trees to avoid redundant computation across MTTKRPs within the alternating method. Our approach is also communication efficient, using a data distribution and parallel algorithm across a multidimensional processor grid that can be tuned to minimize communication. We benchmark our software on synthetic as well as hyperspectral image and neuroscience dynamic functional connectivity data, demonstrating that our algorithm scales well to 100s of nodes (up to 4096 cores) and is faster and more general than the currently available parallel software.

Ballard, Grey↗

Transient Data Library of Solar Grid Integrated Distributed System

This submission contains an open-source library of transient events in distributed system with high solar PV. The library includes the collected data, related documents and scripts for loading the data. The data library is built for transient event detection and machine learning based analysis algorithm development. The data was collected via both field test and software simulation. The units for the data are included in the data file headers for each data series. A text editor or spreadsheet software, such as Excel, and Matlab is required to view the data.

algorithms↗

Reducing the small-heart effect in pediatric gated myocardial perfusion single-photon emission computed tomography

Background: We compared two reconstruction algorisms and two cardiac functional evaluation software programs in terms of their accuracy for estimating ejection fraction (EF) of small hearts (SH). Methods: The study group consisted of 66 pediatric patients. Data were reconstructed using a filtered back projection (FBP) method without the resolution correction (RC) and an iterative method based on an ordered subset expectation maximization (OSEM) algorithm with the RC. EF was evaluated using two software programs of quantitative gated single-photon emission computed tomography (SPECT) (QGS) and cardioREPO. We compared the EF of gated myocardial perfusion SPECT to echocardiographic measurement (Echo). Results: Forty-eight of 66 patients had an end-systolic volume < 20 mL which was used as the criterion for being included in the SH group, and the SH effect led to an overestimation of EF. While significant differences were observed between Echo (66.9 ± 5.0%) and QGS-FBP without RC (76.9 ± 8.4%, P < .0001), QGS-OSEM with RC (76.6 ± 8.6%, P < .0001), and cardioREPO-FBP without RC (72.1 ± 10.0%, P = .0011), no significant difference was observed between Echo and cardioREPO-OSEM with RC (67.4 ± 6.1%) in SH group. Conclusions: In pediatric gated myocardial perfusion SPECT, the SH effect can be significantly reduced when an OSEM algorithm is used with RC in combination with the specific cardioREPO algorithm.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

P-Mart

P-Mart was designed specifically to allow cancer researchers to perform robust statistical processing of publicly available cancer proteomic datasets. To date an online statistical processing suite for proteomics does not exist. The P-Mart software is designed to allow statistical programmers to utilize these algorithms through packages in the R programming language as well as offering a web-based interface using the Azure cloud technology. The Azure cloud technology also allows the release of the software via Docker containers.

Source record↗

A Wrapper to Use a Machine-Learning-Based Algorithm for Earthquake Monitoring

Seismology is one of the main sciences used to monitor volcanic activity worldwide. Fast, efficient, and accurate seismicity detectors are crucial to assess the activity level of a volcano in near–real time and to issue timely warnings. Traditional real–time seismic processing software uses phase onset pickers followed by a phase association algorithm to declare an event and estimate its location. The pickers typically do not identify whether the detected phase is a P or S arrival, which can have a negative impact on hypocentral location quality and complicates phase association. We implemented the deep–neural–network–based method PhaseNet to identify in real time P and S seismic waves on data from one– and three–component seismometers. We tuned the Earthworm binder_ew associator module to use the phase identification from PhaseNet to detect and locate the events, which we archive in a SeisComP3 database. We assessed the performance of the algorithm by comparing the results with existing catalogs built to monitor seismic and volcanic activity in Mayotte and the Lesser Antilles region. Our algorithm, which we refer to as PhaseWorm, showed promising results in both contexts and clearly outperformed the previous automatic method implemented in Mayotte. As a result, this innovative real–time processing system is now operational for seismicity monitoring in Mayotte and Martinique.

58 GEOSCIENCES↗

Library for Evolutionary Algorithms in Python (LEAP)

There are generally three types of scientific software users: users that solve problems using existing science software tools, researchers that explore new approaches by extending existing code, and educators that teach students scientific concepts. Python is a general-purpose programming language that is accessible to beginners, such as students, but also as a language that has a rich scientific programming ecosystem that facilitates writing research software. Additionally, as high-performance computing (HPC) resources become more readily available, software support for parallel processing becomes more relevant to scientific software.There currently are no Python-based evolutionary computation frameworks that support all three types of scientific software users. Moreover, some support synchronous concurrent fitness evaluation that do not efficiently use HPC resources. We pose here a new Python-based EC framework that uses an established generalized unified approach to EA concepts to provide an easy to use toolkit for users wishing to use an EA to solve a problem, for researchers to implement novel approaches, and for providing a low-bar to entry to EA concepts for students. Additionally, this toolkit provides a scalable asynchronous fitness evaluation implementation friendly to HPC that has been vetted on hardware ranging from laptops to the world’s fastest supercomputer, Summit.

Coletti, Mark↗

FInd Gas Source

FIGS is a neural network software that ingests real time synchronized field data on environmental flow fields and turbulence and gas concentration variations at high frequency and uses an error minimization algorithm to locate the gas source and quantify its strength. The software can be interfaced with atmospheric, oceanic and subsurface instruments in a variety of platforms stationary or mobile (e.g. cars, UAVs, submersible vehicles or boreholes) and used to find gas sources by smart use of data and phenomenology. FIGS can be trained by phenomenological model of the flow fields in the environment of interest and/or be calibrated by controlled release. After initial deployment the FIGS learning will grow with time as it accumulates data on source quantification. FIGS can be installed on any computer from small beagle-bones for field deployment/end-use to PC/MACs/main-frame for training/analysis. FIGS has been trained (using LANL's high resolution atmospheric simulations) and calibrated, tested and evaluated in the field and shown to perform well in finding and quantifying methane leaks at 10-100m scales at well pads by ingesting atmospheric measurements. The code is applicable to gas and particle source location at large scales.

Travis, Bryan↗

TorchBraid: High-Performance Layer-Parallel Training of Deep Neural Networks with MPI and GPU Acceleration

TorchBraid is a high-performance implementation of layer-parallel training for deep neural networks (DNNs) supporting MPI-based parallelism and GPU acceleration. Layer-parallel training has been developed to overcome the serialization inherent in forward and backward propagation of DNNs that limits utilization of computational resources in the strong scaling limit. To achieve this, TorchBraid integrates the PyTorch neural network framework with the state-of-the-art XBraid time-parallel library. Furthermore, this article presents the use and performance of TorchBraid, in addition to solutions for overcoming the algorithmic challenges inherent in combining automatic differentiation with layer-parallel. Results are presented with and without GPU acceleration for the Tiny ImageNet and MNIST image classification data sets, as well as recurrent neural networks. Overall, TorchBraid enables fast training of DNNs, both in a strong and weak scaling context. In addition to the TorchBraid software, several new advances in applying layer-parallel algorithms are detailed. Integration of layer-parallel with data-parallel algorithms is presented for the first time, showing the computational advantages of the combination. Standard deep learning techniques, like batch-normalization, are developed for layer-parallel training. Finally, a new approach combining layer-parallel with spatial coarsening in order to accelerate training for 3D image classification shows roughly a 10× speedup over serial execution.

Layer-parallel↗

SDynPy: A Structural Dynamics Python Library

SAND2023-11957O SDynPy software can be used in digital signal processing, modal analysis, and geometry algorithms that are available in open literature, specifically the Synthesize Modes and Correlate and polynomial-based multiple reference modal fitters. This software can be used to perform structural dynamic testing and analysis. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Rohe, Daniel↗

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗

ExaSGD: 2022 Kernel Thrust Activities

The Kernel Thrust milestone ADSE22-407 covers the development of device-capable optimization algorithms and solvers technologies required by the ExaSGD project’s software stack in order to solve security-constrained alternating current optimal power flow (SC-ACOPF) problems on emerging exascale architectures. To this extent, in FY22 the main objective of the Kernel Thrust was (i) provide sparse optimization solver that runs efficiently on hardware accelerator devices (i.e., NVIDIA and AMD GPUs) to perform intra-node computations, (ii) strengthen the reliability and increase the performance of the mixed-dense sparse (MDS) solver of HiOp for deployment on the FY22 target architectures, Summit and Crusher, and (iii) increase performance by improving the mathematical algorithm and refining the parallel MPI-based implementation of the coarse-grain parallel solver HiOp-PriDec for capabilities deployment on the FY22 target architectures, Summit and Crusher. This document presents the developments and contributions done by the Kernels Thrust Team in FY22 toward completion of the above-mentioned objectives. These contributions progressed along four main development (sub)thrusts: (1) Design and implementation of a sparse optimization solver for use on hardware accelerators; (2) Improvement of the mathematical algorithm and of the parallel implementation of HiOp-PriDec to ensure readiness and efficient coarse-grain parallelism for FY23 target exascale machine; and (3) Support Software and Application Development Thrusts of the exaSGD project in their deployment of the project’s software stack on AMD- and NVIDIA-based architectures. The development of the sparse optimization solver (thrust 1 above) was new in FY22 and resulted in a new sparse solver in HiOp (available as of version 0.6). The second development thrust was a continuation of the efforts from FY21 and improved the mathematical algorithm and the communication strategy of the HiOp-PriDec solver. The last developement thrust is a large collaborative effort. Namely, the project’s teams from multiple labs (LLNL, PNNL, ORNL, and NREL) performed large-scale demonstration of the ExaSGD software stack, namely the optimization solvers of HiOp interfaced with the modeling front-end ExaGO and the stochastic sampler PowerScenarios. These demonstration efforts solved large-scale instances of the SC-ACOPF challenge problem of medium network sizes (10, 000-bus system) and large number of contingencies on Summit (NVIDIA accelerators) and Crusher (AMD accelerators) systems at ORNL.

97 MATHEMATICS AND COMPUTING↗

Symmetry Analysis Using Symbolic Computation

The symmetry group of a system of differential equations reveals basic invariant properties of the underlying model and its solutions. In many cases symmetry groups have simple geometric interpretations that can be applied to simplify the model and determine certain classes of solutions explicitly. The general procedure to compute the symmetry group of a given system of differential equations follows a well-known algorithm. However, this procedure involves a large number of laborious and usually error-prone calculations, especially in the case of higher-order systems. The purpose of this report is explain how to use an existing software program designed to automate the major steps of this algorithm in order to calculate the symmetry group of any system of differential equations more efficiently.

97 MATHEMATICS AND COMPUTING↗

Statement of Work Third Party Algorithm Development and Evaluation of Detection of Liquid Explosives in Dual-Energy Digital Radiographic/TIP Ready X-ray Images - Public Version

The purpose of this statement of work is for third party collaborators to train, validate and have Lawrence Livermore National Security, LLC (LLNS) evaluate algorithms to detect liquid threats in digital radiography (DR)/TIP Ready X-ray (TRX) images that will be provided by LLNS through the Transportation and Security Administration (TSA). LLNS will provide a set of images with threat(s) to determine detection rates and non-threat images from airports to determine false alarm rates. A key including a bounding box showing the locations of the threats and non-threats will be provided for the images. It is expected that the Subcontractor shall use half of the images with their keys for training the algorithms and the other half shall be used for validation (third party evaluation) purposes. The Subcontractor shall not use the key to the second half of the data other than for the validation and reporting of the performance of its algorithm (not for training). The Subcontractor has 45 business days from the receipt of datasets and the Subcontract to: (1) Run their detection/classification algorithms on the data; (2) Deliver a final report describing their performance by generating Receiver Operator Characteristic (ROC) curves using their algorithm; and (3) Deliver a copy of the third party's executable software (already trained and validated by the datasets) to LLNL accompanied by a user manual. LLNS will evaluate the performance of the same algorithm on another separate set of data. LLNS evaluation of the Subcontractor's algorithm will be documented in a final report within 30 days of receiving the executable code. This report will be sent to TSA and the report may be disseminated to the Subcontract at TSA's discretion.

42 ENGINEERING↗

An analysis pipeline for the inference of protein-protein interaction networks

An analysis pipeline has been created for deployment of a novel algorithm, the Bayesian Estimator of Protein-Protein Association Probabilities (BEPro), for use in the reconstruction of protein-protein interaction networks. We have combined the Software Environment for BIological Network Inference (SEBINI), an interactive environment for the deployment and testing of network inference algorithms that use high-throughput data, and the Collective Analysis of Biological Interaction Networks (CABIN), software that allows integration and analysis of protein-protein interaction and gene-to-gene regulatory evidence obtained from multiple sources, to allow interactions computed by BEPro to be stored, visualized, and further analyzed. Incorporating BEPro into SEBINI and automatically feeding the resulting inferred network into CABIN, we have created a structured workflow for protein-protein network inference and supplemental analysis from sets of mass spectrometry bait-prey experiment data. SEBINI demo site: https://www.emsl.pnl.gov /SEBINI/ Contact: ronald.taylor@pnl.gov. BEPro is available at http://www.pnl.gov/statistics/BEPro3/index.htm. Contact: ds.daly@pnl.gov. CABIN is available at http://www.sysbio.org/dataresources/cabin.stm. Contact: mudita.singhal@pnl.gov.

59 BASIC BIOLOGICAL SCIENCES↗

FermiLib v0.1

FermiLib is an open source software package designed to facilitate the development and testing of algorithms for simulations of fermionic systems on quantum computers. Fermionic simulations represent an important application of early quantum devices with a lot of potential high value targets, such as quantum chemistry for the development of new catalysts. This software strives to provide a link between the required domain expertise in specific fermionic applications and quantum computing to enable more users to directly interface with, and develop for, these applications. It is an extensible Python library designed to interface with the high performance quantum simulator, ProjectQ, as well as application specific software such as PSI4 from the domain of quantum chemistry. Such software is key to enabling effective user facilities in quantum computation research.

MCCLEAN, JARROD↗