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,171 records · Page 65

Hybrid data-driven cement-stabilized soil design: An integration of machine learning, multi-objective optimization, and life cycle assessment

Soil stabilization is crucial in geotechnical engineering, yet conventional methods are often time-consuming, resource-intensive, and environmentally unsustainable. Despite growing interest in Machine Learning (ML) and optimization tools for mix design, few studies integrate these methods with decision-making techniques and environmental assessment to support practical implementation. This study proposes a hybrid data-driven framework for predicting strength, optimizing mix compositions, and evaluating environmental impacts via life cycle assessment of cement-stabilized soft soils. Six ML models were evaluated, and the top-performing eXtreme Gradient Boosting (XGB) model was further improved using the Grey Wolf Optimizer (GWO). The optimized XGB-GWO model, integrated with a polynomial cost function, served as the objective function in a multi-objective optimization problem solved via the Non-Dominated Sorting Genetic Algorithm II (NSGA-II), with final mix selection guided by the entropy-weighted TOPSIS method. Validation through a case study produced mix designs offering superior strength-cost trade-offs, with the optimal mix achieving 2243.2 kPa unconfined compressive strength and a 16.07 % reduction in carbon emissions compared to the highest-cost design. In conclusion, this study offers a sustainable, scalable approach to soil stabilization and supports informed decision-making in construction.

Life cycle assessment↗

Krylov subspace recycling for evolving structures

Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.

42 ENGINEERING↗

Dosimetric Comparison of Manual and Beam Angle Optimization of Gantry Angles in IMRT

Dosimetric comparison of manual beam angle selection (MBS) and beam angle optimization (BAO) for IMRT plans is investigated retrospectively for 15 head and neck and prostate patients. The head and neck and prostate had planning target volumes (PTVs) ranging between 96.0 and 319.9 cm{sup 3} and 153.6 and 321.3 cm{sup 3}, whereas OAR ranged between 8.3 and 47.8 cm{sup 3} and 68.3 and 469.2 cm{sup 3}, respectively. In MBS, a standard coplanar 7-9 fields equally spaced gantry angles were used. In BAO, the selection of gantry angle was optimized by the algorithm for the same number of beams. The optimization and dose-volume constraints were kept the same for both techniques. Treatment planning was performed on the Eclipse treatment planning system. Our results showed that the dose-volume histogram for PTV are nearly identical in both techniques but BAO provided superior sparing of the organs at risk compared with the MBS. Also, MBS produced statistically significant higher monitor units (MU) and segments than the BAO; 13.1 {+-} 6.6% (p = 0.012) and 10.4 {+-} 13.6% (p = 0.140), and 14.6 {+-} 5.6% (p = 1.003E-5) and 12.6 {+-} 7.4% (p = 0.76E-3) for head and neck and prostate cases, respectively. The reduction in MU translates into the reduction in total body and integral dose. It is concluded that BAO provides advantage over MBS for most intenisty-modulated radiation therapy cases.

61 RADIATION PROTECTION AND DOSIMETRY↗

Comparative Analysis of Simulated Annealing (SA) and Simplified Generalized SA (SGSA) for Estimation Optimal of Parametric Functional in CATIVIC

Application of simulated annealing (SA) and simplified GSA (SGSA) techniques for parameter optimization of parametric quantum chemistry method (CATIVIC) was performed. A set of organic molecules were selected for test these techniques. Comparison of the algorithms was carried out for error function minimization with respect to experimental values. Results show that SGSA is more efficient than SA with respect to computer time. Accuracy is similar in both methods; however, there are important differences in the final set of parameters.

74 ATOMIC AND MOLECULAR PHYSICS↗

Improved predictions of transcription factor binding sites using physicochemical features of DNA

Typical approaches for predicting transcription factor binding sites (TFBSs) involve use of a position-specific weight matrix (PWM) to statistically characterize the sequences of the known sites. Recently, an alternative physicochemical approach, called SiteSleuth, was proposed. In this approach, a linear support vector machine (SVM) classifier is trained to distinguish TFBSs from background sequences based on local chemical and structural features of DNA. SiteSleuth appears to generally perform better than PWM-based methods. Here, we improve the SiteSleuth approach by considering both new physicochemical features and algorithmic modifications. New features are derived from Gibbs energies of amino acid–DNA interactions and hydroxyl radical cleavage profiles of DNA. Algorithmic modifications consist of inclusion of a feature selection step, use of a nonlinear kernel in the SVM classifier, and use of a consensus-based post-processing step for predictions. We also considered SVM classification based on letter features alone to distinguish performance gains from use of SVM-based models versus use of physicochemical features. The accuracy of each of the variant methods considered was assessed by cross validation using data available in the RegulonDB database for 54 Escherichia coli TFs, as well as by experimental validation using published ChIP-chip data available for Fis and Lrp.

59 BASIC BIOLOGICAL SCIENCES↗

Measurement of jet substructure in boosted $t\overline{t}$ events with the ATLAS detector using 140 fb -1 of 13 TeV $pp$ collisions

Measurements of the substructure of top-quark jets are presented, using 140 fb -1 of 13 TeV pp collision data recorded with the ATLAS detector at the LHC. Top-quark jets reconstructed with the anti-k t algorithm with a radius parameter R = 1.0 are selected in top-quark pair ($t\overline{t}$) events where one top quark decays semileptonically and the other hadronically, or where both top quarks decay hadronically. The top-quark jets are required to have transverse momentum p T > 350 GeV, yielding large samples of data events with jet p T values between 350 and 600 GeV. One- and two-dimensional differential cross sections for eight substructure variables, defined using only the charged components of the jets, are measured in a particle-level phase space by correcting for the smearing and acceptance effects induced by the detector. The differential cross sections are compared with the predictions of several Monte Carlo simulations in which top-quark pair-production quantum chromodynamic matrix-element calculations at next-to-leading-order precision in the strong coupling constant α S are passed to leading-order parton shower and hadronization generators. The Monte Carlo predictions for measures of the broadness, and also the two-body structure, of the top-quark jets are found to be in good agreement with the measurements, while variables sensitive to the three-body structure of the top-quark jets exhibit some tension with the measured distributions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A Confidence-Guided Technique for Tracking Time-Varying Features

Application scientists often employ feature tracking algorithms to capture the temporal evolution of various features in their simulation data. However, as the complexity of the scientific features is increasing with the advanced simulation modeling techniques, quantification of reliability of the feature tracking algorithms is becoming important. One of the desired requirements for any robust feature tracking algorithm is to estimate its confidence during each tracking step so that the results obtained can be interpreted without any ambiguity. To address this, we develop a confidence-guided feature tracking algorithm that allows reliable tracking of user-selected features and presents the tracking dynamics using a graph-based visualization along with the spatial visualization of the tracked feature. Here, the efficacy of the proposed method is demonstrated by applying it to two scientific datasets containing different types of time-varying features.

97 MATHEMATICS AND COMPUTING↗

HF band filter bank multi-carrier spread spectrum

This paper describes modifications to the filter bank multicarrier spread spectrum (FB-MC-SS) system, that was presented in [1] and [2], to enable transmission of this waveform in the HF skywave channel. FB-MC-SS is well suited for the HF channel because it performs well in channels with frequency selective fading and interference. This paper describes new algorithms for packet detection, timing recovery and equalization that are suitable for the HF channel. Also, an algorithm for optimizing the peak to average power ratio (PAPR) of the FBMC- SS waveform is presented. Application of this algorithm results in a waveform with low PAPR. Simulation results using a wide band HF channel model demonstrate the robustness of this system over a wide range of delay and Doppler spreads.

99 GENERAL AND MISCELLANEOUS↗

A partial-volume correction for quantitative spectral x-ray radiography

The technique of spectral radiography has been shown to accurately discriminate a materials elemental composition by using known x-ray physics. This is achieved with a state-of-the-art pixelated spectrometer and a high-fidelity physical model. Similar to other radiographs, the system suffers from partial volume attenuation where the sample projection onto a pixel is only a fraction of the pixel area, leaving the rest unattenuated. This study updates the physical model to account for fractional area which presents new challenges to the existing algorithm. We present how this update is made and explore approaches to stabilize the algorithm through parameter scaling, constrained optimization, and hyperparameter selection.

Gillis, Wesley C.↗

SU-E-T-629: Feasibility Study of Treating Multiple Brain Tumors with Large Number of Noncoplanar IMRT Beams

Purpose: To study the feasibility of treating multiple brain tumors withlarge number of noncoplanar IMRT beams. Methods: Thirty beams are selected from 390 deliverable beams separated by six degree in 4pi space. Beam selection optimization is based on a column generation algorithm. MLC leaf size is 2 mm. Dose matrices are calculated with collapsed cone convolution and superposition method in a 2 mm by 2mm by 2 mm grid. Twelve brain tumors of various shapes, sizes and locations are used to generate four plans treating 3, 6, 9 and 12 tumors. The radiation dose was 20 Gy prescribed to the 100% isodose line. Dose Volume Histograms for tumor and brain were compared. Results: All results are based on a 2 mm by 2 mm by 2 mm CT grid. For 3, 6, 9 and 12 tumor plans, minimum tumor doses are all 20 Gy. Mean tumor dose are 20.0, 20.1, 20.1 and 20.1 Gy. Maximum tumor dose are 23.3, 23.6, 25.4 and 25.4 Gy. Mean ventricles dose are 0.7, 1.7, 2.4 and 3.1 Gy.Mean subventricular zone dose are 0.8, 1.3, 2.2 and 3.2 Gy. Average Equivalent uniform dose (gEUD) values for tumor are 20.1, 20.1, 20.2 and 20.2 Gy. The conformity index (CI) values are close to 1 for all 4 plans. The gradient index (GI) values are 2.50, 2.05, 2.09 and 2.19. Conclusion: Compared with published Gamma Knife treatment studies, noncoplanar IMRT treatment plan is superior in terms of dose conformity. Due to maximum limit of beams per plan, Gamma knife has to treat multiple tumors separately in different plans. Noncoplanar IMRT plans theoretically can be delivered in a single plan on any modern linac with an automated couch and image guidance. This warrants further study of using noncoplanar IMRT as a viable treatment solution for multiple brain tumors.

60 APPLIED LIFE SCIENCES↗

MO-FG-202-07: Real-Time EPID-Based Detection Metric For VMAT Delivery Errors

Purpose: To create and test an accurate EPID-frame-based VMAT QA metric to detect gross dose errors in real-time and to provide information about the source of error. Methods: A Swiss cheese model was created for an EPID-based real-time QA process. The system compares a treatmentplan- based reference set of EPID images with images acquired over each 2° gantry angle interval. The metric utilizes a sequence of independent consecutively executed error detection Methods: a masking technique that verifies infield radiation delivery and ensures no out-of-field radiation; output normalization checks at two different stages; global image alignment to quantify rotation, scaling and translation; standard gamma evaluation (3%, 3 mm) and pixel intensity deviation checks including and excluding high dose gradient regions. Tolerances for each test were determined. For algorithm testing, twelve different types of errors were selected to modify the original plan. Corresponding predictions for each test case were generated, which included measurement-based noise. Each test case was run multiple times (with different noise per run) to assess the ability to detect introduced errors. Results: Averaged over five test runs, 99.1% of all plan variations that resulted in patient dose errors were detected within 2° and 100% within 4° (∼1% of patient dose delivery). Including cases that led to slightly modified but clinically equivalent plans, 91.5% were detected by the system within 2°. Based on the type of method that detected the error, determination of error sources was achieved. Conclusion: An EPID-based during-treatment error detection system for VMAT deliveries was successfully designed and tested. The system utilizes a sequence of methods to identify and prevent gross treatment delivery errors. The system was inspected for robustness with realistic noise variations, demonstrating that it has the potential to detect a large majority of errors in real-time and indicate the error source. J. V. Siebers receives funding support from Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Optimizing Labor Resources at Manufacturing Enterprises

Attention focuses on the selection of mathematical models and the formulation of algorithms for organizational decision making in optimizing labor resources at manufacturing enterprises. Examples of labor optimization are presented.

42 ENGINEERING↗

Optimization and Multimachine Learning Algorithms to Predict Nanometal Surface Area Transfer Parameters for Gold and Silver Nanoparticles

Interactions between gold metallic nanoparticles and molecular dyes have been well described by the nanometal surface energy transfer (NSET) mechanism. However, the expansion and testing of this model for nanoparticles of different metal composition is needed to develop a greater variety of nanosensors for medical and commercial applications. In this study, the NSET formula was slightly modified in the size-dependent dampening constant and skin depth terms to allow for modeling of different metals as well as testing the quenching effects created by variously sized gold, silver, copper, and platinum nanoparticles. Overall, the metal nanoparticles followed more closely the NSET prediction than for Förster resonance energy transfer, though scattering effects began to occur at 20 nm in the nanoparticle diameter. To further improve the NSET theoretical equation, an attempt was made to set a best-fit line of the NSET theoretical equation curve onto the Au and Ag data points. An exhaustive grid search optimizer was applied in the ranges for two variables, 0.1≤C≤2.0 and 0≤α≤4, representing the metal dampening constant and the orientation of donor to the metal surface, respectively. Three different grid searches, starting from coarse (entire range) to finer (narrower range), resulted in more than one million total calculations with values C=2.0 and α=0.0736. The results improved the calculation, but further analysis needed to be conducted in order to find any additional missing physics. With that motivation, two artificial intelligence/machine learning (AI/ML) algorithms, multilayer perception and least absolute shrinkage and selection operator regression, gave a correlation coefficient, R2, greater than 0.97, indicating that the small dataset was not overfitting and was method-independent. This analysis indicates that an investigation is warranted to focus on deeper physics informed machine learning for the NSET equations.

Demers, Steven M. E. (ORCID:0000000192213246)↗

A study of digital gyro compensation loops

The feasibility is discussed of replacing existing state-of-the-art analog gyro compensation loops with digital computations. This was accomplished by designing appropriate compensation loops for the dry turned TDF gyro, selecting appropriate data conversion and processing techniques and algorithms, and breadboarding the design for laboratory evaluation. A breadboard design was established in which one axis of a Teledyne turned-gimbal TDF gyro was caged digitally while the other was caged using conventional analog electronics. The digital loop was designed analytically to closely resemble the analog loop in performance. The breadboard was subjected to various static and dynamic tests in order to establish the relative stability characteristics and frequency responses of the digital and analog loops. Several variations of the digital loop configuration were evaluated. The results were favorable.

Source record↗

LACIE/ERIPS software system summary

The Earth resources interactive processing system (ERIPS) supports LACIE by classifying LANDSAT sensed data on the basis of the statistical similarity to those portions which were identified by analysts. The development and capabilities of the ERIPS software system are described with emphasis on (1) system requirements; (2) LACIE/ERIPS hardware; (3) system functions; (4) pattern recognition concept; and (5) LACIE/ERIPS data bases. Algorithms used in LACIE/ERIPS for statistics, divergence, feature selection, classification, registration, adaptive clustering, iterative clustering, clustering report functions, Sun angle correction, mean level adjustment, and bias correction are appended.

Johnson, C. L.↗

Computational modeling for the study of multispectral sensor systems and concepts

A computational model of the deterministic and stochastic processes involved in remote sensing is being developed as a tool for studying multispectral sensor systems and concepts. The goal is to improve the efficiency of sensor systems for routine worldwide monitoring of earth resources and the environment. Preliminary computational results are presented for simple models of the natural variability of atmospheric radiative transfer and surface reflectance. These results illustrate the dependence of classification accuracy on the selection of sensor spectral channels and data processing algorithms.

Huck, F. O.↗

Processing techniques for software based SAR processors

Software SAR processing techniques defined to treat Shuttle Imaging Radar-B (SIR-B) data are reviewed. The algorithms are devised for the data processing procedure selection, SAR correlation function implementation, multiple array processors utilization, cornerturning, variable reference length azimuth processing, and range migration handling. The Interim Digital Processor (IDP) originally implemented for handling Seasat SAR data has been adapted for the SIR-B, and offers a resolution of 100 km using a processing procedure based on the Fast Fourier Transformation fast correlation approach. Peculiarities of the Seasat SAR data processing requirements are reviewed, along with modifications introduced for the SIR-B. An Advanced Digital SAR Processor (ADSP) is under development for use with the SIR-B in the 1986 time frame as an upgrade for the IDP, which will be in service in 1984-5.

Leung, K.↗

Experimental Parallel-Processing Computer

Master processor supervises slave processors, each with its own memory. Computer with parallel processing serves as inexpensive tool for experimentation with parallel mathematical algorithms. Speed enhancement obtained depends on both nature of problem and structure of algorithm used. In parallel-processing architecture, "bank select" and control signals determine which one, if any, of N slave processor memories accessible to master processor at any given moment. When so selected, slave memory operates as part of master computer memory. When not selected, slave memory operates independently of main memory. Slave processors communicate with each other via input/output bus.

Mcgregor, J. W.↗