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 199 records · Page 11

Application of Machine Learning and Data Augmentation Algorithms in the Discovery of Metal Hydrides for Hydrogen Storage

The development of efficient and sustainable hydrogen storage materials is a key challenge for realizing hydrogen as a clean and flexible energy carrier. Among various options, metal hydrides offer high volumetric storage density and operational safety, yet their application is limited by thermodynamic, kinetic, and compositional constraints. In this work, we investigate the potential of machine learning (ML) to predict key thermodynamic properties—equilibrium plateau pressure, enthalpy, and entropy of hydride formation—based solely on alloy composition using Magpie-generated descriptors. We significantly expand an existing experimental dataset from ~400 to 806 entries and assess the impact of dataset size and data augmentation, using the PADRE algorithm, on model performance. Models including Support Vector Machines and Gradient Boosted Random Forests were trained and optimized via grid search and cross-validation. Results show a marked improvement in predictive accuracy with increased dataset size, while data augmentation benefits are limited to smaller datasets and do not improve accuracy in underrepresented pressure regimes. Furthermore, clustering and cross-validation analyses highlight the limited generalizability of models across different material classes, though high accuracy is achieved when training and testing within a single hydride family (e.g., AB2). The study demonstrates the viability and limitations of ML for accelerating hydride discovery, emphasizing the importance of dataset diversity and representation for robust property prediction.

augmentation↗

Test report: Vibration testing of the electron/proton spectrometer structural test unit

The structural test unit of the electron-proton spectrometer was tested to a random vibration spectra and to a sinusoidal resonant search to comply with the requirements of a verification plan for the spectrometer. The test item consisted of mass simulated electronic and printed circuit boards mounted in a flight type electronic housing. The arrangement, center of gravity, and weight were as proposed for flight units.

Vincent, D. L.↗

Statistical dependency in visual scanning

A method to identify statistical dependencies in the positions of eye fixations is developed and applied to eye movement data from subjects who viewed dynamic displays of air traffic and judged future relative position of aircraft. Analysis of approximately 23,000 fixations on points of interest on the display identified statistical dependencies in scanning that were independent of the physical placement of the points of interest. Identification of these dependencies is inconsistent with random-sampling-based theories used to model visual search and information seeking.

Ellis, Stephen R.↗

Iterative repair for scheduling and rescheduling

An iterative repair search method is described called constraint based simulated annealing. Simulated annealing is a hill climbing search technique capable of escaping local minima. The utility of the constraint based framework is shown by comparing search performance with and without the constraint framework on a suite of randomly generated problems. Results are also shown of applying the technique to the NASA Space Shuttle ground processing problem. These experiments show that the search methods scales to complex, real world problems and reflects interesting anytime behavior.

Zweben, Monte↗

Application of multivariable search techniques to structural design optimization

Multivariable optimization techniques are applied to a particular class of minimum weight structural design problems: the design of an axially loaded, pressurized, stiffened cylinder. Minimum weight designs are obtained by a variety of search algorithms: first- and second-order, elemental perturbation, and randomized techniques. An exterior penalty function approach to constrained minimization is employed. Some comparisons are made with solutions obtained by an interior penalty function procedure. In general, it would appear that an interior penalty function approach may not be as well suited to the class of design problems considered as the exterior penalty function approach. It is also shown that a combination of search algorithms will tend to arrive at an extremal design in a more reliable manner than a single algorithm. The effect of incorporating realistic geometrical constraints on stiffener cross-sections is investigated. A limited comparison is made between minimum weight cylinders designed on the basis of a linear stability analysis and cylinders designed on the basis of empirical buckling data. Finally, a technique for locating more than one extremal is demonstrated.

Jones, R. T.↗

A Practical Comparison of Motion Planning Techniques for Robotic Legs in Environments with Obstacles

ATHLETE is a large six-legged tele-operated robot. Each foot is a wheel; travel can be achieved by walking, rolling, or some combination of the two. Operators control ATHLETE by selecting parameterized commands from a command dictionary. While rolling can be done efficiently, any motion involving steps is cumbersome - each step can require multiple commands and take many minutes to complete. In this paper, we consider four different algorithms that generate a sequence of commands to take a step. We consider a baseline heuristic, a randomized motion planning algorithm, and two variants of A* search. Results for a variety of terrains are presented, and we discuss the quantitative and qualitative tradeoffs between the approaches.

Smith, Tristan B.↗

Cover art: Issues in the metric-guided and metric-less placement of random and stochastic template banks

The efficient placement of signal templates in source-parameter space is a crucial requisite for exhaustive matched-filtering searches of modeled gravitational-wave sources, as well as other searches based on more general detection statistics. Unfortunately, the current placement algorithms based on regular parameter-space meshes are difficult to generalize beyond simple signal models with few parameters. Various authors have suggested that a general, flexible, yet efficient alternative can be found in randomized placement strategies such as random placement and stochastic placement, which enhances random placement by selectively rejecting templates that are too close to others. In this article we explore several theoretical and practical issues in randomized placement: the size and performance of the resulting template banks; the very general, purely geometric effects of parameter-space boundaries; the use of quasirandom (self-avoiding) number sequences; most important, the implementation of these algorithms in curved signal manifolds with and without the use of a Riemannian signal metric, which may be difficult to obtain. Specifically, we show how the metric can be replaced with a discrete triangulation-based representation of local geometry. We argue that the broad class of randomized placement algorithms offers a promising answer to many search problems, but that the specific choice of a scheme and its implementation details will still need to be fine-tuned separately for each problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Directional Bias and Pheromone for Discovery and Coverage on Networks

Natural multi-agent systems often rely on “correlated random walks” (random walks that are biased toward a current heading) to distribute their agents over a space (e.g., for foraging, search, etc.). Our contribution involves creation of a new movement and pheromone model that applies the concept of heading bias in random walks to a multi-agent, digital-ants system designed for cyber-security monitoring. We examine the relative performance effects of both pheromone and heading bias on speed of discovery of a target and search-area coverage in a two-dimensional network layout. We found that heading bias was unexpectedly helpful in reducing search time and that it was more influential than pheromone for improving coverage. We conclude that while pheromone is very important for rapid discovery, heading bias can also greatly improve both performance metrics.

Computer Security↗

Derotation of the cosmic microwave background polarization: Full-sky formalism

Mechanisms have been proposed that might rotate the linear polarization of the cosmic microwave background (CMB) as it propagates from the surface of last scatter. In the simplest scenario, the rotation will be uniform across the sky, but the rotation angle may also vary across the sky. We develop in detail the complete set of full-sky quadratic estimators for the rotation of the CMB polarization that can be constructed from the CMB temperature and polarization. We derive the variance with which these estimators can be measured and show that these variances reduce to the simpler flat-sky expressions in the appropriate limit. We evaluate the variances numerically. While the flat-sky formalism may be suitable if the rotation angle arises as a realization of a random field, the full-sky formalism will be required to search for rotations that vary slowly across the sky as well as for models in which the angular power spectrum for the rotation angle peaks at large angles.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal Multi-Agent Search and Rescue Using Potential Field Theory

This paper presents an algorithm for efficient search and rescue using a multi-agent system of vehicles. The algorithm uses an artificial potential field combined with a time-varying reward function for visiting various points within the search area. The reward function is used to weight the attractiveness of these points in the potential field, and collision avoidance terms are used to repel vehicles from each other, which has the additional effect of reducing duplication of searching efforts. The algorithm generates velocity commands in real-time based on communication with the other vehicles. This framework allows vehicles to react in a dynamic environment, which is a significant advantage to simply following a-priori defined trajectories. Simulation results are presented to demonstrate the ability of the algorithm to cover the search area effectively. The algorithm is also compared to an exhaustive lawn-mower search pattern. This comparison is done via a Monte Carlo simulation with randomized target initial conditions and trajectories. The time to find the target improved by 16 and 30% in the mean and median, respectively. Additionally, this paper presents a method for analyzing the upper bound for time to find a target under the potential field guidance algorithm assuming a radially expanding search area.

John R Cooper↗

WE-AB-209-06: Dynamic Collimator Trajectory Algorithm for Use in VMAT Treatment Deliveries

Purpose: To develop advanced dynamic collimator positioning algorithms for optimal beam’s-eye-view (BEV) fitting of targets in VMAT procedures, including multiple metastases stereotactic radiosurgery procedures. Methods: A trajectory algorithm was developed, which can dynamically modify the angle of the collimator as a function of VMAT control point to provide optimized collimation of target volume(s). Central to this algorithm is a concept denoted “whitespace”, defined as area within the jaw-defined BEV field, outside of the PTV, and not shielded by the MLC when fit to the PTV. Calculating whitespace at all collimator angles and every control point, a two-dimensional topographical map depicting the tightness-of-fit of the MLC was generated. A variety of novel searching algorithms identified a number of candidate trajectories of continuous collimator motion. Ranking these candidate trajectories according to their accrued whitespace value produced an optimal solution for navigation of this map. Results: All trajectories were normalized to minimum possible (i.e. calculated without consideration of collimator motion constraints) accrued whitespace. On an acoustic neuroma case, a random walk algorithm generated a trajectory with 151% whitespace; random walk including a mandatory anchor point improved this to 148%; gradient search produced a trajectory with 137%; and bi-directional gradient search generated a trajectory with 130% whitespace. For comparison, a fixed collimator angle of 30° and 330° accumulated 272% and 228% of whitespace, respectively. The algorithm was tested on a clinical case with two metastases (single isocentre) and identified collimator angles that allow for simultaneous irradiation of the PTVs while minimizing normal tissue irradiation. Conclusion: Dynamic collimator trajectories have the potential to improve VMAT deliveries through increased efficiency and reduced normal tissue dose, especially in treatment of multiple cranial metastases, without significant safety concerns that hinder immediate clinical implementation.

60 APPLIED LIFE SCIENCES↗

Stochastic Inversion of Gaussian Random Media Using Transverse Coherence Functions for Reflected Waves: Theory and Method

The transverse coherence functions (TCFs) of phase and amplitude fluctuations of a seismic wave are powerful to estimate the spatial distribution, length scales, and strength of random heterogeneities. However, TCFs have been formulated for transmitted waves only, not for reflected waves. In this paper, we derive reflection TCFs for Gaussian random media. Furthermore, we propose to invert for Gaussian random media using the reflection TCFs based on the grid search. We validate the new reflection TCF formulas using 2D finite-difference numerical experiments. The numerical example also illustrates the feasibility and efficiency of the inversion. The stochastic inversion using reflected waves can be used in both exploration and global seismology.

58 GEOSCIENCES↗

Finding diverse ways to improve algebraic connectivity through multi-start optimization

The algebraic connectivity, also known as the Fiedler value, is a spectral measure of network connectivity that can be increased through edge addition. We present an algorithm for producing many diverse ways to add a fixed number of edges to a network to achieve a near optimal Fiedler value. Previous Fielder value optimization algorithms (i.e. the greedy algorithm) output only one solution. Obtaining a single solution is rarely good enough for real-world network redesign problems, as practical constraints (political, physical or financial) may prevent implementation. Our algorithm takes a multi-start optimization approach, adding a random initial edge and then applies a greedy heuristic to improve the Fiedler value. The random choice moves us to a new region of the search space, enabling discovery of diverse solutions. Additionally, we present a Determinantal Point Process framework for quantifying diversity. We then apply a Markov chain Monte Carlo technique to sift through the large number of output solutions and locate a smaller, more manageable collection of highly diverse solutions that can be presented to network redesign engineers. We demonstrate the effectiveness of our algorithm on real-world graphs with varied structures.

97 MATHEMATICS AND COMPUTING↗

Searches for dark matter subhaloes with wide-field Cherenkov telescope surveys

The presence of substructures in dark matter haloes is an unavoidable consequence of the cold dark matter paradigm. Indirect signals from these objects have been extensively searched for with cosmic rays and {gamma} rays. At first sight, Cherenkov telescopes seem not very well suited for such searches, due to their small fields of view and the random nature of the possible dark matter substructure positions in the sky. However, with long enough exposure and an adequate observation strategy, the very good sensitivity of this experimental technique allows us to constrain particle dark matter models. We confront here the sensitivity map of the HESS experiment built out of their Galactic scan survey to the state-of-the-art cosmological N-body simulation Via Lactea II. We obtain competitive constraints on the annihilation cross section, at the level of 10{sup -24}-10{sup -23} cm{sup 3} s{sup -1}. The results are extrapolated to the future Cherenkov Telescope Array, in the cases of a Galactic plane survey and of an even wider extragalactic survey. In the latter case, it is shown that the sensitivity of the Cherenkov Telescope Array will be sufficient to reach the most natural particle dark matter models.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Controlled evolution of an RNA enzyme

It is generally thought that prior to the origin of protein synthesis, life on earth was based on self-replicating RNA molecules. This idea has become especially popular recently due to the discovery of catalytic RNA (ribozymes). RNA has both genotypic and phenotypic properties, suggesting that it is capable of undergoing Darwinian evolution. RNA evolution is likely to have played a critical role in the early history of life on earth, and thus is important in considering the possibility of life elsewhere in the solar system. We have constructed an RNA-based evolving system in the laboratory, combining amplification and mutation of an RNA genotype with selection of a corresponding RNA phenotype. This system serves as a functional model of a primitive organism. It can also be used as a tool to explore the catalytic potential of RNA. By altering the selection constraints, we are attempting to modify the substrate specificity of an existing ribozyme in order to develop ribozymes with novel catalytic function. In this way, we hope to gain a better understanding of RNA's catalytic versatility and to assess its suitability for the role of primordial catalyst. All of the RNA enzymes that are known to exist in contemporary biology carry out cleavage/ligation reactions involving RNA substrates. The Tetrahymena ribozyme, for example, catalyzes phosphoester transfer between a guanosine containing and an oligopyrimidine containing substrate. We tested the ability of mutant forms of the Tetrahymena ribozyme to carry out a comparable reaction using DNA, rather than RNA substrate. An ensemble of structural variants of the ribozyme was prepared and tested for their ability to specifically cleave d(GGCCCTCT-A3TA3TA) at the phosphodiester bond following the sequence CCCTCT. We recovered a mutant form of the enzyme that cleaves DNA more efficiently than does the wild-type. Beginning with this selected mutant we have now scattered random mutations throughout the ribozyme and have begun an evolutionary search to further expand the catalytic repertoire of RNA.

Joyce, G. F.↗

EVALUATION OF AN EXPERIMENTAL DATA SET TO BE VALIDATION DATA FOR CFD FOR A VHTR

The very high temperature reactor (VHTR) has been chosen as the concept for the next generation nuclear plant (NGNP), supported by the U. S. Department of Energy. There are two basic designs for the VHTR: a prismatic design and a pebble-bed design. In the prismatic design, the coolant (helium) exits the core into a lower plenum as jets. The helium then turns 90° and flows toward the exit duct around cylindrical support posts. Safety analysis by computational fluid dynamics (CFD) is desired to determine the level of mixing of the jets and check for hot spots. Experimental data were taken in a scaled model of a slice of the lower plenum of a prismatic VHTR. Numerical investigations have been made using CFD to determine if the data are suitable for validation. This paper provides the findings of the investigations including results for a modified version of the flow field. The investigations include a determination of the extent of the computational domain needed, the best outlet boundary condition to use, the accuracy of the inlet data, application of several turbulence models and the search for the cause of an instability that causes large random excursions of flow variables. It is found that the inlet data measured by PIV are not sufficiently accurate and that the instability is apparently caused by the presence of the first inlet jet which impinges on a recirculation zone.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The Influence of the Number of Tree Searches on Maximum Likelihood Inference in Phylogenomics

Maximum likelihood (ML) phylogenetic inference is widely used in phylogenomics. As heuristic searches most likely find suboptimal trees, it is recommended to conduct multiple (e.g., 10) tree searches in phylogenetic analyses. However, beyond its positive role, how and to what extent multiple tree searches aid ML phylogenetic inference remains poorly explored. Here, we found that a random starting tree was not as effective as the BioNJ and parsimony starting trees in inferring the ML gene tree and that RAxML-NG and PhyML were less sensitive to different starting trees than IQ-TREE. We then examined the effect of the number of tree searches on ML tree inference with IQ-TREE and RAxML-NG, by running 100 tree searches on 19,414 gene alignments from 15 animal, plant, and fungal phylogenomic datasets. We found that the number of tree searches substantially impacted the recovery of the best-of-100 ML gene tree topology among 100 searches for a given ML program. In addition, all of the concatenation-based trees were topologically identical if the number of tree searches was ≥10. Quartet-based ASTRAL trees inferred from 1 to 80 tree searches differed topologically from those inferred from 100 tree searches for 6/15 phylogenomic datasets. Lastly, our simulations showed that gene alignments with lower difficulty scores had a higher chance of finding the best-of-100 gene tree topology and were more likely to yield the correct trees.

59 BASIC BIOLOGICAL SCIENCES↗