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 127 records · Page 7

Health Monitoring System for the SSME-fault detection algorithms

A Health Monitoring System (HMS) Framework for the Space Shuttle Main Engine (SSME) has been developed by United Technologies Corporation (UTC) for the NASA Lewis Research Center. As part of this effort, fault detection algorithms have been developed to detect the SSME faults with sufficient time to shutdown the engine. These algorithms have been designed to provide monitoring coverage during the startup, mainstage and shutdown phases of the SSME operation. The algorithms have the capability to detect multiple SSME faults, and are based on time series, regression and clustering techniques. This paper presents a discussion of candidate algorithms suitable for fault detection followed by a description of the algorithms selected for implementation in the HMS and the results of testing these algorithms with the SSME test stand data.

Tulpule, S.↗

A new surrogate modeling technique combining Kriging and polynomial chaos expansions – Application to uncertainty analysis in computational dosimetry

In numerical dosimetry, the recent advances in high performance computing led to a strong reduction of the required computational time to assess the specific absorption rate (SAR) characterizing the human exposure to electromagnetic waves. However, this procedure remains time-consuming and a single simulation can request several hours. As a consequence, the influence of uncertain input parameters on the SAR cannot be analyzed using crude Monte Carlo simulation. The solution presented here to perform such an analysis is surrogate modeling. This paper proposes a novel approach to build such a surrogate model from a design of experiments. Considering a sparse representation of the polynomial chaos expansions using least-angle regression as a selection algorithm to retain the most influential polynomials, this paper proposes to use the selected polynomials as regression functions for the universal Kriging model. The leave-one-out cross validation is used to select the optimal number of polynomials in the deterministic part of the Kriging model. The proposed approach, called LARS-Kriging-PC modeling, is applied to three benchmark examples and then to a full-scale metamodeling problem involving the exposure of a numerical fetus model to a femtocell device. The performances of the LARS-Kriging-PC are compared to an ordinary Kriging model and to a classical sparse polynomial chaos expansion. The LARS-Kriging-PC appears to have better performances than the two other approaches. A significant accuracy improvement is observed compared to the ordinary Kriging or to the sparse polynomial chaos depending on the studied case. This approach seems to be an optimal solution between the two other classical approaches. A global sensitivity analysis is finally performed on the LARS-Kriging-PC model of the fetus exposure problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Catalogs of compact groups of galaxies from the enhanced SDSS DR12

We apply a friends-of-friends algorithm to an enhanced SDSS DR12 spectroscopic catalog, including redshift from the literature to construct a catalog of 1588 N⩾3 compact groups of galaxies containing 5178 member galaxies and covering the redshift range 0.01 < z < 0.19. This catalog contains 18 times as many systems and reaches 3 times the depth of the similar catalog of Barton et al. We construct catalogs from both magnitude-limited and volume-limited galaxy samples. Like Barton et al. we omit the frequently applied isolation criterion in the compact group selection algorithm. Thus the groups selected by fixed projected spatial and rest-frame line-of-sight velocity separation produce a catalog of groups with a redshift-independent median size. In contrast to previous catalogs, the enhanced SDSS DR12 catalog (including galaxies with r < 14.5) includes many systems with z ≲ 0.05. The volume-limited samples are unique to this study. The compact group candidates in these samples have a median stellar mass independent of redshift. Groups with velocity dispersion ≲100 km s{sup −1} show abundant evidence for ongoing dynamical interactions among the members. The number density of the volume-limited catalogs agrees with previous catalogs at the lowest redshifts but decreases as the redshift increases. The SDSS fiber placement constraints limit the catalog’s completeness. In spite of this issue, the volume-limited catalogs provide a promising basis for detailed spatially resolved probes of the impact of galaxy–galaxy interactions within similar dense systems over a broad redshift range.

79 ASTRONOMY AND ASTROPHYSICS↗

Randomized selection on the GPU

We implement here a fast and memory-sparing probabilistic top k selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the guess is correct, the problem is reduced to selection on a much smaller set. This probabilistic algorithm always gives a correct result and always terminates. Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

99 GENERAL AND MISCELLANEOUS↗

Randomized selection on the GPU

We implement here a fast and memory-sparing probabilistic top k selection algorithm on the GPU. The algorithm proceeds via an iterative probabilistic guess-and-check process on pivots for a three-way partition. When the guess is correct, the problem is reduced to selection on a much smaller set. This probabilistic algorithm always gives a correct result and always terminates. Las Vegas algorithms of this kind are a form of stochastic optimization and can be well suited to more general parallel processors with limited amounts of fast memory.

99 GENERAL AND MISCELLANEOUS↗

Comparative Analysis of ANN and LSTM Prediction Accuracy and Cooling Energy Savings through AHU-DAT Control in an Office Building

This paper proposes the optimal algorithm for controlling the HVAC system in the target building. Previous studies have analyzed pre-selected algorithms without considering the unique data characteristics of the target building, such as location, climate conditions, and HVAC system type. To address this, we compare the accuracy of cooling load prediction using ANN and LSTM algorithms, widely used in building energy research, to determine the optimal algorithm for HVAC control in the target building. We develop a simulation model calibrated with actual data to ensure data reliability and compare the energy consumption of the existing HVAC control method and the two algorithms-based methods. Results show that the ANN algorithm, with a CV(RMSE) of 12.7%, has a higher prediction accuracy than the LSTM algorithm, CV(RMSE) of 17.3%, making it a more suitable algorithm for HVAC control. Furthermore, implementing the ANN-based approach results in a 3.2% cooling energy reduction from the optimal control of Air Handling Unit (AHU) Discharge Air Temperature (DAT) compared to the fixed DAT at 12.8 °C in a representative day. This study demonstrates that ML-based HVAC system control can effectively reduce cooling energy consumption in HVAC systems, providing an effective strategy for energy conservation and improved HVAC system efficiency.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Feature Selection for Classification of Polar Regions Using a Fuzzy Expert System

Labeling, feature selection, and the choice of classifier are critical elements for classification of scenes and for image understanding. This study examines several methods for feature selection in polar regions, including the list, of a fuzzy logic-based expert system for further refinement of a set of selected features. Six Advanced Very High Resolution Radiometer (AVHRR) Local Area Coverage (LAC) arctic scenes are classified into nine classes: water, snow / ice, ice cloud, land, thin stratus, stratus over water, cumulus over water, textured snow over water, and snow-covered mountains. Sixty-seven spectral and textural features are computed and analyzed by the feature selection algorithms. The divergence, histogram analysis, and discriminant analysis approaches are intercompared for their effectiveness in feature selection. The fuzzy expert system method is used not only to determine the effectiveness of each approach in classifying polar scenes, but also to further reduce the features into a more optimal set. For each selection method,features are ranked from best to worst, and the best half of the features are selected. Then, rules using these selected features are defined. The results of running the fuzzy expert system with these rules show that the divergence method produces the best set features, not only does it produce the highest classification accuracy, but also it has the lowest computation requirements. A reduction of the set of features produced by the divergence method using the fuzzy expert system results in an overall classification accuracy of over 95 %. However, this increase of accuracy has a high computation cost.

Penaloza, Mauel A.↗

Calculating Time-Integral Quantities in Depletion Calculations

A method referred to as tally nuclides is presented for accurately and efficiently calculating the time-step averages and integrals of any quantities that are weighted sums of atomic densities with constant weights during the step. The method allows all such quantities to be calculated simultaneously as a part of a single depletion solution with existing depletion algorithms. Some examples of the results that can be extracted include step-average atomic densities and macroscopic reaction rates, the total number of fissions during the step, and the amount of energy released during the step. Furthermore, the method should be applicable with several depletion algorithms, and the integrals or averages should be calculated with an accuracy comparable to that reached by the selected algorithm for end-of-step atomic densities. The accuracy of the method is demonstrated in depletion calculations using the Chebyshev rational approximation method. Here, we demonstrate how the ability to calculate energy release in depletion calculations can be used to determine the accuracy of the normalization in a constant-power burnup calculation during the calculation without a need for a reference solution.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Area 2: Inexpensive Monitoring and Uncertainty Assessment of CO 2 Plume Migration using Injection Data

In-depth understanding of the long-term fate of CO₂ in the subsurface requires study and analysis of the reservoir formation, the overlaying caprock formation, and adjacent faults. Because there is significant uncertainty in predicting the location and extent of geologic heterogeneity that can impact the future migration of CO₂ in the subsurface, there is a need to develop algorithms that can reliably quantify this uncertainty in plume migration. This project is focused on the development of a model selection algorithm that refines an initial suite of subsurface models representing the prior uncertainty to create a posterior set of subsurface models that reflect injection performance consistent with that observed. Such posterior models can be used to represent uncertainty in the future migration of the CO₂ plume. Because only injection data is required, the method provides a very inexpensive method to map the migration of the plume and the associated uncertainty in migration paths. The model selection method developed as part of this project mainly consists of assessing the connectivity/dynamic characteristics of a large prior ensemble of models, grouping the models on the basis of their expected dynamic response, selecting the subgroup of models that most closely yield dynamic response closest to the observed dynamic data, and finally quantifying the uncertainty in plume migration using the selected subset of models. The main accomplishment of the project is the development of a software module within the SGEMS earth modeling software package that implements the model selection methodology. This software module was subsequently applied to analyze CO₂ plume migration in two field projects – the In Salah CO₂ Injection project in Algeria and CO₂ injection into the Utsira formation in Norway. These applications of the software revealed that the proxies developed in this project for quickly assessing the dynamic characteristics of the reservoir were highly efficient and yielded accurate grouping of reservoir models. The plume migration paths probabilistically assessed by the method were confirmed by field observations and auxiliary data. The report also documents the application of the software to answer practical questions such as the optimum location of monitoring wells to reliably assess the migration of CO₂ plume, the effect of CO₂-rock interactions on plume migration and the ability to detect the plume under those conditions and the effect of a slow, unresolved leak on the predictions of plume migration.

54 ENVIRONMENTAL SCIENCES↗

The CMS High-Level Trigger

At the startup of the LHC, the CMS data acquisition is expected to be able to sustain an event readout rate of up to 100 kHz from the Level-1 trigger. These events will be read into a large processor farm which will run the 'High-Level Trigger'(HLT) selection algorithms and will output a rate of about 150 Hz for permanent data storage. In this report HLT performances are shown for selections based on muons, electrons, photons, jets, missing transverse energy, {tau} leptons and b quarks: expected efficiencies, background rates and CPU time consumption are reported as well as relaxation criteria foreseen for a LHC startup instantaneous luminosity.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Synthesis of single-qutrit circuits from Clifford+𝑅 gates

Here, we present two deterministic compilation algorithms for single-qutrit unitaries with O ( log 1 / ɛ ) gate depth. Each algorithm selects a nearby approximation to the target unitary and then exactly synthesizes the approximation over the Clifford + R basis. The first algorithm exhaustively searches over the group; while the second algorithm searches only for Householder reflections. The exhaustive search algorithm yields an average R count of 2.193 ( 11 ) + 8.621 ( 7 ) log 10 ( 1 / ɛ ) , albeit with a time complexity of O ( ɛ − 4.4 ) . The Householder search algorithm results in a larger average R count of 3.20 ( 13 ) + 10.77 ( 3 ) log 10 ( 1 / ɛ ) at a reduced time complexity of O ( ɛ − 0.42 ) , greatly extending the reach in ɛ . These costs correspond asymptotically to 35% and 69% more non-Clifford gates compared with synthesizing the same unitary with two qubits. Such initial results are encouraging for using the R gate as the nontransversal gate for qutrit-based computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Efficient I/O for Neural Network Training with Compressed Data

FanStore is a shared object store that enables efficient and scalable neural network training on supercomputers. By providing a global cache layer on node-local burst buffers using a compressed representation, it significantly enhances the processing capability of deep learning (DL) applications on existing hardware. In addition, FanStore allows POSIX-compliant file access to the compressed data in user space. We investigate the tradeoff between runtime overhead and data compression ratio using real-world datasets and applications, and propose a compressor selection algorithm to maximize storage capacity given performance constraints. We consider both asynchronous (i.e., with prefetching) and synchronous I/O strategies, and propose mechanisms for selecting compressors for both approaches. Using FanStore, the same storage hardware can host 2-13x more data for example applications without significant runtime overhead. Empirically, our experiments show that FanStore scales to 512 compute nodes with near linear performance scalability.

Zhang, Zhao↗

Validating Connected, Automated, and Electric Vehicle Models and Simulation - Research Performance Progress Report

The objective of this project is to test connected and automated vehicles with both electrified and internal combustion engine powertrains to support updates and validation of modeling and simulation tools. This includes the development of the components and network architecture to execute and collect empirical data for multiple scenarios and traffic interactions. Specific program objectives include: • Translate Lab algorithms into vehicle and infrastructure controls • Conduct physical testing at realistic scale • Evaluate system performance • Improve models using empirical data • Improve control algorithms from lessons learned • Identify system and algorithm assumptions which need refinement It is important to note that the objective of this project was not to demonstrate the efficacy of the selected algorithms to improve energy efficiency but rather to validate and improve modeling and simulation tools using empirical data. While it is a desirable outcome to concurrently demonstrate improved energy efficiency through use of these algorithms, and in most cases that was the outcome, the success of this project was not predicated on the performance of the algorithm towards improving energy efficiency across all scenarios and test matrices.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

THE GALEX NEARBY YOUNG-STAR SURVEY

We describe a method that exploits data from the Galaxy Evolution Explorer (GALEX) ultraviolet and Wide-field Infrared Survey Explorer and Two Micron All Sky Survey infrared source catalogs, combined with proper motions and empirical pre-main sequence isochrones, to identify candidate nearby, young, low-mass stars. Applying our method across the full GALEX-covered sky, we identify 2031 mostly M-type stars that, for an assumed age of 10 (100) Myr, all lie within {approx}150 ({approx}90) pc of Earth. The distribution of M spectral subclasses among these {approx}2000 candidate young stars peaks sharply in the range M3-M4; these subtypes constitute 50% of the sample, consistent with studies of the M star population in the immediate solar neighborhood. We focus on a subset of 58 of these candidate young M stars in the vicinity of the Tucana-Horologium association. Only 20 of these 58 candidates were detected in the ROSAT All-Sky X-ray Survey-reflecting the greater sensitivity of GALEX for the purposes of identifying active nearby, young stars, particularly for stars of type M4 and later. Based on statistical analysis of the kinematics and/or spectroscopic followup of these 58 M stars, we find that 50% (29 stars) indeed have properties consistent with Tuc-Hor membership, while 12 are potential new members of the Columba association, and 2 may be AB Dor moving group members. Hence, {approx}75% of our initial subsample of 58 candidates are likely members of young (age {approx} 10-40 Myr) stellar moving groups within 100 pc, verifying that the stellar color- and kinematics-based selection algorithms described here can be used to efficiently isolate nearby, young, low-mass objects from among the field star population. Future studies will focus on characterizing additional subsamples selected from among this list of candidate nearby, young M stars.

79 ASTRONOMY AND ASTROPHYSICS↗

HykSort: a new variant of hypercube quicksort on distributed memory architectures. In: ICS '13 Proceedings of the 27th international ACM conference on International conference on supercomputing

In this paper, we present HykSort, an optimized comparison sort for distributed memory architectures that attains more than 2× improvement over bitonic sort and samplesort. The algorithm is based on the hypercube quicksort, but instead of a binary recursion, we perform a k-way recursion in which the pivots are selected accurately with an iterative parallel select algorithm. The single-node sort is performed using a vectorized and multithreaded merge sort. The advantages of HykSort are lower communication costs, better load balancing, and avoidance of O(p)-collective communication primitives. We also present a staged communication samplesort, which is more robust than the original samplesort for large core counts. We conduct an experimental study in which we compare hypercube sort, bitonic sort, the original samplesort, the staged samplesort, and HykSort. We report weak and strong scaling results and study the effect of the grain size. It turns out that no single algorithm performs best and a hybridization strategy is necessary. As a highlight of our study, on our largest experiment on 262,144 AMD cores of the CRAY XK7 "Titan" platform at the Oak Ridge National Laboratory we sorted 8 trillion 32-bit integer keys in 37 seconds achieving 0.9TB/s effective throughput.

Sundar, Hari↗

SU-F-R-10: Selecting the Optimal Solution for Multi-Objective Radiomics Model

Purpose: To develop an evidential reasoning approach for selecting the optimal solution from a Pareto solution set obtained by a multi-objective radiomics model for predicting distant failure in lung SBRT. Methods: In the multi-objective radiomics model, both sensitivity and specificity are considered as the objective functions simultaneously. A Pareto solution set with many feasible solutions will be resulted from the multi-objective optimization. In this work, an optimal solution Selection methodology for Multi-Objective radiomics Learning model using the Evidential Reasoning approach (SMOLER) was proposed to select the optimal solution from the Pareto solution set. The proposed SMOLER method used the evidential reasoning approach to calculate the utility of each solution based on pre-set optimal solution selection rules. The solution with the highest utility was chosen as the optimal solution. In SMOLER, an optimal learning model coupled with clonal selection algorithm was used to optimize model parameters. In this study, PET, CT image features and clinical parameters were utilized for predicting distant failure in lung SBRT. Results: Total 126 solution sets were generated by adjusting predictive model parameters. Each Pareto set contains 100 feasible solutions. The solution selected by SMOLER within each Pareto set was compared to the manually selected optimal solution. Five-cross-validation was used to evaluate the optimal solution selection accuracy of SMOLER. The selection accuracies for five folds were 80.00%, 69.23%, 84.00%, 84.00%, 80.00%, respectively. Conclusion: An optimal solution selection methodology for multi-objective radiomics learning model using the evidential reasoning approach (SMOLER) was proposed. Experimental results show that the optimal solution can be found in approximately 80% cases.

60 APPLIED LIFE SCIENCES↗

Evaluation of Genetic Algorithm Concepts Using Model Problems: Multi-Objective Optimization - Part 2

A genetic algorithm approach suitable for solving multi-objective optimization problems is described and evaluated using a series of simple model problems. Several new features including a binning selection algorithm and a gene-space transformation procedure are included. The genetic algorithm is suitable for finding pareto optimal solutions in search spaces that are defined by any number of genes and that contain any number of local extrema. Results indicate that the genetic algorithm optimization approach is flexible in application and extremely reliable, providing optimal results for all optimization problems attempted. The binning algorithm generally provides pareto front quality enhancements and moderate convergence efficiency improvements for most of the model problems. The gene-space transformation procedure provides a large convergence efficiency enhancement for problems with non-convoluted pareto fronts and a degradation in efficiency for problems with convoluted pareto fronts. The most difficult problems --multi-mode search spaces with a large number of genes and convoluted pareto fronts-- require a large number of function evaluations for GA convergence, but always converge.

Holst, Terry L.↗

ATLAS Flight Science Receiver Algorithms

This is the basis document for the ATLAS Receiver Algorithms. ATLAS is the single instrument on the ICESat-2 mission. The Receiver (Rx) Algorithms select the signal location in real-time and instruct the hardware to telemeter a vertical band of received time-tags about this signal location. The algorithms are implemented in the Flight Software (FSW) and in the hardware of the Photon Counting Electronics (PCE) cards. The sole purpose of the algorithms is to reduce the telemetry data volume to fit within the downlink constraint while maximizing the probability of downlinking surface signal. All versions of the Receiver Algorithms from version 2.8 onward incorporate our best knowledge of the ATLAS hardware at this time. It presents algorithms that, based on current Simulator testing, satisfy all of the requirements for the Rx Algorithms. Testing during ATLAS Instrument Integration and Testing with the hardware and software implementation of the Rx Algorithms revealed characteristics and responses that required changes to the Rx Algorithms and this document, which are captured in the change record below.All relevant documentation for the Receiver Algorithms can be found on the ICESat-2 Technical Data Management System (TDMS) under the ATLAS Algorithms subsystem.The launch version of the FSW (version 3.1.0) is based upon version 3.7c of this document.

Mcgarry, Jan L.↗