Search NASA⌕ Search

SEARCH · Search NASA

Results for “common random numbers”

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 19 records

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers

We present Q-SASS, a quasi-Newton method for unconstrained stochastic optimization that does not rely on common random numbers. Most existing quasi-Newton approaches leverage common random numbers to construct second-order updates. However, motivated by challenges in variational quantum algorithms—where such coordination is not possible—we consider the setting in which function values and gradients are accessible only through noisy probabilistic zeroth- and first-order oracles, and no common random numbers can be exploited. We derive high-probability tail bounds on the iteration complexity of our algorithm for nonconvex, convex, and strongly convex (more generally, those satisfying the PL condition) objective functions. Finally, we demonstrate the empirical benefits of our quasi-Newton updating scheme on both synthetic and quantum chemistry problems.

Complexity bound↗

Derivative-free stochastic optimization via adaptive sampling strategies

In this paper, we present a novel derivative-free framework for solving unconstrained stochastic optimization problems. Many problems in fields ranging from simulation optimization to reinforcement learning to quantum computing involve settings where only stochastic function values are obtained via a zeroth-order oracle, which has no available gradient information and necessitates the usage of derivative-free optimization methodologies. Our approach includes estimating gradients using stochastic function evaluations and integrating adaptive sampling techniques to control the accuracy in these stochastic approximations. Our framework encapsulates several gradient estimation techniques, including standard finite-difference, Gaussian smoothing, sphere smoothing, randomized coordinate finite-difference, and randomized subspace finite-difference methods. We provide theoretical convergence guarantees for our framework and analyze the worst-case iteration and sample complexities associated with each gradient estimation method. Finally, we demonstrate the empirical performance of the methods on logistic regression and nonlinear least squares problems.

Adaptive sampling↗

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↗

An experimental distributed microprocessor implementation with a shared memory communications and control medium

The distributed processing concept is defined in terms of control primitives, variables, and structures and their use in performing a decomposed discrete Fourier transform (DET) application function. The design assumes interprocessor communications to be anonymous. In this scheme, all processors can access an entire common database by employing control primitives. Access to selected areas within the common database is random, enforced by a hardware lock, and determined by task and subtask pointers. This enables the number of processors to be varied in the configuration without any modifications to the control structure. Decompositional elements of the DFT application function in terms of tasks and subtasks are also described. The experimental hardware configuration consists of IMSAI 8080 chassis which are independent, 8 bit microcomputer units. These chassis are linked together to form a multiple processing system by means of a shared memory facility. This facility consists of hardware which provides a bus structure to enable up to six microcomputers to be interconnected. It provides polling and arbitration logic so that only one processor has access to shared memory at any one time.

Mejzak, R. S.↗

Redshift data and statistical inference

Frequency histograms and the 'power spectrum analysis' (PSA) method, the latter developed by Yu & Peebles (1969), have been widely employed as techniques for establishing the existence of periodicities. We provide a formal analysis of these two classes of methods, including controlled numerical experiments, to better understand their proper use and application. In particular, we note that typical published applications of frequency histograms commonly employ far greater numbers of class intervals or bins than is advisable by statistical theory sometimes giving rise to the appearance of spurious patterns. The PSA method generates a sequence of random numbers from observational data which, it is claimed, is exponentially distributed with unit mean and variance, essentially independent of the distribution of the original data. We show that the derived random processes is nonstationary and produces a small but systematic bias in the usual estimate of the mean and variance. Although the derived variable may be reasonably described by an exponential distribution, the tail of the distribution is far removed from that of an exponential, thereby rendering statistical inference and confidence testing based on the tail of the distribution completely unreliable. Finally, we examine a number of astronomical examples wherein these methods have been used giving rise to widespread acceptance of statistically unconfirmed conclusions.

Newman, William I.↗

Stochastic Formal Correctness of Numerical Algorithms

We provide a framework to bound the probability that accumulated errors were never above a given threshold on numerical algorithms. Such algorithms are used for example in aircraft and nuclear power plants. This report contains simple formulas based on Levy's and Markov's inequalities and it presents a formal theory of random variables with a special focus on producing concrete results. We selected four very common applications that fit in our framework and cover the common practices of systems that evolve for a long time. We compute the number of bits that remain continuously significant in the first two applications with a probability of failure around one out of a billion, where worst case analysis considers that no significant bit remains. We are using PVS as such formal tools force explicit statement of all hypotheses and prevent incorrect uses of theorems.

Daumas, Marc↗

Simple Math is Enough: Two Examples of Inferring Functional Associations from Genomic Data

Non-random features in the genomic data are usually biologically meaningful. The key is to choose the feature well. Having a p-value based score prioritizes the findings. If two proteins share a unusually large number of common interaction partners, they tend to be involved in the same biological process. We used this finding to predict the functions of 81 un-annotated proteins in yeast.

Liang, Shoudan↗

Accuracy of Gradient Reconstruction on Grids with High Aspect Ratio

Gradient approximation methods commonly used in unstructured-grid finite-volume schemes intended for solutions of high Reynolds number flow equations are studied comprehensively. The accuracy of gradients within cells and within faces is evaluated systematically for both node-centered and cell-centered formulations. Computational and analytical evaluations are made on a series of high-aspect-ratio grids with different primal elements, including quadrilateral, triangular, and mixed element grids, with and without random perturbations to the mesh. Both rectangular and cylindrical geometries are considered; the latter serves to study the effects of geometric curvature. The study shows that the accuracy of gradient reconstruction on high-aspect-ratio grids is determined by a combination of the grid and the solution. The contributors to the error are identified and approaches to reduce errors are given, including the addition of higher-order terms in the direction of larger mesh spacing. A parameter GAMMA characterizing accuracy on curved high-aspect-ratio grids is discussed and an approximate-mapped-least-square method using a commonly-available distance function is presented; the method provides accurate gradient reconstruction on general grids. The study is intended to be a reference guide accompanying the construction of accurate and efficient methods for high Reynolds number applications

Thomas, James↗

A Magnetic Solid-State Storage Technology: Vertical Bloch Line Storage

No storage technology is known to exist today which simultaneously offers high-storage density, nonvolatility, and a solid-state form factor. For example, common random access memories are solid-state, but are volatile and typically offer modest density. Alternatively, mainstream magnetic disk and magnetic tape systems offer high storage density and nonvolatility, but are fundamentally not solid-state. A number of applications exist which would be suited well with high performance solid- state technology. NASA, for example, is beginning baseline solid-state recorders for upcoming space missions, such as the Cassini mission to Saturn.

Katti, R. R.↗

Phase Diagrams of Electric-Fduced Aggregation in Conducting Colloids

Under the application of a sufficiently strong electric field, a suspension may undergo reversible phase transitions from a homogeneous random arrangement of particles into a variety of ordered aggregation patterns. The surprising fact about electric-field driven phase transitions is that the aggregation patterns, that are observed in very diverse systems of colloids, display a number of common structural features and modes of evolution thereby implying that a universal mechanism may exist to account for these phenomena. It is now generally believed that this mechanism emanates from the presence of the long-range anisotropic interactions between colloidal particles due to their polarization in an applied field. But, in spite of numerous applications of the electric-field-driven phenomena in biotechnology, separation, materials engineering, chemical analysis, etc. our understanding of these phenomena is far from complete. Thus, it is the purpose of the proposed research to develop a theory and then test experimentally, under normal- and low-gravity conditions, the accuracy of the theoretical predictions regarding the effect of the synergism of the interparticle electric and hydrodynamic interactions on the phase diagram of a suspension. The main results from our theoretical studies performed to-date enable one to trace how the variations of the electrical properties of the constituent materials influence the topology of the suspension phase diagram and then, by using an appropriate phase diagram, to evaluate how the electric-field-induced transformations will depend on the frequency and the strength of the applied field.

Khusid, B.↗

Development of Novel Composite and Random Materials for Nonlinear Optics and Lasers

A qualitative model explaining sharp spectral peaks in emission of solid-state random laser materials with broad-band gain is proposed. The suggested mechanism of coherent emission relies on synchronization of phases in an ensemble of emitting centers, via time delays provided by a network of random scatterers, and amplification of spontaneous emission that supports the spontaneously organized coherent state. Laser-like emission from powders of solid-state luminophosphors, characterized by dramatic narrowing of the emission spectrum and shortening of emission pulses above the threshold, was first observed by Markushev et al. and further studied by a number of research groups. In particular, it has been shown that when the pumping energy significantly exceeds the threshold, one or several narrow emission lines can be observed in broad-band gain media with scatterers, such as films of ZnO nanoparticles, films of pi-conjugated polymers or infiltrated opals. The experimental features, commonly observed in various solid-state random laser materials characterized by different particle sizes, different values of the photon mean free path l*, different indexes of refraction, etc.. can be described as follows. (Liquid dye random lasers are not discussed here.)

Noginov, Mikhail↗

A mixture of grass–legume cover crop species may ameliorate water stress in a changing climate

Climate change models predict increasing precipitation variability in the mid-latitude regions of Earth, generating a need to reduce the negative impacts of these changes on crop production. Despite considerable research on how cover crops support agriculture in a changing climate, understanding is limited of how climate change influences the growth of cover crops. We investigated the early development of two common cover crop species—crimson clover (Trifolium incarnatum) and rye (Secale cereale)—and hypothesized that growing them in the mixture would ameliorate stress from drought or waterlogging. This hypothesis was tested in a 25-day greenhouse experiment, where the two factors (species number and water stress) were fully crossed in randomized blocks, and plant responses were quantified through survival, growth rate, biomass production and root morphology. Water stress negatively influenced the early growth of these two species in contrasting ways: crimson clover was susceptible to drought while rye performed poorly under waterlogging. Per-plant biomass in rye was always greater in mixture than in monoculture, while per-plant biomass of crimson clover was greater in mixture under drought. Both species grew longer roots in mixture than in monoculture under drought, and total biomass of mixtures did not differ significantly from the more-productive monoculture (rye) in any water condition. In the face of increasingly variable precipitation, growing crimson clover and rye together has potential to ameliorate water stress, a possibility that should be further investigated in field experiments.

54 ENVIRONMENTAL SCIENCES↗

A survey of the milliarcsecond polarization properties of BL Lacertae objects at 5 GHz

Consideration is given to millarcsecond-resolution total-intensity and linear polarization maps at 5 GHz presented for 11 BL Lacertae objects. In every BL Lacertae object in which polarization structure was detected, the polarization position angle of the knots is nearly parallel to the VLBI structural axis. The direction of the polarization in the cores of these sources appears to be random. The preferred polarization direction in the jets is explained by the fact that plane perpendicular shock waves are common in these sources; the origin of the absence of the preferred polarization direction in the core components is unclear. These results support an early conclusion that it cannot be the case that a significant number of BL Lacertae objects are gravitationally microlensed images of more distant quasars, since the characteristic VLBI polarization structures observed in these two types of objects are very different.

Gabuzda, D. C.↗

I/O in Machine Learning Applications on HPC Systems: A 360-degree Survey

Growing interest in Artificial Intelligence (AI) has resulted in a surge in demand for faster methods of Machine Learning (ML) model training and inference. This demand for speed has prompted the use of high performance computing (HPC) systems that excel in managing distributed workloads. Because data is the main fuel for AI applications, the performance of the storage and I/O subsystem of HPC systems is critical. In the past, HPC applications accessed large portions of data written by simulations or experiments or ingested data for visualizations or analysis tasks. ML workloads perform small reads spread across a large number of random files. This shift of I/O access patterns poses several challenges to modern parallel storage systems. In this paper, we survey I/O in ML applications on HPC systems, and target literature within a 6-year time window from 2019 to 2024. We define the scope of the survey, provide an overview of the common phases of ML, review available profilers and benchmarks, examine the I/O patterns encountered during offline data preparation, training, and inference, and explore I/O optimizations utilized in modern ML frameworks and proposed in recent literature. Lastly, we seek to expose research gaps that could spawn further R&D.

97 MATHEMATICS AND COMPUTING↗

Biodiversity: molecular biological domains, symbiosis and kingdom origins

The number of extant species of organisms is estimated to be from fewer than 3 to more than 30 x 10(6) (May, 1992). Molecular biology, comparative genetics and ultrastructural analyses provide new insights into evolutionary relationships between these species, including increasingly precise ideas of how species and higher taxa have evolved from common ancestors. Accumulation of random mutations and large macromolecular sequence change in all organisms since the Proterozoic Eon has been importantly supplemented by acquisition of inherited genomes ('symbiogenesis'). Karyotypic alterations (polyploidization and karyotypic fissioning) have been added to these other mechanisms of species origin in plants and animals during the Phanerozoic Eon. The new evolution concepts (coupled with current rapid rates of species extinction and ignorance of the extent of biodiversity) prompted this analysis of the field of systematic biology and its role in the reorganization of extant species into higher taxa. Two superkingdoms (= Domains: Prokaryotae and Eukaryotae) and five kingdoms (Monera = Procaryotae or Bacteria; Protoctista: algae, amoebae, ciliates, foraminifera, oomycetes, slime molds, etc.; Mychota: 'true' fungi; Plantae: one phylum (division) of bryophytes and nine phyla of tracheophytes; and Animalia) are recognized. Two subkingdoms comprise the monera: the great diverse lineages are Archaebacteria and Eubacteria. The criteria for classification using molecular, ultrastructural and genetic data for this scheme are mentioned. For the first time since the nineteenth century, logical, technical definitions for each group are given with their time of appearance as inferred from the fossil record in the primary scientific literature. This classification scheme, which most closely reflects the evolutionary history, molecular biology, genetics and ultrastructure of extant life, requires changes in social organization of biologists, many of whom as botanists and zoologists, still behave as if there were only two important kingdoms (plants and animals).

Non-NASA Center↗

Uncertainty Quantification of the FUN3D-Predicted NASA CRM Flutter Boundary

A nonintrusive point collocation method is used to propagate parametric uncertainties of the flexible Common Research Model, a generic transport configuration, through the unsteady aeroelastic CFD solver FUN3D. A range of random input variables are considered, including atmospheric flow variables, structural variables, and inertial (lumped mass) variables. UQ results are explored for a range of output metrics (with a focus on dynamic flutter stability), for both subsonic and transonic Mach numbers, for two different CFD mesh refinements. A particular focus is placed on computing failure probabilities: the probability that the wing will flutter within the flight envelope.

Stanford, Bret K.↗

Analysis of a Coded, M-ary Orthogonal Input Optical Channel with Random-gain Photomultiplier Detection

Performance of two coding systems is analyzed for a noisy optical channel with M(=2(L)-ary orthogonal signaling and random gain photomultiplier detection. The considered coding systems are the Reed Solomon (RS) coding with error only correction decoding and the interleaved binary convolutional system with soft decision Viterbi decoding. The required average number of received signal photons per information bit, N sub b, for a desired bit error of 0.000001 is found for a set of commonly used parameters and with a high background noise level. We find that the interleaved binary convolutional coding system is preferable to the RS coding system in performance complexity tradeoffs.

Lee, P. J.↗

Determination of inverted-V stability from Dynamics Explorer satellite data

The longevity of a number of inverted-V electron precipitation events was measured by comparing electron distributions acquired from the two Dynamics Explorer spacecraft during close proximity passes through the southern auroral zone. Common events were identified in the two data sets for time separations up to 18 min. The maximum energy attained within an inverted-V sometimes varied between observations indicating growth or decay of the event. The number of events increasing in energy was roughly equal to those exhibiting decreasing energy, suggesting similar time scales for growth and decay. Observations closely spaced in time (minutes) had some events not in common, implying either a sudden cessation of the event or a limited spatial extent precluding observation by one of the two spacecraft due to its orbital displacement. A statistical study of 28 close proximity passes showed that the number of matched inverted-V events exceeded those which were unmatched. This was not true for comparisons of random pairs of electron distribution plots for the two spacecraft. This implies that the close proximity events observed by both spacecraft were not just random coincidences.

Thieman, J. R.↗