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 487 records · Page 27

Lyapunov controlled counterdiabatic quantum optimization

We introduce a quantum algorithm that integrates counterdiabatic (CD) protocols with quantum Lyapunov control (QLC) to address combinatorial optimization problems. This approach offers versatility, allowing implementation as either a digital-analog or purely digital algorithm based on selected control strategies. By examining spin-glass Hamiltonians, we illustrate how the algorithm can explore alternative paths to enhance solution outcomes compared to conventional CD techniques. This method reduces dependence on extensive higher-order CD terms and on classical optimization techniques, making it more suitable for existing quantum computing platforms. The combination of digital compression via CD protocols and the adaptable nature of QLC methods positions this approach as a promising candidate for near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Numerical Algorithm for the Solution of a Phase-Field Model of Polycrystalline Materials

We describe an algorithm for the numerical solution of a phase-field model (PFM) of microstructure evolution in polycrystalline materials. The PFM system of equations includes a local order parameter, a quaternion representation of local orientation and a species composition parameter. The algorithm is based on the implicit integration of a semidiscretization of the PFM system using a backward difference formula (BDF) temporal discretization combined with a Newton-Krylov algorithm to solve the nonlinear system at each time step. The BDF algorithm is combined with a coordinate projection method to maintain quaternion unit length, which is related to an important solution invariant. A key element of the Newton-Krylov algorithm is the selection of a preconditioner to accelerate the convergence of the Generalized Minimum Residual algorithm used to solve the Jacobian linear system in each Newton step. Results are presented for the application of the algorithm to 2D and 3D examples.

36 MATERIALS SCIENCE↗

Strain gage selection in loads equations using a genetic algorithm

Traditionally, structural loads are measured using strain gages. A loads calibration test must be done before loads can be accurately measured. In one measurement method, a series of point loads is applied to the structure, and loads equations are derived via the least squares curve fitting algorithm using the strain gage responses to the applied point loads. However, many research structures are highly instrumented with strain gages, and the number and selection of gages used in a loads equation can be problematic. This paper presents an improved technique using a genetic algorithm to choose the strain gages used in the loads equations. Also presented are a comparison of the genetic algorithm performance with the current T-value technique and a variant known as the Best Step-down technique. Examples are shown using aerospace vehicle wings of high and low aspect ratio. In addition, a significant limitation in the current methods is revealed. The genetic algorithm arrived at a comparable or superior set of gages with significantly less human effort, and could be applied in instances when the current methods could not.

Source record↗

Hazard Boresight Relative Navigation for Safe Lunar Landing

In the area of planetary landing, hazard detection and avoidance is the act of driving a vehicle to a safe landing area using onboard resources. A hazard detection sensor is used to scan the terrain and these measurements are evaluated to determine where the safe landing sites are located. The selected site is generally not the same as the nominal target, so the vehicle must divert to the new site. This activity involves the interaction between several components, including a suite of onboard GNC algorithms that work together to efficiently choose and divert to a new site. This paper presents the Hazard Boresight Relative Navigation concept, which is a method that provides a common interface between the hazard scan, safe-site selection algorithm, size of the target-relative landing ellipse, divert offset distance and guidance targeting algorithm. After the safe-site is selected from the hazard scan, the original inertial target is replaced with a vehicle-relative target, which is initialized by a measurement from the hazard scan. The new target-relative position state is estimated over time in the navigation filter, and is fed to the guidance algorithm to perform the divert maneuver. In addition to detailing the Hazard Boresight Relative Navigation concept, this paper also presents some general landing terms that can be used in the greater discussion, as well as analysis on how to estimate and predict the vehicle footprint dispersion ellipse during flight, which is used in the safe-site selection algorithm.

Stephen R. Steffes↗

Hazard Boresight Relative Navigation for Safe Lunar Landing

In the area of planetary landing, hazard detection and avoidance is the act of driving a vehicle to a safe landing area using onboard resources. A hazard detection sensor is used to scan the terrain and these measurements are evaluated to determine where the safe landing sites are located. The selected site is generally not the same as the nominal target, so the vehicle must divert to the new site. This activity involves the interaction between several components, including a suite of onboard GNC algorithms that work together to efficiently choose and divert to a new site. This paper presents the Hazard Boresight Relative Navigation concept, which is a method that provides a common interface between the hazard scan, safe-site selection algorithm, size of the target-relative landing ellipse, divert offset distance and guidance targeting algorithm. After the safe-site is selected from the hazard scan, the original inertial target is replaced with a vehicle-relative target, which is initialized by a measurement from the hazard scan. The new target-relative position state is estimated over time in the navigation filter, and is fed to the guidance algorithm to perform the divert maneuver. In addition to detailing the Hazard Boresight Relative Navigation concept, this paper also presents some general landing terms that can be used in the greater discussion, as well as analysis on how to estimate and predict the vehicle footprint dispersion ellipse during flight, which is used in the safe-site selection algorithm.

Stephen Steffes↗

Sensor System and Observer Algorithm Co-Design For Modern Internal Combustion Engine Air Management Based on H2 Optimization

This paper outlines a novel sensor selection and observer design algorithm for linear time-invariant systems with both process and measurement noise based on H 2 optimization to optimize the tradeoff between the observer error and the number of required sensors. The optimization problem is relaxed to a sequence of convex optimization problems that minimize the cost function consisting of the H 2 norm of the observer error and the weighted l 1 norm of the observer gain. An LMI formulation allows for efficient solution via semi-definite programing. The approach is applied here, for the first time, to a turbo-charged spark-ignited engine using exhaust gas circulation to determine the optimal sensor sets for real-time intake manifold burnt gas mass fraction estimation. Simulation with the candidate estimator embedded in a high fidelity engine GT-Power model demonstrates that the optimal sensor sets selected using this algorithm have the best H 2 estimation performance. Sensor redundancy is also analyzed based on the algorithm results. This algorithm is applicable for any type of modern internal combustion engines to reduce system design time and experimental efforts typically required for selecting optimal sensor sets.

Zhang, Xu↗

Information Gain Based Dimensionality Selection for Classifying Text Documents

Selecting the optimal dimensions for various knowledge extraction applications is an essential component of data mining. Dimensionality selection techniques are utilized in classification applications to increase the classification accuracy and reduce the computational complexity. In text classification, where the dimensionality of the dataset is extremely high, dimensionality selection is even more important. This paper presents a novel, genetic algorithm based methodology, for dimensionality selection in text mining applications that utilizes information gain. The presented methodology uses information gain of each dimension to change the mutation probability of chromosomes dynamically. Since the information gain is calculated a priori, the computational complexity is not affected. The presented method was tested on a specific text classification problem and compared with conventional genetic algorithm based dimensionality selection. The results show an improvement of 3% in the true positives and 1.6% in the true negatives over conventional dimensionality selection methods.

97 MATHEMATICS AND COMPUTING↗

Computer simulation and evaluation of edge detection algorithms and their application to automatic path selection

The construction of an autonomous roving vehicle requires the development of complex data-acquisition and processing systems, which determine the path along which the vehicle travels. Thus, a vehicle must possess algorithms which can (1) reliably detect obstacles by processing sensor data, (2) maintain a constantly updated model of its surroundings, and (3) direct its immediate actions to further a long range plan. The first function consisted of obstacle recognition. Obstacles may be identified by the use of edge detection techniques. Therefore, the Kalman Filter was implemented as part of a large scale computer simulation of the Mars Rover. The second function consisted of modeling the environment. The obstacle must be reconstructed from its edges, and the vast amount of data must be organized in a readily retrievable form. Therefore, a Terrain Modeller was developed which assembled and maintained a rectangular grid map of the planet. The third function consisted of directing the vehicle's actions.

Longendorfer, B. A.↗

Maximum likelihood positioning algorithm for high-resolution PET scanners

Purpose: In high-resolution positron emission tomography (PET), lightsharing elements are incorporated into typical detector stacks to read out scintillator arrays in which one scintillator element (crystal) is smaller than the size of the readout channel. In order to identify the hit crystal by means of the measured light distribution, a positioning algorithm is required. One commonly applied positioning algorithm uses the center of gravity (COG) of the measured light distribution. The COG algorithm is limited in spatial resolution by noise and intercrystal Compton scatter. The purpose of this work is to develop a positioning algorithm which overcomes this limitation. Methods: The authors present a maximum likelihood (ML) algorithm which compares a set of expected light distributions given by probability density functions (PDFs) with the measured light distribution. Instead of modeling the PDFs by using an analytical model, the PDFs of the proposed ML algorithm are generated assuming a single-gamma-interaction model from measured data. The algorithm was evaluated with a hot-rod phantom measurement acquired with the preclinical HYPERION II {sup D} PET scanner. In order to assess the performance with respect to sensitivity, energy resolution, and image quality, the ML algorithm was compared to a COG algorithm which calculates the COG from a restricted set of channels. The authors studied the energy resolution of the ML and the COG algorithm regarding incomplete light distributions (missing channel information caused by detector dead time). Furthermore, the authors investigated the effects of using a filter based on the likelihood values on sensitivity, energy resolution, and image quality. Results: A sensitivity gain of up to 19% was demonstrated in comparison to the COG algorithm for the selected operation parameters. Energy resolution and image quality were on a similar level for both algorithms. Additionally, the authors demonstrated that the performance of the ML algorithm is less prone to missing channel information. A likelihood filter visually improved the image quality, i.e., the peak-to-valley increased up to a factor of 3 for 2-mm-diameter phantom rods by rejecting 87% of the coincidences. A relative improvement of the energy resolution of up to 12.8% was also measured rejecting 91% of the coincidences. Conclusions: The developed ML algorithm increases the sensitivity by correctly handling missing channel information without influencing energy resolution or image quality. Furthermore, the authors showed that energy resolution and image quality can be improved substantially by rejecting events that do not comply well with the single-gamma-interaction model, such as Compton-scattered events.

60 APPLIED LIFE SCIENCES↗

A Comparison of Image Quality Evaluation Techniques for Transmission X-Ray Microscopy

Beamline 6-2c at Stanford Synchrotron Radiation Lightsource (SSRL) is capable of Transmission X-ray Microscopy (TXM) at 30 nm resolution. Raw images from the microscope must undergo extensive image processing before publication. Since typical data sets normally contain thousands of images, it is necessary to automate the image processing workflow as much as possible, particularly for the aligning and averaging of similar images. Currently we align images using the 'phase correlation' algorithm, which calculates the relative offset of two images by multiplying them in the frequency domain. For images containing high frequency noise, this algorithm will align noise with noise, resulting in a blurry average. To remedy this we multiply the images by a Gaussian function in the frequency domain, so that the algorithm ignores the high frequency noise while properly aligning the features of interest (FOI). The shape of the Gaussian is manually tuned by the user until the resulting average image is sharpest. To automatically optimize this process, it is necessary for the computer to evaluate the quality of the average image by quantifying its sharpness. In our research we explored two image sharpness metrics, the variance method and the frequency threshold method. The variance method uses the variance of the image as an indicator of sharpness while the frequency threshold method sums up the power in a specific frequency band. These metrics were tested on a variety of test images, containing both real and artificial noise. To apply these sharpness metrics, we designed and built a MATLAB graphical user interface (GUI) called 'Blur Master.' We found that it is possible for blurry images to have a large variance if they contain high amounts of noise. On the other hand, we found the frequency method to be quite reliable, although it is necessary to manually choose suitable limits for the frequency band. Further research must be performed to design an algorithm which automatically selects these parameters.

99 GENERAL AND MISCELLANEOUS↗

Synthesis of Greedy Algorithms Using Dominance Relations

Greedy algorithms exploit problem structure and constraints to achieve linear-time performance. Yet there is still no completely satisfactory way of constructing greedy algorithms. For example, the Greedy Algorithm of Edmonds depends upon translating a problem into an algebraic structure called a matroid, but the existence of such a translation can be as hard to determine as the existence of a greedy algorithm itself. An alternative characterization of greedy algorithms is in terms of dominance relations, a well-known algorithmic technique used to prune search spaces. We demonstrate a process by which dominance relations can be methodically derived for a number of greedy algorithms, including activity selection, and prefix-free codes. By incorporating our approach into an existing framework for algorithm synthesis, we demonstrate that it could be the basis for an effective engineering method for greedy algorithms. We also compare our approach with other characterizations of greedy algorithms.

Nedunuri, Srinivas↗

Detect-and-Avoid Maneuver Planning: Benefits of Including Route Recapture

Development of Detect-and-avoid (DAA) systems’ maneuver guidance requirements at RTCA has centered on tactical maneuvers away from the intruder. Recapturing the flight-plan route the initial maneuver is not directly taken into account by most DAA maneuver guidance algorithms. This work demonstrates potential challenges and inefficiencies that can arise in recapturing the route after resolving a conflict. Horizontal resolution trajectories for a test matrix of encounters with varying aircraft speeds and geometries are computed by minimizing either flight time or deviation to serve as a baseline. Turn directions computed from a reference DAA algorithm coupled with a pilot selection model and a second algorithm called Autoresolver (AR) are compared to these baseline resolution trajectories. Baseline results show that turning into the intruder yields favorable cost for most encounters. Additional analysis of pilot response data shows that only three-fourths of pilots’ horizontal maneuvers turn into intruders, a percentage much lower than the baseline results. Improvement to a DAA guidance algorithm based on findings in this work is discussed.

Route Recapture↗

Detect-and-Avoid Maneuver Planning: Benefits of Including Route Recapture

Development of Detect-and-avoid (DAA) systems’ maneuver guidance requirements at RTCA has centered on tactical maneuvers away from the intruder. Recapturing the flight-plan route the initial maneuver is not directly taken into account by most DAA maneuver guidance algorithms. This work demonstrates potential challenges and inefficiencies that can arise in recapturing the route after resolving a conflict. Horizontal resolution trajectories for a test matrix of encounters with varying aircraft speeds and geometries are computed by minimizing either flight time or deviation to serve as a baseline. Turn directions computed from a reference DAA algorithm coupled with a pilot selection model and a second algorithm called Autoresolver (AR) are compared to these baseline resolution trajectories. Baseline results show that turning into the intruder yields favorable cost for most encounters. Additional analysis of pilot response data shows that only three-fourths of pilots’ horizontal maneuvers turn into intruders, a percentage much lower than the baseline results. Improvement to a DAA guidance algorithm based on findings in this work is discussed.

Route Recapture↗

Synchronization Algorithms for Co-Simulation of Power Grid and Communication Networks

The ongoing modernization of power grids consists of integrating them with communication networks in order to achieve robust and resilient control of grid operations. To understand the operation of the new smart grid, one approach is to use simulation software. Unfortunately, current power grid simulators at best utilize inadequate approximations to simulate communication networks, if at all. Cooperative simulation of specialized power grid and communication network simulators promises to more accurately reproduce the interactions of real smart grid deployments. However, co-simulation is a challenging problem. A co-simulation must manage the exchange of informa- tion, including the synchronization of simulator clocks, between all simulators while maintaining adequate computational perfor- mance. This paper describes two new conservative algorithms for reducing the overhead of time synchronization, namely Active Set Conservative and Reactive Conservative. We provide a detailed analysis of their performance characteristics with respect to the current state of the art including both conservative and optimistic synchronization algorithms. In addition, we provide guidelines for selecting the appropriate synchronization algorithm based on the requirements of the co-simulation. The newly proposed algorithms are shown to achieve as much as 14% and 63% im- provement, respectively, over the existing conservative algorithm.

co-simulation↗

Interim Calibration Report for the SMMR Simulator

The calibration data obtained during the fall 1978 Nimbus-G underflight mission with the scanning multichannel microwave radiometer (SMMR) simulator on board the NASA CV-990 aircraft were analyzed and an interim calibration algorithm was developed. Data selected for the analysis consisted of in flight sky, first-year sea ice, and open water observations, as well as ground based observations of fixed targets with varied temperatures of selected instrument components. For most of the SMMR channels, a good fit to the selected data set was obtained with the algorithm.

Gloersen, P.↗

Selecting the independent coordinates of manifolds with large aspect ratios

Many manifold embedding algorithms fail apparently when the data manifold has a large aspect ratio (such as a long, thin strip). Here, we formulate success and failure in terms of finding a smooth embedding, showing also that the problem is pervasive and more complex than previously recognized. Mathematically, success is possible under very broad conditions, provided that embedding is done by carefully selected eigenfunctions of the Laplace-Beltrami operator Δ. Hence, we propose a bicriterial Independent Eigencoordinate Selection (IES) algorithm that selects smooth embeddings with few eigenvectors. The algorithm is grounded in theory, has low computational overhead, and is successful on synthetic and large real data.

Meila, Marina↗

DIMPLES: Distributed Influence Maximization for Pandemic pLanning on Exascale Systems

We study exascale parallel algorithms for the selection of intervention or monitoring strategies in massive realistic socio-technical networks through scalable Influence Maximization (InfMax) algorithms. We employ novel techniques to enable efficient scaling on up to 8k nodes of OLCF Frontier, with 65k AMD GPUs and 458k AMD CPU cores. Current state-of-the-art InfMax tools are limited to networks with only a few million actors (vertices) and a few hundred million interactions (edges). By overcoming these limitations, we show that our approach is capable of processing a realistic social contact network of the United States with 285 million nodes and about 8 billion edges. This two orders-of-magnitude improvement over the previous state-of-the-art is obtained by leveraging algorithmic advancements for the InfMax problem and designing several problem-specific approaches to overlap communication with computation, improve GPU efficiency, and lower the application’s memory requirements. We evaluate strong scaling for computing 10k most influential seeds using up to 8k nodes of an exascale system, and weak scaling from 128 to 8k system nodes for seed sets ranging from 625 to 40k seeds. We achieve the fastest-known runtime of 25 minutes while performing 48 million diffusion simulations totaling 2.31 petabytes to identify 40k influential seeds using 8k nodes, and take 5.75 minutes to identify 10k seeds while using 4k nodes.

Minutoli, Marco [Pacific Northwest National Labora↗

Evaluating some computer exhancement algorithms that improve the visibility of cometary morphology

Digital enhancement of cometary images is a necessary tool in studying cometary morphology. Many image processing algorithms, some developed specifically for comets, have been used to enhance the subtle, low contrast coma and tail features. We compare some of the most commonly used algorithms on two different images to evaluate their strong and weak points, and conclude that there currently exists no single 'ideal' algorithm, although the radial gradient spatial filter gives the best overall result. This comparison should aid users in selecting the best algorithm to enhance particular features of interest.

Larson, Stephen M.↗