Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic development”

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 271 records · Page 15

Evaluation of the Reconstruction Accuracy of the Ultrasound Model–Based Image Reconstruction (U-MBIR) Method for Concrete to Optimize Damage Detection

Reinforced concrete is a critical structural material used to construct nuclear power plants (NPPs). As such, its safety and performance must be thoroughly examined throughout the life cycle of the NPP infrastructure system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To support the development of these techniques, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. In the work documented in this report, the U-MBIR methodology was applied to four sets of ultrasonic data collected from concrete specimens. The results demonstrate that the U-MBIR algorithm can successfully detect defects within the four concrete samples. The reconstruction images help identify the specimen thickness, regions of delamination, and location of rebar embedded within the concrete. The reconstruction images allow engineers and technicians to characterize the internal defects within concrete specimens and structural members. Ultimately, this knowledge can guide engineers in making informed decisions regarding the performance, safety, and reliability of structural materials (i.e., reinforced concrete) throughout the life cycle of NPPs.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Experimental Evidence on Latency in a Fleet of Controllable Water Heaters

Demand response is an important emerging part of smart grids with wide coverage in theoretical and modeling research. However, experimental evidence on the real-life behavior of controllable loads is still limited. We present observations regarding latency and communication aspects of the operation on a fleet of residential water heaters in a smart neighborhood in Atlanta, GA. Our analysis shows that latency in water heaters is not constant and does not follow a Gaussian distribution. We also find that there is a systematic relationship between latency and hour of the day. Latency was found to increase during morning and evening hours compared to the afternoon. These findings could help better plan deployment of control for demand response programs. Understanding delays associated with controlling smart devices is crucial for proper design and algorithm development for optimization, frequency of dispatch, and override detection.

communication delay↗

Model-Based Sensor Placement for Component Condition Monitoring and Fault Diagnosis in Fossil Energy Systems

Design and operation of energy producing, near “zero-emission” coal plants has become a national imperative. This report on model-based sensor placement describes a transformative two-tier approach to identify the optimum placement, number, and type of sensors for condition monitoring and fault diagnosis in fossil energy system operations. The algorithms are tested on a high fidelity model of the integrated gasification combined cycle (IGCC) plant. For a condition monitoring network, whether equipment should be considered at a unit level or a systems level depends upon the criticality of the process equipment, its likeliness to fail, and the level of resolution desired for any specific failure. Because of the presence of a high fidelity model at the unit level, a sensor network can be designed to monitor the spatial profile of the states and estimate fault severity levels. In an IGCC plant, besides the gasifier, the sour water gas shift (WGS) reactor plays an important role. In view of this, condition monitoring of the sour WGS reactor is considered at the unit level, while a detailed plant-wide model of gasification island, including sour WGS reactor and the Selexol process, is considered for fault diagnosis at the system-level. Finally, the developed algorithms unify the two levels and identifies an optimal sensor network that maximizes the effectiveness of the overall system-level fault diagnosis and component-level condition monitoring. This work could have a major impact on the design and operation of future fossil energy plants, particularly at the grassroots level where the sensor network is yet to be identified. In addition, the same algorithms developed in this report can be further enhanced to be used in retrofits, where the objectives could be upgrade (addition of more sensors) and relocation of existing sensors.

20 FOSSIL-FUELED POWER PLANTS↗

Improving the SWAT forest module for enhancing water resource projections: A case study in the St. Croix River basin

Abstract Insufficiently calibrated forest parameters of the Soil & Water Assessment Tool (SWAT) may introduce uncertainties to water resource projections in forested watersheds. In this study, we improved SWAT forest parameterization and phosphorus cycling representations to better simulate forest ecosystems in the St. Croix River basin, and we further examined how those improvements affected model projections of streamflow, sediment, and nitrogen export under future climate conditions. Simulations with improved forest parameters substantially reduced model estimates of water, sediment, and nitrogen fluxes relative to those based on default parameters. Differences between improved and default projections can be attributed to the enhanced representation of forest water consumption, nutrient uptake, and protection of soil from erosion. Better representation of forest ecosystems in SWAT contributes to constraining uncertainties in water resource projections. Results of this study highlight the importance of improving SWAT forest ecosystem representations in projecting delivery of water, sediment, and nutrients from land to rivers in response to climate change, particularly for watersheds with large areas of forests. Improved forest parameters and the phosphorus weathering algorithms developed in this study are expected to help enhance future applications of SWAT to investigate hydrological and biogeochemical consequences of climate change.

Yang, Qichun↗

VERSION 1 OF THE HUBBLE SOURCE CATALOG

The Hubble Source Catalog is designed to help optimize science from the Hubble Space Telescope (HST) by combining the tens of thousands of visit-based source lists in the Hubble Legacy Archive (HLA) into a single master catalog. Version 1 of the Hubble Source Catalog includes WFPC2, ACS/WFC, WFC3/UVIS, and WFC3/IR photometric data generated using SExtractor software to produce the individual source lists. The catalog includes roughly 80 million detections of 30 million objects involving 112 different detector/filter combinations, and about 160,000 HST exposures. Source lists from Data Release 8 of the HLA are matched using an algorithm developed by Budavári and Lubow. The mean photometric accuracy for the catalog as a whole is better than 0.10 mag, with relative accuracy as good as 0.02 mag in certain circumstances (e.g., bright isolated stars). The relative astrometric residuals are typically within 10 mas, with a value for the mode (i.e., most common value) of 2.3 mas. The absolute astrometric accuracy is better than 0{sup ″} .1 for most sources, but can be much larger for a fraction of fields that could not be matched to the PanSTARRS, SDSS, or 2MASS reference systems. In this paper we describe the database design with emphasis on those aspects that enable the users to fully exploit the catalog while avoiding common misunderstandings and potential pitfalls. We provide usage examples to illustrate some of the science capabilities and data quality characteristics, and briefly discuss plans for future improvements to the Hubble Source Catalog.

79 ASTRONOMY AND ASTROPHYSICS↗

Joint Sparsity Pattern Recovery With 1-b Compressive Sensing in Distributed Sensor Networks

In this paper, we study the problem of joint sparse support recovery with 1-b quantized compressive measurements in a distributed sensor network. Multiple nodes in the network are assumed to observe sparse signals having the same but unknown sparse support. Each node quantizes its measurement vector element-wise to 1 b. First, we consider that all the quantized measurements are available at a central fusion center. We derive performance bounds for sparsity pattern recovery using 1-bit quantized measurements from multiple sensors when the maximum likelihood decoder is employed. We further develop two computationally tractable algorithms for joint sparse support recovery in the centralized setting. One algorithm minimizes a cost function defined as the sum of the likelihood function and the l-∝ quasi-norm, while the other algorithm extends the binary iterative hard thresholding algorithm to the multiple measurement vector case. Second, we consider a decentralized setting where each node transmits 1-b measurements to its one-hop neighbors. The basic idea behind the algorithms developed in the decentralized setting is to embed collaboration among nodes and fusion strategies. We show that even with noisy 1-b compressed measurements, joint support recovery can be carried out accurately in both centralized and decentralized settings. Additionally, we further show that the performance of the proposed 1-bit compressive sensing-based algorithms is very close to that of their real-valued counterparts except when the signal-to-noise ratio is very small.

97 MATHEMATICS AND COMPUTING↗

Development of flow network analysis code for block type VHTR core by linear theory method

VHTR (Very High Temperature Reactor) is high-efficiency nuclear reactor which is capable of generating hydrogen with high temperature of coolant. PMR (Prismatic Modular Reactor) type reactor consists of hexagonal prismatic fuel blocks and reflector blocks. The flow paths in the prismatic VHTR core consist of coolant holes, bypass gaps and cross gaps. Complicated flow paths are formed in the core since the coolant holes and bypass gap are connected by the cross gap. Distributed coolant was mixed in the core through the cross gap so that the flow characteristics could not be modeled as a simple parallel pipe system. It requires lot of effort and takes very long time to analyze the core flow with CFD analysis. Hence, it is important to develop the code for VHTR core flow which can predict the core flow distribution fast and accurate. In this study, steady state flow network analysis code is developed using flow network algorithm. Developed flow network analysis code was named as FLASH code and it was validated with the experimental data and CFD simulation results. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Development of algorithms for augmenting and replacing conventional process control using reinforcement learning

Here, this work seeks to allow for the online operation and training of model-free reinforcement learning (RL) agents but limit the risk to system equipment and personnel. The parallel implementation of RL alongside more conventional process control (CPC) allows for the RL algorithm to learn from CPC. The past performance of both methods are assessed on a continuous basis allowing for a transition from CPC to RL and, if needed, transitioning back to CPC from RL. This allows for the RL algorithm to slowly and safely assume control of the process without significant degradation in control performance. It is shown that the RL can derive a near optimal policy even when coupled with a suboptimal CPC. It is also demonstrated that the coupled RL-CPC algorithm learns at a faster rate than traditional RL methods of exploration while the algorithm’s performance does not deteriorate below CPC, even when exposed to an unknown operating condition.

30 DIRECT ENERGY CONVERSION↗

Recent advances in stellarator optimization

Computational optimization has revolutionized the field of stellarator design. To date, optimizations have focused primarily on optimization of neoclassical confinement and ideal MHD stability, although limited optimization of other parameters has also been performed. Here, we outline a select set of new concepts for stellarator optimization that, when taken as a group, present a significant step forward in the stellarator concept. One of the criticisms that has been leveled at existing methods of design is the complexity of the resultant field coils. Recently, a new coil optimization code—COILOPT++, which uses a spline instead of a Fourier representation of the coils,—was written and included in the STELLOPT suite of codes. The advantage of this method is that it allows the addition of real space constraints on the locations of the coils. The code has been tested by generating coil designs for optimized quasi-axisymmetric stellarator plasma configurations of different aspect ratios. As an initial exercise, a constraint that the windings be vertical was placed on large major radius half of the non-planar coils. Further constraints were also imposed that guaranteed that sector blanket modules could be removed from between the coils, enabling a sector maintenance scheme. Results of this exercise will be presented. New ideas on methods for the optimization of turbulent transport have garnered much attention since these methods have led to design concepts that are calculated to have reduced turbulent heat loss. We have explored possibilities for generating an experimental database to test whether the reduction in transport that is predicted is consistent with experimental observations. Thus, a series of equilibria that can be made in the now latent QUASAR experiment have been identified that will test the predicted transport scalings. Fast particle confinement studies aimed at developing a generalized optimization algorithm are also discussed. A new algorithm developed for the design of the scraper element on W7-X is presented along with ideas for automating the optimization approach.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Distribution Feeder-Scale Fast Frequency Response via Optimal Coordination of Net-load Resources Part II: Large-Scale Demonstration

This work is the second of a two-part series in which we develop and experimentally demonstrate a hierarchical control solution for optimally coordinating thousands of deferrable loads and distributed energy resources (DERs) to provide fast frequency response (FFR) from an entire distribution feeder. In Part I, we developed and proved practical algorithms for fast, cost-based optimal dispatch and for determining the optimal amount of headroom to operate solar inverters with to support FFR dispatch while minimizing opportunity cost. Simulation results in Part I demonstrated the advantages of the hierarchical dispatch approach in being able to maintain fast solution times needed for FFR even when the problem size increases. In Part II, we implement the algorithms developed in Part I in a novel, large-scale power hardware-in-the-loop experiment including embedded controllers and more than 100 powered appliance loads and DER connected to a simulated real-world distribution system with more than 10,000 controlled devices. Experimental results from multiple scenarios confirm that the optimal FFR dispatch approach scales well and can optimally coordinate more than 10,000 net-load resources across a distribution network while achieving hardware response times within 500 ms, which is not possible using state-of-the-art optimal coordination approaches.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DISTRI: Distributed Multi-Facility HPC Simulator (DISTRI) v2.1

DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking

Bez, Jean Luca [Lawrence Berkeley National Laborat↗

Quantum Computing for Theoretical Nuclear Physics, A White Paper prepared for the U.S. Department of Energy, Office of Science, Office of Nuclear Physics

Tremendous excitement exists among quantum computing enthusiasts as we witness the rapid evolution of quantum computing devices toward early practical implementation. Importantly, algorithm developments suggest that qubit devices have the potential to solve quantum many-body and quantum field theory problems of relevance to various research directions within the Department of Energy Office of Science and National Science Foundation. While exascale platforms represent the current horizon of excellence in computing, quantum computing provides the technology that lies beyond this horizon and opens the door to new vistas of theoretical endeavor. During a recent workshop at the Institute for Nuclear Theory, a group of 39 scientists from academia, government, national laboratories, and industry gathered to discuss the future of quantum computing for nuclear physics. Researchers described the basic scientific challenges in quantum chromodynamics and quantum many-body problems that could be addressed utilizing the power of quantum computing in the future. The group also discussed mechanisms for developing quantum-computing algorithms specifically for nuclear physics applications. This White Paper provides a synopsis of the workshop discussions, and suggests possible activities that might be supported as part of a vibrant pilot program of nuclear physics research in this area.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A perspective of theoretical and applied computational fluid dynamics

The present effectiveness and future promise of computational fluid dynamics (CFD) are discussed. The CFD ideal of computer-designed flight vehicles and the progress that has been made toward its achievement, expressed in terms of primary and secondary pacing items, are also addressed. The primary pacing items listed by Chapman - grid generation, turbulence modeling, solution methodology development, and mainframe computer methods and architecture - are modified and reviewed. Important secondary pacing items in CFD development are also examined: algorithm development, complex geometry definition, and predata and postata processing. In addition, user requirements placed on CFD computer codes are defined and some problems associated with the dissemination of CFD technology are identified.

Kutler, P.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, J. H.↗

Towards developing robust algorithms for solving partial differential equations on MIMD machines

Methods for efficient computation of numerical algorithms on a wide variety of MIMD machines are proposed. These techniques reorganize the data dependency patterns to improve the processor utilization. The model problem finds the time-accurate solution to a parabolic partial differential equation discretized in space and implicitly marched forward in time. The algorithms are extensions of Jacobi and SOR. The extensions consist of iterating over a window of several timesteps, allowing efficient overlap of computation with communication. The methods increase the degree to which work can be performed while data are communicated between processors. The effect of the window size and of domain partitioning on the system performance is examined both by implementing the algorithm on a simulated multiprocessor system.

Saltz, Joel H.↗

Sub-band/transform compression of video sequences

The progress on compression of video sequences is discussed. The overall goal of the research was the development of data compression algorithms for high-definition television (HDTV) sequences, but most of our research is general enough to be applicable to much more general problems. We have concentrated on coding algorithms based on both sub-band and transform approaches. Two very fundamental issues arise in designing a sub-band coder. First, the form of the signal decomposition must be chosen to yield band-pass images with characteristics favorable to efficient coding. A second basic consideration, whether coding is to be done in two or three dimensions, is the form of the coders to be applied to each sub-band. Computational simplicity is of essence. We review the first portion of the year, during which we improved and extended some of the previous grant period's results. The pyramid nonrectangular sub-band coder limited to intra-frame application is discussed. Perhaps the most critical component of the sub-band structure is the design of bandsplitting filters. We apply very simple recursive filters, which operate at alternating levels on rectangularly sampled, and quincunx sampled images. We will also cover the techniques we have studied for the coding of the resulting bandpass signals. We discuss adaptive three-dimensional coding which takes advantage of the detection algorithm developed last year. To this point, all the work on this project has been done without the benefit of motion compensation (MC). Motion compensation is included in many proposed codecs, but adds significant computational burden and hardware expense. We have sought to find a lower-cost alternative featuring a simple adaptation to motion in the form of the codec. In sequences of high spatial detail and zooming or panning, it appears that MC will likely be necessary for the proposed quality and bit rates.

Sauer, Ken↗