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 361 records · Page 20

Identifying TeV Source Candidates among Fermi -LAT Unclassified Blazars

Blazars, in particular the subclass of high synchrotron peaked active galactic nuclei are among the main targets for the present generation of Imaging Atmospheric Cerenkov Telescopes (IACTs), and they will remain of great importance for very high-energy γ-ray science in the era of the Cerenkov Telescope Array (CTA). Observations by IACTs, which have relatively small fields of view (~few degrees), are limited by viewing conditions; therefore, it is important to select the most promising targets to increase the number of detections. The aim of this paper is to search for unclassified blazars among known γ-ray sources from the Fermi Large Area Telescope (LAT) third source catalog that are likely detectable with IACTs or CTA. We use an artificial neural network algorithm and updated analysis of Fermi-LAT data. We found 80 γ-ray source candidates, and for the highest-confidence candidates, we calculate their potential detectability with IACTs and CTA based on an extrapolation of their energy spectra. Follow-up observations of our source candidates could significantly increase the current TeV source population sample and ultimately confirm the efficiency of our algorithm to select TeV sources.

79 ASTRONOMY AND ASTROPHYSICS↗

Neural Network Control of a Magnetically Suspended Rotor System

Magnetic bearings offer significant advantages because they do not come into contact with other parts during operation, which can reduce maintenance. Higher speeds, no friction, no lubrication, weight reduction, precise position control, and active damping make them far superior to conventional contact bearings. However, there are technical barriers that limit the application of this technology in industry. One of them is the need for a nonlinear controller that can overcome the system nonlinearity and uncertainty inherent in magnetic bearings. At the NASA Lewis Research Center, a neural network was selected as a nonlinear controller because it generates a neural model without any detailed information regarding the internal working of the magnetic bearing system. It can be used even for systems that are too complex for an accurate system model to be derived. A feed-forward architecture with a back-propagation learning algorithm was selected because of its proven performance, accuracy, and relatively easy implementation.

Choi, Benjamin B.↗

Assessing Historical Variability of South Asian Monsoon Lows and Depressions With an Optimized Tracking Algorithm

Abstract Cyclonic low‐pressure systems (LPS) produce abundant rainfall in South Asia, where they are traditionally categorized as monsoon lows, monsoon depressions, and more intense cyclonic storms. The India Meteorological Department (IMD) has tracked monsoon depressions for over a century, finding a large decline in their number in recent decades, but their methods have changed over time and do not include monsoon lows. This study presents a fast, objective algorithm for identifying monsoon LPS and uses it to assess interannual variability and trends in reanalyses. Variables and thresholds used in the algorithm are selected to best match a subjectively analyzed LPS data set while minimizing disagreement between four reanalyses in a training period. The stream function of 850 hPa horizontal wind is found to be optimal in this sense; it is less noisy than vorticity and represents the complete nondivergent wind, even when flow is not geostrophic. Using this algorithm, LPS statistics are computed for five reanalyses, and none show a detectable trend in monsoon depression counts since 1979. Both the Japanese 55‐year Reanalysis (JRA‐55) and the IMD data set show a step‐like reduction in depression counts when they began using geostationary satellite data, in 1979 and 1982, respectively; the 1958–2018 linear trend in JRA‐55, however, is smaller than in the IMD data set, and its error bar includes 0. There are more LPS in seasons with above‐average monsoon rainfall and in La Niña years, but few other large‐scale modes of interannual variability are found to modulate LPS counts, lifetimes, or track length consistently across reanalyses.

54 ENVIRONMENTAL SCIENCES↗

MT's algorithm: A new algorithm to search for the optimum set of modulation indices for simultaneous range, command, and telemetry

MT's algorithm was developed as an aid in the design of space telecommunications systems when utilized with simultaneous range/command/telemetry operations. This algorithm provides selection of modulation indices for: (1) suppression of undesired signals to achieve desired link performance margins and/or to allow for a specified performance degradation in the data channel (command/telemetry) due to the presence of undesired signals (interferers); and (2) optimum power division between the carrier, the range, and the data channel. A software program using this algorithm was developed for use with MathCAD software. This software program, called the MT program, provides the computation of optimum modulation indices for all possible cases that are recommended by the Consultative Committee on Space Data System (CCSDS) (with emphasis on the squarewave, NASA/JPL ranging system).

Nguyen, Tien Manh↗

Enhanced Co-Expression Extrapolation (COXEN) Gene Selection Method for Building Anti-Cancer Drug Response Prediction Models

The co-expression extrapolation (COXEN) method has been successfully used in multiple studies to select genes for predicting the response of tumor cells to a specific drug treatment. Here, we enhance the COXEN method to select genes that are predictive of the efficacies of multiple drugs for building general drug response prediction models that are not specific to a particular drug. The enhanced COXEN method first ranks the genes according to their prediction power for each individual drug and then takes a union of top predictive genes of all the drugs, among which the algorithm further selects genes whose co-expression patterns are well preserved between cancer cases for building prediction models. We apply the proposed method on benchmark in vitro drug screening datasets and compare the performance of prediction models built based on the genes selected by the enhanced COXEN method to that of models built on genes selected by the original COXEN method and randomly picked genes. Models built with the enhanced COXEN method always present a statistically significantly improved prediction performance (adjusted p-value ≤ 0.05). Our results demonstrate the enhanced COXEN method can dramatically increase the power of gene expression data for predicting drug response.

60 APPLIED LIFE SCIENCES↗

JavaGenes: Evolving Graphs with Crossover

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Globus, Al↗

A two step linear statistical technique using leaps and bounds procedure for retrieval of geophysical parameters from microwave radiometric data

A linear statistical technique using a 'leaps and bounds' procedure (Furnival and Wilson, 1974) is developed for retrieving geophysical parameters from remote measurements. It is used for retrieving sea surface temperatures from the Scaning Multichannel Microwave Radiometer (SMMR) on Seasat. The technique uses an efficient algorithm to select the best fixed-size subset of the 10 SMMR channels for linearly retrieving a given geophysical parameter. The 5-channel subset (6.6V, 6.6H 10H, 18V, 21H), where V and H refer to, respectively, the vertical and horizontal polarizations and the numbers are the channel frequencies in gigahertz, gives the minimum rms error in estimating the sea surface temperature. A comparison with ground truth indicates that the algorithm infers the temperature with an rms accuracy of better than 1.5 K under most environmental conditions. A quality control procedure which is seen as holding promise for further improving the accuracy is proposed.

Kakar, R. K.↗

Alignment of Short Reads: A Crucial Step for Application of Next-Generation Sequencing Data in Precision Medicine

Precision medicine or personalized medicine has been proposed as a modernized and promising medical strategy. Genetic variants of patients are the key information for implementation of precision medicine. Next-generation sequencing (NGS) is an emerging technology for deciphering genetic variants. Alignment of raw reads to a reference genome is one of the key steps in NGS data analysis. Many algorithms have been developed for alignment of short read sequences since 2008. Users have to make a decision on which alignment algorithm to use in their studies. Selection of the right alignment algorithm determines not only the alignment algorithm but also the set of suitable parameters to be used by the algorithm. Understanding these algorithms helps in selecting the appropriate alignment algorithm for different applications in precision medicine. Here, we review current available algorithms and their major strategies such as seed-and-extend and q-gram filter. We also discuss the challenges in current alignment algorithms, including alignment in multiple repeated regions, long reads alignment and alignment facilitated with known genetic variants.

59 BASIC BIOLOGICAL SCIENCES↗

Online Planning Algorithm

AVA v2 software selects goals for execution from a set of goals that oversubscribe shared resources. The term goal refers to a science or engineering request to execute a possibly complex command sequence, such as image targets or ground-station downlinks. Developed as an extension to the Virtual Machine Language (VML) execution system, the software enables onboard and remote goal triggering through the use of an embedded, dynamic goal set that can oversubscribe resources. From the set of conflicting goals, a subset must be chosen that maximizes a given quality metric, which in this case is strict priority selection. A goal can never be pre-empted by a lower priority goal, and high-level goals can be added, removed, or updated at any time, and the "best" goals will be selected for execution. The software addresses the issue of re-planning that must be performed in a short time frame by the embedded system where computational resources are constrained. In particular, the algorithm addresses problems with well-defined goal requests without temporal flexibility that oversubscribes available resources. By using a fast, incremental algorithm, goal selection can be postponed in a "just-in-time" fashion allowing requests to be changed or added at the last minute. Thereby enabling shorter response times and greater autonomy for the system under control.

Rabideau, Gregg R.↗

A risk index for multicriterial selection of a logging system with low environmental impact

Setting up the working stages in forest operations is conditioned by environmental protection and forest health requirements. This paper exposes a method for improving the decision-making process by choosing the most environmentally effective logging systems according to terrain configuration and stand characteristics. Such a methodology for selecting machines or logging systems accounting for environment, safety as well as economics, becomes mandatory in the context of sustainable management of forest with multiple functions. Based on analytic hierarchy process analysis the following classification of the environmental performance for four considered alternatives was obtained: skyline system (42.43%), forwarder system (20.22%), skidder system (19.92%) and horse logging system (17.43%). Further, an environmental risk matrix for the most important 28 risk factors specific to any work equipment used in forest operations was produced. In the end, a multicriterial analysis generated a risk index RI ranging between 1.0 and 3.5, which could help choosing the optimal combination of logging system and logging equipment with low environmental impact. In order to demonstrate the usefulness of the proposed approach, a simple application in specific conditions of a harvesting site is presented. - Highlights: • We propose a decision-making algorithm to select eco-friendly logging systems. • Analytic hierarchy process was applied for ranking 4 types of logging systems. • An environmental risk matrix with 28 risk factors in forest operations was made up.

54 ENVIRONMENTAL SCIENCES↗

Selecting representative geological realizations to model subsurface CO 2 storage under uncertainty

Carbon capture and storage (CCS) is one of the quickest and most effective solutions for reducing carbon emissions. The majority of subsurface storage occurs in saline aquifers, for which geological information is lacking which in turn results in geological uncertainty. To evaluate uncertainty in CO 2 injection projections, the use of multiple geological realizations (GRs) has been practiced very commonly. In this approach, hundreds or thousands of high-resolution GRs is used that quickly becomes computationally expensive. This issue can be addressed with representative geological realizations (RGRs) that preserve the uncertainty domain of the ensemble GRs. Here, in this study, we propose the use of unsupervised machine learning (UML) frameworks, including dissimilarity measurement, dimensionality reduction, clustering and sampling algorithms ta select a predetermined number of RGRs. We compare the simulation outputs of the RGR sets and the ensemble using the Kolmogorov–Smirnov (KS) test to select the best UML. The UML frameworks and their associated selection processes are evaluated using a saline aquifer with a single CO 2 injection well and 200 GRs with varying uncertain petrophysical characteristics. The best UML framework is selected to use only 5% of the GRs while maintaining the uncertainty domain of the ensemble GRs. In addition, the best UML framework is tested using a saline aquifer with three CO 2 injection wells and varied GRs. The results show that our proposed UML framework can be used to choose RGRs, capturing the whole uncertainty domain. Our approach leads to a significant reduction in the computational cost associated with scenario testing, decision-making, and development planning for CO 2 storage sites under geological uncertainty.

58 GEOSCIENCES↗

TPSAS-NF1676L-12441-DND

The increasing presence of airport surface surveillance technologies has spawned a strong interest in airport surface traffic management research; the vast majority has assumed that the airport’s runway configuration is known and constant. Tactical Runway Configuration Management (TRCM), one component of NASA’s System Oriented Runway Management concept, plans the airport configuration to optimize traffic efficiency for the forecast weather, traffic, and other factors. While planning runway configuration can provide benefit and is required by other automation concepts, larger benefits are possible by planning other airport configuration decisions, such as runway assignment policies, that are currently made manually by controllers. A laboratory prototype of the TRCM algorithm which selects optimal airport configuration schedules has been implemented and studied within a simulation environment. The presentation will describe simulation results for several airports, under various weather and traffic conditions. The sequence of airport configurations recommended by TRCM result in significantly less delay than the airport configurations that were actually used by controllers, illustrating both the potential benefit from airport configuration optimization and the ability of TRCM to provide effective airport configuration schedules. The application to several, distinct airports demonstrates the approach is capable of handling the differences between airports with a common algorithm, while providing decision support that respects the current procedures at those airports. Consequently, TRCM is able to be deployed to any airport within the current National Airspace System. The TRCM algorithmic approach is also extensible to future operational scenarios. NASA is in the process of transferring the initial TRCM technology to the FAA. Future research will extend the concept and algorithm to provide coordinated plans for metroplex airports and study NextGen applications.

Stephen Atkins↗

TPSAS-NF1676L-12263-DND

The increasing presence of airport surface surveillance technologies has spawned a strong interest in airport surface traffic management research; the vast majority has assumed that the airport’s runway configuration is known and constant. Tactical Runway Configuration Management (TRCM), one component of NASA’s System Oriented Runway Management concept, plans the airport configuration to optimize traffic efficiency for the forecast weather, traffic, and other factors. While planning runway configuration can provide benefit and is required by other automation concepts, larger benefits are possible by planning other airport configuration decisions, such as runway assignment policies, that are currently made manually by controllers. A laboratory prototype of the TRCM algorithm which selects optimal airport configuration schedules has been implemented and studied within a simulation environment. The presentation will describe simulation results for several airports, under various weather and traffic conditions. The sequence of airport configurations recommended by TRCM result in significantly less delay than the airport configurations that were actually used by controllers, illustrating both the potential benefit from airport configuration optimization and the ability of TRCM to provide effective airport configuration schedules. The application to several, distinct airports demonstrates the approach is capable of handling the differences between airports with a common algorithm, while providing decision support that respects the current procedures at those airports. Consequently, TRCM is able to be deployed to any airport within the current National Airspace System. The TRCM algorithmic approach is also extensible to future operational scenarios. NASA is in the process of transferring the initial TRCM technology to the FAA. Future research will extend the concept and algorithm to provide coordinated plans for metroplex airports and study NextGen applications.

Stephen Atkins↗

Accommodation of practical constraints by a linear programming jet select

An experimental spacecraft control system will be incorporated into the Space Shuttle flight software and exercised during a forthcoming mission to evaluate its performance and handling qualities. The control system incorporates a 'phase space' control law to generate rate change requests and a linear programming jet select to compute jet firings. Posed as a linear programming problem, jet selection must represent the rate change request as a linear combination of jet acceleration vectors where the coefficients are the jet firing times, while minimizing the fuel expended in satisfying that request. This problem is solved in real time using a revised Simplex algorithm. In order to implement the jet selection algorithm in the Shuttle flight control computer, it was modified to accommodate certain practical features of the Shuttle such as limited computer throughput, lengthy firing times, and a large number of control jets. To the authors' knowledge, this is the first such application of linear programming. It was made possible by careful consideration of the jet selection problem in terms of the properties of linear programming and the Simplex algorithm. These modifications to the jet select algorithm may by useful for the design of reaction controlled spacecraft.

Bergmann, E.↗

Integrated network design and scheduling problems :

We consider the class of integrated network design and scheduling problems. These problems focus on selecting and scheduling operations that will change the characteristics of a network, while being speci cally concerned with the performance of the network over time. Motivating applications of INDS problems include infrastructure restoration after extreme events and building humanitarian distribution supply chains. While similar models have been proposed, no one has performed an extensive review of INDS problems from their complexity, network and scheduling characteristics, information, and solution methods. We examine INDS problems under a parallel identical machine scheduling environment where the performance of the network is evaluated by solving classic network optimization problems. We classify that all considered INDS problems as NP-Hard and propose a novel heuristic dispatching rule algorithm that selects and schedules sets of arcs based on their interactions in the network. We present computational analysis based on realistic data sets representing the infrastructures of coastal New Hanover County, North Carolina, lower Manhattan, New York, and a realistic arti cial community CLARC County. These tests demonstrate the importance of a dispatching rule to arrive at near-optimal solutions during real-time decision making activities. We extend INDS problems to incorporate release dates which represent the earliest an operation can be performed and exible release dates through the introduction of specialized machine(s) that can perform work to move the release date earlier in time. An online optimization setting is explored where the release date of a component is not known.

Nurre, Sarah G.↗

Discovery and implementation of a novel pathway for n-butanol production via 2-oxoglutarate

Background: One of the European Union directives indicates that 10% of all fuels must be bio-synthesized by 2020. In this regard, biobutanol—natively produced by clostridial strains—poses as a promising alternative biofuel. One possible approach to overcome the difculties of the industrial exploration of the native producers is the expression of more suitable pathways in robust microorganisms such as Escherichia coli. The enumeration of novel pathways is a powerful tool, allowing to identify non-obvious combinations of enzymes to produce a target compound. Results: This work describes the in silico driven design of E. coli strains able to produce butanol via 2-oxoglutarate by a novel pathway. This butanol pathway was generated by a hypergraph algorithm and selected from an initial set of 105,954 diferent routes by successively applying diferent flters, such as stoichiometric feasibility, size and novelty. The implementation of this pathway involved seven catalytic steps and required the insertion of nine heterologous genes from various sources in E. coli distributed in three plasmids. Expressing butanol genes in E. coli K12 and cultivation in High-Density Medium formulation seem to favor butanol accumulation via the 2-oxoglutarate pathway. The maximum butanol titer obtained was 85±1 mg L-1 by cultivating the cells in bioreactors. Conclusions: In this work, we were able to successfully translate the computational analysis into in vivo applications, designing novel strains of E. coli able to produce n-butanol via an innovative pathway. Our results demonstrate that enumeration algorithms can broad the spectrum of butanol producing pathways. This validation encourages further research to other target compounds.

09 BIOMASS FUELS↗

Enhanced Contact Graph Routing (ECGR) MACHETE Simulation Model

Contact Graph Routing (CGR) for Delay/Disruption Tolerant Networking (DTN) space-based networks makes use of the predictable nature of node contacts to make real-time routing decisions given unpredictable traffic patterns. The contact graph will have been disseminated to all nodes before the start of route computation. CGR was designed for space-based networking environments where future contact plans are known or are independently computable (e.g., using known orbital dynamics). For each data item (known as a bundle in DTN), a node independently performs route selection by examining possible paths to the destination. Route computation could conceivably run thousands of times a second, so computational load is important. This work refers to the simulation software model of Enhanced Contact Graph Routing (ECGR) for DTN Bundle Protocol in JPL's MACHETE simulation tool. The simulation model was used for performance analysis of CGR and led to several performance enhancements. The simulation model was used to demonstrate the improvements of ECGR over CGR as well as other routing methods in space network scenarios. ECGR moved to using earliest arrival time because it is a global monotonically increasing metric that guarantees the safety properties needed for the solution's correctness since route re-computation occurs at each node to accommodate unpredicted changes (e.g., traffic pattern, link quality). Furthermore, using earliest arrival time enabled the use of the standard Dijkstra algorithm for path selection. The Dijkstra algorithm for path selection has a well-known inexpensive computational cost. These enhancements have been integrated into the open source CGR implementation. The ECGR model is also useful for route metric experimentation and comparisons with other DTN routing protocols particularly when combined with MACHETE's space networking models and Delay Tolerant Link State Routing (DTLSR) model.

Segui, John S.↗

Computer-Aided Diagnosis of Lung Nodules in Computed Tomography by Using Phylogenetic Diversity, Genetic Algorithm, and SVM

Lung cancer is pointed as the major cause of death among patients with cancer throughout the world. This work is intended to develop a methodology for diagnosis of lung nodules using images from the Image Database Consortium and Image Database Resource Initiative (LIDC-IDRI). The proposed methodology uses image processing and pattern recognition techniques. In order to differentiate between the patterns of malignant and benign nodules, we used phylogenetic diversity by means of particular indexes, that are: intensive quadratic entropy, extensive quadratic entropy, average taxonomic distinctness, total taxonomic distinctness, and pure diversity indexes. After that, we applied the genetic algorithm for selection of the best model. In the tests’ stage, we applied the proposed methodology to 1405 (394 malignant and 1011 benign) nodules. The proposed work presents promising results at the classification into malignant and benign, achieving accuracy of 92.52%, sensitivity of 93.1% and specificity of 92.26%. The results demonstrated a good rate of correct detections using texture features. Since a precocious detection allows a faster therapeutic intervention, thus a more favorable prognostic to the patient, we propose herein a methodology that contributes to the area in this aspect.

62 RADIOLOGY AND NUCLEAR MEDICINE↗