SEARCH · Search NASA
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.
Restoring permutational invariance in the Jordan–Wigner transformation
The Jordan–Wigner transformation is a powerful tool for converting systems of spins into systems of fermions, or vice versa. While this mapping is exact, the transformation itself depends on the labelling of the spins. One consequence of this dependence is that approximate solutions of a Jordan–Wigner-transformed Hamiltonian may depend on the (physically inconsequential) labelling of the spins. In this work, we turn to an extended Jordan–Wigner transformation which remedies this problem and which may also introduce some correlation atop the Hartree–Fock solution of a transformed spin Hamiltonian. We demonstrate that this extended Jordan–Wigner transformation can be thought of as arising from a unitary version of the Lie algebraic similarity transformation (LAST) theory. Here, we show how these ideas, particularly in combination with the standard (non-unitary) version of LAST, can provide a potentially powerful tool for the treatment of the XXZ and J 1 –J 2 Heisenberg Hamiltonians.
Improving convolutional neural networks for cosmological fields with random permutation
Not provided.
Correlation-Informed Permutation of Qubits for Reducing Ansatz Depth in the Variational Quantum Eigensolver
Not Available
Quantum Algorithm for Time-Dependent Hamiltonian Simulation by Permutation Expansion
Not Available
MPNet-GRUs: Sentiment Analysis With Masked and Permuted Pre-Training for Language Understanding and Gated Recurrent Units
Not Available
Analysis of Different Permutation of a Hybrid Concentrated Solar Power (CSP) & Pumped Thermal Energy Storage (PTES) System.
Abstract not provided.
PERMUTATIONS BY CUTTING AND SHUFFLING
Explore the source record for details and available documents.
The permuted generator hypothesis for the origin of a genetic code
Protocells had no known means of ensuring that their randomly collected proteins would be duplicated. A possible, albeit inexact, mechanism for protein synthesis in a primitive t-RNA is presented, whereby an oligonucleotide (12 units) in a circular configuration is able to align a generator site with amino acid discriminator sites. In this way, unique anticodons could be specified for each site and replication could occur.
Non-blocking crossbar permutation engine with constant routing latency
The invention is embodied in an N x N crossbar for routing packets from a set of N input ports to a set of N output ports, each packet having a header identifying one of the output ports as its destination, including a plurality of individual links which carry individual packets. Each link has a link input end and a link output end, a plurality of switches. Each of the switches has at least top and bottom switch inputs connected to a corresponding pair of the link output ends and top and bottom switch outputs connected to a corresponding pair of link input ends, whereby each switch is connected to four different links. Each of the switches has an exchange state which routes packets from the top and bottom switch inputs to the bottom and top switch outputs, respectively, and a bypass state which routes packets from the top and bottom switch inputs to the top and bottom switch outputs, respectively. A plurality of individual controller devices governing respective switches for sensing from a header of a packet at each switch input for the identity of the destination output port of the packet and selecting one of the exchange and bypass states in accordance with the identity of the destination output port and with the location of the corresponding switch relative to the destination output port.
Versatile platform for nanotechnology based on circular permutations of chaperonin protein
The present invention provides chaperonin polypeptides which are modified to include N-terminal and C-terminal ends that are relocated from the central pore region to various different positions in the polypeptide which are located on the exterior of the folded modified chaperonin polypeptide. In the modified chaperonin polypeptide, the naturally-occurring N-terminal and C-terminal ends are joined together directly or with an intervening linker peptide sequence. The relocated N-terminal or C-terminal ends can be covalently joined to, or bound with another molecule such as a nucleic acid molecule, a lipid, a carbohydrate, a second polypeptide, or a nanoparticle. The modified chaperonin polypeptides can assemble into double-ringed chaperonin structures. Further, the chaperonin structures can organize into higher order structures such as nanofilaments or nanoarrays which can be used to produce nanodevices and nanocoatings.
Permutation Testing and Bootstrapping: NonParametric Approaches to Statistical Testing and Estimation
No abstract available
Assessing Permutationally Invariant Polynomial and Symmetric Gradient Domain Machine Learning Potential Energy Surfaces for H 3 O 2 –
Explore the source record for details and available documents.
Explaining Neural Network Predictions of Characteristics of Explosive Devices Using Functional Principal Components Analysis and Permutation Feature Importance.
Abstract not provided.
Analysis of Different Permutation of a Hybrid Concentrated Solar Power (CSP) & Pumped Thermal Energy Storage (PTES) System.
Abstract not provided.
On the optimum bit orders with respect to the state complexity of trellis diagrams for binary linear codes
It was shown earlier that for a punctured Reed-Muller (RM) code or a primitive BCH code, which contains a punctured RM code of the same minimum distance as a large subcode, the state complexity of the minimal trellis diagram is much greater than that for an equivalent code obtained by a proper permutation on the bit positions. To find a permutation on the bit positions for a given code that minimizes the state complexity of its minimal trellis diagram is an interesting and challenging problem. This permutation problem is related to the generalized Hamming weight hierarchy of a code, and is shown that for RM codes, the standard binary order of bit positions is optimum at every bit position with respect to the state complexity of a minimal trellis diagram by using a theorem due to Wei. The state complexity of trellis diagram for the extended and permuted (64, 24) BCH code is discussed.