High-performance analysis of filtered semantic graphs
Buluç, A; Fox, A; Gilbert, JR; Kamil, S; Lugowski, A; Oliker, L; Williams, S
2012-01-01
High performance is a crucial consideration when executing a complex analytic query on a massive semantic graph. In a semantic graph, vertices and edges carry \\attributes" of various types. Analytic queries on semantic graphs typically depend on the values of these attributes; thus, the computation must either view the graph through a filter that passes only those individual vertices and edges of interest, or else must first materialize a subgraph or subgraphs consisting of only the vertices ...
Exploiting graph kernels for high performance biomedical relation extraction.
Panyam, Nagesh C; Verspoor, Karin; Cohn, Trevor; Ramamohanarao, Kotagiri
2018-01-30
Relation extraction from biomedical publications is an important task in the area of semantic mining of text. Kernel methods for supervised relation extraction are often preferred over manual feature engineering methods, when classifying highly ordered structures such as trees and graphs obtained from syntactic parsing of a sentence. Tree kernels such as the Subset Tree Kernel and Partial Tree Kernel have been shown to be effective for classifying constituency parse trees and basic dependency parse graphs of a sentence. Graph kernels such as the All Path Graph kernel (APG) and Approximate Subgraph Matching (ASM) kernel have been shown to be suitable for classifying general graphs with cycles, such as the enhanced dependency parse graph of a sentence. In this work, we present a high performance Chemical-Induced Disease (CID) relation extraction system. We present a comparative study of kernel methods for the CID task and also extend our study to the Protein-Protein Interaction (PPI) extraction task, an important biomedical relation extraction task. We discuss novel modifications to the ASM kernel to boost its performance and a method to apply graph kernels for extracting relations expressed in multiple sentences. Our system for CID relation extraction attains an F-score of 60%, without using external knowledge sources or task specific heuristic or rules. In comparison, the state of the art Chemical-Disease Relation Extraction system achieves an F-score of 56% using an ensemble of multiple machine learning methods, which is then boosted to 61% with a rule based system employing task specific post processing rules. For the CID task, graph kernels outperform tree kernels substantially, and the best performance is obtained with APG kernel that attains an F-score of 60%, followed by the ASM kernel at 57%. The performance difference between the ASM and APG kernels for CID sentence level relation extraction is not significant. In our evaluation of ASM for the PPI task, ASM
High Performance Descriptive Semantic Analysis of Semantic Graph Databases
Energy Technology Data Exchange (ETDEWEB)
Joslyn, Cliff A.; Adolf, Robert D.; al-Saffar, Sinan; Feo, John T.; Haglin, David J.; Mackey, Greg E.; Mizell, David W.
2011-06-02
As semantic graph database technology grows to address components ranging from extant large triple stores to SPARQL endpoints over SQL-structured relational databases, it will become increasingly important to be able to understand their inherent semantic structure, whether codified in explicit ontologies or not. Our group is researching novel methods for what we call descriptive semantic analysis of RDF triplestores, to serve purposes of analysis, interpretation, visualization, and optimization. But data size and computational complexity makes it increasingly necessary to bring high performance computational resources to bear on this task. Our research group built a novel high performance hybrid system comprising computational capability for semantic graph database processing utilizing the large multi-threaded architecture of the Cray XMT platform, conventional servers, and large data stores. In this paper we describe that architecture and our methods, and present the results of our analyses of basic properties, connected components, namespace interaction, and typed paths such for the Billion Triple Challenge 2010 dataset.
Peterman, Karen; Cranston, Kayla A.; Pryor, Marie; Kermish-Allen, Ruth
2015-11-01
This case study was conducted within the context of a place-based education project that was implemented with primary school students in the USA. The authors and participating teachers created a performance assessment of standards-aligned tasks to examine 6-10-year-old students' graph interpretation skills as part of an exploratory research project. Fifty-five students participated in a performance assessment interview at the beginning and end of a place-based investigation. Two forms of the assessment were created and counterbalanced within class at pre and post. In situ scoring was conducted such that responses were scored as correct versus incorrect during the assessment's administration. Criterion validity analysis demonstrated an age-level progression in student scores. Tests of discriminant validity showed that the instrument detected variability in interpretation skills across each of three graph types (line, bar, dot plot). Convergent validity was established by correlating in situ scores with those from the Graph Interpretation Scoring Rubric. Students' proficiency with interpreting different types of graphs matched expectations based on age and the standards-based progression of graphs across primary school grades. The assessment tasks were also effective at detecting pre-post gains in students' interpretation of line graphs and dot plots after the place-based project. The results of the case study are discussed in relation to the common challenges associated with performance assessment. Implications are presented in relation to the need for authentic and performance-based instructional and assessment tasks to respond to the Common Core State Standards and the Next Generation Science Standards.
Endriss, U.; Grandi, U.
Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference
GRAPH THEORY APPROACH TO QUANTIFY UNCERTAINTY OF PERFORMANCE MEASURES
Directory of Open Access Journals (Sweden)
Sérgio D. Sousa
2015-03-01
Full Text Available In this work, the performance measurement process is studied to quantify the uncertainty induced in the resulting performance measure (PM. To that end, the causes of uncertainty are identified, analysing the activities undertaken in the three following stages of the performance measurement process: design and implementation, data collection and record, and determination and analysis. A quantitative methodology based on graph theory and on the sources of uncertainty of the performance measurement process is used to calculate an uncertainty index to evaluate the level of uncertainty of a given PM or (key performance indicator. An application example is presented. The quantification of PM uncertainty could contribute to better represent the risk associated with a given decision and also to improve the PM to increase its precision and reliability.
Performance criteria for graph clustering and Markov cluster experiments
S. van Dongen
2000-01-01
textabstractIn~[1] a cluster algorithm for graphs was introduced called the Markov cluster algorithm or MCL~algorithm. The algorithm is based on simulation of (stochastic) flow in graphs by means of alternation of two operators, expansion and inflation. The results in~[2] establish an intrinsic
Choice of the control variables of an isolated intersection by graph colouring
Directory of Open Access Journals (Sweden)
Batanović Vladan
2015-01-01
Full Text Available This paper deals with the problem of grouping the traffic streams into some groups - signal groups on a signalized intersection. The fact that more traffic streams, which are not in a conflict, can be controlled by one sequence of traffic lights means that one control variable can be assigned to one signal group. Determination of the complete sets of signal groups, i.e. the groups of traffic streams on one intersection, controlled by one control variable is defined in this paper as a graphcoloring problem. The complete sets of signal groups are obtained by coloring the complement of the graph of identical indications. It is shown that the minimal number of signal groups in the complete set of signal groups is equal to the chromatic number of the complement of the graph with identical indications. The problem of finding all complete sets of signal groups with minimal cardinality, which is equal to the chromatic number, is formulated as a linear programming problem where the values of variables belong to set {0,1}.
The Performance of Variable Annuities
Michael J. McNamara; Henry R. Oppenheimer
1991-01-01
Variable annuities have become increasingly important in retirement plans. This paper provides an examination of the investment performance of variable annuities for the period year-end 1973 to year-end 1988. Returns, risk, and selectivity measures are analyzed for the sample of annuities, for individual variable annuities, and for subsamples of annuities with similar portfolio size and turnover. While the investment returns of variable annuities were greater than inflation over the period, t...
Visibility graph analysis of very short-term heart rate variability during sleep
Hou, F. Z.; Li, F. W.; Wang, J.; Yan, F. R.
2016-09-01
Based on a visibility-graph algorithm, complex networks were constructed from very short-term heart rate variability (HRV) during different sleep stages. Network measurements progressively changed from rapid eye movement (REM) sleep to light sleep and then deep sleep, exhibiting promising ability for sleep assessment. Abnormal activation of the cardiovascular controls with enhanced 'small-world' couplings and altered fractal organization during REM sleep indicates that REM could be a potential risk factor for adverse cardiovascular event, especially in males, older individuals, and people who are overweight. Additionally, an apparent influence of gender, aging, and obesity on sleep was demonstrated in healthy adults, which may be helpful for establishing expected sleep-HRV patterns in different populations.
Using Self-Monitoring of Performance with Self-Graphing to Increase Academic Productivity in Math
Wells, Jenny C.; Sheehey, Patricia H.; Sheehey, Michael
2017-01-01
Self-regulation skills have been found to be an important predictor of achievement in mathematics. Teaching a student to regulate his or her behavior during independent math work sessions using self-monitoring of performance with self-graphing focuses him or her on academic performance and results in increases in productivity and math proficiency.…
Boote, Stacy K.; Boote, David N.
2017-01-01
Students often struggle to interpret graphs correctly, despite emphasis on graphic literacy in U.S. education standards documents. The purpose of this study was to describe challenges sixth graders with varying levels of science and mathematics achievement encounter when transitioning from interpreting graphs having discrete independent variables…
Directory of Open Access Journals (Sweden)
Mario Miler
2014-02-01
Full Text Available In the field of geoinformation and transportation science, the shortest path is calculated on graph data mostly found in road and transportation networks. This data is often stored in various database systems. Many applications dealing with transportation network require calculation of the shortest path. The objective of this research is to compare the performance of Dijkstra shortest path calculation in PostgreSQL (with pgRouting and Neo4j graph database for the purpose of determining if there is any difference regarding the speed of the calculation. Benchmarking was done on commodity hardware using OpenStreetMap road network. The first assumption is that Neo4j graph database would be well suited for the shortest path calculation on transportation networks but this does not come without some cost. Memory proved to be an issue in Neo4j setup when dealing with larger transportation networks.
Performance analysis of chi models using discrete-time probabilistic reward graphs
Trcka, N.; Georgievska, S.; Markovski, J.; Andova, S.; Vink, de E.P.
2008-01-01
We propose the model of discrete-time probabilistic reward graphs (DTPRGs) for performance analysis of systems exhibiting discrete deterministic time delays and probabilistic behavior, via their interpretation as discrete-time Markov reward chains, full-fledged platform for qualitative and
High-Performance Analysis of Filtered Semantic Graphs
2012-05-06
any other provision of law, no person shall be subject to a penalty for failing to comply with a collection of information if it does not display a...observation that explains why SEJITS+KDT performance is so close to CombBLAS performance in practice (as shown later in Section 7) even though its in-core...NEC, Nokia , NVIDIA, Oracle, and Samsung. This research used resources of the National Energy Research Sci- entific Computing Center, which is
A Hybrid Task Graph Scheduler for High Performance Image Processing Workflows.
Blattner, Timothy; Keyrouz, Walid; Bhattacharyya, Shuvra S; Halem, Milton; Brady, Mary
2017-12-01
Designing applications for scalability is key to improving their performance in hybrid and cluster computing. Scheduling code to utilize parallelism is difficult, particularly when dealing with data dependencies, memory management, data motion, and processor occupancy. The Hybrid Task Graph Scheduler (HTGS) improves programmer productivity when implementing hybrid workflows for multi-core and multi-GPU systems. The Hybrid Task Graph Scheduler (HTGS) is an abstract execution model, framework, and API that increases programmer productivity when implementing hybrid workflows for such systems. HTGS manages dependencies between tasks, represents CPU and GPU memories independently, overlaps computations with disk I/O and memory transfers, keeps multiple GPUs occupied, and uses all available compute resources. Through these abstractions, data motion and memory are explicit; this makes data locality decisions more accessible. To demonstrate the HTGS application program interface (API), we present implementations of two example algorithms: (1) a matrix multiplication that shows how easily task graphs can be used; and (2) a hybrid implementation of microscopy image stitching that reduces code size by ≈ 43% compared to a manually coded hybrid workflow implementation and showcases the minimal overhead of task graphs in HTGS. Both of the HTGS-based implementations show good performance. In image stitching the HTGS implementation achieves similar performance to the hybrid workflow implementation. Matrix multiplication with HTGS achieves 1.3× and 1.8× speedup over the multi-threaded OpenBLAS library for 16k × 16k and 32k × 32k size matrices, respectively.
Connectivity: Performance Portable Algorithms for graph connectivity v. 0.1
Energy Technology Data Exchange (ETDEWEB)
2017-09-21
Graphs occur in several places in real world from road networks, social networks and scientific simulations. Connectivity is a graph analysis software to graph connectivity in modern architectures like multicore CPUs, Xeon Phi and GPUs.
Joint Bayesian variable and graph selection for regression models with network-structured predictors
Peterson, C. B.; Stingo, F. C.; Vannucci, M.
2015-01-01
In this work, we develop a Bayesian approach to perform selection of predictors that are linked within a network. We achieve this by combining a sparse regression model relating the predictors to a response variable with a graphical model describing conditional dependencies among the predictors. The proposed method is well-suited for genomic applications since it allows the identification of pathways of functionally related genes or proteins which impact an outcome of interest. In contrast to previous approaches for network-guided variable selection, we infer the network among predictors using a Gaussian graphical model and do not assume that network information is available a priori. We demonstrate that our method outperforms existing methods in identifying network-structured predictors in simulation settings, and illustrate our proposed model with an application to inference of proteins relevant to glioblastoma survival. PMID:26514925
Energy Technology Data Exchange (ETDEWEB)
Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2015-10-26
In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.
A variable-depth search algorithm for recursive bi-partitioning of signal flow graphs
de Kock, E.A.; Aarts, E.H.L.; Essink, G.; Jansen, R.E.J.; Korst, J.H.M.
1995-01-01
We discuss the use of local search techniques for mapping video algorithms onto programmable high-performance video signal processors. The mapping problem is very complex due to many constraints that need to be satisfied in order to obtain a feasible solution. The complexity is reduced by
Zhang, L.-C.; Patone, M.
2017-01-01
We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.
Liu, Xu; Chen, Langshi; Firoz, Jesun S.; Qiu, Judy; Jiang, Lei
2017-01-01
Intel Xeon Phi many-integrated-core (MIC) architectures usher in a new era of terascale integration. Among emerging killer applications, parallel graph processing has been a critical technique to analyze connected data. In this paper, we empirically evaluate various computing platforms including an Intel Xeon E5 CPU, a Nvidia Geforce GTX1070 GPU and an Xeon Phi 7210 processor codenamed Knights Landing (KNL) in the domain of parallel graph processing. We show that the KNL gains encouraging per...
Environmental Variables and Pupils' Academic Performance in ...
African Journals Online (AJOL)
This causal-comparative study was carried out to investigate the influence of environmental variables on pupils' academic performance in primary science in Cross River State, Nigeria. Three hypotheses were formulated to guide the study. Two instruments were used to collect data for the study namely: environmental ...
Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.
2012-01-01
This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.
Tyner, Bryan C.; Fienup, Daniel M.
2016-01-01
Task analyses are ubiquitous to applied behavior analysis interventions, yet little is known about the factors that make them effective. Numerous task analyses have been published in behavior analytic journals for constructing single-subject design graphs; however, learner outcomes using these task analyses may fall short of what could be…
Energy Technology Data Exchange (ETDEWEB)
Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2013-10-01
The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.
Proxy Graph: Visual Quality Metrics of Big Graph Sampling.
Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra
2017-06-01
Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.
The STAPL Parallel Graph Library
Harshvardhan,
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.
DEFF Research Database (Denmark)
Husfeldt, Thore
2015-01-01
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...
Improving the Computational Performance of Ontology-Based Classification Using Graph Databases
Directory of Open Access Journals (Sweden)
Thomas J. Lampoltshammer
2015-07-01
Full Text Available The increasing availability of very high-resolution remote sensing imagery (i.e., from satellites, airborne laser scanning, or aerial photography represents both a blessing and a curse for researchers. The manual classification of these images, or other similar geo-sensor data, is time-consuming and leads to subjective and non-deterministic results. Due to this fact, (semi- automated classification approaches are in high demand in affected research areas. Ontologies provide a proper way of automated classification for various kinds of sensor data, including remotely sensed data. However, the processing of data entities—so-called individuals—is one of the most cost-intensive computational operations within ontology reasoning. Therefore, an approach based on graph databases is proposed to overcome the issue of a high time consumption regarding the classification task. The introduced approach shifts the classification task from the classical Protégé environment and its common reasoners to the proposed graph-based approaches. For the validation, the authors tested the approach on a simulation scenario based on a real-world example. The results demonstrate a quite promising improvement of classification speed—up to 80,000 times faster than the Protégé-based approach.
DEFF Research Database (Denmark)
Vestergaard, Preben Dahl; Hartnell, Bert L.
2006-01-01
There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...
Non-heuristic reduction of the graph in graph-cut optimization
International Nuclear Information System (INIS)
Malgouyres, François; Lermé, Nicolas
2012-01-01
During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.
Graph Creation, Visualisation and Transformation
Directory of Open Access Journals (Sweden)
Maribel Fernández
2010-03-01
Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.
Comparison of selected variables of gaming performance in football
Parachin, Jiří
2014-01-01
Title: Comparison of selected variables of gaming performance in football Objectives: Analysis of selected variables of gaming performance in the matches of professional Czech football teams in the Champions League and UEFA Europa League in 2013. During the observation to register set variables, then evaluate obtained results and compare them. Methods: The use of observational analysis and comparison of selected variables of gaming performance in competitive matches of professional football. ...
X-Graphs: Language and Algorithms for Heterogeneous Graph Streams
2017-09-01
are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph
DEFF Research Database (Denmark)
Seiller, Thomas
2016-01-01
Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...
Trudeau, Richard J
1994-01-01
Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or
Diestel, Reinhard
2017-01-01
This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...
Gould, Ronald
2012-01-01
This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S
Chartrand, Gary; Zhang, Ping
2010-01-01
Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...
The variable and chaotic nature of professional golf performance.
Stöckl, Michael; Lamb, Peter F
2018-05-01
In golf, unlike most other sports, individual performance is not the result of direct interactions between players. Instead decision-making and performance is influenced by numerous constraining factors affecting each shot. This study looked at the performance of PGA TOUR golfers in 2011 in terms of stability and variability on a shot-by-shot basis. Stability and variability were assessed using Recurrence Quantification Analysis (RQA) and standard deviation, respectively. About 10% of all shots comprised short stable phases of performance (3.7 ± 1.1 shots per stable phase). Stable phases tended to consist of shots of typical performance, rather than poor or exceptional shots; this finding was consistent for all shot categories. Overall, stability measures were not correlated with tournament performance. Variability across all shots was not related to tournament performance; however, variability in tee shots and short approach shots was higher than for other shot categories. Furthermore, tee shot variability was related to tournament standing: decreased variability was associated with better tournament ranking. The findings in this study showed that PGA TOUR golf performance is chaotic. Further research on amateur golf performance is required to determine whether the structure of amateur golf performance is universal.
Variability in reaction time performance of younger and older adults.
Hultsch, David F; MacDonald, Stuart W S; Dixon, Roger A
2002-03-01
Age differences in three basic types of variability were examined: variability between persons (diversity), variability within persons across tasks (dispersion), and variability within persons across time (inconsistency). Measures of variability were based on latency performance from four measures of reaction time (RT) performed by a total of 99 younger adults (ages 17--36 years) and 763 older adults (ages 54--94 years). Results indicated that all three types of variability were greater in older compared with younger participants even when group differences in speed were statistically controlled. Quantile-quantile plots showed age and task differences in the shape of the inconsistency distributions. Measures of within-person variability (dispersion and inconsistency) were positively correlated. Individual differences in RT inconsistency correlated negatively with level of performance on measures of perceptual speed, working memory, episodic memory, and crystallized abilities. Partial set correlation analyses indicated that inconsistency predicted cognitive performance independent of level of performance. The results indicate that variability of performance is an important indicator of cognitive functioning and aging.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan
2012-11-19
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-01-01
Background: Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods.Results: To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods.Conclusion: The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. 2012 Wang et al; licensee BioMed Central Ltd.
Multiple graph regularized protein domain ranking.
Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin
2012-11-19
Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Multiple graph regularized protein domain ranking
Directory of Open Access Journals (Sweden)
Wang Jim
2012-11-01
Full Text Available Abstract Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.
Hierarchical organisation of causal graphs
International Nuclear Information System (INIS)
Dziopa, P.
1993-01-01
This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs
Organizational variables on nurses' job performance in Turkey: nursing assessments.
Top, Mehmet
2013-01-01
The purpose of this study was to describe the influence of organizational variables on hospital staff nurses' job performance as reported by staff nurses in two cities in Turkey. Hospital ownership status, employment status were examined for their effect on this influence. The reported influence of organizational variables on job performance was measured by a questionnaire developed for this study. Nurses were asked to evaluate the influence of 28 organizational variables on their job performance using a five-point Likert-type scale (1- Never effective, 5- Very effective). The study used comparative and descriptive study design. The staff nurses who were included in this study were 831 hospital staff nurses. Descriptive statistics, frequencies, t-test, ANOVA and factor analysis were used for data analysis. The study showed the relative importance of the 28 organizational variables in influencing nurses' job performance. Nurses in this study reported that workload and technological support are the most influential organizational variables on their job performance. Factor analysis yielded a five-factor model that explained 53.99% of total variance. Administratively controllable influence job organizational variables influence job performance of nurses in different magnitude.
Chartrand, Gary; Rosen, Kenneth H
2008-01-01
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...
Age-Related Intraindividual Performance Variability with Practice
Miller, Suzanne Bonneau; Odell, Katharine H.
2007-01-01
Fluctuations in cognitive task performance in older individuals have been reported. To examine intraindividual variability as a function of practice, 34 younger and 34 older female participants, aged 20-30 years and 70-82 years, respectively, performed a reading span task 16 times over four sessions. Each individual's recall accuracy was analyzed…
A meta analysis of the variability in firm performance attributable to human resource variables
Directory of Open Access Journals (Sweden)
Lloyd Kapondoro
2015-01-01
Full Text Available The contribution of Human Resource Management (HRM practices to organisation-wide performance is a critical aspect of the Human Resource (HR value proposition. The purpose of the study was to describe the strength of HRM practices and systems in influencing overall organisational performance. While research has concluded that there is a significant positive relationship between HRM practices or systems and an organisation’s market performance, the strength of this relationship has relatively not received much analysis in order to explain the degree to which HRM practices explain variance in firm performance. The study undertook a meta-analysis of published researches in international journals. The study established that HRM variables accounted for an average of 31% of the variability in firm performance. Cohen’s f2 calculated for this study as a meta effect size calculation yielded an average of 0.681, implying that HRM variables account for 68% of variability in firm performance. A one sample Kolmogorov-Smirnov test showed that the distribution of R2 is not normal. A major managerial implication of this study is that effective HRM practices have a significant business case. The study provides, quantitatively, the average variability in firm success that HRM accounts for.
Biazzo, Indaco; Braunstein, Alfredo; Zecchina, Riccardo
2012-08-01
We study the behavior of an algorithm derived from the cavity method for the prize-collecting steiner tree (PCST) problem on graphs. The algorithm is based on the zero temperature limit of the cavity equations and as such is formally simple (a fixed point equation resolved by iteration) and distributed (parallelizable). We provide a detailed comparison with state-of-the-art algorithms on a wide range of existing benchmarks, networks, and random graphs. Specifically, we consider an enhanced derivative of the Goemans-Williamson heuristics and the dhea solver, a branch and cut integer linear programming based approach. The comparison shows that the cavity algorithm outperforms the two algorithms in most large instances both in running time and quality of the solution. Finally we prove a few optimality properties of the solutions provided by our algorithm, including optimality under the two postprocessing procedures defined in the Goemans-Williamson derivative and global optimality in some limit cases.
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-11-12
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.
Spatial variability and parametric uncertainty in performance assessment models
International Nuclear Information System (INIS)
Pensado, Osvaldo; Mancillas, James; Painter, Scott; Tomishima, Yasuo
2011-01-01
The problem of defining an appropriate treatment of distribution functions (which could represent spatial variability or parametric uncertainty) is examined based on a generic performance assessment model for a high-level waste repository. The generic model incorporated source term models available in GoldSim ® , the TDRW code for contaminant transport in sparse fracture networks with a complex fracture-matrix interaction process, and a biosphere dose model known as BDOSE TM . Using the GoldSim framework, several Monte Carlo sampling approaches and transport conceptualizations were evaluated to explore the effect of various treatments of spatial variability and parametric uncertainty on dose estimates. Results from a model employing a representative source and ensemble-averaged pathway properties were compared to results from a model allowing for stochastic variation of transport properties along streamline segments (i.e., explicit representation of spatial variability within a Monte Carlo realization). We concluded that the sampling approach and the definition of an ensemble representative do influence consequence estimates. In the examples analyzed in this paper, approaches considering limited variability of a transport resistance parameter along a streamline increased the frequency of fast pathways resulting in relatively high dose estimates, while those allowing for broad variability along streamlines increased the frequency of 'bottlenecks' reducing dose estimates. On this basis, simplified approaches with limited consideration of variability may suffice for intended uses of the performance assessment model, such as evaluation of site safety. (author)
Performance of Sorghum Varieties under Variable Rainfall in Central Tanzania.
Msongaleli, Barnabas M; Tumbo, S D; Kihupi, N I; Rwehumbiza, Filbert B
2017-01-01
Rainfall variability has a significant impact on crop production with manifestations in frequent crop failure in semiarid areas. This study used the parameterized APSIM crop model to investigate how rainfall variability may affect yields of improved sorghum varieties based on long-term historical rainfall and projected climate. Analyses of historical rainfall indicate a mix of nonsignificant and significant trends on the onset, cessation, and length of the growing season. The study confirmed that rainfall variability indeed affects yields of improved sorghum varieties. Further analyses of simulated sorghum yields based on seasonal rainfall distribution indicate the concurrence of lower grain yields with the 10-day dry spells during the cropping season. Simulation results for future sorghum response, however, show that impacts of rainfall variability on sorghum will be overridden by temperature increase. We conclude that, in the event where harms imposed by moisture stress in the study area are not abated, even improved sorghum varieties are likely to perform poorly.
Causal Variables and Academic Performance of Students in Cross ...
African Journals Online (AJOL)
This study investigated the causal variables (Child, Family, School, Society and Government) and academic performance of secondary school students in Cross River State: A basis for counselling and programme planning. The study adopted the descriptive survey method. It made use of two research questions and ...
Social Process Variables Affecting Reading Performance in Delayed Readers.
Lorton, Mary; Kukuk, Christopher
1978-01-01
Examines the relationship between 14 social process variables and the reading performances of 180 slow learners, ages 7-15. Finds that two of those factors (brith trauma and being held back in school) emerge as predictors of reading comprehension, word recognition, and spelling. (RL)
Performance Evaluation of A Developed Variable Frequency Drive ...
African Journals Online (AJOL)
This paper presents the performance characteristics of a developed variable frequency drive (VFD) adaptable for operation of ac machines speed control. The VFD developed is robust, durable, cheap and have low maintenance cost compared to conventional VFDs. The controlled asynchronous ac motor was operated to ...
Graph visualization (Invited talk)
Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.
2012-01-01
Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.
Pragmatic Graph Rewriting Modifications
Rodgers, Peter; Vidal, Natalia
1999-01-01
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...
Mechatronic modeling and simulation using bond graphs
Das, Shuvra
2009-01-01
Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...
Variability, Predictability, and Race Factors Affecting Performance in Elite Biathlon.
Skattebo, Øyvind; Losnegard, Thomas
2018-03-01
To investigate variability, predictability, and smallest worthwhile performance enhancement in elite biathlon sprint events. In addition, the effects of race factors on performance were assessed. Data from 2005 to 2015 including >10,000 and >1000 observations for each sex for all athletes and annual top-10 athletes, respectively, were included. Generalized linear mixed models were constructed based on total race time, skiing time, shooting time, and proportions of targets hit. Within-athlete race-to-race variability was expressed as coefficient of variation of performance times and standard deviation (SD) in proportion units (%) of targets hit. The models were adjusted for random and fixed effects of subject identity, season, event identity, and race factors. The within-athlete variability was independent of sex and performance standard of athletes: 2.5-3.2% for total race time, 1.5-1.8% for skiing time, and 11-15% for shooting times. The SD of the proportion of hits was ∼10% in both shootings combined (meaning ±1 hit in 10 shots). The predictability in total race time was very high to extremely high for all athletes (ICC .78-.84) but trivial for top-10 athletes (ICC .05). Race times during World Championships and Olympics were ∼2-3% faster than in World Cups. Moreover, race time increased by ∼2% per 1000 m of altitude, by ∼5% per 1% of gradient, by 1-2% per 1 m/s of wind speed, and by ∼2-4% on soft vs hard tracks. Researchers and practitioners should focus on strategies that improve biathletes' performance by at least 0.8-0.9%, corresponding to the smallest worthwhile enhancement (0.3 × within-athlete variability).
Emotional variables, dropout and academic performance in Spanish nursing students.
Roso-Bas, Fátima; Pades Jiménez, Antonia; García-Buades, Esther
2016-02-01
The dropout of university studies is a main concern in many countries, also for Health Sciences degrees. The reviews on dropout in all university degrees as well as nursing generally show multidimensional causes with factors related both to institutional and students' characteristics. Regarding the personal variables of students, researchers have focused on financial, family and personality features. Far less attention has been devoted to emotional variables. This study aims to explore whether individual variables of the emotional domain such as perceived emotional intelligence, dispositional optimism/pessimism and depressive rumination are related and/or can predict students' intention to dropout and academic performance. Using a cross-correlational approach, data were obtained from a sample of 144 nursing students. Students with a pessimistic disposition revealed a greater tendency to drop out. The remaining variables correlated significantly with pessimism but had no predictive value on dropout. Our results suggest that students with low levels of emotional clarity and repair and high depressive rumination have pessimistic expectations, so they are more likely to leave studies. No significant results were found in relation to academic performance. We conclude with an identification of strategies to increase retention and academic success. Copyright © 2015 Elsevier Ltd. All rights reserved.
Performance Measure as Feedback Variable in Image Processing
Directory of Open Access Journals (Sweden)
Ristić Danijela
2006-01-01
Full Text Available This paper extends the view of image processing performance measure presenting the use of this measure as an actual value in a feedback structure. The idea behind is that the control loop, which is built in that way, drives the actual feedback value to a given set point. Since the performance measure depends explicitly on the application, the inclusion of feedback structures and choice of appropriate feedback variables are presented on example of optical character recognition in industrial application. Metrics for quantification of performance at different image processing levels are discussed. The issues that those metrics should address from both image processing and control point of view are considered. The performance measures of individual processing algorithms that form a character recognition system are determined with respect to the overall system performance.
Variables associated with work performance in multidisciplinary mental health teams.
Fleury, Marie-Josée; Grenier, Guy; Bamvita, Jean-Marie; Chiocchio, François
2017-01-01
This study investigates work performance among 79 mental health teams in Quebec (Canada). We hypothesized that work performance was positively associated with the use of standardized clinical tools and clinical approaches, integration strategies, "clan culture," and mental health funding per capita. Work performance was measured using an adapted version of the Work Role Questionnaire. Variables were organized into four key areas: (1) team attributes, (2) organizational culture, (3) inter-organizational interactions, and (4) external environment. Work performance was associated with two types of organizational culture (clan and hierarchy) and with two team attributes (use of standardized clinical tools and approaches). This study was innovative in identifying associations between work performance and best practices, justifying their implementation. Recommendations are provided to develop organizational cultures promoting a greater focus on the external environment and integration strategies that strengthen external focus, service effectiveness, and innovation.
Using intraindividual variability to detect malingering in cognitive performance.
Strauss, E; Hultsch, D F; Hunter, M; Slick, D J; Patry, B; Levy-Bencheton, J
1999-11-01
The utility of measures for detecting malingering was evaluated using a simulation design in which half the participants were encouraged to do their best and half were asked to feign head injury. Particular attention was focused on the utility of repeated assessment (intraindividual variability) in discriminating the groups. Participants were tested on three occasions on measures commonly used to detect malingering including a specific symptom validity test (SVT). The results indicated that multiple measures of malingering obtained in single assessment (occasion one) discriminated the groups effectively. In addition, however, intraindividual variability in performance, particularly of indicators from the SVT, provided unique information beyond level of performance. The results suggest that response inconsistency across testing sessions may be a clinically useful measure for the detection of malingering.
Bapat, Ravindra B
2014-01-01
This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...
Variability of Plyometric and Ballistic Exercise Technique Maintains Jump Performance.
Chandler, Phillip T; Greig, Matthew; Comfort, Paul; McMahon, John J
2018-06-01
Chandler, PT, Greig, M, Comfort, P, and McMahon, JJ. Variability of plyometric and ballistic exercise technique maintains jump performance. J Strength Cond Res 32(6): 1571-1582, 2018-The aim of this study was to investigate changes in vertical jump technique over the course of a training session. Twelve plyometric and ballistic exercise-trained male athletes (age = 23.4 ± 4.6 years, body mass = 78.7 ± 18.8 kg, height = 177.1 ± 9.0 cm) performed 3 sets of 10 repetitions of drop jump (DJ), rebound jump (RJ) and squat jump (SJ). Each exercise was analyzed from touchdown to peak joint flexion and peak joint flexion to take-off. Squat jump was analyzed from peak joint flexion to take-off only. Jump height, flexion and extension time and range of motion, and instantaneous angles of the ankle, knee, and hip joints were measured. Separate 1-way repeated analyses of variance compared vertical jump technique across exercise sets and repetitions. Exercise set analysis found that SJ had lower results than DJ and RJ for the angle at peak joint flexion for the hip, knee, and ankle joints and take-off angle of the hip joint. Exercise repetition analysis found that the ankle joint had variable differences for the angle at take-off, flexion, and extension time for RJ. The knee joint had variable differences for flexion time for DJ and angle at take-off and touchdown for RJ. There was no difference in jump height. Variation in measured parameters across repetitions highlights variable technique across plyometric and ballistic exercises. This did not affect jump performance, but likely maintained jump performance by overcoming constraints (e.g., level of rate coding).
Performance of healthcare organizations: contributing variables to efficiency and quality
Albuquerque, Isabel Garcia da Fonseca e Faro de
2018-01-01
The transition from volume-based healthcare to value-based healthcare has been the major challenge of National Health Systems. Nevertheless, some variables that might contribute to bring together healthcare professionals and healthcare challenges have been overlooked. Study A, the first of three studies, conducted in a primary healthcare setting, revealed that perceived and objective organizational performance is predicted by sense of community, which simultaneously mediates the relationship ...
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam
2014-12-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Quick Mining of Isomorphic Exact Large Patterns from Large Graphs
Almasri, Islam; Gao, Xin; Fedoroff, Nina V.
2014-01-01
The applications of the sub graph isomorphism search are growing with the growing number of areas that model their systems using graphs or networks. Specifically, many biological systems, such as protein interaction networks, molecular structures and protein contact maps, are modeled as graphs. The sub graph isomorphism search is concerned with finding all sub graphs that are isomorphic to a relevant query graph, the existence of such sub graphs can reflect on the characteristics of the modeled system. The most computationally expensive step in the search for isomorphic sub graphs is the backtracking algorithm that traverses the nodes of the target graph. In this paper, we propose a pruning approach that is inspired by the minimum remaining value heuristic that achieves greater scalability over large query and target graphs. Our testing on various biological networks shows that performance enhancement of our approach over existing state-of-the-art approaches varies between 6x and 53x. © 2014 IEEE.
Adaptive Graph Convolutional Neural Networks
Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou
2018-01-01
Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...
Psychological variables involved in teacher’s job performance
Torres Valladares, Manuel; Lajo Lazo, Rosario
2014-01-01
The purpose of this study is to analyze the casual relations that can exist between some psychological variables (Personality Type A, Stress facing and Burnout Syndrome) and the labour performance of university teachers from five faculties of medicine of Lima Metropolitana. The instruments used were: Blumenthal’s inventory of auto report of behaviour type A, COPE, Maslasch’s Burnout inventory and the teacher’s labour performance made by Manuel Fernández Arata. All these instruments were subj...
Directory of Open Access Journals (Sweden)
C. Dalfo
2015-10-01
Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.
Szyjka, Sebastian P.
The purpose of this study was to determine the extent to which six cognitive and attitudinal variables predicted pre-service elementary teachers' performance on line graphing. Predictors included Illinois teacher education basic skills sub-component scores in reading comprehension and mathematics, logical thinking performance scores, as well as measures of attitudes toward science, mathematics and graphing. This study also determined the strength of the relationship between each prospective predictor variable and the line graphing performance variable, as well as the extent to which measures of attitude towards science, mathematics and graphing mediated relationships between scores on mathematics, reading, logical thinking and line graphing. Ninety-four pre-service elementary education teachers enrolled in two different elementary science methods courses during the spring 2009 semester at Southern Illinois University Carbondale participated in this study. Each subject completed five different instruments designed to assess science, mathematics and graphing attitudes as well as logical thinking and graphing ability. Sixty subjects provided copies of primary basic skills score reports that listed subset scores for both reading comprehension and mathematics. The remaining scores were supplied by a faculty member who had access to a database from which the scores were drawn. Seven subjects, whose scores could not be found, were eliminated from final data analysis. Confirmatory factor analysis (CFA) was conducted in order to establish validity and reliability of the Questionnaire of Attitude Toward Line Graphs in Science (QALGS) instrument. CFA tested the statistical hypothesis that the five main factor structures within the Questionnaire of Attitude Toward Statistical Graphs (QASG) would be maintained in the revised QALGS. Stepwise Regression Analysis with backward elimination was conducted in order to generate a parsimonious and precise predictive model. This
Soetevent, A.R.
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial
Graphing Inequalities, Connecting Meaning
Switzer, J. Matt
2014-01-01
Students often have difficulty with graphing inequalities (see Filloy, Rojano, and Rubio 2002; Drijvers 2002), and J. Matt Switzer's students were no exception. Although students can produce graphs for simple inequalities, they often struggle when the format of the inequality is unfamiliar. Even when producing a correct graph of an…
Directory of Open Access Journals (Sweden)
Amine Labriji
2017-07-01
Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and offers a contribution to solving the problem mentioned above.
van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime
2016-01-01
This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,
Fuzzy Graph Language Recognizability
Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros
2012-01-01
Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.
Brouwer, A.E.; Haemers, W.H.
2012-01-01
This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association
Effect of Variability on Optimal Performance in Athletes.
Martin, Louise
2013-01-01
Portfolio of Evidence\\ud \\ud Paper 1:\\ud Thompson, K.G., Haljand, R., Cooper, S-M. and Martin, L. (2000) The relative importance of selected kinematic variables in relation to swimming performance in elite male and elite female 100m and 200m breaststroke swimmers. Journal of Human Movement Studies, 39, 015-032.\\ud \\ud Paper 2:\\ud Martin, L. and Thompson, K. (2000) Reproducibility of diurnal variation in sub-maximal swimming. International Journal of Sports Medicine, 21, 387-392.\\ud \\ud Paper ...
Effects of feed process variables on Hanford Vitrification Plant performance
International Nuclear Information System (INIS)
Farnsworth, R.K.; Peterson, M.E.; Wagner, R.N.
1987-01-01
As a result of nuclear defense activities, high-level liquid radioactive wastes have been generated at the Hanford Site for over 40 yr. The Hanford Waste Vitrification Plant (HWVP) is being proposed to immobilize these wastes in a waste form suitable for disposal in a geologic repository. Prior to vitrification, the waste will undergo several conditioning steps before being fed to the melter. The effect of certain process variables on the resultant waste slurry properties must be known to assure processability of the waste slurry during feed preparation. Of particular interest are the rheological properties, which include the yield stress and apparent viscosity. Identification of the rheological properties of the slurry is required to adequately design the process equipment used for feed preparation (agitators, mixing tanks, concentrators, etc.). Knowledge of the slurry rheological properties is also necessary to establish processing conditions and operational limits for maximum plant efficiency and reliability. A multivariable study was performed on simulated HWVP feed to identify the feed process variables that have a significant impact on rheology during processing. Two process variables were evaluated in this study: (a) the amount of formic acid added to the feed and (b) the degree of shear encountered by the feed during processing. The feed was physically and rheologically characterized at various stages during feed processing
An Association-Oriented Partitioning Approach for Streaming Graph Query
Directory of Open Access Journals (Sweden)
Yun Hao
2017-01-01
Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.
Hell, Pavol
2004-01-01
This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an
Rapidly Mixing Gibbs Sampling for a Class of Factor Graphs Using Hierarchy Width.
De Sa, Christopher; Zhang, Ce; Olukotun, Kunle; Ré, Christopher
2015-12-01
Gibbs sampling on factor graphs is a widely used inference technique, which often produces good empirical results. Theoretical guarantees for its performance are weak: even for tree structured graphs, the mixing time of Gibbs may be exponential in the number of variables. To help understand the behavior of Gibbs sampling, we introduce a new (hyper)graph property, called hierarchy width . We show that under suitable conditions on the weights, bounded hierarchy width ensures polynomial mixing time. Our study of hierarchy width is in part motivated by a class of factor graph templates, hierarchical templates , which have bounded hierarchy width-regardless of the data used to instantiate them. We demonstrate a rich application from natural language processing in which Gibbs sampling provably mixes rapidly and achieves accuracy that exceeds human volunteers.
Compression-based inference on graph data
Bloem, P.; van den Bosch, A.; Heskes, T.; van Leeuwen, D.
2013-01-01
We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized
Approximate Computing Techniques for Iterative Graph Algorithms
Energy Technology Data Exchange (ETDEWEB)
Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman; Chavarria Miranda, Daniel G.; Krishnamoorthy, Sriram
2017-12-18
Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.
Simplicial complexes of graphs
Jonsson, Jakob
2008-01-01
A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.
Introduction to quantum graphs
Berkolaiko, Gregory
2012-01-01
A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...
Interactive Graph Layout of a Million Nodes
Directory of Open Access Journals (Sweden)
Peng Mi
2016-12-01
Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.
Enabling Graph Appliance for Genome Assembly
Energy Technology Data Exchange (ETDEWEB)
Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL
2015-01-01
In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.
Graphing trillions of triangles.
Burkhardt, Paul
2017-07-01
The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.
A Survey of U.S. Atlanta and Nagano Olympians: Variables Perceived to Influence Performance.
Gould, Daniel; Greenleaf, Christy; Chung, Yongchul; Guinan, Diane
2002-01-01
Examined the frequency and magnitude of specific variables perceived to have affected U.S. Olympic athletes' performance. Respondents perceived that performance was influenced by: performance variables (e.g., preparation for distraction); team variables (e.g., strong cohesion); coaching variables (e.g., coaching expectations); family-friend…
Variables and Challenges in Assessing EU Experts’ Performance
Directory of Open Access Journals (Sweden)
Cathrine Holst
2015-03-01
Full Text Available Expert advice in political processes is supposed to improve decisions. If expertise fails in this function, a legitimacy problem occurs: granting political power to experts may be defensible, but only on the grounds that it contributes to enlightening political processes and facilitate problem-solving. The paper provides a theoretical exploration of four variables that are key when assessing the epistemic quality of expert deliberations: the degree to which these deliberations are 1 informed by technical expertise, 2 regulated by epistemically optimal respect and inclusion norms, 3 focused on politically relevant and applicable knowledge, and 4 approaching questions involving moral judgment and standard setting competently. Previous research on the European Commission’s use of expert advice has more or less overlooked the question of experts’ epistemic performance, and this paper discusses the possible reasons for this in light of well-known methodological challenges in studies of elite behaviour; access and bias problems. A discussion of the merits and limitations of different available data on the Commission experts shows that the biggest obstacle in the study of experts’ epistemic performance is rather the problem of epistemic asymmetry, i.e. of how researchers as non-experts can assess the epistemic quality of experts’ contributions and behaviour. The paper offers, finally, a set of strategies to get research going despite this problem.
Do Graphs Promote Learning in Principles of Economics?
Cohn, Elchanan; Cohn, Sharon; Balch, Donald C.; Bradley, James, Jr.
2001-01-01
Tests the effects on student performance when using graphs as part of a University of South Carolina (Columbia) principles of economics lecture. Finds in 1995 that students in the lecture with graphs had significantly lower gain scores than those in the no-graphs lecture. Finds no significant difference in 1997. (RLH)
Deterministic dense coding and faithful teleportation with multipartite graph states
International Nuclear Information System (INIS)
Huang, C.-Y.; Yu, I-C.; Lin, F.-L.; Hsu, L.-Y.
2009-01-01
We propose schemes to perform the deterministic dense coding and faithful teleportation with multipartite graph states. We also find the sufficient and necessary condition of a viable graph state for the proposed schemes. That is, for the associated graph, the reduced adjacency matrix of the Tanner-type subgraph between senders and receivers should be invertible.
External memory K-bisimulation reduction of big graphs
Luo, Y.; Fletcher, G.H.L.; Hidders, A.J.H.; Wu, Y.; De Bra, P.M.E.
2013-01-01
In this paper, we present, to our knowledge, the first known I/O efficient solutions for computing the k-bisimulation partition of a massive directed graph, and performing maintenance of such a partition upon updates to the underlying graph. Ubiquitous in the theory and application of graph data,
Chartrand, Gary
1984-01-01
Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap
Directory of Open Access Journals (Sweden)
David ePeebles
2015-10-01
Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.
Adriaan R. Soetevent
2010-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...
Pim Heijnen; Adriaan Soetevent
2014-01-01
This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...
Directory of Open Access Journals (Sweden)
Aleks Kissinger
2014-03-01
Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.
Gelfand, I M; Shnol, E E
1969-01-01
The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu
Creating more effective graphs
Robbins, Naomi B
2012-01-01
A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr
DEFF Research Database (Denmark)
Mansutti, Alessio; Miculan, Marino; Peressotti, Marco
2017-01-01
We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...
Directory of Open Access Journals (Sweden)
Alberto Apostolico
2009-08-01
Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.
Graph Mining Meets the Semantic Web
Energy Technology Data Exchange (ETDEWEB)
Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL
2015-01-01
The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.
Disease management research using event graphs.
Allore, H G; Schruben, L W
2000-08-01
Event Graphs, conditional representations of stochastic relationships between discrete events, simulate disease dynamics. In this paper, we demonstrate how Event Graphs, at an appropriate abstraction level, also extend and organize scientific knowledge about diseases. They can identify promising treatment strategies and directions for further research and provide enough detail for testing combinations of new medicines and interventions. Event Graphs can be enriched to incorporate and validate data and test new theories to reflect an expanding dynamic scientific knowledge base and establish performance criteria for the economic viability of new treatments. To illustrate, an Event Graph is developed for mastitis, a costly dairy cattle disease, for which extensive scientific literature exists. With only a modest amount of imagination, the methodology presented here can be seen to apply modeling to any disease, human, plant, or animal. The Event Graph simulation presented here is currently being used in research and in a new veterinary epidemiology course. Copyright 2000 Academic Press.
Graph Theory. 1. Fragmentation of Structural Graphs
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.
Flux networks in metabolic graphs
International Nuclear Information System (INIS)
Warren, P B; Queiros, S M Duarte; Jones, J L
2009-01-01
A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms
A graph rewriting programming language for graph drawing
Rodgers, Peter
1998-01-01
This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...
de Mol, M.J.; Rensink, Arend; Hunt, James J.
This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class
Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.
2004-01-01
In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite
Joyner, W David
2017-01-01
This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...
Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM
1999-01-01
Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems
Packing Degenerate Graphs Greedily
Czech Academy of Sciences Publication Activity Database
Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana
2017-01-01
Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics
Incremental View Maintenance for Deductive Graph Databases Using Generalized Discrimination Networks
Directory of Open Access Journals (Sweden)
Thomas Beyhl
2016-12-01
Full Text Available Nowadays, graph databases are employed when relationships between entities are in the scope of database queries to avoid performance-critical join operations of relational databases. Graph queries are used to query and modify graphs stored in graph databases. Graph queries employ graph pattern matching that is NP-complete for subgraph isomorphism. Graph database views can be employed that keep ready answers in terms of precalculated graph pattern matches for often stated and complex graph queries to increase query performance. However, such graph database views must be kept consistent with the graphs stored in the graph database. In this paper, we describe how to use incremental graph pattern matching as technique for maintaining graph database views. We present an incremental maintenance algorithm for graph database views, which works for imperatively and declaratively specified graph queries. The evaluation shows that our maintenance algorithm scales when the number of nodes and edges stored in the graph database increases. Furthermore, our evaluation shows that our approach can outperform existing approaches for the incremental maintenance of graph query results.
Generalized connectivity of graphs
Li, Xueliang
2016-01-01
Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
Feed Variability and Bulk Vitrification Glass Performance Assessment
International Nuclear Information System (INIS)
Mahoney, Lenna A.; Vienna, John D.
2005-01-01
The supplemental treatment (ST) bulk vitrification process will obtain its feed, consisting of low-activity waste (LAW), from more than one source. One purpose of this letter report is to describe the compositional variability of the feed to ST. The other is to support the M-62-08 decision by providing a preliminary assessment of the effectiveness of bulk vitrification (BV), the process that has been selected to perform supplemental treatment, in handling the ST feed envelope. Roughly nine-tenths of the ST LAW feed will come from the Waste Treatment Plant (WTP) pretreatment. This processed waste is expected to combine (1) a portion of the same LAW feed sent to the WTP melters and (2) a dilute stream that is the product of the condensate from the submerged-bed scrubber (SBS) and the drainage from the electrostatic precipitator (WESP), both of which are part of the LAW off-gas system. The manner in which the off-gas-product stream is concentrated to reduce its volume, and the way in which the excess LAW and off-gas product streams are combined, are part of the interface between WTP and ST and have not been determined. This letter report considers only one possible arrangement, in which half of the total LAW is added to the off-gas product stream, giving an estimated ST feed stream from WTP. (Total LAW equals that portion of LAW sent to the WTP LAW vitrification plant (WTP LAW) plus the LAW not currently treatable in the LAW vitrification plant due to capacity limitations (excess))
Inferring ontology graph structures using OWL reasoning
Rodriguez-Garcia, Miguel Angel
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Inferring ontology graph structures using OWL reasoning.
Rodríguez-García, Miguel Ángel; Hoehndorf, Robert
2018-01-05
Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.
Autoregressive Moving Average Graph Filtering
Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert
2016-01-01
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...
causal variables and academic performance of students in cross
African Journals Online (AJOL)
This study investigated the causal variables (Child, Family, School, Society and Government) and academic ... parents in the immediate daily aspect of education ... This study employed the descriptive .... on cognitive development. Journal of.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar
2017-03-06
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
Subgraph detection using graph signals
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.
GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1
Energy Technology Data Exchange (ETDEWEB)
Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor
2014-08-25
Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.
The Container Problem in Bubble-Sort Graphs
Suzuki, Yasuto; Kaneko, Keiichi
Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.
Bollobas, Bela
2004-01-01
The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A
Performance evaluation of a center pivot variable rate irrigation system
Variable Rate Irrigation (VRI) for center pivots offers potential to match specific application rates to non-uniform soil conditions along the length of the lateral. The benefit of such systems is influenced by the areal extent of these variations and the smallest scale to which the irrigation syste...
High-performance control of continuously variable transmissions
Meulen, van der S.H.
2010-01-01
Nowadays, developments with respect to the pushbelt continuously variable transmission (CVT) are mainly directed towards a reduction of the fuel consumption of a vehicle. The fuel consumption of a vehicle is affected by the variator of the CVT, which transfers the torque and varies the transmission
agronomic performance and estimate of genetic variability of upland ...
African Journals Online (AJOL)
Admin
importance of rice, it has many industrial uses. For example ... environmental constraints. Particularly ... of Variance (ANOVA) according to Gomez and Gomez. (1984) and ... selection of genotypes for increased grain yield. For grain ..... yield components in wheat, Crop Science ... variability, stability and correlation studies in.
Graph processing platforms at scale: practices and experiences
Energy Technology Data Exchange (ETDEWEB)
Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL
2015-01-01
Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution, connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.
Directory of Open Access Journals (Sweden)
Haynes Teresa W.
2014-08-01
Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds
Tailored Random Graph Ensembles
International Nuclear Information System (INIS)
Roberts, E S; Annibale, A; Coolen, A C C
2013-01-01
Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.
Alspach, BR
1985-01-01
This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.
Wilson, Robin J
1985-01-01
Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.
Hyperbolicity in median graphs
Indian Academy of Sciences (India)
mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.
Uniform Single Valued Neutrosophic Graphs
Directory of Open Access Journals (Sweden)
S. Broumi
2017-09-01
Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.
Collective Rationality in Graph Aggregation
Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.
2014-01-01
Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the
International Nuclear Information System (INIS)
Barra, F.; Gaspard, P.
2001-01-01
We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes
Bollobás, Béla
1998-01-01
The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...
Pre-performance Physiological State: Heart Rate Variability as a Predictor of Shooting Performance.
Ortega, E; Wang, C J K
2018-03-01
Heart rate variability (HRV) is commonly used in sport science for monitoring the physiology of athletes but not as an indicator of physiological state from a psychological perspective. Since HRV is established to be an indicator of emotional responding, it could be an objective means of quantifying an athlete's subjective physiological state before competition. A total of 61 sport shooters participated in this study, of which 21 were novice shooters, 19 were intermediate shooters, and 21 were advanced level shooters. HRV, self-efficacy, and use of mental skills were assessed before they completed a standard shooting performance task of 40 shots, as in a competition qualifying round. The results showed that HRV was significantly positively correlated with self-efficacy and performance and was a significant predictor of shooting performance. In addition, advanced shooters were found to have significantly lower average heart rate before shooting and used more self-talk, relaxation, imagery, and automaticity compared to novice and intermediate shooters. HRV was found to be useful in identifying the physiological state of an athlete before competing, and as such, coaches and athletes can adopt practical strategies to improve the pre-performance physiological state as a means to optimize performance.
Simplifying Scalable Graph Processing with a Domain-Specific Language
Hong, Sungpack; Salihoglu, Semih; Widom, Jennifer; Olukotun, Kunle
2014-01-01
Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel's programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.
Simplifying Scalable Graph Processing with a Domain-Specific Language
Hong, Sungpack
2014-01-01
Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel\\'s programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.
Topological properties of the limited penetrable horizontal visibility graph family
Wang, Minggang; Vilela, André L. M.; Du, Ruijin; Zhao, Longfeng; Dong, Gaogao; Tian, Lixin; Stanley, H. Eugene
2018-05-01
The limited penetrable horizontal visibility graph algorithm was recently introduced to map time series in complex networks. In this work, we extend this algorithm to create a directed-limited penetrable horizontal visibility graph and an image-limited penetrable horizontal visibility graph. We define two algorithms and provide theoretical results on the topological properties of these graphs associated with different types of real-value series. We perform several numerical simulations to check the accuracy of our theoretical results. Finally, we present an application of the directed-limited penetrable horizontal visibility graph to measure real-value time series irreversibility and an application of the image-limited penetrable horizontal visibility graph that discriminates noise from chaos. We also propose a method to measure the systematic risk using the image-limited penetrable horizontal visibility graph, and the empirical results show the effectiveness of our proposed algorithms.
Variability of Performance: A "Signature" Characteristic of Learning Disabled Children?
Fuchs, Douglas; And Others
Two studies were conducted to compare the performance instability of children (grades 3-9) labeled learning disabled/brain injured (LD/BI) to the performance instability of emotionally handicapped (EH) children. In the first study, 50 LD/BI and 37 EH students were measured on three third grade reading passages twice, once within one sitting and…
Determining X-chains in graph states
International Nuclear Information System (INIS)
Wu, Jun-Yi; Kampermann, Hermann; Bruß, Dagmar
2016-01-01
The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-chains (Wu et al 2015 Phys. Rev. A 92 012322). We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by the Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states. (paper)
Sullivan, T. J.; Parker, D. E.
1979-01-01
A design technology study was performed to identify a high speed, multistage, variable geometry fan configuration capable of achieving wide flow modulation with near optimum efficiency at the important operating condition. A parametric screening study of the front and rear block fans was conducted in which the influence of major fan design features on weight and efficiency was determined. Key design parameters were varied systematically to determine the fan configuration most suited for a double bypass, variable cycle engine. Two and three stage fans were considered for the front block. A single stage, core driven fan was studied for the rear block. Variable geometry concepts were evaluated to provide near optimum off design performance. A detailed aerodynamic design and a preliminary mechanical design were carried out for the selected fan configuration. Performance predictions were made for the front and rear block fans.
Impact of Diffusion and Variability on Vendor Performance Evaluation
National Research Council Canada - National Science Library
Doerr, Kenneth; Lewis, Ira
2005-01-01
In this paper we develop a theory of the impact of behavioral decision making factors on the evaluation of logistic service providers under performance-based logistics and provide an analysis of pilot...
Muscle variables of importance for physiological performance in competitive football
DEFF Research Database (Denmark)
Mohr, Magni; Thomassen, Martin; Girard, Olivier
2016-01-01
PURPOSE: To examine how match performance parameters in trained footballers relate to skeletal muscle parameters, sprint ability and intermittent exercise performance. METHODS: 19 male elite football players completed an experimental game with physical performance determined by video analysis...... and exercise capacity assessed by intermittent Yo-Yo IR1 and IR2 tests, and a repeated sprint test (RST). Muscle tissue was obtained for analysis of metabolic enzyme maximal activity and key muscle protein expression. RESULTS: Total game distance, distance deficit from first to second half and high......-intensity running in the final 15 min of the game were all correlated to the players' Yo-Yo IR1 performance (r = 0.55-0.87) and beta-hydroxyacyl-CoA-dehydrogenase (HAD) maximal activity (r = 0.55-0.65). Furthermore, platelet/endothelial cell adhesion molecule-1 (PECAM1) protein expression was weakly (r = 0...
Psychological variables and Wechsler Adult Intelligence Scale-IV performance.
Gass, Carlton S; Gutierrez, Laura
2017-01-01
The MMPI-2 and WAIS-IV are commonly used together in neuropsychological evaluations yet little is known about their interrelationships. This study explored the potential influence of psychological factors on WAIS-IV performance in a sample of 180 predominantly male veteran referrals that underwent a comprehensive neuropsychological examination in a VA Medical Center. Exclusionary criteria included failed performance validity testing and self-report distortion on the MMPI-2. A Principal Components Analysis was performed on the 15 MMPI-2 content scales, yielding three broader higher-order psychological dimensions: Internalized Emotional Dysfunction (IED), Externalized Emotional Dysfunction (EED), and Fear. Level of IED was not related to performance on the WAIS-IV Full Scale IQ or its four indexes: (Verbal Comprehension, Perceptual Reasoning, Working Memory, and Processing Speed). EED was not related to WAIS-IV performance. Level of Fear, which encompasses health preoccupations (HEA) and distorted perceptions (BIZ), was significantly related to WAIS-IV Full Scale IQ and Verbal Comprehension. These results challenge the common use of high scores on the MMPI-2 IED measures (chiefly depression and anxiety) to explain deficient WAIS-IV performance. In addition, they provide impetus for further investigation of the relation between verbal intelligence and Fear.
The variable polarity plasma arc welding process: Characteristics and performance
Hung, R. J.; Zhu, G. J.
1991-01-01
Significant advantages of the Variable Polarity Plasma Arc (VPPA) Welding Process include faster welding, fewer repairs, less joint preparation, reduced weldment distortion, and absence of porosity. The power distribution was analyzed for an argon plasma gas flow constituting the fluid in the VPPA Welding Process. The major heat loss at the torch nozzle is convective heat transfer; in the space between the outlet of the nozzle and the workpiece; radiative heat transfer; and in the keyhole in the workpiece, convective heat transfer. The power absorbed at the workpiece produces the molten puddle that solidifies into the weld bead. Crown and root widths, and crown and root heights of the weld bead are predicted. The basis is provided for an algorithm for automatic control of VPPA welding machine parameters to obtain desired weld bead dimensions.
On some covering graphs of a graph
Directory of Open Access Journals (Sweden)
Shariefuddin Pirzada
2016-10-01
Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\
Visuospatial ability factors and performance variables in laparoscopic simulator training
Luursema, J.M.; Verwey, Willem B.; Burie, Remke
2012-01-01
Visuospatial ability has been shown to be important to several aspects of laparoscopic performance, including simulator training. Only a limited subset of visuospatial ability factors however has been investigated in such studies. Tests for different visuospatial ability factors differ in stimulus
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
Jamour, Fuad Tarek
2017-10-17
Betweenness centrality quantifies the importance of nodes in a graph in many applications, including network analysis, community detection and identification of influential users. Typically, graphs in such applications evolve over time. Thus, the computation of betweenness centrality should be performed incrementally. This is challenging because updating even a single edge may trigger the computation of all-pairs shortest paths in the entire graph. Existing approaches cannot scale to large graphs: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving graphs. We decompose the graph into biconnected components and prove that processing can be localized within the affected components. iCentral is the first algorithm to support incremental betweeness centrality computation within a graph component. This is done efficiently, in linear space; consequently, iCentral scales to large graphs. We demonstrate with real datasets that the serial implementation of iCentral is up to 3.7 times faster than existing serial methods. Our parallel implementation that scales to large graphs, is an order of magnitude faster than the state-of-the-art parallel algorithm, while using an order of magnitude less computational resources.
Fundamentals of algebraic graph transformation
Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele
2006-01-01
Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...
White, AT
1985-01-01
The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.
Ribes, Luis
2017-01-01
This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...
Subdominant pseudoultrametric on graphs
Energy Technology Data Exchange (ETDEWEB)
Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)
2013-08-31
Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.
Quantitative graph theory mathematical foundations and applications
Dehmer, Matthias
2014-01-01
The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat
A distributed query execution engine of big attributed graphs.
Batarfi, Omar; Elshawi, Radwa; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif
2016-01-01
A graph is a popular data model that has become pervasively used for modeling structural relationships between objects. In practice, in many real-world graphs, the graph vertices and edges need to be associated with descriptive attributes. Such type of graphs are referred to as attributed graphs. G-SPARQL has been proposed as an expressive language, with a centralized execution engine, for querying attributed graphs. G-SPARQL supports various types of graph querying operations including reachability, pattern matching and shortest path where any G-SPARQL query may include value-based predicates on the descriptive information (attributes) of the graph edges/vertices in addition to the structural predicates. In general, a main limitation of centralized systems is that their vertical scalability is always restricted by the physical limits of computer systems. This article describes the design, implementation in addition to the performance evaluation of DG-SPARQL, a distributed, hybrid and adaptive parallel execution engine of G-SPARQL queries. In this engine, the topology of the graph is distributed over the main memory of the underlying nodes while the graph data are maintained in a relational store which is replicated on the disk of each of the underlying nodes. DG-SPARQL evaluates parts of the query plan via SQL queries which are pushed to the underlying relational stores while other parts of the query plan, as necessary, are evaluated via indexless memory-based graph traversal algorithms. Our experimental evaluation shows the efficiency and the scalability of DG-SPARQL on querying massive attributed graph datasets in addition to its ability to outperform the performance of Apache Giraph, a popular distributed graph processing system, by orders of magnitudes.
Cheung, King Sing
2014-01-01
Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume
Dayal, Amit; Brock, David
2018-01-01
Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...
Stevanovic, Dragan
2015-01-01
Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the
Propulsive performance of pitching foils with variable chordwise flexibility
Zeyghami, Samane; Moored, Keith; Lehigh University Team
2017-11-01
Many swimming and flying animals propel themselves efficiently through water by oscillating flexible fins. These fins are not homogeneously flexible, but instead their flexural stiffness varies along their chord and span. Here we seek to evaluate the effect stiffness profile on the propulsive performance of pitching foils. Stiffness profile characterizes the variation in the local fin stiffness along the chord. To this aim, we developed a low order model of a functionally-graded material where the chordwise flexibility is modeled by two torsional springs along the chordline and the stiffness and location of the springs can be varied arbitrarily. The torsional spring structural model is then strongly coupled to a boundary element fluid model to simulate the fluid-structure interactions. Keeping the leading edge kinematics unchanged, we alter the stiffness profile of the foil and allow it to swim freely in response to the resulting hydrodynamic forces. We then detail the dependency of the hydrodynamic performance and the wake structure to the variations in the local structural properties of the foil.
High variability impairs motor learning regardless of whether it affects task performance.
Cardis, Marco; Casadio, Maura; Ranganathan, Rajiv
2018-01-01
Motor variability plays an important role in motor learning, although the exact mechanisms of how variability affects learning are not well understood. Recent evidence suggests that motor variability may have different effects on learning in redundant tasks, depending on whether it is present in the task space (where it affects task performance) or in the null space (where it has no effect on task performance). We examined the effect of directly introducing null and task space variability using a manipulandum during the learning of a motor task. Participants learned a bimanual shuffleboard task for 2 days, where their goal was to slide a virtual puck as close as possible toward a target. Critically, the distance traveled by the puck was determined by the sum of the left- and right-hand velocities, which meant that there was redundancy in the task. Participants were divided into five groups, based on both the dimension in which the variability was introduced and the amount of variability that was introduced during training. Results showed that although all groups were able to reduce error with practice, learning was affected more by the amount of variability introduced rather than the dimension in which variability was introduced. Specifically, groups with higher movement variability during practice showed larger errors at the end of practice compared with groups that had low variability during learning. These results suggest that although introducing variability can increase exploration of new solutions, this may adversely affect the ability to retain the learned solution. NEW & NOTEWORTHY We examined the role of introducing variability during motor learning in a redundant task. The presence of redundancy allows variability to be introduced in different dimensions: the task space (where it affects task performance) or the null space (where it does not affect task performance). We found that introducing variability affected learning adversely, but the amount of
Graph embedding with rich information through heterogeneous graph
Sun, Guolei
2017-01-01
Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most
Effects of compression and individual variability on face recognition performance
McGarry, Delia P.; Arndt, Craig M.; McCabe, Steven A.; D'Amato, Donald P.
2004-08-01
The Enhanced Border Security and Visa Entry Reform Act of 2002 requires that the Visa Waiver Program be available only to countries that have a program to issue to their nationals machine-readable passports incorporating biometric identifiers complying with applicable standards established by the International Civil Aviation Organization (ICAO). In June 2002, the New Technologies Working Group of ICAO unanimously endorsed the use of face recognition (FR) as the globally interoperable biometric for machine-assisted identity confirmation with machine-readable travel documents (MRTDs), although Member States may elect to use fingerprint and/or iris recognition as additional biometric technologies. The means and formats are still being developed through which biometric information might be stored in the constrained space of integrated circuit chips embedded within travel documents. Such information will be stored in an open, yet unalterable and very compact format, probably as digitally signed and efficiently compressed images. The objective of this research is to characterize the many factors that affect FR system performance with respect to the legislated mandates concerning FR. A photograph acquisition environment and a commercial face recognition system have been installed at Mitretek, and over 1,400 images have been collected of volunteers. The image database and FR system are being used to analyze the effects of lossy image compression, individual differences, such as eyeglasses and facial hair, and the acquisition environment on FR system performance. Images are compressed by varying ratios using JPEG2000 to determine the trade-off points between recognition accuracy and compression ratio. The various acquisition factors that contribute to differences in FR system performance among individuals are also being measured. The results of this study will be used to refine and test efficient face image interchange standards that ensure highly accurate recognition, both
Performance of an area variable MOS varicap weighted programmable CCD transversal filter
Bhattacharyya, A.B.; Shankarnarayan, L.; Kapur, N.; Wallinga, Hans
1981-01-01
The performance of an electrically programmable CCD transversal filter (PTF) is presented in which tap-weight multiplication is performed by a novel and compact on chip voltage controlled area variable MOS varicap.
Stereotype Threat and College Academic Performance: A Latent Variables Approach*
Owens, Jayanti; Massey, Douglas S.
2013-01-01
Stereotype threat theory has gained experimental and survey-based support in helping explain the academic underperformance of minority students at selective colleges and universities. Stereotype threat theory states that minority students underperform because of pressures created by negative stereotypes about their racial group. Past survey-based studies, however, are characterized by methodological inefficiencies and potential biases: key theoretical constructs have only been measured using summed indicators and predicted relationships modeled using ordinary least squares. Using the National Longitudinal Survey of Freshman, this study overcomes previous methodological shortcomings by developing a latent construct model of stereotype threat. Theoretical constructs and equations are estimated simultaneously from multiple indicators, yielding a more reliable, valid, and parsimonious test of key propositions. Findings additionally support the view that social stigma can indeed have strong negative effects on the academic performance of pejoratively stereotyped racial-minority group members, not only in laboratory settings, but also in the real world. PMID:23950616
Variable learning performance: the levels of behaviour organization.
Csányi, V; Altbäcker, V
1990-01-01
Our experiments were focused on some special aspects of learning in the paradise fish. Passive avoidance conditioning method was used with different success depending on the complexity of the learning tasks. In the case of simple behavioural elements various "constrains" on avoidance learning were found. In a small, covered place the fish were ready to perform freezing reaction and mild punishment increased the frequency and duration of the freezing bouts very substantially. However, it was very difficult to enhance the frequency of freezing by punishment in a tank with transparent walls, where the main response to punishment was escape. The most easily learned tasks were the complex ones which had several different solutions. The fish learned to avoid either side of an aquarium very easily because they could use various behavioural elements to solve the problem. These findings could be interpreted within the framework of different organizational levels of behaviour.
Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models
Directory of Open Access Journals (Sweden)
Tomasz Kajdanowicz
2016-09-01
Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.
Large-scale Graph Computation on Just a PC
2014-05-01
edges for several vertices simultaneously). We compared the performance of GraphChi-DB to Neo4j using their Java API (we discuss MySQL comparison in the...75 4.7.6 Comparison to RDBMS ( MySQL ) . . . . . . . . . . . . . . . . . . . . . 75 4.7.7 Summary of the...Windows method, GraphChi. The C++ implementation has circa 8,000 lines of code. We have also de- veloped a Java -version of GraphChi, but it does not
Whole Genome Phylogenetic Tree Reconstruction using Colored de Bruijn Graphs
Lyman, Cole
2017-01-01
We present kleuren, a novel assembly-free method to reconstruct phylogenetic trees using the Colored de Bruijn Graph. kleuren works by constructing the Colored de Bruijn Graph and then traversing it, finding bubble structures in the graph that provide phylogenetic signal. The bubbles are then aligned and concatenated to form a supermatrix, from which a phylogenetic tree is inferred. We introduce the algorithm that kleuren uses to accomplish this task, and show its performance on reconstructin...
A cognitive architecture-based model of graph comprehension
Peebles, David
2012-01-01
I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated during t...
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Topics in graph theory graphs and their Cartesian product
Imrich, Wilfried; Rall, Douglas F
2008-01-01
From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.
Towards Scalable Graph Computation on Mobile Devices.
Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng
2014-10-01
Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach.
A graph model for opportunistic network coding
Sorour, Sameh
2015-08-12
© 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase in complexity. In this paper, we design a simple IDNC-like graph model for a specific subclass of ONC, by introducing a more generalized definition of its vertices and the notion of vertex aggregation in order to represent the storage of non-instantly-decodable packets in ONC. Based on this representation, we determine the set of pairwise vertex adjacency conditions that can populate this graph with edges so as to guarantee decodability or aggregation for the vertices of each clique in this graph. We then develop the algorithmic procedures that can be applied on the designed graph model to optimize any performance metric for this ONC subclass. A case study on reducing the completion time shows that the proposed framework improves on the performance of IDNC and gets very close to the optimal performance.
Towards Scalable Graph Computation on Mobile Devices
Chen, Yiqi; Lin, Zhiyuan; Pienta, Robert; Kahng, Minsuk; Chau, Duen Horng
2015-01-01
Mobile devices have become increasingly central to our everyday activities, due to their portability, multi-touch capabilities, and ever-improving computational power. Such attractive features have spurred research interest in leveraging mobile devices for computation. We explore a novel approach that aims to use a single mobile device to perform scalable graph computation on large graphs that do not fit in the device's limited main memory, opening up the possibility of performing on-device analysis of large datasets, without relying on the cloud. Based on the familiar memory mapping capability provided by today's mobile operating systems, our approach to scale up computation is powerful and intentionally kept simple to maximize its applicability across the iOS and Android platforms. Our experiments demonstrate that an iPad mini can perform fast computation on large real graphs with as many as 272 million edges (Google+ social graph), at a speed that is only a few times slower than a 13″ Macbook Pro. Through creating a real world iOS app with this technique, we demonstrate the strong potential application for scalable graph computation on a single mobile device using our approach. PMID:25859564
Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.
2006-01-01
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to
Coloring geographical threshold graphs
Energy Technology Data Exchange (ETDEWEB)
Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH
2008-01-01
We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.
Budhiraja, A.S.; Mukherjee, D.; Wu, R.
2017-01-01
We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson
DEFF Research Database (Denmark)
Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter
2014-01-01
of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...
The STAPL Parallel Graph Library
Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2013-01-01
This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable
Groupies in multitype random graphs
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erd?s-R?nyi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Groupies in multitype random graphs.
Shang, Yilun
2016-01-01
A groupie in a graph is a vertex whose degree is not less than the average degree of its neighbors. Under some mild conditions, we show that the proportion of groupies is very close to 1/2 in multitype random graphs (such as stochastic block models), which include Erdős-Rényi random graphs, random bipartite, and multipartite graphs as special examples. Numerical examples are provided to illustrate the theoretical results.
Temporal Representation in Semantic Graphs
Energy Technology Data Exchange (ETDEWEB)
Levandoski, J J; Abdulla, G M
2007-08-07
A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.
Quantum walks on quotient graphs
International Nuclear Information System (INIS)
Krovi, Hari; Brun, Todd A.
2007-01-01
A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup
Optimizing graph algorithms on pregel-like systems
Salihoglu, Semih
2014-03-01
We study the problem of implementing graph algorithms efficiently on Pregel-like systems, which can be surprisingly challenging. Standard graph algorithms in this setting can incur unnecessary inefficiencies such as slow convergence or high communication or computation cost, typically due to structural properties of the input graphs such as large diameters or skew in component sizes. We describe several optimization techniques to address these inefficiencies. Our most general technique is based on the idea of performing some serial computation on a tiny fraction of the input graph, complementing Pregel\\'s vertex-centric parallelism. We base our study on thorough implementations of several fundamental graph algorithms, some of which have, to the best of our knowledge, not been implemented on Pregel-like systems before. The algorithms and optimizations we describe are fully implemented in our open-source Pregel implementation. We present detailed experiments showing that our optimization techniques improve runtime significantly on a variety of very large graph datasets.
Design of reconfigurable antennas using graph models
Costantine, Joseph; Christodoulou, Christos G; Christodoulou, Christos G
2013-01-01
This lecture discusses the use of graph models to represent reconfigurable antennas. The rise of antennas that adapt to their environment and change their operation based on the user's request hasn't been met with clear design guidelines. There is a need to propose some rules for the optimization of any reconfigurable antenna design and performance. Since reconfigurable antennas are seen as a collection of self-organizing parts, graph models can be introduced to relate each possible topology to a corresponding electromagnetic performance in terms of achieving a characteristic frequency of oper
Granato, Gregory E.
2006-01-01
data in subsequent rows. The user may choose the columns that contain the independent (X) and dependent (Y) variable. A third column, if present, may contain metadata such as the sample-collection location and date. The program screens the input files and plots the data. The KTRLine software is a graphical tool that facilitates development of regression models by use of graphs of the regression line with data, the regression residuals (with X or Y), and percentile plots of the cumulative frequency of the X variable, Y variable, and the regression residuals. The user may individually transform the independent and dependent variables to reduce heteroscedasticity and to linearize data. The program plots the data and the regression line. The program also prints model specifications and regression statistics to the screen. The user may save and print the regression results. The program can accept data sets that contain up to about 15,000 XY data points, but because the program must sort the array of all pairwise slopes, the program may be perceptibly slow with data sets that contain more than about 1,000 points.
A generalization of total graphs
Indian Academy of Sciences (India)
M Afkhami
2018-04-12
Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.
Graph transformation tool contest 2008
Rensink, Arend; van Gorp, Pieter
This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case
On dominator colorings in graphs
Indian Academy of Sciences (India)
colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.
Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng
2015-12-01
Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.
Learning a Nonnegative Sparse Graph for Linear Regression.
Fang, Xiaozhao; Xu, Yong; Li, Xuelong; Lai, Zhihui; Wong, Wai Keung
2015-09-01
Previous graph-based semisupervised learning (G-SSL) methods have the following drawbacks: 1) they usually predefine the graph structure and then use it to perform label prediction, which cannot guarantee an overall optimum and 2) they only focus on the label prediction or the graph structure construction but are not competent in handling new samples. To this end, a novel nonnegative sparse graph (NNSG) learning method was first proposed. Then, both the label prediction and projection learning were integrated into linear regression. Finally, the linear regression and graph structure learning were unified within the same framework to overcome these two drawbacks. Therefore, a novel method, named learning a NNSG for linear regression was presented, in which the linear regression and graph learning were simultaneously performed to guarantee an overall optimum. In the learning process, the label information can be accurately propagated via the graph structure so that the linear regression can learn a discriminative projection to better fit sample labels and accurately classify new samples. An effective algorithm was designed to solve the corresponding optimization problem with fast convergence. Furthermore, NNSG provides a unified perceptiveness for a number of graph-based learning methods and linear regression methods. The experimental results showed that NNSG can obtain very high classification accuracy and greatly outperforms conventional G-SSL methods, especially some conventional graph construction methods.
Algorithms for Planar Graphs and Graphs in Metric Spaces
DEFF Research Database (Denmark)
Wulff-Nilsen, Christian
structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...
Harary, Frank
2015-01-01
Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc
Spectral fluctuations of quantum graphs
International Nuclear Information System (INIS)
Pluhař, Z.; Weidenmüller, H. A.
2014-01-01
We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry
Dynamic Representations of Sparse Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Fagerberg, Rolf
1999-01-01
We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....
Domination criticality in product graphs
Directory of Open Access Journals (Sweden)
M.R. Chithra
2015-07-01
Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
High Girth Column-Weight-Two LDPC Codes Based on Distance Graphs
Directory of Open Access Journals (Sweden)
Gabofetswe Malema
2007-01-01
Full Text Available LDPC codes of column weight of two are constructed from minimal distance graphs or cages. Distance graphs are used to represent LDPC code matrices such that graph vertices that represent rows and edges are columns. The conversion of a distance graph into matrix form produces an adjacency matrix with column weight of two and girth double that of the graph. The number of 1's in each row (row weight is equal to the degree of the corresponding vertex. By constructing graphs with different vertex degrees, we can vary the rate of corresponding LDPC code matrices. Cage graphs are used as examples of distance graphs to design codes with different girths and rates. Performance of obtained codes depends on girth and structure of the corresponding distance graphs.
Intraindividual variability in cognitive performance in persons with chronic fatigue syndrome.
Fuentes, K; Hunter, M A; Strauss, E; Hultsch, D F
2001-05-01
Studies of cognitive performance among persons with chronic fatigue syndrome (CFS) have yielded inconsistent results. We sought to contribute to findings in this area by examining intraindividual variability as well as level of performance in cognitive functioning. A battery of cognitive measures was administered to 14 CFS patients and 16 healthy individuals on 10 weekly occasions. Analyses comparing the two groups in terms of level of performance defined by latency and accuracy scores revealed that the CFS patients were slower but not less accurate than healthy persons. The CFS group showed greater intraindividual variability (as measured by intraindividual standard deviations and coefficients of variation) than the healthy group, although the results varied by task and time frame. Intraindividual variability was found to be stable across time and correlated across tasks at each testing occasion. Intraindividual variability also uniquely differentiated the groups. The present findings support the proposition that intraindividual variability is a meaningful indicator of cognitive functioning in CFS patients.
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar
2017-04-25
In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.
Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan
2014-01-01
Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...
Canonical Labelling of Site Graphs
Directory of Open Access Journals (Sweden)
Nicolas Oury
2013-06-01
Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.
Learning heat diffusion graphs
Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal
2016-01-01
Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...
Syed, M. Qasim; Lovatt, Ian
2014-01-01
This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…
Understanding Charts and Graphs.
1987-07-28
Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected
Transduction on Directed Graphs via Absorbing Random Walks.
De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Cheng, Li
2017-08-11
In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications.Different from existing research efforts that either only deal with undirected graphs or circumvent directionality by means of symmetrization, we propose a novel random walk approach on directed graphs using absorbing Markov chains, which can be regarded as maximizing the accumulated expected number of visits from the unlabeled transient states. Our algorithm is simple, easy to implement, and works with large-scale graphs on binary, multiclass, and multi-label prediction problems. Moreover, it is capable of preserving the graph structure even when the input graph is sparse and changes over time, as well as retaining weak signals presented in the directed edges. We present its intimate connections to a number of existing methods, including graph kernels, graph Laplacian based methods, and interestingly, spanning forest of graphs. Its computational complexity and the generalization error are also studied. Empirically our algorithm is systematically evaluated on a wide range of applications, where it has shown to perform competitively comparing to a suite of state-of-the-art methods. In particular, our algorithm is shown to work exceptionally well with large sparse directed graphs with e.g. millions of nodes and tens of millions of edges, where it significantly outperforms other state-of-the-art methods. In the dynamic graph setting involving insertion or deletion of nodes and edge-weight changes over time, it also allows efficient online updates that produce the same results as of the batch update counterparts.
López-Gamero, María D; Molina-Azorín, José F; Claver-Cortés, Enrique
2009-07-01
The examination of the possible direct link between environmental protection and firm performance in the literature has generally produced mixed results. The present paper contributes to the literature by using the resource-based view as a mediating process in this relationship. The study specifically tests whether or not the resource-based view of the firm mediates the positive relationships of proactive environmental management and improved environmental performance with competitive advantage, which also has consequences for financial performance. We also check the possible link between the adoption of a pioneering approach and good environmental management practices. Our findings support that early investment timing and intensity in environmental issues impact on the adoption of a proactive environmental management, which in turn helps to improve environmental performance. The findings also show that a firm's resources and competitive advantage act as mediator variables for a positive relationship between environmental protection and financial performance. This contribution is original because the present paper develops a comprehensive whole picture of this path process, which has previously only been partially discussed in the literature. In addition, this study clarifies a relevant point in the literature, namely that the effect of environmental protection on firm performance is not direct and can vary depending on the sector considered. Whereas competitive advantage in relation to costs influences financial performance in the IPPC law sector, the relevant influence in the hotel sector comes from competitive advantage through differentiation.
graphkernels: R and Python packages for graph comparison.
Sugiyama, Mahito; Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten
2018-02-01
Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.
An introduction to grids, graphs, and networks
Pozrikidis, C
2014-01-01
An Introduction to Grids, Graphs, and Networks aims to provide a concise introduction to graphs and networks at a level that is accessible to scientists, engineers, and students. In a practical approach, the book presents only the necessary theoretical concepts from mathematics and considers a variety of physical and conceptual configurations as prototypes or examples. The subject is timely, as the performance of networks is recognized as an important topic in the study of complex systems with applications in energy, material, and information grid transport (epitomized by the internet). The bo
A graph algebra for scalable visual analytics.
Shaverdian, Anna A; Zhou, Hao; Michailidis, George; Jagadish, Hosagrahar V
2012-01-01
Visual analytics (VA), which combines analytical techniques with advanced visualization features, is fast becoming a standard tool for extracting information from graph data. Researchers have developed many tools for this purpose, suggesting a need for formal methods to guide these tools' creation. Increased data demands on computing requires redesigning VA tools to consider performance and reliability in the context of analysis of exascale datasets. Furthermore, visual analysts need a way to document their analyses for reuse and results justification. A VA graph framework encapsulated in a graph algebra helps address these needs. Its atomic operators include selection and aggregation. The framework employs a visual operator and supports dynamic attributes of data to enable scalable visual exploration of data.
Learning molecular energies using localized graph kernels
Ferré, Grégoire; Haut, Terry; Barros, Kipton
2017-03-01
Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab initio calculations) and at speeds suitable for molecular dynamics simulation. Best performance is achieved when the known physical constraints are encoded in the machine learning models. For example, the atomic energy is invariant under global translations and rotations; it is also invariant to permutations of same-species atoms. Although simple to state, these symmetries are complicated to encode into machine learning algorithms. In this paper, we present a machine learning approach based on graph theory that naturally incorporates translation, rotation, and permutation symmetries. Specifically, we use a random walk graph kernel to measure the similarity of two adjacency matrices, each of which represents a local atomic environment. This Graph Approximated Energy (GRAPE) approach is flexible and admits many possible extensions. We benchmark a simple version of GRAPE by predicting atomization energies on a standard dataset of organic molecules.
The Effect of Variable Gravity on the Cooling Performance of a 16-Nozzle Spray Array
National Research Council Canada - National Science Library
Elston, Levi J; Yerkes, Kirk L; Thomas, Scott K; McQuillen, John
2008-01-01
The objective of this thesis was to investigate the cooling performance of a 16-nozzle spray array, using FC-72 as the working fluid, in variable gravity conditions with additional emphasis on fluid...
A Decline in Response Variability Improves Neural Signal Detection during Auditory Task Performance.
von Trapp, Gardiner; Buran, Bradley N; Sen, Kamal; Semple, Malcolm N; Sanes, Dan H
2016-10-26
The detection of a sensory stimulus arises from a significant change in neural activity, but a sensory neuron's response is rarely identical to successive presentations of the same stimulus. Large trial-to-trial variability would limit the central nervous system's ability to reliably detect a stimulus, presumably affecting perceptual performance. However, if response variability were to decrease while firing rate remained constant, then neural sensitivity could improve. Here, we asked whether engagement in an auditory detection task can modulate response variability, thereby increasing neural sensitivity. We recorded telemetrically from the core auditory cortex of gerbils, both while they engaged in an amplitude-modulation detection task and while they sat quietly listening to the identical stimuli. Using a signal detection theory framework, we found that neural sensitivity was improved during task performance, and this improvement was closely associated with a decrease in response variability. Moreover, units with the greatest change in response variability had absolute neural thresholds most closely aligned with simultaneously measured perceptual thresholds. Our findings suggest that the limitations imposed by response variability diminish during task performance, thereby improving the sensitivity of neural encoding and potentially leading to better perceptual sensitivity. The detection of a sensory stimulus arises from a significant change in neural activity. However, trial-to-trial variability of the neural response may limit perceptual performance. If the neural response to a stimulus is quite variable, then the response on a given trial could be confused with the pattern of neural activity generated when the stimulus is absent. Therefore, a neural mechanism that served to reduce response variability would allow for better stimulus detection. By recording from the cortex of freely moving animals engaged in an auditory detection task, we found that variability
Efficient Extraction of High Centrality Vertices in Distributed Graphs
Energy Technology Data Exchange (ETDEWEB)
Kumbhare, Alok [Univ. of Southern California, Los Angeles, CA (United States); Frincu, Marc [Univ. of Southern California, Los Angeles, CA (United States); Raghavendra, Cauligi S. [Univ. of Southern California, Los Angeles, CA (United States); Prasanna, Viktor K. [Univ. of Southern California, Los Angeles, CA (United States)
2014-09-09
Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.
Higher-Order Minimal Functional Graphs
DEFF Research Database (Denmark)
Jones, Neil D; Rosendahl, Mads
1994-01-01
We present a minimal function graph semantics for a higher-order functional language with applicative evaluation order. The semantics captures the intermediate calls performed during the evaluation of a program. This information may be used in abstract interpretation as a basis for proving...
Zhang, Guo-Qiang; Luo, Lingyun; Ogbuji, Chime; Joslyn, Cliff; Mejino, Jose; Sahoo, Satya S
2012-01-01
The interaction of multiple types of relationships among anatomical classes in the Foundational Model of Anatomy (FMA) can provide inferred information valuable for quality assurance. This paper introduces a method called Motif Checking (MOCH) to study the effects of such multi-relation type interactions for detecting logical inconsistencies as well as other anomalies represented by the motifs. MOCH represents patterns of multi-type interaction as small labeled (with multiple types of edges) sub-graph motifs, whose nodes represent class variables, and labeled edges represent relational types. By representing FMA as an RDF graph and motifs as SPARQL queries, fragments of FMA are automatically obtained as auditing candidates. Leveraging the scalability and reconfigurability of Semantic Web Technology, we performed exhaustive analyses of a variety of labeled sub-graph motifs. The quality assurance feature of MOCH comes from the distinct use of a subset of the edges of the graph motifs as constraints for disjointness, whereby bringing in rule-based flavor to the approach as well. With possible disjointness implied by antonyms, we performed manual inspection of the resulting FMA fragments and tracked down sources of abnormal inferred conclusions (logical inconsistencies), which are amendable for programmatic revision of the FMA. Our results demonstrate that MOCH provides a unique source of valuable information for quality assurance. Since our approach is general, it is applicable to any ontological system with an OWL representation. PMID:23304382
Zhang, Guo-Qiang; Luo, Lingyun; Ogbuji, Chime; Joslyn, Cliff; Mejino, Jose; Sahoo, Satya S
2012-01-01
The interaction of multiple types of relationships among anatomical classes in the Foundational Model of Anatomy (FMA) can provide inferred information valuable for quality assurance. This paper introduces a method called Motif Checking (MOCH) to study the effects of such multi-relation type interactions for detecting logical inconsistencies as well as other anomalies represented by the motifs. MOCH represents patterns of multi-type interaction as small labeled (with multiple types of edges) sub-graph motifs, whose nodes represent class variables, and labeled edges represent relational types. By representing FMA as an RDF graph and motifs as SPARQL queries, fragments of FMA are automatically obtained as auditing candidates. Leveraging the scalability and reconfigurability of Semantic Web Technology, we performed exhaustive analyses of a variety of labeled sub-graph motifs. The quality assurance feature of MOCH comes from the distinct use of a subset of the edges of the graph motifs as constraints for disjointness, whereby bringing in rule-based flavor to the approach as well. With possible disjointness implied by antonyms, we performed manual inspection of the resulting FMA fragments and tracked down sources of abnormal inferred conclusions (logical inconsistencies), which are amendable for programmatic revision of the FMA. Our results demonstrate that MOCH provides a unique source of valuable information for quality assurance. Since our approach is general, it is applicable to any ontological system with an OWL representation.
Graphs cospectral with a friendship graph or its complement
Directory of Open Access Journals (Sweden)
Alireza Abdollahi
2013-12-01
Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.
Temporary impact of blood donation on physical performance and hematologic variables in women
DEFF Research Database (Denmark)
Stangerup, Ida; Kramp, Nana L.; Ziegler, Andreas K.
2017-01-01
BACKGROUNDNo former studies have examined how blood donation influences physical performance in women, who due to menstruation may have a slower recovery of performance. Therefore, the aim of this study was to clarify how VO2peak, time trial (TT) performance, and hematologic variables are affected...... in 18 iron-sufficient (plasma ferritin [P-ferritin] > 30 µg/L) women after a standard 450-mL blood donation. STUDY DESIGN AND METHODSVO2peak, TT performance, and blood variables were measured at baseline and 3, 7, 14, 21, and 28 days after blood donation in 18 iron-sufficient women. Anthropometrics were...
Query optimization for graph analytics on linked data using SPARQL
Energy Technology Data Exchange (ETDEWEB)
Hong, Seokyong [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lim, Seung -Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sukumar, Sreenivas R. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Vatsavai, Ranga Raju [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)
2015-07-01
Triplestores that support query languages such as SPARQL are emerging as the preferred and scalable solution to represent data and meta-data as massive heterogeneous graphs using Semantic Web standards. With increasing adoption, the desire to conduct graph-theoretic mining and exploratory analysis has also increased. Addressing that desire, this paper presents a solution that is the marriage of Graph Theory and the Semantic Web. We present software that can analyze Linked Data using graph operations such as counting triangles, finding eccentricity, testing connectedness, and computing PageRank directly on triple stores via the SPARQL interface. We describe the process of optimizing performance of the SPARQL-based implementation of such popular graph algorithms by reducing the space-overhead, simplifying iterative complexity and removing redundant computations by understanding query plans. Our optimized approach shows significant performance gains on triplestores hosted on stand-alone workstations as well as hardware-optimized scalable supercomputers such as the Cray XMT.
Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
DEFF Research Database (Denmark)
Bensmail, Julien; Renault, Gabriel
2016-01-01
An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...
The One Universal Graph — a free and open graph database
International Nuclear Information System (INIS)
Ng, Liang S.; Champion, Corbin
2016-01-01
Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)
The One Universal Graph — a free and open graph database
Ng, Liang S.; Champion, Corbin
2016-02-01
Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.
Endomorphisms of graph algebras
DEFF Research Database (Denmark)
Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech
2012-01-01
We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...
Yap, Hian-Poh
1996-01-01
This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.
Using graph approach for managing connectivity in integrative landscape modelling
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). Open
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,; West, Brandon; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence
2015-01-01
that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM
Enabling Structured Exploration of Workflow Performance Variability in Extreme-Scale Environments
Energy Technology Data Exchange (ETDEWEB)
Kleese van Dam, Kerstin; Stephan, Eric G.; Raju, Bibi; Altintas, Ilkay; Elsethagen, Todd O.; Krishnamoorthy, Sriram
2015-11-15
Workflows are taking an Workflows are taking an increasingly important role in orchestrating complex scientific processes in extreme scale and highly heterogeneous environments. However, to date we cannot reliably predict, understand, and optimize workflow performance. Sources of performance variability and in particular the interdependencies of workflow design, execution environment and system architecture are not well understood. While there is a rich portfolio of tools for performance analysis, modeling and prediction for single applications in homogenous computing environments, these are not applicable to workflows, due to the number and heterogeneity of the involved workflow and system components and their strong interdependencies. In this paper, we investigate workflow performance goals and identify factors that could have a relevant impact. Based on our analysis, we propose a new workflow performance provenance ontology, the Open Provenance Model-based WorkFlow Performance Provenance, or OPM-WFPP, that will enable the empirical study of workflow performance characteristics and variability including complex source attribution.
Directory of Open Access Journals (Sweden)
Unil Yun
2016-05-01
Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.
Graph Algorithm Animation with Grrr
Rodgers, Peter; Vidal, Natalia
2000-01-01
We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...
An Investigation of Selected Variables Related to Student Algebra I Performance in Mississippi
Scott, Undray
2016-01-01
This research study attempted to determine if specific variables were related to student performance on the Algebra I subject-area test. This study also sought to determine in which of grades 8, 9, or 10 students performed better on the Algebra I Subject Area Test. This study also investigated the different criteria that are used to schedule…
Irlbeck, Sonja A.
2002-01-01
Provides a chronological perspective of human performance technology (HPT) definitions and an evaluation of them in terms of independent and dependent variables. Discusses human competence and performance technology and compares the definitions with the goals that have been articulated for HPT. (Author/LRW)
Harris, B. J.; Sun, S. S.; Li, W. H.
2017-03-01
With the growing need for effective intercity transport, the need for more advanced rail vehicle technology has never been greater. The conflicting primary longitudinal suspension requirements of high speed stability and curving performance limit the development of rail vehicle technology. This paper presents a novel magnetorheological fluid based joint with variable stiffness characteristics for the purpose of overcoming this parameter conflict. Firstly, the joint design and working principle is developed. Following this, a prototype is tested by MTS to characterize its variable stiffness properties under a range of conditions. Lastly, the performance of the proposed MRF rubber joint with regard to improving train stability and curving performance is numerically evaluated.
Morais, J.E.; Garrido, N.; Marques, M.C.; Silva, A.J.; Marinho, D.A.; Barbosa, Tiago M.
2013-01-01
The aim of this study was to assess the: (i) gender; (ii) performance and; (iii) gender versus performance interactions in young swimmers’ anthropometric, kinematic and energetic variables. One hundred and thirty six young swimmers (62 boys: 12.76 ± 0.72 years old at Tanner stages 1–2 by self-evaluation; and 64 girls: 11.89 ± 0.93 years old at Tanner stages 1–2 by self-evaluation) were evaluated. Performance, anthropometrics, kinematics and energetic variables were selected. There was a non-s...
Optimization Problems on Threshold Graphs
Directory of Open Access Journals (Sweden)
Elena Nechita
2010-06-01
Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.
Eulerian Graphs and Related Topics
Fleischner, Herbert
1990-01-01
The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a
Applying graphs and complex networks to football metric interpretation.
Arriaza-Ardiles, E; Martín-González, J M; Zuniga, M D; Sánchez-Flores, J; de Saa, Y; García-Manso, J M
2018-02-01
This work presents a methodology for analysing the interactions between players in a football team, from the point of view of graph theory and complex networks. We model the complex network of passing interactions between players of a same team in 32 official matches of the Liga de Fútbol Profesional (Spain), using a passing/reception graph. This methodology allows us to understand the play structure of the team, by analysing the offensive phases of game-play. We utilise two different strategies for characterising the contribution of the players to the team: the clustering coefficient, and centrality metrics (closeness and betweenness). We show the application of this methodology by analyzing the performance of a professional Spanish team according to these metrics and the distribution of passing/reception in the field. Keeping in mind the dynamic nature of collective sports, in the future we will incorporate metrics which allows us to analyse the performance of the team also according to the circumstances of game-play and to different contextual variables such as, the utilisation of the field space, the time, and the ball, according to specific tactical situations. Copyright © 2017 Elsevier B.V. All rights reserved.
Energy Technology Data Exchange (ETDEWEB)
Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
2016-01-01
In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.
Inflation,Inflation Variability, and Output Performance. Venezuela 1951-2002
Olivo, Victor
2014-01-01
This paper explores the relationship between the level of inflation, inflation variability, and output performance in the Venezuelan economy for the period 1951-2002. The paper examines the mechanism through which higher inflation translates into lower non-oil real GDP growth. We find empirical evidence that supports Friedman's (1977) contention that higher inflation produces more inflation volatility /uncertainty that leads to relative price variability that in turn, is harmful for the prope...
Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?
Directory of Open Access Journals (Sweden)
Mehmet Fatih Öçal
2017-01-01
Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.
Analyzing locomotion synthesis with feature-based motion graphs.
Mahmudi, Mentar; Kallmann, Marcelo
2013-05-01
We propose feature-based motion graphs for realistic locomotion synthesis among obstacles. Among several advantages, feature-based motion graphs achieve improved results in search queries, eliminate the need of postprocessing for foot skating removal, and reduce the computational requirements in comparison to traditional motion graphs. Our contributions are threefold. First, we show that choosing transitions based on relevant features significantly reduces graph construction time and leads to improved search performances. Second, we employ a fast channel search method that confines the motion graph search to a free channel with guaranteed clearance among obstacles, achieving faster and improved results that avoid expensive collision checking. Lastly, we present a motion deformation model based on Inverse Kinematics applied over the transitions of a solution branch. Each transition is assigned a continuous deformation range that does not exceed the original transition cost threshold specified by the user for the graph construction. The obtained deformation improves the reachability of the feature-based motion graph and in turn also reduces the time spent during search. The results obtained by the proposed methods are evaluated and quantified, and they demonstrate significant improvements in comparison to traditional motion graph techniques.
ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS
Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache
2016-01-01
In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.
Graph Theory. 2. Vertex Descriptors and Graph Coloring
Directory of Open Access Journals (Sweden)
Lorentz JÄNTSCHI
2002-12-01
Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.
On an edge partition and root graphs of some classes of line graphs
Directory of Open Access Journals (Sweden)
K Pravas
2017-04-01
Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.
Morais, Jorge E; Garrido, Nuno D; Marques, Mário C; Silva, António J; Marinho, Daniel A; Barbosa, Tiago M
2013-12-18
(i) gender; (ii) performance and; (iii) gender versus performance interactions in young swimmers' anthropometric, kinematic and energetic variables. One hundred and thirty six young swimmers (62 boys: 12.76 ± 0.72 years old at Tanner stages 1-2 by self-evaluation; and 64 girls: 11.89 ± 0.93 years old at Tanner stages 1-2 by self-evaluation) were evaluated. Performance, anthropometrics, kinematics and energetic variables were selected. There was a non-significant gender effect on performance, body mass, height, arm span, trunk transverse surface area, stroke length, speed fluctuation, swimming velocity, propulsive efficiency, stroke index and critical velocity. A significant gender effect was found for foot surface area, hand surface area and stroke frequency. A significant sports level effect was verified for all variables, except for stroke frequency, speed fluctuation and propulsive efficiency. Overall, swimmers in quartile 1 (the ones with highest sports level) had higher anthropometric dimensions, better stroke mechanics and energetics. These traits decrease consistently throughout following quartiles up to the fourth one (i.e. swimmers with the lowest sports level). There was a non-significant interaction between gender and sports level for all variables. Our main conclusions were as follows: (i) there are non-significant differences in performance, anthropometrics, kinematics and energetics between boys and girls; (ii) swimmers with best performance are taller, have higher surface areas and better stroke mechanics; (iii) there are non-significant interactions between sports level and gender for anthropometrics, kinematics and energetics.
Effect of Heart Rate Variability Biofeedback on Sport Performance, a Systematic Review.
Jiménez Morgan, Sergio; Molina Mora, José Arturo
2017-09-01
Aim is to determine if the training with heart rate variability biofeedback allows to improve performance in athletes of different disciplines. Methods such as database search on Web of Science, SpringerLink, EBSCO Academic Search Complete, SPORTDiscus, Pubmed/Medline, and PROQUEST Academic Research Library, as well as manual reference registration. The eligibility criteria were: (a) published scientific articles; (b) experimental studies, quasi-experimental, or case reports; (c) use of HRV BFB as main treatment; (d) sport performance as dependent variable; (e) studies published until October 2016; (f) studies published in English, Spanish, French or Portuguese. The guidelines of the PRISMA statement were followed. Out of the 451 records found, seven items were included. All studies had a small sample size (range from 1 to 30 participants). In 85.71% of the studies (n = 6) the athletes enhanced psychophysiological variables that allowed them to improve their sport performance thanks to training with heart rate variability biofeedback. Despite the limited amount of experimental studies in the field to date, the findings suggest that heart rate variability biofeedback is an effective, safe, and easy-to-learn and apply method for both athletes and coaches in order to improve sport performance.
Continuous performance task in ADHD: Is reaction time variability a key measure?
Levy, Florence; Pipingas, Andrew; Harris, Elizabeth V; Farrow, Maree; Silberstein, Richard B
2018-01-01
To compare the use of the Continuous Performance Task (CPT) reaction time variability (intraindividual variability or standard deviation of reaction time), as a measure of vigilance in attention-deficit hyperactivity disorder (ADHD), and stimulant medication response, utilizing a simple CPT X-task vs an A-X-task. Comparative analyses of two separate X-task vs A-X-task data sets, and subgroup analyses of performance on and off medication were conducted. The CPT X-task reaction time variability had a direct relationship to ADHD clinician severity ratings, unlike the CPT A-X-task. Variability in X-task performance was reduced by medication compared with the children's unmedicated performance, but this effect did not reach significance. When the coefficient of variation was applied, severity measures and medication response were significant for the X-task, but not for the A-X-task. The CPT-X-task is a useful clinical screening test for ADHD and medication response. In particular, reaction time variability is related to default mode interference. The A-X-task is less useful in this regard.
Parallel Algorithm for Incremental Betweenness Centrality on Large Graphs
Jamour, Fuad Tarek; Skiadopoulos, Spiros; Kalnis, Panos
2017-01-01
: they either require excessive memory (i.e., quadratic to the size of the input graph) or perform unnecessary computations rendering them prohibitively slow. We propose iCentral; a novel incremental algorithm for computing betweenness centrality in evolving
Faucet: streaming de novo assembly graph construction.
Rozov, Roye; Goldshlager, Gil; Halperin, Eran; Shamir, Ron
2018-01-01
We present Faucet, a two-pass streaming algorithm for assembly graph construction. Faucet builds an assembly graph incrementally as each read is processed. Thus, reads need not be stored locally, as they can be processed while downloading data and then discarded. We demonstrate this functionality by performing streaming graph assembly of publicly available data, and observe that the ratio of disk use to raw data size decreases as coverage is increased. Faucet pairs the de Bruijn graph obtained from the reads with additional meta-data derived from them. We show these metadata-coverage counts collected at junction k-mers and connections bridging between junction pairs-contain most salient information needed for assembly, and demonstrate they enable cleaning of metagenome assembly graphs, greatly improving contiguity while maintaining accuracy. We compared Fauceted resource use and assembly quality to state of the art metagenome assemblers, as well as leading resource-efficient genome assemblers. Faucet used orders of magnitude less time and disk space than the specialized metagenome assemblers MetaSPAdes and Megahit, while also improving on their memory use; this broadly matched performance of other assemblers optimizing resource efficiency-namely, Minia and LightAssembler. However, on metagenomes tested, Faucet,o outputs had 14-110% higher mean NGA50 lengths compared with Minia, and 2- to 11-fold higher mean NGA50 lengths compared with LightAssembler, the only other streaming assembler available. Faucet is available at https://github.com/Shamir-Lab/Faucet. rshamir@tau.ac.il or eranhalperin@gmail.com. Supplementary data are available at Bioinformatics online. © The Author 2017. Published by Oxford University Press.
The planar cubic Cayley graphs
Georgakopoulos, Agelos
2018-01-01
The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Nested Dynamic Condition Response Graphs
DEFF Research Database (Denmark)
Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs
2012-01-01
We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...
Bell inequalities for graph states
International Nuclear Information System (INIS)
Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.
2005-01-01
Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)
Graph Sampling for Covariance Estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2017-01-01
specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non
Network reconstruction via graph blending
Estrada, Rolando
2016-05-01
Graphs estimated from empirical data are often noisy and incomplete due to the difficulty of faithfully observing all the components (nodes and edges) of the true graph. This problem is particularly acute for large networks where the number of components may far exceed available surveillance capabilities. Errors in the observed graph can render subsequent analyses invalid, so it is vital to develop robust methods that can minimize these observational errors. Errors in the observed graph may include missing and spurious components, as well fused (multiple nodes are merged into one) and split (a single node is misinterpreted as many) nodes. Traditional graph reconstruction methods are only able to identify missing or spurious components (primarily edges, and to a lesser degree nodes), so we developed a novel graph blending framework that allows us to cast the full estimation problem as a simple edge addition/deletion problem. Armed with this framework, we systematically investigate the viability of various topological graph features, such as the degree distribution or the clustering coefficients, and existing graph reconstruction methods for tackling the full estimation problem. Our experimental results suggest that incorporating any topological feature as a source of information actually hinders reconstruction accuracy. We provide a theoretical analysis of this phenomenon and suggest several avenues for improving this estimation problem.
A cluster algorithm for graphs
S. van Dongen
2000-01-01
textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)
Planar graphs theory and algorithms
Nishizeki, T
1988-01-01
Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.
Quantum chaos on discrete graphs
International Nuclear Information System (INIS)
Smilansky, Uzy
2007-01-01
Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)
RJSplot: Interactive Graphs with R.
Barrios, David; Prieto, Carlos
2018-03-01
Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.
Intake plenum volume and its influence on the engine performance, cyclic variability and emissions
International Nuclear Information System (INIS)
Ceviz, M.A.
2007-01-01
Intake manifold connects the intake system to the intake valve of the engine and through which air or air-fuel mixture is drawn into the cylinder. Details of the flow in intake manifolds are extremely complex. Recently, most of engine companies are focused on variable intake manifold technology due to their improvement on engine performance. This paper investigates the effects of intake plenum volume variation on engine performance and emissions to constitute a base study for variable intake plenum. Brake and indicated engine performance characteristics, coefficient of variation in indicated mean effective pressure (COV imep ) as an indicator for cyclic variability, pulsating flow pressure in the intake manifold runner, and CO, CO 2 and HC emissions were taken into consideration to evaluate the effects of different plenum volumes. The results of this study showed that the variation in the plenum volume causes an improvement on the engine performance and the pollutant emissions. The brake torque and related performance characteristics improved pronouncedly about between 1700 and 2600 rpm by increasing plenum volume. Additionally, although the increase in the plenum volume caused the mixture leaner due to the increase in the intake runner pressure and lean mixtures inclined to increase the cyclic variability, a decrease was interestingly observed in the COV imep
Text categorization of biomedical data sets using graph kernels and a controlled vocabulary.
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.
Two-setting Bell inequalities for graph states
International Nuclear Information System (INIS)
Toth, Geza; Guehne, Otfried; Briegel, Hans J.
2006-01-01
We present Bell inequalities for graph states with a high violation of local realism. In particular, we show that there is a basic Bell inequality for every nontrivial graph state which is violated by the state at least by a factor of 2. This inequality needs the measurement of, at most, two operators for each qubit and involves only some of the qubits. We also show that for some families of graph states composite Bell inequalities can be constructed such that the violation of local realism increases exponentially with the number of qubits. We prove that some of our inequalities are facets of the convex polytope containing the many-body correlations consistent with local hidden variable models. Our Bell inequalities are built from stabilizing operators of graph states
International Nuclear Information System (INIS)
Lee, Changwook; Oh, Hyung-Ung; Kim, Taegyu
2014-01-01
All Louver was typically representative as the thermal control device. The louver was not suitable to be applied to small satellite, because it has the disadvantage of increase in weight and volume. So MEMS-based variable radiator was developed to support the disadvantage of the louver MEMS-based variable emissivity radiator was designed for satellite thermal control. Because of its immediate response and low power consumption. Also MEMS- based variable emissivity radiator has been made smaller by using MEMS process, it could be solved the problem of the increase in weight and volume, and it has a high reliability and immediate response by using electrical control. In this study, operation validation of the MEMS radiator had been carried out, resulting that emissivity could be controlled. Numerical model was also designed to predict the thermal control performance of MEMS-based variable emissivity radiator
On characterizing terrain visibility graphs
Directory of Open Access Journals (Sweden)
William Evans
2015-06-01
Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.
Directory of Open Access Journals (Sweden)
Jorge Estrela Morais
2014-09-01
Full Text Available The main purpose of this study was to follow-up the intra- and inter-individual variability of young swimmers' performance and determinant factors over two competitive seasons. Thirty young swimmers (14 boys: 12.33±0.65 years-old; 16 girls: 11.15±0.55 years-old were followed-up throughout two consecutive seasons (seven evaluation moments. Performance (100m freestyle, anthropometric, kinematic, hydrodynamic and efficiency features were evaluated. A gender and skill-level effect was observed. Boys improved in a higher amount (% comparing to girls. Overall, swimmers in skill-level 2 (both genders presented a higher intra-individual variability. Performance and anthropometrics showed a significant inter-individual variability in most moments, but hydrodynamics, kinematics and efficiency did not. Within each skill-level hydrodynamics, kinematics and efficiency were the variables that showed a high inter-individual variability. As a gender and skill-level effect was noticed in an age-group of young swimmers, coaches and practitioners should put the focus in specific and customized training plans for each skill-level of swimmers.
Effects of Variable Resistance Using Chains on Bench Throw Performance in Trained Rugby Players.
Godwin, Mark S; Fernandes, John F T; Twist, Craig
2018-04-01
Godwin, MS, Fernandes, JFT, and Twist, C. Effects of variable resistance using chains on bench throw performance in trained rugby players. J Strength Cond Res 32(4): 950-954, 2018-This study sought to determine the effects of variable resistance using chain resistance on bench throw performance. Eight male rugby union players (19.4 ± 2.3 years, 88.8 ± 6.0 kg, 1RM 105.6 ± 17.0 kg) were recruited from a national league team. In a randomized crossover design, participant's performed 3 bench throws at 45% one repetition maximum (1RM) at a constant load (no chains) or a variable load (30% 1RM constant load and 15% 1RM variable load; chains) with 7 days between conditions. For each repetition, the peak and mean velocity, peak power, peak acceleration, and time to peak velocity were recorded. Differences in peak and mean power were very likely trivial and unclear between the chain and no chain conditions, respectively. Possibly greater peak and likely greater mean bar velocity were accompanied by likely to most likely greater bar velocity between 50 and 400 ms from initiation of bench press in the chain condition compared with the no chain condition. Accordingly, bar acceleration was very likely greater in the chain condition compared with the no chain condition. In conclusion, these results show that the inclusion of chain resistance can acutely enhance several variables in the bench press throw and gives support to this type of training.
Application-Specific Graph Sampling for Frequent Subgraph Mining and Community Detection
Energy Technology Data Exchange (ETDEWEB)
Purohit, Sumit; Choudhury, Sutanay; Holder, Lawrence B.
2017-12-11
Graph mining is an important data analysis methodology, but struggles as the input graph size increases. The scalability and usability challenges posed by such large graphs make it imperative to sample the input graph and reduce its size. The critical challenge in sampling is to identify the appropriate algorithm to insure the resulting analysis does not suffer heavily from the data reduction. Predicting the expected performance degradation for a given graph and sampling algorithm is also useful. In this paper, we present different sampling approaches for graph mining applications such as Frequent Subgrpah Mining (FSM), and Community Detection (CD). We explore graph metrics such as PageRank, Triangles, and Diversity to sample a graph and conclude that for heterogeneous graphs Triangles and Diversity perform better than degree based metrics. We also present two new sampling variations for targeted graph mining applications. We present empirical results to show that knowledge of the target application, along with input graph properties can be used to select the best sampling algorithm. We also conclude that performance degradation is an abrupt, rather than gradual phenomena, as the sample size decreases. We present the empirical results to show that the performance degradation follows a logistic function.
CORECLUSTER: A Degeneracy Based Graph Clustering Framework
Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis
2014-01-01
International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...
The effect of macroeconomic variables on non performance financing of Islamic Banks in Indonesia
Directory of Open Access Journals (Sweden)
Latifah Dian Iriani
2015-10-01
Full Text Available This research is going to discuss about the determinant macro variables and bank’s behavior determinant credit risk on Islamic rural bank in Indonesia. It could be seen on macro variables such as inflation, exchange rate, Jakarta I slamic index (JII and money supply (M2, and bank’s behavior such as financing. Research methodology used at this study is Vector Error Correction Model (VECM. Following these procedures, it applies Unit Roots Test, Augmented Dickey Fuller Test, Lag Length Criteria Test, Correlation Matrix – Johansen Julius Co-integration Test, VECM Estimation, Impulse Response and Variance Decomposition Test. The result show that both bank behaviors and macroeconomic variables are significant affecting non-performing financing (NPF. The banking need more careful to manage internal and external factors that influence non-performing financing (NPF.
MacDonald, Stuart W S; Hultsch, David F; Dixon, Roger A
2003-09-01
Performance variability across repeated task administrations may be an important indicator of age-related cognitive functioning. In the present investigation, the authors examined whether age differences and change in inconsistency were related to 6-year (3 occasion) cognitive change. Inconsistency scores were computed from 4 reaction time tasks performed by 446 older adults (54-89 years). Replicating previous cross-sectional results, greater inconsistency was observed for older participants even after controlling for differences in response speed. New longitudinal results demonstrated (a) associations between inconsistency at baseline measurement and 6-year change in cognitive performance; (b) longitudinal change in inconsistency; and (c) intraindividual covariation between 6-year change in inconsistency and 6-year change in level of cognitive function. These findings support the view that performance variability serves as a marker of cognitive aging.
Performance Analysis of an Optical CDMA MAC Protocol With Variable-Size Sliding Window
Mohamed, Mohamed Aly A.; Shalaby, Hossam M. H.; Abdel-Moety El-Badawy, El-Sayed
2006-10-01
A media access control protocol for optical code-division multiple-access packet networks with variable length data traffic is proposed. This protocol exhibits a sliding window with variable size. A model for interference-level fluctuation and an accurate analysis for channel usage are presented. Both multiple-access interference (MAI) and photodetector's shot noise are considered. Both chip-level and correlation receivers are adopted. The system performance is evaluated using a traditional average system throughput and average delay. Finally, in order to enhance the overall performance, error control codes (ECCs) are applied. The results indicate that the performance can be enhanced to reach its peak using the ECC with an optimum number of correctable errors. Furthermore, chip-level receivers are shown to give much higher performance than that of correlation receivers. Also, it has been shown that MAI is the main source of signal degradation.
Boat, Ruth; Taylor, Ian M
2015-06-01
The study explored patterns of change in a number of potentially performance-related variables (i.e., fatigue, social support, self-efficacy, autonomous motivation, mental skills) during the lead-up to a competitive triathlon, and whether these patterns of change differed for relatively superior versus inferior performers. Forty-two triathletes completed an inventory measuring the study variables every other day during a 2-week period leading up to competition. Performance was assessed using participants' race time, and using a self-referenced relative score compared with personal best times. Multilevel growth curve analyses revealed significant differences in growth trajectories over the 2-week period in mental skills use, social support, and fatigue. The results provide novel insight into how athletes' fluctuating psychological state in the 2 weeks before competition may be crucial in determining performance.
Reactome graph database: Efficient access to complex pathway data.
Directory of Open Access Journals (Sweden)
Antonio Fabregat
2018-01-01
Full Text Available Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j as well as the new ContentService (REST API that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types.
Reactome graph database: Efficient access to complex pathway data
Korninger, Florian; Viteri, Guilherme; Marin-Garcia, Pablo; Ping, Peipei; Wu, Guanming; Stein, Lincoln; D’Eustachio, Peter
2018-01-01
Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j) as well as the new ContentService (REST API) that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types. PMID:29377902
Reactome graph database: Efficient access to complex pathway data.
Fabregat, Antonio; Korninger, Florian; Viteri, Guilherme; Sidiropoulos, Konstantinos; Marin-Garcia, Pablo; Ping, Peipei; Wu, Guanming; Stein, Lincoln; D'Eustachio, Peter; Hermjakob, Henning
2018-01-01
Reactome is a free, open-source, open-data, curated and peer-reviewed knowledgebase of biomolecular pathways. One of its main priorities is to provide easy and efficient access to its high quality curated data. At present, biological pathway databases typically store their contents in relational databases. This limits access efficiency because there are performance issues associated with queries traversing highly interconnected data. The same data in a graph database can be queried more efficiently. Here we present the rationale behind the adoption of a graph database (Neo4j) as well as the new ContentService (REST API) that provides access to these data. The Neo4j graph database and its query language, Cypher, provide efficient access to the complex Reactome data model, facilitating easy traversal and knowledge discovery. The adoption of this technology greatly improved query efficiency, reducing the average query time by 93%. The web service built on top of the graph database provides programmatic access to Reactome data by object oriented queries, but also supports more complex queries that take advantage of the new underlying graph-based data storage. By adopting graph database technology we are providing a high performance pathway data resource to the community. The Reactome graph database use case shows the power of NoSQL database engines for complex biological data types.
Modeling flow and transport in fracture networks using graphs
Karra, S.; O'Malley, D.; Hyman, J. D.; Viswanathan, H. S.; Srinivasan, G.
2018-03-01
Fractures form the main pathways for flow in the subsurface within low-permeability rock. For this reason, accurately predicting flow and transport in fractured systems is vital for improving the performance of subsurface applications. Fracture sizes in these systems can range from millimeters to kilometers. Although modeling flow and transport using the discrete fracture network (DFN) approach is known to be more accurate due to incorporation of the detailed fracture network structure over continuum-based methods, capturing the flow and transport in such a wide range of scales is still computationally intractable. Furthermore, if one has to quantify uncertainty, hundreds of realizations of these DFN models have to be run. To reduce the computational burden, we solve flow and transport on a graph representation of a DFN. We study the accuracy of the graph approach by comparing breakthrough times and tracer particle statistical data between the graph-based and the high-fidelity DFN approaches, for fracture networks with varying number of fractures and degree of heterogeneity. Due to our recent developments in capabilities to perform DFN high-fidelity simulations on fracture networks with large number of fractures, we are in a unique position to perform such a comparison. We show that the graph approach shows a consistent bias with up to an order of magnitude slower breakthrough when compared to the DFN approach. We show that this is due to graph algorithm's underprediction of the pressure gradients across intersections on a given fracture, leading to slower tracer particle speeds between intersections and longer travel times. We present a bias correction methodology to the graph algorithm that reduces the discrepancy between the DFN and graph predictions. We show that with this bias correction, the graph algorithm predictions significantly improve and the results are very accurate. The good accuracy and the low computational cost, with O (104) times lower times than
BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.
Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter
2013-02-01
Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of
Luursema, J.M.; Rovers, Maroeska M.; Groenier, Marleen; van Goor, Harry
2014-01-01
Objective Virtual reality simulators are increasingly used in laparoscopy training. Such simulators allow objective assessment of performance. However, both low-level variables and overall scores generated by the simulator can be hard to interpret. We present a method to generate intermediate
Luursema, J.M.; Rovers, M.M.; Groenier, M.; Goor, H. van
2014-01-01
OBJECTIVE: Virtual reality simulators are increasingly used in laparoscopy training. Such simulators allow objective assessment of performance. However, both low-level variables and overall scores generated by the simulator can be hard to interpret. We present a method to generate intermediate
The Variable and Changing Status of Performance Art Relics and Artifacts in Museum Collections
DEFF Research Database (Denmark)
Cone, Louise
2017-01-01
The status of an artwork in a museum collection is variable and contingent upon factors and parameters that are specific not only to the logic of the museum world but also to factors extrinsic to the museum. In particular older performance art 'relics' are subject to contextual interpretations...
Evers, W.J.; Besselink, I.G.M.; Teerhuis, A.P.; Nijmeijer, H.
2011-01-01
There is a need to further improve driver comfort in commercial vehicles. The variable geometry active suspension offers an interesting option to achieve this in an energy efficient way. However, the optimal control strategy and the overal performance potential remains unclear. The aim of this paper
Long-term and within-day variability of working memory performance and EEG in individuals.
Gevins, Alan; McEvoy, Linda K; Smith, Michael E; Chan, Cynthia S; Sam-Vargas, Lita; Baum, Cliff; Ilan, Aaron B
2012-07-01
Assess individual-subject long-term and within-day variability of a combined behavioral and EEG test of working memory. EEGs were recorded from 16 adults performing n-back working memory tasks, with 10 tested in morning and afternoon sessions over several years. Participants were also tested after ingesting non-prescription medications or recreational substances. Performance and EEG measures were analyzed to derive an Overall score and three constituent sub-scores characterizing changes in performance, cortical activation, and alertness from each individual's baseline. Long-term and within-day variability were determined for each score; medication effects were assessed by reference to each individual's normal day-to-day variability. Over the several year period, the mean Overall score and sub-scores were approximately zero with standard deviations less than one. Overall scores were lower and their variability higher in afternoon relative to morning sessions. At the group level, alcohol, diphenhydramine and marijuana produced significant effects, but there were large individual differences. Objective working memory measures incorporating performance and EEG are stable over time and sensitive at the level of individual subjects to interventions that affect neurocognitive function. With further research these measures may be suitable for use in individualized medical care by providing a sensitive assessment of incipient illness and response to treatment. Published by Elsevier Ireland Ltd.
Predicting Eight Grade Students' Equation Solving Performances via Concepts of Variable and Equality
Ertekin, Erhan
2017-01-01
This study focused on how two algebraic concepts- equality and variable- predicted 8th grade students' equation solving performance. In this study, predictive design as a correlational research design was used. Randomly selected 407 eight-grade students who were from the central districts of a city in the central region of Turkey participated in…
DEFF Research Database (Denmark)
Haglind, Fredrik
2011-01-01
The part-load performance of combined cycles intended for naval use is of great importance, and it is influenced by the gas turbine configuration and load control strategy. This paper is aimed at quantifying the effects of variable geometry gas turbines on the part-load efficiency for combined...... cycles used for ship propulsion. Moreover, the paper is aimed at developing methodologies and deriving models for part-load simulations suitable for energy system analysis of various components within combined cycle power plants. Two different gas turbine configurations are studied, a two-shaft aero......-derivative configuration and a single-shaft industrial configuration. The results suggest that by the use of variable geometry gas turbines, the combined cycle part-load performance can be improved. In order to minimise the voyage fuel consumption, a combined cycle featuring two-shaft gas turbines with VAN control...
DEFF Research Database (Denmark)
Haglind, Fredrik
2010-01-01
The part-load performance of gas and steam turbine combined cycles intended for naval use is of great importance, and it is influenced by the gas turbine configuration and load control strategy. This paper is aimed at quantifying the effects of variable geometry on the gas turbine part...... of various components within gas turbines. Two different gas turbine configurations are studied, a two-shaft aero-derivative configuration and a single-shaft industrial configuration. When both gas turbine configurations are running in part-load using fuel flow control, the results indicate better part......-load performance for the two-shaft gas turbine. Reducing the load this way is accompanied by a much larger decrease in exhaust gas temperature for the single-shaft gas turbine than for the two-shaft configuration. As used here, the results suggest that variable geometry generally deteriorates the gas turbine part...
2013-01-01
Objectives. Intraindividual variability (IIV) is negatively associated with cognitive test performance and is positively associated with age and some neurological disorders. We aimed to extend these findings to a real-world task, flight simulator performance. We hypothesized that IIV predicts poorer initial flight performance and increased rate of decline in performance among middle-aged and older pilots. Method. Two-hundred and thirty-six pilots (40–69 years) completed annual assessments comprising a cognitive battery and two 75-min simulated flights in a flight simulator. Basic and complex IIV composite variables were created from measures of basic reaction time and shifting and divided attention tasks. Flight simulator performance was characterized by an overall summary score and scores on communication, emergencies, approach, and traffic avoidance components. Results. Although basic IIV did not predict rate of decline in flight performance, it had a negative association with initial performance for most flight measures. After taking into account processing speed, basic IIV explained an additional 8%–12% of the negative age effect on initial flight performance. Discussion. IIV plays an important role in real-world tasks and is another aspect of cognition that underlies age-related differences in cognitive performance. PMID:23052365
Kennedy, Quinn; Taylor, Joy; Heraldez, Daniel; Noda, Art; Lazzeroni, Laura C; Yesavage, Jerome
2013-07-01
Intraindividual variability (IIV) is negatively associated with cognitive test performance and is positively associated with age and some neurological disorders. We aimed to extend these findings to a real-world task, flight simulator performance. We hypothesized that IIV predicts poorer initial flight performance and increased rate of decline in performance among middle-aged and older pilots. Two-hundred and thirty-six pilots (40-69 years) completed annual assessments comprising a cognitive battery and two 75-min simulated flights in a flight simulator. Basic and complex IIV composite variables were created from measures of basic reaction time and shifting and divided attention tasks. Flight simulator performance was characterized by an overall summary score and scores on communication, emergencies, approach, and traffic avoidance components. Although basic IIV did not predict rate of decline in flight performance, it had a negative association with initial performance for most flight measures. After taking into account processing speed, basic IIV explained an additional 8%-12% of the negative age effect on initial flight performance. IIV plays an important role in real-world tasks and is another aspect of cognition that underlies age-related differences in cognitive performance.
Yu, Qingbao; Du, Yuhui; Chen, Jiayu; He, Hao; Sui, Jing; Pearlson, Godfrey; Calhoun, Vince D
2017-11-01
A key challenge in building a brain graph using fMRI data is how to define the nodes. Spatial brain components estimated by independent components analysis (ICA) and regions of interest (ROIs) determined by brain atlas are two popular methods to define nodes in brain graphs. It is difficult to evaluate which method is better in real fMRI data. Here we perform a simulation study and evaluate the accuracies of a few graph metrics in graphs with nodes of ICA components, ROIs, or modified ROIs in four simulation scenarios. Graph measures with ICA nodes are more accurate than graphs with ROI nodes in all cases. Graph measures with modified ROI nodes are modulated by artifacts. The correlations of graph metrics across subjects between graphs with ICA nodes and ground truth are higher than the correlations between graphs with ROI nodes and ground truth in scenarios with large overlapped spatial sources. Moreover, moving the location of ROIs would largely decrease the correlations in all scenarios. Evaluating graphs with different nodes is promising in simulated data rather than real data because different scenarios can be simulated and measures of different graphs can be compared with a known ground truth. Since ROIs defined using brain atlas may not correspond well to real functional boundaries, overall findings of this work suggest that it is more appropriate to define nodes using data-driven ICA than ROI approaches in real fMRI data. Copyright © 2017 Elsevier B.V. All rights reserved.
Hierarchy of modular graph identities
International Nuclear Information System (INIS)
D’Hoker, Eric; Kaidi, Justin
2016-01-01
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
Semantic graphs and associative memories
Pomi, Andrés; Mizraji, Eduardo
2004-12-01
Graphs have been increasingly utilized in the characterization of complex networks from diverse origins, including different kinds of semantic networks. Human memories are associative and are known to support complex semantic nets; these nets are represented by graphs. However, it is not known how the brain can sustain these semantic graphs. The vision of cognitive brain activities, shown by modern functional imaging techniques, assigns renewed value to classical distributed associative memory models. Here we show that these neural network models, also known as correlation matrix memories, naturally support a graph representation of the stored semantic structure. We demonstrate that the adjacency matrix of this graph of associations is just the memory coded with the standard basis of the concept vector space, and that the spectrum of the graph is a code invariant of the memory. As long as the assumptions of the model remain valid this result provides a practical method to predict and modify the evolution of the cognitive dynamics. Also, it could provide us with a way to comprehend how individual brains that map the external reality, almost surely with different particular vector representations, are nevertheless able to communicate and share a common knowledge of the world. We finish presenting adaptive association graphs, an extension of the model that makes use of the tensor product, which provides a solution to the known problem of branching in semantic nets.
Hierarchy of modular graph identities
Energy Technology Data Exchange (ETDEWEB)
D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)
2016-11-09
The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.
On the number of subgraphs of the Barabasi-Albert random graph
Energy Technology Data Exchange (ETDEWEB)
Ryabchenko, Aleksandr A; Samosvat, Egor A [Moscow Institute of Physics and Technology (State University), Dolgoprudnyi, Moscow Region, Russian Frderation (Russian Federation)
2012-06-30
We study a model of a random graph of the type of the Barabasi-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.
On the number of subgraphs of the Barabási-Albert random graph
International Nuclear Information System (INIS)
Ryabchenko, Aleksandr A; Samosvat, Egor A
2012-01-01
We study a model of a random graph of the type of the Barabási-Albert preferential attachment model. We develop a technique that makes it possible to estimate the mathematical expectation for a fairly wide class of random variables in the model under consideration. We use this technique to prove a theorem on the asymptotics of the mathematical expectation of the number of subgraphs isomorphic to a certain fixed graph in the random graphs of this model.
Strong influence of variable treatment on the performance of numerically defined ecological regions.
Snelder, Ton; Lehmann, Anthony; Lamouroux, Nicolas; Leathwick, John; Allenbach, Karin
2009-10-01
Numerical clustering has frequently been used to define hierarchically organized ecological regionalizations, but there has been little robust evaluation of their performance (i.e., the degree to which regions discriminate areas with similar ecological character). In this study we investigated the effect of the weighting and treatment of input variables on the performance of regionalizations defined by agglomerative clustering across a range of hierarchical levels. For this purpose, we developed three ecological regionalizations of Switzerland of increasing complexity using agglomerative clustering. Environmental data for our analysis were drawn from a 400 m grid and consisted of estimates of 11 environmental variables for each grid cell describing climate, topography and lithology. Regionalization 1 was defined from the environmental variables which were given equal weights. We used the same variables in Regionalization 2 but weighted and transformed them on the basis of a dissimilarity model that was fitted to land cover composition data derived for a random sample of cells from interpretation of aerial photographs. Regionalization 3 was a further two-stage development of Regionalization 2 where specific classifications, also weighted and transformed using dissimilarity models, were applied to 25 small scale "sub-domains" defined by Regionalization 2. Performance was assessed in terms of the discrimination of land cover composition for an independent set of sites using classification strength (CS), which measured the similarity of land cover composition within classes and the dissimilarity between classes. Regionalization 2 performed significantly better than Regionalization 1, but the largest gains in performance, compared to Regionalization 1, occurred at coarse hierarchical levels (i.e., CS did not increase significantly beyond the 25-region level). Regionalization 3 performed better than Regionalization 2 beyond the 25-region level and CS values continued to
Hybrid Motion Graphs for Character Animation
Kalouache Saida; Cherif Foudil
2016-01-01
Many works in the literature have improved the performance of motion graphs for synthesis the humanlike results in limited domains that necessity few constraints like dance, navigation in small game like environments or in games by the gesture of feedback on a snowboard tutorial. The humanlike cannot exist in an environment without interacting with the world surrounding them; the naturalness of the entire motion extremely depends on the animation of the walking character, the chosen path and ...
What Does Eye-Blink Rate Variability Dynamics Tell Us About Cognitive Performance?
Directory of Open Access Journals (Sweden)
Rafal Paprocki
2017-12-01
Full Text Available Cognitive performance is defined as the ability to utilize knowledge, attention, memory, and working memory. In this study, we briefly discuss various markers that have been proposed to predict cognitive performance. Next, we develop a novel approach to characterize cognitive performance by analyzing eye-blink rate variability dynamics. Our findings are based on a sample of 24 subjects. The subjects were given a 5-min resting period prior to a 10-min IQ test. During both stages, eye blinks were recorded from Fp1 and Fp2 electrodes. We found that scale exponents estimated for blink rate variability during rest were correlated with subjects' performance on the subsequent IQ test. This surprising phenomenon could be explained by the person to person variation in concentrations of dopamine in PFC and accumulation of GABA in the visual cortex, as both neurotransmitters play a key role in cognitive processes and affect blinking. This study demonstrates the possibility that blink rate variability dynamics at rest carry information about cognitive performance and can be employed in the assessment of cognitive abilities without taking a test.
Relationship between different push-off variables and start performance in experienced swimmers.
García-Ramos, Amador; Feriche, Belén; de la Fuente, Blanca; Argüelles-Cienfuegos, Javier; Strojnik, Vojko; Strumbelj, Boro; Štirn, Igor
2015-01-01
The objective of this study was to determine the relationship between different variables measured with a force plate during the swimming start push-off phase and start performance presented by times to 5, 10 and 15 m. Twenty-one women from the Slovenian national swimming team performed two different swim starts (freestyle and undulatory) on a portable force plate to a distance further than 15 m. Correlations between push-off variables and times to 5, 10 and 15 m were quantified through Pearson's product-moment correlation coefficient (r). The variables that significantly correlated (p .05). Based on the results of this study, we can conclude that horizontal take-off velocity and average horizontal acceleration (calculated as the average horizontal force divided by swimmer's body mass) are the variables most related to swimming start performance in experienced swimmers, and therefore could be the preferred measures to monitor swimmers' efficiency during the push-off phase.
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael I.
2011-01-01
of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...
Rabern, Landon
2007-01-01
We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...
Graphs with Eulerian unit spheres
Knill, Oliver
2015-01-01
d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...
WEATHE- RELATED VARIABILITY OF CALORIMETERY PERFORMANCE IN A POORLY-CONTROLLED ENVIRONMENT
International Nuclear Information System (INIS)
CAMERON, M.A.
2007-01-01
Four Antech airbath calorimeters at the Hanford site were studied for three summers and two winters in a location not well-shielded from outside temperature changes. All calorimeters showed significant increases in variability of standard measurements during hot weather. The increased variability is postulated to be due to a low setting of the Peltier cold face temperature, which doesn't allow the instrument to drain heat fast enough in a hot environment. A higher setting of the Peltier cold face might lead to better performance in environments subjected to a broad range of temperatures
Damaris: Addressing performance variability in data management for post-petascale simulations
International Nuclear Information System (INIS)
Dorier, Matthieu; Antoniu, Gabriel; Cappello, Franck; Snir, Marc; Sisneros, Robert
2016-01-01
With exascale computing on the horizon, reducing performance variability in data management tasks (storage, visualization, analysis, etc.) is becoming a key challenge in sustaining high performance. Here, this variability significantly impacts the overall application performance at scale and its predictability over time. In this article, we present Damaris, a system that leverages dedicated cores in multicore nodes to offload data management tasks, including I/O, data compression, scheduling of data movements, in situ analysis, and visualization. We evaluate Damaris with the CM1 atmospheric simulation and the Nek5000 computational fluid dynamic simulation on four platforms, including NICS’s Kraken and NCSA’s Blue Waters. Our results show that (1) Damaris fully hides the I/O variability as well as all I/O-related costs, thus making simulation performance predictable; (2) it increases the sustained write throughput by a factor of up to 15 compared with standard I/O approaches; (3) it allows almost perfect scalability of the simulation up to over 9,000 cores, as opposed to state-of-the-art approaches that fail to scale; and (4) it enables a seamless connection to the VisIt visualization software to perform in situ analysis and visualization in a way that impacts neither the performance of the simulation nor its variability. In addition, we extended our implementation of Damaris to also support the use of dedicated nodes and conducted a thorough comparison of the two approaches—dedicated cores and dedicated nodes—for I/O tasks with the aforementioned applications.
GSMNet: A Hierarchical Graph Model for Moving Objects in Networks
Directory of Open Access Journals (Sweden)
Hengcai Zhang
2017-03-01
Full Text Available Existing data models for moving objects in networks are often limited by flexibly controlling the granularity of representing networks and the cost of location updates and do not encompass semantic information, such as traffic states, traffic restrictions and social relationships. In this paper, we aim to fill the gap of traditional network-constrained models and propose a hierarchical graph model called the Geo-Social-Moving model for moving objects in Networks (GSMNet that adopts four graph structures, RouteGraph, SegmentGraph, ObjectGraph and MoveGraph, to represent the underlying networks, trajectories and semantic information in an integrated manner. The bulk of user-defined data types and corresponding operators is proposed to handle moving objects and answer a new class of queries supporting three kinds of conditions: spatial, temporal and semantic information. Then, we develop a prototype system with the native graph database system Neo4Jto implement the proposed GSMNet model. In the experiment, we conduct the performance evaluation using simulated trajectories generated from the BerlinMOD (Berlin Moving Objects Database benchmark and compare with the mature MOD system Secondo. The results of 17 benchmark queries demonstrate that our proposed GSMNet model has strong potential to reduce time-consuming table join operations an d shows remarkable advantages with regard to representing semantic information and controlling the cost of location updates.
Szabó, György; Fáth, Gábor
2007-07-01
Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.
Variables associated with the performance of Centers for Dental Specialties in Brazil.
Cortellazzi, Karine Laura; Balbino, Edna Cesar; Guerra, Luciane Miranda; Vazquez, Fabiana de Lima; Bulgareli, Jaqueline Vilela; Ambrosano, Glaucia Maria Bovi; Pereira, Antonio Carlos; Mialhe, Fábio Luiz
2014-12-01
The aim of this study was to evaluate the performance of the Centers for Dental Specialties (CDS) in the country and associations with sociodemographic indicators of the municipalities, structural variables of services and primary health care organization in the years 2004-2009. The study used secondary data from procedures performed in the CDS to the specialties of periodontics, endodontics, surgery and primary care. Bivariate analysis by χ2 test was used to test the association between the dependent variable (performance of the CDS) with the independents. Then, Poisson regression analysis was performed. With regard to the overall achievement of targets, it was observed that the majority of CDS (69.25%) performance was considered poor/regular. The independent factors associated with poor/regular performance of CDS were: municipalities belonging to the Northeast, South and Southeast regions, with lower Human Development Index (HDI), lower population density, and reduced time to deployment. HDI and population density are important for the performance of the CDS in Brazil. Similarly, the peculiarities related to less populated areas as well as regional location and time of service implementation CDS should be taken into account in the planning of these services.
Meziri, B.; Hamel, M.; Hireche, O.; Hamidou, K.
2016-09-01
There are various matching ways between turbocharger and engine, the variable nozzle turbine is the most significant method. The turbine design must be economic with high efficiency and large capacity over a wide range of operational conditions. These design intents are used in order to decrease thermal load and improve thermal efficiency of the engine. This paper presents an original design method of a variable nozzle vane for mixed flow turbines developed from previous experimental and numerical studies. The new device is evaluated with a numerical simulation over a wide range of rotational speeds, pressure ratios, and different vane angles. The compressible turbulent steady flow is solved using the ANSYS CFX software. The numerical results agree well with experimental data in the nozzleless configuration. In the variable nozzle case, the results show that the turbine performance characteristics are well accepted in different open positions and improved significantly in low speed regime and at low pressure ratio.
PERSEUS-HUB: Interactive and Collective Exploration of Large-Scale Graphs
Directory of Open Access Journals (Sweden)
Di Jin
2017-07-01
Full Text Available Graphs emerge naturally in many domains, such as social science, neuroscience, transportation engineering, and more. In many cases, such graphs have millions or billions of nodes and edges, and their sizes increase daily at a fast pace. How can researchers from various domains explore large graphs interactively and efficiently to find out what is ‘important’? How can multiple researchers explore a new graph dataset collectively and “help” each other with their findings? In this article, we present Perseus-Hub, a large-scale graph mining tool that computes a set of graph properties in a distributed manner, performs ensemble, multi-view anomaly detection to highlight regions that are worth investigating, and provides users with uncluttered visualization and easy interaction with complex graph statistics. Perseus-Hub uses a Spark cluster to calculate various statistics of large-scale graphs efficiently, and aggregates the results in a summary on the master node to support interactive user exploration. In Perseus-Hub, the visualized distributions of graph statistics provide preliminary analysis to understand a graph. To perform a deeper analysis, users with little prior knowledge can leverage patterns (e.g., spikes in the power-law degree distribution marked by other users or experts. Moreover, Perseus-Hub guides users to regions of interest by highlighting anomalous nodes and helps users establish a more comprehensive understanding about the graph at hand. We demonstrate our system through the case study on real, large-scale networks.
Distributed-Memory Breadth-First Search on Massive Graphs
Energy Technology Data Exchange (ETDEWEB)
Buluc, Aydin [Lawrence Berkeley National Lab. (LBNL), Berkeley, CA (United States). Computational Research Division; Beamer, Scott [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences; Madduri, Kamesh [Pennsylvania State Univ., University Park, PA (United States). Computer Science & Engineering Dept.; Asanovic, Krste [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences; Patterson, David [Univ. of California, Berkeley, CA (United States). Dept. of Electrical Engineering and Computer Sciences
2017-09-26
This chapter studies the problem of traversing large graphs using the breadth-first search order on distributed-memory supercomputers. We consider both the traditional level-synchronous top-down algorithm as well as the recently discovered direction optimizing algorithm. We analyze the performance and scalability trade-offs in using different local data structures such as CSR and DCSC, enabling in-node multithreading, and graph decompositions such as 1D and 2D decomposition.
Kamman, J. H.; Hall, C. L.
1975-01-01
Two inlet performance tests and one inlet/airframe drag test were conducted in 1969 at the NASA-Ames Research Center. The basic inlet system was two-dimensional, three ramp (overhead), external compression, with variable capture area. The data from these tests were analyzed to show the effects of selected design variables on the performance of this type of inlet system. The inlet design variables investigated include inlet bleed, bypass, operating mass flow ratio, inlet geometry, and variable capture area.
Properly colored connectivity of graphs
Li, Xueliang; Qin, Zhongmei
2018-01-01
A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.
Graph anomalies in cyber communications
Energy Technology Data Exchange (ETDEWEB)
Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory
2011-01-11
Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.
Open Graphs and Computational Reasoning
Directory of Open Access Journals (Sweden)
Lucas Dixon
2010-06-01
Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.
Woeginger, G.J.
1998-01-01
In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).
Generating random networks and graphs
Coolen, Ton; Roberts, Ekaterina
2017-01-01
This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...
System dynamics and control with bond graph modeling
Kypuros, Javier
2013-01-01
Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...
Impulse-variability theory: implications for ballistic, multijoint motor skill performance.
Urbin, M A; Stodden, David F; Fischman, Mark G; Weimar, Wendi H
2011-01-01
Impulse-variability theory (R. A. Schmidt, H. N. Zelaznik, B. Hawkins, J. S. Frank, & J. T. Quinn, 1979) accounts for the curvilinear relationship between the magnitude and resulting variability of the muscular forces that influence the success of goal-directed limb movements. The historical roots of impulse-variability theory are reviewed in the 1st part of this article, including the relationship between movement speed and spatial error. The authors then address the relevance of impulse-variability theory for the control of ballistic, multijoint skills, such as throwing, striking, and kicking. These types of skills provide a stark contrast to the relatively simple, minimal degrees of freedom movements that characterized early research. However, the inherent demand for ballistic force generation is a strong parallel between these simple laboratory tasks and multijoint motor skills. Therefore, the authors conclude by recommending experimental procedures for evaluating the adequacy of impulse variability as a theoretical model within the context of ballistic, multijoint motor skill performance. Copyright © Taylor & Francis Group, LLC
Graph theoretical model of a sensorimotor connectome in zebrafish.
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.
Graph theoretical model of a sensorimotor connectome in zebrafish.
Directory of Open Access Journals (Sweden)
Michael Stobb
Full Text Available 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.
Mizan: Optimizing Graph Mining in Large Parallel Systems
Kalnis, Panos
2012-03-01
Extracting information from graphs, from nding shortest paths to complex graph mining, is essential for many ap- plications. Due to the shear size of modern graphs (e.g., social networks), processing must be done on large paral- lel computing infrastructures (e.g., the cloud). Earlier ap- proaches relied on the MapReduce framework, which was proved inadequate for graph algorithms. More recently, the message passing model (e.g., Pregel) has emerged. Although the Pregel model has many advantages, it is agnostic to the graph properties and the architecture of the underlying com- puting infrastructure, leading to suboptimal performance. In this paper, we propose Mizan, a layer between the users\\' code and the computing infrastructure. Mizan considers the structure of the input graph and the architecture of the in- frastructure in order to: (i) decide whether it is bene cial to generate a near-optimal partitioning of the graph in a pre- processing step, and (ii) choose between typical point-to- point message passing and a novel approach that puts com- puting nodes in a virtual overlay ring. We deployed Mizan on a small local Linux cluster, on the cloud (256 virtual machines in Amazon EC2), and on an IBM Blue Gene/P supercomputer (1024 CPUs). We show that Mizan executes common algorithms on very large graphs 1-2 orders of mag- nitude faster than MapReduce-based implementations and up to one order of magnitude faster than implementations relying on Pregel-like hash-based graph partitioning.
Energy Technology Data Exchange (ETDEWEB)
Backlund, Peter B. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Shahan, David W. [HRL Labs., LLC, Malibu, CA (United States); Seepersad, Carolyn Conner [Univ. of Texas, Austin, TX (United States)
2014-04-22
A classifier-guided sampling (CGS) method is introduced for solving engineering design optimization problems with discrete and/or continuous variables and continuous and/or discontinuous responses. The method merges concepts from metamodel-guided sampling and population-based optimization algorithms. The CGS method uses a Bayesian network classifier for predicting the performance of new designs based on a set of known observations or training points. Unlike most metamodeling techniques, however, the classifier assigns a categorical class label to a new design, rather than predicting the resulting response in continuous space, and thereby accommodates nondifferentiable and discontinuous functions of discrete or categorical variables. The CGS method uses these classifiers to guide a population-based sampling process towards combinations of discrete and/or continuous variable values with a high probability of yielding preferred performance. Accordingly, the CGS method is appropriate for discrete/discontinuous design problems that are ill-suited for conventional metamodeling techniques and too computationally expensive to be solved by population-based algorithms alone. In addition, the rates of convergence and computational properties of the CGS method are investigated when applied to a set of discrete variable optimization problems. Results show that the CGS method significantly improves the rate of convergence towards known global optima, on average, when compared to genetic algorithms.
Human θ burst stimulation enhances subsequent motor learning and increases performance variability.
Teo, James T H; Swayne, Orlando B C; Cheeran, Binith; Greenwood, Richard J; Rothwell, John C
2011-07-01
Intermittent theta burst stimulation (iTBS) transiently increases motor cortex excitability in healthy humans by a process thought to involve synaptic long-term potentiation (LTP), and this is enhanced by nicotine. Acquisition of a ballistic motor task is likewise accompanied by increased excitability and presumed intracortical LTP. Here, we test how iTBS and nicotine influences subsequent motor learning. Ten healthy subjects participated in a double-blinded placebo-controlled trial testing the effects of iTBS and nicotine. iTBS alone increased the rate of learning but this increase was blocked by nicotine. We then investigated factors other than synaptic strengthening that may play a role. Behavioral analysis and modeling suggested that iTBS increased performance variability, which correlated with learning outcome. A control experiment confirmed the increase in motor output variability by showing that iTBS increased the dispersion of involuntary transcranial magnetic stimulation-evoked thumb movements. We suggest that in addition to the effect on synaptic plasticity, iTBS may have facilitated performance by increasing motor output variability; nicotine negated this effect on variability perhaps via increasing the signal-to-noise ratio in cerebral cortex.
Evaluation of the performance of hydrological variables derived from GLDAS-2 and MERRA-2 in Mexico
Real-Rangel, R. A.; Pedrozo-Acuña, A.; Breña-Naranjo, J. A.
2017-12-01
Hydrological studies have found in data assimilation systems and global reanalysis of land surface variables (e.g soil moisture, streamflow) a wide range of applications, from drought monitoring to water balance and hydro-climatology variability assessment. Indeed, these hydrological data sources have led to an improvement in developing and testing monitoring and prediction systems in poorly gauged regions of the world. This work tests the accuracy and error of land surface variables (precipitation, soil moisture, runoff and temperature) derived from the data assimilation reanalysis products GLDAS-2 and MERRA-2. Validate the performance of these data platforms must be thoroughly evaluated in order to consider the error of hydrological variables (i.e., precipitation, soil moisture, runoff and temperature) derived from the reanalysis products. For such purpose, a quantitative assessment was performed at 2,892 climatological stations, 42 stream gauges and 44 soil moisture probes located in Mexico and across different climate regimes (hyper-arid to tropical humid). Results show comparisons between these gridded products against ground-based observational stations for 1979-2014. The results of this analysis display a spatial distribution of errors and accuracy over Mexico discussing differences between climates, enabling the informed use of these products.
Graph theory and its applications
Gross, Jonathan L
2006-01-01
Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.
Thyroid Ultrasound: Change of Inter-observer Variability and Diagnostic Performance after Training
International Nuclear Information System (INIS)
Moon, Hee Jung; Kim, Eun Kyung; Kwak, Jin Young; Park, Jeong Seon
2011-01-01
To investigate and compare inter-observer variability and diagnostic performance of thyroid ultrasound (US) between a faculty member and observing residents. From October 2007 to June 2009, 18 residents underwent training in thyroid US section. Group 1 included 8 residents that were trained for the first time and group 2 included 10 residents that were trained for the second time. US features of nodules were recorded according to the composition, echogenicity, margin, calcifications, shape, and final assessment by a faculty member and residents, respectively. Following a discussion, a faculty member performed fine needle aspiration. Then, the inter-observer variability and diagnostic performance between a faculty member and residents were investigated and compared for US. In group 1, agreement for composition in resident 1, calcification for residents 5 and 6, and shape for resident 4 were slight, moderate, moderate, and moderate, respectively. In group 2, agreement for composition in residents 1 and 10 were moderate. Substantial or greater agreement was observed more frequently in group 2 than 1. The diagnostic performances for both the faculty and residents were high and not statistically different. Agreement for US features between a faculty and residents as well as diagnostic performance were high. Moreover, diagnostic performance of residents that underwent training a second time of training was higher than residents that underwent training only once
On the Distribution of Random Geometric Graphs
DEFF Research Database (Denmark)
Badiu, Mihai Alin; Coon, Justin P.
2018-01-01
as a measure of the graph’s topological uncertainty (or information content). Moreover, the distribution is also relevant for determining average network performance or designing protocols. However, a major impediment in deducing the graph distribution is that it requires the joint probability distribution......Random geometric graphs (RGGs) are commonly used to model networked systems that depend on the underlying spatial embedding. We concern ourselves with the probability distribution of an RGG, which is crucial for studying its random topology, properties (e.g., connectedness), or Shannon entropy...... of the n(n − 1)/2 distances between n nodes randomly distributed in a bounded domain. As no such result exists in the literature, we make progress by obtaining the joint distribution of the distances between three nodes confined in a disk in R 2. This enables the calculation of the probability distribution...
A hierarchical approach to reducing communication in parallel graph algorithms
Harshvardhan,
2015-01-01
Large-scale graph computing has become critical due to the ever-increasing size of data. However, distributed graph computations are limited in their scalability and performance due to the heavy communication inherent in such computations. This is exacerbated in scale-free networks, such as social and web graphs, which contain hub vertices that have large degrees and therefore send a large number of messages over the network. Furthermore, many graph algorithms and computations send the same data to each of the neighbors of a vertex. Our proposed approach recognizes this, and reduces communication performed by the algorithm without change to user-code, through a hierarchical machine model imposed upon the input graph. The hierarchical model takes advantage of locale information of the neighboring vertices to reduce communication, both in message volume and total number of bytes sent. It is also able to better exploit the machine hierarchy to further reduce the communication costs, by aggregating traffic between different levels of the machine hierarchy. Results of an implementation in the STAPL GL shows improved scalability and performance over the traditional level-synchronous approach, with 2.5 × - 8× improvement for a variety of graph algorithms at 12, 000+ cores.
Performance of 12Ah aerospace nickel-cadmium cells of design variable groups
Vasanth, K. L.
1985-01-01
The design variable program of NASA is a systematic approach to evaluate the performance of 12Ah aerospace nickel-cadmium cells of 9 important cell designs. These cells were life cycled in a Low-Earth Orbit (LEO) regime for 3 to 4 years. Representative cells taken from the design variable groups after different cycling periods have been examined. The results show that: (1) positive swelling and carbonate content in the electrolyte increases as a function of the number of cycles, (2) electrolyte distribution follows the order NEG greater than POS greater than SEP, 3) control and no PQ groups outperformed the rest of the groups and (4) the polypropylene group shows very heavy cadmium migration and poor performance.
A faithful functor among algebras and graphs
Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)
2016-01-01
The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.
Graphs with branchwidth at most three
Bodlaender, H.L.; Thilikos, D.M.
1997-01-01
In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph
A Modal-Logic Based Graph Abstraction
Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.
2008-01-01
Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract
Graphs whose complement and square are isomorphic
DEFF Research Database (Denmark)
Pedersen, Anders Sune
2014-01-01
We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...
Acyclicity in edge-colored graphs
DEFF Research Database (Denmark)
Gutin, Gregory; Jones, Mark; Sheng, Bin
2017-01-01
A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...
Building Scalable Knowledge Graphs for Earth Science
Ramachandran, Rahul; Maskey, Manil; Gatlin, Patrick; Zhang, Jia; Duan, Xiaoyi; Miller, J. J.; Bugbee, Kaylin; Christopher, Sundar; Freitag, Brian
2017-01-01
Knowledge Graphs link key entities in a specific domain with other entities via relationships. From these relationships, researchers can query knowledge graphs for probabilistic recommendations to infer new knowledge. Scientific papers are an untapped resource which knowledge graphs could leverage to accelerate research discovery. Goal: Develop an end-to-end (semi) automated methodology for constructing Knowledge Graphs for Earth Science.
Port-Hamiltonian Systems on Open Graphs
Schaft, A.J. van der; Maschke, B.M.
2010-01-01
In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac
Constructing Dense Graphs with Unique Hamiltonian Cycles
Lynch, Mark A. M.
2012-01-01
It is not difficult to construct dense graphs containing Hamiltonian cycles, but it is difficult to generate dense graphs that are guaranteed to contain a unique Hamiltonian cycle. This article presents an algorithm for generating arbitrarily large simple graphs containing "unique" Hamiltonian cycles. These graphs can be turned into dense graphs…
Skew-adjacency matrices of graphs
Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.
2012-01-01
The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic
Chromatic polynomials of random graphs
International Nuclear Information System (INIS)
Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian
2010-01-01
Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.
Commuting graphs of matrix algebras
International Nuclear Information System (INIS)
Akbari, S.; Bidkhori, H.; Mohammadian, A.
2006-08-01
The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)
Erlandsson, Olof; Lundholm, Gunnar; Söderberg, Fredrik; Johansson, Bengt; Wong, Victor W.
1998-01-01
This paper is a direct continuation of a previous study that addressed the performance and design of a variable compression engine, the Alvar-Cycle Engine [1]. The earlier study was presented at the SAE International Conference and Exposition in Detroit during February 23- 26, 1998 as SAE paper 981027. In the present paper test results from a single cylinder prototype are reviewed and compared with a similar conventional engine. Efficiency and emissions are shown as fu...
International Nuclear Information System (INIS)
Eyler, L.L.; Elliott, M.L.; Lowery, P.S.; Lessor, D.L.
1991-01-01
Numerical and physical simulation of existing and advanced melter designs conducted to assess impacts of process and design variables on performance of ceramic melters are presented. Coupled equations of flow, thermal, and electric fields were numerically solved in time-dependent three dimensional finite volume form. Recent simulation results of a three electrode melter design with sloped walls indicate the presence of bi-modal stable flow patterns dominated by boundary conditions
Graph Quasicontinuous Functions and Densely Continuous Forms
Directory of Open Access Journals (Sweden)
Lubica Hola
2017-07-01
Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.
Variables that influence Ironman triathlon performance - what changed in the last 35 years?
Knechtle, Beat; Knechtle, Raphael; Stiefel, Michael; Zingg, Matthias Alexander; Rosemann, Thomas; Rüst, Christoph Alexander
2015-01-01
This narrative review summarizes findings for Ironman triathlon performance and intends to determine potential predictor variables for Ironman race performance in female and male triathletes. A literature search was performed in PubMed using the terms "Ironman", "triathlon", and "performance". All resulting articles were searched for related citations. Age, previous experience, sex, training, origin, anthropometric and physiological characteristics, pacing, and performance in split disciplines were predictive. Differences exist between the sexes for anthropometric characteristics. The most important predictive variables for a fast Ironman race time were age of 30-35 years (women and men), a fast personal best time in Olympic distance triathlon (women and men), a fast personal best time in marathon (women and men), high volume and high speed in training where high volume was more important than high speed (women and men), low body fat, low skin-fold thicknesses and low circumference of upper arm (only men), and origin from the United States of America (women and men). These findings may help athletes and coaches to plan an Ironman triathlon career. Age and previous experience are important to find the right point in the life of a triathlete to switch from the shorter triathlon distances to the Ironman distance. Future studies need to correlate physiological characteristics such as maximum oxygen uptake with Ironman race time to investigate their potential predictive value and to investigate socio-economic aspects in Ironman triathlon.
Aerodynamic performance investigation on waverider with variable blunt radius in hypersonic flows
Li, Shibin; Wang, Zhenguo; Huang, Wei; Xu, Shenren; Yan, Li
2017-08-01
Waverider is an important candidate for the design of hypersonic vehicles. However, the ideal waverider cannot be manufactured because of its sharp leading edge, so the leading edge should be blunted. In the paper, the HMB solver and laminar flow model have been utilized to obtain the flow field properties around the blunt waverider with the freestream Mach number being 8.0, and several novel strategies have been suggested to improve the aerodynamic performance of blunt waverider. The numerical method has been validated against experimental data, and the Stanton number(St) of the predicted result has been analyzed. The obtained results show good agreement with the experimental data. Stmax decreases by 58% and L/D decreases by 8.2% when the blunt radius increases from 0.0002 m to 0.001 m. ;Variable blunt waverider; is a good compromise for aerodynamic performance and thermal insulation. The aero-heating characteristics are very sensitive to Rmax. The position of the smallest blunt radius has a great effect on the aerodynamic performance. In addition, the type of blunt leading edge has a great effect on the aero-heating characteristics when Rmax is fixed. Therefore, out of several designs, Type 4is the best way to achieve the good overall performance. The ;Variable blunt waverider; not only improves the aerodynamic performance, but also makes the aero-heating become evenly-distributed, leading to better aero-heating characteristics.
Dim target detection method based on salient graph fusion
Hu, Ruo-lan; Shen, Yi-yan; Jiang, Jun
2018-02-01
Dim target detection is one key problem in digital image processing field. With development of multi-spectrum imaging sensor, it becomes a trend to improve the performance of dim target detection by fusing the information from different spectral images. In this paper, one dim target detection method based on salient graph fusion was proposed. In the method, Gabor filter with multi-direction and contrast filter with multi-scale were combined to construct salient graph from digital image. And then, the maximum salience fusion strategy was designed to fuse the salient graph from different spectral images. Top-hat filter was used to detect dim target from the fusion salient graph. Experimental results show that proposal method improved the probability of target detection and reduced the probability of false alarm on clutter background images.
Multiple Illuminant Colour Estimation via Statistical Inference on Factor Graphs.
Mutimbu, Lawrence; Robles-Kelly, Antonio
2016-08-31
This paper presents a method to recover a spatially varying illuminant colour estimate from scenes lit by multiple light sources. Starting with the image formation process, we formulate the illuminant recovery problem in a statistically datadriven setting. To do this, we use a factor graph defined across the scale space of the input image. In the graph, we utilise a set of illuminant prototypes computed using a data driven approach. As a result, our method delivers a pixelwise illuminant colour estimate being devoid of libraries or user input. The use of a factor graph also allows for the illuminant estimates to be recovered making use of a maximum a posteriori (MAP) inference process. Moreover, we compute the probability marginals by performing a Delaunay triangulation on our factor graph. We illustrate the utility of our method for pixelwise illuminant colour recovery on widely available datasets and compare against a number of alternatives. We also show sample colour correction results on real-world images.
Fracture and Fragmentation of Simplicial Finite Elements Meshes using Graphs
Energy Technology Data Exchange (ETDEWEB)
Mota, A; Knap, J; Ortiz, M
2006-10-18
An approach for the topological representation of simplicial finite element meshes as graphs is presented. It is shown that by using a graph, the topological changes induced by fracture reduce to a few, local kernel operations. The performance of the graph representation is demonstrated and analyzed, using as reference the 3D fracture algorithm by Pandolfi and Ortiz [22]. It is shown that the graph representation initializes in O(N{sub E}{sup 1.1}) time and fractures in O(N{sub I}{sup 1.0}) time, while the reference implementation requires O(N{sub E}{sup 2.1}) time to initialize and O(N{sub I}{sup 1.9}) time to fracture, where NE is the number of elements in the mesh and N{sub I} is the number of interfaces to fracture.
Network-based Arbitrated Quantum Signature Scheme with Graph State
Ma, Hongling; Li, Fei; Mao, Ningyi; Wang, Yijun; Guo, Ying
2017-08-01
Implementing an arbitrated quantum signature(QAS) through complex networks is an interesting cryptography technology in the literature. In this paper, we propose an arbitrated quantum signature for the multi-user-involved networks, whose topological structures are established by the encoded graph state. The determinative transmission of the shared keys, is enabled by the appropriate stabilizers performed on the graph state. The implementation of this scheme depends on the deterministic distribution of the multi-user-shared graph state on which the encoded message can be processed in signing and verifying phases. There are four parties involved, the signatory Alice, the verifier Bob, the arbitrator Trent and Dealer who assists the legal participants in the signature generation and verification. The security is guaranteed by the entanglement of the encoded graph state which is cooperatively prepared by legal participants in complex quantum networks.
Interactive Graph Layout of a Million Nodes
Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North
2016-01-01
Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...
Khovanov homology of graph-links
Energy Technology Data Exchange (ETDEWEB)
Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)
2012-08-31
Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.
Jointly-check iterative decoding algorithm for quantum sparse graph codes
International Nuclear Information System (INIS)
Jun-Hu, Shao; Bao-Ming, Bai; Wei, Lin; Lin, Zhou
2010-01-01
For quantum sparse graph codes with stabilizer formalism, the unavoidable girth-four cycles in their Tanner graphs greatly degrade the iterative decoding performance with a standard belief-propagation (BP) algorithm. In this paper, we present a jointly-check iterative algorithm suitable for decoding quantum sparse graph codes efficiently. Numerical simulations show that this modified method outperforms the standard BP algorithm with an obvious performance improvement. (general)
Critical Behavior of the Annealed Ising Model on Random Regular Graphs
Can, Van Hao
2017-11-01
In Giardinà et al. (ALEA Lat Am J Probab Math Stat 13(1):121-161, 2016), the authors have defined an annealed Ising model on random graphs and proved limit theorems for the magnetization of this model on some random graphs including random 2-regular graphs. Then in Can (Annealed limit theorems for the Ising model on random regular graphs, arXiv:1701.08639, 2017), we generalized their results to the class of all random regular graphs. In this paper, we study the critical behavior of this model. In particular, we determine the critical exponents and prove a non standard limit theorem stating that the magnetization scaled by n^{3/4} converges to a specific random variable, with n the number of vertices of random regular graphs.
Adolescent sleep disturbance and school performance: the confounding variable of socioeconomics.
Pagel, James F; Forister, Natalie; Kwiatkowki, Carol
2007-02-15
To assess how selected socioeconomic variables known to affect school performance alter the association between reported sleep disturbance and poor school performance in a contiguous middle school/high school population. A school district/college IRB approved questionnaire was distributed in science and health classes in middle school and high school. This questionnaire included a frequency scaled pediatric sleep disturbance questionnaire for completion by students and a permission and demographic questionnaire for completion by parents (completed questionnaires n = 238 with 69.3% including GPA). Sleep complaints occur at high frequency in this sample (sleep onset insomnia 60% > 1 x /wk.; 21.2% every night; sleepiness during the day (45.7% > 1 x /wk.; 15.2 % every night), and difficulty concentrating (54.6% > 1 x /wk.; 12.9% always). Students with lower grade point averages (GPAs) were more likely to have restless/aching legs when trying to fall asleep, difficulty concentrating during the day, snoring every night, difficulty waking in the morning, sleepiness during the day, and falling asleep in class. Lower reported GPAs were significantly associated with lower household incomes. After statistically controlling for income, restless legs, sleepiness during the day, and difficulty with concentration continued to significantly affect school performance. This study provides additional evidence indicating that sleep disturbances occur at high frequencies in adolescents and significantly affect daytime performance, as measured by GPA. The socioeconomic variable of household income also significantly affects GPA. After statistically controlling for age and household income, the number and type of sleep variables noted to significantly affect GPA are altered but persistent in demonstrating significant effects on school performance.
PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION
Directory of Open Access Journals (Sweden)
W. Dorner
2016-06-01
Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.
Chaotic Traversal (CHAT): Very Large Graphs Traversal Using Chaotic Dynamics
Changaival, Boonyarit; Rosalie, Martin; Danoy, Grégoire; Lavangnananda, Kittichai; Bouvry, Pascal
2017-12-01
Graph Traversal algorithms can find their applications in various fields such as routing problems, natural language processing or even database querying. The exploration can be considered as a first stepping stone into knowledge extraction from the graph which is now a popular topic. Classical solutions such as Breadth First Search (BFS) and Depth First Search (DFS) require huge amounts of memory for exploring very large graphs. In this research, we present a novel memoryless graph traversal algorithm, Chaotic Traversal (CHAT) which integrates chaotic dynamics to traverse large unknown graphs via the Lozi map and the Rössler system. To compare various dynamics effects on our algorithm, we present an original way to perform the exploration of a parameter space using a bifurcation diagram with respect to the topological structure of attractors. The resulting algorithm is an efficient and nonresource demanding algorithm, and is therefore very suitable for partial traversal of very large and/or unknown environment graphs. CHAT performance using Lozi map is proven superior than the, commonly known, Random Walk, in terms of number of nodes visited (coverage percentage) and computation time where the environment is unknown and memory usage is restricted.
A Ranking Approach on Large-Scale Graph With Multidimensional Heterogeneous Information.
Wei, Wei; Gao, Bin; Liu, Tie-Yan; Wang, Taifeng; Li, Guohui; Li, Hang
2016-04-01
Graph-based ranking has been extensively studied and frequently applied in many applications, such as webpage ranking. It aims at mining potentially valuable information from the raw graph-structured data. Recently, with the proliferation of rich heterogeneous information (e.g., node/edge features and prior knowledge) available in many real-world graphs, how to effectively and efficiently leverage all information to improve the ranking performance becomes a new challenging problem. Previous methods only utilize part of such information and attempt to rank graph nodes according to link-based methods, of which the ranking performances are severely affected by several well-known issues, e.g., over-fitting or high computational complexity, especially when the scale of graph is very large. In this paper, we address the large-scale graph-based ranking problem and focus on how to effectively exploit rich heterogeneous information of the graph to improve the ranking performance. Specifically, we propose an innovative and effective semi-supervised PageRank (SSP) approach to parameterize the derived information within a unified semi-supervised learning framework (SSLF-GR), then simultaneously optimize the parameters and the ranking scores of graph nodes. Experiments on the real-world large-scale graphs demonstrate that our method significantly outperforms the algorithms that consider such graph information only partially.
Mizuguchi, Nobuaki; Uehara, Shintaro; Hirose, Satoshi; Yamamoto, Shinji; Naito, Eiichi
2016-01-01
Motor performance fluctuates trial by trial even in a well-trained motor skill. Here we show neural substrates underlying such behavioral fluctuation in humans. We first scanned brain activity with functional magnetic resonance imaging while healthy participants repeatedly performed a 10 s skillful sequential finger-tapping task. Before starting the experiment, the participants had completed intensive training. We evaluated task performance per trial (number of correct sequences in 10 s) and depicted brain regions where the activity changes in association with the fluctuation of the task performance across trials. We found that the activity in a broader range of frontoparietocerebellar network, including the bilateral dorsolateral prefrontal cortex (DLPFC), anterior cingulate and anterior insular cortices, and left cerebellar hemisphere, was negatively correlated with the task performance. We further showed in another transcranial direct current stimulation (tDCS) experiment that task performance deteriorated, when we applied anodal tDCS to the right DLPFC. These results indicate that fluctuation of brain activity in the nonmotor frontoparietocerebellar network may underlie trial-by-trial performance variability even in a well-trained motor skill, and its neuromodulation with tDCS may affect the task performance.
Nichols, Jeri Ann
This study examined the relationship between mathematics background and performance on graph-related problems in physics before and after instruction on the graphical analysis of motion and several microcomputer-based laboratory experiences. Students identified as either having or not having a graphing technology enhanced precalculus mathematics background were further categorized into one of four groups according to mathematics placement at the university. The performances of these groups were compared to identity differences. Pre- and Post-test data were collected from 589 students and 312 students during Autumn Quarter 1990 and Winter Quarter 1991 respectively. Background information was collected from each student. Significant differences were found between students with the technology enhanced mathematics background and those without when considering the entire populations both quarters. The students with the technology background were favored Autumn quarter and students without the technology background were favored Winter quarter. However, the entire population included an underrepresentation of students at the highest and lowest placements; hence, these were eliminated from the analyses. No significant differences were found between the technology/no technology groups after the elimination of the underrepresented groups. All categories of students increased their mean scores from pretest to post-test; the average increase was 8.23 points Autumn Quarter and 11.41 points Winter Quarter. Males consistently outperformed females on both the pretest and the post-test Autumn 1990. All students found questions involving the concept of acceleration more difficult than questions involving velocity or distance. Questions requiring students to create graphs were more difficult than questions requiring students to interpret graphs. Further research involving a qualitative component is recommended to identify the specific skills students use when solving graph
Episiotomy and its relationship to various clinical variables that influence its performance
Ballesteros-Meseguer, Carmen; Carrillo-García, César; Meseguer-de-Pedro, Mariano; Canteras-Jordana, Manuel; Martínez-Roche, Mª Emilia
2016-01-01
Objective: to understand the episiotomy rate and its relationship with various clinical variables. Method: a descriptive, cross-sectional, analytic study of 12,093 births in a tertiary hospital. Variables: Parity, gestational age, start of labor, use of epidural analgesia, oxytocin usage, position during fetal explusion, weight of neonate, and completion of birth. The analysis was performed with SPSS 19.0. Results: the global percentage of episiotomies was 50%. The clinical variables that presented a significant association were primiparity (RR=2.98), gestational age >41 weeks (RR=1.2), augmented or induced labor (RR=1.33), epidural analgesia use (RR=1,95), oxytocin use (RR=1.58), lithotomy position during fetal expulsion (RR=6.4), and instrumentation (RR=1.84). Furthermore, maternal age ≥35 years (RR=0.85) and neonatal weight <2500 g (RR=0.8) were associated with a lower incidence of episiotomy. Conclusions: episiotomy is dependent on obstetric interventions performed during labor. If we wish to reduce the episiotomy rate, it will be necessary to bear in mind these risk factors when establishing policies for reducing this procedure. PMID:27224064
Gómez, Miguel-Ángel; Ortega Toro, Enrique; Furley, Philip
2016-07-01
The aim of the current study was to analyze the temporal effects that unsportsmanlike fouls may have on basketball teams' scoring performance under consideration of context-related variables. The authors analyzed 130 unsportsmanlike fouls from 362 elite basketball games (men's and women's Olympic Games, European and World Championships). The context-related variables studied were score-line, quality of opposition, timeout situation, minutes remaining, and player status. The data were analyzed with linear-regression models. The results showed that both teams (the team that made the foul and the opponent) had similar positive scoring performances during 1 and 3 ball possessions after the unsportsmanlike foul (short-term effect). However, 5 ball possessions after the foul (midterm effect), the team that made the foul had a scoring disadvantage (-0.96) and the opponent team an advantage (0.78). The context-related variable quality of opposition was significant only during 1 ball possession, with negative effects for the team that made the foul and positive effects for the opponent. The final outcome showed a positive effect for score-line when the unsportsmanlike foul was made (0.96) and for quality of opposition (0.64).
Baumert, Mathias; Starc, Vito; Porta, Alberto
2012-01-01
Increased beat-to-beat variability in the QT interval (QTV) of ECG has been associated with increased risk for sudden cardiac death, but its measurement is technically challenging and currently not standardized. The aim of this study was to investigate the performance of commonly used beat-to-beat QT interval measurement algorithms. Three different methods (conventional, template stretching and template time shifting) were subjected to simulated data featuring typical ECG recording issues (broadband noise, baseline wander, amplitude modulation) and real short-term ECG of patients before and after infusion of sotalol, a QT interval prolonging drug. Among the three algorithms, the conventional algorithm was most susceptible to noise whereas the template time shifting algorithm showed superior overall performance on simulated and real ECG. None of the algorithms was able to detect increased beat-to-beat QT interval variability after sotalol infusion despite marked prolongation of the average QT interval. The QTV estimates of all three algorithms were inversely correlated with the amplitude of the T wave. In conclusion, template matching algorithms, in particular the time shifting algorithm, are recommended for beat-to-beat variability measurement of QT interval in body surface ECG. Recording noise, T wave amplitude and the beat-rejection strategy are important factors of QTV measurement and require further investigation. PMID:22860030
Directory of Open Access Journals (Sweden)
Mathias Baumert
Full Text Available Increased beat-to-beat variability in the QT interval (QTV of ECG has been associated with increased risk for sudden cardiac death, but its measurement is technically challenging and currently not standardized. The aim of this study was to investigate the performance of commonly used beat-to-beat QT interval measurement algorithms. Three different methods (conventional, template stretching and template time shifting were subjected to simulated data featuring typical ECG recording issues (broadband noise, baseline wander, amplitude modulation and real short-term ECG of patients before and after infusion of sotalol, a QT interval prolonging drug. Among the three algorithms, the conventional algorithm was most susceptible to noise whereas the template time shifting algorithm showed superior overall performance on simulated and real ECG. None of the algorithms was able to detect increased beat-to-beat QT interval variability after sotalol infusion despite marked prolongation of the average QT interval. The QTV estimates of all three algorithms were inversely correlated with the amplitude of the T wave. In conclusion, template matching algorithms, in particular the time shifting algorithm, are recommended for beat-to-beat variability measurement of QT interval in body surface ECG. Recording noise, T wave amplitude and the beat-rejection strategy are important factors of QTV measurement and require further investigation.
Multidimensional Brain MRI segmentation using graph cuts
International Nuclear Information System (INIS)
Lecoeur, Jeremy
2010-01-01
This thesis deals with the segmentation of multimodal brain MRIs by graph cuts method. First, we propose a method that utilizes three MRI modalities by merging them. The border information given by the spectral gradient is then challenged by a region information, given by the seeds selected by the user, using a graph cut algorithm. Then, we propose three enhancements of this method. The first consists in finding an optimal spectral space because the spectral gradient is based on natural images and then inadequate for multimodal medical images. This results in a learning based segmentation method. We then explore the automation of the graph cut method. Here, the various pieces of information usually given by the user are inferred from a robust expectation-maximization algorithm. We show the performance of these two enhanced versions on multiple sclerosis lesions. Finally, we integrate atlases for the automatic segmentation of deep brain structures. These three new techniques show the adaptability of our method to various problems. Our different segmentation methods are better than most of nowadays techniques, speaking of computation time or segmentation accuracy. (authors)
HINES, Lindsay J.; MILLER, Eric N.; HINKIN, Charles H.; ALGER, Jeffery R.; BARKER, Peter; GOODKIN, Karl; MARTIN, Eileen M.; MARUCA, Victoria; RAGIN, Ann; SACKTOR, Ned; SANDERS, Joanne; SELNES, Ola; BECKER, James T.
2015-01-01
Objective To characterize the relationship between dispersion-based intra-individual variability (IIVd) in neuropsychological test performance and brain volume among HIV seropositive and seronegative men and to determine the effects of cardiovascular risk and HIV infection on this relationship. Methods Magnetic Resonance Imaging (MRI) was used to acquire high-resolution neuroanatomic data from 147 men age 50 and over, including 80 HIV seropositive (HIV+) and 67 seronegative controls (HIV−) in this cross-sectional cohort study. Voxel Based Morphometry was used to derive volumetric measurements at the level of the individual voxel. These brain structure maps were analyzed using Statistical Parametric Mapping (SPM2). IIVd was measured by computing intra-individual standard deviations (ISD’s) from the standardized performance scores of five neuropsychological tests: Wechsler Memory Scale-III Visual Reproduction I and II, Logical Memory I and II, Wechsler Adult Intelligence Scale-III Letter Number Sequencing. Results Total gray matter (GM) volume was inversely associated with IIVd. Among all subjects, IIVd -related GM atrophy was observed primarily in: 1) the inferior frontal gyrus bilaterally, the left inferior temporal gyrus extending to the supramarginal gyrus, spanning the lateral sulcus; 2) the right superior parietal lobule and intraparietal sulcus; and, 3) dorsal/ventral regions of the posterior section of the transverse temporal gyrus. HIV status, biological, and cardiovascular disease (CVD) variables were not linked to IIVd -related GM atrophy. Conclusions IIVd in neuropsychological test performance may be a sensitive marker of cortical integrity in older adults, regardless of HIV infection status or CVD risk factors, and degree of intra-individual variability links with volume loss in specific cortical regions; independent of mean-level performance on neuropsychological tests. PMID:26303224
The Effect of Birth Weight on Academic Performance: Instrumental Variable Analysis.
Lin, Shi Lin; Leung, Gabriel Matthew; Schooling, C Mary
2017-05-01
Observationally, lower birth weight is usually associated with poorer academic performance; whether this association is causal or the result of confounding is unknown. To investigate this question, we obtained an effect estimate, which can have a causal interpretation under specific assumptions, of birth weight on educational attainment using instrumental variable analysis based on single nucleotide polymorphisms determining birth weight combined with results from the Social Science Genetic Association Consortium study of 126,559 Caucasians. We similarly obtained an estimate of the effect of birth weight on academic performance in 4,067 adolescents from Hong Kong's (Chinese) Children of 1997 birth cohort (1997-2016), using twin status as an instrumental variable. Birth weight was not associated with years of schooling (per 100-g increase in birth weight, -0.006 years, 95% confidence interval (CI): -0.02, 0.01) or college completion (odds ratio = 1.00, 95% CI: 0.96, 1.03). Birth weight was also unrelated to academic performance in adolescents (per 100-g increase in birth weight, -0.004 grade, 95% CI: -0.04, 0.04) using instrumental variable analysis, although conventional regression gave a small positive association (0.02 higher grade, 95% CI: 0.01, 0.03). Observed associations of birth weight with academic performance may not be causal, suggesting that interventions should focus on the contextual factors generating this correlation. © The Author 2017. Published by Oxford University Press on behalf of the Johns Hopkins Bloomberg School of Public Health. All rights reserved. For permissions, please e-mail: journals.permissions@oup.com.
Variable School Start Times and Middle School Student's Sleep Health and Academic Performance.
Lewin, Daniel S; Wang, Guanghai; Chen, Yao I; Skora, Elizabeth; Hoehn, Jessica; Baylor, Allison; Wang, Jichuan
2017-08-01
Improving sleep health among adolescents is a national health priority and implementing healthy school start times (SSTs) is an important strategy to achieve these goals. This study leveraged the differences in middle school SST in a large district to evaluate associations between SST, sleep health, and academic performance. This cross-sectional study draws data from a county-wide surveillance survey. Participants were three cohorts of eighth graders (n = 26,440). The school district is unique because SST ranged from 7:20 a.m. to 8:10 a.m. Path analysis and probit regression were used to analyze associations between SST and self-report measures of weekday sleep duration, grades, and homework controlling for demographic variables (sex, race, and socioeconomic status). The independent contributions of SST and sleep duration to academic performance were also analyzed. Earlier SST was associated with decreased sleep duration (χ 2 = 173, p academic performance, and academic effort. Path analysis models demonstrated the independent contributions of sleep duration, SST, and variable effects for demographic variables. This is the first study to evaluate the independent contributions of SST and sleep to academic performance in a large sample of middle school students. Deficient sleep was prevalent, and the earliest SST was associated with decrements in sleep and academics. These findings support the prioritization of policy initiatives to implement healthy SST for younger adolescents and highlight the importance of sleep health education disparities among race and gender groups. Copyright © 2017 Society for Adolescent Health and Medicine. Published by Elsevier Inc. All rights reserved.
Tyner, Bryan C.; Fienup, Daniel M.
2015-01-01
Graphing is socially significant for behavior analysts; however, graphing can be difficult to learn. Video modeling (VM) may be a useful instructional method but lacks evidence for effective teaching of computer skills. A between-groups design compared the effects of VM, text-based instruction, and no instruction on graphing performance.…
Hilborn, Jennifer V; Strauss, Esther; Hultsch, David F; Hunter, Michael A
2009-05-01
A growing body of research suggests that substantial variability exists among cognitive abilities within individuals. This within-person variability across cognitive domains is termed dispersion. The present study investigated the relationship between aging and dispersion of cognitive functions both quantitatively (overall levels of dispersion) and qualitatively (patterns of dispersion) in a sample of 304 nondemented, older adults aged 64 to 92 years (M = 74.02). Quantitatively, higher levels of dispersion were observed in the old-old adults (aged 75-92 years) and those identified as having experienced cognitive decline, suggesting that dispersion level may serve as a marker of cognitive integrity. Qualitatively, three distinct dispersion profiles were identified through clustering methods, and these were found to be related to demographic, health, and performance characteristics of the individuals, suggesting that patterns of dispersion may be meaningful indicators of individual differences.
Clark, Ross A; Humphries, Brendan; Hohmann, Erik; Bryant, Adam L
2011-03-01
Resistance training programs that emphasize high force production in different regions of the range of motion (ROM) may provide performance benefits. This study examined whether variable ROM (VROM) training, which consists of partial ROM training with countermovements performed in a different phase of the ROM for each set, results in improved functional performance. Twenty-two athletes (age 22.7 ± 2.4 years, height 1.81 ± 0.07 m, and body mass 94.6 ± 14.5 kg) with extensive resistance training backgrounds performed either a VROM or full ROM control (CON) 5-week, concentric work-matched training program. The participants were assigned to a group based on stratified randomization incorporating their strength levels and performance gains in preceding training microcycles. Testing consisted of assessing the force-ROM relationship during isokinetic and isometric bench press and ballistic bench throws, with normalized electromyography amplitude assessed during the isometric tests. Repeated-measure analyses of variance revealed that the VROM intervention significantly (p force (+15.7%), in addition to isokinetic peak force in the terminal ROM (13.5% increase). No significant differences were observed in the CON group or between groups for any other outcome measures. Analysis of the force-ROM relationship revealed that that the VROM intervention enhanced performance at shorter muscle lengths. These findings suggest that VROM training improves terminal and midrange performance gains, resulting in the athlete possessing an improved ability to control external loading and produce dynamic force.
DEFF Research Database (Denmark)
Agreste, Santa; De Meo, Pasquale; Fiumara, Giacomo
2017-01-01
Detecting communities in graphs is a fundamental tool to understand the structure of Web-based systems and predict their evolution. Many community detection algorithms are designed to process undirected graphs (i.e., graphs with bidirectional edges) but many graphs on the Web-e.g., microblogging ...... the best trade-off between accuracy and computational performance and, therefore, it has to be considered as a promising tool for Web Data Analytics purposes....
Eigenfunction statistics on quantum graphs
International Nuclear Information System (INIS)
Gnutzmann, S.; Keating, J.P.; Piotet, F.
2010-01-01
We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.
Directory of Open Access Journals (Sweden)
Andreas P. Braun
2016-04-01
Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.
Degree-based graph construction
International Nuclear Information System (INIS)
Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A
2009-01-01
Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)
Integer Flows and Circuit Covers of Graphs and Signed Graphs
Cheng, Jian
The work in Chapter 2 is motivated by Tutte and Jaeger's pioneering work on converting modulo flows into integer-valued flows for ordinary graphs. For a signed graphs (G, sigma), we first prove that for each k ∈ {2, 3}, if (G, sigma) is (k - 1)-edge-connected and contains an even number of negative edges when k = 2, then every modulo k-flow of (G, sigma) can be converted into an integer-valued ( k + 1)-ow with a larger or the same support. We also prove that if (G, sigma) is odd-(2p+1)-edge-connected, then (G, sigma) admits a modulo circular (2 + 1/ p)-flows if and only if it admits an integer-valued circular (2 + 1/p)-flows, which improves all previous result by Xu and Zhang (DM2005), Schubert and Steffen (EJC2015), and Zhu (JCTB2015). Shortest circuit cover conjecture is one of the major open problems in graph theory. It states that every bridgeless graph G contains a set of circuits F such that each edge is contained in at least one member of F and the length of F is at most 7/5∥E(G)∥. This concept was recently generalized to signed graphs by Macajova et al. (JGT2015). In Chapter 3, we improve their upper bound from 11∥E( G)∥ to 14/3 ∥E(G)∥, and if G is 2-edgeconnected and has even negativeness, then it can be further reduced to 11/3 ∥E(G)∥. Tutte's 3-flow conjecture has been studied by many graph theorists in the last several decades. As a new approach to this conjecture, DeVos and Thomassen considered the vectors as ow values and found that there is a close relation between vector S1-flows and integer 3-NZFs. Motivated by their observation, in Chapter 4, we prove that if a graph G admits a vector S1-flow with rank at most two, then G admits an integer 3-NZF. The concept of even factors is highly related to the famous Four Color Theorem. We conclude this dissertation in Chapter 5 with an improvement of a recent result by Chen and Fan (JCTB2016) on the upperbound of even factors. We show that if a graph G contains an even factor, then it
A cluster expansion approach to exponential random graph models
International Nuclear Information System (INIS)
Yin, Mei
2012-01-01
The exponential family of random graphs are among the most widely studied network models. We show that any exponential random graph model may alternatively be viewed as a lattice gas model with a finite Banach space norm. The system may then be treated using cluster expansion methods from statistical mechanics. In particular, we derive a convergent power series expansion for the limiting free energy in the case of small parameters. Since the free energy is the generating function for the expectations of other random variables, this characterizes the structure and behavior of the limiting network in this parameter region
Lung vessel segmentation in CT images using graph-cuts
Zhai, Zhiwei; Staring, Marius; Stoel, Berend C.
2016-03-01
Accurate lung vessel segmentation is an important operation for lung CT analysis. Filters that are based on analyzing the eigenvalues of the Hessian matrix are popular for pulmonary vessel enhancement. However, due to their low response at vessel bifurcations and vessel boundaries, extracting lung vessels by thresholding the vesselness is not sufficiently accurate. Some methods turn to graph-cuts for more accurate segmentation, as it incorporates neighbourhood information. In this work, we propose a new graph-cuts cost function combining appearance and shape, where CT intensity represents appearance and vesselness from a Hessian-based filter represents shape. Due to the amount of voxels in high resolution CT scans, the memory requirement and time consumption for building a graph structure is very high. In order to make the graph representation computationally tractable, those voxels that are considered clearly background are removed from the graph nodes, using a threshold on the vesselness map. The graph structure is then established based on the remaining voxel nodes, source/sink nodes and the neighbourhood relationship of the remaining voxels. Vessels are segmented by minimizing the energy cost function with the graph-cuts optimization framework. We optimized the parameters used in the graph-cuts cost function and evaluated the proposed method with two manually labeled sub-volumes. For independent evaluation, we used 20 CT scans of the VESSEL12 challenge. The evaluation results of the sub-volume data show that the proposed method produced a more accurate vessel segmentation compared to the previous methods, with F1 score 0.76 and 0.69. In the VESSEL12 data-set, our method obtained a competitive performance with an area under the ROC curve of 0.975, especially among the binary submissions.
Benchmarking Measures of Network Controllability on Canonical Graph Models
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
Mining the inner structure of the Web graph
International Nuclear Information System (INIS)
Donato, Debora; Leonardi, Stefano; Millozzi, Stefano; Tsaparas, Panayiotis
2008-01-01
Despite being the sum of decentralized and uncoordinated efforts by heterogeneous groups and individuals, the World Wide Web exhibits a well-defined structure, characterized by several interesting properties. This structure was clearly revealed by Broder et al (2000 Graph structure in the web Comput. Netw. 33 309) who presented the evocative bow-tie picture of the Web. Although, the bow-tie structure is a relatively clear abstraction of the macroscopic picture of the Web, it is quite uninformative with respect to the finer details of the Web graph. In this paper, we mine the inner structure of the Web graph. We present a series of measurements on the Web, which offer a better understanding of the individual components of the bow-tie. In the process, we develop algorithmic techniques for performing these measurements. We discover that the scale-free properties permeate all the components of the bow-tie which exhibit the same macroscopic properties as the Web graph itself. However, close inspection reveals that their inner structure is quite distinct. We show that the Web graph does not exhibit self similarity within its components, and we propose a possible alternative picture for the Web graph, as it emerges from our experiments
Neuro-symbolic representation learning on biological knowledge graphs.
Alshahrani, Mona; Khan, Mohammad Asif; Maddouri, Omar; Kinjo, Akira R; Queralt-Rosinach, Núria; Hoehndorf, Robert
2017-09-01
Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge. Results: We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of Semantic Web based knowledge bases in biology to use in machine learning and data analytics. https://github.com/bio-ontology-research-group/walking-rdf-and-owl. robert.hoehndorf@kaust.edu.sa. Supplementary data are available at Bioinformatics online. © The Author(s) 2017. Published by Oxford University Press.
Neuro-symbolic representation learning on biological knowledge graphs
Alshahrani, Mona
2017-04-21
Biological data and knowledge bases increasingly rely on Semantic Web technologies and the use of knowledge graphs for data integration, retrieval and federated queries. In the past years, feature learning methods that are applicable to graph-structured data are becoming available, but have not yet widely been applied and evaluated on structured biological knowledge.We develop a novel method for feature learning on biological knowledge graphs. Our method combines symbolic methods, in particular knowledge representation using symbolic logic and automated reasoning, with neural networks to generate embeddings of nodes that encode for related information within knowledge graphs. Through the use of symbolic logic, these embeddings contain both explicit and implicit information. We apply these embeddings to the prediction of edges in the knowledge graph representing problems of function prediction, finding candidate genes of diseases, protein-protein interactions, or drug target relations, and demonstrate performance that matches and sometimes outperforms traditional approaches based on manually crafted features. Our method can be applied to any biological knowledge graph, and will thereby open up the increasing amount of SemanticWeb based knowledge bases in biology to use in machine learning and data analytics.https://github.com/bio-ontology-research-group/walking-rdf-and-owl.robert.hoehndorf@kaust.edu.sa.Supplementary data are available at Bioinformatics online.
Regular graph construction for semi-supervised learning
International Nuclear Information System (INIS)
Vega-Oliveros, Didier A; Berton, Lilian; Eberle, Andre Mantini; Lopes, Alneu de Andrade; Zhao, Liang
2014-01-01
Semi-supervised learning (SSL) stands out for using a small amount of labeled points for data clustering and classification. In this scenario graph-based methods allow the analysis of local and global characteristics of the available data by identifying classes or groups regardless data distribution and representing submanifold in Euclidean space. Most of methods used in literature for SSL classification do not worry about graph construction. However, regular graphs can obtain better classification accuracy compared to traditional methods such as k-nearest neighbor (kNN), since kNN benefits the generation of hubs and it is not appropriate for high-dimensionality data. Nevertheless, methods commonly used for generating regular graphs have high computational cost. We tackle this problem introducing an alternative method for generation of regular graphs with better runtime performance compared to methods usually find in the area. Our technique is based on the preferential selection of vertices according some topological measures, like closeness, generating at the end of the process a regular graph. Experiments using the global and local consistency method for label propagation show that our method provides better or equal classification rate in comparison with kNN
Volumetric Analysis and Performance of Hot Mix Asphalt with Variable Rap Content
Directory of Open Access Journals (Sweden)
Arshad Ahmad Kamil
2017-01-01
Full Text Available Incorporating Reclaimed Asphalt Pavement (RAP to the asphalt concrete mixture for highway construction offer many benefits including energy consumption, conservation of natural resources and preservation of the environment to associated emissions. This paper presents a study on performance of Hot Mix Asphalt with variable RAP content. The study is carried out to evaluate the Marshall Properties and Performance of RAP-Asphalt mixes using conventional asphaltic concrete mix AC14. Marshall Mix Design Method was used to produce control mix (0% RAP and RAP-Asphalt mixes samples which consist of 15% RAP, 25% RAP and 35% RAP in accordance with Specifications for Road Works of Public Works Department, Malaysia. The Marshall Properties analysis was performed to ensure compliance with Marshall Requirements, The resilient modulus test was performed to measure the stiffness of the mixes while Modified Lottman test was conducted to evaluate the moisture susceptibility of these mixes. The results obtained showed that there were no substantial difference in Marshall Properties, moisture susceptibility and indirect tensile strength between RAP-Asphalt mixes with the control mix. The test results indicated that recycled mixes performed as good as the performance of conventional HMA in terms of moisture susceptibility and resilient modulus. It is recommended that further research be carried out for asphalt mixes containing more than 35% of RAP material.
Dewi, Erni R.; Bundu, Patta; Tahmir, Suradi
2016-01-01
This study aims at analysing whether the antecedent variable directly affects the performance of the high school teachers or not. In addition, this research strives to find out whether the antecedent variable indirectly affects the teachers' performance through the achievement motivation of the high school teachers. It was a quantitative research…
Graph modeling systems and methods
Neergaard, Mike
2015-10-13
An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.
Feder, Tomá s; Motwani, Rajeev
2009-01-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Feder, Tomás
2009-06-01
Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.
Negation switching invariant signed graphs
Directory of Open Access Journals (Sweden)
Deepa Sinha
2014-04-01
Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.
International Nuclear Information System (INIS)
Rosmanis, Ansis
2011-01-01
I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.
Gardiner, JD; Bari, AZ; Kenney, LPJ; Twiste, M; Moser, D; Zahedi, S; Howard, D
2017-01-01
Current energy storage and return (ESR) prosthetic\\ud feet only marginally reduce the cost of amputee locomotion\\ud compared to basic solid ankle cushioned heel (SACH) feet,\\ud possibly due to their lack of push-off at the end of stance. To our knowledge, a prosthetic ankle that utilises a hydraulic variable displacement actuator (VDA) to improve push-off performance has not previously been proposed. Therefore, here we report a design optimisation and simulation feasibility study for a VDA ba...
Performance comparison of control schemes for variable-speed wind turbines
Bottasso, C. L.; Croce, A.; Savini, B.
2007-07-01
We analyze the performance of different control schemes when applied to the regulation problem of a variable-speed representative wind turbine. In particular, we formulate and compare a wind-scheduled PID, a LQR controller and a novel adaptive non-linear model predictive controller, equipped with observers of the tower states and wind. The simulations include gusts and turbulent winds of varying intensity in nominal as well as off-design operating conditions. The experiments highlight the possible advantages of model-based non-linear control strategies.
Performance comparison of control schemes for variable-speed wind turbines
International Nuclear Information System (INIS)
Bottasso, C L; Croce, A; Savini, B
2007-01-01
We analyze the performance of different control schemes when applied to the regulation problem of a variable-speed representative wind turbine. In particular, we formulate and compare a wind-scheduled PID, a LQR controller and a novel adaptive non-linear model predictive controller, equipped with observers of the tower states and wind. The simulations include gusts and turbulent winds of varying intensity in nominal as well as off-design operating conditions. The experiments highlight the possible advantages of model-based non-linear control strategies
Altitude Performance Characteristics of Tail-pipe Burner with Variable-area Exhaust Nozzle
Jansen, Emmert T; Thorman, H Carl
1950-01-01
An investigation was conducted in the NACA Lewis altitude wind tunnel to determine effect of altitude and flight Mach number on performance of tail-pipe burner equipped with variable-area exhaust nozzle and installed on full-scale turbojet engine. At a given flight Mach number, with constant exhaust-gas and turbine-outlet temperatures, increasing altitude lowered the tail-pipe combustion efficiency and raised the specific fuel consumption while the augmented thrust ratio remained approximately constant. At a given altitude, increasing flight Mach number raised the combustion efficiency and augmented thrust ratio and lowered the specific fuel consumption.
Frog: Asynchronous Graph Processing on GPU with Hybrid Coloring Model
Energy Technology Data Exchange (ETDEWEB)
Shi, Xuanhua; Luo, Xuan; Liang, Junling; Zhao, Peng; Di, Sheng; He, Bingsheng; Jin, Hai
2018-01-01
datasets, Frog is able to significantly outperform existing GPU-based graph processing systems except Gunrock and MapGraph. MapGraph gets better performance than Frog when running BFS on RoadNet-CA. The comparison between Gunrock and Frog is inconclusive. Frog can outperform Gunrock more than 1.04X when running PageRank and SSSP, while the advantage of Frog is not obvious when running BFS and CC on some datasets especially for RoadNet-CA.
International Nuclear Information System (INIS)
Elnajjar, Emad; Selim, Mohamed Y.E.; Hamdan, Mohammad O.
2013-01-01
Highlights: • The effect of using variable LPG is studied. • Five fuels with propane to butane % volume ratio are: 100-70-55-25-0. • 100% Propane composition shows the highest noise levels with similar performance. • At 45° BTDC injection timing 55% Propane LPG the only fuel experience knocking. • LPG fuels gave similar engine performance, with differences in levels of noise. - Abstract: The present work investigates experimentally the effect of LPG fuel with different composition and engine parameters on the performance of a dual compression engine. Five different blends of LPG fuels are used with Propane to Butane volume ratio of 100:0, 70:30, 55:45, 25:75, and 0:100. A single cylinder, naturally aspirated, four strokes, indirectly injected, water cooled modified Ricardo E6 engine, is used in this study. The study is carried out by measuring the cylinder pressure, engine load, engine speed, crank angle, and the fuel’s flow rate. The engine performance under variable LPG fuel composition, engine load, pilot fuel injection timing, compression ratio, pilot fuel mass and engine speed, are estimated by comparing the following engine parameters: the cylinder maximum pressure, the indicated mean effective pressure, the maximum rate of pressure rise, and the thermal efficiency. The experimental data indicates that the engine parameters are playing a major role on the engine’s performance. Different LPG fuel composition did not show a major effect on the engine efficiency but directly impacted the levels of generated combustion noise
Energy Technology Data Exchange (ETDEWEB)
Kim, S.; Bae, B. U.; Cho, Y. J. and others
2014-05-15
The design values of the RCPTF are 17.2 MPa, 343 .deg. C, 11.7 m{sup 3}/s, and 13 MW in the maximum pressure, temperature, flow rate, and electrical power, respectively. In the RCPTF, various types of tests can be performed including a hydraulic performance test to acquire a H-Q curve as well seal transient tests, thrust bearing transient test, cost down test, NPSHR verification test, and so on. After a commissioning startup test was successfully perfomed, mechanical structures are improved including a flow stabilizer and variable restriction orifice. Two- branch pipe (Y-branch) was installed to regulate the flow rate in the range of performance tests. In the main pipe, a flow restrictor (RO: Restriction Orifice) for limiting the maximum flow rate was installed. In the branch pipe line, a globe valve and a butterfly valves for regulating the flow rate was located on the each branch line. When the pressure loss of the valve side is smaller than that of the RO side, the flow rate of valve side was increasing and the flow disturbance was occurred in the lower pipe line. Due to flow disturbnace, it is to cause an error when measuring RCP head and flow measurement of the venturi flow meter installed in the lower main pipe line, and thus leading to a decrease in measurement accuracy as a result. To increase the efficiency of the flow control availability of the test facility, the variable restriction orifice (VRO) type flow control valve was designed and manufactured. In the RCPTF in KAERI, the performance tests and various kinds of transient tests of the RCP were successfully performed. In this study, H-Q curve of the pump using the VRO revealed a similar trend to the result from two ROs. The VRO was confirmed to effectively cover the full test range of the flow rate.
Macnamara, Brooke N; Frank, David J
2018-05-01
For well over a century, scientists have investigated individual differences in performance. The majority of studies have focused on either differences in practice, or differences in cognitive resources. However, the predictive ability of either practice or cognitive resources varies considerably across tasks. We are the first to examine task characteristics' impact on learning and performance in a complex task while controlling for other task characteristics. In 2 experiments we test key theoretical task characteristic thought to moderate the relationship between practice, cognitive resources, and performance. We devised a task where each of several key task characteristics can be manipulated independently. Participants played 5 rounds of a game similar to the popular tower defense videogame Plants vs. Zombies where both cognitive load and game characteristics were manipulated. In Experiment 1, participants either played a consistently mapped version-the stimuli and the associated meaning of their properties were constant across the 5 rounds-or played a variably mapped version-the stimuli and the associated meaning of their properties changed every few minutes. In Experiment 2, participants either played a static version-that is, turn taking with no time pressure-or played a dynamic version-that is, the stimuli moved regardless of participants' response rates. In Experiment 1, participants' accuracy and efficiency were substantially hindered in the variably mapped conditions. In Experiment 2, learning and performance accuracy were hindered in the dynamic conditions, especially when under cognitive load. Our results suggest that task characteristics impact the relative importance of cognitive resources and practice on predicting learning and performance. (PsycINFO Database Record (c) 2018 APA, all rights reserved).
Solving Graph Laplacian Systems Through Recursive Bisections and Two-Grid Preconditioning
Energy Technology Data Exchange (ETDEWEB)
Ponce, Colin [Cornell Univ., Ithaca, NY (United States); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-02-18
We present a parallelizable direct method for computing the solution to graph Laplacian-based linear systems derived from graphs that can be hierarchically bipartitioned with small edge cuts. For a graph of size n with constant-size edge cuts, our method decomposes a graph Laplacian in time O(n log n), and then uses that decomposition to perform a linear solve in time O(n log n). We then use the developed technique to design a preconditioner for graph Laplacians that do not have this property. Finally, we augment this preconditioner with a two-grid method that accounts for much of the preconditioner's weaknesses. We present an analysis of this method, as well as a general theorem for the condition number of a general class of two-grid support graph-based preconditioners. Numerical experiments illustrate the performance of the studied methods.
Adaptive random walks on the class of Web graphs
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.
Variability in Wechsler Adult Intelligence Scale-IV subtest performance across age.
Wisdom, Nick M; Mignogna, Joseph; Collins, Robert L
2012-06-01
Normal Wechsler Adult Intelligence Scale (WAIS)-IV performance relative to average normative scores alone can be an oversimplification as this fails to recognize disparate subtest heterogeneity that occurs with increasing age. The purpose of the present study is to characterize the patterns of raw score change and associated variability on WAIS-IV subtests across age groupings. Raw WAIS-IV subtest means and standard deviations for each age group were tabulated from the WAIS-IV normative manual along with the coefficient of variation (CV), a measure of score dispersion calculated by dividing the standard deviation by the mean and multiplying by 100. The CV further informs the magnitude of variability represented by each standard deviation. Raw mean scores predictably decreased across age groups. Increased variability was noted in Perceptual Reasoning and Processing Speed Index subtests, as Block Design, Matrix Reasoning, Picture Completion, Symbol Search, and Coding had CV percentage increases ranging from 56% to 98%. In contrast, Working Memory and Verbal Comprehension subtests were more homogeneous with Digit Span, Comprehension, Information, and Similarities percentage of the mean increases ranging from 32% to 43%. Little change in the CV was noted on Cancellation, Arithmetic, Letter/Number Sequencing, Figure Weights, Visual Puzzles, and Vocabulary subtests (test limitations as well as further our understanding of cognitive domains which remain relatively steady versus those which steadily decline.
On Graph Rewriting, Reduction and Evaluation
DEFF Research Database (Denmark)
Zerny, Ian
2010-01-01
We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...
The fascinating world of graph theory
Benjamin, Arthur; Zhang, Ping
2015-01-01
Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin
Graph-based modelling in engineering
Rysiński, Jacek
2017-01-01
This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .
XML Graphs in Program Analysis
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael Ignatieff
2007-01-01
XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....
Graph topologies on closed multifunctions
Directory of Open Access Journals (Sweden)
Giuseppe Di Maio
2003-10-01
Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.
Cyclic graphs and Apery's theorem
International Nuclear Information System (INIS)
Sorokin, V N
2002-01-01
This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found
Interacting particle systems on graphs
Sood, Vishal
In this dissertation, the dynamics of socially or biologically interacting populations are investigated. The individual members of the population are treated as particles that interact via links on a social or biological network represented as a graph. The effect of the structure of the graph on the properties of the interacting particle system is studied using statistical physics techniques. In the first chapter, the central concepts of graph theory and social and biological networks are presented. Next, interacting particle systems that are drawn from physics, mathematics and biology are discussed in the second chapter. In the third chapter, the random walk on a graph is studied. The mean time for a random walk to traverse between two arbitrary sites of a random graph is evaluated. Using an effective medium approximation it is found that the mean first-passage time between pairs of sites, as well as all moments of this first-passage time, are insensitive to the density of links in the graph. The inverse of the mean-first passage time varies non-monotonically with the density of links near the percolation transition of the random graph. Much of the behavior can be understood by simple heuristic arguments. Evolutionary dynamics, by which mutants overspread an otherwise uniform population on heterogeneous graphs, are studied in the fourth chapter. Such a process underlies' epidemic propagation, emergence of fads, social cooperation or invasion of an ecological niche by a new species. The first part of this chapter is devoted to neutral dynamics, in which the mutant genotype does not have a selective advantage over the resident genotype. The time to extinction of one of the two genotypes is derived. In the second part of this chapter, selective advantage or fitness is introduced such that the mutant genotype has a higher birth rate or a lower death rate. This selective advantage leads to a dynamical competition in which selection dominates for large populations
SNAP: A General Purpose Network Analysis and Graph Mining Library.
Leskovec, Jure; Sosič, Rok
2016-10-01
Large networks are becoming a widely used abstraction for studying complex systems in a broad set of disciplines, ranging from social network analysis to molecular biology and neuroscience. Despite an increasing need to analyze and manipulate large networks, only a limited number of tools are available for this task. Here, we describe Stanford Network Analysis Platform (SNAP), a general-purpose, high-performance system that provides easy to use, high-level operations for analysis and manipulation of large networks. We present SNAP functionality, describe its implementational details, and give performance benchmarks. SNAP has been developed for single big-memory machines and it balances the trade-off between maximum performance, compact in-memory graph representation, and the ability to handle dynamic graphs where nodes and edges are being added or removed over time. SNAP can process massive networks with hundreds of millions of nodes and billions of edges. SNAP offers over 140 different graph algorithms that can efficiently manipulate large graphs, calculate structural properties, generate regular and random graphs, and handle attributes and meta-data on nodes and edges. Besides being able to handle large graphs, an additional strength of SNAP is that networks and their attributes are fully dynamic, they can be modified during the computation at low cost. SNAP is provided as an open source library in C++ as well as a module in Python. We also describe the Stanford Large Network Dataset, a set of social and information real-world networks and datasets, which we make publicly available. The collection is a complementary resource to our SNAP software and is widely used for development and benchmarking of graph analytics algorithms.
Off-design performance loss model for radial turbines with pivoting, variable-area stators
Meitner, P. L.; Glassman, A. J.
1980-01-01
An off-design performance loss model was developed for variable stator (pivoted vane), radial turbines through analytical modeling and experimental data analysis. Stator loss is determined by a viscous loss model; stator vane end-clearance leakage effects are determined by a clearance flow model. Rotor loss coefficient were obtained by analyzing the experimental data from a turbine rotor previously tested with six stators having throat areas from 20 to 144 percent of design area and were correlated with stator-to-rotor throat area ratio. An incidence loss model was selected to obtain best agreement with experimental results. Predicted turbine performance is compared with experimental results for the design rotor as well as with results for extended and cutback versions of the rotor. Sample calculations were made to show the effects of stator vane end-clearance leakage.
An Inclusive Design Method for Addressing Human Variability and Work Performance Issues
Directory of Open Access Journals (Sweden)
Amjad Hussain
2013-07-01
Full Text Available Humans play vital roles in manufacturing systems, but work performance is strongly influenced by factors such as experience, age, level of skill, physical and cognitive abilities and attitude towards work. Current manufacturing system design processes need to consider these human variability issues and their impact on work performance. An ‘inclusive design’ approach is proposed to consider the increasing diversity of the global workforce in terms of age, gender, cultural background, skill and experience. The decline in physical capabilities of older workers creates a mismatch between job demands and working capabilities which can be seen in manufacturing assembly that typically requires high physical demands for repetitive and accurate motions. The inclusive design approach leads to a reduction of this mismatch that results in a more productive, safe and healthy working environment giving benefits to the organization and individuals in terms of workforce satisfaction, reduced turnover, higher productivity and improved product quality.
¿Es la performance de los fondos brasileños de renta variable persistente?
Directory of Open Access Journals (Sweden)
Knebel, Daniel
2008-04-01
Full Text Available El objetivo de este estudio es analizar la persistencia de la performance de los Fondos de Inversión de Renta Variable de Brasil. La base de datos fue formada por 459 Fondos, siendo 321 del IBOVESPA y 138 del IBX, de 1997 hasta 2006. Los Fondos fueron clasificados como ganadores (Winners o perdedores (Losers a través de la mediana de las rentabilidades anuales y se observó a partir de los análisis estadísticos paramétricos (tablas de contingencia la existencia del fenómeno de la persistencia. Los resultados revelaron en cuatro de los nueve períodos analizados la existencia de la persistencia de la performance.
Lohmann, R. P.; Mador, R. J.
1979-01-01
An evaluation was conducted with a three stage Vorbix duct burner to determine the performance and emissions characteristics of the concept and to refine the configuration to provide acceptable durability and operational characteristics for its use in the variable cycle engine (VCE) testbed program. The tests were conducted at representative takeoff, transonic climb, and supersonic cruise inlet conditions for the VSCE-502B study engine. The test stand, the emissions sampling and analysis equipment, and the supporting flow visualization rigs are described. The performance parameters including the fuel-air ratio, the combustion efficiency/exit temperature, thrust efficiency, and gaseous emissions calculations are defined. The test procedures are reviewed and the results are discussed.
Chen, You Liang; Shi, Yong Feng; Hao, Jian Gang; Chang, Hao; Sun, Feng Zhong
2018-01-01
In order to quantitatively analyze the influence of the variable operating parameters on the cooling performance of natural draft wet cooling towers (NDWCTs), a hot model test system was set up with adjustable ambient temperature and humidity, circulating water flowrate and temperature. In order to apply the hot model test results to the real tower, the crosswind Froude number is defined. The results show that the crosswind has a negative effect on the thermal performance of the cooling tower, and there is a critical crosswind velocity corresponding to the lowest cooling efficiency. According to the crosswind Froude number similarity, when the ambient temperature decreases, or the circulating water flowrate and temperature increase, the cooling tower draft force will increase, and the critical crosswind velocity will increase correspondingly.
Strategy and pattern recognition in expert\\ud comprehension of 2 × 2 interaction graphs
Peebles, David
2013-01-01
I present a model of expert comprehension performance for 2 × 2 "interaction" graphs typically used to present data from two-way factorial research designs. Developed using the ACT-R cognitive architecture, the model simulates the cognitive and perceptual operations involved in interpreting interaction graphs and provides a detailed characterisation of the information\\ud extracted from the diagram, the prior knowledge required to interpret interaction graphs, and the knowledge generated durin...
An Xdata Architecture for Federated Graph Models and Multi-tier Asymmetric Computing
2014-01-01
Wikipedia, a scale-free random graph (kron), Akamai trace route data, Bitcoin transaction data, and a Twitter follower network. We present results for...3x (SSSP on a random graph) and nearly 300x (Akamai and Bitcoin ) over the CPU performance of a well-known and widely deployed CPU-based graph...provided better throughput for smaller frontiers such as roadmaps or the Bitcoin data set. In our work, we have focused on two-phase kernels, but it
Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms
Chen, Pin-Yu; Hero, Alfred O.
2017-01-01
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning clusters to a common multilayer node set and for combining information from each layer. This paper presents a multilayer spectral graph clustering (SGC) framework that performs convex layer aggregation. Under a multilayer signal plus noise model, we provide a phase transition analys...
Variables that influence Ironman triathlon performance – what changed in the last 35 years?
Directory of Open Access Journals (Sweden)
Knechtle B
2015-08-01
Full Text Available Beat Knechtle,1,2 Raphael Knechtle,2 Michael Stiefel,2 Matthias Alexander Zingg,2 Thomas Rosemann,2 Christoph Alexander Rüst21Gesundheitszentrum St Gallen, St Gallen, 2Institute of Primary Care, University of Zurich, Zurich, SwitzerlandObjective: This narrative review summarizes findings for Ironman triathlon performance and intends to determine potential predictor variables for Ironman race performance in female and male triathletes.Methods: A literature search was performed in PubMed using the terms “Ironman”, “triathlon”, and “performance”. All resulting articles were searched for related citations.Results: Age, previous experience, sex, training, origin, anthropometric and physiological characteristics, pacing, and performance in split disciplines were predictive. Differences exist between the sexes for anthropometric characteristics. The most important predictive variables for a fast Ironman race time were age of 30–35 years (women and men, a fast personal best time in Olympic distance triathlon (women and men, a fast personal best time in marathon (women and men, high volume and high speed in training where high volume was more important than high speed (women and men, low body fat, low skin-fold thicknesses and low circumference of upper arm (only men, and origin from the United States of America (women and men.Conclusion: These findings may help athletes and coaches to plan an Ironman triathlon career. Age and previous experience are important to find the right point in the life of a triathlete to switch from the shorter triathlon distances to the Ironman distance. Future studies need to correlate physiological characteristics such as maximum oxygen uptake with Ironman race time to investigate their potential predictive value and to investigate socio-economic aspects in Ironman triathlon.Keywords: swimming, cycling, running, age, body fat, sex
Finding the optimal Bayesian network given a constraint graph
Directory of Open Access Journals (Sweden)
Jacob M. Schreiber
2017-07-01
Full Text Available Despite recent algorithmic improvements, learning the optimal structure of a Bayesian network from data is typically infeasible past a few dozen variables. Fortunately, domain knowledge can frequently be exploited to achieve dramatic computational savings, and in many cases domain knowledge can even make structure learning tractable. Several methods have previously been described for representing this type of structural prior knowledge, including global orderings, super-structures, and constraint rules. While super-structures and constraint rules are flexible in terms of what prior knowledge they can encode, they achieve savings in memory and computational time simply by avoiding considering invalid graphs. We introduce the concept of a “constraint graph” as an intuitive method for incorporating rich prior knowledge into the structure learning task. We describe how this graph can be used to reduce the memory cost and computational time required to find the optimal graph subject to the encoded constraints, beyond merely eliminating invalid graphs. In particular, we show that a constraint graph can break the structure learning task into independent subproblems even in the presence of cyclic prior knowledge. These subproblems are well suited to being solved in parallel on a single machine or distributed across many machines without excessive communication cost.
Tam, Vincent H; Kabbara, Samer
2006-10-01
Monte Carlo simulations (MCSs) are increasingly being used to predict the pharmacokinetic variability of antimicrobials in a population. However, various MCS approaches may differ in the accuracy of the predictions. We compared the performance of 3 different MCS approaches using a data set with known parameter values and dispersion. Ten concentration-time profiles were randomly generated and used to determine the best-fit parameter estimates. Three MCS methods were subsequently used to simulate the AUC(0-infinity) of the population, using the central tendency and dispersion of the following in the subject sample: 1) K and V; 2) clearance and V; 3) AUC(0-infinity). In each scenario, 10000 subject simulations were performed. Compared to true AUC(0-infinity) of the population, mean biases by various methods were 1) 58.4, 2) 380.7, and 3) 12.5 mg h L(-1), respectively. Our results suggest that the most realistic MCS approach appeared to be based on the variability of AUC(0-infinity) in the subject sample.
Do cooperative learning and family involvement improve variables linked to academic performance?
Santos Rego, Miguel A; Ferraces Otero, María J; Godas Otero, Agustín; Lorenzo Moledo, María M
2018-05-01
One of the most serious problems in the Spanish education system is the high percentage of school failure in Compulsory Secondary Education. The aim of this study is to analyze the influence of a socio-educational program based on cooperative learning and family involvement on a series of variables related to academic performance, paying particular attention to the differences between retained and non-retained students. A two-group quasi-experimental design incorporating pre-testing and post-testing was used. The study involved 146 students in the experimental group and 123 in the control group, 8 teachers, and 89 parents or other family members. The program was observed to have a positive effect on self-image, study habits, satisfaction with the subject, maternal support and control, and opinions about the school. In addition, the results for non-retained students are better. Cooperative work and family involvement in education affect the variables which research links to improving school performance.
Performance of a 3 kW wind turbine generator with variable pitch control system
International Nuclear Information System (INIS)
Nagai, Baku M.; Ameku, Kazumasa; Roy, Jitendro Nath
2009-01-01
A prototype 3 kW horizontal upwind type wind turbine generator of 4 m in diameter has been designed and examined under real wind conditions. The machine was designed based on the concept that even small wind turbines should have a variable pitch control system just as large wind turbines, especially in Japan where typhoons occur at least once a year. A characteristic of the machine is the use of a worm and gear system with a stepping motor installed in the center of the hub, and the rotational main shaft. The machine is constructed with no mechanical breaking system so as to avoid damage from strong winds. In a storm, the wind turbine is slowed down by adjusting the pitch angle and the maximum electrical load. Usually the machine is controlled at several stages depending on the rotational speed of the blades. Two control methods have been applied: the variable pitch angle, and regulation of the generator field current. The characteristics of the generator under each rotational speed and field current are first investigated in the laboratory. This paper describes the performances of the wind turbine in terms of the functions of wind turbine rotational speed, generated outputs, and its stability for wind speed changes. The expected performances of the machine have been confirmed under real wind conditions and compared with numerical simulation results. The wind turbine showed a power coefficient of 0.257 under the average wind speed of 7.3 m/s.
Krieger, M; Schwabenbauer, E-M; Hoischen-Taubner, S; Emanuelson, U; Sundrum, A
2018-03-01
Production diseases in dairy cows are multifactorial, which means they emerge from complex interactions between many different farm variables. Variables with a large impact on production diseases can be identified for groups of farms using statistical models, but these methods cannot be used to identify highly influential variables in individual farms. This, however, is necessary for herd health planning, because farm conditions and associated health problems vary largely between farms. The aim of this study was to rank variables according to their anticipated effect on production diseases on the farm level by applying a graph-based impact analysis on 192 European organic dairy farms. Direct impacts between 13 pre-defined variables were estimated for each farm during a round-table discussion attended by practitioners, that is farmer, veterinarian and herd advisor. Indirect impacts were elaborated through graph analysis taking into account impact strengths. Across farms, factors supposedly exerting the most influence on production diseases were 'feeding', 'hygiene' and 'treatment' (direct impacts), as well as 'knowledge and skills' and 'herd health monitoring' (indirect impacts). Factors strongly influenced by production diseases were 'milk performance', 'financial resources' and 'labour capacity' (directly and indirectly). Ranking of variables on the farm level revealed considerable differences between farms in terms of their most influential and most influenced farm factors. Consequently, very different strategies may be required to reduce production diseases in these farms. The method is based on perceptions and estimations and thus prone to errors. From our point of view, however, this weakness is clearly outweighed by the ability to assess and to analyse farm-specific relationships and thus to complement general knowledge with contextual knowledge. Therefore, we conclude that graph-based impact analysis represents a promising decision support tool for herd
Chain-loaded variable resistance warm-up improves free-weight maximal back squat performance.
Mina, Minas A; Blazevich, Anthony J; Giakas, Giannis; Seitz, Laurent B; Kay, Anthony D
2016-11-01
The acute influence of chain-loaded variable resistance exercise on subsequent free-weight one-repetition maximum (1-RM) back squat performance was examined in 16 recreationally active men. The participants performed either a free-weight resistance (FWR) or chain-loaded resistance (CLR) back squat warm-up at 85% 1-RM on two separate occasions. After a 5-min rest, the participants attempted a free-weight 1-RM back squat; if successful, subsequent 5% load additions were made until participants failed to complete the lift. During the 1-RM trials, 3D knee joint kinematics and knee extensor and flexor electromyograms (EMG) were recorded simultaneously. Significantly greater 1-RM (6.2 ± 5.0%; p .05) was found in concentric EMG, eccentric or concentric knee angular velocity, or peak knee flexion angle. Performing a CLR warm-up enhanced subsequent free-weight 1-RM performance without changes in knee flexion angle or eccentric and concentric knee angular velocities; thus a real 1-RM increase was achieved as the mechanics of the lift were not altered. These results are indicative of a potentiating effect of CLR in a warm-up, which may benefit athletes in tasks where high-level strength is required.
Influence of variable resistance loading on subsequent free weight maximal back squat performance.
Mina, Minas A; Blazevich, Anthony J; Giakas, Giannis; Kay, Anthony D
2014-10-01
The purpose of the study was to determine the potentiating effects of variable resistance (VR) exercise during a warm-up on subsequent free-weight resistance (FWR) maximal squat performance. In the first session, 16 recreationally active men (age = 26.0 ± 7.8 years; height = 1.7 ± 0.2 m; mass = 82.6 ± 12.7 kg) were familiarized with the experimental protocols and tested for 1 repetition maximum (1RM) squat lift. The subjects then visited the laboratory on 2 further occasions under either control or experimental conditions. During these conditions, 2 sets of 3 repetitions of either FWR (control) or VR (experimental) squat lifts at 85% of 1RM were performed; during the experimental condition, 35% of the load was generated from band tension. After a 5-minute rest, 1RM, 3D knee joint kinematics, and vastus medialis, vastus lateralis, rectus femoris, and semitendinosus electromyogram (EMG) signals were recorded simultaneously. No subject increased 1RM after FWR, however, 13 of 16 (81%) subjects increased 1RM after VR (mean = 7.7%; p 0.05) or EMG amplitudes (mean = 5.9%; p > 0.05) occurred. Preconditioning using VR significantly increased 1RM without detectable changes in knee extensor muscle activity or knee flexion angle, although eccentric and concentric velocities were reduced. Thus, VR seems to potentiate the neuromuscular system to enhance subsequent maximal lifting performance. Athletes could thus use VR during warm-up routines to maximize squat performance.
Constructing Knowledge Graphs of Depression
Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing
2017-01-01
Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge
Partitioning graphs into connected parts
Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.
2009-01-01
The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest
Isoperimetric inequalities for minimal graphs
International Nuclear Information System (INIS)
Pacelli Bessa, G.; Montenegro, J.F.
2007-09-01
Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)
Ancestral Genres of Mathematical Graphs
Gerofsky, Susan
2011-01-01
Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…
Humidity Graphs for All Seasons.
Esmael, F.
1982-01-01
In a previous article in this journal (Vol. 17, p358, 1979), a wet-bulb depression table was recommended for two simple experiments to determine relative humidity. However, the use of a graph is suggested because it gives the relative humidity directly from the wet and dry bulb readings. (JN)
Contracting a planar graph efficiently
DEFF Research Database (Denmark)
Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam
2017-01-01
the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...
Graph Model Based Indoor Tracking
DEFF Research Database (Denmark)
Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin
2009-01-01
The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...
A graph with fractional revival
Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc
2018-02-01
An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.
Fixation Time for Evolutionary Graphs
Nie, Pu-Yan; Zhang, Pei-Ai
Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.
GraphAlignment: Bayesian pairwise alignment of biological networks
Directory of Open Access Journals (Sweden)
Kolář Michal
2012-11-01
Full Text Available Abstract Background With increased experimental availability and accuracy of bio-molecular networks, tools for their comparative and evolutionary analysis are needed. A key component for such studies is the alignment of networks. Results We introduce the Bioconductor package GraphAlignment for pairwise alignment of bio-molecular networks. The alignment incorporates information both from network vertices and network edges and is based on an explicit evolutionary model, allowing inference of all scoring parameters directly from empirical data. We compare the performance of our algorithm to an alternative algorithm, Græmlin 2.0. On simulated data, GraphAlignment outperforms Græmlin 2.0 in several benchmarks except for computational complexity. When there is little or no noise in the data, GraphAlignment is slower than Græmlin 2.0. It is faster than Græmlin 2.0 when processing noisy data containing spurious vertex associations. Its typical case complexity grows approximately as O(N2.6. On empirical bacterial protein-protein interaction networks (PIN and gene co-expression networks, GraphAlignment outperforms Græmlin 2.0 with respect to coverage and specificity, albeit by a small margin. On large eukaryotic PIN, Græmlin 2.0 outperforms GraphAlignment. Conclusions The GraphAlignment algorithm is robust to spurious vertex associations, correctly resolves paralogs, and shows very good performance in identification of homologous vertices defined by high vertex and/or interaction similarity. The simplicity and generality of GraphAlignment edge scoring makes the algorithm an appropriate choice for global alignment of networks.
Using Behavior Over Time Graphs to Spur Systems Thinking Among Public Health Practitioners.
Calancie, Larissa; Anderson, Seri; Branscomb, Jane; Apostolico, Alexsandra A; Lich, Kristen Hassmiller
2018-02-01
Public health practitioners can use Behavior Over Time (BOT) graphs to spur discussion and systems thinking around complex challenges. Multiple large systems, such as health care, the economy, and education, affect chronic disease rates in the United States. System thinking tools can build public health practitioners' capacity to understand these systems and collaborate within and across sectors to improve population health. BOT graphs show a variable, or variables (y axis) over time (x axis). Although analyzing trends is not new to public health, drawing BOT graphs, annotating the events and systemic forces that are likely to influence the depicted trends, and then discussing the graphs in a diverse group provides an opportunity for public health practitioners to hear each other's perspectives and creates a more holistic understanding of the key factors that contribute to a trend. We describe how BOT graphs are used in public health, how they can be used to generate group discussion, and how this process can advance systems-level thinking. Then we describe how BOT graphs were used with groups of maternal and child health (MCH) practitioners and partners (N = 101) during a training session to advance their thinking about MCH challenges. Eighty-six percent of the 84 participants who completed an evaluation agreed or strongly agreed that they would use this BOT graph process to engage stakeholders in their home states and jurisdictions. The BOT graph process we describe can be applied to a variety of public health issues and used by practitioners, stakeholders, and researchers.
Coloring sums of extensions of certain graphs
Directory of Open Access Journals (Sweden)
Johan Kok
2017-12-01
Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.
Mathematical Minute: Rotating a Function Graph
Bravo, Daniel; Fera, Joseph
2013-01-01
Using calculus only, we find the angles you can rotate the graph of a differentiable function about the origin and still obtain a function graph. We then apply the solution to odd and even degree polynomials.
Towards a theory of geometric graphs
Pach, Janos
2004-01-01
The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...
Bounds on Gromov hyperbolicity constant in graphs
Indian Academy of Sciences (India)
Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.
Summary: beyond fault trees to fault graphs
International Nuclear Information System (INIS)
Alesso, H.P.; Prassinos, P.; Smith, C.F.
1984-09-01
Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability
Torsional rigidity, isospectrality and quantum graphs
International Nuclear Information System (INIS)
Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon
2017-01-01
We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)
Variability in performance on a work simulation test of physical fitness for firefighters.
Boyd, Liam; Rogers, Todd; Docherty, David; Petersen, Stewart
2015-04-01
The Canadian Forces Firefighter Physical Fitness Maintenance Evaluation (FF PFME) requires firefighters in full fire-protective ensemble, including self-contained breathing apparatus, to correctly complete 10 work-related tasks on a measured and calibrated course. Fitness for duty is inferred from completion time of the course. We hypothesized that completion time may be dependent on pacing strategy and day-to-day fluctuations in biological function. To examine variability in performance, 20 females and 31 males (mean ± SD; age, 27.6 ± 10.5 years; height, 176.7 ± 8.3 cm; mass, 77.3 ± 13.4 kg) were familiarized with the FF PFME and then completed the test on 6 separate days. Pre-test behaviours (e.g., sleep, diet) and test conditions (e.g., calibration, time of day) were consistent. Repeated-measures ANOVA revealed a significant decrease in completion time between tests 1 and 6 (18.7%) and between all sequential pairs (e.g., tests 1 and 2). There was also a small but significant increase in the fraction of total test time for task completion and a corresponding decrease in the time to transition between tasks. The performance improvements cannot be explained by differences in effort (heart rate and perceived exertion). Coefficient of variation for tests 1, 2, and 3 was 7% and for tests 4, 5, and 6 was 2.6%. The results indicate the importance of practice on performance and the potential for false-positive or false-negative decision errors if biological variability is not taken into account.
Knott, P. R.; Blozy, J. T.; Staid, P. S.
1981-01-01
The results of model scale parametric static and wind tunnel aerodynamic performance tests on unsuppressed coannular plug nozzle configurations with inverted velocity profile are discussed. The nozzle configurations are high-radius-ratio coannular plug nozzles applicable to dual-stream exhaust systems typical of a variable cycle engine for Advanced Supersonic Transport application. In all, seven acoustic models and eight aerodynamic performance models were tested. The nozzle geometric variables included outer stream radius ratio, inner stream to outer stream ratio, and inner stream plug shape. When compared to a conical nozzle at the same specific thrust, the results of the static acoustic tests with the coannular nozzles showed noise reductions of up to 7 PNdB. Extensive data analysis showed that the overall acoustic results can be well correlated using the mixed stream velocity and the mixed stream density. Results also showed that suppression levels are geometry and flow regulation dependent with the outer stream radius ratio, inner stream-to-outer stream velocity ratio and inner stream velocity ratio and inner stream plug shape, as the primary suppression parameters. In addition, high-radius ratio coannular plug nozzles were found to yield shock associated noise level reductions relative to a conical nozzle. The wind tunnel aerodynamic tests showed that static and simulated flight thrust coefficient at typical takeoff conditions are quite good - up to 0.98 at static conditions and 0.974 at a takeoff Mach number of 0.36. At low inner stream flow conditions significant thrust loss was observed. Using an inner stream conical plug resulted in 1% to 2% higher performance levels than nozzle geometries using a bent inner plug.
Bereskie, Ty; Haider, Husnain; Rodriguez, Manuel J; Sadiq, Rehan
2017-08-23
Traditional approaches for benchmarking drinking water systems are binary, based solely on the compliance and/or non-compliance of one or more water quality performance indicators against defined regulatory guidelines/standards. The consequence of water quality failure is dependent on location within a water supply system as well as time of the year (i.e., season) with varying levels of water consumption. Conventional approaches used for water quality comparison purposes fail to incorporate spatiotemporal variability and degrees of compliance and/or non-compliance. This can lead to misleading or inaccurate performance assessment data used in the performance benchmarking process. In this research, a hierarchical risk-based water quality performance benchmarking framework is proposed to evaluate small drinking water systems (SDWSs) through cross-comparison amongst similar systems. The proposed framework (R WQI framework) is designed to quantify consequence associated with seasonal and location-specific water quality issues in a given drinking water supply system to facilitate more efficient decision-making for SDWSs striving for continuous performance improvement. Fuzzy rule-based modelling is used to address imprecision associated with measuring performance based on singular water quality guidelines/standards and the uncertainties present in SDWS operations and monitoring. This proposed R WQI framework has been demonstrated using data collected from 16 SDWSs in Newfoundland and Labrador and Quebec, Canada, and compared to the Canadian Council of Ministers of the Environment WQI, a traditional, guidelines/standard-based approach. The study found that the R WQI framework provides an in-depth state of water quality and benchmarks SDWSs more rationally based on the frequency of occurrence and consequence of failure events.
Bond graph modeling of centrifugal compression systems
Uddin, Nur; Gravdahl, Jan Tommy
2015-01-01
A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...
A Graph Calculus for Predicate Logic
Directory of Open Access Journals (Sweden)
Paulo A. S. Veloso
2013-03-01
Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.
Sphere and dot product representations of graphs
R.J. Kang (Ross); T. Müller (Tobias)
2012-01-01
textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such
Deep Learning with Dynamic Computation Graphs
Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter
2017-01-01
Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...
Constructs for Programming with Graph Rewrites
Rodgers, Peter
2000-01-01
Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...
An original approach to the mathematical concept of graph from braid crafts
Directory of Open Access Journals (Sweden)
Albanese Veronica
2016-01-01
Full Text Available In previous researches we found that a community of Argentinean artisans models its own practices of braiding using graphs. Inspired by these findings, we designed an educational activity to introduce the concept of graphs. The study of graphs helps students to develop combinatorial and systematic thinking as well as skills to model reality and abstract and generalize patterns from particular situations. The tasks proposed aim to construct the concept of graphs, then identify characteristics that allow some graphs to be models of braids and finally use them to invent more graphs for new braids. The activity performed in a secondary school teachers’ educational course, had quite satisfactory results due to the number of braids invented and the small amount of mistakes made by the participants.
A Hybrid Approach to Processing Big Data Graphs on Memory-Restricted Systems
Harshvardhan,
2015-05-01
With the advent of big-data, processing large graphs quickly has become increasingly important. Most existing approaches either utilize in-memory processing techniques that can only process graphs that fit completely in RAM, or disk-based techniques that sacrifice performance. In this work, we propose a novel RAM-Disk hybrid approach to graph processing that can scale well from a single shared-memory node to large distributed-memory systems. It works by partitioning the graph into sub graphs that fit in RAM and uses a paging-like technique to load sub graphs. We show that without modifying the algorithms, this approach can scale from small memory-constrained systems (such as tablets) to large-scale distributed machines with 16, 000+ cores.
Knechtle, Beat; Knechtle, Patrizia; Barandun, Ursula; Rosemann, Thomas
2011-05-01
The relationship between skin-fold thickness and running has been investigated in distances ranging from 100 m to the marathon distance (42.195 km), with the exclusion of the half-marathon distance (21.0975 km). We investigated the association between anthropometric variables, prerace experience, and training variables with race time in 42 recreational, nonprofessional, female half-marathon runners using bi- and multivariate analysis. Body weight (r, 0.60); body mass index (r, 0.48); body fat percentage (r, 0.56); pectoral (r, 0.61), mid-axilla (r, 0.69), triceps (r, 0.49), subscapular (r, 0.61), abdominal (r, 0.59), suprailiac (r, 0.55), and medial calf (r, 0.53) skin-fold thickness; mean speed of the training sessions (r, -0.68); and personal best time in a half-marathon (r, 0.69) correlated with race time after bivariate analysis. Body weight (P = 0.0054), pectoral skin-fold thickness (P = 0.0068), and mean speed of the training sessions (P = 0.0041) remained significant after multivariate analysis. Mean running speed during training was related to mid-axilla (r, -0.31), subscapular (r, -0.38), abdominal (r, -0.44), and suprailiac (r, -0.41) skin-fold thickness, the sum of 8 skin-fold thicknesses (r, -0.36); and percent body fat (r, -0.31). It was determined that variables of both anthropometry and training were related to half-marathon race time, and that skin-fold thicknesses were associated with running speed during training. For practical applications, high running speed during training (as opposed to extensive training) may both reduce upper-body skin-fold thicknesses and improve race performance in recreational female half-marathon runners.
On the sizes of expander graphs and minimum distances of graph codes
DEFF Research Database (Denmark)
Høholdt, Tom; Justesen, Jørn
2014-01-01
We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....
McMillen, Sue; McMillen, Beth
2010-01-01
Connecting stories to qualitative coordinate graphs has been suggested as an effective instructional strategy. Even students who are able to "create" bar graphs may struggle to correctly "interpret" them. Giving children opportunities to work with qualitative graphs can help them develop the skills to interpret, describe, and compare information…
The groupies of random multipartite graphs
Portmann, Marius; Wang, Hongyun
2012-01-01
If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.
Modeling Software Evolution using Algebraic Graph Rewriting
Ciraci, Selim; van den Broek, Pim
We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo
2009-01-01
In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java
An intersection graph of straight lines
DEFF Research Database (Denmark)
Thomassen, Carsten
2002-01-01
G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
2005-01-01
We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...
Cycles in weighted graphs and related topics
Zhang, Shenggui
2002-01-01
This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain
Graph Transformation Semantics for a QVT Language
Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel
It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to
Girth 5 graphs from relative difference sets
DEFF Research Database (Denmark)
Jørgensen, Leif Kjær
We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...
Improper colouring of (random) unit disk graphs
Kang, R.J.; Müller, T.; Sereni, J.S.
2008-01-01
For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed
Alliances and Bisection Width for Planar Graphs
DEFF Research Database (Denmark)
Olsen, Martin; Revsbæk, Morten
2013-01-01
An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...
A Type Graph Model for Java Programs
Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.
2009-01-01
In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax
RATGRAPH: Computer Graphing of Rational Functions.
Minch, Bradley A.
1987-01-01
Presents an easy-to-use Applesoft BASIC program that graphs rational functions and any asymptotes that the functions might have. Discusses the nature of rational functions, graphing them manually, employing a computer to graph rational functions, and describes how the program works. (TW)
A new cluster algorithm for graphs
S. van Dongen
1998-01-01
textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a
Well-covered graphs and factors
DEFF Research Database (Denmark)
Randerath, Bert; Vestergaard, Preben D.
2006-01-01
A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...
A new characterization of trivially perfect graphs
Directory of Open Access Journals (Sweden)
Christian Rubio Montiel
2015-03-01
Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.
47 CFR 80.761 - Conversion graphs.
2010-10-01
... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...
FastTracker performance using the new“Variable Resolution Associative Memory”for Atlas
Iizawa, T; The ATLAS collaboration
2012-01-01
We report on performances of the new “variable resolution Associative Memory (AM)”applied to the reconstruction of top pair events buried in a large pile-up environment using the ATLAS detector. The AM is a VLSI processor for pattern recognition based on Content Addressable Memory (CAM) architecture. The AM is optimized for on-line track finding in high-energy physics experiments. Pattern matching is carried out by finding track candidates in coarse resolution “roads”. A large AM bank stores all trajectories of interest, called “patterns”, for a given detector resolution. The AM extracts roads compatible with a given event during detector read-out. Two important variables characterize the quality of the AM bank: its “coverage” (the fraction of tracks that match at least one pattern in the bank) and the level of “fake candidates” (roughly proportional to the number of patterns in the bank). As the luminosity increases, the fake rate increases rapidly because of the increased silicon occupan...
Directory of Open Access Journals (Sweden)
Kartika Dewi
2016-09-01
Full Text Available This article aimed to examine the influence of Corporate Social Responsibility (CSR disclosure to the financial performance proxy on Return on Assets (ROA, Return on Equity (ROE, and company value proxy on Price to Book Value (PBV empirically as well as knowing the existence of the audit quality as moderating variable whether it will affect the relationship between CSR disclosure on ROA, ROE, and PBV. The object of this study was mining companies listed on the Indonesia Stock Exchange period 2010-2012. The sample was selected using a purposive sampling method and obtained samples as many as 26 companies with a total data of 78 data. Hypothesis testing methods used were simple regression analysis and moderated regression analysis. The results of this study showed that Corporate Social Responsibility (CSR disclosure had an effect on ROA, but had no effect on ROE and PBV, and audit quality as a moderating variable could not affect the relationship of CSR disc losure on ROA, ROE, and PBV.
International Nuclear Information System (INIS)
Kim, Sung Hun; Kang, Bong Joo; Choi, Byung Gil; Choi, Jae Jung; Lee, Ji Hye; Song, Byung Joo; Choe, Byung Joo; Park, Sarah; Kim, Hyunbin
2013-01-01
To compare the detection performance of the automated whole breast ultrasound (AWUS) with that of the hand-held breast ultrasound (HHUS) and to evaluate the interobserver variability in the interpretation of the AWUS. AWUS was performed in 38 breast cancer patients. A total of 66 lesions were included: 38 breast cancers, 12 additional malignancies and 16 benign lesions. Three breast radiologists independently reviewed the AWUS data and analyzed the breast lesions according to the BI-RADS classification. The detection rate of malignancies was 98.0% for HHUS and 90.0%, 88.0% and 96.0% for the three readers of the AWUS. The sensitivity and the specificity were 98.0% and 62.5% in HHUS, 90.0% and 87.5% for reader 1, 88.0% and 81.3% for reader 2, and 96.0% and 93.8% for reader 3, in AWUS. There was no significant difference in the radiologists' detection performance, sensitivity and specificity (p > 0.05) between the two modalities. The interobserver agreement was fair to good for the ultrasonographic features, categorization, size, and the location of breast masses. AWUS is thought to be useful for detecting breast lesions. In comparison with HHUS, AWUS shows no significant difference in the detection rate, sensitivity and the specificity, with high degrees of interobserver agreement
Performance optimization for a variable throat ejector in a solar refrigeration system
Yen, R.H.; Huang, B.J.; Chen, C.Y.; Shiu, T.Y.; Cheng, C.W.; Chen, S.S.; Shestopalov, K.
2013-01-01
In a solar vapor ejector refrigeration system, the solar heat supply may vary because of variations in solar irradiation intensity, making it difficult to maintain a steady generator temperature. To improve ejector performance, this study proposes a variable throat ejector (VTEJ) and analyzes its performance using CFD simulations. The following conclusions can be drawn. An ejector with a greater throat area and larger solar collector allows a wider operating range of generator temperatures, but may be overdesigned and expensive. Conversely, decreasing the throat area limits the operating range of generator temperatures. Thus the ejector with a fixed throat area may be unsuitable to use solar energy as a heat source. For a VTEJ, this study derives a curve-fitting relationship between the optimum throat area ratio and the operating temperatures. Using this relationship to adjust the throat area ratio, the ejector can consistently achieve optimal and stable performances under a varying solar heat supply. © 2013 Elsevier Ltd and IIR. All rights reserved.
Directory of Open Access Journals (Sweden)
Zhang Yijing
2015-01-01
Full Text Available Objectives. The present study aimed to investigate the effects of guided imagery training on heart rate variability in individuals while performing spaceflight emergency tasks. Materials and Methods. Twenty-one student subjects were recruited for the experiment and randomly divided into two groups: imagery group (n=11 and control group (n=10. The imagery group received instructor-guided imagery (session 1 and self-guided imagery training (session 2 consecutively, while the control group only received conventional training. Electrocardiograms of the subjects were recorded during their performance of nine spaceflight emergency tasks after imagery training. Results. In both of the sessions, the root mean square of successive differences (RMSSD, the standard deviation of all normal NN (SDNN, the proportion of NN50 divided by the total number of NNs (PNN50, the very low frequency (VLF, the low frequency (LF, the high frequency (HF, and the total power (TP in the imagery group were significantly higher than those in the control group. Moreover, LF/HF of the subjects after instructor-guided imagery training was lower than that after self-guided imagery training. Conclusions. Guided imagery was an effective regulator for HRV indices and could be a potential stress countermeasure in performing spaceflight tasks.
Energy Technology Data Exchange (ETDEWEB)
Kim, Sung Hun; Kang, Bong Joo; Choi, Byung Gil; Choi, Jae Jung; Lee, Ji Hye [Department of Radiology, Seoul St. Mary' s Hospital, College of Medicine, The Catholic University of Korea, Seoul 137-701 (Korea, Republic of); Song, Byung Joo; Choe, Byung Joo [Department of General Surgery, Seoul St. Mary' s Hospital, College of Medicine, The Catholic University of Korea, Seoul 137-701 (Korea, Republic of); Park, Sarah [Department of Internal Medicine, Seoul St. Mary' s Hospital, College of Medicine, The Catholic University of Korea, Seoul 137-701 (Korea, Republic of); Kim, Hyunbin [CMC Clinical Research Coordinating Center, College of Medicine, The Catholic University of Korea, Seoul 137-701 (Korea, Republic of)
2013-07-01
To compare the detection performance of the automated whole breast ultrasound (AWUS) with that of the hand-held breast ultrasound (HHUS) and to evaluate the interobserver variability in the interpretation of the AWUS. AWUS was performed in 38 breast cancer patients. A total of 66 lesions were included: 38 breast cancers, 12 additional malignancies and 16 benign lesions. Three breast radiologists independently reviewed the AWUS data and analyzed the breast lesions according to the BI-RADS classification. The detection rate of malignancies was 98.0% for HHUS and 90.0%, 88.0% and 96.0% for the three readers of the AWUS. The sensitivity and the specificity were 98.0% and 62.5% in HHUS, 90.0% and 87.5% for reader 1, 88.0% and 81.3% for reader 2, and 96.0% and 93.8% for reader 3, in AWUS. There was no significant difference in the radiologists' detection performance, sensitivity and specificity (p > 0.05) between the two modalities. The interobserver agreement was fair to good for the ultrasonographic features, categorization, size, and the location of breast masses. AWUS is thought to be useful for detecting breast lesions. In comparison with HHUS, AWUS shows no significant difference in the detection rate, sensitivity and the specificity, with high degrees of interobserver agreement.
Yijing, Zhang; Xiaoping, Du; Fang, Liu; Xiaolu, Jing; Bin, Wu
2015-01-01
Objectives. The present study aimed to investigate the effects of guided imagery training on heart rate variability in individuals while performing spaceflight emergency tasks. Materials and Methods. Twenty-one student subjects were recruited for the experiment and randomly divided into two groups: imagery group (n = 11) and control group (n = 10). The imagery group received instructor-guided imagery (session 1) and self-guided imagery training (session 2) consecutively, while the control group only received conventional training. Electrocardiograms of the subjects were recorded during their performance of nine spaceflight emergency tasks after imagery training. Results. In both of the sessions, the root mean square of successive differences (RMSSD), the standard deviation of all normal NN (SDNN), the proportion of NN50 divided by the total number of NNs (PNN50), the very low frequency (VLF), the low frequency (LF), the high frequency (HF), and the total power (TP) in the imagery group were significantly higher than those in the control group. Moreover, LF/HF of the subjects after instructor-guided imagery training was lower than that after self-guided imagery training. Conclusions. Guided imagery was an effective regulator for HRV indices and could be a potential stress countermeasure in performing spaceflight tasks. PMID:26137491
Performance optimization for a variable throat ejector in a solar refrigeration system
Yen, R.H.
2013-08-01
In a solar vapor ejector refrigeration system, the solar heat supply may vary because of variations in solar irradiation intensity, making it difficult to maintain a steady generator temperature. To improve ejector performance, this study proposes a variable throat ejector (VTEJ) and analyzes its performance using CFD simulations. The following conclusions can be drawn. An ejector with a greater throat area and larger solar collector allows a wider operating range of generator temperatures, but may be overdesigned and expensive. Conversely, decreasing the throat area limits the operating range of generator temperatures. Thus the ejector with a fixed throat area may be unsuitable to use solar energy as a heat source. For a VTEJ, this study derives a curve-fitting relationship between the optimum throat area ratio and the operating temperatures. Using this relationship to adjust the throat area ratio, the ejector can consistently achieve optimal and stable performances under a varying solar heat supply. © 2013 Elsevier Ltd and IIR. All rights reserved.
Directory of Open Access Journals (Sweden)
Valéria Leme Gonçalves Panissa
2016-03-01
Full Text Available PRUPOSE: To investigate the effects of a 5-km high-intensity interval exercise (HIIE on heart rate variability (HRV and subsequent strength performance. METHODS: nine trained males performed a control session composed of a half-squat strength exercise (4 x 80% of one repetition maximum – 1RM in isolation and 30-min, 1-, 4-, 8- and 24-h after an HIIE (1-min at the velocity peak:1-min passive recovery. All experimental sessions were performed on different days. The maximum number of repetitions and total weight lifted during the strength exercise were registered in all conditions; in addition, prior to each session, HRV were assessed [beat-to-beat intervals (RR and log-transformed of root means square of successive differences in the normal-to-normal intervals (lnRMSSD]. RESULTS: Performance in the strength exercise dropped at 30-min (31% and 1-h (19% post-HIIE concomitantly with lower values of RR (781±79 ms; 799±134 ms, respectively in the same recovery intervals compared to the control (1015±197 ms. Inferential analysis did not detect any effect of condition on lnRMSSD, however, values were lower after 30-min (3.5±0.4 ms and 1-h (3.3±0.5 ms with moderate and large effect sizes (0.9 and 1.2, respectively compared with the control condition (3.9±0.4 ms. CONCLUSION: Both RR and lnRMSSD seem to be associated with deleterious effects on strength performance, although further studies should be conducted to clarify this association.
Hultsch, D F; MacDonald, S W; Hunter, M A; Levy-Bencheton, J; Strauss, E
2000-10-01
Intraindividual variability in latency and accuracy of cognitive performance across both trials and occasions was examined in 3 groups of older adults: healthy adults, adults with arthritis, and adults diagnosed with mild dementia. Participants completed 2 reaction-time and 2 episodic-memory tasks on 4 occasions. Results indicated that intraindividual variability in latency was greater in individuals diagnosed with mild dementia than in adults who were neurologically intact, regardless of their health status. Individual differences in variability were stable over time and across cognitive domains. Intraindividual variability was also related to level of performance and was uniquely predictive of neurological status, independent of level of performance. Results suggest that intraindividual variability may be a behavioral indicator of compromised neurological mechanisms.
Many-core graph analytics using accelerated sparse linear algebra routines
Kozacik, Stephen; Paolini, Aaron L.; Fox, Paul; Kelmelis, Eric
2016-05-01
Graph analytics is a key component in identifying emerging trends and threats in many real-world applications. Largescale graph analytics frameworks provide a convenient and highly-scalable platform for developing algorithms to analyze large datasets. Although conceptually scalable, these techniques exhibit poor performance on modern computational hardware. Another model of graph computation has emerged that promises improved performance and scalability by using abstract linear algebra operations as the basis for graph analysis as laid out by the GraphBLAS standard. By using sparse linear algebra as the basis, existing highly efficient algorithms can be adapted to perform computations on the graph. This approach, however, is often less intuitive to graph analytics experts, who are accustomed to vertex-centric APIs such as Giraph, GraphX, and Tinkerpop. We are developing an implementation of the high-level operations supported by these APIs in terms of linear algebra operations. This implementation is be backed by many-core implementations of the fundamental GraphBLAS operations required, and offers the advantages of both the intuitive programming model of a vertex-centric API and the performance of a sparse linear algebra implementation. This technology can reduce the number of nodes required, as well as the run-time for a graph analysis problem, enabling customers to perform more complex analysis with less hardware at lower cost. All of this can be accomplished without the requirement for the customer to make any changes to their analytics code, thanks to the compatibility with existing graph APIs.
Directory of Open Access Journals (Sweden)
Botek Michal
2016-12-01
Full Text Available This cross-sectional study compared somatic, endurance performance determinants and heart rate variability (HRV profiles of professional soccer players divided into different age groups: GI (17–19.9 years; n = 23, GII (20–24.9 years; n = 45, GIII (25–29.9 years; n = 30, and GIV (30–39 years; n = 26. Players underwent somatic and HRV assessment and maximal exercise testing. HRV was analyzed by spectral analysis of HRV, and high (HF and low (LF frequency power was transformed by a natural logarithm (Ln. Players in GIV (83 ± 7 kg were heavier (p 25 years showed negligible differences in Pmax unlike the age group differences demonstrated in VO2max. A shift towards relative sympathetic dominance, particularly due to reduced vagal activity, was apparent after approximately 8 years of competing at the professional level.
Li, Chuan-qi; Yang, Meng-jie; Zhang, Xiu-rong; Chen, Mei-juan; He, Dong-dong; Fan, Qing-bin
2014-07-01
A construction scheme of variable-weight optical orthogonal codes (VW-OOCs) for asynchronous optical code division multiple access (OCDMA) system is proposed. According to the actual situation, the code family can be obtained by programming in Matlab with the given code weight and corresponding capacity. The formula of bit error rate (BER) is derived by taking account of the effects of shot noise, avalanche photodiode (APD) bulk, thermal noise and surface leakage currents. The OCDMA system with the VW-OOCs is designed and improved. The study shows that the VW-OOCs have excellent performance of BER. Despite of coming from the same code family or not, the codes with larger weight have lower BER compared with the other codes in the same conditions. By taking simulation, the conclusion is consistent with the analysis of BER in theory. And the ideal eye diagrams are obtained by the optical hard limiter.
Steady state performance evaluation of variable geometry twin-entry turbine
International Nuclear Information System (INIS)
Romagnoli, A.; Martinez-Botas, R.F.; Rajoo, S.
2011-01-01
This paper presents the results from an experimental investigation conducted on different turbine designs for an automotive turbocharger. The design progression was based on a commercial nozzleless unit that was modified into a variable geometry single and twin-entry turbine. The main geometrical parameters were kept constant for all the configurations and the turbine was tested under steady flow conditions. A significant depreciation in efficiency was measured between the single and twin-entry configuration due to the mixing effects. The nozzleless unit provides the best compromise in terms of performance at different speeds. The twin-entry turbine was also tested under partial and unequal admissions. Based on the test results a method to determine the swallowing capacity under partial admission given the full admission map is presented. The test results also showed that the turbine swallowing capacity under unequal admission is linked to the full admission case.
The Interobserver Variability and Diagnostic Performance of 3-Dimensional Breast Ultrasound
International Nuclear Information System (INIS)
Lyou, Chae Yeon; Kim, Sun Mi; Jang, Mi Jung; Kim, Sung Won; Kang, Eun Young; Park, So Yeon; Moon, Woo Kyung
2011-01-01
We wanted to evaluate the interobserver variability and diagnostic performance of 3-dimensional (3D) breast ultrasound (US) as compared with that of 2- dimensional (2D) US. We included 150 patients who received US-guided core biopsy and 3D US between June 2009 and April 2010. Three breast imaging radiologists analyzed the 2D and 3D US images using the Breast Imaging Reporting and Data System (BI-RADS) lexicon. The intra-observer agreement and inter-observer agreement were calculated. The sensitivity and specificity of 2D and 3D US were evaluated. The intra-observer agreement between 2D and 3D US was mostly slight or fair agreement. However, in terms of the final category, there was substantial agreement for all three radiologists. The inter-observer agreement of 3D US was similar to that of 2D US (moderate agreement for shape, orientation, circumscribed margin and boundary: fair agreement for indistinct margin, angular margin, microlobulated margin, echo pattern and final category). The sensitivity of 3D US for breast cancer was higher than that of 2D US for two radiologists (2D vs. 3D for reader 2: 55.8% vs. 61.5%, 2D vs. 3D for reader 3: 59.6% vs. 63.5%), and the specificity of 3D US was lower than that of 2D US for all the readers (2D vs. 3D for reader 1: 90.8% vs. 86.7%, 2D vs. 3D for reader 2: 90.8% vs. 87.8%, 2D vs. 3D for reader 3: 94.9% vs. 90.8%), but the difference was not significant (p ≥ 0.05). The interobserver variability and diagnostic performance of 3D breast US were similar to those of 2D US
Maćkała, Krzysztof; Fostiak, Marek
2015-07-01
The purpose of this study was to examine the effect of a short high-intensity plyometric program on the improvement of explosive power of lower extremities and sprint performance as well as changes in sprinting stride variability in male sprinters. Fourteen healthy male sprinters (mean ± SD: age: 18.07 ± 0.73 years, body mass: 73 ± 9.14 kg, height: 180.57 ± 8.16 cm, and best 100 m: 10.89 ± 0.23) participated in the experiment. The experimental protocol included vertical jumping such as squat jump, countermovement jump, and horizontal jumps; standing long jump and standing triple jumps to assess lower-body power, maximal running velocity; a 20-m flying start sprint that evaluated variability of 10 running steps and 60-m starting block sprint. All analyzed parameters were obtained using the new technology of OptoJump-Microgate (OptoJump, Italy). The short-term plyometric training program significantly increased the explosive power of lower extremities, both vertical and horizontal jumping improvement. However, the vertical jumps increased much more than the horizontal. The 20-m improvements were derived from an increase of stride frequency from 4.31 to 4.39 Hz because of a decrease of ground contact time from 138 to 133 milliseconds. This did not translate into step length changes. Therefore, the significantly increased frequency of stride (1.8%), which is a specific expression of ground contact time reduction during support phase, resulted in an increase of speed. The training volume of 2 weeks (with 6 sessions) using high-intensity (between 180 and 250 jumps per session) plyometric exercises can be recommended as the short-term strategy that will optimize one's probability of reaching strong improvements in explosive power and sprint velocity performance.
Directory of Open Access Journals (Sweden)
Ely Rosas
2018-04-01
Full Text Available The main objective of this study was to determine associations between categorical variables pertaining to the student and his school performance, at governmental schools of the municipalities Gómez and Marcano of Nueva Esparta state, by adjusting the effects of column partnership model. The investigation was correlational in nature, with field design, based on applications to a reality of the educational context. As main results, obtained by adjusting the model in reference, the variables associated with school performance in Gómez municipality were: recreational activities, frequent use of computer at home and the use of Internet outside home to do homework. While in Marcano Municipality, they were: to have Internet at home, the place where the student is watching videogames and the number of times he eats in the day. In both municipalities, the characteristics: good feeling of the student when going to school and mastering of mathematical operations, were also linked to school performance.
On a conjecture concerning helly circle graphs
Directory of Open Access Journals (Sweden)
Durán Guillermo
2003-01-01
Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Directory of Open Access Journals (Sweden)
Katona Gyula Y.
2014-11-01
Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.
Directory of Open Access Journals (Sweden)
Kraama Liisa
2017-12-01
Full Text Available Study aim: Physically active adults have been shown to have higher heart rate variability (HRV than less active adults, but less is known about children in this regard. In adults, training-induced changes in physical performance have been shown to be related to increase in HRV, especially in its high frequency component (HF, which is a marker of parasympathetic activity. The purpose of this study was to examine whether 8 weeks of instructed physical training would improve physical performance and cardiac autonomic function (HRV in secondary school pupils and to examine the relationship between changes in physical performance and the function of the autonomic nervous system. Material and methods: The test group included 12 girls and 12 boys and the control group 7 girls and 7 boys. All the subjects were 13-15 years old. Physical training included warm up, circuit training, endurance training, stretching and relaxation 3 times a week for eight weeks. Endurance training intensity was 70-75% of maximal heart rate. Endurance, flexibility, speed and power were measured before and after training. The low frequency (LF and high frequency (HF components of HRV were recorded in supine rest and in standing conditions before and after the eight-week period. Results: Time to exhaustion in the endurance test increased in the test group (p < 0.001, flexibility and ball throwing improved in the test group (p < 0.05, while no changes were observed in the control group. No significant changes were observed in HRV in either group. Conclusions: In conclusion, eight weeks of physical training improves physical performance in children, but it might not affect autonomic cardiac function.
National Research Council Canada - National Science Library
Jordan, Mark
2001-01-01
The efficacy of dispositional individual difference team composition and group process variables in explaining team performance was examined for 1,030 military officers working in 92 teams over a 5-week period...
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar; Leus, Geert
2016-01-01
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
On 4-critical t-perfect graphs
Benchetrit, Yohann
2016-01-01
It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...
Subsampling for graph power spectrum estimation
Chepuri, Sundeep Prabhakar
2016-10-06
In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.
Proving relations between modular graph functions
International Nuclear Information System (INIS)
Basu, Anirban
2016-01-01
We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)