Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic”

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 1,243 records · Page 69
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Variational quantum algorithm for estimating the quantum Fisher information

The quantum Fisher information (QFI) quantifies the ultimate precision of estimating a parameter from a quantum state and can be regarded as a reliability measure of a quantum system as a quantum sensor. However, estimation of the QFI for a mixed state is in general a computationally demanding task. In this paper we present a variational quantum algorithm called variational quantum Fisher information estimation (VQFIE) to address this task. By estimating lower and upper bounds on the QFI, based on bounding the fidelity, VQFIE outputs a range in which the actual QFI lies. This result can then be used to variationally prepare the state that maximizes the QFI, for the application of quantum sensing. In contrast to previous approaches, VQFIE does not require knowledge of the explicit form of the sensor dynamics. We simulate the algorithm for a magnetometry setup and demonstrate the tightening of our bounds as the state purity increases. For this example, we compare our bounds with literature bounds and show that our bounds are tighter.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2019

Graph Algorithms in PGAS: Chapel and UPC++

The Partitioned Global Address Space (PGAS) programming model can be implemented «««< HEAD either with programming language features or with runtime library APIs, each implementation favoring different aspects (e.g., productivity, abstraction, flexibility, or performance). Certain language and runtime features, such as collectives, explicit and asynchronous communication primitives, and constructs facilitating overlap of communication and computation (such as futures and conjoined futures) can enable better performance and scaling for irregular applications, in particular for distributed graph analytics. We compare graph algorithms in one of each of these environments: the Chapel PGAS programming language and the UPC++ PGAS runtime library. We implement algorithms for breadth-first search and triangle counting graph kernels in both environments. We discuss the code in each of the environments, and compile performance data on a Cray Aries and an Infiniband platform. Our results show that the library-based approach of UPC++ currently provides strong performance while Chapel provides a high-level abstraction that, harder to optimize, still provides comparable performance. We argue that various language primitives and runtime library features should be considered in conjunction with each other to design future graph analytics libraries so as to incorporate the best of both worlds.

Distributed Algorithms, Graph algorithms, HPC↗
DOE OSTI2022

Avoiding excess computation in asynchronous evolutionary algorithms

Abstract Asynchronous evolutionary algorithms are becoming increasingly popular as a means of making full use of many processors while solving computationally expensive search and optimization problems. These algorithms excel at keeping large clusters fully utilized, but may sometimes inefficiently sample an excess of fast‐evaluating solutions at the expense of higher‐quality, slow‐evaluating ones. We have previously introduced a steady‐state parent selection strategy, SWEET (“Selection whilE EvaluaTing”), that sometimes selects individuals that are still being evaluated and allows them to reproduce early. We perform a takeover‐time analysis that confirms that this strategy gives slow‐evaluating individuals that have higher fitnesses an increased ability to multiply in the population. We also find that SWEET appears effective at improving optimization performance on problems in which solution quality is positively correlated with evaluation time. We evaluate our approach on six simulated real‐valued optimization problems and three real‐world applications: an autonomous vehicle controller problem that involves tuning a spiking neural network and two adversarial EA problems. We further evaluate SWEET versus a basic asynchronous process in a simulated setting. We present evidence that SWEET outperforms basic asynchronous processes in a use‐case in which performance is positively correlated with evaluation time, and performs comparably (and often better) than basic asynchronous processes in several use‐cases where performance is negatively correlated with evaluation time. That said, in the cases where performance and evaluation time are negatively correlated the variance of outcomes for SWEET is notably high.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

OperonSEQer: A set of machine-learning algorithms with threshold voting for detection of operon pairs using short-read RNA-sequencing data

Operon prediction in prokaryotes is critical not only for understanding the regulation of endogenous gene expression, but also for exogenous targeting of genes using newly developed tools such as CRISPR-based gene modulation. A number of methods have used transcriptomics data to predict operons, based on the premise that contiguous genes in an operon will be expressed at similar levels. While promising results have been observed using these methods, most of them do not address uncertainty caused by technical variability between experiments, which is especially relevant when the amount of data available is small. In addition, many existing methods do not provide the flexibility to determine the stringency with which genes should be evaluated for being in an operon pair. We present OperonSEQer, a set of machine learning algorithms that uses the statistic and p-value from a non-parametric analysis of variance test (Kruskal-Wallis) to determine the likelihood that two adjacent genes are expressed from the same RNA molecule. We implement a voting system to allow users to choose the stringency of operon calls depending on whether your priority is high recall or high specificity. In addition, we provide the code so that users can retrain the algorithm and re-establish hyperparameters based on any data they choose, allowing for this method to be expanded as additional data is generated. We show that our approach detects operon pairs that are missed by current methods by comparing our predictions to publicly available long-read sequencing data. OperonSEQer therefore improves on existing methods in terms of accuracy, flexibility, and adaptability.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2016

Parallel Algorithms and Patterns

This is a powerpoint presentation on parallel algorithms and patterns. A parallel algorithm is a well-defined, step-by-step computational procedure that emphasizes concurrency to solve a problem. Examples of problems include: Sorting, searching, optimization, matrix operations. A parallel pattern is a computational step in a sequence of independent, potentially concurrent operations that occurs in diverse scenarios with some frequency. Examples are: Reductions, prefix scans, ghost cell updates. We only touch on parallel patterns in this presentation. It really deserves its own detailed discussion which Gabe Rockefeller would like to develop.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Algorithms and Experience with Prediction of Technical Operating Failures in Nuclear Power Plant Equipment

The development of algorithms for the prediction of technological operating failure of nuclear power plant equipment based on stochastic extrapolation of the values of technical parameters is discussed. The algorithms are tested on real archived data on the operation of the oil circulation system of the main circulating pumps in a power generating unit at a nuclear power plant.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2018

Application of Genetic Algorithm (GA) Assisted Partial Least Square (PLS) Analysis on Trilinear and Non-trilinear Fluorescence Data Sets to Quantify the Fluorophores in Multifluorophoric Mixtures: Improving Quantification Accuracy of Fluorimetric Estimations of Dilute Aqueous Mixtures

Excitation-emission matrix fluorescence (EEMF) and total synchronous fluorescence spectroscopy (TSFS) are the 2 fluorescence techniques that are commonly used for the analysis of multifluorophoric mixtures. These 2 fluorescence techniques are conceptually different and provide certain advantages over each other. The manual analysis of such highly correlated large volume of EEMF and TSFS towards developing a calibration model is difficult. Partial least square (PLS) analysis can analyze the large volume of EEMF and TSFS data sets by finding important factors that maximize the correlation between the spectral and concentration information for each fluorophore. However, often the application of PLS analysis on entire data sets does not provide a robust calibration model and requires application of suitable pre-processing step. The present work evaluates the application of genetic algorithm (GA) analysis prior to PLS analysis on EEMF and TSFS data sets towards improving the precision and accuracy of the calibration model. The GA algorithm essentially combines the advantages provided by stochastic methods with those provided by deterministic approaches and can find the set of EEMF and TSFS variables that perfectly correlate well with the concentration of each of the fluorophores present in the multifluorophoric mixtures. The utility of the GA assisted PLS analysis is successfully validated using (i) EEMF data sets acquired for dilute aqueous mixture of four biomolecules and (ii) TSFS data sets acquired for dilute aqueous mixtures of four carcinogenic polycyclic aromatic hydrocarbons (PAHs) mixtures. In the present work, it is shown that by using the GA it is possible to significantly improve the accuracy and precision of the PLS calibration model developed for both EEMF and TSFS data set. Hence, GA must be considered as a useful pre-processing technique while developing an EEMF and TSFS calibration model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2018

Fast Algorithm for Evaluating Critical Current of High-Temperature Superconducting Pancake Coil

Second-generation (2G) high-temperature superconducting (HTS) tapes are now capable of carrying very high transport current and promising for a wide range of applications. The critical current of HTS coils is important for applications, such as superconducting electric machines, superconducting magnetic energy storage, and superconducting magnets. Therefore, precisely and quickly calculating critical current of HTS coils is very important for designing HTS devices. This paper provides a fast algorithm for evaluating critical current of HTS pancake coil. The fast algorithm is realized through a stationary model, which is based on finite element method (FEM) software. The stationary model means that the model is solved by stationary study instead of time-dependent study. To validate this method, a pancake HTS coil was wound and its critical current was measured. Meanwhile, an axial symmetric stationary model was built according to the geometry of the measured HTS coil. By comparing measured and calculated results, the effectiveness of the stationary model was demonstrated. Moreover, the stationary model is compared with H formulation model. The calculated results by the two models are nearly the same. However, by using stationary calculation, the stationary model can remarkably speed up the computational process. Due to the advantage of calculating speed, the stationary model can be used to characterize and design large-scale HTS applications.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2019

New Tabu Algorithm for Positioning Mining Drillholes with Blocks Uncertainty

This paper proposes a new approach to the mining exploration drillholes positioning problem (DPP) that incorporates both geostatistical and optimization techniques. A metaheuristic was developed to solve the DPP taking into account an uncertainty index that quantifies the reliability of the current interpretation of the mineral deposit. The uncertainty index was calculated from multiple deposit realizations obtained by truncated Gaussian simulations conditional to the available drillholes samplings. A linear programming model was defined to select the subset of future drillholes that maximizes coverage of the uncertainty. A Tabu Search algorithm was developed to solve large instances of this set partitioning problem. The proposed Tabu Search algorithm is shown to provide good quality solutions approaching 95% of the optimal solution in a reasonable computing time, allowing close to optimal coverage of uncertainty for a fixed investment in drilling.

58 GEOSCIENCES↗
DOE OSTI2019

Multiscale hysteresis threshold detection algorithm for a small infrared target in a complex background

In the infrared small target detection, the clutter formed by buildings, trees and protruding clouds is densely distributed and difficult to filter out. The hysteresis threshold detection algorithm utilizes the geometric features of small target to reduce false alarms. Images are filtered in multiple scales, the location and scale of the points of interest are extracted by non-maximum suppression. To determine the connection state of the focus and clutter, local gradient second-order origin moment is proposed to eliminate strong edges. The hysteresis threshold segmentation is performed to exclude stubborn false alarms and detect small targets. Experiments show that the proposed algorithm has a significant effect in removing false alarms, and achieves both the high detection probability and low false alarm probability.

42 ENGINEERING↗
DOE OSTI2019

An (adjustable RN)-based multi-OLT PON and the dynamic programming algorithm for downstream channel

In this paper, a multiple optical line terminal (OLT) passive optical network (PON) and the dynamic programming algorithm for downstream channel is proposed. By wavelength-selectable module, the adjustable remote node (RN) is constructed. By this adjustable RN, a simple and efficient multi-OLT PON is designed. By the way of first-plan and then-load, optical network unit (ONU) groups are established in order to realize the fast loading of ONUs. Specially, by introducing dynamic programming algorithm, the wavelength bandwidth utilization is maximized. Finally, by the simulation and analysis, the effectiveness of the proposed scheme is demonstrated.

42 ENGINEERING↗
DOE OSTI2019

Multi-scale fusion algorithm of intensity and polarization-difference images based on edge information enhancement

To better integrate complementary and redundant information from different source images, improve the edge information, and facilitate the target detection. A multi-scale fusion algorithm of intensity and polarization-difference (PD) images based on edge information enhancement is proposed. Firstly, intensity images are obtained by the polarization information analysis method. PD images are obtained by the adaptive polarization-difference imaging approach based on the principle of minimum mutual information. Secondly, guided filter, affine transformations and Block-Matching and 3D filtering are embedded in visibility enhancement to improve the intensity and PD images. Thirdly, the two images are decomposed into high-frequency and low-frequency images by the dual-tree complex wavelet transform (DT-CWT). The high-frequency and low-frequency images are fused by the fusion rules based on edge detection and the regional variance matching degree respectively. Finally, the fusion image is obtained by the inverse DT-CWT. Experimental results demonstrate that fusion images of the proposed algorithm are significantly improved in information entropy, average gradient, and spatial frequency. Compared with the existing methods, it can achieve a better edge enhancement for images in a turbid medium.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Classical symmetries and the Quantum Approximate Optimization Algorithm

Here, we study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized. Our approach formalizes the connection between quantum symmetry properties of the QAOA dynamics and the group of classical symmetries of the objective function. The connection is general and includes but is not limited to problems defined on graphs. We show a series of results exploring the connection and highlight examples of hard problem classes where a nontrivial symmetry subgroup can be obtained efficiently. In particular, we show how classical objective function symmetries lead to invariant measurement outcome probabilities across states connected by such symmetries, independent of the choice of algorithm parameters or number of layers. To illustrate the power of the developed connection, we apply machine learning techniques toward predicting QAOA performance based on symmetry considerations. We provide numerical evidence that a small set of graph symmetry properties suffices to predict the minimum QAOA depth required to achieve a target approximation ratio on the MaxCut problem, in a practically important setting where QAOA parameter schedules are constrained to be linear and hence easier to optimize.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Autopiquer - a Robust and Reliable Peak Detection Algorithm for Mass Spectrometry

We present a simple algorithm for robust and unsupervised peak detection by determining a noise threshold in isotopically resolved mass spectrometry data. Solving this problem will greatly reduce the subjective and time-consuming manual picking of mass spectral peaks and so will prove beneficial in many research applications. The Autopiquer approach uses autocorrelation to test for the presence of (isotopic) structure in overlapping windows across the spectrum. Within each window, a noise threshold is optimized to remove the most unstructured data, whilst keeping as much of the (isotopic) structure as possible. This algorithm has been successfully demonstrated for both peak detection and spectral compression on data from many different classes of mass spectrometer and for different sample types, and this approach should also be extendible to other types of data that contain regularly spaced discrete peaks. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2018

A descent algorithm for generalized complementarity problems based on generalized Fischer-Burmeister functions

We study an unconstrained minimization approach to the generalized complementarity problem GCP(f, g) based on the generalized Fischer-Burmeister function and its generalizations when the underlying functions are C{sup 1}. Also, we show how, under appropriate regularity conditions, minimizing the merit function corresponding to f and g leads to a solution of the generalized complementarity problem. Moreover, we propose a descent algorithm for GCP(f, g) and show a result on the global convergence of a descent algorithm for solving generalized complementarity problem. Finally, we present some preliminary numerical results. Our results further give a unified/generalization treatment of such results for the nonlinear complementarity problem based on generalized Fischer-Burmeister function and its generalizations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An efficient algorithm for solving the generalized trust region subproblem

In this paper, we consider the interval bounded generalized trust region subproblem (GTRS) which is the problem of minimizing a general quadratic function subject to an upper and lower bounded general quadratic constraint. Under the assumption that two matrices from the objective and the constraint functions can be simultaneously diagonalizable via congruence, a diagonalization-based algorithm is introduced to solve it by showing that GTRS is indeed equivalent to a linearly constrained convex univariate problem. Some numerical experiments are given to show the effectiveness of the proposed method and to compare it with the extended Rendl–Wolkowicz algorithm due to Pong and Wolkowicz.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

A new hybrid algorithm combining a new chaos optimization approach with gradient descent for high dimensional optimization problems

Chaos optimization algorithm (COA) is a recently developed method for global optimization based on chaos theory. It has the features of easy implementation, short execution time and robust mechanisms of escaping from local optima compared with the existing stochastic searching algorithm. By integrating the gradient descent method with a new COA approach using new strategies including symmetrization and levelling, a novel hybrid method, called SCGD, is proposed in this paper. The main idea is to combine the good ability of exploitation of the gradient descent with the high ability of exploration of COA. The purpose is to avoid being trapped into local optima and to improve convergence in large space and high-dimension optimization problems. The simulation results based on a set of 50 benchmark functions with diverse properties and different dimensions show the efficiency and the abilities of the proposed method in finding the global optima compared with the existing methods.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

An efficient global optimization algorithm for maximizing the sum of two generalized Rayleigh quotients

Maximizing the sum of two generalized Rayleigh quotients (SRQ) can be reformulated as a one-dimensional optimization problem, where the function value evaluations are reduced to solving semi-definite programming (SDP) subproblems. In this paper, we first use the dual SDP subproblem to construct an explicit overestimation and then propose a branch-and-bound algorithm to globally solve (SRQ). Numerical results demonstrate that it is even more efficient than the recent SDP-based heuristic algorithm.

97 MATHEMATICS AND COMPUTING↗