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 181 records · Page 10

SPIN or LURCH : a Comparative Assessment of Model Checking and Stochastic Search for Temporal Properties in Procedural Code

The difficulty of how to test large systems, such as the one on board a NASA robotic remote explorer (RRE) vehicle, is fundamentally a search issue: the global state space representing all possible has yet to be solved, even after many decades of work. Randomized algorithms have been known to outperform their deterministic counterparts for search problems representing a wide range of applications. In the case study presented here, the LURCH randomized algorithm proved to be adequate to the task of testing a NASA RRE vehicle. LURCH found all the errors found by an earlier analysis of a more complete method (SPIN). Our empirical results are that LURCH can scale to much larger models than standard model checkers like SMV and SPIN. Further, the LURCH analysis was simpler than the SPIN analysis. The simplicity and scalability of LURCH are two compelling reasons for experimenting further with this tool.

verification↗

Random template banks and relaxed lattice coverings

Template-based searches for gravitational waves are often limited by the computational cost associated with searching large parameter spaces. The study of efficient template banks, in the sense of using the smallest number of templates, is therefore of great practical interest. The traditional approach to template-bank construction requires every point in parameter space to be covered by at least one template, which rapidly becomes inefficient at higher dimensions. Here we study an alternative approach, where any point in parameter space is covered only with a given probability {eta}<1. We find that by giving up complete coverage in this way, large reductions in the number of templates are possible, especially at higher dimensions. The prime examples studied here are random template banks in which templates are placed randomly with uniform probability over the parameter space. In addition to its obvious simplicity, this method turns out to be surprisingly efficient. We analyze the statistical properties of such random template banks, and compare their efficiency to traditional lattice coverings. We further study relaxed lattice coverings (using Z{sub n} and A{sub n}* lattices), which similarly cover any signal location only with probability {eta}. The relaxed A{sub n}* lattice is found to yield the most efficient template banks at low dimensions (n < or approx. 10), while random template banks increasingly outperform any other method at higher dimensions.

79 ASTRONOMY AND ASTROPHYSICS↗

Who Benefits From Adjuvant Radiation Therapy for Gastric Cancer? A Meta-Analysis

Purpose: Large randomized trials have demonstrated significant survival benefits with the use of adjuvant chemotherapy or chemoradiation therapy for gastric cancer. The importance of adjuvant radiation therapy (RT) remains unclear. We performed an up-to-date meta-analysis of randomized trials testing the use of RT for resectable gastric cancer. Methods and Materials: We searched MEDLINE, EMBASE, and the Cochrane Central Register of Controlled Trials for randomized trials testing adjuvant (including neoadjuvant) RT for resectable gastric cancer. Hazard ratios describing the impact of adjuvant RT on overall survival (OS) and disease-free survival (DFS) were extracted directly from the original studies or calculated from survival curves. Pooled estimates were obtained using the inverse variance method. Subgroup analyses were performed to determine whether the efficacy of RT varies with chemotherapy use, RT timing, geographic region, type of nodal dissection performed, or lymph node status. Results: Thirteen studies met all inclusion criteria and were used for this analysis. Adjuvant RT was associated with a significant improvement in both OS (HR = 0.78, 95% CI: 0.70-0.86, P<.001) and DFS (HR = 0.71, 95% CI: 0.63-0.80, P<.001). In the 5 studies that tested adjuvant chemoradiation therapy against adjuvant chemotherapy, similar effects were seen for OS (HR = 0.83, 95% CI: 0.67-1.03, P=.087) and DFS (HR = 0.77, 95% CI: 0.91-0.65, P=.002). Available data did not reveal any subgroup of patients that does not benefit from adjuvant RT. Conclusion: In randomized trials for resectable gastric cancer, adjuvant RT provides an approximately 20% improvement in both DFS and OS. Available data do not reveal a subgroup of patients that does not benefit from adjuvant RT. Further study is required to optimize the implementation of adjuvant RT for gastric cancer with regard to patient selection and integration with systemic therapy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

An investigation of irreproducibility in maximum likelihood phylogenetic inference

Phylogenetic trees are essential for studying biology, but their reproducibility under identical parameter settings remains unexplored. Here, we find that 3515 (18.11%) IQ-TREE-inferred and 1813 (9.34%) RAxML-NG-inferred maximum likelihood (ML) gene trees are topologically irreproducible when executing two replicates (Run1 and Run2) for each of 19,414 gene alignments in 15 animal, plant, and fungal phylogenomic datasets. Notably, coalescent-based ASTRAL species phylogenies inferred from Run1 and Run2 sets of individual gene trees are topologically irreproducible for 9/15 phylogenomic datasets, whereas concatenation-based phylogenies inferred twice from the same supermatrix are reproducible. Our simulations further show that irreproducible phylogenies are more likely to be incorrect than reproducible phylogenies. These results suggest that a considerable fraction of single-gene ML trees may be irreproducible. Increasing reproducibility in ML inference will benefit from providing analyses’ log files, which contain typically reported parameters (e.g., program, substitution model, number of tree searches) but also typically unreported ones (e.g., random starting seed number, number of threads, processor type).

59 BASIC BIOLOGICAL SCIENCES↗

DISCOVERY OF A LARGE-SCALE GALAXY FILAMENT NEAR A CANDIDATE INTERGALACTIC X-RAY ABSORPTION SYSTEM

We present an analysis of the large-scale galaxy distribution around two possible warm-hot intergalactic medium (WHIM) absorption systems reported along the Markarian 421 sight line. Using the Sloan Digital Sky Survey (SDSS), we find a prominent galaxy filament at the redshift of the z = 0.027 X-ray absorption line system. The filament exhibits a width of 3.2 Mpc and a length of at least 20 Mpc, comparable to the size of WHIM filaments seen in cosmological simulations. No individual galaxies fall within 350 projected kpc so it is unlikely that the absorption is associated with gas in a galaxy halo or outflow. Another, lower-significance X-ray absorption system was reported in the same Chandra spectrum at z = 0.011, but the large-scale structure in its vicinity is far weaker and may be a spurious alignment. By searching for similar galaxy structures in 140 random smoothed SDSS fields, we estimate an {approx}5%-10% probability of the z = 0.027 absorber-filament alignment occurring by chance. If these two systems are indeed physically associated, this would represent the first known coincidence between a large-scale galaxy structure and a blind X-ray WHIM detection.

79 ASTRONOMY AND ASTROPHYSICS↗

CMB low multipole alignments across WMAP and Planck data releases

ABSTRACT The first observations of the cosmic microwave background (CMB) from NASA's Wilkinson Microwave Anisotropy Probe (WMAP) led to finding ‘alignment’ anomalies not expected from fluctuations in the isotropic cosmological model. We study the data of all 8 full-sky public releases since then to test for anomalous alignments and shapes of the first 60 multipoles, i.e. over the range $2\le l \le 61$. We use rotationally invariant and covariant statistics to test isotropy of all subsequent WMAP data releases, along with those from the ESA’s Planck mission. Anomalous alignments among the multipoles $l=1, 2, 3$ are very consistent and robust. More alignments are detected, some of them new, while significance is diluted by the large range of the search. Power entropy, a measure of the randomness of the multipoles, is consistently anomalous at about $2\sigma$ level or better across all data releases. It appears that the CMB is not as random as the cosmological principle predicts on large angular scales.

Patel, Sanjeet Kumar↗

Performance Portability of Molecular Docking Miniapp On Leadership Computing Platforms

Rapidly changing computer architectures, such as those found at high-performance computing (HPC) facilities, present the need for mini-applications (miniapps) that capture essential algorithms used in large applications to test program performance and portability, aiding transitions to new systems. The COVID-19 pandemic has fueled a flurry of activity in computational drug discovery, including the use of supercomputers and GPU acceleration for massive virtual screens for therapeutics. Recent work targeting COVID-19 at the Oak Ridge Leadership Computing Facility (OLCF) used the GPU-accelerated program AutoDock-GPU to screen billions of compounds on the Summit supercomputer. In this paper we present the development of a new miniapp, miniAutoDock-GPU, that can be used to evaluate the performance and portability of GPU-accelerated protein-ligand docking programs on different computer architectures. These tests are especially relevant as facilities transition from petascale systems and prepare for upcoming exascale systems that will use a variety of GPU vendors. The key calculations, namely, the Lamarckian genetic algorithm combined with a local search using a Solis-Wets based random optimization algorithm, are implemented. We developed versions of the miniapp using several different programming models for GPU acceleration, including a version using the CUDA runtime API for NVIDIA GPUs, and the Kokkos middle-ware API which is facilitated by C++ template libraries. A third version, currently in progress, uses the HIP programming model. These efforts will help facilitate the transition to exascale systems for this important emerging HPC application, as well as its use on a wide range of heterogeneous platforms.

Thavappiragasam, Mathialakan↗

TETA Autoresearch [SWR-26-089]

TETA Autoresearch is a template repository based on github.com/karpathy/autoresearch for AI-assisted research science in the TETA group in the Center for Integrated Mobility Sciences (CIMS) center at the National Laboratory of the Rockies. This software is a template for running autonomous research experiments that iteratively improve an ML model for a single optimization objective. Two execution modes share one harness: LLM mode - an agent (e.g. Claude Code) edits a scaffold train.py one change at a time, tagging each experiment, logging reasoning, and pushing results. Defined by program.md. Optimizer mode - an Optuna-backed driver (TPE / CMA-ES / Random) iterates over a domain-defined search space. Defined by optimizers/. RouteE (vehicle energy prediction) is the reference domain under domains/routee/. Adding a new domain is mechanical - see EXTENDING.md.

Reinicke, Nicholas [National Laboratory of the Roc↗

Rapid and Robust Cross-Correlation-Based Seismic Signal Identification Using an Approximate Nearest Neighbor Method

The matched filtering technique that uses the cross correlation of a waveform of interest with archived signals from a template library has proven to be a powerful tool for detecting events in regions with repeating seismicity. However, waveform correlation is computationally expensive and therefore impractical for large template sets unless dedicated distributed computing hardware and software are used. In this paper, we introduce an approximate nearest neighbor (ANN) approach that enables the use of very large template libraries for waveform correlation. Our method begins with a projection into a reduced dimensionality space, based on correlation with a randomized subset of the full template archive. Searching for a specified number of nearest neighbors for a query waveform is accomplished by iteratively comparing it with the neighbors of its immediate neighbors. We used the approach to search for matches to each of ~2300 analyst-reviewed signal detections reported in May 2010 for the International Monitoring System station MKAR. The template library in this case consists of a data set of more than 200,000 analyst-reviewed signal detections for the same station from February 2002 to July 2016 (excluding May 2010). Of these signal detections, 73% are teleseismic first P and 17% regional phases (Pn, Pg, Sn, and Lg). Finally, the analyses performed on a standard desktop computer show that the proposed ANN approach performs a search of the large template libraries about 25 times faster than the standard full linear search and achieves recall rates greater than 80%, with the recall rate increasing for higher correlation thresholds.

58 GEOSCIENCES↗

Exact and Approximate Probabilistic Symbolic Execution

Probabilistic software analysis seeks to quantify the likelihood of reaching a target event under uncertain environments. Recent approaches compute probabilities of execution paths using symbolic execution, but do not support nondeterminism. Nondeterminism arises naturally when no suitable probabilistic model can capture a program behavior, e.g., for multithreading or distributed systems. In this work, we propose a technique, based on symbolic execution, to synthesize schedulers that resolve nondeterminism to maximize the probability of reaching a target event. To scale to large systems, we also introduce approximate algorithms to search for good schedulers, speeding up established random sampling and reinforcement learning results through the quantification of path probabilities based on symbolic execution. We implemented the techniques in Symbolic PathFinder and evaluated them on nondeterministic Java programs. We show that our algorithms significantly improve upon a state-of- the-art statistical model checking algorithm, originally developed for Markov Decision Processes.

Symbolic Execution↗

Planning Bias: Planning as a Source of Sampling Bias

Many data-driven planning methods are trained on data generated by planners. It is well known that many statistical learning methods are sensitive to sampling bias, and yet there has been little or no attention to planning as a sampling method and its role in introducing sampling bias into planner-generated training data. Recently, it has been demonstrated that A**,* in the presence of problems with variable heuristic error, prefers some solutions over other equally cost-optimal solutions. But, as we discuss in this paper, mitigation may not be as simple as resolving arbitrary tie-breaking by sampling from ties uniformly at random. In this paper, we formalize an intuition of planning bias. We focus on problems which output a single solution. Diverse planning only complicates the problem by generalizing it to bias in the set of sets; we show how it is subject to bias in the single solution. We make some useful observations about deterministic algorithms in contrast to non-deterministic algorithms. We explain how information entropy may be a good way to measure planning bias, and discuss some issues in evaluating practical approaches to measurement. We address the intuition that uniform random tiebreaking should mitigate bias; and sketch a novel approach to constructing an appropriate random distribution for duplicate detection during forward search for unbiased A*. Finally, we suggest directions for future work.

Planning Scheduling Algorithms↗

Initialization and Restart in Stochastic Local Search: Computing a Most Probable Explanation in Bayesian Networks

For hard computational problems, stochastic local search has proven to be a competitive approach to finding optimal or approximately optimal problem solutions. Two key research questions for stochastic local search algorithms are: Which algorithms are effective for initialization? When should the search process be restarted? In the present work we investigate these research questions in the context of approximate computation of most probable explanations (MPEs) in Bayesian networks (BNs). We introduce a novel approach, based on the Viterbi algorithm, to explanation initialization in BNs. While the Viterbi algorithm works on sequences and trees, our approach works on BNs with arbitrary topologies. We also give a novel formalization of stochastic local search, with focus on initialization and restart, using probability theory and mixture models. Experimentally, we apply our methods to the problem of MPE computation, using a stochastic local search algorithm known as Stochastic Greedy Search. By carefully optimizing both initialization and restart, we reduce the MPE search time for application BNs by several orders of magnitude compared to using uniform at random initialization without restart. On several BNs from applications, the performance of Stochastic Greedy Search is competitive with clique tree clustering, a state-of-the-art exact algorithm used for MPE computation in BNs.

Mengshoel, Ole J.↗

THE SPECTRAL ENERGY DISTRIBUTIONS OF WHITE DWARFS IN 47 Tucanae: THE DISTANCE TO THE CLUSTER

We present a new distance determination to the Galactic globular cluster 47 Tucanae by fitting the spectral energy distributions of its white dwarfs (WDs) to pure hydrogen atmosphere WD models. Our photometric data set is obtained from a 121-orbit Hubble Space Telescope program using the Wide Field Camera 3 UVIS/IR channels, capturing F390W, F606W, F110W, and F160W images. These images cover more than 60 arcmin{sup 2} and extend over a radial range of 5-13.7 arcmin (6.5-17.9 pc) within the globular cluster. Using a likelihood analysis, we obtain a best-fitting unreddened distance modulus of (m - M){sub o} = 13.36 {+-} 0.02 {+-} 0.06 corresponding to a distance of 4.69 {+-} 0.04 {+-} 0.13 kpc, where the first error is random and the second is systematic. We also search the WD photometry for infrared excess in the F160W filter, indicative of low-mass companions, and find no convincing cases within our sample.

79 ASTRONOMY AND ASTROPHYSICS↗

The advanced OPLE for search and rescue

Recent technological advances have made it possible to develop an advanced OMEGA position location experiment for a global search and rescue application. This application generated some new problem areas such as the OMEGA lane ambiguity, random access, location accuracy, real time processing, and size and weight of the Search and Rescue Communication (SARCOM). This experiment will demonstrate the feasibility of instantaneous alarm and position location by using a relatively inexpensive, battery operated, three-pound package. This package can transmit the alarm and position through a synchronous satellite to a search and rescue station in less than three minutes.

Morakis, J. C.↗

The Global Rescue Alarm Net (GRAN) experiment

The OMEGA Position Location Experiment (OPLE) was performed in 1967 by the Goddard Space Flight Center in order to demonstrate a position location and data collection system. OMEGA navigation signals were received at a remote site and retransmitted via a synchronous satellite to a ground processing center where data collecting and position determination were performed. Recent technological advances have made it possible to develop an Advanced OPLE System towards a global search and rescue application. This application generated some new problem areas such as the OMEGA lane ambiguity, random access, location accuracy, real-time processing, and size and weight of the Search and Rescue Communications (SARCOM). This experiment demonstrates the feasibility of instantaneous alarm and position location by using a relatively inexpensive, battery operated, three-pound package.

Morakis, J. C.↗

Collision-free poisson motion planning in ultra high-dimensional molecular conformation spaces

The function of protein, RNA, and DNA is modulated by fast, dynamic exchanges between three-dimensional conformations. Conformational sampling of biomolecules with exact and nullspace inverse kinematics, using rotatable bonds as revolute joints and noncovalent interactions as holonomic constraints, can accurately characterize these native ensembles. However, sampling biomolecules remains challenging owing to their ultra-high dimensional configuration spaces, and the requirement to avoid (self-) collisions, which results in low acceptance rates. In this paper, we present two novel mechanisms to overcome these limitations. First, we introduce temporary constraints between near-colliding links. The resulting constraint varieties instantaneously redirect the search for collision-free conformations, and couple motions between distant parts of the linkage. Second, we adapt a randomized Poisson-disk motion planner, which prevents local oversampling and widens the search, to ultra-high dimensions. Tests on several model systems show that the sampling acceptance rate can increase from 16% to 70%, and that the conformational coverage in loop modeling measured as average closeness to existing loop conformations doubled. Finally, correlated protein motions identified with our algorithm agree with those from MD simulations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Speed vs Accuracy: Effect on Ligand Pose Accuracy of Varying Box Size and Exhaustiveness in AutoDock Vina

Abstract Structure‐based virtual high‐throughput screening involves docking chemical libraries to targets of interest. A parameter pertinent to the accuracy of the resulting pose is the root mean square deviation (RMSD) from a known crystallographic structure, i. e., the ‘docking power’. Here, using a popular algorithm, Autodock Vina, as a model program, we evaluate the effects of varying two common docking parameters: the box size (the size of docking search space) and the exhaustiveness of the global search (the number of independent runs starting from random ligand conformations) on the RMSD from the PDBbind v2017 refined dataset of experimental protein‐ligand complexes. Although it is clear that exhaustiveness is an important parameter, there is wide variation in the values used, with variation between 1 and >100. We, therefore, evaluated a combination of cubic boxes of different sizes and five exhaustiveness values (1, 8, 25, 50, 75, 100) within the range of those commonly adopted. The results show that the default exhaustiveness value of 8 performs well overall for most box sizes. In contrast, for all box sizes, but particularly for large boxes, an exhaustiveness value of 1 led to significantly higher median RMSD (mRMSD) values. The docking power was slightly improved with an exhaustiveness of 25, but the mRMSD changes little with values higher than 25. Therefore, although low exhaustiveness is computationally faster, the results are more likely to be far from reality, and, conversely, values >25 led to little improvement at the expense of computational resources. Overall, we recommend users to use at least the default exhaustiveness value of 8 for virtual screening calculations.

Agarwal, Rupesh↗

Evaluating the Effectiveness of an Ultrasonic Acoustic Deterrent for Reducing Bat Fatalities at Wind Turbines

Large numbers of bats are killed by wind turbines worldwide and minimizing fatalities is critically important to bat conservation and acceptance of wind energy development. We implemented a 2-year study testing the effectiveness of an ultrasonic acoustic deterrent for reducing bat fatalities at a wind energy facility in Pennsylvania. We randomly selected control and treatment turbines that were searched daily in summer and fall 2009 and 2010. Estimates of fatality, corrected for field biases, were compared between treatment and control turbines. In 2009, we estimated 21–51% fewer bats were killed per treatment turbine than per control turbine. In 2010, we determined an approximate 9% inherent difference between treatment and control turbines and when factored into our analysis, variation increased and between 2% more and 64% fewer bats were killed per treatment turbine relative to control turbines. We estimated twice as many hoary bats were killed per control turbine than treatment turbine, and nearly twice as many silver-haired bats in 2009. In 2010, although we estimated nearly twice as many hoary bats and nearly 4 times as many silver-haired bats killed per control turbine than at treatment turbines during the treatment period, these only represented an approximate 20% increase in fatality relative to the pre-treatment period for these species when accounting for inherent differences between turbine sets. Our findings suggest broadband ultrasound broadcasts may reduce bat fatalities by discouraging bats from approaching sound sources. However, effectiveness of ultrasonic deterrents is limited by distance and area ultrasound can be broadcast, in part due to rapid attenuation in humid conditions. We caution that an operational deterrent device is not yet available and further modifications and experimentation are needed. Future efforts must also evaluate cost-effectiveness of deterrents in relation to curtailment strategies to allow a cost-benefit analysis for mitigating bat fatalities.

60 APPLIED LIFE SCIENCES↗