SEARCH · Search NASA
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.
Random decrement signatures have been introduced for use in the determination of the frequencies of oscillation, damping ratios and modes of vibration of structural systems from naturally induced vibration data. This paper gives an analysis of the random decrement method and the conditions which must be satisfied in order for the method to yield consistent estimates.
The random element method is a generalization of the random vortex method that was developed for the numerical modeling of momentum transport processes as expressed in terms of the Navier-Stokes equations. The method is based on the concept that random walk, as exemplified by Brownian motion, is the stochastic manifestation of diffusional processes. The algorithm based on this method is grid-free and does not require the diffusion equation to be discritized over a mesh, it is thus devoid of numerical diffusion associated with finite difference methods. Moreover, the algorithm is self-adaptive in space and explicit in time, resulting in an improved numerical resolution of gradients as well as a simple and efficient computational procedure. The method is applied here to an assortment of problems of diffusion of momentum and energy in one-dimension as well as heat conduction in two-dimensions in order to assess its validity and accuracy. The numerical solutions obtained are found to be in good agreement with exact solution except for a statistical error introduced by using a finite number of elements, the error can be reduced by increasing the number of elements or by using ensemble averaging over a number of solutions.
The random vortex method (RVM) of Chorin was developed by the recirculating flows. The RVM method models turbulence from first principles, tracking the vorticity and obtaining the interaction of vorticity with the bulk flow field. A computer program was produced called MIMOC, Modeling the Interface Motion of Combustion, which can be used to calculate the reacting flow field behind a rearward facing step. Several comparisons between experimental data and calculations were made. The RVM methood computes qualitatively good results, but the quantitative agreement as yet is not completely satisfactory. Much of the difficulty may be caused by the treatment of boundary conditions and the techniques used for obtaining statistical averages of velocities and turbulence quantities. For the rearward facing step the computed reattachment length equals the experimental value. However, the reverse velocity in the recirculation zone is over predicted by 300 percent. In the calculations, a uniform entrance velocity was assumed with no boundary layer at the step lip. This high velocity may be overdriving the reverse flow region.
A local Random Walk Method (RWM) for potential problems governed by Lapalace's and Paragon's equations is developed for two- and three-dimensional problems. The RWM is implemented and demonstrated in a multiprocessor parallel environment on a Beowulf cluster of computers. A speed gain of 16 is achieved as the number of processors is increased from 1 to 23.
Hierachy methods for random vibrations of elastic strings and beams, discussing stochastic eigenvalue problems
We review ray-optical methods of analyzing short-wavelength propagation in random media. The advantages and limitations of ray methods are discussed, and results of the statistical theory of ray segment fluctuations pertinent to ray tracing are summarized. The standard method of Monte Carlo ray tracing is compared to a new method which takes into account recent results on the statistics of ray segment fluctuations.
Glimm's (1965) random choice method has been successfully applied to compute steady two-dimensional supersonic/hypersonic flow using a new Lagrangian formulation. The method is easy to program, fast to execute, yet it is very accurate and robust. It requires no grid generation, resolves slipline and shock discontinuities crisply, can handle boundary conditions most easily, and is applicable to hypersonic as well as supersonic flow. It represents an accurate and fast alternative to the existing Eulerian methods. Many computed examples are given.
A numerical, grid-free algorithm is presented for one-dimensional reaction-diffusion model of laminar flame propagation in premixed gases. It is based on the random element method we developed for the analysis of diffusional processes. The effect of combustion is taken into account by applying the principle of fractional steps to separate the process of diffusion, modeled by the random walk of computational elements, from the exothermic effects of chemical reaction, monitoring their strength. The validity of the algorithm is demonstrated by application to flame propagation problems for which exact solutions exist. The flame speed evaluated by its use oscillates around the exact value at a relatively small amplitude, while the temperature and species concentration profiles are self-correcting in their convergence to the exact solution. A satisfactory resolution is obtained by the use of quite a small number of computational elements which automatically adjust their distribution of fit sharp gradients.
The feasibility of using a two-microphone, random-excitation technique for the measurement of acoustic impedance was studied. Equations were developed, including the effect of mean flow, which show that acoustic impedance is related to the pressure ratio and phase difference between two points in a duct carrying plane waves only. The impedances of a honeycomb ceramic specimen and a Helmholtz resonator were measured and compared with impedances obtained using the conventional standing-wave method. Agreement between the two methods was generally good. A sensitivity analysis was performed to pinpoint possible error sources and recommendations were made for future study. The two-microphone approach evaluated in this study appears to have some advantages over other impedance measuring techniques.
The simulation of the diffusion of a continuum field by the random walk (RW) displacement of a set of particles is considered. Elements of the gradients of the diffusive concentration are transported by computational particles. It is demonstrated that, by the use of concentration gradients in the RW process, statistical errors are reduced and each realization of the numerical solution is a representation of the exact solution. The algorithm is grid-free, and the computational elements move to follow the gradients; hence, the algorithm is self-adaptive, and uniform resolution is achieved for all times.
An analysis is made of steady-state and non-steady-state methods for the measurement of panel damping. Particular emphasis is placed on the use of random process techniques in conjunction with digital data reduction methods. The steady-state methods considered use the response power spectral density, response autocorrelation, excitation-response crosspower spectral density, or single-sided Fourier transform (SSFT) of the response autocorrelation function. Non-steady-state methods are associated mainly with the use of rapid frequency sweep excitation. Problems associated with the practical application of each method are evaluated with specific reference to the case of a panel exposed to a turbulent airflow, and two methods, the power spectral density and the single-sided Fourier transform methods, are selected as being the most suitable. These two methods are demonstrated experimentally, and it is shown that the power spectral density method is satisfactory under most conditions, provided that appropriate corrections are applied to account for filter bandwidth and background noise errors. Thus, the response power spectral density method is recommended for the measurement of the damping of panels exposed to a moving airflow.
Identification scheme for scalar input and scalar output linear systems for wide class of random inputs
Convergence of identification scheme for scalar- input-scalar-output linear systems with random inputs, applying invariant set theorem for random systems
Explore the source record for details and available documents.
Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that that schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solution and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.
Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.
The random-breakage mapping method [Game et al. (1990) Nucleic Acids Res., 18, 4453-4461] was applied to DNA sequences in human fibroblasts. The methodology involves NotI restriction endonuclease digestion of DNA from irradiated calls, followed by pulsed-field gel electrophoresis, Southern blotting and hybridization with DNA probes recognizing the single copy sequences of interest. The Southern blots show a band for the unbroken restriction fragments and a smear below this band due to radiation induced random breaks. This smear pattern contains two discontinuities in intensity at positions that correspond to the distance of the hybridization site to each end of the restriction fragment. By analyzing the positions of those discontinuities we confirmed the previously mapped position of the probe DXS1327 within a NotI fragment on the X chromosome, thus demonstrating the validity of the technique. We were also able to position the probes D21S1 and D21S15 with respect to the ends of their corresponding NotI fragments on chromosome 21. A third chromosome 21 probe, D21S11, has previously been reported to be close to D21S1, although an uncertainty about a second possible location existed. Since both probes D21S1 and D21S11 hybridized to a single NotI fragment and yielded a similar smear pattern, this uncertainty is removed by the random-breakage mapping method.
Net-centric networking environments are often faced with limited resources and must utilize bandwidth as efficiently as possible. In networking environments that span wide areas, the data transmission has to be efficient without any redundant or exuberant metadata. The Autonomous Byte Stream Randomizer software provides an extra level of security on top of existing data encryption methods. Randomizing the data s byte stream adds an extra layer to existing data protection methods, thus making it harder for an attacker to decrypt protected data. Based on a generated crypto-graphically secure random seed, a random sequence of numbers is used to intelligently and efficiently swap the organization of bytes in data using the unbiased and memory-efficient in-place Fisher-Yates shuffle method. Swapping bytes and reorganizing the crucial structure of the byte data renders the data file unreadable and leaves the data in a deconstructed state. This deconstruction adds an extra level of security requiring the byte stream to be reconstructed with the random seed in order to be readable. Once the data byte stream has been randomized, the software enables the data to be distributed to N nodes in an environment. Each piece of the data in randomized and distributed form is a separate entity unreadable on its own right, but when combined with all N pieces, is able to be reconstructed back to one. Reconstruction requires possession of the key used for randomizing the bytes, leading to the generation of the same cryptographically secure random sequence of numbers used to randomize the data. This software is a cornerstone capability possessing the ability to generate the same cryptographically secure sequence on different machines and time intervals, thus allowing this software to be used more heavily in net-centric environments where data transfer bandwidth is limited.