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 325 records · Page 18

Interactive explorations of hierarchical segmentations

The authors report on the implementation of an interactive tool, called HSEGEXP, to interactively explore the hierarchical segmentation produced by the iterative parallel region growing (IPRG) algorithm to select the best segmentation result. This combination of the HSEGEXP tool with the IPRG algorithm amounts to a computer-assisted image segmentation system guided by human interaction. The initial application of the HSEGEXP tool is in the refinement of ground reference data based on the IPRG/HSEGEXP segmentation of the corresponding remotely sensed image data. The HSEGEXP tool is being used to help evaluate the effectiveness of an automatic 'best' segmentation process under development.

Tilton, James C.↗

Modeling in the State Flow Environment to Support Launch Vehicle Verification Testing for Mission and Fault Management Algorithms in the NASA Space Launch System

Analysis methods and testing processes are essential activities in the engineering development and verification of the National Aeronautics and Space Administration's (NASA) new Space Launch System (SLS). Central to mission success is reliable verification of the Mission and Fault Management (M&FM) algorithms for the SLS launch vehicle (LV) flight software. This is particularly difficult because M&FM algorithms integrate and operate LV subsystems, which consist of diverse forms of hardware and software themselves, with equally diverse integration from the engineering disciplines of LV subsystems. M&FM operation of SLS requires a changing mix of LV automation. During pre-launch the LV is primarily operated by the Kennedy Space Center (KSC) Ground Systems Development and Operations (GSDO) organization with some LV automation of time-critical functions, and much more autonomous LV operations during ascent that have crucial interactions with the Orion crew capsule, its astronauts, and with mission controllers at the Johnson Space Center. M&FM algorithms must perform all nominal mission commanding via the flight computer to control LV states from pre-launch through disposal and also address failure conditions by initiating autonomous or commanded aborts (crew capsule escape from the failing LV), redundancy management of failing subsystems and components, and safing actions to reduce or prevent threats to ground systems and crew. To address the criticality of the verification testing of these algorithms, the NASA M&FM team has utilized the State Flow environment6 (SFE) with its existing Vehicle Management End-to-End Testbed (VMET) platform which also hosts vendor-supplied physics-based LV subsystem models. The human-derived M&FM algorithms are designed and vetted in Integrated Development Teams composed of design and development disciplines such as Systems Engineering, Flight Software (FSW), Safety and Mission Assurance (S&MA) and major subsystems and vehicle elements such as Main Propulsion Systems (MPS), boosters, avionics, Guidance, Navigation, and Control (GN&C), Thrust Vector Control (TVC), liquid engines, and the astronaut crew office. Since the algorithms are realized using model-based engineering (MBE) methods from a hybrid of the Unified Modeling Language (UML) and Systems Modeling Language (SysML), SFE methods are a natural fit to provide an in depth analysis of the interactive behavior of these algorithms with the SLS LV subsystem models. For this, the M&FM algorithms and the SLS LV subsystem models are modeled using constructs provided by Matlab which also enables modeling of the accompanying interfaces providing greater flexibility for integrated testing and analysis, which helps forecast expected behavior in forward VMET integrated testing activities. In VMET, the M&FM algorithms are prototyped and implemented using the same C++ programming language and similar state machine architectural concepts used by the FSW group. Due to the interactive complexity of the algorithms, VMET testing thus far has verified all the individual M&FM subsystem algorithms with select subsystem vendor models but is steadily progressing to assessing the interactive behavior of these algorithms with LV subsystems, as represented by subsystem models. The novel SFE applications has proven to be useful for quick look analysis into early integrated system behavior and assessment of the M&FM algorithms with the modeled LV subsystems. This early MBE analysis generates vital insight into the integrated system behaviors, algorithm sensitivities, design issues, and has aided in the debugging of the M&FM algorithms well before full testing can begin in more expensive, higher fidelity but more arduous environments such as VMET, FSW testing, and the Systems Integration Lab7 (SIL). SFE has exhibited both expected and unexpected behaviors in nominal and off nominal test cases prior to full VMET testing. In many findings, these behavioral characteristics were used to correct the M&FM algorithms, enable better test coverage, and develop more effective test cases for each of the LV subsystems. This has improved the fidelity of testing and planning for the next generation of M&FM algorithms as the SLS program evolves from non-crewed to crewed flight, impacting subsystem configurations and the M&FM algorithms that control them. SFE analysis has improved robustness and reliability of the M&FM algorithms by revealing implementation errors and documentation inconsistencies. It is also improving planning efficiency for future VMET testing of the M&FM algorithms hosted in the LV flight computers, further reducing risk for the SLS launch infrastructure, the SLS LV, and most importantly the crew.

Trevino, Luis↗

Design of Broadly Cross-Reactive M Protein–Based Group A Streptococcal Vaccines

Group A streptococcal infections are a significant cause of global morbidity and mortality. A leading vaccine candidate is the surface M protein, a major virulence determinant and protective Ag. An obstacle to the development of M protein–based vaccines is the >200 different M types defined by the N-terminal sequences that contain protective epitopes. Despite sequence variability, M proteins share coiled-coil structural motifs that bind host proteins required for virulence. In this study, we exploit this potential Achilles heel of conserved structure to predict cross-reactive M peptides that could serve as broadly protective vaccine Ags. Combining sequences with structural predictions, six heterologous M peptides in a sequence-related cluster were predicted to elicit cross-reactive Abs with the remaining five nonvaccine M types in the cluster. The six-valent vaccine elicited Abs in rabbits that reacted with all 11 M peptides in the cluster and functional opsonic Abs against vaccine and nonvaccine M types in the cluster. We next immunized mice with four sequence-unrelated M peptides predicted to contain different coiled-coil propensities and tested the antisera for cross-reactivity against 41 heterologous M peptides. Based on these results, we developed an improved algorithm to select cross-reactive peptide pairs using additional parameters of coiled-coil length and propensity. The revised algorithm accurately predicted cross-reactive Ab binding, improving the Matthews correlation coefficient from 0.42 to 0.74. These results form the basis for selecting the minimum number of N-terminal M peptides to include in potentially broadly efficacious multivalent vaccines that could impact the overall global burden of group A streptococcal diseases.

60 APPLIED LIFE SCIENCES↗

A digital communications system for manned spaceflight applications.

A highly efficient, all-digital communications signal design employing convolutional coding and PN spectrum spreading is described for two-way transmission of voice and data between a manned spacecraft and ground. Variable-slope delta modulation is selected for analog/digital conversion of the voice signal, and a convolutional decoder utilizing the Viterbi decoding algorithm is selected for use at each receiving terminal. A PN spread spectrum technique is implemented to protect against multipath effects and to reduce the energy density (per unit bandwidth) impinging on the earth's surface to a value within the guidelines adopted by international agreement. Performance predictions are presented for transmission via a TDRS (tracking and data relay satellite) system and for direct transmission between the spacecraft and earth. Hardware estimates are provided for a flight-qualified communications system employing the coded digital signal design.

Batson, B. H.↗

MHOST version 4.2. Volume 1: Users' manual

This manual describes the user options available for running the MHOST finite element analysis package. MHOST is a solid and structural analysis program based on mixed finite element technology, and is specifically designed for three-dimensional inelastic analysis. A family of two- and three-dimensional continuum elements along with beam and shell structural elements can be utilized. Many options are available in the constitutive equation library, the solution algorithms and the analysis capabilities. An overview of the algorithms, a general description of the input data formats, and a discussion of input data for selecting solution algorithms are given.

Nakazawa, Shohei↗

A new hybrid genetic algorithm for optimizing the single and multivariate objective functions

In this work a new hybrid genetic algorithm was developed which combines a rudimentary adaptive steepest ascent hill climbing algorithm with a sophisticated evolutionary algorithm in order to optimize complex multivariate design problems. By combining a highly stochastic algorithm (evolutionary) with a simple deterministic optimization algorithm (adaptive steepest ascent) computational resources are conserved and the solution converges rapidly when compared to either algorithm alone. In genetic algorithms natural selection is mimicked by random events such as breeding and mutation. In the adaptive steepest ascent algorithm each variable is perturbed by a small amount and the variable that caused the most improvement is incremented by a small step. If the direction of most benefit is exactly opposite of the previous direction with the most benefit then the step size is reduced by a factor of 2, thus the step size adapts to the terrain. A graphical user interface was created in MATLAB to provide an interface between the hybrid genetic algorithm and the user. Additional features such as bounding the solution space and weighting the objective functions individually are also built into the interface. The algorithm developed was tested to optimize the functions developed for a wood pelleting process. Using process variables (such as feedstock moisture content, die speed, and preheating temperature) pellet properties were appropriately optimized. Specifically, variables were found which maximized unit density, bulk density, tapped density, and durability while minimizing pellet moisture content and specific energy consumption. The time and computational resources required for the optimization were dramatically decreased using the hybrid genetic algorithm when compared to MATLAB's native evolutionary optimization tool.

feedstock↗

CANDIDATE CLUSTERS OF GALAXIES AT z > 1.3 IDENTIFIED IN THE SPITZER SOUTH POLE TELESCOPE DEEP FIELD SURVEY

We present 279 galaxy cluster candidates at z > 1.3 selected from the 94 deg{sup 2} Spitzer South Pole Telescope Deep Field (SSDF) survey. We use a simple algorithm to select candidate high-redshift clusters of galaxies based on Spitzer/IRAC mid-infrared data combined with shallow all-sky optical data. We identify distant cluster candidates adopting an overdensity threshold that results in a high purity (80%) cluster sample based on tests in the Spitzer Deep, Wide-Field Survey of the Boötes field. Our simple algorithm detects all three 1.4 < z ≤ 1.75 X-ray detected clusters in the Boötes field. The uniqueness of the SSDF survey resides not just in its area, one of the largest contiguous extragalactic fields observed with Spitzer, but also in its deep, multi-wavelength coverage by the South Pole Telescope (SPT), Herschel/SPIRE, and XMM-Newton. This rich data set will allow direct or stacked measurements of Sunyaev-Zel'dovich effect decrements or X-ray masses for many of the SSDF clusters presented here, and enable a systematic study of the most distant clusters on an unprecedented scale. We measure the angular correlation function of our sample and find that these candidates show strong clustering. Employing the COSMOS/UltraVista photometric catalog in order to infer the redshift distribution of our cluster selection, we find that these clusters have a comoving number density n{sub c}=(0.7{sub −0.6}{sup +6.3})×10{sup −7} h{sup 3} Mpc{sup −3} and a spatial clustering correlation scale length r {sub 0} = (32 ± 7) h {sup –1} Mpc. Assuming our sample is comprised of dark matter halos above a characteristic minimum mass, M {sub min}, we derive that at z = 1.5 these clusters reside in halos larger than M{sub min}=1.5{sub −0.7}{sup +0.9}×10{sup 14} h{sup −1} M{sub ⊙}. We find that the mean mass of our cluster sample is equal to M{sub mean}=1.9{sub −0.8}{sup +1.0}×10{sup 14} h{sup −1} M{sub ⊙}; thus, our sample contains the progenitors of present-day massive galaxy clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

Luminous Binary Supersoft X-Ray Sources

This has been a remarkably productive year. We have completed an algorithm to select SSSs in external galaxies which have been observed by Chandru or XMM-Newton. By applying this algorithm to new data, we have discovered an extension of the class of SSSs to sources that are somewhat harder (100 - 300 eV, instead of tens of eV), but which are nevertheless much softer than canonical X-ray sources. We have completed a study of SSSs in M31 and have also considered several other galaxies. From these studies, some population characteristics are beginning to emerge; these provide clues to the natures of the systems. We have considered ultraluminous SSSs in M1O1 and NGC 300. It is possible that these may correspond to accreting intermediate-mass black holes, rather than accreting white dwarfs. We have also studied individual systems, such as CAL 83, and have followed up on additional sources in fields we have studied, such as in the galaxy NGC 1313. NASA has released a press release on some of our work.

DiStefano, Rosanne↗

Luminous Binary Supersoft X-Ray Sources

One of the key accomplishments of the two preceding years was our development of an algorithm to select SSSs in external galaxies which have been observed by Chandra or XMM-Newton. By applying this algorithm to data from a number of galaxies, we discovered an extension of the class of SSSs to sources that are somewhat harder (100 - 300 eV, instead of tens of eV), but which are nevertheless much softer than canonical X-ray sources. We call these new sources quasisoft sources (QSSs). During this past year, we have built on and extended this work. We have (1) continued to identify SSSs and QSSs in external galaxies, (2) worked on models for the sources and find that black hole models seem promising for a subset of them, and (3) have studied individual systems, especially M101-ULX1. This special system has been observed as an SSS in its high &ate, with a luminosity in excess of 10(exp 41) erg/s. It has also been observed as a QSS when it is less luminous, and as a hard source in its low state. It is one of the best candidates to be an accreting intermediate-mass black hole. We have several papers in preparation. Below we list papers which are complete, including only new work and papers whose status has changed (e.g., been accepted for publication) since our last report. In addition, our work on QSSs has received some publicity. It was the subject of a Chandra press release and was picked up by several media outlets.

Oliversen, Ronald J.↗

A bi-level spatiotemporal clustering approach and its application to drought extraction

We present a novel flexible bi-level spatiotemporal clustering algorithm to extract events based on their intensity and spatiotemporal structures. Our algorithm consists of using (i) a novel space-time k-means clustering to obtain spatiotemporally coherent intensity clusters, and (ii) a density-based spatial clustering of applications with noise (DBSCAN) to spatiotemporally section the intensity clusters into individual events. We discuss the development of the algorithm, the selection, tuning and meaning of the parameters within each step, as well as its validation. Finally, we apply the algorithm to a spatiotemporal drought index, standardized vapor pressure deficit drought index (SVDI), over the continental United States (US) from 1980–2021 and show that it captures historical drought events over the continental United States and their spatiotemporal extents.

17 WIND ENERGY↗

TU-H-CAMPUS-JeP1-02: Fully Automatic Verification of Automatically Contoured Normal Tissues in the Head and Neck

Purpose: To investigate and validate the use of an independent deformable-based contouring algorithm for automatic verification of auto-contoured structures in the head and neck towards fully automated treatment planning. Methods: Two independent automatic contouring algorithms [(1) Eclipse’s Smart Segmentation followed by pixel-wise majority voting, (2) an in-house multi-atlas based method] were used to create contours of 6 normal structures of 10 head-and-neck patients. After rating by a radiation oncologist, the higher performing algorithm was selected as the primary contouring method, the other used for automatic verification of the primary. To determine the ability of the verification algorithm to detect incorrect contours, contours from the primary method were shifted from 0.5 to 2cm. Using a logit model the structure-specific minimum detectable shift was identified. The models were then applied to a set of twenty different patients and the sensitivity and specificity of the models verified. Results: Per physician rating, the multi-atlas method (4.8/5 point scale, with 3 rated as generally acceptable for planning purposes) was selected as primary and the Eclipse-based method (3.5/5) for verification. Mean distance to agreement and true positive rate were selected as covariates in an optimized logit model. These models, when applied to a group of twenty different patients, indicated that shifts could be detected at 0.5cm (brain), 0.75cm (mandible, cord), 1cm (brainstem, cochlea), or 1.25cm (parotid), with sensitivity and specificity greater than 0.95. If sensitivity and specificity constraints are reduced to 0.9, detectable shifts of mandible and brainstem were reduced by 0.25cm. These shifts represent additional safety margins which might be considered if auto-contours are used for automatic treatment planning without physician review. Conclusion: Automatically contoured structures can be automatically verified. This fully automated process could be used to flag auto-contours for special review or used with safety margins in a fully automatic treatment planning system.

60 APPLIED LIFE SCIENCES↗

Algorithm for NO2 Vertical Column Retrieval from the Ozone Monitoring Instrument

We describe the operational algorithm for the retrieval of stratospheric, tropospheric, and total column densities of nitrogen dioxide NO2 from earthshine radiances measured by the Ozone Monitoring Instrument (OMI), aboard the EOS-Aura satellite. The algorithm uses the DOAS method for the retrieval of slant column NO densities. Air mass factors (AMFs) calculated from a stratospheric NO2 profile are used to make initial estimates of the vertical column density. Using data collected over a 24-h period, a smooth estimate of the global stratospheric field is constructed. Where the initial vertical column densities exceed the estimated stratospheric field, we infer the presence of tropospheric NO2, and recalculate the vertical column density (VCD) using an AMF calculated from an assumed tropospheric NO2 profile. The parameters that control the operational algorithm were selected with the aid of a set of data assembled from stratospheric and tropospheric chemical transport models. We apply the optimized algorithm to OMI data and present global maps of NO2 VCDs for the first time.

Bucsela, Eric J.↗

Model Based Optimal Sensor Network Design for Condition Monitoring in an IGCC Plant

This report summarizes the achievements and final results of this program. The objective of this program is to develop a general model-based sensor network design methodology and tools to address key issues in the design of an optimal sensor network configuration: the type, location and number of sensors used in a network, for online condition monitoring. In particular, the focus in this work is to develop software tools for optimal sensor placement (OSP) and use these tools to design optimal sensor network configuration for online condition monitoring of gasifier refractory wear and radiant syngas cooler (RSC) fouling. The methodology developed will be applicable to sensing system design for online condition monitoring for broad range of applications. The overall approach consists of (i) defining condition monitoring requirement in terms of OSP and mapping these requirements in mathematical terms for OSP algorithm, (ii) analyzing trade-off of alternate OSP algorithms, down selecting the most relevant ones and developing them for IGCC applications (iii) enhancing the gasifier and RSC models as required by OSP algorithms, (iv) applying the developed OSP algorithm to design the optimal sensor network required for the condition monitoring of an IGCC gasifier refractory and RSC fouling. Two key requirements for OSP for condition monitoring are desired precision for the monitoring variables (e.g. refractory wear) and reliability of the proposed sensor network in the presence of expected sensor failures. The OSP problem is naturally posed within a Kalman filtering approach as an integer programming problem where the key requirements of precision and reliability are imposed as constraints. The optimization is performed over the overall network cost. Based on extensive literature survey two formulations were identified as being relevant to OSP for condition monitoring; one based on LMI formulation and the other being standard INLP formulation. Various algorithms to solve these two formulations were developed and validated. For a given OSP problem the computation efficiency largely depends on the “size” of the problem. Initially a simplified 1-D gasifier model assuming axial and azimuthal symmetry was used to test out various OSP algorithms. Finally these algorithms were used to design the optimal sensor network for condition monitoring of IGCC gasifier refractory wear and RSC fouling. The sensors type and locations obtained as solution to the OSP problem were validated using model based sensing approach. The OSP algorithm has been developed in a modular form and has been packaged as a software tool for OSP design where a designer can explore various OSP design algorithm is a user friendly way. The OSP software tool is implemented in Matlab/Simulink© in-house. The tool also uses few optimization routines that are freely available on World Wide Web. In addition a modular Extended Kalman Filter (EKF) block has also been developed in Matlab/Simulink© which can be utilized for model based sensing of important process variables that are not directly measured through combining the online sensors with model based estimation once the hardware sensor and their locations has been finalized. The OSP algorithm details and the results of applying these algorithms to obtain optimal sensor location for condition monitoring of gasifier refractory wear and RSC fouling profile are summarized in this final report.

20 FOSSIL-FUELED POWER PLANTS↗

The use of Lanczos's method to solve the large generalized symmetric definite eigenvalue problem

The generalized eigenvalue problem, Kx = Lambda Mx, is of significant practical importance, especially in structural enginering where it arises as the vibration and buckling problem. A new algorithm, LANZ, based on Lanczos's method is developed. LANZ uses a technique called dynamic shifting to improve the efficiency and reliability of the Lanczos algorithm. A new algorithm for solving the tridiagonal matrices that arise when using Lanczos's method is described. A modification of Parlett and Scott's selective orthogonalization algorithm is proposed. Results from an implementation of LANZ on a Convex C-220 show it to be superior to a subspace iteration code.

Jones, Mark T.↗

Data compression using adaptive transform coding. Appendix 1: Item 1

Adaptive low-rate source coders are described in this dissertation. These coders adapt by adjusting the complexity of the coder to match the local coding difficulty of the image. This is accomplished by using a threshold driven maximum distortion criterion to select the specific coder used. The different coders are built using variable blocksized transform techniques, and the threshold criterion selects small transform blocks to code the more difficult regions and larger blocks to code the less complex regions. A theoretical framework is constructed from which the study of these coders can be explored. An algorithm for selecting the optimal bit allocation for the quantization of transform coefficients is developed. The bit allocation algorithm is more fully developed, and can be used to achieve more accurate bit assignments than the algorithms currently used in the literature. Some upper and lower bounds for the bit-allocation distortion-rate function are developed. An obtainable distortion-rate function is developed for a particular scalar quantizer mixing method that can be used to code transform coefficients at any rate.

Rost, Martin Christopher↗

Performance of the missing transverse momentum triggers for the ATLAS detector during Run-2 data taking

The factor of four increase in the LHC luminosity, from 0.5 × 10 34 cm -2 s -1 to 2.0 × 10 34 cm -2 s -1 , and the corresponding increase in pile-up collisions during the 2015–2018 data-taking period, presented a challenge for the ATLAS trigger, particularly for those algorithms that select events with missing transverse momentum. The output data rate at fixed threshold typically increases exponentially with the number of pile-up collisions, so the legacy algorithms from previous LHC data-taking periods had to be tuned and new approaches developed to maintain the high trigger efficiency achieved in earlier operations. A study of the trigger performance and comparisons with simulations show that these changes resulted in event selection efficiencies of > 98% for this period, meeting and in some cases exceeding the performance of similar triggers in earlier run periods, while at the same time keeping the necessary bandwidth within acceptable limits.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗