Search NASA⌕ Search

SEARCH · Search NASA

Results for “randomized algorithm”

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 1,765 records · Page 98

A globally sampled high-resolution hand-labeled validation dataset for evaluating surface water extent maps

Effective monitoring of global water resources is increasingly critical due to climate change and population growth. Advancements in remote sensing technology, specifically in spatial, spectral, and temporal resolutions, are revolutionizing water resource monitoring, leading to more frequent and high-quality surface water extent maps using various techniques such as traditional image processing and machine learning algorithms. However, satellite imagery datasets contain trade-offs that result in inconsistencies in performance, such as disparities in measurement principles between optical (e.g., Sentinel-2) and radar (e.g., Sentinel-1) sensors and differences in spatial and spectral resolutions among optical sensors. Therefore, developing accurate and robust surface water mapping solutions requires independent validations from multiple datasets to identify potential biases within the imagery and algorithms. However, high-quality validation datasets are expensive to build, and few contain information on water resources. For this purpose, we introduce a globally sampled, high-spatial-resolution dataset labeled using 3 m PlanetScope imagery. Our surface water extent dataset comprises 100 images, each with a size of 1024×1024 pixels, which were sampled using a stratified random sampling strategy covering all 14 biomes. We highlighted urban and rural regions, lakes, and rivers, including braided rivers and coastal regions. We evaluated two surface water extent mapping methods using our dataset – Dynamic World, based on Sentinel-2, and the NASA IMPACT model, based on Sentinel-1. Dynamic World achieved a mean intersection over union (IoU) of 72.16 % and F1 score of 79.70 %, while the NASA IMPACT model had a mean IoU of 57.61 % and F1 score of 65.79 %. Performance varied substantially across biomes, highlighting the importance of evaluating models on diverse landscapes to assess their generalizability and robustness. Our dataset can be used to analyze satellite products and methods, providing insights into their advantages and drawbacks. Our dataset offers a unique tool for analyzing satellite products, aiding the development of more accurate and robust surface water monitoring solutions. The dataset can be accessed via https://doi.org/10.25739/03nt-4f29.

54 ENVIRONMENTAL SCIENCES↗

On the error probability of general tree and trellis codes with applications to sequential decoding

An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random binary tree codes is derived and shown to be independent of the length of the tree. An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n is derived which separates the effects of the tail length T and the memory length M of the code. It is shown that the bound is independent of the length L of the information sequence. This implication is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication and further suggest an empirical formula for the true undetected decoding error probability with sequential decoding.

Johannesson, R.↗

On the error probability of general trellis codes with applications to sequential decoding

An upper bound on the average probability of error for maximum-likelihood decoding of the ensemble of random L-branch binary trellis codes of rate R = 1/n with distinction between memory length and tail length is given. It is shown that the bound is independent of the length L of the information sequence if the memory length exceeds the tail length by a specified amount that depends on L. Sequential decoding simulations using the stack algorithm were conducted to test the dependence of the undetected error probability on tail length and memory length, and the results corroborated the theory.

Johannesson, R.↗

On signal design by the R/0/ criterion for non-white Gaussian noise channels

The use of the cut-off rate criterion for modulation system design is investigated for channels with non-white Gaussian noise. A signal space representation of the waveform channel is developed, and the cut-off rate for vector channels with additive non-white Gaussian noise and unquantized demodulation is derived. When the signal input to the channel is a continuous random vector, maximization of the cut-off rate with constrained average signal energy leads to a water-filling interpretation of optimal energy distribution in signal space. The necessary condition for a finite signal set to maximize the cut-off rate with constrained energy and an equally likely probability assignment of signal vectors is presented, and an algorithm is outlined for numerically computing the optimum signal set. As an example, the rectangular signal set which has the water-filling average energy distribution and the optimum rectangular set are compared.

Bordelon, D. L.↗

Polymorphic Electronic Circuits

Polymorphic electronics is a nascent technological discipline that involves, among other things, designing the same circuit to perform different analog and/or digital functions under different conditions. For example, a circuit can be designed to function as an OR gate or an AND gate, depending on the temperature (see figure). Polymorphic electronics can also be considered a subset of polytronics, which is a broader technological discipline in which optical and possibly other information- processing systems could also be designed to perform multiple functions. Polytronics is an outgrowth of evolvable hardware (EHW). The basic concepts and some specific implementations of EHW were described in a number of previous NASA Tech Briefs articles. To recapitulate: The essence of EHW is to design, construct, and test a sequence of populations of circuits that function as incrementally better solutions of a given design problem through the selective, repetitive connection and/or disconnection of capacitors, transistors, amplifiers, inverters, and/or other circuit building blocks. The evolution is guided by a search-and-optimization algorithm (in particular, a genetic algorithm) that operates in the space of possible circuits to find a circuit that exhibits an acceptably close approximation of the desired functionality. The evolved circuits can be tested by computational simulation (in which case the evolution is said to be extrinsic), tested in real hardware (in which case the evolution is said to be intrinsic), or tested in random sequences of computational simulation and real hardware (in which case the evolution is said to be mixtrinsic).

Stoica, Adrian↗

Application of Ensemble Detection and Analysis to Modeling Uncertainty in Non Stationary Process

Characterization of non stationary and nonlinear processes is a challenge in many engineering and scientific disciplines. Climate change modeling and projection, retrieving information from Doppler measurements of hydrometeors, and modeling calibration architectures and algorithms in microwave radiometers are example applications that can benefit from improvements in the modeling and analysis of non stationary processes. Analyses of measured signals have traditionally been limited to a single measurement series. Ensemble Detection is a technique whereby mixing calibrated noise produces an ensemble measurement set. The collection of ensemble data sets enables new methods for analyzing random signals and offers powerful new approaches to studying and analyzing non stationary processes. Derived information contained in the dynamic stochastic moments of a process will enable many novel applications.

Racette, Paul↗

Uncovering Hazards Using a Multi-Objective Optimization to Explore the Faulty State-Space

Considering resilience when designing complex engineered systems is crucial to ensure the system is safe under unexpected hazardous scenarios. Traditional risk-based approaches, such as Failure Modes and Effects Analysis (FMEA) are useful for designing the system to mitigate hazardous scenarios that can be identified by the designer, but often require experience or prior knowledge of system failures to generate. More recently, researchers have developed simulation tools that enable the designer to model large sets of hazardous scenarios (driven by both internal faults and external factors) through simulation. While these tools enable a wider scope of fault modes to be evaluated (e.g., by injecting combined set of fault modes or injecting modes at different times), the resulting assessments (like FMEA) still require knowledge of the specific modes to be evaluated. However, failure to analyze a wide variety of fault scenarios can lead to an incomplete picture of the system resilience, especially to "surprise events'' which may be difficult for the designer to identify and predict beforehand. To overcome this challenge, previous work developed a fault sampling approach for resilience simulations which would procedurally-generate a wide variety of potential faults by systematically perturbing the health states of the system. While the resulting fault modes generated covered a much larger space hazards than would be otherwise considered (and identified many unique failure trajectories which would not have otherwise been identified), it also significantly increased the computational cost of the analysis and resulted in the simulation and analysis of a large set of essentially duplicate scenarios. Additionally, as the number of dimensions in the faulty state-space increases, the full elaboration of possible modes becomes computationally infeasible, justifying the use of a more targeted search. To resolve this limitation, this work proposes the use of a multiobjective optimization algorithm to search the health state space for potential fault modes that are both (1) hazardous and (2) unique. To solve this type of problem, this work proposes the use of a cooperative co-evolutionary algorithm. To demonstrate this approach, it will be applied to a model of an autonomous rover which uses line markings to navigate, focusing on potential hazards in the drive system which could cause the rover to crash. To determine the merit of the approach, it will further be compared with the previously-presented range elaboration approach and a random mode generation approach on the basis of computational efficiency and found modes.

Resilience↗

Theoretical Basis for the Surface Spectral Reflectance Relationships Used in the MODIS Aerosol Algorithm

The analysis of data from the MODIS instrument on the Terra platform to derive global distribution of aerosols assumes a set of relationships between the blue, rho (sub blue), the red, rho (sub red), and 2.1 micrometers, rho (sub 2.1), spectral channels. These relations have been established from a series of measurements indicating that rho (sub blue) approximately 0.5 rho (sub red) approximately 0.25 rho (sub 2.1). Here we use a model to describe the transfer of radiation through a vegetation canopy composed of randomly oriented leaves to assess the theoretical foundations for these relationships. The influence of varying fractional vegetation coverage is simulated simply as a linear combination of pure soil and pure vegetation conditions, also known as Independent Pixel Approximation (IPA). Calculations for a wide range of leaf area indices and vegetation fractions show that rho (sub blue) is consistently about 1/4 of rho (sub 2.1) as used by MODIS for the whole range of analyzed cases, except for very dark soils, such as those found in burn scars. For its part, the ratio rho (sub red)/rho (sub 2.1) varies from less than the empirically derived value of 1/2 for dense and dark vegetation (rho (sub 2.1) less than 0.1), to more than 1/2 for bright mixture of soil and vegetation. This is in agreement with measurements over uniform dense vegetation, but not with measurements over mixed dark scenes. In the later case, the discrepancy is probably mitigated by shadows due to uneven canopy and terrain on a large scale. It is concluded that the value of this ratio should ideally be made dependent on the land cover type in the operational processing of MODIS data, especially over dense forests.

Kaufman, Yoram J.↗

Structure of isolated biomolecules obtained from ultrashort x-ray pulses: exploiting the symmetry of random orientations

mongst the promised capabilities of fourth-generation x-ray sources currently under construction is the ability to record diffraction patterns from individual biological molecules. One version of such an experiment would involve directing a stream of molecules into the x-ray beam and sequentially recording the scattering from each molecule of a short, but intense, pulse of radiation. The pulses are sufficiently short that the diffraction pattern is that due to scattering from identical molecules frozen gorithms have been proposed for finding the relative orientations from just the measured diffraction data. The common-line method, also employed in 3D electron microscopy, appears not best suited to the very low mean photon count per diffraction pattern pixel expected in such experiments. A manifold embedding technique has been used to reconstruct the 3D diffraction volume and hence the electron density of a small protein at the signal level expected of the scattering of an x-ray free electron laser pulse from a 500 kD biomolecule. In this paper, we propose an alternative algorithm which raises the possibility of reconstructing the 3D diffraction volume of a molecule without determining the relative orientations of the individual diffraction patterns. We discuss why such an algorithm may provide a practical and computationally convenient method of extracting information from very weak diffraction patterns. We suggest also how such a method may be adapted to the problem of finding the variations of a structure with time in a time-resolved pump probe experiment.

36 MATERIALS SCIENCE↗

Collision-free poisson motion planning in ultra high-dimensional molecular conformation spaces

The function of protein, RNA, and DNA is modulated by fast, dynamic exchanges between three-dimensional conformations. Conformational sampling of biomolecules with exact and nullspace inverse kinematics, using rotatable bonds as revolute joints and noncovalent interactions as holonomic constraints, can accurately characterize these native ensembles. However, sampling biomolecules remains challenging owing to their ultra-high dimensional configuration spaces, and the requirement to avoid (self-) collisions, which results in low acceptance rates. In this paper, we present two novel mechanisms to overcome these limitations. First, we introduce temporary constraints between near-colliding links. The resulting constraint varieties instantaneously redirect the search for collision-free conformations, and couple motions between distant parts of the linkage. Second, we adapt a randomized Poisson-disk motion planner, which prevents local oversampling and widens the search, to ultra-high dimensions. Tests on several model systems show that the sampling acceptance rate can increase from 16% to 70%, and that the conformational coverage in loop modeling measured as average closeness to existing loop conformations doubled. Finally, correlated protein motions identified with our algorithm agree with those from MD simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Genarris: Random generation of molecular crystal structures and fast screening with a Harris approximation

Herein, we present Genarris, a Python package that performs configuration space screening for molecular crystals of rigid molecules by random sampling with physical constraints. For fast energy evaluations, Genarris employs a Harris approximation, whereby the total density of a molecular crystal is constructed via superposition of single molecule densities. Dispersion-inclusive density functional theory is then used for the Harris density without performing a self-consistency cycle. Genarris uses machine learning for clustering, based on a relative coordinate descriptor developed specifically for molecular crystals, which is shown to be robust in identifying packing motif similarity. In addition to random structure generation, Genarris offers three workflows based on different sequences of successive clustering and selection steps: the "Rigorous" workflow is an exhaustive exploration of the potential energy landscape, the "Energy" workflow produces a set of low energy structures, and the "Diverse" workflow produces a maximally diverse set of structures. The latter is recommended for generating initial populations for genetic algorithms. Here, the implementation of Genarris is reported and its application is demonstrated for three test cases. Published by AIP Publishing.

74 ATOMIC AND MOLECULAR PHYSICS↗

A Robust Method to Secure Multi-Inverter Grid Tied PV and Battery Energy Storage Systems Against Cyber Intrusions

This paper details a robust method to secure a multi-inverter grid tied system that interfaces photovoltaic (PV) and battery energy storage against potential cyber-attacks. The method can be applied to any third-party inverter systems without a need to modify their internal controls. A small random private excitation signal termed "watermark" is injected into the DC input voltage terminals (via a series transformer) connected to the PV/battery inverter system. An external robust cyber intrusion detector (CID) hardware consisting of a digital signal processor (DSP) generates the "watermark" and also receives the sensor signals that control the setpoints of the PV/battery grid tied system. The CID algorithm is shown to detect all possible cyber intrusions (such as false data injection(FDI)) on external sensor signals such as P and Q measured by a smart meter that control the overall system operation. The proposed CID computes online system ID and two variance tests in real time on each sensor signal and is able pinpoint intrusion location in a multi-inverter system. Results on a hardware in the loop (HIL) of a two-inverter grid connected system demonstrate effectiveness of the proposed CID system for FDI and unobservable FDI. Test results on a laboratory prototype will be discussed in the conference presentation.

Ibrahim, Hasan↗

Deep active learning for classifying cancer pathology reports

Abstract Background Automated text classification has many important applications in the clinical setting; however, obtaining labelled data for training machine learning and deep learning models is often difficult and expensive. Active learning techniques may mitigate this challenge by reducing the amount of labelled data required to effectively train a model. In this study, we analyze the effectiveness of 11 active learning algorithms on classifying subsite and histology from cancer pathology reports using a Convolutional Neural Network as the text classification model. Results We compare the performance of each active learning strategy using two differently sized datasets and two different classification tasks. Our results show that on all tasks and dataset sizes, all active learning strategies except diversity-sampling strategies outperformed random sampling, i.e., no active learning. On our large dataset (15K initial labelled samples, adding 15K additional labelled samples each iteration of active learning), there was no clear winner between the different active learning strategies. On our small dataset (1K initial labelled samples, adding 1K additional labelled samples each iteration of active learning), marginal and ratio uncertainty sampling performed better than all other active learning techniques. We found that compared to random sampling, active learning strongly helps performance on rare classes by focusing on underrepresented classes. Conclusions Active learning can save annotation cost by helping human annotators efficiently and intelligently select which samples to label. Our results show that a dataset constructed using effective active learning techniques requires less than half the amount of labelled data to achieve the same performance as a dataset constructed using random sampling.

59 BASIC BIOLOGICAL SCIENCES↗

The sponge-like topology of large-scale structure in the universe

The relative connectedness of the high- and low-density regions in the universe is studied using a median density contour which divides space into two equal volumes. The CfA data are found to show a sponge-like topology where the highand low-density regions are both interlocking and equivalent. The boundary surface between the two regions has a general negative curvature, and is characterized by a large number of holes. In the initial conditions the connectedness of the two regions must be identical because a change of sign in the random quantum fluctuations would reverse their roles. It is noted that in the cold dark matter and neutrino scenarios the hole sizes are typically of the order of the smoothing diameter or the damping length, whichever is larger. The sponge-like topology is consistent with the universe having a frothy appearance without being divided neatly into cells. A computer algorithm for measuring topology is discussed.

Gott, J. R., III↗

Optimization of blade arrangement in a randomly mistuned cascade using simulated annealing

This paper presents preliminary results of an investigation on mistuning of bladed-disk assemblies aimed at capturing the benefits of mistuning on stability, while at the same time, minimizing the adverse effects on response by solving the following problem: given a set of N turbine blades, each being a small random perturbation of the same nominal blade, determine the best arrangement of the N blades in a mistuned cascade with regard to aeroelastic response. In the studies reported here, mistuning of the blades is restricted to small differences in torsional stiffness. The large combinatorial optimization problem of seeking the best arrangement by blade exchanges is solved using a simulated annealing algorithm.

Thompson, Edward A.↗

Surface Modeling to Support Small-Body Spacecraft Exploration and Proximity Operations

In order to simulate physically plausible surfaces that represent geologically evolved surfaces, demonstrating demanding surface-relative guidance navigation and control (GN&C) actions, such surfaces must be made to mimic the geological processes themselves. A report describes how, using software and algorithms to model body surfaces as a series of digital terrain maps, a series of processes was put in place that evolve the surface from some assumed nominal starting condition. The physical processes modeled in this algorithmic technique include fractal regolith substrate texturing, fractally textured rocks (of empirically derived size and distribution power laws), cratering, and regolith migration under potential energy gradient. Starting with a global model that may be determined observationally or created ad hoc, the surface evolution is begun. First, material of some assumed strength is layered on the global model in a fractally random pattern. Then, rocks are distributed according to power laws measured on the Moon. Cratering then takes place in a temporal fashion, including modeling of ejecta blankets and taking into account the gravity of the object (which determines how much of the ejecta blanket falls back to the surface), and causing the observed phenomena of older craters being progressively buried by the ejecta of earlier impacts. Finally, regolith migration occurs which stratifies finer materials from coarser, as the fine material progressively migrates to regions of lower potential energy.

Riedel, Joseph E.↗

Quantum error mitigation by hidden inverses protocol in superconducting quantum devices

We present a method to improve the convergence of variational algorithms based on hidden inverses (HIs) to mitigate coherent errors. In the context of error mitigation, this means replacing the hardware implementation of certain Hermitian gates with their inverses. Doing so results in noise cancellation and a more resilient quantum circuit. This approach improves performance in a variety of two-qubit error models where the noise operator also inverts with the gate inversion. We apply the mitigation scheme on superconducting quantum processors running the variational quantum eigensolver (VQE) algorithm to find the H 2 ground-state energy. When implemented on superconducting hardware we find that the mitigation scheme effectively reduces the energy fluctuations in the parameter learning path in VQE, reducing the number of iterations for a converged value. We also provide a detailed numerical simulation of VQE performance under different noise models and explore how HIs and randomized compiling affect the underlying loss landscape of the learning problem. These simulations help explain our experimental hardware outcomes, helping to connect lower-level gate performance to application-specific behavior in contrast to metrics like fidelity which often do not provide an intuitive insight into observed high level performance.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Data-driven modeling and control of an X-ray bimorph adaptive mirror

Adaptive X-ray mirrors are being adopted on high-coherent-flux synchrotron and X-ray free-electron laser beamlines where dynamic phase control and aberration compensation are necessary to preserve wavefront quality from source to sample, yet challenging to achieve. Additional difficulties arise from the inability to continuously probe the wavefront in this context, which demands methods of control that require little to no feedback. In this work, a data-driven approach to the control of adaptive X-ray optics with piezo-bimorph actuators is demonstrated. This approach approximates the non-linear system dynamics with a discrete-time model using random mirror shapes and interferometric measurements as training data. For mirrors of this type, prior states and voltage inputs affect the shape-change trajectory, and therefore must be included in the model. Without the need for assumed physical models of the mirror's behavior, the generality of the neural network structure accommodates drift, creep and hysteresis, and enables a control algorithm that achieves shape control and stability below 2 nm RMS. Using a prototype mirror and ex situ metrology, it is shown that the accuracy of our trained model enables open-loop shape control across a diverse set of states and that the control algorithm achieves shape error magnitudes that fall within diffraction-limited performance.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗