Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm-based”

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.

41 records · Page 3

Dimensionality Reduction with Variational Encoders Based on Subsystem Purification

Efficient methods for encoding and compression are likely to pave the way toward the problem of efficient trainability on higher-dimensional Hilbert spaces, overcoming issues of barren plateaus. Here, we propose an alternative approach to variational autoencoders to reduce the dimensionality of states represented in higher dimensional Hilbert spaces. To this end, we build a variational algorithm-based autoencoder circuit that takes as input a dataset and optimizes the parameters of a Parameterized Quantum Circuit (PQC) ansatz to produce an output state that can be represented as a tensor product of two subsystems by minimizing $Tr(ρ^2)$. The output of this circuit is passed through a series of controlled swap gates and measurements to output a state with half the number of qubits while retaining the features of the starting state in the same spirit as any dimension-reduction technique used in classical algorithms. The output obtained is used for supervised learning to guarantee the working of the encoding procedure thus developed. We make use of the Bars and Stripes (BAS) dataset for an 8 × 8 grid to create efficient encoding states and report a classification accuracy of 95% on the same. Thus, the demonstrated example provides proof for the working of the method in reducing states represented in large Hilbert spaces while maintaining the features required for any further machine learning algorithm that follows.

97 MATHEMATICS AND COMPUTING↗

Genetic algorithm for demand response: a stackelberg game approach

Demand response (DR) has gained a significant recent interest due to its potential for mitigating many power system problems. Game theory is a very effective tool to be utilized in DR management. In this paper, the DR between a distribution system operator (DSO) and load aggregators (LAs) is designed as a Stackelberg game, where the DSO acts as the leader and LAs are regarded as the followers. Due to the limitations of the centralized solution approaches, a genetic algorithm-based decentralized approach is proposed. To demonstrate the proposed approach, a case study concerning a day-ahead optimization for a real-time pricing market with a single DSO and three LAs is designed and optimized. The proposed approach is able to shift the demand peaks and prove that it has a great potential to be used for the Stackelberg game between a DSO and multiple LAs to fully exploit the potential of DR.

Amasyali, Kadir↗

Advances in Structure Prediction of Lanthanides and Actinides with Genetic Algorithms

Computationally guided materials discovery has advanced significantly in the past two decades. Recent developments of widely available genetic algorithm-based structure prediction software in the past 10+ years has led to increased use of this methodology in the discovery and design of new materials. Owing to the computational challenges of treating f-block elements and computationally expensive methods for structure prediction, the discovery of new phases of lanthanide and actinide materials has been particularly challenging. With advancements in the development of genetic algorithms for structure prediction and the continuing improvement of high-performance computing resources, genetic algorithms provide a tractable method to find new stable phases of materials at high pressure or to search a large phase space for unknown compounds. Genetic algorithms have already been applied to the successful identification of novel lanthanide and actinide materials, as well as the prediction of unusual material properties in new phases that make promising synthetic targets.

Shields, Ashley↗

3D Visualisation of Un-georeferenced, Coordinate-poor Spatial Data in Complex D and D and WM Environments - 18294

This paper describes the development of an algorithm-based utility tool using Visual Basic that examines un-georeferenced or GPS-deprived spatial datasets (3D datasets lacking one or more of the key x, y and z components). Taking into account any known geometrical parameters which are input via a user-friendly front-end, the new code automatically evaluates attributes, including any spatial coordinate components, detects invalid survey data points and fills in bad or missing data points utilising data-specific interpolation (e.g. cubic or linear spline) of valid data points, such that local extrema are not created. Previously troublesome 2D data can be easily converted to realistic 3D contour display, integrated with other time-series data to create 4D movies, and incorporated into other existing 3D datasets. More importantly those processed and 'more complete' data can be easily stored in 3D or 4D spatial database management systems for future interrogation by using clear, realistic and intuitive 3D visualisation. Test cases are presented to demonstrate the value and versatility of the newly developed utility tool which include the 3D visualisation of: surveyed wall thicknesses of a helical coil, radiation mapping of a plant and aerial survey mapping of radiation in a region near Fukushima. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Enhancing Operational Safety via Agentic Dialogue Hazard Identification Analysis

Operational safety in high-stakes domains such as industrial process control, autonomous, and safety-critical systems demand reliable hazard identification. While large language models (LLMs) have shown promise in automating safety analysis tasks, single-turn, monolithic inference is brittle: it lacks the self-correction, deliberation, and contextual refinement that safety engineers apply iteratively. In this paper, we introduce HAZDIAL, a framework that investigates whether structured agentic dialogue (multi-agent, multi-turn interactions) improves the quality of NLP-based hazard identification over single-pass baselines. We systematically compare two dialogue modalities: adversarial debate and constructive discussion, and propose an genetic algorithm-based agentic interaction optimization. We evaluate all configurations against a curated golden dataset using standard classification metrics (accuracy, precision, recall, F1) and a novel dialogue metrics. This work advances the intersection of dialogue systems, multi-agent reasoning, and AI safety, providing empirical evidence for dialogue-driven hazard analysis.

Das, Sanjay [ORNL] (ORCID:0009000542591915)↗