Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “permutation”

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
NASA NTRS1988

Storage and computationally efficient permutations of factorized covariance and square-root information arrays

A unified method to permute vector stored Upper triangular Diagonal factorized covariance and vector stored upper triangular Square Root Information arrays is presented. The method involves cyclic permutation of the rows and columns of the arrays and retriangularization with fast (slow) Givens rotations (reflections). Minimal computation is performed, and a one dimensional scratch array is required. To make the method efficient for large arrays on a virtual memory machine, computations are arranged so as to avoid expensive paging faults. This method is potentially important for processing large volumes of radio metric data in the Deep Space Network.

Muellerschoen, R. J.↗
NASA NTRS1988

Storage and computationally efficient permutations of factorized covariance and square-root information matrices

A unified method to permute vector-stored upper-triangular diagonal factorized covariance (UD) and vector stored upper-triangular square-root information filter (SRIF) arrays is presented. The method involves cyclical permutation of the rows and columns of the arrays and retriangularization with appropriate square-root-free fast Givens rotations or elementary slow Givens reflections. A minimal amount of computation is performed and only one scratch vector of size N is required, where N is the column dimension of the arrays. To make the method efficient for large SRIF arrays on a virtual memory machine, three additional scratch vectors each of size N are used to avoid expensive paging faults. The method discussed is compared with the methods and routines of Bierman's Estimation Subroutine Library (ESL).

Muellerschoen, R. J.↗
NASA NTRS2022

Permutations of the Exploration Extra-vehicular Mobility Unit (xEMU) for Mission Specific Objectives

The Advanced Portable Life Support System began first with NASA investment during the Constellation Program focused on new technologies that were central to the new architecture but with a consideration for development of the most flexible and adaptable design to address the varied future needs for Extra-Vehicular Activity (EVA) capability by the agency as part of the exploration of the moon and beyond. Since that time, the Portable Life Support System (PLSS) architecture has been demonstrated at bread-board level, packaged prototype level with Human In-The Loop (HITL) testing, and has now matured into what has become known as the Exploration Extravehicular Mobility Unit (xEMU) PLSS focused on a demonstration on the International Space Station (ISS) and support for initial lunar missions. The xEMU completed Preliminary Design Review (PDR) and the associated Safety Review Panel (SRP) Phase I reviews in 2019-2020 and is progressing through the Design Verification Test (DVT) phase in 2021. As the agency updates planning for lunar both near term, long term, and beyond, there are many possible permutations of the existing architecture that can be accommodated to enable varied mission objectives. This paper will discuss the current baseline DVT design for xEMU as well as potential permutations of the PLSS architecture to accomplish an Apollo style short-duration down and out mission, a long term lunar ultra-lightweight approach, as well as a potential SuitPort accommodating architecture.

Colin Campbell↗
DOE OSTI2019

Bufferless communication for redundant multithreading using register permutation

Systems, apparatuses, and methods for implementing bufferless communication for redundant multithreading applications using register permutation are disclosed. In one embodiment, a system includes a parallel processing unit, a register file, and a scheduler. The scheduler is configured to cause execution of a plurality of threads to be performed in lockstep on the parallel processing unit. The plurality of threads include a first thread and a second thread executing on adjacent first and second lanes, respectively, of the parallel processing unit. The second thread is configured to perform a register permute operation from a first register location to a second register location in a first instruction cycle, with the second register location associated with the second processing lane. The second thread is configured to read from the second register location in a second instruction cycle, wherein the first and second instruction cycles are successive instruction cycles.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Advanced measurement techniques in quantum Monte Carlo: The permutation matrix representation approach

In a typical finite temperature quantum Monte Carlo (QMC) simulation, estimators for simple static observables such as specific heat and magnetization are known. With a great deal of system-specific manual labor, one can sometimes also derive more complicated non-local or even dynamic observable estimators. In contrast, we show that arbitrary static observables can be estimated within the permutation matrix representation (PMR) flavor for any Hamiltonian. We then generalize these results to general imaginary-time correlation functions and non-trivial integrated susceptibilities thereof. Finally, we demonstrate the practical versatility of our method by estimating various non-local, random observables for the transverse-field Ising model on a square lattice and a toy random model.

Permutation matrix representation↗
DOE OSTI2024

Theoretical guarantees for permutation-equivariant quantum neural networks

Despite the great promise of quantum machine learning models, there are several challenges one must overcome before unlocking their full potential. For instance, models based on quantum neural networks (QNNs) can suffer from excessive local minima and barren plateaus in their training landscapes. Recently, the nascent field of geometric quantum machine learning (GQML) has emerged as a potential solution to some of those issues. The key insight of GQML is that one should design architectures, such as equivariant QNNs, encoding the symmetries of the problem at hand. Here, we focus on problems with permutation symmetry (i.e., symmetry group $S_n$), and show how to build $S_n$-equivariant QNNs We provide an analytical study of their performance, proving that they do not suffer from barren plateaus, quickly reach overparametrization, and generalize well from small amounts of data. To verify our results, we perform numerical simulations for a graph state classification task. Our work provides theoretical guarantees for equivariant QNNs, thus indicating the power and potential of GQML.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2014

Discriminating chaotic and stochastic dynamics through the permutation spectrum test

In this paper, we propose a new heuristic symbolic tool for unveiling chaotic and stochastic dynamics: the permutation spectrum test. Several numerical examples allow us to confirm the usefulness of the introduced methodology. Indeed, we show that it is robust in situations in which other techniques fail (intermittent chaos, hyperchaotic dynamics, stochastic linear and nonlinear correlated dynamics, and deterministic non-chaotic noise-driven dynamics). We illustrate the applicability and reliability of this pragmatic method by examining real complex time series from diverse scientific fields. Taking into account that the proposed test has the advantages of being conceptually simple and computationally fast, we think that it can be of practical utility as an alternative test for determinism.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2015

Permutationally invariant fitting of intermolecular potential energy surfaces: A case study of the Ne-C 2 H 2 system

Here, the permutation invariant polynomial-neural network (PIP-NN) approach is extended to fit intermolecular potential energy surfaces (PESs). Specifically, three PESs were constructed for the Ne-C 2 H 2 system. PES1 is a full nine-dimensional PIP-NN PES directly fitted to ~42 000 ab initio points calculated at the level of CCSD(T)-F12a/cc-pCVTZ-F12, while the other two consist of the six-dimensional PES for C 2 H 2 [H. Han, A. Li, and H. Guo, J. Chem. Phys. 141, 244312 (2014)] and an intermolecular PES represented in either the PIP (PES2) or PIP-NN (PES3) form. The comparison of fitting errors and their distributions, one-dimensional cuts and two-dimensional contour plots of the PESs, as well as classical trajectory collisional energy transfer dynamics calculations shows that the three PESs are very similar. We conclude that full-dimensional PESs for non-covalent interacting molecular systems can be constructed efficiently and accurately by the PIP-NN approach for both the constituent molecules and intermolecular parts.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2018

Permutation invariant polynomial neural network approach to fitting potential energy surfaces. IV. Coupled diabatic potential energy matrices

A machine learning method is proposed for representing the elements of diabatic potential energy matrices (PEMs) with high fidelity. This is an extension of the so-called permutation invariant polynomial-neural network (PIP-NN) method for representing adiabatic potential energy surfaces. While for one-dimensional irreducible representations the diagonal elements of a diabatic PEM are invariant under exchange of identical nuclei in a molecular system, the off-diagonal elements require special symmetry consideration, particularly in the presence of a conical intersection. A multiplicative factor is introduced to take into consideration the particular symmetry properties while maintaining the PIP-NN framework. Here, we demonstrate here that the extended PIP-NN approach is accurate in representing diabatic PEMs, as evidenced by small fitting errors and by the reproduction of absorption spectra and product branching ratios in both H 2 O$(\tilde{X} / \tilde{B})$ and NH 3 $(\tilde{X} $/Ã) non-adiabatic photodissociation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Permutation matrix representation quantum Monte Carlo

We present a quantum Monte Carlo algorithm for the simulation of general quantum and classical many-body models within a single unifying framework. The algorithm builds on a power series expansion of the quantum partition function in its off-diagonal terms and is both parameter-free and Trotter error-free. In our approach, the quantum dimension consists of products of elements of a permutation group. As such, it allows for the study of a very wide variety of models on an equal footing. To demonstrate the utility of our technique, we use it to clarify the emergence of the sign problem in the simulations of non-stoquastic physical models. We showcase the flexibility of our algorithm and the advantages it offers over existing state-of-the-art by simulating transverse- field Ising model Hamiltonians and comparing the performance of our technique against that of the stochastic series expansion algorithm. Furthermore, we also study a transverse-field Ising model augmented with randomly chosen two-body transverse-field interactions.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2026

Coherence-Induced Deep Thermalization Transition in Random Permutation Quantum Dynamics

We report a phase transition in the projected ensemble—the collection of postmeasurement wave functions of a local subsystem obtained by measuring its complement. The transition emerges in systems undergoing random permutation dynamics, a type of quantum time evolution wherein computational basis states are shuffled without creating superpositions. It separates a phase exhibiting deep thermalization, where the projected ensemble is distributed over Hilbert space in a maximally entropic fashion (Haar random), from a phase where it is minimally entropic (“classical bit-string ensemble”). Crucially, this deep thermalization transition is invisible to the subsystem’s density matrix, which always exhibits thermalization to infinite temperature across the phase diagram. Through a combination of analytical arguments and numerical simulations, we show that the transition is tuned by the total amount of injected by the input state and the measurement basis, and is exhibited robustly across different microscopic models. Our findings represent a novel form of ergodicity-breaking universality in quantum many-body dynamics, characterized not by a failure of regular thermalization, but rather by a failure of deep thermalization.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2025

Scattering neutrinos, spin models, and permutations

We consider a class of Heisenberg all-to-all coupled spin models inspired by neutrino interactions in a supernova with N degrees of freedom. These models are characterized by a coupling matrix that is relatively simple in the sense that there are only a few, relative to N , nontrivial eigenvalues, in distinction to the classic Heisenberg spin-glass models, leading to distinct behavior in both the high-temperature and low-temperature regimes. When the momenta of the neutrinos are uniform and random in directions, we can calculate the large- N partition function for the quantum Heisenberg model. In particular, the high-temperature partition function predicts a non-Gaussian density of states, providing interesting counterexamples showing the limits of general theorems on the density of states for quantum spin models. We can repeat the same argument for classical Heisenberg models, also known as rotor models, and we find the high-temperature expansion is completely controlled by the eigenvalues of the coupling matrix, and again predicts non-Gaussian behavior for the density of states as long as the number of eigenvalues does not scale linearly with N . Indeed, we derive the amusing fact that these partition functions are essentially the generating function for counting permutations in the high-temperature regime. Finally, for the case relevant to neutrinos in a supernova, we identify the low-temperature phase as a unique state with the direction of the momenta of the neutrino dictating its coherent state in flavor-space, a state we dub the “flavor-momentum-locked” state. Published by the American Physical Society 2025

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Adaptive QM/MM for Molecular Dynamics Simulations: 5. On the Energy-Conserved Permuted Adaptive-Partitioning Schemes

In combined quantum-mechanical/molecular-mechanical (QM/MM) dynamics simulations, the adaptive-partitioning (AP) schemes reclassify atoms on-the-fly as QM or MM in a smooth manner. This yields a mobile QM subsystem with contents that are continuously updated as needed. Here, we tailor the Hamiltonian adaptive many-body correction (HAMBC) proposed by Boreboom et al. [J. Chem. Theory Comput. 2016, 12, 3441] to the permuted AP (PAP) scheme. The treatments lead to the HAMBC-PAP method (HPAP), which both conserves energy and produces accurate solvation structures in the test of “water-in-water” model system.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

Densely Connected G-invariant Deep Neural Networks with Signed Permutation Representations

We introduce and investigate, for finite groups G, G-invariant deep neural network (GDNN) architectures with ReLU activation that are densely connected- i.e., include all possible skip connections. In contrast to other G-invariant architectures in the literature, the preactivations of theG-DNNs presented here are able to transform by signed permutation representations (signed perm-reps) of G. Moreover, the individual layers of the G-DNNs are not required to be G-equivariant; instead, the preactivations are constrained to be G-equivariant functions of the network input in a way that couples weights across all layers. The result is a richer family of G-invariant architectures never seen previously. We derive an efficient implementation of G-DNNs after a reparameterization of weights, as well as necessary and sufficient conditions for an architecture to be "admissible"- i.e., nondegenerate and inequivalent to smaller architectures. We include code that allows a user to build a G-DNN interactively layer-by-layer, with the final architecture guaranteed to be admissible. We show that there are far more admissible G-DNN architectures than those accessible with the "concatenated ReLU" activation function from the literature. Finally, we apply G-DNNs to two example problems--(1) multiplication in --1, 1} (with theoretical guarantees) and (2) 3D object classification--finding that the inclusion of signed perm-reps significantly boosts predictive performance compared to baselines with only ordinary (i.e., unsigned) perm-reps.

97 MATHEMATICS AND COMPUTING↗