Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “random search”

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 307 records · Page 17

Improved bound on nonlinear quantum mechanics using a cryogenic radio frequency experiment

There are strong arguments that quantum mechanics may be nonlinear in its dynamics. A discovery of nonlinearity would hint at a novel understanding of the interplay between gravity and quantum field theory, for example. As such, experiments searching for potential nonlinear effects in the electromagnetic sector are important. Here, in this study, we outline such an experiment, consisting of a stream of random bits (which were generated using Rigetti’s Aspen-M-3 chip) as input to an rf signal generator coupled to a cryogenic detector. Projective measurements of the qubit state, which is originally prepared in an equal superposition, serve as the random binary output of a signal generator. Thereafter, spectral analysis of the rf detector would yield a detectable excess signal predicted to arise from such a nonlinear effect. A comparison between the projective measurements of the quantum bits vs the classical baseline showed no power excess. This sets a new limit on the electromagnetic nonlinearity parameter |ε| ⪅ 1.15 x 10 -12 , at a 90.0% confidence level. This is the most stringent limit on nonlinear quantum mechanics thus far and an improvement by nearly a factor of 50 over the previous experimental limit.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

Geometric Modeling of Inclusions as Ellipsoids

Nonmetallic inclusions in gas turbine disk alloys can have a significant detrimental impact on fatigue life. Because large inclusions that lead to anomalously low lives occur infrequently, probabilistic approaches can be utilized to avoid the excessively conservative assumption of lifing to a large inclusion in a high stress location. A prerequisite to modeling the impact of inclusions on the fatigue life distribution is a characterization of the inclusion occurrence rate and size distribution. To help facilitate this process, a geometric simulation of the inclusions was devised. To make the simulation problem tractable, the irregularly sized and shaped inclusions were modeled as arbitrarily oriented, three independent dimensioned, ellipsoids. Random orientation of the ellipsoid is accomplished through a series of three orthogonal rotations of axes. In this report, a set of mathematical models for the following parameters are described: the intercepted area of a randomly sectioned ellipsoid, the dimensions and orientation of the intercepted ellipse, the area of a randomly oriented sectioned ellipse, the depth and width of a randomly oriented sectioned ellipse, and the projected area of a randomly oriented ellipsoid. These parameters are necessary to determine an inclusion s potential to develop a propagating fatigue crack. Without these mathematical models, computationally expensive search algorithms would be required to compute these parameters.

Bonacuse, Peter J.↗

Similarity Downselection: Finding the n Most Dissimilar Molecular Conformers for Reference-Free Metabolomics

Computational methods for creating in silico libraries of molecular descriptors (e.g., collision cross sections) are becoming increasingly prevalent due to the limited number of authentic reference materials available for traditional library building. These so-called “reference-free metabolomics” methods require sampling sets of molecular conformers in order to produce high accuracy property predictions. Due to the computational cost of the subsequent calculations for each conformer, there is a need to sample the most relevant subset and avoid repeating calculations on conformers that are nearly identical. The goal of this study is to introduce a heuristic method of finding the most dissimilar conformers from a larger population in order to help speed up reference-free calculation methods and maintain a high property prediction accuracy. Finding the set of the n items most dissimilar from each other out of a larger population becomes increasingly difficult and computationally expensive as either n or the population size grows large. Because there exists a pairwise relationship between each item and all other items in the population, finding the set of the n most dissimilar items is different than simply sorting an array of numbers. For instance, if you have a set of the most dissimilar n = 4 items, one or more of the items from n = 4 might not be in the set n = 5. An exact solution would have to search all possible combinations of size n in the population exhaustively. We present an open-source software called similarity downselection (SDS), written in Python and freely available on GitHub. SDS implements a heuristic algorithm for quickly finding the approximate set(s) of the n most dissimilar items. We benchmark SDS against a Monte Carlo method, which attempts to find the exact solution through repeated random sampling. We show that for SDS to find the set of n most dissimilar conformers, our method is not only orders of magnitude faster, but it is also more accurate than running Monte Carlo for 1,000,000 iterations, each searching for set sizes n = 3–7 out of a population of 50,000. We also benchmark SDS against the exact solution for example small populations, showing that SDS produces a solution close to the exact solution in these instances. Using theoretical approaches, we also demonstrate the constraints of the greedy algorithm and its efficacy as a ratio to the exact solution.

97 MATHEMATICS AND COMPUTING↗

A predictive machine learning approach for microstructure optimization and materials design

This paper addresses an important materials engineering question: How can one identify the complete space (or as much of it as possible) of microstructures that are theoretically predicted to yield the desired combination of properties demanded by a selected application? We present a problem involving design of magnetoelastic Fe-Ga alloy microstructure for enhanced elastic, plastic and magnetostrictive properties. While theoretical models for computing properties given the microstructure are known for this alloy, inversion of these relationships to obtain microstructures that lead to desired properties is challenging, primarily due to the high dimensionality of microstructure space, multi-objective design requirement and non-uniqueness of solutions. These challenges render traditional search-based optimization methods incompetent in terms of both searching efficiency and result optimality. In this paper, a route to address these challenges using a machine learning methodology is proposed. A systematic framework consisting of random data generation, feature selection and classification algorithms is developed. In conclusion, experiments with five design problems that involve identification of microstructures that satisfy both linear and nonlinear property constraints show that our framework outperforms traditional optimization methods with the average running time reduced by as much as 80% and with optimality that would not be achieved otherwise.

36 MATERIALS SCIENCE↗

An astrometric facility for planetary detection on the Space Station

The preliminary system definition study for an Astrometric Telescope Facility (ATF) designed for the Space Station IOC is discussed, and a strawman system is designed which is found to meet the requirements for extrasolar planetary systems search and study. The strawman facility design, with a prime-focus 1.25-m aperture telescope and an f ratio of 13, was selected to minimize random and systematic errors. A basic operations approach is identified, including the approach to launch, initial on-orbit assembly and checkout, normal operations, and the response to anomolous conditions or failures. The preliminary system is designed to be fail-safe and single-fault tolerant. Mission analysis indicates that the basic viewing required for planetary detection can be accomplished in about 2/3 of the total viewing time.

Nishioka, Kenji↗

Near-infrared stellar-occultation predictions for Uranus and Neptune - 1987-1990

Stellar-occultation predictions are presented for Uranus and Neptune covering the period 1987-1990, based on automated scans of R and I plates taken with the UK Schmidt Telescope in Australia. These scans have revealed many late-type or highly reddened stars suitable for stellar-occultation observations at 2.2 microns that were missed in previous searches of yellow-sensitive astrographic plates (Mink and Klemola, 1985). Comparisons involving several hundred stars measured by Mink and Klemola (1985) indicate that the internal random errors in the stellar positions estimated here are less than about 0.2 arcsec, comparable to the precision reached using conventional astrographic methods. In addition, JHK photometry was obtained for many of the Neptune stars, which is used to establish an empirical (I-K) vs (R-I) calibration for the remaining occultation candidates, and thus provide estimates of their K magnitudes.

Nicholson, Philip D.↗

Studying the spatial distribution of interstellar dust

The spacial distribution of interstellar dust reflects both interstellar dynamics and the processes which form and destroy dust in the interstellar medium (ISM). The IRAS survey, because of its high sensitivity to thermal emission from dust in the IR, provides new approaches to determining the spatial distribution of dust. The initial results are reported of an attempt to use the IRAS data to probe the spatial distribution of dust - by searching for thermal emission from dust in the vicinity of bright stars. These results show that this technique (which relies on finding IR emission associated with randomly selected stars) can ultimately be used to study the distribution of dust in the ISM. The density of the cloud producing the IR emission may be derived by assuming that the dust is at its projected distance from the star and that the heating is due to the star's (known) radiation field. The heating radiation is folded into a grain model, and the number of emitting grains adjusted to reproduce the observed energy distribution. It is noted that this technique is capable in principle of detecting dust densities much lower than those typical of the cirrus clouds.

Walker, Helen J.↗

Inexact Newton-CG algorithms with complexity guarantees

Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).

Mathematics↗

Search for spectral lines in cosmic gamma-ray bursts

Time-integrated spectra from 177 gamma-ray bursts observed by the Gamma Ray Spectrometer (GRS) on NASA's Solar Maximum Mission satellite (SMM) have been systematically searched for evidence of emission lines in the range 300 keV and higher. The distribution of fitted line strengths is consistent with what is expected from a random sample of data, suggesting that there are no statistically significant narrow or moderately broadened line features in any of the bursts.

Messina, Daniel C.↗

Efficient reconstruction and validation of heterogeneous microstructures for energy applications

The digital reconstruction of microstructures is necessary for simulations in fields ranging from geology to electrochemistry, but the state-of-the-art digital reconstruction techniques often compromise between resolution and field of view. It is challenging to retain detailed microstructure information in large-scale reconstructions. Here, this study investigates different aspects of the Yeong-Torquato algorithm based on correlation functions to make it more efficient. We achieve this goal by reducing the computational complexity of the chord-length distribution function and the two-point correlation function, applying the random sphere-packing method as the initial condition, and restricting potential voxel swaps to interfaces. In addition, a novel superposition parallel scheme is introduced to aid in searching for potential voxel swaps. The algorithm proposed is validated by comparing the pore-size distributions of reconstructed 3D custom battery electrodes from a sample dataset obtained from transmission X-ray microscopy. From a sample image with 200 x 200 pixels, the code can reconstruct a 300 x 300 x 300 structure in under 22 h and reconstruct a 400 x 400 x 400 structure in 43 h with eight cores.

42 ENGINEERING↗

De-biased populations of Kuiper belt objects from the deep ecliptic survey

The Deep Ecliptic Survey (DES) was a survey project that discovered hundreds of Kuiper Belt objects from 1998 to 2005. Extensive follow-up observations of these bodies has yielded 304 objects with well-determined orbits and dynamical classifications into one of several categories: Classical, Scattered, Centaur, or 16 mean-motion resonances with Neptune. The DES search fields are well documented, enabling us to calculate the probability on each frame of detecting an object with its particular orbital parameters and absolute magnitude at a randomized point in its orbit. The detection probabilities range from a maximum of 0.32 for the 3:2 resonant object 2002 GF {sub 32} to a minimum of 1.5 × 10{sup –7} for the faint Scattered object 2001 FU {sub 185}. By grouping individual objects together by dynamical classes, we can estimate the distributions of four parameters that define each class: semimajor axis, eccentricity, inclination, and object size. The orbital element distributions (a, e, and i) were fit to the largest three classes (Classical, 3:2, and Scattered) using a maximum likelihood fit. Using the absolute magnitude (H magnitude) as a proxy for the object size, we fit a power law to the number of objects versus H magnitude for eight classes with at least five detected members (246 objects). The Classical objects are best fit with a power-law slope of α = 1.02 ± 0.01 (observed from 5 ≤ H ≤ 7.2). Six other dynamical classes (Scattered plus five resonances) have consistent magnitude distribution slopes with the Classicals, provided that the absolute number of objects is scaled. Scattered objects are somewhat more numerous than Classical objects, while there are only a quarter as many 3:2 objects as Classicals. The exception to the power law relation is the Centaurs, which are non-resonant objects with perihelia closer than Neptune and therefore brighter and detectable at smaller sizes. Centaurs were observed from 7.5 < H < 11, and that population is best fit by a power law with α = 0.42 ± 0.02. This is consistent with a knee in the H-distribution around H = 7.2 as reported elsewhere. Based on the Classical-derived magnitude distribution, the total number of objects (H ≤ 7) in each class is: Classical (2100 ± 300 objects), Scattered (2800 ± 400), 3:2 (570 ± 80), 2:1 (400 ± 50), 5:2 (270 ± 40), 7:4 (69 ± 9), 5:3 (60 ± 8). The independent estimate for the number of Centaurs in the same H range is 13 ± 5. If instead all objects are divided by inclination into 'Hot' and 'Cold' populations, following Fraser et al., we find that α{sub Hot} = 0.90 ± 0.02, while α{sub Cold} = 1.32 ± 0.02, in good agreement with that work.

79 ASTRONOMY AND ASTROPHYSICS↗

Local random potentials of high differentiability to model the Landscape

We generate random functions locally via a novel generalization of Dyson Brownian motion, such that the functions are in a desired differentiability class C{sup k}, while ensuring that the Hessian is a member of the Gaussian orthogonal ensemble (other ensembles might be chosen if desired). Potentials in such higher differentiability classes (k≥2) are required/desirable to model string theoretical landscapes, for instance to compute cosmological perturbations (e.g., k=2 for the power-spectrum) or to search for minima (e.g., suitable de Sitter vacua for our universe). Since potentials are created locally, numerical studies become feasible even if the dimension of field space is large (D∼100). In addition to the theoretical prescription, we provide some numerical examples to highlight properties of such potentials; concrete cosmological applications will be discussed in companion publications.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Unbiased bases (Hadamards) for six-level systems: Four ways from Fourier

In quantum mechanics some properties are maximally incompatible, such as the position and momentum of a particle or the vertical and horizontal projections of a two-level spin. Given any definite state of one property, the other property is completely random or unbiased. For N-level systems, the six-level ones are the smallest for which a tomographically efficient set of N+1 mutually unbiased bases has not been found. To facilitate the search, we numerically extend the classification of unbiased bases, or Hadamards, by incrementally adjusting relative phases in a standard basis. We consider the nonunitarity caused by small adjustments with a second order Taylor expansion and choose incremental steps within the four-dimensional null space of the curvature. In this way, we prescribe a numerical integration of a four-parameter set of Hadamards of order of 6.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast optimization algorithms and the cosmological constant

Denef and Douglas have observed that in certain landscape models the problem of finding small values of the cosmological constant is a large instance of a problem that is hard for the complexity class NP (Nondeterministic Polynomial-time). The number of elementary operations (quantum gates) needed to solve this problem by brute force search exceeds the estimated computational capacity of the observable Universe. Here in this paper, we describe a way out of this puzzling circumstance: despite being NP-hard, the problem of finding a small cosmological constant can be attacked by more sophisticated algorithms whose performance vastly exceeds brute force search. In fact, in some parameter regimes the average-case complexity is polynomial. We demonstrate this by explicitly finding a cosmological constant of order 10 -120 in a randomly generated 10 9 -dimensional Arkani-Hamed–Dimopoulos–Kachru landscape.

79 ASTRONOMY AND ASTROPHYSICS↗

Efficient quantum circuit implementation of quantum walks

Quantum walks, being the quantum analog of classical random walks, are expected to provide a fruitful source of quantum algorithms. A few such algorithms have already been developed, including the 'glued trees' algorithm, which provides an exponential speedup over classical methods, relative to a particular quantum oracle. Here, we discuss the possibility of a quantum walk algorithm yielding such an exponential speedup over possible classical algorithms, without the use of an oracle. We provide examples of some highly symmetric graphs on which efficient quantum circuits implementing quantum walks can be constructed and discuss potential applications to quantum search for marked vertices along these graphs.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computational generation and screening of RNA motifs in large nucleotide sequence pools

Although identification of active motifs in large random sequence pools is central to RNA in vitro selection, no systematic computational equivalent of this process has yet been developed. We develop a computational approach that combines target pool generation, motif scanning and motif screening using secondary structure analysis for applications to 10 12 –10 14 -sequence pools; large pool sizes are made possible using program redesign and supercomputing resources. We use the new protocol to search for aptamer and ribozyme motifs in pools up to experimental pool size (10 14 sequences). We show that motif scanning, structure matching and flanking sequence analysis, respectively, reduce the initial sequence pool by 6–8, 1–2 and 1 orders of magnitude, consistent with the rare occurrence of active motifs in random pools. The final yields match the theoretical yields from probability theory for simple motifs and overestimate experimental yields, which constitute lower bounds, for aptamers because screening analyses beyond secondary structure information are not considered systematically. We also show that designed pools using our nucleotide transition probability matrices can produce higher yields for RNA ligase motifs than random pools. Our methods for generating, analyzing and designing large pools can help improve RNA design via simulation of aspects of in vitro selection.

59 BASIC BIOLOGICAL SCIENCES↗

SEARCH FOR CHAOS IN NEUTRON STAR SYSTEMS: IS Cyg X-3 A BLACK HOLE?

The accretion disk around a compact object is a nonlinear general relativistic system involving magnetohydrodynamics. Naturally, the question arises whether such a system is chaotic (deterministic) or stochastic (random) which might be related to the associated transport properties whose origin is still not confirmed. Earlier, the black hole system GRS 1915+105 was shown to be low-dimensional chaos in certain temporal classes. However, so far such nonlinear phenomena have not been studied fairly well for neutron stars which are unique for their magnetosphere and kHz quasi-periodic oscillation (QPO). On the other hand, it was argued that the QPO is a result of nonlinear magnetohydrodynamic effects in accretion disks. If a neutron star exhibits chaotic signature, then what is the chaotic/correlation dimension? We analyze RXTE/PCA data of neutron stars Sco X-1 and Cyg X-2, along with the black hole Cyg X-1 and the unknown source Cyg X-3, and show that while Sco X-1 and Cyg X-2 are low dimensional chaotic systems, Cyg X-1 and Cyg X-3 are stochastic sources. Based on our analysis, we argue that Cyg X-3 may be a black hole.

79 ASTRONOMY AND ASTROPHYSICS↗