Search NASA⌕ Search

SEARCH · Search NASA

Results for “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,297 records · Page 72

Evaluation of Variable Refrigerant Flow Systems Performance and the Enhanced Control Algorithm on Oak Ridge National Laboratory's Flexible Research Platform

A research project “Evaluation of Variable Refrigerant Flow (VRF) Systems Performance and the Enhanced Control Algorithm on Oak Ridge National Laboratory’s (ORNL’s) Flexible Research Platform” was performed to (1) install and validate the performance of Samsung VRF systems compared with the baseline rooftop unit (RTU) variable-air-volume (VAV) system and (2) evaluate the enhanced control algorithm for the VRF system on the two-story flexible research platform (FRP) in Oak Ridge, Tennessee. Based on the VRF system designed by Samsung and ORNL, the system was installed from February 18 through April 15, 2014. The final commissioning and system optimization were completed on June 2, 2014, and the initial test for system operation was started the following day, June 3, 2014. In addition, the enhanced control algorithm was implemented and updated on June 18. After a series of additional commissioning actions, the energy performance data from the RTU and the VRF system were monitored from July 7, 2014, through February 28, 2015. Data monitoring and analysis were performed for the cooling season and heating season separately, and the calibrated simulation model was developed and used to estimate the energy performance of the RTU and VRF systems. This final report includes discussion of the design and installation of the VRF system, the data monitoring and analysis plan, the cooling season and heating season data analysis, and the building energy modeling study

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

External Threat Risk Assessment Algorithm (ExTRAA)

Two risk assessment algorithms and philosophies have been augmented and combined to form a new algorit hm, the External Threat Risk Assessment Algorithm (ExTRAA), that allows for effective and statistically sound analysis of external threat sources in relation to individual attack methods . In addition to the attack method use probability and the attack method employment consequence, t he concept of defining threat sources is added to the risk assessment process. Sample data is tabulated and depicted in radar plots and bar graphs for algorithm demonstration purposes. The largest success of ExTRAA is its ability to visualize the kind of r isk posed in a given situation using the radar plot method.

97 MATHEMATICS AND COMPUTING↗

Reproducibility and Variability of I/O Performance on BG/Q: Lessons Learned from a Data Aggregation Algorithm

Reading and writing data efficiently from different tiers of storage is necessary for most scientific simulations to achieve good performance at scale. Many software solutions have been developed to decrease the I/O bottleneck. One wellknown strategy, in the context of collective I/O operations, is the two-phase I/O scheme. This strategy consists of selecting a subset of processes to aggregate contiguous pieces of data before performing reads/writes. In our previous work, we implemented the two-phase I/O scheme with a MPI-based topology-aware algorithm. Our algorithm showed very good performance at scale compared to the standard I/O libraries such as POSIX I/O and MPI I/O. However, the algorithm had several limitations hindering a satisfying reproducibility of our experiments. In this paper, we extend our work by 1) identifying the obstacles we face to reproduce our experiments and 2) discovering solutions that reduce the unpredictability of our results.

97 MATHEMATICS AND COMPUTING↗

Algorithm to calculate off-plane magnetic field from an on-plane field map

An algorithm is presented to calculate the field components [B x (x,y,z), B y (x,y,z), B z (x,y,z)] of the magnetic field at a point (x,y,z) in space, from the knowledge of the components [B x (x,y = 0,z), B y (x,y = 0,z), B z (x,y = 0,z)] on a ”reference plane”, which is normal to the y-axis at y=0. The algorithm, which is a general one and is not restricted to fields with mid-plane symmetry is based on the Taylor series expansion of the magnetic field components at any point in space in terms of the distance (y) of the point from the reference plane. The coefficients of the Taylor series expansion are expressed in terms of the on-plane field components and their partial derivatives with respect to spatial coordinates (x,z). The field components are usually generated from magnetic field measurements on a rectangular grid on the plane. The required partial derivatives of the field components on the plane can be computed with two methods; numerically, or by fitting a polynomial function to the experimentally measured values of the field components and subsequently take the required partial derivatives of the polynomial function. Each of these two method which calculates the partial derivatives of the field components on the plane, is applied to calculate the off-plane field components of the magnetic field generated by a modified Halbach magnet [1] of inner radius of 4.4 cm and it is found that each method provides accurate results with a relative error <1% deviation from the ”ideal” fields if the y distance of the point from the reference plane is smaller than 2 cm. This algorithm is part of the RAYTRACE computer code [2] and has been applied [3] on a dipole magnet with median plane symmetry.

43 PARTICLE ACCELERATORS↗

BISON Contact Algorithm Improvements in Support of Pellet Cladding Mechanical Interaction Modeling

The thermal and mechanical behavior of the gap between the fuel and cladding plays an extremely important role in determining the response of light water reactor (LWR) fuel under irradiation. This is especially true during situations when pellet-cladding mechanical interactions (PCMI) have a significant effect on the behavior of the fuel/cladding system. The BISON code, which is being used as the fuel performance simulation tool for the CASL program, employs contact detection and enforcement algorithms to realistically simulate the thermal and mechanical interactions across the fuel/cladding interaction in LWR fuel. These contact algorithms permit accurate representation of these interactions even when there is significant relative movement between the two surfaces, which is typically the case in many regions of an LWR fuel rod. This report summarizes work done during the 2017 fiscal year to further improve the accuracy and robustness of the contact enforcement algorithms in BISON. This work will benefit all BISON simulations, but will particularly benefit simulations scenarios where PCMI is of interest.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Comparison of Distributive Consensus Algorithms for AnomalyDetection on the Power-Grid

As an increasing number of devices in the power-grid rely on high-precision clocks to measure electrical properties and time stamp data, GPS receivers have become a vulnerability on the power-grid. GPS spoofing attacks, in which a fake signal is transmitted, can cause sensor measurement errors that can misinform protective equipment and grid operators for both the transmission and distribution grid. The technology being developed to secure precision clocks in the transmission grid are not appropriate for the distribution grid. Thus, there is a need to developed anomaly detection algorithms that are suitable for the hardware available on the distribution grid. Traditionally, a distributed detection framework is comprised of spatially distributed nodes which acquire observations about a quantity of interest and sends the data to the fusion center, where a global decision is made. Instead the distribution grid has low-power devices, such as smart inverters and microPMUs, that could be used to perform highly parallelized calculations. Having on node calculations is beneficial since it is more network and computation efficient, as the more calculations can be performed where the data is being captured instead of communicating across a slow network to a centralized fusion center. Instead, we could employ an alternate peer-to-peer type of information exchange on the distribution grid that can still reach a global decision. A decentralized approach to anomaly detection makes efficient use of the computational and network bandwidth that exists, and it also lacks the single point of failure of a centralized approach. Thus, a decentralized local information exchange and/or inference is preferred. Lastly, the unreliability of the distribution grid network connections and potential noise or error in the measurements must be considered. In order to produce an effective detection tool, a Byzantine-fault tolerant and asynchronous algorithm must be developed. Thus, the first phase of our project is to develop a distributed, decentralized, asynchronous, Byzantine-fault tolerant, collaborative autonomy-based anomaly detection algorithm to collectively analyze clusters of data for signs of a malicious attack.

97 MATHEMATICS AND COMPUTING↗

GenSpec: A Genetic Algorithm for Neutron Energy Spectrum Adjustment

Presented in this report is the description of a new method for neutron energy spectrum adjustment which uses a genetic algorithm to minimize the difference between calculated and measured reaction probabilities. The measured reaction probabilities are found using neutron activation analysis. The method adjusts a trial spectrum provided by the user which is typically calculated using a neutron transport code such as MCNP. Observed benefits of this method over currently existing methods include the reduction in unrealistic artefacts in the spectral shape as well as a reduced sensitivity to increases in the energy resolution of the derived spectrum. This report presents the adjustment results for various spectrum altering bucket environments in the central cavity of the Annular Core Research Reactor, as well as the adjustment results for the spectrum in the Sandia Pulse Reactor III. In each case, the results are compared to those generated using LSL-M2, which is a code commonly used for the purpose of spectrum adjustment. The genetic algorithm produces spectrum-averaged reaction probabilities with agreement to measured values, and comparable to those resulting from LSL-M2. The true benefit to this method, the reduction of shape artefacts in the spectrum, is difficult to quantify but can be clearly seen in the comparison of the final adjustments. Beyond these preliminary results, this report also gives a thorough description of the genetic algorithm and presents instructions for running the code using the graphical user interface. In its present state, the code does not provide uncertainties or correlations for the adjusted spectrum. This capability is currently being added, and will be presented in future work.

42 ENGINEERING↗

Large Scale Tracking Algorithms

Low signal-to-noise data processing algorithms for improved detection, tracking, discrimination and situational threat assessment are a key research challenge. As sensor technologies progress, the number of pixels will increase significantly. This will result in increased resolution, which could improve object discrimination, but unfortunately, will also result in a significant increase in the number of potential targets to track. Many tracking techniques, like multi-hypothesis trackers, suffer from a combinatorial explosion as the number of potential targets increase. As the resolution increases, the phenomenology applied towards detection algorithms also changes. For low resolution sensors, "blob" tracking is the norm. For higher resolution data, additional information may be employed in the detection and classification steps. The most challenging scenarios are those where the targets cannot be fully resolved, yet must be tracked and distinguished for neighboring closely spaced objects. Tracking vehicles in an urban environment is an example of such a challenging scenario. This report evaluates several potential tracking algorithms for large-scale tracking in an urban environment.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Innovations in optimization and control of accelerators using methods of differential geometry and genetic algorithms (Final Report)

Online tuning of particle accelerators is necessary in order to achieve optimal machine performance. However, it is also a major challenge due to the large parameter space which must be searched and the fact that many of the desir- able objectives compete with one another, and so will not reach their optimal values simultaneously. In order to mitigate these issues, we have explored using dimension-reduction techniques to reduce the size of the parameter space which must be searched and multi-objective genetic algorithms to obtain the sets of tuning parameters which provide pareto-optimal values for the objectives. These methods have enabled us to obtain improved values of the vertical emittance at the Cornell Electron Storage Ring (CESR), and to do so with greater control of orbit errors. Algorithmic tuning is a multidisciplinary endeavour, requiring expertise in beam dynamics, diagnostics, control systems and computer science, and thus a key practical problem is to formulate a common language in which experts with different specialties can communicate. We developed a solution to this problem in the form of a generic accelerator software interface that allows for rapid prototyping of optimization and control algorithms. Our interface is built on the Experimental Physics and Industrial Control Systems (EPICS) and makes possible testing control code in simulation before deployment on real accelerators, as well as deployment of third-party optimization code.

43 PARTICLE ACCELERATORS↗

Optimizing the Accelerated Recursive Doubling Algorithm for Block Tridiagonal Systems of Equations

The need to solve block tridiagonal systems with hundreds or thousands of right-hand sides for the same block tridiagonal matrix is common in a variety of disciplines. To meet this need, the Accelerated Recursive Doubling Algorithm was developed. After a right-hand side independent phase, the algorithm allows for the quick, online calculation of solutions for different right-hand sides. In this work, we present methods to optimize the Accelerated Recursive Doubling Algorithm in memory usage and computation time in a hybrid parallelization model. The right-hand side independent phase of the naïve implementation takes ≥ 11/3 the amount of memory required to store the tridiagonal matrix, while our implementation reduces the fraction to ≈ 5/3 . The right-hand side dependent phase of the naïve implementation takes ≥ 6 times the amount of memory required to store the right-hand side, while our implementation reduces the fraction to ≈ 3. The computation time for the independent phase is reduced to ≈ 2/3 times that of the naïve implementation, while the computation time for the dependent phase is reduced to ≈ 5/9 . With increasing numbers of shared-memory threads q on every distributed processing element, we have O(q) theoretical speedup.

97 MATHEMATICS AND COMPUTING↗

SGEMP Algorithm Development and Demonstration for ICEPIC

Algorithms designed to facilitate calculation of gas-modified System-Generated Electromagnetic Pulse (SGEMP) phenomena have been developed for use in ICEPIC. Improvements and extensions of these and related models are considered for helping them be more widely applicable for SGEMP modeling. Confluent Sciences has developed a Buneman-Villasenor unit test tool for assessing particle merge algorithms and has applied that to several candidate algorithms. Statistical analysis of Maxwellian and near-Maxwellian velocity distribution functions has been used to understand limits and tradeoffs of particle merging. Collisional phenomena and plasma models that relieve the burden of a fully kinetic approach have also been developed and assessed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Minimum Resolution Requirements for Gamma Identification Algorithms

Each year there are millions of dollars spent on the research and production of high-resolution detectors. This research indicates that the pursuit of higher resolution detectors is not always necessary. The terminal resolution of a NaI detector, or highest detector resolution, at which identification algorithms fail to identify highly enriched uranium (HEU) was evaluated using GADRAS, Genie, and GammaVision. GADRAS employs a template matching algorithm, while Genie and GammaVision utilize a mathematical approach for peak search and identification. The NaI spectra utilized for evaluation were generated using the GADRAS Inject tab and source modeling functions. Each spectrum included terrestrial and cosmic background from Dallas, TX. The resolutions for each spectrum were increased from a default 8.92% to a point where each algorithm would fail to identify 235 U from a HEU source. Six different source configurations were used in this research: bare HEU, 50% shielded HEU, 90% shielded HEU, bare HEU with an interference source of 99 mTc, bare HEU with 99 mTc both shielded 50%, and bare HEU with 99 mTc both shielded 90%. T

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Scalable/Secure Cooperative Algorithms and Framework for Extremely-high Penetration Solar Integration (SolarExPert) (Final Technical Report)

This SolarExPert project has developed a Sustainable Grid Platform (SGP) with scalable architecture of distributed control and optimization. The SGP consists of the following major functions: 1) an advanced grid architecture with hierarchical and distributed communication and control, combined with the OpenFMB standard and implemented on the Multi-Agent OpenDSS (MA-OpenDSS) platform; 2) an online distributed stochastic optimal power flow; 3) an online distributed system state estimation algorithm; 4) the distributed Volt/VAR optimization and frequency control algorithms; 5) the distributed distribution system restoration strategy. The developed SGP together with advanced functions are tested in 1 million (1M)-node distribution system on the MA-OpenDSS platform. Furthermore, the models and algorithms are tested in 100,000-node system HiL simulation, and also in P-HiL implementation with 100 physical devices. The developed functions haven been validated and tested on the selected actual distribution feeder with the data collected from the field of Maui Meadows in Hawaii. The distributed PV hosting capacities with cooperative Volt/VAR and Volt/VAR/Watt control are estimated and compared to provide recommendations for customers and the utility company.

14 SOLAR ENERGY↗

Gamma Spectroscopy Detector Candidates and Radioisotope Identification Algorithms for Use in National Security Applications

In 2006, the United States Congress mandated for the Department of Homeland Security (DHS) to screen all cargo containers to protect against terrorist acts and ensure the safety and security of the nation. Containers are screened by gamma and neutron detectors to ensure threat material is not smuggled into the country. However, because commerce is radioactive, detecting the presence of radioactive materials is not sufficient in ensuring the safety and security of the nation. Radioactive materials must also be identified in real time, thus distinguishing threat sources (Uranium-235 and Plutonium-230) from non-threat sources (kitty litter, pot ash, medical isotopes). Screening cargo containers can be considered a two-step process (1) alerting to the presence of radioactive material when gamma counts exceed a threshold setting, and (2) once alerted, identifying the type of radioactive material, which is done by collecting a gamma spectra and analyzing it with an analysis tool/algorithm. For this reason, it is important to evaluate not only emerging technology in neutron and gamma detection, but also investigate new advances in algorithm development for radioisotope identification (RIID). New candidates in detection and on-board algorithm analysis might offer opportunities to make the scanning, detection, and identification process more efficient while still ensuring the health and safety of the public. This research will investigate emerging technology in radiation detection focused on gamma spectroscopy capabilities and RIID algorithms for DHS applications.

61 RADIATION PROTECTION AND DOSIMETRY↗

Sketching Algorithms in Distributed Systems

In this position paper, we discuss exciting recent advancements in sketching algorithms applied to distributed systems. That is, we look at randomized algorithms that simultaneously reduce the data dimensionality, offer potential privacy benefits, while maintaining verifiably high levels of algorithm accuracy and performance in multi-node computational setups. We look at next steps and discuss the applicability to real systems.

97 MATHEMATICS AND COMPUTING↗

An Infinite Domain 3D Poisson Solver Based on the Barnes-Hut Algorithm

We present a domain decomposition method for the solution of the 3D Poisson equation with infinite domain boundary conditions. The method is based on an application of the Barnes-Hut tree particle scheme adapted to gridded data. Long range interactions are computed using the first two terms in the Cartesian multipole expansion of Green’s function convoluted with the charge while short range computations are performed using Hockney’s domain doubling algorithm. A standard domain decomposition strategy requires O(N 2 ) applications of Hockney’s algorithm, where N is the number of subdomains that intersect that charge support, while in the present approach only O(Nlog 2 N) such computations suffice. The discretization scheme employed is a sixth order Mehrstellen approximation of the 3D Laplace opera tor. The method exhibits satisfactory accuracy at a substantially reduced computational cost compared to the full domain decomposition Hockney’s algorithm.

97 MATHEMATICS AND COMPUTING↗

SIS-AOP Cueing/Segmenting Algorithm (FOA_SIS-AOP) Using the Sandia FOA 4.0 Framework

For machine vision, one of the most important operations is fast and effective object cueing or segmentation. Sandia National Labs has a long history of development and implementation of very fast and effective cueing/segmentation algorithms. This report covers the history, motivation and implementation of evolving frameworks (Sandia FOA Frameworks) upon which this long legacy of successful algorithms are built. The report describes the innovative microprocessor implementation, enabling extremely fast morphological processing, combined with a novel adaptive quantization front - end and a feature - based backend that resulted in Sandia developing fast and effective cueing in a wide variety of applications, from defect detection to SAR ATR. The report covers evolution from Sandia FOA 1.0 Framework (1995) to current Sandia FOA 4.0 Framework (2021). Requirements for the cueing algorithm for SIS - AOP (FOA_SIS - AOP) that drove the Sandia FOA 4.0 Framework development are discussed, along with information on how to use the Sandia FOA Frameworks.

97 MATHEMATICS AND COMPUTING↗

Development of Genetic Algorithm Based Multi-Objective Plant Reload Optimization Platform

The U.S. nuclear industry is facing a challenge in maintaining required levels of safety while ensuring economic competitiveness to stay in business. Safety remains a key parameter for all aspects of light-water reactor nuclear power plant operations. Safety can become more economical by using a risk-informed ecosystem, such as the one being developed in the Risk-Informed Systems Analysis Pathway under the U.S. Department of Energy Light Water Reactor Sustainability Program. The Light Water Reactor Sustainability Program promotes a wide range of research and development activities to maximize both the safety and economic efficiency of nuclear power plants through improved scientific understanding, especially given that many plants are now considering second license renewals. The Risk-Informed Systems Analysis Pathway has two main goals: Deploy methodologies and technologies that better represent safety margins and cost and safety factors; Develop advanced applications that enable cost-effective plant operations. The Plant Reload Optimization Platform development project aims to build a reactor core design tool that includes reactor safety and fuel performance analyses and uses artificial intelligence to support the optimization of core design solutions. This report summarizes genetic-algorithm-based multi-objective fuel reload optimization activities, specifically: Developing the non-dominated sorting genetic algorithm II optimizer in the Risk Analysis and Virtual ENviroment (RAVEN); Demonstrating and validating the developed non-dominated sorting genetic algorithm II optimizer using benchmark optimization problems.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗