Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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,189 records · Page 66

Accelerated Cartesian expansions for the rapid solution of periodic multiscale problems

We present an algorithm for the fast and efficient solution of integral equations that arise in the analysis of scattering from periodic arrays of PEC objects, such as multiband frequency selective surfaces (FSS) or metamaterial structures. Our approach relies upon the method of Accelerated Cartesian Expansions (ACE) to rapidly evaluate the requisite potential integrals. ACE is analogous to FMM in that it can be used to accelerate the matrix vector product used in the solution of systems discretized using MoM. Here, ACE provides linear scaling in both CPU time and memory. Details regarding the implementation of this method within the context of periodic systems are provided, as well as results that establish error convergence and scalability. In addition, we also demonstrate the applicability of this algorithm by studying several exemplary electrically dense systems.

97 MATHEMATICS AND COMPUTING↗

The Quantum Alternating Operator Ansatz on Maximum k -Vertex Cover

The Quantum Alternating Operator Ansatz is a generalization of the Quantum Approximate Optimization Algorithm (QAOA) designed for finding approximate solutions to combinatorial optimization problems with hard constraints. In this paper, we study Maximum k-Vertex Cover under this ansatz due to its modest complexity, while still being more complex than the well studied problems of Max-Cut and Max E3-LIN2. Our approach includes (i) a performance comparison between easy-to-prepare classical states and Dicke states as starting states, (ii) a performance comparison between two XY -Hamiltonian mixing operators: the ring mixer and the complete graph mixer, (iii) an analysis of the distribution of solutions via Monte Carlo sampling, and (iv) the exploration of efficient angle selection strategies.

97 MATHEMATICS AND COMPUTING↗

Generation of rationally-designed nerve growth factor (NGF) variants with receptor specificity

Highlights: • We characterized NGF variants predicted by FoldX protein design algorithm to have an altered binding to TrkA and p75{sup NTR}. • I31 was identified as a key residue within NGF that distinguishes between TrkA and p75{sup NTR} binding. • The I31R NGF selectively binds and activates p75{sup NTR}, while it did not exhibit the biological activity at TrkA receptor. Nerve growth factor (NGF) is the prototypic member of the neurotrophin family and binds two receptors, TrkA and the 75 kDa neurotrophin receptor (p75{sup NTR}), through which diverse and sometimes opposing effects are mediated. Using the FoldX protein design algorithm, we generated eight NGF variants with different point mutations predicted to have altered binding to TrkA or p75{sup NTR}. Of these, the I31R NGF variant exhibited specific binding to p75{sup NTR}. The generation of this NGF variant with selective affinity for p75{sup NTR} can be used to enhance understanding of neurotrophin receptor imbalance in diseases and identifies a key targetable residue for the development of small molecules to disrupt binding of NGF to TrkA with potential uses in chronic pain.

60 APPLIED LIFE SCIENCES↗

Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization

On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.

36 MATERIALS SCIENCE↗

An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method

This paper is concerned with applying bandwidth and profile reduction reordering algorithms prior to computing an incomplete Cholesky factorization and using this as a preconditioner for the conjugate gradient method. Hundreds of reordering algorithms have been proposed to solve the problems of bandwidth and profile reductions since the mid-1960s. In previous publications, a large range of heuristics for bandwidth and/or profile reductions was reviewed. Based on this experience, 13 heuristics were selected as the most promising methods. These are evaluated in this paper along with a variant of the breadth-first search procedure that is proposed. Numerical results confirm the effectiveness of this modified reordering algorithm for linear systems derived from specific application areas. Moreover, the most promising heuristics for several application areas are identified when reducing the computational cost of the incomplete Cholesky-conjugate gradient method.

97 MATHEMATICS AND COMPUTING↗

A Model Tree Generator (MTG) Framework for Simulating Hydrologic Systems: Application to Reservoir Routing

Data-driven algorithms have been widely used as effective tools to mimic hydrologic systems. Unlike black-box models, decision tree algorithms offer transparent representations of systems and reveal useful information about the underlying process. A popular class of decision tree models is model tree (MT), which is designed for predicting continuous variables. Most MT algorithms employ an exhaustive search mechanism and a pre-defined splitting criterion to generate a piecewise linear model. However, this approach is computationally intensive, and the selection of the splitting criterion can significantly affect the performance of the generated model. These drawbacks can limit the application of MTs to large datasets. To overcome these shortcomings, a new flexible Model Tree Generator (MTG) framework is introduced here. MTG is equipped with several modules to provide a flexible, efficient, and effective tool for generating MTs. The application of the algorithm is demonstrated through simulation of controlled discharge from several reservoirs across the Contiguous United States (CONUS).

54 ENVIRONMENTAL SCIENCES↗

An algorithm for automatic identification of double twin variants in Mg alloys

Highlights: • An algorithm for automatic identification of {10–11}–{10–12} double twin variants is proposed. • This algorithm is applicable for the cases without knowing the primary twin orientations. • The primary twin orientations can be reconstructed using this algorithm. - Abstract: {10 1-bar 1}−{10 1-bar 2} double twins (DTs) are profuse in Mg alloys after rolling at a large reduction (>10%). In many cases, the secondary twins completely occupy the primary ones, causing difficulty in variant analysis. Here, we propose an algorithm for automatic identification of twin variants. This is applicable for the {10 1-bar 1}−{10 1-bar 2} DTs without knowing the primary twins. In addition, two kinds of stereographic projections are constructed to assist such variant selection. By this method, the variants of 67 DTs observed in a rolled AZ31 sheet are determined. Based on 14 sets of DTs with known primary twin orientations, the high efficiency and reliability of this proposed algorithm is verified. The reason for unreliable variant identification in two special cases is also discussed.

36 MATERIALS SCIENCE↗

Noise Reduction in Low-Dose X-Ray Fluoroscopy for Image-Guided Radiation Therapy

Purpose: To improve the quality of low-dose X-ray fluoroscopic images using statistics-based restoration algorithm so that the patient fluoroscopy can be performed with reduced radiation dose. Method and Materials: Noise in the low-dose fluoroscopy was suppressed by temporal and spatial filtering. The temporal correlation among neighboring frames was considered by the Karhunen-Loeve (KL) transform (i.e., principal component analysis). After the KL transform, the selected neighboring frames of fluoroscopy were decomposed to uncorrelated and ordered principal components. For each KL component, a penalized weighted least-squares (PWLS) objective function was constructed to restore the ideal image. The penalty was chosen as anisotropic quadratic, and the penalty parameter in each KL component was inversely proportional to its corresponding eigenvalue. Smaller KL eigenvalue is associated with the KL component of lower signal-to-noise ratio (SNR), and a larger penalty parameter should be used for such KL component. The low-dose fluoroscopic images were acquired using a Varian Acuity simulator. A quality assurance phantom and an anthropomorphic chest phantom were used to evaluate the presented algorithm. Results: In the images restored by the proposed KL domain PWLS algorithm, noise is greatly suppressed, whereas fine structures are well preserved. Average improvement rate of SNR is 75% among selected regions of interest. Comparison studies with traditional techniques, such as the mean and median filters, show that the proposed algorithm is advantageous in terms of structure preservation. Conclusions: The proposed noise reduction algorithm can significantly improve the quality of low-dose X-ray fluoroscopic image and allows for dose reduction in X-ray fluoroscopy.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-F-T-405: Development of a Rapid Cardiac Contouring Tool Using Landmark-Driven Modeling

Purpose: This study aims to develop a tool to rapidly delineate cardiac substructures for use in dosimetry for large-scale clinical trial or epidemiological investigations. The goal is to produce a system that can semi-automatically delineate nine cardiac structures to a reasonable accuracy within a couple of minutes. Methods: The cardiac contouring tool employs a Most Similar Atlas method, where a selection criterion is used to pre-select the most similar model to the patient from a library of pre-defined atlases. Sixty contrast-enhanced cardiac computed tomography angiography (CTA) scans (30 male and 30 female) were manually contoured to serve as the atlas library. For each CTA 12 structures were delineated. Kabsch algorithm was used to compute the optimum rotation and translation matrices between the patient and atlas. Minimum root mean squared distance between the patient and atlas after transformation was used to select the most-similar atlas. An initial study using 10 CTA sets was performed to assess system feasibility. Leave-one patient out method was performed, and fit criteria were calculated to evaluate the fit accuracy compared to manual contours. Results: For the pilot study, mean dice indices of .895 were achieved for the whole heart, .867 for the ventricles, and .802 for the atria. In addition, mean distance was measured via the chord length distribution (CLD) between ground truth and the atlas structures for the four coronary arteries. The mean CLD for all coronary arteries was below 14mm, with the left circumflex artery showing the best agreement (7.08mm). Conclusion: The cardiac contouring tool is able to delineate cardiac structures with reasonable accuracy in less than 90 seconds. Pilot data indicates that the system is able to delineate the whole heart and ventricles within a reasonable accuracy using even a limited library. We are extending the atlas sets to 60 adult males and females in total.

60 APPLIED LIFE SCIENCES↗

Random Forests as a Viable Method to Select and Discover High-redshift Quasars

We present a method of selecting quasars up to redshift ≈6 with random forests, a supervised machine-learning method, applied to Pan-STARRS1 and WISE data. We find that, thanks to the increasing set of known quasars, we can assemble a training set that enables supervised machine-learning algorithms to become a competitive alternative to other methods up to this redshift. We present a candidate set for the redshift range 4.8–6.3, which includes the region around z = 5.5 where selecting quasars is difficult due to their photometric similarity to red and brown dwarfs. We demonstrate that, under our survey restrictions, we can reach a high completeness (66% ± 7% below redshift 5.6/83{sub -9}{sup +6}% above redshift 5.6) while maintaining a high selection efficiency (78{sub -8}{sup +10}%/94{sub -8}{sup +5}%). Our selection efficiency is estimated via a novel method based on the different distributions of quasars and contaminants on the sky. The final catalog of 515 candidates includes 225 known quasars. We predict the candidate catalog to contain additional 148{sub -33}{sup +41} new quasars below redshift 5.6 and 45{sub -8}{sup +5} above, and we make the catalog publicly available. Spectroscopic follow-up observations of 37 candidates led us to discover 20 new high redshift quasars (18 at 4.6 ≤ z ≤ 5.5, 2 z ~ 5.7). These observations are consistent with our predictions on efficiency. We argue that random forests can lead to higher completeness because our candidate set contains a number of objects that would be rejected by common color cuts, including one of the newly discovered redshift 5.7 quasars.

79 ASTRONOMY AND ASTROPHYSICS↗

ALmost EXact boundary conditions for transient Schrödinger–Poisson system

For the Schrödinger–Poisson system, we propose an ALmost EXact (ALEX) boundary condition to treat accurately the numerical boundaries. Being local in both space and time, the ALEX boundary conditions are demonstrated to be effective in suppressing spurious numerical reflections. Together with the Crank–Nicolson scheme, we simulate a resonant tunneling diode. The algorithm produces numerical results in excellent agreement with those in Mennemann et al. [1], yet at a much reduced complexity. Primary peaks in wave function profile appear as a consequence of quantum resonance, and should be considered in selecting the cut-off wave number for numerical simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

TU-D-209-03: Alignment of the Patient Graphic Model Using Fluoroscopic Images for Skin Dose Mapping

Purpose: The Dose Tracking System (DTS) was developed to provide realtime feedback of skin dose and dose rate during interventional fluoroscopic procedures. A color map on a 3D graphic of the patient represents the cumulative dose distribution on the skin. Automated image correlation algorithms are described which use the fluoroscopic procedure images to align and scale the patient graphic for more accurate dose mapping. Methods: Currently, the DTS employs manual patient graphic selection and alignment. To improve the accuracy of dose mapping and automate the software, various methods are explored to extract information about the beam location and patient morphology from the procedure images. To match patient anatomy with a reference projection image, preprocessing is first used, including edge enhancement, edge detection, and contour detection. Template matching algorithms from OpenCV are then employed to find the location of the beam. Once a match is found, the reference graphic is scaled and rotated to fit the patient, using image registration correlation functions in Matlab. The algorithm runs correlation functions for all points and maps all correlation confidences to a surface map. The highest point of correlation is used for alignment and scaling. The transformation data is saved for later model scaling. Results: Anatomic recognition is used to find matching features between model and image and image registration correlation provides for alignment and scaling at any rotation angle with less than onesecond runtime, and at noise levels in excess of 150% of those found in normal procedures. Conclusion: The algorithm provides the necessary scaling and alignment tools to improve the accuracy of dose distribution mapping on the patient graphic with the DTS. Partial support from NIH Grant R01-EB002873 and Toshiba Medical Systems Corp.

60 APPLIED LIFE SCIENCES↗

Estimating the joint distribution of rate parameters across multiple reactions in the absence of experimental data

Here, a procedure for determining the joint uncertainty of Arrhenius parameters across multiple combustion reactions of interest is demonstrated. This approach is capable of constructing the joint distribution of the Arrhenius parameters arising from the uncertain measurements performed in specific target experiments without having direct access to the underlying experimental data. The method involves constructing an ensemble of hypothetical data sets with summary statistics consistent with the available information reported by the experimentalists, followed by a fitting procedure that learns the structure of the joint parameter density across reactions using this consistent hypothetical data as evidence. The procedure is formalized in a Bayesian statistical framework, employing maximum-entropy and approximate Bayesian computation methods and utilizing efficient Markov chain Monte Carlo techniques to explore data and parameter spaces in a nested algorithm. We demonstrate the application of the method in the context of experiments designed to measure the rates of selected chain reactions in the H 2 -O 2 system and highlight the utility of this approach for revealing the critical correlations between the parameters within a single reaction and across reactions, as well as for maximizing consistency when utilizing rate parameter information in predictive combustion modeling of systems of interest.

97 MATHEMATICS AND COMPUTING↗

Simultaneous repression of multiple bacterial genes using nonrepetitive extra-long sgRNA arrays

Engineering cellular phenotypes often requires the regulation of many genes. When using CRISPR interference, coexpressing many single-guide RNAs (sgRNAs) triggers genetic instability and phenotype loss, due to the presence of repetitive DNA sequences. We stably coexpressed 22 sgRNAs within nonrepetitive extra-long sgRNA arrays (ELSAs) to simultaneously repress up to 13 genes by up to 3,500-fold. We applied biophysical modeling, biochemical characterization and machine learning to develop toolboxes of nonrepetitive genetic parts, including 28 sgRNA handles that bind Cas9. We designed ELSAs by combining nonrepetitive genetic parts according to algorithmic rules quantifying DNA synthesis complexity, sgRNA expression, sgRNA targeting and genetic stability. Using ELSAs, we created three highly selective phenotypes in Escherichia coli, including redirecting metabolism to increase succinic acid production by 150-fold, knocking down amino acid biosynthesis to create a multi-auxotrophic strain and repressing stress responses to reduce persister cell formation by 21-fold. Finally, ELSAs enable simultaneous and stable regulation of many genes for metabolic engineering and synthetic biology applications.

60 APPLIED LIFE SCIENCES↗

Model-agnostic search for dijet resonances with anomalous jet substructure in proton–proton collisions at $\sqrt{s}$ = 13 TeV

This paper presents a model-agnostic search for narrow resonances in the dijet final state in the mass range 1.8-6 TeV. The signal is assumed to produce jets with substructure atypical of jets initiated by light quarks or gluons, with minimal additional assumptions. Search regions are obtained by utilizing multivariate machine-learning methods to select jets with anomalous substructure. A collection of complementary anomaly detection methods - based on unsupervised, weakly supervised, and semisupervised algorithms - are used in order to maximize the sensitivity to unknown new physics signatures. These algorithms are applied to data corresponding to an integrated luminosity of 138 fb -1 , recorded by the CMS experiment at the LHC, at a center-of-mass energy of 13 TeV. No significant excesses above background expectations are seen. Exclusion limits are derived on the production cross section of benchmark signal models varying in resonance mass, jet mass, and jet substructure. Many of these signatures have not been previously sought, making several of the limits reported on the corresponding benchmark models the first ever. When compared to benchmark inclusive and substructure-based search strategies, the anomaly detection methods are found to significantly enhance the sensitivity to a variety of models.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Improved sensitivity of the DRIFT-IId directional dark matter experiment using machine learning

We demonstrate a new type of analysis for the DRIFT-IId directional dark matter detector using a machine learning algorithm called a Random Forest Classifier. The analysis labels events as signal or background based on a series of selection parameters, rather than solely applying hard cuts. The analysis efficiency is shown to be comparable to our previous result at high energy but with increased efficiency at lower energies. This leads to a projected sensitivity enhancement of one order of magnitude below a WIMP mass of 15 GeV c -2 and a projected sensitivity limit that reaches down to a WIMP mass of 9 GeV c -2 , which is a first for a directionally sensitive dark matter detector.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Low energy muon neutrino reconstruction in MicroBooNE

MicroBooNE is a Liquid Argon Time Projection Chamber (LArTPC) neutrino experiment on the Booster Neutrino Beamline at the Fermi National Accelerator Laboratory, with an 85-tonne active mass. One of MicroBooNE’s primary physics goals is to investigate the excess of electron neutrino events seen by MiniBooNE in the [200-600] MeV range. MicroBooNE will constrain the intrinsic electron neutrino component of the beam by measuring the muon neutrino spectrum. Several low-energy excess analyses are taking place in parallel, using independent reconstructions and selection schemes. This paper will focus on a low-energy excess analysis that makes use of deep learning algorithms applied to the high-resolution images provided by the MicroBooNE LArTPC. We present a novel 3D event reconstruction based on computer vision tools and a stochastic search algorithm, yielding a 2.2% energy resolution for 1μ1p muon neutrino interactions in the [200-1500] MeV range.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗