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 595 records · Page 33

Micromechanics Analysis Code (MAC). User Guide: Version 2.0

The ability to accurately predict the thermomechanical deformation response of advanced composite materials continues to play an important role in the development of these strategic materials. Analytical models that predict the effective behavior of composites are used not only by engineers performing structural analysis of large-scale composite components but also by material scientists in developing new material systems. For an analytical model to fulfill these two distinct functions it must be based on a micromechanics approach which utilizes physically based deformation and life constitutive models and allows one to generate the average (macro) response of a composite material given the properties of the individual constituents and their geometric arrangement. Here the user guide for the recently developed, computationally efficient and comprehensive micromechanics analysis code's (MAC) who's predictive capability rests entirely upon the fully analytical generalized method of cells (GMC), micromechanics model is described. MAC is a versatile form of research software that 'drives' the double or triply periodic micromechanics constitutive models based upon GMC. MAC enhances the basic capabilities of GMC by providing a modular framework wherein (1) various thermal, mechanical (stress or strain control) and thermomechanical load histories can be imposed, (2) different integration algorithms may be selected, (3) a variety of constituent constitutive models may be utilized and/or implemented, and (4) a variety of fiber and laminate architectures may be easily accessed through their corresponding representative volume elements.

Wilt, T. E.↗

Micromechanics Analysis Code With Generalized Method of Cells (MAC/GMC): User Guide

The ability to accurately predict the thermomechanical deformation response of advanced composite materials continues to play an important role in the development of these strategic materials. Analytical models that predict the effective behavior of composites are used not only by engineers performing structural analysis of large-scale composite components but also by material scientists in developing new material systems. For an analytical model to fulfill these two distinct functions it must be based on a micromechanics approach which utilizes physically based deformation and life constitutive models and allows one to generate the average (macro) response of a composite material given the properties of the individual constituents and their geometric arrangement. Here the user guide for the recently developed, computationally efficient and comprehensive micromechanics analysis code, MAC, who's predictive capability rests entirely upon the fully analytical generalized method of cells, GMC, micromechanics model is described. MAC/ GMC is a versatile form of research software that "drives" the double or triply periodic micromechanics constitutive models based upon GMC. MAC/GMC enhances the basic capabilities of GMC by providing a modular framework wherein 1) various thermal, mechanical (stress or strain control) and thermomechanical load histories can be imposed, 2) different integration algorithms may be selected, 3) a variety of material constitutive models (both deformation and life) may be utilized and/or implemented, and 4) a variety of fiber architectures (both unidirectional, laminate and woven) may be easily accessed through their corresponding representative volume elements contained within the supplied library of RVEs or input directly by the user, and 5) graphical post processing of the macro and/or micro field quantities is made available.

Arnold, S. M.↗

Discovering Communicable Scientific Knowledge from Spatio-Temporal Data

This paper describes how we used regression rules to improve upon a result previously published in the Earth science literature. In such a scientific application of machine learning, it is crucially important for the learned models to be understandable and communicable. We recount how we selected a learning algorithm to maximize communicability, and then describe two visualization techniques that we developed to aid in understanding the model by exploiting the spatial nature of the data. We also report how evaluating the learned models across time let us discover an error in the data.

Schwabacher, Mark↗

Discovering Communicable Models from Earth Science Data

This chapter describes how we used regression rules to improve upon results previously published in the Earth science literature. In such a scientific application of machine learning, it is crucially important for the learned models to be understandable and communicable. We recount how we selected a learning algorithm to maximize communicability, and then describe two visualization techniques that we developed to aid in understanding the model by exploiting the spatial nature of the data. We also report how evaluating the learned models across time let us discover an error in the data.

Schwabacher, Mark↗

Automatic Identification of Solar X-Ray Bright Points in Hinode X-Ray Data

We have automated a method that is used to find point sources in Chandra X-ray telescope data, to identify solar bright points in Hinode X-ray data. This tool, called lextrct, first identifies candidate sources that are brighter than the surrounding background. The algorithm also allows selected pixels to be excluded from the source-finding, thus allowing saturated pixels (from flares and/or active regions) to be ignored. We then use lextrct to fit the sources to two-dimensional, elliptical Gaussians. The size and orientation give an approximation of the shape of the bright points. We are in the process of analyzing observations through the Al_poly filter with a four-second exposure time, to obtain a catalogue of bright points, which will include their sizes, lifetimes, intensities, and position on the solar disk

Adams, M. L.↗

A Methodology for Evaluating Artifacts Produced by a Formal Verification Process

The goal of this study is to produce a methodology for evaluating the claims and arguments employed in, and the evidence produced by formal verification activities. To illustrate the process, we conduct a full assessment of a representative case study for the Enabling Technology Development and Demonstration (ETDD) program. We assess the model checking and satisfiabilty solving techniques as applied to a suite of abstract models of fault tolerant algorithms which were selected to be deployed in Orion, namely the TTEthernet startup services specified and verified in the Symbolic Analysis Laboratory (SAL) by TTTech. To this end, we introduce the Modeling and Verification Evaluation Score (MVES), a metric that is intended to estimate the amount of trust that can be placed on the evidence that is obtained. The results of the evaluation process and the MVES can then be used by non-experts and evaluators in assessing the credibility of the verification results.

Siminiceanu, Radu I.↗

All-Sky Search for Gravitational-Wave Bursts in the First Joint LIGO-GEO-Virgo Run

We present results from an aU-sky search for unmodeled gravitational-wave bursts in the data collected by the LIGO, GEO 600 and Virgo detectors between November 2006 and October 2007. The search is performed. by three different analysis algorithms over the frequency band 50 - 6000 Hz. Data are analyzed for times with at least two of the four LIGO-Virgo detectors in coincident operation, with a total live time of 266 days, No events produced by the search algorithms survive the selection cuts. We set a frequentist upper limit on the rate of gravitational-wave bursts impinging on our network of detectors. When combined with the previous LIGO search of the data collected between November 2005 and November 2006, the upper limit on the rate of detectable gra.vitational. wave bursts in the 64-2048 Hz band is 2,0 events per year at 90% confidence. We also present event rate versus strength exclusion plots for several types of plausible burst waveforms. The sensitivity of the combined search is expressed in terms of the root-sum-squared strain amplitude for a variety of simulated waveforms and lies in the range 6 X 10(exp -22) Hz(exp - 1/2) to 2 X 10(exp -20) Hz(exp -l/2). This is the first untriggered burst search to use data from the LIGO and Virgo detectors together, and the most sensitive untriggered burst search performed so far.

Camp, J. B.↗

A Demonstration that Correcting for Completeness and Reliability Is Critical for Robust Occurrence Rates

A measurement of planetary occurrence rates based on a planet catalog should be robust against details of how initial detections were classified as planets or false positives. This is accomplished by supplying the catalog’s rate of missed planets (completeness) and rate of non-planets incorrectly called planets (reliability). The final Kepler data release (DR25) includes products that can be used with the DR25 planet candidate catalog to correct for completeness and reliability in occurrence rate estimates. This is made possible by the Kepler Robovetter, which algorithmically and uniformly selects planets based on a variety of metrics and thresholds. Completeness, reliability, and occurrence rates potentially depend on these Robovetter thresholds. We study the impact of varying these vetting thresholds using the techniques of Bryson et al. 2019 (arXiv:1906.03575). We explore sets of thresholds that result in more or fewer planets (trading off completeness for reliability), as well as thresholds tuned to pass DR25 false positives identified as possible planets by the Kepler False Positive Working Group. We find that when correcting only for completeness, and not reliability, the resulting occurrence rates have a strong dependence on these threshold sets. For example, the value of SAG13 eta-Earth varies by over a factor of 4 when not corrected for reliability. However, when correcting for both completeness and reliability, occurrence rates using our threshold sets are statistically indistinguishable, with differences being well inside 1-sigma error bars. We present occurrence rates integrated over several period-radius ranges. For example, SAG13 eta-Earth is consistent with 0.127 (+0.094)(-0.054) (from Bryson et al. 2019) for all the Robovetter threshold sets. This result emphasizes the importance of correcting occurrence rates for both completeness and reliability. This suggests that inconsistent completeness and reliability correction may be a significant contributor to the large variation of occurrence rates in recent literature. We plan to make the Robovetter results for our threshold sets available, and encourage the community to use them to examine whether other occurrence rate methods yield similarly robust results.

Bryson, S.↗

Evaluation of Star Identification Techniques

A number of different strategies are used or have been suggested for identifying star fields atitude determination in space. We offer a general classification of the existing techniques and select three representative algorithms for more comprehensive evaluation. In addition, we describe a software simulation environment we developed for the design, paramter determination, and evaluation of star identification algorithms. The identification rates and performance on the three algorithms are presented over a variety of noise conditions using two different sized onboard catalogs.

star↗

Towards improved characterization of high-risk releases using heterogeneous indoor sensor systems

The sudden release of toxic contaminants that reach indoor spaces can be hazardous to building occupants. For an acutely toxic contaminant, the speed of the emergency response strongly influences the consequences to occupants. The design of a real time sensor system is made challenging both by the urgency and complex nature of the event, and by the imperfect sensors and models available to describe it. In this research, we use Bayesian modeling to combine information from multiple types of sensors to improve the characterization of a release. We discuss conceptual and algorithmic considerations for selecting and fusing information from disparate sensors. To explore system performance, we use both real tracer gas data from experiments in a three story building, along with synthetic data, including information from door position sensors. The added information from door position sensors is found to be useful for many scenarios, but not always. We discuss the physical conditions and design factors that affect these results, such as the influence of the door positions on contaminant transport. We highlight potential benefits of multisensor data fusion, challenges in realizing those benefits, and opportunities for further improvement.

54 ENVIRONMENTAL SCIENCES↗

Optimized Dispatch of Distributed Energy Resources for Resiliency and Power Quality Improvements at the Grid-Edge

Distributed Energy Resources (DERs) installed on low-voltage distribution systems, both utility-owned and nonutility owned may be employed to make improvements to system resiliency and power quality, in addition to simply serving load demand. By selectively dispatching active and reactive power from these existing DERs, improvements in voltage profiles and service availability during adverse events may be achieved. Further benefits can be gained by optimally choosing which DERs to dispatch power from, and the distribution of power from those DERs. For a given operating condition, using Linear Programming methods, optimal power dispatch values for individual DERs can be determined, while considering variables such as voltage gains, losses in the lines and the DERs, and DER reserve capacities. One such optimization technique is developed in this paper, and results from a real-time simulation study on a modified IEEE 13-bus distribution system with three DERs, are being presented. The operation of the optimized DER selection and dispatch algorithm is shown during normal operation of the transmission system when the DERs operate in grid-connected mode. Similar analyses can drive decision making during transmission system failure when the DERs operate in grid-forming or islanded mode.

Chowdhury, Prithwiraj Roy↗

Search properties of some sequential decoding algorithms.

Sequential decoding procedures are studied in the context of selecting a path through a tree. Several algorithms are considered, and their properties are compared. It is shown that the stack algorithm introduced by Zigangirov (1966) and by Jelinek (1969) is essentially equivalent to the Fano algorithm with regard to the set of nodes examined and the path selected, although the description, implementation, and action of the two algorithms are quite different. A modified Fano algorithm is introduced, in which the quantizing parameter is eliminated. It can be inferred from limited simulation results that, at least in some applications, the new algorithm is computationally inferior to the old. However, it is of some theoretical interest since the conventional Fano algorithm may be considered to be a quantized version of it.

Geist, J. M.↗

Minimal spanning tree algorithm for γ-ray source detection in sparse photon images: cluster parameters and selection strategies

We present that the minimal spanning tree (MST) algorithm is a graph-theoretical cluster-finding method. We previously applied it to γ-ray bidimensional images, showing that it is quite sensitive in finding faint sources. Possible sources are associated with the regions where the photon arrival directions clusterize. MST selects clusters starting from a particular “tree” connecting all the point of the image and performing a cut based on the angular distance between photons, with a number of events higher than a given threshold. In this paper, we show how a further filtering, based on some parameters linked to the cluster properties, can be applied to reduce spurious detections. We find that the most efficient parameter for this secondary selection is the magnitudeM of a cluster, defined as the product of its number of events by its clustering degree. We test the sensitivity of the method by means of simulated and real Fermi-Large Area Telescope (LAT) fields. Our results show that √M is strongly correlated with other statistical significance parameters, derived from a wavelet based algorithm and maximum likelihood (ML) analysis, and that it can be used as a good estimator of statistical significance of MST detections. Finally, we apply the method to a 2-year LAT image at energies higher than 3 GeV, and we show the presence of new clusters, likely associated with BL Lac objects.

79 ASTRONOMY AND ASTROPHYSICS↗

Tomographic Sparse View Selection Using the View Covariance Loss

Standard computed tomography (CT) reconstruction algorithms such as filtered back projection (FBP) and Feldkamp-Davis-Kress (FDK) require many views for producing high-quality reconstructions, which can slow image acquisition and increase cost in non-destructive evaluation (NDE) applications. Over the past 20 years, a variety of methods have been developed for computing high-quality CT reconstructions from sparse views. However, the problem of how to select the best views for CT reconstruction remains open. In this paper, we present a novel view covariance loss (VCL) function that measures the joint information of a set of views by approximating the normalized mean squared error (NMSE) of the reconstruction. We present fast algorithms for computing the VCL along with an algorithm for selecting a subset of views that approximately minimizes its value. Our experiments on simulated and measured data indicate that for a fixed number of views our proposed view covariance loss selection (VCLS) algorithm results in reconstructions with lower NRMSE, fewer artifacts, and greater accuracy than current alternative approaches.

Lin, Jingsong [Purdue University]↗

Predictive analytics of selections of russet potatoes

We explore the application of machine learning algorithms specifically to enhance the selection process of Russet potato (Solanum tuberosum L.) clones in breeding trials by predicting their suitability for advancement. This study addresses the challenge of efficiently identifying high-yield, disease-resistant, and climate-resilient potato varieties that meet processing industry standards. Leveraging manually collected data from trials in the state of Oregon, we investigate the potential of a wide variety of state-of-the-art binary classification models. The dataset includes 1086 clones, with data on 38 attributes recorded for each clone, focusing on yield, size, appearance, and frying characteristics, with several control varieties planted consistently across four Oregon regions from 2013 to 2021. We conduct a comprehensive analysis of the dataset that includes preprocessing, feature engineering, and imputation to address missing values. We focus on several key metrics such as accuracy, F1-score, and Matthews correlation coefficient (MCC) for model evaluation. The top-performing models, namely a feedforward neural network classifier (Neural Net), a histogram-based gradient boosting classifier (HGBC), and a support vector machine classifier (SVM), demonstrate consistent and significant results. To further validate our findings, we conducted a simulation study using the aims, data-generating mechanisms, estimands, methods, and performance measures (ADEMP) framework, simulating different data-generating scenarios to assess model robustness and performance through true positive, true negative, false positive, and false negative distributions, area under the receiver operating characteristic curve (AUC-ROC) and MCC. The simulation results highlight that non-linear models like SVM and HGBC consistently show higher AUC-ROC and MCC than logistic regression, thus outperforming the traditional linear model across various distributions, and emphasizing the importance of model selection and tuning in agricultural trials. Variable selection further enhances model performance and identifies influential features in predicting trial outcomes. The findings emphasize the potential of machine learning in streamlining the selection process for potato varieties, offering benefits such as increased efficiency, substantial cost savings, and judicious resource utilization. Our study contributes insights into precision agriculture and showcases the relevance of advanced technologies for informed decision-making in breeding programs.

60 APPLIED LIFE SCIENCES↗

Evaluating {sup 99m}Tc Auger electrons for targeted tumor radiotherapy by computational methods

Purpose: Technetium-99m ({sup 99m}Tc) has been widely used as an imaging agent but only recently has been considered for therapeutic applications. This study aims to analyze the potential use of {sup 99m}Tc Auger electrons for targeted tumor radiotherapy by evaluating the DNA damage and its probability of correct repair and by studying the cellular kinetics, following {sup 99m}Tc Auger electron irradiation in comparison to iodine-131 ({sup 131}I) beta minus particles and astatine-211 ({sup 211}At) alpha particle irradiation. Methods: Computational models were used to estimate the yield of DNA damage (fast Monte Carlo damage algorithm), the probability of correct repair (Monte Carlo excision repair algorithm), and cell kinetic effects (virtual cell radiobiology algorithm) after irradiation with the selected particles. Results: The results obtained with the algorithms used suggested that {sup 99m}Tc CKMMX (all M-shell Coster-Kroning--CK--and super-CK transitions) electrons and Auger MXY (all M-shell Auger transitions) have a therapeutic potential comparable to high linear energy transfer {sup 211}At alpha particles and higher than {sup 131}I beta minus particles. All the other {sup 99m}Tc electrons had a therapeutic potential similar to {sup 131}I beta minus particles. Conclusions: {sup 99m}Tc CKMMX electrons and Auger MXY presented a higher probability to induce apoptosis than {sup 131}I beta minus particles and a probability similar to {sup 211}At alpha particles. Based on the results here, {sup 99m}Tc CKMMX electrons and Auger MXY are useful electrons for targeted tumor radiotherapy.

60 APPLIED LIFE SCIENCES↗

The TESS Mission Target Selection Procedure

We describe the target selection procedure by which stars are selected for 2 minute and 20 s observations by TESS. We first list the technical requirements of the TESS instrument and ground systems processing that limit the total number of target slots. We then describe algorithms used by the TESS Payload Operation Center (POC) to merge candidate targets requested by the various TESS mission elements (the Target Selection Working Group, TESS Asteroseismic Science Consortium, and Guest Investigator office). Lastly, we summarize the properties of the observed TESS targets over the two-year primary TESS mission. We find that the POC target selection algorithm results in 2.1–3.4 times as many observed targets as target slots allocated for each mission element. We also find that the sky distribution of observed targets is different from the sky distributions of candidate targets due to technical constraints that require a relatively even distribution of targets across the TESS fields of view. We caution researchers exploring statistical analyses of TESS planet-host stars that the population of observed targets cannot be characterized by any simple set of criteria applied to the properties of the input Candidate Target Lists.

Michael Fausnaugh↗

Active meta-learning for predicting and selecting perovskite crystallization experiments

Autonomous experimentation systems use algorithms and data from prior experiments to select and perform new experiments in order to meet a specified objective. In most experimental chemistry situations, there is a limited set of prior historical data available, and acquiring new data may be expensive and time consuming, which places constraints on machine learning methods. Active learning methods prioritize new experiment selection by using machine learning model uncertainty and predicted outcomes. Meta-learning methods attempt to construct models that can learn quickly with a limited set of data for a new task. Here in this paper, we applied the model-agnostic meta-learning (MAML) model and the Probabilistic LATent model for Incorporating Priors and Uncertainty in few-Shot learning (PLATIPUS) approach, which extends MAML to active learning, to the problem of halide perovskite growth by inverse temperature crystallization. Using a dataset of 1870 reactions conducted using 19 different organoammonium lead iodide systems, we determined the optimal strategies for incorporating historical data into active and meta-learning models to predict reaction compositions that result in crystals. We then evaluated the best three algorithms (PLATIPUS and active-learning k-nearest neighbor and decision tree algorithms) with four new chemical systems in experimental laboratory tests. With a fixed budget of 20 experiments, PLATIPUS makes superior predictions of reaction outcomes compared to other active-learning algorithms and a random baseline.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗