Search NASA⌕ Search

SEARCH · Search NASA

Results for “combinatorial algorithms”

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 217 records · Page 12

Predicting Metabolic Reaction Networks with Perturbation-Theory Machine Learning (PTML) Models

Background: Checking the connectivity (structure) of complex Metabolic Reaction Networks(MRNs) models proposed for new microorganisms with promising properties is an importantgoal for chemical biology. Objective: In principle, we can perform a hand-on checking (Manual Curation). However, this is achallenging task due to the high number of combinations of pairs of nodes (possible metabolic reactions). Results: The CPTML linear model obtained using the LDA algorithm is able to discriminate nodes(metabolites) with the correct assignation of reactions from incorrect nodes with values of accuracy,specificity, and sensitivity in the range of 85-100% in both training and external validation dataseries. Methods: In this work, we used Combinatorial Perturbation Theory and Machine Learning techniquesto seek a CPTML model for MRNs >40 organisms compiled by Barabasis’ group. First, wequantified the local structure of a very large set of nodes in each MRN using a new class of node indexcalled Markov linear indices fk. Next, we calculated CPT operators for 150000 combinationsof query and reference nodes of MRNs. Last, we used these CPT operators as inputs of differentML algorithms. Conclusion: Meanwhile, PTML models based on Bayesian network, J48-Decision Tree and RandomForest algorithms were identified as the three best non-linear models with accuracy greaterthan 97.5%. The present work opens the door to the study of MRNs of multiple organisms usingPTML models.

Pharmacology & Pharmacy↗

Distributed-Memory Fast Maximal Independent Set

The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those algorithms are designed focusing on shared-memory machines and are analyzed using the PRAM model. These algorithms do not have direct efficient distributed-memory implementations. In this paper, we extend two of Luby’s seminal MIS algorithms, “Luby(A)” and “Luby(B),” to distributed-memory execution, and we evaluate their performance. We compare our results with the “Filtered MIS” implementation in the Combinatorial BLAS library for two types of synthetic graph inputs.

distributed memory parallel↗

Non-targeted discovery-based analysis for gas chromatography with mass spectrometry: A comparison of peak table, tile, and pixel-based Fisher ratio analysis

The ability to discover minute differences between samples or sample classes for gas chromatography coupled to mass spectrometry (GC-MS) can be a challenging endeavor, especially when those differences are not a priori . Fisher ratio (F-ratio) analysis is an apt technique to probe the differences between GC-MS chromatograms. F-ratio analysis is a supervised, non-targeted, discovery-based method that compares two different samples (or sample classes) to reduce the GC-MS dataset into a hit list composed of class distinguishing compounds. Three different F-ratio techniques, peak table, tile, and pixel-based were used to “discover” nine non-native analytes that were spiked into gasoline at four different nominal concentrations of 250, 85, 25, 5 parts-per-million (ppm). For the tile and pixel-based F-ratio calculations, a novel methodology is introduced to improve the sensitivity of the F-ratio calculations while reducing false positives. Furthermore, we use a combinatorial technique using null class comparisons, termed null distribution analysis, to determine a statistical F-ratio cutoff for analysis of the hit lists. The pixel-based algorithm was the most sensitive method and was able to “discover” all nine spiked analytes at a nominal concentration of 250 ppm albeit with one false positive interspersed towards the bottom of the hit list. The pixel-based software was also able to “discover” more of the spiked analytes at the lower concentrations with seven of the spiked analytes “discovered” at 85 ppm, four of the spiked analytes “discovered” at 25 ppm, and one analyte “discovered” at 5 ppm.

47 OTHER INSTRUMENTATION↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

Towards large-scale quantum optimization solvers with few qubits

Quantum computers hold the promise of more efficient combinatorial optimization solvers, which could be game-changing for a broad range of applications. However, a bottleneck for materializing such advantages is that, in order to challenge classical algorithms in practice, mainstream approaches require a number of qubits prohibitively large for near-term hardware. Here we introduce a variational solver for MaxCut problems over $m={{\mathcal{O}}}({n}^{k})$ binary variables using only n qubits, with tunable k > 1. The number of parameters and circuit depth display mild linear and sublinear scalings in m , respectively. Moreover, we analytically prove that the specific qubit-efficient encoding brings in a super-polynomial mitigation of barren plateaus as a built-in feature. Altogether, this leads to high quantum-solver performances. For instance, for m = 7000, numerical simulations produce solutions competitive in quality with state-of-the-art classical solvers. In turn, for m = 2000, experiments with n = 17 trapped-ion qubits feature MaxCut approximation ratios estimated to be beyond the hardness threshold 0.941. Our findings offer an interesting heuristics for quantum-inspired solvers as well as a promising route towards solving commercially-relevant problems on near-term quantum devices.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

HyperSpace

Machine learning (ML) models often contain numerous hyperparameters, free parameters that must be set before the models can be trained. As the number of model hyperparameters increases, their optimization becomes significantly more challenging as we face a combinatorial increase in potential model configurations. Similarly, there is an increased chance that our models’ hyperparameters interact in complex ways. HyperSpace allows a user to optimize complex machine learning algorithms based on their hyperparameters. HyperSpace works by parallelizing parameter search spaces, running Bayesian model based optimization (SMBO) over each of these spaces in parallel. It was designed to be as minimally invasive as possible such that very little change to existing code will be needed to get a user started.

Ramanathan, Arvind↗

Scalable tuning of building models to hourly data

Energy models of existing buildings are unreliable unless calibrated so they correlate well with actual energy usage. Manual tuning requires a skilled professional, is prohibitively expensive for small projects, imperfect, non-repeatable, non-transferable, and not scalable to the dozens of sensor channels that smart meters, smart appliances, and cheap/ubiquitous sensors are beginning to make available today. A scalable, automated methodology is needed to quickly and intelligently calibrate building energy models to all available data, increase the usefulness of those models, and facilitate speed-and-scale penetration of simulation-based capabilities into the marketplace for actualized energy savings. The "Autotune'' project is a novel, model-agnostic methodology which leverages supercomputing, large simulation ensembles, and big data mining with multiple machine learning algorithms to allow automatic calibration of simulations that match measured experimental data in a way that is deployable on commodity hardware. This paper shares several methodologies employed to reduce the combinatorial complexity to a computationally tractable search problem for hundreds of input parameters. Furthermore, accuracy metrics are provided which quantify model error to measured data for either monthly or hourly electrical usage from a highly-instrumented, emulated-occupancy research home.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Epitaxy on polycrystalline substrates

Motivated by combinatorial and high-throughput approaches to the discovery of antibodies and drugs in pharmaceutical research, efforts such as the Materials Genome Initiative (1) have been envisioned to develop similar algorithms for the discovery, design, and realization of next-generation materials, such as superconducting (2), magnetoresistive (3), dielectric (4), and luminescent (5) materials. However, such experimental approaches have not become pervasive across all classes of materials. For example, in the study of thin-film, functional complex oxides, systematic, small-scale exploration has remained the standard. However, studies like that of Wittkamper et al. (6), which explore many different substrates by using a polycrystalline substrate, stand poised to open the door for high-throughput studies of complex materials.

Pandya, Shishir↗

Benchmarking Adiabatic Quantum Optimization for Complex Network Analysis

We lay the foundation for a benchmarking methodology for assessing current and future quantum computers. We pose and begin addressing fundamental questions about how to fairly compare computational devices at vastly different stages of technological maturity. We critically evaluate and offer our own contributions to current quantum benchmarking efforts, in particular those involving adiabatic quantum computation and the Adiabatic Quantum Optimizers produced by D-Wave Systems, Inc. We find that the performance of D-Wave's Adiabatic Quantum Optimizers scales roughly on par with classical approaches for some hard combinatorial optimization problems; however, architectural limitations of D-Wave devices present a significant hurdle in evaluating real-world applications. In addition to identifying and isolating such limitations, we develop algorithmic tools for circumventing these limitations on future D-Wave devices, assuming they continue to grow and mature at an exponential rate for the next several years.

97 MATHEMATICS AND COMPUTING↗

Metrics for Intercomparison of Remapping Algorithms (MIRA) protocol applied to Earth system models

Abstract. Strongly coupled nonlinear phenomena such as those described by Earth system models (ESMs) are composed of multiple component models with independent mesh topologies and scalable numerical solvers. A common operation in ESMs is to remap or interpolate component solution fields defined on their computational mesh to another mesh with a different combinatorial structure and decomposition, e.g., from the atmosphere to the ocean, during the temporal integration of the coupled system. Several remapping schemes are currently in use or available for ESMs. However, a unified approach to compare the properties of these different schemes has not been attempted previously. We present a rigorous methodology for the evaluation and intercomparison of remapping methods through an independently implemented suite of metrics that measure the ability of a method to adhere to constraints such as grid independence, monotonicity, global conservation, and local extrema or feature preservation. A comprehensive set of numerical evaluations is conducted based on a progression of scalar fields from idealized and smooth to more general climate data with strong discontinuities and strict bounds. We examine four remapping algorithms with distinct design approaches, namely ESMF Regrid (Hill et al., 2004), TempestRemap (Ullrich and Taylor, 2015), generalized moving least squares (GMLS) (Trask and Kuberry, 2020) with post-processing filters, and WLS-ENOR (Li et al., 2020). By repeated iterative application of the high-order remapping methods to the test fields, we verify the accuracy of each scheme in terms of their observed convergence order for smooth data and determine the bounded error propagation using challenging, realistic field data on both uniform and regionally refined mesh cases. In addition to retaining high-order accuracy under idealized conditions, the methods also demonstrate robust remapping performance when dealing with non-smooth data. There is a failure to maintain monotonicity in the traditional L2-minimization approaches used in ESMF and TempestRemap, in contrast to stable recovery through nonlinear filters used in both meshless GMLS and hybrid mesh-based WLS-ENOR schemes. Local feature preservation analysis indicates that high-order methods perform better than low-order dissipative schemes for all test cases. The behavior of these remappers remains consistent when applied on regionally refined meshes, indicating mesh-invariant implementations. The MIRA intercomparison protocol proposed in this paper and the detailed comparison of the four algorithms demonstrate that the new schemes, namely GMLS and WLS-ENOR, are competitive compared to standard conservative minimization methods requiring computation of mesh intersections. The work presented in this paper provides a foundation that can be extended to include complex field definitions, realistic mesh topologies, and spectral element discretizations, thereby allowing for a more complete analysis of production-ready remapping packages.

58 GEOSCIENCES↗

Rapid Construction of Fe–Co–Ni Composition-Phase Map by Combinatorial Materials Chip Approach

100 nm thick Fe-Co-Ni materials chips were prepared and isothermally annealed at 500, 600 and 700oC, respectively. Pixel-by-pixel composition and structural mapping was performed by micro-beam X-ray at synchrotron light source. Diffraction images were recorded at a rate of 1 pattern/s. The XRD patterns were automatically processed, phase-identified and categorized by hierarchical clustering algorithm to construct the composition-phase map. Furthermore, the resulting maps are consistent with corresponding isothermal sections reported in the ASM Alloy Phase Diagram DatabaseTM, verifying the effectiveness of the present approach in phase diagram construction.

36 MATERIALS SCIENCE↗

Ultra High Performance Liquid Chromatography with Quadrupole Time-of-Flight Mass Spectrometry and Fisher Ratio Analysis for Discovery-Based Analysis

The ability to discover minute differences between samples or sample classes for ultrahigh performance liquid chromatography coupled to quadrupole time-of-flight mass spectrometry (UHPLC-QTOF) can be a challenging endeavor especially when these differences are not known a priori. Indeed a typical UHPLC-QTOF analysis time of ~15 minutes can generate over 4 gigabytes of information for a single sample. Implementation of chemometrics such as Fisher ratio (F-ratio) analysis will allow the analyst to quickly and precise probe the chemical differences between different samples or sample classes. F-ratio analysis can be used to find sample or sample class distinguishing compounds reducing the 5 gigabytes of information into a simple, yet informative hit list. Moreover through combinatorial rearrangement, it is possible to determine a F-ratio threshold to separate the real and non-real hits. The F-ratio software presented herein is a semi-automated algorithm that processes the raw, exported .csv files from the SCIEX 500R QTOF in as little as 30 seconds. While further research is needed to modify and perfect the software to deal with high resolution mass spectra precise to 0.0001 Daltons, the current software, precise to 0.1 Da, is able to find significant chemical differences despite some of them being at extremely low concentrations nearing the limit of detection.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal mapping of irregular finite element domains to parallel processors

Mapping the solution domain of n-finite elements into N-subdomains that may be processed in parallel by N-processors is an optimal one if the subdomain decomposition results in a well-balanced workload distribution among the processors. The problem is discussed in the context of irregular finite element domains as an important aspect of the efficient utilization of the capabilities of emerging multiprocessor computers. Finding the optimal mapping is an intractable combinatorial optimization problem, for which a satisfactory approximate solution is obtained here by analogy to a method used in statistical mechanics for simulating the annealing process in solids. The simulated annealing analogy and algorithm are described, and numerical results are given for mapping an irregular two-dimensional finite element domain containing a singularity onto the Hypercube computer.

Flower, J.↗

Optimization of the computational load of a hypercube supercomputer onboard a mobile robot

A combinatorial optimization methodology is developed, which enables the efficient use of hypercube multiprocessors onboard mobile intelligent robots dedicated to time-critical missions. The methodology is implemented in terms of large-scale concurrent algorithms based either on fast simulated annealing, or on nonlinear asynchronous neural networks. In particular, analytic expressions are given for the effect of single-neuron perturbations on the systems' configuration energy. Compact neuromorphic data structures are used to model effects such as precedence constraints, processor idling times, and task-schedule overlaps. Results for a typical robot-dynamics benchmark are presented.

Barhen, Jacob↗

Performance of Optimized Actuator and Sensor Arrays in an Active Noise Control System

Experiments have been conducted in NASA Langley's Acoustics and Dynamics Laboratory to determine the effectiveness of optimized actuator/sensor architectures and controller algorithms for active control of harmonic interior noise. Tests were conducted in a large scale fuselage model - a composite cylinder which simulates a commuter class aircraft fuselage with three sections of trim panel and a floor. Using an optimization technique based on the component transfer functions, combinations of 4 out of 8 piezoceramic actuators and 8 out of 462 microphone locations were evaluated against predicted performance. A combinatorial optimization technique called tabu search was employed to select the optimum transducer arrays. Three test frequencies represent the cases of a strong acoustic and strong structural response, a weak acoustic and strong structural response and a strong acoustic and weak structural response. Noise reduction was obtained using a Time Averaged/Gradient Descent (TAGD) controller. Results indicate that the optimization technique successfully predicted best and worst case performance. An enhancement of the TAGD control algorithm was also evaluated. The principal components of the actuator/sensor transfer functions were used in the PC-TAGD controller. The principal components are shown to be independent of each other while providing control as effective as the standard TAGD.

Palumbo, D. L.↗

Performance of Optimized Actuator and Sensor Arrays in an Active Noise Control System

Experiments have been conducted in NASA Langley s Acoustics and Dynamics Laboratory to determine the effectiveness of optimized actuator/sensor architectures and controller algorithms for active control of harmonic interior noise. Tests were conducted in a large scale fuselage model - a composite cylinder which simulates a commuter class aircraft fuselage with three sections of trim panel and a floor. Using an optimization technique based on the component transfer functions, combinations of 4 out of 8 piezoceramic actuators and 8 out of 462 microphone locations were evaluated against predicted performance. A combinatorial optimization technique call tabu search was employed to select the optimum transducer arrays. Three test frequencies represent the cases of a strong acoustic and strong structural response, a weak acoustic and strong structural response and a strong acoustic and weak structural response. Noise reduction was obtained using a Time Averaged/Gradient Descent (TAGD) controller. Results indicate that the optimization technique successfully predicted best and worst case performance. An enhancement of the TAGD control algorithm was also evaluated. The principal components of the actuator/sensor transfer functions were used in the PC-TAGD controller. The principal components are shown to be independent of each other while providing control as effective as the standard TAGD.

Palumbo, D. L.↗

Quantitative Detection of Single Molecules in Fluorescence Microscopy Images

Fluorescence imaging and counting of single molecules adsorbed or bound to surfaces are being employed in a number of quantitative analysis applications. Reliable molecular counts with knowledge of counting uncertainties, both false-positive and false-negative probabilities, are critical to these applications. By counting stationary single molecules on a surface, spatial criteria may be applied to the image analysis to improve confidence in detection, which is especially critical when detecting single fluorescent labels. In this work, we describe a simple approach to incorporating spatial criteria for counting single molecules by using an intensity threshold to locate regions with multiple, adjacent intense pixels, where the size of these regions is guided by the point-spread function of the microscope. By requiring multiple, spatially correlated bright pixels, false-positive events resulting from random samples of background noise are minimized. The reliability of detection is established by quantitative knowledge of the distributions of background and signals. By measuring and modeling both the background and single-molecule intensity distributions, false-positive and false-negative detection probabilities are estimated for arbitrary threshold parameters by using combinatorial statistics. From this theory, detection parameters can be optimized to minimize false-positive and false-negative probabilities, which can be calculated explicitly. For detection of single rhodamine 6G molecules at a threshold set at 2.5 times the standard deviation above background, the false-negative probability was only 1.5%, determined from distributions of single-molecule intensities on well-populated surfaces, and the false-positive probability from background noise was 2.8 spots per 50 × 50 μm image. Furthermore, the false-positive events compare favorably with theoretical probabilities calculated using combinatorial statistical analysis and simulated false-positive events counted in images of random noise.

36 MATERIALS SCIENCE↗