SEARCH · Search NASA
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.
A double serially concatenated code with two interleavers consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, a middle encoder, another interleaver permuting the middle codeword bits and an inner encoder whose input words are the permuted middle codewords.
Recent work has uncovered a connection between the symbol letters of general massless scattering and (permutations of) cluster variables of partial flag varieties. In this paper we explore the cluster adjacency of tree-level gluon amplitudes, specifically focusing on split-helicity amplitudes which can be written in closed form in terms of zigzag diagrams. We check in several cases, and conjecture in general, that the poles in each term satisfy cluster adjacency under a set of permutations that is built from arc permutations of the corresponding zigzag.
The development of advanced biofuel production facilities is still at a nascent stage, and the biorefineries could face challenges in obtaining air permits required for their construction and operation because they are novel emission sources. To fill gaps in knowledge regarding potential emissions, we perform a detailed federal regulatory analysis and estimate air pollutant emissions for an advanced biorefinery that produces renewable diesel blendstock (RDB) from lignocellulosic biomass via aerobic respiration documented in Part 1 of the paper. We evaluate 12 design permutations that include two feedstocks, a uniform format blend (UFB) and corn stover; three biorefinery scales, 2,000, 5,200, and 9,100 dry metric tons per day (dmtd) of lignocellulosic biomass feed; and two lignin uses, as either a boiler fuel or for pellet production. We also evaluate 6 additional design permutations by incorporating non-emitting renewable power, which could reduce up to 63% carbon monoxide (CO) and nitrogen oxides (NO x ) each, 21% volatile organic compounds (VOC), and 43% hazardous air pollutants (HAP) as opposed to on-site power production, for biorefineries that produce pellets, using either UFB or corn stover. Our results indicate that all 18 design permutations would be classified as a major source under the Clean Air Act's New Source Review program without additional emission controls. Compared to using lignin as a boiler fuel, diverting lignin for pellet production reduces the emissions of CO up to 88%, NOx up to 73%, sulfur dioxide (SO 2 ) up to 99%, VOCs up to 72%, and HAPs up to 66%. Additionally, we explore control options that could further reduce emissions and assess whether reductions are enough to achieve minor source classification. Insights from our analysis can help biorefinery developers and regulators develop permitting strategies to mitigate investment risks.
Structure-conditioned information statistics have proven useful to predict and visualize tRNA Class-Informative Features (CIFs) and their evolutionary divergences. Although permutation P-values can quantify the significance of CIF divergences between two taxa, their naive Monte Carlo approximation is slow and inaccurate. The Peaks-over-Threshold approach of Knijnenburg et al. (2009) promises improvements to both speed and accuracy of permutation P-values, but has no publicly available API. Here, we present tRNA Structure–Function Mapper (tSFM) v1.0, an open-source, multi-threaded application that efficiently computes, visualizes and assesses significance of single- and paired-site CIFs and their evolutionary divergences for any RNA, protein, gene or genomic element sequence family. Multiple estimators of permutation P-values for CIF evolutionary divergences are provided along with confidence intervals. tSFM is implemented in Python 3 with compiled C extensions and is freely available through GitHub (https://github.com/tlawrence3/tSFM) and PyPI.
An odd-even permutation and a nested dissection technique were used to circumvent the strong seriality of a system of closely coupled equations. The effect of transforming the n x n Hermitian definite positive matrix coefficient on the topology of Cholesky factors is discussed. A series of directed graphs is constructed in order to show the computational steps required for the odd-even permutation. Numerical expressions for the speed-up and efficiency of parallel N-processing techniques and sequential processing by a single computer are derived. Similar expressions are derived for the case of insufficient processing capacity. The application of the odd-even permutation to the ensemble class of computer architectures is demonstrated.
Four approaches for calculating downlink interferences for shaped-beam antennas are described. An investigation of alternative mixed-integer programming models for satellite synthesis is summarized. Plans for coordinating the various programs developed under this grant are outlined. Two procedures for ordering satellites to initialize the k-permutation algorithm are proposed. Results are presented for the k-permutation algorithms. Feasible solutions are found for 5 of the 6 problems considered. Finally, it is demonstrated that the k-permutation algorithm can be used to solve arc allotment problems.
The trellis structure of linear block codes (LBCs) is discussed. The state and branch complexities of a trellis diagram (TD) for a LBC is investigated. The TD with the minimum number of states is said to be minimal. The branch complexity of a minimal TD for a LBC is expressed in terms of the dimensions of specific subcodes of the given code. Then upper and lower bounds are derived on the number of states of a minimal TD for a LBC, and it is shown that a cyclic (or shortened cyclic) code is the worst in terms of the state complexity among the LBCs of the same length and dimension. Furthermore, it is shown that the structural complexity of a minimal TD for a LBC depends on the order of its bit positions. This fact suggests that an appropriate permutation of the bit positions of a code may result in an equivalent code with a much simpler minimal TD. Boolean polynomial representation of codewords of a LBC is also considered. This representation helps in study of the trellis structure of the code. Boolean polynomial representation of a code is applied to construct its minimal TD. Particularly, the construction of minimal trellises for Reed-Muller codes and the extended and permuted binary primitive BCH codes which contain Reed-Muller as subcodes is emphasized. Finally, the structural complexity of minimal trellises for the extended and permuted, and double-error-correcting BCH codes is analyzed and presented. It is shown that these codes have relatively simple trellis structure and hence can be decoded with the Viterbi decoding algorithm.
We construct entangled states of gluons that scatter exactly as if they were gravitons. Operationally, these objects implement the double copy at the level of the wave function. Our analysis begins with a general ansatz for a wave function characterizing gluons in two copies of SU(N ) gauge theory. Given relatively minimal assumptions following from permutation invariance and dimensional analysis, the three- and four-particle wave functions generate scattering amplitudes that automatically coincide exactly with gravity, modulo normalization. For five-particle scattering the match is not automatic but imposing certain known selection rules on the amplitude is sufficient to uniquely reproduce gravity. The resulting amplitudes exhibit a color-dressed and permutation-invariant form of the usual double copy relations. We compute the entanglement entropy between the two gauge theory copies and learn that these states are maximally-entangled at large N. Moreover, this approach extends immediately to effective field theories, where Born-Infeld photons and Galileons can be similarly recast as entangled gluons and pions.
Protein fission and fusion can be used to create biomolecules with new structures and functions, including circularly permuted proteins that require post-translational modifications for activity, split protein AND gates that require multiple inputs for activity, and fused domains that function as chemical-dependent protein switches. In this work, we describe how transposon mutagenesis can be used for protein design to create libraries of permuted, split, or domain-inserted proteins. Furthermore, when coupled with a functional screen or selection, these approaches can rapidly diversify the topologies and functions of natural proteins and create useful protein components for synthetic biology.
Abstract Airborne measurements of non‐refractory bulk aerosol chemical composition, aerosol size distributions, and cloud condensation nuclei (CCN) were conducted onboard a research aircraft during the Holistic Interactions of Shallow Clouds, Aerosols and Land Ecosystems field campaign in the spring and summer of 2016. A CCN closure study for the entire campaign period was performed where measured CCN concentrations at 0.24% and 0.46% supersaturation were compared with the predicted CCN concentrations calculated using κ ‐Köhler theory, three different assumptions of aerosol mixing state, and various assumptions about hygroscopicity, density, and the insoluble fraction of organic particles. We found that the Closure Ratio (CR), calculated as the ratio of predicted to measured CCN concentrations, was equal to one under two different aerosol mixing state assumptions: (a) all particles are composed of 100% organic particles, and (b) particles are externally mixed and composed of pure sulfates, nitrates, and organic particles assuming hygroscopicity values for organic particles ( ) between 0.04 and 0.17. The use of internal mixing state assumption often led to overprediction of CCN concentrations but the agreement within ±20% with the measured CCN concentrations was observed under certain closure permutations. A similar agreement, that is, within ±20%, was also observed using permuted parameters concerning density (1 and 1.5 g cm −3 ) and an insoluble fraction (0% and 20%) of organic particles. These findings may provide constraints on to predict CCN concentrations at a remote continental Southern Great Plains site.
Previously, we demonstrated in a report that artificial neural networks (NNs) can be used to generate quasidiabatic Hamiltonians (H d ) that are capable of representing adiabatic energies, energy gradients, and derivative couplings. In this work, two additional issues are addressed. First, symmetry-adapted functions such as permutation invariant polynomials are introduced to account for complete nuclear permutation inversion symmetry. Second, a partially diagonalized representation is introduced to facilitate a better description of near degeneracy points. The diabatization of 1, 2 1 A states of NH 3 is used as an example. The NN fitting findings are compared to that of a previous fitting with symmetry adapted polynomials.
Abstract We propose masked particle modeling (MPM) as a self-supervised method for learning generic, transferable, and reusable representations on unordered sets of inputs for use in high energy physics (HEP) scientific data. This work provides a novel scheme to perform masked modeling based pre-training to learn permutation invariant functions on sets. More generally, this work provides a step towards building large foundation models for HEP that can be generically pre-trained with self-supervised learning and later fine-tuned for a variety of down-stream tasks. In MPM, particles in a set are masked and the training objective is to recover their identity, as defined by a discretized token representation of a pre-trained vector quantized variational autoencoder. We study the efficacy of the method in samples of high energy jets at collider physics experiments, including studies on the impact of discretization, permutation invariance, and ordering. We also study the fine-tuning capability of the model, showing that it can be adapted to tasks such as supervised and weakly supervised jet classification, and that the model can transfer efficiently with small fine-tuning data sets to new classes and new data domains.
The gapped symmetric phase of the Affleck-Kennedy-Lieb-Tasaki model exhibits fractionalized spins at the ends of an open chain. Here, we show that breaking SU(2) symmetry and applying a global spin-lowering dissipator achieves synchronization of these fractionalized spins. Additional local dissipators ensure convergence to the ground state manifold. In order to understand which aspects of this synchronization are robust within the entire Haldane-gap phase, we reduce the biquadratic term, which eliminates the need for an external field but destabilizes synchronization. Within the ground state subspace, stability is regained using only the global lowering dissipator. These results demonstrate that fractionalized degrees of freedom can be synchronized in extended systems with a significant degree of robustness arising from topological protection. A direct consequence is that permutation symmetries are not required for the dynamics to be synchronized, representing a clear advantage of topological synchronization compared to synchronization induced by permutation symmetries.
Embrittling potency is a thermodynamic metric that assesses the influence of solute segregation to a grain boundary (GB) on intergranular fracture. Historically, authors of studies have reported embrittling potency as a single scalar value, assuming a single segregation site of importance at a GB and a particular cleavage plane. However, the topography of intergranular fracture surfaces is not generally known a priori. Accordingly, we, in this study, present a statistical ensemble approach to compute embrittling potency, where many free surface (FS) permutations are systematically considered to model fracture of a GB. The result is a statistical description of the thermodynamics of GB embrittlement. As a specific example, embrittling potency distributions are presented for Cr segregation to sites at two Ni $\langle 111 \rangle$ symmetric tilt GBs using atomistic simulations. We show that the average embrittling potency for a particular GB site, considering an ensemble of FS permutations, is not equal to the embrittling potency computed using the lowest energy pair of FSs. A mean GB embrittlement is proposed, considering both the likelihood of formation of a particular FS and the probability of solute occupancy at each GB site, to compare the relative embrittling behavior of two distinct GBs.
The ability to predict the chemical and physical properties of a material is directly related to the structure and interactions of its electrons. For materials comprised of f-block elements (the lanthanides and actinides found in the last two rows of the periodic table), the complexity of electronic structure has presented great difficulty in understanding, modeling, and predicting material properties. The complexity of multiconfigurational ground state electronic structures is illustrated herein by the combinatorics of electron permutations within individual and cumulative occupancy configurations. A non-integer orbital occupancy representation of multiconfigurational ground states is described for superposition mixing between multiple near-energy degenerate occupancy configurations and generalized in such a way that established ground states are returned by approximation for elements with less-complex electronic structures. By considering the occupancy configurations as statistical mechanics macrostates, and the permutations of electrons as statistical mechanics microstates within those macrostates, an over-approximation of entropy for multiconfigurational elemental ground state electronic structures has been calculated.
A combinatorial approach has been applied to the allowable permutations of quantum electronic configurations under the constraints of Hund's rule for established ground state configurations toward an under-approximation of electronic structure entropy. Combined with a previously reported over-approximation, the approximations are used in conjunction in an attempt to bracket the upper and lower entropy limits for multiconfigurational ground state electronic structure entropy and compared to known standard molar entropies for the elements. This formality has been used for the application of a classical statistical mechanics methodology to be applied to the discrete sets of quantum mechanical states of Pu in order to calculate orbital occupancies in Pu's multiconfigurational ground state. Without consideration of the relative energies of various possible electronic configurations contributing to the multiconfigurational ground state, the calculations are performed under a general energy degeneracy assumption weighted to the number of permutations for specific configurations. The number of configurations assumed to significantly contribute is gradually constrained in order to approach a low-order approximation of orbital occupancies in Pu that are then compared to experimental and other calculated results from the literature.
Simulation cloning is a technique in which cloned simulations whose state spaces differ partially from their parent simulation due to intervening events are spawned at runtime and concurrently advanced. It is a powerful method to carry out what-if analysis by speculatively exploring and evaluating the impact of various permutations of intervening cascade of events. Due to the exponential growth in the number of possible clones even for a small number of distinct intervening events, the practical efficacy of the approach is often severely limited by the maximum available memory of the computing host. In this paper, we introduce a novel speculative simulation cloning framework that executes a simulation cloning campaign capable of efficiently exploring an exponentially large space of clone simulations created by permutation of intervening events under a finite memory constraint. We provide a theoretical analysis of the runtime characteristics of our proposed approach and highlight its novel advantages such as memory-aware and as-long-as-needed execution. Furthermore, in support of our analytical findings and to demonstrate its practical feasibility, we implement a prototype of the cloning framework on a shared memory system and report its performance characteristics in the context of a heat diffusion simulation, and a power grid simulation subject to cascading disruptions from geomagnetic disturbances.
Abstract Privacy protection is a growing concern in the digital era, with machine vision techniques widely used throughout public and private settings. Existing methods address this growing problem by, e.g., encrypting camera images or obscuring/blurring the imaged information through digital algorithms. Here, we demonstrate a camera design that performs class-specific imaging of target objects with instantaneous all-optical erasure of other classes of objects. This diffractive camera consists of transmissive surfaces structured using deep learning to perform selective imaging of target classes of objects positioned at its input field-of-view. After their fabrication, the thin diffractive layers collectively perform optical mode filtering to accurately form images of the objects that belong to a target data class or group of classes, while instantaneously erasing objects of the other data classes at the output field-of-view. Using the same framework, we also demonstrate the design of class-specific permutation and class-specific linear transformation cameras, where the objects of a target data class are pixel-wise permuted or linearly transformed following an arbitrarily selected transformation matrix for all-optical class-specific encryption, while the other classes of objects are irreversibly erased from the output image. The success of class-specific diffractive cameras was experimentally demonstrated using terahertz (THz) waves and 3D-printed diffractive layers that selectively imaged only one class of the MNIST handwritten digit dataset, all-optically erasing the other handwritten digits. This diffractive camera design can be scaled to different parts of the electromagnetic spectrum, including, e.g., the visible and infrared wavelengths, to provide transformative opportunities for privacy-preserving digital cameras and task-specific data-efficient imaging.