Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random number generators”

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 91 records · Page 5
All sourcesNASA NTRSDOE OSTI
NASA NTRSDate not supplied

An Impedance-Based Complexity Metric for Unmanned Aircraft System Traffic Scenario Classification

This paper introduces an impedance-based metric to capture the complexity of a given unmanned aircraft system traffic scenario. The metric accounts for both the number of aircraft and the traffic flow pattern. The work presented here extends an earlier approach that introduced another scenario complexity metric based on the number of potential conflicts weighted by the conflict resolution cost associated. Complexity measurements for randomly-generated scenarios were produced through high-fidelity fast-time simulations and treated as baseline. Then the impedance based metric was evaluated, for the same scenarios, without the need for an actual flight simulation and a conflict resolution method. The results show that the impedance-based metric has a strong correlation to the baseline data and performs marginally better than the weighted conflict-based complexity metric introduced in the earlier work. The metric computation generates impedance maps which are useful for identifying high complexity regions in a scenario, where flight plan changes might be necessitated. This metric can therefore be used, in conjunction with other complexity metrics, to inform adequate traffic management strategies and classify a traffic scenario as acceptable, unacceptable or acceptable with changes made to flight plans that pass through the high complexity regions. The metric can also be used as a guidance metric for strategic conflict management methods.

Complexity↗
NASA NTRS1990

Models for the hotspot distribution

Published hotspot catalogs all show a hemispheric concentration beyond what can be expected by chance. Cumulative distributions about the center of concentration are described by a power law with a fractal dimension closer to 1 than 2. Random sets of the corresponding sizes do not show this effect. A simple shift of the random sets away from a point would produce distributions similar to those of hotspot sets. The possible relation of the hotspots to the locations of ridges and subduction zones is tested using large sets of randomly-generated points to estimate areas within given distances of the plate boundaries. The probability of finding the observed number of hotspots within 10 deg of the ridges is about what is expected.

Jurdy, Donna M.↗
NASA NTRS1975

Seminar on Understanding Digital Control and Analysis in Vibration Test Systems, part 2

A number of techniques for dealing with important technical aspects of the random vibration control problem are described. These include the generation of pseudo-random and true random noise, the control spectrum estimation problem, the accuracy/speed tradeoff, and control correction strategies. System hardware, the operator-system interface, safety features, and operational capabilities of sophisticated digital random vibration control systems are also discussed.

Source record↗
NASA NTRS1982

Statistics of Delta v magnitude for a trajectory correction maneuver containing deterministic and random components

A number of interplanetary missions now being planned involve placing deterministic maneuvers along the flight path to alter the trajectory. Lee and Boain (1973) examined the statistics of trajectory correction maneuver (TCM) magnitude with no deterministic ('bias') component. The Delta v vector magnitude statistics were generated for several values of random Delta v standard deviations using expansions in terms of infinite hypergeometric series. The present investigation uses a different technique (Monte Carlo simulation) to generate Delta v magnitude statistics for a wider selection of random Delta v standard deviations and also extends the analysis to the case of nonzero deterministic Delta v's. These Delta v magnitude statistics are plotted parametrically. The plots are useful in assisting the analyst in quickly answering questions about the statistics of Delta v magnitude for single TCM's consisting of both a deterministic and a random component. The plots provide quick insight into the nature of the Delta v magnitude distribution for the TCM.

Bollman, W. E.↗
NASA NTRS1997

When Gravity Fails: Local Search Topology

Local search algorithms for combinatorial search problems frequently encounter a sequence of states in which it is impossible to improve the value of the objective function; moves through these regions, called {\em plateau moves), dominate the time spent in local search. We analyze and characterize {\em plateaus) for three different classes of randomly generated Boolean Satisfiability problems. We identify several interesting features of plateaus that impact the performance of local search algorithms. We show that local minima tend to be small but occasionally may be very large. We also show that local minima can be escaped without unsatisfying a large number of clauses, but that systematically searching for an escape route may be computationally expensive if the local minimum is large. We show that plateaus with exits, called benches, tend to be much larger than minima, and that some benches have very few exit states which local search can use to escape. We show that the solutions (i.e. global minima) of randomly generated problem instances form clusters, which behave similarly to local minima. We revisit several enhancements of local search algorithms and explain their performance in light of our results. Finally we discuss strategies for creating the next generation of local search algorithms.

Frank, Jeremy↗
NASA NTRS2010

Random vs. Combinatorial Methods for Discrete Event Simulation of a Grid Computer Network

This study compared random and t-way combinatorial inputs of a network simulator, to determine if these two approaches produce significantly different deadlock detection for varying network configurations. Modeling deadlock detection is important for analyzing configuration changes that could inadvertently degrade network operations, or to determine modifications that could be made by attackers to deliberately induce deadlock. Discrete event simulation of a network may be conducted using random generation, of inputs. In this study, we compare random with combinatorial generation of inputs. Combinatorial (or t-way) testing requires every combination of any t parameter values to be covered by at least one test. Combinatorial methods can be highly effective because empirical data suggest that nearly all failures involve the interaction of a small number of parameters (1 to 6). Thus, for example, if all deadlocks involve at most 5-way interactions between n parameters, then exhaustive testing of all n-way interactions adds no additional information that would not be obtained by testing all 5-way interactions. While the maximum degree of interaction between parameters involved in the deadlocks clearly cannot be known in advance, covering all t-way interactions may be more efficient than using random generation of inputs. In this study we tested this hypothesis for t = 2, 3, and 4 for deadlock detection in a network simulation. Achieving the same degree of coverage provided by 4-way tests would have required approximately 3.2 times as many random tests; thus combinatorial methods were more efficient for detecting deadlocks involving a higher degree of interactions. The paper reviews explanations for these results and implications for modeling and simulation.

Kuhn, D. Richard↗
NASA NTRS2001

Distribution functions of probabilistic automata

Each probabilistic automaton M over an alphabet A defines a probability measure Prob sub(M) on the set of all finite and infinite words over A. We can identify a k letter alphabet A with the set {0, 1,..., k-1}, and, hence, we can consider every finite or infinite word w over A as a radix k expansion of a real number X(w) in the interval [0, 1]. This makes X(w) a random variable and the distribution function of M is defined as usual: F(x) := Prob sub(M) { w: X(w) < x }. Utilizing the fixed-point semantics (denotational semantics), extended to probabilistic computations, we investigate the distribution functions of probabilistic automata in detail. Automata with continuous distribution functions are characterized. By a new, and much more easier method, it is shown that the distribution function F(x) is an analytic function if it is a polynomial. Finally, answering a question posed by D. Knuth and A. Yao, we show that a polynomial distribution function F(x) on [0, 1] can be generated by a prob abilistic automaton iff all the roots of F'(x) = 0 in this interval, if any, are rational numbers. For this, we define two dynamical systems on the set of polynomial distributions and study attracting fixed points of random composition of these two systems.

Denotational semantics↗
NASA NTRS1984

Tortuosity of lightning return stroke channels

Data obtained from photographs of lightning are presented on the tortuosity of return stroke channels. The data were obtained by making piecewise linear fits to the channels, and recording the cartesian coordinates of the ends of each linear segment. The mean change between ends of the segments was nearly zero in the horizontal direction and was about eight meters in the vertical direction. Histograms of these changes are presented. These data were used to create model lightning channels and to predict the electric fields radiated during return strokes. This was done using a computer generated random walk in which linear segments were placed end-to-end to form a piecewise linear representation of the channel. The computer selected random numbers for the ends of the segments assuming a normal distribution with the measured statistics. Once the channels were simulated, the electric fields radiated during a return stroke were predicted using a transmission line model on each segment. It was found that realistic channels are obtained with this procedure, but only if the model includes two scales of tortuosity: fine scale irregularities corresponding to the local channel tortuosity which are superimposed on large scale horizontal drifts. The two scales of tortuosity are also necessary to obtain agreement between the electric fields computed mathematically from the simulated channels and the electric fields radiated from real return strokes. Without large scale drifts, the computed electric fields do not have the undulations characteristics of the data.

Levine, D. M.↗
NASA NTRS2007

Incorporation of Half-Cycle Theory Into Ko Aging Theory for Aerostructural Flight-Life Predictions

The half-cycle crack growth theory was incorporated into the Ko closed-form aging theory to improve accuracy in the predictions of operational flight life of failure-critical aerostructural components. A new crack growth computer program was written for reading the maximum and minimum loads of each half-cycle from the random loading spectra for crack growth calculations and generation of in-flight crack growth curves. The unified theories were then applied to calculate the number of flights (operational life) permitted for B-52B pylon hooks and Pegasus adapter pylon hooks to carry the Hyper-X launching vehicle that air launches the X-43 Hyper-X research vehicle. A crack growth curve for each hook was generated for visual observation of the crack growth behavior during the entire air-launching or captive flight. It was found that taxiing and the takeoff run induced a major portion of the total crack growth per flight. The operational life theory presented can be applied to estimate the service life of any failure-critical structural components.

Ko, William L.↗
NASA NTRS1986

A Monte Carlo study of Weibull reliability analysis for space shuttle main engine components

The incorporation of a number of additional capabilities into an existing Weibull analysis computer program and the results of Monte Carlo computer simulation study to evaluate the usefulness of the Weibull methods using samples with a very small number of failures and extensive censoring are discussed. Since the censoring mechanism inherent in the Space Shuttle Main Engine (SSME) data is hard to analyze, it was decided to use a random censoring model, generating censoring times from a uniform probability distribution. Some of the statistical techniques and computer programs that are used in the SSME Weibull analysis are described. The methods documented in were supplemented by adding computer calculations of approximate (using iteractive methods) confidence intervals for several parameters of interest. These calculations are based on a likelihood ratio statistic which is asymptotically a chisquared statistic with one degree of freedom. The assumptions built into the computer simulations are described. The simulation program and the techniques used in it are described there also. Simulation results are tabulated for various combinations of Weibull shape parameters and the numbers of failures in the samples.

Abernethy, K.↗
NASA NTRS2002

Intermittent Flow Regimes in a Transonic Fan Airfoil Cascade

A study was conducted in the NASA Glenn Research Center linear cascade on the intermittent flow on the suction surface of an airfoil section from the tip region of a modern low aspect ratio fan blade. Experimental results revealed that, at a large incidence angle, a range of transonic inlet Mach numbers exist where the leading-edge shock-wave pattern was unstable. Flush mounted high frequency response pressure transducers indicated large local jumps in the pressure in the leading edge area, which generates large intermittent loading on the blade leading edge. These measurements suggest that for an inlet Mach number between 0.9 and 1.0 the flow is bi-stable, randomly switching between subsonic and supersonic flows. Hence, it appears that the change in overall flow conditions in the transonic region is based on the frequency of switching between two stable flow states rather than on the continuous increase of the flow velocity. To date, this flow behavior has only been observed in a linear transonic cascade. Further research is necessary to confirm this phenomenon occurs in actual transonic fans and is not the byproduct of an endwall restricted linear cascade.

Lepicovsky, J.↗
NASA NTRS2011

Prioritized LT Codes

The original Luby Transform (LT) coding scheme is extended to account for data transmissions where some information symbols in a message block are more important than others. Prioritized LT codes provide unequal error protection (UEP) of data on an erasure channel by modifying the original LT encoder. The prioritized algorithm improves high-priority data protection without penalizing low-priority data recovery. Moreover, low-latency decoding is also obtained for high-priority data due to fast encoding. Prioritized LT codes only require a slight change in the original encoding algorithm, and no changes at all at the decoder. Hence, with a small complexity increase in the LT encoder, an improved UEP and low-decoding latency performance for high-priority data can be achieved. LT encoding partitions a data stream into fixed-sized message blocks each with a constant number of information symbols. To generate a code symbol from the information symbols in a message, the Robust-Soliton probability distribution is first applied in order to determine the number of information symbols to be used to compute the code symbol. Then, the specific information symbols are chosen uniform randomly from the message block. Finally, the selected information symbols are XORed to form the code symbol. The Prioritized LT code construction includes an additional restriction that code symbols formed by a relatively small number of XORed information symbols select some of these information symbols from the pool of high-priority data. Once high-priority data are fully covered, encoding continues with the conventional LT approach where code symbols are generated by selecting information symbols from the entire message block including all different priorities. Therefore, if code symbols derived from high-priority data experience an unusual high number of erasures, Prioritized LT codes can still reliably recover both high- and low-priority data. This hybrid approach decides not only "how to encode" but also "what to encode" to achieve UEP. Another advantage of the priority encoding process is that the majority of high-priority data can be decoded sooner since only a small number of code symbols are required to reconstruct high-priority data. This approach increases the likelihood that high-priority data is decoded first over low-priority data. The Prioritized LT code scheme achieves an improvement in high-priority data decoding performance as well as overall information recovery without penalizing the decoding of low-priority data, assuming high-priority data is no more than half of a message block. The cost is in the additional complexity required in the encoder. If extra computation resource is available at the transmitter, image, voice, and video transmission quality in terrestrial and space communications can benefit from accurate use of redundancy in protecting data with varying priorities.

Woo, Simon S.↗
NASA NTRS1998

Simulation of Crack Propagation in Engine Rotating Components under Variable Amplitude Loading

The crack propagation life of tested specimens has been repeatedly shown to strongly depend on the loading history. Overloads and extended stress holds at temperature can either retard or accelerate the crack growth rate. Therefore, to accurately predict the crack propagation life of an actual component, it is essential to approximate the true loading history. In military rotorcraft engine applications, the loading profile (stress amplitudes, temperature, and number of excursions) can vary significantly depending on the type of mission flown. To accurately assess the durability of a fleet of engines, the crack propagation life distribution of a specific component should account for the variability in the missions performed (proportion of missions flown and sequence). In this report, analytical and experimental studies are described that calibrate/validate the crack propagation prediction capability ]or a disk alloy under variable amplitude loading. A crack closure based model was adopted to analytically predict the load interaction effects. Furthermore, a methodology has been developed to realistically simulate the actual mission mix loading on a fleet of engines over their lifetime. A sequence of missions is randomly selected and the number of repeats of each mission in the sequence is determined assuming a Poisson distributed random variable with a given mean occurrence rate. Multiple realizations of random mission histories are generated in this manner and are used to produce stress, temperature, and time points for fracture mechanics calculations. The result is a cumulative distribution of crack propagation lives for a given, life limiting, component location. This information can be used to determine a safe retirement life or inspection interval for the given location.

Bonacuse, P. J.↗
NASA NTRS1999

Simulation of Crack Propagation in Engine Rotating Components Under Variable Amplitude Loading

The crack propagation life of tested specimens has been repeatedly shown to strongly depend on the loading history. Overloads and extended stress holds at temperature can either retard or accelerate the crack growth rate. Therefore, to accurately predict the crack propagation life of an actual component, it is essential to approximate the true loading history. In military rotorcraft engine applications, the loading profile (stress amplitudes, temperature, and number of excursions) can vary significantly depending on the type of mission flown. To accurately assess the durability of a fleet of engines, the crack propagation life distribution of a specific component should account for the variability in the missions performed (proportion of missions flown and sequence). In this report, analytical and experimental studies are described that calibrate/validate the crack propagation prediction capability for a disk alloy under variable amplitude loading. A crack closure based model was adopted to analytically predict the load interaction effects. Furthermore, a methodology has been developed to realistically simulate the actual mission mix loading on a fleet of engines over their lifetime. A sequence of missions is randomly selected and the number of repeats of each mission in the sequence is determined assuming a Poisson distributed random variable with a given mean occurrence rate. Multiple realizations of random mission histories are generated in this manner and are used to produce stress, temperature, and time points for fracture mechanics calculations. The result is a cumulative distribution of crack propagation lives for a given, life limiting, component location. This information can be used to determine a safe retirement life or inspection interval for the given location.

P J Bonacuse↗
NASA NTRS1986

An analysis of ullage heat transfer in the orbital refueling system

The Orbital Refueling System was an experiment flown on Shuttle Mission STS 41-G in October, 1984. Liquid hydrazine fuel was transferred back and forth from one spherical bladder tank to another using pressurized nitrogen as the driving force. Compressive heating of the ullage gas in the receiving tank could lead to a hazardous situation if any hydrazine leaked through to the ullage side of the bladder and was heated above about 175 F, where it can undergo spontaneous exothermic decomposition. Early analysis of the flight data indicated that the ullage compression process was much closer to an isothermal than an adiabatic one. In this study, a thorough review of the pertinent literature was used to make an a priori best-estimate for the ullage gas heat transfer coefficient (defining the Nusselt Number as a function of Reynolds and Rayleigh Numbers). Experimental data from the flight were analyzed in detail. It is evident that there is considerably more heat transfer than can be accounted for by conduction alone, but the observed increases do not correlate well with Reynolds Number, Rayleigh Number or vehicle acceleration. There are large gaps in the present understanding of convective heat transfer in closed containers with internal heat generation, especially in the presence of vibrations or other random disturbances. A program of experiments to fill in these gaps is suggested, covering both ground and orbital environments.

Kauffman, D.↗
NASA NTRS1990

Direct numerical study of crossflow instability

Disturbances in the swept Hiemenz flow are calculated by solving the Navier-Stokes equations. The spatially-evolving base flow is treated exactly, allowing a check of the 'local' stability theories. Different types of disturbances such as random noise, waves, and wave packets, are input near the attachment line, develop in space, and exit through an outflow boundary. They all generate streamwise vortices. The effect of the Reynolds number, of the time-dependence of the noise, and of nonlinearity, are investigated.

Spalart, P. R.↗
NASA NTRS2016

Spin Glass Patch Planting

In this paper, we propose a patch planting method for creating arbitrarily large spin glass instances with known ground states. The scaling of the computational complexity of these instances with various block numbers and sizes is investigated and compared with random instances using population annealing Monte Carlo and the quantum annealing DW2X machine. The method can be useful for benchmarking tests for future generation quantum annealing machines, classical and quantum mechanical optimization algorithms.

Quantum Annealing↗