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.

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.

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.

Dynamic graph cuts for efficient inference in Markov Random Fields.

PubMed

Kohli, Pushmeet; Torr, Philip H S

2007-12-01

Abstract-In this paper we present a fast new fully dynamic algorithm for the st-mincut/max-flow problem. We show how this algorithm can be used to efficiently compute MAP solutions for certain dynamically changing MRF models in computer vision such as image segmentation. Specifically, given the solution of the max-flow problem on a graph, the dynamic algorithm efficiently computes the maximum flow in a modified version of the graph. The time taken by it is roughly proportional to the total amount of change in the edge weights of the graph. Our experiments show that, when the number of changes in the graph is small, the dynamic algorithm is significantly faster than the best known static graph cut algorithm. We test the performance of our algorithm on one particular problem: the object-background segmentation problem for video. It should be noted that the application of our algorithm is not limited to the above problem, the algorithm is generic and can be used to yield similar improvements in many other cases that involve dynamic change.

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

Evidence flow graph methods for validation and verification of expert systems

NASA Technical Reports Server (NTRS)

Becker, Lee A.; Green, Peter G.; Bhatnagar, Jayant

1989-01-01

The results of an investigation into the use of evidence flow graph techniques for performing validation and verification of expert systems are given. A translator to convert horn-clause rule bases into evidence flow graphs, a simulation program, and methods of analysis were developed. These tools were then applied to a simple rule base which contained errors. It was found that the method was capable of identifying a variety of problems, for example that the order of presentation of input data or small changes in critical parameters could affect the output from a set of rules.

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.

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

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.

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

Evidence flow graph methods for validation and verification of expert systems

NASA Technical Reports Server (NTRS)

Becker, Lee A.; Green, Peter G.; Bhatnagar, Jayant

1988-01-01

This final report describes the results of an investigation into the use of evidence flow graph techniques for performing validation and verification of expert systems. This was approached by developing a translator to convert horn-clause rule bases into evidence flow graphs, a simulation program, and methods of analysis. These tools were then applied to a simple rule base which contained errors. It was found that the method was capable of identifying a variety of problems, for example that the order of presentation of input data or small changes in critical parameters could effect the output from a set of rules.

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.

Horizontal visibility graphs generated by type-I intermittency

NASA Astrophysics Data System (ADS)

Núñez, Ángel M.; Luque, Bartolo; Lacasa, Lucas; Gómez, Jose Patricio; Robledo, Alberto

2013-05-01

The type-I intermittency route to (or out of) chaos is investigated within the horizontal visibility (HV) graph theory. For that purpose, we address the trajectories generated by unimodal maps close to an inverse tangent bifurcation and construct their associated HV graphs. We show how the alternation of laminar episodes and chaotic bursts imprints a fingerprint in the resulting graph structure. Accordingly, we derive a phenomenological theory that predicts quantitative values for several network parameters. In particular, we predict that the characteristic power-law scaling of the mean length of laminar trend sizes is fully inherited by the variance of the graph degree distribution, in good agreement with the numerics. We also report numerical evidence on how the characteristic power-law scaling of the Lyapunov exponent as a function of the distance to the tangent bifurcation is inherited in the graph by an analogous scaling of block entropy functionals defined on the graph. Furthermore, we are able to recast the full set of HV graphs generated by intermittent dynamics into a renormalization-group framework, where the fixed points of its graph-theoretical renormalization-group flow account for the different types of dynamics. We also establish that the nontrivial fixed point of this flow coincides with the tangency condition and that the corresponding invariant graph exhibits extremal entropic properties.

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.

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

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.

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.

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

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

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.

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…

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.

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

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.

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.

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.

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.

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.

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 Graph Based Approach to Nonlinear Model Predictive Control with Application to Combustion Control and Flow Control

DTIC Science & Technology

2015-08-21

plants (200 MW and above) produce the majority of the nation’s energy demands, and these are the most heavily regulated by the EPA . The automotive...existing engines are not achieving the best possible efficiency. As in the electric power industry, EPA regulation is a major factor in the US...automotive engine market. Cummins, for example, was the only company in the market to meet the 2010 EPA standards for NOx emissions with their release of a 6.7

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.

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.

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.

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.

The RiverFish Approach to Business Process Modeling: Linking Business Steps to Control-Flow Patterns

NASA Astrophysics Data System (ADS)

Zuliane, Devanir; Oikawa, Marcio K.; Malkowski, Simon; Alcazar, José Perez; Ferreira, João Eduardo

Despite the recent advances in the area of Business Process Management (BPM), today’s business processes have largely been implemented without clearly defined conceptual modeling. This results in growing difficulties for identification, maintenance, and reuse of rules, processes, and control-flow patterns. To mitigate these problems in future implementations, we propose a new approach to business process modeling using conceptual schemas, which represent hierarchies of concepts for rules and processes shared among collaborating information systems. This methodology bridges the gap between conceptual model description and identification of actual control-flow patterns for workflow implementation. We identify modeling guidelines that are characterized by clear phase separation, step-by-step execution, and process building through diagrams and tables. The separation of business process modeling in seven mutually exclusive phases clearly delimits information technology from business expertise. The sequential execution of these phases leads to the step-by-step creation of complex control-flow graphs. The process model is refined through intuitive table and diagram generation in each phase. Not only does the rigorous application of our modeling framework minimize the impact of rule and process changes, but it also facilitates the identification and maintenance of control-flow patterns in BPM-based information system architectures.

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.

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.

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.

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.

Benchmarking Measures of Network Controllability on Canonical Graph Models

NASA Astrophysics Data System (ADS)

Wu-Yan, Elena; Betzel, Richard F.; Tang, Evelyn; Gu, Shi; Pasqualetti, Fabio; Bassett, Danielle S.

2018-03-01

The control of networked dynamical systems opens the possibility for new discoveries and therapies in systems biology and neuroscience. Recent theoretical advances provide candidate mechanisms by which a system can be driven from one pre-specified state to another, and computational approaches provide tools to test those mechanisms in real-world systems. Despite already having been applied to study network systems in biology and neuroscience, the practical performance of these tools and associated measures on simple networks with pre-specified structure has yet to be assessed. Here, we study the behavior of four control metrics (global, average, modal, and boundary controllability) on eight canonical graphs (including Erdős-Rényi, regular, small-world, random geometric, Barábasi-Albert preferential attachment, and several modular networks) with different edge weighting schemes (Gaussian, power-law, and two nonparametric distributions from brain networks, as examples of real-world systems). We observe that differences in global controllability across graph models are more salient when edge weight distributions are heavy-tailed as opposed to normal. In contrast, differences in average, modal, and boundary controllability across graph models (as well as across nodes in the graph) are more salient when edge weight distributions are less heavy-tailed. Across graph models and edge weighting schemes, average and modal controllability are negatively correlated with one another across nodes; yet, across graph instances, the relation between average and modal controllability can be positive, negative, or nonsignificant. Collectively, these findings demonstrate that controllability statistics (and their relations) differ across graphs with different topologies and that these differences can be muted or accentuated by differences in the edge weight distributions. More generally, our numerical studies motivate future analytical efforts to better understand the mathematical underpinnings of the relationship between graph topology and control, as well as efforts to design networks with specific control profiles.

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.

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.

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

Accelerated stress testing of amorphous silicon solar cells

NASA Technical Reports Server (NTRS)

Stoddard, W. G.; Davis, C. W.; Lathrop, J. W.

1985-01-01

A technique for performing accelerated stress tests of large-area thin a-Si solar cells is presented. A computer-controlled short-interval test system employing low-cost ac-powered ELH illumination and a simulated a-Si reference cell (seven individually bandpass-filtered zero-biased crystalline PIN photodiodes) calibrated to the response of an a-Si control cell is described and illustrated with flow diagrams, drawings, and graphs. Preliminary results indicate that while most tests of a program developed for c-Si cells are applicable to a-Si cells, spurious degradation may appear in a-Si cells tested at temperatures above 130 C.

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)

Decentralized Estimation and Control for Preserving the Strong Connectivity of Directed Graphs.

PubMed

Sabattini, Lorenzo; Secchi, Cristian; Chopra, Nikhil

2015-10-01

In order to accomplish cooperative tasks, decentralized systems are required to communicate among each other. Thus, maintaining the connectivity of the communication graph is a fundamental issue. Connectivity maintenance has been extensively studied in the last few years, but generally considering undirected communication graphs. In this paper, we introduce a decentralized control and estimation strategy to maintain the strong connectivity property of directed communication graphs. In particular, we introduce a hierarchical estimation procedure that implements power iteration in a decentralized manner, exploiting an algorithm for balancing strongly connected directed graphs. The output of the estimation system is then utilized for guaranteeing preservation of the strong connectivity property. The control strategy is validated by means of analytical proofs and simulation results.

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

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

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.

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

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

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.

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.

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.

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.

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

Functional test generation for digital circuits described with a declarative language: LUSTRE

NASA Astrophysics Data System (ADS)

Almahrous, Mazen

1990-08-01

A functional approach to the test generation problem starting from a high level description is proposed. The circuit tested is modeled, using the LUSTRE high level data flow description language. The different LUSTRE primitives are translated to a SATAN format graph in order to evaluate the testability of the circuit and to generate test sequences. Another method of testing the complex circuits comprising an operative part and a control part is defined. It consists of checking experiments for the control part observed through the operative part. It was applied to the automata generated from a LUSTRE description of the circuit.

Algorithms and software used in selecting structure of machine-training cluster based on neurocomputers

NASA Astrophysics Data System (ADS)

Romanchuk, V. A.; Lukashenko, V. V.

2018-05-01

The technique of functioning of a control system by a computing cluster based on neurocomputers is proposed. Particular attention is paid to the method of choosing the structure of the computing cluster due to the fact that the existing methods are not effective because of a specialized hardware base - neurocomputers, which are highly parallel computer devices with an architecture different from the von Neumann architecture. A developed algorithm for choosing the computational structure of a cloud cluster is described, starting from the direction of data transfer in the flow control graph of the program and its adjacency matrix.

Quantification of Graph Complexity Based on the Edge Weight Distribution Balance: Application to Brain Networks.

PubMed

Gomez-Pilar, Javier; Poza, Jesús; Bachiller, Alejandro; Gómez, Carlos; Núñez, Pablo; Lubeiro, Alba; Molina, Vicente; Hornero, Roberto

2018-02-01

The aim of this study was to introduce a novel global measure of graph complexity: Shannon graph complexity (SGC). This measure was specifically developed for weighted graphs, but it can also be applied to binary graphs. The proposed complexity measure was designed to capture the interplay between two properties of a system: the 'information' (calculated by means of Shannon entropy) and the 'order' of the system (estimated by means of a disequilibrium measure). SGC is based on the concept that complex graphs should maintain an equilibrium between the aforementioned two properties, which can be measured by means of the edge weight distribution. In this study, SGC was assessed using four synthetic graph datasets and a real dataset, formed by electroencephalographic (EEG) recordings from controls and schizophrenia patients. SGC was compared with graph density (GD), a classical measure used to evaluate graph complexity. Our results showed that SGC is invariant with respect to GD and independent of node degree distribution. Furthermore, its variation with graph size [Formula: see text] is close to zero for [Formula: see text]. Results from the real dataset showed an increment in the weight distribution balance during the cognitive processing for both controls and schizophrenia patients, although these changes are more relevant for controls. Our findings revealed that SGC does not need a comparison with null-hypothesis networks constructed by a surrogate process. In addition, SGC results on the real dataset suggest that schizophrenia is associated with a deficit in the brain dynamic reorganization related to secondary pathways of the brain network.

Distributed Computing Framework for Synthetic Radar Application

NASA Technical Reports Server (NTRS)

Gurrola, Eric M.; Rosen, Paul A.; Aivazis, Michael

2006-01-01

We are developing an extensible software framework, in response to Air Force and NASA needs for distributed computing facilities for a variety of radar applications. The objective of this work is to develop a Python based software framework, that is the framework elements of the middleware that allows developers to control processing flow on a grid in a distributed computing environment. Framework architectures to date allow developers to connect processing functions together as interchangeable objects, thereby allowing a data flow graph to be devised for a specific problem to be solved. The Pyre framework, developed at the California Institute of Technology (Caltech), and now being used as the basis for next-generation radar processing at JPL, is a Python-based software framework. We have extended the Pyre framework to include new facilities to deploy processing components as services, including components that monitor and assess the state of the distributed network for eventual real-time control of grid resources.

Graphs for information security control in software defined networks

NASA Astrophysics Data System (ADS)

Grusho, Alexander A.; Abaev, Pavel O.; Shorgin, Sergey Ya.; Timonina, Elena E.

2017-07-01

Information security control in software defined networks (SDN) is connected with execution of the security policy rules regulating information accesses and protection against distribution of the malicious code and harmful influences. The paper offers a representation of a security policy in the form of hierarchical structure which in case of distribution of resources for the solution of tasks defines graphs of admissible interactions in a networks. These graphs define commutation tables of switches via the SDN controller.

Integrated risk/cost planning models for the US Air Traffic system

NASA Technical Reports Server (NTRS)

Mulvey, J. M.; Zenios, S. A.

1985-01-01

A prototype network planning model for the U.S. Air Traffic control system is described. The model encompasses the dual objectives of managing collision risks and transportation costs where traffic flows can be related to these objectives. The underlying structure is a network graph with nonseparable convex costs; the model is solved efficiently by capitalizing on its intrinsic characteristics. Two specialized algorithms for solving the resulting problems are described: (1) truncated Newton, and (2) simplicial decomposition. The feasibility of the approach is demonstrated using data collected from a control center in the Midwest. Computational results with different computer systems are presented, including a vector supercomputer (CRAY-XMP). The risk/cost model has two primary uses: (1) as a strategic planning tool using aggregate flight information, and (2) as an integrated operational system for forecasting congestion and monitoring (controlling) flow throughout the U.S. In the latter case, access to a supercomputer is required due to the model's enormous size.

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.

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.

Effects of flow-path variations on internal reversing flow in a tailpipe offtake configuration for ASTOVL aircraft

NASA Technical Reports Server (NTRS)

Mcardle, Jack G.; Esker, Barbara S.

1993-01-01

A one-third-scale model of a generic tailpipe offtake system for an advanced short takeoff, vertical landing (ASTOVL) aircraft was tested at the NASA Lewis Research Center Powered Lift Facility. The basic model consisted of a tailpipe with a center body to form an annulus simulating turbine outflow with no swirl; twin offtake ducts with elbows at the ends to turn the flow to a downward direction; flow control nozzles at the ends of the elbows; and a blind flange at the end of the tailpipe to simulate a closed cruise nozzle. The offtake duct-to-tailpipe diameter ratio was 0.74. Modifications of a generic nature were then made to this basic configuration to measure the effects of flow-path changes on the flow and pressure-loss characteristics. The modifications included adding rounded entrances at the forward edges of the offtake openings, blocking the tailpipe just aft the openings instead of at the cruise nozzle, changing the location of the openings along the tailpipe, removing the center body, and varying the Mach number (flow rate) over a wide range in the tailpipe ahead of the openings by changing the size of the flow control nozzles. The tests were made with unheated air at tailpipe-to-ambient pressure ratios from 1.4 to 5. Results are presented and compared with performance graphs, total-pressure contour plots, paint streak flow visualization photographs, and a flow-angle probe traverse at the offtake entrance.

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.

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.

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.

United States Air Force Summer Research Program -- 1993 Summer Research Program Final Reports. Volume 11. Arnold Engineering Development Center, Frank J. Seiler Research Laboratory, Wilford Hall Medical Center

DTIC Science & Technology

1993-01-01

external parameters such as airflow, temperature, pressure, etc, are measured. Turbine Engine testing generates massive volumes of data at very high...a form that describes the signal flow graph topology as well as specific parameters of the processing blocks in the diagram. On multiprocessor...provides an interface to the symbolic builder and control functions such that parameters may be set during the build operation that will affect the

Aerodynamic design trends for commercial aircraft

NASA Technical Reports Server (NTRS)

Hilbig, R.; Koerner, H.

1986-01-01

Recent research on advanced-configuration commercial aircraft at DFVLR is surveyed, with a focus on aerodynamic approaches to improved performance. Topics examined include transonic wings with variable camber or shock/boundary-layer control, wings with reduced friction drag or laminarized flow, prop-fan propulsion, and unusual configurations or wing profiles. Drawings, diagrams, and graphs of predicted performance are provided, and the need for extensive development efforts using powerful computer facilities, high-speed and low-speed wind tunnels, and flight tests of models (mounted on specially designed carrier aircraft) is indicated.

Adaptation of Chain Event Graphs for use with Case-Control Studies in Epidemiology.

PubMed

Keeble, Claire; Thwaites, Peter Adam; Barber, Stuart; Law, Graham Richard; Baxter, Paul David

2017-09-26

Case-control studies are used in epidemiology to try to uncover the causes of diseases, but are a retrospective study design known to suffer from non-participation and recall bias, which may explain their decreased popularity in recent years. Traditional analyses report usually only the odds ratio for given exposures and the binary disease status. Chain event graphs are a graphical representation of a statistical model derived from event trees which have been developed in artificial intelligence and statistics, and only recently introduced to the epidemiology literature. They are a modern Bayesian technique which enable prior knowledge to be incorporated into the data analysis using the agglomerative hierarchical clustering algorithm, used to form a suitable chain event graph. Additionally, they can account for missing data and be used to explore missingness mechanisms. Here we adapt the chain event graph framework to suit scenarios often encountered in case-control studies, to strengthen this study design which is time and financially efficient. We demonstrate eight adaptations to the graphs, which consist of two suitable for full case-control study analysis, four which can be used in interim analyses to explore biases, and two which aim to improve the ease and accuracy of analyses. The adaptations are illustrated with complete, reproducible, fully-interpreted examples, including the event tree and chain event graph. Chain event graphs are used here for the first time to summarise non-participation, data collection techniques, data reliability, and disease severity in case-control studies. We demonstrate how these features of a case-control study can be incorporated into the analysis to provide further insight, which can help to identify potential biases and lead to more accurate study results.

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.

Altered Cerebral Blood Flow Covariance Network in Schizophrenia.

PubMed

Liu, Feng; Zhuo, Chuanjun; Yu, Chunshui

2016-01-01

Many studies have shown abnormal cerebral blood flow (CBF) in schizophrenia; however, it remains unclear how topological properties of CBF network are altered in this disorder. Here, arterial spin labeling (ASL) MRI was employed to measure resting-state CBF in 96 schizophrenia patients and 91 healthy controls. CBF covariance network of each group was constructed by calculating across-subject CBF covariance between 90 brain regions. Graph theory was used to compare intergroup differences in global and nodal topological measures of the network. Both schizophrenia patients and healthy controls had small-world topology in CBF covariance networks, implying an optimal balance between functional segregation and integration. Compared with healthy controls, schizophrenia patients showed reduced small-worldness, normalized clustering coefficient and local efficiency of the network, suggesting a shift toward randomized network topology in schizophrenia. Furthermore, schizophrenia patients exhibited altered nodal centrality in the perceptual-, affective-, language-, and spatial-related regions, indicating functional disturbance of these systems in schizophrenia. This study demonstrated for the first time that schizophrenia patients have disrupted topological properties in CBF covariance network, which provides a new perspective (efficiency of blood flow distribution between brain regions) for understanding neural mechanisms of schizophrenia.

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.

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

A novel framework for command and control of networked sensor systems

NASA Astrophysics Data System (ADS)

Chen, Genshe; Tian, Zhi; Shen, Dan; Blasch, Erik; Pham, Khanh

2007-04-01

In this paper, we have proposed a highly innovative advanced command and control framework for sensor networks used for future Integrated Fire Control (IFC). The primary goal is to enable and enhance target detection, validation, and mitigation for future military operations by graphical game theory and advanced knowledge information fusion infrastructures. The problem is approached by representing distributed sensor and weapon systems as generic warfare resources which must be optimized in order to achieve the operational benefits afforded by enabling a system of systems. This paper addresses the importance of achieving a Network Centric Warfare (NCW) foundation of information superiority-shared, accurate, and timely situational awareness upon which advanced automated management aids for IFC can be built. The approach uses the Data Fusion Information Group (DFIG) Fusion hierarchy of Level 0 through Level 4 to fuse the input data into assessments for the enemy target system threats in a battlespace to which military force is being applied. Compact graph models are employed across all levels of the fusion hierarchy to accomplish integrative data fusion and information flow control, as well as cross-layer sensor management. The functional block at each fusion level will have a set of innovative algorithms that not only exploit the corresponding graph model in a computationally efficient manner, but also permit combined functional experiments across levels by virtue of the unifying graphical model approach.

The investigation of social networks based on multi-component random graphs

NASA Astrophysics Data System (ADS)

Zadorozhnyi, V. N.; Yudin, E. B.

2018-01-01

The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed by the theory of random graphs with the nonlinear preferential attachment rule and the theory of Erdôs-Rényi random graphs. In fact, well-calibrated network graph models and computer experiments with these models would help developers (owners) of the networks to predict their development correctly and to choose effective strategies for controlling network projects.

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.

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.

Nuclear power plant digital system PRA pilot study with the dynamic flow-graph methodology

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

Yau, M.; Motamed, M.; Guarro, S.

2006-07-01

Current Probabilistic Risk Assessment (PRA) methodology is well established in analyzing hardware and some of the key human interactions. However processes for analyzing the software functions of digital systems within a plant PRA framework, and accounting for the digital system contribution to the overall risk are not generally available nor are they well understood and established. A recent study reviewed a number of methodologies that have potential applicability to modeling and analyzing digital systems within a PRA framework. This study identified the Dynamic Flow-graph Methodology (DFM) and the Markov Methodology as the most promising tools. As a result of thismore » study, a task was defined under the framework of a collaborative agreement between the U.S. Nuclear Regulatory Commission (NRC) and the Ohio State Univ. (OSU). The objective of this task is to set up benchmark systems representative of digital systems used in nuclear power plants and to evaluate DFM and the Markov methodology with these benchmark systems. The first benchmark system is a typical Pressurized Water Reactor (PWR) Steam Generator (SG) Feedwater System (FWS) level control system based on an earlier ASCA work with the U.S. NRC 2, upgraded with modern control laws. ASCA, Inc. is currently under contract to OSU to apply DFM to this benchmark system. The goal is to investigate the feasibility of using DFM to analyze and quantify digital system risk, and to integrate the DFM analytical results back into the plant event tree/fault tree PRA model. (authors)« less

Automatic Generation of Supervisory Control System Software Using Graph Composition

NASA Astrophysics Data System (ADS)

Nakata, Hideo; Sano, Tatsuro; Kojima, Taizo; Seo, Kazuo; Uchida, Tomoyuki; Nakamura, Yasuaki

This paper describes the automatic generation of system descriptions for SCADA (Supervisory Control And Data Acquisition) systems. The proposed method produces various types of data and programs for SCADA systems from equipment definitions using conversion rules. At first, this method makes directed graphs, which represent connections between the equipment, from equipment definitions. System descriptions are generated using the conversion rules, by analyzing these directed graphs, and finding the groups of equipment that involve similar operations. This method can make the conversion rules multi levels by using the composition of graphs, and can reduce the number of rules. The developer can define and manage these rules efficiently.

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

Aircraft control position indicator

NASA Technical Reports Server (NTRS)

Dennis, Dale V. (Inventor)

1987-01-01

An aircraft control position indicator was provided that displayed the degree of deflection of the primary flight control surfaces and the manner in which the aircraft responded. The display included a vertical elevator dot/bar graph meter display for indication whether the aircraft will pitch up or down, a horizontal aileron dot/bar graph meter display for indicating whether the aircraft will roll to the left or to the right, and a horizontal dot/bar graph meter display for indicating whether the aircraft will turn left or right. The vertical and horizontal display or displays intersect to form an up/down, left/right type display. Internal electronic display driver means received signals from transducers measuring the control surface deflections and determined the position of the meter indicators on each dot/bar graph meter display. The device allows readability at a glance, easy visual perception in sunlight or shade, near-zero lag in displaying flight control position, and is not affected by gravitational or centrifugal forces.

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.

System analysis through bond graph modeling

NASA Astrophysics Data System (ADS)

McBride, Robert Thomas

2005-07-01

Modeling and simulation form an integral role in the engineering design process. An accurate mathematical description of a system provides the design engineer the flexibility to perform trade studies quickly and accurately to expedite the design process. Most often, the mathematical model of the system contains components of different engineering disciplines. A modeling methodology that can handle these types of systems might be used in an indirect fashion to extract added information from the model. This research examines the ability of a modeling methodology to provide added insight into system analysis and design. The modeling methodology used is bond graph modeling. An investigation into the creation of a bond graph model using the Lagrangian of the system is provided. Upon creation of the bond graph, system analysis is performed. To aid in the system analysis, an object-oriented approach to bond graph modeling is introduced. A framework is provided to simulate the bond graph directly. Through object-oriented simulation of a bond graph, the information contained within the bond graph can be exploited to create a measurement of system efficiency. A definition of system efficiency is given. This measurement of efficiency is used in the design of different controllers of varying architectures. Optimal control of a missile autopilot is discussed within the framework of the calculated system efficiency.

Text categorization of biomedical data sets using graph kernels and a controlled vocabulary.

PubMed

Bleik, Said; Mishra, Meenakshi; Huan, Jun; Song, Min

2013-01-01

Recently, graph representations of text have been showing improved performance over conventional bag-of-words representations in text categorization applications. In this paper, we present a graph-based representation for biomedical articles and use graph kernels to classify those articles into high-level categories. In our representation, common biomedical concepts and semantic relationships are identified with the help of an existing ontology and are used to build a rich graph structure that provides a consistent feature set and preserves additional semantic information that could improve a classifier's performance. We attempt to classify the graphs using both a set-based graph kernel that is capable of dealing with the disconnected nature of the graphs and a simple linear kernel. Finally, we report the results comparing the classification performance of the kernel classifiers to common text-based classifiers.

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.

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.

A real-time expert system for self-repairing flight control

NASA Technical Reports Server (NTRS)

Gaither, S. A.; Agarwal, A. K.; Shah, S. C.; Duke, E. L.

1989-01-01

An integrated environment for specifying, prototyping, and implementing a self-repairing flight-control (SRFC) strategy is described. At an interactive workstation, the user can select paradigms such as rule-based expert systems, state-transition diagrams, and signal-flow graphs and hierarchically nest them, assign timing and priority attributes, establish blackboard-type communication, and specify concurrent execution on single or multiple processors. High-fidelity nonlinear simulations of aircraft and SRFC systems can be performed off-line, with the possibility of changing SRFC rules, inference strategies, and other heuristics to correct for control deficiencies. Finally, the off-line-generated SRFC can be transformed into highly optimized application-specific real-time C-language code. An application of this environment to the design of aircraft fault detection, isolation, and accommodation algorithms is presented in detail.

An Adaptive Memory Interface Controller for Improving Bandwidth Utilization of Hybrid and Reconfigurable Systems

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

Castellana, Vito G.; Tumeo, Antonino; Ferrandi, Fabrizio

Emerging applications such as data mining, bioinformatics, knowledge discovery, social network analysis are irregular. They use data structures based on pointers or linked lists, such as graphs, unbalanced trees or unstructures grids, which generates unpredictable memory accesses. These data structures usually are large, but difficult to partition. These applications mostly are memory bandwidth bounded and have high synchronization intensity. However, they also have large amounts of inherent dynamic parallelism, because they potentially perform a task for each one of the element they are exploring. Several efforts are looking at accelerating these applications on hybrid architectures, which integrate general purpose processorsmore » with reconfigurable devices. Some solutions, which demonstrated significant speedups, include custom-hand tuned accelerators or even full processor architectures on the reconfigurable logic. In this paper we present an approach for the automatic synthesis of accelerators from C, targeted at irregular applications. In contrast to typical High Level Synthesis paradigms, which construct a centralized Finite State Machine, our approach generates dynamically scheduled hardware components. While parallelism exploitation in typical HLS-generated accelerators is usually bound within a single execution flow, our solution allows concurrently running multiple execution flow, thus also exploiting the coarser grain task parallelism of irregular applications. Our approach supports multiple, multi-ported and distributed memories, and atomic memory operations. Its main objective is parallelizing as many memory operations as possible, independently from their execution time, to maximize the memory bandwidth utilization. This significantly differs from current HLS flows, which usually consider a single memory port and require precise scheduling of memory operations. A key innovation of our approach is the generation of a memory interface controller, which dynamically maps concurrent memory accesses to multiple ports. We present a case study on a typical irregular kernel, Graph Breadth First search (BFS), exploring different tradeoffs in terms of parallelism and number of memories.« less

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.

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.

Leader-following control of multiple nonholonomic systems over directed communication graphs

NASA Astrophysics Data System (ADS)

Dong, Wenjie; Djapic, Vladimir

2016-06-01

This paper considers the leader-following control problem of multiple nonlinear systems with directed communication topology and a leader. If the state of each system is measurable, distributed state feedback controllers are proposed using neighbours' state information with the aid of Lyapunov techniques and properties of Laplacian matrix for time-invariant communication graph and time-varying communication graph. It is shown that the state of each system exponentially converges to the state of a leader. If the state of each system is not measurable, distributed observer-based output feedback control laws are proposed. As an application of the proposed results, formation control of wheeled mobile robots is studied. The simulation results show the effectiveness of the proposed results.

Weights and topology: a study of the effects of graph construction on 3D image segmentation.

PubMed

Grady, Leo; Jolly, Marie-Pierre

2008-01-01

Graph-based algorithms have become increasingly popular for medical image segmentation. The fundamental process for each of these algorithms is to use the image content to generate a set of weights for the graph and then set conditions for an optimal partition of the graph with respect to these weights. To date, the heuristics used for generating the weighted graphs from image intensities have largely been ignored, while the primary focus of attention has been on the details of providing the partitioning conditions. In this paper we empirically study the effects of graph connectivity and weighting function on the quality of the segmentation results. To control for algorithm-specific effects, we employ both the Graph Cuts and Random Walker algorithms in our experiments.

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.

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.

Nonschematic drawing recognition: a new approach based on attributed graph grammar with flexible embedding

NASA Astrophysics Data System (ADS)

Lee, Kyu J.; Kunii, T. L.; Noma, T.

1993-01-01

In this paper, we propose a syntactic pattern recognition method for non-schematic drawings, based on a new attributed graph grammar with flexible embedding. In our graph grammar, the embedding rule permits the nodes of a guest graph to be arbitrarily connected with the nodes of a host graph. The ambiguity caused by this flexible embedding is controlled with the evaluation of synthesized attributes and the check of context sensitivity. To integrate parsing with the synthesized attribute evaluation and the context sensitivity check, we also develop a bottom up parsing algorithm.

Instructional Efficiency of the Integration of Graphing Calculators in Teaching and Learning Mathematics

ERIC Educational Resources Information Center

Tajuddin, Nor'ain Mohd; Tarmizi, Rohani Ahmad; Konting, Mohd Majid; Ali, Wan Zah Wan

2009-01-01

This quasi-experimental study with non-equivalent control group post-test only design was conducted to investigate the effects of using graphing calculators in mathematics teaching and learning on Form Four Malaysian secondary school students' performance and their meta-cognitive awareness level. Graphing calculator strategy refers to the use of…

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

Strategies for concurrent processing of complex algorithms in data driven architectures

NASA Technical Reports Server (NTRS)

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

1990-01-01

The performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures is examined. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called ATAMM (Algorithm To Architecture Mapping Model). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Biconvection flow of Carreau fluid over an upper paraboloid surface: A computational study

NASA Astrophysics Data System (ADS)

Khan, Mair; Hussain, Arif; Malik, M. Y.; Salahuddin, T.

Present article explored the physical characteristics of biconvection effects on the MHD flow of Carreau nanofluid over upper horizontal surface of paraboloid revolution along with chemical reaction. The concept of the Carreau nanofluid was introduced the new parameterization achieve the momentum governing equation. Using similarity transformed, the governing partial differential equations are converted into the ordinary differential equations. The obtained governing equations are solved computationally by using implicit finite difference method known as the Keller box technique. The numerical solutions are obtained for the velocity, temperature, concentration, friction factor, local heat and mass transfer coefficients by varying controlling parameters i.e. Biconvection parameter, fluid parameter, Weissenberg number, Hartmann number, Prandtl number, Brownian motion parameter, thermophoresis parameter, Lewis number and chemical reaction parameter. The obtained results are discussed via graphs and tables.

Strategies for concurrent processing of complex algorithms in data driven architectures

NASA Technical Reports Server (NTRS)

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

1990-01-01

Performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures are discussed. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called algorithm to architecture mapping model (ATAMM). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.

Abnormal functional global and local brain connectivity in female patients with anorexia nervosa

PubMed Central

Geisler, Daniel; Borchardt, Viola; Lord, Anton R.; Boehm, Ilka; Ritschel, Franziska; Zwipp, Johannes; Clas, Sabine; King, Joseph A.; Wolff-Stephan, Silvia; Roessner, Veit; Walter, Martin; Ehrlich, Stefan

2016-01-01

Background Previous resting-state functional connectivity studies in patients with anorexia nervosa used independent component analysis or seed-based connectivity analysis to probe specific brain networks. Instead, modelling the entire brain as a complex network allows determination of graph-theoretical metrics, which describe global and local properties of how brain networks are organized and how they interact. Methods To determine differences in network properties between female patients with acute anorexia nervosa and pairwise matched healthy controls, we used resting-state fMRI and computed well-established global and local graph metrics across a range of network densities. Results Our analyses included 35 patients and 35 controls. We found that the global functional network structure in patients with anorexia nervosa is characterized by increases in both characteristic path length (longer average routes between nodes) and assortativity (more nodes with a similar connectedness link together). Accordingly, we found locally decreased connectivity strength and increased path length in the posterior insula and thalamus. Limitations The present results may be limited to the methods applied during preprocessing and network construction. Conclusion We demonstrated anorexia nervosa–related changes in the network configuration for, to our knowledge, the first time using resting-state fMRI and graph-theoretical measures. Our findings revealed an altered global brain network architecture accompanied by local degradations indicating wide-scale disturbance in information flow across brain networks in patients with acute anorexia nervosa. Reduced local network efficiency in the thalamus and posterior insula may reflect a mechanism that helps explain the impaired integration of visuospatial and homeostatic signals in patients with this disorder, which is thought to be linked to abnormal representations of body size and hunger. PMID:26252451

Abnormal functional global and local brain connectivity in female patients with anorexia nervosa.

PubMed

Geisler, Daniel; Borchardt, Viola; Lord, Anton R; Boehm, Ilka; Ritschel, Franziska; Zwipp, Johannes; Clas, Sabine; King, Joseph A; Wolff-Stephan, Silvia; Roessner, Veit; Walter, Martin; Ehrlich, Stefan

2016-01-01

Previous resting-state functional connectivity studies in patients with anorexia nervosa used independent component analysis or seed-based connectivity analysis to probe specific brain networks. Instead, modelling the entire brain as a complex network allows determination of graph-theoretical metrics, which describe global and local properties of how brain networks are organized and how they interact. To determine differences in network properties between female patients with acute anorexia nervosa and pairwise matched healthy controls, we used resting-state fMRI and computed well-established global and local graph metrics across a range of network densities. Our analyses included 35 patients and 35 controls. We found that the global functional network structure in patients with anorexia nervosa is characterized by increases in both characteristic path length (longer average routes between nodes) and assortativity (more nodes with a similar connectedness link together). Accordingly, we found locally decreased connectivity strength and increased path length in the posterior insula and thalamus. The present results may be limited to the methods applied during preprocessing and network construction. We demonstrated anorexia nervosa-related changes in the network configuration for, to our knowledge, the first time using resting-state fMRI and graph-theoretical measures. Our findings revealed an altered global brain network architecture accompanied by local degradations indicating wide-scale disturbance in information flow across brain networks in patients with acute anorexia nervosa. Reduced local network efficiency in the thalamus and posterior insula may reflect a mechanism that helps explain the impaired integration of visuospatial and homeostatic signals in patients with this disorder, which is thought to be linked to abnormal representations of body size and hunger.

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.

Determination of chloride in admixtures and aggregates for cement by a simple flow injection potentiometric system.

PubMed

Junsomboon, Jaroon; Jakmunee, Jaroon

2008-07-15

A simple flow injection system using three 3-way solenoid valves as an electric control injection valve and with a simple home-made chloride ion selective electrode based on Ag/AgCl wire as a sensor for determination of water soluble chloride in admixtures and aggregates for cement has been developed. A liquid sample or an extract was injected into a water carrier stream which was then merged with 0.1M KNO(3) stream and flowed through a flow cell where the solution will be in contact with the sensor, producing a potential change recorded as a peak. A calibration graph in range of 10-100 mg L(-1) was obtained with a detection limit of 2 mg L(-1). Relative standard deviations for 7 replicates injecting of 20, 60 and 90 mg L(-1) chloride solutions were 1.0, 1.2 and 0.6%, respectively. Sample throughput of 60 h(-1) was achieved with the consumption of 1 mL each of electrolyte solution and water carrier. The developed method was validated by the British Standard methods.

Mixed convection in gravity-driven thin film non-Newtonian nanofluids flow with gyrotactic microorganisms

NASA Astrophysics Data System (ADS)

Khan, Noor Saeed; Gul, Taza; Khan, Muhammad Altaf; Bonyah, Ebenezer; Islam, Saeed

Mixed convection in gravity-driven non-Newtonian nanofluid films (Casson and Williamson) flow containing both nanoparticles and gyrotactic microorganisms along a convectively heated vertical surface is investigated. The actively controlled nanofluid model boundary conditions are used to explore the liquid films flow. The study exhibits an analytical approach for the non-Newtonian thin film nanofluids bioconvection based on physical mechanisms responsible for the nanoparticles and the base fluid, such as Brownian motion and thermophoresis. Both the fluids have almost the same behaviors for the effects of all the pertinent parameters except the effect of Schmidt number on the microorganism density function where the effect is opposite. Ordinary differential equations together with the boundary conditions are obtained through similarity variables from the governing equations of the problem, which are solved by HAM (Homotopy Analysis Method). The solution is expressed through graphs and illustrated which show the influences of all the parameters. The study is relevant to novel microbial fuel cell technologies combining the nanofluid with bioconvection phenomena.

Performance analysis of a large-grain dataflow scheduling paradigm

NASA Technical Reports Server (NTRS)

Young, Steven D.; Wills, Robert W.

1993-01-01

A paradigm for scheduling computations on a network of multiprocessors using large-grain data flow scheduling at run time is described and analyzed. The computations to be scheduled must follow a static flow graph, while the schedule itself will be dynamic (i.e., determined at run time). Many applications characterized by static flow exist, and they include real-time control and digital signal processing. With the advent of computer-aided software engineering (CASE) tools for capturing software designs in dataflow-like structures, macro-dataflow scheduling becomes increasingly attractive, if not necessary. For parallel implementations, using the macro-dataflow method allows the scheduling to be insulated from the application designer and enables the maximum utilization of available resources. Further, by allowing multitasking, processor utilizations can approach 100 percent while they maintain maximum speedup. Extensive simulation studies are performed on 4-, 8-, and 16-processor architectures that reflect the effects of communication delays, scheduling delays, algorithm class, and multitasking on performance and speedup gains.

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

BGen: A UML Behavior Network Generator Tool

NASA Technical Reports Server (NTRS)

Huntsberger, Terry; Reder, Leonard J.; Balian, Harry

2010-01-01

BGen software was designed for autogeneration of code based on a graphical representation of a behavior network used for controlling automatic vehicles. A common format used for describing a behavior network, such as that used in the JPL-developed behavior-based control system, CARACaS ["Control Architecture for Robotic Agent Command and Sensing" (NPO-43635), NASA Tech Briefs, Vol. 32, No. 10 (October 2008), page 40] includes a graph with sensory inputs flowing through the behaviors in order to generate the signals for the actuators that drive and steer the vehicle. A computer program to translate Unified Modeling Language (UML) Freeform Implementation Diagrams into a legacy C implementation of Behavior Network has been developed in order to simplify the development of C-code for behavior-based control systems. UML is a popular standard developed by the Object Management Group (OMG) to model software architectures graphically. The C implementation of a Behavior Network is functioning as a decision tree.

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.

Communication and complexity in a GRN-based multicellular system for graph colouring.

PubMed

Buck, Moritz; Nehaniv, Chrystopher L

2008-01-01

Artificial Genetic Regulatory Networks (GRNs) are interesting control models through their simplicity and versatility. They can be easily implemented, evolved and modified, and their similarity to their biological counterparts makes them interesting for simulations of life-like systems as well. These aspects suggest they may be perfect control systems for distributed computing in diverse situations, but to be usable for such applications the computational power and evolvability of GRNs need to be studied. In this research we propose a simple distributed system implementing GRNs to solve the well known NP-complete graph colouring problem. Every node (cell) of the graph to be coloured is controlled by an instance of the same GRN. All the cells communicate directly with their immediate neighbours in the graph so as to set up a good colouring. The quality of this colouring directs the evolution of the GRNs using a genetic algorithm. We then observe the quality of the colouring for two different graphs according to different communication protocols and the number of different proteins in the cell (a measure for the possible complexity of a GRN). Those two points, being the main scalability issues that any computational paradigm raises, will then be discussed.

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.

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.

Graphs as a Managerial Tool: A Case Study of Du Pont's Use of Graphs in the Early Twentieth Century.

ERIC Educational Resources Information Center

Yates, JoAnne

1985-01-01

Sketches the development of business graphs in America. Examines their early use at Du Pont and the origin of the chart room around 1920, an important factor in the executive control systems at Du Pont. Draws lessons from this case study for managers and teachers of business communication. (PD)

Feedback topology and XOR-dynamics in Boolean networks with varying input structure

NASA Astrophysics Data System (ADS)

Ciandrini, L.; Maffi, C.; Motta, A.; Bassetti, B.; Cosentino Lagomarsino, M.

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter γ . We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying γ , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

Feedback topology and XOR-dynamics in Boolean networks with varying input structure.

PubMed

Ciandrini, L; Maffi, C; Motta, A; Bassetti, B; Cosentino Lagomarsino, M

2009-08-01

We analyze a model of fixed in-degree random Boolean networks in which the fraction of input-receiving nodes is controlled by the parameter gamma. We investigate analytically and numerically the dynamics of graphs under a parallel XOR updating scheme. This scheme is interesting because it is accessible analytically and its phenomenology is at the same time under control and as rich as the one of general Boolean networks. We give analytical formulas for the dynamics on general graphs, showing that with a XOR-type evolution rule, dynamic features are direct consequences of the topological feedback structure, in analogy with the role of relevant components in Kauffman networks. Considering graphs with fixed in-degree, we characterize analytically and numerically the feedback regions using graph decimation algorithms (Leaf Removal). With varying gamma , this graph ensemble shows a phase transition that separates a treelike graph region from one in which feedback components emerge. Networks near the transition point have feedback components made of disjoint loops, in which each node has exactly one incoming and one outgoing link. Using this fact, we provide analytical estimates of the maximum period starting from topological considerations.

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

Adaptive tracking control of leader-following linear multi-agent systems with external disturbances

NASA Astrophysics Data System (ADS)

Lin, Hanquan; Wei, Qinglai; Liu, Derong; Ma, Hongwen

2016-10-01

In this paper, the consensus problem for leader-following linear multi-agent systems with external disturbances is investigated. Brownian motions are used to describe exogenous disturbances. A distributed tracking controller based on Riccati inequalities with an adaptive law for adjusting coupling weights between neighbouring agents is designed for leader-following multi-agent systems under fixed and switching topologies. In traditional distributed static controllers, the coupling weights depend on the communication graph. However, coupling weights associated with the feedback gain matrix in our method are updated by state errors between neighbouring agents. We further present the stability analysis of leader-following multi-agent systems with stochastic disturbances under switching topology. Most traditional literature requires the graph to be connected all the time, while the communication graph is only assumed to be jointly connected in this paper. The design technique is based on Riccati inequalities and algebraic graph theory. Finally, simulations are given to show the validity of our method.

Topological structure and mechanics of glassy polymer networks.

PubMed

Elder, Robert M; Sirk, Timothy W

2017-11-22

The influence of chain-level network architecture (i.e., topology) on mechanics was explored for unentangled polymer networks using a blend of coarse-grained molecular simulations and graph-theoretic concepts. A simple extension of the Watts-Strogatz model is proposed to control the graph properties of the network such that the corresponding physical properties can be studied with simulations. The architecture of polymer networks assembled with a dynamic curing approach were compared with the extended Watts-Strogatz model, and found to agree surprisingly well. The final cured structures of the dynamically-assembled networks were nearly an intermediate between lattice and random connections due to restrictions imposed by the finite length of the chains. Further, the uni-axial stress response, character of the bond breaking, and non-affine displacements of fully-cured glassy networks were analyzed as a function of the degree of disorder in the network architecture. It is shown that the architecture strongly affects the network stability, flow stress, onset of bond breaking, and ultimate stress while leaving the modulus and yield point nearly unchanged. The results show that internal restrictions imposed by the network architecture alter the chain-level response through changes to the crosslink dynamics in the flow regime and through the degree of coordinated chain failure at the ultimate stress. The properties considered here are shown to be sensitive to even incremental changes to the architecture and, therefore, the overall network architecture, beyond simple defects, is predicted to be a meaningful physical parameter in the mechanics of glassy polymer networks.

Change of Brain Functional Connectivity in Patients With Spinal Cord Injury: Graph Theory Based Approach.

PubMed

Min, Yu-Sun; Chang, Yongmin; Park, Jang Woo; Lee, Jong-Min; Cha, Jungho; Yang, Jin-Ju; Kim, Chul-Hyun; Hwang, Jong-Moon; Yoo, Ji-Na; Jung, Tae-Du

2015-06-01

To investigate the global functional reorganization of the brain following spinal cord injury with graph theory based approach by creating whole brain functional connectivity networks from resting state-functional magnetic resonance imaging (rs-fMRI), characterizing the reorganization of these networks using graph theoretical metrics and to compare these metrics between patients with spinal cord injury (SCI) and age-matched controls. Twenty patients with incomplete cervical SCI (14 males, 6 females; age, 55±14.1 years) and 20 healthy subjects (10 males, 10 females; age, 52.9±13.6 years) participated in this study. To analyze the characteristics of the whole brain network constructed with functional connectivity using rs-fMRI, graph theoretical measures were calculated including clustering coefficient, characteristic path length, global efficiency and small-worldness. Clustering coefficient, global efficiency and small-worldness did not show any difference between controls and SCIs in all density ranges. The normalized characteristic path length to random network was higher in SCI patients than in controls and reached statistical significance at 12%-13% of density (p<0.05, uncorrected). The graph theoretical approach in brain functional connectivity might be helpful to reveal the information processing after SCI. These findings imply that patients with SCI can build on preserved competent brain control. Further analyses, such as topological rearrangement and hub region identification, will be needed for better understanding of neuroplasticity in patients with SCI.

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

The purpose is to document research to develop strategies for concurrent processing of complex algorithms in data driven architectures. The problem domain consists of decision-free algorithms having large-grained, computationally complex primitive operations. Such are often found in signal processing and control applications. The anticipated multiprocessor environment is a data flow architecture containing between two and twenty computing elements. Each computing element is a processor having local program memory, and which communicates with a common global data memory. A new graph theoretic model called ATAMM which establishes rules for relating a decomposed algorithm to its execution in a data flow architecture is presented. The ATAMM model is used to determine strategies to achieve optimum time performance and to develop a system diagnostic software tool. In addition, preliminary work on a new multiprocessor operating system based on the ATAMM specifications is described.

Distributed MPC based consensus for single-integrator multi-agent systems.

PubMed

Cheng, Zhaomeng; Fan, Ming-Can; Zhang, Hai-Tao

2015-09-01

This paper addresses model predictive control schemes for consensus in multi-agent systems (MASs) with discrete-time single-integrator dynamics under switching directed interaction graphs. The control horizon is extended to be greater than one which endows the closed-loop system with extra degree of freedom. We derive sufficient conditions on the sampling period and the interaction graph to achieve consensus by using the property of infinite products of stochastic matrices. Consensus can be achieved asymptotically if the sampling period is selected such that the interaction graph among agents has a directed spanning tree jointly. Significantly, if the interaction graph always has a spanning tree, one can select an arbitrary large sampling period to guarantee consensus. Finally, several simulations are conducted to illustrate the effectiveness of the theoretical results. Copyright © 2015 ISA. Published by Elsevier Ltd. All rights reserved.

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.

Output-Sensitive Construction of Reeb Graphs.

PubMed

Doraiswamy, H; Natarajan, V

2012-01-01

The Reeb graph of a scalar function represents the evolution of the topology of its level sets. This paper describes a near-optimal output-sensitive algorithm for computing the Reeb graph of scalar functions defined over manifolds or non-manifolds in any dimension. Key to the simplicity and efficiency of the algorithm is an alternate definition of the Reeb graph that considers equivalence classes of level sets instead of individual level sets. The algorithm works in two steps. The first step locates all critical points of the function in the domain. Critical points correspond to nodes in the Reeb graph. Arcs connecting the nodes are computed in the second step by a simple search procedure that works on a small subset of the domain that corresponds to a pair of critical points. The paper also describes a scheme for controlled simplification of the Reeb graph and two different graph layout schemes that help in the effective presentation of Reeb graphs for visual analysis of scalar fields. Finally, the Reeb graph is employed in four different applications-surface segmentation, spatially-aware transfer function design, visualization of interval volumes, and interactive exploration of time-varying data.

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

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

Mathematics of Web science: structure, dynamics and incentives.

PubMed

Chayes, Jennifer

2013-03-28

Dr Chayes' talk described how, to a discrete mathematician, 'all the world's a graph, and all the people and domains merely vertices'. A graph is represented as a set of vertices V and a set of edges E, so that, for instance, in the World Wide Web, V is the set of pages and E the directed hyperlinks; in a social network, V is the people and E the set of relationships; and in the autonomous system Internet, V is the set of autonomous systems (such as AOL, Yahoo! and MSN) and E the set of connections. This means that mathematics can be used to study the Web (and other large graphs in the online world) in the following way: first, we can model online networks as large finite graphs; second, we can sample pieces of these graphs; third, we can understand and then control processes on these graphs; and fourth, we can develop algorithms for these graphs and apply them to improve the online experience.

Turbofan Engine Simulated in a Graphical Simulation Environment

NASA Technical Reports Server (NTRS)

Parker, Khary I.; Guo, Ten-Huei

2004-01-01

Recently, there has been an increase in the development of intelligent engine technology with advanced active component control. The computer engine models used in these control studies are component-level models (CLM), models that link individual component models of state space and nonlinear algebraic equations, written in a computer language such as Fortran. The difficulty faced in performing control studies on Fortran-based models is that Fortran is not supported with control design and analysis tools, so there is no means for implementing real-time control. It is desirable to have a simulation environment that is straightforward, has modular graphical components, and allows easy access to health, control, and engine parameters through a graphical user interface. Such a tool should also provide the ability to convert a control design into real-time code, helping to make it an extremely powerful tool in control and diagnostic system development. Simulation time management is shown: Mach number versus time, power level angle versus time, altitude versus time, ambient temperature change versus time, afterburner fuel flow versus time, controller and actuator dynamics, collect initial conditions, CAD output, and component-level model: CLM sensor, CAD input, and model output. The Controls and Dynamics Technologies Branch at the NASA Glenn Research Center has developed and demonstrated a flexible, generic turbofan engine simulation platform that can meet these objectives, known as the Modular Aero-Propulsion System Simulation (MAPSS). MAPSS is a Simulink-based implementation of a Fortran-based, modern high pressure ratio, dual-spool, low-bypass, military-type variable-cycle engine with a digital controller. Simulink (The Mathworks, Natick, MA) is a computer-aided control design and simulation package allows the graphical representation of dynamic systems in a block diagram form. MAPSS is a nonlinear, non-real-time system composed of controller and actuator dynamics (CAD) and component-level model (CLM) modules. The controller in the CAD module emulates the functionality of a digital controller, which has a typical update rate of 50 Hz. The CLM module simulates the dynamics of the engine components and uses an update rate of 2500 Hz, which is needed to iterate to balance mass and energy among system components. The actuators in the CAD module use the same sampling rate as those in the CLM. Two graphs of normalized spool speed versus time in seconds and one graph of normalized average metal temperature versus time in seconds is shown. MAPSS was validated via open-loop and closed-loop comparisons with the Fortran simulation. The preceding plots show the normalized results of a closed-loop comparison looking at three states of the model: low-pressure spool speed, high-pressure spool speed, and the average metal temperature measured from the combustor to the high-pressure turbine. In steady state, the error between the simulations is less than 1 percent. During a transient, the difference between the simulations is due to a correction in MAPSS that prevents the gas flow in the bypass duct inlet from flowing forward instead of toward the aft end, which occurs in the Fortran simulation. A comparison between MAPSS and the Fortran model of the bypass duct inlet flow for power lever angles greater than 35 degrees is shown.

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.

Does Guiding Toward Task-Relevant Information Help Improve Graph Processing and Graph Comprehension of Individuals with Low or High Numeracy? An Eye-Tracker Experiment.

PubMed

Keller, Carmen; Junghans, Alex

2017-11-01

Individuals with low numeracy have difficulties with understanding complex graphs. Combining the information-processing approach to numeracy with graph comprehension and information-reduction theories, we examined whether high numerates' better comprehension might be explained by their closer attention to task-relevant graphical elements, from which they would expect numerical information to understand the graph. Furthermore, we investigated whether participants could be trained in improving their attention to task-relevant information and graph comprehension. In an eye-tracker experiment ( N = 110) involving a sample from the general population, we presented participants with 2 hypothetical scenarios (stomach cancer, leukemia) showing survival curves for 2 treatments. In the training condition, participants received written instructions on how to read the graph. In the control condition, participants received another text. We tracked participants' eye movements while they answered 9 knowledge questions. The sum constituted graph comprehension. We analyzed visual attention to task-relevant graphical elements by using relative fixation durations and relative fixation counts. The mediation analysis revealed a significant ( P < 0.05) indirect effect of numeracy on graph comprehension through visual attention to task-relevant information, which did not differ between the 2 conditions. Training had a significant main effect on visual attention ( P < 0.05) but not on graph comprehension ( P < 0.07). Individuals with high numeracy have better graph comprehension due to their greater attention to task-relevant graphical elements than individuals with low numeracy. With appropriate instructions, both groups can be trained to improve their graph-processing efficiency. Future research should examine (e.g., motivational) mediators between visual attention and graph comprehension to develop appropriate instructions that also result in higher graph comprehension.

Label-based routing for a family of small-world Farey graphs.

PubMed

Zhai, Yinhu; Wang, Yinhe

2016-05-11

We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

Label-based routing for a family of small-world Farey graphs

NASA Astrophysics Data System (ADS)

Zhai, Yinhu; Wang, Yinhe

2016-05-01

We introduce an informative labelling method for vertices in a family of Farey graphs, and deduce a routing algorithm on all the shortest paths between any two vertices in Farey graphs. The label of a vertex is composed of the precise locating position in graphs and the exact time linking to graphs. All the shortest paths routing between any pair of vertices, which number is exactly the product of two Fibonacci numbers, are determined only by their labels, and the time complexity of the algorithm is O(n). It is the first algorithm to figure out all the shortest paths between any pair of vertices in a kind of deterministic graphs. For Farey networks, the existence of an efficient routing protocol is of interest to design practical communication algorithms in relation to dynamical processes (including synchronization and structural controllability) and also to understand the underlying mechanisms that have shaped their particular structure.

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.

Fieldcrest Cannon, Inc. Advanced Technical Preparation. Statistical Process Control (SPC). PRE-SPC 11: SPC & Graphs. Instructor Book.

ERIC Educational Resources Information Center

Averitt, Sallie D.

This instructor guide, which was developed for use in a manufacturing firm's advanced technical preparation program, contains the materials required to present a learning module that is designed to prepare trainees for the program's statistical process control module by improving their basic math skills in working with line graphs and teaching…

A novel approach to analysing the regimes of temporary streams in relation to their controls on the composition and structure of 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.; Buffagni, A.; Erba, S.; Neves, R.; Nikolaidis, N. P.; Perrin, J. L.; Querner, E. P.; Quiñonero, J. M.; Tournoud, M. G.; Tzoraki, O.; Skoulikidis, N.; Gómez, R.; Sánchez-Montoya, M. M.; Froebrich, J.

2012-09-01

Temporary streams are those water courses that undergo the recurrent cessation of flow or the complete drying of their channel. The structure and composition of biological communities in temporary stream reaches are strongly dependent on the temporal changes of the aquatic habitats determined by the hydrological conditions. Therefore, the structural and functional characteristics of aquatic fauna to assess the ecological quality of a temporary stream reach cannot be used without taking into account the controls imposed by the hydrological regime. This paper develops methods for analysing temporary streams' aquatic regimes, based on the definition of six aquatic states that summarize the transient sets of mesohabitats occurring on a given reach at a particular moment, depending on the hydrological conditions: Hyperrheic, Eurheic, Oligorheic, Arheic, Hyporheic and Edaphic. When the hydrological conditions lead to a change in the aquatic state, the structure and composition of the aquatic community changes according to the new set of available habitats. We used the water discharge records from gauging stations or simulations with rainfall-runoff models to infer the temporal patterns of occurrence of these states in the Aquatic States Frequency Graph we developed. The visual analysis of this graph is complemented by the development of two metrics which describe the permanence of flow and the seasonal predictability of zero flow periods. Finally, a classification of temporary streams in four aquatic regimes in terms of their influence over the development of aquatic life is updated from the existing classifications, with stream aquatic regimes defined as Permanent, Temporary-pools, Temporary-dry and Episodic. While aquatic regimes describe the long-term overall variability of the hydrological conditions of the river section and have been used for many years by hydrologists and ecologists, aquatic states describe the availability of mesohabitats in given periods that determine the presence of different biotic assemblages. This novel concept links hydrological and ecological conditions in a unique way. All these methods were implemented with data from eight temporary streams around the Mediterranean within the MIRAGE project. Their application was a precondition to assessing the ecological quality of these streams.

Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion.

PubMed

Wang, Yang; Zhang, Wenjie; Wu, Lin; Lin, Xuemin; Zhao, Xiang

2017-01-01

Learning an ideal metric is crucial to many tasks in computer vision. Diverse feature representations may combat this problem from different aspects; as visual data objects described by multiple features can be decomposed into multiple views, thus often provide complementary information. In this paper, we propose a cross-view fusion algorithm that leads to a similarity metric for multiview data by systematically fusing multiple similarity measures. Unlike existing paradigms, we focus on learning distance measure by exploiting a graph structure of data samples, where an input similarity matrix can be improved through a propagation of graph random walk. In particular, we construct multiple graphs with each one corresponding to an individual view, and a cross-view fusion approach based on graph random walk is presented to derive an optimal distance measure by fusing multiple metrics. Our method is scalable to a large amount of data by enforcing sparsity through an anchor graph representation. To adaptively control the effects of different views, we dynamically learn view-specific coefficients, which are leveraged into graph random walk to balance multiviews. However, such a strategy may lead to an over-smooth similarity metric where affinities between dissimilar samples may be enlarged by excessively conducting cross-view fusion. Thus, we figure out a heuristic approach to controlling the iteration number in the fusion process in order to avoid over smoothness. Extensive experiments conducted on real-world data sets validate the effectiveness and efficiency of our approach.

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.

Interactive simulation system for artificial ventilation on the internet: virtual ventilator.

PubMed

Takeuchi, Akihiro; Abe, Tadashi; Hirose, Minoru; Kamioka, Koichi; Hamada, Atsushi; Ikeda, Noriaki

2004-12-01

To develop an interactive simulation system "virtual ventilator" that demonstrates the dynamics of pressure and flow in the respiratory system under the combination of spontaneous breathing, ventilation modes, and ventilator options. The simulation system was designed to be used by unexperienced health care professionals as a self-training tool. The system consists of a simulation controller and three modules: respiratory, spontaneous breath, and ventilator. The respiratory module models the respiratory system by three resistances representing the main airway, the right and left lungs, and two compliances also representing the right and left lungs. The spontaneous breath module generates inspiratory negative pressure produced by a patient. The ventilator module generates driving force of pressure or flow according to the combination of the ventilation mode and options. These forces are given to the respiratory module through the simulation controller. The simulation system was developed using HTML, VBScript (3000 lines, 100 kB) and ActiveX control (120 kB), and runs on Internet Explorer (5.5 or higher). The spontaneous breath is defined by a frequency, amplitude and inspiratory patterns in the spontaneous breath module. The user can construct a ventilation mode by setting a control variable, phase variables (trigger, limit, and cycle), and options. Available ventilation modes are: controlled mechanical ventilation (CMV), continuous positive airway pressure, synchronized intermittent mandatory ventilation (SIMV), pressure support ventilation (PSV), SIMV + PSV, pressure-controlled ventilation (PCV), pressure-regulated volume control (PRVC), proportional assisted ventilation, mandatory minute ventilation (MMV), bilevel positive airway pressure (BiPAP). The simulation system demonstrates in a graph and animation the airway pressure, flow, and volume of the respiratory system during mechanical ventilation both with and without spontaneous breathing. We developed a web application that demonstrated the respiratory mechanics and the basic theory of ventilation mode.

Contact tracing for the control of infectious disease epidemics: Chronic Wasting Disease in deer farms.

PubMed

Rorres, Chris; Romano, Maria; Miller, Jennifer A; Mossey, Jana M; Grubesic, Tony H; Zellner, David E; Smith, Gary

2018-06-01

Contact tracing is a crucial component of the control of many infectious diseases, but is an arduous and time consuming process. Procedures that increase the efficiency of contact tracing increase the chance that effective controls can be implemented sooner and thus reduce the magnitude of the epidemic. We illustrate a procedure using Graph Theory in the context of infectious disease epidemics of farmed animals in which the epidemics are driven mainly by the shipment of animals between farms. Specifically, we created a directed graph of the recorded shipments of deer between deer farms in Pennsylvania over a timeframe and asked how the properties of the graph could be exploited to make contact tracing more efficient should Chronic Wasting Disease (a prion disease of deer) be discovered in one of the farms. We show that the presence of a large strongly connected component in the graph has a significant impact on the number of contacts that can arise. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

Metric learning with spectral graph convolutions on brain connectivity networks.

PubMed

Ktena, Sofia Ira; Parisot, Sarah; Ferrante, Enzo; Rajchl, Martin; Lee, Matthew; Glocker, Ben; Rueckert, Daniel

2018-04-01

Graph representations are often used to model structured data at an individual or population level and have numerous applications in pattern recognition problems. In the field of neuroscience, where such representations are commonly used to model structural or functional connectivity between a set of brain regions, graphs have proven to be of great importance. This is mainly due to the capability of revealing patterns related to brain development and disease, which were previously unknown. Evaluating similarity between these brain connectivity networks in a manner that accounts for the graph structure and is tailored for a particular application is, however, non-trivial. Most existing methods fail to accommodate the graph structure, discarding information that could be beneficial for further classification or regression analyses based on these similarities. We propose to learn a graph similarity metric using a siamese graph convolutional neural network (s-GCN) in a supervised setting. The proposed framework takes into consideration the graph structure for the evaluation of similarity between a pair of graphs, by employing spectral graph convolutions that allow the generalisation of traditional convolutions to irregular graphs and operates in the graph spectral domain. We apply the proposed model on two datasets: the challenging ABIDE database, which comprises functional MRI data of 403 patients with autism spectrum disorder (ASD) and 468 healthy controls aggregated from multiple acquisition sites, and a set of 2500 subjects from UK Biobank. We demonstrate the performance of the method for the tasks of classification between matching and non-matching graphs, as well as individual subject classification and manifold learning, showing that it leads to significantly improved results compared to traditional methods. Copyright © 2017 Elsevier Inc. All rights reserved.

SimGraph: A Flight Simulation Data Visualization Workstation

NASA Technical Reports Server (NTRS)

Kaplan, Joseph A.; Kenney, Patrick S.

1997-01-01

Today's modern flight simulation research produces vast amounts of time sensitive data, making a qualitative analysis of the data difficult while it remains in a numerical representation. Therefore, a method of merging related data together and presenting it to the user in a more comprehensible format is necessary. Simulation Graphics (SimGraph) is an object-oriented data visualization software package that presents simulation data in animated graphical displays for easy interpretation. Data produced from a flight simulation is presented by SimGraph in several different formats, including: 3-Dimensional Views, Cockpit Control Views, Heads-Up Displays, Strip Charts, and Status Indicators. SimGraph can accommodate the addition of new graphical displays to allow the software to be customized to each user s particular environment. A new display can be developed and added to SimGraph without having to design a new application, allowing the graphics programmer to focus on the development of the graphical display. The SimGraph framework can be reused for a wide variety of visualization tasks. Although it was created for the flight simulation facilities at NASA Langley Research Center, SimGraph can be reconfigured to almost any data visualization environment. This paper describes the capabilities and operations of SimGraph.

Considerations on the Use of Custom Accelerators for Big Data Analytics

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

Castellana, Vito G.; Tumeo, Antonino; Minutoli, Marco

Accelerators, including Graphic Processing Units (GPUs) for gen- eral purpose computation, many-core designs with wide vector units (e.g., Intel Phi), have become a common component of many high performance clusters. The appearance of more stable and reliable tools tools that can automatically convert code written in high-level specifications with annotations (such as C or C++) to hardware de- scription languages (High-Level Synthesis - HLS), is also setting the stage for a broader use of reconfigurable devices (e.g., Field Pro- grammable Gate Arrays - FPGAs) in high performance system for the implementation of custom accelerators, helped by the fact that newmore » processors include advanced cache-coherent interconnects for these components. In this chapter, we briefly survey the status of the use of accelerators in high performance systems targeted at big data analytics applications. We argue that, although the progress in the use of accelerators for this class of applications has been sig- nificant, differently from scientific simulations there still are gaps to close. This is particularly true for the ”irregular” behaviors exhibited by no-SQL, graph databases. We focus our attention on the limits of HLS tools for data analytics and graph methods, and discuss a new architectural template that better fits the requirement of this class of applications. We validate the new architectural templates by mod- ifying the Graph Engine for Multithreaded System (GEMS) frame- work to support accelerators generated with such a methodology, and testing with queries coming from the Lehigh University Benchmark (LUBM). The architectural template enables better supporting the task and memory level parallelism present in graph methods by sup- porting a new control model and a enhanced memory interface. We show that out solution allows generating parallel accelerators, pro- viding speed ups with respect to conventional HLS flows. We finally draw conclusions and present a perspective on the use of reconfig- urable devices and Design Automation tools for data analytics.« less

HeNCE: A Heterogeneous Network Computing Environment

DOE PAGES

Beguelin, Adam; Dongarra, Jack J.; Geist, George Al; ...

1994-01-01

Network computing seeks to utilize the aggregate resources of many networked computers to solve a single problem. In so doing it is often possible to obtain supercomputer performance from an inexpensive local area network. The drawback is that network computing is complicated and error prone when done by hand, especially if the computers have different operating systems and data formats and are thus heterogeneous. The heterogeneous network computing environment (HeNCE) is an integrated graphical environment for creating and running parallel programs over a heterogeneous collection of computers. It is built on a lower level package called parallel virtual machine (PVM).more » The HeNCE philosophy of parallel programming is to have the programmer graphically specify the parallelism of a computation and to automate, as much as possible, the tasks of writing, compiling, executing, debugging, and tracing the network computation. Key to HeNCE is a graphical language based on directed graphs that describe the parallelism and data dependencies of an application. Nodes in the graphs represent conventional Fortran or C subroutines and the arcs represent data and control flow. This article describes the present state of HeNCE, its capabilities, limitations, and areas of future research.« less

A novel visual hardware behavioral language

NASA Technical Reports Server (NTRS)

Li, Xueqin; Cheng, H. D.

1992-01-01

Most hardware behavioral languages just use texts to describe the behavior of the desired hardware design. This is inconvenient for VLSI designers who enjoy using the schematic approach. The proposed visual hardware behavioral language has the ability to graphically express design information using visual parallel models (blocks), visual sequential models (processes) and visual data flow graphs (which consist of primitive operational icons, control icons, and Data and Synchro links). Thus, the proposed visual hardware behavioral language can not only specify hardware concurrent and sequential functionality, but can also visually expose parallelism, sequentiality, and disjointness (mutually exclusive operations) for the hardware designers. That would make the hardware designers capture the design ideas easily and explicitly using this visual hardware behavioral language.

Computer package for the design and optimization of absorption air conditioning system operated by solar energy

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

Sofrata, H.; Khoshaim, B.; Megahed, M.

1980-12-01

In this paper a computer package for the design and optimization of the simple Li-Br absorption air conditioning system, operated by solar energy, is developed in order to study its performance. This was necessary, as a first step, before carrying out any computations regarding the dual system (1-3). The computer package has the facilities of examining any parameter which may control the system; namely generator, evaporator, condenser, absorber temperatures and pumping factor. The output may be tabulated and also fed to the graph plotter. The flow chart of the programme is explained in an easy way and a typical examplemore » is included.« less

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).

Altered structural connectivity of pain-related brain network in burning mouth syndrome-investigation by graph analysis of probabilistic tractography.

PubMed

Wada, Akihiko; Shizukuishi, Takashi; Kikuta, Junko; Yamada, Haruyasu; Watanabe, Yusuke; Imamura, Yoshiki; Shinozaki, Takahiro; Dezawa, Ko; Haradome, Hiroki; Abe, Osamu

2017-05-01

Burning mouth syndrome (BMS) is a chronic intraoral pain syndrome featuring idiopathic oral pain and burning discomfort despite clinically normal oral mucosa. The etiology of chronic pain syndrome is unclear, but preliminary neuroimaging research has suggested the alteration of volume, metabolism, blood flow, and diffusion at multiple brain regions. According to the neuromatrix theory of Melzack, pain sense is generated in the brain by the network of multiple pain-related brain regions. Therefore, the alteration of pain-related network is also assumed as an etiology of chronic pain. In this study, we investigated the brain network of BMS brain by using probabilistic tractography and graph analysis. Fourteen BMS patients and 14 age-matched healthy controls underwent 1.5T MRI. Structural connectivity was calculated in 83 anatomically defined regions with probabilistic tractography of 60-axis diffusion tensor imaging and 3D T1-weighted imaging. Graph theory network analysis was used to evaluate the brain network at local and global connectivity. In BMS brain, a significant difference of local brain connectivity was recognized at the bilateral rostral anterior cingulate cortex, right medial orbitofrontal cortex, and left pars orbitalis which belong to the medial pain system; however, no significant difference was recognized at the lateral system including the somatic sensory cortex. A strengthened connection of the anterior cingulate cortex and medial prefrontal cortex with the basal ganglia, thalamus, and brain stem was revealed. Structural brain network analysis revealed the alteration of the medial system of the pain-related brain network in chronic pain syndrome.

Using Bond Graphs for Articulated, Flexible Multi-bodies, Sensors, Actuators, and Controllers with Application to the International Space Station

NASA Technical Reports Server (NTRS)

Montgomery, Raymond C.; Granda, Jose J.

2003-01-01

Conceptually, modeling of flexible, multi-body systems involves a formulation as a set of time-dependent partial differential equations. However, for practical, engineering purposes, this modeling is usually done using the method of Finite Elements, which approximates the set of partial differential equations, thus generalizing the approach to all continuous media. This research investigates the links between the Bond Graph method and the classical methods used to develop system models and advocates the Bond Graph Methodology and current bond graph tools as alternate approaches that will lead to a quick and precise understanding of a flexible multi-body system under automatic control. For long endurance, complex spacecraft, because of articulation and mission evolution the model of the physical system may change frequently. So a method of automatic generation and regeneration of system models that does not lead to implicit equations, as does the Lagrange equation approach, is desirable. The bond graph method has been shown to be amenable to automatic generation of equations with appropriate consideration of causality. Indeed human-interactive software now exists that automatically generates both symbolic and numeric system models and evaluates causality as the user develops the model, e.g. the CAMP-G software package. In this paper the CAMP-G package is used to generate a bond graph model of the International Space Station (ISS) at an early stage in its assembly, Zvezda. The ISS is an ideal example because it is a collection of bodies that are articulated, many of which are highly flexible. Also many reaction jets are used to control translation and attitude, and many electric motors are used to articulate appendages, which consist of photovoltaic arrays and composite assemblies. The Zvezda bond graph model is compared to an existing model, which was generated by the NASA Johnson Space Center during the Verification and Analysis Cycle of Zvezda.

Graph-based linear scaling electronic structure theory.

PubMed

Niklasson, Anders M N; Mniszewski, Susan M; Negre, Christian F A; Cawkwell, Marc J; Swart, Pieter J; Mohd-Yusof, Jamal; Germann, Timothy C; Wall, Michael E; Bock, Nicolas; Rubensson, Emanuel H; Djidjev, Hristo

2016-06-21

We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

Graph-based linear scaling electronic structure theory

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

Niklasson, Anders M. N., E-mail: amn@lanl.gov; Negre, Christian F. A.; Cawkwell, Marc J.

2016-06-21

We show how graph theory can be combined with quantum theory to calculate the electronic structure of large complex systems. The graph formalism is general and applicable to a broad range of electronic structure methods and materials, including challenging systems such as biomolecules. The methodology combines well-controlled accuracy, low computational cost, and natural low-communication parallelism. This combination addresses substantial shortcomings of linear scaling electronic structure theory, in particular with respect to quantum-based molecular dynamics simulations.

Optimal Topology Control and Power Allocation for Minimum Energy Consumption in Consensus Networks

DTIC Science & Technology

2011-12-16

network topologies, such as small world graphs, can greatly increase the convergence rate. In [9], the authors show that nonbipartite Ramanujan graphs...unclassified c . THIS PAGE unclassified Standard Form 298 (Rev. 8-98) Prescribed by ANSI Std Z39-18 23384 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 60...of iterations necessary to achieve consensus. From this perspec- tive, enforcing a small world, scale-free, or Ramanujan graph topology may not be the

Consensus-Based Formation Control of a Class of Multi-Agent Systems

NASA Technical Reports Server (NTRS)

Joshi, Suresh; Gonzalez, Oscar R.

2014-01-01

This paper presents a consensus-based formation control scheme for autonomous multi-agent systems represented by double integrator dynamics. Assuming that the information graph topology consists of an undirected connected graph, a leader-based consensus-type control law is presented and shown to provide asymptotic formation stability when subjected to piecewise constant formation velocity commands. It is also shown that global asymptotic stability is preserved in the presence of (0, infinity)- sector monotonic non-decreasing actuator nonlinearities.

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.

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.

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.

Non-invasive pulmonary blood flow analysis and blood pressure mapping derived from 4D flow MRI

NASA Astrophysics Data System (ADS)

Delles, Michael; Rengier, Fabian; Azad, Yoo-Jin; Bodenstedt, Sebastian; von Tengg-Kobligk, Hendrik; Ley, Sebastian; Unterhinninghofen, Roland; Kauczor, Hans-Ulrich; Dillmann, Rüdiger

2015-03-01

In diagnostics and therapy control of cardiovascular diseases, detailed knowledge about the patient-specific behavior of blood flow and pressure can be essential. The only method capable of measuring complete time-resolved three-dimensional vector fields of the blood flow velocities is velocity-encoded magnetic resonance imaging (MRI), often denoted as 4D flow MRI. Furthermore, relative pressure maps can be computed from this data source, as presented by different groups in recent years. Hence, analysis of blood flow and pressure using 4D flow MRI can be a valuable technique in management of cardiovascular diseases. In order to perform these tasks, all necessary steps in the corresponding process chain can be carried out in our in-house developed software framework MEDIFRAME. In this article, we apply MEDIFRAME for a study of hemodynamics in the pulmonary arteries of five healthy volunteers. The study included measuring vector fields of blood flow velocities by phase-contrast MRI and subsequently computing relative blood pressure maps. We visualized blood flow by streamline depictions and computed characteristic values for the left and the right pulmonary artery (LPA and RPA). In all volunteers, we observed a lower amount of blood flow in the LPA compared to the RPA. Furthermore, we visualized blood pressure maps using volume rendering and generated graphs of pressure differences between the LPA, the RPA and the main pulmonary artery. In most volunteers, blood pressure was increased near to the bifurcation and in the proximal LPA, leading to higher average pressure values in the LPA compared to the RPA.

Real-time optical flow estimation on a GPU for a skied-steered mobile robot

NASA Astrophysics Data System (ADS)

Kniaz, V. V.

2016-04-01

Accurate egomotion estimation is required for mobile robot navigation. Often the egomotion is estimated using optical flow algorithms. For an accurate estimation of optical flow most of modern algorithms require high memory resources and processor speed. However simple single-board computers that control the motion of the robot usually do not provide such resources. On the other hand, most of modern single-board computers are equipped with an embedded GPU that could be used in parallel with a CPU to improve the performance of the optical flow estimation algorithm. This paper presents a new Z-flow algorithm for efficient computation of an optical flow using an embedded GPU. The algorithm is based on the phase correlation optical flow estimation and provide a real-time performance on a low cost embedded GPU. The layered optical flow model is used. Layer segmentation is performed using graph-cut algorithm with a time derivative based energy function. Such approach makes the algorithm both fast and robust in low light and low texture conditions. The algorithm implementation for a Raspberry Pi Model B computer is discussed. For evaluation of the algorithm the computer was mounted on a Hercules mobile skied-steered robot equipped with a monocular camera. The evaluation was performed using a hardware-in-the-loop simulation and experiments with Hercules mobile robot. Also the algorithm was evaluated using KITTY Optical Flow 2015 dataset. The resulting endpoint error of the optical flow calculated with the developed algorithm was low enough for navigation of the robot along the desired trajectory.

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

GOGrapher: A Python library for GO graph representation and analysis.

PubMed

Muller, Brian; Richards, Adam J; Jin, Bo; Lu, Xinghua

2009-07-07

The Gene Ontology is the most commonly used controlled vocabulary for annotating proteins. The concepts in the ontology are organized as a directed acyclic graph, in which a node corresponds to a biological concept and a directed edge denotes the parent-child semantic relationship between a pair of terms. A large number of protein annotations further create links between proteins and their functional annotations, reflecting the contemporary knowledge about proteins and their functional relationships. This leads to a complex graph consisting of interleaved biological concepts and their associated proteins. What is needed is a simple, open source library that provides tools to not only create and view the Gene Ontology graph, but to analyze and manipulate it as well. Here we describe the development and use of GOGrapher, a Python library that can be used for the creation, analysis, manipulation, and visualization of Gene Ontology related graphs. An object-oriented approach was adopted to organize the hierarchy of the graphs types and associated classes. An Application Programming Interface is provided through which different types of graphs can be pragmatically created, manipulated, and visualized. GOGrapher has been successfully utilized in multiple research projects, e.g., a graph-based multi-label text classifier for protein annotation. The GOGrapher project provides a reusable programming library designed for the manipulation and analysis of Gene Ontology graphs. The library is freely available for the scientific community to use and improve.

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

Verification of hypergraph states

NASA Astrophysics Data System (ADS)

Morimae, Tomoyuki; Takeuchi, Yuki; Hayashi, Masahito

2017-12-01

Hypergraph states are generalizations of graph states where controlled-Z gates on edges are replaced with generalized controlled-Z gates on hyperedges. Hypergraph states have several advantages over graph states. For example, certain hypergraph states, such as the Union Jack states, are universal resource states for measurement-based quantum computing with only Pauli measurements, while graph state measurement-based quantum computing needs non-Clifford basis measurements. Furthermore, it is impossible to classically efficiently sample measurement results on hypergraph states unless the polynomial hierarchy collapses to the third level. Although several protocols have been proposed to verify graph states with only sequential single-qubit Pauli measurements, there was no verification method for hypergraph states. In this paper, we propose a method for verifying a certain class of hypergraph states with only sequential single-qubit Pauli measurements. Importantly, no i.i.d. property of samples is assumed in our protocol: any artificial entanglement among samples cannot fool the verifier. As applications of our protocol, we consider verified blind quantum computing with hypergraph states, and quantum computational supremacy demonstrations with hypergraph states.

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.

Inter and intra-modal deformable registration: continuous deformations meet efficient optimal linear programming.

PubMed

Glocker, Ben; Paragios, Nikos; Komodakis, Nikos; Tziritas, Georgios; Navab, Nassir

2007-01-01

In this paper we propose a novel non-rigid volume registration based on discrete labeling and linear programming. The proposed framework reformulates registration as a minimal path extraction in a weighted graph. The space of solutions is represented using a set of a labels which are assigned to predefined displacements. The graph topology corresponds to a superimposed regular grid onto the volume. Links between neighborhood control points introduce smoothness, while links between the graph nodes and the labels (end-nodes) measure the cost induced to the objective function through the selection of a particular deformation for a given control point once projected to the entire volume domain, Higher order polynomials are used to express the volume deformation from the ones of the control points. Efficient linear programming that can guarantee the optimal solution up to (a user-defined) bound is considered to recover the optimal registration parameters. Therefore, the method is gradient free, can encode various similarity metrics (simple changes on the graph construction), can guarantee a globally sub-optimal solution and is computational tractable. Experimental validation using simulated data with known deformation, as well as manually segmented data demonstrate the extreme potentials of our approach.

Modelling food-web mediated effects of hydrological variability and environmental flows.

PubMed

Robson, Barbara J; Lester, Rebecca E; Baldwin, Darren S; Bond, Nicholas R; Drouart, Romain; Rolls, Robert J; Ryder, Darren S; Thompson, Ross M

2017-11-01

Environmental flows are designed to enhance aquatic ecosystems through a variety of mechanisms; however, to date most attention has been paid to the effects on habitat quality and life-history triggers, especially for fish and vegetation. The effects of environmental flows on food webs have so far received little attention, despite food-web thinking being fundamental to understanding of river ecosystems. Understanding environmental flows in a food-web context can help scientists and policy-makers better understand and manage outcomes of flow alteration and restoration. In this paper, we consider mechanisms by which flow variability can influence and alter food webs, and place these within a conceptual and numerical modelling framework. We also review the strengths and weaknesses of various approaches to modelling the effects of hydrological management on food webs. Although classic bioenergetic models such as Ecopath with Ecosim capture many of the key features required, other approaches, such as biogeochemical ecosystem modelling, end-to-end modelling, population dynamic models, individual-based models, graph theory models, and stock assessment models are also relevant. In many cases, a combination of approaches will be useful. We identify current challenges and new directions in modelling food-web responses to hydrological variability and environmental flow management. These include better integration of food-web and hydraulic models, taking physiologically-based approaches to food quality effects, and better representation of variations in space and time that may create ecosystem control points. Crown Copyright © 2017. Published by Elsevier Ltd. All rights reserved.

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks

PubMed Central

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P.; Gerstein, Mark

2010-01-01

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers’ continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems. PMID:20439753

Comparing genomes to computer operating systems in terms of the topology and evolution of their regulatory control networks.

PubMed

Yan, Koon-Kiu; Fang, Gang; Bhardwaj, Nitin; Alexander, Roger P; Gerstein, Mark

2010-05-18

The genome has often been called the operating system (OS) for a living organism. A computer OS is described by a regulatory control network termed the call graph, which is analogous to the transcriptional regulatory network in a cell. To apply our firsthand knowledge of the architecture of software systems to understand cellular design principles, we present a comparison between the transcriptional regulatory network of a well-studied bacterium (Escherichia coli) and the call graph of a canonical OS (Linux) in terms of topology and evolution. We show that both networks have a fundamentally hierarchical layout, but there is a key difference: The transcriptional regulatory network possesses a few global regulators at the top and many targets at the bottom; conversely, the call graph has many regulators controlling a small set of generic functions. This top-heavy organization leads to highly overlapping functional modules in the call graph, in contrast to the relatively independent modules in the regulatory network. We further develop a way to measure evolutionary rates comparably between the two networks and explain this difference in terms of network evolution. The process of biological evolution via random mutation and subsequent selection tightly constrains the evolution of regulatory network hubs. The call graph, however, exhibits rapid evolution of its highly connected generic components, made possible by designers' continual fine-tuning. These findings stem from the design principles of the two systems: robustness for biological systems and cost effectiveness (reuse) for software systems.

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.

Model predictive control of P-time event graphs

NASA Astrophysics Data System (ADS)

Hamri, H.; Kara, R.; Amari, S.

2016-12-01

This paper deals with model predictive control of discrete event systems modelled by P-time event graphs. First, the model is obtained by using the dater evolution model written in the standard algebra. Then, for the control law, we used the finite-horizon model predictive control. For the closed-loop control, we used the infinite-horizon model predictive control (IH-MPC). The latter is an approach that calculates static feedback gains which allows the stability of the closed-loop system while respecting the constraints on the control vector. The problem of IH-MPC is formulated as a linear convex programming subject to a linear matrix inequality problem. Finally, the proposed methodology is applied to a transportation system.

Distributed adaptive neural network control for a class of heterogeneous nonlinear multi-agent systems subject to actuation failures

NASA Astrophysics Data System (ADS)

Cui, Bing; Zhao, Chunhui; Ma, Tiedong; Feng, Chi

2017-02-01

In this paper, the cooperative adaptive consensus tracking problem for heterogeneous nonlinear multi-agent systems on directed graph is addressed. Each follower is modelled as a general nonlinear system with the unknown and nonidentical nonlinear dynamics, disturbances and actuator failures. Cooperative fault tolerant neural network tracking controllers with online adaptive learning features are proposed to guarantee that all agents synchronise to the trajectory of one leader with bounded adjustable synchronisation errors. With the help of linear quadratic regulator-based optimal design, a graph-dependent Lyapunov proof provides error bounds that depend on the graph topology, one virtual matrix and some design parameters. Of particular interest is that if the control gain is selected appropriately, the proposed control scheme can be implemented in a unified framework no matter whether there are faults or not. Furthermore, the fault detection and isolation are not needed to implement. Finally, a simulation is given to verify the effectiveness of the proposed method.

Description and detection of burst events in turbulent flows

NASA Astrophysics Data System (ADS)

Schmid, P. J.; García-Gutierrez, A.; Jiménez, J.

2018-04-01

A mathematical and computational framework is developed for the detection and identification of coherent structures in turbulent wall-bounded shear flows. In a first step, this data-based technique will use an embedding methodology to formulate the fluid motion as a phase-space trajectory, from which state-transition probabilities can be computed. Within this formalism, a second step then applies repeated clustering and graph-community techniques to determine a hierarchy of coherent structures ranked by their persistencies. This latter information will be used to detect highly transitory states that act as precursors to violent and intermittent events in turbulent fluid motion (e.g., bursts). Used as an analysis tool, this technique allows the objective identification of intermittent (but important) events in turbulent fluid motion; however, it also lays the foundation for advanced control strategies for their manipulation. The techniques are applied to low-dimensional model equations for turbulent transport, such as the self-sustaining process (SSP), for varying levels of complexity.

Numerical treatment for Carreau nanofluid flow over a porous nonlinear stretching surface

NASA Astrophysics Data System (ADS)

Eid, Mohamed R.; Mahny, Kasseb L.; Muhammad, Taseer; Sheikholeslami, Mohsen

2018-03-01

The impact of magnetic field and nanoparticles on the two-phase flow of a generalized non-Newtonian Carreau fluid over permeable non-linearly stretching surface has been analyzed in the existence of all suction/injection and thermal radiation. The governing PDEs with congruous boundary condition are transformed into a system of non-linear ODEs with appropriate boundary conditions by using similarity transformation. It solved numerically by using 4th-5th order Runge-Kutta-Fehlberg method based on shooting technique. The impacts of non-dimensional controlling parameters on velocity, temperature, and nanoparticles volume concentration profiles are scrutinized with aid of graphs. The Nusselt and the Sherwood numbers are studied at the different situations of the governing parameters. The numerical computations are in excellent consent with previously reported studies. It is found that the heat transfer rate is reduced with an increment of thermal radiation parameter and on contrary of the rising of magnetic field. The opposite trend happens in the mass transfer rate.

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.

Matched signal detection on graphs: Theory and application to brain imaging data classification.

PubMed

Hu, Chenhui; Sepulcre, Jorge; Johnson, Keith A; Fakhri, Georges E; Lu, Yue M; Li, Quanzheng

2016-01-15

Motivated by recent progress in signal processing on graphs, we have developed a matched signal detection (MSD) theory for signals with intrinsic structures described by weighted graphs. First, we regard graph Laplacian eigenvalues as frequencies of graph-signals and assume that the signal is in a subspace spanned by the first few graph Laplacian eigenvectors associated with lower eigenvalues. The conventional matched subspace detector can be applied to this case. Furthermore, we study signals that may not merely live in a subspace. Concretely, we consider signals with bounded variation on graphs and more general signals that are randomly drawn from a prior distribution. For bounded variation signals, the test is a weighted energy detector. For the random signals, the test statistic is the difference of signal variations on associated graphs, if a degenerate Gaussian distribution specified by the graph Laplacian is adopted. We evaluate the effectiveness of the MSD on graphs both with simulated and real data sets. Specifically, we apply MSD to the brain imaging data classification problem of Alzheimer's disease (AD) based on two independent data sets: 1) positron emission tomography data with Pittsburgh compound-B tracer of 30 AD and 40 normal control (NC) subjects, and 2) resting-state functional magnetic resonance imaging (R-fMRI) data of 30 early mild cognitive impairment and 20 NC subjects. Our results demonstrate that the MSD approach is able to outperform the traditional methods and help detect AD at an early stage, probably due to the success of exploiting the manifold structure of the data. Copyright © 2015. Published by Elsevier Inc.

A tool for filtering information in complex systems

NASA Astrophysics Data System (ADS)

Tumminello, M.; Aste, T.; Di Matteo, T.; Mantegna, R. N.

2005-07-01

We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties. This paper was submitted directly (Track II) to the PNAS office.Abbreviations: MST, minimum spanning tree; PMFG, Planar Maximally Filtered Graph; r-clique, clique of r elements.

Towards an agent based traffic regulation and recommendation system for the on-road air quality control.

PubMed

Sadiq, Abderrahmane; El Fazziki, Abdelaziz; Ouarzazi, Jamal; Sadgal, Mohamed

2016-01-01

This paper presents an integrated and adaptive problem-solving approach to control the on-road air quality by modeling the road infrastructure, managing traffic based on pollution level and generating recommendations for road users. The aim is to reduce vehicle emissions in the most polluted road segments and optimizing the pollution levels. For this we propose the use of historical and real time pollution records and contextual data to calculate the air quality index on road networks and generate recommendations for reassigning traffic flow in order to improve the on-road air quality. The resulting air quality indexes are used in the system's traffic network generation, which the cartography is represented by a weighted graph. The weights evolve according to the pollution indexes and path properties and the graph is therefore dynamic. Furthermore, the systems use the available pollution data and meteorological records in order to predict the on-road pollutant levels by using an artificial neural network based prediction model. The proposed approach combines the benefits of multi-agent systems, Big data technology, machine learning tools and the available data sources. For the shortest path searching in the road network, we use the Dijkstra algorithm over Hadoop MapReduce framework. The use Hadoop framework in the data retrieve and analysis process has significantly improved the performance of the proposed system. Also, the agent technology allowed proposing a suitable solution in terms of robustness and agility.

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.

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.

Expert systems for automated maintenance of a Mars oxygen production system

NASA Astrophysics Data System (ADS)

Huang, Jen-Kuang; Ho, Ming-Tsang; Ash, Robert L.

1992-08-01

Application of expert system concepts to a breadboard Mars oxygen processor unit have been studied and tested. The research was directed toward developing the methodology required to enable autonomous operation and control of these simple chemical processors at Mars. Failure detection and isolation was the key area of concern, and schemes using forward chaining, backward chaining, knowledge-based expert systems, and rule-based expert systems were examined. Tests and simulations were conducted that investigated self-health checkout, emergency shutdown, and fault detection, in addition to normal control activities. A dynamic system model was developed using the Bond-Graph technique. The dynamic model agreed well with tests involving sudden reductions in throughput. However, nonlinear effects were observed during tests that incorporated step function increases in flow variables. Computer simulations and experiments have demonstrated the feasibility of expert systems utilizing rule-based diagnosis and decision-making algorithms.

GOGrapher: A Python library for GO graph representation and analysis

PubMed Central

Muller, Brian; Richards, Adam J; Jin, Bo; Lu, Xinghua

2009-01-01

Background The Gene Ontology is the most commonly used controlled vocabulary for annotating proteins. The concepts in the ontology are organized as a directed acyclic graph, in which a node corresponds to a biological concept and a directed edge denotes the parent-child semantic relationship between a pair of terms. A large number of protein annotations further create links between proteins and their functional annotations, reflecting the contemporary knowledge about proteins and their functional relationships. This leads to a complex graph consisting of interleaved biological concepts and their associated proteins. What is needed is a simple, open source library that provides tools to not only create and view the Gene Ontology graph, but to analyze and manipulate it as well. Here we describe the development and use of GOGrapher, a Python library that can be used for the creation, analysis, manipulation, and visualization of Gene Ontology related graphs. Findings An object-oriented approach was adopted to organize the hierarchy of the graphs types and associated classes. An Application Programming Interface is provided through which different types of graphs can be pragmatically created, manipulated, and visualized. GOGrapher has been successfully utilized in multiple research projects, e.g., a graph-based multi-label text classifier for protein annotation. Conclusion The GOGrapher project provides a reusable programming library designed for the manipulation and analysis of Gene Ontology graphs. The library is freely available for the scientific community to use and improve. PMID:19583843

Movement Forms: A Graph-Dynamic Perspective

PubMed Central

Saltzman, Elliot; Holt, Ken

2014-01-01

The focus of this paper is on characterizing the physical movement forms (e.g., walk, crawl, roll, etc.) that can be used to actualize abstract, functionally-specified behavioral goals (e.g., locomotion). Emphasis is placed on how such forms are distinguished from one another, in part, by the set of topological patterns of physical contact between agent and environment (i.e., the set of physical graphs associated with each form) and the transitions among these patterns displayed over the course of performance (i.e., the form’s physical graph dynamics). Crucial in this regard is the creation and dissolution of loops in these graphs, which can be related to the distinction between open and closed kinematic chains. Formal similarities are described within the theoretical framework of task-dynamics between physically-closed kinematic chains (physical loops) that are created during various movement forms and functionally-closed kinematic chains (functional loops) that are associated with task-space control of end-effectors; it is argued that both types of loop must be flexibly incorporated into the coordinative structures that govern skilled action. Final speculation is focused on the role of graphs and their dynamics, not only in processes of coordination and control for individual agents, but also in processes of inter-agent coordination and the coupling of agents with (non-sentient) environmental objects. PMID:24910507

Movement Forms: A Graph-Dynamic Perspective.

PubMed

Saltzman, Elliot; Holt, Ken

2014-01-01

The focus of this paper is on characterizing the physical movement forms (e.g., walk, crawl, roll, etc.) that can be used to actualize abstract, functionally-specified behavioral goals (e.g., locomotion). Emphasis is placed on how such forms are distinguished from one another, in part, by the set of topological patterns of physical contact between agent and environment (i.e., the set of physical graphs associated with each form) and the transitions among these patterns displayed over the course of performance (i.e., the form's physical graph dynamics ). Crucial in this regard is the creation and dissolution of loops in these graphs, which can be related to the distinction between open and closed kinematic chains. Formal similarities are described within the theoretical framework of task-dynamics between physically-closed kinematic chains (physical loops) that are created during various movement forms and functionally-closed kinematic chains (functional loops) that are associated with task-space control of end-effectors; it is argued that both types of loop must be flexibly incorporated into the coordinative structures that govern skilled action. Final speculation is focused on the role of graphs and their dynamics, not only in processes of coordination and control for individual agents, but also in processes of inter-agent coordination and the coupling of agents with (non-sentient) environmental objects.

Managing the Budget: Stock-Flow Reasoning and the CO2 Accumulation Problem.

PubMed

Newell, Ben R; Kary, Arthur; Moore, Chris; Gonzalez, Cleotilde

2016-01-01

The majority of people show persistent poor performance in reasoning about "stock-flow problems" in the laboratory. An important example is the failure to understand the relationship between the "stock" of CO2 in the atmosphere, the "inflow" via anthropogenic CO2 emissions, and the "outflow" via natural CO2 absorption. This study addresses potential causes of reasoning failures in the CO2 accumulation problem and reports two experiments involving a simple re-framing of the task as managing an analogous financial (rather than CO2 ) budget. In Experiment 1 a financial version of the task that required participants to think in terms of controlling debt demonstrated significant improvements compared to a standard CO2 accumulation problem. Experiment 2, in which participants were invited to think about managing savings, suggested that this improvement was fortuitous and coincidental rather than due to a fundamental change in understanding the stock-flow relationships. The role of graphical information in aiding or abetting stock-flow reasoning was also explored in both experiments, with the results suggesting that graphs do not always assist understanding. The potential for leveraging the kind of reasoning exhibited in such tasks in an effort to change people's willingness to reduce CO2 emissions is briefly discussed. Copyright © 2015 Cognitive Science Society, Inc.

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

The effects of an integrated Algebra 1/physical science curriculum on student achievement in Algebra 1, proportional reasoning and graphing abilities

NASA Astrophysics Data System (ADS)

Lawrence, Lettie Carol

1997-08-01

The purpose of this investigation was to determine if an integrated curriculum in algebra 1/physical science facilitates acquisition of proportional reasoning and graphing abilities better than a non-integrated, traditional, algebra 1 curriculum. Also, this study was to ascertain if the integrated algebra 1/physical science curriculum resulted in greater student achievement in algebra 1. The curriculum used in the experimental class was SAM 9 (Science and Mathematics 9), an investigation-based curriculum that was written to integrate physical science and basic algebra content. The experiment was conducted over one school year. The subjects in the study were 61 ninth grade students. The experimental group consisted of one class taught concurrently by a mathematics teacher and a physical science teacher. The control group consisted of three classes of algebra 1 students taught by one mathematics teacher and taking physical science with other teachers in the school who were not participating in the SAM 9 program. This study utilized a quasi-experimental non-randomized control group pretest-posttest design. The investigator obtained end-of-algebra 1 scores from student records. The written open-ended graphing instruments and the proportional reasoning instrument were administered to both groups as pretests and posttests. The graphing instruments were also administered as a midtest. A two sample t-test for independent means was used to determine significant differences in achievement on the end-of-course algebra 1 test. Quantitative data from the proportional reasoning and graphing instruments were analyzed using a repeated measures analysis of variance to determine differences in scores over time for the experimental and control groups. The findings indicate no significant difference between the experimental and control groups on the end-of-course algebra 1 test. Results also indicate no significant differences in proportional reasoning and graphing abilities between the two groups over time. However, all subjects (experimental and control groups) made significant improvement in graphing abilities over one school year. In this study, students participating in an investigation-based curriculum integrating algebra 1 and physical science performed as well on the instruments as the students in the traditional curriculum. Therefore, an argument can be made that instruction using an integrated curriculum (algebra l/physical science) is a viable alternative to instruction using a more traditional algebra 1 curriculum. Finally, the integrated curriculum adheres to the constructivist theoretical perspective (Krupnik-Gotlieb, 1995) and is more consistent with recommendations in the NCTM Standards (1992) than the traditional curriculum.

A tool for filtering information in complex systems

PubMed Central

Tumminello, M.; Aste, T.; Di Matteo, T.; Mantegna, R. N.

2005-01-01

We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties. PMID:16027373

A tool for filtering information in complex systems.

PubMed

Tumminello, M; Aste, T; Di Matteo, T; Mantegna, R N

2005-07-26

We introduce a technique to filter out complex data sets by extracting a subgraph of representative links. Such a filtering can be tuned up to any desired level by controlling the genus of the resulting graph. We show that this technique is especially suitable for correlation-based graphs, giving filtered graphs that preserve the hierarchical organization of the minimum spanning tree but containing a larger amount of information in their internal structure. In particular in the case of planar filtered graphs (genus equal to 0), triangular loops and four-element cliques are formed. The application of this filtering procedure to 100 stocks in the U.S. equity markets shows that such loops and cliques have important and significant relationships with the market structure and properties.

Graph Theory and Cognition: An Alternative Avenue for Examining Neuropsychological Status in Epilepsy

PubMed Central

Garcia-Ramos, Camille; Lin, Jack J; Kellermann, Tanja S; Bonilha, Leonardo; Prabhakaran, Vivek; Hermann, Bruce P

2016-01-01

The recent revision of the classification of the epilepsies released by the ILAE Commission on Classification and Terminology (2005–2009) has been a major development in the field. Papers in this section of the special issue were charged with examining the relevance of other techniques and approaches to examining, categorizing and classifying cognitive and behavioral comorbidities. In that light, we investigate the applicability of graph theory to understand the impact of epilepsy on cognition compared to controls, and then the patterns of cognitive development in normally developing children which would set the stage for prospective comparisons of children with epilepsy and controls. The overall goal is to examine the potential utility of other analytic tools and approaches to conceptualize the cognitive comorbidities in epilepsy. Given that the major cognitive domains representing cognitive function are interdependent, the associations between the neuropsychological abilities underlying these domains can be referred to as a cognitive network. Therefore, the architecture of this cognitive network can be quantified and assessed using graph theory methods, rendering a novel approach to the characterization of cognitive status. In this article we provide fundamental information about graph theory procedures, followed by application of these techniques to cross-sectional analysis of neuropsychological data in children with epilepsy compared to controls, finalizing with prospective analysis of neuropsychological development in younger and older healthy controls. PMID:27017326

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

Optimal Navigation of Self-Propelled Colloids in Microstructured Mazes

NASA Astrophysics Data System (ADS)

Yang, Yuguang; Bevan, Michael

Controlling navigation of self-propelled microscopic `robots' subject to random Brownian motion in complex microstructured environments (e.g., porous media, tumor vasculature) is important to many emerging applications (e.g., enhanced oil recovery, drug delivery). In this work, we design an optimal feedback policy to navigate an active self-propelled colloidal rod in complex mazes with various obstacle types. Actuation of the rods is modelled based on a light-controlled osmotic flow mechanism, which produces different propulsion velocities along the rod's long axis. Actuator-parameterized Langevin equations, with soft rod-obstacle repulsive interactions, are developed to describe the system dynamics. A Markov decision process (MDP) framework is used for optimal policy calculations with design goals of colloidal rods reaching target end points in minimum time. Simulations show that optimal MDP-based policies are able to control rod trajectories to reach target regions order-of-magnitudes faster than uncontrolled rods, which diverges as maze complexity increases. An efficient multi-graph based implementation for MDP is also presented, which scales linearly with the maze dimension.

Math Description Engine Software Development Kit

NASA Technical Reports Server (NTRS)

Shelton, Robert O.; Smith, Stephanie L.; Dexter, Dan E.; Hodgson, Terry R.

2010-01-01

The Math Description Engine Software Development Kit (MDE SDK) can be used by software developers to make computer-rendered graphs more accessible to blind and visually-impaired users. The MDE SDK generates alternative graph descriptions in two forms: textual descriptions and non-verbal sound renderings, or sonification. It also enables display of an animated trace of a graph sonification on a visual graph component, with color and line-thickness options for users having low vision or color-related impairments. A set of accessible graphical user interface widgets is provided for operation by end users and for control of accessible graph displays. Version 1.0 of the MDE SDK generates text descriptions for 2D graphs commonly seen in math and science curriculum (and practice). The mathematically rich text descriptions can also serve as a virtual math and science assistant for blind and sighted users, making graphs more accessible for everyone. The MDE SDK has a simple application programming interface (API) that makes it easy for programmers and Web-site developers to make graphs accessible with just a few lines of code. The source code is written in Java for cross-platform compatibility and to take advantage of Java s built-in support for building accessible software application interfaces. Compiled-library and NASA Open Source versions are available with API documentation and Programmer s Guide at http:/ / prim e.jsc.n asa. gov.

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).

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks

PubMed Central

Meyer-Bäse, Anke; Roberts, Rodney G.; Illan, Ignacio A.; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja

2017-01-01

Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts. PMID:29051730

Dynamical Graph Theory Networks Methods for the Analysis of Sparse Functional Connectivity Networks and for Determining Pinning Observability in Brain Networks.

PubMed

Meyer-Bäse, Anke; Roberts, Rodney G; Illan, Ignacio A; Meyer-Bäse, Uwe; Lobbes, Marc; Stadlbauer, Andreas; Pinker-Domenig, Katja

2017-01-01

Neuroimaging in combination with graph theory has been successful in analyzing the functional connectome. However almost all analysis are performed based on static graph theory. The derived quantitative graph measures can only describe a snap shot of the disease over time. Neurodegenerative disease evolution is poorly understood and treatment strategies are consequently only of limited efficiency. Fusing modern dynamic graph network theory techniques and modeling strategies at different time scales with pinning observability of complex brain networks will lay the foundation for a transformational paradigm in neurodegnerative diseases research regarding disease evolution at the patient level, treatment response evaluation and revealing some central mechanism in a network that drives alterations in these diseases. We model and analyze brain networks as two-time scale sparse dynamic graph networks with hubs (clusters) representing the fast sub-system and the interconnections between hubs the slow sub-system. Alterations in brain function as seen in dementia can be dynamically modeled by determining the clusters in which disturbance inputs have entered and the impact they have on the large-scale dementia dynamic system. Observing a small fraction of specific nodes in dementia networks such that the others can be recovered is accomplished by the novel concept of pinning observability. In addition, how to control this complex network seems to be crucial in understanding the progressive abnormal neural circuits in many neurodegenerative diseases. Detecting the controlling regions in the networks, which serve as key nodes to control the aberrant dynamics of the networks to a desired state and thus influence the progressive abnormal behavior, will have a huge impact in understanding and developing therapeutic solutions and also will provide useful information about the trajectory of the disease. In this paper, we present the theoretical framework and derive the necessary conditions for (1) area aggregation and time-scale modeling in brain networks and for (2) pinning observability of nodes in dynamic graph networks. Simulation examples are given to illustrate the theoretical concepts.

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.

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).

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

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

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.

Graph theoretical model of a sensorimotor connectome in zebrafish.

PubMed

Stobb, Michael; Peterson, Joshua M; Mazzag, Borbala; Gahtan, Ethan

2012-01-01

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.

An approach for brain-controlled prostheses based on Scene Graph Steady-State Visual Evoked Potentials.

PubMed

Li, Rui; Zhang, Xiaodong; Li, Hanzhe; Zhang, Liming; Lu, Zhufeng; Chen, Jiangcheng

2018-08-01

Brain control technology can restore communication between the brain and a prosthesis, and choosing a Brain-Computer Interface (BCI) paradigm to evoke electroencephalogram (EEG) signals is an essential step for developing this technology. In this paper, the Scene Graph paradigm used for controlling prostheses was proposed; this paradigm is based on Steady-State Visual Evoked Potentials (SSVEPs) regarding the Scene Graph of a subject's intention. A mathematic model was built to predict SSVEPs evoked by the proposed paradigm and a sinusoidal stimulation method was used to present the Scene Graph stimulus to elicit SSVEPs from subjects. Then, a 2-degree of freedom (2-DOF) brain-controlled prosthesis system was constructed to validate the performance of the Scene Graph-SSVEP (SG-SSVEP)-based BCI. The classification of SG-SSVEPs was detected via the Canonical Correlation Analysis (CCA) approach. To assess the efficiency of proposed BCI system, the performances of traditional SSVEP-BCI system were compared. Experimental results from six subjects suggested that the proposed system effectively enhanced the SSVEP responses, decreased the degradation of SSVEP strength and reduced the visual fatigue in comparison with the traditional SSVEP-BCI system. The average signal to noise ratio (SNR) of SG-SSVEP was 6.31 ± 2.64 dB, versus 3.38 ± 0.78 dB of traditional-SSVEP. In addition, the proposed system achieved good performances in prosthesis control. The average accuracy was 94.58% ± 7.05%, and the corresponding high information transfer rate (IRT) was 19.55 ± 3.07 bit/min. The experimental results revealed that the SG-SSVEP based BCI system achieves the good performance and improved the stability relative to the conventional approach. Copyright © 2018 Elsevier B.V. All rights reserved.

Effect of Scientific Argumentation on the Development of Scientific Process Skills in the Context of Teaching Chemistry

ERIC Educational Resources Information Center

Gultepe, Nejla; Kilic, Ziya

2015-01-01

This study was conducted in order to determine the differences in integrated scientific process skills (designing experiments, forming data tables, drawing graphs, graph interpretation, determining the variables and hypothesizing, changing and controlling variables) of students (n = 17) who were taught with an approach based on scientific…

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.

Numerical simulation of electron scattering by nanotube junctions

NASA Astrophysics Data System (ADS)

Brüning, J.; Grikurov, V. E.

2008-03-01

We demonstrate the possibility of computing the intensity of electronic transport through various junctions of three-dimensional metallic nanotubes. In particular, we observe that the magnetic field can be used to control the switch of electron in Y-type junctions. Keeping in mind the asymptotic modeling of reliable nanostructures by quantum graphs, we conjecture that the scattering matrix of the graph should be the same as the scattering matrix of its nanosize-prototype. The numerical computation of the latter gives a method for determining the "gluing" conditions at a graph. Exploring this conjecture, we show that the Kirchhoff conditions (which are commonly used on graphs) cannot be applied to model reliable junctions. This work is a natural extension of the paper [1], but it is written in a self-consistent manner.

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.

A clustering-based graph Laplacian framework for value function approximation in reinforcement learning.

PubMed

Xu, Xin; Huang, Zhenhua; Graves, Daniel; Pedrycz, Witold

2014-12-01

In order to deal with the sequential decision problems with large or continuous state spaces, feature representation and function approximation have been a major research topic in reinforcement learning (RL). In this paper, a clustering-based graph Laplacian framework is presented for feature representation and value function approximation (VFA) in RL. By making use of clustering-based techniques, that is, K-means clustering or fuzzy C-means clustering, a graph Laplacian is constructed by subsampling in Markov decision processes (MDPs) with continuous state spaces. The basis functions for VFA can be automatically generated from spectral analysis of the graph Laplacian. The clustering-based graph Laplacian is integrated with a class of approximation policy iteration algorithms called representation policy iteration (RPI) for RL in MDPs with continuous state spaces. Simulation and experimental results show that, compared with previous RPI methods, the proposed approach needs fewer sample points to compute an efficient set of basis functions and the learning control performance can be improved for a variety of parameter settings.

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.

Brain gray matter structural network in myotonic dystrophy type 1.

PubMed

Sugiyama, Atsuhiko; Sone, Daichi; Sato, Noriko; Kimura, Yukio; Ota, Miho; Maikusa, Norihide; Maekawa, Tomoko; Enokizono, Mikako; Mori-Yoshimura, Madoka; Ohya, Yasushi; Kuwabara, Satoshi; Matsuda, Hiroshi

2017-01-01

This study aimed to investigate abnormalities in structural covariance network constructed from gray matter volume in myotonic dystrophy type 1 (DM1) patients by using graph theoretical analysis for further clarification of the underlying mechanisms of central nervous system involvement. Twenty-eight DM1 patients (4 childhood onset, 10 juvenile onset, 14 adult onset), excluding three cases from 31 consecutive patients who underwent magnetic resonance imaging in a certain period, and 28 age- and sex- matched healthy control subjects were included in this study. The normalized gray matter images of both groups were subjected to voxel based morphometry (VBM) and Graph Analysis Toolbox for graph theoretical analysis. VBM revealed extensive gray matter atrophy in DM1 patients, including cortical and subcortical structures. On graph theoretical analysis, there were no significant differences between DM1 and control groups in terms of the global measures of connectivity. Betweenness centrality was increased in several regions including the left fusiform gyrus, whereas it was decreased in the right striatum. The absence of significant differences between the groups in global network measurements on graph theoretical analysis is consistent with the fact that the general cognitive function is preserved in DM1 patients. In DM1 patients, increased connectivity in the left fusiform gyrus and decreased connectivity in the right striatum might be associated with impairment in face perception and theory of mind, and schizotypal-paranoid personality traits, respectively.

Distributed Cooperative Optimal Control for Multiagent Systems on Directed Graphs: An Inverse Optimal Approach.

PubMed

Zhang, Huaguang; Feng, Tao; Yang, Guang-Hong; Liang, Hongjing

2015-07-01

In this paper, the inverse optimal approach is employed to design distributed consensus protocols that guarantee consensus and global optimality with respect to some quadratic performance indexes for identical linear systems on a directed graph. The inverse optimal theory is developed by introducing the notion of partial stability. As a result, the necessary and sufficient conditions for inverse optimality are proposed. By means of the developed inverse optimal theory, the necessary and sufficient conditions are established for globally optimal cooperative control problems on directed graphs. Basic optimal cooperative design procedures are given based on asymptotic properties of the resulting optimal distributed consensus protocols, and the multiagent systems can reach desired consensus performance (convergence rate and damping rate) asymptotically. Finally, two examples are given to illustrate the effectiveness of the proposed methods.

Flux control coefficients determined by inhibitor titration: the design and analysis of experiments to minimize errors.

PubMed Central

Small, J R

1993-01-01

This paper is a study into the effects of experimental error on the estimated values of flux control coefficients obtained using specific inhibitors. Two possible techniques for analysing the experimental data are compared: a simple extrapolation method (the so-called graph method) and a non-linear function fitting method. For these techniques, the sources of systematic errors are identified and the effects of systematic and random errors are quantified, using both statistical analysis and numerical computation. It is shown that the graph method is very sensitive to random errors and, under all conditions studied, that the fitting method, even under conditions where the assumptions underlying the fitted function do not hold, outperformed the graph method. Possible ways of designing experiments to minimize the effects of experimental errors are analysed and discussed. PMID:8257434

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.

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.

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.

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.

The use of control charts by laypeople and hospital decision-makers for guiding decision making.

PubMed

Schmidtke, K A; Watson, D G; Vlaev, I

2017-07-01

Graphs presenting healthcare data are increasingly available to support laypeople and hospital staff's decision making. When making these decisions, hospital staff should consider the role of chance-that is, random variation. Given random variation, decision-makers must distinguish signals (sometimes called special-cause data) from noise (common-cause data). Unfortunately, many graphs do not facilitate the statistical reasoning necessary to make such distinctions. Control charts are a less commonly used type of graph that support statistical thinking by including reference lines that separate data more likely to be signals from those more likely to be noise. The current work demonstrates for whom (laypeople and hospital staff) and when (treatment and investigative decisions) control charts strengthen data-driven decision making. We present two experiments that compare people's use of control and non-control charts to make decisions between hospitals (funnel charts vs. league tables) and to monitor changes across time (run charts with control lines vs. run charts without control lines). As expected, participants more accurately identified the outlying data using a control chart than using a non-control chart, but their ability to then apply that information to more complicated questions (e.g., where should I go for treatment?, and should I investigate?) was limited. The discussion highlights some common concerns about using control charts in hospital settings.

Differentiated Learning Environment--A Classroom for Quadratic Equation, Function and Graphs

ERIC Educational Resources Information Center

Dinç, Emre

2017-01-01

This paper will cover the design of a learning environment as a classroom regarding the Quadratic Equations, Functions and Graphs. The goal of the learning environment offered in the paper is to design a classroom where students will enjoy the process, use their skills they already have during the learning process, control and plan their learning…

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.

Graph theory and cognition: A complementary avenue for examining neuropsychological status in epilepsy.

PubMed

Garcia-Ramos, Camille; Lin, Jack J; Kellermann, Tanja S; Bonilha, Leonardo; Prabhakaran, Vivek; Hermann, Bruce P

2016-11-01

The recent revision of the classification of the epilepsies released by the ILAE Commission on Classification and Terminology (2005-2009) has been a major development in the field. Papers in this section of the special issue explore the relevance of other techniques to examine, categorize, and classify cognitive and behavioral comorbidities in epilepsy. In this review, we investigate the applicability of graph theory to understand the impact of epilepsy on cognition compared with controls and, then, the patterns of cognitive development in normally developing children which would set the stage for prospective comparisons of children with epilepsy and controls. The overall goal is to examine the potential utility of this analytic tool and approach to conceptualize the cognitive comorbidities in epilepsy. Given that the major cognitive domains representing cognitive function are interdependent, the associations between neuropsychological abilities underlying these domains can be referred to as a cognitive network. Therefore, the architecture of this cognitive network can be quantified and assessed using graph theory methods, rendering a novel approach to the characterization of cognitive status. We first provide fundamental information about graph theory procedures, followed by application of these techniques to cross-sectional analysis of neuropsychological data in children with epilepsy compared with that of controls, concluding with prospective analysis of neuropsychological development in younger and older healthy controls. This article is part of a Special Issue entitled "The new approach to classification: Rethinking cognition and behavior in epilepsy". Copyright © 2016 Elsevier Inc. All rights reserved.

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.

Detecting false positives in multielement designs: implications for brief assessments.

PubMed

Bartlett, Sara M; Rapp, John T; Henrickson, Marissa L

2011-11-01

The authors assessed the extent to which multielement designs produced false positives using continuous duration recording (CDR) and interval recording with 10-s and 1-min interval sizes. Specifically, they created 6,000 graphs with multielement designs that varied in the number of data paths, and the number of data points per data path, using a random number generator. In Experiment 1, the authors visually analyzed the graphs for the occurrence of false positives. Results indicated that graphs depicting only two sessions for each condition (e.g., a control condition plotted with multiple test conditions) produced the highest percentage of false positives for CDR and interval recording with 10-s and 1-min intervals. Conversely, graphs with four or five sessions for each condition produced the lowest percentage of false positives for each method. In Experiment 2, they applied two new rules, which were intended to decrease false positives, to each graph that depicted a false positive in Experiment 1. Results showed that application of new rules decreased false positives to less than 5% for all of the graphs except for those with two data paths and two data points per data path. Implications for brief assessments are discussed.

Graph theory analysis of cortical thickness networks in adolescents with d-transposition of the great arteries.

PubMed

Watson, Christopher G; Stopp, Christian; Newburger, Jane W; Rivkin, Michael J

2018-02-01

Adolescents with d-transposition of the great arteries (d-TGA) who had the arterial switch operation in infancy have been found to have structural brain differences compared to healthy controls. We used cortical thickness measurements obtained from structural brain MRI to determine group differences in global brain organization using a graph theoretical approach. Ninety-two d-TGA subjects and 49 controls were scanned using one of two identical 1.5-Tesla MRI systems. Mean cortical thickness was obtained from 34 regions per hemisphere using Freesurfer. A linear model was used for each brain region to adjust for subject age, sex, and scanning location. Structural connectivity for each group was inferred based on the presence of high inter-regional correlations of the linear model residuals, and binary connectivity matrices were created by thresholding over a range of correlation values for each group. Graph theory analysis was performed using packages in R. Permutation tests were performed to determine significance of between-group differences in global network measures. Within-group connectivity patterns were qualitatively different between groups. At lower network densities, controls had significantly more long-range connections. The location and number of hub regions differed between groups: controls had a greater number of hubs at most network densities. The control network had a significant rightward asymmetry compared to the d-TGA group at all network densities. Using graph theory analysis of cortical thickness correlations, we found differences in brain structural network organization among d-TGA adolescents compared to controls. These may be related to the white matter and gray matter differences previously found in this cohort, and in turn may be related to the cognitive deficits this cohort presents.

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.

Multi-label literature classification based on the Gene Ontology graph.

PubMed

Jin, Bo; Muller, Brian; Zhai, Chengxiang; Lu, Xinghua

2008-12-08

The Gene Ontology is a controlled vocabulary for representing knowledge related to genes and proteins in a computable form. The current effort of manually annotating proteins with the Gene Ontology is outpaced by the rate of accumulation of biomedical knowledge in literature, which urges the development of text mining approaches to facilitate the process by automatically extracting the Gene Ontology annotation from literature. The task is usually cast as a text classification problem, and contemporary methods are confronted with unbalanced training data and the difficulties associated with multi-label classification. In this research, we investigated the methods of enhancing automatic multi-label classification of biomedical literature by utilizing the structure of the Gene Ontology graph. We have studied three graph-based multi-label classification algorithms, including a novel stochastic algorithm and two top-down hierarchical classification methods for multi-label literature classification. We systematically evaluated and compared these graph-based classification algorithms to a conventional flat multi-label algorithm. The results indicate that, through utilizing the information from the structure of the Gene Ontology graph, the graph-based multi-label classification methods can significantly improve predictions of the Gene Ontology terms implied by the analyzed text. Furthermore, the graph-based multi-label classifiers are capable of suggesting Gene Ontology annotations (to curators) that are closely related to the true annotations even if they fail to predict the true ones directly. A software package implementing the studied algorithms is available for the research community. Through utilizing the information from the structure of the Gene Ontology graph, the graph-based multi-label classification methods have better potential than the conventional flat multi-label classification approach to facilitate protein annotation based on the literature.

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.

SFG synthesis of general high-order all-pass and all-pole current transfer functions using CFTAs.

PubMed

Tangsrirat, Worapong

2014-01-01

An approach of using the signal flow graph (SFG) technique to synthesize general high-order all-pass and all-pole current transfer functions with current follower transconductance amplifiers (CFTAs) and grounded capacitors has been presented. For general nth-order systems, the realized all-pass structure contains at most n + 1 CFTAs and n grounded capacitors, while the all-pole lowpass circuit requires only n CFTAs and n grounded capacitors. The resulting circuits obtained from the synthesis procedure are resistor-less structures and especially suitable for integration. They also exhibit low-input and high-output impedances and also convenient electronic controllability through the g m-value of the CFTA. Simulation results using real transistor model parameters ALA400 are also included to confirm the theory.

SFG Synthesis of General High-Order All-Pass and All-Pole Current Transfer Functions Using CFTAs

PubMed Central

Tangsrirat, Worapong

2014-01-01

An approach of using the signal flow graph (SFG) technique to synthesize general high-order all-pass and all-pole current transfer functions with current follower transconductance amplifiers (CFTAs) and grounded capacitors has been presented. For general nth-order systems, the realized all-pass structure contains at most n + 1 CFTAs and n grounded capacitors, while the all-pole lowpass circuit requires only n CFTAs and n grounded capacitors. The resulting circuits obtained from the synthesis procedure are resistor-less structures and especially suitable for integration. They also exhibit low-input and high-output impedances and also convenient electronic controllability through the g m-value of the CFTA. Simulation results using real transistor model parameters ALA400 are also included to confirm the theory. PMID:24688375

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.

Verification of operation of the actuator control system using the integration the B&R Automation Studio software with a virtual model of the actuator system

NASA Astrophysics Data System (ADS)

Herbuś, K.; Ociepka, P.

2017-08-01

In the work is analysed a sequential control system of a machine for separating and grouping work pieces for processing. Whereas, the area of the considered problem is related with verification of operation of an actuator system of an electro-pneumatic control system equipped with a PLC controller. Wherein to verification is subjected the way of operation of actuators in view of logic relationships assumed in the control system. The actuators of the considered control system were three drives of linear motion (pneumatic cylinders). And the logical structure of the system of operation of the control system is based on the signals flow graph. The tested logical structure of operation of the electro-pneumatic control system was implemented in the Automation Studio software of B&R company. This software is used to create programs for the PLC controllers. Next, in the FluidSIM software was created the model of the actuator system of the control system of a machine. To verify the created program for the PLC controller, simulating the operation of the created model, it was utilized the approach of integration these two programs using the tool for data exchange in the form of the OPC server.

Evolving network simulation study. From regular lattice to scale free network

NASA Astrophysics Data System (ADS)

Makowiec, D.

2005-12-01

The Watts-Strogatz algorithm of transferring the square lattice to a small world network is modified by introducing preferential rewiring constrained by connectivity demand. The evolution of the network is two-step: sequential preferential rewiring of edges controlled by p and updating the information about changes done. The evolving system self-organizes into stationary states. The topological transition in the graph structure is noticed with respect to p. Leafy phase a graph formed by multiple connected vertices (graph skeleton) with plenty of leaves attached to each skeleton vertex emerges when p is small enough to pretend asynchronous evolution. Tangling phase where edges of a graph circulate frequently among low degree vertices occurs when p is large. There exist conditions at which the resulting stationary network ensemble provides networks which degree distribution exhibit power-law decay in large interval of degrees.

Memoryless cooperative graph search based on the simulated annealing algorithm

NASA Astrophysics Data System (ADS)

Hou, Jian; Yan, Gang-Feng; Fan, Zhen

2011-04-01

We have studied the problem of reaching a globally optimal segment for a graph-like environment with a single or a group of autonomous mobile agents. Firstly, two efficient simulated-annealing-like algorithms are given for a single agent to solve the problem in a partially known environment and an unknown environment, respectively. It shows that under both proposed control strategies, the agent will eventually converge to a globally optimal segment with probability 1. Secondly, we use multi-agent searching to simultaneously reduce the computation complexity and accelerate convergence based on the algorithms we have given for a single agent. By exploiting graph partition, a gossip-consensus method based scheme is presented to update the key parameter—radius of the graph, ensuring that the agents spend much less time finding a globally optimal segment.

A new formation control of multiple underactuated surface vessels

NASA Astrophysics Data System (ADS)

Xie, Wenjing; Ma, Baoli; Fernando, Tyrone; Iu, Herbert Ho-Ching

2018-05-01

This work investigates a new formation control problem of multiple underactuated surface vessels. The controller design is based on input-output linearisation technique, graph theory, consensus idea and some nonlinear tools. The proposed smooth time-varying distributed control law guarantees that the multiple underactuated surface vessels globally exponentially converge to some desired geometric shape, which is especially centred at the initial average position of vessels. Furthermore, the stability analysis of zero dynamics proves that the orientations of vessels tend to some constants that are dependent on the initial values of vessels, and the velocities and control inputs of the vessels decay to zero. All the results are obtained under the communication scenarios of static directed balanced graph with a spanning tree. Effectiveness of the proposed distributed control scheme is demonstrated using a simulation example.

Search Problems in Mission Planning and Navigation of Autonomous Aircraft. M.S. Thesis

NASA Technical Reports Server (NTRS)

Krozel, James A.

1988-01-01

An architecture for the control of an autonomous aircraft is presented. The architecture is a hierarchical system representing an anthropomorphic breakdown of the control problem into planner, navigator, and pilot systems. The planner system determines high level global plans from overall mission objectives. This abstract mission planning is investigated by focusing on the Traveling Salesman Problem with variations on local and global constraints. Tree search techniques are applied including the breadth first, depth first, and best first algorithms. The minimum-column and row entries for the Traveling Salesman Problem cost matrix provides a powerful heuristic to guide these search techniques. Mission planning subgoals are directed from the planner to the navigator for planning routes in mountainous terrain with threats. Terrain/threat information is abstracted into a graph of possible paths for which graph searches are performed. It is shown that paths can be well represented by a search graph based on the Voronoi diagram of points representing the vertices of mountain boundaries. A comparison of Dijkstra's dynamic programming algorithm and the A* graph search algorithm from artificial intelligence/operations research is performed for several navigation path planning examples. These examples illustrate paths that minimize a combination of distance and exposure to threats. Finally, the pilot system synthesizes the flight trajectory by creating the control commands to fly the aircraft.

Graph-based geometric-iconic guide-wire tracking.

PubMed

Honnorat, Nicolas; Vaillant, Régis; Paragios, Nikos

2011-01-01

In this paper we introduce a novel hybrid graph-based approach for Guide-wire tracking. The image support is captured by steerable filters and improved through tensor voting. Then, a graphical model is considered that represents guide-wire extraction/tracking through a B-spline control-point model. Points with strong geometric interest (landmarks) are automatically determined and anchored to such a representation. Tracking is then performed through discrete MRFs that optimize the spatio-temporal positions of the control points while establishing landmark temporal correspondences. Promising results demonstrate the potentials of our method.

Finite-time consensus for multi-agent systems with globally bounded convergence time under directed communication graphs

NASA Astrophysics Data System (ADS)

Fu, Junjie; Wang, Jin-zhi

2017-09-01

In this paper, we study the finite-time consensus problems with globally bounded convergence time also known as fixed-time consensus problems for multi-agent systems subject to directed communication graphs. Two new distributed control strategies are proposed such that leaderless and leader-follower consensus are achieved with convergence time independent on the initial conditions of the agents. Fixed-time formation generation and formation tracking problems are also solved as the generalizations. Simulation examples are provided to demonstrate the performance of the new controllers.

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.

Multiresolution analysis over graphs for a motor imagery based online BCI game.

PubMed

Asensio-Cubero, Javier; Gan, John Q; Palaniappan, Ramaswamy

2016-01-01

Multiresolution analysis (MRA) over graph representation of EEG data has proved to be a promising method for offline brain-computer interfacing (BCI) data analysis. For the first time we aim to prove the feasibility of the graph lifting transform in an online BCI system. Instead of developing a pointer device or a wheel-chair controller as test bed for human-machine interaction, we have designed and developed an engaging game which can be controlled by means of imaginary limb movements. Some modifications to the existing MRA analysis over graphs for BCI have also been proposed, such as the use of common spatial patterns for feature extraction at the different levels of decomposition, and sequential floating forward search as a best basis selection technique. In the online game experiment we obtained for three classes an average classification rate of 63.0% for fourteen naive subjects. The application of a best basis selection method helps significantly decrease the computing resources needed. The present study allows us to further understand and assess the benefits of the use of tailored wavelet analysis for processing motor imagery data and contributes to the further development of BCI for gaming purposes. Copyright © 2015 Elsevier Ltd. All rights reserved.

Multi-processor including data flow accelerator module

DOEpatents

Davidson, George S.; Pierce, Paul E.

1990-01-01

An accelerator module for a data flow computer includes an intelligent memory. The module is added to a multiprocessor arrangement and uses a shared tagged memory architecture in the data flow computer. The intelligent memory module assigns locations for holding data values in correspondence with arcs leading to a node in a data dependency graph. Each primitive computation is associated with a corresponding memory cell, including a number of slots for operands needed to execute a primitive computation, a primitive identifying pointer, and linking slots for distributing the result of the cell computation to other cells requiring that result as an operand. Circuitry is provided for utilizing tag bits to determine automatically when all operands required by a processor are available and for scheduling the primitive for execution in a queue. Each memory cell of the module may be associated with any of the primitives, and the particular primitive to be executed by the processor associated with the cell is identified by providing an index, such as the cell number for the primitive, to the primitive lookup table of starting addresses. The module thus serves to perform functions previously performed by a number of sections of data flow architectures and coexists with conventional shared memory therein. A multiprocessing system including the module operates in a hybrid mode, wherein the same processing modules are used to perform some processing in a sequential mode, under immediate control of an operating system, while performing other processing in a data flow mode.

An Adaptive Flow Solver for Air-Borne Vehicles Undergoing Time-Dependent Motions/Deformations

NASA Technical Reports Server (NTRS)

Singh, Jatinder; Taylor, Stephen

1997-01-01

This report describes a concurrent Euler flow solver for flows around complex 3-D bodies. The solver is based on a cell-centered finite volume methodology on 3-D unstructured tetrahedral grids. In this algorithm, spatial discretization for the inviscid convective term is accomplished using an upwind scheme. A localized reconstruction is done for flow variables which is second order accurate. Evolution in time is accomplished using an explicit three-stage Runge-Kutta method which has second order temporal accuracy. This is adapted for concurrent execution using another proven methodology based on concurrent graph abstraction. This solver operates on heterogeneous network architectures. These architectures may include a broad variety of UNIX workstations and PCs running Windows NT, symmetric multiprocessors and distributed-memory multi-computers. The unstructured grid is generated using commercial grid generation tools. The grid is automatically partitioned using a concurrent algorithm based on heat diffusion. This results in memory requirements that are inversely proportional to the number of processors. The solver uses automatic granularity control and resource management techniques both to balance load and communication requirements, and deal with differing memory constraints. These ideas are again based on heat diffusion. Results are subsequently combined for visualization and analysis using commercial CFD tools. Flow simulation results are demonstrated for a constant section wing at subsonic, transonic, and a supersonic case. These results are compared with experimental data and numerical results of other researchers. Performance results are under way for a variety of network topologies.

Linear Time Algorithms to Restrict Insider Access using Multi-Policy Access Control Systems

PubMed Central

Mell, Peter; Shook, James; Harang, Richard; Gavrila, Serban

2017-01-01

An important way to limit malicious insiders from distributing sensitive information is to as tightly as possible limit their access to information. This has always been the goal of access control mechanisms, but individual approaches have been shown to be inadequate. Ensemble approaches of multiple methods instantiated simultaneously have been shown to more tightly restrict access, but approaches to do so have had limited scalability (resulting in exponential calculations in some cases). In this work, we take the Next Generation Access Control (NGAC) approach standardized by the American National Standards Institute (ANSI) and demonstrate its scalability. The existing publicly available reference implementations all use cubic algorithms and thus NGAC was widely viewed as not scalable. The primary NGAC reference implementation took, for example, several minutes to simply display the set of files accessible to a user on a moderately sized system. In our approach, we take these cubic algorithms and make them linear. We do this by reformulating the set theoretic approach of the NGAC standard into a graph theoretic approach and then apply standard graph algorithms. We thus can answer important access control decision questions (e.g., which files are available to a user and which users can access a file) using linear time graph algorithms. We also provide a default linear time mechanism to visualize and review user access rights for an ensemble of access control mechanisms. Our visualization appears to be a simple file directory hierarchy but in reality is an automatically generated structure abstracted from the underlying access control graph that works with any set of simultaneously instantiated access control policies. It also provide an implicit mechanism for symbolic linking that provides a powerful access capability. Our work thus provides the first efficient implementation of NGAC while enabling user privilege review through a novel visualization approach. This may help transition from concept to reality the idea of using ensembles of simultaneously instantiated access control methodologies, thereby limiting insider threat. PMID:28758045

Adaptive random walks on the class of Web graphs

NASA Astrophysics Data System (ADS)

Tadić, B.

2001-09-01

We study random walk with adaptive move strategies on a class of directed graphs with variable wiring diagram. The graphs are grown from the evolution rules compatible with the dynamics of the world-wide Web [B. Tadić, Physica A 293, 273 (2001)], and are characterized by a pair of power-law distributions of out- and in-degree for each value of the parameter β, which measures the degree of rewiring in the graph. The walker adapts its move strategy according to locally available information both on out-degree of the visited node and in-degree of target node. A standard random walk, on the other hand, uses the out-degree only. We compute the distribution of connected subgraphs visited by an ensemble of walkers, the average access time and survival probability of the walks. We discuss these properties of the walk dynamics relative to the changes in the global graph structure when the control parameter β is varied. For β≥ 3, corresponding to the world-wide Web, the access time of the walk to a given level of hierarchy on the graph is much shorter compared to the standard random walk on the same graph. By reducing the amount of rewiring towards rigidity limit β↦βc≲ 0.1, corresponding to the range of naturally occurring biochemical networks, the survival probability of adaptive and standard random walk become increasingly similar. The adaptive random walk can be used as an efficient message-passing algorithm on this class of graphs for large degree of rewiring.

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.

Design tool for multiprocessor scheduling and evaluation of iterative dataflow algorithms

NASA Technical Reports Server (NTRS)

Jones, Robert L., III

1995-01-01

A graph-theoretic design process and software tool is defined for selecting a multiprocessing scheduling solution for a class of computational problems. The problems of interest are those that can be described with a dataflow graph and are intended to be executed repetitively on a set of identical processors. Typical applications include signal processing and control law problems. Graph-search algorithms and analysis techniques are introduced and shown to effectively determine performance bounds, scheduling constraints, and resource requirements. The software tool applies the design process to a given problem and includes performance optimization through the inclusion of additional precedence constraints among the schedulable tasks.

Graph Theory-Based Pinning Synchronization of Stochastic Complex Dynamical Networks.

PubMed

Li, Xiao-Jian; Yang, Guang-Hong

2017-02-01

This paper is concerned with the adaptive pinning synchronization problem of stochastic complex dynamical networks (CDNs). Based on algebraic graph theory and Lyapunov theory, pinning controller design conditions are derived, and the rigorous convergence analysis of synchronization errors in the probability sense is also conducted. Compared with the existing results, the topology structures of stochastic CDN are allowed to be unknown due to the use of graph theory. In particular, it is shown that the selection of nodes for pinning depends on the unknown lower bounds of coupling strengths. Finally, an example on a Chua's circuit network is given to validate the effectiveness of the theoretical results.

Observer-based consensus of networked thrust-propelled vehicles with directed graphs.

PubMed

Cang, Weiye; Li, Zhongkui; Wang, Hanlei

2017-11-01

In this paper, we investigate the consensus problem for networked underactuated thrust-propelled vehicles (TPVs) interacting on directed graphs. We propose distributed observer-based consensus protocols, which avoid the reliance on the measurements of translational velocities and accelerations. Using the input-output analysis, we present necessary and sufficient conditions to ensure that the observer-based protocols can achieve consensus for both the cases without and with constant communication delays, provided that the communication graph contains a directed spanning tree. Simulation examples are finally provided to illustrate the effectiveness of the control schemes. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

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.

Inspection of aeronautical mechanical parts with a pan-tilt-zoom camera: an approach guided by the computer-aided design model

NASA Astrophysics Data System (ADS)

Viana, Ilisio; Orteu, Jean-José; Cornille, Nicolas; Bugarin, Florian

2015-11-01

We focus on quality control of mechanical parts in aeronautical context using a single pan-tilt-zoom (PTZ) camera and a computer-aided design (CAD) model of the mechanical part. We use the CAD model to create a theoretical image of the element to be checked, which is further matched with the sensed image of the element to be inspected, using a graph theory-based approach. The matching is carried out in two stages. First, the two images are used to create two attributed graphs representing the primitives (ellipses and line segments) in the images. In the second stage, the graphs are matched using a similarity function built from the primitive parameters. The similarity scores of the matching are injected in the edges of a bipartite graph. A best-match-search procedure in the bipartite graph guarantees the uniqueness of the match solution. The method achieves promising performance in tests with synthetic data including missing elements, displaced elements, size changes, and combinations of these cases. The results open good prospects for using the method with realistic data.

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.

Distributed Containment Control for Multiple Unknown Second-Order Nonlinear Systems With Application to Networked Lagrangian Systems.

PubMed

Mei, Jie; Ren, Wei; Li, Bing; Ma, Guangfu

2015-09-01

In this paper, we consider the distributed containment control problem for multiagent systems with unknown nonlinear dynamics. More specifically, we focus on multiple second-order nonlinear systems and networked Lagrangian systems. We first study the distributed containment control problem for multiple second-order nonlinear systems with multiple dynamic leaders in the presence of unknown nonlinearities and external disturbances under a general directed graph that characterizes the interaction among the leaders and the followers. A distributed adaptive control algorithm with an adaptive gain design based on the approximation capability of neural networks is proposed. We present a necessary and sufficient condition on the directed graph such that the containment error can be reduced as small as desired. As a byproduct, the leaderless consensus problem is solved with asymptotical convergence. Because relative velocity measurements between neighbors are generally more difficult to obtain than relative position measurements, we then propose a distributed containment control algorithm without using neighbors' velocity information. A two-step Lyapunov-based method is used to study the convergence of the closed-loop system. Next, we apply the ideas to deal with the containment control problem for networked unknown Lagrangian systems under a general directed graph. All the proposed algorithms are distributed and can be implemented using only local measurements in the absence of communication. Finally, simulation examples are provided to show the effectiveness of the proposed control algorithms.

Computerized atmospheric trace contaminant control simulation for manned spacecraft

NASA Technical Reports Server (NTRS)

Perry, J. L.

1993-01-01

Buildup of atmospheric trace contaminants in enclosed volumes such as a spacecraft may lead to potentially serious health problems for the crew members. For this reason, active control methods must be implemented to minimize the concentration of atmospheric contaminants to levels that are considered safe for prolonged, continuous exposure. Designing hardware to accomplish this has traditionally required extensive testing to characterize and select appropriate control technologies. Data collected since the Apollo project can now be used in a computerized performance simulation to predict the performance and life of contamination control hardware to allow for initial technology screening, performance prediction, and operations and contingency studies to determine the most suitable hardware approach before specific design and testing activities begin. The program, written in FORTRAN 77, provides contaminant removal rate, total mass removed, and per pass efficiency for each control device for discrete time intervals. In addition, projected cabin concentration is provided. Input and output data are manipulated using commercial spreadsheet and data graphing software. These results can then be used in analyzing hardware design parameters such as sizing and flow rate, overall process performance and program economics. Test performance may also be predicted to aid test design.

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.

Distributed Synchronization Control of Multiagent Systems With Unknown Nonlinearities.

PubMed

Su, Shize; Lin, Zongli; Garcia, Alfredo

2016-01-01

This paper revisits the distributed adaptive control problem for synchronization of multiagent systems where the dynamics of the agents are nonlinear, nonidentical, unknown, and subject to external disturbances. Two communication topologies, represented, respectively, by a fixed strongly-connected directed graph and by a switching connected undirected graph, are considered. Under both of these communication topologies, we use distributed neural networks to approximate the uncertain dynamics. Decentralized adaptive control protocols are then constructed to solve the cooperative tracker problem, the problem of synchronization of all follower agents to a leader agent. In particular, we show that, under the proposed decentralized control protocols, the synchronization errors are ultimately bounded, and their ultimate bounds can be reduced arbitrarily by choosing the control parameter appropriately. Simulation study verifies the effectiveness of our proposed protocols.

Scaling Up Graph-Based Semisupervised Learning via Prototype Vector Machines

PubMed Central

Zhang, Kai; Lan, Liang; Kwok, James T.; Vucetic, Slobodan; Parvin, Bahram

2014-01-01

When the amount of labeled data are limited, semi-supervised learning can improve the learner's performance by also using the often easily available unlabeled data. In particular, a popular approach requires the learned function to be smooth on the underlying data manifold. By approximating this manifold as a weighted graph, such graph-based techniques can often achieve state-of-the-art performance. However, their high time and space complexities make them less attractive on large data sets. In this paper, we propose to scale up graph-based semisupervised learning using a set of sparse prototypes derived from the data. These prototypes serve as a small set of data representatives, which can be used to approximate the graph-based regularizer and to control model complexity. Consequently, both training and testing become much more efficient. Moreover, when the Gaussian kernel is used to define the graph affinity, a simple and principled method to select the prototypes can be obtained. Experiments on a number of real-world data sets demonstrate encouraging performance and scaling properties of the proposed approach. It also compares favorably with models learned via ℓ1-regularization at the same level of model sparsity. These results demonstrate the efficacy of the proposed approach in producing highly parsimonious and accurate models for semisupervised learning. PMID:25720002

Controlling bi-partite entanglement in multi-qubit systems

NASA Astrophysics Data System (ADS)

Plesch, Martin; Novotný, Jaroslav; Dzuráková, Zuzana; Buzek, Vladimír

2004-02-01

Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.

Interactive graphics for the Macintosh: software review of FlexiGraphs.

PubMed

Antonak, R F

1990-01-01

While this product is clearly unique, its usefulness to individuals outside small business environments is somewhat limited. FlexiGraphs is, however, a reasonable first attempt to design a microcomputer software package that controls data through interactive editing within a graph. Although the graphics capabilities of mainframe programs such as MINITAB (Ryan, Joiner, & Ryan, 1981) and the graphic manipulations available through exploratory data analysis (e.g., Velleman & Hoaglin, 1981) will not be surpassed anytime soon by this program, a researcher may want to add this program to a software library containing other Macintosh statistics, drawing, and graphics programs if only to obtain the easy-to-obtain curve fitting and line smoothing options. I welcome the opportunity to review the enhanced "scientific" version of FlexiGraphs that the author of the program indicates is currently under development. An MS-DOS version of the program should be available within the year.

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.

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

--No Title--

Science.gov Websites

; } input:hover { background:#ACF7AF; } select { cursor:pointer; } table.data td table.noborders, table.data td ; } table.controls th { padding:10px; } table.controls select { margin-top:.3em; } table.controls, table.graphs

Software to Control and Monitor Gas Streams

NASA Technical Reports Server (NTRS)

Arkin, C.; Curley, Charles; Gore, Eric; Floyd, David; Lucas, Damion

2012-01-01

This software package interfaces with various gas stream devices such as pressure transducers, flow meters, flow controllers, valves, and analyzers such as a mass spectrometer. The software provides excellent user interfacing with various windows that provide time-domain graphs, valve state buttons, priority- colored messages, and warning icons. The user can configure the software to save as much or as little data as needed to a comma-delimited file. The software also includes an intuitive scripting language for automated processing. The configuration allows for the assignment of measured values or calibration so that raw signals can be viewed as usable pressures, flows, or concentrations in real time. The software is based on those used in two safety systems for shuttle processing and one volcanic gas analysis system. Mass analyzers typically have very unique applications and vary from job to job. As such, software available on the market is usually inadequate or targeted on a specific application (such as EPA methods). The goal was to develop powerful software that could be used with prototype systems. The key problem was to generalize the software to be easily and quickly reconfigurable. At Kennedy Space Center (KSC), the prior art consists of two primary methods. The first method was to utilize Lab- VIEW and a commercial data acquisition system. This method required rewriting code for each different application and only provided raw data. To obtain data in engineering units, manual calculations were required. The second method was to utilize one of the embedded computer systems developed for another system. This second method had the benefit of providing data in engineering units, but was limited in the number of control parameters.

Kwaliteit van Expertsystemen: Algoritmen voor Integriteits-Controle (Quality of Expert Systems: Algorithms for Integrity Control)

DTIC Science & Technology

1990-03-01

Dist~i~ Ulnre rbu~ on Una o~d0 9 ~ j 2 0 0 TNO rapport Pagina rappon no. .FEL-89-A312 f"It Kwaliteit van Expertsystemen: Algoritmen voor Integriteits...KNOWLEDGEBASE 7 2.1 Inleiding 7 2.2 Een uitbreiding op NIAM: E(xtended)NIAM 8 2.3 Specificatie in E(xtended)NIAM 11 2.4 Representatie in Prolog 13 3...instantiatie van cen ThO rapport Pagina 9 ’graph’ is gelijk aan ten propositie (ean uitspraak over dea werkelijkheid). ’Graph’- instantiaties zijn

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

An Efficient Downlink Scheduling Strategy Using Normal Graphs for Multiuser MIMO Wireless Systems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh; Wu, Cheng-Hsuan; Lee, Yao-Nan; Wen, Chao-Kai

Inspired by the success of the low-density parity-check (LDPC) codes in the field of error-control coding, in this paper we propose transforming the downlink multiuser multiple-input multiple-output scheduling problem into an LDPC-like problem using the normal graph. Based on the normal graph framework, soft information, which indicates the probability that each user will be scheduled to transmit packets at the access point through a specified angle-frequency sub-channel, is exchanged among the local processors to iteratively optimize the multiuser transmission schedule. Computer simulations show that the proposed algorithm can efficiently schedule simultaneous multiuser transmission which then increases the overall channel utilization and reduces the average packet delay.

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.

Learning and Inductive Inference

DTIC Science & Technology

1982-07-01

a set of graph grammars to describe visual scenes . Other researchers have applied graph grammars to the pattern recognition of handwritten characters...345 1. Issues / 345 2. Mostows’ operationalizer / 350 0. Learning from ezamples / 360 1. Issues / 3t60 2. Learning in control and pattern recognition ...art.icleis on rote learntinig and ailvice- tAik g. K(ennieth Clarkson contributed Ltte article on grmvit atical inference, anid Geoff’ lroiney wrote

Evaluation of the MyWellness Key accelerometer.

PubMed

Herrmann, S D; Hart, T L; Lee, C D; Ainsworth, B E

2011-02-01

to examine the concurrent validity of the Technogym MyWellness Key accelerometer against objective and subjective physical activity (PA) measures. randomised, cross-sectional design with two phases. The laboratory phase compared the MyWellness Key with the ActiGraph GT1M and the Yamax SW200 Digiwalker pedometer during graded treadmill walking, increasing speed each minute. The free-living phase compared the MyWellness Key with the ActiGraph, Digiwalker, Bouchard Activity cord (BAR) and Global Physical Activity Questionnaire (GPAQ) for seven continuous days. Data were analysed using Spearman rank-order correlation coefficients for all comparisons. laboratory and free-living phases. sixteen participants randomly stratified from 41 eligible respondents by sex (n=8 men; n=8 women) and PA levels (n=4 low, n=8 middle and n=4 high active). there was a strong association between the MyWellness Key and the ActiGraph accelerometer during controlled graded treadmill walking (r=0.91, p<0.01) and in free-living settings (r=0.73-0.76 for light to vigorous PA, respectively, p<0.01). No associations were observed between the MyWellness Key and the BAR and GPAQ (p>0.05). the MyWellness Key has a high concurrent validity with the ActiGraph accelerometer to detect PA in both controlled laboratory and free-living settings.

Graph theory network function in Parkinson's disease assessed with electroencephalography.

PubMed

Utianski, Rene L; Caviness, John N; van Straaten, Elisabeth C W; Beach, Thomas G; Dugger, Brittany N; Shill, Holly A; Driver-Dunckley, Erika D; Sabbagh, Marwan N; Mehta, Shyamal; Adler, Charles H; Hentz, Joseph G

2016-05-01

To determine what differences exist in graph theory network measures derived from electroencephalography (EEG), between Parkinson's disease (PD) patients who are cognitively normal (PD-CN) and matched healthy controls; and between PD-CN and PD dementia (PD-D). EEG recordings were analyzed via graph theory network analysis to quantify changes in global efficiency and local integration. This included minimal spanning tree analysis. T-tests and correlations were used to assess differences between groups and assess the relationship with cognitive performance. Network measures showed increased local integration across all frequency bands between control and PD-CN; in contrast, decreased local integration occurred in PD-D when compared to PD-CN in the alpha1 frequency band. Differences found in PD-MCI mirrored PD-D. Correlations were found between network measures and assessments of global cognitive performance in PD. Our results reveal distinct patterns of band and network measure type alteration and breakdown for PD, as well as with cognitive decline in PD. These patterns suggest specific ways that interaction between cortical areas becomes abnormal and contributes to PD symptoms at various stages. Graph theory analysis by EEG suggests that network alteration and breakdown are robust attributes of PD cortical dysfunction pathophysiology. Copyright © 2016 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

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.

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.

Supervisory control based on minimal cuts and Petri net sub-controllers coordination

NASA Astrophysics Data System (ADS)

Rezig, Sadok; Achour, Zied; Rezg, Nidhal; Kammoun, Mohamed-Ali

2016-10-01

This paper addresses the synthesis of Petri net (PN) controller for the forbidden state transition problem with a new utilisation of the theory of regions. Moreover, as any method of control synthesis based on a reachability graph, the theory of regions suffers from the combinatorial explosion problem. The proposed work minimises the number of equations in the linear system of theory of regions and therefore one can reduce the computation time. In this paper, two different approaches are proposed to select minimal cuts in the reachability graph in order to synthesise a PN controller. Thanks to a switch from one cut to another, one can activate and deactivate the corresponding PNcontroller. An application is implemented in a flexible manufacturing system to illustrate the present method. Finally, comparison with previous works with experimental results in obtaining a maximally permissive controller is presented.

Topological analysis of metabolic control.

PubMed

Sen, A K

1990-12-01

A topological approach is presented for the analysis of control and regulation in metabolic pathways. In this approach, the control structure of a metabolic pathway is represented by a weighted directed graph. From an inspection of the topology of the graph, the control coefficients of the enzymes are evaluated in a heuristic manner in terms of the enzyme elasticities. The major advantage of the topological approach is that it provides a visual framework for (1) calculating the control coefficients of the enzymes, (2) analyzing the cause-effect relationships of the individual enzymes, (3) assessing the relative importance of the enzymes in metabolic regulation, and (4) simplifying the structure of a given pathway, from a regulatory viewpoint. Results are obtained for (a) an unbranched pathway in the absence of feedback the feedforward regulation and (b) an unbranched pathway with feedback inhibition. Our formulation is based on the metabolic control theory of Kacser and Burns (1973) and Heinrich and Rapoport (1974).

Analysis of spontaneous EEG activity in Alzheimer's disease using cross-sample entropy and graph theory.

PubMed

Gomez, Carlos; Poza, Jesus; Gomez-Pilar, Javier; Bachiller, Alejandro; Juan-Cruz, Celia; Tola-Arribas, Miguel A; Carreres, Alicia; Cano, Monica; Hornero, Roberto

2016-08-01

The aim of this pilot study was to analyze spontaneous electroencephalography (EEG) activity in Alzheimer's disease (AD) by means of Cross-Sample Entropy (Cross-SampEn) and two local measures derived from graph theory: clustering coefficient (CC) and characteristic path length (PL). Five minutes of EEG activity were recorded from 37 patients with dementia due to AD and 29 elderly controls. Our results showed that Cross-SampEn values were lower in the AD group than in the control one for all the interactions among EEG channels. This finding indicates that EEG activity in AD is characterized by a lower statistical dissimilarity among channels. Significant differences were found mainly for fronto-central interactions (p <; 0.01, permutation test). Additionally, the application of graph theory measures revealed diverse neural network changes, i.e. lower CC and higher PL values in AD group, leading to a less efficient brain organization. This study suggests the usefulness of our approach to provide further insights into the underlying brain dynamics associated with AD.

Graph theoretical analysis of EEG effective connectivity in vascular dementia patients during a visual oddball task.

PubMed

Wang, Chao; Xu, Jin; Zhao, Songzhen; Lou, Wutao

2016-01-01

The study was dedicated to investigating the change in information processing in brain networks of vascular dementia (VaD) patients during the process of decision making. EEG was recorded from 18 VaD patients and 19 healthy controls when subjects were performing a visual oddball task. The whole task was divided into several stages by using global field power analysis. In the stage related to the decision-making process, graph theoretical analysis was applied to the binary directed network derived from EEG signals at nine electrodes in the frontal, central, and parietal regions in δ (0.5-3.5Hz), θ (4-7Hz), α1 (8-10Hz), α2 (11-13Hz), and β (14-30Hz) frequency bands based on directed transfer function. A weakened outgoing information flow, a decrease in out-degree, and an increase in in-degree were found in the parietal region in VaD patients, compared to healthy controls. In VaD patients, the parietal region may also lose its hub status in brain networks. In addition, the clustering coefficient was significantly lower in VaD patients. Impairment might be present in the parietal region or its connections with other regions, and it may serve as one of the causes for cognitive decline in VaD patients. The brain networks of VaD patients were significantly altered toward random networks. The present study extended our understanding of VaD from the perspective of brain functional networks, and it provided possible interpretations for cognitive deficits in VaD patients. Copyright © 2015 International Federation of Clinical Neurophysiology. Published by Elsevier Ireland Ltd. All rights reserved.

Analysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension.

PubMed

Siyah Mansoory, Meysam; Oghabian, Mohammad Ali; Jafari, Amir Homayoun; Shahbabaie, Alireza

2017-01-01

Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obligatory for graph construction and analysis is consistently underestimated by LC, because not all the bivariate distributions, but only the marginals are Gaussian. In a number of studies, Mutual Information (MI) has been employed, as a similarity measure between each two time series of the brain regions, a pure nonlinear measure. Owing to the complex fractal organization of the brain indicating self-similarity, more information on the brain can be revealed by fMRI Fractal Dimension (FD) analysis. In the present paper, Box-Counting Fractal Dimension (BCFD) is introduced for graph theoretical analysis of fMRI data in 17 methamphetamine drug users and 18 normal controls. Then, BCFD performance was evaluated compared to those of LC and MI methods. Moreover, the global topological graph properties of the brain networks inclusive of global efficiency, clustering coefficient and characteristic path length in addict subjects were investigated too. Compared to normal subjects by using statistical tests (P<0.05), topological graph properties were postulated to be disrupted significantly during the resting-state fMRI. Based on the results, analyzing the graph topological properties (representing the brain networks) based on BCFD is a more reliable method than LC and MI.

Dynamic replanning of 3D automated reconstruction using situation graph trees and illumination adjustment

NASA Astrophysics Data System (ADS)

Kohler, Sophie; Far, Aïcha Beya; Hirsch, Ernest

2007-01-01

This paper presents an original approach for the optimal 3D reconstruction of manufactured workpieces based on a priori planification of the task, enhanced on-line through dynamic adjustment of the lighting conditions, and built around a cognitive intelligent sensory system using so-called Situation Graph Trees. The system takes explicitely structural knowledge related to image acquisition conditions, type of illumination sources, contents of the scene (e. g., CAD models and tolerance information), etc. into account. The principle of the approach relies on two steps. First, a socalled initialization phase, leading to the a priori task plan, collects this structural knowledge. This knowledge is conveniently encoded, as a sub-part, in the Situation Graph Tree building the backbone of the planning system specifying exhaustively the behavior of the application. Second, the image is iteratively evaluated under the control of this Situation Graph Tree. The information describing the quality of the piece to analyze is thus extracted and further exploited for, e. g., inspection tasks. Lastly, the approach enables dynamic adjustment of the Situation Graph Tree, enabling the system to adjust itself to the actual application run-time conditions, thus providing the system with a self-learning capability.

TreePlus: interactive exploration of networks with enhanced tree layouts.

PubMed

Lee, Bongshin; Parr, Cynthia S; Plaisant, Catherine; Bederson, Benjamin B; Veksler, Vladislav D; Gray, Wayne D; Kotfila, Christopher

2006-01-01

Despite extensive research, it is still difficult to produce effective interactive layouts for large graphs. Dense layout and occlusion make food webs, ontologies, and social networks difficult to understand and interact with. We propose a new interactive Visual Analytics component called TreePlus that is based on a tree-style layout. TreePlus reveals the missing graph structure with visualization and interaction while maintaining good readability. To support exploration of the local structure of the graph and gathering of information from the extensive reading of labels, we use a guiding metaphor of "Plant a seed and watch it grow." It allows users to start with a node and expand the graph as needed, which complements the classic overview techniques that can be effective at (but often limited to) revealing clusters. We describe our design goals, describe the interface, and report on a controlled user study with 28 participants comparing TreePlus with a traditional graph interface for six tasks. In general, the advantage of TreePlus over the traditional interface increased as the density of the displayed data increased. Participants also reported higher levels of confidence in their answers with TreePlus and most of them preferred TreePlus.

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.

Decentralized Control of Scheduling in Distributed Systems.

DTIC Science & Technology

1983-03-18

the job scheduling algorithm adapts to the changing busyness of the various hosts in the system. The environment in which the job scheduling entities...resources and processes that constitute the node and a set of interfaces for accessing these processes and resources. The structure of a node could change ...parallel. Chang [CHNG82] has also described some algorithms for detecting properties of general graphs by traversing paths in a graph in parallel. One of

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.

Applications of network analysis for adaptive management of artificial drainage systems in landscapes vulnerable to sea level rise

NASA Astrophysics Data System (ADS)

Poulter, Benjamin; Goodall, Jonathan L.; Halpin, Patrick N.

2008-08-01

SummaryThe vulnerability of coastal landscapes to sea level rise is compounded by the existence of extensive artificial drainage networks initially built to lower water tables for agriculture, forestry, and human settlements. These drainage networks are found in landscapes with little topographic relief where channel flow is characterized by bi-directional movement across multiple time-scales and related to precipitation, wind, and tidal patterns. The current configuration of many artificial drainage networks exacerbates impacts associated with sea level rise such as salt-intrusion and increased flooding. This suggests that in the short-term, drainage networks might be managed to mitigate sea level rise related impacts. The challenge, however, is that hydrologic processes in regions where channel flow direction is weakly related to slope and topography require extensive parameterization for numerical models which is limited where network size is on the order of a hundred or more kilometers in total length. Here we present an application of graph theoretic algorithms to efficiently investigate network properties relevant to the management of a large artificial drainage system in coastal North Carolina, USA. We created a digital network model representing the observation network topology and four types of drainage features (canal, collector and field ditches, and streams). We applied betweenness-centrality concepts (using Dijkstra's shortest path algorithm) to determine major hydrologic flowpaths based off of hydraulic resistance. Following this, we identified sub-networks that could be managed independently using a community structure and modularity approach. Lastly, a betweenness-centrality algorithm was applied to identify major shoreline entry points to the network that disproportionately control water movement in and out of the network. We demonstrate that graph theory can be applied to solving management and monitoring problems associated with sea level rise for poorly understood drainage networks in advance of numerical methods.

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

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

A Novel Strategy Using Factor Graphs and the Sum-Product Algorithm for Satellite Broadcast Scheduling Problems

NASA Astrophysics Data System (ADS)

Chen, Jung-Chieh

This paper presents a low complexity algorithmic framework for finding a broadcasting schedule in a low-altitude satellite system, i. e., the satellite broadcast scheduling (SBS) problem, based on the recent modeling and computational methodology of factor graphs. Inspired by the huge success of the low density parity check (LDPC) codes in the field of error control coding, in this paper, we transform the SBS problem into an LDPC-like problem through a factor graph instead of using the conventional neural network approaches to solve the SBS problem. Based on a factor graph framework, the soft-information, describing the probability that each satellite will broadcast information to a terminal at a specific time slot, is exchanged among the local processing in the proposed framework via the sum-product algorithm to iteratively optimize the satellite broadcasting schedule. Numerical results show that the proposed approach not only can obtain optimal solution but also enjoys the low complexity suitable for integral-circuit implementation.

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".

Continuous-time quantum walk on an extended star graph: Trapping and superradiance transition

NASA Astrophysics Data System (ADS)

Yalouz, Saad; Pouthier, Vincent

2018-02-01

A tight-binding model is introduced for describing the dynamics of an exciton on an extended star graph whose central node is occupied by a trap. On this graph, the exciton dynamics is governed by two kinds of eigenstates: many eigenstates are associated with degenerate real eigenvalues insensitive to the trap, whereas three decaying eigenstates characterized by complex energies contribute to the trapping process. It is shown that the excitonic population absorbed by the trap depends on the size of the graph, only. By contrast, both the size parameters and the absorption rate control the dynamics of the trapping. When these parameters are judiciously chosen, the efficiency of the transfer is optimized resulting in the minimization of the absorption time. Analysis of the eigenstates reveals that such a feature arises around the superradiance transition. Moreover, depending on the size of the network, two situations are highlighted where the transport efficiency is either superoptimized or suboptimized.

[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.

Growth and structure of the World Wide Web: Towards realistic modeling

NASA Astrophysics Data System (ADS)

Tadić, Bosiljka

2002-08-01

We simulate evolution of the World Wide Web from the dynamic rules incorporating growth, bias attachment, and rewiring. We show that the emergent double-hierarchical structure with distinct distributions of out- and in-links is comparable with the observed empirical data when the control parameter (average graph flexibility β) is kept in the range β=3-4. We then explore the Web graph by simulating (a) Web crawling to determine size and depth of connected components, and (b) a random walker that discovers the structure of connected subgraphs with dominant attractor and promoter nodes. A random walker that adapts its move strategy to mimic local node linking preferences is shown to have a short access time to "important" nodes on the Web graph.

Identifying Vulnerabilities and Hardening Attack Graphs for Networked Systems

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

Saha, Sudip; Vullinati, Anil K.; Halappanavar, Mahantesh

We investigate efficient security control methods for protecting against vulnerabilities in networked systems. A large number of interdependent vulnerabilities typically exist in the computing nodes of a cyber-system; as vulnerabilities get exploited, starting from low level ones, they open up the doors to more critical vulnerabilities. These cannot be understood just by a topological analysis of the network, and we use the attack graph abstraction of Dewri et al. to study these problems. In contrast to earlier approaches based on heuristics and evolutionary algorithms, we study rigorous methods for quantifying the inherent vulnerability and hardening cost for the system. Wemore » develop algorithms with provable approximation guarantees, and evaluate them for real and synthetic attack graphs.« less

Exactly solvable random graph ensemble with extensively many short cycles

NASA Astrophysics Data System (ADS)

Aguirre López, Fabián; Barucca, Paolo; Fekom, Mathilde; Coolen, Anthony C. C.

2018-02-01

We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles’ control parameters relative to the number of nodes. A phase diagram is presented, showing a second order phase transition from a connected to a disconnected phase. We study both the canonical formulation, where the size is large but fixed, and the grand canonical formulation, where the size is sampled from a discrete distribution, and show their equivalence in the thermodynamical limit. We also compute analytically the spectral density, which consists of a discrete set of isolated eigenvalues, representing short cycles, and a continuous part, representing cycles of diverging size.

Teaching Quality Control with Chocolate Chip Cookies

ERIC Educational Resources Information Center

Baker, Ardith

2014-01-01

Chocolate chip cookies are used to illustrate the importance and effectiveness of control charts in Statistical Process Control. By counting the number of chocolate chips, creating the spreadsheet, calculating the control limits and graphing the control charts, the student becomes actively engaged in the learning process. In addition, examining…

A Comparative Evaluation of the Effects of the Implementation of the Production Oriented Maintenance Organization (POMO) on Aircraft Maintenance

DTIC Science & Technology

1978-09-01

Division AREA & WORK UNIT NUMBERS School of Systems and Logistics’ Air Force Institute of Technology,WPAFB,OH II. CONTROLLING OFFICE NAME AND ADDRESS 12 ...STRUCTURE) ............. ................ 9) 12 . SUMMARY OF ALL ANALYSIS RESUILT,"S ........ ........ 94 vii i LIST OF FIGURES Figure Page 1. Deputy...ness Rate (Variable 4) .... ............ ... 81 12 . Graph of Data Values for Abort Rate (Variable 5 e) . ..................... 82 13. Graph of Data

GeoSciGraph: An Ontological Framework for EarthCube Semantic Infrastructure

NASA Astrophysics Data System (ADS)

Gupta, A.; Schachne, A.; Condit, C.; Valentine, D.; Richard, S.; Zaslavsky, I.

2015-12-01

The CINERGI (Community Inventory of EarthCube Resources for Geosciences Interoperability) project compiles an inventory of a wide variety of earth science resources including documents, catalogs, vocabularies, data models, data services, process models, information repositories, domain-specific ontologies etc. developed by research groups and data practitioners. We have developed a multidisciplinary semantic framework called GeoSciGraph semantic ingration of earth science resources. An integrated ontology is constructed with Basic Formal Ontology (BFO) as its upper ontology and currently ingests multiple component ontologies including the SWEET ontology, GeoSciML's lithology ontology, Tematres controlled vocabulary server, GeoNames, GCMD vocabularies on equipment, platforms and institutions, software ontology, CUAHSI hydrology vocabulary, the environmental ontology (ENVO) and several more. These ontologies are connected through bridging axioms; GeoSciGraph identifies lexically close terms and creates equivalence class or subclass relationships between them after human verification. GeoSciGraph allows a community to create community-specific customizations of the integrated ontology. GeoSciGraph uses the Neo4J,a graph database that can hold several billion concepts and relationships. GeoSciGraph provides a number of REST services that can be called by other software modules like the CINERGI information augmentation pipeline. 1) Vocabulary services are used to find exact and approximate terms, term categories (community-provided clusters of terms e.g., measurement-related terms or environmental material related terms), synonyms, term definitions and annotations. 2) Lexical services are used for text parsing to find entities, which can then be included into the ontology by a domain expert. 3) Graph services provide the ability to perform traversal centric operations e.g., finding paths and neighborhoods which can be used to perform ontological operations like computing transitive closure (e.g., finding all subclasses of rocks). 4) Annotation services are used to adorn an arbitrary block of text (e.g., from a NOAA catalog record) with ontology terms. The system has been used to ontologically integrate diverse sources like Science-base, NOAA records, PETDB.

Heat transfer enhancement in free convection flow of CNTs Maxwell nanofluids with four different types of molecular liquids.

PubMed

Aman, Sidra; Khan, Ilyas; Ismail, Zulkhibri; Salleh, Mohd Zuki; Al-Mdallal, Qasem M

2017-05-26

This article investigates heat transfer enhancement in free convection flow of Maxwell nanofluids with carbon nanotubes (CNTs) over a vertically static plate with constant wall temperature. Two kinds of CNTs i.e. single walls carbon nanotubes (SWCNTs) and multiple walls carbon nanotubes (MWCNTs) are suspended in four different types of base liquids (Kerosene oil, Engine oil, water and ethylene glycol). Kerosene oil-based nanofluids are given a special consideration due to their higher thermal conductivities, unique properties and applications. The problem is modelled in terms of PDE's with initial and boundary conditions. Some relevant non-dimensional variables are inserted in order to transmute the governing problem into dimensionless form. The resulting problem is solved via Laplace transform technique and exact solutions for velocity, shear stress and temperature are acquired. These solutions are significantly controlled by the variations of parameters including the relaxation time, Prandtl number, Grashof number and nanoparticles volume fraction. Velocity and temperature increases with elevation in Grashof number while Shear stress minimizes with increasing Maxwell parameter. A comparison between SWCNTs and MWCNTs in each case is made. Moreover, a graph showing the comparison amongst four different types of nanofluids for both CNTs is also plotted.

Proceedings: Sisal `93

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

Feo, J.T.

1993-10-01

This report contain papers on: Programmability and performance issues; The case of an iterative partial differential equation solver; Implementing the kernal of the Australian Region Weather Prediction Model in Sisal; Even and quarter-even prime length symmetric FFTs and their Sisal Implementations; Top-down thread generation for Sisal; Overlapping communications and computations on NUMA architechtures; Compiling technique based on dataflow analysis for funtional programming language Valid; Copy elimination for true multidimensional arrays in Sisal 2.0; Increasing parallelism for an optimization that reduces copying in IF2 graphs; Caching in on Sisal; Cache performance of Sisal Vs. FORTRAN; FFT algorithms on a shared-memory multiprocessor;more » A parallel implementation of nonnumeric search problems in Sisal; Computer vision algorithms in Sisal; Compilation of Sisal for a high-performance data driven vector processor; Sisal on distributed memory machines; A virtual shared addressing system for distributed memory Sisal; Developing a high-performance FFT algorithm in Sisal for a vector supercomputer; Implementation issues for IF2 on a static data-flow architechture; and Systematic control of parallelism in array-based data-flow computation. Selected papers have been indexed separately for inclusion in the Energy Science and Technology Database.« less

Leak checker data logging system

DOEpatents

Gannon, J.C.; Payne, J.J.

1996-09-03

A portable, high speed, computer-based data logging system for field testing systems or components located some distance apart employs a plurality of spaced mass spectrometers and is particularly adapted for monitoring the vacuum integrity of a long string of a superconducting magnets such as used in high energy particle accelerators. The system provides precise tracking of a gas such as helium through the magnet string when the helium is released into the vacuum by monitoring the spaced mass spectrometers allowing for control, display and storage of various parameters involved with leak detection and localization. A system user can observe the flow of helium through the magnet string on a real-time basis hour the exact moment of opening of the helium input valve. Graph reading can be normalized to compensate for magnet sections that deplete vacuum faster than other sections between testing to permit repetitive testing of vacuum integrity in reduced time. 18 figs.

Leak checker data logging system

DOEpatents

Gannon, Jeffrey C.; Payne, John J.

1996-01-01

A portable, high speed, computer-based data logging system for field testing systems or components located some distance apart employs a plurality of spaced mass spectrometers and is particularly adapted for monitoring the vacuum integrity of a long string of a superconducting magnets such as used in high energy particle accelerators. The system provides precise tracking of a gas such as helium through the magnet string when the helium is released into the vacuum by monitoring the spaced mass spectrometers allowing for control, display and storage of various parameters involved with leak detection and localization. A system user can observe the flow of helium through the magnet string on a real-time basis hour the exact moment of opening of the helium input valve. Graph reading can be normalized to compensate for magnet sections that deplete vacuum faster than other sections between testing to permit repetitive testing of vacuum integrity in reduced time.

The effect of velocity slip and multiple convective boundary conditions in a Darcian porous media with microorganism past a vertical stretching/shrinking sheet

NASA Astrophysics Data System (ADS)

Latiff, Nur Amalina Abdul; Yahya, Elisa; Ismail, Ahmad Izani Md.; Amirsom, Ardiana; Basir, Faisal

2017-08-01

An analysis is carried out to study the steady mixed convective boundary layer flow of a nanofluid in a Darcian porous media with microorganisms past a vertical stretching/shrinking sheet. Heat generation/absorption and chemical reaction effects are incorporated in the model. The partial differential equations are transformed into a system of ordinary differential equations by using similarity transformations generated by scaling group transformations. The transformed equations with boundary conditions are solved numerically. The effects of controlling parameters such as velocity slip, Darcy number, heat generation/absorption and chemical reaction on the skin friction factor, heat transfer, mass transfer and microorganism transfer are shown and discuss through graphs. Comparison of numerical solutions in the present study with the previous existing results in literature are made and comparison results are in very good agreement.

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.

A Comparative Study of Different EEG Reference Choices for Diagnosing Unipolar Depression.

PubMed

Mumtaz, Wajid; Malik, Aamir Saeed

2018-06-02

The choice of an electroencephalogram (EEG) reference has fundamental importance and could be critical during clinical decision-making because an impure EEG reference could falsify the clinical measurements and subsequent inferences. In this research, the suitability of three EEG references was compared while classifying depressed and healthy brains using a machine-learning (ML)-based validation method. In this research, the EEG data of 30 unipolar depressed subjects and 30 age-matched healthy controls were recorded. The EEG data were analyzed in three different EEG references, the link-ear reference (LE), average reference (AR), and reference electrode standardization technique (REST). The EEG-based functional connectivity (FC) was computed. Also, the graph-based measures, such as the distances between nodes, minimum spanning tree, and maximum flow between the nodes for each channel pair, were calculated. An ML scheme provided a mechanism to compare the performances of the extracted features that involved a general framework such as the feature extraction (graph-based theoretic measures), feature selection, classification, and validation. For comparison purposes, the performance metrics such as the classification accuracies, sensitivities, specificities, and F scores were computed. When comparing the three references, the diagnostic accuracy showed better performances during the REST, while the LE and AR showed less discrimination between the two groups. Based on the results, it can be concluded that the choice of appropriate reference is critical during the clinical scenario. The REST reference is recommended for future applications of EEG-based diagnosis of mental illnesses.

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.

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.

Semantic definitions of space flight control center languages using the hierarchical graph technique

NASA Technical Reports Server (NTRS)

Zaghloul, M. E.; Truszkowski, W.

1981-01-01

In this paper a method is described by which the semantic definitions of the Goddard Space Flight Control Center Command Languages can be specified. The semantic modeling facility used is an extension of the hierarchical graph technique, which has a major benefit of supporting a variety of data structures and a variety of control structures. It is particularly suited for the semantic descriptions of such types of languages where the detailed separation between the underlying operating system and the command language system is system dependent. These definitions were used in the definition of the Systems Test and Operation Language (STOL) of the Goddard Space Flight Center which is a command language that provides means for the user to communicate with payloads, application programs, and other ground system elements.

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.

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.

Building Scalable Knowledge Graphs for Earth Science

NASA Astrophysics Data System (ADS)

Ramachandran, R.; Maskey, M.; Gatlin, P. N.; Zhang, J.; Duan, X.; Bugbee, K.; Christopher, S. A.; Miller, J. J.

2017-12-01

Estimates indicate that the world's information will grow by 800% in the next five years. In any given field, a single researcher or a team of researchers cannot keep up with this rate of knowledge expansion without the help of cognitive systems. Cognitive computing, defined as the use of information technology to augment human cognition, can help tackle large systemic problems. Knowledge graphs, one of the foundational components of cognitive systems, link key entities in a specific domain with other entities via relationships. Researchers could mine these graphs to make probabilistic recommendations and to infer new knowledge. At this point, however, there is a dearth of tools to generate scalable Knowledge graphs using existing corpus of scientific literature for Earth science research. Our project is currently developing an end-to-end automated methodology for incrementally constructing Knowledge graphs for Earth Science. Semantic Entity Recognition (SER) is one of the key steps in this methodology. SER for Earth Science uses external resources (including metadata catalogs and controlled vocabulary) as references to guide entity extraction and recognition (i.e., labeling) from unstructured text, in order to build a large training set to seed the subsequent auto-learning component in our algorithm. Results from several SER experiments will be presented as well as lessons learned.

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.

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.

Gaps in the spectrum of a periodic quantum graph with periodically distributed \\delta ^{\\prime} -type interactions

NASA Astrophysics Data System (ADS)

Barseghyan, Diana; Khrabustovskyi, Andrii

2015-06-01

We consider a family of quantum graphs {{\\{(Γ ,{{A}\\varepsilon })\\}}\\varepsilon \\gt 0}, where Γ is a {{{Z}}n}-periodic metric graph and the periodic Hamiltonian {{A}\\varepsilon } is defined by the operation -{{\\varepsilon }-1}\\frac{{{d}2}}{d{{x}2}} on the edges of Γ and either δ \\prime -type conditions or the Kirchhoff conditions at its vertices. Here \\varepsilon \\gt 0 is a small parameter. We show that the spectrum of {{A}\\varepsilon } has at least m gaps as \\varepsilon \\to 0 (m\\in {N} is a predefined number), moreover the location of these gaps can be nicely controlled via a suitable choice of the geometry of Γ and of coupling constants involved in δ \\prime -type conditions.

SIGNATURES OF ILLICIT NUCLEAR PROCUREMENT NETWORKS: AN OVERVIEW OF PRELIMINARY APPROACHES AND RESULTS

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

Webster, Jennifer B.; Erikson, Luke E.; Gastelum, Zoe N.

2014-05-12

The illicit trafficking of strategic nuclear commodities (defined here as the goods needed for a covert nuclear program excluding special nuclear materials) poses a significant challenge to the international nuclear nonproliferation community. Export control regulations, both domestically and internationally, seek to inhibit the spread of strategic nuclear commodities by restricting their sale to parties that may use them for nefarious purposes. However, export controls alone are not sufficient for preventing the illicit transfer of strategic nuclear goods. There are two major pitfalls to relying solely on export control regulations for the deterrence of proliferation of strategic goods. First, export controlmore » enforcement today relies heavily on the honesty and willingness of participants to adhere to the legal framework already in place. Secondly, current practices focus on the evaluation of single records which allow for the necessary goods to be purchased separately and hidden within the thousands of legitimate commerce transactions that occur each day, disregarding strategic information regarding several purchases. Our research presents two preliminary data-centric approaches for investigating procurement networks of strategic nuclear commodities. Pacific Northwest National Laboratory (PNNL) has been putting significant effort into nonproliferation activities as an institution, both in terms of the classical nuclear material focused approach and in the examination of other strategic goods necessary to implement a nuclear program. In particular, the PNNL Signature Discovery Initiative (SDI) has codified several scientific methodologies for the detection, characterization, and prediction of signatures that are indicative of a phenomenon of interest. The methodologies and tools developed under SDI have already been applied successfully to problems in bio-forensics, cyber security and power grid balancing efforts and they have now made the nonproliferation of strategic goods into a challenge problem for testing their methodology and tools. As a first step towards the detection and characterization of illicit procurement networks, our research examines procurement networks as defined by a system of entities (people or companies) that enter into transactions of specific items with one another. Once we have defined such networks, we are interested in answering questions about the behavior and characterization of such networks. The questions we wish to answer regarding procurement networks are, first, “Can we detect networks within large, noisy datasets?” and second, “To what extent can we compare multiple networks and identify their similarities?” As procurement networks can be naturally viewed as a graph, we have employed several graph analytic tools to aid in these tasks. In particular, Graphscape, an SDI tool, uses a novel method to approximate edit distance, a graph distance measure based on the number of changes needed to transform one graph into another, in order to measure how similar two given graphs are to each other. Given a set of graphs where vertices represent companies and edges represent a shipment from company A to company B, we can calculate an all-for-all comparison of graphs. In this way, we are able to determine which graphs are most similar, and which require more changes to transform one into the other. The set of graphs to be compared can be further specialized to provide more insight, e.g., using different time periods to explore events in a company life cycle.« less

A Statistical Method to Distinguish Functional Brain Networks

PubMed Central

Fujita, André; Vidal, Maciel C.; Takahashi, Daniel Y.

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism (p < 0.001). PMID:28261045

A Statistical Method to Distinguish Functional Brain Networks.

PubMed

Fujita, André; Vidal, Maciel C; Takahashi, Daniel Y

2017-01-01

One major problem in neuroscience is the comparison of functional brain networks of different populations, e.g., distinguishing the networks of controls and patients. Traditional algorithms are based on search for isomorphism between networks, assuming that they are deterministic. However, biological networks present randomness that cannot be well modeled by those algorithms. For instance, functional brain networks of distinct subjects of the same population can be different due to individual characteristics. Moreover, networks of subjects from different populations can be generated through the same stochastic process. Thus, a better hypothesis is that networks are generated by random processes. In this case, subjects from the same group are samples from the same random process, whereas subjects from different groups are generated by distinct processes. Using this idea, we developed a statistical test called ANOGVA to test whether two or more populations of graphs are generated by the same random graph model. Our simulations' results demonstrate that we can precisely control the rate of false positives and that the test is powerful to discriminate random graphs generated by different models and parameters. The method also showed to be robust for unbalanced data. As an example, we applied ANOGVA to an fMRI dataset composed of controls and patients diagnosed with autism or Asperger. ANOGVA identified the cerebellar functional sub-network as statistically different between controls and autism ( p < 0.001).

Cognitive inhibition in students with and without dyslexia and dyscalculia.

PubMed

Wang, Li-Chih; Tasi, Hung-Ju; Yang, Hsien-Ming

2012-01-01

The present study presents a comparison of the cognitive inhibition abilities of dyslexic, dyscalculic, and control students. The participants were 45 dyslexic students, 45 dyscalculic students, and 45 age-, gender-, and IQ-matched control students. The major evaluation tools included six cognitive inhibition tasks which were restructured during principal component analysis into three categories: graph inhibition, number inhibition, and word inhibition. Comparisons of the 3 groups of students revealed that in graph inhibition, dyscalculic students performed worst of the 3 groups, with dyslexic students also performing worse than control students in this category. For number inhibition, the control students' performances were equal to those of dyslexic students, with both groups performing better than dyscalculic students. For word inhibition, control students' performances were equal to those of dyscalculic students; both groups had shorter response times and lower incorrect rates than dyslexic students. These results suggest the complexity of the different cognitive inhibition abilities displayed by dyslexic, dyscalculic, and control students. However, some regular patterns occurred. Copyright © 2012 Elsevier Ltd. All rights reserved.

Distributed Adaptive Fuzzy Control for Nonlinear Multiagent Systems Via Sliding Mode Observers.

PubMed

Shen, Qikun; Shi, Peng; Shi, Yan

2016-12-01

In this paper, the problem of distributed adaptive fuzzy control is investigated for high-order uncertain nonlinear multiagent systems on directed graph with a fixed topology. It is assumed that only the outputs of each follower and its neighbors are available in the design of its distributed controllers. Equivalent output injection sliding mode observers are proposed for each follower to estimate the states of itself and its neighbors, and an observer-based distributed adaptive controller is designed for each follower to guarantee that it asymptotically synchronizes to a leader with tracking errors being semi-globally uniform ultimate bounded, in which fuzzy logic systems are utilized to approximate unknown functions. Based on algebraic graph theory and Lyapunov function approach, using Filippov-framework, the closed-loop system stability analysis is conducted. Finally, numerical simulations are provided to illustrate the effectiveness and potential of the developed design techniques.

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.

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.

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.

Hierarchical Feedback Modules and Reaction Hubs in Cell Signaling Networks

PubMed Central

Xu, Jianfeng; Lan, Yueheng

2015-01-01

Despite much effort, identification of modular structures and study of their organizing and functional roles remain a formidable challenge in molecular systems biology, which, however, is essential in reaching a systematic understanding of large-scale cell regulation networks and hence gaining capacity of exerting effective interference to cell activity. Combining graph theoretic methods with available dynamics information, we successfully retrieved multiple feedback modules of three important signaling networks. These feedbacks are structurally arranged in a hierarchical way and dynamically produce layered temporal profiles of output signals. We found that global and local feedbacks act in very different ways and on distinct features of the information flow conveyed by signal transduction but work highly coordinately to implement specific biological functions. The redundancy embodied with multiple signal-relaying channels and feedback controls bestow great robustness and the reaction hubs seated at junctions of different paths announce their paramount importance through exquisite parameter management. The current investigation reveals intriguing general features of the organization of cell signaling networks and their relevance to biological function, which may find interesting applications in analysis, design and control of bio-networks. PMID:25951347

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

Causal inference, probability theory, and graphical insights.

PubMed

Baker, Stuart G

2013-11-10

Causal inference from observational studies is a fundamental topic in biostatistics. The causal graph literature typically views probability theory as insufficient to express causal concepts in observational studies. In contrast, the view here is that probability theory is a desirable and sufficient basis for many topics in causal inference for the following two reasons. First, probability theory is generally more flexible than causal graphs: Besides explaining such causal graph topics as M-bias (adjusting for a collider) and bias amplification and attenuation (when adjusting for instrumental variable), probability theory is also the foundation of the paired availability design for historical controls, which does not fit into a causal graph framework. Second, probability theory is the basis for insightful graphical displays including the BK-Plot for understanding Simpson's paradox with a binary confounder, the BK2-Plot for understanding bias amplification and attenuation in the presence of an unobserved binary confounder, and the PAD-Plot for understanding the principal stratification component of the paired availability design. Published 2013. This article is a US Government work and is in the public domain in the USA.

Quantum Optimization of Fully Connected Spin Glasses

NASA Astrophysics Data System (ADS)

Venturelli, Davide; Mandrà, Salvatore; Knysh, Sergey; O'Gorman, Bryan; Biswas, Rupak; Smelyanskiy, Vadim

2015-07-01

Many NP-hard problems can be seen as the task of finding a ground state of a disordered highly connected Ising spin glass. If solutions are sought by means of quantum annealing, it is often necessary to represent those graphs in the annealer's hardware by means of the graph-minor embedding technique, generating a final Hamiltonian consisting of coupled chains of ferromagnetically bound spins, whose binding energy is a free parameter. In order to investigate the effect of embedding on problems of interest, the fully connected Sherrington-Kirkpatrick model with random ±1 couplings is programmed on the D-Wave TwoTM annealer using up to 270 qubits interacting on a Chimera-type graph. We present the best embedding prescriptions for encoding the Sherrington-Kirkpatrick problem in the Chimera graph. The results indicate that the optimal choice of embedding parameters could be associated with the emergence of the spin-glass phase of the embedded problem, whose presence was previously uncertain. This optimal parameter setting allows the performance of the quantum annealer to compete with (and potentially outperform, in the absence of analog control errors) optimized simulated annealing algorithms.

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

Efficient Synthesis of Graph Methods: a Dynamically Scheduled Architecture

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

Minutoli, Marco; Castellana, Vito G.; Tumeo, Antonino

RDF databases naturally map to a graph representation and employ languages, such as SPARQL, that implements queries as graph pattern matching routines. Graph methods exhibit an irregular behavior: they present unpredictable, fine-grained data accesses, and are synchronization inten- sive. Graph data structures expose large amounts of dy- namic parallelism, but are difficult to partition without gen- erating load unbalance. In this paper, we present a novel ar- chitecture to improve the synthesis of graph methods. Our design addresses the issues of these algorithms with two com- ponents: a Dynamic Task Scheduler (DTS), which reduces load unbalance and maximize resource utilization,more » and a Hi- erarchical Memory Interface controller (HMI), which pro- vides support for concurrent memory operations on multi- ported/multi-banked shared memories. We evaluate our ap- proach by generating the accelerators for a set of SPARQL queries from the Lehigh University Benchmark (LUBM). We first analyze the load unbalance of these queries, showing that execution time among tasks can differ even of order of magnitudes. We then synthesize the queries and com- pare the performance of the resulting accelerators against the current state of the art. Experimental results show that our solution provides a speedup over the serial implementa- tion close to the theoretical maximum and a speedup up to 3.45 over a baseline parallel implementation. We conclude our study by exploring the design space to achieve maximum memory channels utilization. The best design used at least three of the four memory channels for more than 90% of the execution time.« less

Dynamical modeling and analysis of large cellular regulatory networks

NASA Astrophysics Data System (ADS)

Bérenguier, D.; Chaouiya, C.; Monteiro, P. T.; Naldi, A.; Remy, E.; Thieffry, D.; Tichit, L.

2013-06-01

The dynamical analysis of large biological regulatory networks requires the development of scalable methods for mathematical modeling. Following the approach initially introduced by Thomas, we formalize the interactions between the components of a network in terms of discrete variables, functions, and parameters. Model simulations result in directed graphs, called state transition graphs. We are particularly interested in reachability properties and asymptotic behaviors, which correspond to terminal strongly connected components (or "attractors") in the state transition graph. A well-known problem is the exponential increase of the size of state transition graphs with the number of network components, in particular when using the biologically realistic asynchronous updating assumption. To address this problem, we have developed several complementary methods enabling the analysis of the behavior of large and complex logical models: (i) the definition of transition priority classes to simplify the dynamics; (ii) a model reduction method preserving essential dynamical properties, (iii) a novel algorithm to compact state transition graphs and directly generate compressed representations, emphasizing relevant transient and asymptotic dynamical properties. The power of an approach combining these different methods is demonstrated by applying them to a recent multilevel logical model for the network controlling CD4+ T helper cell response to antigen presentation and to a dozen cytokines. This model accounts for the differentiation of canonical Th1 and Th2 lymphocytes, as well as of inflammatory Th17 and regulatory T cells, along with many hybrid subtypes. All these methods have been implemented into the software GINsim, which enables the definition, the analysis, and the simulation of logical regulatory graphs.

Accelerometer Method and Apparatus for Integral Display and Control Functions

NASA Technical Reports Server (NTRS)

Bozeman, Richard J., Jr. (Inventor)

1996-01-01

Method and apparatus for detecting mechanical vibrations and outputting a signal in response thereto. Art accelerometer package having integral display and control functions is suitable for mounting upon the machinery to be monitored. Display circuitry provides signals to a bar graph display which may be used to monitor machine conditions over a period of time. Control switches may be set which correspond to elements in the bar graph to provide an alert if vibration signals increase in amplitude over a selected trip point. The circuitry is shock mounted within the accelerometer housing. The method provides for outputting a broadband analog accelerometer signal, integrating this signal to produce a velocity signal, integrating and calibrating the velocity signal before application to a display driver, and selecting a trip point at which a digitally compatible output signal is generated.

The driving regulators of the connectivity protein network of brain malignancies

NASA Astrophysics Data System (ADS)

Tahmassebi, Amirhessam; Pinker-Domenig, Katja; Wengert, Georg; Lobbes, Marc; Stadlbauer, Andreas; Wildburger, Norelle C.; Romero, Francisco J.; Morales, Diego P.; Castillo, Encarnacion; Garcia, Antonio; Botella, Guillermo; Meyer-Bäse, Anke

2017-05-01

An important problem in modern therapeutics at the proteomic level remains to identify therapeutic targets in a plentitude of high-throughput data from experiments relevant to a variety of diseases. This paper presents the application of novel modern control concepts, such as pinning controllability and observability applied to the glioma cancer stem cells (GSCs) protein graph network with known and novel association to glioblastoma (GBM). The theoretical frameworks provides us with the minimal number of "driver nodes", which are necessary, and their location to determine the full control over the obtained graph network in order to provide a change in the network's dynamics from an initial state (disease) to a desired state (non-disease). The achieved results will provide biochemists with techniques to identify more metabolic regions and biological pathways for complex diseases, to design and test novel therapeutic solutions.

Accelerometer Method and Apparatus for Integral Display and Control Functions

NASA Technical Reports Server (NTRS)

Bozeman, Richard J., Jr. (Inventor)

1998-01-01

Method and apparatus for detecting mechanical vibrations and outputting a signal in response thereto is discussed. An accelerometer package having integral display and control functions is suitable for mounting upon the machinery to be monitored. Display circuitry provides signals to a bar graph display which may be used to monitor machine conditions over a period of time. Control switches may be set which correspond to elements in the bar graph to provide an alert if vibration signals increase in amplitude over a selected trip point. The circuitry is shock mounted within the accelerometer housing. The method provides for outputting a broadband analog accelerometer signal, integrating this signal to produce a velocity signal, integrating and calibrating the velocity signal before application to a display driver, and selecting a trip point at which a digitally compatible output signal is generated.

An adaptive critic-based scheme for consensus control of nonlinear multi-agent systems

NASA Astrophysics Data System (ADS)

Heydari, Ali; Balakrishnan, S. N.

2014-12-01

The problem of decentralised consensus control of a network of heterogeneous nonlinear systems is formulated as an optimal tracking problem and a solution is proposed using an approximate dynamic programming based neurocontroller. The neurocontroller training comprises an initial offline training phase and an online re-optimisation phase to account for the fact that the reference signal subject to tracking is not fully known and available ahead of time, i.e., during the offline training phase. As long as the dynamics of the agents are controllable, and the communication graph has a directed spanning tree, this scheme guarantees the synchronisation/consensus even under switching communication topology and directed communication graph. Finally, an aerospace application is selected for the evaluation of the performance of the method. Simulation results demonstrate the potential of the scheme.

Functional brain networks in Alzheimer's disease: EEG analysis based on limited penetrable visibility graph and phase space method

NASA Astrophysics Data System (ADS)

Wang, Jiang; Yang, Chen; Wang, Ruofan; Yu, Haitao; Cao, Yibin; Liu, Jing

2016-10-01

In this paper, EEG series are applied to construct functional connections with the correlation between different regions in order to investigate the nonlinear characteristic and the cognitive function of the brain with Alzheimer's disease (AD). First, limited penetrable visibility graph (LPVG) and phase space method map single EEG series into networks, and investigate the underlying chaotic system dynamics of AD brain. Topological properties of the networks are extracted, such as average path length and clustering coefficient. It is found that the network topology of AD in several local brain regions are different from that of the control group with no statistically significant difference existing all over the brain. Furthermore, in order to detect the abnormality of AD brain as a whole, functional connections among different brain regions are reconstructed based on similarity of clustering coefficient sequence (CCSS) of EEG series in the four frequency bands (delta, theta, alpha, and beta), which exhibit obvious small-world properties. Graph analysis demonstrates that for both methodologies, the functional connections between regions of AD brain decrease, particularly in the alpha frequency band. AD causes the graph index complexity of the functional network decreased, the small-world properties weakened, and the vulnerability increased. The obtained results show that the brain functional network constructed by LPVG and phase space method might be more effective to distinguish AD from the normal control than the analysis of single series, which is helpful for revealing the underlying pathological mechanism of the disease.

Efficient structure from motion for oblique UAV images based on maximal spanning tree expansion

NASA Astrophysics Data System (ADS)

Jiang, San; Jiang, Wanshou

2017-10-01

The primary contribution of this paper is an efficient Structure from Motion (SfM) solution for oblique unmanned aerial vehicle (UAV) images. First, an algorithm, considering spatial relationship constraints between image footprints, is designed for match pair selection with the assistance of UAV flight control data and oblique camera mounting angles. Second, a topological connection network (TCN), represented by an undirected weighted graph, is constructed from initial match pairs, which encodes the overlap areas and intersection angles into edge weights. Then, an algorithm, termed MST-Expansion, is proposed to extract the match graph from the TCN, where the TCN is first simplified by a maximum spanning tree (MST). By further analysis of the local structure in the MST, expansion operations are performed on the vertices of the MST for match graph enhancement, which is achieved by introducing critical connections in the expansion directions. Finally, guided by the match graph, an efficient SfM is proposed. Under extensive analysis and comparison, its performance is verified by using three oblique UAV datasets captured with different multi-camera systems. Experimental results demonstrate that the efficiency of image matching is improved, with speedup ratios ranging from 19 to 35, and competitive orientation accuracy is achieved from both relative bundle adjustment (BA) without GCPs (Ground Control Points) and absolute BA with GCPs. At the same time, images in the three datasets are successfully oriented. For the orientation of oblique UAV images, the proposed method can be a more efficient solution.

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

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.

Output Feedback Distributed Containment Control for High-Order Nonlinear Multiagent Systems.

PubMed

Li, Yafeng; Hua, Changchun; Wu, Shuangshuang; Guan, Xinping

2017-01-31

In this paper, we study the problem of output feedback distributed containment control for a class of high-order nonlinear multiagent systems under a fixed undirected graph and a fixed directed graph, respectively. Only the output signals of the systems can be measured. The novel reduced order dynamic gain observer is constructed to estimate the unmeasured state variables of the system with the less conservative condition on nonlinear terms than traditional Lipschitz one. Via the backstepping method, output feedback distributed nonlinear controllers for the followers are designed. By means of the novel first virtual controllers, we separate the estimated state variables of different agents from each other. Consequently, the designed controllers show independence on the estimated state variables of neighbors except outputs information, and the dynamics of each agent can be greatly different, which make the design method have a wider class of applications. Finally, a numerical simulation is presented to illustrate the effectiveness of the proposed method.

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

Threshold-based epidemic dynamics in systems with memory

NASA Astrophysics Data System (ADS)

Bodych, Marcin; Ganguly, Niloy; Krueger, Tyll; Mukherjee, Animesh; Siegmund-Schultze, Rainer; Sikdar, Sandipan

2016-11-01

In this article we analyze an epidemic dynamics model (SI) where we assume that there are k susceptible states, that is a node would require multiple (k) contacts before it gets infected. In specific, we provide a theoretical framework for studying diffusion rate in complete graphs and d-regular trees with extensions to dense random graphs. We observe that irrespective of the topology, the diffusion process could be divided into two distinct phases: i) the initial phase, where the diffusion process is slow, followed by ii) the residual phase where the diffusion rate increases manifold. In fact, the initial phase acts as an indicator for the total diffusion time in dense graphs. The most remarkable lesson from this investigation is that such a diffusion process could be controlled and even contained if acted upon within its initial phase.

Communication Dependent Control of Multi-Vehicle Formations

DTIC Science & Technology

2016-05-11

On Maximizing the Second Smallest Eigen- value of a State-Dependent Graph Laplacian,” IEEE Transactions on Au- tomatic Control, vol. 51, no. 1, pp...Collective Motion With Limited Communication,” IEEE Transactions on Au- tomatic Control, vol. 53, no. 3, pp. 706–719, 2008. [Online]. Available: http

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…