Search NASA⌕ Search

SEARCH · Search NASA

Results for “graph coloring”

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 55 records · Page 3

A neurocomputer based on an analog-digital hybrid architecture

A novel analog-digital hybrid architecture based on the utilization of high density digital random access memories for the storage of the synaptic weights of a neural network, and high speed analog hardware to perform neural computation is described. An electronic neurocomputer based on such an architecture is ideally suited for investigating the dynamics, associative recall properties, and computational capabilities of neural networks and provides significant speed improvement in comparison to conventional software based neural network simulations. As a demonstration of the feasibility of the hybrid architectural concept, a prototype breadboard hybrid neurocomputer system with 32 neurons has been designed and fabricated with off-the-shelf hardware components. The performance of the breadboard system has been tested for variety of applications including associative memory and combinatorial problem solving such as Graph Coloring, and is discussed in this paper.

Moopenn, A.↗

QSPIN: A High Level Java API for Quantum Computing Experimentation

QSPIN is a high level Java language API for experimentation in QC models used in the calculation of Ising spin glass ground states and related quadratic unconstrained binary optimization (QUBO) problems. The Java API is intended to facilitate research in advanced QC algorithms such as hybrid quantum-classical solvers, automatic selection of constraint and optimization parameters, and techniques for the correction and mitigation of model and solution errors. QSPIN includes high level solver objects tailored to the D-Wave quantum annealing architecture that implement hybrid quantum-classical algorithms [Booth et al.] for solving large problems on small quantum devices, elimination of variables via roof duality, and classical computing optimization methods such as GPU accelerated simulated annealing and tabu search for comparison. A test suite of documented NP-complete applications ranging from graph coloring, covering, and partitioning to integer programming and scheduling are provided to demonstrate current capabilities.

Quantu↗

XY vs X Mixer in Quantum Alternating Operator Ansatz for Optimization Problems with Constraints

Quantum Approximate Optimization Algorithm, further generalized as Quantum Alternating Operator Ansatz (QAOA), is a family of algorithms for combinatorial optimization problems. It is a leading candidate to run on emerging universal quantum computers to gain insight into quantum heuristics. In constrained optimization, penalties are often introduced so that the ground state of the cost Hamiltonian encodes the solution (a standard practice in quantum annealing). An alternative is to choose a mixing Hamiltonian such that the constraint corresponds to a constant of motion and the quantum evolution stays in the feasible subspace. Better performance of the algorithm is speculated due to a much smaller search space. We consider problems with a constant Hamming weight as the constraint. We also compare different methods of generating the generalized W-state, which serves as a natural initial state for the Hamming-weight constraint. Using graph-coloring as an example, we compare the performance of using XY model as a mixer that preserves the Hamming weight with the performance of adding a penalty term in the cost Hamiltonian.

quantum computing↗

Tutorial : the Zoltan toolkit.

The outline of this presentation is: (1) High-level view of Zoltan; (2) Requirements, data models, and interface; (3) Load Balancing and Partitioning; (4) Matrix Ordering, Graph Coloring; (5) Utilities; (6) Isorropia; and (7) Zoltan2.

99 GENERAL AND MISCELLANEOUS↗

Acyclic and star colorings of joins of graphs and an algorithm for cographs.

An acyclic coloring of a graph is a proper vertex coloring such that the subgraph induced by the union of any two color classes is a disjoint collection of trees. The more restricted notion of star coloring requires that the union of any two color classes induces a disjoint collection of stars. The acyclic and star chromatic numbers of a graph G are defined analogously to the chromatic number {chi}(G) and are denoted by {chi}{sub a}(G) and {chi}{sub s}(G), respectively. In this paper, we consider acyclic and star colorings of graphs that are decomposable with respect to the join operation, which builds a new graph from a collection of two or more disjoint graphs by adding all possible edges between them. In particular, we present a recursive formula for the acyclic chromatic number of joins of graphs and show that a similar formula holds for the star chromatic number. We also demonstrate the algorithmic implications of our results for the cographs, which have the unique property that they are recursively decomposable with respect to the join and disjoint union operations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model

GPUs have been increasingly used to accelerate graph processing for complicated computational problems regarding graph theory. Many parallel graph algorithms adopt the asynchronous computing model to accelerate the iterative convergence. Unfortunately, the consistent asynchronous computing requires locking or atomic operations, leading to significant penalties/overheads when implemented on GPUs. As such, coloring algorithm is adopted to separate the vertices with potential updating conflicts, guaranteeing the consistency/correctness of the parallel processing. Common coloring algorithms, however, may suffer from low parallelism because of a large number of colors generally required for processing a large-scale graph with billions of vertices. We propose a light-weight asynchronous processing framework called Frog with a preprocessing/hybrid coloring model. The fundamental idea is based on Pareto principle (or 80-20 rule) about coloring algorithms as we observed through masses of realworld graph coloring cases. We find that a majority of vertices (about 80%) are colored with only a few colors, such that they can be read and updated in a very high degree of parallelism without violating the sequential consistency. Accordingly, our solution separates the processing of the vertices based on the distribution of colors. In this work, we mainly answer three questions: (1) how to partition the vertices in a sparse graph with maximized parallelism, (2) how to process large-scale graphs that cannot fit into GPU memory, and (3) how to reduce the overhead of data transfers on PCIe while processing each partition. Here, we conduct experiments on real-world data (Amazon, DBLP, YouTube, RoadNet-CA, WikiTalk and Twitter) to evaluate our approach and make comparisons with well-known non-preprocessed (such as Totem, Medusa, MapGraph and Gunrock) and preprocessed (Cusha) approaches, by testing four classical algorithms (BFS, PageRank, SSSP and CC). On all the tested applications and datasets, Frog is able to significantly outperform existing GPU-based graph processing systems except Gunrock and MapGraph. MapGraph gets better performance than Frog when running BFS on RoadNet-CA. The comparison between Gunrock and Frog is inconclusive. Frog can outperform Gunrock more than 1.04X when running PageRank and SSSP, while the advantage of Frog is not obvious when running BFS and CC on some datasets especially for RoadNet-CA.

97 MATHEMATICS AND COMPUTING↗

CONGO²: Scalable Online Anomaly Detection and Localization in Power Electronics Networks

Rapid and accurate detection and localization of electronic disturbances simultaneously are important for preventing its potential damages and determining potential remedies. Existing anomaly detection methods are severely limited by the low accuracy, the expensive computational cost and the need for highly trained personnel. There is an urgent need for a scalable online algorithm for in-field analysis of large-scale power electronics networks. Here in this paper, we propose a fast and accurate algorithm for anomaly detection and localization of power electronics networks: stratified colored-node graph (CONGO2). This algorithm hierarchically models the change of correlated waveforms and then correlated sensors using the colored-node graph. By aggregating the change of each sensor with its neighbors’ inputs, we can spontaneously identify and localize the anomaly that cannot be detected by data collected from a single sensor. As our proposed method only focuses on the changes within a short time frame, it is highly computational efficient and only needs small data storage. Thus, our method is ideal for online and reliable anomaly detection and localization of large-scale power electronic networks. Compared to existing anomaly detection methods, our method is entirely data-driven without training data, highly accurate and reliable for wide-spectrum anomalies detection, and more importantly, capable of both detection and localization. Thus, it is ideal for infield deployment for large-scale power electronic networks. As illustrated by a distributed energy resources (DERs) power grid with 37-node, our method can effectively detect and localize various cyber and physical attacks.

42 ENGINEERING↗

(4,2)-choosability of planar graphs with forbidden structures

All planar graphs are 4-colorable and 5-choosable, while some planar graphs are not 4-choosable. Determining which properties guarantee that a planar graph can be colored using lists of size four has received significant attention. In terms of constraining the structure of the graph, for any l ? {3, 4, 5, 6, 7}, a planar graph is 4-choosable if it is l-cycle-free. In terms of constraining the list assignment, one refinement of k-choosability is choosability with separation. A graph is (k, s)-choosable if the graph is colorable from lists of size k where adjacent vertices have at most s common colors in their lists. Every planar graph is (4, 1)-choosable, but there exist planar graphs that are not (4, 3)-choosable. It is an open question whether planar graphs are always (4, 2)-choosable. A chorded l-cycle is an l-cycle with one additional edge. We demonstrate for each l ? {5, 6, 7} that a planar graph is (4, 2)-choosable if it does not contain chorded l-cycles.

li, ch↗

A graph-theoretical representation of multiphoton resonance processes in superconducting quantum circuits

We propose a graph-theoretical formalism to study generic circuit quantum electrodynamics systems consisting of a two level qubit coupled with a single-mode resonator in arbitrary coupling strength regimes beyond rotating-wave approximation. We define colored-weighted graphs, and introduce different products between them to investigate the dynamics of superconducting qubits in transverse, longitudinal, and bidirectional coupling schemes. In conclusion, the intuitive and predictive picture provided by this method, and the simplicity of the mathematical construction, are demonstrated with some numerical studies of the multiphoton resonance processes and quantum interference phenomena for the superconducting qubit systems driven by intense ac fields.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

A Synchronization-Avoiding Distance-1 Grundy Coloring Algorithm for Power-Law Graphs

In this paper, we propose a distributed, unordered, label-correcting distance-1 Grundy (vertex) coloring algorithm, namely, Distributed Control (DC) coloring algorithm. Our algorithm eliminates the need for vertex-centric barriers and global synchronization for color refinement, relying only on atomic operations and local termination detection to update vertex color. DC proceeds optimistically, correcting the colors asynchronously as the algorithm progresses and depends on local ordering of tasks to minimize the execution of sub-optimal work. We implement our DC coloring algorithm and the well-known Jones-Plassmann algorithm and compare their performance with 4 different types of standard RMAT graphs and real-world graphs. We show that the elimination of waiting time of global and vertex-centric barriers and investing this time for local ordering leads to improved scaling for graphs with prominent power-law characteristics and densely interconnected local subgraphs.

Firoz, Jesun S.↗

A multiobjective modeling approach to locate multi-compartment containers for urban-sorted waste

The location of multi-compartment sorted waste containers for recycling purposes in cities is an important problem in the context of urban waste management. The costs associated with those facilities and the impacts placed on populations are important concerns. This paper introduces a mixed-integer, multiobjective programming approach to identify the locations and capacities of such facilities. The approach incorporates an optimization model in a Geographical Information System (GIS)-based interactive decision support system that includes four objectives. The first objective minimizes the total investment cost; the second one minimizes the average distance from dwellings to the respective multi-compartment container; the last two objectives address the 'pull' and 'push' characteristics of the decision problem, one by minimizing the number of individuals too close to any container, and the other by minimizing the number of dwellings too far from the respective multi-compartment container. The model determines the number of facilities to be opened, the respective container capacities, their locations, their respective shares of the total waste of each type to be collected, and the dwellings assigned to each facility. The approach proposed was tested with a case study for the historical center of Coimbra city, Portugal, where a large urban renovation project, addressing about 800 buildings, is being undertaken. This paper demonstrates that the models and techniques incorporated in the interactive decision support system (IDSS) can be used to assist a decision maker (DM) in analyzing this complex problem in a realistically sized urban application. Ten solutions consisting of different combinations of underground containers for the disposal of four types of sorted waste in 12 candidate sites, were generated. These solutions and tradeoffs among the objectives are presented to the DM via tables, graphs, color-coded maps and other graphics. The DM can then use this information to 'guide' the IDSS in identifying additional solutions of potential interest. Nevertheless, this research showed that a particular solution with a better objective balance can be identified. The actual sequence of additional solutions generated will depend upon the objectives and preferences of the DM in a specific application.

97 MATHEMATICS AND COMPUTING↗

Studying Earth's Environment From Space: Classroom and Laboratory Activities with Instructor Resources

Standard, text-book based learning for earth, ocean, and atmospheric sciences has been limited by the unavailability of quantitative teaching materials. While a descriptive presentation, in a lecture format, of discrete satellite images is often adequate for high school classrooms, this is seldom the case at the undergraduate level. In order to address these concerns, a series of numerical exercises for the Macintosh was developed for use with satellite-derived Sea Surface Temperature, pigment and sea ice concentration data. Using a modified version of NIH Image, to analyze actual satellite data, students are able to better understand ocean processes, such as circulation, upwelling, primary production, and ocean/atmosphere coupling. Graphical plots, image math, and numerical comparisons are utilized to substantiate temporal and spatial trends in sea surface temperature and ocean color. Particularly for institutions that do not offer a program in remote sensing, the subject matter is presented as modular units, each of which can be readily incorporated into existing curricula. These materials have been produced in both CD-ROM and WWW format, making them useful for classroom or lab setting. Depending upon the level of available computer support, graphics can be displayed directly from the CD-ROM, or as a series of color view graphs for standard overhead projection.

Smith, Elizabeth A.↗

Dynamic Channel Assignments for Efficient Use of Aviation Spectrum Allocations

The demand for voice and data communications continues to rise with the emergence of new aerial vehicles into the airspace and the continued growth of aviation operations throughout the National Airspace System (NAS). Recent studies have shown that the anticipated growing demand for spectrum resources will exceed the capacity of existing aviation spectrum allocations. Further, airspace configurations, via assignment of fixed channel allocations within standard service volumes, do not allow for the dynamic and efficient distribution of spectrum resources based on airspace demand; as a result, a new approach to aviation spectrum management is needed to support the forecasted needs of new airspace users. The National Aeronautics and Space Administration (NASA) is investigating applications of artificial intelligence (AI), machine learning (ML), and other advanced concepts to solve a dynamic constraint satisfaction problem which is analogous to the frequency assignment problem faced by aviation. Procedures and strategies for dynamic channel allocation can be borrowed from other large-scale mobile services (i.e., 4G/5G applications) and can provide a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the strict quality of service prescribed by aeronautical standards.

Communications↗

Dynamic Channel Assignments for Efficient Use of Aviation Spectrum Allocations

The demand for voice and data communications continues to rise with the emergence of new aerial vehicles into the airspace and the continued growth of aviation operations throughout the National Airspace System (NAS). Recent studies have shown that the anticipated growing demand for spectrum resources will exceed the capacity of existing aviation spectrum allocations. Further, airspace configurations, via assignment of fixed channel allocations within standard service volumes, do not allow for the dynamic and efficient distribution of spectrum resources based on airspace demand; as a result, a new approach to aviation spectrum management is needed to support the forecasted needs of new airspace users. The National Aeronautics and Space Administration (NASA) is investigating applications of artificial intelligence (AI), machine learning (ML), and other advanced concepts to solve a dynamic constraint satisfaction problem which is analogous to the frequency assignment problem faced by aviation. Procedures and strategies for dynamic channel allocation can be borrowed from other large-scale mobile services (i.e., 4G/5G applications) and can provide a novel spectrum management approach that allows for the intelligent utilization of aviation spectrum throughout the airspace while maintaining the strict quality of service prescribed by aeronautical standards.

communications↗

Hierarchical graphs for rule-based modeling of biochemical systems

Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state of a component, and an edge represents a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions. A rule that specifies addition (removal) of an edge represents a class of association (dissociation) reactions, and a rule that specifies a change of a vertex attribute represents a class of reactions that affect the internal state of a molecular component. A set of rules comprises an executable model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Results: For purposes of model annotation, we propose the use of hierarchical graphs to represent structural relationships among components and subcomponents of molecules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR) complex. We also show that computational methods developed for regular graphs can be applied to hierarchical graphs. In particular, we describe a generalization of Nauty, a graph isomorphism and canonical labeling algorithm. The generalized version of the Nauty procedure, which we call HNauty, can be used to assign canonical labels to hierarchical graphs or more generally to graphs with multiple edge types. The difference between the Nauty and HNauty procedures is minor, but for completeness, we provide an explanation of the entire HNauty algorithm. Conclusions: Hierarchical graphs provide more intuitive formal representations of proteins and other structured molecules with multiple functional components than do the regular graphs of current languages for specifying rule-based models, such as the BioNetGen language (BNGL). Thus, the proposed use of hierarchical graphs should promote clarity and better understanding of rule-based models.

59 BASIC BIOLOGICAL SCIENCES↗

Hierarchical graphs for better annotations of rule-based models of biochemical systems

In the graph-based formalism of the BioNetGen language (BNGL), graphs are used to represent molecules, with a colored vertex representing a component of a molecule, a vertex label representing the internal state of a component, and an edge representing a bond between components. Components of a molecule share the same color. Furthermore, graph-rewriting rules are used to represent molecular interactions, with a rule that specifies addition (removal) of an edge representing a class of association (dissociation) reactions and with a rule that specifies a change of vertex label representing a class of reactions that affect the internal state of a molecular component. A set of rules comprises a mathematical/computational model that can be used to determine, through various means, the system-level dynamics of molecular interactions in a biochemical system. Here, for purposes of model annotation, we propose an extension of BNGL that involves the use of hierarchical graphs to represent (1) relationships among components and subcomponents of molecules and (2) relationships among classes of reactions defined by rules. We illustrate how hierarchical graphs can be used to naturally document the structural organization of the functional components and subcomponents of two proteins: the protein tyrosine kinase Lck and the T cell receptor (TCR)/CD3 complex. Likewise, we illustrate how hierarchical graphs can be used to document the similarity of two related rules for kinase-catalyzed phosphorylation of a protein substrate. We also demonstrate how a hierarchical graph representing a protein can be encoded in an XML-based format.

59 BASIC BIOLOGICAL SCIENCES↗