SEARCH · Engineering Papers
Results for “SPACE EXPLORATION”
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.
Sandia Technology in Space Sandia-developed satellites engineering materials contribute to U.S. space exploration.
Abstract not provided.
Computer Architecture Laboratory for Design Space Exploration: CAL Goals and Objectives.
Abstract not provided.
Design Space Exploration with Proxy/Proto Architecture Models and miniApps.
Abstract not provided.
Design Space Exploration with Proxy/Proto Architecture Models and miniApps.
Abstract not provided.
Koopman Operator Methods for Global Phase Space Exploration of Equivariant Dynamical Systems
In this paper, we develop the Koopman operator theory for dynamical systems with symmetry. In particular, we investigate how the Koopman operator and eigenfunctions behave under the action of the symmetry group of the underlying dynamical system. Further, exploring the underlying symmetry, we propose an algorithm to construct a global Koopman operator from local Koopman operators. In particular, we show, by exploiting the symmetry, data from all the invariant sets are not required for constructing the global Koopman operator; that is, local knowledge of the system is enough to infer the global dynamics.
Unsupervised Neural Network Adaptation at the Edge: A Design Space Exploration
Explore the source record for details and available documents.
Design Space Exploration for Novel Reduced-Vortex Turbine Rotors Using Free Vortex Wake Methods
In this work, we explore the use of mid-fidelity free vortex wake (FVW) tools, namely NREL's cOnvecting LAgrangian Filaments (OLAF) tool, to design and analyze wind turbine rotor blades. The goal of the exercise is to determine whether designs exist that out-perform traditional blade designs, which are optimized using the Blade-Element Momentum (BEM) method. We find that using design of experiments to generate simple modifications of the blade tip, OLAF predicts higher performance in terms of power coefficient for redesigned blades that are non-optimal according to BEM. We then use optimization methods with OLAF in the loop to attempt to automatically find OLAF-optimal designs. We analyze the results of these optimizations, demonstrating that some roadblocks exist before OLAF and FVW tools can be used to automatically find FVW-optimal blade designs that might exceed the performance of BEM-optimal blade designs.
2018 Conference on Advanced Power Systems for Deep Space Exploration presentation - eMMRTG Development and Infusion
Presentation of the status of the enhance Multi-Mission Radioisotope Thermoelectric Generator (eMMRTG). The presentation describes the MMRTG and details the eMMRTG program goals. The presentation then describes the expected generator performance as the fuel decays over the 17 year life without any thermoelectric degradation and how the end user can design to maximize performance.
Co-design of Advanced Architectures for Graph Analytics using Machine Learning
A graph is an excellent way of representing relationships among entities. We can use graph analytics to synthesize and analyze such relational data, and extract relevant features that are useful for various tasks such as machine learning. Considering the crucial role of graph analytics in various domains, it is important and timely to investigate the right hardware configurations that can achieve optimal performance for graph workloads on future high-performance computing systems. Design space exploration studies facilitate the selection of appropriate configurations (e.g. memory) to achieve a desired system performance. Recently, the approach of accelerating graph analytics using persistent non-volatile memory has gained a lot of attention. Traditional system simulators such as Gem5 and NVMain can be used to explore the design space of these advanced memory architectures for graph workloads. However, these simulators are slow in execution thus limiting the efficiency of design space exploration studies. To overcome this challenge, we proposed a machine learning based approach to co-design advanced memory architectures for graph workloads. We tested our approach with DRAM, non-volatile memory, and hybrid memory (DRAM+NVM) using a breadth first search benchmark algorithm. Our results showed the applicability of the proposed machine learning based approach to the co-design of the advanced memory architectures. In this paper, we provide recommendations on selecting advanced memory architectures to achieve desired performance for graph workloads. We also discuss the performances of different machine learning models that were considered in this study.
Graph reinforcement learning for exploring model spaces beyond the standard model
We present a methodology for performing scans of beyond the standard model (BSM) parameter spaces with reinforcement learning. We identify a novel procedure using graph neural networks that is capable of exploring spaces of models without the user specifying a fixed particle content, allowing broad classes of BSM models to be explored—in theory, the technique is applicable to nearly any model space with a prespecified gauge group. We provide a generic procedure by which a suitable graph grammar can be developed for any BSM model that features user-specified symmetry groups and a finite number of different possible particle species, the use of which is applicable to a variety of machine learning tasks over the actions of BSM theories beyond our particular reinforcement learning use case. As a proof of concept, we construct the graph grammar for theories with vectorlike leptons that may or may not be charged under a dark U ( 1 ) group, inspired by portal matter extensions of the sub-GeV vector portal/kinetic mixing simplified dark matter models. We then use this graph grammar to create a reinforcement learning environment tasked with creating models with these vectorlike leptons that are consistent with a list of a variety of precision observables. The reinforcement learning agent succeeds in developing models that can address the observed muon anomalous magnetic moment discrepancy while remaining consistent with flavor violation and electroweak precision observables, including both constructions that have previously been studied as well as new models that have not, to our knowledge, previously been identified. By inspecting the resulting ensembles of models that the agent produces and experimenting with different configurations for our reinforcement learning environment and graph grammar, we also infer various lessons about the development of these environments that can be transferable to reinforcement learning scans of more complicated model spaces and comment on future directions for the development of this technique into a more mature tool. Published by the American Physical Society 2025
Adrastea: An Efficient FPGA Design Environment for Heterogeneous Scientific Computing and Machine Learning
We present Adrastea, an efficient FPGA design environment for developing scientific machine learning applications. FPGA development is challenging, from deployment, proper toolchain setup, programming methods, interfacing FPGA kernels, and more importantly, the need to explore design space choices to get the best performance and area usage from the FPGA kernel design. Adrastea provides an automated and scalable design flow to parameterize, implement, and optimize complex FPGA kernels and associated interfaces. We show how virtualization of the development environment via virtual machines is leveraged to simplify the setup of the FPGA toolchain while deploying the FPGA boards and while scaling up the automated design space exploration to leverage multiple machines concurrently. Adrastea provides an automated build and test environment of FPGA kernels. By exposing design space hyper-parameters, Adrastea can automatically search the design space in parallel to optimize the FPGA design for a given metric, usually performance or area. Adrastea simplifies the task of interfacing with the FPGA kernels with a simplified interface API. To demonstrate the capabilities of Adrastea, we implement a complex random forest machine learning kernel with 10,000 input features while achieving extremely low computing latency without loss of prediction accuracy, which is required by a scientific edge application at SNS. We also demonstrate Adrastea using an FFT kernel and show that for both applications Adrastea is able to systematically and efficiently evaluate different design options, which reduced the time and effort required to develop the kernel from months of manual work to days of automatic builds.
Observable optimization for precision theory: machine learning energy correlators
The practice of collider physics typically involves the marginalization of multi-dimensional collider data to uni-dimensional observables relevant for some physics task. In many cases, such as classification or anomaly detection, the observable can be arbitrarily complicated, such as the output of a neural network. However, for precision measurements, the observable must correspond to something computable systematically beyond the level of current simulation tools. In this work, we demonstrate that precision-theory-compatible observable space exploration can be systematized by using neural simulation-based inference techniques from machine learning. We illustrate this approach by exploring the space of marginalizations of the energy 3-point correlator to optimize sensitivity to the top quark mass. We first learn the energy-weighted probability density from simulation, then search in the space of marginalizations for an optimal triangle shape. Although simulations and machine learning are used in the process of observable optimization, the output is an observable definition which can be then computed to high precision and compared directly to data without any memory of the computations which produced it. We find that the optimal marginalization is isosceles triangles on the sphere with a side ratio approximately $1 : 1 : \sqrt{2}$ (i.e. right triangles) within the set of marginalizations we consider.
Efficient generation of grids and traversal graphs in compositional spaces towards exploration and path planning
Abstract Diverse disciplines across science and engineering deal with problems related to compositions, which exist in non-Euclidean simplex spaces, rendering many standard tools inaccurate or inefficient. This work explores such spaces conceptually in the context of materials discovery, quantifies their computational feasibility, and implements several essential methods specific to simplex spaces through a new high-performance open-source library . Most significantly, we derive and implement an algorithm for constructing a novel n-dimensional simplex graph data structure, containing all discretized compositions and possible neighbor-to-neighbor transitions. Critically, no distance or neighborhood calculations are performed, instead leveraging pure combinatorics and order in procedurally generated simplex grids, keeping the algorithm $${\mathcal{O}}(N)$$ O ( N ) , with minimal memory, enabling rapid construction of graphs with billions of transitions in seconds. Additionally, we demonstrate how such graph representations can be combined to homogeneously express complex path-planning problems, while facilitating efficient deployment of existing high-performance gradient descent, graph traversal, and other optimization algorithms.
Phenomenology of dark energy: exploring the space of theories with future redshift surveys
We use the effective field theory of dark energy to explore the space of modified gravity models which are capable of driving the present cosmic acceleration. We identify five universal functions of cosmic time that are enough to describe a wide range of theories containing a single scalar degree of freedom in addition to the metric. The first function (the effective equation of state) uniquely controls the expansion history of the universe. The remaining four functions appear in the linear cosmological perturbation equations, but only three of them regulate the growth history of large scale structures. We propose a specific parameterization of such functions in terms of characteristic coefficients that serve as coordinates in the space of modified gravity theories and can be effectively constrained by the next generation of cosmological experiments. We address in full generality the problem of the soundness of the theory against ghost-like and gradient instabilities and show how the space of non-pathological models shrinks when a more negative equation of state parameter is considered. This analysis allows us to locate a large class of stable theories that violate the null energy condition (i.e. super-acceleration models) and to recover, as particular subsets, various models considered so far. Finally, under the assumption that the true underlying cosmological model is the Λ Cold Dark Matter (ΛCDM) scenario, and relying on the figure of merit of EUCLID-like observations, we demonstrate that the theoretical requirement of stability significantly narrows the empirical likelihood, increasing the discriminatory power of data. We also find that the vast majority of these non-pathological theories generating the same expansion history as the ΛCDM model predict a different, lower, growth rate of cosmic structures.
Exploring the parameter space of warm-inflation models
Warm inflation includes inflaton interactions with other fields throughout the inflationary epoch instead of confining such interactions to a distinct reheating era. Previous investigations have shown that, when certain constraints on the dynamics of these interactions and the resultant radiation bath are satisfied, a low-momentum-dominated dissipation coefficient ∝T{sup 3}/m{sub χ}{sup 2} can sustain an era of inflation compatible with CMB observations. In this work, we extend these analyses by including the pole-dominated dissipation term ∝√(m{sub χ}T)exp (−m{sub χ}/T). We find that, with this enhanced dissipation, certain models, notably the quadratic hilltop potential, perform significantly better. Specifically, we can achieve 50 e-folds of inflation and a spectral index compatible with Planck data while requiring fewer mediator field (O(10{sup 4}) for the quadratic hilltop potential) and smaller coupling constants, opening up interesting model-building possibilities. We also highlight the significance of the specific parametric dependence of the dissipative coefficient which could prove useful in even greater reduction in field content.
The Evolution of of Radioisotope Thermal Generators
Introduction The advancement of space exploration started in 1957 with the launch of Sputnik 1 which was quickly followed by the launch of Explorer 1 in 1958. The advancement in space exploration had much to do about the development of nuclear power in space. Enabling satellites to draw more power than before and carry out long term mission. The Radio Isotopic thermal generator (RTG) was first invented in 1954 and earned its place in the inventor’s hall of fame in 2015. The RTG has been the key to our success in the exploration of deep space. With in this paper the evolution of the RTG will be covered including the missions they facilitated. In addition, the ever present political and public view of nuclear material will play a role in the history of the RTG and the modern possibilities for nuclear power in space.