Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational and information science”

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

Time-series learning of latent-space dynamics for reduced-order model closure

In this work, we study the performance of long short-term memory networks (LSTMs) and neural ordinary differential equations (NODEs) in learning latent-space representations of dynamical equations for an advection-dominated problem given by the viscous Burgers equation. Our formulation is devised in a nonintrusive manner with an equation-free evolution of dynamics in a reduced space with the latter being obtained through a proper orthogonal decomposition. In addition, we leverage the sequential nature of learning for both LSTMs and NODEs to demonstrate their capability for closure in systems that are not completely resolved in the reduced space. We assess our hypothesis for two advection-dominated problems given by the viscous Burgers equation. We observe that both LSTMs and NODEs are able to reproduce the effects of the absent scales for our test cases more effectively than does intrusive dynamics evolution through a Galerkin projection. This result empirically suggests that time-series learning techniques implicitly leverage a memory kernel for coarse-grained system closure as is suggested through the Mori–Zwanzig formalism.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Turning Outsiders into Insiders: A Call for Papers to Expand the Reach of National Laboratories’ Safety Successes, Challenges, Research, and Approaches

The most complex challenges facing the world today comprise the work of [Department of Energy’s] (DOE’s) 17 National Laboratories: [...] From furthering U.S. energy independence and leadership in clean technologies; to promoting innovation that advances U.S. economic competitiveness; to conducting research of the highest caliber in the physical, chemical, biological, materials, computational, and information sciences to advance understanding of the world around us-the Laboratories’ purview is expansive and further their contributions are indispensable.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2020

A regression algorithm for accelerated lattice QCD that exploits sparse inference on the D-Wave quantum annealer

We propose a regression algorithm that utilizes a learned dictionary optimized for sparse inference on a D-Wave quantum annealer. In this regression algorithm, we concatenate the independent and dependent variables as a combined vector, and encode the high-order correlations between them into a dictionary optimized for sparse reconstruction. On a test dataset, the dependent variable is initialized to its average value and then a sparse reconstruction of the combined vector is obtained in which the dependent variable is typically shifted closer to its true value, as in a standard inpainting or denoising task. Here, a quantum annealer, which can presumably exploit a fully entangled initial state to better explore the complex energy landscape, is used to solve the highly non-convex sparse coding optimization problem. The regression algorithm is demonstrated for a lattice quantum chromodynamics simulation data using a D-Wave 2000Q quantum annealer and good prediction performance is achieved. The regression test is performed using six different values for the number of fully connected logical qubits, between 20 and 64. The scaling results indicate that a larger number of qubits gives better prediction accuracy.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Encoding integers and rationals on neuromorphic computers using virtual neuron

Abstract Neuromorphic computers emulate the human brain while being extremely power efficient for computing tasks. In fact, they are poised to be critical for energy-efficient computing in the future. Neuromorphic computers are primarily used in spiking neural network–based machine learning applications. However, they are known to be Turing-complete, and in theory can perform all general-purpose computation. One of the biggest bottlenecks in realizing general-purpose computations on neuromorphic computers today is the inability to efficiently encode data on the neuromorphic computers. To fully realize the potential of neuromorphic computers for energy-efficient general-purpose computing, efficient mechanisms must be devised for encoding numbers. Current encoding mechanisms (e.g., binning, rate-based encoding, and time-based encoding) have limited applicability and are not suited for general-purpose computation. In this paper, we present the virtual neuron abstraction as a mechanism for encoding and adding integers and rational numbers by using spiking neural network primitives. We evaluate the performance of the virtual neuron on physical and simulated neuromorphic hardware. We estimate that the virtual neuron could perform an addition operation using just 23 nJ of energy on average with a mixed-signal, memristor-based neuromorphic processor. We also demonstrate the utility of the virtual neuron by using it in some of the μ -recursive functions, which are the building blocks of general-purpose computation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Local Bayesian Dirichlet mixing of imperfect models

Abstract To improve the predictability of complex computational models in the experimentally-unknown domains, we propose a Bayesian statistical machine learning framework utilizing the Dirichlet distribution that combines results of several imperfect models. This framework can be viewed as an extension of Bayesian stacking. To illustrate the method, we study the ability of Bayesian model averaging and mixing techniques to mine nuclear masses. We show that the global and local mixtures of models reach excellent performance on both prediction accuracy and uncertainty quantification and are preferable to classical Bayesian model averaging. Additionally, our statistical analysis indicates that improving model predictions through mixing rather than mixing of corrected models leads to more robust extrapolations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Block copolymer self-assembly derived mesoporous magnetic materials with three-dimensionally (3D) co-continuous gyroid nanostructure

Magnetic nanomaterials are gaining interest for their many applications in technological areas from information science and computing to next-generation quantum energy materials. While magnetic materials have historically been nanostructured through techniques such as lithography and molecular beam epitaxy, there has recently been growing interest in using soft matter self-assembly. In this work, a triblock terpolymer, poly(isoprene-block-styrene-block-ethylene oxide) (ISO), is used as a structure directing agent for aluminosilicate sol nanoparticles and magnetic material precursors to generate organic–inorganic bulk hybrid films with co-continuous morphology. After thermal processing into mesoporous materials, results from a combination of small angle X-ray scattering (SAXS) and scanning electron microscopy (SEM) are consistent with the double gyroid morphology. Nitrogen sorption measurements reveal a type IV isotherm with H1 hysteresis, and yield a specific surface area of around 200 m 2 g −1 and an average pore size of 23 nm. The magnetization of the mesostructured material as a function of applied field shows magnetic hysteresis and coercivity at 300 K and 10 K. Comparison of magnetic measurements between the mesoporous gyroid and an unstructured bulk magnetic material, derived from the identical inorganic precursors, reveals the structured material exhibits a coercivity of 250 Oe, opposed to 148 Oe for the unstructured at 10 K, and presence of remnant magnetic moment not conventionally found in bulk hematite; both of these properties are attributed to the mesostructure. This scalable route to mesoporous magnetic materials with co-continuous morphologies from block copolymer self-assembly may provide a pathway to advanced magnetic nanomaterials with a range of potential applications.

Chemistry↗
DOE OSTI2022

Reformulation of the No-Free-Lunch Theorem for Entangled Datasets

The No-Free-Lunch (NFL) theorem is a celebrated result in learning theory that limits one’s ability to learn a function with a training data set. With the recent rise of quantum machine learning, it is natural to ask whether there is a quantum analog of the NFL theorem, which would restrict a quantum computer’s ability to learn a unitary process with quantum training data. However, in the quantum setting, the training data can possess entanglement, a strong correlation with no classical analog. In this work, we show that entangled data sets lead to an apparent violation of the (classical) NFL theorem. This motivates a reformulation that accounts for the degree of entanglement in the training set. As our main result, we prove a quantum NFL theorem whereby the fundamental limit on the learnability of a unitary is reduced by entanglement. We employ Rigetti's quantum computer to test both the classical and quantum NFL theorems. In conclusion, our work establishes that entanglement is a commodity in quantum machine learning.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Security proof of practical quantum key distribution with detection-efficiency mismatch

Quantum key distribution (QKD) protocols with threshold detectors are driving high-performance QKD demonstrations. The corresponding security proofs usually assume that all physical detectors have the same detection efficiency. However, the efficiencies of the detectors used in practice might show a mismatch depending on the manufacturing and setup of these detectors. A mismatch can also be induced as the different spatial-temporal modes of an incoming signal might couple differently to a detector. Here we develop a method that allows to provide security proofs without the usual assumption. Our method can take the detection-efficiency mismatch into account without having to restrict the attack strategy of the adversary. Especially, we do not rely on any photon-number cutoff of incoming signals such that our security proof is directly applicable to practical situations. We illustrate our method for a receiver that is designed for polarization encoding and is sensitive to a number of spatial-temporal modes. In our detector model, the absence of quantum interference between any pair of spatial-temporal modes is assumed. For a QKD protocol with this detector model, we can perform a security proof with characterized efficiency mismatch and without photon-number cutoff assumption. Our method also shows that in the absence of efficiency mismatch in our detector model, the key rate increases if the loss due to detection inefficiency is assumed to be outside of the adversary's control, as compared to the view where for a security proof this loss is attributed to the action of the adversary.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Projected Multi-Agent Consensus Equilibrium (PMACE) With Application to Ptychography

Multi-Agent Consensus Equilibrium (MACE) formulates an inverse imaging problem as a balance among multiple update agents such as data-fitting terms and denoisers. However, each such agent operates on a separate copy of the full image, leading to redundant memory use and slow convergence when each agent affects only a small subset of the full image. In this article, we extend MACE to Projected Multi-Agent Consensus Equilibrium (PMACE), in which each agent updates only a projected component of the full image, thus greatly reducing memory use for some applications. We describe PMACE in terms of an equilibrium problem and an equivalent fixed-point problem and show that in most cases the PMACE equilibrium is not the solution of an optimization problem. To demonstrate the value of PMACE, we apply it to the problem of ptychography, in which a sample is reconstructed from the diffraction patterns resulting from coherent X-ray illumination at multiple overlapping spots. In our PMACE formulation, each spot corresponds to a separate data-fitting agent, with the final solution found as an equilibrium among all the agents. In conclusion, our results demonstrate that the PMACE reconstruction algorithm generates more accurate reconstructions at a lower computational cost than existing ptychography algorithms when the spots are sparsely sampled.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Scientific Computational Imaging Code (SCICO)

Scientific Computational Imaging Code (SCICO) is a Python package for solving the inverse problems that arise in scientific imaging applications. Its primary focus is providing methods for solving ill-posed inverse problems by using an appropriate prior model of the reconstruction space. SCICO includes a growing suite of operators, cost functionals, regularizers, and optimization routines that may be combined to solve a wide range of problems, and is designed so that it is easy to add new building blocks. SCICO is built on top of JAX rather than NumPy, enabling GPU/TPU acceleration, just-in-time compilation, and automatic gradient functionality, which is used to automatically compute the adjoints of linear operators. An example of how to solve a multi-channel tomography problem with SCICO is shown in Figure 1. The SCICO source code is available from GitHub, and pre-built packages are available from PyPI. It has extensive online documentation, including API documentation and usage examples, which can be run online at Google Colab and binder.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Understanding Structures of Cyber Competition in an Era of Major Power Rivalry

Over the past two decades, the cyber domain has emerged and evolved into a key strategic domain for nations across the globe. Security strategies are espoused by heads of state that focus on how to manage the increasingly enormous, crosscutting impact that the cyber domain has on national security across economic, military, intelligence, intellectual property, and countless other facets. These strategies frequently evolve, and even change entirely, as leaders adapt to new technologies and administrations change. Even if these strategies did not change at all, they would take inordinate amounts of time to effectively implement within the organizational structures of government. The time required to go from setting department and agency-level goals, to the time small teams have well-oiled processes and expertise to accomplish tactical objectives that meet the strategic vision is lengthy. With near certainty, by the time objectives and vision are implemented, the landscape, strategy, or both has changed entirely. While this churn will likely never cease due to the rapidly changing nature of the cyber domain, this problem raises an important question: can governmental structures be organized to rapidly adapt to changing cyber strategies? As offices responsible for particular missions in cyberspace shuffle about within the bureaucracy, are technical capabilities enabled or enhanced? No matter how advanced a particular technical capability is or how adept the staff is at solving problems, they will be ineffective if placed haphazardly within the organization: the right authorities may not exist for their office, the correct lines of interpersonal communication may not be established properly, or insufficient resources have not been allocated to effectively deploy a brilliant technical solution. This concept of organizational agility in the context of national cyber capabilities is important when taking into account the National Defense Strategy’s emphasis on cyber capability and the ability of the United States to compete and rapidly adapt to new challenges posed by rivals. As a nation, we are at a point where technology evolves rapidly enough to warrant thoughtful and nimble changes to the bureaucratic structures that support how cyber operations are carried out. Taking these questions and cross-comparing them to the organizational structures across China, Russia, and the United States provides for an interesting thought experiment. As non-democratic regimes, China and Russia have differing priorities and internal power dynamics than the United States and thus organize their governments differently. By combining known and broadcasted strategies of these nations with the observed technical capabilities demonstrated in the public domain, we can begin to see how organizational structures map to strategic goals and directly enable technical capabilities. Insight can be gained by introducing organizational structures into traditional analysis focusing solely around strategies and capabilities; additionally, otherwise unknown capabilities or intents might be discovered or inferred by analyzing organizational structures alone. Analyzing cyber operations from this oft-overlooked perspective could potentially provide useful insight and more concrete actions that can be undertaken to realize the National Defense Strategy’s goals.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗