Engineering Papers⌕ Search

SEARCH · Engineering Papers

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,063 records · Page 59

How Can We Harness the Power of Machine Learning With TEMPO Data?

There are many potential applications of machine learning for TEMPO data that include - Improve retrievals by reducing the effect of random instrument noise - Expand coverage by producing data in moderately cloudy conditions (see also Fasnacht et al. poster) - Help diagnose impacts of instrumental artifacts - Produce value-added products quickly by training on existing products from other sensors (land and ocean) - Speed up processing by training on products produced with full-physics algorithms (e.g., NO 2 slant column fitting may take ~1 hour/orbit but with a neural net it may take only minutes)

NO2↗

Direct estimation of the density of states for fermionic systems

Simulating time evolution is one of the most natural applications of quantum computers and is thus one of the most promising prospects for achieving practical quantum advantage. Here, we develop quantum algorithms to extract thermodynamic properties by estimating the density of states (DOS), which is a central object in quantum statistical mechanics. We introduce several key innovations that significantly improve the practicality and extend the generality of previous techniques. First, our approach allows one to estimate the DOS only for a specific subspace of the full Hilbert space. This is crucial for fermionic systems, since both canonical and grand canonical ensemble thermal equilibrium properties depend on subspaces of fixed number. Second, in our approach, by time evolving very simple, random initial states, such as randomly chosen computational basis states, we can exactly recover the DOS on average. Third, due to circuit-depth limitations, we only reconstruct the DOS up to a convolution with a Gaussian window—thus all imperfections that shift the energy levels by less than the width of the convolution window will not significantly affect the estimated DOS. For these reasons, we find the approach is a promising candidate for early quantum advantage as even short-time, noisy dynamics can yield a semiquantitative reconstruction of the DOS (convolution with a broad Gaussian window), while early fault-tolerant devices will likely enable higher-resolution DOS reconstruction through longer time evolutions. We demonstrate the practicality of our approach in representative Fermi-Hubbard and spin models and indeed find that our approach is highly robust against algorithmic errors in the time evolution and against gate noise. We further demonstrate that our approach is compatible with noisy intermediate-scale quantum (NISQ) computing NISQ-friendly variational techniques, introducing and leveraging a technique for variational time evolution.

97 MATHEMATICS AND COMPUTING↗

A Further Look at X-33 Entry Guidance and Beyond

An entry guidance design developed at Iowa State University (ISU) for the X-33 advanced technology demonstrator is outlined and compared with the X-33 entry guidance algorithms developed at NASA Marshall. Both designs are based on the Space Shuttle entry guidance concept, but significant improvements have been made to enhance the performance and reduce the complexity. The ISU design was incorporated into MAVERIC, a high fidelity vehicle simulation software for the X-33, and evaluated in Monte Carlo simulations against random dispersions in propulsion system, wind and atmospheric properties, aerodynamic coefficients, interaction between propulsion and aerodynamics, and navigation data. The simulations clearly demonstrated the capability and precision of the ISU entry guidance design in successfully guiding the X-33 in some rather difficult flight scenarios. As the entry guidance development for the X-33 is completing, this report also offers some review of the strength and limitations of the current Shuttle-based entry guidance framework, and finally some potential candidates for next generation of more capable and cost-effective entry guidance designs are discussed.

Lu, Ping↗

Relationship Between Surface Reflectance in the Visible and Mid-IR used in MODIS Aerosol Algorithm-Theory

Data from the Moderate Resolution Imaging Spectroradiometer (MODIS) instrument that flies in polar orbit on the Terra platform, are used to derive the aerosol optical thickness and properties over land and ocean. The relationships between visible reflectance (at blue, rho(sub blue), and red, rho(sub red)) and mid-infrared (at 2.1 microns, rho(sub 2.1)) are used in the MODIS aerosol retrieval algorithm to derive global distribution of aerosols over the land. These relations have been established from a series of measurements indicating that rho(sub blue) is approximately 0.5 rho(sub red) is 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. 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, 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.↗

On the Natural Structure of Amino Acid Patterns in Families of Protein Sequences

All known terrestrial proteins are coded as continuous strings of ≈20 amino acids. The patterns formed by the repetitions of elements in groups of finite sequences describes the natural architectures of protein families. We present a method to search for patterns and groupings of patterns in protein sequences using a mathematically precise definition for “repetition”, an efficient algorithmic implementation and a robust scoring system with no adjustable parameters. We show that the sequence patterns can be well-separated into disjoint classes according to their recurrence in nested structures. The statistics of the occurrences of patterns indicate that short repetitions are sufficient to account for the differences between natural families and randomized groups of sequences by more than 10 standard deviations, while contiguous sequence patterns shorter than 5 residues are effectively random in their occurrences. A small subset of patterns is sufficient to account for a robust ”familiarity” definition between arbitrary sets of sequences.

Pablo Turjanski↗

Generalized master equation for particle transport in binary random media with renewal statistics

Particle transport in binary stochastic mixtures is classically modeled assuming Markovian or exponential mixing statistics but in many applications material memory invalidates the Markov assumption. For non-Markovian mixing characterized by alternating renewal processes, a transport-theoretic framework is presented that provides an exact description of transport in nonscattering random binary media with general non-exponential statistics. Our approach is to Markovianize the problem by augmenting the {material type, particle flux} state space with the age or distance from the last interface. A Chapman-Kolmogorov equation is formulated for the joint probability density of the material type, particle flux, and age, and subsequently reduced to a generalized Master equation (GME) in differential form. This constitutes the primary result of this work. A state-updating Monte Carlo algorithm consistent with the GME is developed and benchmarked against analytical solutions for multiple chord-length laws. For purely absorbing renewal statistical media, the GME reproduces analytical benchmarks for the equilibrium age distribution, interior mean/variance of material-conditioned fluxes, and boundary transmittance. Simulations further demonstrate that a Markov (exponential) approximation of non-exponential statistics can introduce large errors in transmittance and interior flux profiles. Lastly, the reintroduction of memory due to scattering is briefly addressed through heuristic considerations.

Fluctuations & noise↗

Short-Depth QAOA circuits and Quantum Annealing on Higher-Order Ising Models (Rev.2)

The Quantum Alternating Operator Ansatz (QAOA) and Quantum Annealing (QA) are quantum algorithms that are both based on the adiabatic theorem and both have the goal of sampling the optimal solution(s) of combinatorial optimization problems. Quantum annealing has been physically instantiated on D-Wave devices using superconducting flux qubits, and QAOA can be programmed on digital gate-model quantum computers such as the programmable superconducting transmon qubits devices of the IBMQ series, for instance ibm washington. QAOA and QA address the same types of problems, but it is unclear how they will scale to large problem sizes and to larger and higher-fidelity quantum computers. In this article, we present a direct comparison between QAOA, one and two rounds, run on all 127 qubits of ibm washington and QA run on D-Wave Advantage system4.1 and Advantage system6.1. The problems which allow for this comparison are random Ising model problems whose connectivity matches the heavy hexagonal lattice topology of ibm washington and the Pegasus graph connectivity of the two D-Wave devices. We create two classes of problem instances for this comparison: one with higher order terms (ZZZ variable interactions), linear terms, and quadratic terms, and a separate problem type with only linear and quadratic terms. Our QAOA circuits are novel and extremely short depth, with a CNOT depth of 6 per round, which allows whole chip usage of ibm washington’s heavy hexagonal lattice and can be applied to future heavy-hex chips. We also test the effectiveness of the error suppression technique digital dynamical decoupling on the QAOA circuits. The QAOA circuits compiled to ibm washington are composed of several thousand circuit instructions, approximately 3, 000 depending on the details of the circuit, making these some the largest quantum circuits ever executed on a digital quantum processor. QAOA and QA are compared against the classical heuristic algorithm of simulated annealing and all problem instances are exactly solved using CPLEX in order to evaluate which samplers, if any, correctly found the ground state solution(s) of the problem instances. We find that (i) QA outperforms QAOA on all problem instances, (ii) QAOA samples the problems better than random sampling, and (iii) QAOA angle computation exhibits clear parameter concentration across the ensemble of Ising models.

127 Qubits↗

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

The use of the R sub 0 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 R sub 0 for vector channels with additive nonwhite Gaussian noise and unquantized demodulation is derived. When the signal unput to the channel is a continuous random vector, maximization of R sub 0 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 R sub 0 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. A necessary condition on a constrained energy, finite signal set is found which maximizes a Taylor series approximation of R sub 0. This signal set is compared with the finite signal set which has the water-filling average energy distribution.

Bordelon, D. L.↗

Limited variance control in statistical low thrust guidance analysis

Difficulties arise in guiding a solar electric propulsion spacecraft due to nongravitational accelerations caused by random fluctuations in the magnitude and direction of the thrust vector. These difficulties may be handled by using a low thrust guidance law based on the linear-quadratic-Gaussian problem of stochastic control theory with a minimum terminal miss performance criterion. Explicit constraints are imposed on the variances of the control parameters, and an algorithm based on the Hilbert space extension of a parameter optimization method is presented for calculation of gains in the guidance law. The terminal navigation of a 1980 flyby mission to the comet Encke is used as an example.

Jacobson, R. A.↗

Report on the multicolor pyrometry session at the Second NASA Non-Contact Temperature-Measurement Workshop

The session met jointly with the other special sessions. Due to time constraints, the concerns of multicolor pyrometry were not addressed in depth. Multicolor pyrometry attempts to determine an object's temperature and emittance as a function of wavelength from simultaneous measurement of the spectral radiance of the object at multiple wavelengths. The main issues are those of the most appropriate model for the wavelength dependence of the emittance, the number of undetermined parameters, and the error in the measured temperature. It has long been known that it is inappropriate to attempt to model the emittance with a functional form that contains as many unknowns as wavelengths. Such attempts will lead to gross errors in the measured temperature. However, more recent work by Hunter and Khan has indicated that emittance can be modeled by a function with many fewer degrees of freedom than sampled wavelengths (e.g., it may be appropriate to use a second order polynomial to fit data from a forty-color pyrometer). In a platform lecture, Khan described algorithms for determination of the parameters by minimization of the errors between the model and the data in a least-squares sense. The first was a linear method and the second was a non-linear method where the emittance could assume any functional form. Both methods were shown to be very sensitive to random noise and non-linearity in the measurement system.

Spjut, R. Erik↗

Optimal discrete-time dynamic output-feedback design - A w-domain approach

An alternative method for optimal digital control design is described in this paper. The method is based on the usage of the w-transform and has many attractive design features. One of these is its immediate connection with frequency loop-shaping techniques that are now popular and effective for multivariable control synthesis in continuous-time domain. Furthermore, any design algorithms originally developed for continuous-time systems can now be immediately extended to the discrete-time domain. The main results presented in this paper are the exact problem formulation and solution of an optimal discrete-time dynamic output-feedback design in the w-domain involving a quadratic performance index to random disturbances. In addition, necessary conditions for optimality are obtained for the numerical solution of the optimal output-feedback compensator design. A numerical example is presented illustrating its application to the design of a low-order dynamic compensator in a stability augmentation system of a commercial transport.

Ha, Cheolkeun↗

Peak Rain Rate Sensitivity to Observed Cloud Condensation Nuclei and Turbulence in Continental Warm Shallow Clouds During CACTI

Abstract Warm clouds strongly affect Earth's energy budget but remain imperfectly represented in climate models, partly due to the complexity and covariability of relevant processes influencing warm rain. This work presents a detailed analysis of different factors affecting rain rate peak intensity (RR) in continental warm clouds. Clouds were identified with vertically pointing radar and lidar observations and categorized via a temperature‐based cloud type classification algorithm from which warm clouds were isolated. Observations and retrievals of liquid water path (LWP), cloud condensation nuclei concentration (N CCN ), cloud depth, and cloud duration of more than 3,000 separate warm clouds sampled during the Cloud, Aerosol, and Complex Terrain Interactions (CACTI) field campaign are analyzed in this work. Multiple linear regression (MLR) and random forest (RF) models are applied to assess the relative impact of these variables on RR. Overall, RR tends to increase as cloud depth, LWP, and cloud duration increase, or N CCN decreases. Cloud depth affects RR the most while N CCN impacts it the least. When considering over 170 warm clouds observed at least 1 hr in which in‐cloud turbulence is retrieved, the effect of N CCN on RR remains most likely suppressive, but it is not significant at a 75% level for MLR and is highly uncertain for RF. The impact of in‐cloud turbulence depends on the moment and location it is sampled. Cloud base turbulence around the time of RR suppresses RR, while cloud top turbulence effects are inconclusive. Possible difficulties in isolating robust CCN and turbulence effects on RR are discussed.

54 ENVIRONMENTAL SCIENCES↗

CosTuuM: Polarized Thermal Dust Emission by Magnetically Oriented Spheroidal Grains

We present the new open-source C++-based Python library CosTuuM that can be used to generate infrared absorption and emission coefficients for arbitrary mixtures of spheroidal dust grains that are (partially) aligned with a magnetic field. We outline the algorithms underlying the software, demonstrate the accuracy of our results using benchmarks from literature, and use our tool to investigate some commonly used approximative recipes. We find that the linear polarization fraction for a partially aligned dust grain mixture can be accurately represented by an appropriate linear combination of perfectly aligned grains and grains that are randomly oriented, but that the commonly used picket fence alignment breaks down for short wavelengths. We also find that for a fixed dust grain size, the absorption coefficients and linear polarization fraction for a realistic mixture of grains with various shapes cannot both be accurately represented by a single representative grain with a fixed shape, but that instead an average over an appropriate shape distribution should be used. Insufficient knowledge of an appropriate shape distribution is the main obstacle in obtaining accurate optical properties. CosTuuM is available as a standalone Python library and can be used to generate optical properties to be used in radiative transfer applications.

79 ASTRONOMY AND ASTROPHYSICS↗

Theory of Periodic-Binary-Sequence Generators

Algorithms yield feedback shift registers with maximum regularity. Report provides extensive mathematical treatment of new and previous results related to generation of pseudo-noise binary sequences by feedback shift registers. Generator architectures amenable to efficient implementation in very-large-scale integrated (VLSI) circuits. Report includes literature references to applications of such sequences in random-number generation, radar, VLSI testing, data encryption and decryption, algebraic error-detection and error-correction encoding and decoding, and feedback-shift-register synthesis of sequential machines.

Perlman, M.↗

Shortcomings with Tree-Structured Edge Encodings for Neural Networks

In evolutionary algorithms a common method for encoding neural networks is to use a tree structured assembly procedure for constructing them. Since node operators have difficulties in specifying edge weights and these operators are execution-order dependent, an alternative is to use edge operators. Here we identify three problems with edge operators: in the initialization phase most randomly created genotypes produce an incorrect number of inputs and outputs; variation operators can easily change the number of input/output (I/O) units; and units have a connectivity bias based on their order of creation. Instead of creating I/O nodes as part of the construction process we propose using parameterized operators to connect to preexisting I/O units. Results from experiments show that these parameterized operators greatly improve the probability of creating and maintaining networks with the correct number of I/O units, remove the connectivity bias with I/O units and produce better controllers for a goal-scoring task.

Hornby, Gregory S.↗

ALPS: The Age-Layered Population Structure for Reducing the Problem of Premature Convergence

To reduce the problem of premature convergence we define a new attribute of an individual, its age, and propose the Age-Layered Population Structure (ALPS), in which age is used to restrict competition and breeding between members of the population. ALPS differs from a typical EA by segregating individuals into different age-layers by their age - a measure of how long the genetic material has been in the population - and by regularly replacing all individuals in the bottom layer with randomly generated ones. The introduction of new, randomly generated individuals at regular intervals results in an EA that is never completely converged and is always looking at new parts of the fitness landscape. By using age to restrict competition and breeding search is able to develop promising young individuals without them being dominated by older ones. We demonstrate the effectiveness of the ALPS algorithm on an antenna design problem in which evolution with ALPS produces antennas more than twice as good as does evolution with two other types of EAs. Further analysis shows that the ALPS model does allow the offspring of newly generated individuals to move the population out of mediocre local-optima to better parts of the fitness landscape.

Hornby, Gregory S.↗

MODIS Aerosol Optical Depth Bias Adjustment Using Machine Learning Algorithms

To monitor the earth atmosphere and its surface changes, satellite based instruments collect continuous data. While some of the data is directly used, some others such as aerosol properties are indirectly retrieved from the observation data. While retrieved variables (RV) form very powerful products, they don't come without obstacles. Different satellite viewing geometries, calibration issues, dynamically changing atmospheric and earth surface conditions, together with complex interactions between observed entities and their environment affect them greatly. This results in random and systematic errors in the final products.

Albayrak, Arif↗

Six Machine-Learning Methods for Predicting Hospital-Stay Duration for Patients with Sepsis: A Comparative Study

Sepsis is a life-threatening medical condition that, if not treated promptly, can result in tissue damage, organ failure, and death. According to the Centers for Disease Control, about 270,000 individuals die of sepsis in the US each year. Further, sepsis expenditures accounted for 13% of total US hospital costs in 2013, totaling more than $24 billion. Our project objectives were to determine if Machine Learning algorithms could reliably predict hospital stay duration for patients with sepsis. The data set we used has been de-identified and is freely available through the BupaR package. The data includes 1050 cases, 15214 events, and 16 types of actions related to sepsis patient care. First, we used process mining to determine how long each patient was in the hospital. Using BupaR’s functions, we created several process model graphs. These process models depict the movement of patients at a hospital and provide duration data for each patent case. Second, we identified outlier data and created two dataset versions: one with and one without outliers. We then applied the following analysis methods: Linear Regression, Random Forest, K-Nearest Neighbors, Neural Networks, XGBoost, and lightGBM. We compared the model validations for the six machine learning models using the same data-splitting method. We found that the XGBoost model had the best prediction accuracy of 73.9 percent for cases with outliers, and 79 percent for cases without outliers. We also found that the lightGBM model had the lowest mean absolute error between prediction and actual duration in days with 3.66 days for the case with outliers, and 2.4 days for the case without outliers. These two models outperformed the other four models. This work will be enhanced in the future by exploring new prediction algorithms and comparing them with the results of this study.

Chen, Lingtao↗