Metric-Constrained Optimization for Graph Clustering Algorithms
Explore the source record for details and available documents.
Nate Veldt↗
SEARCH · Search NASA
Results for “graph clustering”
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.
An analysis of some graph theoretical cluster techniques
Graph theoretic cluster techniques for automatic generation of information retrieval systems thesauri
Augustson, J. G.↗
An analysis of some graph theoretical cluster techniques
Graph theoretical cluster technique for producing index terms thesaurus for information retrieval system, discussing algorithms
Augustson, J. G.↗
Evaluating graph theoretic clustering algorithms for reliable multicasting
In this paper, we analyze the complexities of three clustering algorithms; Lorax, k-degree, and self-adjust.
clustering algorithms complexity analysis reliable↗
Cooperative Clustering Techniques Applied to Contact Graph Routing
Routing in the space internet has to face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this presentation we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. Finally, we propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol.
Yael Kirkpatrick↗
Assisted Authoring of Model-Based Systems Engineering Documents
In systems engineering practices system design and analysis have historically been performed using a document-centric approach where stakeholders produce a number of documents that represent their views on a system under development. Given the ad-hoc, disparate, and informal nature of natural language documents, these views become quickly inconsistent. Rigor in engineering work is also lost in the transition from model based engineering design and analysis to engineering documents. Once the documents are delivered, the engineering portion of the work is disconnected. In the Open Model Based Engineering Environment (OpenMBEE), Cross-References (aka transclusions) synthesize data for engineering when the information is not simply hyperlinked, but referenced in place in a document, upgrading a document-based process with model-based engineering technology. Those Cross-References are nowadays partially created manually, putting a burden on the engineer who is authoring the document.This paper presents an approach which can assist the engineer by providing machine-generated suggestions for Cross-References using language processing, graph analysis, and clustering technologies on model data managed by the OpenMBEE infrastructure.
Gomes, Ivan↗
Determining the Optimal Number of Clusters with the Clustergram
Cluster analysis aids research in many different fields, from business to biology to aerospace. It consists of using statistical techniques to group objects in large sets of data into meaningful classes. However, this process of ordering data points presents much uncertainty because it involves several steps, many of which are subject to researcher judgment as well as inconsistencies depending on the specific data type and research goals. These steps include the method used to cluster the data, the variables on which the cluster analysis will be operating, the number of resulting clusters, and parts of the interpretation process. In most cases, the number of clusters must be guessed or estimated before employing the clustering method. Many remedies have been proposed, but none is unassailable and certainly not for all data types. Thus, the aim of current research for better techniques of determining the number of clusters is generally confined to demonstrating that the new technique excels other methods in performance for several disparate data types. Our research makes use of a new cluster-number-determination technique based on the clustergram: a graph that shows how the number of objects in the cluster and the cluster mean (the ordinate) change with the number of clusters (the abscissa). We use the features of the clustergram to make the best determination of the cluster-number.
Fluegemann, Joseph K.↗
An application of cluster detection to scene analysis
Certain arrangements of local features in a scene tend to group together and to be seen as units. It is suggested that in some instances, this phenomenon might be interpretable as a process of cluster detection in a graph-structured space derived from the scene. This idea is illustrated using a class of scenes that contain only horizontal and vertical line segments.
Rosenfeld, A. H.↗
Multi-Parent Clustering Algorithms from Stochastic Grammar Data Models
We introduce a statistical data model and an associated optimization-based clustering algorithm which allows data vectors to belong to zero, one or several "parent" clusters. For each data vector the algorithm makes a discrete decision among these alternatives. Thus, a recursive version of this algorithm would place data clusters in a Directed Acyclic Graph rather than a tree. We test the algorithm with synthetic data generated according to the statistical data model. We also illustrate the algorithm using real data from large-scale gene expression assays.
Mjoisness, Eric↗
Stellar turbulent convection - A new model and applications
Improvements of the mixing-length theory (MLT) of turbulent convection in stellar atmospheres are developed theoretically. It is pointed out that inaccuracies are introduced into MLT by the approximating assumptions of a single large eddy (rather than many eddies of different sizes) and of incompressibility. In the proposed new model, the full spectrum of turbulent eddies is determined using more recent turbulence models (e.g., the eddy-damped quasi-normal Markovian model of Orszag, 1977), and a new formula for the convective flux is obtained which gives values up to 10 times greater than those of the MLT at high convective efficiencies. The problem of compressibility is addressed by adding one of two new expressions (one with no free parameters) for the mixing length. Numerical results from simulations of a solar-type star and a 0.8-solar-mass globular-cluster star are presented in tables and graphs and discussed in detail; the agreement with observations is found to be better than with the MLT.
Canuto, V. M.↗
A radial-velocity survey of the Hyades
Photoelectric radial-velocity measurements, obtained with external error as small as 0.1 km/s using the 200-inch Hale telescope at Palomar Observatory during the period 1971-1986, are reported for over 400 candidate members (with V magnitude between 6 and 14) of the Hyades cluster. The history of Hyades observations is recalled; the Palomar instrumentation and observing program are described; the data-reduction and standardization procedures are discussed in detail; and the data are presented in extensive tables and graphs. About 200 of the stars are classified as cluster members, including 60 spectroscopic binaries.
Griffin, R. F.↗
Decision net, directed graph, and neural net processing of imaging spectrometer data
A decision-net solution involving a novel hierarchical classifier and a set of multiple directed graphs, as well as a neural-net solution, are respectively presented for large-class problem and mixture problem treatments of imaging spectrometer data. The clustering method for hierarchical classifier design, when used with multiple directed graphs, yields an efficient decision net. New directed-graph rules for reducing local maxima as well as the number of perturbations required, and the new starting-node rules for extending the reachability and reducing the search time of the graphs, are noted to yield superior results, as indicated by an illustrative 500-class imaging spectrometer problem.
Casasent, David↗
The three-point correlation function for Abell clusters - Observations and simulations
Results are reported of a 3D study tracing the three-point correlation function of Abell clusters and of a comparison of this with the biased cold dark matter (CDM) simulations of Park (1990). For the observations, the maximum likelihood fits are Z11 = 0.85 and Q111 = 0.1, in excellent agreement with the result of the 2D study of Toth et al. (1989). For Park's simulation, maximum likelihood fits of Q11 = 0.9 and Q111 = 0.0 are found, which is in excellent agreement with the observational result. It is concluded that the standard biased CDM gravitational instability model reproduces the observed form of the three-point correlation functions for Abell clusters remarkably well. The number of triples as a function of the sides of triangles for Abell clusters, and the number of triples as a function of the sides of triangles for clusters in Park's simulation are illustrated on graphs.
Gott, J. R., III↗
Cooperative Clustering Techniques For Space Network Scalability
Routing in the space internet must face many unique challenges - from unplanned disconnections and interruptions to predictable intermittent connectivity due to high network mobility and long propagation delays. NASA’s current approach to such routing is Contact Graph Routing (CGR), using a graph formed of prescheduled communication contacts to compute routes through the network. While this approach manages to tackle issues of connectivity and propagation delays, it is a global approach that requires continuous knowledge of the entire network. In a potential future Solar Space Internet (SSI) such an approach on its own cannot scale to large networks with thousands of members. In this paper we propose clustering as a solution to CGR scalability. Clustering has been used in many networking problems as a way to subdivide the network and allow for localized routing and better scalability. Using techniques from graph theory and game theory, we explore various existing clustering algorithms and adapt them to the Contact Graph Routing setting. We propose a way to combine multiple algorithms to create a Delay Tolerant Clustering Protocol (DTCP). In addition, we explore the underlying networking mechanisms such as multicast, neighbor discovery, and software defined networking that may be used to enable DTCP.
Delay Tolerant Networking↗
Scale-free Graphs for General Aviation Flight Schedules
In the late 1990s a number of researchers noticed that networks in biology, sociology, and telecommunications exhibited similar characteristics unlike standard random networks. In particular, they found that the cummulative degree distributions of these graphs followed a power law rather than a binomial distribution and that their clustering coefficients tended to a nonzero constant as the number of nodes, n, became large rather than O(1/n). Moreover, these networks shared an important property with traditional random graphs as n becomes large the average shortest path length scales with log n. This latter property has been coined the small-world property. When taken together these three properties small-world, power law, and constant clustering coefficient describe what are now most commonly referred to as scale-free networks. Since 1997 at least six books and over 400 articles have been written about scale-free networks. In this manuscript an overview of the salient characteristics of scale-free networks. Computational experience will be provided for two mechanisms that grow (dynamic) scale-free graphs. Additional computational experience will be given for constructing (static) scale-free graphs via a tabu search optimization approach. Finally, a discussion of potential applications to general aviation networks is given.
Alexandov, Natalia M.↗
Astronomers Ponder Lack of Planets in Globular Cluster
This videotape has seven segments, discussing and showing the evidence for the proposition that the galactic clusters do not have many planets. Specifically the segments show: (1) Dr. Ron Gilliland discussing the process of looking for "Hot Jupiters" (i.e., planets about the size of Jupiter, which are hotter than Jupiter) in the globular clusters, (2) a zoom into 47 Tucanae globular cluster, (3) an animation of a planet passing between the host star and the earth with a brightness graph, (4) the same animation as before without the graph, (5) Ron Gilliland of the Space Telescope Science Institute (STScI) discussing possible interpretations of his findings in the 47 Tucanae globular cluster, (6) Ron Gilliland examining the images of 47 Tucanae, and (7) images of 47 Tucanae watching for variations in brightness.
Source record↗
On star formation in stellar systems. I - Photoionization effects in protoglobular clusters
The progressive ionization and subsequent dynamical evolution of nonhomogeneously distributed low-metal-abundance diffuse gas after star formation in globular clusters are investigated analytically, taking the gravitational acceleration due to the stars into account. The basic equations are derived; the underlying assumptions, input parameters, and solution methods are explained; and numerical results for three standard cases (ionization during star formation, ionization during expansion, and evolution resulting in a stable H II region at its equilibrium Stromgren radius) are presented in graphs and characterized in detail. The time scale of residual-gas loss in typical clusters is found to be about the same as the lifetime of a massive star on the main sequence.
Tenorio-Tagle, G.↗
The Einstein soft X-ray survey of the Pleiades
The results of a 0.1-4.5-keV X-ray survey of a 2 x 2-deg area centered on the Pleiades open cluster, performed using the imaging proportional counter and high-resolution imager of the Einstein Observatory on four days in 1980-1981, are presented in extensive tables, graphs, maps, histograms, and finding charts and characterized. A total of 61 sources are detected, and 44 of these are identified with cluster members of spectral types B-M. Findings discussed include Lx/Lbol of 10 the -7th for early-type stars; F-star mean Lx like that of F stars in the Hyades and in the field (denying time evolution of Lx); mean G-star Lx = 3.7 x 10 to the 29th erg/sec; G-star activity decay more gradual than 1/sq rt t, with sharp fall for t greater than 1 Gyr; and no evidence for X-ray-emissivity/rotational-velocity correlation in a homogeneous sample of K dwarfs or a sample of K and M stars with established V sin i data.
Caillault, J.-P.↗