Graph theory applied to noise and vibration control in statistical energy analysis models.

PubMed

Guasch, Oriol; Cortés, Lluís

2009-06-01

A fundamental aspect of noise and vibration control in statistical energy analysis (SEA) models consists in first identifying and then reducing the energy flow paths between subsystems. In this work, it is proposed to make use of some results from graph theory to address both issues. On the one hand, linear and path algebras applied to adjacency matrices of SEA graphs are used to determine the existence of any order paths between subsystems, counting and labeling them, finding extremal paths, or determining the power flow contributions from groups of paths. On the other hand, a strategy is presented that makes use of graph cut algorithms to reduce the energy flow from a source subsystem to a receiver one, modifying as few internal and coupling loss factors as possible.

Advanced Cyber Attack Modeling Analysis and Visualization

DTIC Science & Technology

2010-03-01

Graph Analysis Network Web Logs Netflow Data TCP Dump Data System Logs Detect Protect Security Management What-If Figure 8. TVA attack graphs for...Clustered Graphs,” in Proceedings of the Symposium on Graph Drawing, September 1996. [25] K. Lakkaraju, W. Yurcik, A. Lee, “NVisionIP: NetFlow

Reliability models for dataflow computer systems

NASA Technical Reports Server (NTRS)

Kavi, K. M.; Buckles, B. P.

1985-01-01

The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers.

Solving Partial Differential Equations in a data-driven multiprocessor environment

DOE Office of Scientific and Technical Information (OSTI.GOV)

Gaudiot, J.L.; Lin, C.M.; Hosseiniyar, M.

1988-12-31

Partial differential equations can be found in a host of engineering and scientific problems. The emergence of new parallel architectures has spurred research in the definition of parallel PDE solvers. Concurrently, highly programmable systems such as data-how architectures have been proposed for the exploitation of large scale parallelism. The implementation of some Partial Differential Equation solvers (such as the Jacobi method) on a tagged token data-flow graph is demonstrated here. Asynchronous methods (chaotic relaxation) are studied and new scheduling approaches (the Token No-Labeling scheme) are introduced in order to support the implementation of the asychronous methods in a data-driven environment.more » New high-level data-flow language program constructs are introduced in order to handle chaotic operations. Finally, the performance of the program graphs is demonstrated by a deterministic simulation of a message passing data-flow multiprocessor. An analysis of the overhead in the data-flow graphs is undertaken to demonstrate the limits of parallel operations in dataflow PDE program graphs.« less

Massive Scale Cyber Traffic Analysis: A Driver for Graph Database Research

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff A.; Choudhury, S.; Haglin, David J.

2013-06-19

We describe the significance and prominence of network traffic analysis (TA) as a graph- and network-theoretical domain for advancing research in graph database systems. TA involves observing and analyzing the connections between clients, servers, hosts, and actors within IP networks, both at particular times and as extended over times. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. IPFLOW databases are routinely interrogated statistically and visualized for suspicious patterns. But the ability to cast IPFLOW data as a massive graph and query itmore » interactively, in order to e.g.\\ identify connectivity patterns, is less well advanced, due to a number of factors including scaling, and their hybrid nature combining graph connectivity and quantitative attributes. In this paper, we outline requirements and opportunities for graph-structured IPFLOW analytics based on our experience with real IPFLOW databases. Specifically, we describe real use cases from the security domain, cast them as graph patterns, show how to express them in two graph-oriented query languages SPARQL and Datalog, and use these examples to motivate a new class of "hybrid" graph-relational systems.« less

Spectral-clustering approach to Lagrangian vortex detection.

PubMed

Hadjighasem, Alireza; Karrasch, Daniel; Teramoto, Hiroshi; Haller, George

2016-06-01

One of the ubiquitous features of real-life turbulent flows is the existence and persistence of coherent vortices. Here we show that such coherent vortices can be extracted as clusters of Lagrangian trajectories. We carry out the clustering on a weighted graph, with the weights measuring pairwise distances of fluid trajectories in the extended phase space of positions and time. We then extract coherent vortices from the graph using tools from spectral graph theory. Our method locates all coherent vortices in the flow simultaneously, thereby showing high potential for automated vortex tracking. We illustrate the performance of this technique by identifying coherent Lagrangian vortices in several two- and three-dimensional flows.

Bond Graph Model of Cerebral Circulation: Toward Clinically Feasible Systemic Blood Flow Simulations.

PubMed

Safaei, Soroush; Blanco, Pablo J; Müller, Lucas O; Hellevik, Leif R; Hunter, Peter J

2018-01-01

We propose a detailed CellML model of the human cerebral circulation that runs faster than real time on a desktop computer and is designed for use in clinical settings when the speed of response is important. A lumped parameter mathematical model, which is based on a one-dimensional formulation of the flow of an incompressible fluid in distensible vessels, is constructed using a bond graph formulation to ensure mass conservation and energy conservation. The model includes arterial vessels with geometric and anatomical data based on the ADAN circulation model. The peripheral beds are represented by lumped parameter compartments. We compare the hemodynamics predicted by the bond graph formulation of the cerebral circulation with that given by a classical one-dimensional Navier-Stokes model working on top of the whole-body ADAN model. Outputs from the bond graph model, including the pressure and flow signatures and blood volumes, are compared with physiological data.

PerSubs: A Graph-Based Algorithm for the Identification of Perturbed Subpathways Caused by Complex Diseases.

PubMed

Vrahatis, Aristidis G; Rapti, Angeliki; Sioutas, Spyros; Tsakalidis, Athanasios

2017-01-01

In the era of Systems Biology and growing flow of omics experimental data from high throughput techniques, experimentalists are in need of more precise pathway-based tools to unravel the inherent complexity of diseases and biological processes. Subpathway-based approaches are the emerging generation of pathway-based analysis elucidating the biological mechanisms under the perspective of local topologies onto a complex pathway network. Towards this orientation, we developed PerSub, a graph-based algorithm which detects subpathways perturbed by a complex disease. The perturbations are imprinted through differentially expressed and co-expressed subpathways as recorded by RNA-seq experiments. Our novel algorithm is applied on data obtained from a real experimental study and the identified subpathways provide biological evidence for the brain aging.

A Scalable Nonuniform Pointer Analysis for Embedded Program

NASA Technical Reports Server (NTRS)

Venet, Arnaud

2004-01-01

In this paper we present a scalable pointer analysis for embedded applications that is able to distinguish between instances of recursively defined data structures and elements of arrays. The main contribution consists of an efficient yet precise algorithm that can handle multithreaded programs. We first perform an inexpensive flow-sensitive analysis of each function in the program that generates semantic equations describing the effect of the function on the memory graph. These equations bear numerical constraints that describe nonuniform points-to relationships. We then iteratively solve these equations in order to obtain an abstract storage graph that describes the shape of data structures at every point of the program for all possible thread interleavings. We bring experimental evidence that this approach is tractable and precise for real-size embedded applications.

A sediment graph model based on SCS-CN method

NASA Astrophysics Data System (ADS)

Singh, P. K.; Bhunya, P. K.; Mishra, S. K.; Chaube, U. C.

2008-01-01

SummaryThis paper proposes new conceptual sediment graph models based on coupling of popular and extensively used methods, viz., Nash model based instantaneous unit sediment graph (IUSG), soil conservation service curve number (SCS-CN) method, and Power law. These models vary in their complexity and this paper tests their performance using data of the Nagwan watershed (area = 92.46 km 2) (India). The sensitivity of total sediment yield and peak sediment flow rate computations to model parameterisation is analysed. The exponent of the Power law, β, is more sensitive than other model parameters. The models are found to have substantial potential for computing sediment graphs (temporal sediment flow rate distribution) as well as total sediment yield.

Optimal Multiple Surface Segmentation With Shape and Context Priors

PubMed Central

Bai, Junjie; Garvin, Mona K.; Sonka, Milan; Buatti, John M.; Wu, Xiaodong

2014-01-01

Segmentation of multiple surfaces in medical images is a challenging problem, further complicated by the frequent presence of weak boundary evidence, large object deformations, and mutual influence between adjacent objects. This paper reports a novel approach to multi-object segmentation that incorporates both shape and context prior knowledge in a 3-D graph-theoretic framework to help overcome the stated challenges. We employ an arc-based graph representation to incorporate a wide spectrum of prior information through pair-wise energy terms. In particular, a shape-prior term is used to penalize local shape changes and a context-prior term is used to penalize local surface-distance changes from a model of the expected shape and surface distances, respectively. The globally optimal solution for multiple surfaces is obtained by computing a maximum flow in a low-order polynomial time. The proposed method was validated on intraretinal layer segmentation of optical coherence tomography images and demonstrated statistically significant improvement of segmentation accuracy compared to our earlier graph-search method that was not utilizing shape and context priors. The mean unsigned surface positioning errors obtained by the conventional graph-search approach (6.30 ± 1.58 μm) was improved to 5.14 ± 0.99 μm when employing our new method with shape and context priors. PMID:23193309

On understanding nuclear reaction network flows with branchings on directed graphs

NASA Astrophysics Data System (ADS)

Meyer, Bradley S.

2018-04-01

Nuclear reaction network flow diagrams are useful for understanding which reactions are governing the abundance changes at a particular time during nucleosynthesis. This is especially true when the flows are largely unidirectional, such as during the s-process of nucleosynthesis. In explosive nucleosynthesis, when reaction flows are large, and when forward reactions are nearly balanced by their reverses, reaction flows no longer give a clear picture of the abundance evolution in the network. This paper presents a way of understanding network evolution in terms of sums of branchings on a directed graph, which extends the concept of reaction flows to allow for multiple reaction pathways.

Graphical Language for Data Processing

NASA Technical Reports Server (NTRS)

Alphonso, Keith

2011-01-01

A graphical language for processing data allows processing elements to be connected with virtual wires that represent data flows between processing modules. The processing of complex data, such as lidar data, requires many different algorithms to be applied. The purpose of this innovation is to automate the processing of complex data, such as LIDAR, without the need for complex scripting and programming languages. The system consists of a set of user-interface components that allow the user to drag and drop various algorithmic and processing components onto a process graph. By working graphically, the user can completely visualize the process flow and create complex diagrams. This innovation supports the nesting of graphs, such that a graph can be included in another graph as a single step for processing. In addition to the user interface components, the system includes a set of .NET classes that represent the graph internally. These classes provide the internal system representation of the graphical user interface. The system includes a graph execution component that reads the internal representation of the graph (as described above) and executes that graph. The execution of the graph follows the interpreted model of execution in that each node is traversed and executed from the original internal representation. In addition, there are components that allow external code elements, such as algorithms, to be easily integrated into the system, thus making the system infinitely expandable.

Bond Graph Model of Cerebral Circulation: Toward Clinically Feasible Systemic Blood Flow Simulations

PubMed Central

Safaei, Soroush; Blanco, Pablo J.; Müller, Lucas O.; Hellevik, Leif R.; Hunter, Peter J.

2018-01-01

We propose a detailed CellML model of the human cerebral circulation that runs faster than real time on a desktop computer and is designed for use in clinical settings when the speed of response is important. A lumped parameter mathematical model, which is based on a one-dimensional formulation of the flow of an incompressible fluid in distensible vessels, is constructed using a bond graph formulation to ensure mass conservation and energy conservation. The model includes arterial vessels with geometric and anatomical data based on the ADAN circulation model. The peripheral beds are represented by lumped parameter compartments. We compare the hemodynamics predicted by the bond graph formulation of the cerebral circulation with that given by a classical one-dimensional Navier-Stokes model working on top of the whole-body ADAN model. Outputs from the bond graph model, including the pressure and flow signatures and blood volumes, are compared with physiological data. PMID:29551979

Teaching Urban High School Students Global Climate Change Information and Graph Interpretation Skills Using Evidence from the Scientific Literature

ERIC Educational Resources Information Center

Rule, Audrey C.; Meyer, Mary A.

2009-01-01

Curriculum materials designed to provide students with practice interpreting plotted evidence of global climate change were developed using graphs from the scientific literature and tested with one hundred urban high school students from a high-poverty school in a major northern city in the US. The graph interpretation lessons followed a…

smoothG

DOE Office of Scientific and Technical Information (OSTI.GOV)

Barker, Andrew T.; Gelever, Stephan A.; Lee, Chak S.

2017-12-12

smoothG is a collection of parallel C++ classes/functions that algebraically constructs reduced models of different resolutions from a given high-fidelity graph model. In addition, smoothG also provides efficient linear solvers for the reduced models. Other than pure graph problem, the software finds its application in subsurface flow and power grid simulations in which graph Laplacians are found

Communication-Efficient Arbitration Models for Low-Resolution Data Flow Computing

DTIC Science & Technology

1988-12-01

phase can be formally described as follows: Graph Partitioning Problem NP-complete: (Garey & Johnson) Given graph G = (V, E), weights w (v) for each v e V...Technical Report, MIT/LCS/TR-218, Cambridge, Mass. Agerwala, Tilak, February 1982, "Data Flow Systems", Computer, pp. 10-13. Babb, Robert G ., July 1984...34Parallel Processing with Large-Grain Data Flow Techniques," IEEE Computer 17, 7, pp. 55-61. Babb, Robert G ., II, Lise Storc, and William C. Ragsdale

Short paths in expander graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Kleinberg, J.; Rubinfeld, R.

Graph expansion has proved to be a powerful general tool for analyzing the behavior of routing algorithms and the interconnection networks on which they run. We develop new routing algorithms and structural results for bounded-degree expander graphs. Our results are unified by the fact that they are all based upon, and extend, a body of work asserting that expanders are rich in short, disjoint paths. In particular, our work has consequences for the disjoint paths problem, multicommodify flow, and graph minor containment. We show: (i) A greedy algorithm for approximating the maximum disjoint paths problem achieves a polylogarithmic approximation ratiomore » in bounded-degree expanders. Although our algorithm is both deterministic and on-line, its performance guarantee is an improvement over previous bounds in expanders. (ii) For a multicommodily flow problem with arbitrary demands on a bounded-degree expander, there is a (1 + {epsilon})-optimal solution using only flow paths of polylogarithmic length. It follows that the multicommodity flow algorithm of Awerbuch and Leighton runs in nearly linear time per commodity in expanders. Our analysis is based on establishing the following: given edge weights on an expander G, one can increase some of the weights very slightly so the resulting shortest-path metric is smooth - the min-weight path between any pair of nodes uses a polylogarithmic number of edges. (iii) Every bounded-degree expander on n nodes contains every graph with O(n/log{sup O(1)} n) nodes and edges as a minor.« less

Finding Multiple Internal Rates of Return for a Project with Non-Conventional Cash Flows: Utilizing Popular Financial/Graphing Calculators and Spreadsheet Software

ERIC Educational Resources Information Center

Chen, Jeng-Hong

2008-01-01

This study demonstrates that a popular graphing calculator among students, TI-83 Plus, has a powerful function to draw the NPV profile and find the accurate multiple IRRs for a project with non-conventional cash flows. However, finance textbooks or related supplementary materials do not provide students instructions for this part. The detailed…

Imaging Neuroinflammation in Post Traumatic Stress Disorder

DTIC Science & Technology

2012-11-01

Metabolite B = 0-30%), without evidence of lipophilic metabolites which can confound the analysis. 8 Figure 2 Left graph : Mean PSTD... graph : There is similar plasma protein binding of 18-F PBR111 in healthy and PTSD participants. Individual subject are data are indicated on the... graph . TSPO Binder status Both mixed and high afffinity TSPO binders were evident in the PTSD (4 high affinity binders, 4 mixed affinity

Multiscale limited penetrable horizontal visibility graph for analyzing nonlinear time series

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Cai, Qing; Yang, Yu-Xuan; Dang, Wei-Dong; Zhang, Shan-Shan

2016-10-01

Visibility graph has established itself as a powerful tool for analyzing time series. We in this paper develop a novel multiscale limited penetrable horizontal visibility graph (MLPHVG). We use nonlinear time series from two typical complex systems, i.e., EEG signals and two-phase flow signals, to demonstrate the effectiveness of our method. Combining MLPHVG and support vector machine, we detect epileptic seizures from the EEG signals recorded from healthy subjects and epilepsy patients and the classification accuracy is 100%. In addition, we derive MLPHVGs from oil-water two-phase flow signals and find that the average clustering coefficient at different scales allows faithfully identifying and characterizing three typical oil-water flow patterns. These findings render our MLPHVG method particularly useful for analyzing nonlinear time series from the perspective of multiscale network analysis.

Stream gage descriptions and streamflow statistics for sites in the Tigris River and Euphrates River Basins, Iraq

USGS Publications Warehouse

Saleh, Dina K.

2010-01-01

Statistical summaries of streamflow data for all long-term streamflow-gaging stations in the Tigris River and Euphrates River Basins in Iraq are presented in this report. The summaries for each streamflow-gaging station include (1) a station description, (2) a graph showing annual mean discharge for the period of record, (3) a table of extremes and statistics for monthly and annual mean discharge, (4) a graph showing monthly maximum, minimum, and mean discharge, (5) a table of monthly and annual mean discharges for the period of record, (6) a graph showing annual flow duration, (7) a table of monthly and annual flow duration, (8) a table of high-flow frequency data (maximum mean discharge for 3-, 7-, 15-, and 30-day periods for selected exceedance probabilities), and (9) a table of low-flow frequency data (minimum mean discharge for 3-, 7-, 15-, 30-, 60-, 90-, and 183-day periods for selected non-exceedance probabilities).

Time-dependent limited penetrable visibility graph analysis of nonstationary time series

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Cai, Qing; Yang, Yu-Xuan; Dang, Wei-Dong

2017-06-01

Recent years have witnessed the development of visibility graph theory, which allows us to analyze a time series from the perspective of complex network. We in this paper develop a novel time-dependent limited penetrable visibility graph (TDLPVG). Two examples using nonstationary time series from RR intervals and gas-liquid flows are provided to demonstrate the effectiveness of our approach. The results of the first example suggest that our TDLPVG method allows characterizing the time-varying behaviors and classifying heart states of healthy, congestive heart failure and atrial fibrillation from RR interval time series. For the second example, we infer TDLPVGs from gas-liquid flow signals and interestingly find that the deviation of node degree of TDLPVGs enables to effectively uncover the time-varying dynamical flow behaviors of gas-liquid slug and bubble flow patterns. All these results render our TDLPVG method particularly powerful for characterizing the time-varying features underlying realistic complex systems from time series.

Optimal graph based segmentation using flow lines with application to airway wall segmentation.

PubMed

Petersen, Jens; Nielsen, Mads; Lo, Pechin; Saghir, Zaigham; Dirksen, Asger; de Bruijne, Marleen

2011-01-01

This paper introduces a novel optimal graph construction method that is applicable to multi-dimensional, multi-surface segmentation problems. Such problems are often solved by refining an initial coarse surface within the space given by graph columns. Conventional columns are not well suited for surfaces with high curvature or complex shapes but the proposed columns, based on properly generated flow lines, which are non-intersecting, guarantee solutions that do not self-intersect and are better able to handle such surfaces. The method is applied to segment human airway walls in computed tomography images. Comparison with manual annotations on 649 cross-sectional images from 15 different subjects shows significantly smaller contour distances and larger area of overlap than are obtained with recently published graph based methods. Airway abnormality measurements obtained with the method on 480 scan pairs from a lung cancer screening trial are reproducible and correlate significantly with lung function.

Flow-graph approach for optical analysis of planar structures.

PubMed

Minkov, D

1994-11-20

The flow-graph approach (FGA) is applied to optical analysis of isotropic stratified planar structures (ISPS's) at inclined light incidence. Conditions for the presence of coherent and noncoherent light interaction within ISPS's are determined. Examples of the use of FGA for calculation of the transmission and the reflection of two-layer ISPS's for different types of light interaction are given. The advantages of the use of FGA for optical analysis of ISPS's are discussed.

Flows in a tube structure: Equation on the graph

NASA Astrophysics Data System (ADS)

Panasenko, Grigory; Pileckas, Konstantin

2014-08-01

The steady-state Navier-Stokes equations in thin structures lead to some elliptic second order equation for the macroscopic pressure on a graph. At the nodes of the graph the pressure satisfies Kirchoff-type junction conditions. In the non-steady case the problem for the macroscopic pressure on the graph becomes nonlocal in time. In the paper we study the existence and uniqueness of a solution to such one-dimensional model on the graph for a pipe-wise network. We also prove the exponential decay of the solution with respect to the time variable in the case when the data decay exponentially with respect to time.

Graphing the order of the sexes: constructing, recalling, interpreting, and putting the self in gender difference graphs.

PubMed

Hegarty, Peter; Lemieux, Anthony F; McQueen, Grant

2010-03-01

Graphs seem to connote facts more than words or tables do. Consequently, they seem unlikely places to spot implicit sexism at work. Yet, in 6 studies (N = 741), women and men constructed (Study 1) and recalled (Study 2) gender difference graphs with men's data first, and graphed powerful groups (Study 3) and individuals (Study 4) ahead of weaker ones. Participants who interpreted graph order as evidence of author "bias" inferred that the author graphed his or her own gender group first (Study 5). Women's, but not men's, preferences to graph men first were mitigated when participants graphed a difference between themselves and an opposite-sex friend prior to graphing gender differences (Study 6). Graph production and comprehension are affected by beliefs and suppositions about the groups represented in graphs to a greater degree than cognitive models of graph comprehension or realist models of scientific thinking have yet acknowledged.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

PubMed

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

DOE Office of Scientific and Technical Information (OSTI.GOV)

Purvine, Emilie AH; Monson, Kyle E.; Jurrus, Elizabeth R.

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of maximum flow-minimum cut graph analysis. The interaction energy graph, a graph in which verticesmore » (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.« less

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

PubMed Central

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Harshaw, Chris R; Bridges, Robert A; Iannacone, Michael D

This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called \\textit{GraphPrints}. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets\\textemdash small induced subgraphs that describe local topology. By performing outlier detection on the sequence of graphlet counts, anomalous intervals of traffic are identified, and furthermore, individual IPs experiencing abnormal behavior are singled-out. Initial testing of GraphPrints is performed on real network data with an implanted anomaly. Evaluation shows false positive rates bounded by 2.84\\% at the time-interval level, and 0.05\\% at the IP-level with 100\\% truemore » positive rates at both.« less

A Comparison of Video Modeling, Text-Based Instruction, and No Instruction for Creating Multiple Baseline Graphs in Microsoft Excel

ERIC Educational Resources Information Center

Tyner, Bryan C.; Fienup, Daniel M.

2015-01-01

Graphing is socially significant for behavior analysts; however, graphing can be difficult to learn. Video modeling (VM) may be a useful instructional method but lacks evidence for effective teaching of computer skills. A between-groups design compared the effects of VM, text-based instruction, and no instruction on graphing performance.…

A three-colour graph as a complete topological invariant for gradient-like diffeomorphisms of surfaces

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grines, V Z; Pochinka, O V; Kapkaeva, S Kh

In a paper of Oshemkov and Sharko, three-colour graphs were used to make the topological equivalence of Morse-Smale flows on surfaces obtained by Peixoto more precise. In the present paper, in the language of three-colour graphs equipped with automorphisms, we obtain a complete (including realization) topological classification of gradient-like cascades on surfaces. Bibliography: 25 titles.

Visualization of Morse connection graphs for topologically rich 2D vector fields.

PubMed

Szymczak, Andrzej; Sipeki, Levente

2013-12-01

Recent advances in vector field topologymake it possible to compute its multi-scale graph representations for autonomous 2D vector fields in a robust and efficient manner. One of these representations is a Morse Connection Graph (MCG), a directed graph whose nodes correspond to Morse sets, generalizing stationary points and periodic trajectories, and arcs - to trajectories connecting them. While being useful for simple vector fields, the MCG can be hard to comprehend for topologically rich vector fields, containing a large number of features. This paper describes a visual representation of the MCG, inspired by previous work on graph visualization. Our approach aims to preserve the spatial relationships between the MCG arcs and nodes and highlight the coherent behavior of connecting trajectories. Using simulations of ocean flow, we show that it can provide useful information on the flow structure. This paper focuses specifically on MCGs computed for piecewise constant (PC) vector fields. In particular, we describe extensions of the PC framework that make it more flexible and better suited for analysis of data on complex shaped domains with a boundary. We also describe a topology simplification scheme that makes our MCG visualizations less ambiguous. Despite the focus on the PC framework, our approach could also be applied to graph representations or topological skeletons computed using different methods.

Low-flow frequency curves for selected long-term stream gaging stations in eastern United States

USGS Publications Warehouse

Hardison, Clayton H.; Martin, Robert O.R.

1963-01-01

Curves showing the magnitude and frequency of annual low flow at 85 streamgaging stations located in 17 States east and 5 States west of the Mississippi River have been smoothed and adjusted to one of four long-term periods. They are presented to show the similarity and dissimilarity of curves even in the same State and to provide background information for studies of the statistical properties of low-flow frequency curves and for studies of the relation between hydrologic environment and low flow. The results are presented as greatly reduced graphs to facilitate comparison and are summarized in tables from which expanded graphs can be plotted.

Study of ATES thermal behavior using a steady flow model

NASA Astrophysics Data System (ADS)

Doughty, C.; Hellstroem, G.; Tsang, C. F.; Claesson, J.

1981-01-01

The thermal behavior of a single well aquifer thermal energy storage system in which buoyancy flow is neglected is studied. A dimensionless formulation of the energy transport equations for the aquifer system is presented, and the key dimensionless parameters are discussed. A simple numerical model is used to generate graphs showing the thermal behavior of the system as a function of these parameters. Some comparisons with field experiments are given to illustrate the use of the dimensionless groups and graphs.

Approximate ground states of the random-field Potts model from graph cuts

NASA Astrophysics Data System (ADS)

Kumar, Manoj; Kumar, Ravinder; Weigel, Martin; Banerjee, Varsha; Janke, Wolfhard; Puri, Sanjay

2018-05-01

While the ground-state problem for the random-field Ising model is polynomial, and can be solved using a number of well-known algorithms for maximum flow or graph cut, the analog random-field Potts model corresponds to a multiterminal flow problem that is known to be NP-hard. Hence an efficient exact algorithm is very unlikely to exist. As we show here, it is nevertheless possible to use an embedding of binary degrees of freedom into the Potts spins in combination with graph-cut methods to solve the corresponding ground-state problem approximately in polynomial time. We benchmark this heuristic algorithm using a set of quasiexact ground states found for small systems from long parallel tempering runs. For a not-too-large number q of Potts states, the method based on graph cuts finds the same solutions in a fraction of the time. We employ the new technique to analyze the breakup length of the random-field Potts model in two dimensions.

Vertex centrality as a measure of information flow in Italian Corporate Board Networks

NASA Astrophysics Data System (ADS)

Grassi, Rosanna

2010-06-01

The aim of this article is to investigate the governance models of companies listed on the Italian Stock Exchange by using a network approach, which describes the interlinks between boards of directors. Following mainstream literature, I construct a weighted graph representing the listed companies (vertices) and their relationships (weighted edges), the Corporate Board Network; I then apply three different vertex centrality measures: degree, betweenness and flow betweenness. What emerges from the network construction and by applying the degree centrality is a structure with a large number of connections but not particularly dense, where the presence of a small number of highly connected nodes (hubs) is evident. Then I focus on betweenness and flow betweenness; indeed I expect that these centrality measures may give a representation of the intensity of the relationship between companies, capturing the volume of information flowing from one vertex to another. Finally, I investigate the possible scale-free structure of the network.

The Vertex Version of Weighted Wiener Number for Bicyclic Molecular Structures

PubMed Central

Gao, Wei

2015-01-01

Graphs are used to model chemical compounds and drugs. In the graphs, each vertex represents an atom of molecule and edges between the corresponding vertices are used to represent covalent bounds between atoms. We call such a graph, which is derived from a chemical compound, a molecular graph. Evidence shows that the vertex-weighted Wiener number, which is defined over this molecular graph, is strongly correlated to both the melting point and boiling point of the compounds. In this paper, we report the extremal vertex-weighted Wiener number of bicyclic molecular graph in terms of molecular structural analysis and graph transformations. The promising prospects of the application for the chemical and pharmacy engineering are illustrated by theoretical results achieved in this paper. PMID:26640513

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir Hossein; Goldbert, Alan; Bagasol, Leonard Neil; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it is shown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Applying Graph Theory to Problems in Air Traffic Management

NASA Technical Reports Server (NTRS)

Farrahi, Amir H.; Goldberg, Alan T.; Bagasol, Leonard N.; Jung, Jaewoo

2017-01-01

Graph theory is used to investigate three different problems arising in air traffic management. First, using a polynomial reduction from a graph partitioning problem, it isshown that both the airspace sectorization problem and its incremental counterpart, the sector combination problem are NP-hard, in general, under several simple workload models. Second, using a polynomial time reduction from maximum independent set in graphs, it is shown that for any fixed e, the problem of finding a solution to the minimum delay scheduling problem in traffic flow management that is guaranteed to be within n1-e of the optimal, where n is the number of aircraft in the problem instance, is NP-hard. Finally, a problem arising in precision arrival scheduling is formulated and solved using graph reachability. These results demonstrate that graph theory provides a powerful framework for modeling, reasoning about, and devising algorithmic solutions to diverse problems arising in air traffic management.

Different Strokes

NASA Technical Reports Server (NTRS)

2004-01-01

In these line graphs of laboratory spectra, it is evident that different minerals have different spectra. The graph on the left shows the typical minerals found in igneous rocks, which are rocks related to magma or volcanic activity. The graph on the right shows iron-bearing candidates for further study and comparison to spectra from the Mars Exploration Rover panoramic cameras on Mars.

A comparison of video modeling, text-based instruction, and no instruction for creating multiple baseline graphs in Microsoft Excel.

PubMed

Tyner, Bryan C; Fienup, Daniel M

2015-09-01

Graphing is socially significant for behavior analysts; however, graphing can be difficult to learn. Video modeling (VM) may be a useful instructional method but lacks evidence for effective teaching of computer skills. A between-groups design compared the effects of VM, text-based instruction, and no instruction on graphing performance. Participants who used VM constructed graphs significantly faster and with fewer errors than those who used text-based instruction or no instruction. Implications for instruction are discussed. © Society for the Experimental Analysis of Behavior.

Resource utilization model for the algorithm to architecture mapping model

NASA Technical Reports Server (NTRS)

Stoughton, John W.; Patel, Rakesh R.

1993-01-01

The analytical model for resource utilization and the variable node time and conditional node model for the enhanced ATAMM model for a real-time data flow architecture are presented in this research. The Algorithm To Architecture Mapping Model, ATAMM, is a Petri net based graph theoretic model developed at Old Dominion University, and is capable of modeling the execution of large-grained algorithms on a real-time data flow architecture. Using the resource utilization model, the resource envelope may be obtained directly from a given graph and, consequently, the maximum number of required resources may be evaluated. The node timing diagram for one iteration period may be obtained using the analytical resource envelope. The variable node time model, which describes the change in resource requirement for the execution of an algorithm under node time variation, is useful to expand the applicability of the ATAMM model to heterogeneous architectures. The model also describes a method of detecting the presence of resource limited mode and its subsequent prevention. Graphs with conditional nodes are shown to be reduced to equivalent graphs with time varying nodes and, subsequently, may be analyzed using the variable node time model to determine resource requirements. Case studies are performed on three graphs for the illustration of applicability of the analytical theories.

Graphical displays for effective reporting of evidence quality tables in research syntheses.

PubMed

Mignini, Luciano; Champaneria, Rita; Mishanina, Ekaterina; Khan, Khalid S

2016-03-09

When generating guidelines, quality of the evidence is tabulated to capture its several domains, often using the GRADE (Grading of Recommendations Assessment, Development and Evaluation) approach. We developed a graphic display to capture deficiencies, outliers and similarities across comparisons contained in GRADE tables. Based on a systematic literature review capturing the effects of 32 different therapeutic comparisons on dysmenorrhoea, we synthesised evidence quality in tables and graphs. We evaluated time taken to accurately assess evident quality and preference for tables vs. graphs. The plots provided visually striking displays of strengths and weaknesses of the evidence across the spectrum of comparisons on a single page. Equivalent tabulated information spread over 4 pages. Participants preferred and interpreted graphs quicker and more accurately than tables. The graphic approach we developed makes interpreting evidence easier. Large tables are dry and cumbersome to read and assimilate. When guideline statements are accompanied by these plots, they have the scope for improving the credibility of the recommendations made, as the strength of the evidence used can be clearly seen. Further empirical research will establish the place for graphic displays.

Application of graph-based semi-supervised learning for development of cyber COP and network intrusion detection

NASA Astrophysics Data System (ADS)

Levchuk, Georgiy; Colonna-Romano, John; Eslami, Mohammed

2017-05-01

The United States increasingly relies on cyber-physical systems to conduct military and commercial operations. Attacks on these systems have increased dramatically around the globe. The attackers constantly change their methods, making state-of-the-art commercial and military intrusion detection systems ineffective. In this paper, we present a model to identify functional behavior of network devices from netflow traces. Our model includes two innovations. First, we define novel features for a host IP using detection of application graph patterns in IP's host graph constructed from 5-min aggregated packet flows. Second, we present the first application, to the best of our knowledge, of Graph Semi-Supervised Learning (GSSL) to the space of IP behavior classification. Using a cyber-attack dataset collected from NetFlow packet traces, we show that GSSL trained with only 20% of the data achieves higher attack detection rates than Support Vector Machines (SVM) and Naïve Bayes (NB) classifiers trained with 80% of data points. We also show how to improve detection quality by filtering out web browsing data, and conclude with discussion of future research directions.

Approximation methods for stochastic petri nets

NASA Technical Reports Server (NTRS)

Jungnitz, Hauke Joerg

1992-01-01

Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay equivalence often fails to converge, while flow equivalent aggregation can lead to potentially bad results if a strong dependence of the mean completion time on the interarrival process exists.

Go With the Flow, on Jupiter and Snow. Coherence from Model-Free Video Data Without Trajectories

NASA Astrophysics Data System (ADS)

AlMomani, Abd AlRahman R.; Bollt, Erik

2018-06-01

Viewing a data set such as the clouds of Jupiter, coherence is readily apparent to human observers, especially the Great Red Spot, but also other great storms and persistent structures. There are now many different definitions and perspectives mathematically describing coherent structures, but we will take an image processing perspective here. We describe an image processing perspective inference of coherent sets from a fluidic system directly from image data, without attempting to first model underlying flow fields, related to a concept in image processing called motion tracking. In contrast to standard spectral methods for image processing which are generally related to a symmetric affinity matrix, leading to standard spectral graph theory, we need a not symmetric affinity which arises naturally from the underlying arrow of time. We develop an anisotropic, directed diffusion operator corresponding to flow on a directed graph, from a directed affinity matrix developed with coherence in mind, and corresponding spectral graph theory from the graph Laplacian. Our methodology is not offered as more accurate than other traditional methods of finding coherent sets, but rather our approach works with alternative kinds of data sets, in the absence of vector field. Our examples will include partitioning the weather and cloud structures of Jupiter, and a local to Potsdam, NY, lake effect snow event on Earth, as well as the benchmark test double-gyre system.

Teaching Interactions between Foreign Exchange Markets and Balance-of-Payments Flows: An Alternative Graphical Approach.

ERIC Educational Resources Information Center

Gaske, Dan

1992-01-01

Provides a graphical framework for presenting interactions among current account flows, capital account flows, and exchange rates. Suggests that the two type of flows must be considered separately in discussions of foreign exchange equilibrium and balance of payments flows. Supplies sample graphs and instructions for applying the framework to real…

Spectral stability of shifted states on star graphs

NASA Astrophysics Data System (ADS)

Kairzhan, Adilbek; Pelinovsky, Dmitry E.

2018-03-01

We consider the nonlinear Schrödinger (NLS) equation with the subcritical power nonlinearity on a star graph consisting of N edges and a single vertex under generalized Kirchhoff boundary conditions. The stationary NLS equation may admit a family of solitary waves parameterized by a translational parameter, which we call the shifted states. The two main examples include (i) the star graph with even N under the classical Kirchhoff boundary conditions and (ii) the star graph with one incoming edge and N  -  1 outgoing edges under a single constraint on coefficients of the generalized Kirchhoff boundary conditions. We obtain the general counting results on the Morse index of the shifted states and apply them to the two examples. In the case of (i), we prove that the shifted states with even N ≥slant 4 are saddle points of the action functional which are spectrally unstable under the NLS flow. In the case of (ii), we prove that the shifted states with the monotone profiles in the N  -  1 edges are spectrally stable, whereas the shifted states with non-monotone profiles in the N  -  1 edges are spectrally unstable, the two families intersect at the half-soliton states which are spectrally stable but nonlinearly unstable under the NLS flow. Since the NLS equation on a star graph with shifted states can be reduced to the homogeneous NLS equation on an infinite line, the spectral instability of shifted states is due to the perturbations breaking this reduction. We give a simple argument suggesting that the spectrally stable shifted states in the case of (ii) are nonlinearly unstable under the NLS flow due to the perturbations breaking the reduction to the homogeneous NLS equation.

Automated Program Recognition by Graph Parsing

DTIC Science & Technology

1992-07-01

structures (cliches) in a program can help an experienced programmer understand the program. Based on the known relationships between the clichis, a...Graph Parsing Linda Mary Wills Abstract The recognition of standard computational structures (cliches) in a program can help an experienced programmer...3.4.1 Structure -Sharing ....... ............................ 76 3.4.2 Aggregation ....................................... 80 2 3.5 Chart Parsing Flow

Graph Representations of Flow and Transport in Fracture Networks using Machine Learning

NASA Astrophysics Data System (ADS)

Srinivasan, G.; Viswanathan, H. S.; Karra, S.; O'Malley, D.; Godinez, H. C.; Hagberg, A.; Osthus, D.; Mohd-Yusof, J.

2017-12-01

Flow and transport of fluids through fractured systems is governed by the properties and interactions at the micro-scale. Retaining information about the micro-structure such as fracture length, orientation, aperture and connectivity in mesh-based computational models results in solving for millions to billions of degrees of freedom and quickly renders the problem computationally intractable. Our approach depicts fracture networks graphically, by mapping fractures to nodes and intersections to edges, thereby greatly reducing computational burden. Additionally, we use machine learning techniques to build simulators on the graph representation, trained on data from the mesh-based high fidelity simulations to speed up computation by orders of magnitude. We demonstrate our methodology on ensembles of discrete fracture networks, dividing up the data into training and validation sets. Our machine learned graph-based solvers result in over 3 orders of magnitude speedup without any significant sacrifice in accuracy.

Descent graphs in pedigree analysis: applications to haplotyping, location scores, and marker-sharing statistics.

PubMed Central

Sobel, E.; Lange, K.

1996-01-01

The introduction of stochastic methods in pedigree analysis has enabled geneticists to tackle computations intractable by standard deterministic methods. Until now these stochastic techniques have worked by running a Markov chain on the set of genetic descent states of a pedigree. Each descent state specifies the paths of gene flow in the pedigree and the founder alleles dropped down each path. The current paper follows up on a suggestion by Elizabeth Thompson that genetic descent graphs offer a more appropriate space for executing a Markov chain. A descent graph specifies the paths of gene flow but not the particular founder alleles traveling down the paths. This paper explores algorithms for implementing Thompson's suggestion for codominant markers in the context of automatic haplotyping, estimating location scores, and computing gene-clustering statistics for robust linkage analysis. Realistic numerical examples demonstrate the feasibility of the algorithms. PMID:8651310

The Dynamics of Flowing Waters.

ERIC Educational Resources Information Center

Mattingly, Rosanna L.

1987-01-01

Describes a series of activities designed to help students understand the dynamics of flowing water. Includes investigations into determining water discharge, calculating variable velocities, utilizing flood formulas, graphing stream profiles, and learning about the water cycle. (TW)

A Graph Summarization Algorithm Based on RFID Logistics

NASA Astrophysics Data System (ADS)

Sun, Yan; Hu, Kongfa; Lu, Zhipeng; Zhao, Li; Chen, Ling

Radio Frequency Identification (RFID) applications are set to play an essential role in object tracking and supply chain management systems. The volume of data generated by a typical RFID application will be enormous as each item will generate a complete history of all the individual locations that it occupied at every point in time. The movement trails of such RFID data form gigantic commodity flowgraph representing the locations and durations of the path stages traversed by each item. In this paper, we use graph to construct a warehouse of RFID commodity flows, and introduce a database-style operation to summarize graphs, which produces a summary graph by grouping nodes based on user-selected node attributes, further allows users to control the hierarchy of summaries. It can cut down the size of graphs, and provide convenience for users to study just on the shrunk graph which they interested. Through extensive experiments, we demonstrate the effectiveness and efficiency of the proposed method.

Laboratory database population surveillance to improve detection of progressive chronic kidney disease.

PubMed

Kennedy, David M; Chatha, Kamaljit; Rayner, Hugh C

2013-09-01

Some patients with chronic kidney disease are still referred late for specialist care despite the evidence that earlier detection and intervention can halt or delay progression to end-stage kidney disease (ESKD). To develop a population surveillance system using existing laboratory data to enable early detection of patients at high risk of ESKD by reviewing cumulative graphs of estimated glomerular filtration rate (eGFR). A database was developed, updated daily with data from the laboratory computer. Cumulative eGFR graphs containing up to five years of data are reviewed by clinical scientists for all primary care patients or out-patients with a low eGFR for their age. For those with a declining trend, a report containing the eGFR graph is sent to the requesting doctor. A retrospective audit was performed using historical data to assess the predictive value of the graphs. In nine months, we reported 370,000 eGFR results, reviewing 12,000 eGFR graphs. On average 60 graphs per week were flagged as 'high' or 'intermediate' risk. Patients with graphs flagged as high risk had a significantly higher mortality after 3.5 years and a significantly greater chance of requiring renal replacement therapy after 4.5 years of follow-up. Five patients (7%) with graphs flagged as high risk had a sustained >25% fall in eGFR without evidence of secondary care referral. Feedback about the service from requesting clinicians was 73% positive. We have developed a system for laboratory staff to review cumulative eGFR graphs for a large population and identify patients at highest risk of developing ESKD. Further research is needed to measure the impact of this service on patient outcomes. © 2013 European Dialysis and Transplant Nurses Association/European Renal Care Association.

Grains of connectivity: analysis at multiple spatial scales in landscape genetics.

PubMed

Galpern, Paul; Manseau, Micheline; Wilson, Paul

2012-08-01

Landscape genetic analyses are typically conducted at one spatial scale. Considering multiple scales may be essential for identifying landscape features influencing gene flow. We examined landscape connectivity for woodland caribou (Rangifer tarandus caribou) at multiple spatial scales using a new approach based on landscape graphs that creates a Voronoi tessellation of the landscape. To illustrate the potential of the method, we generated five resistance surfaces to explain how landscape pattern may influence gene flow across the range of this population. We tested each resistance surface using a raster at the spatial grain of available landscape data (200 m grid squares). We then used our method to produce up to 127 additional grains for each resistance surface. We applied a causal modelling framework with partial Mantel tests, where evidence of landscape resistance is tested against an alternative hypothesis of isolation-by-distance, and found statistically significant support for landscape resistance to gene flow in 89 of the 507 spatial grains examined. We found evidence that major roads as well as the cumulative effects of natural and anthropogenic disturbance may be contributing to the genetic structure. Using only the original grid surface yielded no evidence for landscape resistance to gene flow. Our results show that using multiple spatial grains can reveal landscape influences on genetic structure that may be overlooked with a single grain, and suggest that coarsening the grain of landcover data may be appropriate for highly mobile species. We discuss how grains of connectivity and related analyses have potential landscape genetic applications in a broad range of systems. © 2012 Blackwell Publishing Ltd.

Unapparent Information Revelation: Text Mining for Counterterrorism

NASA Astrophysics Data System (ADS)

Srihari, Rohini K.

Unapparent information revelation (UIR) is a special case of text mining that focuses on detecting possible links between concepts across multiple text documents by generating an evidence trail explaining the connection. A traditional search involving, for example, two or more person names will attempt to find documents mentioning both these individuals. This research focuses on a different interpretation of such a query: what is the best evidence trail across documents that explains a connection between these individuals? For example, all may be good golfers. A generalization of this task involves query terms representing general concepts (e.g. indictment, foreign policy). Previous approaches to this problem have focused on graph mining involving hyperlinked documents, and link analysis exploiting named entities. A new robust framework is presented, based on (i) generating concept chain graphs, a hybrid content representation, (ii) performing graph matching to select candidate subgraphs, and (iii) subsequently using graphical models to validate hypotheses using ranked evidence trails. We adapt the DUC data set for cross-document summarization to evaluate evidence trails generated by this approach

Graph Drawing Aesthetics-Created by Users, Not Algorithms.

PubMed

Purchase, H C; Pilcher, C; Plimmer, B

2012-01-01

Prior empirical work on layout aesthetics for graph drawing algorithms has concentrated on the interpretation of existing graph drawings. We report on experiments which focus on the creation and layout of graph drawings: participants were asked to draw graphs based on adjacency lists, and to lay them out "nicely." Two interaction methods were used for creating the drawings: a sketch interface which allows for easy, natural hand movements, and a formal point-and-click interface similar to a typical graph editing system. We find, in common with many other studies, that removing edge crossings is the most significant aesthetic, but also discover that aligning nodes and edges to an underlying grid is important. We observe that the aesthetics favored by participants during creation of a graph drawing are often not evident in the final product and that the participants did not make a clear distinction between the processes of creation and layout. Our results suggest that graph drawing systems should integrate automatic layout with the user's manual editing process, and provide facilities to support grid-based graph creation.

Shocks and finite-time singularities in Hele-Shaw flow

DOE Office of Scientific and Technical Information (OSTI.GOV)

Teodorescu, Razvan; Wiegmann, P; Lee, S-y

Hele-Shaw flow at vanishing surface tension is ill-defined. In finite time, the flow develops cusplike singularities. We show that the ill-defined problem admits a weak dispersive solution when singularities give rise to a graph of shock waves propagating in the viscous fluid. The graph of shocks grows and branches. Velocity and pressure jump across the shock. We formulate a few simple physical principles which single out the dispersive solution and interpret shocks as lines of decompressed fluid. We also formulate the dispersive solution in algebro-geometrical terms as an evolution of Krichever-Boutroux complex curve. We study in details the most genericmore » (2,3) cusp singularity which gives rise to an elementary branching event. This solution is self-similar and expressed in terms of elliptic functions.« less

The BioMedical Evidence Graph (BMEG) | Informatics Technology for Cancer Research (ITCR)

Cancer.gov

The BMEG is a Cancer Data integration Platform that utilizes methods collected from DREAM challenges and applied to large datasets, such as the TCGA, and makes them avalible for analysis using a high performance graph database

Human body segmentation via data-driven graph cut.

PubMed

Li, Shifeng; Lu, Huchuan; Shao, Xingqing

2014-11-01

Human body segmentation is a challenging and important problem in computer vision. Existing methods usually entail a time-consuming training phase for prior knowledge learning with complex shape matching for body segmentation. In this paper, we propose a data-driven method that integrates top-down body pose information and bottom-up low-level visual cues for segmenting humans in static images within the graph cut framework. The key idea of our approach is first to exploit human kinematics to search for body part candidates via dynamic programming for high-level evidence. Then, by using the body parts classifiers, obtaining bottom-up cues of human body distribution for low-level evidence. All the evidence collected from top-down and bottom-up procedures are integrated in a graph cut framework for human body segmentation. Qualitative and quantitative experiment results demonstrate the merits of the proposed method in segmenting human bodies with arbitrary poses from cluttered backgrounds.

Graphical User Interface Development for Representing Air Flow Patterns

NASA Technical Reports Server (NTRS)

Chaudhary, Nilika

2004-01-01

In the Turbine Branch, scientists carry out experimental and computational work to advance the efficiency and diminish the noise production of jet engine turbines. One way to do this is by decreasing the heat that the turbine blades receive. Most of the experimental work is carried out by taking a single turbine blade and analyzing the air flow patterns around it, because this data indicates the sections of the turbine blade that are getting too hot. Since the cost of doing turbine blade air flow experiments is very high, researchers try to do computational work that fits the experimental data. The goal of computational fluid dynamics is for scientists to find a numerical way to predict the complex flow patterns around different turbine blades without physically having to perform tests or costly experiments. When visualizing flow patterns, scientists need a way to represent the flow conditions around a turbine blade. A researcher will assign specific zones that surround the turbine blade. In a two-dimensional view, the zones are usually quadrilaterals. The next step is to assign boundary conditions which define how the flow enters or exits one side of a zone. way of setting up computational zones and grids, visualizing flow patterns, and storing all the flow conditions in a file on the computer for future computation. Such a program is necessary because the only method for creating flow pattern graphs is by hand, which is tedious and time-consuming. By using a computer program to create the zones and grids, the graph would be faster to make and easier to edit. Basically, the user would run a program that is an editable graph. The user could click and drag with the mouse to form various zones and grids, then edit the locations of these grids, add flow and boundary conditions, and finally save the graph for future use and analysis. My goal this summer is to create a graphical user interface (GUI) that incorporates all of these elements. I am writing the program in Java, a language that is portable among platforms, because it can run on different operating systems such as Windows and Unix without having to be rewritten. I had no prior experience of programming in Java at the start of my internship; I am continuously learning as I create the program. I have written the part of the program that enables a user to draw several zones, edit them, and store their locations. The next phase of my project is to allow the user to click on the side of a zone and create a boundary condition for it. A previous intern wrote a program that allows the user to input boundary conditions. I can integrate the two programs to create a larger, more usable program. After that, I will develop a way for the user to save the graph for future reference. Another eventual goal is to make the GUI capable of creating three-dimensional zones as well. Researchers such as my mentor, Dr. David Ashpis, need a quick, user-friendly

Optimal graph search segmentation using arc-weighted graph for simultaneous surface detection of bladder and prostate.

PubMed

Song, Qi; Wu, Xiaodong; Liu, Yunlong; Smith, Mark; Buatti, John; Sonka, Milan

2009-01-01

We present a novel method for globally optimal surface segmentation of multiple mutually interacting objects, incorporating both edge and shape knowledge in a 3-D graph-theoretic approach. Hard surface interacting constraints are enforced in the interacting regions, preserving the geometric relationship of those partially interacting surfaces. The soft smoothness a priori shape compliance is introduced into the energy functional to provide shape guidance. The globally optimal surfaces can be simultaneously achieved by solving a maximum flow problem based on an arc-weighted graph representation. Representing the segmentation problem in an arc-weighted graph, one can incorporate a wider spectrum of constraints into the formulation, thus increasing segmentation accuracy and robustness in volumetric image data. To the best of our knowledge, our method is the first attempt to introduce the arc-weighted graph representation into the graph-searching approach for simultaneous segmentation of multiple partially interacting objects, which admits a globally optimal solution in a low-order polynomial time. Our new approach was applied to the simultaneous surface detection of bladder and prostate. The result was quite encouraging in spite of the low saliency of the bladder and prostate in CT images.

Top-k similar graph matching using TraM in biological networks.

PubMed

Amin, Mohammad Shafkat; Finley, Russell L; Jamil, Hasan M

2012-01-01

Many emerging database applications entail sophisticated graph-based query manipulation, predominantly evident in large-scale scientific applications. To access the information embedded in graphs, efficient graph matching tools and algorithms have become of prime importance. Although the prohibitively expensive time complexity associated with exact subgraph isomorphism techniques has limited its efficacy in the application domain, approximate yet efficient graph matching techniques have received much attention due to their pragmatic applicability. Since public domain databases are noisy and incomplete in nature, inexact graph matching techniques have proven to be more promising in terms of inferring knowledge from numerous structural data repositories. In this paper, we propose a novel technique called TraM for approximate graph matching that off-loads a significant amount of its processing on to the database making the approach viable for large graphs. Moreover, the vector space embedding of the graphs and efficient filtration of the search space enables computation of approximate graph similarity at a throw-away cost. We annotate nodes of the query graphs by means of their global topological properties and compare them with neighborhood biased segments of the datagraph for proper matches. We have conducted experiments on several real data sets, and have demonstrated the effectiveness and efficiency of the proposed method

A large-grain mapping approach for multiprocessor systems through data flow model. Ph.D. Thesis

NASA Technical Reports Server (NTRS)

Kim, Hwa-Soo

1991-01-01

A large-grain level mapping method is presented of numerical oriented applications onto multiprocessor systems. The method is based on the large-grain data flow representation of the input application and it assumes a general interconnection topology of the multiprocessor system. The large-grain data flow model was used because such representation best exhibits inherited parallelism in many important applications, e.g., CFD models based on partial differential equations can be presented in large-grain data flow format, very effectively. A generalized interconnection topology of the multiprocessor architecture is considered, including such architectural issues as interprocessor communication cost, with the aim to identify the 'best matching' between the application and the multiprocessor structure. The objective is to minimize the total execution time of the input algorithm running on the target system. The mapping strategy consists of the following: (1) large-grain data flow graph generation from the input application using compilation techniques; (2) data flow graph partitioning into basic computation blocks; and (3) physical mapping onto the target multiprocessor using a priority allocation scheme for the computation blocks.

A Graph is Worth a Thousand Words: How Overconfidence and Graphical Disclosure of Numerical Information Influence Financial Analysts Accuracy on Decision Making

PubMed Central

Leite, Rodrigo Oliveira; de Aquino, André Carlos Busanelli

2016-01-01

Previous researches support that graphs are relevant decision aids to tasks related to the interpretation of numerical information. Moreover, literature shows that different types of graphical information can help or harm the accuracy on decision making of accountants and financial analysts. We conducted a 4×2 mixed-design experiment to examine the effects of numerical information disclosure on financial analysts’ accuracy, and investigated the role of overconfidence in decision making. Results show that compared to text, column graph enhanced accuracy on decision making, followed by line graphs. No difference was found between table and textual disclosure. Overconfidence harmed accuracy, and both genders behaved overconfidently. Additionally, the type of disclosure (text, table, line graph and column graph) did not affect the overconfidence of individuals, providing evidence that overconfidence is a personal trait. This study makes three contributions. First, it provides evidence from a larger sample size (295) of financial analysts instead of a smaller sample size of students that graphs are relevant decision aids to tasks related to the interpretation of numerical information. Second, it uses the text as a baseline comparison to test how different ways of information disclosure (line and column graphs, and tables) can enhance understandability of information. Third, it brings an internal factor to this process: overconfidence, a personal trait that harms the decision-making process of individuals. At the end of this paper several research paths are highlighted to further study the effect of internal factors (personal traits) on financial analysts’ accuracy on decision making regarding numerical information presented in a graphical form. In addition, we offer suggestions concerning some practical implications for professional accountants, auditors, financial analysts and standard setters. PMID:27508519

A Graph is Worth a Thousand Words: How Overconfidence and Graphical Disclosure of Numerical Information Influence Financial Analysts Accuracy on Decision Making.

PubMed

Cardoso, Ricardo Lopes; Leite, Rodrigo Oliveira; de Aquino, André Carlos Busanelli

2016-01-01

Previous researches support that graphs are relevant decision aids to tasks related to the interpretation of numerical information. Moreover, literature shows that different types of graphical information can help or harm the accuracy on decision making of accountants and financial analysts. We conducted a 4×2 mixed-design experiment to examine the effects of numerical information disclosure on financial analysts' accuracy, and investigated the role of overconfidence in decision making. Results show that compared to text, column graph enhanced accuracy on decision making, followed by line graphs. No difference was found between table and textual disclosure. Overconfidence harmed accuracy, and both genders behaved overconfidently. Additionally, the type of disclosure (text, table, line graph and column graph) did not affect the overconfidence of individuals, providing evidence that overconfidence is a personal trait. This study makes three contributions. First, it provides evidence from a larger sample size (295) of financial analysts instead of a smaller sample size of students that graphs are relevant decision aids to tasks related to the interpretation of numerical information. Second, it uses the text as a baseline comparison to test how different ways of information disclosure (line and column graphs, and tables) can enhance understandability of information. Third, it brings an internal factor to this process: overconfidence, a personal trait that harms the decision-making process of individuals. At the end of this paper several research paths are highlighted to further study the effect of internal factors (personal traits) on financial analysts' accuracy on decision making regarding numerical information presented in a graphical form. In addition, we offer suggestions concerning some practical implications for professional accountants, auditors, financial analysts and standard setters.

Visualizing Ecosystem Energy Flow in Complex Food Web Networks: A Comparison of Three Alaskan Large Marine Ecosystems

NASA Astrophysics Data System (ADS)

Kearney, K.; Aydin, K.

2016-02-01

Oceanic food webs are often depicted as network graphs, with the major organisms or functional groups displayed as nodes and the fluxes of between them as the edges. However, the large number of nodes and edges and high connectance of many management-oriented food webs coupled with graph layout algorithms poorly-suited to certain desired characteristics of food web visualizations often lead to hopelessly tangled diagrams that convey little information other than, "It's complex." Here, I combine several new graph visualization techniques- including a new node layout alorithm based on a trophic similarity (quantification of shared predator and prey) and trophic level, divided edge bundling for edge routing, and intelligent automated placement of labels- to create a much clearer visualization of the important fluxes through a food web. The technique will be used to highlight the differences in energy flow within three Alaskan Large Marine Ecosystems (the Bering Sea, Gulf of Alaska, and Aleutian Islands) that include very similar functional groups but unique energy pathways.

Discrete Mathematical Approaches to Graph-Based Traffic Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Joslyn, Cliff A.; Cowley, Wendy E.; Hogan, Emilie A.

2014-04-01

Modern cyber defense and anlaytics requires general, formal models of cyber systems. Multi-scale network models are prime candidates for such formalisms, using discrete mathematical methods based in hierarchically-structured directed multigraphs which also include rich sets of labels. An exemplar of an application of such an approach is traffic analysis, that is, observing and analyzing connections between clients, servers, hosts, and actors within IP networks, over time, to identify characteristic or suspicious patterns. Towards that end, NetFlow (or more generically, IPFLOW) data are available from routers and servers which summarize coherent groups of IP packets flowing through the network. In thismore » paper, we consider traffic analysis of Netflow using both basic graph statistics and two new mathematical measures involving labeled degree distributions and time interval overlap measures. We do all of this over the VAST test data set of 96M synthetic Netflow graph edges, against which we can identify characteristic patterns of simulated ground-truth network attacks.« less

SPECTRAL GRAPH THEORY AND GRAPH ENERGY METRICS SHOW EVIDENCE FOR THE ALZHEIMER’S DISEASE DISCONNECTION SYNDROME IN APOE-4 RISK GENE CARRIERS

PubMed Central

Daianu, Madelaine; Mezher, Adam; Jahanshad, Neda; Hibar, Derrek P.; Nir, Talia M.; Jack, Clifford R.; Weiner, Michael W.; Bernstein, Matt A.; Thompson, Paul M.

2015-01-01

Our understanding of network breakdown in Alzheimer’s disease (AD) is likely to be enhanced through advanced mathematical descriptors. Here, we applied spectral graph theory to provide novel metrics of structural connectivity based on 3-Tesla diffusion weighted images in 42 AD patients and 50 healthy controls. We reconstructed connectivity networks using whole-brain tractography and examined, for the first time here, cortical disconnection based on the graph energy and spectrum. We further assessed supporting metrics - link density and nodal strength - to better interpret our results. Metrics were analyzed in relation to the well-known APOE-4 genetic risk factor for late-onset AD. The number of disconnected cortical regions increased with the number of copies of the APOE-4 risk gene in people with AD. Each additional copy of the APOE-4 risk gene may lead to more dysfunctional networks with weakened or abnormal connections, providing evidence for the previously hypothesized “disconnection syndrome”. PMID:26413205

SPECTRAL GRAPH THEORY AND GRAPH ENERGY METRICS SHOW EVIDENCE FOR THE ALZHEIMER'S DISEASE DISCONNECTION SYNDROME IN APOE-4 RISK GENE CARRIERS.

PubMed

Daianu, Madelaine; Mezher, Adam; Jahanshad, Neda; Hibar, Derrek P; Nir, Talia M; Jack, Clifford R; Weiner, Michael W; Bernstein, Matt A; Thompson, Paul M

2015-04-01

Our understanding of network breakdown in Alzheimer's disease (AD) is likely to be enhanced through advanced mathematical descriptors. Here, we applied spectral graph theory to provide novel metrics of structural connectivity based on 3-Tesla diffusion weighted images in 42 AD patients and 50 healthy controls. We reconstructed connectivity networks using whole-brain tractography and examined, for the first time here, cortical disconnection based on the graph energy and spectrum. We further assessed supporting metrics - link density and nodal strength - to better interpret our results. Metrics were analyzed in relation to the well-known APOE -4 genetic risk factor for late-onset AD. The number of disconnected cortical regions increased with the number of copies of the APOE -4 risk gene in people with AD. Each additional copy of the APOE -4 risk gene may lead to more dysfunctional networks with weakened or abnormal connections, providing evidence for the previously hypothesized "disconnection syndrome".

Structure and strategy in encoding simplified graphs

NASA Technical Reports Server (NTRS)

Schiano, Diane J.; Tversky, Barbara

1992-01-01

Tversky and Schiano (1989) found a systematic bias toward the 45-deg line in memory for the slopes of identical lines when embedded in graphs, but not in maps, suggesting the use of a cognitive reference frame specifically for encoding meaningful graphs. The present experiments explore this issue further using the linear configurations alone as stimuli. Experiments 1 and 2 demonstrate that perception and immediate memory for the slope of a test line within orthogonal 'axes' are predictable from purely structural considerations. In Experiments 3 and 4, subjects were instructed to use a diagonal-reference strategy in viewing the stimuli, which were described as 'graphs' only in Experiment 3. Results for both studies showed the diagonal bias previously found only for graphs. This pattern provides converging evidence for the diagonal as a cognitive reference frame in encoding linear graphs, and demonstrates that even in highly simplified displays, strategic factors can produce encoding biases not predictable solely from stimulus structure alone.

Application of machine learning and expert systems to Statistical Process Control (SPC) chart interpretation

NASA Technical Reports Server (NTRS)

Shewhart, Mark

1991-01-01

Statistical Process Control (SPC) charts are one of several tools used in quality control. Other tools include flow charts, histograms, cause and effect diagrams, check sheets, Pareto diagrams, graphs, and scatter diagrams. A control chart is simply a graph which indicates process variation over time. The purpose of drawing a control chart is to detect any changes in the process signalled by abnormal points or patterns on the graph. The Artificial Intelligence Support Center (AISC) of the Acquisition Logistics Division has developed a hybrid machine learning expert system prototype which automates the process of constructing and interpreting control charts.

Clustering in complex directed networks

NASA Astrophysics Data System (ADS)

Fagiolo, Giorgio

2007-08-01

Many empirical networks display an inherent tendency to cluster, i.e., to form circles of connected nodes. This feature is typically measured by the clustering coefficient (CC). The CC, originally introduced for binary, undirected graphs, has been recently generalized to weighted, undirected networks. Here we extend the CC to the case of (binary and weighted) directed networks and we compute its expected value for random graphs. We distinguish between CCs that count all directed triangles in the graph (independently of the direction of their edges) and CCs that only consider particular types of directed triangles (e.g., cycles). The main concepts are illustrated by employing empirical data on world-trade flows.

Method for concurrent execution of primitive operations by dynamically assigning operations based upon computational marked graph and availability of data

NASA Technical Reports Server (NTRS)

Mielke, Roland V. (Inventor); Stoughton, John W. (Inventor)

1990-01-01

Computationally complex primitive operations of an algorithm are executed concurrently in a plurality of functional units under the control of an assignment manager. The algorithm is preferably defined as a computationally marked graph contianing data status edges (paths) corresponding to each of the data flow edges. The assignment manager assigns primitive operations to the functional units and monitors completion of the primitive operations to determine data availability using the computational marked graph of the algorithm. All data accessing of the primitive operations is performed by the functional units independently of the assignment manager.

Anderson localization for radial tree-like random quantum graphs

NASA Astrophysics Data System (ADS)

Hislop, Peter D.; Post, Olaf

We prove that certain random models associated with radial, tree-like, rooted quantum graphs exhibit Anderson localization at all energies. The two main examples are the random length model (RLM) and the random Kirchhoff model (RKM). In the RLM, the lengths of each generation of edges form a family of independent, identically distributed random variables (iid). For the RKM, the iid random variables are associated with each generation of vertices and moderate the current flow through the vertex. We consider extensions to various families of decorated graphs and prove stability of localization with respect to decoration. In particular, we prove Anderson localization for the random necklace model.

Analysis of the low-flow characteristics of streams in Louisiana

USGS Publications Warehouse

Lee, Fred N.

1985-01-01

The U.S. Geological Survey, in cooperation with the Louisiana Department of Transportation and Development, Office of Public Works, used geologic maps, soils maps, precipitation data, and low-flow data to define four hydrographic regions in Louisiana having distinct low-flow characteristics. Equations were derived, using regression analyses, to estimate the 7Q2, 7Q10, and 7Q20 flow rates for basically unaltered stream basins smaller than 525 square miles. Independent variables in the equations include drainage area (square miles), mean annual precipitation index (inches), and main channel slope (feet per mile). Average standard errors of regression ranged from +44 to +61 percent. Graphs are given for estimating the 7Q2, 7Q10, and 7Q20 for stream basins for which the drainage area of the most downstream data-collection site is larger than 525 square miles. Detailed examples are given in this report for the use of the equations and graphs.

Adapting high-level language programs for parallel processing using data flow

NASA Technical Reports Server (NTRS)

Standley, Hilda M.

1988-01-01

EASY-FLOW, a very high-level data flow language, is introduced for the purpose of adapting programs written in a conventional high-level language to a parallel environment. The level of parallelism provided is of the large-grained variety in which parallel activities take place between subprograms or processes. A program written in EASY-FLOW is a set of subprogram calls as units, structured by iteration, branching, and distribution constructs. A data flow graph may be deduced from an EASY-FLOW program.

Graph Design via Convex Optimization: Online and Distributed Perspectives

NASA Astrophysics Data System (ADS)

Meng, De

Network and graph have long been natural abstraction of relations in a variety of applications, e.g. transportation, power system, social network, communication, electrical circuit, etc. As a large number of computation and optimization problems are naturally defined on graphs, graph structures not only enable important properties of these problems, but also leads to highly efficient distributed and online algorithms. For example, graph separability enables the parallelism for computation and operation as well as limits the size of local problems. More interestingly, graphs can be defined and constructed in order to take best advantage of those problem properties. This dissertation focuses on graph structure and design in newly proposed optimization problems, which establish a bridge between graph properties and optimization problem properties. We first study a new optimization problem called Geodesic Distance Maximization Problem (GDMP). Given a graph with fixed edge weights, finding the shortest path, also known as the geodesic, between two nodes is a well-studied network flow problem. We introduce the Geodesic Distance Maximization Problem (GDMP): the problem of finding the edge weights that maximize the length of the geodesic subject to convex constraints on the weights. We show that GDMP is a convex optimization problem for a wide class of flow costs, and provide a physical interpretation using the dual. We present applications of the GDMP in various fields, including optical lens design, network interdiction, and resource allocation in the control of forest fires. We develop an Alternating Direction Method of Multipliers (ADMM) by exploiting specific problem structures to solve large-scale GDMP, and demonstrate its effectiveness in numerical examples. We then turn our attention to distributed optimization on graph with only local communication. Distributed optimization arises in a variety of applications, e.g. distributed tracking and localization, estimation problems in sensor networks, multi-agent coordination. Distributed optimization aims to optimize a global objective function formed by summation of coupled local functions over a graph via only local communication and computation. We developed a weighted proximal ADMM for distributed optimization using graph structure. This fully distributed, single-loop algorithm allows simultaneous updates and can be viewed as a generalization of existing algorithms. More importantly, we achieve faster convergence by jointly designing graph weights and algorithm parameters. Finally, we propose a new problem on networks called Online Network Formation Problem: starting with a base graph and a set of candidate edges, at each round of the game, player one first chooses a candidate edge and reveals it to player two, then player two decides whether to accept it; player two can only accept limited number of edges and make online decisions with the goal to achieve the best properties of the synthesized network. The network properties considered include the number of spanning trees, algebraic connectivity and total effective resistance. These network formation games arise in a variety of cooperative multiagent systems. We propose a primal-dual algorithm framework for the general online network formation game, and analyze the algorithm performance by the competitive ratio and regret.

Evolutionary Games of Multiplayer Cooperation on Graphs

PubMed Central

Arranz, Jordi; Traulsen, Arne

2016-01-01

There has been much interest in studying evolutionary games in structured populations, often modeled as graphs. However, most analytical results so far have only been obtained for two-player or linear games, while the study of more complex multiplayer games has been usually tackled by computer simulations. Here we investigate evolutionary multiplayer games on graphs updated with a Moran death-Birth process. For cycles, we obtain an exact analytical condition for cooperation to be favored by natural selection, given in terms of the payoffs of the game and a set of structure coefficients. For regular graphs of degree three and larger, we estimate this condition using a combination of pair approximation and diffusion approximation. For a large class of cooperation games, our approximations suggest that graph-structured populations are stronger promoters of cooperation than populations lacking spatial structure. Computer simulations validate our analytical approximations for random regular graphs and cycles, but show systematic differences for graphs with many loops such as lattices. In particular, our simulation results show that these kinds of graphs can even lead to more stringent conditions for the evolution of cooperation than well-mixed populations. Overall, we provide evidence suggesting that the complexity arising from many-player interactions and spatial structure can be captured by pair approximation in the case of random graphs, but that it need to be handled with care for graphs with high clustering. PMID:27513946

Effect of Graph Scale on Risky Choice: Evidence from Preference and Process in Decision-Making

PubMed Central

Sun, Yan; Li, Shu; Bonini, Nicolao; Liu, Yang

2016-01-01

We investigate the effect of graph scale on risky choices. By (de)compressing the scale, we manipulate the relative physical distance between options on a given attribute in a coordinate graphical context. In Experiment 1, the risky choice changes as a function of the scale in the graph. In Experiment 2, we show that the type of graph scale also affects decision times. In Experiment 3, we examine the graph scale effect by using real money among students who have taken statistics courses. Consequently, the scale effects still appear even when we control the variations in calculation ability and increase the gravity with which participants view the consequence of their decisions. This finding is inconsistent with descriptive invariance of preference. The theoretical implications and practical applications of the findings are discussed. PMID:26771530

Assessing dynamic brain graphs of time-varying connectivity in fMRI data: application to healthy controls and patients with schizophrenia

PubMed Central

Yu, Qingbao; Erhardt, Erik B.; Sui, Jing; Du, Yuhui; He, Hao; Hjelm, Devon; Cetin, Mustafa S.; Rachakonda, Srinivas; Miller, Robyn L.; Pearlson, Godfrey; Calhoun, Vince D.

2014-01-01

Graph theory-based analysis has been widely employed in brain imaging studies, and altered topological properties of brain connectivity have emerged as important features of mental diseases such as schizophrenia. However, most previous studies have focused on graph metrics of stationary brain graphs, ignoring that brain connectivity exhibits fluctuations over time. Here we develop a new framework for accessing dynamic graph properties of time-varying functional brain connectivity in resting state fMRI data and apply it to healthy controls (HCs) and patients with schizophrenia (SZs). Specifically, nodes of brain graphs are defined by intrinsic connectivity networks (ICNs) identified by group independent component analysis (ICA). Dynamic graph metrics of the time-varying brain connectivity estimated by the correlation of sliding time-windowed ICA time courses of ICNs are calculated. First- and second-level connectivity states are detected based on the correlation of nodal connectivity strength between time-varying brain graphs. Our results indicate that SZs show decreased variance in the dynamic graph metrics. Consistent with prior stationary functional brain connectivity works, graph measures of identified first-level connectivity states show lower values in SZs. In addition, more first-level connectivity states are disassociated with the second-level connectivity state which resembles the stationary connectivity pattern computed by the entire scan. Collectively, the findings provide new evidence about altered dynamic brain graphs in schizophrenia which may underscore the abnormal brain performance in this mental illness. PMID:25514514

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, J.; Hagberg, A.; Srinivasan, G.; Mohd-Yusof, J.; Viswanathan, H. S.

2017-12-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

NASA Astrophysics Data System (ADS)

Hyman, Jeffrey D.; Hagberg, Aric; Srinivasan, Gowri; Mohd-Yusof, Jamaludin; Viswanathan, Hari

2017-07-01

We present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths. First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. Accurate estimates of first passage times are obtained with an order of magnitude reduction of CPU time and mesh size using the proposed method.

Multimodal Teaching Analytics: Automated Extraction of Orchestration Graphs from Wearable Sensor Data

ERIC Educational Resources Information Center

Prieto, L. P.; Sharma, K.; Kidzinski, L.; Rodríguez-Triana, M. J.; Dillenbourg, P.

2018-01-01

The pedagogical modelling of everyday classroom practice is an interesting kind of evidence, both for educational research and teachers' own professional development. This paper explores the usage of wearable sensors and machine learning techniques to automatically extract orchestration graphs (teaching activities and their social plane over time)…

Hands-on Materials for Teaching about Global Climate Change through Graph Interpretation

ERIC Educational Resources Information Center

Rule, Audrey C.; Hallagan, Jean E.; Shaffer, Barbara

2008-01-01

Teachers need to address global climate change with students in their classrooms as evidence for consequences from these environmental changes mounts. One way to approach global climate change is through examination of authentic data. Mathematics and science may be integrated by interpreting graphs from the professional literature. This study…

Fostering Positive Attitude in Probability Learning Using Graphing Calculator

ERIC Educational Resources Information Center

Tan, Choo-Kim; Harji, Madhubala Bava; Lau, Siong-Hoe

2011-01-01

Although a plethora of research evidence highlights positive and significant outcomes of the incorporation of the Graphing Calculator (GC) in mathematics education, its use in the teaching and learning process appears to be limited. The obvious need to revisit the teaching and learning of Probability has resulted in this study, i.e. to incorporate…

Modeling multi-process connectivity in river deltas: extending the single layer network analysis to a coupled multilayer network framework

NASA Astrophysics Data System (ADS)

Tejedor, A.; Longjas, A.; Foufoula-Georgiou, E.

2017-12-01

Previous work [e.g. Tejedor et al., 2016 - GRL] has demonstrated the potential of using graph theory to study key properties of the structure and dynamics of river delta channel networks. Although the distribution of fluxes in river deltas is mostly driven by the connectivity of its channel network a significant part of the fluxes might also arise from connectivity between the channels and islands due to overland flow and seepage. This channel-island-subsurface interaction creates connectivity pathways which facilitate or inhibit transport depending on their degree of coupling. The question we pose here is how to collectively study system connectivity that emerges from the aggregated action of different processes (different in nature, intensity and time scales). Single-layer graphs as those introduced for delta channel networks are inadequate as they lack the ability to represent coupled processes, and neglecting across-process interactions can lead to mis-representation of the overall system dynamics. We present here a framework that generalizes the traditional representation of networks (single-layer graphs) to the so-called multi-layer networks or multiplex. A multi-layer network conceptualizes the overall connectivity arising from different processes as distinct graphs (layers), while allowing at the same time to represent interactions between layers by introducing interlayer links (across process interactions). We illustrate this framework using a study of the joint connectivity that arises from the coupling of the confined flow on the channel network and the overland flow on islands, on a prototype delta. We show the potential of the multi-layer framework to answer quantitatively questions related to the characteristic time scales to steady-state transport in the system as a whole when different levels of channel-island coupling are modulated by different magnitudes of discharge rates.

A Numerical Study of Hypersonic Forebody/Inlet Integration Problem

NASA Technical Reports Server (NTRS)

Kumar, Ajay

1991-01-01

A numerical study of hypersonic forebody/inlet integration problem is presented in the form of the view-graphs. The following topics are covered: physical/chemical modeling; solution procedure; flow conditions; mass flow rate at inlet face; heating and skin friction loads; 3-D forebogy/inlet integration model; and sensitivity studies.

Speech graphs provide a quantitative measure of thought disorder in psychosis.

PubMed

Mota, Natalia B; Vasconcelos, Nivaldo A P; Lemos, Nathalia; Pieretti, Ana C; Kinouchi, Osame; Cecchi, Guillermo A; Copelli, Mauro; Ribeiro, Sidarta

2012-01-01

Psychosis has various causes, including mania and schizophrenia. Since the differential diagnosis of psychosis is exclusively based on subjective assessments of oral interviews with patients, an objective quantification of the speech disturbances that characterize mania and schizophrenia is in order. In principle, such quantification could be achieved by the analysis of speech graphs. A graph represents a network with nodes connected by edges; in speech graphs, nodes correspond to words and edges correspond to semantic and grammatical relationships. To quantify speech differences related to psychosis, interviews with schizophrenics, manics and normal subjects were recorded and represented as graphs. Manics scored significantly higher than schizophrenics in ten graph measures. Psychopathological symptoms such as logorrhea, poor speech, and flight of thoughts were grasped by the analysis even when verbosity differences were discounted. Binary classifiers based on speech graph measures sorted schizophrenics from manics with up to 93.8% of sensitivity and 93.7% of specificity. In contrast, sorting based on the scores of two standard psychiatric scales (BPRS and PANSS) reached only 62.5% of sensitivity and specificity. The results demonstrate that alterations of the thought process manifested in the speech of psychotic patients can be objectively measured using graph-theoretical tools, developed to capture specific features of the normal and dysfunctional flow of thought, such as divergence and recurrence. The quantitative analysis of speech graphs is not redundant with standard psychometric scales but rather complementary, as it yields a very accurate sorting of schizophrenics and manics. Overall, the results point to automated psychiatric diagnosis based not on what is said, but on how it is said.

Study of cryogenic propellant systems for loading the space shuttle. Part 2: Hydrogen systems

NASA Technical Reports Server (NTRS)

Steward, W. G.

1975-01-01

Computer simulation studies of liquid hydrogen fill and vent systems for the space shuttle are studied. The computer programs calculate maximum and minimum permissible flow rates during cooldown as limited by thermal stress considerations, fill line cooldown time, pressure drop, flow rates, vapor content, vent line pressure drop and vent line discharge temperature. The input data for these programs are selected through graphic displays which schematically depict the part of the system being analyzed. The computed output is also displayed in the form of printed messages and graphs. Digital readouts of graph coordinates may also be obtained. Procedures are given for operation of the graphic display unit and the associated minicomputer and timesharing computer.

Streamflow Characteristics of Streams in the Helmand Basin, Afghanistan

USGS Publications Warehouse

Williams-Sether, Tara

2008-01-01

Statistical summaries of streamflow data for all historical streamflow-gaging stations for the Helmand Basin upstream from the Sistan Wetlands are presented in this report. The summaries for each streamflow-gaging station include (1) manuscript (station description), (2) graph of the annual mean discharge for the period of record, (3) statistics of monthly and annual mean discharges, (4) graph of the annual flow duration, (5) monthly and annual flow duration, (6) probability of occurrence of annual high discharges, (7) probability of occurrence of annual low discharges, (8) probability of occurrence of seasonal low discharges, (9) annual peak discharge and corresponding gage height for the period of record, and (10) monthly and annual mean discharges for the period of record.

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata

PubMed Central

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-01-01

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research. PMID:28353664

Modeling and Density Estimation of an Urban Freeway Network Based on Dynamic Graph Hybrid Automata.

PubMed

Chen, Yangzhou; Guo, Yuqi; Wang, Ying

2017-03-29

In this paper, in order to describe complex network systems, we firstly propose a general modeling framework by combining a dynamic graph with hybrid automata and thus name it Dynamic Graph Hybrid Automata (DGHA). Then we apply this framework to model traffic flow over an urban freeway network by embedding the Cell Transmission Model (CTM) into the DGHA. With a modeling procedure, we adopt a dual digraph of road network structure to describe the road topology, use linear hybrid automata to describe multi-modes of dynamic densities in road segments and transform the nonlinear expressions of the transmitted traffic flow between two road segments into piecewise linear functions in terms of multi-mode switchings. This modeling procedure is modularized and rule-based, and thus is easily-extensible with the help of a combination algorithm for the dynamics of traffic flow. It can describe the dynamics of traffic flow over an urban freeway network with arbitrary topology structures and sizes. Next we analyze mode types and number in the model of the whole freeway network, and deduce a Piecewise Affine Linear System (PWALS) model. Furthermore, based on the PWALS model, a multi-mode switched state observer is designed to estimate the traffic densities of the freeway network, where a set of observer gain matrices are computed by using the Lyapunov function approach. As an example, we utilize the PWALS model and the corresponding switched state observer to traffic flow over Beijing third ring road. In order to clearly interpret the principle of the proposed method and avoid computational complexity, we adopt a simplified version of Beijing third ring road. Practical application for a large-scale road network will be implemented by decentralized modeling approach and distributed observer designing in the future research.

Random sequential renormalization and agglomerative percolation in networks: application to Erdös-Rényi and scale-free graphs.

PubMed

Bizhani, Golnoosh; Grassberger, Peter; Paczuski, Maya

2011-12-01

We study the statistical behavior under random sequential renormalization (RSR) of several network models including Erdös-Rényi (ER) graphs, scale-free networks, and an annealed model related to ER graphs. In RSR the network is locally coarse grained by choosing at each renormalization step a node at random and joining it to all its neighbors. Compared to previous (quasi-)parallel renormalization methods [Song et al., Nature (London) 433, 392 (2005)], RSR allows a more fine-grained analysis of the renormalization group (RG) flow and unravels new features that were not discussed in the previous analyses. In particular, we find that all networks exhibit a second-order transition in their RG flow. This phase transition is associated with the emergence of a giant hub and can be viewed as a new variant of percolation, called agglomerative percolation. We claim that this transition exists also in previous graph renormalization schemes and explains some of the scaling behavior seen there. For critical trees it happens as N/N(0) → 0 in the limit of large systems (where N(0) is the initial size of the graph and N its size at a given RSR step). In contrast, it happens at finite N/N(0) in sparse ER graphs and in the annealed model, while it happens for N/N(0) → 1 on scale-free networks. Critical exponents seem to depend on the type of the graph but not on the average degree and obey usual scaling relations for percolation phenomena. For the annealed model they agree with the exponents obtained from a mean-field theory. At late times, the networks exhibit a starlike structure in agreement with the results of Radicchi et al. [Phys. Rev. Lett. 101, 148701 (2008)]. While degree distributions are of main interest when regarding the scheme as network renormalization, mass distributions (which are more relevant when considering "supernodes" as clusters) are much easier to study using the fast Newman-Ziff algorithm for percolation, allowing us to obtain very high statistics.

Surface-region context in optimal multi-object graph-based segmentation: robust delineation of pulmonary tumors.

PubMed

Song, Qi; Chen, Mingqing; Bai, Junjie; Sonka, Milan; Wu, Xiaodong

2011-01-01

Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target objects of arbitrary shape mutually interact with terrain-like surfaces, which widely exists in the medical imaging field. The approach incorporates context information used during simultaneous segmentation of multiple objects. The object-surface interaction information is encoded by adding weighted inter-graph arcs to our graph model. A globally optimal solution is achieved by solving a single maximum flow problem in a low-order polynomial time. The performance of the method was evaluated in robust delineation of lung tumors in megavoltage cone-beam CT images in comparison with an expert-defined independent standard. The evaluation showed that our method generated highly accurate tumor segmentations. Compared with the conventional graph-cut method, our new approach provided significantly better results (p < 0.001). The Dice coefficient obtained by the conventional graph-cut approach (0.76 +/- 0.10) was improved to 0.84 +/- 0.05 when employing our new method for pulmonary tumor segmentation.

Developing and evaluating Quilts for the depiction of large layered graphs.

PubMed

Bae, Juhee; Watson, Ben

2011-12-01

Traditional layered graph depictions such as flow charts are in wide use. Yet as graphs grow more complex, these depictions can become difficult to understand. Quilts are matrix-based depictions for layered graphs designed to address this problem. In this research, we first improve Quilts by developing three design alternatives, and then compare the best of these alternatives to better-known node-link and matrix depictions. A primary weakness in Quilts is their depiction of skip links, links that do not simply connect to a succeeding layer. Therefore in our first study, we compare Quilts using color-only, text-only, and mixed (color and text) skip link depictions, finding that path finding with the color-only depiction is significantly slower and less accurate, and that in certain cases, the mixed depiction offers an advantage over the text-only depiction. In our second study, we compare Quilts using the mixed depiction to node-link diagrams and centered matrices. Overall results show that users can find paths through graphs significantly faster with Quilts (46.6 secs) than with node-link (58.3 secs) or matrix (71.2 secs) diagrams. This speed advantage is still greater in large graphs (e.g. in 200 node graphs, 55.4 secs vs. 71.1 secs for node-link and 84.2 secs for matrix depictions). © 2011 IEEE

U-interpreter

DOE Office of Scientific and Technical Information (OSTI.GOV)

Arvind; Gostelow, K.P.

1982-02-01

The author argues that by giving a unique name to every activity generated during a computation, the u-interpreter can provide greater concurrency in the interpretation of data flow graphs. 19 references.

Modelling information flow along the human connectome using maximum flow.

PubMed

Lyoo, Youngwook; Kim, Jieun E; Yoon, Sujung

2018-01-01

The human connectome is a complex network that transmits information between interlinked brain regions. Using graph theory, previously well-known network measures of integration between brain regions have been constructed under the key assumption that information flows strictly along the shortest paths possible between two nodes. However, it is now apparent that information does flow through non-shortest paths in many real-world networks such as cellular networks, social networks, and the internet. In the current hypothesis, we present a novel framework using the maximum flow to quantify information flow along all possible paths within the brain, so as to implement an analogy to network traffic. We hypothesize that the connection strengths of brain networks represent a limit on the amount of information that can flow through the connections per unit of time. This allows us to compute the maximum amount of information flow between two brain regions along all possible paths. Using this novel framework of maximum flow, previous network topological measures are expanded to account for information flow through non-shortest paths. The most important advantage of the current approach using maximum flow is that it can integrate the weighted connectivity data in a way that better reflects the real information flow of the brain network. The current framework and its concept regarding maximum flow provides insight on how network structure shapes information flow in contrast to graph theory, and suggests future applications such as investigating structural and functional connectomes at a neuronal level. Copyright © 2017 Elsevier Ltd. All rights reserved.

Using Graphing Software to Teach about Algebraic Forms: A Study of Technology-Supported Practice in Secondary-School Mathematics

ERIC Educational Resources Information Center

Ruthven, Kenneth; Deaney, Rosemary; Hennessy, Sara

2009-01-01

From preliminary analysis of teacher-nominated examples of successful technology-supported practice in secondary-school mathematics, the use of graphing software to teach about algebraic forms was identified as being an important archetype. Employing evidence from lesson observation and teacher interview, such practice was investigated in greater…

Investigating a Link between Pre-Calculus Students' Uses of Graphing Calculators and Their Understanding of Mathematical Symbols

ERIC Educational Resources Information Center

Kenney, Rachael H.

2014-01-01

This study examined ways in which students make use of a graphing calculator and how use relates to comfort and understanding with mathematical symbols. Analysis involved examining students' words and actions in problem solving to identify evidence of algebraic insight. Findings suggest that some symbols and symbolic structures had strong…

Impaired cerebral blood flow networks in temporal lobe epilepsy with hippocampal sclerosis: A graph theoretical approach.

PubMed

Sone, Daichi; Matsuda, Hiroshi; Ota, Miho; Maikusa, Norihide; Kimura, Yukio; Sumida, Kaoru; Yokoyama, Kota; Imabayashi, Etsuko; Watanabe, Masako; Watanabe, Yutaka; Okazaki, Mitsutoshi; Sato, Noriko

2016-09-01

Graph theory is an emerging method to investigate brain networks. Altered cerebral blood flow (CBF) has frequently been reported in temporal lobe epilepsy (TLE), but graph theoretical findings of CBF are poorly understood. Here, we explored graph theoretical networks of CBF in TLE using arterial spin labeling imaging. We recruited patients with TLE and unilateral hippocampal sclerosis (HS) (19 patients with left TLE, and 21 with right TLE) and 20 gender- and age-matched healthy control subjects. We obtained all participants' CBF maps using pseudo-continuous arterial spin labeling and analyzed them using the Graph Analysis Toolbox (GAT) software program. As a result, compared to the controls, the patients with left TLE showed a significantly low clustering coefficient (p=0.024), local efficiency (p=0.001), global efficiency (p=0.010), and high transitivity (p=0.015), whereas the patients with right TLE showed significantly high assortativity (p=0.046) and transitivity (p=0.011). The group with right TLE also had high characteristic path length values (p=0.085), low global efficiency (p=0.078), and low resilience to targeted attack (p=0.101) at a trend level. Lower normalized clustering coefficient (p=0.081) in the left TLE and higher normalized characteristic path length (p=0.089) in the right TLE were found also at a trend level. Both the patients with left and right TLE showed significantly decreased clustering in similar areas, i.e., the cingulate gyri, precuneus, and occipital lobe. Our findings revealed differing left-right network metrics in which an inefficient CBF network in left TLE and vulnerability to irritation in right TLE are suggested. The left-right common finding of regional decreased clustering might reflect impaired default-mode networks in TLE. Copyright © 2016 Elsevier Inc. All rights reserved.

Statistically significant relational data mining :

DOE Office of Scientific and Technical Information (OSTI.GOV)

Berry, Jonathan W.; Leung, Vitus Joseph; Phillips, Cynthia Ann

This report summarizes the work performed under the project (3z(BStatitically significant relational data mining.(3y (BThe goal of the project was to add more statistical rigor to the fairly ad hoc area of data mining on graphs. Our goal was to develop better algorithms and better ways to evaluate algorithm quality. We concetrated on algorithms for community detection, approximate pattern matching, and graph similarity measures. Approximate pattern matching involves finding an instance of a relatively small pattern, expressed with tolerance, in a large graph of data observed with uncertainty. This report gathers the abstracts and references for the eight refereed publicationsmore » that have appeared as part of this work. We then archive three pieces of research that have not yet been published. The first is theoretical and experimental evidence that a popular statistical measure for comparison of community assignments favors over-resolved communities over approximations to a ground truth. The second are statistically motivated methods for measuring the quality of an approximate match of a small pattern in a large graph. The third is a new probabilistic random graph model. Statisticians favor these models for graph analysis. The new local structure graph model overcomes some of the issues with popular models such as exponential random graph models and latent variable models.« less

Canonic FFT flow graphs for real-valued even/odd symmetric inputs

NASA Astrophysics Data System (ADS)

Lao, Yingjie; Parhi, Keshab K.

2017-12-01

Canonic real-valued fast Fourier transform (RFFT) has been proposed to reduce the arithmetic complexity by eliminating redundancies. In a canonic N-point RFFT, the number of signal values at each stage is canonic with respect to the number of signal values, i.e., N. The major advantage of the canonic RFFTs is that these require the least number of butterfly operations and only real datapaths when mapped to architectures. In this paper, we consider the FFT computation whose inputs are not only real but also even/odd symmetric, which indeed lead to the well-known discrete cosine and sine transforms (DCTs and DSTs). Novel algorithms for generating the flow graphs of canonic RFFTs with even/odd symmetric inputs are proposed. It is shown that the proposed algorithms lead to canonic structures with N/2 +1 signal values at each stage for an N-point real even symmetric FFT (REFFT) or N/2 -1 signal values at each stage for an N-point RFFT real odd symmetric FFT (ROFFT). In order to remove butterfly operations, several twiddle factor transformations are proposed in this paper. We also discuss the design of canonic REFFT for any composite length. Performances of the canonic REFFT/ROFFT are also discussed. It is shown that the flow graph of canonic REFFT/ROFFT has less number of interconnections, less butterfly operations, and less twiddle factor operations, compared to prior works.

A Single Session of rTMS Enhances Small-Worldness in Writer's Cramp: Evidence from Simultaneous EEG-fMRI Multi-Modal Brain Graph.

PubMed

Bharath, Rose D; Panda, Rajanikant; Reddam, Venkateswara Reddy; Bhaskar, M V; Gohel, Suril; Bhardwaj, Sujas; Prajapati, Arvind; Pal, Pramod Kumar

2017-01-01

Background and Purpose : Repetitive transcranial magnetic stimulation (rTMS) induces widespread changes in brain connectivity. As the network topology differences induced by a single session of rTMS are less known we undertook this study to ascertain whether the network alterations had a small-world morphology using multi-modal graph theory analysis of simultaneous EEG-fMRI. Method : Simultaneous EEG-fMRI was acquired in duplicate before (R1) and after (R2) a single session of rTMS in 14 patients with Writer's Cramp (WC). Whole brain neuronal and hemodynamic network connectivity were explored using the graph theory measures and clustering coefficient, path length and small-world index were calculated for EEG and resting state fMRI (rsfMRI). Multi-modal graph theory analysis was used to evaluate the correlation of EEG and fMRI clustering coefficients. Result : A single session of rTMS was found to increase the clustering coefficient and small-worldness significantly in both EEG and fMRI ( p < 0.05). Multi-modal graph theory analysis revealed significant modulations in the fronto-parietal regions immediately after rTMS. The rsfMRI revealed additional modulations in several deep brain regions including cerebellum, insula and medial frontal lobe. Conclusion : Multi-modal graph theory analysis of simultaneous EEG-fMRI can supplement motor physiology methods in understanding the neurobiology of rTMS in vivo . Coinciding evidence from EEG and rsfMRI reports small-world morphology for the acute phase network hyper-connectivity indicating changes ensuing low-frequency rTMS is probably not "noise".

Thermal Energy Storage in Phase Change Material.

DTIC Science & Technology

1982-03-01

Graphs of the exnerimental results follow: tney are groupea in the tree categories: tube cross flow, ricked bed, and tube parallel flow. A. Tube Cross... Riordan , Michael, "Thermal Storage: A Rtsic Guile to the Ptate of the Art", Solar Age, Aril, 1978, P. 10. 5. Telkes, Maria, "Thermal Lner y Storage in

A quantum physical design flow using ILP and graph drawing

NASA Astrophysics Data System (ADS)

Yazdani, Maryam; Saheb Zamani, Morteza; Sedighi, Mehdi

2013-10-01

Implementing large-scale quantum circuits is one of the challenges of quantum computing. One of the central challenges of accurately modeling the architecture of these circuits is to schedule a quantum application and generate the layout while taking into account the cost of communications and classical resources as well as the maximum exploitable parallelism. In this paper, we present and evaluate a design flow for arbitrary quantum circuits in ion trap technology. Our design flow consists of two parts. First, a scheduler takes a description of a circuit and finds the best order for the execution of its quantum gates using integer linear programming regarding the classical resources (qubits) and instruction dependencies. Then a layout generator receives the schedule produced by the scheduler and generates a layout for this circuit using a graph-drawing algorithm. Our experimental results show that the proposed flow decreases the average latency of quantum circuits by about 11 % for a set of attempted benchmarks and by about 9 % for another set of benchmarks compared with the best in literature.

Measuring the hierarchy of feedforward networks

NASA Astrophysics Data System (ADS)

Corominas-Murtra, Bernat; Rodríguez-Caso, Carlos; Goñi, Joaquín; Solé, Ricard

2011-03-01

In this paper we explore the concept of hierarchy as a quantifiable descriptor of ordered structures, departing from the definition of three conditions to be satisfied for a hierarchical structure: order, predictability, and pyramidal structure. According to these principles, we define a hierarchical index taking concepts from graph and information theory. This estimator allows to quantify the hierarchical character of any system susceptible to be abstracted in a feedforward causal graph, i.e., a directed acyclic graph defined in a single connected structure. Our hierarchical index is a balance between this predictability and pyramidal condition by the definition of two entropies: one attending the onward flow and the other for the backward reversion. We show how this index allows to identify hierarchical, antihierarchical, and nonhierarchical structures. Our formalism reveals that departing from the defined conditions for a hierarchical structure, feedforward trees and the inverted tree graphs emerge as the only causal structures of maximal hierarchical and antihierarchical systems respectively. Conversely, null values of the hierarchical index are attributed to a number of different configuration networks; from linear chains, due to their lack of pyramid structure, to full-connected feedforward graphs where the diversity of onward pathways is canceled by the uncertainty (lack of predictability) when going backward. Some illustrative examples are provided for the distinction among these three types of hierarchical causal graphs.

SAGE: String-overlap Assembly of GEnomes.

PubMed

Ilie, Lucian; Haider, Bahlul; Molnar, Michael; Solis-Oba, Roberto

2014-09-15

De novo genome assembly of next-generation sequencing data is one of the most important current problems in bioinformatics, essential in many biological applications. In spite of significant amount of work in this area, better solutions are still very much needed. We present a new program, SAGE, for de novo genome assembly. As opposed to most assemblers, which are de Bruijn graph based, SAGE uses the string-overlap graph. SAGE builds upon great existing work on string-overlap graph and maximum likelihood assembly, bringing an important number of new ideas, such as the efficient computation of the transitive reduction of the string overlap graph, the use of (generalized) edge multiplicity statistics for more accurate estimation of read copy counts, and the improved use of mate pairs and min-cost flow for supporting edge merging. The assemblies produced by SAGE for several short and medium-size genomes compared favourably with those of existing leading assemblers. SAGE benefits from innovations in almost every aspect of the assembly process: error correction of input reads, string-overlap graph construction, read copy counts estimation, overlap graph analysis and reduction, contig extraction, and scaffolding. We hope that these new ideas will help advance the current state-of-the-art in an essential area of research in genomics.

High-Performance Data Analytics Beyond the Relational and Graph Data Models with GEMS

DOE Office of Scientific and Technical Information (OSTI.GOV)

Castellana, Vito G.; Minutoli, Marco; Bhatt, Shreyansh

Graphs represent an increasingly popular data model for data-analytics, since they can naturally represent relationships and interactions between entities. Relational databases and their pure table-based data model are not well suitable to store and process sparse data. Consequently, graph databases have gained interest in the last few years and the Resource Description Framework (RDF) became the standard data model for graph data. Nevertheless, while RDF is well suited to analyze the relationships between the entities, it is not efficient in representing their attributes and properties. In this work we propose the adoption of a new hybrid data model, based onmore » attributed graphs, that aims at overcoming the limitations of the pure relational and graph data models. We present how we have re-designed the GEMS data-analytics framework to fully take advantage of the proposed hybrid data model. To improve analysts productivity, in addition to a C++ API for applications development, we adopt GraQL as input query language. We validate our approach implementing a set of queries on net-flow data and we compare our framework performance against Neo4j. Experimental results show significant performance improvement over Neo4j, up to several orders of magnitude when increasing the size of the input data.« less

On Bipartite Graphs Trees and Their Partial Vertex Covers.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Caskurlu, Bugra; Mkrtchyan, Vahan; Parekh, Ojas D.

2015-03-01

Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. Itmore » can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.« less

Using graph approach for managing connectivity in integrative landscape modelling

NASA Astrophysics Data System (ADS)

Rabotin, Michael; Fabre, Jean-Christophe; Libres, Aline; Lagacherie, Philippe; Crevoisier, David; Moussa, Roger

2013-04-01

In cultivated landscapes, a lot of landscape elements such as field boundaries, ditches or banks strongly impact water flows, mass and energy fluxes. At the watershed scale, these impacts are strongly conditionned by the connectivity of these landscape elements. An accurate representation of these elements and of their complex spatial arrangements is therefore of great importance for modelling and predicting these impacts.We developped in the framework of the OpenFLUID platform (Software Environment for Modelling Fluxes in Landscapes) a digital landscape representation that takes into account the spatial variabilities and connectivities of diverse landscape elements through the application of the graph theory concepts. The proposed landscape representation consider spatial units connected together to represent the flux exchanges or any other information exchanges. Each spatial unit of the landscape is represented as a node of a graph and relations between units as graph connections. The connections are of two types - parent-child connection and up/downstream connection - which allows OpenFLUID to handle hierarchical graphs. Connections can also carry informations and graph evolution during simulation is possible (connections or elements modifications). This graph approach allows a better genericity on landscape representation, a management of complex connections and facilitate development of new landscape representation algorithms. Graph management is fully operational in OpenFLUID for developers or modelers ; and several graph tools are available such as graph traversal algorithms or graph displays. Graph representation can be managed i) manually by the user (for example in simple catchments) through XML-based files in easily editable and readable format or ii) by using methods of the OpenFLUID-landr library which is an OpenFLUID library relying on common open-source spatial libraries (ogr vector, geos topologic vector and gdal raster libraries). OpenFLUID-landr library has been developed in order i) to be used with no GIS expert skills needed (common gis formats can be read and simplified spatial management is provided), ii) to easily develop adapted rules of landscape discretization and graph creation to follow spatialized model requirements and iii) to allow model developers to manage dynamic and complex spatial topology. Graph management in OpenFLUID are shown with i) examples of hydrological modelizations on complex farmed landscapes and ii) the new implementation of Geo-MHYDAS tool based on the OpenFLUID-landr library, which allows to discretize a landscape and create graph structure for the MHYDAS model requirements.

Investigation of flow turning phenomenon - Effect of upstream and downstream propagation

NASA Astrophysics Data System (ADS)

Baum, Joseph D.

1988-01-01

Upstream acoustic-wave propagation in flow injected laterally through the boundary layer of a tube (simulating the flow in a solid-rocket motor) is investigated analytically. A noniterative linearized-block implicit scheme is used to solve the time-dependent compressible Navier-Stokes equations, and the results are presented in extensive graphs and characterized. Acoustic streaming interaction is shown to be significantly greater for upstream than for downstream propagation.

Coherent structure coloring: identification of coherent structures from sparse flow trajectories using graph theory

NASA Astrophysics Data System (ADS)

Schlueter, Kristy; Dabiri, John

2016-11-01

Coherent structure identification is important in many fluid dynamics applications, including transport phenomena in ocean flows and mixing and diffusion in turbulence. However, many of the techniques currently available for measuring such flows, including ocean drifter datasets and particle tracking velocimetry, only result in sparse velocity data. This is often insufficient for the use of current coherent structure detection algorithms based on analysis of the deformation gradient. Here, we present a frame-invariant method for detecting coherent structures from Lagrangian flow trajectories that can be sparse in number. The method, based on principles used in graph coloring algorithms, examines a measure of the kinematic dissimilarity of all pairs of flow trajectories, either measured experimentally, e.g. using particle tracking velocimetry; or numerically, by advecting fluid particles in the Eulerian velocity field. Coherence is assigned to groups of particles whose kinematics remain similar throughout the time interval for which trajectory data is available, regardless of their physical proximity to one another. Through the use of several analytical and experimental validation cases, this algorithm is shown to robustly detect coherent structures using significantly less flow data than is required by existing methods. This research was supported by the Department of Defense (DoD) through the National Defense Science & Engineering Graduate Fellowship (NDSEG) Program.

Directional Agglomeration Multigrid Techniques for High Reynolds Number Viscous Flow Solvers

NASA Technical Reports Server (NTRS)

1998-01-01

A preconditioned directional-implicit agglomeration algorithm is developed for solving two- and three-dimensional viscous flows on highly anisotropic unstructured meshes of mixed-element types. The multigrid smoother consists of a pre-conditioned point- or line-implicit solver which operates on lines constructed in the unstructured mesh using a weighted graph algorithm. Directional coarsening or agglomeration is achieved using a similar weighted graph algorithm. A tight coupling of the line construction and directional agglomeration algorithms enables the use of aggressive coarsening ratios in the multigrid algorithm, which in turn reduces the cost of a multigrid cycle. Convergence rates which are independent of the degree of grid stretching are demonstrated in both two and three dimensions. Further improvement of the three-dimensional convergence rates through a GMRES technique is also demonstrated.

Directional Agglomeration Multigrid Techniques for High-Reynolds Number Viscous Flows

NASA Technical Reports Server (NTRS)

Mavriplis, Dimitri J.

1998-01-01

A preconditioned directional-implicit agglomeration algorithm is developed for solving two- and three-dimensional viscous flows on highly anisotropic unstructured meshes of mixed-element types. The multigrid smoother consists of a pre-conditioned point- or line-implicit solver which operates on lines constructed in the unstructured mesh using a weighted graph algorithm. Directional coarsening or agglomeration is achieved using a similar weighted graph algorithm. A tight coupling of the line construction and directional agglomeration algorithms enables the use of aggressive coarsening ratios in the multigrid algorithm, which in turn reduces the cost of a multigrid cycle. Convergence rates which are independent of the degree of grid stretching are demonstrated in both two and three dimensions. Further improvement of the three-dimensional convergence rates through a GMRES technique is also demonstrated.

Repartitioning Strategies for Massively Parallel Simulation of Reacting Flow

NASA Astrophysics Data System (ADS)

Pisciuneri, Patrick; Zheng, Angen; Givi, Peyman; Labrinidis, Alexandros; Chrysanthis, Panos

2015-11-01

The majority of parallel CFD simulators partition the domain into equal regions and assign the calculations for a particular region to a unique processor. This type of domain decomposition is vital to the efficiency of the solver. However, as the simulation develops, the workload among the partitions often become uneven (e.g. by adaptive mesh refinement, or chemically reacting regions) and a new partition should be considered. The process of repartitioning adjusts the current partition to evenly distribute the load again. We compare two repartitioning tools: Zoltan, an architecture-agnostic graph repartitioner developed at the Sandia National Laboratories; and Paragon, an architecture-aware graph repartitioner developed at the University of Pittsburgh. The comparative assessment is conducted via simulation of the Taylor-Green vortex flow with chemical reaction.

Error-Rate Estimation Based on Multi-Signal Flow Graph Model and Accelerated Radiation Tests

PubMed Central

Wang, Yueke; Xing, Kefei; Deng, Wei; Zhang, Zelong

2016-01-01

A method of evaluating the single-event effect soft-error vulnerability of space instruments before launched has been an active research topic in recent years. In this paper, a multi-signal flow graph model is introduced to analyze the fault diagnosis and meantime to failure (MTTF) for space instruments. A model for the system functional error rate (SFER) is proposed. In addition, an experimental method and accelerated radiation testing system for a signal processing platform based on the field programmable gate array (FPGA) is presented. Based on experimental results of different ions (O, Si, Cl, Ti) under the HI-13 Tandem Accelerator, the SFER of the signal processing platform is approximately 10−3(error/particle/cm2), while the MTTF is approximately 110.7 h. PMID:27583533

Error-Rate Estimation Based on Multi-Signal Flow Graph Model and Accelerated Radiation Tests.

PubMed

He, Wei; Wang, Yueke; Xing, Kefei; Deng, Wei; Zhang, Zelong

2016-01-01

A method of evaluating the single-event effect soft-error vulnerability of space instruments before launched has been an active research topic in recent years. In this paper, a multi-signal flow graph model is introduced to analyze the fault diagnosis and meantime to failure (MTTF) for space instruments. A model for the system functional error rate (SFER) is proposed. In addition, an experimental method and accelerated radiation testing system for a signal processing platform based on the field programmable gate array (FPGA) is presented. Based on experimental results of different ions (O, Si, Cl, Ti) under the HI-13 Tandem Accelerator, the SFER of the signal processing platform is approximately 10-3(error/particle/cm2), while the MTTF is approximately 110.7 h.

Expanding our understanding of students' use of graphs for learning physics

NASA Astrophysics Data System (ADS)

Laverty, James T.

It is generally agreed that the ability to visualize functional dependencies or physical relationships as graphs is an important step in modeling and learning. However, several studies in Physics Education Research (PER) have shown that many students in fact do not master this form of representation and even have misconceptions about the meaning of graphs that impede learning physics concepts. Working with graphs in classroom settings has been shown to improve student abilities with graphs, particularly when the students can interact with them. We introduce a novel problem type in an online homework system, which requires students to construct the graphs themselves in free form, and requires no hand-grading by instructors. A study of pre/post-test data using the Test of Understanding Graphs in Kinematics (TUG-K) over several semesters indicates that students learn significantly more from these graph construction problems than from the usual graph interpretation problems, and that graph interpretation alone may not have any significant effect. The interpretation of graphs, as well as the representation translation between textual, mathematical, and graphical representations of physics scenarios, are frequently listed among the higher order thinking skills we wish to convey in an undergraduate course. But to what degree do we succeed? Do students indeed employ higher order thinking skills when working through graphing exercises? We investigate students working through a variety of graph problems, and, using a think-aloud protocol, aim to reconstruct the cognitive processes that the students go through. We find that to a certain degree, these problems become commoditized and do not trigger the desired higher order thinking processes; simply translating ``textbook-like'' problems into the graphical realm will not achieve any additional educational goals. Whether the students have to interpret or construct a graph makes very little difference in the methods used by the students. We will also look at the results of using graph problems in an online learning environment. We will show evidence that construction problems lead to a higher degree of difficulty and degree of discrimination than other graph problems and discuss the influence the course has on these variables.

Techniques for estimating magnitude and frequency of floods in Minnesota

USGS Publications Warehouse

Guetzkow, Lowell C.

1977-01-01

 Estimating relations have been developed to provide engineers and designers with improved techniques for defining flow-frequency characteristics to satisfy hydraulic planning and design requirements. The magnitude and frequency of floods up to the 100-year recurrence interval can be determined for most streams in Minnesota by methods presented. By multiple regression analysis, equations have been developed for estimating flood-frequency relations at ungaged sites on natural flow streams. Eight distinct hydrologic regions are delineated within the State with boundaries defined generally by river basin divides. Regression equations are provided for each region which relate selected frequency floods to significant basin parameters. For main-stem streams, graphs are presented showing floods for selected recurrence intervals plotted against contributing drainage area. Flow-frequency estimates for intervening sites along the Minnesota River, Mississippi River, and the Red River of the North can be derived from these graphs. Flood-frequency characteristics are tabulated for 201 paging stations having 10 or more years of record.

Impact of generalized Fourier's and Fick's laws on MHD 3D second grade nanofluid flow with variable thermal conductivity and convective heat and mass conditions

NASA Astrophysics Data System (ADS)

Ramzan, M.; Bilal, M.; Chung, Jae Dong; Lu, Dian Chen; Farooq, Umer

2017-09-01

A mathematical model has been established to study the magnetohydrodynamic second grade nanofluid flow past a bidirectional stretched surface. The flow is induced by Cattaneo-Christov thermal and concentration diffusion fluxes. Novel characteristics of Brownian motion and thermophoresis are accompanied by temperature dependent thermal conductivity and convective heat and mass boundary conditions. Apposite transformations are betrothed to transform a system of nonlinear partial differential equations to nonlinear ordinary differential equations. Analytic solutions of the obtained nonlinear system are obtained via a convergent method. Graphs are plotted to examine how velocity, temperature, and concentration distributions are affected by varied physical involved parameters. Effects of skin friction coefficients along the x- and y-direction versus various parameters are also shown through graphs and are well debated. Our findings show that velocities along both the x and y axes exhibit a decreasing trend for the Hartmann number. Moreover, temperature and concentration distributions are decreasing functions of thermal and concentration relaxation parameters.

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Predictions of first passage times in sparse discrete fracture networks using graph-based reductions

DOE PAGES

Hyman, Jeffrey De'Haven; Hagberg, Aric Arild; Mohd-Yusof, Jamaludin; ...

2017-07-10

Here, we present a graph-based methodology to reduce the computational cost of obtaining first passage times through sparse fracture networks. We also derive graph representations of generic three-dimensional discrete fracture networks (DFNs) using the DFN topology and flow boundary conditions. Subgraphs corresponding to the union of the k shortest paths between the inflow and outflow boundaries are identified and transport on their equivalent subnetworks is compared to transport through the full network. The number of paths included in the subgraphs is based on the scaling behavior of the number of edges in the graph with the number of shortest paths.more » First passage times through the subnetworks are in good agreement with those obtained in the full network, both for individual realizations and in distribution. We obtain accurate estimates of first passage times with an order of magnitude reduction of CPU time and mesh size using the proposed method.« less

Methods used to compute low-flow frequency characteristics for continuous-record streamflow stations in Minnesota, 2006

USGS Publications Warehouse

Winterstein, Thomas A.; Arntson, Allan D.; Mitton, Gregory B.

2007-01-01

The 1-, 7-, and 30-day low-flow series were determined for 120 continuous-record streamflow stations in Minnesota having at least 20 years of continuous record. The 2-, 5-, 10-, 50-, and 100-year statistics were determined for each series by fitting a log Pearson type III distribution to the data. The methods used to determine the low-flow statistics and to construct the plots of the low-flow frequency curves are described. The low-flow series and the low-flow statistics are presented in tables and graphs.

Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph

NASA Astrophysics Data System (ADS)

Yan, Jing; Guan, Xin-Ping; Luo, Xiao-Yuan

2011-04-01

This paper is concerned with the cooperative target pursuit problem by multiple agents based on directed acyclic graph. The target appears at a random location and moves only when sensed by the agents, and agents will pursue the target once they detect its existence. Since the ability of each agent may be different, we consider the heterogeneous multi-agent systems. According to the topology of the multi-agent systems, a novel consensus-based control law is proposed, where the target and agents are modeled as a leader and followers, respectively. Based on Mason's rule and signal flow graph analysis, the convergence conditions are provided to show that the agents can catch the target in a finite time. Finally, simulation studies are provided to verify the effectiveness of the proposed approach.

Graph theory applied to the analysis of motor activity in patients with schizophrenia and depression

PubMed Central

Fasmer, Erlend Eindride; Berle, Jan Øystein; Oedegaard, Ketil J.; Hauge, Erik R.

2018-01-01

Depression and schizophrenia are defined only by their clinical features, and diagnostic separation between them can be difficult. Disturbances in motor activity pattern are central features of both types of disorders. We introduce a new method to analyze time series, called the similarity graph algorithm. Time series of motor activity, obtained from actigraph registrations over 12 days in depressed and schizophrenic patients, were mapped into a graph and we then applied techniques from graph theory to characterize these time series, primarily looking for changes in complexity. The most marked finding was that depressed patients were found to be significantly different from both controls and schizophrenic patients, with evidence of less regularity of the time series, when analyzing the recordings with one hour intervals. These findings support the contention that there are important differences in control systems regulating motor behavior in patients with depression and schizophrenia. The similarity graph algorithm we have described can easily be applied to the study of other types of time series. PMID:29668743

Graph theory applied to the analysis of motor activity in patients with schizophrenia and depression.

PubMed

Fasmer, Erlend Eindride; Fasmer, Ole Bernt; Berle, Jan Øystein; Oedegaard, Ketil J; Hauge, Erik R

2018-01-01

Depression and schizophrenia are defined only by their clinical features, and diagnostic separation between them can be difficult. Disturbances in motor activity pattern are central features of both types of disorders. We introduce a new method to analyze time series, called the similarity graph algorithm. Time series of motor activity, obtained from actigraph registrations over 12 days in depressed and schizophrenic patients, were mapped into a graph and we then applied techniques from graph theory to characterize these time series, primarily looking for changes in complexity. The most marked finding was that depressed patients were found to be significantly different from both controls and schizophrenic patients, with evidence of less regularity of the time series, when analyzing the recordings with one hour intervals. These findings support the contention that there are important differences in control systems regulating motor behavior in patients with depression and schizophrenia. The similarity graph algorithm we have described can easily be applied to the study of other types of time series.

The structural and functional connectivity of the grassland plant Lychnis flos-cuculi

PubMed Central

Aavik, T; Holderegger, R; Bolliger, J

2014-01-01

Understanding the relationship between structural and functional connectivity is essential for successful restoration and conservation management, particularly in intensely managed agricultural landscapes. We evaluated the relationship between structural and functional connectivity of the wetland plant Lychnis flos-cuculi in a fragmented agricultural landscape using landscape genetic and network approaches. First, we studied the effect of structural connectivity, such as geographic distance and various landscape elements (forest, agricultural land, settlements and ditch verges), on gene flow among populations as a measurement of functional connectivity. Second, we examined the effect of structural graph-theoretic connectivity measures on gene flow among populations and on genetic diversity within populations of L. flos-cuculi. Among landscape elements, forests hindered gene flow in L. flos-cuculi, whereas gene flow was independent of geographic distance. Among the structural graph-theoretic connectivity variables, only intrapopulation connectivity, which was based on population size, had a significant positive effect on gene flow, that is, more gene flow took place among larger populations. Unexpectedly, interpopulation connectivity of populations, which takes into account the spatial location and distance among populations, did not influence gene flow in L. flos-cuculi. However, higher observed heterozygosity and lower inbreeding was observed in populations characterised by higher structural interpopulation connectivity. This finding shows that a spatially coherent network of populations is significant for maintaining the genetic diversity of populations. Nevertheless, lack of significant relationships between gene flow and most of the structural connectivity measures suggests that structural connectivity does not necessarily correspond to functional connectivity. PMID:24253937

Modeling and optimum time performance for concurrent processing

NASA Technical Reports Server (NTRS)

Mielke, Roland R.; Stoughton, John W.; Som, Sukhamoy

1988-01-01

The development of a new graph theoretic model for describing the relation between a decomposed algorithm and its execution in a data flow environment is presented. Called ATAMM, the model consists of a set of Petri net marked graphs useful for representing decision-free algorithms having large-grained, computationally complex primitive operations. Performance time measures which determine computing speed and throughput capacity are defined, and the ATAMM model is used to develop lower bounds for these times. A concurrent processing operating strategy for achieving optimum time performance is presented and illustrated by example.

Modeling heterogeneous processor scheduling for real time systems

NASA Technical Reports Server (NTRS)

Leathrum, J. F.; Mielke, R. R.; Stoughton, J. W.

1994-01-01

A new model is presented to describe dataflow algorithms implemented in a multiprocessing system. Called the resource/data flow graph (RDFG), the model explicitly represents cyclo-static processor schedules as circuits of processor arcs which reflect the order that processors execute graph nodes. The model also allows the guarantee of meeting hard real-time deadlines. When unfolded, the model identifies statically the processor schedule. The model therefore is useful for determining the throughput and latency of systems with heterogeneous processors. The applicability of the model is demonstrated using a space surveillance algorithm.

The Maiden Voyage of a Kinematics Robot

NASA Astrophysics Data System (ADS)

Greenwolfe, Matthew L.

2015-04-01

In a Montessori preschool classroom, students work independently on tasks that absorb their attention in part because the apparatus are carefully designed to make mistakes directly observable and limit exploration to one aspect or dimension. Control of error inheres in the apparatus itself, so that teacher intervention can be minimal.1 Inspired by this example, I created a robotic kinematics apparatus that also shapes the inquiry experience. Students program the robot by drawing kinematic graphs on a computer and then observe its motion. Exploration is at once limited to constant velocity and constant acceleration motion, yet open to complex multi-segment examples difficult to achieve in the lab in other ways. The robot precisely and reliably produces the motion described by the students' graphs, so that the apparatus itself provides immediate visual feedback about whether their understanding is correct as they are free to explore within the hard-coded limits. In particular, the kinematic robot enables hands-on study of multi-segment constant velocity situations, which lays a far stronger foundation for the study of accelerated motion. When correction is anonymous—just between one group of lab partners and their robot—students using the kinematic robot tend to flow right back to work because they view the correction as an integral part of the inquiry learning process. By contrast, when correction occurs by the teacher and/or in public (e.g., returning a graded assignment or pointing out student misconceptions during class), students all too often treat the event as the endpoint to inquiry. Furthermore, quantitative evidence shows a large gain from pre-test to post-test scores using the Test of Understanding Graphs in Kinematics (TUG-K).

Supporting shared hypothesis testing in the biomedical domain.

PubMed

Agibetov, Asan; Jiménez-Ruiz, Ernesto; Ondrésik, Marta; Solimando, Alessandro; Banerjee, Imon; Guerrini, Giovanna; Catalano, Chiara E; Oliveira, Joaquim M; Patanè, Giuseppe; Reis, Rui L; Spagnuolo, Michela

2018-02-08

Pathogenesis of inflammatory diseases can be tracked by studying the causality relationships among the factors contributing to its development. We could, for instance, hypothesize on the connections of the pathogenesis outcomes to the observed conditions. And to prove such causal hypotheses we would need to have the full understanding of the causal relationships, and we would have to provide all the necessary evidences to support our claims. In practice, however, we might not possess all the background knowledge on the causality relationships, and we might be unable to collect all the evidence to prove our hypotheses. In this work we propose a methodology for the translation of biological knowledge on causality relationships of biological processes and their effects on conditions to a computational framework for hypothesis testing. The methodology consists of two main points: hypothesis graph construction from the formalization of the background knowledge on causality relationships, and confidence measurement in a causality hypothesis as a normalized weighted path computation in the hypothesis graph. In this framework, we can simulate collection of evidences and assess confidence in a causality hypothesis by measuring it proportionally to the amount of available knowledge and collected evidences. We evaluate our methodology on a hypothesis graph that represents both contributing factors which may cause cartilage degradation and the factors which might be caused by the cartilage degradation during osteoarthritis. Hypothesis graph construction has proven to be robust to the addition of potentially contradictory information on the simultaneously positive and negative effects. The obtained confidence measures for the specific causality hypotheses have been validated by our domain experts, and, correspond closely to their subjective assessments of confidences in investigated hypotheses. Overall, our methodology for a shared hypothesis testing framework exhibits important properties that researchers will find useful in literature review for their experimental studies, planning and prioritizing evidence collection acquisition procedures, and testing their hypotheses with different depths of knowledge on causal dependencies of biological processes and their effects on the observed conditions.

A Wavelet Analysis Approach for Categorizing Air Traffic Behavior

NASA Technical Reports Server (NTRS)

Drew, Michael; Sheth, Kapil

2015-01-01

In this paper two frequency domain techniques are applied to air traffic analysis. The Continuous Wavelet Transform (CWT), like the Fourier Transform, is shown to identify changes in historical traffic patterns caused by Traffic Management Initiatives (TMIs) and weather with the added benefit of detecting when in time those changes take place. Next, with the expectation that it could detect anomalies in the network and indicate the extent to which they affect traffic flows, the Spectral Graph Wavelet Transform (SGWT) is applied to a center based graph model of air traffic. When applied to simulations based on historical flight plans, it identified the traffic flows between centers that have the greatest impact on either neighboring flows, or flows between centers many centers away. Like the CWT, however, it can be difficult to interpret SGWT results and relate them to simulations where major TMIs are implemented, and more research may be warranted in this area. These frequency analysis techniques can detect off-nominal air traffic behavior, but due to the nature of air traffic time series data, so far they prove difficult to apply in a way that provides significant insight or specific identification of traffic patterns.

Reservoir simulation with MUFITS code: Extension for double porosity reservoirs and flows in horizontal wells

NASA Astrophysics Data System (ADS)

Afanasyev, Andrey

2017-04-01

Numerical modelling of multiphase flows in porous medium is necessary in many applications concerning subsurface utilization. An incomplete list of those applications includes oil and gas fields exploration, underground carbon dioxide storage and geothermal energy production. The numerical simulations are conducted using complicated computer programs called reservoir simulators. A robust simulator should include a wide range of modelling options covering various exploration techniques, rock and fluid properties, and geological settings. In this work we present a recent development of new options in MUFITS code [1]. The first option concerns modelling of multiphase flows in double-porosity double-permeability reservoirs. We describe internal representation of reservoir models in MUFITS, which are constructed as a 3D graph of grid blocks, pipe segments, interfaces, etc. In case of double porosity reservoir, two linked nodes of the graph correspond to a grid cell. We simulate the 6th SPE comparative problem [2] and a five-spot geothermal production problem to validate the option. The second option concerns modelling of flows in porous medium coupled with flows in horizontal wells that are represented in the 3D graph as a sequence of pipe segments linked with pipe junctions. The well completions link the pipe segments with reservoir. The hydraulics in the wellbore, i.e. the frictional pressure drop, is calculated in accordance with Haaland's formula. We validate the option against the 7th SPE comparative problem [3]. We acknowledge financial support by the Russian Foundation for Basic Research (project No RFBR-15-31-20585). References [1] Afanasyev, A. MUFITS Reservoir Simulation Software (www.mufits.imec.msu.ru). [2] Firoozabadi A. et al. Sixth SPE Comparative Solution Project: Dual-Porosity Simulators // J. Petrol. Tech. 1990. V.42. N.6. P.710-715. [3] Nghiem L., et al. Seventh SPE Comparative Solution Project: Modelling of Horizontal Wells in Reservoir Simulation // SPE Symp. Res. Sim., 1991. DOI: 10.2118/21221-MS.

Three-Dimensional Flow of an Oldroyd-B Fluid with Variable Thermal Conductivity and Heat Generation/Absorption

PubMed Central

Shehzad, Sabir Ali; Alsaedi, Ahmed; Hayat, Tasawar; Alhuthali, M. Shahab

2013-01-01

This paper looks at the series solutions of three dimensional boundary layer flow. An Oldroyd-B fluid with variable thermal conductivity is considered. The flow is induced due to stretching of a surface. Analysis has been carried out in the presence of heat generation/absorption. Homotopy analysis is implemented in developing the series solutions to the governing flow and energy equations. Graphs are presented and discussed for various parameters of interest. Comparison of present study with the existing limiting solution is shown and examined. PMID:24223780

Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets.

PubMed

Salem, Saeed; Ozcaglar, Cagri

2014-01-01

Advances in genomic technologies have enabled the accumulation of vast amount of genomic data, including gene expression data for multiple species under various biological and environmental conditions. Integration of these gene expression datasets is a promising strategy to alleviate the challenges of protein functional annotation and biological module discovery based on a single gene expression data, which suffers from spurious coexpression. We propose a joint mining algorithm that constructs a weighted hybrid similarity graph whose nodes are the coexpression links. The weight of an edge between two coexpression links in this hybrid graph is a linear combination of the topological similarities and co-appearance similarities of the corresponding two coexpression links. Clustering the weighted hybrid similarity graph yields recurrent coexpression link clusters (modules). Experimental results on Human gene expression datasets show that the reported modules are functionally homogeneous as evident by their enrichment with biological process GO terms and KEGG pathways.

The Use of Weighted Graphs for Large-Scale Genome Analysis

PubMed Central

Zhou, Fang; Toivonen, Hannu; King, Ross D.

2014-01-01

There is an acute need for better tools to extract knowledge from the growing flood of sequence data. For example, thousands of complete genomes have been sequenced, and their metabolic networks inferred. Such data should enable a better understanding of evolution. However, most existing network analysis methods are based on pair-wise comparisons, and these do not scale to thousands of genomes. Here we propose the use of weighted graphs as a data structure to enable large-scale phylogenetic analysis of networks. We have developed three types of weighted graph for enzymes: taxonomic (these summarize phylogenetic importance), isoenzymatic (these summarize enzymatic variety/redundancy), and sequence-similarity (these summarize sequence conservation); and we applied these types of weighted graph to survey prokaryotic metabolism. To demonstrate the utility of this approach we have compared and contrasted the large-scale evolution of metabolism in Archaea and Eubacteria. Our results provide evidence for limits to the contingency of evolution. PMID:24619061

Laser anemometry for hot flows

NASA Astrophysics Data System (ADS)

Kugler, P.; Langer, G.

1987-07-01

The fundamental principles, instrumentation, and practical operation of LDA and laser-transit-anemometry systems for measuring velocity profiles and the degree of turbulence in high-temperature flows are reviewed and illustrated with diagrams, drawings and graphs of typical data. Consideration is given to counter, tracker, spectrum-analyzer and correlation methods of LDA signal processing; multichannel analyzer and cross correlation methods for LTA data; LTA results for a small liquid fuel rocket motor; and experiments demonstrating the feasibility of an optoacoustic demodulation scheme for LDA signals from unsteady flows.

Unsteady Boundary-Layer Flow over Jerked Plate Moving in a Free Stream of Viscoelastic Fluid

PubMed Central

Mehmood, Ahmer; Ali, Asif; Saleem, Najma

2014-01-01

This study aims to investigate the unsteady boundary-layer flow of a viscoelastic non-Newtonian fluid over a flat surface. The plate is suddenly jerked to move with uniform velocity in a uniform stream of non-Newtonian fluid. Purely analytic solution to governing nonlinear equation is obtained. The solution is highly accurate and valid for all values of the dimensionless time 0 ≤ τ < ∞. Flow properties of the viscoelastic fluid are discussed through graphs. PMID:24892060

Three-dimensional quantitative flow diagnostics

NASA Technical Reports Server (NTRS)

Miles, Richard B.; Nosenchuck, Daniel M.

1989-01-01

The principles, capabilities, and practical implementation of advanced measurement techniques for the quantitative characterization of three-dimensional flows are reviewed. Consideration is given to particle, Rayleigh, and Raman scattering; fluorescence; flow marking by H2 bubbles, photochromism, photodissociation, and vibrationally excited molecules; light-sheet volume imaging; and stereo imaging. Also discussed are stereo schlieren methods, holographic particle imaging, optical tomography, acoustic and magnetic-resonance imaging, and the display of space-filling data. Extensive diagrams, graphs, photographs, sample images, and tables of numerical data are provided.

Time of travel of solutes in selected reaches of the Sandusky River Basin, Ohio, 1972 and 1973

USGS Publications Warehouse

Westfall, Arthur O.

1976-01-01

A time of travel study of a 106-mile (171-kilometer) reach of the Sandusky River and a 39-mile (63-kilometer) reach of Tymochtee Creek was made to determine the time required for water released from Killdeer Reservoir on Tymochtee Creek to reach selected downstream points. In general, two dye sample runs were made through each subreach to define the time-discharge relation for approximating travel times at selected discharges within the measured range, and time-discharge graphs are presented for 38 subreaches. Graphs of dye dispersion and variation in relation to time are given for three selected sampling sites. For estimating travel time and velocities between points in the study reach, tables for selected flow durations are given. Duration curves of daily discharge for four index stations are presented to indicate the lo-flow characteristics and for use in shaping downward extensions of the time-discharge curves.

NeAT: a toolbox for the analysis of biological networks, clusters, classes and pathways.

PubMed

Brohée, Sylvain; Faust, Karoline; Lima-Mendez, Gipsi; Sand, Olivier; Janky, Rekin's; Vanderstocken, Gilles; Deville, Yves; van Helden, Jacques

2008-07-01

The network analysis tools (NeAT) (http://rsat.ulb.ac.be/neat/) provide a user-friendly web access to a collection of modular tools for the analysis of networks (graphs) and clusters (e.g. microarray clusters, functional classes, etc.). A first set of tools supports basic operations on graphs (comparison between two graphs, neighborhood of a set of input nodes, path finding and graph randomization). Another set of programs makes the connection between networks and clusters (graph-based clustering, cliques discovery and mapping of clusters onto a network). The toolbox also includes programs for detecting significant intersections between clusters/classes (e.g. clusters of co-expression versus functional classes of genes). NeAT are designed to cope with large datasets and provide a flexible toolbox for analyzing biological networks stored in various databases (protein interactions, regulation and metabolism) or obtained from high-throughput experiments (two-hybrid, mass-spectrometry and microarrays). The web interface interconnects the programs in predefined analysis flows, enabling to address a series of questions about networks of interest. Each tool can also be used separately by entering custom data for a specific analysis. NeAT can also be used as web services (SOAP/WSDL interface), in order to design programmatic workflows and integrate them with other available resources.

Unsteady transonic flows - Introduction, current trends, applications

NASA Technical Reports Server (NTRS)

Yates, E. C., Jr.

1985-01-01

The computational treatment of unsteady transonic flows is discussed, reviewing the historical development and current techniques. The fundamental physical principles are outlined; the governing equations are introduced; three-dimensional linearized and two-dimensional linear-perturbation theories in frequency domain are described in detail; and consideration is given to frequency-domain FEMs and time-domain finite-difference and integral-equation methods. Extensive graphs and diagrams are included.

Tensor Spectral Clustering for Partitioning Higher-order Network Structures.

PubMed

Benson, Austin R; Gleich, David F; Leskovec, Jure

2015-01-01

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forward loops, etc.) should be preserved by the network clustering. Higher-order network structures of interest are represented using a tensor, which we then partition by developing a multilinear spectral method. Our framework can be applied to discovering layered flows in networks as well as graph anomaly detection, which we illustrate on synthetic networks. In directed networks, a higher-order structure of particular interest is the directed 3-cycle, which captures feedback loops in networks. We demonstrate that our TSC algorithm produces large partitions that cut fewer directed 3-cycles than standard spectral clustering algorithms.

Tensor Spectral Clustering for Partitioning Higher-order Network Structures

PubMed Central

Benson, Austin R.; Gleich, David F.; Leskovec, Jure

2016-01-01

Spectral graph theory-based methods represent an important class of tools for studying the structure of networks. Spectral methods are based on a first-order Markov chain derived from a random walk on the graph and thus they cannot take advantage of important higher-order network substructures such as triangles, cycles, and feed-forward loops. Here we propose a Tensor Spectral Clustering (TSC) algorithm that allows for modeling higher-order network structures in a graph partitioning framework. Our TSC algorithm allows the user to specify which higher-order network structures (cycles, feed-forward loops, etc.) should be preserved by the network clustering. Higher-order network structures of interest are represented using a tensor, which we then partition by developing a multilinear spectral method. Our framework can be applied to discovering layered flows in networks as well as graph anomaly detection, which we illustrate on synthetic networks. In directed networks, a higher-order structure of particular interest is the directed 3-cycle, which captures feedback loops in networks. We demonstrate that our TSC algorithm produces large partitions that cut fewer directed 3-cycles than standard spectral clustering algorithms. PMID:27812399

Comparative Effectiveness of TI-84 Graphing Calculators on Algebra I and Geometry Outcomes: A Report of Randomized Experiments in the East Side Union High School District and San Diego Unified School District. Research Report

ERIC Educational Resources Information Center

Miller, Gloria I.; Jaciw, Andrew; Hoshiko, Brandon; Wei, Xin

2007-01-01

Texas Instruments has undertaken a research program with the goal of producing scientifically-based evidence of the effectiveness of graphing calculators and the "TI-Navigator"[TM] classroom networking system in the context of a professional development and curriculum framework. The program includes a two-year longitudinal study. The…

BFL: a node and edge betweenness based fast layout algorithm for large scale networks

PubMed Central

Hashimoto, Tatsunori B; Nagasaki, Masao; Kojima, Kaname; Miyano, Satoru

2009-01-01

Background Network visualization would serve as a useful first step for analysis. However, current graph layout algorithms for biological pathways are insensitive to biologically important information, e.g. subcellular localization, biological node and graph attributes, or/and not available for large scale networks, e.g. more than 10000 elements. Results To overcome these problems, we propose the use of a biologically important graph metric, betweenness, a measure of network flow. This metric is highly correlated with many biological phenomena such as lethality and clusters. We devise a new fast parallel algorithm calculating betweenness to minimize the preprocessing cost. Using this metric, we also invent a node and edge betweenness based fast layout algorithm (BFL). BFL places the high-betweenness nodes to optimal positions and allows the low-betweenness nodes to reach suboptimal positions. Furthermore, BFL reduces the runtime by combining a sequential insertion algorim with betweenness. For a graph with n nodes, this approach reduces the expected runtime of the algorithm to O(n2) when considering edge crossings, and to O(n log n) when considering only density and edge lengths. Conclusion Our BFL algorithm is compared against fast graph layout algorithms and approaches requiring intensive optimizations. For gene networks, we show that our algorithm is faster than all layout algorithms tested while providing readability on par with intensive optimization algorithms. We achieve a 1.4 second runtime for a graph with 4000 nodes and 12000 edges on a standard desktop computer. PMID:19146673

Time-dependence of graph theory metrics in functional connectivity analysis

PubMed Central

Chiang, Sharon; Cassese, Alberto; Guindani, Michele; Vannucci, Marina; Yeh, Hsiang J.; Haneef, Zulfi; Stern, John M.

2016-01-01

Brain graphs provide a useful way to computationally model the network structure of the connectome, and this has led to increasing interest in the use of graph theory to quantitate and investigate the topological characteristics of the healthy brain and brain disorders on the network level. The majority of graph theory investigations of functional connectivity have relied on the assumption of temporal stationarity. However, recent evidence increasingly suggests that functional connectivity fluctuates over the length of the scan. In this study, we investigate the stationarity of brain network topology using a Bayesian hidden Markov model (HMM) approach that estimates the dynamic structure of graph theoretical measures of whole-brain functional connectivity. In addition to extracting the stationary distribution and transition probabilities of commonly employed graph theory measures, we propose two estimators of temporal stationarity: the S-index and N-index. These indexes can be used to quantify different aspects of the temporal stationarity of graph theory measures. We apply the method and proposed estimators to resting-state functional MRI data from healthy controls and patients with temporal lobe epilepsy. Our analysis shows that several graph theory measures, including small-world index, global integration measures, and betweenness centrality, may exhibit greater stationarity over time and therefore be more robust. Additionally, we demonstrate that accounting for subject-level differences in the level of temporal stationarity of network topology may increase discriminatory power in discriminating between disease states. Our results confirm and extend findings from other studies regarding the dynamic nature of functional connectivity, and suggest that using statistical models which explicitly account for the dynamic nature of functional connectivity in graph theory analyses may improve the sensitivity of investigations and consistency across investigations. PMID:26518632

Time-dependence of graph theory metrics in functional connectivity analysis.

PubMed

Chiang, Sharon; Cassese, Alberto; Guindani, Michele; Vannucci, Marina; Yeh, Hsiang J; Haneef, Zulfi; Stern, John M

2016-01-15

Brain graphs provide a useful way to computationally model the network structure of the connectome, and this has led to increasing interest in the use of graph theory to quantitate and investigate the topological characteristics of the healthy brain and brain disorders on the network level. The majority of graph theory investigations of functional connectivity have relied on the assumption of temporal stationarity. However, recent evidence increasingly suggests that functional connectivity fluctuates over the length of the scan. In this study, we investigate the stationarity of brain network topology using a Bayesian hidden Markov model (HMM) approach that estimates the dynamic structure of graph theoretical measures of whole-brain functional connectivity. In addition to extracting the stationary distribution and transition probabilities of commonly employed graph theory measures, we propose two estimators of temporal stationarity: the S-index and N-index. These indexes can be used to quantify different aspects of the temporal stationarity of graph theory measures. We apply the method and proposed estimators to resting-state functional MRI data from healthy controls and patients with temporal lobe epilepsy. Our analysis shows that several graph theory measures, including small-world index, global integration measures, and betweenness centrality, may exhibit greater stationarity over time and therefore be more robust. Additionally, we demonstrate that accounting for subject-level differences in the level of temporal stationarity of network topology may increase discriminatory power in discriminating between disease states. Our results confirm and extend findings from other studies regarding the dynamic nature of functional connectivity, and suggest that using statistical models which explicitly account for the dynamic nature of functional connectivity in graph theory analyses may improve the sensitivity of investigations and consistency across investigations. Copyright © 2015 Elsevier Inc. All rights reserved.

Evidence as a Stage of Knowing in Composition.

ERIC Educational Resources Information Center

Emmel, Barbara A.

The study of composition is in need of a methodology to teach students about the creation of evidence and the epistemological role that it plays in all writing. For many students "evidence" is an absolute, an assortment of facts found in encyclopedias, graphs, tables, census studies, surveys, almanacs, and so on. For most instructors,…

DIVERSITY: A new method for evaluating sensitivity of groundwater to contamination

NASA Astrophysics Data System (ADS)

Ray, J. A.; O'Dell, P. W.

1993-12-01

This study outlines an improved method, DIVERSITY, for delineating and rating groundwater sensitivity. It is an acronym for DIspersion/VElocity-Rated SensitivITY, which is based on an assessment of three aquifer characteristics: recharge potential, flow velocity, and flow directions. The primary objective of this method is to produce sensitivity maps at the county or state scale that illustrate intrinsic potential for contamination of the uppermost aquifer. Such maps can be used for recognition of aquifer sensitivity and for protection of groundwater quality. We suggest that overriding factors that strongly affect one or more of the three basic aquifer characteristics may systematically elevate or lower the sensitivity rating. The basic method employs a three-step procedure: (1) Hydrogeologic settings are delineated on the basis of geology and groundwater recharge/discharge position within a terrane. (2) A sensitivity envelope or model for each setting is outlined on a three-component rating graph. (3) Sensitivity ratings derived from the envelope are extrapolated to hydrogeologic setting polygons utilizing overriding and key factors, when appropriate. The three-component sensitivity rating graph employs two logarithmic scales and a relative area scale on which measured and estimated values may be plotted. The flow velocity scale ranging from 0.01 to more than 10,000 m/d is the keystone of the rating graph. Whenever possible, actual time-of-travel values are plotted on the velocity scale to bracket the position of a sensitivity envelope. The DIVERSITY method was developed and tested for statewide use in Kentucky, but we believe it is also practical and applicable for use in almost any other area.

Streamflow of 2015—Water year national summary

USGS Publications Warehouse

Jian, Xiaodong; Wolock, David M.; Lins, Harry F.; Brady, Steve

2016-08-30

IntroductionThe maps and graphs in this summary describe national streamflow conditions for water year 2015 (October 1, 2014, to September 30, 2015) in the context of the 86-year period 1930–2015, unless otherwise noted. The illustrations are based on observed data from the U.S. Geological Survey’s (USGS) National Streamflow Information Program http://water.usgs.gov/nsip). The period 1930–2015 was used because prior to 1930, the number of streamgages was too small to provide representative data for computing statistics for most regions of the country.In the summary, reference is made to the term “runoff,” which is the depth to which a river basin, State, or other geographic area would be covered with water if all the streamflow within the area during a specified time period was uniformly distributed upon it. Runoff quantifies the magnitude of water flowing through the Nation's rivers and streams in measurement units that can be compared from one area to another.Each of the maps and graphs can be expanded to a larger view by clicking on the image. In all of the graphics, a rank of 1 indicates the highest flow of all years analyzed. Rankings of streamflow are grouped into much-below normal, below normal, normal, above normal, and much-above normal, based on percentiles of flow (greater than 90 percent, 76–90 percent, 25–75 percent, 10–24 percent, and less than 10 percent, respectively) (http://waterwatch.usgs.gov/?id=ww_current). Some data used to produce maps and graphs are provisional and subject to change.

Vascular perfusion of reproductive organs in pony mares and heifers during sedation with detomidine or xylazine.

PubMed

Araujo, Reno R; Ginther, O J

2009-01-01

To assess the vascular effects of detomidine and xylazine in pony mares and heifers, respectively, as determined in a major artery and by extent of vascular perfusion of reproductive organs. 10 pony mares and 10 Holstein heifers. Pony mares were assigned to receive physiologic saline (0.9% NaCl) solution (n = 5) or detomidine (3.0 mg/mare, IV; 5). Heifers were assigned to receive saline solution (5) or xylazine (14 mg/heifer, IM; 5). Color Doppler ultrasonographic examinations were performed immediately before and 10 minutes after administration of saline solution or sedative. In spectral Doppler mode, a spectral graph of blood flow velocities during a cardiac cycle was obtained at the internal iliac artery and at the ovarian pedicle. In color-flow mode, color signals of blood flow in vessels of the corpus luteum and endometrium were assessed. Systemic effects of sedation in the 2 species were evident as a decrease in heart rate; increase in duration of systole, diastole, or both; decrease in volume of blood flow; and decrease in velocity of blood flow within the internal iliac artery. However, an effect of sedatives on local vascular perfusion in the ovaries and endometrium was not detected. Sedation with detomidine in pony mares and xylazine in heifers did not affect vascular perfusion in reproductive organs. These sedatives can be used in experimental and clinical color Doppler evaluations of vascular perfusion of the corpus luteum and endometrium.

Disconnection of network hubs and cognitive impairment after traumatic brain injury.

PubMed

Fagerholm, Erik D; Hellyer, Peter J; Scott, Gregory; Leech, Robert; Sharp, David J

2015-06-01

Traumatic brain injury affects brain connectivity by producing traumatic axonal injury. This disrupts the function of large-scale networks that support cognition. The best way to describe this relationship is unclear, but one elegant approach is to view networks as graphs. Brain regions become nodes in the graph, and white matter tracts the connections. The overall effect of an injury can then be estimated by calculating graph metrics of network structure and function. Here we test which graph metrics best predict the presence of traumatic axonal injury, as well as which are most highly associated with cognitive impairment. A comprehensive range of graph metrics was calculated from structural connectivity measures for 52 patients with traumatic brain injury, 21 of whom had microbleed evidence of traumatic axonal injury, and 25 age-matched controls. White matter connections between 165 grey matter brain regions were defined using tractography, and structural connectivity matrices calculated from skeletonized diffusion tensor imaging data. This technique estimates injury at the centre of tract, but is insensitive to damage at tract edges. Graph metrics were calculated from the resulting connectivity matrices and machine-learning techniques used to select the metrics that best predicted the presence of traumatic brain injury. In addition, we used regularization and variable selection via the elastic net to predict patient behaviour on tests of information processing speed, executive function and associative memory. Support vector machines trained with graph metrics of white matter connectivity matrices from the microbleed group were able to identify patients with a history of traumatic brain injury with 93.4% accuracy, a result robust to different ways of sampling the data. Graph metrics were significantly associated with cognitive performance: information processing speed (R(2) = 0.64), executive function (R(2) = 0.56) and associative memory (R(2) = 0.25). These results were then replicated in a separate group of patients without microbleeds. The most influential graph metrics were betweenness centrality and eigenvector centrality, which provide measures of the extent to which a given brain region connects other regions in the network. Reductions in betweenness centrality and eigenvector centrality were particularly evident within hub regions including the cingulate cortex and caudate. Our results demonstrate that betweenness centrality and eigenvector centrality are reduced within network hubs, due to the impact of traumatic axonal injury on network connections. The dominance of betweenness centrality and eigenvector centrality suggests that cognitive impairment after traumatic brain injury results from the disconnection of network hubs by traumatic axonal injury. © The Author (2015). Published by Oxford University Press on behalf of the Guarantors of Brain.

Evaluation of a novel brachial cuff-based oscillometric method for estimating central systolic pressure in hemodialysis patients.

PubMed

Sarafidis, Pantelis A; Georgianos, Panagiotis I; Karpetas, Antonios; Bikos, Athanasios; Korelidou, Linda; Tersi, Maria; Divanis, Dimitrios; Tzanis, Georgios; Mavromatidis, Konstantinos; Liakopoulos, Vassilios; Zebekakis, Pantelis E; Lasaridis, Anastasios; Protogerou, Athanase D

2014-01-01

Elevated wave reflections and arterial stiffness, as well as ambulatory blood pressure (BP) are independent predictors of cardiovascular risk in end-stage-renal-disease. This study is the first to evaluate in hemodialysis patients the validity of a new ambulatory oscillometric device (Mobil-O-Graph, IEM, Germany), which estimates aortic BP, augmentation index (AIx) and pulse wave velocity (PWV). Aortic SBP (aSBP), heart rate-adjusted AIx (AIx(75)) and PWV measured with Mobil-O-Graph were compared with the values from the most widely used tonometric device (Sphygmocor, ArtCor, Australia) in 73 hemodialysis patients. Measurements were made in a randomized order after 10 min of rest in the supine position at least 30 min before a dialysis session. Brachial BP (mercury sphygmomanometer) was used for the calibration of Sphygmocor's waveform. Sphygmocor-derived aSBP and AIx(75) did not differ from the relevant Mobil-O-Graph measurements (aSBP: 136.3 ± 19.6 vs. 133.5 ± 19.3 mm Hg, p = 0.068; AIx(75): 28.4 ± 9.3 vs. 30.0 ± 11.8%, p = 0.229). The small difference in aSBP is perhaps explained by a relevant difference in brachial SBP used for calibration (146.9 ± 20.4 vs. 145.2 ± 19.9 mm Hg, p = 0.341). Sphygmocor PWV was higher than Mobil-O-Graph PWV (10.3 ± 3.4 vs. 9.5 ± 2.1 m/s, p < 0.01). All 3 parameters estimated by Mobil-O-Graph showed highly significant (p < 0.001) correlations with the relevant measurements of Sphygmocor (aSBP, r = 0.770; AIx(75), r = 0.400; PWV, r = 0.739). The Bland-Altman Plots for aSBP and AIx(75) showed acceptable agreement between the two devices and no evidence of systemic bias for PWV. As in other populations, acceptable agreement between Mobil-O-Graph and Sphygmocor was evident for aSBP and AIx(75) in hemodialysis patients; PWV was slightly underestimated by Mobil-O-Graph. © 2014 S. Karger AG, Basel.

Experimental study on the signs of particulate structures formation in annular geometry of rapid granular shear flows

NASA Astrophysics Data System (ADS)

Ritvanen, J.; Jalali, P.

2009-06-01

Rapid granular shear flow is a classical example in granular materials which exhibits both fluid-like and solid-like behaviors. Another interesting feature of rapid granular shear flows is the formation of ordered structures upon shearing. Certain amount of granular material, with uniform size distribution, is required to be loaded in the container in order to shear it under stable conditions. This work concerns the experimental study of rapid granular shear flows in annular Couette geometry. The flow is induced by continuous rotation of the plate over the top of the granular bed in an annulus. The compressive pressure, driving torque, instantaneous bed height from three symmetric locations and rotational speed of the shearing plate are measured. The annulus has a capacity of up to 15 kg of spherical steel balls of 3 mm in diameter. Rapid shear flow experiments are performed in one compressive force and rotation rate. The sensitivity of fluctuations is then investigated by different means through monodisperse packing. In this work, we present the results of the experiments showing how the flow properties depend on the amount of loaded granular material which is varied by small amounts between different experiments. The flow can exist in stable (fixed behavior) and unstable (time-dependent behavior) regimes as a function of the loaded material. We present the characteristics of flow to detect the formation of any additional structured layer in the annulus. As a result, an evolution graph for the bed height has been obtained as material is gradually added. This graph shows how the bed height grows when material increases. Using these results, the structure inside the medium can be estimated at extreme stable and unstable conditions.

Topics on data transmission problem in software definition network

NASA Astrophysics Data System (ADS)

Gao, Wei; Liang, Li; Xu, Tianwei; Gan, Jianhou

2017-08-01

In normal computer networks, the data transmission between two sites go through the shortest path between two corresponding vertices. However, in the setting of software definition network (SDN), it should monitor the network traffic flow in each site and channel timely, and the data transmission path between two sites in SDN should consider the congestion in current networks. Hence, the difference of available data transmission theory between normal computer network and software definition network is that we should consider the prohibit graph structures in SDN, and these forbidden subgraphs represent the sites and channels in which data can't be passed by the serious congestion. Inspired by theoretical analysis of an available data transmission in SDN, we consider some computational problems from the perspective of the graph theory. Several results determined in the paper imply the sufficient conditions of data transmission in SDN in the various graph settings.

All-Optical Implementation of the Ant Colony Optimization Algorithm

PubMed Central

Hu, Wenchao; Wu, Kan; Shum, Perry Ping; Zheludev, Nikolay I.; Soci, Cesare

2016-01-01

We report all-optical implementation of the optimization algorithm for the famous “ant colony” problem. Ant colonies progressively optimize pathway to food discovered by one of the ants through identifying the discovered route with volatile chemicals (pheromones) secreted on the way back from the food deposit. Mathematically this is an important example of graph optimization problem with dynamically changing parameters. Using an optical network with nonlinear waveguides to represent the graph and a feedback loop, we experimentally show that photons traveling through the network behave like ants that dynamically modify the environment to find the shortest pathway to any chosen point in the graph. This proof-of-principle demonstration illustrates how transient nonlinearity in the optical system can be exploited to tackle complex optimization problems directly, on the hardware level, which may be used for self-routing of optical signals in transparent communication networks and energy flow in photonic systems. PMID:27222098

Hall effects on MHD flow of heat generating/absorbing fluid through porous medium in a rotating parallel plate channel

NASA Astrophysics Data System (ADS)

Swarnalathamma, B. V.; Krishna, M. Veera

2017-07-01

We studied heat transfer on MHD convective flow of viscous electrically conducting heat generating/absorbing fluid through porous medium in a rotating channel under uniform transverse magnetic field normal to the channel and taking Hall current. The flow is governed by the Brinkman's model. The diagnostic solutions for the velocity and temperature are obtained by perturbation technique and computationally discussed with respect to flow parameters through the graphs. The skin friction and Nusselt number are also evaluated and computationally discussed with reference to pertinent parameters in detail.

Investigation of Separation of the Turbulent Boundary Layer

NASA Technical Reports Server (NTRS)

Schubauer, G B; Klebanoff, P S

1951-01-01

An investigation was conducted on a turbulent boundary layer near a smooth surface with pressure gradients sufficient to cause flow separation. The reynolds number was high, but the speeds were entirely within the incompressible flow range. The investigation consisted of measurements of mean flow, three components of turbulence intensity, turbulent shearing stress, and correlations between two fluctuation components at a point and between the same component of different points. The results are given in the form of tables and graphs. The discussion deals first with separation and then with the more fundamental question of basic concepts of turbulent flow.

Network analysis for a network disorder: The emerging role of graph theory in the study of epilepsy.

PubMed

Bernhardt, Boris C; Bonilha, Leonardo; Gross, Donald W

2015-09-01

Recent years have witnessed a paradigm shift in the study and conceptualization of epilepsy, which is increasingly understood as a network-level disorder. An emblematic case is temporal lobe epilepsy (TLE), the most common drug-resistant epilepsy that is electroclinically defined as a focal epilepsy and pathologically associated with hippocampal sclerosis. In this review, we will summarize histopathological, electrophysiological, and neuroimaging evidence supporting the concept that the substrate of TLE is not limited to the hippocampus alone, but rather is broadly distributed across multiple brain regions and interconnecting white matter pathways. We will introduce basic concepts of graph theory, a formalism to quantify topological properties of complex systems that has recently been widely applied to study networks derived from brain imaging and electrophysiology. We will discuss converging graph theoretical evidence indicating that networks in TLE show marked shifts in their overall topology, providing insight into the neurobiology of TLE as a network-level disorder. Our review will conclude by discussing methodological challenges and future clinical applications of this powerful analytical approach. Copyright © 2015 Elsevier Inc. All rights reserved.

Kernel approach to molecular similarity based on iterative graph similarity.

PubMed

Rupp, Matthias; Proschak, Ewgenij; Schneider, Gisbert

2007-01-01

Similarity measures for molecules are of basic importance in chemical, biological, and pharmaceutical applications. We introduce a molecular similarity measure defined directly on the annotated molecular graph, based on iterative graph similarity and optimal assignments. We give an iterative algorithm for the computation of the proposed molecular similarity measure, prove its convergence and the uniqueness of the solution, and provide an upper bound on the required number of iterations necessary to achieve a desired precision. Empirical evidence for the positive semidefiniteness of certain parametrizations of our function is presented. We evaluated our molecular similarity measure by using it as a kernel in support vector machine classification and regression applied to several pharmaceutical and toxicological data sets, with encouraging results.

Geologic, hydrologic, and geochemical identification of flow paths in the Edwards Aquifer, northeastern Bexar and southern Comal Counties, Texas

USGS Publications Warehouse

Otero, Cassi L.

2007-01-01

The U.S. Geological Survey, in cooperation with the San Antonio Water System, conducted a 4-year study during 2002?06 to identify major flow paths in the Edwards aquifer in northeastern Bexar and southern Comal Counties (study area). In the study area, faulting directs ground water into three hypothesized flow paths that move water, generally, from the southwest to the northeast. These flow paths are identified as the southern Comal flow path, the central Comal flow path, and the northern Comal flow path. Statistical correlations between water levels for six observation wells and between the water levels and discharges from Comal Springs and Hueco Springs yielded evidence for the hypothesized flow paths. Strong linear correlations were evident between the datasets from wells and springs within the same flow path and the datasets from wells in areas where flow between flow paths was suspected. Geochemical data (major ions, stable isotopes, sulfur hexafluoride, and tritium and helium) were used in graphical analyses to obtain evidence of the flow path from which wells or springs derive water. Major-ion geochemistry in samples from selected wells and springs showed relatively little variation. Samples from the southern Comal flow path were characterized by relatively high sulfate and chloride concentrations, possibly indicating that the water in the flow path was mixing with small amounts of saline water from the freshwater/saline-water transition zone. Samples from the central Comal flow path yielded the most varied major-ion geochemistry of the three hypothesized flow paths. Central Comal flow path samples were characterized, in general, by high calcium concentrations and low magnesium concentrations. Samples from the northern Comal flow path were characterized by relatively low sulfate and chloride concentrations and high magnesium concentrations. The high magnesium concentrations characteristic of northern Comal flow path samples from the recharge zone in Comal County might indicate that water from the Trinity aquifer is entering the Edwards aquifer in the subsurface. A graph of the relation between the stable isotopes deuterium and delta-18 oxygen showed that, except for samples collected following an unusually intense rain storm, there was not much variation in stable isotope values among the flow paths. In the study area deuterium ranged from -36.00 to -20.89 per mil and delta-18 oxygen ranged from -6.03 to -3.70 per mil. Excluding samples collected following the intense rain storm, the deuterium range in the study area was -33.00 to -20.89 per mil and the delta-18 oxygen range was -4.60 to -3.70 per mil. Two ground-water age-dating techniques, sulfur hexafluoride concentrations and tritium/helium-3 isotope ratios, were used to compute apparent ages (time since recharge occurred) of water samples collected in the study area. In general, the apparent ages computed by the two methods do not seem to indicate direction of flow. Apparent ages computed for water samples in northeastern Bexar and southern Comal Counties do not vary greatly except for some very young water in the recharge zone in central Comal County.

Communication-Efficient Arbitration Models for Low-Resolution Data Flow Computing

DTIC Science & Technology

1988-12-01

Given graph G = (V, E), weights w (v) for each v e V and L (e) for each e c E, and positive integers B and J, find a partition of V into disjoint...MIT/LCS/TR-218, Cambridge, Mass. Agerwala, Tilak, February 1982, "Data Flow Systems", Computer, pp. 10-13. Babb, Robert G ., July 1984, "Parallel...Processing with Large-Grain Data Flow Techniques," IEEE Computer 17, 7, pp. 55-61. Babb, Robert G ., II, Lise Storc, and William C. Ragsdale, 1986, "A Large

PuReD-MCL: a graph-based PubMed document clustering methodology.

PubMed

Theodosiou, T; Darzentas, N; Angelis, L; Ouzounis, C A

2008-09-01

Biomedical literature is the principal repository of biomedical knowledge, with PubMed being the most complete database collecting, organizing and analyzing such textual knowledge. There are numerous efforts that attempt to exploit this information by using text mining and machine learning techniques. We developed a novel approach, called PuReD-MCL (Pubmed Related Documents-MCL), which is based on the graph clustering algorithm MCL and relevant resources from PubMed. PuReD-MCL avoids using natural language processing (NLP) techniques directly; instead, it takes advantage of existing resources, available from PubMed. PuReD-MCL then clusters documents efficiently using the MCL graph clustering algorithm, which is based on graph flow simulation. This process allows users to analyse the results by highlighting important clues, and finally to visualize the clusters and all relevant information using an interactive graph layout algorithm, for instance BioLayout Express 3D. The methodology was applied to two different datasets, previously used for the validation of the document clustering tool TextQuest. The first dataset involves the organisms Escherichia coli and yeast, whereas the second is related to Drosophila development. PuReD-MCL successfully reproduces the annotated results obtained from TextQuest, while at the same time provides additional insights into the clusters and the corresponding documents. Source code in perl and R are available from http://tartara.csd.auth.gr/~theodos/

Machine learning in a graph framework for subcortical segmentation

NASA Astrophysics Data System (ADS)

Guo, Zhihui; Kashyap, Satyananda; Sonka, Milan; Oguz, Ipek

2017-02-01

Automated and reliable segmentation of subcortical structures from human brain magnetic resonance images is of great importance for volumetric and shape analyses in quantitative neuroimaging studies. However, poor boundary contrast and variable shape of these structures make the automated segmentation a tough task. We propose a 3D graph-based machine learning method, called LOGISMOS-RF, to segment the caudate and the putamen from brain MRI scans in a robust and accurate way. An atlas-based tissue classification and bias-field correction method is applied to the images to generate an initial segmentation for each structure. Then a 3D graph framework is utilized to construct a geometric graph for each initial segmentation. A locally trained random forest classifier is used to assign a cost to each graph node. The max-flow algorithm is applied to solve the segmentation problem. Evaluation was performed on a dataset of T1-weighted MRI's of 62 subjects, with 42 images used for training and 20 images for testing. For comparison, FreeSurfer, FSL and BRAINSCut approaches were also evaluated using the same dataset. Dice overlap coefficients and surface-to-surfaces distances between the automated segmentation and expert manual segmentations indicate the results of our method are statistically significantly more accurate than the three other methods, for both the caudate (Dice: 0.89 +/- 0.03) and the putamen (0.89 +/- 0.03).

Automatic Molecular Design using Evolutionary Techniques

NASA Technical Reports Server (NTRS)

Globus, Al; Lawton, John; Wipke, Todd; Saini, Subhash (Technical Monitor)

1998-01-01

Molecular nanotechnology is the precise, three-dimensional control of materials and devices at the atomic scale. An important part of nanotechnology is the design of molecules for specific purposes. This paper describes early results using genetic software techniques to automatically design molecules under the control of a fitness function. The fitness function must be capable of determining which of two arbitrary molecules is better for a specific task. The software begins by generating a population of random molecules. The population is then evolved towards greater fitness by randomly combining parts of the better individuals to create new molecules. These new molecules then replace some of the worst molecules in the population. The unique aspect of our approach is that we apply genetic crossover to molecules represented by graphs, i.e., sets of atoms and the bonds that connect them. We present evidence suggesting that crossover alone, operating on graphs, can evolve any possible molecule given an appropriate fitness function and a population containing both rings and chains. Prior work evolved strings or trees that were subsequently processed to generate molecular graphs. In principle, genetic graph software should be able to evolve other graph representable systems such as circuits, transportation networks, metabolic pathways, computer networks, etc.

Graph theory findings in the pathophysiology of temporal lobe epilepsy

PubMed Central

Chiang, Sharon; Haneef, Zulfi

2014-01-01

Temporal lobe epilepsy (TLE) is the most common form of adult epilepsy. Accumulating evidence has shown that TLE is a disorder of abnormal epileptogenic networks, rather than focal sources. Graph theory allows for a network-based representation of TLE brain networks, and has potential to illuminate characteristics of brain topology conducive to TLE pathophysiology, including seizure initiation and spread. We review basic concepts which we believe will prove helpful in interpreting results rapidly emerging from graph theory research in TLE. In addition, we summarize the current state of graph theory findings in TLE as they pertain its pathophysiology. Several common findings have emerged from the many modalities which have been used to study TLE using graph theory, including structural MRI, diffusion tensor imaging, surface EEG, intracranial EEG, magnetoencephalography, functional MRI, cell cultures, simulated models, and mouse models, involving increased regularity of the interictal network configuration, altered local segregation and global integration of the TLE network, and network reorganization of temporal lobe and limbic structures. As different modalities provide different views of the same phenomenon, future studies integrating data from multiple modalities are needed to clarify findings and contribute to the formation of a coherent theory on the pathophysiology of TLE. PMID:24831083

Quantitative Literacy: Working with Log Graphs

NASA Astrophysics Data System (ADS)

Shawl, S.

2013-04-01

The need for working with and understanding different types of graphs is a common occurrence in everyday life. Examples include anything having to do investments, being an educated juror in a case that involves evidence presented graphically, and understanding many aspect of our current political discourse. Within a science class graphs play a crucial role in presenting and interpreting data. In astronomy, where the range of graphed values is many orders of magnitude, log-axes must be used and understood. Experience shows that students do not understand how to read and interpret log-axes or how they differ from linear. Alters (1996), in a study of college students in an algebra-based physics class, found little understanding of log plotting. The purpose of this poster is to show the method and progression I have developed for use in my “ASTRO 101” class, with the goal being to help students better understand the H-R diagram, mass-luminosity relationship, and digital spectra.

Hybrid coexpression link similarity graph clustering for mining biological modules from multiple gene expression datasets

PubMed Central

2014-01-01

Background Advances in genomic technologies have enabled the accumulation of vast amount of genomic data, including gene expression data for multiple species under various biological and environmental conditions. Integration of these gene expression datasets is a promising strategy to alleviate the challenges of protein functional annotation and biological module discovery based on a single gene expression data, which suffers from spurious coexpression. Results We propose a joint mining algorithm that constructs a weighted hybrid similarity graph whose nodes are the coexpression links. The weight of an edge between two coexpression links in this hybrid graph is a linear combination of the topological similarities and co-appearance similarities of the corresponding two coexpression links. Clustering the weighted hybrid similarity graph yields recurrent coexpression link clusters (modules). Experimental results on Human gene expression datasets show that the reported modules are functionally homogeneous as evident by their enrichment with biological process GO terms and KEGG pathways. PMID:25221624

Mashups over the Deep Web

NASA Astrophysics Data System (ADS)

Hornung, Thomas; Simon, Kai; Lausen, Georg

Combining information from different Web sources often results in a tedious and repetitive process, e.g. even simple information requests might require to iterate over a result list of one Web query and use each single result as input for a subsequent query. One approach for this chained queries are data-centric mashups, which allow to visually model the data flow as a graph, where the nodes represent the data source and the edges the data flow.

Presentation of the acoustic and aerodynamic results of the Aladin 2 concept qualification testing

NASA Technical Reports Server (NTRS)

Collard, M.; Doyotte, C.; Sagner, M.

1985-01-01

Wind tunnel tests were conducted of a scale model of the Aladin 2 aircraft. The propulsion system configuration is described and the air flow caused by jet ejection is analyzed. Three dimensional flow studies in the vicinity of the engine installation were made. Diagrams of the leading and trailing edge flaps are provided. Graphs are developed to show the aerodynamic performance under conditions of various airspeed and flap deflection.

Development of antibiotic regimens using graph based evolutionary algorithms.

PubMed

Corns, Steven M; Ashlock, Daniel A; Bryden, Kenneth M

2013-12-01

This paper examines the use of evolutionary algorithms in the development of antibiotic regimens given to production animals. A model is constructed that combines the lifespan of the animal and the bacteria living in the animal's gastro-intestinal tract from the early finishing stage until the animal reaches market weight. This model is used as the fitness evaluation for a set of graph based evolutionary algorithms to assess the impact of diversity control on the evolving antibiotic regimens. The graph based evolutionary algorithms have two objectives: to find an antibiotic treatment regimen that maintains the weight gain and health benefits of antibiotic use and to reduce the risk of spreading antibiotic resistant bacteria. This study examines different regimens of tylosin phosphate use on bacteria populations divided into Gram positive and Gram negative types, with a focus on Campylobacter spp. Treatment regimens were found that provided decreased antibiotic resistance relative to conventional methods while providing nearly the same benefits as conventional antibiotic regimes. By using a graph to control the information flow in the evolutionary algorithm, a variety of solutions along the Pareto front can be found automatically for this and other multi-objective problems. Copyright © 2013 Elsevier Ireland Ltd. All rights reserved.

Graph cuts for curvature based image denoising.

PubMed

Bae, Egil; Shi, Juan; Tai, Xue-Cheng

2011-05-01

Minimization of total variation (TV) is a well-known method for image denoising. Recently, the relationship between TV minimization problems and binary MRF models has been much explored. This has resulted in some very efficient combinatorial optimization algorithms for the TV minimization problem in the discrete setting via graph cuts. To overcome limitations, such as staircasing effects, of the relatively simple TV model, variational models based upon higher order derivatives have been proposed. The Euler's elastica model is one such higher order model of central importance, which minimizes the curvature of all level lines in the image. Traditional numerical methods for minimizing the energy in such higher order models are complicated and computationally complex. In this paper, we will present an efficient minimization algorithm based upon graph cuts for minimizing the energy in the Euler's elastica model, by simplifying the problem to that of solving a sequence of easy graph representable problems. This sequence has connections to the gradient flow of the energy function, and converges to a minimum point. The numerical experiments show that our new approach is more effective in maintaining smooth visual results while preserving sharp features better than TV models.

WaterWatch - Maps, graphs, and tables of current, recent, and past streamflow conditions

USGS Publications Warehouse

Jian, Xiaodong; Wolock, David; Lins, Harry F.

2008-01-01

WaterWatch (http://water.usgs.gov/waterwatch/) is a U.S. Geological Survey (USGS) World Wide Web site that dis­plays maps, graphs, and tables describing real-time, recent, and past streamflow conditions for the United States. The real-time information generally is updated on an hourly basis. WaterWatch provides streamgage-based maps that show the location of more than 3,000 long-term (30 years or more) USGS streamgages; use colors to represent streamflow conditions compared to historical streamflow; feature a point-and-click interface allowing users to retrieve graphs of stream stage (water elevation) and flow; and highlight locations where extreme hydrologic events, such as floods and droughts, are occurring.The streamgage-based maps show streamflow conditions for real-time, average daily, and 7-day average streamflow. The real-time streamflow maps highlight flood and high flow conditions. The 7-day average streamflow maps highlight below-normal and drought conditions.WaterWatch also provides hydrologic unit code (HUC) maps. HUC-based maps are derived from the streamgage-based maps and illustrate streamflow conditions in hydrologic regions. These maps show average streamflow conditions for 1-, 7-, 14-, and 28-day periods, and for monthly average streamflow; highlight regions of low flow or hydrologic drought; and provide historical runoff and streamflow conditions beginning in 1901.WaterWatch summarizes streamflow conditions in a region (state or hydrologic unit) in terms of the long-term typical condition at streamgages in the region. Summary tables are provided along with time-series plots that depict variations through time. WaterWatch also includes tables of current streamflow information and locations of flooding.

Power laws and fragility in flow networks.

PubMed

Shore, Jesse; Chu, Catherine J; Bianchi, Matt T

2013-01-01

What makes economic and ecological networks so unlike other highly skewed networks in their tendency toward turbulence and collapse? Here, we explore the consequences of a defining feature of these networks: their nodes are tied together by flow. We show that flow networks tend to the power law degree distribution (PLDD) due to a self-reinforcing process involving position within the global network structure, and thus present the first random graph model for PLDDs that does not depend on a rich-get-richer function of nodal degree. We also show that in contrast to non-flow networks, PLDD flow networks are dramatically more vulnerable to catastrophic failure than non-PLDD flow networks, a finding with potential explanatory power in our age of resource- and financial-interdependence and turbulence.

Vulnerability detection using data-flow graphs and SMT solvers

DTIC Science & Technology

2016-10-31

concerns. The framework is modular and pipelined to allow scalable analysis on distributed systems. Our vulnerability detection framework employs machine...Design We designed the framework to be modular to enable flexible reuse and extendibility. In its current form, our framework performs the following

Fluid structure interaction model for biological systems in the presence of magnetic field

NASA Astrophysics Data System (ADS)

Aziz, Asim; Shoaib, Muhammad

2016-06-01

In the present paper a one-dimensional mathematical model of a cerebral aneurysm is considered. The model combines the interaction between the arterial wall structure, blood pressure and the cerebral spinal fluid (CSF) that is around the aneurysm. CSF is considered electrically conducting in the presence of a uniform magnetic field. Therefore, it may be possible to control pressure and its flow behavior by using an appropriate magnetic field. Hence, such studies have potential for the treatment of Cerebral aneurysms, diseases of heart and blood vessels. The modeled mathematical equations are solved algebraically and the displacement of the arterial wall is plotted to visualize the wall movement. It is evident from the graphs the inclusion of magnetic field reduce the movement of the arterial wall and in turn prevent the rupture of the cerebral aneurysm. The solution is also investigated using computational tools for various other parameters involve in the model.

Optimization of the graph model of the water conduit network, based on the approach of search space reducing

NASA Astrophysics Data System (ADS)

Korovin, Iakov S.; Tkachenko, Maxim G.

2018-03-01

In this paper we present a heuristic approach, improving the efficiency of methods, used for creation of efficient architecture of water distribution networks. The essence of the approach is a procedure of search space reduction the by limiting the range of available pipe diameters that can be used for each edge of the network graph. In order to proceed the reduction, two opposite boundary scenarios for the distribution of flows are analysed, after which the resulting range is further narrowed by applying a flow rate limitation for each edge of the network. The first boundary scenario provides the most uniform distribution of the flow in the network, the opposite scenario created the net with the highest possible flow level. The parameters of both distributions are calculated by optimizing systems of quadratic functions in a confined space, which can be effectively performed with small time costs. This approach was used to modify the genetic algorithm (GA). The proposed GA provides a variable number of variants of each gene, according to the number of diameters in list, taking into account flow restrictions. The proposed approach was implemented to the evaluation of a well-known test network - the Hanoi water distribution network [1], the results of research were compared with a classical GA with an unlimited search space. On the test data, the proposed trip significantly reduced the search space and provided faster and more obvious convergence in comparison with the classical version of GA.

Network-based study of Lagrangian transport and mixing

NASA Astrophysics Data System (ADS)

Padberg-Gehle, Kathrin; Schneide, Christiane

2017-10-01

Transport and mixing processes in fluid flows are crucially influenced by coherent structures and the characterization of these Lagrangian objects is a topic of intense current research. While established mathematical approaches such as variational methods or transfer-operator-based schemes require full knowledge of the flow field or at least high-resolution trajectory data, this information may not be available in applications. Recently, different computational methods have been proposed to identify coherent behavior in flows directly from Lagrangian trajectory data, that is, numerical or measured time series of particle positions in a fluid flow. In this context, spatio-temporal clustering algorithms have been proven to be very effective for the extraction of coherent sets from sparse and possibly incomplete trajectory data. Inspired by these recent approaches, we consider an unweighted, undirected network, where Lagrangian particle trajectories serve as network nodes. A link is established between two nodes if the respective trajectories come close to each other at least once in the course of time. Classical graph concepts are then employed to analyze the resulting network. In particular, local network measures such as the node degree, the average degree of neighboring nodes, and the clustering coefficient serve as indicators of highly mixing regions, whereas spectral graph partitioning schemes allow us to extract coherent sets. The proposed methodology is very fast to run and we demonstrate its applicability in two geophysical flows - the Bickley jet as well as the Antarctic stratospheric polar vortex.

Functional neural networks of honesty and dishonesty in children: Evidence from graph theory analysis.

PubMed

Ding, Xiao Pan; Wu, Si Jia; Liu, Jiangang; Fu, Genyue; Lee, Kang

2017-09-21

The present study examined how different brain regions interact with each other during spontaneous honest vs. dishonest communication. More specifically, we took a complex network approach based on the graph-theory to analyze neural response data when children are spontaneously engaged in honest or dishonest acts. Fifty-nine right-handed children between 7 and 12 years of age participated in the study. They lied or told the truth out of their own volition. We found that lying decreased both the global and local efficiencies of children's functional neural network. This finding, for the first time, suggests that lying disrupts the efficiency of children's cortical network functioning. Further, it suggests that the graph theory based network analysis is a viable approach to study the neural development of deception.

A method for the automated construction of the joint system of equations to solve the problem of the flow distribution in hydraulic networks

NASA Astrophysics Data System (ADS)

Novikov, A. E.

1993-10-01

There are several methods of solving the problem of the flow distribution in hydraulic networks. But all these methods have no mathematical tools for forming joint systems of equations to solve this problem. This paper suggests a method of constructing joint systems of equations to calculate hydraulic circuits of the arbitrary form. The graph concept, according to Kirchhoff, has been introduced.

Thermal Simulation of Switching Pulses in an Insulated Gate Bipolar Transistor (IGBT) Power Module

DTIC Science & Technology

2015-02-01

executed with SolidWorks Flow Simulation , a computational fluid-dynamics code. The graph in Fig. 2 shows the timing and amplitudes of power pulses...defined a convective flow of air perpendicular to the bottom surface of the mounting plate, with a velocity of 10 ft/s. The thermal simulations were...Thermal Simulation of Switching Pulses in an Insulated Gate Bipolar Transistor (IGBT) Power Module by Gregory K Ovrebo ARL-TR-7210

A one-dimensional model of flow in a junction of thin channels, including arterial trees

NASA Astrophysics Data System (ADS)

Kozlov, V. A.; Nazarov, S. A.

2017-08-01

We study a Stokes flow in a junction of thin channels (of diameter O(h)) for fixed flows of the fluid at the inlet cross-sections and fixed peripheral pressure at the outlet cross-sections. On the basis of the idea of the pressure drop matrix, apart from Neumann conditions (fixed flow) and Dirichlet conditions (fixed pressure) at the outer vertices, the ordinary one-dimensional Reynolds equations on the edges of the graph are equipped with transmission conditions containing a small parameter h at the inner vertices, which are transformed into the classical Kirchhoff conditions as h\\to+0. We establish that the pre-limit transmission conditions ensure an exponentially small error O(e-ρ/h), ρ>0, in the calculation of the three-dimensional solution, but the Kirchhoff conditions only give polynomially small error. For the arterial tree, under the assumption that the walls of the blood vessels are rigid, for every bifurcation node a ( 2×2)-pressure drop matrix appears, and its influence on the transmission conditions is taken into account by means of small variations of the lengths of the graph and by introducing effective lengths of the one-dimensional description of blood vessels whilst keeping the Kirchhoff conditions and exponentially small approximation errors. We discuss concrete forms of arterial bifurcation and available generalizations of the results, in particular, the Navier-Stokes system of equations. Bibliography: 59 titles.

Spatial analysis of bus transport networks using network theory

NASA Astrophysics Data System (ADS)

Shanmukhappa, Tanuja; Ho, Ivan Wang-Hei; Tse, Chi Kong

2018-07-01

In this paper, we analyze the bus transport network (BTN) structure considering the spatial embedding of the network for three cities, namely, Hong Kong (HK), London (LD), and Bengaluru (BL). We propose a novel approach called supernode graph structuring for modeling the bus transport network. A static demand estimation procedure is proposed to assign the node weights by considering the points of interests (POIs) and the population distribution in the city over various localized zones. In addition, the end-to-end delay is proposed as a parameter to measure the topological efficiency of the bus networks instead of the shortest distance measure used in previous works. With the aid of supernode graph representation, important network parameters are analyzed for the directed, weighted and geo-referenced bus transport networks. It is observed that the supernode concept has significant advantage in analyzing the inherent topological behavior. For instance, the scale-free and small-world behavior becomes evident with supernode representation as compared to conventional or regular graph representation for the Hong Kong network. Significant improvement in clustering, reduction in path length, and increase in centrality values are observed in all the three networks with supernode representation. The correlation between topologically central nodes and the geographically central nodes reveals the interesting fact that the proposed static demand estimation method for assigning node weights aids in better identifying the geographically significant nodes in the network. The impact of these geographically significant nodes on the local traffic behavior is demonstrated by simulation using the SUMO (Simulation of Urban Mobility) tool which is also supported by real-world empirical data, and our results indicate that the traffic speed around a particular bus stop can reach a jammed state from a free flow state due to the presence of these geographically important nodes. A comparison of the simulation and the empirical data provides useful information on how bus operators can better plan their routes and deploy stops considering the geographically significant nodes.

Historical and projected power requirements

NASA Technical Reports Server (NTRS)

Wolfe, M. G.

1978-01-01

Policy planning for projected space power requirements is discussed. Topics of discussion cover: (1) historical space power trends (prime power requirements and power system costs); and (2) two approaches to future space power requirements (mission/traffic model approach and advanced system scenario approach). Graphs, tables, and flow charts are presented.

Translating expert system rules into Ada code with validation and verification

NASA Technical Reports Server (NTRS)

Becker, Lee; Duckworth, R. James; Green, Peter; Michalson, Bill; Gosselin, Dave; Nainani, Krishan; Pease, Adam

1991-01-01

The purpose of this ongoing research and development program is to develop software tools which enable the rapid development, upgrading, and maintenance of embedded real-time artificial intelligence systems. The goals of this phase of the research were to investigate the feasibility of developing software tools which automatically translate expert system rules into Ada code and develop methods for performing validation and verification testing of the resultant expert system. A prototype system was demonstrated which automatically translated rules from an Air Force expert system was demonstrated which detected errors in the execution of the resultant system. The method and prototype tools for converting AI representations into Ada code by converting the rules into Ada code modules and then linking them with an Activation Framework based run-time environment to form an executable load module are discussed. This method is based upon the use of Evidence Flow Graphs which are a data flow representation for intelligent systems. The development of prototype test generation and evaluation software which was used to test the resultant code is discussed. This testing was performed automatically using Monte-Carlo techniques based upon a constraint based description of the required performance for the system.

A note on the solutions of some nonlinear equations arising in third-grade fluid flows: an exact approach.

PubMed

Aziz, Taha; Mahomed, F M

2014-01-01

In this communication, we utilize some basic symmetry reductions to transform the governing nonlinear partial differential equations arising in the study of third-grade fluid flows into ordinary differential equations. We obtain some simple closed-form steady-state solutions of these reduced equations. Our solutions are valid for the whole domain [0,∞) and also satisfy the physical boundary conditions. We also present the numerical solutions for some of the underlying equations. The graphs corresponding to the essential physical parameters of the flow are presented and discussed.

Influence of thermal stratification and slip conditions on stagnation point flow towards variable thicked Riga plate

NASA Astrophysics Data System (ADS)

Anjum, A.; Mir, N. A.; Farooq, M.; Khan, M. Ijaz; Hayat, T.

2018-06-01

This article addresses thermally stratified stagnation point flow of viscous fluid induced by a non-linear variable thicked Riga plate. Velocity and thermal slip effects are incorporated to disclose the flow analysis. Solar thermal radiation phenomenon is implemented to address the characteristics of heat transfer. Variations of different physical parameters on the horizontal velocity and temperature distributions are described through graphs. Graphical interpretations of skin friction coefficient (drag force at the surface) and Nusselt number (rate of heat transfer) are also addressed. Modified Hartman number and thermal stratification parameter result in reduction of temperature distribution.

Determination of molecular contamination performance for space chamber tests

NASA Technical Reports Server (NTRS)

Scialdone, J. J.

1973-01-01

The limitations of chamber tests with regard to the molecular contamination of a spacecraft undergoing vacuum test were examined. The molecular flow conditions existing in the chamber and the parameters dictating the degree of contamination were analyzed. Equations and graphs were developed to show the fraction of molecules returning to the spacecraft out of those emitted and to show other chamber flow parameters as a function of chamber and spacecraft surface molecular pumping and geometric configuration. Type and location of instruments required to measure the outgassing, the degree of contamination, and the returning flows are also discussed.

NASA supercritical laminar flow control airfoil experiment

NASA Technical Reports Server (NTRS)

Harvey, W. D.

1982-01-01

The design and goals of experimental investigations of supercritical LFC airfoils conducted in the NASA Langley 8-ft Transonic Pressure Tunnel beginning in March 1982 are reviewed. Topics addressed include laminarization aspects; flow-quality requirements; simulation of flight parameters; the setup of screens, honeycomb, and sonic throat; the design cycle; theoretical pressure distributions and shock-free limits; drag divergence and stability analysis; and the LFC suction system. Consideration is given to the LFC airfoil model, the air-flow control system, airfoil-surface instrumentation, liner design and hardware, and test options. Extensive diagrams, drawings, graphs, photographs, and tables of numerical data are provided.

A Note on the Solutions of Some Nonlinear Equations Arising in Third-Grade Fluid Flows: An Exact Approach

PubMed Central

Mahomed, F. M.

2014-01-01

In this communication, we utilize some basic symmetry reductions to transform the governing nonlinear partial differential equations arising in the study of third-grade fluid flows into ordinary differential equations. We obtain some simple closed-form steady-state solutions of these reduced equations. Our solutions are valid for the whole domain [0,∞) and also satisfy the physical boundary conditions. We also present the numerical solutions for some of the underlying equations. The graphs corresponding to the essential physical parameters of the flow are presented and discussed. PMID:25143962

Multi-phase simultaneous segmentation of tumor in lung 4D-CT data with context information.

PubMed

Shen, Zhengwen; Wang, Huafeng; Xi, Weiwen; Deng, Xiaogang; Chen, Jin; Zhang, Yu

2017-01-01

Lung 4D computed tomography (4D-CT) plays an important role in high-precision radiotherapy because it characterizes respiratory motion, which is crucial for accurate target definition. However, the manual segmentation of a lung tumor is a heavy workload for doctors because of the large number of lung 4D-CT data slices. Meanwhile, tumor segmentation is still a notoriously challenging problem in computer-aided diagnosis. In this paper, we propose a new method based on an improved graph cut algorithm with context information constraint to find a convenient and robust approach of lung 4D-CT tumor segmentation. We combine all phases of the lung 4D-CT into a global graph, and construct a global energy function accordingly. The sub-graph is first constructed for each phase. A context cost term is enforced to achieve segmentation results in every phase by adding a context constraint between neighboring phases. A global energy function is finally constructed by combining all cost terms. The optimization is achieved by solving a max-flow/min-cut problem, which leads to simultaneous and robust segmentation of the tumor in all the lung 4D-CT phases. The effectiveness of our approach is validated through experiments on 10 different lung 4D-CT cases. The comparison with the graph cut without context constraint, the level set method and the graph cut with star shape prior demonstrates that the proposed method obtains more accurate and robust segmentation results.

An evaluation of the directed flow graph methodology

NASA Technical Reports Server (NTRS)

Snyder, W. E.; Rajala, S. A.

1984-01-01

The applicability of the Directed Graph Methodology (DGM) to the design and analysis of special purpose image and signal processing hardware was evaluated. A special purpose image processing system was designed and described using DGM. The design, suitable for very large scale integration (VLSI) implements a region labeling technique. Two computer chips were designed, both using metal-nitride-oxide-silicon (MNOS) technology, as well as a functional system utilizing those chips to perform real time region labeling. The system is described in terms of DGM primitives. As it is currently implemented, DGM is inappropriate for describing synchronous, tightly coupled, special purpose systems. The nature of the DGM formalism lends itself more readily to modeling networks of general purpose processors.

Liver vessels segmentation using a hybrid geometrical moments/graph cuts method

PubMed Central

Esneault, Simon; Lafon, Cyril; Dillenseger, Jean-Louis

2010-01-01

This paper describes a fast and fully-automatic method for liver vessel segmentation on CT scan pre-operative images. The basis of this method is the introduction of a 3-D geometrical moment-based detector of cylindrical shapes within the min-cut/max-flow energy minimization framework. This method represents an original way to introduce a data term as a constraint into the widely used Boykov’s graph cuts algorithm and hence, to automate the segmentation. The method is evaluated and compared with others on a synthetic dataset. Finally, the relevancy of our method regarding the planning of a -necessarily accurate- percutaneous high intensity focused ultrasound surgical operation is demonstrated with some examples. PMID:19783500

Graph theory findings in the pathophysiology of temporal lobe epilepsy.

PubMed

Chiang, Sharon; Haneef, Zulfi

2014-07-01

Temporal lobe epilepsy (TLE) is the most common form of adult epilepsy. Accumulating evidence has shown that TLE is a disorder of abnormal epileptogenic networks, rather than focal sources. Graph theory allows for a network-based representation of TLE brain networks, and has potential to illuminate characteristics of brain topology conducive to TLE pathophysiology, including seizure initiation and spread. We review basic concepts which we believe will prove helpful in interpreting results rapidly emerging from graph theory research in TLE. In addition, we summarize the current state of graph theory findings in TLE as they pertain its pathophysiology. Several common findings have emerged from the many modalities which have been used to study TLE using graph theory, including structural MRI, diffusion tensor imaging, surface EEG, intracranial EEG, magnetoencephalography, functional MRI, cell cultures, simulated models, and mouse models, involving increased regularity of the interictal network configuration, altered local segregation and global integration of the TLE network, and network reorganization of temporal lobe and limbic structures. As different modalities provide different views of the same phenomenon, future studies integrating data from multiple modalities are needed to clarify findings and contribute to the formation of a coherent theory on the pathophysiology of TLE. Copyright © 2014 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Visualizing risks in cancer communication: A systematic review of computer-supported visual aids.

PubMed

Stellamanns, Jan; Ruetters, Dana; Dahal, Keshav; Schillmoeller, Zita; Huebner, Jutta

2017-08-01

Health websites are becoming important sources for cancer information. Lay users, patients and carers seek support for critical decisions, but they are prone to common biases when quantitative information is presented. Graphical representations of risk data can facilitate comprehension, and interactive visualizations are popular. This review summarizes the evidence on computer-supported graphs that present risk data and their effects on various measures. The systematic literature search was conducted in several databases, including MEDLINE, EMBASE and CINAHL. Only studies with a controlled design were included. Relevant publications were carefully selected and critically appraised by two reviewers. Thirteen studies were included. Ten studies evaluated static graphs and three dynamic formats. Most decision scenarios were hypothetical. Static graphs could improve accuracy, comprehension, and behavioural intention. But the results were heterogeneous and inconsistent among the studies. Dynamic formats were not superior or even impaired performance compared to static formats. Static graphs show promising but inconsistent results, while research on dynamic visualizations is scarce and must be interpreted cautiously due to methodical limitations. Well-designed and context-specific static graphs can support web-based cancer risk communication in particular populations. The application of dynamic formats cannot be recommended and needs further research. Copyright © 2017 Elsevier B.V. All rights reserved.

graph-GPA: A graphical model for prioritizing GWAS results and investigating pleiotropic architecture.

PubMed

Chung, Dongjun; Kim, Hang J; Zhao, Hongyu

2017-02-01

Genome-wide association studies (GWAS) have identified tens of thousands of genetic variants associated with hundreds of phenotypes and diseases, which have provided clinical and medical benefits to patients with novel biomarkers and therapeutic targets. However, identification of risk variants associated with complex diseases remains challenging as they are often affected by many genetic variants with small or moderate effects. There has been accumulating evidence suggesting that different complex traits share common risk basis, namely pleiotropy. Recently, several statistical methods have been developed to improve statistical power to identify risk variants for complex traits through a joint analysis of multiple GWAS datasets by leveraging pleiotropy. While these methods were shown to improve statistical power for association mapping compared to separate analyses, they are still limited in the number of phenotypes that can be integrated. In order to address this challenge, in this paper, we propose a novel statistical framework, graph-GPA, to integrate a large number of GWAS datasets for multiple phenotypes using a hidden Markov random field approach. Application of graph-GPA to a joint analysis of GWAS datasets for 12 phenotypes shows that graph-GPA improves statistical power to identify risk variants compared to statistical methods based on smaller number of GWAS datasets. In addition, graph-GPA also promotes better understanding of genetic mechanisms shared among phenotypes, which can potentially be useful for the development of improved diagnosis and therapeutics. The R implementation of graph-GPA is currently available at https://dongjunchung.github.io/GGPA/.

Clinical correlates of graph theory findings in temporal lobe epilepsy.

PubMed

Haneef, Zulfi; Chiang, Sharon

2014-11-01

Temporal lobe epilepsy (TLE) is considered a brain network disorder, additionally representing the most common form of pharmaco-resistant epilepsy in adults. There is increasing evidence that seizures in TLE arise from abnormal epileptogenic networks, which extend beyond the clinico-radiologically determined epileptogenic zone and may contribute to the failure rate of 30-50% following epilepsy surgery. Graph theory allows for a network-based representation of TLE brain networks using several neuroimaging and electrophysiologic modalities, and has potential to provide clinicians with clinically useful biomarkers for diagnostic and prognostic purposes. We performed a review of the current state of graph theory findings in TLE as they pertain to localization of the epileptogenic zone, prediction of pre- and post-surgical seizure frequency and cognitive performance, and monitoring cognitive decline in TLE. Although different neuroimaging and electrophysiologic modalities have yielded occasionally conflicting results, several potential biomarkers have been characterized for identifying the epileptogenic zone, pre-/post-surgical seizure prediction, and assessing cognitive performance. For localization, graph theory measures of centrality have shown the most potential, including betweenness centrality, outdegree, and graph index complexity, whereas for prediction of seizure frequency, measures of synchronizability have shown the most potential. The utility of clustering coefficient and characteristic path length for assessing cognitive performance in TLE is also discussed. Future studies integrating data from multiple modalities and testing predictive models are needed to clarify findings and develop graph theory for its clinical utility. Copyright © 2014 British Epilepsy Association. Published by Elsevier Ltd. All rights reserved.

Clinical correlates of graph theory findings in temporal lobe epilepsy

PubMed Central

Haneef, Zulfi; Chiang, Sharon

2014-01-01

Purpose Temporal lobe epilepsy (TLE) is considered a brain network disorder, additionally representing the most common form of pharmaco-resistant epilepsy in adults. There is increasing evidence that seizures in TLE arise from abnormal epileptogenic networks, which extend beyond the clinico-radiologically determined epileptogenic zone and may contribute to the failure rate of 30–50% following epilepsy surgery. Graph theory allows for a network-based representation of TLE brain networks using several neuroimaging and electrophysiologic modalities, and has potential to provide clinicians with clinically useful biomarkers for diagnostic and prognostic purposes. Methods We performed a review of the current state of graph theory findings in TLE as they pertain to localization of the epileptogenic zone, prediction of pre- and post-surgical seizure frequency and cognitive performance, and monitoring cognitive decline in TLE. Results Although different neuroimaging and electrophysiologic modalities have yielded occasionally conflicting results, several potential biomarkers have been characterized for identifying the epileptogenic zone, pre-/post-surgical seizure prediction, and assessing cognitive performance. For localization, graph theory measures of centrality have shown the most potential, including betweenness centrality, outdegree, and graph index complexity, whereas for prediction of seizure frequency, measures of synchronizability have shown the most potential. The utility of clustering coefficient and characteristic path length for assessing cognitive performance in TLE is also discussed. Conclusions Future studies integrating data from multiple modalities and testing predictive models are needed to clarify findings and develop graph theory for its clinical utility. PMID:25127370

Computational Models for Belief Revision, Group Decision-Making and Cultural Shifts

DTIC Science & Technology

2010-10-25

34social" networks; the green numbers are pseudo-trees or artificial (non-social) constructions. The dashed blue line indicates the range of Erdos- Renyi ...non-social networks such as Erdos- Renyi random graphs or the more passive non-cognitive spreading of disease or information flow, As mentioned

A Simple Exposition of the Social Security Trust Fund.

ERIC Educational Resources Information Center

Holahan, William L.; Schug, Mark C.

2000-01-01

Discusses a strategy for teaching students about how the Social Security Trust Fund works. Explains that a flow chart is presented to the students; four terms are defined (deficit, surplus, debt, and reserve); and a new graph is prepared to show the paths of these four variables. (CMK)

Lexivisions: Making Meaning through Imaging.

ERIC Educational Resources Information Center

Iovino, Linda

In a high school writing workshop, students frequently would go through multiple essay drafts and conferences with the teacher and fellow students before realizing that their theses were incorrect. A teacher devised the "lexivision" to address this problem. Students used Venn diagrams, graphs, or flow charts to represent concepts in the…

Networking in the Presence of Adversaries

DTIC Science & Technology

2014-09-12

a topological graph with linear algebraic constraints. As a practical example, such a model arises from an electric power system in which the power...flow is governed by the Kirchhoff law. When an adversary launches an MiM data attack, part of the sensor data are intercepted and substituted with

Community structure and scale-free collections of Erdős-Rényi graphs.

PubMed

Seshadhri, C; Kolda, Tamara G; Pinar, Ali

2012-05-01

Community structure plays a significant role in the analysis of social networks and similar graphs, yet this structure is little understood and not well captured by most models. We formally define a community to be a subgraph that is internally highly connected and has no deeper substructure. We use tools of combinatorics to show that any such community must contain a dense Erdős-Rényi (ER) subgraph. Based on mathematical arguments, we hypothesize that any graph with a heavy-tailed degree distribution and community structure must contain a scale-free collection of dense ER subgraphs. These theoretical observations corroborate well with empirical evidence. From this, we propose the Block Two-Level Erdős-Rényi (BTER) model, and demonstrate that it accurately captures the observable properties of many real-world social networks.

An intercomparison of NEL and DHL water flow facilities using a twin orifice plate flowmeter assembly

NASA Technical Reports Server (NTRS)

Dejong, J.; Spencer, E. A.

1983-01-01

A 205 mm transfer standard orifice plate meter assembly, consisting of two orifice plates in series separated by a length of pipe containing a flow straightener, was calibrated in two water flow facilities. Results show that the agreement in the characteristics of such a differential pressure transfer standard package is within 0.17% over a 10:1 range from flow rates of approximately 8 to 80 l/sec. When the range over which the comparison was made was limited to that for which the calibration graphs gave straight lines, the agreement is 0.1% in 3 of the 4 calibrations (0.17% in the fourth).

Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions.

PubMed

Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng

2018-04-20

In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute molecules and the structure and dynamics of water.

Graph Theory and Ion and Molecular Aggregation in Aqueous Solutions

NASA Astrophysics Data System (ADS)

Choi, Jun-Ho; Lee, Hochan; Choi, Hyung Ran; Cho, Minhaeng

2018-04-01

In molecular and cellular biology, dissolved ions and molecules have decisive effects on chemical and biological reactions, conformational stabilities, and functions of small to large biomolecules. Despite major efforts, the current state of understanding of the effects of specific ions, osmolytes, and bioprotecting sugars on the structure and dynamics of water H-bonding networks and proteins is not yet satisfactory. Recently, to gain deeper insight into this subject, we studied various aggregation processes of ions and molecules in high-concentration salt, osmolyte, and sugar solutions with time-resolved vibrational spectroscopy and molecular dynamics simulation methods. It turns out that ions (or solute molecules) have a strong propensity to self-assemble into large and polydisperse aggregates that affect both local and long-range water H-bonding structures. In particular, we have shown that graph-theoretical approaches can be used to elucidate morphological characteristics of large aggregates in various aqueous salt, osmolyte, and sugar solutions. When ion and molecular aggregates in such aqueous solutions are treated as graphs, a variety of graph-theoretical properties, such as graph spectrum, degree distribution, clustering coefficient, minimum path length, and graph entropy, can be directly calculated by considering an ensemble of configurations taken from molecular dynamics trajectories. Here we show percolating behavior exhibited by ion and molecular aggregates upon increase in solute concentration in high solute concentrations and discuss compelling evidence of the isomorphic relation between percolation transitions of ion and molecular aggregates and water H-bonding networks. We anticipate that the combination of graph theory and molecular dynamics simulation methods will be of exceptional use in achieving a deeper understanding of the fundamental physical chemistry of dissolution and in describing the interplay between the self-aggregation of solute molecules and the structure and dynamics of water.

The Kontsevich tetrahedral flow revisited

NASA Astrophysics Data System (ADS)

Bouisaghouane, A.; Buring, R.; Kiselev, A.

2017-09-01

We prove that the Kontsevich tetrahedral flow P ˙ =Qa:b(P) , the right-hand side of which is a linear combination of two differential monomials of degree four in a bi-vector P on an affine real Poisson manifold Nn, does infinitesimally preserve the space of Poisson bi-vectors on Nn if and only if the two monomials in Qa:b(P) are balanced by the ratio a : b = 1 : 6. The proof is explicit; it is written in the language of Kontsevich graphs.

Dual nozzle aerodynamic and cooling analysis study. [dual throat and dual expander nozzles

NASA Technical Reports Server (NTRS)

Meagher, G. M.

1980-01-01

Geometric, aerodynamic flow field, performance prediction, and heat transfer analyses are considered for two advanced chamber nozzle concepts applicable to Earth-to-orbit engine systems. Topics covered include improvements to the dual throat aerodynamic and performance prediction program; geometric and flow field analyses of the dual expander concept; heat transfer analysis of both concepts, and engineering analysis of data from the NASA/MSFC hot-fire testing of a dual throat thruster model thrust chamber assembly. Preliminary results obtained are presented in graphs.

SPROC: A multiple-processor DSP IC

NASA Technical Reports Server (NTRS)

Davis, R.

1991-01-01

A large, single-chip, multiple-processor, digital signal processing (DSP) integrated circuit (IC) fabricated in HP-Cmos34 is presented. The innovative architecture is best suited for analog and real-time systems characterized by both parallel signal data flows and concurrent logic processing. The IC is supported by a powerful development system that transforms graphical signal flow graphs into production-ready systems in minutes. Automatic compiler partitioning of tasks among four on-chip processors gives the IC the signal processing power of several conventional DSP chips.

Drag and drop simulation: from pictures to full three-dimensional simulations

NASA Astrophysics Data System (ADS)

Bergmann, Michel; Iollo, Angelo

2014-11-01

We present a suite of methods to achieve ``drag and drop'' simulation, i.e., to fully automatize the process to perform thee-dimensional flow simulations around a bodies defined by actual images of moving objects. The overall approach requires a skeleton graph generation to get level set function from pictures, optimal transportation to get body velocity on the surface and then flow simulation thanks to a cartesian method based on penalization. We illustrate this paradigm simulating the swimming of a mackerel fish.

Functional connectivity and graph theory in preclinical Alzheimer's disease.

PubMed

Brier, Matthew R; Thomas, Jewell B; Fagan, Anne M; Hassenstab, Jason; Holtzman, David M; Benzinger, Tammie L; Morris, John C; Ances, Beau M

2014-04-01

Alzheimer's disease (AD) has a long preclinical phase in which amyloid and tau cerebral pathology accumulate without producing cognitive symptoms. Resting state functional connectivity magnetic resonance imaging has demonstrated that brain networks degrade during symptomatic AD. It is unclear to what extent these degradations exist before symptomatic onset. In this study, we investigated graph theory metrics of functional integration (path length), functional segregation (clustering coefficient), and functional distinctness (modularity) as a function of disease severity. Further, we assessed whether these graph metrics were affected in cognitively normal participants with cerebrospinal fluid evidence of preclinical AD. Clustering coefficient and modularity, but not path length, were reduced in AD. Cognitively normal participants who harbored AD biomarker pathology also showed reduced values in these graph measures, demonstrating brain changes similar to, but smaller than, symptomatic AD. Only modularity was significantly affected by age. We also demonstrate that AD has a particular effect on hub-like regions in the brain. We conclude that AD causes large-scale disconnection that is present before onset of symptoms. Copyright © 2014 Elsevier Inc. All rights reserved.

Detecting black bear source–sink dynamics using individual-based genetic graphs

PubMed Central

Draheim, Hope M.; Moore, Jennifer A.; Etter, Dwayne; Winterstein, Scott R.; Scribner, Kim T.

2016-01-01

Source–sink dynamics affects population connectivity, spatial genetic structure and population viability for many species. We introduce a novel approach that uses individual-based genetic graphs to identify source–sink areas within a continuously distributed population of black bears (Ursus americanus) in the northern lower peninsula (NLP) of Michigan, USA. Black bear harvest samples (n = 569, from 2002, 2006 and 2010) were genotyped at 12 microsatellite loci and locations were compared across years to identify areas of consistent occupancy over time. We compared graph metrics estimated for a genetic model with metrics from 10 ecological models to identify ecological factors that were associated with sources and sinks. We identified 62 source nodes, 16 of which represent important source areas (net flux > 0.7) and 79 sink nodes. Source strength was significantly correlated with bear local harvest density (a proxy for bear density) and habitat suitability. Additionally, resampling simulations showed our approach is robust to potential sampling bias from uneven sample dispersion. Findings demonstrate black bears in the NLP exhibit asymmetric gene flow, and individual-based genetic graphs can characterize source–sink dynamics in continuously distributed species in the absence of discrete habitat patches. Our findings warrant consideration of undetected source–sink dynamics and their implications on harvest management of game species. PMID:27440668

Network meta-analysis, electrical networks and graph theory.

PubMed

Rücker, Gerta

2012-12-01

Network meta-analysis is an active field of research in clinical biostatistics. It aims to combine information from all randomized comparisons among a set of treatments for a given medical condition. We show how graph-theoretical methods can be applied to network meta-analysis. A meta-analytic graph consists of vertices (treatments) and edges (randomized comparisons). We illustrate the correspondence between meta-analytic networks and electrical networks, where variance corresponds to resistance, treatment effects to voltage, and weighted treatment effects to current flows. Based thereon, we then show that graph-theoretical methods that have been routinely applied to electrical networks also work well in network meta-analysis. In more detail, the resulting consistent treatment effects induced in the edges can be estimated via the Moore-Penrose pseudoinverse of the Laplacian matrix. Moreover, the variances of the treatment effects are estimated in analogy to electrical effective resistances. It is shown that this method, being computationally simple, leads to the usual fixed effect model estimate when applied to pairwise meta-analysis and is consistent with published results when applied to network meta-analysis examples from the literature. Moreover, problems of heterogeneity and inconsistency, random effects modeling and including multi-armed trials are addressed. Copyright © 2012 John Wiley & Sons, Ltd. Copyright © 2012 John Wiley & Sons, Ltd.

Detecting black bear source-sink dynamics using individual-based genetic graphs.

PubMed

Draheim, Hope M; Moore, Jennifer A; Etter, Dwayne; Winterstein, Scott R; Scribner, Kim T

2016-07-27

Source-sink dynamics affects population connectivity, spatial genetic structure and population viability for many species. We introduce a novel approach that uses individual-based genetic graphs to identify source-sink areas within a continuously distributed population of black bears (Ursus americanus) in the northern lower peninsula (NLP) of Michigan, USA. Black bear harvest samples (n = 569, from 2002, 2006 and 2010) were genotyped at 12 microsatellite loci and locations were compared across years to identify areas of consistent occupancy over time. We compared graph metrics estimated for a genetic model with metrics from 10 ecological models to identify ecological factors that were associated with sources and sinks. We identified 62 source nodes, 16 of which represent important source areas (net flux > 0.7) and 79 sink nodes. Source strength was significantly correlated with bear local harvest density (a proxy for bear density) and habitat suitability. Additionally, resampling simulations showed our approach is robust to potential sampling bias from uneven sample dispersion. Findings demonstrate black bears in the NLP exhibit asymmetric gene flow, and individual-based genetic graphs can characterize source-sink dynamics in continuously distributed species in the absence of discrete habitat patches. Our findings warrant consideration of undetected source-sink dynamics and their implications on harvest management of game species. © 2016 The Author(s).

Novel approaches to analysis by flow injection gradient titration.

PubMed

Wójtowicz, Marzena; Kozak, Joanna; Kościelniak, Paweł

2007-09-26

Two novel procedures for flow injection gradient titration with the use of a single stock standard solution are proposed. In the multi-point single-line (MP-SL) method the calibration graph is constructed on the basis of a set of standard solutions, which are generated in a standard reservoir and subsequently injected into the titrant. According to the single-point multi-line (SP-ML) procedure the standard solution and a sample are injected into the titrant stream from four loops of different capacities, hence four calibration graphs are able to be constructed and the analytical result is calculated on the basis of a generalized slope of these graphs. Both approaches have been tested on the example of spectrophotometric acid-base titration of hydrochloric and acetic acids with using bromothymol blue and phenolphthalein as indicators, respectively, and sodium hydroxide as a titrant. Under optimized experimental conditions the analytical results of precision less than 1.8 and 2.5% (RSD) and of accuracy less than 3.0 and 5.4% (relative error (RE)) were obtained for MP-SL and SP-ML procedures, respectively, in ranges of 0.0031-0.0631 mol L(-1) for samples of hydrochloric acid and of 0.1680-1.7600 mol L(-1) for samples of acetic acid. The feasibility of both methods was illustrated by applying them to the total acidity determination in vinegar samples with precision lower than 0.5 and 2.9% (RSD) for MP-SL and SP-ML procedures, respectively.

A signal-flow-graph approach to on-line gradient calculation.

PubMed

Campolucci, P; Uncini, A; Piazza, F

2000-08-01

A large class of nonlinear dynamic adaptive systems such as dynamic recurrent neural networks can be effectively represented by signal flow graphs (SFGs). By this method, complex systems are described as a general connection of many simple components, each of them implementing a simple one-input, one-output transformation, as in an electrical circuit. Even if graph representations are popular in the neural network community, they are often used for qualitative description rather than for rigorous representation and computational purposes. In this article, a method for both on-line and batch-backward gradient computation of a system output or cost function with respect to system parameters is derived by the SFG representation theory and its known properties. The system can be any causal, in general nonlinear and time-variant, dynamic system represented by an SFG, in particular any feedforward, time-delay, or recurrent neural network. In this work, we use discrete-time notation, but the same theory holds for the continuous-time case. The gradient is obtained in a straightforward way by the analysis of two SFGs, the original one and its adjoint (obtained from the first by simple transformations), without the complex chain rule expansions of derivatives usually employed. This method can be used for sensitivity analysis and for learning both off-line and on-line. On-line learning is particularly important since it is required by many real applications, such as digital signal processing, system identification and control, channel equalization, and predistortion.

An AI-based communication system for motor and speech disabled persons: design methodology and prototype testing.

PubMed

Sy, B K; Deller, J R

1989-05-01

An intelligent communication device is developed to assist the nonverbal, motor disabled in the generation of written and spoken messages. The device is centered on a knowledge base of the grammatical rules and message elements. A "belief" reasoning scheme based on both the information from external sources and the embedded knowledge is used to optimize the process of message search. The search for the message elements is conceptualized as a path search in the language graph, and a special frame architecture is used to construct and to partition the graph. Bayesian "belief" reasoning from the Dempster-Shafer theory of evidence is augmented to cope with time-varying evidence. An "information fusion" strategy is also introduced to integrate various forms of external information. Experimental testing of the prototype system is discussed.

Stochastic cycle selection in active flow networks.

PubMed

Woodhouse, Francis G; Forrow, Aden; Fawcett, Joanna B; Dunkel, Jörn

2016-07-19

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models.

Stochastic cycle selection in active flow networks

NASA Astrophysics Data System (ADS)

Woodhouse, Francis; Forrow, Aden; Fawcett, Joanna; Dunkel, Jorn

2016-11-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such non-equilibrium networks. By connecting concepts from lattice field theory, graph theory and transition rate theory, we show how topology controls dynamics in a generic model for actively driven flow on a network. Through theoretical and numerical analysis we identify symmetry-based rules to classify and predict the selection statistics of complex flow cycles from the network topology. Our conceptual framework is applicable to a broad class of biological and non-biological far-from-equilibrium networks, including actively controlled information flows, and establishes a new correspondence between active flow networks and generalized ice-type models.

Experimental results for a hypersonic nozzle/afterbody flow field

NASA Technical Reports Server (NTRS)

Spaid, Frank W.; Keener, Earl R.; Hui, Frank C. L.

1995-01-01

This study was conducted to experimentally characterize the flow field created by the interaction of a single-expansion ramp-nozzle (SERN) flow with a hypersonic external stream. Data were obtained from a generic nozzle/afterbody model in the 3.5 Foot Hypersonic Wind Tunnel at the NASA Ames Research Center, in a cooperative experimental program involving Ames and McDonnell Douglas Aerospace. The model design and test planning were performed in close cooperation with members of the Ames computational fluid dynamics (CFD) team for the National Aerospace Plane (NASP) program. This paper presents experimental results consisting of oil-flow and shadow graph flow-visualization photographs, afterbody surface-pressure distributions, rake boundary-layer measurements, Preston-tube skin-friction measurements, and flow field surveys with five-hole and thermocouple probes. The probe data consist of impact pressure, flow direction, and total temperature profiles in the interaction flow field.

Stochastic cycle selection in active flow networks

PubMed Central

Woodhouse, Francis G.; Forrow, Aden; Fawcett, Joanna B.; Dunkel, Jörn

2016-01-01

Active biological flow networks pervade nature and span a wide range of scales, from arterial blood vessels and bronchial mucus transport in humans to bacterial flow through porous media or plasmodial shuttle streaming in slime molds. Despite their ubiquity, little is known about the self-organization principles that govern flow statistics in such nonequilibrium networks. Here we connect concepts from lattice field theory, graph theory, and transition rate theory to understand how topology controls dynamics in a generic model for actively driven flow on a network. Our combined theoretical and numerical analysis identifies symmetry-based rules that make it possible to classify and predict the selection statistics of complex flow cycles from the network topology. The conceptual framework developed here is applicable to a broad class of biological and nonbiological far-from-equilibrium networks, including actively controlled information flows, and establishes a correspondence between active flow networks and generalized ice-type models. PMID:27382186

Using graph theory to quantify coarse sediment connectivity in alpine geosystems

NASA Astrophysics Data System (ADS)

Heckmann, Tobias; Thiel, Markus; Schwanghart, Wolfgang; Haas, Florian; Becht, Michael

2010-05-01

Networks are a common object of study in various disciplines. Among others, informatics, sociology, transportation science, economics and ecology frequently deal with objects which are linked with other objects to form a network. Despite this wide thematic range, a coherent formal basis to represent, measure and model the relational structure of models exists. The mathematical model for networks of all kinds is a graph which can be analysed using the tools of mathematical graph theory. In a graph model of a generic system, system components are represented by graph nodes, and the linkages between them are formed by graph edges. The latter may represent all kinds of linkages, from matter or energy fluxes to functional relations. To some extent, graph theory has been used in geosciences and related disciplines; in hydrology and fluvial geomorphology, for example, river networks have been modeled and analysed as graphs. An important issue in hydrology is the hydrological connectivity which determines if runoff generated on some area reaches the channel network. In ecology, a number of graph-theoretical indices is applicable to describing the influence of habitat distribution and landscape fragmentation on population structure and species mobility. In these examples, the mobility of matter (water, sediment, animals) through a system is an important consequence of system structure, i.e. the location and topology of its components as well as of properties of linkages between them. In geomorphology, sediment connectivity relates to the potential of sediment particles to move through the catchment. As a system property, connectivity depends, for example, on the degree to which hillslopes within a catchment are coupled to the channel system (lateral coupling), and to which channel reaches are coupled to each other (longitudinal coupling). In the present study, numerical GIS-based models are used to investigate the coupling of geomorphic process units by delineating the process domains of important geomorphic processes in a high-mountain environment (rockfall, slope-type debris flows, slope aquatic and fluvial processes). The results are validated by field mapping; they show that only small parts of a catchment are actually coupled to its outlet with respect to coarse (bedload) sediment. The models not only generate maps of the spatial extent and geomorphic activity of the aforementioned processes, they also output so-called edge lists that can be converted to adjacency matrices and graphs. Graph theory is then employed to explore ‘local' (i.e. referring to single nodes or edges) and ‘global' (i.e. system-wide, referring to the whole graph) measures that can be used to quantify coarse sediment connectivity. Such a quantification will complement the mainly qualitative appraisal of coupling and connectivity; the effect of connectivity on catchment properties such as specific sediment yield and catchment sensitivity will then be studied on the basis of quantitative measures.

Streamflow of 2016—Water year summary

USGS Publications Warehouse

Jian, Xiaodong; Wolock, David M.; Lins, Harry F.; Brady, Steven J.

2017-09-26

The maps and graphs in this summary describe national streamflow conditions for water year 2016 (October 1, 2015, to September 30, 2016) in the context of streamflow ranks relative to the 87-year period of 1930–2016, unless otherwise noted. The illustrations are based on observed data from the U.S. Geological Survey’s (USGS) National Streamflow Network. The period of 1930–2016 was used because the number of streamgages before 1930 was too small to provide representative data for computing statistics for most regions of the country.In the summary, reference is made to the term “runoff,” which is the depth to which a river basin, State, or other geographic area would be covered with water if all the streamflow within the area during a specified period was uniformly distributed on it. Runoff quantifies the magnitude of water flowing through the Nation’s rivers and streams in measurement units that can be compared from one area to another.In all the graphics, a rank of 1 indicates the highest flow of all years analyzed and 87 indicates the lowest flow of all years. Rankings of streamflow are grouped into much below normal, below normal, normal, above normal, and much above normal based on percentiles of flow (less than 10 percent, 10–24 percent, 25–75 percent, 76–90 percent, and greater than 90 percent, respectively). Some of the data used to produce the maps and graphs are provisional and subject to change.

Summary of percentages of zero daily mean streamflow for 712 U.S. Geological Survey streamflow-gaging stations in Texas through 2003

USGS Publications Warehouse

Asquith, William H.; Vrabel, Joseph; Roussel, Meghan C.

2007-01-01

Analysts and managers of surface-water resources might have interest in the zero-flow potential for U.S.Geological Survey (USGS) streamflow-gaging stations in Texas. The USGS, in cooperation with the Texas Commission on Environmental Quality, initiated a data and reporting process to generate summaries of percentages of zero daily mean streamflow for 712 USGS streamflow-gaging stations in Texas. A summary of the percentages of zero daily mean streamflow for most active and inactive, continuous-record gaging stations in Texas provides valuable information by conveying the historical perspective for zero-flow potential for the watershed. The summaries of percentages of zero daily mean streamflow for each station are graphically depicted using two thematic perspectives: annual and monthly. The annual perspective consists of graphs of annual percentages of zero streamflow by year with the addition of lines depicting the mean and median annual percentage of zero streamflow. Monotonic trends in the percentages of zero streamflow also are identified using Kendall's T. The monthly perspective consists of graphs of the percentage of zero streamflow by month with lines added to indicate the mean and median monthly percentage of zero streamflow. One or more summaries could be used in a watershed, river basin, or other regional context by analysts and managers of surface-water resources to guide scientific, regulatory, or other inquiries of zero-flow or other low-flow conditions in Texas.

Darcy-Forchheimer Three-Dimensional Flow of Williamson Nanofluid over a Convectively Heated Nonlinear Stretching Surface

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Aziz, Arsalan; Muhammad, Taseer; Alsaedi, Ahmed

2017-09-01

The present study elaborates three-dimensional flow of Williamson nanoliquid over a nonlinear stretchable surface. Fluid flow obeys Darcy-Forchheimer porous medium. A bidirectional nonlinear stretching surface generates the flow. Convective surface condition of heat transfer is taken into consideration. Further the zero nanoparticles mass flux condition is imposed at the boundary. Effects of thermophoresis and Brownian diffusion are considered. Assumption of boundary layer has been employed in the problem formulation. Convergent series solutions for the nonlinear governing system are established through the optimal homotopy analysis method (OHAM). Graphs have been sketched in order to analyze that how the velocity, temperature and concentration distributions are affected by distinct emerging flow parameters. Skin friction coefficients and local Nusselt number are also computed and discussed.

Usefulness of Compile-Time Restructuring of LGDF Programs in Throughput- Critical Applications

DTIC Science & Technology

1993-09-01

efficiency of the sufers . Ma overhead can be reduced effecively by using the node and an: attributes of the data flow graph at ccunpie-time to...intolerable delays and insufficient buffer space, especiall underbhigh loads. A. THESIS SCOPE AND CONTRIB~tMON The focus of this work is on compile-time

Difference-Equation/Flow-Graph Circuit Analysis

NASA Technical Reports Server (NTRS)

Mcvey, I. M.

1988-01-01

Numerical technique enables rapid, approximate analyses of electronic circuits containing linear and nonlinear elements. Practiced in variety of computer languages on large and small computers; for circuits simple enough, programmable hand calculators used. Although some combinations of circuit elements make numerical solutions diverge, enables quick identification of divergence and correction of circuit models to make solutions converge.

Dynamic airspace configuration algorithms for next generation air transportation system

NASA Astrophysics Data System (ADS)

Wei, Jian

The National Airspace System (NAS) is under great pressure to safely and efficiently handle the record-high air traffic volume nowadays, and will face even greater challenge to keep pace with the steady increase of future air travel demand, since the air travel demand is projected to increase to two to three times the current level by 2025. The inefficiency of traffic flow management initiatives causes severe airspace congestion and frequent flight delays, which cost billions of economic losses every year. To address the increasingly severe airspace congestion and delays, the Next Generation Air Transportation System (NextGen) is proposed to transform the current static and rigid radar based system to a dynamic and flexible satellite based system. New operational concepts such as Dynamic Airspace Configuration (DAC) have been under development to allow more flexibility required to mitigate the demand-capacity imbalances in order to increase the throughput of the entire NAS. In this dissertation, we address the DAC problem in the en route and terminal airspace under the framework of NextGen. We develop a series of algorithms to facilitate the implementation of innovative concepts relevant with DAC in both the en route and terminal airspace. We also develop a performance evaluation framework for comprehensive benefit analyses on different aspects of future sector design algorithms. First, we complete a graph based sectorization algorithm for DAC in the en route airspace, which models the underlying air route network with a weighted graph, converts the sectorization problem into the graph partition problem, partitions the weighted graph with an iterative spectral bipartition method, and constructs the sectors from the partitioned graph. The algorithm uses a graph model to accurately capture the complex traffic patterns of the real flights, and generates sectors with high efficiency while evenly distributing the workload among the generated sectors. We further improve the robustness and efficiency of the graph based DAC algorithm by incorporating the Multilevel Graph Partitioning (MGP) method into the graph model, and develop a MGP based sectorization algorithm for DAC in the en route airspace. In a comprehensive benefit analysis, the performance of the proposed algorithms are tested in numerical simulations with Enhanced Traffic Management System (ETMS) data. Simulation results demonstrate that the algorithmically generated sectorizations outperform the current sectorizations in different sectors for different time periods. Secondly, based on our experience with DAC in the en route airspace, we further study the sectorization problem for DAC in the terminal airspace. The differences between the en route and terminal airspace are identified, and their influence on the terminal sectorization is analyzed. After adjusting the graph model to better capture the unique characteristics of the terminal airspace and the requirements of terminal sectorization, we develop a graph based geometric sectorization algorithm for DAC in the terminal airspace. Moreover, the graph based model is combined with the region based sector design method to better handle the complicated geometric and operational constraints in the terminal sectorization problem. In the benefit analysis, we identify the contributing factors to terminal controller workload, define evaluation metrics, and develop a bebefit analysis framework for terminal sectorization evaluation. With the evaluation framework developed, we demonstrate the improvements on the current sectorizations with real traffic data collected from several major international airports in the U.S., and conduct a detailed analysis on the potential benefits of dynamic reconfiguration in the terminal airspace. Finally, in addition to the research on the macroscopic behavior of a large number of aircraft, we also study the dynamical behavior of individual aircraft from the perspective of traffic flow management. We formulate the mode-confusion problem as hybrid estimation problem, and develop a state estimation algorithm for the linear hybrid system with continuous-state-dependent transitions based on sparse observations. We also develop an estimated time of arrival prediction algorithm based on the state-dependent transition hybrid estimation algorithm, whose performance is demonstrated with simulations on the landing procedure following the Continuous Descend Approach (CDA) profile.

xQuake: A Modern Approach to Seismic Network Analytics

NASA Astrophysics Data System (ADS)

Johnson, C. E.; Aikin, K. E.

2017-12-01

While seismic networks have expanded over the past few decades, and social needs for accurate and timely information has increased dramatically, approaches to the operational needs of both global and regional seismic observatories have been slow to adopt new technologies. This presentation presents the xQuake system that provides a fresh approach to seismic network analytics based on complexity theory and an adaptive architecture of streaming connected microservices as diverse data (picks, beams, and other data) flow into a final, curated catalog of events. The foundation for xQuake is the xGraph (executable graph) framework that is essentially a self-organizing graph database. An xGraph instance provides both the analytics as well as the data storage capabilities at the same time. Much of the analytics, such as synthetic annealing in the detection process and an evolutionary programing approach for event evolution, draws from the recent GLASS 3.0 seismic associator developed by and for the USGS National Earthquake Information Center (NEIC). In some respects xQuake is reminiscent of the Earthworm system, in that it comprises processes interacting through store and forward rings; not surprising as the first author was the lead architect of the original Earthworm project when it was known as "Rings and Things". While Earthworm components can easily be integrated into the xGraph processing framework, the architecture and analytics are more current (e.g. using a Kafka Broker for store and forward rings). The xQuake system is being released under an unrestricted open source license to encourage and enable sthe eismic community support in further development of its capabilities.

Reusable rocket engine turbopump health monitoring system, part 3

NASA Technical Reports Server (NTRS)

Perry, John G.

1989-01-01

Degradation mechanisms and sensor identification/selection resulted in a list of degradation modes and a list of sensors that are utilized in the diagnosis of these degradation modes. The sensor list is divided into primary and secondary indicators of the corresponding degradation modes. The signal conditioning requirements are discussed, describing the methods of producing the Space Shuttle Main Engine (SSME) post-hot-fire test data to be utilized by the Health Monitoring System. Development of the diagnostic logic and algorithms is also presented. The knowledge engineering approach, as utilized, includes the knowledge acquisition effort, characterization of the expert's problem solving strategy, conceptually defining the form of the applicable knowledge base, and rule base, and identifying an appropriate inferencing mechanism for the problem domain. The resulting logic flow graphs detail the diagnosis/prognosis procedure as followed by the experts. The nature and content of required support data and databases is also presented. The distinction between deep and shallow types of knowledge is identified. Computer coding of the Health Monitoring System is shown to follow the logical inferencing of the logic flow graphs/algorithms.

Bioconvection in Second Grade Nanofluid Flow Containing Nanoparticles and Gyrotactic Microorganisms

NASA Astrophysics Data System (ADS)

Khan, Noor Saeed

2018-04-01

The bioconvection in steady second grade nanofluid thin film flow containing nanoparticles and gyrotactic microorganisms is considered using passively controlled nanofluid model boundary conditions. A real-life system evolves under the flow and various taxis. The study is initially proposed in the context of gyrotactic system, which is used as a key element for the description of complex bioconvection patterns and dynamics in such systems. The governing partial differential equations are transformed into a system of ordinary ones through the similarity variables and solved analytically via homotopy analysis method (HAM). The solution is expressed through graphs and illustrated which show the influences of all the parameters.

Numerical study for Darcy-Forchheimer flow of nanofluid due to an exponentially stretching curved surface

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Haider, Farwa; Muhammad, Taseer; Alsaedi, Ahmed

2018-03-01

Here Darcy-Forchheimer flow of viscous nanofluid with Brownian motion and thermophoresis is addressed. An incompressible viscous liquid saturates the porous space through Darcy-Forchheimer relation. Flow is generated by an exponentially stretching curved surface. System of partial differential equations is converted into ordinary differential system. Nonlinear systems are solved numerically by NDSolve technique. Graphs are plotted for the outcomes of various pertinent variables. Skin friction coefficient and local Nusselt and Sherwood numbers have been physically interpreted. Our results indicate that the local Nusselt and Sherwood numbers are reduced for larger values of local porosity parameter and Forchheimer number.

Bioconvection in Second Grade Nanofluid Flow Containing Nanoparticles and Gyrotactic Microorganisms

NASA Astrophysics Data System (ADS)

Khan, Noor Saeed

2018-06-01

The bioconvection in steady second grade nanofluid thin film flow containing nanoparticles and gyrotactic microorganisms is considered using passively controlled nanofluid model boundary conditions. A real-life system evolves under the flow and various taxis. The study is initially proposed in the context of gyrotactic system, which is used as a key element for the description of complex bioconvection patterns and dynamics in such systems. The governing partial differential equations are transformed into a system of ordinary ones through the similarity variables and solved analytically via homotopy analysis method (HAM). The solution is expressed through graphs and illustrated which show the influences of all the parameters.

Unsteady boundary layer flow over a sphere in a porous medium

NASA Astrophysics Data System (ADS)

Mohammad, Nurul Farahain; Waini, Iskandar; Kasim, Abdul Rahman Mohd; Majid, Nurazleen Abdul

2017-08-01

This study focuses on the problem of unsteady boundary layer flow over a sphere in a porous medium. The governing equations which consists of a system of dimensional partial differential equations is applied with dimensionless parameter in order to attain non-dimensional partial differential equations. Later, the similarity transformation is performed in order to attain nonsimilar governing equations. Afterwards, the nonsimilar governing equations are solved numerically by using the Keller-Box method in Octave programme. The effect of porosity parameter is examined on separation time, velocity profile and skin friction of the unsteady flow. The results attained are presented in the form of table and graph.

Exploiting semantic patterns over biomedical knowledge graphs for predicting treatment and causative relations.

PubMed

Bakal, Gokhan; Talari, Preetham; Kakani, Elijah V; Kavuluru, Ramakanth

2018-06-01

Identifying new potential treatment options for medical conditions that cause human disease burden is a central task of biomedical research. Since all candidate drugs cannot be tested with animal and clinical trials, in vitro approaches are first attempted to identify promising candidates. Likewise, identifying different causal relations between biomedical entities is also critical to understand biomedical processes. Generally, natural language processing (NLP) and machine learning are used to predict specific relations between any given pair of entities using the distant supervision approach. To build high accuracy supervised predictive models to predict previously unknown treatment and causative relations between biomedical entities based only on semantic graph pattern features extracted from biomedical knowledge graphs. We used 7000 treats and 2918 causes hand-curated relations from the UMLS Metathesaurus to train and test our models. Our graph pattern features are extracted from simple paths connecting biomedical entities in the SemMedDB graph (based on the well-known SemMedDB database made available by the U.S. National Library of Medicine). Using these graph patterns connecting biomedical entities as features of logistic regression and decision tree models, we computed mean performance measures (precision, recall, F-score) over 100 distinct 80-20% train-test splits of the datasets. For all experiments, we used a positive:negative class imbalance of 1:10 in the test set to model relatively more realistic scenarios. Our models predict treats and causes relations with high F-scores of 99% and 90% respectively. Logistic regression model coefficients also help us identify highly discriminative patterns that have an intuitive interpretation. We are also able to predict some new plausible relations based on false positives that our models scored highly based on our collaborations with two physician co-authors. Finally, our decision tree models are able to retrieve over 50% of treatment relations from a recently created external dataset. We employed semantic graph patterns connecting pairs of candidate biomedical entities in a knowledge graph as features to predict treatment/causative relations between them. We provide what we believe is the first evidence in direct prediction of biomedical relations based on graph features. Our work complements lexical pattern based approaches in that the graph patterns can be used as additional features for weakly supervised relation prediction. Copyright © 2018 Elsevier Inc. All rights reserved.

Graph theoretical stable allocation as a tool for reproduction of control by human operators

NASA Astrophysics Data System (ADS)

van Nooijen, Ronald; Ertsen, Maurits; Kolechkina, Alla

2016-04-01

During the design of central control algorithms for existing water resource systems under manual control it is important to consider the interaction with parts of the system that remain under manual control and to compare the proposed new system with the existing manual methods. In graph theory the "stable allocation" problem has good solution algorithms and allows for formulation of flow distribution problems in terms of priorities. As a test case for the use of this approach we used the algorithm to derive water allocation rules for the Gezira Scheme, an irrigation system located between the Blue and White Niles south of Khartoum. In 1925, Gezira started with 300,000 acres; currently it covers close to two million acres.

NAS Grid Benchmarks: A Tool for Grid Space Exploration

NASA Technical Reports Server (NTRS)

Frumkin, Michael; VanderWijngaart, Rob F.; Biegel, Bryan (Technical Monitor)

2001-01-01

We present an approach for benchmarking services provided by computational Grids. It is based on the NAS Parallel Benchmarks (NPB) and is called NAS Grid Benchmark (NGB) in this paper. We present NGB as a data flow graph encapsulating an instance of an NPB code in each graph node, which communicates with other nodes by sending/receiving initialization data. These nodes may be mapped to the same or different Grid machines. Like NPB, NGB will specify several different classes (problem sizes). NGB also specifies the generic Grid services sufficient for running the bench-mark. The implementor has the freedom to choose any specific Grid environment. However, we describe a reference implementation in Java, and present some scenarios for using NGB.

NAS Grid Benchmarks. 1.0

NASA Technical Reports Server (NTRS)

VanderWijngaart, Rob; Frumkin, Michael; Biegel, Bryan A. (Technical Monitor)

2002-01-01

We provide a paper-and-pencil specification of a benchmark suite for computational grids. It is based on the NAS (NASA Advanced Supercomputing) Parallel Benchmarks (NPB) and is called the NAS Grid Benchmarks (NGB). NGB problems are presented as data flow graphs encapsulating an instance of a slightly modified NPB task in each graph node, which communicates with other nodes by sending/receiving initialization data. Like NPB, NGB specifies several different classes (problem sizes). In this report we describe classes S, W, and A, and provide verification values for each. The implementor has the freedom to choose any language, grid environment, security model, fault tolerance/error correction mechanism, etc., as long as the resulting implementation passes the verification test and reports the turnaround time of the benchmark.

Quantification of network structural dissimilarities.

PubMed

Schieber, Tiago A; Carpi, Laura; Díaz-Guilera, Albert; Pardalos, Panos M; Masoller, Cristina; Ravetti, Martín G

2017-01-09

Identifying and quantifying dissimilarities among graphs is a fundamental and challenging problem of practical importance in many fields of science. Current methods of network comparison are limited to extract only partial information or are computationally very demanding. Here we propose an efficient and precise measure for network comparison, which is based on quantifying differences among distance probability distributions extracted from the networks. Extensive experiments on synthetic and real-world networks show that this measure returns non-zero values only when the graphs are non-isomorphic. Most importantly, the measure proposed here can identify and quantify structural topological differences that have a practical impact on the information flow through the network, such as the presence or absence of critical links that connect or disconnect connected components.

Mathematical modeling of power law and Herschel - Buckley non-Newtonian fluid of blood flow through a stenosed artery with permeable wall: Effects of slip velocity

NASA Astrophysics Data System (ADS)

Chitra, M.; Karthikeyan, D.

2018-04-01

A mathematical model of non-Newtonian blood flow through a stenosed artery is considered. The steadynon-Newtonian model is chosen characterized by the generalized power-law model and Herschel-Bulkley model incorporating the effect of slip velocity due to steanosed artery with permeable wall. The effects of slip velocity for non-Newtonian nature of blood on velocity, flow rate and wall shear stress of the stenosed artery with permeable wall are solved analytically. The effects of various parameters such as slip parameter (λ), power index (m) and different thickness of the stenosis (δ) on velocity, volumetric flow rate and wall shear stress are discussed through graphs.

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

DOE Office of Scientific and Technical Information (OSTI.GOV)

Langguth, Johannes; Azad, Md Ariful; Halappanavar, Mahantesh

2014-07-01

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for themore » parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.« less

Conformity hinders the evolution of cooperation on scale-free networks

NASA Astrophysics Data System (ADS)

Peña, Jorge; Volken, Henri; Pestelacci, Enea; Tomassini, Marco

2009-07-01

We study the effects of conformity, the tendency of humans to imitate locally common behaviors, in the evolution of cooperation when individuals occupy the vertices of a graph and engage in the one-shot prisoner’s dilemma or the snowdrift game with their neighbors. Two different graphs are studied: rings (one-dimensional lattices with cyclic boundary conditions) and scale-free networks of the Barabási-Albert type. The proposed evolutionary-graph model is studied both by means of Monte Carlo simulations and an extended pair-approximation technique. We find improved levels of cooperation when evolution is carried on rings and individuals imitate according to both the traditional payoff bias and a conformist bias. More importantly, we show that scale-free networks are no longer powerful amplifiers of cooperation when fair amounts of conformity are introduced in the imitation rules of the players. Such weakening of the cooperation-promoting abilities of scale-free networks is the result of a less biased flow of information in scale-free topologies, making hubs more susceptible of being influenced by less-connected neighbors.

Layer-by-layer assembly of graphene oxide on thermosensitive liposomes for photo-chemotherapy.

PubMed

Hashemi, Mohadeseh; Omidi, Meisam; Muralidharan, Bharadwaj; Tayebi, Lobat; Herpin, Matthew J; Mohagheghi, Mohammad Ali; Mohammadi, Javad; Smyth, Hugh D C; Milner, Thomas E

2018-01-01

Stimuli responsive polyelectrolyte nanoparticles have been developed for chemo-photothermal destruction of breast cancer cells. This novel system, called layer by layer Lipo-graph (LBL Lipo-graph), is composed of alternate layers of graphene oxide (GO) and graphene oxide conjugated poly (l-lysine) (GO-PLL) deposited on cationic liposomes encapsulating doxorubicin. Various concentrations of GO and GO-PLL were examined and the optimal LBL Lipo-graph was found to have a particle size of 267.9 ± 13 nm, zeta potential of +43.9 ± 6.9 mV and encapsulation efficiency of 86.4 ± 4.7%. The morphology of LBL Lipo-graph was examined by cryogenic-transmission electron microscopy (Cryo-TEM), atomic force microcopy (AFM) and scanning electron microscopy (SEM). The buildup of LBL Lipo-graph was confirmed via ultraviolet-visible (UV-Vis) spectrophotometry, thermogravimetric analysis (TGA) and differential scanning calorimetry (DSC) analysis. Infra-red (IR) response suggests that four layers are sufficient to induce a gel-to-liquid phase transition in response to near infra-red (NIR) laser irradiation. Light-matter interaction of LBL Lipo-graph was studied by calculating the absorption cross section in the frequency domain by utilizing Fourier analysis. Drug release assay indicates that the LBL Lipo-graph releases much faster in an acidic environment than a liposome control. A cytotoxicity assay was conducted to prove the efficacy of LBL Lipo-graph to destroy MD-MB-231 cells in response to NIR laser emission. Also, image stream flow cytometry and two photon microcopy provide supportive data for the potential application of LBL Lipo-graph for photothermal therapy. Study results suggest the novel dual-sensitive nanoparticles allow intracellular doxorubin delivery and respond to either acidic environments or NIR excitation. Stimuli sensitive hybrid nanoparticles have been synthesized using a layer-by-layer technique and demonstrated for dual chemo-photothermal destruction of breast cancer cells. The hybrid nanoparticles are composed of alternating layers of graphene oxide and graphene oxide conjugated poly-l-lysine coating the surface of a thermosensitive cationic liposome containing doxorubicin as a core. Data suggests that the hybrid nanoparticles may offer many advantages for chemo-photothermal therapy. Advantages include a decrease of the initial burst release which may result in the reduction in systemic toxicity, increase in pH responsivity around the tumor environment and improved NIR light absorption. Copyright © 2017 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Advances in the computation of transonic separated flows over finite wings

NASA Technical Reports Server (NTRS)

Kaynak, Unver; Flores, Jolen

1989-01-01

Problems encountered in numerical simulations of transonic wind-tunnel experiments with low-aspect-ratio wings are surveyed and illustrated. The focus is on the zonal Euler/Navier-Stokes program developed by Holst et al. (1985) and its application to shock-induced separation. The physical basis and numerical implementation of the method are reviewed, and results are presented from studies of the effects of artificial dissipation, boundary conditions, grid refinement, the turbulence model, and geometry representation on the simulation accuracy. Extensive graphs and diagrams and typical flow visualizations are provided.

Graph analysis of functional brain networks: practical issues in translational neuroscience

PubMed Central

De Vico Fallani, Fabrizio; Richiardi, Jonas; Chavez, Mario; Achard, Sophie

2014-01-01

The brain can be regarded as a network: a connected system where nodes, or units, represent different specialized regions and links, or connections, represent communication pathways. From a functional perspective, communication is coded by temporal dependence between the activities of different brain areas. In the last decade, the abstract representation of the brain as a graph has allowed to visualize functional brain networks and describe their non-trivial topological properties in a compact and objective way. Nowadays, the use of graph analysis in translational neuroscience has become essential to quantify brain dysfunctions in terms of aberrant reconfiguration of functional brain networks. Despite its evident impact, graph analysis of functional brain networks is not a simple toolbox that can be blindly applied to brain signals. On the one hand, it requires the know-how of all the methodological steps of the pipeline that manipulate the input brain signals and extract the functional network properties. On the other hand, knowledge of the neural phenomenon under study is required to perform physiologically relevant analysis. The aim of this review is to provide practical indications to make sense of brain network analysis and contrast counterproductive attitudes. PMID:25180301

Statistical Measures, Hypotheses, and Tests in Applied Research

ERIC Educational Resources Information Center

Saville, David J.; Rowarth, Jacqueline S.

2008-01-01

This article reviews and discusses the use of statistical concepts in a natural resources and life sciences journal on the basis of a census of the articles published in a recent issue of the "Agronomy Journal" and presents a flow chart and a graph that display the inter-relationships between the most commonly used statistical terms. It also…

The effect of prewhirl on the internal aerodynamics and performance of a mixed flow research centrifugal compressor

NASA Technical Reports Server (NTRS)

Bryan, William B.; Fleeter, Sanford

1987-01-01

The internal three-dimensional steady and time-varying flow through the diffusing elements of a centrifugal impeller were investigated using a moderate scale, subsonic, mixed flow research compressor facility. The characteristics of the test facility which permit the measurement of internal flow conditions throughout the entire research compressor and radial diffuser for various operating conditions are described. Results are presented in the form of graphs and charts to cover a range of mass flow rates with inlet guide vane settings varying from minus 15 degrees to plus 45 degrees. The static pressure distributions in the compressor inlet section and on the impeller and exit diffuser vanes, as well as the overall pressure and temperature rise and mass flow rate, were measured and analyzed at each operating point to determine the overall performance as well as the detailed aerodynamics throughout the compressor.

Influence of magnetic field on chemically reactive blood flow through stenosed bifurcated arteries

NASA Astrophysics Data System (ADS)

Hossain, Khan Enaet; Haque, Md. Mohidul

2017-06-01

Dynamic response of mass transfer in chemically reactive blood flow through bifurcated arteries under the stenotic condition is numerically studied in the present of a uniform magnetic field. The blood flowing through the artery is assumed an incompressible, fully developed and Newtonian. The nonlinear unsteady flow phenomena are governed by the Navier-Stokes and concentration equations. All these equations together with the appropriate boundary conditions describing the present biomechanical problem are transformed by using a radial transformation and the numerical results are obtained using a finite difference technique. Effects of stenosed bifurcation and externally applied magnetic field on the blood flow with chemical reaction are discussed with the help of graph. All the flow characteristics are found to be affected by the presence of chemical reaction and exposure of magnetic field of different intensities. Finally some important findings of the problem are concluded in this work.

Extracting spatial information from networks with low-order eigenvectors

NASA Astrophysics Data System (ADS)

Cucuringu, Mihai; Blondel, Vincent D.; Van Dooren, Paul

2013-03-01

We consider the problem of inferring meaningful spatial information in networks from incomplete information on the connection intensity between the nodes of the network. We consider two spatially distributed networks: a population migration flow network within the US, and a network of mobile phone calls between cities in Belgium. For both networks we use the eigenvectors of the Laplacian matrix constructed from the link intensities to obtain informative visualizations and capture natural geographical subdivisions. We observe that some low-order eigenvectors localize very well and seem to reveal small geographically cohesive regions that match remarkably well with political and administrative boundaries. We discuss possible explanations for this observation by describing diffusion maps and localized eigenfunctions. In addition, we discuss a possible connection with the weighted graph cut problem, and provide numerical evidence supporting the idea that lower-order eigenvectors point out local cuts in the network. However, we do not provide a formal and rigorous justification for our observations.

The development of hub architecture in the human functional brain network.

PubMed

Hwang, Kai; Hallquist, Michael N; Luna, Beatriz

2013-10-01

Functional hubs are brain regions that play a crucial role in facilitating communication among parallel, distributed brain networks. The developmental emergence and stability of hubs, however, is not well understood. The current study used measures of network topology drawn from graph theory to investigate the development of functional hubs in 99 participants, 10-20 years of age. We found that hub architecture was evident in late childhood and was stable from adolescence to early adulthood. Connectivity between hub and non-hub ("spoke") regions, however, changed with development. From childhood to adolescence, the strength of connections between frontal hubs and cortical and subcortical spoke regions increased. From adolescence to adulthood, hub-spoke connections with frontal hubs were stable, whereas connectivity between cerebellar hubs and cortical spoke regions increased. Our findings suggest that a developmentally stable functional hub architecture provides the foundation of information flow in the brain, whereas connections between hubs and spokes continue to develop, possibly supporting mature cognitive function.

Numerical investigation of MHD flow with Soret and Dufour effect

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Nasir, Tehreem; Khan, Muhammad Ijaz; Alsaedi, Ahmed

2018-03-01

This paper describes the flow due to an exponentially curved surface subject to Soret and Dufour effects. Nonlinear velocity is considered. Exponentially curved stretchable sheet induced the flow. Fluid is electrical conducting through constant applied magnetic field. The governing flow expressions are reduced to ordinary ones and then tackled by numerical technique (Built-in-Shooting). Impacts of various flow variables on the dimensionless velocity, concentration and temperature fields are graphically presented and discussed in detail. Skin friction coefficient and Sherwood and Nusselt numbers are studied through graphs. Furthermore it is observed that Soret and Dufour variables regulate heat and mass transfer rates. It is also noteworthy that velocity decays for higher magnetic variable. Skin friction magnitude decays via curvature and magnetic variables. Also mass transfer gradient or rate of mass transport enhances for higher estimations of curvature parameter and Schmidt number.

Electric Current Flow Through Two-Dimensional Networks

NASA Astrophysics Data System (ADS)

Gaspard, Mallory

In modern nanotechnology, two-dimensional atomic network structures boast promising applications as nanoscale circuit boards to serve as the building blocks of more sustainable and efficient, electronic devices. However, properties associated with the network connectivity can be beneficial or deleterious to the current flow. Taking a computational approach, we will study large uniform networks, as well as large random networks using Kirchhoff's Equations in conjunction with graph theoretical measures of network connectedness and flows, to understand how network connectivity affects overall ability for successful current flow throughout a network. By understanding how connectedness affects flow, we may develop new ways to design more efficient two-dimensional materials for the next generation of nanoscale electronic devices, and we will gain a deeper insight into the intricate balance between order and chaos in the universe. Rensselaer Polytechnic Institute, SURP Institutional Grant.

Fully-automated segmentation of fluid regions in exudative age-related macular degeneration subjects: Kernel graph cut in neutrosophic domain

PubMed Central

Rashno, Abdolreza; Nazari, Behzad; Koozekanani, Dara D.; Drayna, Paul M.; Sadri, Saeed; Rabbani, Hossein

2017-01-01

A fully-automated method based on graph shortest path, graph cut and neutrosophic (NS) sets is presented for fluid segmentation in OCT volumes for exudative age related macular degeneration (EAMD) subjects. The proposed method includes three main steps: 1) The inner limiting membrane (ILM) and the retinal pigment epithelium (RPE) layers are segmented using proposed methods based on graph shortest path in NS domain. A flattened RPE boundary is calculated such that all three types of fluid regions, intra-retinal, sub-retinal and sub-RPE, are located above it. 2) Seed points for fluid (object) and tissue (background) are initialized for graph cut by the proposed automated method. 3) A new cost function is proposed in kernel space, and is minimized with max-flow/min-cut algorithms, leading to a binary segmentation. Important properties of the proposed steps are proven and quantitative performance of each step is analyzed separately. The proposed method is evaluated using a publicly available dataset referred as Optima and a local dataset from the UMN clinic. For fluid segmentation in 2D individual slices, the proposed method outperforms the previously proposed methods by 18%, 21% with respect to the dice coefficient and sensitivity, respectively, on the Optima dataset, and by 16%, 11% and 12% with respect to the dice coefficient, sensitivity and precision, respectively, on the local UMN dataset. Finally, for 3D fluid volume segmentation, the proposed method achieves true positive rate (TPR) and false positive rate (FPR) of 90% and 0.74%, respectively, with a correlation of 95% between automated and expert manual segmentations using linear regression analysis. PMID:29059257

An approach to multiscale modelling with graph grammars.

PubMed

Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried

2014-09-01

Functional-structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models.

An approach to multiscale modelling with graph grammars

PubMed Central

Ong, Yongzhi; Streit, Katarína; Henke, Michael; Kurth, Winfried

2014-01-01

Background and Aims Functional–structural plant models (FSPMs) simulate biological processes at different spatial scales. Methods exist for multiscale data representation and modification, but the advantages of using multiple scales in the dynamic aspects of FSPMs remain unclear. Results from multiscale models in various other areas of science that share fundamental modelling issues with FSPMs suggest that potential advantages do exist, and this study therefore aims to introduce an approach to multiscale modelling in FSPMs. Methods A three-part graph data structure and grammar is revisited, and presented with a conceptual framework for multiscale modelling. The framework is used for identifying roles, categorizing and describing scale-to-scale interactions, thus allowing alternative approaches to model development as opposed to correlation-based modelling at a single scale. Reverse information flow (from macro- to micro-scale) is catered for in the framework. The methods are implemented within the programming language XL. Key Results Three example models are implemented using the proposed multiscale graph model and framework. The first illustrates the fundamental usage of the graph data structure and grammar, the second uses probabilistic modelling for organs at the fine scale in order to derive crown growth, and the third combines multiscale plant topology with ozone trends and metabolic network simulations in order to model juvenile beech stands under exposure to a toxic trace gas. Conclusions The graph data structure supports data representation and grammar operations at multiple scales. The results demonstrate that multiscale modelling is a viable method in FSPM and an alternative to correlation-based modelling. Advantages and disadvantages of multiscale modelling are illustrated by comparisons with single-scale implementations, leading to motivations for further research in sensitivity analysis and run-time efficiency for these models. PMID:25134929

Automated intraretinal layer segmentation of optical coherence tomography images using graph-theoretical methods

NASA Astrophysics Data System (ADS)

Roy, Priyanka; Gholami, Peyman; Kuppuswamy Parthasarathy, Mohana; Zelek, John; Lakshminarayanan, Vasudevan

2018-02-01

Segmentation of spectral-domain Optical Coherence Tomography (SD-OCT) images facilitates visualization and quantification of sub-retinal layers for diagnosis of retinal pathologies. However, manual segmentation is subjective, expertise dependent, and time-consuming, which limits applicability of SD-OCT. Efforts are therefore being made to implement active-contours, artificial intelligence, and graph-search to automatically segment retinal layers with accuracy comparable to that of manual segmentation, to ease clinical decision-making. Although, low optical contrast, heavy speckle noise, and pathologies pose challenges to automated segmentation. Graph-based image segmentation approach stands out from the rest because of its ability to minimize the cost function while maximising the flow. This study has developed and implemented a shortest-path based graph-search algorithm for automated intraretinal layer segmentation of SD-OCT images. The algorithm estimates the minimal-weight path between two graph-nodes based on their gradients. Boundary position indices (BPI) are computed from the transition between pixel intensities. The mean difference between BPIs of two consecutive layers quantify individual layer thicknesses, which shows statistically insignificant differences when compared to a previous study [for overall retina: p = 0.17, for individual layers: p > 0.05 (except one layer: p = 0.04)]. These results substantiate the accurate delineation of seven intraretinal boundaries in SD-OCT images by this algorithm, with a mean computation time of 0.93 seconds (64-bit Windows10, core i5, 8GB RAM). Besides being self-reliant for denoising, the algorithm is further computationally optimized to restrict segmentation within the user defined region-of-interest. The efficiency and reliability of this algorithm, even in noisy image conditions, makes it clinically applicable.

Single-phase power distribution system power flow and fault analysis

NASA Technical Reports Server (NTRS)

Halpin, S. M.; Grigsby, L. L.

1992-01-01

Alternative methods for power flow and fault analysis of single-phase distribution systems are presented. The algorithms for both power flow and fault analysis utilize a generalized approach to network modeling. The generalized admittance matrix, formed using elements of linear graph theory, is an accurate network model for all possible single-phase network configurations. Unlike the standard nodal admittance matrix formulation algorithms, the generalized approach uses generalized component models for the transmission line and transformer. The standard assumption of a common node voltage reference point is not required to construct the generalized admittance matrix. Therefore, truly accurate simulation results can be obtained for networks that cannot be modeled using traditional techniques.

Data flow language and interpreter for a reconfigurable distributed data processor

DOE Office of Scientific and Technical Information (OSTI.GOV)

Hurt, A.D.; Heath, J.R.

1982-01-01

An analytic language and an interpreter whereby an applications data flow graph may serve as an input to a reconfigurable distributed data processor is proposed. The architecture considered consists of a number of loosely coupled computing elements (CES) which may be linked to data and file memories through fully nonblocking interconnect networks. The real-time performance of such an architecture depends upon its ability to alter its topology in response to changes in application, asynchronous data rates and faults. Such a data flow language enhances the versatility of a reconfigurable architecture by allowing the user to specify the machine's topology atmore » a very high level. 11 references.« less

Rotating flow of a nanofluid due to an exponentially stretching surface with suction

NASA Astrophysics Data System (ADS)

Salleh, Siti Nur Alwani; Bachok, Norfifah; Arifin, Norihan Md

2017-08-01

An analysis of the rotating nanofluid flow past an exponentially stretched surface with the presence of suction is studied in this work. Three different types of nanoparticles, namely, copper, titania and alumina are considered. The system of ordinary differential equations is computed numerically using a shooting method in Maple software after being transformed from the partial differential equations. This transformation has considered the similarity transformations in exponential form. The physical effect of the rotation, suction and nanoparticle volume fraction parameters on the rotating flow and heat transfer phenomena is investigated and has been described in detail through graphs. The dual solutions are found to appear when the governing parameters reach a certain range.

Automating Network Node Behavior Characterization by Mining Communication Patterns

DOE Office of Scientific and Technical Information (OSTI.GOV)

Carroll, Thomas E.; Chikkagoudar, Satish; Arthur-Durett, Kristine M.

Enterprise networks of scale are complex, dynamic computing environments that respond to evolv- ing business objectives and requirements. Characteriz- ing system behaviors in these environments is essential for network management and cyber security operations. Characterization of system’s communication is typical and is supported using network flow information (NetFlow). Related work has characterized behavior using theoretical graph metrics; results are often difficult to interpret by enterprise staff. We propose a different approach, where flow information is mapped to sets of tags that contextualize the data in terms of network principals and enterprise concepts. Frequent patterns are then extracted and are expressedmore » as behaviors. Behaviors can be com- pared, identifying systems expressing similar behaviors. We evaluate the approach using flow information collected by a third party.« less

Alignment of Tractograms As Graph Matching.

PubMed

Olivetti, Emanuele; Sharmin, Nusrat; Avesani, Paolo

2016-01-01

The white matter pathways of the brain can be reconstructed as 3D polylines, called streamlines, through the analysis of diffusion magnetic resonance imaging (dMRI) data. The whole set of streamlines is called tractogram and represents the structural connectome of the brain. In multiple applications, like group-analysis, segmentation, or atlasing, tractograms of different subjects need to be aligned. Typically, this is done with registration methods, that transform the tractograms in order to increase their similarity. In contrast with transformation-based registration methods, in this work we propose the concept of tractogram correspondence, whose aim is to find which streamline of one tractogram corresponds to which streamline in another tractogram, i.e., a map from one tractogram to another. As a further contribution, we propose to use the relational information of each streamline, i.e., its distances from the other streamlines in its own tractogram, as the building block to define the optimal correspondence. We provide an operational procedure to find the optimal correspondence through a combinatorial optimization problem and we discuss its similarity to the graph matching problem. In this work, we propose to represent tractograms as graphs and we adopt a recent inexact sub-graph matching algorithm to approximate the solution of the tractogram correspondence problem. On tractograms generated from the Human Connectome Project dataset, we report experimental evidence that tractogram correspondence, implemented as graph matching, provides much better alignment than affine registration and comparable if not better results than non-linear registration of volumes.

A Model of Network Porosity

DTIC Science & Technology

2016-11-09

the model does not become a full probabilistic attack graph analysis of the network , whose data requirements are currently unrealistic. The second...flow. – Untrustworthy persons may intentionally try to exfiltrate known sensitive data to ex- ternal networks . People may also unintentionally leak...section will provide details on the components, procedures, data requirements, and parameters required to instantiate the network porosity model. These

The infinitesimal operator for the semigroup of the Frobenius-Perron operator from image sequence data: vector fields and transport barriers from movies.

PubMed

Santitissadeekorn, N; Bollt, E M

2007-06-01

In this paper, we present an approach to approximate the Frobenius-Perron transfer operator from a sequence of time-ordered images, that is, a movie dataset. Unlike time-series data, successive images do not provide a direct access to a trajectory of a point in a phase space; more precisely, a pixel in an image plane. Therefore, we reconstruct the velocity field from image sequences based on the infinitesimal generator of the Frobenius-Perron operator. Moreover, we relate this problem to the well-known optical flow problem from the computer vision community and we validate the continuity equation derived from the infinitesimal operator as a constraint equation for the optical flow problem. Once the vector field and then a discrete transfer operator are found, then, in addition, we present a graph modularity method as a tool to discover basin structure in the phase space. Together with a tool to reconstruct a velocity field, this graph-based partition method provides us with a way to study transport behavior and other ergodic properties of measurable dynamical systems captured only through image sequences.

Flow and heat transfer in water based liquid film fluids dispensed with graphene nanoparticles

NASA Astrophysics Data System (ADS)

Zuhra, Samina; Khan, Noor Saeed; Khan, Muhammad Altaf; Islam, Saeed; Khan, Waris; Bonyah, Ebenezer

2018-03-01

The unsteady flow and heat transfer characteristics of electrically conducting water based thin liquid film non-Newtonian (Casson and Williamson) nanofluids dispensed with graphene nanoparticles past a stretching sheet are considered in the presence of transverse magnetic field and non-uniform heat source/sink. Embedding the graphene nanoparticles effectively amplifies the thermal conductivity of Casson and Williamson nanofluids. Ordinary differential equations together with the boundary conditions are obtained through similarity variables from the governing equations of the problem, which are solved by the HAM (Homotopy Analysis Method). The solution is expressed through graphs and illustrated which show the influences of all the parameters. The convergence of the HAM solution for the linear operators is obtained. Favorable comparison with previously published research paper is performed to show the correlation for the present work. Skin friction coefficient and Nusselt number are presented through Tables and graphs which show the validation for the achieved results demonstrating that the thin liquid films results from this study are in close agreement with the results reported in the literature. Results achieved by HAM and residual errors are evaluated numerically, given in Tables and also depicted graphically which show the accuracy of the present work.

Applications of graph theory to landscape genetics

PubMed Central

Garroway, Colin J; Bowman, Jeff; Carr, Denis; Wilson, Paul J

2008-01-01

We investigated the relationships among landscape quality, gene flow, and population genetic structure of fishers (Martes pennanti) in ON, Canada. We used graph theory as an analytical framework considering each landscape as a network node. The 34 nodes were connected by 93 edges. Network structure was characterized by a higher level of clustering than expected by chance, a short mean path length connecting all pairs of nodes, and a resiliency to the loss of highly connected nodes. This suggests that alleles can be efficiently spread through the system and that extirpations and conservative harvest are not likely to affect their spread. Two measures of node centrality were negatively related to both the proportion of immigrants in a node and node snow depth. This suggests that central nodes are producers of emigrants, contain high-quality habitat (i.e., deep snow can make locomotion energetically costly) and that fishers were migrating from high to low quality habitat. A method of community detection on networks delineated five genetic clusters of nodes suggesting cryptic population structure. Our analyses showed that network models can provide system-level insight into the process of gene flow with implications for understanding how landscape alterations might affect population fitness and evolutionary potential. PMID:25567802

Combinatorial compatibility as habit-controlling factor in lysozyme crystallization I. Monomeric and tetrameric F faces derived graph-theoretically

NASA Astrophysics Data System (ADS)

Strom, C. S.; Bennema, P.

1997-03-01

A series of two articles discusses possible morphological evidence for oligomerization of growth units in the crystallization of tetragonal lysozyme, based on a rigorous graph-theoretic derivation of the F faces. In the first study (Part I), the growth layers are derived as valid networks satisfying the conditions of F slices in the context of the PBC theory using the graph-theoretic method implemented in program FFACE [C.S. Strom, Z. Krist. 172 (1985) 11]. The analysis is performed in monomeric and alternative tetrameric and octameric formulations of the unit cell, assuming tetramer formation according to the strongest bonds. F (flat) slices with thickness Rdhkl ( {1}/{2} < R ≤ 1 ) are predicted theoretically in the forms 1 1 0, 0 1 1, 1 1 1. The relevant energies are established in the broken bond model. The relation between possible oligomeric specifications of the unit cell and combinatorially feasible F slice compositions in these orientations is explored.

Current-flow efficiency of networks

NASA Astrophysics Data System (ADS)

Liu, Kai; Yan, Xiaoyong

2018-02-01

Many real-world networks, from infrastructure networks to social and communication networks, can be formulated as flow networks. How to realistically measure the transport efficiency of these networks is of fundamental importance. The shortest-path-based efficiency measurement has limitations, as it assumes that flow travels only along those shortest paths. Here, we propose a new metric named current-flow efficiency, in which we calculate the average reciprocal effective resistance between all pairs of nodes in the network. This metric takes the multipath effect into consideration and is more suitable for measuring the efficiency of many real-world flow equilibrium networks. Moreover, this metric can handle a disconnected graph and can thus be used to identify critical nodes and edges from the efficiency-loss perspective. We further analyze how the topological structure affects the current-flow efficiency of networks based on some model and real-world networks. Our results enable a better understanding of flow networks and shed light on the design and improvement of such networks with higher transport efficiency.

Numerical study of magnetohydrodynamic pulsatile flow of Sutterby fluid through an inclined overlapping arterial stenosis in the presence of periodic body acceleration

NASA Astrophysics Data System (ADS)

Abbas, Z.; Shabbir, M. S.; Ali, N.

2018-06-01

In the present theoretical investigation, we have numerically simulated the problem of blood flow through an overlapping stenosed arterial blood vessel under the action of externally applied body acceleration and the periodic pressure gradient. The rheology of blood is characterized by the Sutterby fluid model. The blood is considered as an electrically conducting fluid. A steady uniform magnetic field is applied in the radial direction of the blood vessel. The governing nonlinear partial differential equations of the present flow together with prescribed boundary conditions are solved by employing explicit finite difference scheme. Results concerning the temporal distribution of velocity, flow rate, shear stress and resistance to the flow are displayed through graphs. The effects of various emerging parameters on the flow variables are analyzed and discussed in detail. The analysis reveals that the applied magnetic field and periodic body acceleration have considerable effects on the flow field.

Representation and display of vector field topology in fluid flow data sets

NASA Technical Reports Server (NTRS)

Helman, James; Hesselink, Lambertus

1989-01-01

The visualization of physical processes in general and of vector fields in particular is discussed. An approach to visualizing flow topology that is based on the physics and mathematics underlying the physical phenomenon is presented. It involves determining critical points in the flow where the velocity vector vanishes. The critical points, connected by principal lines or planes, determine the topology of the flow. The complexity of the data is reduced without sacrificing the quantitative nature of the data set. By reducing the original vector field to a set of critical points and their connections, a representation of the topology of a two-dimensional vector field that is much smaller than the original data set but retains with full precision the information pertinent to the flow topology is obtained. This representation can be displayed as a set of points and tangent curves or as a graph. Analysis (including algorithms), display, interaction, and implementation aspects are discussed.

Viscous dissipation and Joule heating effects in MHD 3D flow with heat and mass fluxes

NASA Astrophysics Data System (ADS)

Muhammad, Taseer; Hayat, Tasawar; Shehzad, Sabir Ali; Alsaedi, Ahmed

2018-03-01

The present research explores the three-dimensional stretched flow of viscous fluid in the presence of prescribed heat (PHF) and concentration (PCF) fluxes. Mathematical formulation is developed in the presence of chemical reaction, viscous dissipation and Joule heating effects. Fluid is electrically conducting in the presence of an applied magnetic field. Appropriate transformations yield the nonlinear ordinary differential systems. The resulting nonlinear system has been solved. Graphs are plotted to examine the impacts of physical parameters on the temperature and concentration distributions. Skin friction coefficients and local Nusselt and Sherwood numbers are computed and analyzed.

Numerical analysis of MHD Carreau fluid flow over a stretching cylinder with homogenous-heterogeneous reactions

NASA Astrophysics Data System (ADS)

Khan, Imad; Ullah, Shafquat; Malik, M. Y.; Hussain, Arif

2018-06-01

The current analysis concentrates on the numerical solution of MHD Carreau fluid flow over a stretching cylinder under the influences of homogeneous-heterogeneous reactions. Modelled non-linear partial differential equations are converted into ordinary differential equations by using suitable transformations. The resulting system of equations is solved with the aid of shooting algorithm supported by fifth order Runge-Kutta integration scheme. The impact of non-dimensional governing parameters on the velocity, temperature, skin friction coefficient and local Nusselt number are comprehensively delineated with the help of graphs and tables.

Three dimensional radiative flow of magnetite-nanofluid with homogeneous-heterogeneous reactions

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Rashid, Madiha; Alsaedi, Ahmed

2018-03-01

Present communication deals with the effects of homogeneous-heterogeneous reactions in flow of nanofluid by non-linear stretching sheet. Water based nanofluid containing magnetite nanoparticles is considered. Non-linear radiation and non-uniform heat sink/source effects are examined. Non-linear differential systems are computed by Optimal homotopy analysis method (OHAM). Convergent solutions of nonlinear systems are established. The optimal data of auxiliary variables is obtained. Impact of several non-dimensional parameters for velocity components, temperature and concentration fields are examined. Graphs are plotted for analysis of surface drag force and heat transfer rate.

Quantifying the role of woody debris in providing bioenergetically favorable habitat for juvenile salmon

NASA Astrophysics Data System (ADS)

Harrison, L.; Hafs, A. W.; Utz, R.; Dunne, T.

2013-12-01

The habitat complexity of a riverine ecosystem substantially influences aquatic communities, and especially the bioenergetics of drift feeding fish. We coupled hydrodynamic and bioenergetic models to assess the influence of habitat complexity, generated via large woody debris (LWD) additions, on juvenile Chinook salmon (Oncorhynchus tshawytscha) growth potential in a river that lacked large wood. Model simulations indicated that LWD diversified the flow field, creating pronounced velocity gradients, which enhanced fish feeding and resting activities at the micro-habitat (sub-meter) scale. Fluid drag created by individual wood structures was increased under higher wood loading rates, leading to a 5-19% reduction in the reach-averaged velocity. We found that wood loading was asymptotically related to the reach-scale growth potential, suggesting that the river became saturated with LWD and additional loading would produce minimal benefit. In our study reach, LWD additions could potentially quadruple the potential growth area available before that limit was reached. Wood depletion in the world's rivers has been widely documented, leading to widespread attempts by river managers to reverse this trend by adding wood to simplified aquatic habitats, though systematic prediction of the effects of wood on fish growth has not been previously accomplished. We offer a quantitative, theory-based approach for assessing the role of wood on habitat potential as it affects fish growth at the micro-habitat and reach-scales. Fig. 1. Predicted flow field and salmon growth potential maps produced from model simulations with no woody debris (Graphs A and D), a low density (Graphs B and E), and a high density (Graphs C and E) of woody debris.

The Specific Features of design and process engineering in branch of industrial enterprise

NASA Astrophysics Data System (ADS)

Sosedko, V. V.; Yanishevskaya, A. G.

2017-06-01

Production output of industrial enterprise is organized in debugged working mechanisms at each stage of product’s life cycle from initial design documentation to product and finishing it with utilization. The topic of article is mathematical model of the system design and process engineering in branch of the industrial enterprise, statistical processing of estimated implementation results of developed mathematical model in branch, and demonstration of advantages at application at this enterprise. During the creation of model a data flow about driving of information, orders, details and modules in branch of enterprise groups of divisions were classified. Proceeding from the analysis of divisions activity, a data flow, details and documents the state graph of design and process engineering was constructed, transitions were described and coefficients are appropriated. To each condition of system of the constructed state graph the corresponding limiting state probabilities were defined, and also Kolmogorov’s equations are worked out. When integration of sets of equations of Kolmogorov the state probability of system activity the specified divisions and production as function of time in each instant is defined. On the basis of developed mathematical model of uniform system of designing and process engineering and manufacture, and a state graph by authors statistical processing the application of mathematical model results was carried out, and also advantage at application at this enterprise is shown. Researches on studying of loading services probability of branch and third-party contractors (the orders received from branch within a month) were conducted. The developed mathematical model of system design and process engineering and manufacture can be applied to definition of activity state probability of divisions and manufacture as function of time in each instant that will allow to keep account of loading of performance of work in branches of the enterprise.

Functional Organization of the Action Observation Network in Autism: A Graph Theory Approach.

PubMed

Alaerts, Kaat; Geerlings, Franca; Herremans, Lynn; Swinnen, Stephan P; Verhoeven, Judith; Sunaert, Stefan; Wenderoth, Nicole

2015-01-01

The ability to recognize, understand and interpret other's actions and emotions has been linked to the mirror system or action-observation-network (AON). Although variations in these abilities are prevalent in the neuro-typical population, persons diagnosed with autism spectrum disorders (ASD) have deficits in the social domain and exhibit alterations in this neural network. Here, we examined functional network properties of the AON using graph theory measures and region-to-region functional connectivity analyses of resting-state fMRI-data from adolescents and young adults with ASD and typical controls (TC). Overall, our graph theory analyses provided convergent evidence that the network integrity of the AON is altered in ASD, and that reductions in network efficiency relate to reductions in overall network density (i.e., decreased overall connection strength). Compared to TC, individuals with ASD showed significant reductions in network efficiency and increased shortest path lengths and centrality. Importantly, when adjusting for overall differences in network density between ASD and TC groups, participants with ASD continued to display reductions in network integrity, suggesting that also network-level organizational properties of the AON are altered in ASD. While differences in empirical connectivity contributed to reductions in network integrity, graph theoretical analyses provided indications that also changes in the high-level network organization reduced integrity of the AON.

Fluvial reservoir characterization using topological descriptors based on spectral analysis of graphs

NASA Astrophysics Data System (ADS)

Viseur, Sophie; Chiaberge, Christophe; Rhomer, Jérémy; Audigane, Pascal

2015-04-01

Fluvial systems generate highly heterogeneous reservoir. These heterogeneities have major impact on fluid flow behaviors. However, the modelling of such reservoirs is mainly performed in under-constrained contexts as they include complex features, though only sparse and indirect data are available. Stochastic modeling is the common strategy to solve such problems. Multiple 3D models are generated from the available subsurface dataset. The generated models represent a sampling of plausible subsurface structure representations. From this model sampling, statistical analysis on targeted parameters (e.g.: reserve estimations, flow behaviors, etc.) and a posteriori uncertainties are performed to assess risks. However, on one hand, uncertainties may be huge, which requires many models to be generated for scanning the space of possibilities. On the other hand, some computations performed on the generated models are time consuming and cannot, in practice, be applied on all of them. This issue is particularly critical in: 1) geological modeling from outcrop data only, as these data types are generally sparse and mainly distributed in 2D at large scale but they may locally include high-resolution descriptions (e.g.: facies, strata local variability, etc.); 2) CO2 storage studies as many scales of investigations are required, from meter to regional ones, to estimate storage capacities and associated risks. Recent approaches propose to define distances between models to allow sophisticated multivariate statistics to be applied on the space of uncertainties so that only sub-samples, representative of initial set, are investigated for dynamic time-consuming studies. This work focuses on defining distances between models that characterize the topology of the reservoir rock network, i.e. its compactness or connectivity degree. The proposed strategy relies on the study of the reservoir rock skeleton. The skeleton of an object corresponds to its median feature. A skeleton is computed for each reservoir rock geobody and studied through a graph spectral analysis. To achieve this, the skeleton is converted into a graph structure. The spectral analysis applied on this graph structure allows a distance to be defined between pairs of graphs. Therefore, this distance is used as support for clustering analysis to gather models that share the same reservoir rock topology. To show the ability of the defined distances to discriminate different types of reservoir connectivity, a synthetic data set of fluvial models with different geological settings was generated and studied using the proposed approach. The results of the clustering analysis are shown and discussed.

Strawberry: Fast and accurate genome-guided transcript reconstruction and quantification from RNA-Seq.

PubMed

Liu, Ruolin; Dickerson, Julie

2017-11-01

We propose a novel method and software tool, Strawberry, for transcript reconstruction and quantification from RNA-Seq data under the guidance of genome alignment and independent of gene annotation. Strawberry consists of two modules: assembly and quantification. The novelty of Strawberry is that the two modules use different optimization frameworks but utilize the same data graph structure, which allows a highly efficient, expandable and accurate algorithm for dealing large data. The assembly module parses aligned reads into splicing graphs, and uses network flow algorithms to select the most likely transcripts. The quantification module uses a latent class model to assign read counts from the nodes of splicing graphs to transcripts. Strawberry simultaneously estimates the transcript abundances and corrects for sequencing bias through an EM algorithm. Based on simulations, Strawberry outperforms Cufflinks and StringTie in terms of both assembly and quantification accuracies. Under the evaluation of a real data set, the estimated transcript expression by Strawberry has the highest correlation with Nanostring probe counts, an independent experiment measure for transcript expression. Strawberry is written in C++14, and is available as open source software at https://github.com/ruolin/strawberry under the MIT license.

Thermal diffusion effect on MHD mixed convective flow along a vertically inclined plate: A casson fluid flow

NASA Astrophysics Data System (ADS)

Prasad, D. V. V. Krishna; Chaitanya, G. S. Krishna; Raju, R. Srinivasa

2018-05-01

The nature of Casson fluid on MHD free convective flow of over an impulsively started infinite vertically inclined plate in presence of thermal diffusion (Soret), thermal radiation, heat and mass transfer effects is studied. The basic governing nonlinear coupled partial differential equations are solved numerically using finite element method. The relevant physical parameters appearing in velocity, temperature and concentration profiles are analyzed and discussed through graphs. Finally, the results for velocity profiles and the reduced Nusselt and Sherwood numbers are obtained and compared with previous results in the literature and are found to be in excellent agreement. Applications of the present study would be useful in magnetic material processing and chemical engineering systems.

Temperature distribution in the Cerro Prieto geothermal field

DOE Office of Scientific and Technical Information (OSTI.GOV)

Castillo B, F.; Bermejo M, F.J.; Domiguez A, B.

1981-01-01

A series of temperature and pressure logs and flow rate measurements was compiled for each of the geothermal wells drilled to different reservoir depths between October 1979 and December 1980. Based on the valuable information obtained, a series of graphs showing the thermal characteristics of the reservoir were prepared. These graphs clearly show the temperature distribution resulting from the movement of fluids from the deep regions toward the higher zones of the reservoir, thus establishing more reliable parameters for locating new wells with better production zones. Updated information based on data from new deep wells drilled in the geothermal fieldmore » is presented here. This new information does not differ much from earlier estimates and theories. However, the influence of faulting and fracturing on the hydrothermal recharge of the geothermal reservoir is seen more clearly.« less

Rotating flow of carbon nanotube over a stretching surface in the presence of magnetic field: a comparative study

NASA Astrophysics Data System (ADS)

Acharya, Nilankush; Das, Kalidas; Kundu, Prabir Kumar

2018-04-01

In this piece of writing, we have demonstrated the rotating flow of carbon nanotube passing over a stretching sheet. Two types of carbon nanotube, i.e. single-wall carbon nanotube (SWCNT) and multi-wall carbon nanotube, (MWCNT) have been employed to illustrate the fine points of the flow. Suitable transformations have been consumed to construct its non-dimensional appearance from the partial ones. Transformed forms of equations have been sketched out by RK-4 procedure. Outcomes of the key flow factors on velocity along with temperature outline have been exemplified through tables and graphs, and scrutinized from the sensible judgement. Our investigation authenticates that the temperature of the fluid enhances owing to the improvisation of rotation parameter. Nusselt number goes down with the authority of magnetic parameter.

Combined effects of suction/injection and wall surface curvature on natural convection flow in a vertical micro-porous annulus

NASA Astrophysics Data System (ADS)

Jha, B. K.; Aina, B.; Muhammad, S. A.

2015-03-01

This study investigates analytically the hydrodynamic and thermal behaviour of a fully developed natural convection flow in a vertical micro-porous-annulus (MPA) taking into account the velocity slip and temperature jump at the outer surface of inner porous cylinder and inner surface of outer porous cylinder. A closed — form solution is presented for velocity, temperature, volume flow rate, skin friction and rate of heat transfer expressed as a Nusselt number. The influence of each governing parameter on hydrodynamic and thermal behaviour is discussed with the aid of graphs. During the course of investigation, it is found that as suction/injection on the cylinder walls increases, the fluid velocity and temperature is enhanced. In addition, it is observed that wall surface curvature has a significant effect on flow and thermal characteristics.

On the formalization of multi-scale and multi-science processes for integrative biology

PubMed Central

Díaz-Zuccarini, Vanessa; Pichardo-Almarza, César

2011-01-01

The aim of this work is to introduce the general concept of ‘Bond Graph’ (BG) techniques applied in the context of multi-physics and multi-scale processes. BG modelling has a natural place in these developments. BGs are inherently coherent as the relationships defined between the ‘elements’ of the graph are strictly defined by causality rules and power (energy) conservation. BGs clearly show how power flows between components of the systems they represent. The ‘effort’ and ‘flow’ variables enable bidirectional information flow in the BG model. When the power level of a system is low, BGs degenerate into signal flow graphs in which information is mainly one-dimensional and power is minimal, i.e. they find a natural limitation when dealing with populations of individuals or purely kinetic models, as the concept of energy conservation in these systems is no longer relevant. The aim of this work is twofold: on the one hand, we will introduce the general concept of BG techniques applied in the context of multi-science and multi-scale models and, on the other hand, we will highlight some of the most promising features in the BG methodology by comparing with examples developed using well-established modelling techniques/software that could suggest developments or refinements to the current state-of-the-art tools, by providing a consistent framework from a structural and energetic point of view. PMID:22670211

Monitoring pulmonary function with superimposed pulmonary gas exchange curves from standard analyzers.

PubMed

Zar, Harvey A; Noe, Frances E; Szalados, James E; Goodrich, Michael D; Busby, Michael G

2002-01-01

A repetitive graphic display of the single breath pulmonary function can indicate changes in cardiac and pulmonary physiology brought on by clinical events. Parallel advances in computer technology and monitoring make real-time, single breath pulmonary function clinically practicable. We describe a system built from a commercially available airway gas monitor and off the shelf computer and data-acquisition hardware. Analog data for gas flow rate, O2, and CO2 concentrations are introduced into a computer through an analog-to-digital conversion board. Oxygen uptake (VO2) and carbon dioxide output (VCO2) are calculated for each breath. Inspired minus expired concentrations for O2 and CO2 are displayed simultaneously with the expired gas flow rate curve for each breath. Dead-space and alveolar ventilation are calculated for each breath and readily appreciated from the display. Graphs illustrating the function of the system are presented for the following clinical scenarios; upper airway obstruction, bronchospasm, bronchopleural fistula, pulmonary perfusion changes and inadequate oxygen delivery. This paper describes a real-time, single breath pulmonary monitoring system that displays three parameters graphed against time: expired flow rate, oxygen uptake and carbon dioxide production. This system allows for early and rapid recognition of treatable conditions that may lead to adverse events without any additional patient measurements or invasive procedures. Monitoring systems similar to the one described in this paper may lead to a higher level of patient safety without any additional patient risk.

River Flow Advisory Commission: Snow Survey

Science.gov Websites

Survey River Watch Home → Snow Survey RFAC Information About Us Reports Maine Cooperative Snow Survey About the Snow Survey Snow Survey Map Compare Snow Survey Data Snow Survey Graphs River Watch MEMA Home USGS (Maine) Home Maine Cooperative Snow Survey This information is provided by a partnership with

Las Matematicas: Lenguaje Universal. Nivel 1: Numeros y Numeracion (Mathematics: A Universal Language. Level 1: Numbers and Numeration).

ERIC Educational Resources Information Center

Dissemination and Assessment Center for Bilingual Education, Austin, TX.

This is one of a series of student booklets designed for use in a bilingual mathematics program in grades 6-8. The general format is to present each page in both Spanish and English. The mathematical topics in this booklet include graphing on a number line, place value, using exponents, flow charts, and Roman numerals. (MK)

Airport-Noise Levels and Annoyance Model (ALAMO) system's reference manual

NASA Technical Reports Server (NTRS)

Deloach, R.; Donaldson, J. L.; Johnson, M. J.

1986-01-01

The airport-noise levels and annoyance model (ALAMO) is described in terms of the constituent modules, the execution of ALAMO procedure files, necessary for system execution, and the source code documentation associated with code development at Langley Research Center. The modules constituting ALAMO are presented both in flow graph form, and through a description of the subroutines and functions that comprise them.

Area-Efficient Graph Layouts (for VLSI).

DTIC Science & Technology

1980-08-13

thle short side, then no rectangle is ew r generated x’.ho se aspect r~itho i s \\orse di ai aJ. ’I lie d i % ide-I mid -cimq tier clInt ruolIn in... Sutherland and Donald Oestrcichcr, "flow big should a printed circuit board be?," ILEEE, Transactions on Computers, Vol. C-22, May 1973, pp. 537-542. 22

[Characterization of access to normal childbirth care in Bahia State, Brazil, based on graph theory].

PubMed

Sousa, Ludmilla Monfort Oliveira; Araújo, Edna Maria de; Miranda, José Garcia Vivas

2017-12-18

Origin-destination flow is a phenomenon that can be modeled as a network. Graph theory is a mathematical tool to characterize a network and thus allows studying the topological properties and temporal and spatial development of a set of related elements. The article aims to estimate the topological evolution of an inter-municipal network of normal deliveries. We selected the admissions for normal deliveries in the Hospital Information System of the Brazilian Unified National Health System, from 2008 to 2014, for women residing in Bahia State, Brazil. The following indices were applied: entry degree (from how many municipalities the women came for childbirth), exit degree (to how many municipalities they left), entry flow (how many women came), exit flow (how many women left), and the mean size of the exit edge (distance traveled). Analyses between macro-regions used the following indicators: proportion of normal deliveries performed outside the municipality of residence and mean size of the exit edge. The results indicate an increase in deliveries performed outside the municipality of residence, in addition to the persistence of concentration of deliveries in the hub municipalities in the Health Regions, and an increase in the distance between the municipality of residence and the municipality where the delivery took place. The organization of networks for normal childbirth poses an on-going challenge. It is important to analyze the flow of women for childbirth care in order to support the establishment of inter-municipal references to guarantee safe labor and childbirth. In conclusion, it is necessary to develop a regionalized network to meet the demand by pregnant women in the territory with universal and equitable coverage.

Diffusion thermo effects on unsteady MHD free convection flow of a Kuvshinski fluid past a vertical porous plate in slip flow regime

NASA Astrophysics Data System (ADS)

Narsu, Sivakumar; Rushi Kumar, B.

2017-11-01

The main purpose of this work is to investigate the diffusion-thermo effects on unsteady combined convection magneto-hydromagnetic boundary layer flow of viscous electrically conducting and chemically reacting fluid over a vertical permeable radiated plate embedded in a highly porous medium. The slip flow regime is applied at the porous interface a uniform magnetic field is applied normal to the fluid flow direction which absorbs the fluid with suction that varies with time. The dimensionless governing equations are solved analytically using two terms harmonic and non-harmonic functions. The expressions for the fields of velocity, temperature and concentration are obtained. For engineering interest we also calculated the physical quantities the skin friction coefficient, Nusselt and Sherwood number are derived. The effects of various physical parameters on the flow quantities are studied through graphs and tables. For the validity, we have checked our results with previously published work and found good agreement with already existing studies.

SWToolbox: A surface-water tool-box for statistical analysis of streamflow time series

USGS Publications Warehouse

Kiang, Julie E.; Flynn, Kate; Zhai, Tong; Hummel, Paul; Granato, Gregory

2018-03-07

This report is a user guide for the low-flow analysis methods provided with version 1.0 of the Surface Water Toolbox (SWToolbox) computer program. The software combines functionality from two software programs—U.S. Geological Survey (USGS) SWSTAT and U.S. Environmental Protection Agency (EPA) DFLOW. Both of these programs have been used primarily for computation of critical low-flow statistics. The main analysis methods are the computation of hydrologic frequency statistics such as the 7-day minimum flow that occurs on average only once every 10 years (7Q10), computation of design flows including biologically based flows, and computation of flow-duration curves and duration hydrographs. Other annual, monthly, and seasonal statistics can also be computed. The interface facilitates retrieval of streamflow discharge data from the USGS National Water Information System and outputs text reports for a record of the analysis. Tools for graphing data and screening tests are available to assist the analyst in conducting the analysis.

Identification of individual coherent sets associated with flow trajectories using coherent structure coloring

NASA Astrophysics Data System (ADS)

Schlueter-Kuck, Kristy L.; Dabiri, John O.

2017-09-01

We present a method for identifying the coherent structures associated with individual Lagrangian flow trajectories even where only sparse particle trajectory data are available. The method, based on techniques in spectral graph theory, uses the Coherent Structure Coloring vector and associated eigenvectors to analyze the distance in higher-dimensional eigenspace between a selected reference trajectory and other tracer trajectories in the flow. By analyzing this distance metric in a hierarchical clustering, the coherent structure of which the reference particle is a member can be identified. This algorithm is proven successful in identifying coherent structures of varying complexities in canonical unsteady flows. Additionally, the method is able to assess the relative coherence of the associated structure in comparison to the surrounding flow. Although the method is demonstrated here in the context of fluid flow kinematics, the generality of the approach allows for its potential application to other unsupervised clustering problems in dynamical systems such as neuronal activity, gene expression, or social networks.

Transition of basaltic lava from pahoehoe to aa, Kilauea Volcano, Hawaii: Field observations and key factors

USGS Publications Warehouse

Peterson, Donald W.; Tilling, Robert I.

1980-01-01

Nearly all Hawaiian basaltic lava erupts as pahoehoe, and some changes to aa during flowage and cooling; factors governing the transition involve certain critical relations between viscosity and rate of shear strain. If the lava slows, cools, and stops in direct response to concomitant increase in viscosity before these critical relations are reached, it remains pahoehoe. But, if flow mechanics (flow rate, flow dimensions, slope, momentum, etc.) impel the lava to continue to move and deform even after it has become highly viscous, the critical relations may be reached and the lava changes to aa.Typical modes of transition from pahoehoe to aa include: (1) spontaneous formation of relatively stiff clots in parts of the flowing lava where shear rate is highest; these clots grow into discrete, rough, sticky masses to which the remaining fluid lava incrementally adheres; (2) fragmentation and immersion of solid or semi-solid surface crusts of pahoehoe by roiling movements of the flow, forming cores of discrete, tacky masses; (3) sudden renewed movement of lava stored and cooled within surface reservoirs to form clots. The masses, fragments, and clots in these transition modes are characterized by spinose, granulated surfaces; as flow movement continues, the masses and fragments aggregate, fracture, and grind together, completing the transition to aa.Observations show that the critical relation between viscosity and rate of shear strain is inverse: if viscosity is low, a high rate of shear is required to begin the transition to aa; conversely, if viscosity is high, a much lower rate of shear will induce the transition. These relations can be demonstrated qualitatively with simple graphs, which can be used to examine the flow history of any selected finite lava element by tracing the path represented by its changing viscosity and shear rate. A broad, diffuse “transition threshold zone” in these graphs portrays the inverse critical relation between viscosity and shear rate; the transition to aa is represented by the path of the lava element crossing this zone.Moving lava flows can be regarded as natural viscometers, by which shear stress and rate of shear strain at selected points can be determined and viscosity can be computed. By making such determinations under a wide range of conditions on pahoehoe, aa, and transitional flow types, the critical relations that control the pahoehoe-aa transition can be quantified.

The Development of the Ciliary Epithelium in the Embryonic Chicken Eye

DTIC Science & Technology

1989-08-04

aqueous humor, which nourishes the avascular tissues in the anterior segment and generates intraocular pressure (IOP). IOP is the pressure contained...lightly stained. At higher magnification, tissue necrosis is evident in the central region. (60x). j 168 Figure 44. Graph of the labelling index

A Graph Oriented Approach for Network Forensic Analysis

ERIC Educational Resources Information Center

Wang, Wei

2010-01-01

Network forensic analysis is a process that analyzes intrusion evidence captured from networked environment to identify suspicious entities and stepwise actions in an attack scenario. Unfortunately, the overwhelming amount and low quality of output from security sensors make it difficult for analysts to obtain a succinct high-level view of complex…

The Graph Choice Chart

ERIC Educational Resources Information Center

Webber, Hannah; Nelson, Sarah J.; Weatherbee, Ryan; Zoellick, Bill; Schauffler, Molly

2014-01-01

Data literacy is complex. When students investigate the natural world, they must be able to gather data, organize it in tables and spreadsheets, analyze it in context, and describe and interpret it--usually as evidence to support a scientific argument. These skills are echoed in the science and engineering practices of the "Next Generation…

Interactions between Financial and Environmental Networks in OECD Countries.

PubMed

Ruzzenenti, Franco; Joseph, Andreas; Ticci, Elisa; Vozzella, Pietro; Gabbi, Giampaolo

2015-01-01

We analysed a multiplex of financial and environmental networks between OECD countries from 2002 to 2010. Foreign direct investments and portfolio investment showing the flows in equity securities, short-term, long-term and total debt, these securities represent the financial layers; emissions of NOx, PM10, SO2, CO2 equivalent and the water footprint associated with international trade represent the environmental layers. We present a new measure of cross-layer correlations between flows in different layers based on reciprocity. For the assessment of results, we implement a null model for this measure based on the exponential random graph theory. We find that short-term financial flows are more correlated with environmental flows than long-term investments. Moreover, the correlations between reverse financial and environmental flows (i.e. the flows of different layers going in opposite directions) are generally stronger than correlations between synergic flows (flows going in the same direction). This suggests a trade-off between financial and environmental layers, where, more financialised countries display higher correlations between outgoing financial flows and incoming environmental flows than from lower financialised countries. Five countries are identified as hubs in this finance-environment multiplex: The United States, France, Germany, Belgium-Luxembourg and United Kingdom.

Interactions between Financial and Environmental Networks in OECD Countries

PubMed Central

Ruzzenenti, Franco; Joseph, Andreas; Ticci, Elisa; Vozzella, Pietro; Gabbi, Giampaolo

2015-01-01

We analysed a multiplex of financial and environmental networks between OECD countries from 2002 to 2010. Foreign direct investments and portfolio investment showing the flows in equity securities, short-term, long-term and total debt, these securities represent the financial layers; emissions of NO x, PM10, SO 2, CO 2 equivalent and the water footprint associated with international trade represent the environmental layers. We present a new measure of cross-layer correlations between flows in different layers based on reciprocity. For the assessment of results, we implement a null model for this measure based on the exponential random graph theory. We find that short-term financial flows are more correlated with environmental flows than long-term investments. Moreover, the correlations between reverse financial and environmental flows (i.e. the flows of different layers going in opposite directions) are generally stronger than correlations between synergic flows (flows going in the same direction). This suggests a trade-off between financial and environmental layers, where, more financialised countries display higher correlations between outgoing financial flows and incoming environmental flows than from lower financialised countries. Five countries are identified as hubs in this finance-environment multiplex: The United States, France, Germany, Belgium-Luxembourg and United Kingdom. PMID:26375393

Transverse thermopherotic MHD Oldroyd-B fluid with Newtonian heating

NASA Astrophysics Data System (ADS)

Mehmood, R.; Rana, S.; Nadeem, S.

2018-03-01

Hydromagnetic transverse flow of an Oldroyd-B type fluid with suspension of nanoparticles and Newtonian heating effects is conferred in this article. Relaxation and Retardation time effects are taken into consideration. Using suitable transformations physical problem is converted into non-linear ordinary differential equations which are tackled numerically via Runge-Kutta Fehlberg integration scheme. Illustration of embedded constraints on flow characteristics are extracted through graphs. The physical response of velocity, temperature and concentration are investigated computationally. Momentum boundary layer thickness decreases but local heat and mass flux rises for Deborah number and Hartman number. The results provide interesting insights into certain applicable transport phenomena involving hydromagnetic rheological fluids.

Modeling MHD Stagnation Point Flow of Thixotropic Fluid with Non-uniform Heat Absorption/Generation

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Shah, Faisal; Khan, Muhammad Ijaz; Alsaedi, Ahmed; Yasmeen, Tabassum

2017-12-01

Here magnetohydrodynamic (MHD) stagnation point flow by nonlinear stretching sheet is discussed. Variable thickness of sheet is accounted. In addition non-uniform heat generation/absorption concept is retained. Numerical treatment to arising nonlinear system is presented. Shooting procedure is adopted for numerical treatment. Graphs and tables lead to physical description of results. It is observed that skin friction enhances for ( H a) and it decays for different rising values of ( K 1), ( K 2) and ( n). Further temperature gradient increases for higher estimation of (Pr) and decreases for larger ( H a). Major findings of present analysis are presented.

Hydrogen recombiner catalyst test supporting data

DOE Office of Scientific and Technical Information (OSTI.GOV)

Britton, M.D.

1995-01-19

This is a data package supporting the Hydrogen Recombiner Catalyst Performance and Carbon Monoxide Sorption Capacity Test Report, WHC-SD-WM-TRP-211, Rev 0. This report contains 10 appendices which consist of the following: Mass spectrometer analysis reports: HRC samples 93-001 through 93-157; Gas spectrometry analysis reports: HRC samples 93-141 through 93-658; Mass spectrometer procedure PNL-MA-299 ALO-284; Alternate analytical method for ammonia and water vapor; Sample log sheets; Job Safety analysis; Certificate of mixture analysis for feed gases; Flow controller calibration check; Westinghouse Standards Laboratory report on Bois flow calibrator; and Sorption capacity test data, tables, and graphs.

Interaction of nanoparticles for the peristaltic flow in an asymmetric channel with the induced magnetic field

NASA Astrophysics Data System (ADS)

Akbar, Noreen Sher; Raza, M.; Ellahi, R.

2014-07-01

In the present investigation, we examined the interaction of nanoparticle copper with the base fluid water in an asymmetric channel in the presence of an induced magnetic field. The complexity of equations describing the flow of the nanofluid is reduced by applying the low-Reynolds number and long-wavelength approximations. The resulting equations are solved exactly. The obtained expressions for the velocity and temperature phenomenon are sketched in graphs. The resulting relations for pressure gradient and pressure rise are plotted for various pertinent parameters. The streamlines are drawn for some physical quantities to discuss the trapping phenomenon.

Simulator for concurrent processing data flow architectures

NASA Technical Reports Server (NTRS)

Malekpour, Mahyar R.; Stoughton, John W.; Mielke, Roland R.

1992-01-01

A software simulator capability of simulating execution of an algorithm graph on a given system under the Algorithm to Architecture Mapping Model (ATAMM) rules is presented. ATAMM is capable of modeling the execution of large-grained algorithms on distributed data flow architectures. Investigating the behavior and determining the performance of an ATAMM based system requires the aid of software tools. The ATAMM Simulator presented is capable of determining the performance of a system without having to build a hardware prototype. Case studies are performed on four algorithms to demonstrate the capabilities of the ATAMM Simulator. Simulated results are shown to be comparable to the experimental results of the Advanced Development Model System.

Reconstructing multi-mode networks from multivariate time series

NASA Astrophysics Data System (ADS)

Gao, Zhong-Ke; Yang, Yu-Xuan; Dang, Wei-Dong; Cai, Qing; Wang, Zhen; Marwan, Norbert; Boccaletti, Stefano; Kurths, Jürgen

2017-09-01

Unveiling the dynamics hidden in multivariate time series is a task of the utmost importance in a broad variety of areas in physics. We here propose a method that leads to the construction of a novel functional network, a multi-mode weighted graph combined with an empirical mode decomposition, and to the realization of multi-information fusion of multivariate time series. The method is illustrated in a couple of successful applications (a multi-phase flow and an epileptic electro-encephalogram), which demonstrate its powerfulness in revealing the dynamical behaviors underlying the transitions of different flow patterns, and enabling to differentiate brain states of seizure and non-seizure.

Recent developments in rotary-wing aerodynamic theory

NASA Technical Reports Server (NTRS)

Johnson, W.

1986-01-01

Current progress in the computational analysis of rotary-wing flowfields is surveyed, and some typical results are presented in graphs. Topics examined include potential theory, rotating coordinate systems, lifting-surface theory (moving singularity, fixed wing, and rotary wing), panel methods (surface singularity representations, integral equations, and compressible flows), transonic theory (the small-disturbance equation), wake analysis (hovering rotor-wake models and transonic blade-vortex interaction), limitations on computational aerodynamics, and viscous-flow methods (dynamic-stall theories and lifting-line theory). It is suggested that the present algorithms and advanced computers make it possible to begin working toward the ultimate goal of turbulent Navier-Stokes calculations for an entire rotorcraft.

A comparison of multiprocessor scheduling methods for iterative data flow architectures

NASA Technical Reports Server (NTRS)

Storch, Matthew

1993-01-01

A comparative study is made between the Algorithm to Architecture Mapping Model (ATAMM) and three other related multiprocessing models from the published literature. The primary focus of all four models is the non-preemptive scheduling of large-grain iterative data flow graphs as required in real-time systems, control applications, signal processing, and pipelined computations. Important characteristics of the models such as injection control, dynamic assignment, multiple node instantiations, static optimum unfolding, range-chart guided scheduling, and mathematical optimization are identified. The models from the literature are compared with the ATAMM for performance, scheduling methods, memory requirements, and complexity of scheduling and design procedures.

Spectral analysis and slow spreading dynamics on complex networks.

PubMed

Odor, Géza

2013-09-01

The susceptible-infected-susceptible (SIS) model is one of the simplest memoryless systems for describing information or epidemic spreading phenomena with competing creation and spontaneous annihilation reactions. The effect of quenched disorder on the dynamical behavior has recently been compared to quenched mean-field (QMF) approximations in scale-free networks. QMF can take into account topological heterogeneity and clustering effects of the activity in the steady state by spectral decomposition analysis of the adjacency matrix. Therefore, it can provide predictions on possible rare-region effects, thus on the occurrence of slow dynamics. I compare QMF results of SIS with simulations on various large dimensional graphs. In particular, I show that for Erdős-Rényi graphs this method predicts correctly the occurrence of rare-region effects. It also provides a good estimate for the epidemic threshold in case of percolating graphs. Griffiths Phases emerge if the graph is fragmented or if we apply a strong, exponentially suppressing weighting scheme on the edges. The latter model describes the connection time distributions in the face-to-face experiments. In case of a generalized Barabási-Albert type of network with aging connections, strong rare-region effects and numerical evidence for Griffiths Phase dynamics are shown. The dynamical simulation results agree well with the predictions of the spectral analysis applied for the weighted adjacency matrices.

Functional Organization of the Action Observation Network in Autism: A Graph Theory Approach

PubMed Central

Alaerts, Kaat; Geerlings, Franca; Herremans, Lynn; Swinnen, Stephan P.; Verhoeven, Judith; Sunaert, Stefan; Wenderoth, Nicole

2015-01-01

Background The ability to recognize, understand and interpret other’s actions and emotions has been linked to the mirror system or action-observation-network (AON). Although variations in these abilities are prevalent in the neuro-typical population, persons diagnosed with autism spectrum disorders (ASD) have deficits in the social domain and exhibit alterations in this neural network. Method Here, we examined functional network properties of the AON using graph theory measures and region-to-region functional connectivity analyses of resting-state fMRI-data from adolescents and young adults with ASD and typical controls (TC). Results Overall, our graph theory analyses provided convergent evidence that the network integrity of the AON is altered in ASD, and that reductions in network efficiency relate to reductions in overall network density (i.e., decreased overall connection strength). Compared to TC, individuals with ASD showed significant reductions in network efficiency and increased shortest path lengths and centrality. Importantly, when adjusting for overall differences in network density between ASD and TC groups, participants with ASD continued to display reductions in network integrity, suggesting that also network-level organizational properties of the AON are altered in ASD. Conclusion While differences in empirical connectivity contributed to reductions in network integrity, graph theoretical analyses provided indications that also changes in the high-level network organization reduced integrity of the AON. PMID:26317222

SAR-based change detection using hypothesis testing and Markov random field modelling

NASA Astrophysics Data System (ADS)

Cao, W.; Martinis, S.

2015-04-01

The objective of this study is to automatically detect changed areas caused by natural disasters from bi-temporal co-registered and calibrated TerraSAR-X data. The technique in this paper consists of two steps: Firstly, an automatic coarse detection step is applied based on a statistical hypothesis test for initializing the classification. The original analytical formula as proposed in the constant false alarm rate (CFAR) edge detector is reviewed and rewritten in a compact form of the incomplete beta function, which is a builtin routine in commercial scientific software such as MATLAB and IDL. Secondly, a post-classification step is introduced to optimize the noisy classification result in the previous step. Generally, an optimization problem can be formulated as a Markov random field (MRF) on which the quality of a classification is measured by an energy function. The optimal classification based on the MRF is related to the lowest energy value. Previous studies provide methods for the optimization problem using MRFs, such as the iterated conditional modes (ICM) algorithm. Recently, a novel algorithm was presented based on graph-cut theory. This method transforms a MRF to an equivalent graph and solves the optimization problem by a max-flow/min-cut algorithm on the graph. In this study this graph-cut algorithm is applied iteratively to improve the coarse classification. At each iteration the parameters of the energy function for the current classification are set by the logarithmic probability density function (PDF). The relevant parameters are estimated by the method of logarithmic cumulants (MoLC). Experiments are performed using two flood events in Germany and Australia in 2011 and a forest fire on La Palma in 2009 using pre- and post-event TerraSAR-X data. The results show convincing coarse classifications and considerable improvement by the graph-cut post-classification step.

Double stratification effects in chemically reactive squeezed Sutterby fluid flow with thermal radiation and mixed convection

NASA Astrophysics Data System (ADS)

Ahmad, S.; Farooq, M.; Javed, M.; Anjum, Aisha

2018-03-01

A current analysis is carried out to study theoretically the mixed convection characteristics in squeezing flow of Sutterby fluid in squeezed channel. The constitutive equation of Sutterby model is utilized to characterize the rheology of squeezing phenomenon. Flow characteristics are explored with dual stratification. In flowing fluid which contains heat and mass transport, the first order chemical reaction and radiative heat flux affect the transport phenomenon. The systems of non-linear governing equations have been modulating which then solved by mean of convergent approach (Homotopy Analysis Method). The graphs are reported and illustrated for emerging parameters. Through graphical explanations, drag force, rate of heat and mass transport are conversed for different pertinent parameters. It is found that heat and mass transport rate decays with dominant double stratified parameters and chemical reaction parameter. The present two-dimensional examination is applicable in some of the engineering processes and industrial fluid mechanics.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme ismore » unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.« less

Multifarious slips perception on unsteady Casson nanofluid flow impinging on a stretching cylinder in the presence of solar radiation

NASA Astrophysics Data System (ADS)

Kundu, Prabir Kumar; Sarkar, Amit

2017-03-01

In the present work, a study is prepared for unsteady axisymmetric Casson-type nanofluid flow as a result of a contracting impermeable cylinder under the influence of solar radiation. The model of multifarious slip is included. The governing system of equations takes the form of non-linear ODEs by employing appropriate transformation and then resolve it numerically by RK-Fehlberg scheme in Maple 18 symbolic software. The effects of leading parameters on the flow characteristics are presented through tables and graphs coupled with necessary discussion and physical insinuation. Strong effects of various slip parameters on the physical quantities of interest are found here. The upsurge of surface slip is spotted to boost up temperature profile whereas it slows the flow down. However, thermal slip conducts to drop the temperature but enhancing the heat transfer rate.

Flow and Force Equations for a Body Revolving in a Fluid

NASA Technical Reports Server (NTRS)

Zahm, A. F.

1979-01-01

A general method for finding the steady flow velocity relative to a body in plane curvilinear motion, whence the pressure is found by Bernoulli's energy principle is described. Integration of the pressure supplies basic formulas for the zonal forces and moments on the revolving body. The application of the steady flow method for calculating the velocity and pressure at all points of the flow inside and outside an ellipsoid and some of its limiting forms is presented and graphs those quantities for the latter forms. In some useful cases experimental pressures are plotted for comparison with theoretical. The pressure, and thence the zonal force and moment, on hulls in plane curvilinear flight are calculated. General equations for the resultant fluid forces and moments on trisymmetrical bodies moving through a perfect fluid are derived. Formulas for potential coefficients and inertia coefficients for an ellipsoid and its limiting forms are presented.

Optimization of memory use of fragment extension-based protein-ligand docking with an original fast minimum cost flow algorithm.

PubMed

Yanagisawa, Keisuke; Komine, Shunta; Kubota, Rikuto; Ohue, Masahito; Akiyama, Yutaka

2018-06-01

The need to accelerate large-scale protein-ligand docking in virtual screening against a huge compound database led researchers to propose a strategy that entails memorizing the evaluation result of the partial structure of a compound and reusing it to evaluate other compounds. However, the previous method required frequent disk accesses, resulting in insufficient acceleration. Thus, more efficient memory usage can be expected to lead to further acceleration, and optimal memory usage could be achieved by solving the minimum cost flow problem. In this research, we propose a fast algorithm for the minimum cost flow problem utilizing the characteristics of the graph generated for this problem as constraints. The proposed algorithm, which optimized memory usage, was approximately seven times faster compared to existing minimum cost flow algorithms. Copyright © 2018 The Authors. Published by Elsevier Ltd.. All rights reserved.

Tumor evolutionary directed graphs and the history of chronic lymphocytic leukemia.

PubMed

Wang, Jiguang; Khiabanian, Hossein; Rossi, Davide; Fabbri, Giulia; Gattei, Valter; Forconi, Francesco; Laurenti, Luca; Marasca, Roberto; Del Poeta, Giovanni; Foà, Robin; Pasqualucci, Laura; Gaidano, Gianluca; Rabadan, Raul

2014-12-11

Cancer is a clonal evolutionary process, caused by successive accumulation of genetic alterations providing milestones of tumor initiation, progression, dissemination, and/or resistance to certain therapeutic regimes. To unravel these milestones we propose a framework, tumor evolutionary directed graphs (TEDG), which is able to characterize the history of genetic alterations by integrating longitudinal and cross-sectional genomic data. We applied TEDG to a chronic lymphocytic leukemia (CLL) cohort of 70 patients spanning 12 years and show that: (a) the evolution of CLL follows a time-ordered process represented as a global flow in TEDG that proceeds from initiating events to late events; (b) there are two distinct and mutually exclusive evolutionary paths of CLL evolution; (c) higher fitness clones are present in later stages of the disease, indicating a progressive clonal replacement with more aggressive clones. Our results suggest that TEDG may constitute an effective framework to recapitulate the evolutionary history of tumors.

Efficient parallel architecture for highly coupled real-time linear system applications

NASA Technical Reports Server (NTRS)

Carroll, Chester C.; Homaifar, Abdollah; Barua, Soumavo

1988-01-01

A systematic procedure is developed for exploiting the parallel constructs of computation in a highly coupled, linear system application. An overall top-down design approach is adopted. Differential equations governing the application under consideration are partitioned into subtasks on the basis of a data flow analysis. The interconnected task units constitute a task graph which has to be computed in every update interval. Multiprocessing concepts utilizing parallel integration algorithms are then applied for efficient task graph execution. A simple scheduling routine is developed to handle task allocation while in the multiprocessor mode. Results of simulation and scheduling are compared on the basis of standard performance indices. Processor timing diagrams are developed on the basis of program output accruing to an optimal set of processors. Basic architectural attributes for implementing the system are discussed together with suggestions for processing element design. Emphasis is placed on flexible architectures capable of accommodating widely varying application specifics.

Cliques of Neurons Bound into Cavities Provide a Missing Link between Structure and Function.

PubMed

Reimann, Michael W; Nolte, Max; Scolamiero, Martina; Turner, Katharine; Perin, Rodrigo; Chindemi, Giuseppe; Dłotko, Paweł; Levi, Ran; Hess, Kathryn; Markram, Henry

2017-01-01

The lack of a formal link between neural network structure and its emergent function has hampered our understanding of how the brain processes information. We have now come closer to describing such a link by taking the direction of synaptic transmission into account, constructing graphs of a network that reflect the direction of information flow, and analyzing these directed graphs using algebraic topology. Applying this approach to a local network of neurons in the neocortex revealed a remarkably intricate and previously unseen topology of synaptic connectivity. The synaptic network contains an abundance of cliques of neurons bound into cavities that guide the emergence of correlated activity. In response to stimuli, correlated activity binds synaptically connected neurons into functional cliques and cavities that evolve in a stereotypical sequence toward peak complexity. We propose that the brain processes stimuli by forming increasingly complex functional cliques and cavities.

Partial slip effect in the flow of MHD micropolar nanofluid flow due to a rotating disk - A numerical approach

NASA Astrophysics Data System (ADS)

Ramzan, Muhammad; Chung, Jae Dong; Ullah, Naeem

The aim of present exploration is to study the flow of micropolar nanofluid due to a rotating disk in the presence of magnetic field and partial slip condition. The governing coupled partial differential equations are reduced to nonlinear ordinary differential equations using appropriate transformations. The differential equations are solved numerically by using Maple dsolve command with option numeric which utilize Runge-Kutta fourth-fifth order Fehlberg technique. A comparison to previous study is also added to validate the present results. Moreover, behavior of different parameters on velocity, microrotation, temperature and concentration of nanofluid are presented via graphs and tables. It is noted that the slip effect and magnetic field decay the velocity and microrotation or spin component.

Three-dimensional flow of Prandtl fluid with Cattaneo-Christov double diffusion

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Aziz, Arsalan; Muhammad, Taseer; Alsaedi, Ahmed

2018-06-01

This research paper intends to investigate the 3D flow of Prandtl liquid in the existence of improved heat conduction and mass diffusion models. Flow is created by considering linearly bidirectional stretchable sheet. Thermal and concentration diffusions are considered by employing Cattaneo-Christov double diffusion models. Boundary layer approach has been used to simplify the governing PDEs. Suitable nondimensional similarity variables correspond to strong nonlinear ODEs. Optimal homotopy analysis method (OHAM) is employed for solutions development. The role of various pertinent variables on temperature and concentration are analyzed through graphs. The physical quantities such as surface drag coefficients and heat and mass transfer rates at the wall are also plotted and discussed. Our results indicate that the temperature and concentration are decreasing functions of thermal and concentration relaxation parameters respectively.

A Numerical Study of Coupled Non-Linear Equations of Thermo-Viscous Fluid Flow in Cylindrical Geometry

NASA Astrophysics Data System (ADS)

Pothanna, N.; Aparna, P.; Gorla, R. S. R.

2017-12-01

In this paper we present numerical solutions to coupled non-linear governing equations of thermo-viscous fluid flow in cylindrical geometry using MATHEMATICA software solver. The numerical results are presented in terms of velocity, temperature and pressure distribution for various values of the material parameters such as the thermo-mechanical stress coefficient, thermal conductivity coefficient, Reiner Rivlin cross viscosity coefficient and the Prandtl number in the form of tables and graphs. Also, the solutions to governing equations for slow steady motion of a fluid have been obtained numerically and compared with the existing analytical results and are found to be in excellent agreement. The results of the present study will hopefully enable a better understanding applications of the flow under consideration.

Mild traumatic brain injury: graph-model characterization of brain networks for episodic memory.

PubMed

Tsirka, Vasso; Simos, Panagiotis G; Vakis, Antonios; Kanatsouli, Kassiani; Vourkas, Michael; Erimaki, Sofia; Pachou, Ellie; Stam, Cornelis Jan; Micheloyannis, Sifis

2011-02-01

Episodic memory is among the cognitive functions that can be affected in the acute phase following mild traumatic brain injury (MTBI). The present study used EEG recordings to evaluate global synchronization and network organization of rhythmic activity during the encoding and recognition phases of an episodic memory task varying in stimulus type (kaleidoscope images, pictures, words, and pseudowords). Synchronization of oscillatory activity was assessed using a linear and nonlinear connectivity estimator and network analyses were performed using algorithms derived from graph theory. Twenty five MTBI patients (tested within days post-injury) and healthy volunteers were closely matched on demographic variables, verbal ability, psychological status variables, as well as on overall task performance. Patients demonstrated sub-optimal network organization, as reflected by changes in graph parameters in the theta and alpha bands during both encoding and recognition. There were no group differences in spectral energy during task performance or on network parameters during a control condition (rest). Evidence of less optimally organized functional networks during memory tasks was more prominent for pictorial than for verbal stimuli. Copyright © 2010 Elsevier B.V. All rights reserved.

Evolution of worldwide stock markets, correlation structure, and correlation-based graphs

NASA Astrophysics Data System (ADS)

Song, Dong-Ming; Tumminello, Michele; Zhou, Wei-Xing; Mantegna, Rosario N.

2011-08-01

We investigate the daily correlation present among market indices of stock exchanges located all over the world in the time period January 1996 to July 2009. We discover that the correlation among market indices presents both a fast and a slow dynamics. The slow dynamics reflects the development and consolidation of globalization. The fast dynamics is associated with critical events that originate in a specific country or region of the world and rapidly affect the global system. We provide evidence that the short term time scale of correlation among market indices is less than 3 trading months (about 60 trading days). The average values of the nondiagonal elements of the correlation matrix, correlation-based graphs, and the spectral properties of the largest eigenvalues and eigenvectors of the correlation matrix are carrying information about the fast and slow dynamics of the correlation of market indices. We introduce a measure of mutual information based on link co-occurrence in networks in order to detect the fast dynamics of successive changes of correlation-based graphs in a quantitative way.

Spectral mapping of brain functional connectivity from diffusion imaging.

PubMed

Becker, Cassiano O; Pequito, Sérgio; Pappas, George J; Miller, Michael B; Grafton, Scott T; Bassett, Danielle S; Preciado, Victor M

2018-01-23

Understanding the relationship between the dynamics of neural processes and the anatomical substrate of the brain is a central question in neuroscience. On the one hand, modern neuroimaging technologies, such as diffusion tensor imaging, can be used to construct structural graphs representing the architecture of white matter streamlines linking cortical and subcortical structures. On the other hand, temporal patterns of neural activity can be used to construct functional graphs representing temporal correlations between brain regions. Although some studies provide evidence that whole-brain functional connectivity is shaped by the underlying anatomy, the observed relationship between function and structure is weak, and the rules by which anatomy constrains brain dynamics remain elusive. In this article, we introduce a methodology to map the functional connectivity of a subject at rest from his or her structural graph. Using our methodology, we are able to systematically account for the role of structural walks in the formation of functional correlations. Furthermore, in our empirical evaluations, we observe that the eigenmodes of the mapped functional connectivity are associated with activity patterns associated with different cognitive systems.

Missile aerodynamics

NASA Technical Reports Server (NTRS)

Nielsen, Jack N.

1988-01-01

The fundamental aerodynamics of slender bodies is examined in the reprint edition of an introductory textbook originally published in 1960. Chapters are devoted to the formulas commonly used in missile aerodynamics; slender-body theory at supersonic and subsonic speeds; vortices in viscid and inviscid flow; wing-body interference; downwash, sidewash, and the wake; wing-tail interference; aerodynamic controls; pressure foredrag, base drag, and skin friction; and stability derivatives. Diagrams, graphs, tables of terms and formulas are provided.

Bedload and Total Load Sediment Transport Equations for Rough Open-Channel Flow

NASA Astrophysics Data System (ADS)

Abrahams, A. D.; Gao, P.

2001-12-01

The total sediment load transported by an open-channel flow may be divided into bedload and suspended load. Bedload transport occurs by saltation at low shear stress and by sheetflow at high shear stress. Dimensional analysis is used to identify the dimensionless variables that control the transport rate of noncohesive sediments over a plane bed, and regression analysis is employed to isolate the significant variables and determine the values of the coefficients. In the general bedload transport equation (i.e. for saltation and sheetflow) the dimensionless bedload transport rate is a function of the dimensionless shear stress, the friction factor, and an efficiency coefficient. For sheetflow the last term approaches 1, so that the bedload transport rate becomes a function of just the dimensionless shear stress and the friction factor. The dimensional analysis indicates that the dimensionless total load transport rate is a function of the dimensionless bedload transport rate and the dimensionless settling velocity of the sediment. Predicted values of the transport rates are graphed against the computed values of these variables for 505 flume experiments reported in the literature. These graphs indicate that the equations developed in this study give good unbiased predictions of both the bedload transport rate and total load transport rate over a wide range of conditions.

A Selectivity based approach to Continuous Pattern Detection in Streaming Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Choudhury, Sutanay; Holder, Larry; Chin, George

2015-05-27

Cyber security is one of the most significant technical challenges in current times. Detecting adversarial activities, prevention of theft of intellectual properties and customer data is a high priority for corporations and government agencies around the world. Cyber defenders need to analyze massive-scale, high-resolution network flows to identify, categorize, and mitigate attacks involving networks spanning institutional and national boundaries. Many of the cyber attacks can be described as subgraph patterns, with prominent examples being insider infiltrations (path queries), denial of service (parallel paths) and malicious spreads (tree queries). This motivates us to explore subgraph matching on streaming graphs in amore » continuous setting. The novelty of our work lies in using the subgraph distributional statistics collected from the streaming graph to determine the query processing strategy. We introduce a ``Lazy Search" algorithm where the search strategy is decided on a vertex-to-vertex basis depending on the likelihood of a match in the vertex neighborhood. We also propose a metric named ``Relative Selectivity" that is used to select between different query processing strategies. Our experiments performed on real online news, network traffic stream and a synthetic social network benchmark demonstrate 10-100x speedups over non-incremental, selectivity agnostic approaches.« less

Min-cut segmentation of cursive handwriting in tabular documents

NASA Astrophysics Data System (ADS)

Davis, Brian L.; Barrett, William A.; Swingle, Scott D.

2015-01-01

Handwritten tabular documents, such as census, birth, death and marriage records, contain a wealth of information vital to genealogical and related research. Much work has been done in segmenting freeform handwriting, however, segmentation of cursive handwriting in tabular documents is still an unsolved problem. Tabular documents present unique segmentation challenges caused by handwriting overlapping cell-boundaries and other words, both horizontally and vertically, as "ascenders" and "descenders" overlap into adjacent cells. This paper presents a method for segmenting handwriting in tabular documents using a min-cut/max-flow algorithm on a graph formed from a distance map and connected components of handwriting. Specifically, we focus on line, word and first letter segmentation. Additionally, we include the angles of strokes of the handwriting as a third dimension to our graph to enable the resulting segments to share pixels of overlapping letters. Word segmentation accuracy is 89.5% evaluating lines of the data set used in the ICDAR2013 Handwriting Segmentation Contest. Accuracy is 92.6% for a specific application of segmenting first and last names from noisy census records. Accuracy for segmenting lines of names from noisy census records is 80.7%. The 3D graph cutting shows promise in segmenting overlapping letters, although highly convoluted or overlapping handwriting remains an ongoing challenge.

Operator splitting method for simulation of dynamic flows in natural gas pipeline networks

DOE PAGES

Dyachenko, Sergey A.; Zlotnik, Anatoly; Korotkevich, Alexander O.; ...

2017-09-19

Here, we develop an operator splitting method to simulate flows of isothermal compressible natural gas over transmission pipelines. The method solves a system of nonlinear hyperbolic partial differential equations (PDEs) of hydrodynamic type for mass flow and pressure on a metric graph, where turbulent losses of momentum are modeled by phenomenological Darcy-Weisbach friction. Mass flow balance is maintained through the boundary conditions at the network nodes, where natural gas is injected or withdrawn from the system. Gas flow through the network is controlled by compressors boosting pressure at the inlet of the adjoint pipe. Our operator splitting numerical scheme ismore » unconditionally stable and it is second order accurate in space and time. The scheme is explicit, and it is formulated to work with general networks with loops. We test the scheme over range of regimes and network configurations, also comparing its performance with performance of two other state of the art implicit schemes.« less

Unsteady free convection flow of viscous fluids with analytical results by employing time-fractional Caputo-Fabrizio derivative (without singular kernel)

NASA Astrophysics Data System (ADS)

Ali Shah, Nehad; Mahsud, Yasir; Ali Zafar, Azhar

2017-10-01

This article introduces a theoretical study for unsteady free convection flow of an incompressible viscous fluid. The fluid flows near an isothermal vertical plate. The plate has a translational motion with time-dependent velocity. The equations governing the fluid flow are expressed in fractional differential equations by using a newly defined time-fractional Caputo-Fabrizio derivative without singular kernel. Explicit solutions for velocity, temperature and solute concentration are obtained by applying the Laplace transform technique. As the fractional parameter approaches to one, solutions for the ordinary fluid model are extracted from the general solutions of the fractional model. The results showed that, for the fractional model, the obtained solutions for velocity, temperature and concentration exhibit stationary jumps discontinuity across the plane at t=0 , while the solutions are continuous functions in the case of the ordinary model. Finally, numerical results for flow features at small-time are illustrated through graphs for various pertinent parameters.

Stefan blowing effects on MHD bioconvection flow of a nanofluid in the presence of gyrotactic microorganisms with active and passive nanoparticles flux

NASA Astrophysics Data System (ADS)

Giri, Shib Sankar; Das, Kalidas; Kundu, Prabir Kumar

2017-02-01

The present paper investigates the effect of Stefan blowing on the hydro-magnetic bioconvection of a water-based nanofluid flow containing gyrotactic microorganisms through a permeable surface. Also we studied both actively and passively the controlled flux of nanoparticles and the effect of a surface slip at the wall. We adopt a similarity approach to reduce the leading partial differential equations into ordinary differential equations along with two separate boundary conditions (active and passive) and solve the resulting equations numerically by employing the RK-4 method through the shooting technique to perform the flow analysis. Discussions on the effect of emerging flow parameter on the flow characteristic are made properly through graphs and charts. We observed that the effects of the traditional Lewis number and suction/blowing parameter on temperature distribution and microorganism concentration are converse to each other. A fair result comparison of the present paper with formerly obtained results is given.

Two-phase magnetoconvection flow of magnetite (Fe3O4) nanoparticles in a horizontal composite porous annulus

NASA Astrophysics Data System (ADS)

Abbas, Zaheer; Hasnain, Jafar

A numerical study is performed to examine the two-phase magnetoconvection and heat transfer phenomena of Fe3O4 -kerosene nanofluid flow in a horizontal composite porous annulus with an external magnetic field. The annulus is filled with immiscible fluids flowing between two concentric cylinders. The governing equations of the flow problem are obtained using Darcy-Brinkman model. Heat transfer is analyzed in the presence of viscous and Darcian dissipation terms. The shooting method is used as a tool to solve the obtained non-linear ordinary differential equations for the velocity and temperature profiles. The velocity and temperature distributions are analyzed and discussed under the influence of involved flow parameters with the aid of graphs. It is found that both velocity and temperature of fluid are decreased with ferroparticle volume fraction. In addition to that, it is also presented that the existence of magnetic field decreases the benefit of ferrofluids in heat transfer progression.

Statistical summaries of streamflow data for selected gaging stations on and near the Idaho National Engineering Laboratory, Idaho, through September 1990

USGS Publications Warehouse

Stone, M.A.J.; Mann, Larry J.; Kjelstrom, L.C.

1993-01-01

Statistical summaries and graphs of streamflow data were prepared for 13 gaging stations with 5 or more years of continuous record on and near the Idaho National Engineering Laboratory. Statistical summaries of streamflow data for the Big and Little Lost Rivers and Birch Creek were analyzed as a requisite for a comprehensive evaluation of the potential for flooding of facilities at the Idaho National Engineering Laboratory. The type of statistical analyses performed depended on the length of streamflow record for a gaging station. Streamflow statistics generated for stations with 5 to 9 years of record were: (1) magnitudes of monthly and annual flows; (2) duration of daily mean flows; and (3) maximum, median, and minimum daily mean flows. Streamflow statistics generated for stations with 10 or more years of record were: (1) magnitudes of monthly and annual flows; (2) magnitudes and frequencies of daily low, high, instantaneous peak (flood frequency), and annual mean flows; (3) duration of daily mean flows; (4) exceedance probabilities of annual low, high, instantaneous peak, and mean annual flows; (5) maximum, median, and minimum daily mean flows; and (6) annual mean and mean annual flows.

Couple Graph Based Label Propagation Method for Hyperspectral Remote Sensing Data Classification

NASA Astrophysics Data System (ADS)

Wang, X. P.; Hu, Y.; Chen, J.

2018-04-01

Graph based semi-supervised classification method are widely used for hyperspectral image classification. We present a couple graph based label propagation method, which contains both the adjacency graph and the similar graph. We propose to construct the similar graph by using the similar probability, which utilize the label similarity among examples probably. The adjacency graph was utilized by a common manifold learning method, which has effective improve the classification accuracy of hyperspectral data. The experiments indicate that the couple graph Laplacian which unite both the adjacency graph and the similar graph, produce superior classification results than other manifold Learning based graph Laplacian and Sparse representation based graph Laplacian in label propagation framework.

Multi-Centrality Graph Spectral Decompositions and Their Application to Cyber Intrusion Detection

DOE Office of Scientific and Technical Information (OSTI.GOV)

Chen, Pin-Yu; Choudhury, Sutanay; Hero, Alfred

Many modern datasets can be represented as graphs and hence spectral decompositions such as graph principal component analysis (PCA) can be useful. Distinct from previous graph decomposition approaches based on subspace projection of a single topological feature, e.g., the centered graph adjacency matrix (graph Laplacian), we propose spectral decomposition approaches to graph PCA and graph dictionary learning that integrate multiple features, including graph walk statistics, centrality measures and graph distances to reference nodes. In this paper we propose a new PCA method for single graph analysis, called multi-centrality graph PCA (MC-GPCA), and a new dictionary learning method for ensembles ofmore » graphs, called multi-centrality graph dictionary learning (MC-GDL), both based on spectral decomposition of multi-centrality matrices. As an application to cyber intrusion detection, MC-GPCA can be an effective indicator of anomalous connectivity pattern and MC-GDL can provide discriminative basis for attack classification.« less

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

Kepner, Jeremy; Bader, David; Buluç, Aydın; ...

2015-01-01

The analysis of graphs has become increasingly important to a wide range of applications. Graph analysis presents a number of unique challenges in the areas of (1) software complexity, (2) data complexity, (3) security, (4) mathematical complexity, (5) theoretical analysis, (6) serial performance, and (7) parallel performance. Implementing graph algorithms using matrix-based approaches provides a number of promising solutions to these challenges. The GraphBLAS standard (istcbigdata.org/GraphBlas) is being developed to bring the potential of matrix based graph algorithms to the broadest possible audience. The GraphBLAS mathematically defines a core set of matrix-based graph operations that can be used to implementmore » a wide class of graph algorithms in a wide range of programming environments. This paper provides an introduction to the GraphBLAS and describes how the GraphBLAS can be used to address many of the challenges associated with analysis of graphs.« less

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid.

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

Measuring protein structural similarity attempts to establish a relationship of equivalence between polymer structures based on their conformations. In several recent studies, researchers have explored protein-graph remodeling, instead of looking a minimum superimposition for pairwise proteins. When graphs are used to represent structured objects, the problem of measuring object similarity become one of computing the similarity between graphs. Graph theory provides an alternative perspective as well as efficiency. Once a protein graph has been created, its structural stability must be verified. Therefore, a criterion is needed to determine if a protein graph can be used for structural comparison. In this paper, we propose a measurement for protein graph remodeling based on graph entropy. We extend the concept of graph entropy to determine whether a graph is suitable for representing a protein. The experimental results suggest that when applied, graph entropy helps a conformational on protein graph modeling. Furthermore, it indirectly contributes to protein structural comparison if a protein graph is solid. PMID:25474347

Scaling of Topologically Similar Functional Modules Defines Mouse Primary Auditory and Somatosensory Microcircuitry

PubMed Central

Sadovsky, Alexander J.

2013-01-01

Mapping the flow of activity through neocortical microcircuits provides key insights into the underlying circuit architecture. Using a comparative analysis we determined the extent to which the dynamics of microcircuits in mouse primary somatosensory barrel field (S1BF) and auditory (A1) neocortex generalize. We imaged the simultaneous dynamics of up to 1126 neurons spanning multiple columns and layers using high-speed multiphoton imaging. The temporal progression and reliability of reactivation of circuit events in both regions suggested common underlying cortical design features. We used circuit activity flow to generate functional connectivity maps, or graphs, to test the microcircuit hypothesis within a functional framework. S1BF and A1 present a useful test of the postulate as both regions map sensory input anatomically, but each area appears organized according to different design principles. We projected the functional topologies into anatomical space and found benchmarks of organization that had been previously described using physiology and anatomical methods, consistent with a close mapping between anatomy and functional dynamics. By comparing graphs representing activity flow we found that each region is similarly organized as highlighted by hallmarks of small world, scale free, and hierarchical modular topologies. Models of prototypical functional circuits from each area of cortex were sufficient to recapitulate experimentally observed circuit activity. Convergence to common behavior by these models was accomplished using preferential attachment to scale from an auditory up to a somatosensory circuit. These functional data imply that the microcircuit hypothesis be framed as scalable principles of neocortical circuit design. PMID:23986241

Iowa's Tech Prep Model: Issues/Model Components/"Patterns of Evidence." Revised.

ERIC Educational Resources Information Center

North Iowa Area Community Coll., Mason City.

Developed by the Iowa Department of Education, North Iowa Area Community College, and Hawkeye Community College (Iowa), this booklet presents the tech prep model for articulation efforts among all educational entities, business, industry, labor, and communities in Iowa. Following a list of committee members working on the model and graphs of the…

Plate Tectonics: The Way the Earth Works. Teacher's Guide. LHS GEMS.

ERIC Educational Resources Information Center

Cuff, Kevin

This teacher guide presents a unit on plate tectonics and introduces hands-on activities for students in grades 6-8. In each unit, students act as real scientists and gather evidence by using science process skills such as observing, graphing, analyzing data, designing and making models, visualizing, communicating, theorizing, and drawing…

Traumatic brain injury impairs small-world topology

PubMed Central

Pandit, Anand S.; Expert, Paul; Lambiotte, Renaud; Bonnelle, Valerie; Leech, Robert; Turkheimer, Federico E.

2013-01-01

Objective: We test the hypothesis that brain networks associated with cognitive function shift away from a “small-world” organization following traumatic brain injury (TBI). Methods: We investigated 20 TBI patients and 21 age-matched controls. Resting-state functional MRI was used to study functional connectivity. Graph theoretical analysis was then applied to partial correlation matrices derived from these data. The presence of white matter damage was quantified using diffusion tensor imaging. Results: Patients showed characteristic cognitive impairments as well as evidence of damage to white matter tracts. Compared to controls, the graph analysis showed reduced overall connectivity, longer average path lengths, and reduced network efficiency. A particular impact of TBI is seen on a major network hub, the posterior cingulate cortex. Taken together, these results confirm that a network critical to cognitive function shows a shift away from small-world characteristics. Conclusions: We provide evidence that key brain networks involved in supporting cognitive function become less small-world in their organization after TBI. This is likely to be the result of diffuse white matter damage, and may be an important factor in producing cognitive impairment after TBI. PMID:23596068

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

Math . to appear. [G2] Golumbic,. Martin C., D. Rotem and J. Urrutia. "Comparability graphs and intersection graphs" Discrete Math . 43 (1983) 37-40. [G3...intersection classes of graphs" Discrete Math . to appear. [S2] Scheinerman, Edward R. Intersection Classes and Multiple Intersection Parameters of Graphs...graphs and of interval graphs" Canad. Jour. of blath. 16 (1964) 539-548. [G1] Golumbic, Martin C. "Containment graphs: and. intersection graphs" Discrete

Software Testing for Evolutionary Iterative Rapid Prototyping

DTIC Science & Technology

1990-12-01

kept later hours than I did. Amidst the hustle and bustle, their prayers and help around the house were a great ast.. Finally, if anything shows the...possible meanings. A basic dictionary definition describes prototyping as "an original type , form, or instance that serves as a modfe] on which later...on program size. Asset instruments 49 the subject procedure and produces a graph of the structure for the type of data flow testing conducted. It

A dynamic model of Flo-Tron flowmeters

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cichy, M.; Bossio, R.B.

1984-08-01

The optimization of diagnostic equipment for reciprocating both internal and external combustion engines are deeply affected by suitability of simulation models. One of the most attractive and difficult diagnostic aspect deals with the fuel instantaneous mass flow rate measurement. A new model of the dynamic simulation of the Flo-Tron flowmeter, whose working principle is based on the hydraulic Wheatstone's bridge is then presented, dealing with the state space equations and bond-graph method.

Shuttle cryogenic supply system optimization study. Volume 2: Technical report, sections 4 through 9

NASA Technical Reports Server (NTRS)

1973-01-01

The design and development of cryogenic supply systems for space shuttle vehicles are discussed. The weights, component counts, and statements of advantages and disadvantages of the systems considered are presented. Performance characteristics of the systems are analyzed in the form of graphs. Block diagrams and engineering drawings of the candidate systems are provided. Special consideration is given to flow rates and thermodynamic properties of the cryogenic systems.

Topological Patterns for Scalable Representation and Analysis of Dataflow Graphs

DTIC Science & Technology

2011-11-01

dimensional mesh structure. Such a structure is of particular use to model DSP architectures in which data flows across a network of processing elements...ACSSC.1998.751616 3. Andrews, J.G., Ghosh, A., Muhamed, R.: Fundamentals of WiMAX: understanding broad- band wireless networking . Prentice Hall (2007... SECURITY CLASSIFICATION OF: 17. LIMITATION OF ABSTRACT Same as Report (SAR) 18. NUMBER OF PAGES 23 19a. NAME OF RESPONSIBLE PERSON a. REPORT

The Quiescent-Chamber Type Compression-Ignition Engine

NASA Technical Reports Server (NTRS)

Foster, H H

1937-01-01

Report presents the results of performance tests of a single-cylinder 4-stroke-cycle compression-ignition engine having a vertical disk form of combustion chamber without air flow. The number, size, and direction of the orifices of the fuel-injection nozzles used were independently varied. A table and graphs are presented showing the performance of the engine with different nozzles; results of tests at different compression ratios, boost pressures, and coolant temperatures are also included.

A Collection of Features for Semantic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Eliassi-Rad, T; Fodor, I K; Gallagher, B

2007-05-02

Semantic graphs are commonly used to represent data from one or more data sources. Such graphs extend traditional graphs by imposing types on both nodes and links. This type information defines permissible links among specified nodes and can be represented as a graph commonly referred to as an ontology or schema graph. Figure 1 depicts an ontology graph for data from National Association of Securities Dealers. Each node type and link type may also have a list of attributes. To capture the increased complexity of semantic graphs, concepts derived for standard graphs have to be extended. This document explains brieflymore » features commonly used to characterize graphs, and their extensions to semantic graphs. This document is divided into two sections. Section 2 contains the feature descriptions for static graphs. Section 3 extends the features for semantic graphs that vary over time.« less

Cellular automata model for urban road traffic flow considering pedestrian crossing street

NASA Astrophysics Data System (ADS)

Zhao, Han-Tao; Yang, Shuo; Chen, Xiao-Xu

2016-11-01

In order to analyze the effect of pedestrians' crossing street on vehicle flows, we investigated traffic characteristics of vehicles and pedestrians. Based on that, rules of lane changing, acceleration, deceleration, randomization and update are modified. Then we established two urban two-lane cellular automata models of traffic flow, one of which is about sections with non-signalized crosswalk and the other is on uncontrolled sections with pedestrians crossing street at random. MATLAB is used for numerical simulation of the different traffic conditions; meanwhile space-time diagram and relational graphs of traffic flow parameters are generated and then comparatively analyzed. Simulation results indicate that when vehicle density is lower than around 25 vehs/(km lane), pedestrians have modest impact on traffic flow, whereas when vehicle density is higher than about 60 vehs/(km lane), traffic speed and volume will decrease significantly especially on sections with non-signal-controlled crosswalk. The results illustrate that the proposed models reconstruct the traffic flow's characteristic with the situation where there are pedestrians crossing and can provide some practical reference for urban traffic management.

Diffusion of chemically reactive species in MHD oscillatory flow with thermal radiation in the presence of constant suction and injection

NASA Astrophysics Data System (ADS)

Sasikumar, J.; Bhuvaneshwari, S.; Govindarajan, A.

2018-04-01

In this project, it is proposed to investigate the effect of suction/injection on the unsteady oscillatory flow of an incompressible viscous electrically conducting fluid through a channel filled with porous medium and non-uniform wall temperature. The fluid is subjected to a uniform magnetic field normal to the channel and the velocity slip at the cold plate is taken into consideration. With the assumption of magnetic Reynolds number to be very small, the induced magnetic field is neglected. Assuming pressure gradient to be oscillatory across the ends of the channel, resulting flow as unsteady oscillatory flow. Under the usual Bousinessq approximation, a mathematical model representing this fluid flow consisting of governing equations with boundary conditions will be developed. Closed form solutions of the dimensionless governing equations of the fluid flow, namely momentum equation, energy equation and species concentration can be obtained . The effects of heat radiation and chemical reaction with suction and injection on temperature, velocity and species concentration profiles will be analysed with tables and graphs.

Hierarchical and coupling model of factors influencing vessel traffic flow.

PubMed

Liu, Zhao; Liu, Jingxian; Li, Huanhuan; Li, Zongzhi; Tan, Zhirong; Liu, Ryan Wen; Liu, Yi

2017-01-01

Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system.

Hierarchical and coupling model of factors influencing vessel traffic flow

PubMed Central

Liu, Jingxian; Li, Huanhuan; Li, Zongzhi; Tan, Zhirong; Liu, Ryan Wen; Liu, Yi

2017-01-01

Understanding the characteristics of vessel traffic flow is crucial in maintaining navigation safety, efficiency, and overall waterway transportation management. Factors influencing vessel traffic flow possess diverse features such as hierarchy, uncertainty, nonlinearity, complexity, and interdependency. To reveal the impact mechanism of the factors influencing vessel traffic flow, a hierarchical model and a coupling model are proposed in this study based on the interpretative structural modeling method. The hierarchical model explains the hierarchies and relationships of the factors using a graph. The coupling model provides a quantitative method that explores interaction effects of factors using a coupling coefficient. The coupling coefficient is obtained by determining the quantitative indicators of the factors and their weights. Thereafter, the data obtained from Port of Tianjin is used to verify the proposed coupling model. The results show that the hierarchical model of the factors influencing vessel traffic flow can explain the level, structure, and interaction effect of the factors; the coupling model is efficient in analyzing factors influencing traffic volumes. The proposed method can be used for analyzing increases in vessel traffic flow in waterway transportation system. PMID:28414747

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

This book discusses four kinds of graphs that are taught in mathematics at the middle school level: pictographs, bar graphs, line graphs, and circle graphs. The chapters on each of these types of graphs contain information such as starting, scaling, drawing, labeling, and finishing the graphs using "LogoWriter." The final chapter of the…

Exact Solutions for Stokes' Flow of a Non-Newtonian Nanofluid Model: A Lie Similarity Approach

NASA Astrophysics Data System (ADS)

Aziz, Taha; Aziz, A.; Khalique, C. M.

2016-07-01

The fully developed time-dependent flow of an incompressible, thermodynamically compatible non-Newtonian third-grade nanofluid is investigated. The classical Stokes model is considered in which the flow is generated due to the motion of the plate in its own plane with an impulsive velocity. The Lie symmetry approach is utilised to convert the governing nonlinear partial differential equation into different linear and nonlinear ordinary differential equations. The reduced ordinary differential equations are then solved by using the compatibility and generalised group method. Exact solutions for the model equation are deduced in the form of closed-form exponential functions which are not available in the literature before. In addition, we also derived the conservation laws associated with the governing model. Finally, the physical features of the pertinent parameters are discussed in detail through several graphs.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Prince, K.R.; Schneider, B.J.

This study obtained estimates of the hydraulic properties of the upper glacial and Magothy aquifers in the East Meadow area for use in analyzing the movement of reclaimed waste water through the aquifer system. This report presents drawdown and recovery data form the two aquifer tests of 1978 and 1985, describes the six methods of analysis used, and summarizes the results of the analyses in tables and graphs. The drawdown and recovery data were analyzed through three simple analytical equations, two curve-matching techniques, and a finite-element radial-flow model. The resulting estimates of hydraulic conductivity, anisotropy, and storage characteristics were usedmore » as initial input values to the finite-element radial-flow model (Reilly, 1984). The flow model was then used to refine the estimates of the aquifer properties by more accurately representing the aquifer geometry and field conditions of the pumping tests.« less

Unsteady boundary layer flow and heat transfer of a Casson fluid past an oscillating vertical plate with Newtonian heating.

PubMed

Hussanan, Abid; Zuki Salleh, Mohd; Tahar, Razman Mat; Khan, Ilyas

2014-01-01

In this paper, the heat transfer effect on the unsteady boundary layer flow of a Casson fluid past an infinite oscillating vertical plate with Newtonian heating is investigated. The governing equations are transformed to a systems of linear partial differential equations using appropriate non-dimensional variables. The resulting equations are solved analytically by using the Laplace transform method and the expressions for velocity and temperature are obtained. They satisfy all imposed initial and boundary conditions and reduce to some well-known solutions for Newtonian fluids. Numerical results for velocity, temperature, skin friction and Nusselt number are shown in various graphs and discussed for embedded flow parameters. It is found that velocity decreases as Casson parameters increases and thermal boundary layer thickness increases with increasing Newtonian heating parameter.

Ion dynamics in the Venus ionosphere

NASA Astrophysics Data System (ADS)

Miller, K. L.; Whitten, R. C.

1991-02-01

Measurement data on the ion velocity in the Venus ionosphere (mainly from the Pioneer Venus Orbiter Retarding Potential Analyzer) are summarized, and theoretical models developed to explain them are reviewed. Data and theoretical predictions are compared in extensive graphs and diagrams and discussed in detail. It is shown that the predominant flow is away from the subsolar point, at up to 3 km/sec in the terminator region. A model of axisymmetric flow based on momentum, energy, and mass conservation laws is found to reproduce the observed ion velocities at solar zenith angles less than about 140 deg, but not the high velocities and chaotic behavior seen near the antisolar point. Also discussed are significant differences between the flow above and below about 400 km and the effects of changes in the dynamic pressure of the solar wind.

Heat Transfer Analysis for Stationary Boundary Layer Slip Flow of a Power-Law Fluid in a Darcy Porous Medium with Plate Suction/Injection

PubMed Central

Aziz, Asim; Ali, Yasir; Aziz, Taha; Siddique, J. I.

2015-01-01

In this paper, we investigate the slip effects on the boundary layer flow and heat transfer characteristics of a power-law fluid past a porous flat plate embedded in the Darcy type porous medium. The nonlinear coupled system of partial differential equations governing the flow and heat transfer of a power-law fluid is transformed into a system of nonlinear coupled ordinary differential equations by applying a suitable similarity transformation. The resulting system of ordinary differential equations is solved numerically using Matlab bvp4c solver. Numerical results are presented in the form of graphs and the effects of the power-law index, velocity and thermal slip parameters, permeability parameter, suction/injection parameter on the velocity and temperature profiles are examined. PMID:26407162

Modified Fourier heat flux on MHD flow over stretched cylinder filled with dust, Graphene and silver nanoparticles

NASA Astrophysics Data System (ADS)

Mamatha Upadhya, S.; Raju, C. S. K.; Saleem, S.; Alderremy, A. A.; Mahesha

2018-06-01

A Comprehensive study on laminar, magnetohydrodynamic (MHD) boundary layer flow of nanofluid (water + Silver, water + Graphene) embedded with conducting micrometer sized dust particles over a stretching cylinder with the incorporation of Cattaneo-Christov heat flux model is conducted. Appropriate similarity variables are employed to the flow governing equations and the resulting ordinary differential equations are solved by employing Runge-Kutta-Fehlberg method. The results for varied controlling parameters for both dusty nano fluid and dust phase are shown through graphs, table and discussed in detail. Authentication of the obtained results is provided by comparing with published results. Results indicate that Graphene + water dusty nanofluid shows better heat transfer performance compared with Silver + water dusty nanofluid. Improvement in thermal relaxation boosts temperature distribution in both fluid and dust phase.

Hydromagnetic couple-stress nanofluid flow over a moving convective wall: OHAM analysis

NASA Astrophysics Data System (ADS)

Awais, M.; Saleem, S.; Hayat, T.; Irum, S.

2016-12-01

This communication presents the magnetohydrodynamics (MHD) flow of a couple-stress nanofluid over a convective moving wall. The flow dynamics are analyzed in the boundary layer region. Convective cooling phenomenon combined with thermophoresis and Brownian motion effects has been discussed. Similarity transforms are utilized to convert the system of partial differential equations into coupled non-linear ordinary differential equation. Optimal homotopy analysis method (OHAM) is utilized and the concept of minimization is employed by defining the average squared residual errors. Effects of couple-stress parameter, convective cooling process parameter and energy enhancement parameters are displayed via graphs and discussed in detail. Various tables are also constructed to present the error analysis and a comparison of obtained results with the already published data. Stream lines are plotted showing a difference of Newtonian fluid model and couplestress fluid model.

Strategies for concurrent processing of complex algorithms in data driven architectures

NASA Technical Reports Server (NTRS)

Stoughton, John W.; Mielke, Roland R.

1988-01-01

Research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a special distributed computer environment is presented. This model is identified by the acronym ATAMM which represents Algorithms To Architecture Mapping Model. The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

HYSEP: A Computer Program for Streamflow Hydrograph Separation and Analysis

USGS Publications Warehouse

Sloto, Ronald A.; Crouse, Michele Y.

1996-01-01

HYSEP is a computer program that can be used to separate a streamflow hydrograph into base-flow and surface-runoff components. The base-flow component has traditionally been associated with ground-water discharge and the surface-runoff component with precipitation that enters the stream as overland runoff. HYSEP includes three methods of hydrograph separation that are referred to in the literature as the fixed interval, sliding-interval, and local-minimum methods. The program also describes the frequency and duration of measured streamflow and computed base flow and surface runoff. Daily mean stream discharge is used as input to the program in either an American Standard Code for Information Interchange (ASCII) or binary format. Output from the program includes table,s graphs, and data files. Graphical output may be plotted on the computer screen or output to a printer, plotter, or metafile.

Couette flow of an incompressible fluid in a porous channel with mass transfer

NASA Astrophysics Data System (ADS)

Niranjana, N.; Vidhya, M.; Govindarajan, A.

2018-04-01

The present discussion deals with the study of couette flow through a porous medium of a viscous incompressible fluid between two infinite horizontal parallel porous flat plates with heat and mass transfer. The stationary plate and the plate in uniform motion are subjected to transverse sinusoidal injection and uniform suction of the fluid. Due to this type of injection velocity, the flow becomes three dimensional. The analytical solutions of the nonlinear partial differential equations of this problem are obtained by using perturbation technique. Expressions for the velocity, temperature fields and the rate of heat and mass transfers are obtained. Effects of the following parameters Schmidt number (Sc), Modified Grashof number (Gm) on the velocity, temperature and concentration fields are obtained numerically and depicted through graphs. The rate of heat and mass transfer are also analyzed.

DOE Office of Scientific and Technical Information (OSTI.GOV)

Zhang, Fangyan; Zhang, Song; Chung Wong, Pak

Effectively visualizing large graphs and capturing the statistical properties are two challenging tasks. To aid in these two tasks, many sampling approaches for graph simplification have been proposed, falling into three categories: node sampling, edge sampling, and traversal-based sampling. It is still unknown which approach is the best. We evaluate commonly used graph sampling methods through a combined visual and statistical comparison of graphs sampled at various rates. We conduct our evaluation on three graph models: random graphs, small-world graphs, and scale-free graphs. Initial results indicate that the effectiveness of a sampling method is dependent on the graph model, themore » size of the graph, and the desired statistical property. This benchmark study can be used as a guideline in choosing the appropriate method for a particular graph sampling task, and the results presented can be incorporated into graph visualization and analysis tools.« less

Exponentially varying viscosity of magnetohydrodynamic mixed convection Eyring-Powell nanofluid flow over an inclined surface

NASA Astrophysics Data System (ADS)

Khan, Imad; Fatima, Sumreen; Malik, M. Y.; Salahuddin, T.

2018-03-01

This paper explores the theoretical study of the steady incompressible two dimensional MHD boundary layer flow of Eyring-Powell nanofluid over an inclined surface. The fluid is considered to be electrically conducting and the viscosity of the fluid is assumed to be varying exponentially. The governing partial differential equations (PDE's) are reduced into ordinary differential equations (ODE's) by applying similarity approach. The resulting ordinary differential equations are solved successfully by using Homotopy analysis method. The impact of pertinent parameters on velocity, concentration and temperature profiles are examined through graphs and tables. Also coefficient of skin friction, Sherwood and Nusselt numbers are illustrated in tabular and graphical form.

Hydromagnetic Rarefied Fluid Flow over a Wedge in the Presence of Surface Slip and Thermal Radiation

NASA Astrophysics Data System (ADS)

Das, K.; Sharma, R. P.; Duari, P. R.

2017-12-01

An analysis is presented to investigate the effects of thermal radiation on a convective slip flow of an electrically conducting slightly rarefied fluid, having temperature dependent fluid properties, over a wedge with a thermal jump at the surface of the boundary in the presence of a transverse magnetic field. The reduced equations are solved numerically using the finite difference code that implements the 3-stage Lobatto IIIa formula for the partitioned Runge-Kutta method. Numerical results for the dimensionless velocity and temperature as well as for the skin friction coefficient and the Nusselt number are presented through graphs and tables for pertinent parameters to show interesting aspects of the solution.

Nonlinear radiative heat flux and heat source/sink on entropy generation minimization rate

NASA Astrophysics Data System (ADS)

Hayat, T.; Khan, M. Waleed Ahmed; Khan, M. Ijaz; Alsaedi, A.

2018-06-01

Entropy generation minimization in nonlinear radiative mixed convective flow towards a variable thicked surface is addressed. Entropy generation for momentum and temperature is carried out. The source for this flow analysis is stretching velocity of sheet. Transformations are used to reduce system of partial differential equations into ordinary ones. Total entropy generation rate is determined. Series solutions for the zeroth and mth order deformation systems are computed. Domain of convergence for obtained solutions is identified. Velocity, temperature and concentration fields are plotted and interpreted. Entropy equation is studied through nonlinear mixed convection and radiative heat flux. Velocity and temperature gradients are discussed through graphs. Meaningful results are concluded in the final remarks.

Study of cryogenic propellant systems for loading the space shuttle

NASA Technical Reports Server (NTRS)

Voth, R. O.; Steward, W. G.; Hall, W. J.

1974-01-01

Computer programs were written to model the liquid oxygen loading system for the space shuttle. The programs allow selection of input data through graphic displays which schematically depict the part of the system being modeled. The computed output is also displayed in the form of graphs and printed messages. Any one of six computation options may be selected. The first four of these pertain to thermal stresses, pressure surges, cooldown times, flow rates and pressures during cooldown. Options five and six deal with possible water hammer effects due to closing of valves, steady flow and transient response to changes in operating conditions after cooldown. Procedures are given for operation of the graphic display unit and minicomputer.

A Grassmann graph embedding framework for gait analysis

NASA Astrophysics Data System (ADS)

Connie, Tee; Goh, Michael Kah Ong; Teoh, Andrew Beng Jin

2014-12-01

Gait recognition is important in a wide range of monitoring and surveillance applications. Gait information has often been used as evidence when other biometrics is indiscernible in the surveillance footage. Building on recent advances of the subspace-based approaches, we consider the problem of gait recognition on the Grassmann manifold. We show that by embedding the manifold into reproducing kernel Hilbert space and applying the mechanics of graph embedding on such manifold, significant performance improvement can be obtained. In this work, the gait recognition problem is studied in a unified way applicable for both supervised and unsupervised configurations. Sparse representation is further incorporated in the learning mechanism to adaptively harness the local structure of the data. Experiments demonstrate that the proposed method can tolerate variations in appearance for gait identification effectively.

An algorithm for finding a similar subgraph of all Hamiltonian cycles

NASA Astrophysics Data System (ADS)

Wafdan, R.; Ihsan, M.; Suhaimi, D.

2018-01-01

This paper discusses an algorithm to find a similar subgraph called findSimSubG algorithm. A similar subgraph is a subgraph with a maximum number of edges, contains no isolated vertex and is contained in every Hamiltonian cycle of a Hamiltonian Graph. The algorithm runs only on Hamiltonian graphs with at least two Hamiltonian cycles. The algorithm works by examining whether the initial subgraph of the first Hamiltonian cycle is a subgraph of comparison graphs. If the initial subgraph is not in comparison graphs, the algorithm will remove edges and vertices of the initial subgraph that are not in comparison graphs. There are two main processes in the algorithm, changing Hamiltonian cycle into a cycle graph and removing edges and vertices of the initial subgraph that are not in comparison graphs. The findSimSubG algorithm can find the similar subgraph without using backtracking method. The similar subgraph cannot be found on certain graphs, such as an n-antiprism graph, complete bipartite graph, complete graph, 2n-crossed prism graph, n-crown graph, n-möbius ladder, prism graph, and wheel graph. The complexity of this algorithm is O(m|V|), where m is the number of Hamiltonian cycles and |V| is the number of vertices of a Hamiltonian graph.

A New Wrist Clinical Evaluation Score.

PubMed

Herzberg, Guillaume; Burnier, Marion; Nakamura, Toshiyasu

2018-04-01

Background  The number of available wrist scoring systems is limited; some of them do not include forearm rotation criteria. Purpose  To describe a new electronic wrist clinical score and to present a new patient's generated wrist evaluation criterion, the subjective wrist value (SWV). Materials and Methods  A new electronic wrist clinical score, the Lyon wrist score (LWS) including wrist VAS pain and function, active range of motion and strength was built into an excel file. VAS flexion-extension pain and function were evaluated independently from pronation-supination pain and function. A new patient's generated wrist evaluation criterion, SWV was described. Results  The LWS is available in two versions, standard and full (the latter including forearm rotation strength). Both standard and full LWS are displayed into an automatically generated diamond-shaped graph providing a comprehensive visual display of the clinical status of most osteoarticular wrist disorders. The graph also includes SWV. The LWS, combined with SWV into a graph that may be directly exported to a PowerPoint presentation, provide a new practical and comprehensive tool for following/comparing wrist osteoarticular clinical status/outcomes. Both standard and full LWS charts are available in colored versions on a related website for free download. Conclusion  A comprehensive updated electronic display of osteoarticular wrist clinical status including forearm rotation criteria is provided and displayed into a graph which may be exported as such into a PowerPoint presentation for clinical analysis/comparisons. Level of Evidence  Level II.

Graph Metrics of Structural Brain Networks in Individuals with Schizophrenia and Healthy Controls: Group Differences, Relationships with Intelligence, and Genetics.

PubMed

Yeo, Ronald A; Ryman, Sephira G; van den Heuvel, Martijn P; de Reus, Marcel A; Jung, Rex E; Pommy, Jessica; Mayer, Andrew R; Ehrlich, Stefan; Schulz, S Charles; Morrow, Eric M; Manoach, Dara; Ho, Beng-Choon; Sponheim, Scott R; Calhoun, Vince D

2016-02-01

One of the most prominent features of schizophrenia is relatively lower general cognitive ability (GCA). An emerging approach to understanding the roots of variation in GCA relies on network properties of the brain. In this multi-center study, we determined global characteristics of brain networks using graph theory and related these to GCA in healthy controls and individuals with schizophrenia. Participants (N=116 controls, 80 patients with schizophrenia) were recruited from four sites. GCA was represented by the first principal component of a large battery of neurocognitive tests. Graph metrics were derived from diffusion-weighted imaging. The global metrics of longer characteristic path length and reduced overall connectivity predicted lower GCA across groups, and group differences were noted for both variables. Measures of clustering, efficiency, and modularity did not differ across groups or predict GCA. Follow-up analyses investigated three topological types of connectivity--connections among high degree "rich club" nodes, "feeder" connections to these rich club nodes, and "local" connections not involving the rich club. Rich club and local connectivity predicted performance across groups. In a subsample (N=101 controls, 56 patients), a genetic measure reflecting mutation load, based on rare copy number deletions, was associated with longer characteristic path length. Results highlight the importance of characteristic path lengths and rich club connectivity for GCA and provide no evidence for group differences in the relationships between graph metrics and GCA.

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

Supercomputer Environments

DTIC Science & Technology

1990-01-09

data structures can easily be presented to the user interface. An emphasis of the Graph Browser was the realization of graph views and graph animation ... animation of the graph. Anima- tion of the graph includes changing node shapes, changing node and arc colors, changing node and arc text, and making...many graphs tend to be tree-like. Animtion of a graph is a useful feature. One of the primary goals of GMB was to support animated graphs. For animation

Probing Factors Influencing Students' Graph Comprehension Regarding Four Operations in Kinematics Graphs

ERIC Educational Resources Information Center

Phage, Itumeleng B.; Lemmer, Miriam; Hitge, Mariette

2017-01-01

Students' graph comprehension may be affected by the background of the students who are the readers or interpreters of the graph, their knowledge of the context in which the graph is set, and the inferential processes required by the graph operation. This research study investigated these aspects of graph comprehension for 152 first year…

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

NASA Astrophysics Data System (ADS)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Mapping the functional connectome in traumatic brain injury: What can graph metrics tell us?

PubMed

Caeyenberghs, Karen; Verhelst, Helena; Clemente, Adam; Wilson, Peter H

2017-10-15

Traumatic brain injury (TBI) is associated with cognitive and motor deficits, and poses a significant personal, societal, and economic burden. One mechanism by which TBI is thought to affect cognition and behavior is through changes in functional connectivity. Graph theory is a powerful framework for quantifying topological features of neuroimaging-derived functional networks. The objective of this paper is to review studies examining functional connectivity in TBI with an emphasis on graph theoretical analysis that is proving to be valuable in uncovering network abnormalities in this condition. We review studies that have examined TBI-related alterations in different properties of the functional brain network, including global integration, segregation, centrality and resilience. We focus on functional data using task-related fMRI or resting-state fMRI in patients with TBI of different severity and recovery phase, and consider how graph metrics may inform rehabilitation and enhance efficacy. Moreover, we outline some methodological challenges associated with the examination of functional connectivity in patients with brain injury, including the sample size, parcellation scheme used, node definition and subgroup analyses. The findings suggest that TBI is associated with hyperconnectivity and a suboptimal global integration, characterized by increased connectivity degree and strength and reduced efficiency of functional networks. This altered functional connectivity, also evident in other clinical populations, is attributable to diffuse white matter pathology and reductions in gray and white matter volume. These functional alterations are implicated in post-concussional symptoms, posttraumatic stress and neurocognitive dysfunction after TBI. Finally, the effects of focal lesions have been found to depend critically on topological position and their role in the network. Graph theory is a unique and powerful tool for exploring functional connectivity in brain-injured patients. One limitation is that its results do not provide specific measures about the biophysical mechanism underlying TBI. Continued work in this field will hopefully see graph metrics used as biomarkers to provide more accurate diagnosis and help guide treatment at the individual patient level. Copyright © 2016. Published by Elsevier Inc.

Sclerenchymatous ring as a barrier to phloem feeding by Asian citrus psyllid: Evidence from electrical penetration graph and visualization of stylet pathways

USDA-ARS?s Scientific Manuscript database

Asian citrus psyllid (ACP) feeding behaviors play a significant role in the transmission of the phloem-limited Candidatus Liberibacter asiaticus (CLas) bacteria that cause citrus greening disease. Sustained phloem ingestion by ACP on CLas infected plants is very important in pathogen acquisition and...

Mapping the Network of Neuropsychological Impairment in Children with Autism Spectrum Disorder: A Graph Theoretical Analysis

ERIC Educational Resources Information Center

Ibrahim, George M.; Morgan, Benjamin R.; Vogan, Vanessa M.; Leung, Rachel C.; Anagnostou, Evdokia; Taylor, Margot J.

2016-01-01

Children with autism spectrum disorder (ASD) exhibit social-communicative impairments. Less is known about the neuropsychological profile of ASD, although cognitive and neuropsychological deficits are evident. We modelled neuropsychological function in 20 children with ASD and 20 sex, age and IQ matched typically-developing controls (ages 7-14) as…

Taming the Data Monster: Collecting and Analyzing Classroom Data to Improve Student Progress

ERIC Educational Resources Information Center

Kabot, Susan; Reeve, Christine E.

2016-01-01

Faced with increasing demands for accountability, teachers are having to base their instructional decisions and choice of interventions on data on student performance. This book shows how to make this otherwise daunting task much more manageable by means of case studies and countless evidence-based forms and graphs. Although this book often refers…

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697

Mean square cordial labelling related to some acyclic graphs and its rough approximations

NASA Astrophysics Data System (ADS)

Dhanalakshmi, S.; Parvathi, N.

2018-04-01

In this paper we investigate that the path Pn, comb graph Pn⊙K1, n-centipede graph,centipede graph (n,2) and star Sn admits mean square cordial labeling. Also we proved that the induced sub graph obtained by the upper approximation of any sub graph H of the above acyclic graphs admits mean square cordial labeling.

Cultural macroevolution on neighbor graphs : vertical and horizontal transmission among Western North American Indian societies.

PubMed

Towner, Mary C; Grote, Mark N; Venti, Jay; Borgerhoff Mulder, Monique

2012-09-01

What are the driving forces of cultural macroevolution, the evolution of cultural traits that characterize societies or populations? This question has engaged anthropologists for more than a century, with little consensus regarding the answer. We develop and fit autologistic models, built upon both spatial and linguistic neighbor graphs, for 44 cultural traits of 172 societies in the Western North American Indian (WNAI) database. For each trait, we compare models including or excluding one or both neighbor graphs, and for the majority of traits we find strong evidence in favor of a model which uses both spatial and linguistic neighbors to predict a trait's distribution. Our results run counter to the assertion that cultural trait distributions can be explained largely by the transmission of traits from parent to daughter populations and are thus best analyzed with phylogenies. In contrast, we show that vertical and horizontal transmission pathways can be incorporated in a single model, that both transmission modes may indeed operate on the same trait, and that for most traits in the WNAI database, accounting for only one mode of transmission would result in a loss of information.

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

MHD biconvective flow of Powell Eyring nanofluid over stretched surface

NASA Astrophysics Data System (ADS)

Naseem, Faiza; Shafiq, Anum; Zhao, Lifeng; Naseem, Anum

2017-06-01

The present work is focused on behavioral characteristics of gyrotactic microorganisms to describe their role in heat and mass transfer in the presence of magnetohydrodynamic (MHD) forces in Powell-Eyring nanofluids. Implications concerning stretching sheet with respect to velocity, temperature, nanoparticle concentration and motile microorganism density were explored to highlight influential parameters. Aim of utilizing microorganisms was primarily to stabilize the nanoparticle suspension due to bioconvection generated by the combined effects of buoyancy forces and magnetic field. Influence of Newtonian heating was also analyzed by taking into account thermophoretic mechanism and Brownian motion effects to insinuate series solutions mediated by homotopy analysis method (HAM). Mathematical model captured the boundary layer regime that explicitly involved contemporary non linear partial differential equations converted into the ordinary differential equations. To depict nanofluid flow characteristics, pertinent parameters namely bioconvection Lewis number Lb, traditional Lewis number Le, bioconvection Péclet number Pe, buoyancy ratio parameter Nr, bioconvection Rayleigh number Rb, thermophoresis parameter Nt, Hartmann number M, Grashof number Gr, and Eckert number Ec were computed and analyzed. Results revealed evidence of hydromagnetic bioconvection for microorganism which was represented by graphs and tables. Our findings further show a significant effect of Newtonian heating over a stretching plate by examining the coefficient values of skin friction, local Nusselt number and the local density number. Comparison was made between Newtonian fluid and Powell-Eyring fluid on velocity field and temperature field. Results are compared of with contemporary studies and our findings are found in excellent agreement with these studies.

Advanced Avionics Verification and Validation Phase II (AAV&V-II)

DTIC Science & Technology

1999-01-01

Algorithm 2-8 2.7 The Weak Control Dependence Algorithm 2-8 2.8 The Indirect Dependence Algorithms 2-9 2.9 Improvements to the Pleiades Object...describes some modifications made to the Pleiades object management system to increase the speed of the analysis. 2.1 THE INTERPROCEDURAL CONTROL FLOW...slow as the edges in the graph increased. The time to insert edges was addressed by enhancements to the Pleiades object management system, which are

Reducing the Footprint: Post Combat Operations, Budget Cuts, and Modern Day Sequestration

DTIC Science & Technology

2013-05-02

That Scary , in One Graph”; The Washington Post; November, 2012; http://www.washingtonpost.com/blogs/wonkblog/wp/2012/11/20/the- sequesters-defense-cuts...arent-that- scary -in-one-graph Figure 1 highlights the ebbs and flows of the DOD budget since the post World War II timeframe. Although the 2011...defense cuts aren’t that scary , in one graph”. The Washington Post, Washington: November, 2012, http://www.washingtonpost.com/blogs/wonkblog/wp

Preimpoundment Water Quality of the Wild Rice River, Norman County, Minnesota.

DTIC Science & Technology

1980-06-01

cell counts at Twin Valley for 1977 water year 25 14. Plot of total phosphorus related to phytoplankton cell counts at Twin Valley ; 30 15. Plot...of total nitrogen related to phytoplankton cell counts at Twin Valley 31 16. Bar graph of diversity indices of phytoplankton genera, 1976, 1977...statistically signifi- cant beyond the 0.02 level. There is no apparent relation of BOD to stream- flow or to suspended-sediment, phytoplankton , and bacteria

Topic Model for Graph Mining.

PubMed

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Employment growth through labor flow networks.

PubMed

Guerrero, Omar A; Axtell, Robert L

2013-01-01

It is conventional in labor economics to treat all workers who are seeking new jobs as belonging to a labor pool, and all firms that have job vacancies as an employer pool, and then match workers to jobs. Here we develop a new approach to study labor and firm dynamics. By combining the emerging science of networks with newly available employment micro-data, comprehensive at the level of whole countries, we are able to broadly characterize the process through which workers move between firms. Specifically, for each firm in an economy as a node in a graph, we draw edges between firms if a worker has migrated between them, possibly with a spell of unemployment in between. An economy's overall graph of firm-worker interactions is an object we call the labor flow network (LFN). This is the first study that characterizes a LFN for an entire economy. We explore the properties of this network, including its topology, its community structure, and its relationship to economic variables. It is shown that LFNs can be useful in identifying firms with high growth potential. We relate LFNs to other notions of high performance firms. Specifically, it is shown that fewer than 10% of firms account for nearly 90% of all employment growth. We conclude with a model in which empirically-salient LFNs emerge from the interaction of heterogeneous adaptive agents in a decentralized labor market.

Unsplittable Flow in Paths and Trees and Column-Restricted Packing Integer Programs

NASA Astrophysics Data System (ADS)

Chekuri, Chandra; Ene, Alina; Korula, Nitish

We consider the unsplittable flow problem (UFP) and the closely related column-restricted packing integer programs (CPIPs). In UFP we are given an edge-capacitated graph G = (V,E) and k request pairs R 1, ..., R k , where each R i consists of a source-destination pair (s i ,t i ), a demand d i and a weight w i . The goal is to find a maximum weight subset of requests that can be routed unsplittably in G. Most previous work on UFP has focused on the no-bottleneck case in which the maximum demand of the requests is at most the smallest edge capacity. Inspired by the recent work of Bansal et al. [3] on UFP on a path without the above assumption, we consider UFP on paths as well as trees. We give a simple O(logn) approximation for UFP on trees when all weights are identical; this yields an O(log2 n) approximation for the weighted case. These are the first non-trivial approximations for UFP on trees. We develop an LP relaxation for UFP on paths that has an integrality gap of O(log2 n); previously there was no relaxation with o(n) gap. We also consider UFP in general graphs and CPIPs without the no-bottleneck assumption and obtain new and useful results.

Employment Growth through Labor Flow Networks

PubMed Central

Guerrero, Omar A.; Axtell, Robert L.

2013-01-01

It is conventional in labor economics to treat all workers who are seeking new jobs as belonging to a labor pool, and all firms that have job vacancies as an employer pool, and then match workers to jobs. Here we develop a new approach to study labor and firm dynamics. By combining the emerging science of networks with newly available employment micro-data, comprehensive at the level of whole countries, we are able to broadly characterize the process through which workers move between firms. Specifically, for each firm in an economy as a node in a graph, we draw edges between firms if a worker has migrated between them, possibly with a spell of unemployment in between. An economy's overall graph of firm-worker interactions is an object we call the labor flow network (LFN). This is the first study that characterizes a LFN for an entire economy. We explore the properties of this network, including its topology, its community structure, and its relationship to economic variables. It is shown that LFNs can be useful in identifying firms with high growth potential. We relate LFNs to other notions of high performance firms. Specifically, it is shown that fewer than 10% of firms account for nearly 90% of all employment growth. We conclude with a model in which empirically-salient LFNs emerge from the interaction of heterogeneous adaptive agents in a decentralized labor market. PMID:23658682

On the Eikonal equation in the pedestrian flow problem

NASA Astrophysics Data System (ADS)

Felcman, J.; Kubera, P.

2017-07-01

We consider the Pedestrian Flow Equations (PFEs) as the coupled system formed by the Eikonal equation and the first order hyperbolic system with the source term. The hyperbolic system consists of the continuity equation and momentum equation of fluid dynamics. Specifying the social and pressure forces in the momentum equation we come to the assumption that each pedestrian is trying to move in a desired direction (e.g. to the exit in the panic situation) with a desired velocity, where his velocity and the direction of movement depend on the density of pedestrians in his neighborhood. In [1] we used the model, where the desired direction of movement is given by the solution of the Eikonal equation (more precisely by the gradient of the solution). Here we avoid the solution of the Eikonal equation, which is the novelty of the paper. Based on the fact that the solution of the Eikonal equation has the meaning of the shortest time to reach the exit, we define explicitly such a function in the framework of the Dijkstra's algorithm for the shortest path in the graph. This is done at the discrete level of the solution. As the graph we use the underlying triangulation, where the norm of each edge is density depending and has the dimension of the time. The numerical examples of the solution of the PFEs with and without the solution of the Eikonal equation are presented.

Cortical connectivity in fronto-temporal focal epilepsy from EEG analysis: A study via graph theory.

PubMed

Vecchio, Fabrizio; Miraglia, Francesca; Curcio, Giuseppe; Della Marca, Giacomo; Vollono, Catello; Mazzucchi, Edoardo; Bramanti, Placido; Rossini, Paolo Maria

2015-06-01

It is believed that effective connectivity and optimal network structure are essential for proper information processing in the brain. Indeed, functional abnormalities of the brain are found to be associated with pathological changes in connectivity and network structures. The aim of the present study was to explore the interictal network properties of EEG signals from temporal lobe structures in the context of fronto-temporal lobe epilepsy. To complete this aim, the graph characteristics of the EEG data of 17 patients suffering from focal epilepsy of the fronto-temporal type, recorded during interictal periods, were examined and compared in terms of the affected versus the unaffected hemispheres. EEG connectivity analysis was performed using eLORETA software in 15 fronto-temporal regions (Brodmann Areas BAs 8, 9, 10, 11, 20, 21, 22, 37, 38, 41, 42, 44, 45, 46, 47) on both affected and unaffected hemispheres. The evaluation of the graph analysis parameters, such as 'global' (characteristic path length) and 'local' connectivity (clustering coefficient) showed a statistically significant interaction among side (affected and unaffected hemisphere) and Band (delta, theta, alpha, beta, gamma). Duncan post hoc testing showed an increase of the path length in the alpha band in the affected hemisphere with respect to the unaffected one, as evaluated by an inter-hemispheric marker. The affected hemisphere also showed higher values of local connectivity in the alpha band. In general, an increase of local and global graph theory parameters in the alpha band was found in the affected hemisphere. It was also demonstrated that these effects were more evident in drug-free patients than in those undergoing pharmacological therapy. The increased measures in the affected hemisphere of both functional local segregation and global integration could result from the combination of overlapping mechanisms, including reactive neuroplastic changes seeking to maintain constant integration and segregation properties. This reactive neuroplastic mechanism seeking to maintain constant integration and segregation properties seems to be more evident in the absence of antiepileptic treatment. Copyright © 2014 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987

Optimal Co-segmentation of Tumor in PET-CT Images with Context Information

PubMed Central

Song, Qi; Bai, Junjie; Han, Dongfeng; Bhatia, Sudershan; Sun, Wenqing; Rockey, William; Bayouth, John E.; Buatti, John M.

2014-01-01

PET-CT images have been widely used in clinical practice for radiotherapy treatment planning of the radiotherapy. Many existing segmentation approaches only work for a single imaging modality, which suffer from the low spatial resolution in PET or low contrast in CT. In this work we propose a novel method for the co-segmentation of the tumor in both PET and CT images, which makes use of advantages from each modality: the functionality information from PET and the anatomical structure information from CT. The approach formulates the segmentation problem as a minimization problem of a Markov Random Field (MRF) model, which encodes the information from both modalities. The optimization is solved using a graph-cut based method. Two sub-graphs are constructed for the segmentation of the PET and the CT images, respectively. To achieve consistent results in two modalities, an adaptive context cost is enforced by adding context arcs between the two subgraphs. An optimal solution can be obtained by solving a single maximum flow problem, which leads to simultaneous segmentation of the tumor volumes in both modalities. The proposed algorithm was validated in robust delineation of lung tumors on 23 PET-CT datasets and two head-and-neck cancer subjects. Both qualitative and quantitative results show significant improvement compared to the graph cut methods solely using PET or CT. PMID:23693127

A general method for computing Tutte polynomials of self-similar graphs

NASA Astrophysics Data System (ADS)

Gong, Helin; Jin, Xian'an

2017-10-01

Self-similar graphs were widely studied in both combinatorics and statistical physics. Motivated by the construction of the well-known 3-dimensional Sierpiński gasket graphs, in this paper we introduce a family of recursively constructed self-similar graphs whose inner duals are of the self-similar property. By combining the dual property of the Tutte polynomial and the subgraph-decomposition trick, we show that the Tutte polynomial of this family of graphs can be computed in an iterative way and in particular the exact expression of the formula of the number of their spanning trees is derived. Furthermore, we show our method is a general one that is easily extended to compute Tutte polynomials for other families of self-similar graphs such as Farey graphs, 2-dimensional Sierpiński gasket graphs, Hanoi graphs, modified Koch graphs, Apollonian graphs, pseudofractal scale-free web, fractal scale-free network, etc.

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Active and passive controls of Jeffrey nanofluid flow over a nonlinear stretching surface

NASA Astrophysics Data System (ADS)

Hayat, Tasawar; Aziz, Arsalan; Muhammad, Taseer; Alsaedi, Ahmed

This communication explores magnetohydrodynamic (MHD) boundary-layer flow of Jeffrey nanofluid over a nonlinear stretching surface with active and passive controls of nanoparticles. A nonlinear stretching surface generates the flow. Effects of thermophoresis and Brownian diffusion are considered. Jeffrey fluid is electrically conducted subject to non-uniform magnetic field. Low magnetic Reynolds number and boundary-layer approximations have been considered in mathematical modelling. The phenomena of impulsing the particles away from the surface in combination with non-zero mass flux condition is known as the condition of zero mass flux. Convergent series solutions for the nonlinear governing system are established through optimal homotopy analysis method (OHAM). Graphs have been sketched in order to analyze that how the temperature and concentration distributions are affected by distinct physical flow parameters. Skin friction coefficient and local Nusselt and Sherwood numbers are also computed and analyzed. Our findings show that the temperature and concentration distributions are increasing functions of Hartman number and thermophoresis parameter.

Flow and Force Equations for a Body Revolving in a Fluid

NASA Technical Reports Server (NTRS)

Zahm, A F

1930-01-01

Part I gives a general method for finding the steady-flow velocity relative to a body in plane curvilinear motion, whence the pressure is found by Bernoulli's energy principle. Integration of the pressure supplies basic formulas for the zonal forces and moments on the revolving body. Part II, applying this steady-flow method, finds the velocity and pressure at all points of the flow inside and outside an ellipsoid and some of its limiting forms, and graphs those quantities for the latter forms. Part III finds the pressure, and thence the zonal force and moment, on hulls in plane curvilinear flight. Part IV derives general equations for the resultant fluid forces and moments on trisymmetrical bodies moving through a perfect fluid, and in some cases compares the moment values with those found for bodies moving in air. Part V furnishes ready formulas for potential coefficients and inertia coefficients for an ellipsoid and its limiting forms. Thence are derived tables giving numerical values of those coefficients for a comprehensive range of shapes.

Magneto hall effect on unsteady elastico-viscous nanofluid slip flow in a channel in presence of thermal radiation and heat generation with Brownian motion

NASA Astrophysics Data System (ADS)

Karim, M. Enamul; Samad, M. Abdus; Ferdows, M.

2017-06-01

The present note investigates the magneto hall effect on unsteady flow of elastico-viscous nanofluid in a channel with slip boundary considering the presence of thermal radiation and heat generation with Brownian motion. Numerical results are achieved by solving the governing equations by the implicit Finite Difference Method (FDM) obtaining primary and secondary velocities, temperature, nanoparticles volume fraction and concentration distributions within the boundary layer entering into the problem. The influences of several interesting parameters such as elastico-viscous parameter, magnetic field, hall parameter, heat generation, thermal radiation and Brownian motion parameters on velocity, heat and mass transfer characteristics of the fluid flow are discussed with the help of graphs. Also the effects of the pertinent parameters, which are of physical and engineering interest, such as Skin friction parameter, Nusselt number and Sherwood number are sorted out. It is found that the flow field and other quantities of physical concern are significantly influenced by these parameters.

Radiated flow of chemically reacting nanoliquid with an induced magnetic field across a permeable vertical plate

NASA Astrophysics Data System (ADS)

Mahanthesh, B.; Gireesha, B. J.; Athira, P. R.

Impact of induced magnetic field over a flat porous plate by utilizing incompressible water-copper nanoliquid is examined analytically. Flow is supposed to be laminar, steady and two-dimensional. The plate is subjected to a regular free stream velocity as well as suction velocity. Flow formulation is developed by considering Maxwell-Garnetts (MG) and Brinkman models of nanoliquid. Impacts of thermal radiation, viscous dissipation, temperature dependent heat source/sink and first order chemical reaction are also retained. The subjected non-linear problems are non-dimensionalized and analytic solutions are presented via series expansion method. The graphs are plotted to analyze the influence of pertinent parameters on flow, magnetism, heat and mass transfer fields as well as friction factor, current density, Nusselt and Sherwood numbers. It is found that friction factor at the plate is more for larger magnetic Prandtl number. Also the rate of heat transfer decayed with increasing nanoparticles volume fraction and the strength of magnetism.

Developing a novel approach to analyse the regimes of temporary streams and their controls on aquatic biota

NASA Astrophysics Data System (ADS)

Gallart, F.; Prat, N.; García-Roger, E. M.; Latron, J.; Rieradevall, M.; Llorens, P.; Barberá, G. G.; Brito, D.; de Girolamo, A. M.; Lo Porto, A.; Neves, R.; Nikolaidis, N. P.; Perrin, J. L.; Querner, E. P.; Quiñonero, J. M.; Tournoud, M. G.; Tzoraki, O.; Froebrich, J.

2011-10-01

Temporary streams are those water courses that undergo the recurrent cessation of flow or the complete drying of their channel. The biological communities in temporary stream reaches are strongly dependent on the temporal changes of the aquatic habitats determined by the hydrological conditions. The use of the aquatic fauna structural and functional characteristics to assess the ecological quality of a temporary stream reach can not therefore be made without taking into account the controls imposed by the hydrological regime. This paper develops some methods for analysing temporary streams' aquatic regimes, based on the definition of six aquatic states that summarize the sets of mesohabitats occurring on a given reach at a particular moment, depending on the hydrological conditions: flood, riffles, connected, pools, dry and arid. We used the water discharge records from gauging stations or simulations using rainfall-runoff models to infer the temporal patterns of occurrence of these states using the developed aquatic states frequency graph. The visual analysis of this graph is complemented by the development of two metrics based on the permanence of flow and the seasonal predictability of zero flow periods. Finally, a classification of the aquatic regimes of temporary streams in terms of their influence over the development of aquatic life is put forward, defining Permanent, Temporary-pools, Temporary-dry and Episodic regime types. All these methods were tested with data from eight temporary streams around the Mediterranean from MIRAGE project and its application was a precondition to assess the ecological quality of these streams using the current methods prescribed in the European Water Framework Directive for macroinvertebrate communities.

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Survey of Approaches to Generate Realistic Synthetic Graphs

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broadmore » set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.« less

Self-organizing maps for learning the edit costs in graph matching.

PubMed

Neuhaus, Michel; Bunke, Horst

2005-06-01

Although graph matching and graph edit distance computation have become areas of intensive research recently, the automatic inference of the cost of edit operations has remained an open problem. In the present paper, we address the issue of learning graph edit distance cost functions for numerically labeled graphs from a corpus of sample graphs. We propose a system of self-organizing maps (SOMs) that represent the distance measuring spaces of node and edge labels. Our learning process is based on the concept of self-organization. It adapts the edit costs in such a way that the similarity of graphs from the same class is increased, whereas the similarity of graphs from different classes decreases. The learning procedure is demonstrated on two different applications involving line drawing graphs and graphs representing diatoms, respectively.

Apparatuses and Methods for Producing Runtime Architectures of Computer Program Modules

NASA Technical Reports Server (NTRS)

Abi-Antoun, Marwan Elia (Inventor); Aldrich, Jonathan Erik (Inventor)

2013-01-01

Apparatuses and methods for producing run-time architectures of computer program modules. One embodiment includes creating an abstract graph from the computer program module and from containment information corresponding to the computer program module, wherein the abstract graph has nodes including types and objects, and wherein the abstract graph relates an object to a type, and wherein for a specific object the abstract graph relates the specific object to a type containing the specific object; and creating a runtime graph from the abstract graph, wherein the runtime graph is a representation of the true runtime object graph, wherein the runtime graph represents containment information such that, for a specific object, the runtime graph relates the specific object to another object that contains the specific object.

Deconvolution of mixing time series on a graph

PubMed Central

Blocker, Alexander W.; Airoldi, Edoardo M.

2013-01-01

In many applications we are interested in making inference on latent time series from indirect measurements, which are often low-dimensional projections resulting from mixing or aggregation. Positron emission tomography, super-resolution, and network traffic monitoring are some examples. Inference in such settings requires solving a sequence of ill-posed inverse problems, yt = Axt, where the projection mechanism provides information on A. We consider problems in which A specifies mixing on a graph of times series that are bursty and sparse. We develop a multilevel state-space model for mixing times series and an efficient approach to inference. A simple model is used to calibrate regularization parameters that lead to efficient inference in the multilevel state-space model. We apply this method to the problem of estimating point-to-point traffic flows on a network from aggregate measurements. Our solution outperforms existing methods for this problem, and our two-stage approach suggests an efficient inference strategy for multilevel models of multivariate time series. PMID:25309135

Sparse dictionary learning for resting-state fMRI analysis

NASA Astrophysics Data System (ADS)

Lee, Kangjoo; Han, Paul Kyu; Ye, Jong Chul

2011-09-01

Recently, there has been increased interest in the usage of neuroimaging techniques to investigate what happens in the brain at rest. Functional imaging studies have revealed that the default-mode network activity is disrupted in Alzheimer's disease (AD). However, there is no consensus, as yet, on the choice of analysis method for the application of resting-state analysis for disease classification. This paper proposes a novel compressed sensing based resting-state fMRI analysis tool called Sparse-SPM. As the brain's functional systems has shown to have features of complex networks according to graph theoretical analysis, we apply a graph model to represent a sparse combination of information flows in complex network perspectives. In particular, a new concept of spatially adaptive design matrix has been proposed by implementing sparse dictionary learning based on sparsity. The proposed approach shows better performance compared to other conventional methods, such as independent component analysis (ICA) and seed-based approach, in classifying the AD patients from normal using resting-state analysis.

Biotechnology

NASA Image and Video Library

2003-01-22

ProVision Technologies, a NASA research partnership center at Sternis Space Center in Mississippi, has developed a new hyperspectral imaging (HSI) system that is much smaller than the original large units used aboard remote sensing aircraft and satellites. The new apparatus is about the size of a breadbox. HSI may be useful to ophthalmologists to study and diagnose eye health, both on Earth and in space, by examining the back of the eye to determine oxygen and blood flow quickly and without any invasion. ProVision's hyperspectral imaging system can scan the human eye and produce a graph showing optical density or light absorption, which can then be compared to a graph from a normal eye. Scans of the macula, optic disk or optic nerve head, and blood vessels can be used to detect anomalies and identify diseases in this delicate and important organ. ProVision has already developed a relationship with the University of Alabama at Birmingham, but is still on the lookout for a commercial partner in this application.

Biotechnology

NASA Image and Video Library

2003-01-22

ProVision Technologies, a NASA commercial space center at Sternis Space Center in Mississippi, has developed a new hyperspectral imaging (HSI) system that is much smaller than the original large units used aboard remote sensing aircraft and satellites. The new apparatus is about the size of a breadbox. HSI may be useful to ophthalmologists to study and diagnose eye health, both on Earth and in space, by examining the back of the eye to determine oxygen and blood flow quickly and without any invasion. ProVision's hyperspectral imaging system can scan the human eye and produce a graph showing optical density or light absorption, which can then be compared to a graph from a normal eye. Scans of the macula, optic disk or optic nerve head, and blood vessels can be used to detect anomalies and identify diseases in this delicate and important organ. ProVision has already developed a relationship with the University of Alabama at Birmingham, but is still on the lookout for a commercial partner in this application.

Google matrix of business process management

NASA Astrophysics Data System (ADS)

Abel, M. W.; Shepelyansky, D. L.

2011-12-01

Development of efficient business process models and determination of their characteristic properties are subject of intense interdisciplinary research. Here, we consider a business process model as a directed graph. Its nodes correspond to the units identified by the modeler and the link direction indicates the causal dependencies between units. It is of primary interest to obtain the stationary flow on such a directed graph, which corresponds to the steady-state of a firm during the business process. Following the ideas developed recently for the World Wide Web, we construct the Google matrix for our business process model and analyze its spectral properties. The importance of nodes is characterized by PageRank and recently proposed CheiRank and 2DRank, respectively. The results show that this two-dimensional ranking gives a significant information about the influence and communication properties of business model units. We argue that the Google matrix method, described here, provides a new efficient tool helping companies to make their decisions on how to evolve in the exceedingly dynamic global market.

G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.

PubMed

Wang, Xiaohong; Smalter, Aaron; Huan, Jun; Lushington, Gerald H

2009-01-01

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others.Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database.Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index structure is scalable to large database with smaller indexing size, faster indexing construction time, and faster query processing time as compared to state-of-the-art indexing methods such as C-tree, gIndex, and GraphGrep.

OpinionFlow: Visual Analysis of Opinion Diffusion on Social Media.

PubMed

Wu, Yingcai; Liu, Shixia; Yan, Kai; Liu, Mengchen; Wu, Fangzhao

2014-12-01

It is important for many different applications such as government and business intelligence to analyze and explore the diffusion of public opinions on social media. However, the rapid propagation and great diversity of public opinions on social media pose great challenges to effective analysis of opinion diffusion. In this paper, we introduce a visual analysis system called OpinionFlow to empower analysts to detect opinion propagation patterns and glean insights. Inspired by the information diffusion model and the theory of selective exposure, we develop an opinion diffusion model to approximate opinion propagation among Twitter users. Accordingly, we design an opinion flow visualization that combines a Sankey graph with a tailored density map in one view to visually convey diffusion of opinions among many users. A stacked tree is used to allow analysts to select topics of interest at different levels. The stacked tree is synchronized with the opinion flow visualization to help users examine and compare diffusion patterns across topics. Experiments and case studies on Twitter data demonstrate the effectiveness and usability of OpinionFlow.

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Comparing Internet Probing Methodologies Through an Analysis of Large Dynamic Graphs

DTIC Science & Technology

2014-06-01

comparable Internet topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical...topologies in less time. We compare these by modeling union of traceroute outputs as graphs, and using standard graph theoretical measurements as well...We compare these by modeling union of traceroute outputs as graphs, and study the graphs by using vertex and edge count, average vertex degree

GraphBench

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun

2016-06-01

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

An Interactive Educational Tool for Compressible Aerodynamics

NASA Technical Reports Server (NTRS)

Benson, Thomas J.

1994-01-01

A workstation-based interactive educational tool was developed to aid in the teaching of undergraduate compressible aerodynamics. The tool solves for the supersonic flow past a wedge using the equations found in NACA 1135. The student varies the geometry or flow conditions through a graphical user interface and the new conditions are calculated immediately. Various graphical formats present the variation of flow results to the student. One such format leads the student to the generation of some of the graphs found in NACA-1135. The tool includes interactive questions and answers to aid in both the use of the tool and to develop an understanding of some of the complexities of compressible aerodynamics. A series of help screens make the simulator easy to learn and use. This paper will detail the numerical methods used in the tool and describe how it can be used and modified.

Physiological breakdown of Jeffrey six constant nanofluid flow in an endoscope with nonuniform wall

NASA Astrophysics Data System (ADS)

Nadeem, S.; Shaheen, A.; Hussain, S.

2015-12-01

This paper analyse the endoscopic effects of peristaltic nanofluid flow of Jeffrey six-constant fluid model in the presence of magnetohydrodynamics flow. The current problem is modeled in the cylindrical coordinate system and exact solutions are managed (where possible) under low Reynolds number and long wave length approximation. The influence of emerging parameters on temperature and velocity profile are discussed graphically. The velocity equation is solved analytically by utilizing the homotopy perturbation technique strongly, while the exact solutions are computed from temperature equation. The obtained expressions for velocity , concentration and temperature is sketched during graphs and the collision of assorted parameters is evaluate for transform peristaltic waves. The solution depend on thermophoresis number Nt, local nanoparticles Grashof number Gr, and Brownian motion number Nb. The obtained expressions for the velocity, temperature, and nanoparticles concentration profiles are plotted and the impact of various physical parameters are investigated for different peristaltic waves.

Convective boundary conditions effect on peristaltic flow of a MHD Jeffery nanofluid

NASA Astrophysics Data System (ADS)

Kothandapani, M.; Prakash, J.

2016-03-01

This work is aimed at describing the influences of MHD, chemical reaction, thermal radiation and heat source/sink parameter on peristaltic flow of Jeffery nanofluids in a tapered asymmetric channel along with slip and convective boundary conditions. The governing equations of a nanofluid are first formulated and then simplified under long-wavelength and low-Reynolds number approaches. The equation of nanoparticles temperature and concentration is coupled; hence, homotopy perturbation method has been used to obtain the solutions of temperature and concentration of nanoparticles. Analytical solutions for axial velocity, stream function and pressure gradient have also constructed. Effects of various influential flow parameters have been pointed out through with help of the graphs. Analysis indicates that the temperature of nanofluids decreases for a given increase in heat transfer Biot number and chemical reaction parameter, but it possesses converse behavior in respect of mass transfer Biot number and heat source/sink parameter.

Numerical study of unsteady MHD oblique stagnation point flow and heat transfer due to an oscillating stream

NASA Astrophysics Data System (ADS)

Javed, T.; Ghaffari, A.; Ahmad, H.

2016-05-01

The unsteady stagnation point flow impinging obliquely on a flat plate in presence of a uniform applied magnetic field due to an oscillating stream has been studied. The governing partial differential equations are transformed into dimensionless form and the stream function is expressed in terms of Hiemenz and tangential components. The dimensionless partial differential equations are solved numerically by using well-known implicit finite difference scheme named as Keller-box method. The obtained results are compared with those available in the literature. It is observed that the results are in excellent agreement with the previous studies. The effects of pertinent parameters involved in the problem namely magnetic parameter, Prandtl number and impinging angle on flow and heat transfer characteristics are illustrated through graphs. It is observed that the influence of magnetic field strength increases the fluid velocity and by the increase of obliqueness parameter, the skin friction increases.

A computational study of entropy generation in magnetohydrodynamic flow and heat transfer over an unsteady stretching permeable sheet

NASA Astrophysics Data System (ADS)

Saeed Butt, Adnan; Ali, Asif

2014-01-01

The present article aims to investigate the entropy effects in magnetohydrodynamic flow and heat transfer over an unsteady permeable stretching surface. The time-dependent partial differential equations are converted into non-linear ordinary differential equations by suitable similarity transformations. The solutions of these equations are computed analytically by the Homotopy Analysis Method (HAM) then solved numerically by the MATLAB built-in routine. Comparison of the obtained results is made with the existing literature under limiting cases to validate our study. The effects of unsteadiness parameter, magnetic field parameter, suction/injection parameter, Prandtl number, group parameter and Reynolds number on flow and heat transfer characteristics are checked and analysed with the aid of graphs and tables. Moreover, the effects of these parameters on entropy generation number and Bejan number are also shown graphically. It is examined that the unsteadiness and presence of magnetic field augments the entropy production.

Model and Comparative Study for Flow of Viscoelastic Nanofluids with Cattaneo-Christov Double Diffusion

PubMed Central

Hayat, Tasawar; Aziz, Arsalan; Muhammad, Taseer; Alsaedi, Ahmed

2017-01-01

Here two classes of viscoelastic fluids have been analyzed in the presence of Cattaneo-Christov double diffusion expressions of heat and mass transfer. A linearly stretched sheet has been used to create the flow. Thermal and concentration diffusions are characterized firstly by introducing Cattaneo-Christov fluxes. Novel features regarding Brownian motion and thermophoresis are retained. The conversion of nonlinear partial differential system to nonlinear ordinary differential system has been taken into place by using suitable transformations. The resulting nonlinear systems have been solved via convergent approach. Graphs have been sketched in order to investigate how the velocity, temperature and concentration profiles are affected by distinct physical flow parameters. Numerical values of skin friction coefficient and heat and mass transfer rates at the wall are also computed and discussed. Our observations demonstrate that the temperature and concentration fields are decreasing functions of thermal and concentration relaxation parameters. PMID:28046011

Strategies for concurrent processing of complex algorithms in data driven architectures

NASA Technical Reports Server (NTRS)

Stoughton, John W.; Mielke, Roland R.

1987-01-01

The results of ongoing research directed at developing a graph theoretical model for describing data and control flow associated with the execution of large grained algorithms in a spatial distributed computer environment is presented. This model is identified by the acronym ATAMM (Algorithm/Architecture Mapping Model). The purpose of such a model is to provide a basis for establishing rules for relating an algorithm to its execution in a multiprocessor environment. Specifications derived from the model lead directly to the description of a data flow architecture which is a consequence of the inherent behavior of the data and control flow described by the model. The purpose of the ATAMM based architecture is to optimize computational concurrency in the multiprocessor environment and to provide an analytical basis for performance evaluation. The ATAMM model and architecture specifications are demonstrated on a prototype system for concept validation.

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

ERIC Educational Resources Information Center

Öçal, Mehmet Fatih

2017-01-01

Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students' learning during graphing functions. However, the display of graphs of functions that students sketched by hand may…

Generalized graph states based on Hadamard matrices

DOE Office of Scientific and Technical Information (OSTI.GOV)

Cui, Shawn X.; Yu, Nengkun; Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1

2015-07-15

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study themore » entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.« less

Graph processing platforms at scale: practices and experiences

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution,more » connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.« less

A fast algorithm for vertex-frequency representations of signals on graphs

PubMed Central

Jestrović, Iva; Coyle, James L.; Sejdić, Ervin

2016-01-01

The windowed Fourier transform (short time Fourier transform) and the S-transform are widely used signal processing tools for extracting frequency information from non-stationary signals. Previously, the windowed Fourier transform had been adopted for signals on graphs and has been shown to be very useful for extracting vertex-frequency information from graphs. However, high computational complexity makes these algorithms impractical. We sought to develop a fast windowed graph Fourier transform and a fast graph S-transform requiring significantly shorter computation time. The proposed schemes have been tested with synthetic test graph signals and real graph signals derived from electroencephalography recordings made during swallowing. The results showed that the proposed schemes provide significantly lower computation time in comparison with the standard windowed graph Fourier transform and the fast graph S-transform. Also, the results showed that noise has no effect on the results of the algorithm for the fast windowed graph Fourier transform or on the graph S-transform. Finally, we showed that graphs can be reconstructed from the vertex-frequency representations obtained with the proposed algorithms. PMID:28479645

Prediction of Oncogenic Interactions and Cancer-Related Signaling Networks Based on Network Topology

PubMed Central

Acencio, Marcio Luis; Bovolenta, Luiz Augusto; Camilo, Esther; Lemke, Ney

2013-01-01

Cancer has been increasingly recognized as a systems biology disease since many investigators have demonstrated that this malignant phenotype emerges from abnormal protein-protein, regulatory and metabolic interactions induced by simultaneous structural and regulatory changes in multiple genes and pathways. Therefore, the identification of oncogenic interactions and cancer-related signaling networks is crucial for better understanding cancer. As experimental techniques for determining such interactions and signaling networks are labor-intensive and time-consuming, the development of a computational approach capable to accomplish this task would be of great value. For this purpose, we present here a novel computational approach based on network topology and machine learning capable to predict oncogenic interactions and extract relevant cancer-related signaling subnetworks from an integrated network of human genes interactions (INHGI). This approach, called graph2sig, is twofold: first, it assigns oncogenic scores to all interactions in the INHGI and then these oncogenic scores are used as edge weights to extract oncogenic signaling subnetworks from INHGI. Regarding the prediction of oncogenic interactions, we showed that graph2sig is able to recover 89% of known oncogenic interactions with a precision of 77%. Moreover, the interactions that received high oncogenic scores are enriched in genes for which mutations have been causally implicated in cancer. We also demonstrated that graph2sig is potentially useful in extracting oncogenic signaling subnetworks: more than 80% of constructed subnetworks contain more than 50% of original interactions in their corresponding oncogenic linear pathways present in the KEGG PATHWAY database. In addition, the potential oncogenic signaling subnetworks discovered by graph2sig are supported by experimental evidence. Taken together, these results suggest that graph2sig can be a useful tool for investigators involved in cancer research interested in detecting signaling networks most prone to contribute with the emergence of malignant phenotype. PMID:24204854

Graph 500 on OpenSHMEM: Using a Practical Survey of Past Work to Motivate Novel Algorithmic Developments

DOE Office of Scientific and Technical Information (OSTI.GOV)

Grossman, Max; Pritchard Jr., Howard Porter; Budimlic, Zoran

2016-12-22

Graph500 [14] is an effort to offer a standardized benchmark across large-scale distributed platforms which captures the behavior of common communicationbound graph algorithms. Graph500 differs from other large-scale benchmarking efforts (such as HPL [6] or HPGMG [7]) primarily in the irregularity of its computation and data access patterns. The core computational kernel of Graph500 is a breadth-first search (BFS) implemented on an undirected graph. The output of Graph500 is a spanning tree of the input graph, usually represented by a predecessor mapping for every node in the graph. The Graph500 benchmark defines several pre-defined input sizes for implementers to testmore » against. This report summarizes investigation into implementing the Graph500 benchmark on OpenSHMEM, and focuses on first building a strong and practical understanding of the strengths and limitations of past work before proposing and developing novel extensions.« less

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Evolutionary graph theory: breaking the symmetry between interaction and replacement

PubMed Central

Ohtsuki, Hisashi; Pacheco, Jorge M.; Nowak, Martin A.

2008-01-01

We study evolutionary dynamics in a population whose structure is given by two graphs: the interaction graph determines who plays with whom in an evolutionary game; the replacement graph specifies the geometry of evolutionary competition and updating. First, we calculate the fixation probabilities of frequency dependent selection between two strategies or phenotypes. We consider three different update mechanisms: birth-death, death-birth and imitation. Then, as a particular example, we explore the evolution of cooperation. Suppose the interaction graph is a regular graph of degree h, the replacement graph is a regular graph of degree g and the overlap between the two graphs is a regular graph of degree l. We show that cooperation is favored by natural selection if b/c > hg/l. Here, b and c denote the benefit and cost of the altruistic act. This result holds for death-birth updating, weak selection and large population size. Note that the optimum population structure for cooperators is given by maximum overlap between the interaction and the replacement graph (g = h = l), which means that the two graphs are identical. We also prove that a modified replicator equation can describe how the expected values of the frequencies of an arbitrary number of strategies change on replacement and interaction graphs: the two graphs induce a transformation of the payoff matrix. PMID:17350049

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

Free Fall Misconceptions: Results of a Graph Based Pre-Test of Sophomore Civil Engineering Students

ERIC Educational Resources Information Center

Montecinos, Alicia M.

2014-01-01

A partially unusual behaviour was found among 14 sophomore students of civil engineering who took a pre test for a free fall laboratory session, in the context of a general mechanics course. An analysis contemplating mathematics models and physics models consistency was made. In all cases, the students presented evidence favoring a correct free…

Brain network connectivity in women exposed to intimate partner violence: a graph theory analysis study.

PubMed

Roos, Annerine; Fouche, Jean-Paul; Stein, Dan J

2017-12-01

Evidence suggests that women who suffer from intimate partner violence (IPV) and posttraumatic stress disorder (PTSD) have structural and functional alterations in specific brain regions. Yet, little is known about how brain connectivity may be altered in individuals with IPV, but without PTSD. Women exposed to IPV (n = 18) and healthy controls (n = 18) underwent structural brain imaging using a Siemens 3T MRI. Global and regional brain network connectivity measures were determined, using graph theory analyses. Structural covariance networks were created using volumetric and cortical thickness data after controlling for intracranial volume, age and alcohol use. Nonparametric permutation tests were used to investigate group differences. Findings revealed altered connectivity on a global and regional level in the IPV group of regions involved in cognitive-emotional control, with principal involvement of the caudal anterior cingulate, the middle temporal gyrus, left amygdala and ventral diencephalon that includes the thalamus. To our knowledge, this is the first evidence showing different brain network connectivity in global and regional networks in women exposed to IPV, and without PTSD. Altered cognitive-emotional control in IPV may underlie adaptive neural mechanisms in environments characterized by potentially dangerous cues.

OVERSMART Reporting Tool for Flow Computations Over Large Grid Systems

NASA Technical Reports Server (NTRS)

Kao, David L.; Chan, William M.

2012-01-01

Structured grid solvers such as NASA's OVERFLOW compressible Navier-Stokes flow solver can generate large data files that contain convergence histories for flow equation residuals, turbulence model equation residuals, component forces and moments, and component relative motion dynamics variables. Most of today's large-scale problems can extend to hundreds of grids, and over 100 million grid points. However, due to the lack of efficient tools, only a small fraction of information contained in these files is analyzed. OVERSMART (OVERFLOW Solution Monitoring And Reporting Tool) provides a comprehensive report of solution convergence of flow computations over large, complex grid systems. It produces a one-page executive summary of the behavior of flow equation residuals, turbulence model equation residuals, and component forces and moments. Under the automatic option, a matrix of commonly viewed plots such as residual histograms, composite residuals, sub-iteration bar graphs, and component forces and moments is automatically generated. Specific plots required by the user can also be prescribed via a command file or a graphical user interface. Output is directed to the user s computer screen and/or to an html file for archival purposes. The current implementation has been targeted for the OVERFLOW flow solver, which is used to obtain a flow solution on structured overset grids. The OVERSMART framework allows easy extension to other flow solvers.

Alternative Fuels Data Center: Maps and Data

Science.gov Websites

fleet type from 1992-2014 Last update August 2016 View Graph Graph Download Data Generated_thumb20160830 Trend of S&FP AFV acquisitions by fuel type from 1992-2015 Last update August 2016 View Graph Graph transactions from 1997-2014 Last update August 2016 View Graph Graph Download Data Biofuelsatlas BioFuels Atlas

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

Rule-based graph theory to enable exploration of the space system architecture design space

NASA Astrophysics Data System (ADS)

Arney, Dale Curtis

The primary goal of this research is to improve upon system architecture modeling in order to enable the exploration of design space options. A system architecture is the description of the functional and physical allocation of elements and the relationships, interactions, and interfaces between those elements necessary to satisfy a set of constraints and requirements. The functional allocation defines the functions that each system (element) performs, and the physical allocation defines the systems required to meet those functions. Trading the functionality between systems leads to the architecture-level design space that is available to the system architect. The research presents a methodology that enables the modeling of complex space system architectures using a mathematical framework. To accomplish the goal of improved architecture modeling, the framework meets five goals: technical credibility, adaptability, flexibility, intuitiveness, and exhaustiveness. The framework is technically credible, in that it produces an accurate and complete representation of the system architecture under consideration. The framework is adaptable, in that it provides the ability to create user-specified locations, steady states, and functions. The framework is flexible, in that it allows the user to model system architectures to multiple destinations without changing the underlying framework. The framework is intuitive for user input while still creating a comprehensive mathematical representation that maintains the necessary information to completely model complex system architectures. Finally, the framework is exhaustive, in that it provides the ability to explore the entire system architecture design space. After an extensive search of the literature, graph theory presents a valuable mechanism for representing the flow of information or vehicles within a simple mathematical framework. Graph theory has been used in developing mathematical models of many transportation and network flow problems in the past, where nodes represent physical locations and edges represent the means by which information or vehicles travel between those locations. In space system architecting, expressing the physical locations (low-Earth orbit, low-lunar orbit, etc.) and steady states (interplanetary trajectory) as nodes and the different means of moving between the nodes (propulsive maneuvers, etc.) as edges formulates a mathematical representation of this design space. The selection of a given system architecture using graph theory entails defining the paths that the systems take through the space system architecture graph. A path through the graph is defined as a list of edges that are traversed, which in turn defines functions performed by the system. A structure to compactly represent this information is a matrix, called the system map, in which the column indices are associated with the systems that exist and row indices are associated with the edges, or functions, to which each system has access. Several contributions have been added to the state of the art in space system architecture analysis. The framework adds the capability to rapidly explore the design space without the need to limit trade options or the need for user interaction during the exploration process. The unique mathematical representation of a system architecture, through the use of the adjacency, incidence, and system map matrices, enables automated design space exploration using stochastic optimization processes. The innovative rule-based graph traversal algorithm ensures functional feasibility of each system architecture that is analyzed, and the automatic generation of the system hierarchy eliminates the need for the user to manually determine the relationships between systems during or before the design space exploration process. Finally, the rapid evaluation of system architectures for various mission types enables analysis of the system architecture design space for multiple destinations within an evolutionary exploration program. (Abstract shortened by UMI.).

Flow solution on a dual-block grid around an airplane

NASA Technical Reports Server (NTRS)

Eriksson, Lars-Erik

1987-01-01

The compressible flow around a complex fighter-aircraft configuration (fuselage, cranked delta wing, canard, and inlet) is simulated numerically using a novel grid scheme and a finite-volume Euler solver. The patched dual-block grid is generated by an algebraic procedure based on transfinite interpolation, and the explicit Runge-Kutta time-stepping Euler solver is implemented with a high degree of vectorization on a Cyber 205 processor. Results are presented in extensive graphs and diagrams and characterized in detail. The concentration of grid points near the wing apex in the present scheme is shown to facilitate capture of the vortex generated by the leading edge at high angles of attack and modeling of its interaction with the canard wake.

Numerical study for heat generation/absorption in flow of nanofluid by a rotating disk

NASA Astrophysics Data System (ADS)

Aziz, Arsalan; Alsaedi, Ahmed; Muhammad, Taseer; Hayat, Tasawar

2018-03-01

Here MHD three-dimensional flow of viscous nanoliquid by a rotating disk with heat generation/absorption and slip effects is addressed. Thermophoresis and random motion features are also incorporated. Velocity, temperature and concentration slip conditions are imposed at boundary. Applied magnetic field is utilized. Low magnetic Reynolds number and boundary layer approximations have been employed in the problem formulation. Suitable transformations lead to strong nonlinear ordinary differential system. The obtained nonlinear system is solved numerically through NDSolve technique. Graphs have been sketched in order to analyze that how the velocity, temperature and concentration fields are affected by various pertinent variables. Moreover the numerical values for rates of heat and mass transfer have been tabulated and discussed.

Drought in California; water resources data for 1977

USGS Publications Warehouse

Jorgensen, Leonard N.; Pearce, Verrie F.

1978-01-01

The 2-year dry period 1976-77 was the most severe drought in northern California 's history, and the quantity and quality of all water-supply sources in the State were affected. This report contains special water-resources data collected by the Geological Survey during 1977. These data include: streamflow at 11 selected stations, comparing the 1977 mean monthly and yearly flow to the period-of-record medians; base-flow measurements at 189 selected sites; water quality at 131 selected sites; ground-water levels in wells and river stages along a 158-mile reach of the Sacramento River; and, finally, graphs showing the effect of tidal action on suspended-sediment concentration at the stream-gaging station on the Sacramento River at Sacramento. (Woodard-USGS)

SING: Subgraph search In Non-homogeneous Graphs

PubMed Central

2010-01-01

Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. PMID:20170516

DDR: efficient computational method to predict drug-target interactions using graph mining and machine learning approaches.

PubMed

Olayan, Rawan S; Ashoor, Haitham; Bajic, Vladimir B

2018-04-01

Finding computationally drug-target interactions (DTIs) is a convenient strategy to identify new DTIs at low cost with reasonable accuracy. However, the current DTI prediction methods suffer the high false positive prediction rate. We developed DDR, a novel method that improves the DTI prediction accuracy. DDR is based on the use of a heterogeneous graph that contains known DTIs with multiple similarities between drugs and multiple similarities between target proteins. DDR applies non-linear similarity fusion method to combine different similarities. Before fusion, DDR performs a pre-processing step where a subset of similarities is selected in a heuristic process to obtain an optimized combination of similarities. Then, DDR applies a random forest model using different graph-based features extracted from the DTI heterogeneous graph. Using 5-repeats of 10-fold cross-validation, three testing setups, and the weighted average of area under the precision-recall curve (AUPR) scores, we show that DDR significantly reduces the AUPR score error relative to the next best start-of-the-art method for predicting DTIs by 34% when the drugs are new, by 23% when targets are new and by 34% when the drugs and the targets are known but not all DTIs between them are not known. Using independent sources of evidence, we verify as correct 22 out of the top 25 DDR novel predictions. This suggests that DDR can be used as an efficient method to identify correct DTIs. The data and code are provided at https://bitbucket.org/RSO24/ddr/. vladimir.bajic@kaust.edu.sa. Supplementary data are available at Bioinformatics online.

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

Spectral partitioning in equitable graphs.

PubMed

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Spectral partitioning in equitable graphs

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Proceedings of the Workshop on Future Directions in Computer Architecture and Software, Held in Charleston, South Carolina on 5-7 May 1986,

DTIC Science & Technology

1986-08-30

as write traffic begins to interfere with access sor, and a moderate performance bus, it is to each cache. (3) Directory methods (see, e.g. possible...less reliable because of the greater possibility of interference . Ease of programming is important. Mapping a complicated algorithm flow graph to a... interference . These features enable the use of fine granularity and recon- figurabilitv. Each intersection in a crossba, witch. Fig. 2a. ha, a switch

Program Flow Analyzer. Volume 3

DTIC Science & Technology

1984-08-01

metrics are defined using these basic terms. Of interest is another measure for the size of the program, called the volume: V N x log 2 n. 5 The unit of...correlated to actual data and most useful for test. The formula des - cribing difficulty may be expressed as: nl X N2D - 2 -I/L *Difficulty then, is the...linearly independent program paths through any program graph. A maximal set of these linearly independent paths, called a "basis set," can always be found

Data for floods of May 1978 in northeastern Wyoming and southeastern Montana

USGS Publications Warehouse

Parrett, Charles; Carlson, D.D.; Craig, G.S.; Hull, J.A.

1978-01-01

Severe flooding in northeastern Wyoming and southeastern Montana in May 1978 is described by tables of data, graphs, and photographs. Flood peaks were determined at 162 sites in the flooded area. At most of the sites, peak discharges were determined from existing stage-discharge relationship curves, and at 30 of the sites indirect flow measurements were made. At 19 sites, the May 1978 peak discharge exceeded the previous peak of record and also exceeded the computed 100-year frequency flood. (Woodard-USGS)

Well-Covered Graphs: A Survey

DTIC Science & Technology

1991-01-01

critical G’s/# G’s -) 0 as IV(G)I -- oo? References [B1] C. Berge, Regularizable graphs, Ann. Discrete Math ., 3, 1978, 11-19. [B2] _ _, Some common...Springer-Verlag, Berlin, 1980, 108-123. [B3] _ _, Some common properties for regularizable graphs, edge-critical graphs, and B-graphs, Ann. Discrete Math ., 12...graphs - an extension of the K6nig-Egervgiry theorem, Discrete Math ., 27, 1979, 23-33. [ER] M.N Ellingham and G.F. Royle, Well-covered cubic graphs

A conceptual model for quantifying connectivity using graph theory and cellular (per-pixel) approach

NASA Astrophysics Data System (ADS)

Singh, Manudeo; Sinha, Rajiv; Tandon, Sampat K.

2016-04-01

The concept of connectivity is being increasingly used for understanding hydro-geomorphic processes at all spatio-temporal scales. Connectivity is defined as the potential for energy and material flux (water, sediments, nutrients, heat, etc.) to navigate within or between the landscape systems and has two components, structural connectivity and dynamic connectivity. Structural connectivity is defined by the spatially connected features (physical linkages) through which energy and materials flow. Dynamic connectivity is a process defined connectivity component. These two connectivity components also interact with each other by forming a feedback system. This study attempts to explore a method to quantify structural and dynamic connectivity. In fluvial transport systems, sediment and water can flow in either a diffused manner or in a channelized way. At all the scales, hydrological and sediment fluxes can be tracked using a cellular (per-pixel) approach and can be quantified using graphical approach. The material flux, slope and LULC (Land Use Land Cover) weightage factors of a pixel together determine if it will contribute towards connectivity of the landscape/system. In a graphical approach, all the contributing pixels will form a node at their centroid and this node will be connected to the next 'down-node' via a directed edge with 'least cost path'. The length of the edge will depend on the desired spatial scale and its path direction will depend on the traversed pixel's slope and the LULC (weightage) factors. The weightage factors will lie in-between 0 to 1. This value approaches 1 for the LULC factors which promote connectivity. For example, in terms of sediment connectivity, the weightage could be RUSLE (Revised Universal Soil Loss Equation) C-factors with bare unconsolidated surfaces having values close to 1. This method is best suited for areas with low slopes, where LULC can be a deciding as well as dominating factor. The degree of connectivity and its pathways will show changes under different LULC conditions even if the slope remains the same. The graphical approach provides the statistics of connected and disconnected graph elements (edges, nodes) and graph components, thereby allowing the quantification of structural connectivity. This approach also quantifies the dynamic connectivity by allowing the measurement of the fluxes (e.g. via hydrographs or sedimentographs) at any node as well as at any system outlet. The contribution of any sub-system can be understood by removing the remaining sub-systems which can be conveniently achieved by masking associated graph elements.

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows

PubMed Central

Wang, Di; Kleinberg, Robert D.

2009-01-01

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C2, C3, C4,…. It is known that C2 can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing Ck (k > 2) require solving a linear program. In this paper we prove that C3 can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}n, this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network. PMID:20161596

Analyzing Quadratic Unconstrained Binary Optimization Problems Via Multicommodity Flows.

PubMed

Wang, Di; Kleinberg, Robert D

2009-11-28

Quadratic Unconstrained Binary Optimization (QUBO) problems concern the minimization of quadratic polynomials in n {0, 1}-valued variables. These problems are NP-complete, but prior work has identified a sequence of polynomial-time computable lower bounds on the minimum value, denoted by C(2), C(3), C(4),…. It is known that C(2) can be computed by solving a maximum-flow problem, whereas the only previously known algorithms for computing C(k) (k > 2) require solving a linear program. In this paper we prove that C(3) can be computed by solving a maximum multicommodity flow problem in a graph constructed from the quadratic function. In addition to providing a lower bound on the minimum value of the quadratic function on {0, 1}(n), this multicommodity flow problem also provides some information about the coordinates of the point where this minimum is achieved. By looking at the edges that are never saturated in any maximum multicommodity flow, we can identify relational persistencies: pairs of variables that must have the same or different values in any minimizing assignment. We furthermore show that all of these persistencies can be detected by solving single-commodity flow problems in the same network.

Couple stress fluid flow in a rotating channel with peristalsis

NASA Astrophysics Data System (ADS)

Abd elmaboud, Y.; Abdelsalam, Sara I.; Mekheimer, Kh. S.

2018-04-01

This article describes a new model for obtaining closed-form semi-analytical solutions of peristaltic flow induced by sinusoidal wave trains propagating with constant speed on the walls of a two-dimensional rotating infinite channel. The channel rotates with a constant angular speed about the z - axis and is filled with couple stress fluid. The governing equations of the channel deformation and the flow rate inside the channel are derived using the lubrication theory approach. The resulting equations are solved, using the homotopy perturbation method (HPM), for exact solutions to the longitudinal velocity distribution, pressure gradient, flow rate due to secondary velocity, and pressure rise per wavelength. The effect of various values of physical parameters, such as, Taylor's number and couple stress parameter, together with some interesting features of peristaltic flow are discussed through graphs. The trapping phenomenon is investigated for different values of parameters under consideration. It is shown that Taylor's number and the couple stress parameter have an increasing effect on the longitudinal velocity distribution till half of the channel, on the flow rate due to secondary velocity, and on the number of closed streamlines circulating the bolus.

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

NASA Astrophysics Data System (ADS)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

GBS 1.0

DOE Office of Scientific and Technical Information (OSTI.GOV)

2010-09-30

The Umbra gbs (Graph-Based Search) library provides implementations of graph-based search/planning algorithms that can be applied to legacy graph data structures. Unlike some other graph algorithm libraries, this one does not require your graph class to inherit from a specific base class. Implementations of Dijkstra's Algorithm and A-Star search are included and can be used with graphs that are lazily-constructed.

Information visualisation based on graph models

NASA Astrophysics Data System (ADS)

Kasyanov, V. N.; Kasyanova, E. V.

2013-05-01

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models.

Polysemy in the Domain-Specific Pedagogical Use of Graphs in Science Textbooks: The Case of an Electrocardiogram

ERIC Educational Resources Information Center

van Eijck, Michiel; Goedhart, Martin J.; Ellermeijer, Ton

2011-01-01

Polysemy in graph-related practices is the phenomenon that a single graph can sustain different meanings assigned to it. Considerable research has been done on polysemy in graph-related practices in school science in which graphs are rather used as scientific tools. However, graphs in science textbooks are also used rather pedagogically to…

Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

NASA Astrophysics Data System (ADS)

Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

2016-05-01

We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

New methods for analyzing semantic graph based assessments in science education

NASA Astrophysics Data System (ADS)

Vikaros, Lance Steven

This research investigated how the scoring of semantic graphs (known by many as concept maps) could be improved and automated in order to address issues of inter-rater reliability and scalability. As part of the NSF funded SENSE-IT project to introduce secondary school science students to sensor networks (NSF Grant No. 0833440), semantic graphs illustrating how temperature change affects water ecology were collected from 221 students across 16 schools. The graphing task did not constrain students' use of terms, as is often done with semantic graph based assessment due to coding and scoring concerns. The graphing software used provided real-time feedback to help students learn how to construct graphs, stay on topic and effectively communicate ideas. The collected graphs were scored by human raters using assessment methods expected to boost reliability, which included adaptations of traditional holistic and propositional scoring methods, use of expert raters, topical rubrics, and criterion graphs. High levels of inter-rater reliability were achieved, demonstrating that vocabulary constraints may not be necessary after all. To investigate a new approach to automating the scoring of graphs, thirty-two different graph features characterizing graphs' structure, semantics, configuration and process of construction were then used to predict human raters' scoring of graphs in order to identify feature patterns correlated to raters' evaluations of graphs' topical accuracy and complexity. Results led to the development of a regression model able to predict raters' scoring with 77% accuracy, with 46% accuracy expected when used to score new sets of graphs, as estimated via cross-validation tests. Although such performance is comparable to other graph and essay based scoring systems, cross-context testing of the model and methods used to develop it would be needed before it could be recommended for widespread use. Still, the findings suggest techniques for improving the reliability and scalability of semantic graph based assessments without requiring constraint of how ideas are expressed.

Biometric Subject Verification Based on Electrocardiographic Signals

NASA Technical Reports Server (NTRS)

Dusan, Sorin V. (Inventor); Jorgensen, Charles C. (Inventor)

2014-01-01

A method of authenticating or declining to authenticate an asserted identity of a candidate-person. In an enrollment phase, a reference PQRST heart action graph is provided or constructed from information obtained from a plurality of graphs that resemble each other for a known reference person, using a first graph comparison metric. In a verification phase, a candidate-person asserts his/her identity and presents a plurality of his/her heart cycle graphs. If a sufficient number of the candidate-person's measured graphs resemble each other, a representative composite graph is constructed from the candidate-person's graphs and is compared with a composite reference graph, for the person whose identity is asserted, using a second graph comparison metric. When the second metric value lies in a selected range, the candidate-person's assertion of identity is accepted.

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

DOE Office of Scientific and Technical Information (OSTI.GOV)

Sengupta, Dipanjan; Song, Shuaiwen

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirablemore » and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.« less

The signaling helix: a common functional theme in diverse signaling proteins

PubMed Central

Anantharaman, Vivek; Balaji, S; Aravind, L

2006-01-01

Background The mechanism by which the signals are transmitted between receptor and effector domains in multi-domain signaling proteins is poorly understood. Results Using sensitive sequence analysis methods we identify a conserved helical segment of around 40 residues in a wide range of signaling proteins, including numerous sensor histidine kinases such as Sln1p, and receptor guanylyl cyclases such as the atrial natriuretic peptide receptor and nitric oxide receptors. We term this helical segment the signaling (S)-helix and present evidence that it forms a novel parallel coiled-coil element, distinct from previously known helical segments in signaling proteins, such as the Dimerization-Histidine phosphotransfer module of histidine kinases, the intra-cellular domains of the chemotaxis receptors, inter-GAF domain helical linkers and the α-helical HAMP module. Analysis of domain architectures allowed us to reconstruct the domain-neighborhood graph for the S-helix, which showed that the S-helix almost always occurs between two signaling domains. Several striking patterns in the domain neighborhood of the S-helix also became evident from the graph. It most often separates diverse N-terminal sensory domains from various C-terminal catalytic signaling domains such as histidine kinases, cNMP cyclase, PP2C phosphatases, NtrC-like AAA+ ATPases and diguanylate cyclases. It might also occur between two sensory domains such as PAS domains and occasionally between a DNA-binding HTH domain and a sensory domain. The sequence conservation pattern of the S-helix revealed the presence of a unique constellation of polar residues in the dimer-interface positions within the central heptad of the coiled-coil formed by the S-helix. Conclusion Combining these observations with previously reported mutagenesis studies on different S-helix-containing proteins we suggest that it functions as a switch that prevents constitutive activation of linked downstream signaling domains. However, upon occurrence of specific conformational changes due to binding of ligand or other sensory inputs in a linked upstream domain it transmits the signal to the downstream domain. Thus, the S-helix represents one of the most prevalent functional themes involved in the flow of signals between modules in diverse prokaryote-type multi-domain signaling proteins. Reviewers This article was reviewed by Frank Eisenhaber, Arcady Mushegian and Sandor Pongor. PMID:16953892

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

Efficient dynamic graph construction for inductive semi-supervised learning.

PubMed

Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y

2017-10-01

Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

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.

Chemical Applications of Graph Theory: Part II. Isomer Enumeration.

ERIC Educational Resources Information Center

Hansen, Peter J.; Jurs, Peter C.

1988-01-01

Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

Exploring Text and Icon Graph Interpretation in Students with Dyslexia: An Eye-tracking Study.

PubMed

Kim, Sunjung; Wiseheart, Rebecca

2017-02-01

A growing body of research suggests that individuals with dyslexia struggle to use graphs efficiently. Given the persistence of orthographic processing deficits in dyslexia, this study tested whether graph interpretation deficits in dyslexia are directly related to difficulties processing the orthographic components of graphs (i.e. axes and legend labels). Participants were 80 college students with and without dyslexia. Response times and eye movements were recorded as students answered comprehension questions about simple data displayed in bar graphs. Axes and legends were labelled either with words (mixed-modality graphs) or icons (orthography-free graphs). Students also answered informationally equivalent questions presented in sentences (orthography-only condition). Response times were slower in the dyslexic group only for processing sentences. However, eye tracking data revealed group differences for processing mixed-modality graphs, whereas no group differences were found for the orthography-free graphs. When processing bar graphs, students with dyslexia differ from their able reading peers only when graphs contain orthographic features. Implications for processing informational text are discussed. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

Learning about Science Graphs and Word Games. Superific Science Book V. A Good Apple Science Activity Book for Grades 5-8+.

ERIC Educational Resources Information Center

Conway, Lorraine

This packet of student materials contains a variety of worksheet activities dealing with science graphs and science word games. These reproducible materials deal with: (1) bar graphs; (2) line graphs; (3) circle graphs; (4) pictographs; (5) histograms; (6) artgraphs; (7) designing your own graphs; (8) medical prefixes; (9) color prefixes; (10)…

Test for contamination of MgF2 - coated mirrors

NASA Technical Reports Server (NTRS)

Bunner, A. N.; Bartoe, J. D.; Triolo, J.

1983-01-01

Graphs show preflight and postflight reflectivities in percent for exposed and covered mirrors carried on the OSS-1 payload pallet during STS-3. No changes greater than 1.8 sigma were observed except for a fingerprint. Weak evidence for degradation at 1216 A and 1600 A was found in several samples. There was no difference between flight mirrors and control mirrors. Covered samples suffered more than samples exposed to the Sun, but the differences are barely significant. The exposed side of the flight mirrors were somewhat dusty. No evidence was found for permanent solar-induced or shuttle-induced deterioration. There also was no evidence on oil-pumped vacuum versus oil-free vacuum during coating.

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

PubMed

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Graphing Polar Curves

ERIC Educational Resources Information Center

Lawes, Jonathan F.

2013-01-01

Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

On the locating-chromatic number for graphs with two homogenous components

NASA Astrophysics Data System (ADS)

Welyyanti, Des; Baskoro, Edy Tri; Simajuntak, Rinovia; Uttunggadewa, Saladin

2017-10-01

The locating-chromatic number of a graph was introduced by Chartrand et al. in 2002. The concept of the locating-chromatic number is a marriage between graph coloring and the notion of graph partition dimension. This concept is only for connected graphs. In [8], we extended this concept also for disconnected graphs. In this paper, we determine the locating- chromatic number of a graph with two components. In particular, we determine such values if the components are homogeneous and each component has locating-chromatic number 3.

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE Office of Scientific and Technical Information (OSTI.GOV)

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less