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 91 records · Page 5

Geography of cretaceous extinctions: Data base development

Data bases built from the source literature are plagued by problems of data quality. Unless the data acquisition is done by experts, working slowly, the data base may contain so much garbage that true signals and patterns cannot be detected. On the other hand, high quality data bases develop so slowly that satisfactory statistical analysis may never be possible due to the small sample sizes. Results of a test are presented of the opposite strategy: rapid data acquisition by non-experts with minimal control on data quality. A published list of 186 species and genera of fossil invertibrates of the latest Cretaceous Age (Maestrichtian) were located through a random search of the paleobiological and geological literature. The geographic location for each faunal list was then transformed electronically to Maestrichtian latitude and longitude and the lists were further digested to identify the genera occurring in each ten-degree, latitude-longitude block. The geographical lists were clustered using the Otsuka similarity coefficient and a standard unweight-pair-group method. The resulting clusters are remarkably consistent geographically, indicating that a strong biogeographic signal is visible despite low-quality data. A further test evaluated the geographic pattern of end-Cretaceaous extinctions. All genera in the data base were compared with Sepkoski's compendium of time ranges of genera to determine which of the reported genera survived the Cretaceous mass extinction. In turn, extinction rates for the ten-degree, latitude-longitude blocks were mapped. The resulting distribution is readily interpretable as a robust pattern of the geography of the mass extinction. The study demonstrates that a low-quality data base, built rapidly, can provide a basis for meaningful analysis of past biotic events.

Raup, D. M.↗

A Darwinian approach to control-structure design

Genetic algorithms (GA's), as introduced by Holland (1975), are one form of directed random search. The form of direction is based on Darwin's 'survival of the fittest' theories. GA's are radically different from the more traditional design optimization techniques. GA's work with a coding of the design variables, as opposed to working with the design variables directly. The search is conducted from a population of designs (i.e., from a large number of points in the design space), unlike the traditional algorithms which search from a single design point. The GA requires only objective function information, as opposed to gradient or other auxiliary information. Finally, the GA is based on probabilistic transition rules, as opposed to deterministic rules. These features allow the GA to attack problems with local-global minima, discontinuous design spaces and mixed variable problems, all in a single, consistent framework.

Zimmerman, David C.↗

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 and 45 percent, respectively. These savings are close to those quoted as overall NASA Advanced Composite Technology (ACT) program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. The effects are summarized of each task and the task associated with a design cost model is described in detail. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these studies. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗

Local design optimization for composite transport fuselage crown panels

Composite transport fuselage crown panel design and manufacturing plans were optimized to have projected cost and weight savings of 18 percent and 45 percent, respectively. These savings are close to those quoted as overall NASA ACT program goals. Three local optimization tasks were found to influence the cost and weight of fuselage crown panels. This paper summarizes the effect of each task and describes in detail the task associated with a design cost model. Studies were performed to evaluate the relationship between manufacturing cost and design details. A design tool was developed to aid in these investigations. The development of the design tool included combining cost and performance constraints with a random search optimization algorithm. The resulting software was used in a series of optimization studies that evaluated the sensitivity of design variables, guidelines, criteria, and material selection on cost. The effect of blending adjacent design points in a full scale panel subjected to changing load distributions and local variations was shown to be important. Technical issues and directions for future work were identified.

Swanson, G. D.↗

An Algorithm for Efficient Maximum Likelihood Estimation and Confidence Interval Determination in Nonlinear Estimation Problems

An algorithm for maximum likelihood (ML) estimation is developed with an efficient method for approximating the sensitivities. The algorithm was developed for airplane parameter estimation problems but is well suited for most nonlinear, multivariable, dynamic systems. The ML algorithm relies on a new optimization method referred to as a modified Newton-Raphson with estimated sensitivities (MNRES). MNRES determines sensitivities by using slope information from local surface approximations of each output variable in parameter space. The fitted surface allows sensitivity information to be updated at each iteration with a significant reduction in computational effort. MNRES determines the sensitivities with less computational effort than using either a finite-difference method or integrating the analytically determined sensitivity equations. MNRES eliminates the need to derive sensitivity equations for each new model, thus eliminating algorithm reformulation with each new model and providing flexibility to use model equations in any format that is convenient. A random search technique for determining the confidence limits of ML parameter estimates is applied to nonlinear estimation problems for airplanes. The confidence intervals obtained by the search are compared with Cramer-Rao (CR) bounds at the same confidence level. It is observed that the degree of nonlinearity in the estimation problem is an important factor in the relationship between CR bounds and the error bounds determined by the search technique. The CR bounds were found to be close to the bounds determined by the search when the degree of nonlinearity was small. Beale's measure of nonlinearity is developed in this study for airplane identification problems; it is used to empirically correct confidence levels for the parameter confidence limits. The primary utility of the measure, however, was found to be in predicting the degree of agreement between Cramer-Rao bounds and search estimates.

Murphy, Patrick Charles↗

Comparison of Structural Optimization Techniques for a Nuclear Electric Space Vehicle

The purpose of this paper is to utilize the optimization method of genetic algorithms (GA) for truss design on a nuclear propulsion vehicle. Genetic Algorithms are a guided, random search that mirrors Darwin s theory of natural selection and survival of the fittest. To verify the GA s capabilities, other traditional optimization methods were used to compare the results obtained by the GA's, first on simple 2-D structures, and eventually on full-scale 3-D truss designs.

Benford, Andrew↗

Truss Optimization for a Manned Nuclear Electric Space Vehicle using Genetic Algorithms

The purpose of this paper is to utilize the genetic algorithm (GA) optimization method for structural design of a nuclear propulsion vehicle. Genetic algorithms provide a guided, random search technique that mirrors biological adaptation. To verify the GA capabilities, other traditional optimization methods were used to generate results for comparison to the GA results, first for simple two-dimensional structures, and then for full-scale three-dimensional truss designs.

Benford, Andrew↗

The sequence, and its evolutionary implications, of a Thermococcus celer protein associated with transcription

Through random search, a gene from Thermococcus celer has been identified and sequenced that appears to encode a transcription-associated protein (110 amino acid residues). The sequence has clear homology to approximately the last half of an open reading frame reported previously for Sulfolobus acidocaldarius [Langer, D. & Zillig, W. (1993) Nucleic Acids Res. 21, 2251]. The protein translations of these two archaeal genes in turn are homologs of a small subunit found in eukaryotic RNA polymerase I (A12.2) and the counterpart of this from RNA polymerase II (B12.6). Homology is also seen with the eukaryotic transcription factor TFIIS, but it involves only the terminal 45 amino acids of the archaeal proteins. Evolutionary implications of these homologies are discussed.

Non-NASA Center↗

Automated Knowledge Discovery From Simulators

A computational method, SimLearn, has been devised to facilitate efficient knowledge discovery from simulators. Simulators are complex computer programs used in science and engineering to model diverse phenomena such as fluid flow, gravitational interactions, coupled mechanical systems, and nuclear, chemical, and biological processes. SimLearn uses active-learning techniques to efficiently address the "landscape characterization problem." In particular, SimLearn tries to determine which regions in "input space" lead to a given output from the simulator, where "input space" refers to an abstraction of all the variables going into the simulator, e.g., initial conditions, parameters, and interaction equations. Landscape characterization can be viewed as an attempt to invert the forward mapping of the simulator and recover the inputs that produce a particular output. Given that a single simulation run can take days or weeks to complete even on a large computing cluster, SimLearn attempts to reduce costs by reducing the number of simulations needed to effect discoveries. Unlike conventional data-mining methods that are applied to static predefined datasets, SimLearn involves an iterative process in which a most informative dataset is constructed dynamically by using the simulator as an oracle. On each iteration, the algorithm models the knowledge it has gained through previous simulation trials and then chooses which simulation trials to run next. Running these trials through the simulator produces new data in the form of input-output pairs. The overall process is embodied in an algorithm that combines support vector machines (SVMs) with active learning. SVMs use learning from examples (the examples are the input-output pairs generated by running the simulator) and a principle called maximum margin to derive predictors that generalize well to new inputs. In SimLearn, the SVM plays the role of modeling the knowledge that has been gained through previous simulation trials. Active learning is used to determine which new input points would be most informative if their output were known. The selected input points are run through the simulator to generate new information that can be used to refine the SVM. The process is then repeated. SimLearn carefully balances exploration (semi-randomly searching around the input space) versus exploitation (using the current state of knowledge to conduct a tightly focused search). During each iteration, SimLearn uses not one, but an ensemble of SVMs. Each SVM in the ensemble is characterized by different hyper-parameters that control various aspects of the learned predictor - for example, whether the predictor is constrained to be very smooth (nearby points in input space lead to similar output predictions) or whether the predictor is allowed to be "bumpy." The various SVMs will have different preferences about which input points they would like to run through the simulator next. SimLearn includes a formal mechanism for balancing the ensemble SVM preferences so that a single choice can be made for the next set of trials.

Burl, Michael↗

Automated Long - Term Scheduling for the SOFIA Airborne Observatory

The NASA Stratospheric Observatory for Infrared Astronomy (SOFIA) is a joint US/German project to develop and operate a gyro-stabilized 2.5-meter telescope in a Boeing 747SP. SOFIA's first science observations were made in December 2010. During 2011, SOFIA accomplished 30 flights in the "Early Science" program as well as a deployment to Germany. The new observing period, known as Cycle 1, is scheduled to begin in 2012. It includes 46 science flights grouped in four multi-week observing campaigns spread through a 13-month span. Automation of the flight scheduling process offers a major challenge to the SOFIA mission operations. First because it is needed to mitigate its relatively high cost per unit observing time compared to space-borne missions. Second because automated scheduling techniques available for ground-based and space-based telescopes are inappropriate for an airborne observatory. Although serious attempts have been made in the past to solve part of the problem, until recently mission operations staff was still manually scheduling flights. We present in this paper a new automated solution for generating SOFIA long-term schedules that will be used in operations from the Cycle 1 observing period. We describe the constraints that should be satisfied to solve the SOFIA scheduling problem in the context of real operations. We establish key formulas required to efficiently calculate the aircraft course over ground when evaluating flight schedules. We describe the foundations of the SOFIA long-term scheduler, the constraint representation, and the random search based algorithm that generates observation and instrument schedules. Finally, we report on how the new long-term scheduler has been used in operations to date.

Civeit, Thomas↗

SpokeDarts

SpokeDarts software produces sample distributions with blue noise characteristics over arbitrary-dimensional spaces. More generally, spoke darts enable efficient searches and tailored distributions over high dimensional spaces. The software includes underlying geometric routines which are useful in their own right, such as efficient neighbor searches, random points on a sphere, and line-sphere intersections.

Mitchell, Scott A.↗

Optimum search strategy for randomly distributed CW transmitters

The relative probability of detecting randomly distributed CW transmitters as a function of the fraction of the sky which is searched (in a fixed time interval) is given. It is shown that the probability of detecting such a class of transmitters with a given receiving system is a maximum if the entire sky is searched, provided that the receiving system is sufficiently sensitive to detect the nearest transmitter in the allocated time and that the integration time - bandwidth product in a specified direction is greater than 8.

Gulkis, S.↗

Pressure-Induced Enhancement of Thermoelectric Figure of Merit and Structural Phase Transition in TiNiSn

Half-Heusler thermoelectric materials are potential candidates for high thermoelectric efficiency. Here, we report high-pressure thermoelectric and structural property measurements, density functional theory calculations on the half-Heusler material TiNiSn, and an increase of 15% in the relative dimensionless figure of merit, ZT, around 3 GPa. Thermal and electrical properties were measured utilizing a specialized sample cell assembly designed for the Paris–Edinburgh large-volume press to a maximum pressure of 3.5 GPa. High-pressure structural measurements performed up to 50 GPa in a diamond-anvil cell indicated the emergence of a new high-pressure phase around 20 GPa. A first-principles structure search performed using an ab initio random structure search approach identified the high-pressure phase as an orthorhombic type, in good agreement with the experimental results.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Machine learning overcomes human bias in the discovery of self-assembling peptides

Peptide materials have a wide array of functions, from tissue engineering and surface coatings to catalysis and sensing. Tuning the sequence of amino acids that comprise the peptide modulates peptide functionality, but a small increase in sequence length leads to a dramatic increase in the number of peptide candidates. Traditionally, peptide design is guided by human expertise and intuition and typically yields fewer than ten peptides per study, but these approaches are not easily scalable and are susceptible to human bias. Here, in this work, we introduce a machine learning workflow—AI-expert—that combines Monte Carlo tree search and random forest with molecular dynamics simulations to develop a fully autonomous computational search engine to discover peptide sequences with high potential for self-assembly. We demonstrate the efficacy of the AI-expert to efficiently search large spaces of tripeptides and pentapeptides. The predictability of AI-expert performs on par or better than our human experts and suggests several non-intuitive sequences with high self-assembly propensity, outlining its potential to overcome human bias and accelerate peptide discovery.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Meta-RaPS Algorithm for the Aerial Refueling Scheduling Problem

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for each fighter aircraft (job) on multiple tankers (machines). ARSP assumes that jobs have different release times and due dates, The total weighted tardiness is used to evaluate schedule's quality. Therefore, ARSP can be modeled as a parallel machine scheduling with release limes and due dates to minimize the total weighted tardiness. Since ARSP is NP-hard, it will be more appropriate to develop a ppro~imate or heuristic algorithm to obtain solutions in reasonable computation limes. In this paper, Meta-Raps-ATC algorithm is implemented to create high quality solutions. Meta-RaPS (Meta-heuristic for Randomized Priority Search) is a recent and promising meta heuristic that is applied by introducing randomness to a construction heuristic. The Apparent Tardiness Rule (ATC), which is a good rule for scheduling problems with tardiness objective, is used to construct initial solutions which are improved by an exchanging operation. Results are presented for generated instances.

Kaplan, Sezgin↗

Molecular mechanics approach for design and conformational studies of macrocyclic ligands

Computational Chemistry has revolutionized way of viewing molecules at the quantum mechanical scale by allowing simulating various chemical scenarios that are not possible to study in a laboratory. The remarkable applications of computational chemistry have promoted to design and test of the effectiveness of various methods for searching the conformational space of highly flexible molecules. In this context, we conducted a series of optimization and conformational searches on macrocyclic based ligands, 9N3Me5Ox, (1,4,7-tris(5-methyl-8-hydroxyquinoline)-1,4,7-triazacyclononane) and 12N3Me5Ox, (1,5,9-tris(5-methyl-8-hydroxyquinoline)-1,5,9-triazacyclododecane) and studied their selectivity and coordination behavior with some lanthanide metal ions in molecular mechanics and semiempirical methods. The methods include both systematic and random conformational searches for dihedral angles, torsion angles and Cartesian coordinates. Structural studies were carried out by using geometry optimization, coordination scans and electronic properties were evaluated. The results clearly show that chair-boat conformational isomer of 9N3Me5Ox ligand is more stable due to lower eclipsing ethane interaction and form stronger adduct complexes with lanthanide metal ion. This is because of the fact that, in a central unit of 9N3 of the ligand form six endo type bonds out of nine. The rest of bonds have trans conformation. In contrast, for the adduct of 12N3Me5Ox, two C-C bonds have on eclipsed conformation, and others have synclinal and antiperiplanar confirmations. The distortion of the two eclipsed conformations may affect the yields and the stability of the complexes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Synthesis of sodium polyhydrides at high pressures

Archetypal ionic NaH is the only known compound of sodium and hydrogen. Application of high pressure is known to promote states with higher atomic coordination, but extensive searches for polyhydrides with unusual stoichiometry have had only limited success in spite of several theoretical predictions. Here we report the first observation of the formation of polyhydrides of Na (NaH 3 and NaH 7 ) above 40 GPa and 2,000 K. Moreover, we combine synchrotron X-ray diffraction and Raman spectroscopy in a laser-heated diamond anvil cell and theoretical random structure searching, which both agree on the stable structures and compositions. Our results support the formation of multicenter bonding in a material with unusual stoichiometry. These results are applicable to the design of new energetic solids and high-temperature superconductors based on hydrogen-rich materials.

08 HYDROGEN↗

A scalable algorithm for the optimization of neural network architectures

In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.

97 MATHEMATICS AND COMPUTING↗