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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 109 records · Page 6

All sources NASA NTRS DOE OSTI

DOE OSTI2026

Data for Immediate Impacts of Soybean Cover Crop on Bacterial Community Composition and Diversity in Soil Under Long-Term Saccharum Monoculture

Saccharum yield decline results from long-term monoculture practices. Changes in cropping management can improve soil health and productivity. Below-ground bacterial community diversity and composition across soybean (Glycine max (L.) Merr) cover crop, Saccharum monoculture (30+ year) and fallowed soil were determined. Near full length (~1,400 base pairs) of 16S rRNA gene sequences were extracted from the rhizospheres of sugarcane and soybean and fallowed soil were compared. Higher soil bacterial diversity was observed in the soybean cover crop than sugarcane monoculture across all measured indices (observed operationational taxonomic units, Chao1, Shannon, reciprocal Simpson and Jackknife). Acidocateria, Proteobacteria, Bacteroidetes and Planctomycetes were the most abundant bacterial phyla across the treatments. Indicator species analysis identified nine indicator phyla. Planctomycetes, Armatimonadetes and candidate phylum FBP were associated with soybean; Proteobacteria and Firmicutes were linked with sugarcane and Gemmatimonadetes, Nitrospirae, Rokubacteria and unclassified bacteria were associated with fallowed soil. Non-metric multidimensional scaling analysis showed distinct groupings of bacterial operational taxonomic units (97% identity) according to management system (soybean, sugarcane or fallow) indicating compositional differences among treatments. This is confirmed by the results of the multi-response permutation procedures (A = 0.541, p = 0.00045716). No correlation between soil parameters and bacterial community structure was observed according to Mantel test (r = 211865, p = 0.14). Use of soybean cover-crop fostered bacterial diversity and altered community structure. This indicates cover crops could have a restorative effect and potentially promote sustainability in long-term Saccharum production systems.

Field Data↗

DOE OSTI2022

SPANet: Generalized permutationless set assignment for particle physics using symmetry preserving attention

The creation of unstable heavy particles at the Large Hadron Collider is the most direct way to address some of the deepest open questions in physics. Collisions typically produce variable-size sets of observed particles which have inherent ambiguities complicating the assignment of observed particles to the decay products of the heavy particles. Current strategies for tackling these challenges in the physics community ignore the physical symmetries of the decay products and consider all possible assignment permutations and do not scale to complex configurations. Attention based deep learning methods for sequence modelling have achieved state-of-the-art performance in natural language processing, but they lack built-in mechanisms to deal with the unique symmetries found in physical set-assignment problems. We introduce a novel method for constructing symmetry-preserving attention networks which reflect the problem's natural invariances to efficiently find assignments without evaluating all permutations. This general approach is applicable to arbitrarily complex configurations and significantly outperforms current methods, improving reconstruction efficiency between 19% - 35% on typical benchmark problems while decreasing inference time by two to five orders of magnitude on the most complex events, making many important and previously intractable cases tractable. A full code repository containing a general library, the specific configuration used, and a complete dataset release, are available at https://github.com/Alexanders101/SPANet

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Anomalies of non-invertible symmetries in (3+1)d

Anomalies of global symmetries are important tools for understanding the dynamics of quantum systems. We investigate anomalies of non-invertible symmetries in 3+1d using 4+1d bulk topological quantum field theories given by Abelian two-form gauge theories, with a 0-form permutation symmetry. Gauging the 0-form symmetry gives the 4+1d “inflow” symmetry topological field theory for the non-invertible symmetry. We find a two levels of anomalies: (1) the bulk may fail to have an appropriate set of loop excitations which can condense to trivialize the boundary dynamics, and (2) the “Frobenius-Schur indicator” of the non-invertible symmetry (generalizing the Frobenius-Schur indicator of 1+1d fusion categories) may be incompatible with trivial boundary dynamics. As a consequence we derive conditions for non-invertible symmetries in 3+1d to be compatible with symmetric gapped phases, and invertible gapped phases. Along the way, we see that the defects characterizing \mathbb{Z}_{4} ℤ 4 ordinary symmetry host worldvolume theories with time-reversal symmetry \mathsf{T} 𝖳 obeying the algebra \mathsf{T}^{2}=C 𝖳 2 = C or \mathsf{T}^{2}=(-1)^{F}C, 𝖳 2 = ( − 1 ) F C , with C C a unitary charge conjugation symmetry. We classify the anomalies of this symmetry algebra in 2+1d and further use these ideas to construct 2+1d topological orders with non-invertible time-reversal symmetry that permutes anyons. As a concrete realization of our general discussion, we construct new lattice Hamiltonian models in 3+1d with non-invertible symmetry, and constrain their dynamics.

Córdova, Clay↗

DOE OSTI2023

Pavilion 2 Feature Additions [Slides]

Pavilion 2 is a critical component of system testing for LANL HPC systems. Pavilion 2 is system independent, which allows for the creation of a large suite of generalized tests than can be applied to multiple systems. These additions to Pavilion 2 improve our ability to test systems and diagnose issues. With such a large suite, running the proper tests when diagnosing and fixing a system can be difficult, as well as locating old tests for reference. Test configurations may contain several permutations of a test, not all of which may apply to a given system. The ability to run sets of test permutations lets the tester focus on specific parts of the test without having to edit the test configurations or run extraneous tests. The addition of the filter argument improves the ability to find test results based on test attributes, including past tests. Pavilion 2's system independence is largely based on various layers of configuration files. Configuration files for the host, test, and modes exist to allow generalized testing. The operating system configuration layer can provide helpful OS defaults to a test. Survey, a collection and reporting tool, can help us gauge the performance of a system as well as diagnose issues. The addition of a Survey mode in Pavilion 2 makes running tests with Survey very straightforward. The Survey results are combined with Pavilion 2's test results to make it easy to access.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Pavilion 2 Feature Additions [Slides]

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2024

Prompt Phrase Ordering Using Large Language Models in HPC: Evaluating Prompt Sensitivity

Large language models (LLMs) have demonstrated effective performance in domain-specific tasks, often requiring a well-designed prompt to guide their responses. However, optimizing the right prompt is challenging due to prompt sensitivity—the phenomenon where small changes in the prompt can lead to significant variations in performance. In this study, we evaluate prompt performance by examining all permutations of independent phrases to investigate prompt sensitivity and robustness. We used two datasets: the GSM8k dataset, which assesses mathematical reasoning, and a custom template prompt for summarizing database metadata. Our goal was to evaluate the performance across all permutations of a sequence of prompt phrases. The study was conducted using the llama3-instruct- 7B model hosted on Ollama, with computations parallelized in a high-performance computing environment. By comparing the average index of phrases in the best and worst-performing prompts, we found that the order of independent phrases within a prompt significantly impacts LLM performance. Additionally, we used Hamming distance to assess changes between phrase orderings, concluding that prompt modifications can dramatically affect scores, often by almost random chance. These findings support existing research on prompt sensitivity. We discuss the challenges of prompt optimization, noting that altering phrases in a successful prompt does not always result in another successful prompt.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Geometric Estimation of Multivariate Dependency

This paper proposes a geometric estimator of dependency between a pair of multivariate random variables. The proposed estimator of dependency is based on a randomly permuted geometric graph (the minimal spanning tree) over the two multivariate samples. This estimator converges to a quantity that we call the geometric mutual information (GMI), which is equivalent to the Henze–Penrose divergence. between the joint distribution of the multivariate samples and the product of the marginals. The GMI has many of the same properties as standard MI but can be estimated from empirical data without density estimation; making it scalable to large datasets. The proposed empirical estimator of GMI is simple to implement, involving the construction of an minimal spanning tree (MST) spanning over both the original data and a randomly permuted version of this data. We establish asymptotic convergence of the estimator and convergence rates of the bias and variance for smooth multivariate density functions belonging to a Hölder class. We demonstrate the advantages of our proposed geometric dependency estimator in a series of experiments.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

NASA NTRS1976

NASA Thesaurus. Volume 2: Access vocabulary

The NASA Thesaurus -- Volume 2, Access Vocabulary -- contains an alphabetical listing of all Thesaurus terms (postable and nonpostable) and permutations of all multiword and pseudo-multiword terms. Also included are Other Words (non-Thesaurus terms) consisting of abbreviations, chemical symbols, etc. The permutations and Other Words provide 'access' to the appropriate postable entries in the Thesaurus.

Source record↗

NASA NTRS1981

SAR processing on the MPP

The processing of synthetic aperture radar (SAR) signals using the massively parallel processor (MPP) is discussed. The fast Fourier transform convolution procedures employed in the algorithms are described. The MPP architecture comprises an array unit (ARU) which processes arrays of data; an array control unit which controls the operation of the ARU and performs scalar arithmetic; a program and data management unit which controls the flow of data; and a unique staging memory (SM) which buffers and permutes data. The ARU contains a 128 by 128 array of bit-serial processing elements (PE). Two-by-four surarrays of PE's are packaged in a custom VLSI HCMOS chip. The staging memory is a large multidimensional-access memory which buffers and permutes data flowing with the system. Efficient SAR processing is achieved via ARU communication paths and SM data manipulation. Real time processing capability can be realized via a multiple ARU, multiple SM configuration.

Batcher, K. E.↗

NASA NTRS1982

NASA Thesaurus. Volume 2: Access vocabulary

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains, 40,661 entries that give increased access to he hierarchies in Volume 1 - Hierarchical Listing.

Source record↗

NASA NTRS1985

NASA thesaurus. Volume 2: Access vocabulary

The Access Vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries, and pseudo-multiword terms that are permutations of words that contain words within words. The Access Vocabulary contains 40,738 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

Source record↗

NASA NTRS1986

Parallel solution of closely coupled systems

The odd-even permutation and associated unitary transformations for reordering the matrix coefficient A are employed as means of breaking the strong seriality which is characteristic of closely coupled systems. The nested dissection technique is also reviewed, and the equivalence between reordering A and dissecting its network is established. The effect of transforming A with odd-even permutation on its topology and the topology of its Cholesky factors is discussed. This leads to the construction of directed graphs showing the computational steps required for factoring A, their precedence relationships and their sequential and concurrent assignment to the available processors. Expressions for the speed-up and efficiency of using N processors in parallel relative to the sequential use of a single processor are derived from the directed graph. Similar expressions are also derived when the number of available processors is fewer than required.

Utku, S.↗

NASA NTRS1987

Algorithms and programming tools for image processing on the MPP:3

This is the third and final report on the work done for NASA Grant 5-403 on Algorithms and Programming Tools for Image Processing on the MPP:3. All the work done for this grant is summarized in the introduction. Work done since August 1986 is reported in detail. Research for this grant falls under the following headings: (1) fundamental algorithms for the MPP; (2) programming utilities for the MPP; (3) the Parallel Pascal Development System; and (4) performance analysis. In this report, the results of two efforts are reported: region growing, and performance analysis of important characteristic algorithms. In each case, timing results from MPP implementations are included. A paper is included in which parallel algorithms for region growing on the MPP is discussed. These algorithms permit different sized regions to be merged in parallel. Details on the implementation and peformance of several important MPP algorithms are given. These include a number of standard permutations, the FFT, convolution, arbitrary data mappings, image warping, and pyramid operations, all of which have been implemented on the MPP. The permutation and image warping functions have been included in the standard development system library.

Reeves, Anthony P.↗

NASA NTRS1988

NASA thesaurus. Volume 2: Access vocabulary

The access vocabulary, which is essentially a permuted index, provides access to any word or number in authorized postable and nonpostable terms. Additional entries include postable and nonpostable terms, other word entries and pseudo-multiword terms that are permutations of words that contain words within words. The access vocabulary contains almost 42,000 entries that give increased access to the hierarchies in Volume 1 - Hierarchical Listing.

Source record↗

NASA NTRS1994

Crossbar Switches For Optical Data-Communication Networks

Optoelectronic and electro-optical crossbar switches called "permutation engines" (PE's) developed to route packets of data through fiber-optic communication networks. Basic network concept described in "High-Speed Optical Wide-Area Data-Communication Network" (NPO-18983). Nonblocking operation achieved by decentralized switching and control scheme. Each packet routed up or down in each column of this 5-input/5-output permutation engine. Routing algorithm ensures each packet arrives at its designated output port without blocking any other packet that does not contend for same output port.

Monacos, Steve P.↗

NASA NTRS1993

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗

NASA NTRS1995

Trellis complexity bounds for decoding linear block codes

We consider the problem of finding a trellis for a linear block code that minimizes one or more measures of trellis complexity. The domain of optimization may be different permutations of the same code or different codes with the same parameters. Constraints on trellises, including relationships between the minimal trellis of a code and that of the dual code, are used to derive bounds on complexity. We define a partial ordering on trellises: If a trellis is optimum with respect to this partial ordering, if has the desirable property that it simultaneously minimizes all of the complexity measures examined. We examine properties of such optimal trellises and give examples of optimal permutations of codes, most notably the (48,24,12) quadratic residue code.

Kiely, A. B.↗

NASA NTRS1993

A Spectral Algorithm for Envelope Reduction of Sparse Matrices

The problem of reordering a sparse symmetric matrix to reduce its envelope size is considered. A new spectral algorithm for computing an envelope-reducing reordering is obtained by associating a Laplacian matrix with the given matrix and then sorting the components of a specified eigenvector of the Laplacian. This Laplacian eigenvector solves a continuous relaxation of a discrete problem related to envelope minimization called the minimum 2-sum problem. The permutation vector computed by the spectral algorithm is a closest permutation vector to the specified Laplacian eigenvector. Numerical results show that the new reordering algorithm usually computes smaller envelope sizes than those obtained from the current standard algorithms such as Gibbs-Poole-Stockmeyer (GPS) or SPARSPAK reverse Cuthill-McKee (RCM), in some cases reducing the envelope by more than a factor of two.

Barnard, Stephen T.↗