Search NASA⌕ Search

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.

At least 127 records · Page 7
All sourcesNASA NTRSDOE OSTI
NASA NTRS2003

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗
NASA NTRS2004

A Comparison of Techniques for Scheduling Earth-Observing Satellites

Scheduling observations by coordinated fleets of Earth Observing Satellites (EOS) involves large search spaces, complex constraints and poorly understood bottlenecks, conditions where evolutionary and related algorithms are often effective. However, there are many such algorithms and the best one to use is not clear. Here we compare multiple variants of the genetic algorithm: stochastic hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on ten realistically-sized EOS scheduling problems. Schedules are represented by a permutation (non-temperal ordering) of the observation requests. A simple deterministic scheduler assigns times and resources to each observation request in the order indicated by the permutation, discarding those that violate the constraints created by previously scheduled observations. Simulated annealing performs best. Random mutation outperform a more 'intelligent' mutator. Furthermore, the best mutator, by a small margin, was a novel approach we call temperature dependent random sampling that makes large changes in the early stages of evolution and smaller changes towards the end of search.

Globus, Al↗
NASA NTRS1997

Design of Serially Concatenated Interleaved Codes

A serially concatenated code with interleaver consists of the cascade of an outer encoder, an interleaver permuting the outer codeword bits, and an inner encoder whose input words are the permuted outer codewords.

Interleaved Codes Concatenation↗
NASA NTRS1995

Trellis Decoding Complexity of 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, it 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.

trellis decoding↗
NASA NTRS1999

Signal processing applications of massively parallel charge domain computing devices

The present invention is embodied in a charge coupled device (CCD)/charge injection device (CID) architecture capable of performing a Fourier transform by simultaneous matrix vector multiplication (MVM) operations in respective plural CCD/CID arrays in parallel in O(1) steps. For example, in one embodiment, a first CCD/CID array stores charge packets representing a first matrix operator based upon permutations of a Hartley transform and computes the Fourier transform of an incoming vector. A second CCD/CID array stores charge packets representing a second matrix operator based upon different permutations of a Hartley transform and computes the Fourier transform of an incoming vector. The incoming vector is applied to the inputs of the two CCD/CID arrays simultaneously, and the real and imaginary parts of the Fourier transform are produced simultaneously in the time required to perform a single MVM operation in a CCD/CID array.

Fijany, Amir↗
NASA NTRS2012

Expanding AirSTAR Capability for Flight Research in an Existing Avionics Design

The NASA Airborne Subscale Transport Aircraft Research (AirSTAR) project is an Unmanned Aerial Systems (UAS) test bed for experimental flight control laws and vehicle dynamics research. During its development, the test bed has gone through a number of system permutations, each meant to add functionality to the concept of operations of the system. This enabled the build-up of not only the system itself, but also the support infrastructure and processes necessary to support flight operations. These permutations were grouped into project phases and the move from Phase-III to Phase-IV was marked by a significant increase in research capability and necessary safety systems due to the integration of an Internal Pilot into the control system chain already established for the External Pilot. The major system changes in Phase-IV operations necessitated a new safety and failsafe system to properly integrate both the Internal and External Pilots and to meet acceptable project safety margins. This work involved retrofitting an existing data system into the evolved concept of operations. Moving from the first Phase-IV aircraft to the dynamically scaled aircraft further involved restructuring the system to better guard against electromagnetic interference (EMI), and the entire avionics wiring harness was redesigned in order to facilitate better maintenance and access to onboard electronics. This retrofit and harness re-design will be explored and how it integrates with the evolved Phase-IV operations.

Laughter, Sean A.↗
NASA NTRS2018

Uncertainty in Heart Rate Complexity Metrics Caused by R-Peak Perturbations

Heart rate complexity (HRC) is a proven metric for gaining insight into human stress and physiological deterioration. To calculate HRC, the detection of the exact instance of when the heart beats, the R-peak, is necessary. Electrocardiogram (ECG) signals can often be corrupted by environmental noise (e.g., from electromagnetic interference, movement artifacts), which can potentially alter the HRC measurement, producing erroneous inputs which feed into decision support models. Current literature has only investigated how HRC is affected by noise when R-peak detection errors occur (false positives and false negatives). However, the numerical methods used to calculate HRC are also sensitive to the specific location of the fiducial point of the R-peak. This raises many questions regarding how this fiducial point is altered by noise, the resulting impact on the measured HRC, and how we can account for noisy HRC measures as inputs into our decision models. This work uses Monte Carlo simulations to systematically add white and pink noise at different permutations of signal-to-noise ratios (SNRs), time segments, sampling rates, and HRC measurements to characterize the influence of noise on the HRC measure by altering the fiducial point of the R-peak. Using the generated information from these simulations provides improved decision processes for system design which address key concerns such as permutation entropy being a more precise, reliable, less biased, and more sensitive measurement for HRC than sample and approximate entropy.

Napoli, Nicholas J.↗
DOE OSTI2023

Simulating molecular polaritons in the collective regime using few-molecule models

The study of molecular polaritons beyond simple quantum emitter ensemble models (e.g., Tavis–Cummings) is challenging due to the large dimensionality of these systems and the complex interplay of molecular electronic and nuclear degrees of freedom. This complexity constrains existing models to either coarse-grain the rich physics and chemistry of the molecular degrees of freedom or artificially limit the description to a small number of molecules. In this work, we exploit permutational symmetries to drastically reduce the computational cost of ab initio quantum dynamics simulations for large N . Furthermore, we discover an emergent hierarchy of timescales present in these systems, that justifies the use of an effective single molecule to approximately capture the dynamics of the entire ensemble, an approximation that becomes exact as N → ∞. We also systematically derive finite N corrections to the dynamics and show that addition of k extra effective molecules is enough to account for phenomena whose rates scale as 𝒪( N − k ). Based on this result, we discuss how to seamlessly modify existing single-molecule strong coupling models to describe the dynamics of the corresponding ensemble. We call this approach collective dynamics using truncated equations (CUT-E), benchmark it against well-known results of polariton relaxation rates, and apply it to describe a universal cavity-assisted energy funneling mechanism between different molecular species. Beyond being a computationally efficient tool, this formalism provides an intuitive picture for understanding the role of bright and dark states in chemical reactivity, necessary to generate robust strategies for polariton chemistry.

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

HPC Software Verification in Action: A Case Study with Tensor Transposition

As HPC platforms get increasingly complex, the complexity of software optimized for these platforms has also increased. There is a pressing need to ensure correctness of scientific applications to enhance our confidence in the results they produce. In this paper, we focus on checking the correctness of libraries providing a small but important functionality— tensor transposition—used in computational chemistry applications. While several correctness tools have been developed and deployed, there are several practical challenges in using them to verify production HPC software. We present our experiences using two tools—CIVL and CodeThorn—in checking the correctness of two index permutation libraries.

Model checking, equivalence checking, index permut↗
DOE OSTI2019

Complexity and entropy representation for machine component diagnostics

The Complexity-entropy causality plane (CECP) is a parsimonious representation space for time series. It has only two dimensions: normalized permutation entropy and Jensen-Shannon complexity of a time series. This two-dimensional representation allows for detection of slow or rapid drifts in the condition of mechanical components monitored through sensor measurements. The CECP representation can be used for both predictive analytics and visual monitoring of changes in component condition. This method requires minimal pre-processing of raw signals. Furthermore, it is insensitive to noise, stationarity, and trends. These desirable properties make CECP a good candidate for machine condition monitoring and fault diagnostics. In this work we study the effectiveness of CECP on three rotary component condition assessment applications. We use CECP representation of vibration signals to differentiate various machine component health conditions for rotary machine components, namely roller bearing and gears. The results confirm that the CECP representation is able to detect, with high accuracy, changes in underlying dynamics of machine component degradation states. From class separability perspective, the CECP representation is able to generate linearly separable classes for the classification of different fault states. This classification performance improves with increasing signal length. For signal length of 16,384 data points, the fault classification accuracy varies from 90% to 100% for bearing applications, and from 85% to 100% for gear applications. We observed that the optimum parameter for CECP representating depends on the application. For bearing applications we found that embedding dimension D = 4, 5, 6, and embedding delay τ = 1, 2, 3 are suitable for good fault classification. For gear applications we find that embedding dimension D = 4, 5, and embedding delay τ = 1, 5 are suitable for fault classification.

47 OTHER INSTRUMENTATION↗
NASA NTRS1997

Using Non-Linear Statistical Methods with Laboratory Kinetic Data

This paper will demonstrate the usefulness of standard non-linear statistical analysis on ICR and SIFT kinetic data. The specific systems used in the demonstration are the isotopic and change transfer reactions in the system of H2O+/D2O, H30+/D2O, and other permutations.

non-linear analysis kinetic isotopic permutations ↗
DOE OSTI2023

Universal Polarization Transformations: Spatial Programming of Polarization Scattering Matrices Using a Deep Learning‐Designed Diffractive Polarization Transformer

Abstract Controlled synthesis of optical fields having nonuniform polarization distributions presents a challenging task. Here, a universal polarization transformer is demonstrated that can synthesize a large set of arbitrarily‐selected, complex‐valued polarization scattering matrices between the polarization states at different positions within its input and output field‐of‐views (FOVs). This framework comprises 2D arrays of linear polarizers positioned between isotropic diffractive layers, each containing tens of thousands of diffractive features with optimizable transmission coefficients. After its deep learning‐based training, this diffractive polarization transformer can successfully implement N i N o = 10 000 different spatially‐encoded polarization scattering matrices with negligible error, where N i and N o represent the number of pixels in the input and output FOVs, respectively. This universal polarization transformation framework is experimentally validated in the terahertz spectrum by fabricating wire‐grid polarizers and integrating them with 3D‐printed diffractive layers to form a physical polarization transformer. Through this set‐up, an all‐optical polarization permutation operation of spatially‐varying polarization fields is demonstrated, and distinct spatially‐encoded polarization scattering matrices are simultaneously implemented between the input and output FOVs of a compact diffractive processor. This framework opens up new avenues for developing novel devices for universal polarization control and may find applications in, e.g., remote sensing, medical imaging, security, material inspection, and machine vision.

Optical neural networks↗
DOE OSTI2022

Semiclassical Trajectory Studies of Reactive and Nonreactive Scattering of OH( 2 Σ + ) by H 2 Based on an Improved Full-Dimensional Ab Initio Diabatic Potential Energy Matrix

Here we present a new full-dimensional diabatic potential energy matrix (DPEM) for electronically nonadiabatic collisions of OH(A 2 Σ + ) with H 2 , and we calculate the probabilities of electronically adiabatic inelastic collisions, nonreactive quenching, and reactive quenching to form H 2 O+H. The DPEM was fitted using a many-body expansion with permutationally invariant polynomials in bond-order functions to represent the many-body part. The dynamics calculations were carried out with the fewest-switches with time uncertainty and stochastic decoherence (FSTU/SD) semiclassical trajectory method. We present results both for head-on collisions (impact parameter b equal to zero) and for a full range of impact parameters. The results are compared to experiment and to earlier FSTU/SD and quantum dynamics calculations with a previously published DPEM. The various theoretical results all agree that nonreactive quenching dominates reactive quenching, but there are quantitative differences between the two DPEMs and between the b=0 results and the all-b results, especially for the probability of reactive quenching.

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

Modeling the distribution of the endangered Jemez Mountains salamander (Plethodon neomexicanus) in relation to geology, topography, and climate

The Jemez Mountains salamander (Plethodon neomexicanus; hereafter JMS) is an endangered salamander restricted to the Jemez Mountains in north-central New Mexico, United States. This strictly terrestrial and lungless species requires moist surface conditions for activities such as mating and foraging. Threats to its current habitat include fire suppression and ensuing severe fires, changes in forest composition, habitat fragmentation, and climate change. Forest composition changes resulting from reduced fire frequency and increased tree density suggest that its current aboveground habitat does not mirror its historically successful habitat regime. However, because of its limited habitat area and underground behavior, we hypothesized that geology and topography might play a significant role in the current distribution of the salamander. We modeled the distribution of the JMS using a machine learning algorithm to assess how geology, topography, and climate variables influence its distribution. The best habitat suitability model indicates that geology type and maximum winter temperature (November to March) were most important in predicting the distribution of the salamander (23.5% and 50.3% permutation importance, respectively). Minimum winter temperature was also an important variable (21.4%), suggesting this also plays a role in salamander habitat. Our habitat suitability map reveals low uncertainty in model predictions, and we found slight discrepancies between the designated critical habitat and the most suitable areas for the JMS. Because geological features are important to its distribution, we recommend that geological and topographical data are considered, both during survey design and in the description of localities of JMS records once detected.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Using projection operators with maximum overlap methods to simplify challenging self-consistent field optimization

Maximum overlap methods are effective tools for optimizing challenging ground- and excited-state wave functions using self-consistent field models such as Hartree-Fock and Kohn-Sham density functional theory. Nevertheless, such models have shown significant sensitivity to the user-defined initial guess of the target wave function. Here in this work, a projection operator framework is defined and used to provide a metric for non-aufbau orbital selection in maximum-overlap-methods. The resulting algorithms, termed the Projection-based Maximum Overlap Method (PMOM) and Projection-based Initial Maximum Overlap Method (PIMOM), are shown to perform exceptionally well when using simple user-defined target solutions based on occupied/virtual molecular orbital permutations. This work also presents a new metric that provides a simple and conceptually convenient measure of agreement between the desired target and the current or final SCF results during a calculation employing a maximum-overlap method.

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

High‐order symmetric cubature rules for tetrahedra and pyramids

Abstract In this article, we present an algorithm to construct high‐order fully symmetric cubature rules for tetrahedral and pyramidal elements, with positive weights and integration points that are in the interior of the domain. Cubature rules are fully symmetric if they are invariant to affine transformations of the domain. We divide the integration points into symmetry orbits where each orbit contains all the points generated by the permutation stars. These relations are represented by equality constraints. The construction of symmetric cubature rules require the solution of nonlinear polynomial equations with both inequality and equality constraints. For higher orders, we use an algorithm that consists of five sequential phases to produce the cubature rules. In the literature, symmetric numerical integration rules are available for the tetrahedron for orders p = 1 – 10, 14 , and for the pyramid up to p = 10 . We have obtained fully symmetric cubature rules for both of these elements up to order p = 20 . Numerical tests are presented that verify the polynomial‐precision of the cubature rules. Convergence studies are performed for the integration of exponential, weakly singular, and trigonometric test functions over both elements with flat and curved faces. With increase in p , improvements in accuracy is realized, though nonmonotonic convergence is observed.

Jaśkowiec, Jan↗