Search NASA⌕ Search

SEARCH · Search NASA

Results for “RANDOM NUMBER”

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 217 records · Page 12

Models of the Protocellular Structures, Functions and Evolution

In the absence of extinct or extant record of protocells, the most direct way to test our understanding of the origin of cellular life is to construct laboratory models that capture important features of protocellular systems. Such efforts are currently underway in a collaborative project between NASA-Ames, Harvard medical School and University of California. They are accompanied by computational studies aimed at explaining self-organization of simple molecules into ordered structures. The centerpiece of this project is a method for the in vitro evolution of protein enzymes toward arbitrary catalytic targets. A similar approach has already been developed for nucleic acids: First, a very large population of candidate molecules is generated using a random synthetic approach. Next, the small numbers of molecules that can accomplish the desired task are selected. These molecules are next vastly multiplied using the polymerase chain reaction. A mutagenic approach, in which the sequences of selected molecules are randomly altered, can yield further improvements in performance or alterations of specificities. Unfortunately, the catalytic potential of nucleic acids is rather limited. Proteins are more catalytically capable but cannot be directly amplified. In the new technique, this problem is circumvented by covalently linking each protein of the initial, diverse, pool to the RNA sequence that codes for it. Then, selection is performed on the proteins, but the nucleic acids are replicated. To date, we have obtained "a proof of concept" by evolving simple, novel proteins capable of selectively binding adenosine tri-phosphate (ATP). Our next goal is to create an enzyme that can phosphorylate amino acids and another to catalyze the formation of peptide bonds in the absence of nucleic acid templates. This latter reaction does not take place in contemporary cells. once developed, these enzymes will be encapsulated in liposomes so that they will function in a simulated cellular environment. To provide a continuous energy supply, usually needed to activate the substrates, an energy transduction complex which generates ATP from adenosine diphosphate, inorganic phosphate and light will be used. This system, consisting of two modern proteins, ATP synthase and bacteriorhodopsin, has already been built and shown to work efficiently. By coupling chemical synthesis to such a system, it will be possible to drive chemical reactions by light if only the substrates for these reactions are supplied.

Pohorille, Andrew↗

Extended JT supergravity and random matrix models: The power of the string equation

A number of supersymmetric Jackiw-Teitelboim (JT) gravity theories are known to be described (in the Euclidean path integral formulation) by double-scaled random matrix models. Such matrix models can be characterized using a certain “string equation”. It was shown recently that in extended supergravity, when the number of BPS states scales as e$^{S_0}$, where $S_0$ is the extremal entropy, a special ansatz for the leading order solution of the string equation yields the supergravity spectrum. Somewhat miraculously, the construction showed that the functional form of the non-BPS (continuum) sector predicts the precise form of the BPS sector, showing the robustness of the supergravity/matrix-model correspondence. In this paper, we refine the analysis and show that the string equation, combined with some simple requirements on solutions, are powerful tools for constraining the spectrum of extended JT supergravity theories. We re-explore the cases of $\mathcal{N} = 2$ and (small) $\mathcal{N} = 4$ JT supergravity, and then explore the new cases of spectra from $\mathcal{N} = 3$ and $\mathcal{N} = 4$ large JT supergravity (recently derived by Heydeman, Shi, and Turiaci) showing that our approach also works naturally for (nearly) all the models. Based on this success, we conjecture that these new supergravity models also have matrix model descriptions.

Extended Supersymmetry↗

Coherent large-scale structures in high Reynolds number supersonic jet of Mach number 1.4

Large-scale coherent structures are found to exist in fully expanded shock free supersonic jets with Reynolds number 1.6 million and Mach number 1.4. The jet was excited by a weak upstream tone to extract the large-scale structures from the random turbulence. The most preferential excitation Strouhal number is found to be in the vicinity of 0.4, and the dependence of the large-scale structure phase velocity on the excitation Strouhal number shows a similar trend to that found for subsonic acoustically excited jets.

Lepicovsky, J.↗

Predicting protein functions from redundancies in large-scale protein interaction networks

Interpreting data from large-scale protein interaction experiments has been a challenging task because of the widespread presence of random false positives. Here, we present a network-based statistical algorithm that overcomes this difficulty and allows us to derive functions of unannotated proteins from large-scale interaction data. Our algorithm uses the insight that if two proteins share significantly larger number of common interaction partners than random, they have close functional associations. Analysis of publicly available data from Saccharomyces cerevisiae reveals >2,800 reliable functional associations, 29% of which involve at least one unannotated protein. By further analyzing these associations, we derive tentative functions for 81 unannotated proteins with high certainty. Our method is not overly sensitive to the false positives present in the data. Even after adding 50% randomly generated interactions to the measured data set, we are able to recover almost all (approximately 89%) of the original associations.

Proteins/chemistry/metabolism↗

On the normality and accuracy of simulated random processes.

Efficient methods of simulating stationary and nonstationary random processes and envelopes, by using a series of sine or cosine functions or by using the fast Fourier transform, have been proposed previously. Without applying the central limit theorem, it is shown in this paper that the simulated random processes are asymptotically Gaussian processes as the number of terms, N, of sine or cosine functions approaches infinity. The accuracy of the first-order probability densities of the simulated random processes is investigated by using the fast Fourier transform. Numerical results are computed with respect to the variation of the number of terms, N, of sine or cosine functions used for simulation. It is shown that within the practical range of N, such as 500, the accuracy is remarkably satisfactory even outside the region of 3 standard deviations.

Yang, J.-N.↗

Prevention of hypercalciuria and stone-forming propensity during prolonged bedrest by alendronate

The bone loss and hypercalciuria induced by immobilization or the decreased gravitational forces of space are well described. Using a model of bedrest immobilization, the ability of a potent aminobisphosphonate, alendronate, to avert hypercalciuria and stone-forming propensity was tested. Sixteen male subjects participated in a randomized, placebo-controlled trial in which they received either 20 mg of alendronate or placebo 2 weeks prior to and during 3 weeks of strict bedrest. Parameters of bone and calcium metabolism and urinary crystallization of stone-forming salts were measured before and at the end of bedrest. In the placebo group, bedrest increased urinary calcium (209 +/- 47 to 267 +/- 60 mg/day, p < 0.01) and the saturation of calcium phosphate. Before bedrest, the alendronate group had a significantly lower serum calcium (8.8 +/- 0.4 vs. 9.6 +/- 0.5 mg/dl, p < 0.01) and higher serum PTH (62.4 +/- 33.1 vs. 23.1 +/- 7.5 pg/ml, p < 0.01) compared with the placebo group. Moreover, the alendronate group had a lower urinary calcium (75 +/- 41 mg/day) and saturation of calcium oxalate and calcium phosphate. These effects of alendronate were sustained during bedrest. Following bedrest in the alendronate group, urinary calcium rose to 121 +/- 50 mg/day, a value less than that in the placebo group before or during bedrest. Similarly, urinary saturation of calcium oxalate and calcium phosphate rose with bedrest in the alendronate-treated patients but remained lower than values obtained in placebo-treated patients before or during bedrest. Alendronate inhibits bone mineral loss and averts the hypercalciuria and increased propensity for the crystallization of stone-forming calcium salts which occurs during 3 weeks of strict bedrest.

Non-NASA Center↗

FuseIM: Fusing Probabilistic Traversals for Influence Maximization on Exascale Systems

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer (32,768 GPUs and 196K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34x (for gIM) and ~360x (for Ripples).

Neff, Reece W.↗

Designing an Optimal Sensor Network via Minimizing Information Loss

Optimal experimental design is a classic topic in statistics, with many well-studied problems, applications, and solutions. The design problem we study is the placement of sensors to monitor spatiotemporal processes, explicitly accounting for the temporal dimension in our modeling and optimization. We observe that recent advancements in computational sciences often yield large datasets based on physics-based simulations, which are rarely leveraged in experimental design. We introduce a novel model-based sensor placement criterion, along with a highly-efficient optimization algorithm, which integrates physics-based simulations and Bayesian experimental design principles to identify sensor networks that “minimize information loss” from simulated data. Our technique relies on sparse variational inference and (separable) Gauss-Markov priors, and thus may adapt many techniques from Bayesian experimental design. We validate our method through a case study monitoring air temperature in Phoenix, Arizona, using state-of-the-art physics-based simulations. Our results show our framework to be superior to random or quasi-random sampling, particularly with a limited number of sensors. We conclude by discussing practical considerations and implications of our framework, including more complex modeling tools and real-world deployments.

54 ENVIRONMENTAL SCIENCES↗

Local theorems for nonidentically distributed lattice random variables.

Derivation of local limit theorems for a sequence X sub n of independent integral-valued lattice random variables involving only a finite number of distinct nondegenerate distributions. Given appropriate sequences A sub n and B sub n of constants such that 1/B sub n (X sub 1 +

Mason, J. D.↗

Characterization of concurrent processing

Computer architectures designed for concurrent processing are characterized by the number of processing elements, ensemble speed, random access memory, input/output routes, and modes of operation. The important attributes of processing tasks are then identified, and some processing stratagems are examined. It is shown that the greater the complexity of a given task, the wider the range of possible stratagems which can accomplish the task. For relatively simple tasks, the optimum stratagem can be found by analytical reasoning. For more complex tasks, however, optimum scheduling techniques may have to be employed for the assignment of segments of the task to the available processing elements.

Utku, S.↗

Gravitational lensing by an ensemble of isothermal galaxies

Calculation of 28,000 models of gravitational lensing of a distant quasar by an ensemble of randomly placed galaxies, each having a singular isothermal mass distribuiton, is reported. The average surface mass density was 0.2 of the critical value in all models. It is found that the surface mass density averaged over the area of the smallest circle that encompasses the multiple images is 0.82, only slightly smaller than expected from a simple analytical model of Turner et al. (1984). The probability of getting multiple images is also as large as expected analytically. Gravitational lensing is dominated by the matter in the beam; i.e., by the beam convergence. The cases where the multiple imaging is due to asymmetry in mass distribution (i.e., due to shear) are very rare. Therefore, the observed gravitational-lens candidates for which no lensing object has been detected between the images cannot be a result of asymmetric mass distribution outside the images, at least in a model with randomly distributed galaxies. A surprisingly large number of large separations between the multiple images is found: up to 25 percent of multiple images have their angular separation 2 to 4 times larger than expected in a simple analytical model.

Katz, Neal↗

Evidence for turbulence in H II regions

The results of extensive velocity mapping across the face of Galactic H II regions are used to make an accurate determination of velocity dispersions and structure functions for a number of nebulae. A dependence of random velocities upon scale, indicating the presence of turbulence, is found. These relationships are compared with the predictions of models for Kolmogorov turbulence in H II regions, and poor agreement is found. A more general formulation shows that there is no single power law for the velocity-distance relation that fits the observations. From the variations in the shape of the observed structure function, it is concluded that the turbulent energy enters the nebulae at several different scales. It is also found that velocity broadening of the observed lines is significantly greater than would be inferred from the velocity scatter across the face of the nebulae.

O'Dell, C. R.↗

Comparison of Commercial Electromagnetic Interface Test Techniques to NASA Electromagnetic Interference Test Techniques

This report documents the development of analytical techniques required for interpreting and comparing space systems electromagnetic interference test data with commercial electromagnetic interference test data using NASA Specification SSP 30237A "Space Systems Electromagnetic Emission and Susceptibility Requirements for Electromagnetic Compatibility." The PSpice computer simulation results and the laboratory measurements for the test setups under study compare well. The study results, however, indicate that the transfer function required to translate test results of one setup to another is highly dependent on cables and their actual layout in the test setup. Since cables are equipment specific and are not specified in the test standards, developing a transfer function that would cover all cable types (random, twisted, or coaxial), sizes (gauge number and length), and layouts (distance from the ground plane) is not practical.

Smith, V.↗

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.↗

Cryogenic Quenching Process for Electronic Part Screening

The use of electronic parts at cryogenic temperatures (less than 100 C) for extreme environments is not well controlled or developed from a product quality and reliability point of view. This is in contrast to the very rigorous and well-documented procedures to qualify electronic parts for mission use in the 55 to 125 C temperature range. A similarly rigorous methodology for screening and evaluating electronic parts needs to be developed so that mission planners can expect the same level of high reliability performance for parts operated at cryogenic temperatures. A formal methodology for screening and qualifying electronic parts at cryogenic temperatures has been proposed. The methodology focuses on the base physics of failure of the devices at cryogenic temperatures. All electronic part reliability is based on the bathtub curve, high amounts of initial failures (infant mortals), a long period of normal use (random failures), and then an increasing number of failures (end of life). Unique to this is the development of custom screening procedures to eliminate early failures at cold temperatures. The ability to screen out defects will specifically impact reliability at cold temperatures. Cryogenic reliability is limited by electron trap creation in the oxide and defect sites at conductor interfaces. Non-uniform conduction processes due to process marginalities will be magnified at cryogenic temperatures. Carrier mobilities change by orders of magnitude at cryogenic temperatures, significantly enhancing the effects of electric field. Marginal contacts, impurities in oxides, and defects in conductor/conductor interfaces can all be magnified at low temperatures. The novelty is the use of an ultra-low temperature, short-duration quenching process for defect screening. The quenching process is designed to identify those defects that will precisely (and negatively) affect long-term, cryogenic part operation. This quenching process occurs at a temperature that is at least 25 C colder than the coldest expected operating temperature. This quenching process is the opposite of the standard burn-in procedure. Normal burn-in raises the temperature (and voltage) to activate quickly any possible manufacturing defects remaining in the device that were not already rejected at a functional test step. The proposed inverse burn-in or quenching process is custom-tailored to the electronic device being used. The doping profiles, materials, minimum dimensions, interfaces, and thermal expansion coefficients are all taken into account in determining the ramp rate, dwell time, and temperature.

Sheldon, Douglas J.↗

Improved Subseasonal Forecasting of Extreme Polar Vortices Using Machine Learning

Our research was focused on forecasting the position and shape of the winter stratospheric polar vortex at a subseasonal timescale of 15 days in advance. To achieve this, we employed both statistical and neural network machine learning techniques. The analysis was performed on 42 winter seasons of reanalysis data provided by NASA giving us a total of 6,342 days of data. The state of the polar vortex for determined by using geometric moments to calculate the centroid latitude and the aspect ratio of an ellipse fit onto the vortex. Timeseries for thirty additional precursors were calculated to help improve the predictive capabilities of the algorithm. Feature importance of these precursors was performed using random forest to measure the predictive importance and the ideal number of precursors. Then, using the precursors identified as important, various statistical methods were tested for predictive accuracy with random forest and nearest neighbor performing the best. An echo state network, a type of recurrent neural network that features sparsely connected hidden layer and a reduced number of trainable parameters that allows for rapid training and testing, was also implemented for the forecasting problem. Hyperparameter tuning was performed for each methods using a subset of the training data. The algorithms were trained and tuned on the first 41 years of data, then tested for accuracy on the final year. In general, the centroid latitude of the polar vortex proved easier to predict than the aspect ratio across all algorithms. Random forest outperformed other statistical forecasting algorithms overall but struggled to predict extreme values. Forecasting from echo state network suggested a strong predictive capability past 15 days, but further work is required to fully realize the potential of recurrent neural network approaches.

54 ENVIRONMENTAL SCIENCES↗