Reconfigurable Compute-In-Memory on Field-Programmable Ferroelectric Diodes
Not Available
77 NANOSCIENCE AND NANOTECHNOLOGY↗
SEARCH · Engineering Papers
Results for “parallel 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.
MTUQ: a framework for estimating moment tensors, point forces, and their uncertainties
SUMMARY We introduce MTUQ, an open-source Python package for seismic source estimation and uncertainty quantification, emphasizing flexibility and operational scalability. MTUQ provides MPI-parallelized grid search and global optimization capabilities, compatibility with 1-D and 3-D Green’s function database formats, customizable data processing, C-accelerated waveform and first-motion polarity misfit functions, and utilities for plotting seismic waveforms and visualizing misfit and likelihood surfaces. Applicability to a range of full- and constrained-moment tensor, point force, and centroid inversion problems is possible via a documented application programming interface, accompanied by example scripts and integration tests. We demonstrate the software using three different types of seismic events: (1) a 2009 intraslab earthquake near Anchorage, Alaska; (2) an episode of the 2021 Barry Arm landslide in Alaska; and (3) the 2017 Democratic People’s Republic of Korea underground nuclear test. With these events, we illustrate the well-known complementary character of body waves, surface waves, and polarities for constraining source parameters. We also convey the distinct misfit patterns that arise from each individual data type, the importance of uncertainty quantification for detecting multimodal or otherwise poorly constrained solutions, and the software’s flexible, modular design.
58 GEOSCIENCES↗
Projected sensitivity of the LUX-ZEPLIN experiment to the $0\nu\beta\beta$ decay of $^{136}Xe$
The LUX-ZEPLIN (LZ) experiment will enable a neutrinoless double β decay search in parallel to the main science goal of discovering dark matter particle interactions. We report the expected LZ sensitivity to Xe136 neutrinoless double β decay, taking advantage of the significant (>600 kg) Xe136 mass contained within the active volume of LZ without isotopic enrichment. After 1000 live-days, the median exclusion sensitivity to the half-life of Xe136 is projected to be 1.06×1026 years (90% confidence level), similar to existing constraints. We also report the expected sensitivity of a possible subsequent dedicated exposure using 90% enrichment with Xe136 at 1.06×1027 years.
72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
Optimized structure and electronic band gap of monolayer GeSe from quantum Monte Carlo methods
Here, we have used highly accurate quantum Monte Carlo methods to determine the chemical structure and electronic band gaps of monolayer GeSe. Two-dimensional (2D) monolayer GeSe has received a great deal of attention due to its unique thermoelectric, electronic, and optoelectronic properties with a wide range of potential applications. Density functional theory (DFT) methods have usually been applied to obtain optical and structural properties of bulk and 2D GeSe. For the monolayer, DFT typically yields a larger band-gap energy than for bulk GeSe but cannot conclusively determine if the monolayer has a direct or indirect gap. Moreover, the DFT-optimized lattice parameters and atomic coordinates for monolayer GeSe depend strongly on the choice of approximation for the exchange-correlation functional, which makes the ideal structure-and its electronic properties-unclear. In order to obtain accurate lattice parameters and atomic coordinates for the monolayer, we use a surrogate Hessian-based parallel line search within diffusion Monte Carlo to fully optimize the GeSe monolayer structure. The DMC-optimized structure is different from those obtained using DFT, as are calculated band gaps. The potential energy surface has a shallow minimum at the optimal structure. This, combined with the sensitivity of the electronic structure to strain, suggests that the optical properties of monolayer GeSe are highly tunable by strain.
36 MATERIALS SCIENCE↗
TensorSearch v1
TensorSearch is a novel parallel similarity search paradigm designed to identify known patterns in high-dimensional tensors.
Dong, Bin↗
Space languages: Solving the classic scheduling problem in Ada and Lisp
The comparison of programming languages is best seen while evaluating similar systems. The strengths and weaknesses of both languages were investigated as the scheduler was being implemented. Some features used in both languages shall be object-oriented paradigms, parallel programming, search and production heuristics, and other classical artificial intelligence implementations.
Davis, Stephen↗
Genetic algorithms
Genetic algorithms are mathematical, highly parallel, adaptive search procedures (i.e., problem solving methods) based loosely on the processes of natural genetics and Darwinian survival of the fittest. Basic genetic algorithms concepts are introduced, genetic algorithm applications are introduced, and results are presented from a project to develop a software tool that will enable the widespread use of genetic algorithm technology.
Wang, Lui↗
Improved interpretation of satellite altimeter data using genetic algorithms
Genetic algorithms (GA) are optimization techniques that are based on the mechanics of evolution and natural selection. They take advantage of the power of cumulative selection, in which successive incremental improvements in a solution structure become the basis for continued development. A GA is an iterative procedure that maintains a 'population' of 'organisms' (candidate solutions). Through successive 'generations' (iterations) the population as a whole improves in simulation of Darwin's 'survival of the fittest'. GA's have been shown to be successful where noise significantly reduces the ability of other search techniques to work effectively. Satellite altimetry provides useful information about oceanographic phenomena. It provides rapid global coverage of the oceans and is not as severely hampered by cloud cover as infrared imagery. Despite these and other benefits, several factors lead to significant difficulty in interpretation. The GA approach to the improved interpretation of satellite data involves the representation of the ocean surface model as a string of parameters or coefficients from the model. The GA searches in parallel, a population of such representations (organisms) to obtain the individual that is best suited to 'survive', that is, the fittest as measured with respect to some 'fitness' function. The fittest organism is the one that best represents the ocean surface model with respect to the altimeter data.
Messa, Kenneth↗
Problem solving with genetic algorithms and Splicer
Genetic algorithms are highly parallel, adaptive search procedures (i.e., problem-solving methods) loosely based on the processes of population genetics and Darwinian survival of the fittest. Genetic algorithms have proven useful in domains where other optimization techniques perform poorly. The main purpose of the paper is to discuss a NASA-sponsored software development project to develop a general-purpose tool for using genetic algorithms. The tool, called Splicer, can be used to solve a wide variety of optimization problems and is currently available from NASA and COSMIC. This discussion is preceded by an introduction to basic genetic algorithm concepts and a discussion of genetic algorithm applications.
Bayer, Steven E.↗
Recursive Branching Simulated Annealing Algorithm
This innovation is a variation of a simulated-annealing optimization algorithm that uses a recursive-branching structure to parallelize the search of a parameter space for the globally optimal solution to an objective. The algorithm has been demonstrated to be more effective at searching a parameter space than traditional simulated-annealing methods for a particular problem of interest, and it can readily be applied to a wide variety of optimization problems, including those with a parameter space having both discrete-value parameters (combinatorial) and continuous-variable parameters. It can take the place of a conventional simulated- annealing, Monte-Carlo, or random- walk algorithm. In a conventional simulated-annealing (SA) algorithm, a starting configuration is randomly selected within the parameter space. The algorithm randomly selects another configuration from the parameter space and evaluates the objective function for that configuration. If the objective function value is better than the previous value, the new configuration is adopted as the new point of interest in the parameter space. If the objective function value is worse than the previous value, the new configuration may be adopted, with a probability determined by a temperature parameter, used in analogy to annealing in metals. As the optimization continues, the region of the parameter space from which new configurations can be selected shrinks, and in conjunction with lowering the annealing temperature (and thus lowering the probability for adopting configurations in parameter space with worse objective functions), the algorithm can converge on the globally optimal configuration. The Recursive Branching Simulated Annealing (RBSA) algorithm shares some features with the SA algorithm, notably including the basic principles that a starting configuration is randomly selected from within the parameter space, the algorithm tests other configurations with the goal of finding the globally optimal solution, and the region from which new configurations can be selected shrinks as the search continues. The key difference between these algorithms is that in the SA algorithm, a single path, or trajectory, is taken in parameter space, from the starting point to the globally optimal solution, while in the RBSA algorithm, many trajectories are taken; by exploring multiple regions of the parameter space simultaneously, the algorithm has been shown to converge on the globally optimal solution about an order of magnitude faster than when using conventional algorithms. Novel features of the RBSA algorithm include: 1. More efficient searching of the parameter space due to the branching structure, in which multiple random configurations are generated and multiple promising regions of the parameter space are explored; 2. The implementation of a trust region for each parameter in the parameter space, which provides a natural way of enforcing upper- and lower-bound constraints on the parameters; and 3. The optional use of a constrained gradient- search optimization, performed on the continuous variables around each branch s configuration in parameter space to improve search efficiency by allowing for fast fine-tuning of the continuous variables within the trust region at that configuration point.
Bolcar, Matthew↗
An Integrated High-performance Computing and Digital Real-time Simulation Testbed to Benchmark Closed-loop Load Shedding Algorithms in Power Systems
An integrated testbed using digital real-time simulator (DRTS) and a high-performance computing (HPC) cluster is presented here to compare speed and performance of computational schemes to mitigate time-critical issues in electric power systems. The first approach in this testbed validation is taken by running a set of closed-loop load shedding algorithms to compare and contrast two paradigms of arresting cascading failure propagation. Two algorithms involve solving DC and AC power flow model-based optimization problems to compute load shedding at different buses, while a model-based stochastic search using parallel computing provides a viable alternative. The algorithms are implemented in the DRTS-HPC testbed for the IEEE 14-bus benchmark transmission system. As a proof of the concept, simulation results are presented for implementation of closed-loop load-shedding algorithms for cascading failures in the DRTS-HPC testbed
24 POWER TRANSMISSION AND DISTRIBUTION↗
RLGBS: Reinforcement Learning-Guided Beam Search for process optimization in a paper machine dryer section
Paper drying is responsible for over two-thirds of energy consumption in the U.S. pulp and paper industry, presenting significant potential for energy savings through optimization of process parameters. Current approaches often assume fixed operating conditions, neglecting dynamic ambient and process variations that limit achievable savings and real-world applicability. To this end, we develop a physics-based simulation environment for a paper machine dryer section and propose a reinforcement learning (RL) framework to minimize overall energy consumption by optimizing drying process parameters under diverse operating conditions. To mitigate overdrying and numerical instabilities caused by suboptimal local RL actions, we introduce Reinforcement Learning-Guided Beam Search (RLGBS), which explores multiple action sequences in parallel using beam search. Instead of making step-by-step decisions, RLGBS prioritizes solutions based on cumulative probability, reducing the impact of individual suboptimal actions. Experiments demonstrate that RLGBS achieves consistent energy savings under unseen operating conditions not encountered during training, outperforming conventional RL methods. While validated in drying optimization, this framework is broadly applicable to other RL-based industrial process control problems.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
Parallelizing autotuning for HPC applications: Unveiling the potential of the speculation strategy in Bayesian optimization
In the exascale computing era, tuning High-Performance Computing (HPC) applications has become a significant computational challenge. Although Bayesian optimization (BO) has emerged as a promising tool for HPC performance tuning, the BO workflow is inherently sequential (i.e., one function evaluation at a time) and cannot leverage the huge amount of parallel resources present in modern supercomputers, resulting in a considerable underutilization of their computational capabilities. This paper explores the trade-off between search quality and parallelism in BO, investigating a diverse set of methods. Building upon both previous approaches from the literature and novel methodologies introduced in this work, our study provides a deep analysis to accelerate BO performance tuning. By examining a set of synthetic functions and practical HPC applications, our exploration analyzes the interaction among various BO methods for parallelization, the quantity of parallel resources, the runtime distribution of target HPC applications, and the costs associated with different search orchestration mechanisms that have been overlooked in previous studies. Compared to sequential BO, our novel methodology achieves comparable quality while demonstrating robust scalability in search time as the amount of parallel resources increases; it also outperforms a state-of-the-art tuner, which supports parallelization, achieving up to 3.67x faster search time. We provide high-value insights for practitioners seeking to leverage the power of parallel computing for efficient HPC application tuning. Additionally, to further assist researchers in accelerating the performance tuning of their HPC applications, we provide an extension of an existing open-source tuning framework that incorporates our methods.
Bayesian optimization↗
Gravitational Waves: Search Results, Data Analysis and Parameter Estimation. Amaldi 10 Parallel Session C2
The Amaldi 10 Parallel Session C2 on gravitational wave(GW) search results, data analysis and parameter estimation included three lively sessions of lectures by 13 presenters, and 34 posters. The talks and posters covered a huge range of material, including results and analysis techniques for ground-based GW detectors, targeting anticipated signals from different astrophysical sources: compact binary inspiral, merger and ringdown; GW bursts from intermediate mass binary black hole mergers, cosmic string cusps, core-collapse supernovae, and other unmodeled sources; continuous waves from spinning neutron stars; and a stochastic GW background. There was considerable emphasis on Bayesian techniques for estimating the parameters of coalescing compact binary systems from the gravitational waveforms extracted from the data from the advanced detector network. This included methods to distinguish deviations of the signals from what is expected in the context of General Relativity.
Tests of general relativity↗
Search for auroral belt E-parallel fields with high-velocity barium ion injections
In April 1984, four high-velocity shaped-charge Ba(+) injections were conducted from two sounding rockets at 770-975 km over northern Alaska under conditions of active auroral and magnetic disturbance. Spatial ionization (brightness) profiles of high-velocity Ba(+) clouds from photometric scans following each release were found to be consistent with the 28-sec theoretical time constant for Ba photoionization determined by Carlsten (1975). These observations therefore revealed no evidence of anomalous fast ionization predicted by the Alfven critical velocity hypothesis.
Heppner, J. P.↗
Optimization on a Network-based Parallel Computer System for Supersonic Laminar Wing Design
A set of Computational Fluid Dynamics (CFD) routines and flow transition prediction tools are integrated into a network based parallel numerical optimization routine. Through this optimization routine, the design of a 2-D airfoil and an infinitely swept wing will be studied in order to advance the design cycle capability of supersonic laminar flow wings. The goal of advancing supersonic laminar flow wing design is achieved by wisely choosing the design variables used in the optimization routine. The design variables are represented by the theory of Fourier series and potential theory. These theories, combined with the parallel CFD flow routines and flow transition prediction tools, provide a design space for a global optimal point to be searched. Finally, the parallel optimization routine enables gradient evaluations to be performed in a fast and parallel fashion.
Garcia, Joseph A.↗
Oceanic transform earthquakes with unusual mechanisms or locations - Relation to fault geometry and state of stress in the adjacent lithosphere
Results are presented of a search for transform earthquakes departing from the pattern whereby they occur on the principal transform displacement zone (PTDZ) and have strike-slip mechanisms consistent with transform-parallel motion. The search was conducted on the basis of source mechanisms and locations taken from the Harvard centroid moment tensor catalog and the bulletin of the International Seismological Center. The source mechanisms and centroid depths of 10 such earthquakes on the St. Paul's, Marathon, Owen, Heezen, Tharp, Menard, and Rivera transforms are determined from inversions of long-period body waveforms. Much of the anomalous earthquake activity on oceanic transforms is associated with complexities in the geometry of the PTDZ or the presence of large structural features that may influence slip on the fault.
Wolfe, Cecily J.↗
Optimization technique for problems with an inequality constraint
General technique uses a modified version of an existing technique termed the pattern search technique. New procedure called the parallel move strategy permits pattern search technique to be used with problems involving a constraint.
Russell, K. J.↗