Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithms scalability”

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 991 records · Page 55
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

PWR loading pattern optimization with reinforcement learning

The core loading pattern optimization problem belongs to the class of combinatorial optimization problem and has been studied since the dawn of commercial nuclear energy industry. It is characterized by multiple objectives and constraints, with a very high number of candidate patterns, which makes it impossible to solve explicitly. Stochastic optimization methodologies including Genetic Algorithms and Simulated Annealing are used by different nuclear utilities and vendors to perform fuel cycle reload design. Nevertheless, hand-designed solutions continue to be the prevalent method in the industry. To improve the state-of-the-art core reload patterns, we aim to create a method as scalable as possible, that agrees with the designer's goal of performance and safety. To help in this task Deep Reinforcement Learning (DRL), in particular Proximal Policy Optimization is leveraged. DRL has recently experienced a strong impetus from its successes applied to games, sometimes even reaching 'super-human' performances. This paper lays out the foundation of this method and proposes to study the behavior of several hyper-parameters that influence the DRL algorithm. The algorithm is highly dependent on multiple factors such as an exploration/exploitation trade-off that manifests through different parameters such as the number of loading patterns seen and the number of samples collected before a policy update, but also the shape of the objective function derived for the core design. Experimental results also demonstrate the effectiveness of the method in finding high-quality solutions from scratch within a reasonable amount of time. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2017

Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2012

Advanced, Integrated Control for Building Operations to Achieve 40% Energy Saving

We developed and demonstrated a software based integrated advanced building control platform called Smart Energy Box (SEB), which can coordinate building subsystem controls, integrate variety of energy optimization algorithms and provide proactive and collaborative energy management and control for building operations using weather and occupancy information. The integrated control system is a low cost solution and also features: Scalable component based architecture allows to build a solution for different building control system configurations with needed components; Open Architecture with a central data repository for data exchange among runtime components; Extendible to accommodate variety of communication protocols. Optimal building control for central loads, distributed loads and onsite energy resource; uses web server as a loosely coupled way to engage both building operators and building occupants in collaboration for energy conservation. Based on the open platform of SEB, we have investigated and evaluated a variety of operation and energy saving control strategies on Carnegie Mellon University Intelligent Work place which is equipped with alternative cooling/heating/ventilation/lighting methods, including radiant mullions, radiant cooling/heating ceiling panels, cool waves, dedicated ventilation unit, motorized window and blinds, and external louvers. Based on the validation results of these control strategies, they were integrated in SEB in a collaborative and dynamic way. This advanced control system was programmed and computer tested with a model of the Intelligent Workplace's northern section (IW n ). The advanced control program was then installed in the IW n control system; the performance was measured and compared with that of the state of the art control system to verify the overall energy savings great than 40%. In addition advanced human machine interfaces (HMI's) were developed to communicate both with building occupants and the building operator. Lifecycle cost analyses of the advanced building control were performed, and a Building Control System Guide was prepared and published to inform owners, architects, and engineers dealing with new construction or renovation of buildings.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2013

Revisiting Parallel Cyclic Reduction and Parallel Prefix-Based Algorithms for Block Tridiagonal System of Equations

Simulations that require solutions of block tridiagonal systems of equations rely on fast parallel solvers for runtime efficiency. Leading parallel solvers that are highly effective for general systems of equations, dense or sparse, are limited in scalability when applied to block tridiagonal systems. This paper presents scalability results as well as detailed analyses of two parallel solvers that exploit the special structure of block tridiagonal matrices to deliver superior performance, often by orders of magnitude. A rigorous analysis of their relative parallel runtimes is shown to reveal the existence of a critical block size that separates the parameter space spanned by the number of block rows, the block size and the processor count, into distinct regions that favor one or the other of the two solvers. Dependence of this critical block size on the above parameters as well as on machine-specific constants is established. These formal insights are supported by empirical results on up to 2,048 cores of a Cray XT4 system. To the best of our knowledge, this is the highest reported scalability for parallel block tridiagonal solvers to date.

Seal, Sudip K↗
DOE OSTI2023

ActiveBAS: A Low-cost, Scalable Control Solution for Grid-Interactive Small and Medium Sized Commercial Buildings

This project aims to develop and enhance a low-cost, highly scalable control solution for Small and Medium-Sized Commercial Buildings (SMCB), assess the business potential at multiple sites, and perform commercialization efforts. The technology can be applied to any buildings served by multiple units, with the benefits being greatest for open-spaced buildings, such as banks, retail stores, restaurants, and factories. This project aims to develop an affordable control solution for: 1) SMCB grid responsiveness, 2) reduction of GHG by changing unit operations, 3) greater reduction in utility costs, and 4) rapid adoption in the marketplace. The proposed technology will be built on a previously developed and demonstrated MPC solution. The minimal sensor requirement and less need of control expertise are the unique feature of the algorithm that leads to low capital and maintenance costs, and short installation and implementation time. These attributes contribute to low capital and maintenance costs, as well as a short installation and implementation time. However, these advantages come with a trade-off: increased difficulties and unreliability when applying traditional modeling and MPC control approaches due to limited information. This final report describes the modeling approaches developed and tested to overcome these challenges. It begins by outlining the modeling challenge posed by minimal sensor requirements, then delves into the proposed modeling approaches, which primarily involve system identification. Finally, preliminary test results for a simulation case study are presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Quantifying uncertainty for deep learning based forecasting and flow-reconstruction using neural architecture search ensembles

Classical problems in computational physics such as data-driven forecasting and signal reconstruction from sparse sensors have recently seen an explosion in deep neural network (DNN) based algorithmic approaches. However, most DNN models do not provide uncertainty estimates, which are crucial for establishing the trustworthiness of these techniques in downstream decision making tasks and scenarios. In recent years, ensemble-based methods have achieved significant success for the uncertainty quantification in DNNs on a number of benchmark problems. However, their performance on real-world applications remains under-explored. In this work, we present an automated approach to DNN discovery and demonstrate how this may also be utilized for ensemble-based uncertainty quantification. Specifically, we propose the use of a scalable neural and hyperparameter architecture search for discovering an ensemble of DNN models for complex dynamical systems. We highlight how the proposed method not only discovers high-performing neural network ensembles for our tasks, but also quantifies uncertainty seamlessly. This is achieved by using genetic algorithms and Bayesian optimization for sampling the search space of neural network architectures and hyperparameters. Subsequently, a model selection approach is used to identify candidate models for an ensemble set construction. Afterwards, a variance decomposition approach is used to estimate the uncertainty of the predictions from the ensemble. We demonstrate the feasibility of this framework for two tasks — forecasting from historical data and flow reconstruction from sparse sensors for the sea-surface temperature. In conclusion, we demonstrate superior performance from the ensemble in contrast with individual high-performing models and other benchmarks.

Deep ensembles↗
DOE OSTI2023

Two-fluid physical modeling of superconducting resonators in the ARTEMIS framework

In this work, we implement a new London equation module for superconductivity in the GPU-enabled ARTEMIS framework, and couple it to a finite-difference time-domain solver for Maxwell's equations. We apply this two-fluid approach to model a superconducting coplanar waveguide (CPW) resonator. We validate our implementation by verifying that the theoretical skin depth and reflection coefficients can be obtained for several superconductive materials, with different London penetration depths, over a range of frequencies. Our convergence studies show that the algorithm is second-order accurate in both space and time, except at superconducting interfaces where the approach is spatially first-order. In our CPW simulations, we leverage the GPU scalability of our code to compare the two-fluid model to more traditional approaches that approximate superconducting behavior and demonstrate that superconducting physics can show comparable performance to the assumption of quasi-infinite conductivity as measured by the Q-factor.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection

Graph mining is an important data analysis methodology, but struggles as the input graph size increases. The scalability and usability challenges posed by such large graphs make it imperative to sample the input graph and reduce its size. The critical challenge in sampling is to identify the appropriate algorithm to insure the resulting analysis does not suffer heavily from the data reduction. Predicting the expected performance degradation for a given graph and sampling algorithm is also useful. In this paper, we present different sampling approaches for graph mining applications such as Frequent Subgrpah Mining (FSM), and Community Detection (CD). We explore graph metrics such as PageRank, Triangles, and Diversity to sample a graph and conclude that for heterogeneous graphs Triangles and Diversity perform better than degree based metrics. We also present two new sampling variations for targeted graph mining applications. We present empirical results to show that knowledge of the target application, along with input graph properties can be used to select the best sampling algorithm. We also conclude that performance degradation is an abrupt, rather than gradual phenomena, as the sample size decreases. We present the empirical results to show that the performance degradation follows a logistic function.

Purohit, Sumit↗
DOE OSTI2013

Developing Load Cell Monitoring on the Mock UF 6 Feed and Withdrawal System

A proof-of-concept load cell monitoring system has been developed for the Mock Feed and Withdrawal (F&W) System at Oak Ridge National Laboratory (ORNL). This system leverages industry-standard commercial off-the-shelf (COTS) hardware and software in a modular and scalable design. The Mock F&W System was designed to simulate operations at a uranium hexafluoride (UF 6 ) gas centrifuge enrichment plant F&W area. It provides a test bed for process-monitoring technologies. Water, used as a surrogate for UF 6 , is pumped from three feed tanks, through a process surge tank, and is then cut between two tails tanks and three product tanks. The weight of the each tank is continuously monitored using a load cell monitoring system. In addition to the F&W stations, large and small accountancy stations are monitored. The Mock F&W System allows ORNL to test and evaluate capabilities of industry-standard process monitoring hardware and software. A variety of commonly used weighing indicators are connected to the load cells to monitor the weight at each station. These weighing indicators are representative of the types likely found in operating facilities. A data center modeled after those currently used for international safeguards was installed to collect and manage the weight data. This data center provides a robust and flexible test bed for testing and developing software solutions. COTS software packages that leverage industry-standard communication protocols provide a data flow architecture that is modular, interoperable, and scalable. One software package provides communication drivers to collect the raw weight data from the weighing indicators. A data historian is used to store the raw data. Custom in-house algorithms have been developed using MATLAB to analyze the raw historical data and to automatically identify process information. This information includes the number of cycles completed and the mass of material transferred from stations to the process. The process information identified by the analysis is stored in a Microsoft SQL Server database. Visualization concepts have been developed that display the analyzed process information alongside visually compelling plots and animations of the raw data. The load cell monitoring system developed on the Mock F&W System was designed as a proof of concept that could be scaled to a field trial at an operating facility. This system, built with industry standard hardware and software, has allowed ORNL to develop capabilities that provide confidence in the ability to leverage existing operator load cell monitoring equipment with minimal impact on operations. The international safeguards community is evaluating the use of load cell monitoring as an additional safeguards measure; this system demonstrates a practical solution to collect, store, analyze, and visualize load cell weight data.

commercial off the shelf↗
NASA NTRS2004

A Scalable Nonuniform Pointer Analysis for Embedded Program

In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and elements of arrays. The main contribution consists of an efficient yet precise algorithm that can handle multithreaded programs. We first perform an inexpensive flow-sensitive analysis of each function in the program that generates semantic equations describing the effect of the function on the memory graph. These equations bear numerical constraints that describe nonuniform points-to relationships. We then iteratively solve these equations in order to obtain an abstract storage graph that describes the shape of data structures at every point of the program for all possible thread interleavings. We bring experimental evidence that this approach is tractable and precise for real-size embedded applications.

Venet, Arnaud↗
NASA NTRS2014

Distributed Prognostics based on Structural Model Decomposition

Within systems health management, prognostics focuses on predicting the remaining useful life of a system. In the model-based prognostics paradigm, physics-based models are constructed that describe the operation of a system and how it fails. Such approaches consist of an estimation phase, in which the health state of the system is first identified, and a prediction phase, in which the health state is projected forward in time to determine the end of life. Centralized solutions to these problems are often computationally expensive, do not scale well as the size of the system grows, and introduce a single point of failure. In this paper, we propose a novel distributed model-based prognostics scheme that formally describes how to decompose both the estimation and prediction problems into independent local subproblems whose solutions may be easily composed into a global solution. The decomposition of the prognostics problem is achieved through structural decomposition of the underlying models. The decomposition algorithm creates from the global system model a set of local submodels suitable for prognostics. Independent local estimation and prediction problems are formed based on these local submodels, resulting in a scalable distributed prognostics approach that allows the local subproblems to be solved in parallel, thus offering increases in computational efficiency. Using a centrifugal pump as a case study, we perform a number of simulation-based experiments to demonstrate the distributed approach, compare the performance with a centralized approach, and establish its scalability. Index Terms-model-based prognostics, distributed prognostics, structural model decomposition ABBREVIATIONS

centrifugal pump↗
NASA NTRS2022

Towards the Development of a Multi-Agent Cognitive Networking System for the Lunar Environment

This paper details the development of a multi-agent cognitive system intended to optimize networking performance in the lunar environment. One concept of the future of lunar communication, LunaNet, outlines a complex network of networks. Challenges such as scalability, interoperability, and reliability must first be addressed to successfully fulfill this vision. Machine intelligence can greatly reduce the reliance on human operators and enable efficient operations for tasks such as scheduling and network management. Machine learning, artificial intelligence, and other automated decision-making techniques can be used to allow network nodes to intelligently sense and adapt to changes in the environment such as link disruptions, new nodes joining the network, and support for a diverse range of protocols. Cognitive networking seeks to evolve these technologies into an autonomous system with improved science data return, reliability, and scalability. In this paper, we study four main areas as a means to further develop cognitive networking capabilities: networking protocol development, analysis of wireless data for modeling and simulation, development of algorithms for a multi-agent system, and spectrum sensing technology.

cognitive networking↗
DOE OSTI2023

"Enabling Mixed Autonomy Traffic Control"

We demonstrate a new capability of automated vehicles: mixed autonomy traffic control. With this new capability, automated vehicles can shape the traffic flows composed of other non-automated vehicles, which has the promise to improve safety, efficiency, and energy outcomes in transportation systems at a societal scale. Investigating mixed autonomy mobile traffic control must be done in situ given that the complex dynamics of other drivers and their response to a team of automated vehicles cannot be effectively modeled. This capability has been blocked because there is no existing scalable and affordable platform for experimental control. This paper introduces an extensible open-source hardware and software platform, enabling a team of 100 vehicles to execute several different vehicular control algorithms as a collaborative fleet, composed of three different makes and models, which drove 22752 miles in a combined 1022 hours, over 5 days in Nashville, TN in November 2022.

Nice, Matthew↗
DOE OSTI2015

Distributed Sensor Coordination for Advanced Energy Systems

Motivation: The ability to collect key system level information is critical to the safe, efficient and reliable operation of advanced power systems. Recent advances in sensor technology have enabled some level of decision making directly at the sensor level. However, coordinating large numbers of sensors, particularly heterogeneous sensors, to achieve system level objectives such as predicting plant efficiency, reducing downtime or predicting outages requires sophisticated coordination algorithms. Indeed, a critical issue in such systems is how to ensure the interaction of a large number of heterogenous system components do not interfere with one another and lead to undesirable behavior. Objectives and Contributions: The long-term objective of this work is to provide sensor deployment, coordination and networking algorithms for large numbers of sensors to ensure the safe, reliable, and robust operation of advanced energy systems. Our two specific objectives are to: 1. Derive sensor performance metrics for heterogeneous sensor networks. 2. Demonstrate effectiveness, scalability and reconfigurability of heterogeneous sensor network in advanced power systems. The key technical contribution of this work is to push the coordination step to the design of the objective functions of the sensors, allowing networks of heterogeneous sensors to be controlled. By ensuring that the control and coordination is not specific to particular sensor hardware, this approach enables the design and operation of large heterogeneous sensor networks. In addition to the coordination coordination mechanism, this approach allows the system to be reconfigured in response to changing needs (e.g., sudden external events requiring new responses) or changing sensor network characteristics (e.g., sudden changes to plant condition). Impact: The impact of this work extends to a large class of problems relevant to the National Energy Technology Laboratory including sensor placement, heterogeneous sensor coordination, and sensor network control in advanced power systems. Each application has specific needs, but they all share the one crucial underlying problem: how to ensure that the interactions of a large number of heterogenous agents lead to coordinated system behavior. This proposal describes a new paradigm that addresses that very issue in a systematic way. Key Results and Findings: All milestones have been completed. Our results demonstrate that by properly shaping agent objective functions, we can develop large (up to 10,000 devices) heterogeneous sensor networks with key desirable properties. The first milestone shows that properly choosing agent-specific objective functions increases system performance by up to 99.9% compared to global evaluations. The second milestone shows evolutionary algorithms learn excellent sensor network coordination policies prior to network deployment, and these policies can be refined online once the network is deployed. The third milestone shows the resulting sensor networks networks are extremely robust to sensor noise, where networks with up to 25% sensor noise are capable of providing measurements with errors on the order of 10 -3 . The fourth milestone shows the resulting sensor networks are extremely robust to sensor failure, with 25% of the sensors in the system failing resulting in no significant performance losses after system reconfiguration.

42 ENGINEERING↗
DOE OSTI2024

Pan-tropical daily L-band microwave land surface emissivity retrieval from GNSS-R observations

The uncertainties in microwave land surface emissivity (MLSE) measurements have long limited the use of spaceborne microwave radiometer data. As an emerging observation method, Global Navigation Satellite System Reflectometry (GNSS-R) has demonstrated great potential in several land and ocean applications. In this study, a method for obtaining daily MLSE dataset in the pan-tropical region from Cyclone GNSS (CYGNSS) observations is presented and evaluated. The CYGNSS observations are first aggregated into the Equal-Area-Scalable-Earth (EASE) 2.0 36 km grid by a combined weight function of distance, time, and signal-to-noise ratio variance. Then, the method employs a pixel-by-pixel regression algorithm to conduct the daily MLSE retrieval using reference emissivity derived from the Soil Moisture Active Passive (SMAP) brightness temperature. The CYGNSS MLSE shows good agreement with SMAP MLSE, delivering an overall root-mean-square error (RMSE) of 0.022 and 0.017 for horizontal and vertical polarization, respectively, during the training set spanning the whole year of 2018. Furthermore, on the test set from January 2019 to May 2019, the RMSE values amounted to 0.030 and 0.023 for horizontal and vertical polarization, respectively. Temperature records from the International Soil Moisture Network are employed to calculate the emissivity and for in-situ validation, which yield an RMSE of 0.034 and 0.026 for the two polarizations, respectively. The proposed algorithm provides an encouraging approach to obtain accurate daily MLSE dataset for microwave remote sensing. Compared to the SMAP MLSE, the CYGNSS MLSE has a remarkable improvement of 86% in temporal resolution, greatly complementing the existing microwave emissivity datasets.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

High-Performance Computing Based EMT Simulation: Power Grid with IBRs

Electromagnetic transient (EMT) simulation of power grids with high-fidelity models of inverter-based resources (IBRs) is time-consuming and difficult to scale. The necessity for high-fidelity models of IBRs that incorporate the dynamics of individual inverters within IBRs has been showcased in recent studies. These studies focused on events with partial power reduction in each IBR during a transmission line fault in the power grid. These types of events have been documented in multiple North American Electric Reliability Council (NERC) reports in the past decade. It is imperative then to find solutions to speed-up EMT simulations and scale the size of the region with IBRs studied in EMT simulations. In this paper, a combination of numerical simulation algorithms with high-performance computing techniques are employed in discretization and linear solvers employed in the proposed RE-INTEGRATE EMT simulation platform for power grid with IBRs. For ease of scalability, modular and object-oriented programming is used as these techniques are implemented. Additionally, automation software is developed to convert legacy software codes to the proposed RE-INTEGRATE EMT simulation platform. Thereafter, this platform is evaluated on multi-core central processing units (CPUs). Finally, scale-up tests are performed to showcase the scalability that is possible.

Marthi, Phani Ratna Vanamali [ORNL] (ORCID:0000000↗
DOE OSTI2022

VQE method: a short survey and recent developments

Abstract The variational quantum eigensolver (VQE) is a method that uses a hybrid quantum-classical computational approach to find eigenvalues of a Hamiltonian. VQE has been proposed as an alternative to fully quantum algorithms such as quantum phase estimation (QPE) because fully quantum algorithms require quantum hardware that will not be accessible in the near future. VQE has been successfully applied to solve the electronic Schrödinger equation for a variety of small molecules. However, the scalability of this method is limited by two factors: the complexity of the quantum circuits and the complexity of the classical optimization problem. Both of these factors are affected by the choice of the variational ansatz used to represent the trial wave function. Hence, the construction of an efficient ansatz is an active area of research. Put another way, modern quantum computers are not capable of executing deep quantum circuits produced by using currently available ansatzes for problems that map onto more than several qubits. In this review, we present recent developments in the field of designing efficient ansatzes that fall into two categories—chemistry–inspired and hardware–efficient—that produce quantum circuits that are easier to run on modern hardware. We discuss the shortfalls of ansatzes originally formulated for VQE simulations, how they are addressed in more sophisticated methods, and the potential ways for further improvements.

Fedorov, Dmitry A. (ORCID:0000000316598580)↗
NASA NTRS1996

SAM-FS: LSC's New Solaris-Based Storage Management Product

SAM-FS is a full featured hierarchical storage management (HSM) device that operates as a file system on Solaris-based machines. The SAM-FS file system provides the user with all of the standard UNIX system utilities and calls, and adds some new commands, i.e. archive, release, stage, sls, sfind, and a family of maintenance commands. The system also offers enhancements such as high performance virtual disk read and write, control of the disk through an extent array, and the ability to dynamically allocate block size. SAM-FS provides 'archive sets' which are groupings of data to be copied to secondary storage. In practice, as soon as a file is written to disk, SAM-FS will make copies onto secondary media. SAM-FS is a scalable storage management system. The system can manage millions of files per system, though this is limited today by the speed of UNIX and its utilities. In the future, a new search algorithm will be implemented that will remove logical and performance restrictions on the number of files managed.

Angell, Kent↗