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 775 records · Page 43

Interaction of the terrestrial and atmospheric hydrological cycles in the context of the North American southwest summer monsoon

Work under this grant has used information on precipitation and water vapor fluxes in the area of the Mexican Monsoon to analyze the regional precipitation climatology, to understand the nature of water vapor transport during the monsoon using model and observational data, and to analyze the ability of the TRMM remote sensing algorithm to characterize precipitation. An algorithm for estimating daily surface rain volumes from hourly GOES infrared images was developed and compared to radar data. Estimates were usually within a factor of two, but different linear relations between satellite reflectances and rainfall rate were obtained for each day, storm type and storm development stage. This result suggests that using TRMM sensors to calibrate other satellite IR will need to be a complex process taking into account all three of the above factors. Another study, this one of the space-time variability of the Mexican Monsoon, indicate that TRMM will have a difficult time, over the course of its expected three year lifetime, identifying the diurnal cycle of precipitation over monsoon region. Even when considering monthly rainfalls, projected satellite estimates of August rainfall show a root mean square error of 38 percent. A related examination of spatial variability of mean monthly rainfall using a novel method for removing the effects of elevation from gridded gauge data, show wide variation from a satellite-based rainfall estimates for the same time and space resolution. One issue addressed by our research, relating to the basic character of the monsoon circulation, is the determination of the source region for moisture. The monthly maps produced from our study of monsoon variability show the presence of two rainfall maxima in the analysis normalized to sea level, one in south-central Arizona associated with the Mexican monsoon maximum and one in southeastern New Mexico associated with the Gulf of Mexico. From the point of view of vertically-integrated fluxes and flux divergence of water vapor from ECMWF data, most moisture at upper levels arrives from the Gulf of Mexico, while low level moisture comes from the northern Gulf of California. Composites of ECMWF analyses for wet and dry periods (classified by rain gauge data) show that both regimes show low level moisture arriving from northern and central Gulf of California. Above 700 MB, moisture comes from both source regions and the Sierra Madre Occidental. During wet periods a longer fetch through the moist air mass above western Mexico results in a greater moisture flux into the Sonoran Desert region, while there is less moisture from the Gulf of Mexico both above and below 700 mb. Work on the grant subcontract at the University of Colorado concentrated on the development of a technique useful to TRMM combining visible, infrared and passive microwave data for measuring precipitation. Two established techniques using either visible or infrared data applied over the US Southwest correlated with gauges at the 0.58 to 0.70 level. The application of some established passive microwave techniques were less successful for a variety of reason, including problems in both the gauge and satellite data quality, sampling problems and weaknesses inherent in the algorithms themselves. A more promising solution for accurate rainfall estimation was explored using visible and infrared data to perform a cloud classification, which when combined with information about the background (e.g. Iand/ocean), was used to select the most appropriate microwave algorithm from a suite of possibilities.

Dickinson, Robert E.↗

Mu2e Calorimeter Clustering Studies [Slides]

aMu2e (muon-to-electron-conversion), an Intensity Frontier experiment at Fermilab set to begin data taking in 2022, will search for flavor violation in charged leptons with a muon decaying to only an electron without any neutrinos. Protons will be accelerated by the 8GeV proton beam before reaching Mu2e’s production target. From there, pions enter an S-shaped Transport Solenoid and travel through a series of absorbers and collimators to select low-energy negatively charged muons from pion decay that will hit the stopping target. Downstream from the stopping target are a curved straw tracker and two annular disk crystal calorimeters. The signal will be a mono-energetic e- with an energy close to the rest mass of a muon. The Mu2e expected single event sensitivity is 2.87e-17. The complimentary trigger strategy will take advantage of both online track searches from the tracker and calorimeter reconstruction. The trigger requires a rejection factor greater than 100 and m ust make its decision within a 3ms time budget. In order to provide high efficiency on signal events, our calorimeter clustering algorithms must be accurate and meet the timing performance. I will discuss the expected performance of two clustering algorithms: a fast algorithm to be used at the trigger level and a more accurate clustering algorithm to be used in the offline reconstruction. The fast algorithm defines clusters by only selecting crystals adjacent to a high energy crystal seed. The full-blown algorithm can find smaller clusters separated from the main cluster, within a distance and timing window, and combine them into one cluster. We have analyzed the topology of the reconstructed clusters by the two algorithms on events with only a conversion electron and combined signal and background events. The goal of these studies is to improve the performance of the fast algorithm to better reconstruct the cluster energy and work within the strict timing budget.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Neural architecture search via similarity adaptive guidance

Evolutionary neural network architecture search (ENAS) has attracted the attention of many experts due to its global optimization capabilities to automatically search for convolutional neural network architectures based on the target task. The current search space for ENAS is not to design a fully structured network, but to search for smaller cell architectures to reduce search costs. However, blind search strategies do not effectively utilize the potential experience of the population. In order to utilize the potential experience learned by the current population to guide the evolutionary search of the population, we propose a similarity guided neural network architecture search algorithm based on cell architecture, which utilizes the similarity between pairwise architectures in the population as empirical knowledge learned by the population. Our proposed algorithm provides a novel method for calculating architecture similarity, which calculates architecture similarity separately from the cell and macro-structure. Then we decouple the connections and operations in the cell and calculate connection and operation similarity separately. In addition, we propose adaptive similarity selection and binary tournament selection strategies to enhance the algorithm’s global and local search capabilities and effectively explore the search space. Finally, we design an improved single-point crossover operator to enhance the local search ability of the evolutionary operator. The experimental results show that SAGNAS is a competitive algorithm that achieves 97.44% and 81.60% in CIFAR10 and CIFAR100 with only 1.9 GPU-days spent.

97 MATHEMATICS AND COMPUTING↗

A collision-selection rule for a particle simulation method suited to vector computers

A theory is developed for a selection rule governing collisions in a particle simulation of rarefied gas-dynamic flows. The selection rule leads to an algorithmic form highly compatible with fine grain parallel decomposition, allowing for efficient utilization of supercomputers having vector or massively parallel single instruction multiple data architectures. A comparison of shock-wave profiles obtained using both the selection rule and Bird's direct simulation Monte Carlo (DSMC) method show excellent agreement. The equation on which the selection rule is based is shown to be directly related to the time-counter procedure in the DSMC method. The results of several example simulations of representative rarefied flows are presented, for which the number of particles used ranged from 10 to the 6th to 10 to the 7th demonstrating the greatly improved computational efficiency of the method.

Baganoff, D.↗

Automated Synthesis of Architecture of Avionic Systems

The Architecture Synthesis Tool (AST) is software that automatically synthesizes software and hardware architectures of avionic systems. The AST is expected to be most helpful during initial formulation of an avionic-system design, when system requirements change frequently and manual modification of architecture is time-consuming and susceptible to error. The AST comprises two parts: (1) an architecture generator, which utilizes a genetic algorithm to create a multitude of architectures; and (2) a functionality evaluator, which analyzes the architectures for viability, rejecting most of the non-viable ones. The functionality evaluator generates and uses a viability tree a hierarchy representing functions and components that perform the functions such that the system as a whole performs system-level functions representing the requirements for the system as specified by a user. Architectures that survive the functionality evaluator are further evaluated by the selection process of the genetic algorithm. Architectures found to be most promising to satisfy the user s requirements and to perform optimally are selected as parents to the next generation of architectures. The foregoing process is iterated as many times as the user desires. The final output is one or a few viable architectures that satisfy the user s requirements.

Chau, Savio↗

Optimizing searches for electromagnetic counterparts of gravitational wave triggers

With the detection of a binary neutron star system and its corresponding electromagnetic counterparts, a new window of transient astronomy has opened. Due to the size of the sky localization regions, which can span hundreds to thousands of square degrees, there are significant benefits to optimizing tilings for these large sky areas. The rich science promised by gravitational wave astronomy has led to the proposal for a variety of proposed tiling and time allocation schemes, and for the first time, we make a systematic comparison of some of these methods. We find that differences of a factor of 2 or more in efficiency are possible, depending on the algorithm employed. For this reason, with future surveys searching for electromagnetic counterparts, care should be taken when selecting tiling, time allocation, and scheduling algorithms to optimize counterpart detection.

79 ASTRONOMY AND ASTROPHYSICS↗

Feature Identification and Location Experiment

The Feature Identification and Location Experiment (FILE), which was flown on the second Space Shuttle flight to test a technique for real-time, autonomous classification of water, vegetation and bare land as well as clouds, snow and ice, senses earth radiation in spectral bands centered at 0.65 and 0.85 microns. The radiance ratio classification algorithm has successfully made automatic data selection decisions. A classification image obtained on the mission is providing data needed to evaluate the FILE algorithm and overall system performance.

Sivertson, W. E., Jr.↗

Statistical behaviour of adaptive multilevel splitting algorithms in simple models

Adaptive multilevel splitting algorithms have been introduced rather recently for estimating tail distributions in a fast and efficient way. In particular, they can be used for computing the so-called reactive trajectories corresponding to direct transitions from one metastable state to another. The algorithm is based on successive selection–mutation steps performed on the system in a controlled way. It has two intrinsic parameters, the number of particles/trajectories and the reaction coordinate used for discriminating good or bad trajectories. We investigate first the convergence in law of the algorithm as a function of the timestep for several simple stochastic models. Second, we consider the average duration of reactive trajectories for which no theoretical predictions exist. The most important aspect of this work concerns some systems with two degrees of freedom. They are studied in detail as a function of the reaction coordinate in the asymptotic regime where the number of trajectories goes to infinity. We show that during phase transitions, the statistics of the algorithm deviate significatively from known theoretical results when using non-optimal reaction coordinates. In this case, the variance of the algorithm is peaking at the transition and the convergence of the algorithm can be much slower than the usual expected central limit behaviour. The duration of trajectories is affected as well. Moreover, reactive trajectories do not correspond to the most probable ones. Such behaviour disappears when using the optimal reaction coordinate called committor as predicted by the theory. We finally investigate a three-state Markov chain which reproduces this phenomenon and show logarithmic convergence of the trajectory durations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization of rotational arc station parameter optimized radiation therapy

Purpose: To develop a fast optimization method for station parameter optimized radiation therapy (SPORT) and show that SPORT is capable of matching VMAT in both plan quality and delivery efficiency by using three clinical cases of different disease sites. Methods: The angular space from 0° to 360° was divided into 180 station points (SPs). A candidate aperture was assigned to each of the SPs based on the calculation results using a column generation algorithm. The weights of the apertures were then obtained by optimizing the objective function using a state-of-the-art GPU based proximal operator graph solver. To avoid being trapped in a local minimum in beamlet-based aperture selection using the gradient descent algorithm, a stochastic gradient descent was employed here. Apertures with zero or low weight were thrown out. To find out whether there was room to further improve the plan by adding more apertures or SPs, the authors repeated the above procedure with consideration of the existing dose distribution from the last iteration. At the end of the second iteration, the weights of all the apertures were reoptimized, including those of the first iteration. The above procedure was repeated until the plan could not be improved any further. The optimization technique was assessed by using three clinical cases (prostate, head and neck, and brain) with the results compared to that obtained using conventional VMAT in terms of dosimetric properties, treatment time, and total MU. Results: Marked dosimetric quality improvement was demonstrated in the SPORT plans for all three studied cases. For the prostate case, the volume of the 50% prescription dose was decreased by 22% for the rectum and 6% for the bladder. For the head and neck case, SPORT improved the mean dose for the left and right parotids by 15% each. The maximum dose was lowered from 72.7 to 71.7 Gy for the mandible, and from 30.7 to 27.3 Gy for the spinal cord. The mean dose for the pharynx and larynx was reduced by 8% and 6%, respectively. For the brain case, the doses to the eyes, chiasm, and inner ears were all improved. SPORT shortened the treatment time by ∼1 min for the prostate case, ∼0.5 min for brain case, and ∼0.2 min for the head and neck case. Conclusions: The dosimetric quality and delivery efficiency presented here indicate that SPORT is an intriguing alternative treatment modality. With the widespread adoption of digital linac, SPORT should lead to improved patient care in the future.

60 APPLIED LIFE SCIENCES↗

Comparative evaluation of atom mapping algorithms for balanced metabolic reactions: application to Recon 3D

The mechanism of each chemical reaction in a metabolic network can be represented as a set of atom mappings, each of which relates an atom in a substrate metabolite to an atom of the same element in a product metabolite. Genome-scale metabolic network reconstructions typically represent biochemistry at the level of reaction stoichiometry. However, a more detailed representation at the underlying level of atom mappings opens the possibility for a broader range of biological, biomedical and biotechnological applications than with stoichiometry alone. Complete manual acquisition of atom mapping data for a genome-scale metabolic network is a laborious process. However, many algorithms exist to predict atom mappings. How do their predictions compare to each other and to manually curated atom mappings? For more than four thousand metabolic reactions in the latest human metabolic reconstruction, Recon 3D, we compared the atom mappings predicted by six atom mapping algorithms. We also compared these predictions to those obtained by manual curation of atom mappings for over five hundred reactions distributed among all top level Enzyme Commission number classes. Five of the evaluated algorithms had similarly high prediction accuracy of over 91% when compared to manually curated atom mapped reactions. On average, the accuracy of the prediction was highest for reactions catalysed by oxidoreductases and lowest for reactions catalysed by ligases. In addition to prediction accuracy, the algorithms were evaluated on their accessibility, their advanced features, such as the ability to identify equivalent atoms, and their ability to map hydrogen atoms. In addition to prediction accuracy, we found that software accessibility and advanced features were fundamental to the selection of an atom mapping algorithm in practice.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Functional evaluation of the Galileo attitude and articulation control subsystem using FUNSIM

The functional performance of the Galileo spacecraft's attitude and articulation control subsystem is evaluated. The tests are performed utilizing the simulation program developed on an IBM 370 system known as the Functional Simulation (FUNSIM). FUNSIM is an entirely software-based simulation which uses the actual flight software in HAL/S and simulated spacecraft dynamics in FORTRAN language. A description of how the test cases were selected to verify that the algorithms perform functionally correctly, and a summary of the problems encountered are included in the paper. The benefits of having an alternative test bed such as FUNSIM to the real-time simulation test beds which utilize the spacecraft hardware components in discovering the problems are described. A sample test case which shows that the desired tasks were performed functionally correctly is included in the paper. The commands in this test are selected to start the dual-spin spacecraft initially in launch mode and lead it all the way to inertial mode. Major attitude control algorithms such as rotor and platform attitude estimators, clock and core platform attitude estimators, clock and core platform controllers, and the command turn and burn are examined.

Namiri, M. K.↗

Development of Multi-Sensor Global Cloud and Radiance Composites for Earth Radiation Budget Monitoring from DSCOVR

The Deep Space Climate Observatory (DSCOVR) enables analysis of the daytime Earth radiation budget via the onboard Earth Polychromatic Imaging Camera (EPIC) and National Institute of Standards and Technology Advanced Radiometer (NISTAR). Radiance observations and cloud property retrievals from low earth orbit and geostationary satellite imagers have to be co-located with EPIC pixels to provide scene identification in order to select anisotropic directional models needed to calculate shortwave and longwave fluxes. A new algorithm is proposed for optimal merging of selected radiances and cloud properties derived from multiple satellite imagers to obtain seamless global hourly composites at 5-kilometer resolution. An aggregated rating is employed to incorporate several factors and to select the best observation at the time nearest to the EPIC measurement. Spatial accuracy is improved using inverse mapping with gradient search during reprojection and bicubic interpolation for pixel resampling. The composite data are subsequently remapped into EPIC-view domain by convolving composite pixels with the EPIC point spread function (PSF) defined with a half-pixel accuracy. PSF-weighted average radiances and cloud properties are computed separately for each cloud phase. The algorithm has demonstrated contiguous global coverage for any requested time of day with a temporal lag of under 2 hours in over 95 percent of the globe.

Khlopenkov, Konstantin↗

An enhanced artificial neural network with a shuffled complex evolutionary global optimization with principal component analysis

The classical Back-Propagation (BP) scheme with gradient-based optimization in training Artificial Neural Networks (ANNs) suffers from many drawbacks, such as the premature convergence, and the tendency of being trapped in local optimums. Therefore, as an alternative for the BP and gradient-based optimization schemes, various Evolutionary Algorithms (EAs), i.e., Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Simulated Annealing (SA), and Differential Evolution (DE), have gained popularity in the field of ANN weight training. This study applied a new efficient and effective Shuffled Complex Evolutionary Global Optimization Algorithm with Principal Component Analysis – University of California Irvine (SP-UCI) to the weight training process of a three-layer feed-forward ANN. A large-scale numerical comparison is conducted among the SP-UCI-, PSO-, GA-, SA-, and DE-based ANNs on 17 benchmark, complex, and real-world datasets. Here the results show that SP-UCI-based ANN outperforms other EA-based ANNs in the context of convergence and generalization. Results suggest that the SP-UCI algorithm possesses good potential in support of the weight training of ANN in real-word problems. In addition, the suitability of different kinds of EAs on training ANN is discussed. The large-scale comparison experiments conducted in this paper are fundamental references for selecting proper ANN weight training algorithms in practice.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Study of $\pi^0$ Events in MicroBooNE and Applications to the Deep Learning LEE Search

We present a selection of events containing $\pi^0$ particles in the MicroBooNE detector. These events are used to understand the important pi0 background in the deep learning (DL) based electron low energy excess (e-LEE) analysis. The selection uses a new shower reconstruction algorithm based on tools in the DL reconstruction chain. We present the efficiency and energy resolution of the selection. We also present the planned use of these events in energy calibration using the reconstructed $\pi^0$ mass.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Web-Based Search Service to Support Imaging Spectrometer Instrument Operations

Imaging spectrometers yield rich and informative data products, but interpreting them demands time and expertise. There is a continual need for new algorithms and methods for rapid first-draft analyses to assist analysts during instrument opera-tions. Intelligent data analyses can summarize scenes to draft geologic maps, searching images to direct op-erator attention to key features. This validates data quality while facilitating rapid tactical decision making to select followup targets. Ideally these algorithms would operate in seconds, never grow bored, and be free from observation bias about the kinds of mineral-ogy that will be found.

hyperspectral imagery↗

Virtual refrigerant charge sensing algorithm for residential CO₂ heat pumps

Natural refrigerants are increasingly adopted in next-generation heat pump systems, among which CO₂ heat pumps have attracted significant attention. However, due to their high operating pressures, the leakage risk is higher, resulting in undercharge conditions and degraded heat pump performance. Thus, developing an accurate refrigerant charge level detection technique is necessary to guarantee safe and efficient operation. Although virtual refrigerant charge (VRC) level calculation algorithms for CO₂ heat pumps exist, they typically rely on empirically selected features without a systematic selection framework, leading to multicollinearity and potential overfitting, which limit their prediction accuracy and generalizability. To address these issues, this study proposes a VRC algorithm framework with a systematic feature selection method that identifies physically meaningful and statistically significant features, and is applied using a residential CO₂ heat pump as a case study. The method is extended from previous work on conventional refrigerants to account for charge behavior in CO₂ gas coolers. The selected features include gas cooler outlet density, evaporator pressure, and superheat temperature. The results demonstrate that the proposed feature selection method significantly improves prediction accuracy compared to existing VRC approaches. A relatively small training dataset (∼30 samples) is sufficient for feature identification and model development. The developed algorithm achieves less than 3% prediction error under both undercharge and overcharge conditions, representing reductions of 46.7% and 35.3% compared to two recent reference VRC algorithms for transcritical CO₂ heat pumps reported in the literature. The proposed algorithm and feature selection method enhance leakage detection capability, facilitate the deployment of CO₂ heat pump systems, and contribute to reduced energy waste and maintenance costs.

Guo, Fangzhou [Lawrence Berkeley National Laborato↗

Automating Discovery of Physics-Informed Neural State Space Models via Learning and Evolution

Recent works exploring deep learning application to dynamical systems modeling have demonstrated that embedding physical priors into neural networks can yield more effective, physically-realistic, and data-efficient models. However, in the absence of complete prior knowledge of a dynamical system's physical characteristics, determining the optimal structure and optimization strategy for these models can be difficult. In this work, we explore methods for discovering neural state space dynamics models for system identification. Starting with a design space of block-oriented state space models and structured linear maps with strong physical priors, we encode these components into a model genome alongside network structure, penalty constraints, and optimization hyperparameters. Demonstrating the overall utility of the design space, we employ an asynchronous genetic search algorithm that alternates between model selection and optimization and obtains accurate physically consistent models of three physical systems: an aerodynamics body, a continuous stirred tank reactor, and a two tank interacting system.

genetic algorithms, neural architecture search, ne↗