Review of chart recognition in document images

NASA Astrophysics Data System (ADS)

Liu, Yan; Lu, Xiaoqing; Qin, Yeyang; Tang, Zhi; Xu, Jianbo

2013-01-01

As an effective information transmitting way, chart is widely used to represent scientific statistics datum in books, research papers, newspapers etc. Though textual information is still the major source of data, there has been an increasing trend of introducing graphs, pictures, and figures into the information pool. Text recognition techniques for documents have been accomplished using optical character recognition (OCR) software. Chart recognition techniques as a necessary supplement of OCR for document images are still an unsolved problem due to the great subjectiveness and variety of charts styles. This paper reviews the development process of chart recognition techniques in the past decades and presents the focuses of current researches. The whole process of chart recognition is presented systematically, which mainly includes three parts: chart segmentation, chart classification, and chart Interpretation. In each part, the latest research work is introduced. In the last, the paper concludes with a summary and promising future research direction.

An Investigation of Applications for Thermodynamic Work Potential Methods: Working Tables and Charts for Estimation of Thermodynamic Work Potential in Equilibrium Mixtures of Jet-A and Air

NASA Technical Reports Server (NTRS)

Mavris, Dimitri; Roth, Bryce; McDonald, Rob

2002-01-01

The objective of this report is to provide a tool to facilitate the application of thermodynamic work potential methods to aircraft and engine analysis. This starts with a discussion of the theoretical background underlying these methods, which is then used to derive various equations useful for thermodynamic analysis of aircraft engines. The work potential analysis method is implemented in the form of a set of working charts and tables that can be used to graphically evaluate work potential stored in high-enthalpy gas. The range of validity for these tables is 300 to 36,000 R, pressures between between 0.01 atm and 100 atm, and fuel-air ratios from zero to stoichiometric. The derivations and charts assume mixtures of Jet-A and air as the working fluid. The thermodynamic properties presented in these charts were calculated based upon standard thermodynamic curve fits.

Optimal trajectories for an aerospace plane. Part 2: Data, tables, and graphs

NASA Technical Reports Server (NTRS)

Miele, Angelo; Lee, W. Y.; Wu, G. D.

1990-01-01

Data, tables, and graphs relative to the optimal trajectories for an aerospace plane are presented. A single-stage-to-orbit (SSTO) configuration is considered, and the transition from low supersonic speeds to orbital speeds is studied for a single aerodynamic model (GHAME) and three engine models. Four optimization problems are solved using the sequential gradient-restoration algorithm for optimal control problems: (1) minimization of the weight of fuel consumed; (2) minimization of the peak dynamic pressure; (3) minimization of the peak heating rate; and (4) minimization of the peak tangential acceleration. The above optimization studies are carried out for different combinations of constraints, specifically: initial path inclination that is either free or given; dynamic pressure that is either free or bounded; and tangential acceleration that is either free or bounded.

Interactive SIGHT: textual access to simple bar charts

NASA Astrophysics Data System (ADS)

Demir, Seniz; Oliver, David; Schwartz, Edward; Elzer, Stephanie; Carberry, Sandra; Mccoy, Kathleen F.; Chester, Daniel

2010-12-01

Information graphics, such as bar charts and line graphs, are an important component of many articles from popular media. The majority of such graphics have an intention (a high-level message) to communicate to the graph viewer. Since the intended message of a graphic is often not repeated in the accompanying text, graphics together with the textual segments contribute to the overall purpose of an article and cannot be ignored. Unfortunately, these visual displays are provided in a format which is not readily accessible to everyone. For example, individuals with sight impairments who use screen readers to listen to documents have limited access to the graphics. This article presents a new accessibility tool, the Interactive SIGHT (Summarizing Information GrapHics Textually) system, that is intended to enable visually impaired users to access the knowledge that one would gain from viewing information graphics found on the web. The current system, which is implemented as a browser extension that works on simple bar charts, can be invoked by a user via a keystroke combination while navigating the web. Once launched, Interactive SIGHT first provides a brief summary that conveys the underlying intention of a bar chart along with the chart's most significant and salient features, and then produces history-aware follow-up responses to provide further information about the chart upon request from the user. We present two user studies that were conducted with sighted and visually impaired users to determine how effective the initial summary and follow-up responses are in conveying the informational content of bar charts, and to evaluate how easy it is to use the system interface. The evaluation results are promising and indicate that the system responses are well-structured and enable visually impaired users to answer key questions about bar charts in an easy-to-use manner. Post-experimental interviews revealed that visually impaired participants were very satisfied with

Ringo: Interactive Graph Analytics on Big-Memory Machines.

PubMed

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2015-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads.

Ringo: Interactive Graph Analytics on Big-Memory Machines

PubMed Central

Perez, Yonathan; Sosič, Rok; Banerjee, Arijit; Puttagunta, Rohan; Raison, Martin; Shah, Pararth; Leskovec, Jure

2016-01-01

We present Ringo, a system for analysis of large graphs. Graphs provide a way to represent and analyze systems of interacting objects (people, proteins, webpages) with edges between the objects denoting interactions (friendships, physical interactions, links). Mining graphs provides valuable insights about individual objects as well as the relationships among them. In building Ringo, we take advantage of the fact that machines with large memory and many cores are widely available and also relatively affordable. This allows us to build an easy-to-use interactive high-performance graph analytics system. Graphs also need to be built from input data, which often resides in the form of relational tables. Thus, Ringo provides rich functionality for manipulating raw input data tables into various kinds of graphs. Furthermore, Ringo also provides over 200 graph analytics functions that can then be applied to constructed graphs. We show that a single big-memory machine provides a very attractive platform for performing analytics on all but the largest graphs as it offers excellent performance and ease of use as compared to alternative approaches. With Ringo, we also demonstrate how to integrate graph analytics with an iterative process of trial-and-error data exploration and rapid experimentation, common in data mining workloads. PMID:27081215

Atlas of the Soviet Union.

ERIC Educational Resources Information Center

Young, Harry F.

This atlas consists of 20 maps, tables, charts, and graphs with complementary text illustrating Soviet government machinery, trade and political relations, and military stance. Some topics depicted by charts and graphs include: (1) Soviet foreign affairs machinery; (2) Soviet intelligence and security services; (4) Soviet position in the United…

Visualizing a Procedure with Nassi-Schneiderman Charts.

ERIC Educational Resources Information Center

Weiss, Edmond H.

1990-01-01

Argues that Nassi-Schneiderman (NS) charts, when used to diagram human procedures, can eliminate prose ambiguities. Asserts that these devices provide most of the advantages of decision tables and trees. Suggests using NS charts in testing the logic and completeness of traditional procedures, or even in place of many traditional publications. (SG)

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

PubMed

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

2010-03-01

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

Electronic growth charts: watching our patients grow.

PubMed

Murphy, Cynthia A; Carstens, Kimberly; Villamayor, Precy

2005-01-01

Pediatric Growth Charts have been used in the pediatric community since 1977. The first growth charts were developed by the National Center for Health Statistics as a clinical tool for health care professionals. The growth charts, revised in 2000, by the Center for Disease Control consists of a series of percentile curves for selected body measurements in children [1]. Capitalizing on the benefits of our Electronic Medical Record (EMR), and as a byproduct of nursing electronic documentation of routine heights, weights, and frontal occipital circumferences, our system plots the routine measurements without additional intervention by the staff. Clinicians can view the graphs online or generate printed reports as needed during routine examination for outpatient or hospitalized care. This abstract outlines the background, design process, programming rules utilized to plot growth curves, and the evaluation of the electronic CDC growth charts in our organization.

Run charts revisited: a simulation study of run chart rules for detection of non-random variation in health care processes.

PubMed

Anhøj, Jacob; Olesen, Anne Vingaard

2014-01-01

A run chart is a line graph of a measure plotted over time with the median as a horizontal line. The main purpose of the run chart is to identify process improvement or degradation, which may be detected by statistical tests for non-random patterns in the data sequence. We studied the sensitivity to shifts and linear drifts in simulated processes using the shift, crossings and trend rules for detecting non-random variation in run charts. The shift and crossings rules are effective in detecting shifts and drifts in process centre over time while keeping the false signal rate constant around 5% and independent of the number of data points in the chart. The trend rule is virtually useless for detection of linear drift over time, the purpose it was intended for.

Learning Financial Reports From Mixed Symbolic-Spatial Graphs

ERIC Educational Resources Information Center

Tanlamai, Uthai; Soongswang, Oranuj

2011-01-01

Mixed visuals of numbers and graphs are available in various financial reports that demonstrate the financial status and risks of a firm. GWN (graphs with numbers) and TWG (table of numbers with graphs) were used as two alternative visuals derived from the actual data of two large public companies, one from food manufacturing industry (food) and…

Optimal trajectories for the aeroassisted flight experiment. Part 4: Data, tables, and graphs

NASA Technical Reports Server (NTRS)

Miele, A.; Wang, T.; Lee, W. Y.; Wang, H.; Wu, G. D.

1989-01-01

The determination of optimal trajectories for the aeroassisted flight experiment (AFE) is discussed. Data, tables, and graphs relative to the following transfers are presented: (IA) indirect ascent to a 178 NM perigee via a 197 NM apogee; and (DA) direct ascent to a 178 NM apogee. For both transfers, two cases are investigated: (1) the bank angle is continuously variable; and (2) the trajectory is divided into segments along which the bank angle is constant. For case (2), the following subcases are studied: two segments, three segments, four segments, and five segments; because the time duration of each segment is optimized, the above subcases involve four, six, eight, and ten parameters, respectively. Presented here are systematic data on a total of ten optimal trajectories (OT), five for Transfer IA and five for Transfer DA. For comparison purposes and only for Transfer IA, a five-segment reference trajectory RT is also considered.

A New Spin on Miscue Analysis: Using Spider Charts to Web Reading Processes

ERIC Educational Resources Information Center

Wohlwend, Karen E.

2012-01-01

This article introduces a way of seeing miscue analysis data through a "spider chart", a readily available digital graphing tool that provides an effective way to visually represent readers' complex coordination of interrelated cueing systems. A spider chart is a standard feature in recent spreadsheet software that puts a new spin on miscue…

Westchester Community College. 1993 Fact Book.

ERIC Educational Resources Information Center

Lee, Marcia M.; And Others

Tables and graphs drawn from research reports prepared in 1993 by the Office of Institutional Research and Planning at Westchester Community College (WCC) in New York are presented. The sections of the report provide tables, charts, and graphs showing recent facts and statistics that affect: (1) administrative personnel, including a list of…

14 CFR Section 3 - Chart of Balance Sheet Accounts

Code of Federal Regulations, 2010 CFR

2010-01-01

... 14 Aeronautics and Space 4 2010-01-01 2010-01-01 false Chart of Balance Sheet Accounts Section 3 Section 3 Aeronautics and Space OFFICE OF THE SECRETARY, DEPARTMENT OF TRANSPORTATION (AVIATION... Balance Sheet Classifications Section 3 Chart of Balance Sheet Accounts [See footnotes at end of table...

14 CFR Section 3 - Chart of Balance Sheet Accounts

Code of Federal Regulations, 2011 CFR

2011-01-01

... 14 Aeronautics and Space 4 2011-01-01 2011-01-01 false Chart of Balance Sheet Accounts Section 3 Section 3 Aeronautics and Space OFFICE OF THE SECRETARY, DEPARTMENT OF TRANSPORTATION (AVIATION... Balance Sheet Classifications Section 3 Chart of Balance Sheet Accounts [See footnotes at end of table...

46 CFR 121.420 - Charts and nautical publications.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false Charts and nautical publications. 121.420 Section 121... publications. (a) As appropriate for the intended voyage, a vessel must carry adequate and up-to-date: (1... publication; (3) Coast Guard Light List; (4) Tide tables; and (5) Current tables, or a river current...

46 CFR 121.420 - Charts and nautical publications.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false Charts and nautical publications. 121.420 Section 121... publications. (a) As appropriate for the intended voyage, a vessel must carry adequate and up-to-date: (1... publication; (3) Coast Guard Light List; (4) Tide tables; and (5) Current tables, or a river current...

How to generate and interpret fire characteristics charts for surface and crown fire behavior

Treesearch

Patricia L. Andrews; Faith Ann Heinsch; Luke Schelvan

2011-01-01

A fire characteristics chart is a graph that presents primary related fire behavior characteristics-rate of spread, flame length, fireline intensity, and heat per unit area. It helps communicate and interpret modeled or observed fire behavior. The Fire Characteristics Chart computer program plots either observed fire behavior or values that have been calculated by...

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

ERIC Educational Resources Information Center

Yates, JoAnne

1985-01-01

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

Using a Chart-table Medium to Focus Students' Attention on Science Concepts.

ERIC Educational Resources Information Center

Holliday, William G.; Benson, Garth D.

A study is presented which utilizes a selective attention model to investigate the learning effects of different questioning strategies under four experimental conditions using a non-prose medium (science textbook chart) containing information of varying established difficulty. A 14-row, 4-column chart describing 14 vitamins was used to present…

Automated Program Recognition by Graph Parsing

DTIC Science & Technology

1992-07-01

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

The Quantity and Quality of Scientific Graphs in Pharmaceutical Advertisements

PubMed Central

Cooper, Richelle J; Schriger, David L; Wallace, Roger C; Mikulich, Vladislav J; Wilkes, Michael S

2003-01-01

We characterized the quantity and quality of graphs in all pharmaceutical advertisements, in the 10 U.S. medical journals. Four hundred eighty-four unique advertisements (of 3,185 total advertisements) contained 836 glossy and 455 small-print pages. Forty-nine percent of glossy page area was nonscientific figures/images, 0.4% tables, and 1.6% scientific graphs (74 graphs in 64 advertisements). All 74 graphs were univariate displays, 4% were distributions, and 4% contained confidence intervals for summary measures. Extraneous decoration (66%) and redundancy (46%) were common. Fifty-eight percent of graphs presented an outcome relevant to the drug's indication. Numeric distortion, specifically prohibited by FDA regulations, occurred in 36% of graphs. PMID:12709097

X-Ray Form Factor, Attenuation and Scattering Tables

National Institute of Standards and Technology Data Gateway

SRD 66 X-Ray Form Factor, Attenuation and Scattering Tables (Web, free access)   This database collects tables and graphs of the form factors, the photoabsorption cross section, and the total attenuation coefficient for any element (Z <= 92).

The Use of Conjugate Charts in Transfer Reactions: A Unified Approach

ERIC Educational Resources Information Center

Allnutt, Michael I.

2007-01-01

Redox reactions can be conveniently discussed in terms of the relative strengths of the oxidant, the reductant, and their conjugates; a conjugate chart is a most convenient and useful way of doing this. A similar chart for acids and bases is proposed, which can be applied in the same manner. (Contains 7 figures and 2 tables.)

SimGraph: A Flight Simulation Data Visualization Workstation

NASA Technical Reports Server (NTRS)

Kaplan, Joseph A.; Kenney, Patrick S.

1997-01-01

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

Humidity Graphs for All Seasons.

ERIC Educational Resources Information Center

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)

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

PubMed

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

2016-03-09

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

Site index charts for Douglas-fir in the Pacific Northwest.

Treesearch

Grover A. Choate; Floyd A. Johnson

1958-01-01

Charts in this report can be used to estimate site index for Douglas-fir from stand age and from average total height of dominant and codominant trees. Table 1 and figure 2 in USDA Technical Bulletin 201 have been used for this purpose in the past. However, the table requires time-consuming interpolation and the figure gives only rough approximations.

G-Hash: Towards Fast Kernel-based Similarity Search in Large Graph Databases.

PubMed

Wang, Xiaohong; Smalter, Aaron; Huan, Jun; Lushington, Gerald H

2009-01-01

Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and similarity search. With the fast accumulation of graph databases, similarity search in graph databases has emerged as an important research topic. Graph similarity search has applications in a wide range of domains including cheminformatics, bioinformatics, sensor network management, social network management, and XML documents, among others.Most of the current graph indexing methods focus on subgraph query processing, i.e. determining the set of database graphs that contains the query graph and hence do not directly support similarity search. In data mining and machine learning, various graph kernel functions have been designed to capture the intrinsic similarity of graphs. Though successful in constructing accurate predictive and classification models for supervised learning, graph kernel functions have (i) high computational complexity and (ii) non-trivial difficulty to be indexed in a graph database.Our objective is to bridge graph kernel function and similarity search in graph databases by proposing (i) a novel kernel-based similarity measurement and (ii) an efficient indexing structure for graph data management. Our method of similarity measurement builds upon local features extracted from each node and their neighboring nodes in graphs. A hash table is utilized to support efficient storage and fast search of the extracted local features. Using the hash table, a graph kernel function is defined to capture the intrinsic similarity of graphs and for fast similarity query processing. We have implemented our method, which we have named G-hash, and have demonstrated its utility on large chemical graph databases. Our results show that the G-hash method achieves state-of-the-art performance for k-nearest neighbor (k-NN) classification. Most importantly, the new similarity measurement and the index

Control Chart on Semi Analytical Weighting

NASA Astrophysics Data System (ADS)

Miranda, G. S.; Oliveira, C. C.; Silva, T. B. S. C.; Stellato, T. B.; Monteiro, L. R.; Marques, J. R.; Faustino, M. G.; Soares, S. M. V.; Ulrich, J. C.; Pires, M. A. F.; Cotrim, M. E. B.

2018-03-01

Semi-analytical balance verification intends to assess the balance performance using graphs that illustrate measurement dispersion, trough time, and to demonstrate measurements were performed in a reliable manner. This study presents internal quality control of a semi-analytical balance (GEHAKA BG400) using control charts. From 2013 to 2016, 2 weight standards were monitored before any balance operation. This work intended to evaluate if any significant difference or bias were presented on weighting procedure over time, to check the generated data reliability. This work also exemplifies how control intervals are established.

Health of the Disadvantaged. Chart Book-II.

ERIC Educational Resources Information Center

Health Resources Administration (DHHS/PHS), Hyattsville, MD.

The tables and charts in this book act as resources for information on the health status of racial and ethnic minorities and the poor. The four minority groups referred to are blacks, Hispanic Americans, Native Americans, and Asian Americans. The poor are defined as those whose income falls below the poverty line specified by the Census Bureau.…

[Growth charts: Impact on the prevalence of nutritional disorders].

PubMed

Polo Martín, P; Abellan, J J; Nájar Godoy, M I; Álvarez de Laviada Mulero, T

2015-05-01

The references used to assess child growth in Spain are the graphs of the Orbegozo Foundation and the charts of the World Health Organization (WHO). The objective of this study is to analyze the differences between the two charts for weight, height and body mass index, and assess their relevance to identify growth or nutritional problems. The values of the extreme percentiles of height, weight and body mass index for each sex from 0 to 10 years in both charts are compared. For each value Absolute differences and Z scores are calculated for each value. To evaluate the impact on the prevalence of the various nutritional or growth disorders the location of the value of the respective percentiles of in each of the charts were assessed. Significant differences were observed between the 3th percentile of height and weight, 97th of weight, and 85th and 97th of body mass index. Marked differences were observed for the extreme values of body mass index. During the first years, the Orbegozo charts overestimate the prevalence of malnutrition (between 2% and 19% depending on age and sex) compared to the WHO charts. In subsequent ages Orbegozo underestimates WHO between 0.7% and 2.89%. Orbegozo underestimates the prevalence of overweight (between 2.5% and 14.8%) compared to the WHO charts. The 97th percentile of Body mass index in the Orbegozo charts corresponds in most cases with WHO percentiles above 99.99%. The two charts analyzed have significant differences from a clinical and the public health point of view, in the estimation of overweight/obesity and malnutrition. Copyright © 2014 Asociación Española de Pediatría. Published by Elsevier España, S.L.U. All rights reserved.

Tables and conversions for microclimatology.

Treesearch

James M. Brown

1973-01-01

A series of tables, charts, and conversion factors have been prepared for use in microclimatic and ecological studies. Included are: the solution to various equations of radiant energy exchange; solar radiation diagrams; psychometric and precipitation data; and unit conversion factors.

Graphs for information security control in software defined networks

NASA Astrophysics Data System (ADS)

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

2017-07-01

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

46 CFR 130.330 - Charts and nautical publications.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 46 Shipping 4 2010-10-01 2010-10-01 false Charts and nautical publications. 130.330 Section 130... publications. (a) Except as provided by paragraph (b) or (c) of this section, as appropriate for the intended... navigation possible; (2) U.S. Coast Pilot or similar publication; (3) Coast Guard Light List; (4) Tide Tables...

46 CFR 130.330 - Charts and nautical publications.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 46 Shipping 4 2014-10-01 2014-10-01 false Charts and nautical publications. 130.330 Section 130... publications. (a) Except as provided by paragraph (b) or (c) of this section, as appropriate for the intended... navigation possible; (2) U.S. Coast Pilot or similar publication; (3) Coast Guard Light List; (4) Tide Tables...

Multiple directed graph large-class multi-spectral processor

NASA Technical Reports Server (NTRS)

Casasent, David; Liu, Shiaw-Dong; Yoneyama, Hideyuki

1988-01-01

Numerical analysis techniques for the interpretation of high-resolution imaging-spectrometer data are described and demonstrated. The method proposed involves the use of (1) a hierarchical classifier with a tree structure generated automatically by a Fisher linear-discriminant-function algorithm and (2) a novel multiple-directed-graph scheme which reduces the local maxima and the number of perturbations required. Results for a 500-class test problem involving simulated imaging-spectrometer data are presented in tables and graphs; 100-percent-correct classification is achieved with an improvement factor of 5.

Absorption of infrared radiation by carbon monoxide at elevated temperatures and pressures: Part B. Total emissivity charts and correlations

NASA Astrophysics Data System (ADS)

Alberti, Michael; Weber, Roman; Mancini, Marco

2017-10-01

The line-by-line procedure developed in the associated paper (Part A ) has been used to generate the total emissivity chart for pure CO and CO -N2 /air mixtures at 1 bar total pressure, in the 300 to 3000 K temperature and 0.01 to 3000 bar cm pressure path length range. Methods of scaling the emissivity to pressures different to 1 bar, in the range 0.1 to 40 bar, are provided through pressure correction graphs and EXCEL interpolator (Supplementary Material). The interpolated emissivities are within ± 2% margin from the line-by-line calculated values. The newly developed emissivity graphs are substantially more accurate than the existing Ulrich (1936) & Hottel (1954) and Abu-Romia & Tien (1966) charts.

Basic Skills for Reflective Inquiry in the Social Studies. Bridges to the Future.

ERIC Educational Resources Information Center

Rodabaugh, Mary Jane; And Others

The document consists of five social studies units for developing basic inquiry skills at the secondary level. Students read and analyze data through the construction of a table and a graph in Unit I, "Reading Graphs and Charts." Topics include a model of consumer demand, census information, and national budgeting. In Unit II, "Community Change,"…

USSR Country Notes.

ERIC Educational Resources Information Center

World Eagle, Inc., Wellesley, MA.

The United Soviet Socialist Republic (USSR) is the largest country in area in the world and ranks third in world population. The geography and the people of the USSR are documented in a series of reproducible black and white maps and graphs designed for use as classroom instructional materials. Maps, graphs, charts, and tables with information…

Overview of Sparse Graph for Multiple Access in Future Mobile Networks

NASA Astrophysics Data System (ADS)

Lei, Jing; Li, Baoguo; Li, Erbao; Gong, Zhenghui

2017-10-01

Multiple access via sparse graph, such as low density signature (LDS) and sparse code multiple access (SCMA), is a promising technique for future wireless communications. This survey presents an overview of the developments in this burgeoning field, including transmitter structures, extrinsic information transform (EXIT) chart analysis and comparisons with existing multiple access techniques. Such technique enables multiple access under overloaded conditions to achieve a satisfactory performance. Message passing algorithm is utilized for multi-user detection in the receiver, and structures of the sparse graph are illustrated in detail. Outlooks and challenges of this technique are also presented.

Satellite Power System (SPS) concept definition study (exhibit C)

NASA Technical Reports Server (NTRS)

1978-01-01

The SPS program plan is outlined. An overall review of the component systems which comprise the SPS is presented. The report is presented in the form of charts, graphs, data tables, and engineering drawings.

Extraneous Information and Graph Comprehension: Implications for Effective Design Choices

ERIC Educational Resources Information Center

Stewart, Brandie M.; Cipolla, Jessica M.; Best, Lisa A.

2009-01-01

Purpose: The purpose of this paper is to examine if university students could accurately extract information from graphs presented in 2D or 3D formats with different colour hue variations or solid black and white. Design/methodology/approach: Participants are presented with 2D and 3D bar and pie charts in a PowerPoint presentation and are asked to…

ICoN, the Interactive Chart of Nuclides

NASA Astrophysics Data System (ADS)

Lee, Kevin; Mumpower, Matthew; Aprahamian, Ani

2015-10-01

Nuclear data is critical to research fields from medicine to astrophysics. The chart of nuclides is a more descriptive version of the periodic table that can be used to visualize nuclear properties such as half-lives and mass. We have created ICoN (simply short for Interactive Chart of Nuclides), an API which can be used to visualize theoretical and experimental datasets. This visualization is achieved by using D3 (Data Driven Documents), HTML, and CSS3 to plot the elements and color them accordingly. ICoN features many customization options that users can access that are dynamically applied to the chart without reloading the page. Users can save the customized chart they create to various formats. We have constructed these features in order to provide a unique approach for researchers to interface with nuclear data. ICoN can also be used on all electronic devices without loss of support. We report on the current progress of this project and will present a working demo that highlights each aspect of the aforementioned features. This is the first time that all available technologies are put to use to make nuclear data more accessible than ever before. This is a first and we will make it available as open source ware.

Synthesizing 3D Surfaces from Parameterized Strip Charts

NASA Technical Reports Server (NTRS)

Robinson, Peter I.; Gomez, Julian; Morehouse, Michael; Gawdiak, Yuri

2004-01-01

We believe 3D information visualization has the power to unlock new levels of productivity in the monitoring and control of complex processes. Our goal is to provide visual methods to allow for rapid human insight into systems consisting of thousands to millions of parameters. We explore this hypothesis in two complex domains: NASA program management and NASA International Space Station (ISS) spacecraft computer operations. We seek to extend a common form of visualization called the strip chart from 2D to 3D. A strip chart can display the time series progression of a parameter and allows for trends and events to be identified. Strip charts can be overlayed when multiple parameters need to visualized in order to correlate their events. When many parameters are involved, the direct overlaying of strip charts can become confusing and may not fully utilize the graphing area to convey the relationships between the parameters. We provide a solution to this problem by generating 3D surfaces from parameterized strip charts. The 3D surface utilizes significantly more screen area to illustrate the differences in the parameters and the overlayed strip charts, and it can rapidly be scanned by humans to gain insight. The selection of the third dimension must be a parallel or parameterized homogenous resource in the target domain, defined using a finite, ordered, enumerated type, and not a heterogeneous type. We demonstrate our concepts with examples from the NASA program management domain (assessing the state of many plans) and the computers of the ISS (assessing the state of many computers). We identify 2D strip charts in each domain and show how to construct the corresponding 3D surfaces. The user can navigate the surface, zooming in on regions of interest, setting a mark and drilling down to source documents from which the data points have been derived. We close by discussing design issues, related work, and implementation challenges.

HAWQS Beta Flyer

EPA Pesticide Factsheets

HAWQS is a web-based interactive water quantity and quality modeling system that provides users with interactive web interfaces and maps; pre-loaded input data; outputs that include tables, charts, graphs and raw output data; and a user guide.

HAWQS beta flyer

EPA Pesticide Factsheets

HAWQS is a web-based interactive water quantity and quality modeling system that provides users with interactive web interfaces and maps; pre-loaded input data; outputs that include tables, charts, graphs and raw output data; and a user guide.

World Eagle, The Monthly Social Studies Resource: Data, Maps, Graphs. 1990-1991.

ERIC Educational Resources Information Center

World Eagle, 1991

1991-01-01

This document consists of the 10 issues of "World Eagle" issued during the 1990-1991 school year. World Eagle is a monthly social studies resource in which demographic and geographic information is presented in the forms of maps, graphs, charts, and text. Each issue of World Eagle has a section that focuses on a particular topic, along with other…

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

PubMed

Bae, Juhee; Watson, Ben

2011-12-01

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

Adjusting protein graphs based on graph entropy.

PubMed

Peng, Sheng-Lung; Tsay, Yu-Wei

2014-01-01

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

Adjusting protein graphs based on graph entropy

PubMed Central

2014-01-01

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

Query-Adaptive Reciprocal Hash Tables for Nearest Neighbor Search.

PubMed

Liu, Xianglong; Deng, Cheng; Lang, Bo; Tao, Dacheng; Li, Xuelong

2016-02-01

Recent years have witnessed the success of binary hashing techniques in approximate nearest neighbor search. In practice, multiple hash tables are usually built using hashing to cover more desired results in the hit buckets of each table. However, rare work studies the unified approach to constructing multiple informative hash tables using any type of hashing algorithms. Meanwhile, for multiple table search, it also lacks of a generic query-adaptive and fine-grained ranking scheme that can alleviate the binary quantization loss suffered in the standard hashing techniques. To solve the above problems, in this paper, we first regard the table construction as a selection problem over a set of candidate hash functions. With the graph representation of the function set, we propose an efficient solution that sequentially applies normalized dominant set to finding the most informative and independent hash functions for each table. To further reduce the redundancy between tables, we explore the reciprocal hash tables in a boosting manner, where the hash function graph is updated with high weights emphasized on the misclassified neighbor pairs of previous hash tables. To refine the ranking of the retrieved buckets within a certain Hamming radius from the query, we propose a query-adaptive bitwise weighting scheme to enable fine-grained bucket ranking in each hash table, exploiting the discriminative power of its hash functions and their complement for nearest neighbor search. Moreover, we integrate such scheme into the multiple table search using a fast, yet reciprocal table lookup algorithm within the adaptive weighted Hamming radius. In this paper, both the construction method and the query-adaptive search method are general and compatible with different types of hashing algorithms using different feature spaces and/or parameter settings. Our extensive experiments on several large-scale benchmarks demonstrate that the proposed techniques can significantly outperform both

Personal Computer Price and Performance.

ERIC Educational Resources Information Center

Crawford, Walt

1993-01-01

Discusses personal computer price trends since 1986; describes offerings and prices for four direct-market suppliers, i.e., Dell CompuAdd, PC Brand, and Gateway 2000; and discusses overall value and price/performance ratios. Tables and graphs chart value over time. (EA)

The impact of home care nurses' numeracy and graph literacy on comprehension of visual display information: implications for dashboard design.

PubMed

Dowding, Dawn; Merrill, Jacqueline A; Onorato, Nicole; Barrón, Yolanda; Rosati, Robert J; Russell, David

2018-02-01

To explore home care nurses' numeracy and graph literacy and their relationship to comprehension of visualized data. A multifactorial experimental design using online survey software. Nurses were recruited from 2 Medicare-certified home health agencies. Numeracy and graph literacy were measured using validated scales. Nurses were randomized to 1 of 4 experimental conditions. Each condition displayed data for 1 of 4 quality indicators, in 1 of 4 different visualized formats (bar graph, line graph, spider graph, table). A mixed linear model measured the impact of numeracy, graph literacy, and display format on data understanding. In all, 195 nurses took part in the study. They were slightly more numerate and graph literate than the general population. Overall, nurses understood information presented in bar graphs most easily (88% correct), followed by tables (81% correct), line graphs (77% correct), and spider graphs (41% correct). Individuals with low numeracy and low graph literacy had poorer comprehension of information displayed across all formats. High graph literacy appeared to enhance comprehension of data regardless of numeracy capabilities. Clinical dashboards are increasingly used to provide information to clinicians in visualized format, under the assumption that visual display reduces cognitive workload. Results of this study suggest that nurses' comprehension of visualized information is influenced by their numeracy, graph literacy, and the display format of the data. Individual differences in numeracy and graph literacy skills need to be taken into account when designing dashboard technology. © The Author 2017. Published by Oxford University Press on behalf of the American Medical Informatics Association. All rights reserved. For Permissions, please email: journals.permissions@oup.com

Tables for the Rapid Estimation of Downwash and Sidewash Behind Wings Performing Various Motions at Supersonic Speeds

NASA Technical Reports Server (NTRS)

Bobbitt, Percy J.

1959-01-01

Equations for the downwash and sidewash due to supersonic yawed and unswept horseshoe vortices have been utilized in formulating tables and charts to permit a rapid estimation of the flow velocities behind wings performing various steady motions. Tabulations are presented of the downwash and sidewash in the wing vertical plane of symmetry due to a unit-strength yawed horseshoe vortex located at 20 equally spaced spanwise positions along lifting lines of various sweeps. (The bound portion of the yawed vortex is coincident with the lifting line.) Charts are presented for the purpose of estimating the spanwise variations of the flow-field velocities and give longitudinal variations of the downwash and sidewash at a nuMber of vertical and spanwise locations due to a unit-strength unswept horseshoe vortex. Use of the tables and charts to calculate wing downwash or sidewash requires a knowledge of the wing spanwise distribution of circulation. Sample computations for the rolling sidewash and angle-of-attack downwash behind a typical swept wing are presented to demonstrate the use of the tables and charts.

K-6 Social Studies Skills for the Human Behavior and Urban Studies Program.

ERIC Educational Resources Information Center

Banks, Samuel L., Ed.

This guide was developed to aid elementary students deal with life experiences through skill development. Major skills stressed are: locating, organizing, and evaluating information; acquiring information through listening, observing, and reading; communicating orally and in writing; interpreting pictures, charts, graphs, and tables; and working…

CANCER CONTROL AND POPULATION SCIENCES FAST STATS

EPA Science Inventory

Fast Stats links to tables, charts, and graphs of cancer statistics for all major cancer sites by age, sex, race, and geographic area. The statistics include incidence, mortality, prevalence, and the probability of developing or dying from cancer. A large set of statistics is ava...

An Initial Survey of Fractional Graph and Table Area in Behavioral Journals

ERIC Educational Resources Information Center

Kubina, Richard M., Jr.; Kostewicz, Douglas E.; Datchuck, Shawn M.

2008-01-01

This study examined the fractional graph area (FGA), the proportion of page space used to display statistical graphics, in 11 behavioral journals and places behavior analysis on a continuum with other natural, mathematical, and social science disciplines. The composite FGA of all 11 journals puts behavior analysis within the range of the social…

An overview of the essential differences and similarities of system identification techniques

NASA Technical Reports Server (NTRS)

Mehra, Raman K.

1991-01-01

Information is given in the form of outlines, graphs, tables and charts. Topics include system identification, Bayesian statistical decision theory, Maximum Likelihood Estimation, identification methods, structural mode identification using a stochastic realization algorithm, and identification results regarding membrane simulations and X-29 flutter flight test data.

What Do You See?

ERIC Educational Resources Information Center

Coleman, Julianne Maner; Goldston, M. Jenice

2011-01-01

When students draw observations or interpret and draw a diagram, they're communicating their understandings of science and demonstrating visual literacy abilities. Visual literacy includes skills needed to accurately interpret and produce visual and graphical information such as drawings, diagrams, tables, charts, maps, and graphs. Communication…

Generalize aerodynamic coefficient table storage, checkout and interpolation for aircraft simulation

NASA Technical Reports Server (NTRS)

Neuman, F.; Warner, N.

1973-01-01

The set of programs described has been used for rapidly introducing, checking out and very efficiently using aerodynamic tables in complex aircraft simulations on the IBM 360. The preprocessor program reads in tables with different names and dimensions and stores then on disc storage according to the specified dimensions. The tables are read in from IBM cards in a format which is convenient to reduce the data from the original graphs. During table processing, new auxiliary tables are generated which are required for table cataloging and for efficient interpolation. In addition, DIMENSION statements for the tables as well as READ statements are punched so that they may be used in other programs for readout of the data from disc without chance of programming errors. A quick data checking graphical output for all tables is provided in a separate program.

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

PubMed Central

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

2016-01-01

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

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

PubMed

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

2016-01-01

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

Approximate thermochemical tables for some C-H and C-H-O species

NASA Technical Reports Server (NTRS)

Bahn, G. S.

1973-01-01

Approximate thermochemical tables are presented for some C-H and C-H-O species and for some ionized species, supplementing the JANAF Thermochemical Tables for application to finite-chemical-kinetics calculations. The approximate tables were prepared by interpolation and extrapolation of limited available data, especially by interpolations over chemical families of species. Original estimations have been smoothed by use of a modification for the CDC-6600 computer of the Lewis Research Center PACl Program which was originally prepared for the IBM-7094 computer Summary graphs for various families show reasonably consistent curvefit values, anchored by properties of existing species in the JANAF tables.

Linking Models: Reasoning from Patterns to Tables and Equations

ERIC Educational Resources Information Center

Switzer, J. Matt

2013-01-01

Patterns are commonly used in middle years mathematics classrooms to teach students about functions and modelling with tables, graphs, and equations. Grade 6 students are expected to, "continue and create sequences involving whole numbers, fractions and decimals," and "describe the rule used to create the sequence." (Australian…

Basic Facts and Figures about the Educational System in Japan.

ERIC Educational Resources Information Center

National Inst. for Educational Research, Tokyo (Japan).

Tables, charts, and graphs convey supporting data that accompany text on various aspects of the Japanese educational system presented in this booklet. There are seven chapters: (1) Fundamental principles of education; (2) Organization of the educational system; (3) Basic statistics of education; (4) Curricula, textbooks, and instructional aids;…

People and Environment: Understanding Global Relationships.

ERIC Educational Resources Information Center

Clearing: Nature and Learning in the Pacific Northwest, 1984

1984-01-01

Discusses impacts of global resources and environment, focusing on food, fisheries, forests, energy, water, and air. Includes graphs, charts, maps, and tables of the current environmental situation; they are suitable for classroom use. Also includes suggested guidelines for implementing a global studies program and an annotated list of resource…

Graphs, matrices, and the GraphBLAS: Seven good reasons

DOE PAGES

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

2015-01-01

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

User acceptance of observation and response charts with a track and trigger system: a multisite staff survey.

PubMed

Elliott, Doug; Allen, Emily; McKinley, Sharon; Perry, Lin; Duffield, Christine; Fry, Margaret; Gallagher, Robyn; Iedema, Rick; Roche, Michael

2016-08-01

To examine user acceptance with a new format of charts for recording observations and as a prompt for responding to episodes of clinical deterioration in adult medical-surgical patients. Improving recognition and response to clinical deterioration remains a challenge for acute healthcare institutions globally. Five chart templates were developed in Australia, combining human factors design principles with a track and trigger system for escalation of care. Two chart templates were previously tested in simulations, but none had been evaluated in clinical practice. Prospective multisite survey of user acceptance of the charts in practice. New observation and response charts were trialled in parallel with existing charts for 24 hours across 36 adult acute medical-surgical wards, covering 108 shifts, in five Australian states. Surveys were completed by 477 staff respondents, with open-ended comments and narrative from short informal feedback groups providing elaboration and context of user experiences. Respondents were broadly supportive of the chart format and content for monitoring patients, and as a prompt for escalating care. Some concerns were noted for chart size and style, use of ranges to graph vital signs and with specific human factors design features. Information and training issues were identified to improve usability and adherence to chart guidelines and to support improved detection and response for patients with clinical deterioration. This initial evaluation demonstrated that the charts were perceived as appropriate for documenting observations and as a prompt to detect clinical deterioration. Further evaluation after some minor modifications to the chart is recommended. Explicit training on the principles and rationale of human factors chart design, use of embedded change management strategies and addressing practical issues will improve authentic engagement, staff acceptance and adoption by all clinical users when implementing a similar observation

Science and Technology Data Book. 1986.

ERIC Educational Resources Information Center

National Science Foundation, Washington, DC. Div. of Science Resources Studies.

Science and technology (S&T) data are presented in 36 charts, graphs, or tables. These data are organized into three major categories, namely, research and development (R&D) funding, human resources, and international S&T indicators. R&D funding is subdivided into national, federal, industry, and academic categories, with data…

Postsecondary Education in California Information Digest 1978.

ERIC Educational Resources Information Center

California State Postsecondary Education Commission, Sacramento.

The digest provides extensive data on postsecondary education in the state in the form of charts, graphs, and tables, with only occasional narration; it is designed for the layman, and only summary information is displayed. The information includes private as well as public institutions, significant trends, opening enrollments and their…

Historical and projected power requirements

NASA Technical Reports Server (NTRS)

Wolfe, M. G.

1978-01-01

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

1986 Agricultural Chartbook. Agriculture Handbook No. 663.

ERIC Educational Resources Information Center

Department of Agriculture, Washington, DC.

This book contains 310 charts, tables, and graphs containing statistical information about agriculture-related commodities and services, primarily in the United States, in 1986. The book is organized in seven sections that cover the following topics: (1) the farm (farm income, farm population, farm workers, food and fiber system, agriculture and…

WASP (Write a Scientific Paper) using Excel - 2: Pivot tables.

PubMed

Grech, Victor

2018-02-01

Data analysis at the descriptive stage and the eventual presentation of results requires the tabulation and summarisation of data. This exercise should always precede inferential statistics. Pivot tables and pivot charts are one of Excel's most powerful and underutilised features, with tabulation functions that immensely facilitate descriptive statistics. Pivot tables permit users to dynamically summarise and cross-tabulate data, create tables in several dimensions, offer a range of summary statistics and can be modified interactively with instant outputs. Large and detailed datasets are thereby easily manipulated making pivot tables arguably the best way to explore, summarise and present data from many different angles. This second paper in the WASP series in Early Human Development provides pointers for pivot table manipulation in Excel™. Copyright © 2018 Elsevier B.V. All rights reserved.

Technetium: The First Radioelement on the Periodic Table

ERIC Educational Resources Information Center

Johnstone, Erik V.; Yates, Mary Anne; Poineau, Frederic; Sattelberger, Alfred P.; Czerwinski, Kenneth R.

2017-01-01

The radioactive nature of technetium is discussed using a combination of introductory nuclear physics concepts and empirical trends observed in the chart of the nuclides and the periodic table of the elements. Trends such as the enhanced stability of nucleon pairs, magic numbers, and Mattauch's rule are described. The concepts of nuclear binding…

Individualized Math Problems in Graphs and Tables. Oregon Vo-Tech Mathematics Problem Sets.

ERIC Educational Resources Information Center

Cosler, Norma, Ed.

This is one of eighteen sets of individualized mathematics problems developed by the Oregon Vo-Tech Math Project. Each of these problem packages is organized around a mathematical topic and contains problems related to diverse vocations. Solutions are provided for all problems. Problems involving the construction and interpretation of graphs and…

The 2017 Korean National Growth Charts for children and adolescents: development, improvement, and prospects

PubMed Central

Kim, Jae Hyun; Yun, Sungha; Hwang, Seung-sik; Shim, Jung Ok; Chae, Hyun Wook; Lee, Yeoun Joo; Lee, Ji Hyuk; Kim, Soon Chul; Lim, Dohee; Yang, Sei Won

2018-01-01

Growth charts are curves or tables that facilitate the visualization of anthropometric parameters, and are widely used as an important indicator when evaluating the growth status of children and adolescents. The latest version of the Korean National Growth Charts released in 2007 has raised concerns regarding the inclusion of data from both breastfed and formula-fed infants, higher body mass index (BMI) values in boys, and smaller 3rd percentile values in height-for-age charts. Thus, new growth charts have been developed to improve the previous version. The 2006 World Health Organization Child Growth Standards, regarded as the standard for breastfed infants and children, were introduced for children aged 0–35 months. For children and adolescents aged 3–18 years, these new growth charts include height-for-age, weight-for-age, BMI-for-age, weight-for-height, and head circumference-for-age charts, and were developed using data obtained in 1997 and 2005. Data sets and exclusion criteria were applied differently for the development of the different growth charts. BMI-for-age charts were adjusted to decrease the 95th percentile values of BMI. Criteria for obesity were simplified and defined as a BMI of ≥95th percentile for age and sex. The 3rd percentile values for height-for-age charts were also increased. Additional percentile lines (1st and 99th) and growth charts with standard deviation lines were introduced. 2017 Korean National Growth Charts are recommended for the evaluation of body size and growth of Korean children and adolescents for use in clinics and the public health sector in Korea. PMID:29853938

Contact Graph Routing

NASA Technical Reports Server (NTRS)

Burleigh, Scott C.

2011-01-01

Contact Graph Routing (CGR) is a dynamic routing system that computes routes through a time-varying topology of scheduled communication contacts in a network based on the DTN (Delay-Tolerant Networking) architecture. It is designed to enable dynamic selection of data transmission routes in a space network based on DTN. This dynamic responsiveness in route computation should be significantly more effective and less expensive than static routing, increasing total data return while at the same time reducing mission operations cost and risk. The basic strategy of CGR is to take advantage of the fact that, since flight mission communication operations are planned in detail, the communication routes between any pair of bundle agents in a population of nodes that have all been informed of one another's plans can be inferred from those plans rather than discovered via dialogue (which is impractical over long one-way-light-time space links). Messages that convey this planning information are used to construct contact graphs (time-varying models of network connectivity) from which CGR automatically computes efficient routes for bundles. Automatic route selection increases the flexibility and resilience of the space network, simplifying cross-support and reducing mission management costs. Note that there are no routing tables in Contact Graph Routing. The best route for a bundle destined for a given node may routinely be different from the best route for a different bundle destined for the same node, depending on bundle priority, bundle expiration time, and changes in the current lengths of transmission queues for neighboring nodes; routes must be computed individually for each bundle, from the Bundle Protocol agent's current network connectivity model for the bundle s destination node (the contact graph). Clearly this places a premium on optimizing the implementation of the route computation algorithm. The scalability of CGR to very large networks remains a research topic

[Health for All-Italia: an indicator system on health].

PubMed

Burgio, Alessandra; Crialesi, Roberta; Loghi, Marzia

2003-01-01

The Health for All - Italia information system collects health data from several sources. It is intended to be a cornerstone for the achievement of an overview about health in Italy. Health is analyzed at different levels, ranging from health services, health needs, lifestyles, demographic, social, economic and environmental contexts. The database associated software allows to pin down statistical data into graphs and tables, and to carry out simple statistical analysis. It is therefore possible to view the indicators' time series, make simple projections and compare the various indicators over the years for each territorial unit. This is possible by means of tables, graphs (histograms, line graphs, frequencies, linear regression with calculation of correlation coefficients, etc) and maps. These charts can be exported to other programs (i.e. Word, Excel, Power Point), or they can be directly printed in color or black and white.

Aerographers Mate 1 & C: Rate Training Manual.

ERIC Educational Resources Information Center

Naval Training Command, Pensacola, FL.

One of the series for enlisted Navy and Naval Reserve personnel, the training manual prepares students for advancement within their rating, aids in on-the-job training, or serves as a review source. Charts, graphs, tables, maps, and illustrations supplement detailed text covering atmospheric physics and world climatology, air masses, circulation,…

77 FR 12819 - Upward Bound Program; Reopening the Fiscal Year (FY) 2012 Competition for Certain Applicants To...

Federal Register 2010, 2011, 2012, 2013, 2014

2012-03-02

... all text in charts, tables, figures, and graphs. Use a font that is either 12 point or larger. Use one of the following fonts: Times New Roman, Courier, Courier New, or Arial. An amended application submitted in any other font (including Times Roman and Arial Narrow) will not be accepted. The page limits...

Statewide Computer Survey, Report on 1988-89.

ERIC Educational Resources Information Center

South Carolina State Dept. of Education, Columbia. Office of Instructional Technology.

The sixth statewide survey of school principals (1,094) and district superintendents (92) was conducted in April 1989 by the South Carolina State Department of Education Office of Instructional Technology with response rates of 99% and 100% respectively. This report uses tables, charts, and graphs to illustrate the results of the survey and…

Fall Enrollment, 1978. Research and Planning Series Report No. 79-1.

ERIC Educational Resources Information Center

Elliott, Loretta Glaze; And Others

The first in a series of annual analytical reports prepared by the Missouri Department of Higher Education from the annual state data collection is presented. Tables, charts, and graphs provide numerical data, supplemented by brief analyses, in these areas: enrollment by sector; enrollment trends for fall 1974 through fall 1978; fall enrollment…

GraphBench

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

Sukumar, Sreenivas R.; Hong, Seokyong; Lee, Sangkeun

2016-06-01

GraphBench is a benchmark suite for graph pattern mining and graph analysis systems. The benchmark suite is a significant addition to conducting apples-apples comparison of graph analysis software (databases, in-memory tools, triple stores, etc.)

32. PILOT HOUSE, LOOKING TOWARDS PORT, TABLE TO LEFT IS ...

Library of Congress Historic Buildings Survey, Historic Engineering Record, Historic Landscapes Survey

32. PILOT HOUSE, LOOKING TOWARDS PORT, TABLE TO LEFT IS WHERE CHARTS ARE PLOTTED AT BACKGROUND LEFT IS TOP OF STAIRS DOWN TO MESS DECK. - U.S. Coast Guard Cutter WHITE HEATH, USGS Integrated Support Command Boston, 427 Commercial Street, Boston, Suffolk County, MA

Charting Ingredients for Life

NASA Technical Reports Server (NTRS)

2005-01-01

[figure removed for brevity, see original site] Figure 1: Spectrum Charts Light from a Faraway Galaxy

This graph, or spectrum, charts light from a faraway galaxy located 10 billion light years from Earth. It tracks mid-infrared light from an extremely luminous galaxy when the universe was only 1/4 of its current age.

Spectra are created when an instrument called a spectrograph spreads light out into its basic parts, like a prism turning sunlight into a rainbow. They reveal the signatures, or 'fingerprints,' of molecules that make up a galaxy and contribute to its light.

Spitzer's infrared spectrometer identified characteristic fingerprints of complex organic molecules called polycyclic aromatic hydrocarbons, illustrated in the artist's concept in the inset. These large molecules comprised of carbon and hydrogen, are considered among the building blocks of life.

Scientists determined it took 10 billion years for photons from this galaxy to reach Spitzer's infrared eyes. These complex carbon and hydrogen molecules are from a young galaxy which is undergoing intense star formation, at the time the universe was only 3.5 billion years old.

These distant galaxies with enormous amounts of gas being converted into young stars are some of the most luminous objects in the sky. Enshrouded by dust, they are only faint, inconspicuous little dots in optical images. They are as bright as 10 trillion suns put together and 10 times brighter than starburst galaxies seen in our local universe.

This prompts a fascinating question as to what physical process is driving such enormous energy production in these galaxies when the universe is so young.

These data were taken by Spitzer's infrared spectrograph in August and September 2004.

Differentials on graph complexes II: hairy graphs

NASA Astrophysics Data System (ADS)

Khoroshkin, Anton; Willwacher, Thomas; Živković, Marko

2017-10-01

We study the cohomology of the hairy graph complexes which compute the rational homotopy of embedding spaces, generalizing the Vassiliev invariants of knot theory. We provide spectral sequences converging to zero whose first pages contain the hairy graph cohomology. Our results yield a way to construct many nonzero hairy graph cohomology classes out of (known) non-hairy classes by studying the cancellations in those sequences. This provide a first glimpse at the tentative global structure of the hairy graph cohomology.

User compliance with documenting on a track and trigger-based observation and response chart: a two-phase multi-site audit study.

PubMed

Elliott, Doug; Allen, Emily; McKinley, Sharon; Perry, Lin; Duffield, Christine; Fry, Margaret; Gallagher, Robyn; Iedema, Rick; Roche, Michael

2017-12-01

To examine user compliance and completeness of documentation with a newly designed observation and response chart and whether a rapid response system call was triggered when clinically indicated. Timely recognition and responses to patient deterioration in hospital general wards remain a challenge for healthcare systems globally. Evaluating practice initiatives to improve recognition and response are required. Two-phase audit. Following introduction of the charts in ten health service sites in Australia, an audit of chart completion was conducted during a short trial for initial usability (Phase 1; 2011). After chart adoption as routine use in practice, retrospective and prospective chart audits were conducted (Phase 2; 2012). Overall, 818 and 1,058 charts were audited during the two phases respectively. Compliance was mixed but improved with the new chart (4%-14%). Contrary to chart guidelines, numbers rather than dots were written in the graphing section in 60% of cases. Rates of recognition of abnormal vital signs improved slightly with new charts in use, particularly for higher levels of surveillance and clinical review. Based on local calling criteria, an emergency call was initiated in 33% of cases during the retrospective audit and in 41% of cases with the new chart. User compliance was less than optimal, limiting full function of the chart sections and compliance with local calling criteria. Overcoming apparent behavioural and work culture barriers may improve chart completion, aiding identification of abnormal vital signs and triggering a rapid response system activation when clinical deterioration is detected. © 2017 The Authors. Journal of Advanced Nursing Published by John Wiley & Sons Ltd.

Use of Graph Database for the Integration of Heterogeneous Biological Data.

PubMed

Yoon, Byoung-Ha; Kim, Seon-Kyu; Kim, Seon-Young

2017-03-01

Understanding complex relationships among heterogeneous biological data is one of the fundamental goals in biology. In most cases, diverse biological data are stored in relational databases, such as MySQL and Oracle, which store data in multiple tables and then infer relationships by multiple-join statements. Recently, a new type of database, called the graph-based database, was developed to natively represent various kinds of complex relationships, and it is widely used among computer science communities and IT industries. Here, we demonstrate the feasibility of using a graph-based database for complex biological relationships by comparing the performance between MySQL and Neo4j, one of the most widely used graph databases. We collected various biological data (protein-protein interaction, drug-target, gene-disease, etc.) from several existing sources, removed duplicate and redundant data, and finally constructed a graph database containing 114,550 nodes and 82,674,321 relationships. When we tested the query execution performance of MySQL versus Neo4j, we found that Neo4j outperformed MySQL in all cases. While Neo4j exhibited a very fast response for various queries, MySQL exhibited latent or unfinished responses for complex queries with multiple-join statements. These results show that using graph-based databases, such as Neo4j, is an efficient way to store complex biological relationships. Moreover, querying a graph database in diverse ways has the potential to reveal novel relationships among heterogeneous biological data.

Use of Graph Database for the Integration of Heterogeneous Biological Data

PubMed Central

Yoon, Byoung-Ha; Kim, Seon-Kyu

2017-01-01

Understanding complex relationships among heterogeneous biological data is one of the fundamental goals in biology. In most cases, diverse biological data are stored in relational databases, such as MySQL and Oracle, which store data in multiple tables and then infer relationships by multiple-join statements. Recently, a new type of database, called the graph-based database, was developed to natively represent various kinds of complex relationships, and it is widely used among computer science communities and IT industries. Here, we demonstrate the feasibility of using a graph-based database for complex biological relationships by comparing the performance between MySQL and Neo4j, one of the most widely used graph databases. We collected various biological data (protein-protein interaction, drug-target, gene-disease, etc.) from several existing sources, removed duplicate and redundant data, and finally constructed a graph database containing 114,550 nodes and 82,674,321 relationships. When we tested the query execution performance of MySQL versus Neo4j, we found that Neo4j outperformed MySQL in all cases. While Neo4j exhibited a very fast response for various queries, MySQL exhibited latent or unfinished responses for complex queries with multiple-join statements. These results show that using graph-based databases, such as Neo4j, is an efficient way to store complex biological relationships. Moreover, querying a graph database in diverse ways has the potential to reveal novel relationships among heterogeneous biological data. PMID:28416946

We, the Asian and Pacific Islander Americans.

ERIC Educational Resources Information Center

Johnson, Dwight L.; And Others

Demographic data are presented about the people who have immigrated to the United States from Asia and the Pacific Islands. Twelve figures (pie charts, bar graphs, and maps), and eight tables provide detailed, statistical information on such things as (1) distribution of Asians and Pacific Islanders in the United States, (2) states with the…

A case study in Gantt charts as historiophoty: A century of psychology at the University of Alberta.

PubMed

Dawson, Michael R W

2013-05-01

History is typically presented as historiography, where historians communicate via the written word. However, some historians have suggested alternative formats for communicating and thinking about historical information. One such format is known as historiophoty, which involves using a variety of visual images to represent history. The current article proposes that a particular type of graph, known as a Gantt chart, is well suited for conducting historiophoty. When used to represent history, Gantt charts provide a tremendous amount of information. Furthermore, the spatial nature of Gantt charts permits other kinds of spatial operations to be performed on them. This is illustrated with a case study of the history of a particular psychology department. The academic year 2009-2010 marked the centennial of psychology at the University of Alberta. This centennial was marked by compiling a list of its full-time faculty members for each year of its history. This historiography was converted into historiophoty by using it as the source for the creation of a Gantt chart. The current article shows how the history of psychology at the University of Alberta is revealed by examining this Gantt chart in a variety of different ways. This includes computing simple descriptive statistics from the chart, creating smaller versions of the Gantt to explore departmental demographics, and using image processing methods to provide measures of departmental stability throughout its history. (PsycINFO Database Record (c) 2013 APA, all rights reserved).

Notre Dame Nuclear Database: A New Chart of Nuclides

NASA Astrophysics Data System (ADS)

Lee, Kevin; Khouw, Timothy; Fasano, Patrick; Mumpower, Matthew; Aprahamian, Ani

2014-09-01

Nuclear data is critical to research fields from medicine to astrophysics. We are creating a database, the Notre Dame Nuclear Database, which can store theoretical and experimental datasets. We place emphasis on storing metadata and user interaction with the database. Users are able to search in addition to the specific nuclear datum, the author(s), the facility where the measurements were made, the institution of the facility, and device or method/technique used. We also allow users to interact with the database by providing online search, an interactive nuclide chart, and a command line interface. The nuclide chart is a more descriptive version of the periodic table that can be used to visualize nuclear properties such as half-lives and mass. We achieve this by using D3 (Data Driven Documents), HTML, and CSS3 to plot the nuclides and color them accordingly. Search capabilities can be applied dynamically to the chart by using Python to communicate with MySQL, allowing for customization. Users can save the customized chart they create to any image format. These features provide a unique approach for researchers to interface with nuclear data. We report on the current progress of this project and will present a working demo that highlights each aspect of the aforementioned features. This is the first time that all available technologies are put to use to make nuclear data more accessible than ever before in a manner that is much easier and fully detailed. This is a first and we will make it available as open source ware.

We, the Americans.

ERIC Educational Resources Information Center

Wilkinson, Gary H.

Demographic data based on the U.S. census of 1980 are presented and compared to data from the 1970 census. A series of charts, maps, graphs, and tables provide detailed statistical data on such things as population growth trends, population by race and age, educational achievement, number of people living alone, male and female occupations,…

GraphReduce: Processing Large-Scale Graphs on Accelerator-Based Systems

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

Sengupta, Dipanjan; Song, Shuaiwen; Agarwal, Kapil

2015-11-15

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the host andmore » device.« less

Growth chart

MedlinePlus

... while standing up in children over age 3) Head circumference , a measurement of the head size taken by ... carefully. Alternative Names Height and weight chart Images Head circumference Height/weight chart References Cooke DW, Dival SA, ...

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

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

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

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

Data on the distribution of cancer incidence and death across age and sex groups visualized using multilevel spie charts.

PubMed

Feitelson, Dror G

2016-04-01

Cancer incidence and death statistics are typically recorded for multiple age and sex brackets, leading to large data tables which are difficult to digest. Effective visualizations of this data would allow practitioners, policy makers, and the general public to comprehend the data more readily and act on it appropriately. We introduce multilevel spie charts to create a combined visualization of cancer incidence and death statistics. Spie charts combine multiple pie charts, where the base pie chart (representing the general population) is used to set the angles of slices, and the superimposed ones use variable radii to portray the cancer data. Spie charts of cancer incidence and death statistics from Israel for 2009-2011 are used as an illustration. These charts clearly show various patterns of how cancer incidence and death distribute across age and sex groups, illustrating (1) absolute numbers and (2) rates per 100,000 population for different age and sex brackets. In addition, drawing separate charts for different cancer types illustrates relative mortality, both (3) across cancer types and (4) mortality relative to incidence. Naturally, this graphical depiction can be used for other diseases as well. Copyright © 2016 Elsevier Inc. All rights reserved.

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

ERIC Educational Resources Information Center

Öçal, Mehmet Fatih

2017-01-01

Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students' learning during graphing functions. However, the display of graphs of functions that students sketched by hand may…

Evaluation of Graph Pattern Matching Workloads in Graph Analysis Systems

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

Hong, Seokyong; Lee, Sangkeun; Lim, Seung-Hwan

2016-01-01

Graph analysis has emerged as a powerful method for data scientists to represent, integrate, query, and explore heterogeneous data sources. As a result, graph data management and mining became a popular area of research, and led to the development of plethora of systems in recent years. Unfortunately, the number of emerging graph analysis systems and the wide range of applications, coupled with a lack of apples-to-apples comparisons, make it difficult to understand the trade-offs between different systems and the graph operations for which they are designed. A fair comparison of these systems is a challenging task for the following reasons:more » multiple data models, non-standardized serialization formats, various query interfaces to users, and diverse environments they operate in. To address these key challenges, in this paper we present a new benchmark suite by extending the Lehigh University Benchmark (LUBM) to cover the most common capabilities of various graph analysis systems. We provide the design process of the benchmark, which generalizes the workflow for data scientists to conduct the desired graph analysis on different graph analysis systems. Equipped with this extended benchmark suite, we present performance comparison for nine subgraph pattern retrieval operations over six graph analysis systems, namely NetworkX, Neo4j, Jena, Titan, GraphX, and uRiKA. Through the proposed benchmark suite, this study reveals both quantitative and qualitative findings in (1) implications in loading data into each system; (2) challenges in describing graph patterns for each query interface; and (3) different sensitivity of each system to query selectivity. We envision that this study will pave the road for: (i) data scientists to select the suitable graph analysis systems, and (ii) data management system designers to advance graph analysis systems.« less

MMKG: An approach to generate metallic materials knowledge graph based on DBpedia and Wikipedia

NASA Astrophysics Data System (ADS)

Zhang, Xiaoming; Liu, Xin; Li, Xin; Pan, Dongyu

2017-02-01

The research and development of metallic materials are playing an important role in today's society, and in the meanwhile lots of metallic materials knowledge is generated and available on the Web (e.g., Wikipedia) for materials experts. However, due to the diversity and complexity of metallic materials knowledge, the knowledge utilization may encounter much inconvenience. The idea of knowledge graph (e.g., DBpedia) provides a good way to organize the knowledge into a comprehensive entity network. Therefore, the motivation of our work is to generate a metallic materials knowledge graph (MMKG) using available knowledge on the Web. In this paper, an approach is proposed to build MMKG based on DBpedia and Wikipedia. First, we use an algorithm based on directly linked sub-graph semantic distance (DLSSD) to preliminarily extract metallic materials entities from DBpedia according to some predefined seed entities; then based on the results of the preliminary extraction, we use an algorithm, which considers both semantic distance and string similarity (SDSS), to achieve the further extraction. Second, due to the absence of materials properties in DBpedia, we use an ontology-based method to extract properties knowledge from the HTML tables of corresponding Wikipedia Web pages for enriching MMKG. Materials ontology is used to locate materials properties tables as well as to identify the structure of the tables. The proposed approach is evaluated by precision, recall, F1 and time performance, and meanwhile the appropriate thresholds for the algorithms in our approach are determined through experiments. The experimental results show that our approach returns expected performance. A tool prototype is also designed to facilitate the process of building the MMKG as well as to demonstrate the effectiveness of our approach.

Effects of lines of progress and semilogarithmic charts on ratings of charted data

PubMed Central

Bailey, Donald B.

1984-01-01

The extent to which interrater agreement and ratings of significance on both changes in level and trend are affected by lines of progress and semilogarithmic charts was investigated. Thirteen graduate students rated four sets of charts, each set containing 19 phase changes. Set I data were plotted on equal interval charts. In Set II a line of progress was drawn through each phase on each chart. In Set III data points were replotted on semilogarithmic charts. In Set IV a line of progress was drawn through each phase of each Set III chart. A significant main effect on interrater agreement was found for lines of progress as well as a significant 2-way interaction between lines of progress and change type. Three main effects (chart type, lines of progress, and type of change) and a significant 3-way interaction were found for ratings of significance. Implications of these data for visual analysis of charted data are discussed. PMID:16795676

On regional geomagnetic charts

USGS Publications Warehouse

Alldredge, L.R.

1987-01-01

When regional geomagnetic charts for areas roughly the size of the US were compiled by hand, some large local anomalies were displayed in the isomagnetic lines. Since the late 1960s, when the compilation of charts using computers and mathematical models was started, most of the details available in the hand drawn regional charts have been lost. One exception to this is the Canadian magnetic declination chart for 1980. This chart was constructed using a 180 degrees spherical harmonic model. -from Author

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

NASA Astrophysics Data System (ADS)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

Lamplighter groups, de Brujin graphs, spider-web graphs and their spectra

NASA Astrophysics Data System (ADS)

Grigorchuk, R.; Leemann, P.-H.; Nagnibeda, T.

2016-05-01

We study the infinite family of spider-web graphs \\{{{ S }}k,N,M\\}, k≥slant 2, N≥slant 0 and M≥slant 1, initiated in the 50s in the context of network theory. It was later shown in physical literature that these graphs have remarkable percolation and spectral properties. We provide a mathematical explanation of these properties by putting the spider-web graphs in the context of group theory and algebraic graph theory. Namely, we realize them as tensor products of the well-known de Bruijn graphs \\{{{ B }}k,N\\} with cyclic graphs \\{{C}M\\} and show that these graphs are described by the action of the lamplighter group {{ L }}k={Z}/k{Z}\\wr {Z} on the infinite binary tree. Our main result is the identification of the infinite limit of \\{{{ S }}k,N,M\\}, as N,M\\to ∞ , with the Cayley graph of the lamplighter group {{ L }}k which, in turn, is one of the famous Diestel-Leader graphs {{DL}}k,k. As an application we compute the spectra of all spider-web graphs and show their convergence to the discrete spectral distribution associated with the Laplacian on the lamplighter group.

GraphReduce: Large-Scale Graph Analytics on Accelerator-Based HPC Systems

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

Sengupta, Dipanjan; Agarwal, Kapil; Song, Shuaiwen

2015-09-30

Recent work on real-world graph analytics has sought to leverage the massive amount of parallelism offered by GPU devices, but challenges remain due to the inherent irregularity of graph algorithms and limitations in GPU-resident memory for storing large graphs. We present GraphReduce, a highly efficient and scalable GPU-based framework that operates on graphs that exceed the device’s internal memory capacity. GraphReduce adopts a combination of both edge- and vertex-centric implementations of the Gather-Apply-Scatter programming model and operates on multiple asynchronous GPU streams to fully exploit the high degrees of parallelism in GPUs with efficient graph data movement between the hostmore » and the device.« less

Graphing Polar Curves

ERIC Educational Resources Information Center

Lawes, Jonathan F.

2013-01-01

Graphing polar curves typically involves a combination of three traditional techniques, all of which can be time-consuming and tedious. However, an alternative method--graphing the polar function on a rectangular plane--simplifies graphing, increases student understanding of the polar coordinate system, and reinforces graphing techniques learned…

Graph Coarsening for Path Finding in Cybersecurity Graphs

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

Hogan, Emilie A.; Johnson, John R.; Halappanavar, Mahantesh

2013-01-01

n the pass-the-hash attack, hackers repeatedly steal password hashes and move through a computer network with the goal of reaching a computer with high level administrative privileges. In this paper we apply graph coarsening in network graphs for the purpose of detecting hackers using this attack or assessing the risk level of the network's current state. We repeatedly take graph minors, which preserve the existence of paths in the graph, and take powers of the adjacency matrix to count the paths. This allows us to detect the existence of paths as well as find paths that have high risk ofmore » being used by adversaries.« less

Convex Graph Invariants

DTIC Science & Technology

2010-12-02

Motzkin, T. and Straus, E. (1965). Maxima for graphs and a new proof of a theorem of Turan . Canad. J. Math. 17 533–540. [33] Rendl, F. and Sotirov, R...Convex Graph Invariants Venkat Chandrasekaran, Pablo A . Parrilo, and Alan S. Willsky ∗ Laboratory for Information and Decision Systems Department of...this paper we study convex graph invariants, which are graph invariants that are convex functions of the adjacency matrix of a graph. Some examples

Interval Graph Limits

PubMed Central

Diaconis, Persi; Holmes, Susan; Janson, Svante

2015-01-01

We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W (x, y) on the unit square, with x and y uniform on the interval (0, 1). Instead, we fix a W and change the underlying distribution of the coordinates x and y. We find choices such that our limits are continuous. Connections to random interval graphs are given, including some examples. We also show a continuity result for the chromatic number and clique number of interval graphs. Some results on uniqueness of the limit description are given for general graph limits. PMID:26405368

Thoth: Software for data visualization & statistics

NASA Astrophysics Data System (ADS)

Laher, R. R.

2016-10-01

Thoth is a standalone software application with a graphical user interface for making it easy to query, display, visualize, and analyze tabular data stored in relational databases and data files. From imported data tables, it can create pie charts, bar charts, scatter plots, and many other kinds of data graphs with simple menus and mouse clicks (no programming required), by leveraging the open-source JFreeChart library. It also computes useful table-column data statistics. A mature tool, having underwent development and testing over several years, it is written in the Java computer language, and hence can be run on any computing platform that has a Java Virtual Machine and graphical-display capability. It can be downloaded and used by anyone free of charge, and has general applicability in science, engineering, medical, business, and other fields. Special tools and features for common tasks in astronomy and astrophysical research are included in the software.

Graphing with "LogoWriter."

ERIC Educational Resources Information Center

Yoder, Sharon K.

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

An Effective Method of Introducing the Periodic Table as a Crossword Puzzle at the High School Level

ERIC Educational Resources Information Center

Joag, Sushama D.

2014-01-01

A simple method to introduce the modern periodic table of elements at the high school level as a game of solving a crossword puzzle is presented here. A survey to test the effectiveness of this new method relative to the conventional method, involving use of a wall-mounted chart of the periodic table, was conducted on a convenience sample. This…

Growth Charts (For Parents)

MedlinePlus

... say about a child's health. Why Do Doctors Use Growth Charts? Growth charts are a standard part ... chart, they see which percentile line those measurements land on. The higher the percentile number, the bigger ...

Probing Factors Influencing Students' Graph Comprehension Regarding Four Operations in Kinematics Graphs

ERIC Educational Resources Information Center

Phage, Itumeleng B.; Lemmer, Miriam; Hitge, Mariette

2017-01-01

Students' graph comprehension may be affected by the background of the students who are the readers or interpreters of the graph, their knowledge of the context in which the graph is set, and the inferential processes required by the graph operation. This research study investigated these aspects of graph comprehension for 152 first year…

mpiGraph

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

Moody, Adam

2007-05-22

MpiGraph consists of an MPI application called mpiGraph written in C to measure message bandwidth and an associated crunch_mpiGraph script written in Perl to process the application output into an HTMO report. The mpiGraph application is designed to inspect the health and scalability of a high-performance interconnect while under heavy load. This is useful to detect hardware and software problems in a system, such as slow nodes, links, switches, or contention in switch routing. It is also useful to characterize how interconnect performance changes with different settings or how one interconnect type compares to another.

Development of Markup Language for Medical Record Charting: A Charting Language.

PubMed

Jung, Won-Mo; Chae, Younbyoung; Jang, Bo-Hyoung

2015-01-01

Nowadays a lot of trials for collecting electronic medical records (EMRs) exist. However, structuring data format for EMR is an especially labour-intensive task for practitioners. Here we propose a new mark-up language for medical record charting (called Charting Language), which borrows useful properties from programming languages. Thus, with Charting Language, the text data described in dynamic situation can be easily used to extract information.

Graph Databases for Large-Scale Healthcare Systems: A Framework for Efficient Data Management and Data Services

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

Park, Yubin; Shankar, Mallikarjun; Park, Byung H.

Designing a database system for both efficient data management and data services has been one of the enduring challenges in the healthcare domain. In many healthcare systems, data services and data management are often viewed as two orthogonal tasks; data services refer to retrieval and analytic queries such as search, joins, statistical data extraction, and simple data mining algorithms, while data management refers to building error-tolerant and non-redundant database systems. The gap between service and management has resulted in rigid database systems and schemas that do not support effective analytics. We compose a rich graph structure from an abstracted healthcaremore » RDBMS to illustrate how we can fill this gap in practice. We show how a healthcare graph can be automatically constructed from a normalized relational database using the proposed 3NF Equivalent Graph (3EG) transformation.We discuss a set of real world graph queries such as finding self-referrals, shared providers, and collaborative filtering, and evaluate their performance over a relational database and its 3EG-transformed graph. Experimental results show that the graph representation serves as multiple de-normalized tables, thus reducing complexity in a database and enhancing data accessibility of users. Based on this finding, we propose an ensemble framework of databases for healthcare applications.« less

State-Chart Autocoder

NASA Technical Reports Server (NTRS)

Clark, Kenneth; Watney, Garth; Murray, Alexander; Benowitz, Edward

2007-01-01

A computer program translates Unified Modeling Language (UML) representations of state charts into source code in the C, C++, and Python computing languages. ( State charts signifies graphical descriptions of states and state transitions of a spacecraft or other complex system.) The UML representations constituting the input to this program are generated by using a UML-compliant graphical design program to draw the state charts. The generated source code is consistent with the "quantum programming" approach, which is so named because it involves discrete states and state transitions that have features in common with states and state transitions in quantum mechanics. Quantum programming enables efficient implementation of state charts, suitable for real-time embedded flight software. In addition to source code, the autocoder program generates a graphical-user-interface (GUI) program that, in turn, generates a display of state transitions in response to events triggered by the user. The GUI program is wrapped around, and can be used to exercise the state-chart behavior of, the generated source code. Once the expected state-chart behavior is confirmed, the generated source code can be augmented with a software interface to the rest of the software with which the source code is required to interact.

Local Table Condensation in Rough Set Approach for Jumping Emerging Pattern Induction

NASA Astrophysics Data System (ADS)

Terlecki, Pawel; Walczak, Krzysztof

This paper extends the rough set approach for JEP induction based on the notion of a condensed decision table. The original transaction database is transformed to a relational form and patterns are induced by means of local reducts. The transformation employs an item aggregation obtained by coloring a graph that re0ects con0icts among items. For e±ciency reasons we propose to perform this preprocessing locally, i.e. at the transaction level, to achieve a higher dimensionality gain. Special maintenance strategy is also used to avoid graph rebuilds. Both global and local approach have been tested and discussed for dense and synthetically generated sparse datasets.

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

DTIC Science & Technology

2017-09-01

INTRODUCTION 1 3 METHODS , ASUMPTIONS, AND PROCEDURES 2 Software Abstractions for Graph Analytic Applications 2 High performance Platforms for Graph Processing...data is stored in a distributed file system. 3 METHODS , ASUMPTIONS, AND PROCEDURES Software Abstractions for Graph Analytic Applications To...implementations of novel methods for networks analysis: several methods for detection of overlapping communities, personalized PageRank, node embeddings into a d

Visualize Your Data with Google Fusion Tables

NASA Astrophysics Data System (ADS)

Brisbin, K. E.

2011-12-01

Google Fusion Tables is a modern data management platform that makes it easy to host, manage, collaborate on, visualize, and publish tabular data online. Fusion Tables allows users to upload their own data to the Google cloud, which they can then use to create compelling and interactive visualizations with the data. Users can view data on a Google Map, plot data in a line chart, or display data along a timeline. Users can share these visualizations with others to explore and discover interesting trends about various types of data, including scientific data such as invasive species or global trends in disease. Fusion Tables has been used by many organizations to visualize a variety of scientific data. One example is the California Redistricting Map created by the LA Times: http://goo.gl/gwZt5 The Pacific Institute and Circle of Blue have used Fusion Tables to map the quality of water around the world: http://goo.gl/T4SX8 The World Resources Institute mapped the threat level of coral reefs using Fusion Tables: http://goo.gl/cdqe8 What attendees will learn in this session: This session will cover all the steps necessary to use Fusion Tables to create a variety of interactive visualizations. Attendees will begin by learning about the various options for uploading data into Fusion Tables, including Shapefile, KML file, and CSV file import. Attendees will then learn how to use Fusion Tables to manage their data by merging it with other data and controlling the permissions of the data. Finally, the session will cover how to create a customized visualization from the data, and share that visualization with others using both Fusion Tables and the Google Maps API.

Quantization of gauge fields, graph polynomials and graph homology

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

Kreimer, Dirk, E-mail: kreimer@physik.hu-berlin.de; Sars, Matthias; Suijlekom, Walter D. van

2013-09-15

We review quantization of gauge fields using algebraic properties of 3-regular graphs. We derive the Feynman integrand at n loops for a non-abelian gauge theory quantized in a covariant gauge from scalar integrands for connected 3-regular graphs, obtained from the two Symanzik polynomials. The transition to the full gauge theory amplitude is obtained by the use of a third, new, graph polynomial, the corolla polynomial. This implies effectively a covariant quantization without ghosts, where all the relevant signs of the ghost sector are incorporated in a double complex furnished by the corolla polynomial–we call it cycle homology–and by graph homology.more » -- Highlights: •We derive gauge theory Feynman from scalar field theory with 3-valent vertices. •We clarify the role of graph homology and cycle homology. •We use parametric renormalization and the new corolla polynomial.« less

Graphing trillions of triangles

PubMed Central

Burkhardt, Paul

2016-01-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed. PMID:28690426

Graphing trillions of triangles.

PubMed

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

Understanding Charts and Graphs.

DTIC Science & Technology

1987-07-28

34notational.* English, then, is obviously not a notational system because ambiguous words or sentences are possible, whereas musical notion is notational...how lines and regions are detected and organized; these principles grow out of discoveries about human visual information processing. A syntactic...themselves name other colors (e.g., the word "red" is printed in blue ink; this is known as the OStroop effecto ). Similarly, if "left" and "right" are

Learning graph matching.

PubMed

Caetano, Tibério S; McAuley, Julian J; Cheng, Li; Le, Quoc V; Smola, Alex J

2009-06-01

As a fundamental problem in pattern recognition, graph matching has applications in a variety of fields, from computer vision to computational biology. In graph matching, patterns are modeled as graphs and pattern recognition amounts to finding a correspondence between the nodes of different graphs. Many formulations of this problem can be cast in general as a quadratic assignment problem, where a linear term in the objective function encodes node compatibility and a quadratic term encodes edge compatibility. The main research focus in this theme is about designing efficient algorithms for approximately solving the quadratic assignment problem, since it is NP-hard. In this paper we turn our attention to a different question: how to estimate compatibility functions such that the solution of the resulting graph matching problem best matches the expected solution that a human would manually provide. We present a method for learning graph matching: the training examples are pairs of graphs and the 'labels' are matches between them. Our experimental results reveal that learning can substantially improve the performance of standard graph matching algorithms. In particular, we find that simple linear assignment with such a learning scheme outperforms Graduated Assignment with bistochastic normalisation, a state-of-the-art quadratic assignment relaxation algorithm.

EvoGraph: On-The-Fly Efficient Mining of Evolving Graphs on GPU

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

Sengupta, Dipanjan; Song, Shuaiwen

With the prevalence of the World Wide Web and social networks, there has been a growing interest in high performance analytics for constantly-evolving dynamic graphs. Modern GPUs provide massive AQ1 amount of parallelism for efficient graph processing, but the challenges remain due to their lack of support for the near real-time streaming nature of dynamic graphs. Specifically, due to the current high volume and velocity of graph data combined with the complexity of user queries, traditional processing methods by first storing the updates and then repeatedly running static graph analytics on a sequence of versions or snapshots are deemed undesirablemore » and computational infeasible on GPU. We present EvoGraph, a highly efficient and scalable GPU- based dynamic graph analytics framework.« less

Reflecting on Graphs: Attributes of Graph Choice and Construction Practices in Biology

PubMed Central

Angra, Aakanksha; Gardner, Stephanie M.

2017-01-01

Undergraduate biology education reform aims to engage students in scientific practices such as experimental design, experimentation, and data analysis and communication. Graphs are ubiquitous in the biological sciences, and creating effective graphical representations involves quantitative and disciplinary concepts and skills. Past studies document student difficulties with graphing within the contexts of classroom or national assessments without evaluating student reasoning. Operating under the metarepresentational competence framework, we conducted think-aloud interviews to reveal differences in reasoning and graph quality between undergraduate biology students, graduate students, and professors in a pen-and-paper graphing task. All professors planned and thought about data before graph construction. When reflecting on their graphs, professors and graduate students focused on the function of graphs and experimental design, while most undergraduate students relied on intuition and data provided in the task. Most undergraduate students meticulously plotted all data with scaled axes, while professors and some graduate students transformed the data, aligned the graph with the research question, and reflected on statistics and sample size. Differences in reasoning and approaches taken in graph choice and construction corroborate and extend previous findings and provide rich targets for undergraduate and graduate instruction. PMID:28821538

Technetium: The First Radioelement on the Periodic Table

DOE PAGES

Johnstone, Erik V.; Yates, Mary Anne; Poineau, Frederic; ...

2017-02-21

The radioactive nature of technetium is discussed using a combination of introductory nuclear physics concepts and empirical trends observed in the chart of the nuclides and the periodic table of the elements. Trends such as the enhanced stability of nucleon pairs, magic numbers, and Mattauch's rule are described. Here, the concepts of nuclear binding energies and the nuclear shell model are introduced and used to explain the relative stability of radionuclides and, in particular, the isotopes of technetium.

Gestational age, gender and parity specific centile charts for placental weight for singleton deliveries in Aberdeen, UK.

PubMed

Wallace, J M; Bhattacharya, S; Horgan, G W

2013-03-01

The weight of the placenta is a crude but useful proxy for its function in vivo. Accordingly extremes of placental weight are associated with adverse pregnancy outcomes while even normal variations in placental size may impact lifelong health. Centile charts of placental weight for gestational age and gender are used to identify placental weight extremes but none report the effect of parity. Thus the objective was to produce gender and gestational age specific centile charts for placental weight in nulliparous and multiparous women. Data was extracted from the Aberdeen Maternity and Neonatal Databank for all women delivering singleton babies in Aberdeen city and district after 24 weeks gestation. Gestational age specific centile charts for placental weight by gender and parity grouping (n = 88,649 deliveries over a 30 year period) were constructed using the LMS method after exclusion of outliers (0.63% of deliveries meeting study inclusion criteria). Tables and figures are presented for placental weight centiles according to gestational age, gender and parity grouping. Tables are additionally presented for the birth weight to placental weight ratio by gender. Placental weight and the fetal:placental weight ratio were higher in male versus female deliveries. Placental weight was greater in multiparous compared with nulliparous women. We present strong evidence that both gender and parity grouping influence placental weight centiles. The differences at any given gestational age are small and the effects of parity are greater overall than those of gender. In contrast the birth weight to placental weight ratio differs by gender only. These UK population specific centile charts may be useful in studies investigating the role of the placenta in mediating pregnancy outcome and lifelong health. Copyright © 2012 Elsevier Ltd. All rights reserved.

Graphs to estimate an individualized risk of breast cancer.

PubMed

Benichou, J; Gail, M H; Mulvihill, J J

1996-01-01

Clinicians who counsel women about their risk for developing breast cancer need a rapid method to estimate individualized risk (absolute risk), as well as the confidence limits around that point. The Breast Cancer Detection Demonstration Project (BCDDP) model (sometimes called the Gail model) assumes no genetic model and simultaneously incorporates five risk factors, but involves cumbersome calculations and interpolations. This report provides graphs to estimate the absolute risk of breast cancer from the BCDDP model. The BCDDP recruited 280,000 women from 1973 to 1980 who were monitored for 5 years. From this cohort, 2,852 white women developed breast cancer and 3,146 controls were selected, all with complete risk-factor information. The BCDDP model, previously developed from these data, was used to prepare graphs that relate a specific summary relative-risk estimate to the absolute risk of developing breast cancer over intervals of 10, 20, and 30 years. Once a summary relative risk is calculated, the appropriate graph is chosen that shows the 10-, 20-, or 30-year absolute risk of developing breast cancer. A separate graph gives the 95% confidence limits around the point estimate of absolute risk. Once a clinician rules out a single gene trait that predisposes to breast cancer and elicits information on age and four risk factors, the tables and figures permit an estimation of a women's absolute risk of developing breast cancer in the next three decades. These results are intended to be applied to women who undergo regular screening. They should be used only in a formal counseling program to maximize a woman's understanding of the estimates and the proper use of them.

Nested Tracking Graphs

DOE PAGES

Lukasczyk, Jonas; Weber, Gunther; Maciejewski, Ross; ...

2017-06-01

Tracking graphs are a well established tool in topological analysis to visualize the evolution of components and their properties over time, i.e., when components appear, disappear, merge, and split. However, tracking graphs are limited to a single level threshold and the graphs may vary substantially even under small changes to the threshold. To examine the evolution of features for varying levels, users have to compare multiple tracking graphs without a direct visual link between them. We propose a novel, interactive, nested graph visualization based on the fact that the tracked superlevel set components for different levels are related to eachmore » other through their nesting hierarchy. This approach allows us to set multiple tracking graphs in context to each other and enables users to effectively follow the evolution of components for different levels simultaneously. We show the effectiveness of our approach on datasets from finite pointset methods, computational fluid dynamics, and cosmology simulations.« less

Increasing the Transparency of Stated Choice Studies for Policy Analysis: Designing Experiments to Produce Raw Response Graphs

ERIC Educational Resources Information Center

Sur, Dipika; Cook, Joseph; Chatterjee, Susmita; Deen, Jacqueline; Whittington, Dale

2007-01-01

We believe a lack of transparency undermines both the credibility of, and interest in, stated choice studies among policy makers. Unlike articles reporting the results of contingent valuation studies, papers in the stated choice literature rarely present simple tabulations of raw response data (that is, a table or graph showing the percentage of…

[Ophthalmologic reading charts : Part 2: Current logarithmically scaled reading charts].

PubMed

Radner, W

2016-12-01

To analyze currently available reading charts regarding print size, logarithmic print size progression, and the background of test-item standardization. For the present study, the following logarithmically scaled reading charts were investigated using a measuring microscope (iNexis VMA 2520; Nikon, Tokyo): Eschenbach, Zeiss, OCULUS, MNREAD (Minnesota Near Reading Test), Colenbrander, and RADNER. Calculations were made according to EN-ISO 8596 and the International Research Council recommendations. Modern reading charts and cards exhibit a logarithmic progression of print sizes. The RADNER reading charts comprise four different cards with standardized test items (sentence optotypes), a well-defined stop criterion, accurate letter sizes, and a high print quality. Numbers and Landolt rings are also given in the booklet. The OCULUS cards have currently been reissued according to recent standards and also exhibit a high print quality. In addition to letters, numbers, Landolt rings, and examples taken from a timetable and the telephone book, sheet music is also offered. The Colenbrander cards use short sentences of 44 characters, including spaces, and exhibit inaccuracy at smaller letter sizes, as do the MNREAD cards. The MNREAD cards use sentences of 60 characters, including spaces, and have a high print quality. Modern reading charts show that international standards can be achieved with test items similar to optotypes, by using recent technology and developing new concepts of test-item standardization. Accurate print sizes, high print quality, and a logarithmic progression should become the minimum requirements for reading charts and reading cards in ophthalmology.

GraphMeta: Managing HPC Rich Metadata in Graphs

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

Dai, Dong; Chen, Yong; Carns, Philip

High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introducesmore » significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.« less

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

NASA Astrophysics Data System (ADS)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

Graphing Important People

ERIC Educational Resources Information Center

Reading Teacher, 2012

2012-01-01

The "Toolbox" column features content adapted from ReadWriteThink.org lesson plans and provides practical tools for classroom teachers. This issue's column features a lesson plan adapted from "Graphing Plot and Character in a Novel" by Lisa Storm Fink and "Bio-graph: Graphing Life Events" by Susan Spangler. Students retell biographic events…

Supermanifolds from Feynman graphs

NASA Astrophysics Data System (ADS)

Marcolli, Matilde; Rej, Abhijnan

2008-08-01

We generalize the computation of Feynman integrals of log divergent graphs in terms of the Kirchhoff polynomial to the case of graphs with both fermionic and bosonic edges, to which we assign a set of ordinary and Grassmann variables. This procedure gives a computation of the Feynman integrals in terms of a period on a supermanifold, for graphs admitting a basis of the first homology satisfying a condition generalizing the log divergence in this context. The analog in this setting of the graph hypersurfaces is a graph supermanifold given by the divisor of zeros and poles of the Berezinian of a matrix associated with the graph, inside a superprojective space. We introduce a Grothendieck group for supermanifolds and identify the subgroup generated by the graph supermanifolds. This can be seen as a general procedure for constructing interesting classes of supermanifolds with associated periods.

Spectral Imaging of Portolan Charts

NASA Astrophysics Data System (ADS)

France, Fenella G.; Wilson, Meghan A.; Ghez, Anita

2018-05-01

Spectral imaging of Portolan Charts, early nautical charts, provided extensive new information about their construction and creation. The origins of the portolan chart style have been a continual source of perplexity to numerous generations of cartographic historians. The spectral imaging system utilized incorporates a 50 megapixel mono-chrome camera with light emitting diode (LED) illumination panels that cover the range from 365 nm to 1050 nm to capture visible and non-visible information. There is little known about how portolan charts evolved, and what influenced their creation. These early nautical charts began as working navigational tools of medieval mariners, initially made in the 1300s in Italy, Portugal and Spain; however the origin and development of the portolan chart remained shrouded in mystery. Questions about these early navigational charts included whether colorants were commensurate with the time period and geographical location, and if different, did that give insight into trade routes, or possible later additions to the charts? For example; spectral data showed the red pigment on both the 1320 portolan chart and the 1565 Galapagos Islands matched vermillion, an opaque red pigment used since antiquity. The construction of these charts was also of great interest. Spectral imaging with a range of illumination modes revealed the presence of a "hidden circle" often referred to in relation to their construction. This paper will present in-depth analysis of how spectral imaging of the Portolans revealed similarities and differences, new hidden information and shed new light on construction and composition.

Topic Model for Graph Mining.

PubMed

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Evolutionary dynamics on graphs

NASA Astrophysics Data System (ADS)

Lieberman, Erez; Hauert, Christoph; Nowak, Martin A.

2005-01-01

Evolutionary dynamics have been traditionally studied in the context of homogeneous or spatially extended populations. Here we generalize population structure by arranging individuals on a graph. Each vertex represents an individual. The weighted edges denote reproductive rates which govern how often individuals place offspring into adjacent vertices. The homogeneous population, described by the Moran process, is the special case of a fully connected graph with evenly weighted edges. Spatial structures are described by graphs where vertices are connected with their nearest neighbours. We also explore evolution on random and scale-free networks. We determine the fixation probability of mutants, and characterize those graphs for which fixation behaviour is identical to that of a homogeneous population. Furthermore, some graphs act as suppressors and others as amplifiers of selection. It is even possible to find graphs that guarantee the fixation of any advantageous mutant. We also study frequency-dependent selection and show that the outcome of evolutionary games can depend entirely on the structure of the underlying graph. Evolutionary graph theory has many fascinating applications ranging from ecology to multi-cellular organization and economics.

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

NASA Astrophysics Data System (ADS)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

Methods of visualizing graphs

DOEpatents

Wong, Pak C.; Mackey, Patrick S.; Perrine, Kenneth A.; Foote, Harlan P.; Thomas, James J.

2008-12-23

Methods for visualizing a graph by automatically drawing elements of the graph as labels are disclosed. In one embodiment, the method comprises receiving node information and edge information from an input device and/or communication interface, constructing a graph layout based at least in part on that information, wherein the edges are automatically drawn as labels, and displaying the graph on a display device according to the graph layout. In some embodiments, the nodes are automatically drawn as labels instead of, or in addition to, the label-edges.

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

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

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Enabling Graph Mining in RDF Triplestores using SPARQL for Holistic In-situ Graph Analysis

DOE PAGES

Lee, Sangkeun; Sukumar, Sreenivas R; Hong, Seokyong; ...

2016-01-01

The graph analysis is now considered as a promising technique to discover useful knowledge in data with a new perspective. We envi- sion that there are two dimensions of graph analysis: OnLine Graph Analytic Processing (OLGAP) and Graph Mining (GM) where each respectively focuses on subgraph pattern matching and automatic knowledge discovery in graph. Moreover, as these two dimensions aim to complementarily solve complex problems, holistic in-situ graph analysis which covers both OLGAP and GM in a single system is critical for minimizing the burdens of operating multiple graph systems and transferring intermediate result-sets between those systems. Nevertheless, most existingmore » graph analysis systems are only capable of one dimension of graph analysis. In this work, we take an approach to enabling GM capabilities (e.g., PageRank, connected-component analysis, node eccentricity, etc.) in RDF triplestores, which are originally developed to store RDF datasets and provide OLGAP capability. More specifically, to achieve our goal, we implemented six representative graph mining algorithms using SPARQL. The approach allows a wide range of available RDF data sets directly applicable for holistic graph analysis within a system. For validation of our approach, we evaluate performance of our implementations with nine real-world datasets and three different computing environments - a laptop computer, an Amazon EC2 instance, and a shared-memory Cray XMT2 URIKA-GD graph-processing appliance. The experimen- tal results show that our implementation can provide promising and scalable performance for real world graph analysis in all tested environments. The developed software is publicly available in an open-source project that we initiated.« less

Graph-based optimization of epitope coverage for vaccine antigen design

DOE PAGES

Theiler, James Patrick; Korber, Bette Tina Marie

2017-01-29

Epigraph is a recently developed algorithm that enables the computationally efficient design of single or multi-antigen vaccines to maximize the potential epitope coverage for a diverse pathogen population. Potential epitopes are defined as short contiguous stretches of proteins, comparable in length to T-cell epitopes. This optimal coverage problem can be formulated in terms of a directed graph, with candidate antigens represented as paths that traverse this graph. Epigraph protein sequences can also be used as the basis for designing peptides for experimental evaluation of immune responses in natural infections to highly variable proteins. The epigraph tool suite also enables rapidmore » characterization of populations of diverse sequences from an immunological perspective. Fundamental distance measures are based on immunologically relevant shared potential epitope frequencies, rather than simple Hamming or phylogenetic distances. Here, we provide a mathematical description of the epigraph algorithm, include a comparison of different heuristics that can be used when graphs are not acyclic, and we describe an additional tool we have added to the web-based epigraph tool suite that provides frequency summaries of all distinct potential epitopes in a population. Lastly, we also show examples of the graphical output and summary tables that can be generated using the epigraph tool suite and explain their content and applications.« less

Graph-based optimization of epitope coverage for vaccine antigen design

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

Theiler, James Patrick; Korber, Bette Tina Marie

Epigraph is a recently developed algorithm that enables the computationally efficient design of single or multi-antigen vaccines to maximize the potential epitope coverage for a diverse pathogen population. Potential epitopes are defined as short contiguous stretches of proteins, comparable in length to T-cell epitopes. This optimal coverage problem can be formulated in terms of a directed graph, with candidate antigens represented as paths that traverse this graph. Epigraph protein sequences can also be used as the basis for designing peptides for experimental evaluation of immune responses in natural infections to highly variable proteins. The epigraph tool suite also enables rapidmore » characterization of populations of diverse sequences from an immunological perspective. Fundamental distance measures are based on immunologically relevant shared potential epitope frequencies, rather than simple Hamming or phylogenetic distances. Here, we provide a mathematical description of the epigraph algorithm, include a comparison of different heuristics that can be used when graphs are not acyclic, and we describe an additional tool we have added to the web-based epigraph tool suite that provides frequency summaries of all distinct potential epitopes in a population. Lastly, we also show examples of the graphical output and summary tables that can be generated using the epigraph tool suite and explain their content and applications.« less

Reflecting on Graphs: Attributes of Graph Choice and Construction Practices in Biology.

PubMed

Angra, Aakanksha; Gardner, Stephanie M

2017-01-01

Undergraduate biology education reform aims to engage students in scientific practices such as experimental design, experimentation, and data analysis and communication. Graphs are ubiquitous in the biological sciences, and creating effective graphical representations involves quantitative and disciplinary concepts and skills. Past studies document student difficulties with graphing within the contexts of classroom or national assessments without evaluating student reasoning. Operating under the metarepresentational competence framework, we conducted think-aloud interviews to reveal differences in reasoning and graph quality between undergraduate biology students, graduate students, and professors in a pen-and-paper graphing task. All professors planned and thought about data before graph construction. When reflecting on their graphs, professors and graduate students focused on the function of graphs and experimental design, while most undergraduate students relied on intuition and data provided in the task. Most undergraduate students meticulously plotted all data with scaled axes, while professors and some graduate students transformed the data, aligned the graph with the research question, and reflected on statistics and sample size. Differences in reasoning and approaches taken in graph choice and construction corroborate and extend previous findings and provide rich targets for undergraduate and graduate instruction. © 2017 A. Angra and S. M. Gardner. CBE—Life Sciences Education © 2017 The American Society for Cell Biology. This article is distributed by The American Society for Cell Biology under license from the author(s). It is available to the public under an Attribution–Noncommercial–Share Alike 3.0 Unported Creative Commons License (http://creativecommons.org/licenses/by-nc-sa/3.0).

Key-Node-Separated Graph Clustering and Layouts for Human Relationship Graph Visualization.

PubMed

Itoh, Takayuki; Klein, Karsten

2015-01-01

Many graph-drawing methods apply node-clustering techniques based on the density of edges to find tightly connected subgraphs and then hierarchically visualize the clustered graphs. However, users may want to focus on important nodes and their connections to groups of other nodes for some applications. For this purpose, it is effective to separately visualize the key nodes detected based on adjacency and attributes of the nodes. This article presents a graph visualization technique for attribute-embedded graphs that applies a graph-clustering algorithm that accounts for the combination of connections and attributes. The graph clustering step divides the nodes according to the commonality of connected nodes and similarity of feature value vectors. It then calculates the distances between arbitrary pairs of clusters according to the number of connecting edges and the similarity of feature value vectors and finally places the clusters based on the distances. Consequently, the technique separates important nodes that have connections to multiple large clusters and improves the visibility of such nodes' connections. To test this technique, this article presents examples with human relationship graph datasets, including a coauthorship and Twitter communication network dataset.

Well-Covered Graphs: A Survey

DTIC Science & Technology

1991-01-01

critical G’s/# G’s -) 0 as IV(G)I -- oo? References [B1] C. Berge, Regularizable graphs, Ann. Discrete Math ., 3, 1978, 11-19. [B2] _ _, Some common...Springer-Verlag, Berlin, 1980, 108-123. [B3] _ _, Some common properties for regularizable graphs, edge-critical graphs, and B-graphs, Ann. Discrete Math ., 12...graphs - an extension of the K6nig-Egervgiry theorem, Discrete Math ., 27, 1979, 23-33. [ER] M.N Ellingham and G.F. Royle, Well-covered cubic graphs

Production Process for Financial Data Tables in FHWA’s Highway Statistics Series - Highway Statistics Series: Revenue, Debt, and Expenditures.

DOT National Transportation Integrated Search

2015-11-01

This report captures the production process and programs and steps used to produce the finance tables and charts published in the Federal Highway Administrations (FHWAs) Highway Statistics Series publication site made available to Congress and ...

Spectral partitioning in equitable graphs.

PubMed

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Spectral partitioning in equitable graphs

NASA Astrophysics Data System (ADS)

Barucca, Paolo

2017-06-01

Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

Graph characterization via Ihara coefficients.

PubMed

Ren, Peng; Wilson, Richard C; Hancock, Edwin R

2011-02-01

The novel contributions of this paper are twofold. First, we demonstrate how to characterize unweighted graphs in a permutation-invariant manner using the polynomial coefficients from the Ihara zeta function, i.e., the Ihara coefficients. Second, we generalize the definition of the Ihara coefficients to edge-weighted graphs. For an unweighted graph, the Ihara zeta function is the reciprocal of a quasi characteristic polynomial of the adjacency matrix of the associated oriented line graph. Since the Ihara zeta function has poles that give rise to infinities, the most convenient numerically stable representation is to work with the coefficients of the quasi characteristic polynomial. Moreover, the polynomial coefficients are invariant to vertex order permutations and also convey information concerning the cycle structure of the graph. To generalize the representation to edge-weighted graphs, we make use of the reduced Bartholdi zeta function. We prove that the computation of the Ihara coefficients for unweighted graphs is a special case of our proposed method for unit edge weights. We also present a spectral analysis of the Ihara coefficients and indicate their advantages over other graph spectral methods. We apply the proposed graph characterization method to capturing graph-class structure and clustering graphs. Experimental results reveal that the Ihara coefficients are more effective than methods based on Laplacian spectra.

Fully Decomposable Split Graphs

NASA Astrophysics Data System (ADS)

Broersma, Hajo; Kratsch, Dieter; Woeginger, Gerhard J.

We discuss various questions around partitioning a split graph into connected parts. Our main result is a polynomial time algorithm that decides whether a given split graph is fully decomposable, i.e., whether it can be partitioned into connected parts of order α 1,α 2,...,α k for every α 1,α 2,...,α k summing up to the order of the graph. In contrast, we show that the decision problem whether a given split graph can be partitioned into connected parts of order α 1,α 2,...,α k for a given partition α 1,α 2,...,α k of the order of the graph, is NP-hard.

BootGraph: probabilistic fiber tractography using bootstrap algorithms and graph theory.

PubMed

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

Graph Theory

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

Sanfilippo, Antonio P.

2005-12-27

Graph theory is a branch of discrete combinatorial mathematics that studies the properties of graphs. The theory was pioneered by the Swiss mathematician Leonhard Euler in the 18th century, commenced its formal development during the second half of the 19th century, and has witnessed substantial growth during the last seventy years, with applications in areas as diverse as engineering, computer science, physics, sociology, chemistry and biology. Graph theory has also had a strong impact in computational linguistics by providing the foundations for the theory of features structures that has emerged as one of the most widely used frameworks for themore » representation of grammar formalisms.« less

7 CFR 51.2276 - Color chart.

Code of Federal Regulations, 2012 CFR

2012-01-01

... walnut skin color listed as color classifications. (a) Availability of color chart. The USDA Walnut Color... 7 Agriculture 2 2012-01-01 2012-01-01 false Color chart. 51.2276 Section 51.2276 Agriculture... Standards for Shelled English Walnuts (Juglans Regia) General § 51.2276 Color chart. The color chart (USDA...

7 CFR 51.2276 - Color chart.

Code of Federal Regulations, 2011 CFR

2011-01-01

... walnut skin color listed as color classifications. (a) Availability of color chart. The USDA Walnut Color... 7 Agriculture 2 2011-01-01 2011-01-01 false Color chart. 51.2276 Section 51.2276 Agriculture... Standards for Shelled English Walnuts (Juglans Regia) General § 51.2276 Color chart. The color chart (USDA...

7 CFR 51.2276 - Color chart.

Code of Federal Regulations, 2014 CFR

2014-01-01

....2276 Color chart. The color chart (USDA Walnut Color Chart) to which reference is made in §§ 51.2281 and 51.2282 illustrates the four shades of walnut skin color listed as color classifications. (a... 7 Agriculture 2 2014-01-01 2014-01-01 false Color chart. 51.2276 Section 51.2276 Agriculture...

7 CFR 51.2276 - Color chart.

Code of Federal Regulations, 2013 CFR

2013-01-01

....2276 Color chart. The color chart (USDA Walnut Color Chart) to which reference is made in §§ 51.2281 and 51.2282 illustrates the four shades of walnut skin color listed as color classifications. (a... 7 Agriculture 2 2013-01-01 2013-01-01 false Color chart. 51.2276 Section 51.2276 Agriculture...

On the modification Highly Connected Subgraphs (HCS) algorithm in graph clustering for weighted graph

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Sugeng, K. A.; Aldila, D.

2018-04-01

Nowadays, in the modern world, since technology and human civilization start to progress, all city in the world is almost connected. The various places in this world are easier to visit. It is an impact of transportation technology and highway construction. The cities which have been connected can be represented by graph. Graph clustering is one of ways which is used to answer some problems represented by graph. There are some methods in graph clustering to solve the problem spesifically. One of them is Highly Connected Subgraphs (HCS) method. HCS is used to identify cluster based on the graph connectivity k for graph G. The connectivity in graph G is denoted by k(G)> \\frac{n}{2} that n is the total of vertices in G, then it is called as HCS or the cluster. This research used literature review and completed with simulation of program in a software. We modified HCS algorithm by using weighted graph. The modification is located in the Process Phase. Process Phase is used to cut the connected graph G into two subgraphs H and \\bar{H}. We also made a program by using software Octave-401. Then we applied the data of Flight Routes Mapping of One of Airlines in Indonesia to our program.

Mathematical foundations of the GraphBLAS

DOE PAGES

Kepner, Jeremy; Aaltonen, Peter; Bader, David; ...

2016-12-01

The GraphBLAS standard (GraphBlas.org) is being developed to bring the potential of matrix-based graph algorithms to the broadest possible audience. Mathematically, the GraphBLAS defines a core set of matrix-based graph operations that can be used to implement a wide class of graph algorithms in a wide range of programming environments. This study provides an introduction to the mathematics of the GraphBLAS. Graphs represent connections between vertices with edges. Matrices can represent a wide range of graphs using adjacency matrices or incidence matrices. Adjacency matrices are often easier to analyze while incidence matrices are often better for representing data. Fortunately, themore » two are easily connected by matrix multiplication. A key feature of matrix mathematics is that a very small number of matrix operations can be used to manipulate a very wide range of graphs. This composability of a small number of operations is the foundation of the GraphBLAS. A standard such as the GraphBLAS can only be effective if it has low performance overhead. Finally, performance measurements of prototype GraphBLAS implementations indicate that the overhead is low.« less

7 CFR 51.2276 - Color chart.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Color chart. 51.2276 Section 51.2276 Agriculture... Standards for Shelled English Walnuts (Juglans Regia) General § 51.2276 Color chart. The color chart (USDA Walnut Color Chart) to which reference is made in §§ 51.2281 and 51.2282 illustrates the four shades of...

7 CFR 51.2946 - Color chart.

Code of Federal Regulations, 2010 CFR

2010-01-01

... 7 Agriculture 2 2010-01-01 2010-01-01 false Color chart. 51.2946 Section 51.2946 Agriculture... Standards for Grades of Walnuts in the Shell General § 51.2946 Color chart. The color chart (USDA Walnut Color Chart) to which reference is made in §§ 51.2948, 51.2949, 51.2950, 51.2954, and 51.2963...

Matching Extension in Regular Graphs

DTIC Science & Technology

1989-01-01

Plummer, Matching Theory, Ann. Discrete Math . 29, North- Holland, Amsterdam, 1986. [101 , The matching structure of graphs: some recent re- sults...maximums d’un graphe, These, Dr. troisieme cycle, Univ. Grenoble, 1978. [12 ] D. Naddef and W.R. Pulleyblank, Matching in regular graphs, Discrete Math . 34...1981, 283-291. [13 1 M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. . [ 141 ,Matching extension in planar graphs IV

Comparison and Enumeration of Chemical Graphs

PubMed Central

Akutsu, Tatsuya; Nagamochi, Hiroshi

2013-01-01

Chemical compounds are usually represented as graph structured data in computers. In this review article, we overview several graph classes relevant to chemical compounds and the computational complexities of several fundamental problems for these graph classes. In particular, we consider the following problems: determining whether two chemical graphs are identical, determining whether one input chemical graph is a part of the other input chemical graph, finding a maximum common part of two input graphs, finding a reaction atom mapping, enumerating possible chemical graphs, and enumerating stereoisomers. We also discuss the relationship between the fifth problem and kernel functions for chemical compounds. PMID:24688697

A Semantic Graph Query Language

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

Kaplan, I L

2006-10-16

Semantic graphs can be used to organize large amounts of information from a number of sources into one unified structure. A semantic query language provides a foundation for extracting information from the semantic graph. The graph query language described here provides a simple, powerful method for querying semantic graphs.

GoFFish: A Sub-Graph Centric Framework for Large-Scale Graph Analytics1

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

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith

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 themore » 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.« less

SGFSC: speeding the gene functional similarity calculation based on hash tables.

PubMed

Tian, Zhen; Wang, Chunyu; Guo, Maozu; Liu, Xiaoyan; Teng, Zhixia

2016-11-04

In recent years, many measures of gene functional similarity have been proposed and widely used in all kinds of essential research. These methods are mainly divided into two categories: pairwise approaches and group-wise approaches. However, a common problem with these methods is their time consumption, especially when measuring the gene functional similarities of a large number of gene pairs. The problem of computational efficiency for pairwise approaches is even more prominent because they are dependent on the combination of semantic similarity. Therefore, the efficient measurement of gene functional similarity remains a challenging problem. To speed current gene functional similarity calculation methods, a novel two-step computing strategy is proposed: (1) establish a hash table for each method to store essential information obtained from the Gene Ontology (GO) graph and (2) measure gene functional similarity based on the corresponding hash table. There is no need to traverse the GO graph repeatedly for each method with the help of the hash table. The analysis of time complexity shows that the computational efficiency of these methods is significantly improved. We also implement a novel Speeding Gene Functional Similarity Calculation tool, namely SGFSC, which is bundled with seven typical measures using our proposed strategy. Further experiments show the great advantage of SGFSC in measuring gene functional similarity on the whole genomic scale. The proposed strategy is successful in speeding current gene functional similarity calculation methods. SGFSC is an efficient tool that is freely available at http://nclab.hit.edu.cn/SGFSC . The source code of SGFSC can be downloaded from http://pan.baidu.com/s/1dFFmvpZ .

GraphPrints: Towards a Graph Analytic Method for Network Anomaly Detection

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

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

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

Smart Aeronautical Chart Management System Design

NASA Astrophysics Data System (ADS)

Pakdil, M. E.; Celik, R. N.; Kaya, Ö.; Konak, Y. C.; Guney, C.

2015-10-01

Civil aviation is developing rapidly, and the number of domestic and international operations is increasing exponentially every year than the previous one. Airline companies with increased air traffic and the number of passengers increase the demand of new aircrafts. An aircraft needs not only fuel but also pilot and aeronautical information (charts, digital navigation information, flight plan, and etc.) to perform flight operation. One of the most important components in aeronautical information is the terminal chart. Authorized institution in every state is responsible to publish their terminal charts for certain periods. Although these charts are produced in accordance with ICAO's Annex 4 and Annex 15, cartographic representation and page layout differs in each state's publication. This situation makes difficult to read them by pilots. In this paper, standard instrument departure (SID) charts are analysed to produce by use of cutting-edge and competitive technologies instead of classical computer-aided drawing and vector based graphic applications that are currently used by main chart producers. The goal is to design efficient and commercial chart management system that is able to produce aeronautical charts with same cartographic representation for all states.

Graphs and Tracks Revisited

NASA Astrophysics Data System (ADS)

Christian, Wolfgang; Belloni, Mario

2013-04-01

We have recently developed a Graphs and Tracks model based on an earlier program by David Trowbridge, as shown in Fig. 1. Our model can show position, velocity, acceleration, and energy graphs and can be used for motion-to-graphs exercises. Users set the heights of the track segments, and the model displays the motion of the ball on the track together with position, velocity, and acceleration graphs. This ready-to-run model is available in the ComPADRE OSP Collection at www.compadre.org/osp/items/detail.cfm?ID=12023.

Objective evaluation of slanted edge charts

NASA Astrophysics Data System (ADS)

Hornung, Harvey (.

2015-01-01

Camera objective characterization methodologies are widely used in the digital camera industry. Most objective characterization systems rely on a chart with specific patterns, a software algorithm measures a degradation or difference between the captured image and the chart itself. The Spatial Frequency Response (SFR) method, which is part of the ISO 122331 standard, is now very commonly used in the imaging industry, it is a very convenient way to measure a camera Modulation transfer function (MTF). The SFR algorithm can measure frequencies beyond the Nyquist frequency thanks to super-resolution, so it does provide useful information on aliasing and can provide modulation for frequencies between half Nyquist and Nyquist on all color channels of a color sensor with a Bayer pattern. The measurement process relies on a chart that is simple to manufacture: a straight transition from a bright reflectance to a dark one (black and white for instance), while a sine chart requires handling precisely shades of gray which can also create all sort of issues with printers that rely on half-toning. However, no technology can create a perfect edge, so it is important to assess the quality of the chart and understand how it affects the accuracy of the measurement. In this article, I describe a protocol to characterize the MTF of a slanted edge chart, using a high-resolution flatbed scanner. The main idea is to use the RAW output of the scanner as a high-resolution micro-densitometer, since the signal is linear it is suitable to measure the chart MTF using the SFR algorithm. The scanner needs to be calibrated in sharpness: the scanner MTF is measured with a calibrated sine chart and inverted to compensate for the modulation loss from the scanner. Then the true chart MTF is computed. This article compares measured MTF from commercial charts and charts printed on printers, and also compares how of the contrast of the edge (using different shades of gray) can affect the chart MTF

Helping Students Make Sense of Graphs: An Experimental Trial of SmartGraphs Software

ERIC Educational Resources Information Center

Zucker, Andrew; Kay, Rachel; Staudt, Carolyn

2014-01-01

Graphs are commonly used in science, mathematics, and social sciences to convey important concepts; yet students at all ages demonstrate difficulties interpreting graphs. This paper reports on an experimental study of free, Web-based software called SmartGraphs that is specifically designed to help students overcome their misconceptions regarding…

Graphing Inequalities, Connecting Meaning

ERIC Educational Resources Information Center

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…

On Edge Exchangeable Random Graphs

NASA Astrophysics Data System (ADS)

Janson, Svante

2017-06-01

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show that the model can produce dense, sparse and extremely sparse random graphs. One example yields a power-law degree distribution. We give some examples where the random graph is dense and converges a.s. in the sense of graph limit theory, but also an example where a.s. every graph limit is the limit of some subsequence. Another example is sparse and yields convergence to a non-integrable generalized graphon defined on (0,∞).

Spectral fluctuations of quantum graphs

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

Pluhař, Z.; Weidenmüller, H. A.

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.

Multiple graph regularized protein domain ranking.

PubMed

Wang, Jim Jing-Yan; Bensmail, Halima; Gao, Xin

2012-11-19

Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications.

Private Graphs - Access Rights on Graphs for Seamless Navigation

NASA Astrophysics Data System (ADS)

Dorner, W.; Hau, F.; Pagany, R.

2016-06-01

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.

Synthetic-Type Control Charts for Time-Between-Events Monitoring

PubMed Central

Yen, Fang Yen; Chong, Khoo Michael Boon; Ha, Lee Ming

2013-01-01

This paper proposes three synthetic-type control charts to monitor the mean time-between-events of a homogenous Poisson process. The first proposed chart combines an Erlang (cumulative time between events, Tr) chart and a conforming run length (CRL) chart, denoted as Synth-Tr chart. The second proposed chart combines an exponential (or T) chart and a group conforming run length (GCRL) chart, denoted as GR-T chart. The third proposed chart combines an Erlang chart and a GCRL chart, denoted as GR-Tr chart. By using a Markov chain approach, the zero- and steady-state average number of observations to signal (ANOS) of the proposed charts are obtained, in order to evaluate the performance of the three charts. The optimal design of the proposed charts is shown in this paper. The proposed charts are superior to the existing T chart, Tr chart, and Synth-T chart. As compared to the EWMA-T chart, the GR-T chart performs better in detecting large shifts, in terms of the zero- and steady-state performances. The zero-state Synth-T4 and GR-Tr (r = 3 or 4) charts outperform the EWMA-T chart for all shifts, whereas the Synth-Tr (r = 2 or 3) and GR-T 2 charts perform better for moderate to large shifts. For the steady-state process, the Synth-Tr and GR-Tr charts are more efficient than the EWMA-T chart in detecting small to moderate shifts. PMID:23755231

Graph Visualization for RDF Graphs with SPARQL-EndPoints

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

Sukumar, Sreenivas R; Bond, Nathaniel

2014-07-11

RDF graphs are hard to visualize as triples. This software module is a web interface that connects to a SPARQL endpoint and retrieves graph data that the user can explore interactively and seamlessly. The software written in python and JavaScript has been tested to work on screens as little as the smart phones to large screens such as EVEREST.

Multiple graph regularized protein domain ranking

PubMed Central

2012-01-01

Background Protein domain ranking is a fundamental task in structural biology. Most protein domain ranking methods rely on the pairwise comparison of protein domains while neglecting the global manifold structure of the protein domain database. Recently, graph regularized ranking that exploits the global structure of the graph defined by the pairwise similarities has been proposed. However, the existing graph regularized ranking methods are very sensitive to the choice of the graph model and parameters, and this remains a difficult problem for most of the protein domain ranking methods. Results To tackle this problem, we have developed the Multiple Graph regularized Ranking algorithm, MultiG-Rank. Instead of using a single graph to regularize the ranking scores, MultiG-Rank approximates the intrinsic manifold of protein domain distribution by combining multiple initial graphs for the regularization. Graph weights are learned with ranking scores jointly and automatically, by alternately minimizing an objective function in an iterative algorithm. Experimental results on a subset of the ASTRAL SCOP protein domain database demonstrate that MultiG-Rank achieves a better ranking performance than single graph regularized ranking methods and pairwise similarity based ranking methods. Conclusion The problem of graph model and parameter selection in graph regularized protein domain ranking can be solved effectively by combining multiple graphs. This aspect of generalization introduces a new frontier in applying multiple graphs to solving protein domain ranking applications. PMID:23157331

Diabetes Interactive Atlas

PubMed Central

Burrows, Nilka R.; Geiss, Linda S.

2014-01-01

The Diabetes Interactive Atlas is a recently released Web-based collection of maps that allows users to view geographic patterns and examine trends in diabetes and its risk factors over time across the United States and within states. The atlas provides maps, tables, graphs, and motion charts that depict national, state, and county data. Large amounts of data can be viewed in various ways simultaneously. In this article, we describe the design and technical issues for developing the atlas and provide an overview of the atlas’ maps and graphs. The Diabetes Interactive Atlas improves visualization of geographic patterns, highlights observation of trends, and demonstrates the concomitant geographic and temporal growth of diabetes and obesity. PMID:24503340

Validation of life-charts documented with the personal life-chart app - a self-monitoring tool for bipolar disorder.

PubMed

Schärer, Lars O; Krienke, Ute J; Graf, Sandra-Mareike; Meltzer, Katharina; Langosch, Jens M

2015-03-14

Long-term monitoring in bipolar affective disorders constitutes an important therapeutic and preventive method. The present study examines the validity of the Personal Life-Chart App (PLC App), in both German and in English. This App is based on the National Institute of Mental Health's Life-Chart Method, the de facto standard for long-term monitoring in the treatment of bipolar disorders. Methods have largely been replicated from 2 previous Life-Chart studies. The participants documented Life-Charts with the PLC App on a daily basis. Clinicians assessed manic and depressive symptoms in clinical interviews using the Inventory of Depressive Symptomatology, clinician-rated (IDS-C) and the Young Mania Rating Scale (YMRS) on a monthly basis on average. Spearman correlations of the total scores of IDS-C and YMRS were calculated with both the Life-Chart functional impairment rating and mood rating documented with the PLC App. 44 subjects used the PLC App in German and 10 subjects used the PLC App in English. 118 clinical interviews from the German sub-sample and 97 from the English sub-sample were analysed separately. The results in both sub-samples are similar to previous Life-Chart validation studies. Again statistically significant high correlations were found between the Life-Chart function rating assigned through the PLC App and well-established observer-rated methods. Again correlations were weaker for the Life-Chart mood rating than for the Life-Chart function impairment. No relevant correlation was found between the Life-chart mood rating and YMRS in the German sub-sample. This study gives further evidence for the validity of the Life-Chart method as a valid tool for the recognition of both manic and depressive episodes. Documenting Life-Charts with the PLC App (English and German) does not seem to impair the validity of patient ratings.

PylotDB - A Database Management, Graphing, and Analysis Tool Written in Python

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

Barnette, Daniel W.

2012-01-04

PylotDB, written completely in Python, provides a user interface (UI) with which to interact with, analyze, graph data from, and manage open source databases such as MySQL. The UI mitigates the user having to know in-depth knowledge of the database application programming interface (API). PylotDB allows the user to generate various kinds of plots from user-selected data; generate statistical information on text as well as numerical fields; backup and restore databases; compare database tables across different databases as well as across different servers; extract information from any field to create new fields; generate, edit, and delete databases, tables, and fields;more » generate or read into a table CSV data; and similar operations. Since much of the database information is brought under control of the Python computer language, PylotDB is not intended for huge databases for which MySQL and Oracle, for example, are better suited. PylotDB is better suited for smaller databases that might be typically needed in a small research group situation. PylotDB can also be used as a learning tool for database applications in general.« less

Flowcharting with D-charts

NASA Technical Reports Server (NTRS)

Meyer, D.

1985-01-01

A D-Chart is a style of flowchart using control symbols highly appropriate to modern structured programming languages. The intent of a D-Chart is to provide a clear and concise one-for-one mapping of control symbols to high-level language constructs for purposes of design and documentation. The notation lends itself to both high-level and code-level algorithmic description. The various issues that may arise when representing, in D-Chart style, algorithms expressed in the more popular high-level languages are addressed. In particular, the peculiarities of mapping control constructs for Ada, PASCAL, FORTRAN 77, C, PL/I, Jovial J73, HAL/S, and Algol are discussed.

Flowcharting with D-charts

NASA Technical Reports Server (NTRS)

Meyer, D. D.

1985-01-01

A D-Chart is a style of flowchart using control symbols highly appropriate to modern structured programming languages. The intent of a D-Chart is to provide a clear and concise one-for-one mapping of control symbols to high-level language constructs for purposes of design and documentation. The notation lends itself to both high-level and code-level algorithmic description. The various issues that may arise when representing, in D-Chart style, algorithms expressed in the more popular high-level languages are addressed. In particular, the peculiarities of mapping control constructs for Ada, PASCAL, FORTRAN 77, C, PL/I, Joviai J73, HAL/S, and Algol are discussed.

Characterizing Containment and Related Classes of Graphs,

DTIC Science & Technology

1985-01-01

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

A Collection of Features for Semantic Graphs

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

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

2007-05-02

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

JavaGenes: Evolving Graphs with Crossover

NASA Technical Reports Server (NTRS)

Globus, Al; Atsatt, Sean; Lawton, John; Wipke, Todd

2000-01-01

Genetic algorithms usually use string or tree representations. We have developed a novel crossover operator for a directed and undirected graph representation, and used this operator to evolve molecules and circuits. Unlike strings or trees, a single point in the representation cannot divide every possible graph into two parts, because graphs may contain cycles. Thus, the crossover operator is non-trivial. A steady-state, tournament selection genetic algorithm code (JavaGenes) was written to implement and test the graph crossover operator. All runs were executed by cycle-scavagging on networked workstations using the Condor batch processing system. The JavaGenes code has evolved pharmaceutical drug molecules and simple digital circuits. Results to date suggest that JavaGenes can evolve moderate sized drug molecules and very small circuits in reasonable time. The algorithm has greater difficulty with somewhat larger circuits, suggesting that directed graphs (circuits) are more difficult to evolve than undirected graphs (molecules), although necessary differences in the crossover operator may also explain the results. In principle, JavaGenes should be able to evolve other graph-representable systems, such as transportation networks, metabolic pathways, and computer networks. However, large graphs evolve significantly slower than smaller graphs, presumably because the space-of-all-graphs explodes combinatorially with graph size. Since the representation strongly affects genetic algorithm performance, adding graphs to the evolutionary programmer's bag-of-tricks should be beneficial. Also, since graph evolution operates directly on the phenotype, the genotype-phenotype translation step, common in genetic algorithm work, is eliminated.

Stationary waves on nonlinear quantum graphs. II. Application of canonical perturbation theory in basic graph structures.

PubMed

Gnutzmann, Sven; Waltner, Daniel

2016-12-01

We consider exact and asymptotic solutions of the stationary cubic nonlinear Schrödinger equation on metric graphs. We focus on some basic example graphs. The asymptotic solutions are obtained using the canonical perturbation formalism developed in our earlier paper [S. Gnutzmann and D. Waltner, Phys. Rev. E 93, 032204 (2016)2470-004510.1103/PhysRevE.93.032204]. For closed example graphs (interval, ring, star graph, tadpole graph), we calculate spectral curves and show how the description of spectra reduces to known characteristic functions of linear quantum graphs in the low-intensity limit. Analogously for open examples, we show how nonlinear scattering of stationary waves arises and how it reduces to known linear scattering amplitudes at low intensities. In the short-wavelength asymptotics we discuss how genuine nonlinear effects may be described using the leading order of canonical perturbation theory: bifurcation of spectral curves (and the corresponding solutions) in closed graphs and multistability in open graphs.

Fifth through Eighth Grade Students' Difficulties in Constructing Bar Graphs: Data Organization, Data Aggregation, and Integration of a Second Variable

ERIC Educational Resources Information Center

Garcia-Mila, Merce; Marti, Eduard; Gilabert, Sandra; Castells, Marina

2014-01-01

Studies that consider the displays that students create to organize data are not common in the literature. This article compares fifth through eighth graders' difficulties with the creation of bar graphs using either raw data (Study 1, n = 155) or a provided table (Study 2, n = 152). Data in Study 1 showed statistical differences for the type of…

Molecular graph convolutions: moving beyond fingerprints.

PubMed

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-08-01

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph-atoms, bonds, distances, etc.-which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.

Information visualisation based on graph models

NASA Astrophysics Data System (ADS)

Kasyanov, V. N.; Kasyanova, E. V.

2013-05-01

Information visualisation is a key component of support tools for many applications in science and engineering. A graph is an abstract structure that is widely used to model information for its visualisation. In this paper, we consider practical and general graph formalism called hierarchical graphs and present the Higres and Visual Graph systems aimed at supporting information visualisation on the base of hierarchical graph models.

Network reconstruction via graph blending

NASA Astrophysics Data System (ADS)

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.

Graph Kernels for Molecular Similarity.

PubMed

Rupp, Matthias; Schneider, Gisbert

2010-04-12

Molecular similarity measures are important for many cheminformatics applications like ligand-based virtual screening and quantitative structure-property relationships. Graph kernels are formal similarity measures defined directly on graphs, such as the (annotated) molecular structure graph. Graph kernels are positive semi-definite functions, i.e., they correspond to inner products. This property makes them suitable for use with kernel-based machine learning algorithms such as support vector machines and Gaussian processes. We review the major types of kernels between graphs (based on random walks, subgraphs, and optimal assignments, respectively), and discuss their advantages, limitations, and successful applications in cheminformatics. Copyright © 2010 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Groupies in multitype random graphs.

PubMed

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.

Software tool for physics chart checks.

PubMed

Li, H Harold; Wu, Yu; Yang, Deshan; Mutic, Sasa

2014-01-01

Physics chart check has long been a central quality assurance (QC) measure in radiation oncology. The purpose of this work is to describe a software tool that aims to accomplish simplification, standardization, automation, and forced functions in the process. Nationally recognized guidelines, including American College of Radiology and American Society for Radiation Oncology guidelines and technical standards, and the American Association of Physicists in Medicine Task Group reports were identified, studied, and summarized. Meanwhile, the reported events related to physics chart check service were analyzed using an event reporting and learning system. A number of shortfalls in the chart check process were identified. To address these problems, a software tool was designed and developed under Microsoft. Net in C# to hardwire as many components as possible at each stage of the process. The software consists of the following 4 independent modules: (1) chart check management; (2) pretreatment and during treatment chart check assistant; (3) posttreatment chart check assistant; and (4) quarterly peer-review management. The users were a large group of physicists in the author's radiation oncology clinic. During over 1 year of use the tool has proven very helpful in chart checking management, communication, documentation, and maintaining consistency. The software tool presented in this work aims to assist physicists at each stage of the physics chart check process. The software tool is potentially useful for any radiation oncology clinics that are either in the process of pursuing or maintaining the American College of Radiology accreditation.

Graph mining for next generation sequencing: leveraging the assembly graph for biological insights.

PubMed

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

The assembly of Next Generation Sequencing (NGS) reads remains a challenging task. This is especially true for the assembly of metagenomics data that originate from environmental samples potentially containing hundreds to thousands of unique species. The principle objective of current assembly tools is to assemble NGS reads into contiguous stretches of sequence called contigs while maximizing for both accuracy and contig length. The end goal of this process is to produce longer contigs with the major focus being on assembly only. Sequence read assembly is an aggregative process, during which read overlap relationship information is lost as reads are merged into longer sequences or contigs. The assembly graph is information rich and capable of capturing the genomic architecture of an input read data set. We have developed a novel hybrid graph in which nodes represent sequence regions at different levels of granularity. This model, utilized in the assembly and analysis pipeline Focus, presents a concise yet feature rich view of a given input data set, allowing for the extraction of biologically relevant graph structures for graph mining purposes. Focus was used to create hybrid graphs to model metagenomics data sets obtained from the gut microbiomes of five individuals with Crohn's disease and eight healthy individuals. Repetitive and mobile genetic elements are found to be associated with hybrid graph structure. Using graph mining techniques, a comparative study of the Crohn's disease and healthy data sets was conducted with focus on antibiotics resistance genes associated with transposase genes. Results demonstrated significant differences in the phylogenetic distribution of categories of antibiotics resistance genes in the healthy and diseased patients. Focus was also evaluated as a pure assembly tool and produced excellent results when compared against the Meta-velvet, Omega, and UD-IDBA assemblers. Mining the hybrid graph can reveal biological phenomena captured

A Novel Graph Constructor for Semisupervised Discriminant Analysis: Combined Low-Rank and k-Nearest Neighbor Graph

PubMed Central

Pan, Yongke; Niu, Wenjia

2017-01-01

Semisupervised Discriminant Analysis (SDA) is a semisupervised dimensionality reduction algorithm, which can easily resolve the out-of-sample problem. Relative works usually focus on the geometric relationships of data points, which are not obvious, to enhance the performance of SDA. Different from these relative works, the regularized graph construction is researched here, which is important in the graph-based semisupervised learning methods. In this paper, we propose a novel graph for Semisupervised Discriminant Analysis, which is called combined low-rank and k-nearest neighbor (LRKNN) graph. In our LRKNN graph, we map the data to the LR feature space and then the kNN is adopted to satisfy the algorithmic requirements of SDA. Since the low-rank representation can capture the global structure and the k-nearest neighbor algorithm can maximally preserve the local geometrical structure of the data, the LRKNN graph can significantly improve the performance of SDA. Extensive experiments on several real-world databases show that the proposed LRKNN graph is an efficient graph constructor, which can largely outperform other commonly used baselines. PMID:28316616

The table of isotopes-8th edition and beyond

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

Firestone, R.B.

A new edition of the Table of Isotopes has been published this year by John Wiley and Sons, Inc. This edition is the eighth in a series started by Glenn T. Seaborg in 1940. The two-volume, 3168-page, cloth-bound edition is twice the size of the previous edition published in 1978. It contains nuclear structure and decay data, based mainly on the Evaluated Nuclear Structure Data File (ENSDF), for >3100 isotopes and isomers. Approximately 24000 references are cited, and the appendices have been updated and extended. The book is packaged with an interactive CD-ROM that contains the Table of Isotopes inmore » Adobe Acrobat Portable Document Format for convenient viewing on personal computer (PC) and UNIX workstations. The CD-ROM version contains a chart of the nuclides graphical index and separate indices organized for radioisotope users and nuclear structure physicists. More than 100000 hypertext links are provided to move the user quickly through related information free from the limitations of page size. Complete references with keyword abstracts are provided. The CD-ROM also contains the Table of Super-deformed Nuclear Bands and Fission Isomers; Tables of Atoms, Atomic Nuclei, and Subatomic Particles by Ivan P. Selinov; the ENSDF and nuclear structure reference (NSR) databases; the ENSDF manual by Jagdish K. Tuli; and Abode Acrobat Reader software.« less

TrajGraph: A Graph-Based Visual Analytics Approach to Studying Urban Network Centralities Using Taxi Trajectory Data.

PubMed

Huang, Xiaoke; Zhao, Ye; Yang, Jing; Zhang, Chong; Ma, Chao; Ye, Xinyue

2016-01-01

We propose TrajGraph, a new visual analytics method, for studying urban mobility patterns by integrating graph modeling and visual analysis with taxi trajectory data. A special graph is created to store and manifest real traffic information recorded by taxi trajectories over city streets. It conveys urban transportation dynamics which can be discovered by applying graph analysis algorithms. To support interactive, multiscale visual analytics, a graph partitioning algorithm is applied to create region-level graphs which have smaller size than the original street-level graph. Graph centralities, including Pagerank and betweenness, are computed to characterize the time-varying importance of different urban regions. The centralities are visualized by three coordinated views including a node-link graph view, a map view and a temporal information view. Users can interactively examine the importance of streets to discover and assess city traffic patterns. We have implemented a fully working prototype of this approach and evaluated it using massive taxi trajectories of Shenzhen, China. TrajGraph's capability in revealing the importance of city streets was evaluated by comparing the calculated centralities with the subjective evaluations from a group of drivers in Shenzhen. Feedback from a domain expert was collected. The effectiveness of the visual interface was evaluated through a formal user study. We also present several examples and a case study to demonstrate the usefulness of TrajGraph in urban transportation analysis.

Temporal Representation in Semantic Graphs

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

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.

Enhanced Cumulative Sum Charts for Monitoring Process Dispersion

PubMed Central

Abujiya, Mu’azu Ramat; Riaz, Muhammad; Lee, Muhammad Hisyam

2015-01-01

The cumulative sum (CUSUM) control chart is widely used in industry for the detection of small and moderate shifts in process location and dispersion. For efficient monitoring of process variability, we present several CUSUM control charts for monitoring changes in standard deviation of a normal process. The newly developed control charts based on well-structured sampling techniques - extreme ranked set sampling, extreme double ranked set sampling and double extreme ranked set sampling, have significantly enhanced CUSUM chart ability to detect a wide range of shifts in process variability. The relative performances of the proposed CUSUM scale charts are evaluated in terms of the average run length (ARL) and standard deviation of run length, for point shift in variability. Moreover, for overall performance, we implore the use of the average ratio ARL and average extra quadratic loss. A comparison of the proposed CUSUM control charts with the classical CUSUM R chart, the classical CUSUM S chart, the fast initial response (FIR) CUSUM R chart, the FIR CUSUM S chart, the ranked set sampling (RSS) based CUSUM R chart and the RSS based CUSUM S chart, among others, are presented. An illustrative example using real dataset is given to demonstrate the practicability of the application of the proposed schemes. PMID:25901356

Integer Flows and Circuit Covers of Graphs and Signed Graphs

NASA Astrophysics Data System (ADS)

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

Topologies on directed graphs

NASA Technical Reports Server (NTRS)

Lieberman, R. N.

1972-01-01

Given a directed graph, a natural topology is defined and relationships between standard topological properties and graph theoretical concepts are studied. In particular, the properties of connectivity and separatedness are investigated. A metric is introduced which is shown to be related to separatedness. The topological notions of continuity and homeomorphism. A class of maps is studied which preserve both graph and topological properties. Applications involving strong maps and contractions are also presented.

7 CFR 51.2946 - Color chart.

Code of Federal Regulations, 2012 CFR

2012-01-01

... illustrates four shades of color used to describe skin color of walnut kernels. (a) Availability of color... 7 Agriculture 2 2012-01-01 2012-01-01 false Color chart. 51.2946 Section 51.2946 Agriculture... Standards for Grades of Walnuts in the Shell General § 51.2946 Color chart. The color chart (USDA Walnut...

7 CFR 51.2946 - Color chart.

Code of Federal Regulations, 2011 CFR

2011-01-01

... illustrates four shades of color used to describe skin color of walnut kernels. (a) Availability of color... 7 Agriculture 2 2011-01-01 2011-01-01 false Color chart. 51.2946 Section 51.2946 Agriculture... Standards for Grades of Walnuts in the Shell General § 51.2946 Color chart. The color chart (USDA Walnut...

Quantum walk on a chimera graph

NASA Astrophysics Data System (ADS)

Xu, Shu; Sun, Xiangxiang; Wu, Jizhou; Zhang, Wei-Wei; Arshed, Nigum; Sanders, Barry C.

2018-05-01

We analyse a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum walk features such as localization that starkly distinguishes classical from quantum behaviour. Motivated by technological thrusts, we study continuous-time quantum walk on enhanced variants of the chimera graph and on diminished chimera graph with a random removal of vertices. We explain the quantum walk by constructing a generating set for a suitable subgroup of graph isomorphisms and corresponding symmetry operators that commute with the quantum walk Hamiltonian; the Hamiltonian and these symmetry operators provide a complete set of labels for the spectrum and the stationary states. Our quantum walk characterization of the chimera graph and its variants yields valuable insights into graphs used for designing quantum-annealers.

Graph-Based Object Class Discovery

NASA Astrophysics Data System (ADS)

Xia, Shengping; Hancock, Edwin R.

We are interested in the problem of discovering the set of object classes present in a database of images using a weakly supervised graph-based framework. Rather than making use of the ”Bag-of-Features (BoF)” approach widely used in current work on object recognition, we represent each image by a graph using a group of selected local invariant features. Using local feature matching and iterative Procrustes alignment, we perform graph matching and compute a similarity measure. Borrowing the idea of query expansion , we develop a similarity propagation based graph clustering (SPGC) method. Using this method class specific clusters of the graphs can be obtained. Such a cluster can be generally represented by using a higher level graph model whose vertices are the clustered graphs, and the edge weights are determined by the pairwise similarity measure. Experiments are performed on a dataset, in which the number of images increases from 1 to 50K and the number of objects increases from 1 to over 500. Some objects have been discovered with total recall and a precision 1 in a single cluster.

What Would a Graph Look Like in this Layout? A Machine Learning Approach to Large Graph Visualization.

PubMed

Kwon, Oh-Hyun; Crnovrsanin, Tarik; Ma, Kwan-Liu

2018-01-01

Using different methods for laying out a graph can lead to very different visual appearances, with which the viewer perceives different information. Selecting a "good" layout method is thus important for visualizing a graph. The selection can be highly subjective and dependent on the given task. A common approach to selecting a good layout is to use aesthetic criteria and visual inspection. However, fully calculating various layouts and their associated aesthetic metrics is computationally expensive. In this paper, we present a machine learning approach to large graph visualization based on computing the topological similarity of graphs using graph kernels. For a given graph, our approach can show what the graph would look like in different layouts and estimate their corresponding aesthetic metrics. An important contribution of our work is the development of a new framework to design graph kernels. Our experimental study shows that our estimation calculation is considerably faster than computing the actual layouts and their aesthetic metrics. Also, our graph kernels outperform the state-of-the-art ones in both time and accuracy. In addition, we conducted a user study to demonstrate that the topological similarity computed with our graph kernel matches perceptual similarity assessed by human users.

Claw-Free Maximal Planar Graphs

DTIC Science & Technology

1989-01-01

1976, 212-223. 110] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. 1111 , A theorem on matchings in the plane, Graph Theory...in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. 1121 N. Sbihi, Algorithme de recherche d’un stable de...cardinalitA maximum dans un graphe sans 6toile, Discrete Math . 29, 1980, 53-76. 1131 D. Sumner, On Tutte’s factorization theorem, Graphs and Combinatorics

Construction and validation of a Tamil logMAR chart.

PubMed

Varadharajan, Srinivasa; Srinivasan, Krithica; Kumaresan, Brindha

2009-09-01

To design, construct and validate a new Tamil logMAR visual acuity chart based on current recommendations. Ten Tamil letters of equal legibility were identified experimentally and were used in the chart. Two charts, one internally illuminated and one externally illuminated, were constructed for testing at 4 m distance. The repeatability of the two charts was tested. For validation, the two charts were compared with a standard English logMAR chart (ETDRS). When compared to the ETDRS chart, a difference of 0.06 +/- 0.07 and 0.07 +/- 0.07 logMAR was found for the internally and externally illuminated charts respectively. Limits of agreement between the internally illuminated Tamil logMAR chart and ETDRS chart were found to be (-0.08, 0.19), and (-0.07, 0.20) for the externally illuminated chart. The test - retest results showed a difference of 0.02 +/- 0.04 and 0.02 +/- 0.06 logMAR for the internally and externally illuminated charts respectively. Limits of agreement for repeated measurements for the internally illuminated Tamil logMAR chart were found to be (-0.06, 0.10), and (-0.10, 0.14) for the externally illuminated chart. The newly constructed Tamil logMAR charts have good repeatability. The difference in visual acuity scores between the newly constructed Tamil logMAR chart and the standard English logMAR chart was within acceptable limits. This new chart can be used for measuring visual acuity in the literate Tamil population.

Economics and terminal area environmental impact of STOL transportation

NASA Technical Reports Server (NTRS)

Stewart, E. C.

1973-01-01

The impact of short takeoff and landing aircraft in meeting the needs of short haul transportation systems is analyzed. The objectives of the short haul system are evaluated on the basis of the following criteria: (1) service to the passenger, (2) economic viability, and (3) terminal area environment conditions caused by community noise, ground and air decongestion, and air pollution. Data are presented in the forms of tables, charts, and graphs. An itemization of the conclusions reached after the preliminary investigation is included.

Generalized graph states based on Hadamard matrices

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

Cui, Shawn X.; Yu, Nengkun; Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario N1G 2W1

2015-07-15

Graph states are widely used in quantum information theory, including entanglement theory, quantum error correction, and one-way quantum computing. Graph states have a nice structure related to a certain graph, which is given by either a stabilizer group or an encoding circuit, both can be directly given by the graph. To generalize graph states, whose stabilizer groups are abelian subgroups of the Pauli group, one approach taken is to study non-abelian stabilizers. In this work, we propose to generalize graph states based on the encoding circuit, which is completely determined by the graph and a Hadamard matrix. We study themore » entanglement structures of these generalized graph states and show that they are all maximally mixed locally. We also explore the relationship between the equivalence of Hadamard matrices and local equivalence of the corresponding generalized graph states. This leads to a natural generalization of the Pauli (X, Z) pairs, which characterizes the local symmetries of these generalized graph states. Our approach is also naturally generalized to construct graph quantum codes which are beyond stabilizer codes.« less

Tool for reading psychrometric charts

NASA Technical Reports Server (NTRS)

De Angelo, F. T.

1969-01-01

Three-legged, clear plastic tool is designed so that the angles of each leg correspond with the angles of psychometric chart construction for each of the three required scales. The appropriate edges are tapered to the chart surface.

Psychrometric chart for physiological research

NASA Technical Reports Server (NTRS)

Chambers, A. B.

1971-01-01

Chart facilitates use of graphical techniques for solving problems involving thermodynamic properties of moist air. The properties are presented, and their units of measurement are listed. Chart presenting conditions at standard atmosphere pressure at sea level is most useful.

Exploring Graphs: WYSIWYG.

ERIC Educational Resources Information Center

Johnson, Millie

1997-01-01

Graphs from media sources and questions developed from them can be used in the middle school mathematics classroom. Graphs depict storage temperature on a milk carton; air pressure measurements on a package of shock absorbers; sleep-wake patterns of an infant; a dog's breathing patterns; and the angle, velocity, and radius of a leaning bicyclist…

Molecular graph convolutions: moving beyond fingerprints

NASA Astrophysics Data System (ADS)

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-08-01

Molecular "fingerprints" encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph—atoms, bonds, distances, etc.—which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement.

Graph edit distance from spectral seriation.

PubMed

Robles-Kelly, Antonio; Hancock, Edwin R

2005-03-01

This paper is concerned with computing graph edit distance. One of the criticisms that can be leveled at existing methods for computing graph edit distance is that they lack some of the formality and rigor of the computation of string edit distance. Hence, our aim is to convert graphs to string sequences so that string matching techniques can be used. To do this, we use a graph spectral seriation method to convert the adjacency matrix into a string or sequence order. We show how the serial ordering can be established using the leading eigenvector of the graph adjacency matrix. We pose the problem of graph-matching as a maximum a posteriori probability (MAP) alignment of the seriation sequences for pairs of graphs. This treatment leads to an expression in which the edit cost is the negative logarithm of the a posteriori sequence alignment probability. We compute the edit distance by finding the sequence of string edit operations which minimizes the cost of the path traversing the edit lattice. The edit costs are determined by the components of the leading eigenvectors of the adjacency matrix and by the edge densities of the graphs being matched. We demonstrate the utility of the edit distance on a number of graph clustering problems.

Mining and Indexing Graph Databases

ERIC Educational Resources Information Center

Yuan, Dayu

2013-01-01

Graphs are widely used to model structures and relationships of objects in various scientific and commercial fields. Chemical molecules, proteins, malware system-call dependencies and three-dimensional mechanical parts are all modeled as graphs. In this dissertation, we propose to mine and index those graph data to enable fast and scalable search.…

Path similarity skeleton graph matching.

PubMed

Bai, Xiang; Latecki, Longin Jan

2008-07-01

This paper presents a novel framework to for shape recognition based on object silhouettes. The main idea is to match skeleton graphs by comparing the shortest paths between skeleton endpoints. In contrast to typical tree or graph matching methods, we completely ignore the topological graph structure. Our approach is motivated by the fact that visually similar skeleton graphs may have completely different topological structures. The proposed comparison of shortest paths between endpoints of skeleton graphs yields correct matching results in such cases. The skeletons are pruned by contour partitioning with Discrete Curve Evolution, which implies that the endpoints of skeleton branches correspond to visual parts of the objects. The experimental results demonstrate that our method is able to produce correct results in the presence of articulations, stretching, and occlusion.

Enabling Graph Appliance for Genome Assembly

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

Singh, Rina; Graves, Jeffrey A; Lee, Sangkeun

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 storemore » 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.« less

Proving relations between modular graph functions

NASA Astrophysics Data System (ADS)

Basu, Anirban

2016-12-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.

Local adjacency metric dimension of sun graph and stacked book graph

NASA Astrophysics Data System (ADS)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

A graph is a mathematical system consisting of a non-empty set of nodes and a set of empty sides. One of the topics to be studied in graph theory is the metric dimension. Application in the metric dimension is the navigation robot system on a path. Robot moves from one vertex to another vertex in the field by minimizing the errors that occur in translating the instructions (code) obtained from the vertices of that location. To move the robot must give different instructions (code). In order for the robot to move efficiently, the robot must be fast to translate the code of the nodes of the location it passes. so that the location vertex has a minimum distance. However, if the robot must move with the vertex location on a very large field, so the robot can not detect because the distance is too far.[6] In this case, the robot can determine its position by utilizing location vertices based on adjacency. The problem is to find the minimum cardinality of the required location vertex, and where to put, so that the robot can determine its location. The solution to this problem is the dimension of adjacency metric and adjacency metric bases. Rodrguez-Velzquez and Fernau combine the adjacency metric dimensions with local metric dimensions, thus becoming the local adjacency metric dimension. In the local adjacency metric dimension each vertex in the graph may have the same adjacency representation as the terms of the vertices. To obtain the local metric dimension of values in the graph of the Sun and the stacked book graph is used the construction method by considering the representation of each adjacent vertex of the graph.

On Effective Graphic Communication of Health Inequality: Considerations for Health Policy Researchers.

PubMed

Asada, Yukiko; Abel, Hannah; Skedgel, Chris; Warner, Grace

2017-12-01

Policy Points: Effective graphs can be a powerful tool in communicating health inequality. The choice of graphs is often based on preferences and familiarity rather than science. According to the literature on graph perception, effective graphs allow human brains to decode visual cues easily. Dot charts are easier to decode than bar charts, and thus they are more effective. Dot charts are a flexible and versatile way to display information about health inequality. Consistent with the health risk communication literature, the captions accompanying health inequality graphs should provide a numerical, explicitly calculated description of health inequality, expressed in absolute and relative terms, from carefully thought-out perspectives. Graphs are an essential tool for communicating health inequality, a key health policy concern. The choice of graphs is often driven by personal preferences and familiarity. Our article is aimed at health policy researchers developing health inequality graphs for policy and scientific audiences and seeks to (1) raise awareness of the effective use of graphs in communicating health inequality; (2) advocate for a particular type of graph (ie, dot charts) to depict health inequality; and (3) suggest key considerations for the captions accompanying health inequality graphs. Using composite review methods, we selected the prevailing recommendations for improving graphs in scientific reporting. To find the origins of these recommendations, we reviewed the literature on graph perception and then applied what we learned to the context of health inequality. In addition, drawing from the numeracy literature in health risk communication, we examined numeric and verbal formats to explain health inequality graphs. Many disciplines offer commonsense recommendations for visually presenting quantitative data. The literature on graph perception, which defines effective graphs as those allowing the easy decoding of visual cues in human brains, shows

A Note on Hamiltonian Graphs

ERIC Educational Resources Information Center

Skurnick, Ronald; Davi, Charles; Skurnick, Mia

2005-01-01

Since 1952, several well-known graph theorists have proven numerous results regarding Hamiltonian graphs. In fact, many elementary graph theory textbooks contain the theorems of Ore, Bondy and Chvatal, Chvatal and Erdos, Posa, and Dirac, to name a few. In this note, the authors state and prove some propositions of their own concerning Hamiltonian…

Molecular graph convolutions: moving beyond fingerprints

PubMed Central

Kearnes, Steven; McCloskey, Kevin; Berndl, Marc; Pande, Vijay; Riley, Patrick

2016-01-01

Molecular “fingerprints” encoding structural information are the workhorse of cheminformatics and machine learning in drug discovery applications. However, fingerprint representations necessarily emphasize particular aspects of the molecular structure while ignoring others, rather than allowing the model to make data-driven decisions. We describe molecular graph convolutions, a machine learning architecture for learning from undirected graphs, specifically small molecules. Graph convolutions use a simple encoding of the molecular graph—atoms, bonds, distances, etc.—which allows the model to take greater advantage of information in the graph structure. Although graph convolutions do not outperform all fingerprint-based methods, they (along with other graph-based methods) represent a new paradigm in ligand-based virtual screening with exciting opportunities for future improvement. PMID:27558503

SING: Subgraph search In Non-homogeneous Graphs

PubMed Central

2010-01-01

Background Finding the subgraphs of a graph database that are isomorphic to a given query graph has practical applications in several fields, from cheminformatics to image understanding. Since subgraph isomorphism is a computationally hard problem, indexing techniques have been intensively exploited to speed up the process. Such systems filter out those graphs which cannot contain the query, and apply a subgraph isomorphism algorithm to each residual candidate graph. The applicability of such systems is limited to databases of small graphs, because their filtering power degrades on large graphs. Results In this paper, SING (Subgraph search In Non-homogeneous Graphs), a novel indexing system able to cope with large graphs, is presented. The method uses the notion of feature, which can be a small subgraph, subtree or path. Each graph in the database is annotated with the set of all its features. The key point is to make use of feature locality information. This idea is used to both improve the filtering performance and speed up the subgraph isomorphism task. Conclusions Extensive tests on chemical compounds, biological networks and synthetic graphs show that the proposed system outperforms the most popular systems in query time over databases of medium and large graphs. Other specific tests show that the proposed system is effective for single large graphs. PMID:20170516

Recursive Feature Extraction in Graphs

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

2014-08-14

ReFeX extracts recursive topological features from graph data. The input is a graph as a csv file and the output is a csv file containing feature values for each node in the graph. The features are based on topological counts in the neighborhoods of each nodes, as well as recursive summaries of neighbors' features.

Output-Sensitive Construction of Reeb Graphs.

PubMed

Doraiswamy, H; Natarajan, V

2012-01-01

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

Multigraph: Reusable Interactive Data Graphs

NASA Astrophysics Data System (ADS)

Phillips, M. B.

2010-12-01

There are surprisingly few good software tools available for presenting time series data on the internet. The most common practice is to use a desktop program such as Excel or Matlab to save a graph as an image which can be included in a web page like any other image. This disconnects the graph from the data in a way that makes updating a graph with new data a cumbersome manual process, and it limits the user to one particular view of the data. The Multigraph project defines an XML format for describing interactive data graphs, and software tools for creating and rendering those graphs in web pages and other internet connected applications. Viewing a Multigraph graph is extremely simple and intuitive, and requires no instructions; the user can pan and zoom by clicking and dragging, in a familiar "Google Maps" kind of way. Creating a new graph for inclusion in a web page involves writing a simple XML configuration file. Multigraph can read data in a variety of formats, and can display data from a web service, allowing users to "surf" through large data sets, downloading only those the parts of the data that are needed for display. The Multigraph XML format, or "MUGL" for short, provides a concise description of the visual properties of a graph, such as axes, plot styles, data sources, labels, etc, as well as interactivity properties such as how and whether the user can pan or zoom along each axis. Multigraph reads a file in this format, draws the described graph, and allows the user to interact with it. Multigraph software currently includes a Flash application for embedding graphs in web pages, a Flex component for embedding graphs in larger Flex/Flash applications, and a plugin for creating graphs in the WordPress content management system. Plans for the future include a Java version for desktop viewing and editing, a command line version for batch and server side rendering, and possibly Android and iPhone versions. Multigraph is currently in use on several web

The One Universal Graph — a free and open graph database

NASA Astrophysics Data System (ADS)

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.

The Conjugate Acid-Base Chart.

ERIC Educational Resources Information Center

Treptow, Richard S.

1986-01-01

Discusses the difficulties that beginning chemistry students have in understanding acid-base chemistry. Describes the use of conjugate acid-base charts in helping students visualize the conjugate relationship. Addresses chart construction, metal ions, buffers and pH titrations, and the organic functional groups and nonaqueous solvents. (TW)

Comparison of the Handy Eye Chart and the Lea Symbols Chart in a population of deaf children aged 7–18 years

PubMed Central

Gorham, John Paul; Bruce, Beau B.; Hutchinson, Amy K.

2016-01-01

Purpose To compare the results of visual acuity testing in a population of deaf children using the Handy Eye Chart versus the Lea Symbols Chart and to compare testability and preference between charts. Methods A total of 24 participants were recruited at the Atlanta Area School for the Deaf. Visual Acuity was evaluated using the Handy Eye Chart and the Lea Symbols Chart. Patient preference and duration of testing were measured. Results The mean difference between the visual acuity as measured by each chart was –0.02 logMAR (95% CI, −0.06 to 0.03). Testing with the Handy Eye Chart was an average of 13.79 seconds faster than testing with the Lea Symbols Chart (95% CI, 1.1–26.47; P = 0.03). Of the 24 participants, 17 (71%) preferred the Handy Eye Chart (95% CI: 49%–87%; P = 0.07). Conclusions The Handy Eye Chart is a fast, valid, and preferred tool for measuring visual acuity in deaf children age 7–18 years. Additional research is needed to evaluate the utility of the Handy Eye Chart in younger children and deaf adults. PMID:27164427

Enhancing learning using questions, adjunct to science charts

NASA Astrophysics Data System (ADS)

Holliday, William G.; Benson, Garth

This study supported two hypotheses. First, adjunct questions interacted with a science chart so powerfully that content established as difficult to learn in the pilot and in this study's control groups became easier to learn when charted. Second, students familiar with the chart test before instruction (test exposure) were better prepared to take this test after instruction. This adjunct-question study examined the generalizability of selective-attention and academic-studying hypotheses to a modified science chart medium. About 300 high school students were randomly assigned to four conditions each including a vitamin chart (chart only, test exposure, importance of questions emphasized to students by teachers, and combinational conditions - test exposure and question importance) across 16 biology classrooms. Then these same students were again randomly assigned within each classroom to a control and to four question treatments no questions, questions focusing on easy-to-learn charted content, questions focusing on difficult-to-learn charted content, and a combinational treatment.

Enhancing learning using questions adjunct to science charts

NASA Astrophysics Data System (ADS)

Holliday, William G.; Benson, Garth

This study supported two hypotheses. First, adjunct questions interacted with a science chart so powerfully that content established as difficult to learn in the pilot and in this study's control groups became easier to learn when charted. Second, students familiar with the chart test before instruction (test exposure) were better prepared to take this test after instruction. This adjunct-question study examined the generalizability of selective-attention and academic-studying hypotheses to a modified science chart medium. About 300 high school students were randomly assigned to four conditions each including a vitamin chart (chart only, test exposure, importance of questions emphasized to students by teachers, and combinational conditions--test exposure and question importance) across 16 biology classrooms. Then these same students were again randomly assigned within each classroom to a control and to four question treatments (no questions, questions focusing on easy-to-learn charted content, questions focusing on difficult-to-learn charted content, and a combinational treatment).

Semantic graphs and associative memories

NASA Astrophysics Data System (ADS)

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.

RNA Graph Partitioning for the Discovery of RNA Modularity: A Novel Application of Graph Partition Algorithm to Biology

PubMed Central

Elmetwaly, Shereef; Schlick, Tamar

2014-01-01

Graph representations have been widely used to analyze and design various economic, social, military, political, and biological networks. In systems biology, networks of cells and organs are useful for understanding disease and medical treatments and, in structural biology, structures of molecules can be described, including RNA structures. In our RNA-As-Graphs (RAG) framework, we represent RNA structures as tree graphs by translating unpaired regions into vertices and helices into edges. Here we explore the modularity of RNA structures by applying graph partitioning known in graph theory to divide an RNA graph into subgraphs. To our knowledge, this is the first application of graph partitioning to biology, and the results suggest a systematic approach for modular design in general. The graph partitioning algorithms utilize mathematical properties of the Laplacian eigenvector (µ2) corresponding to the second eigenvalues (λ2) associated with the topology matrix defining the graph: λ2 describes the overall topology, and the sum of µ2′s components is zero. The three types of algorithms, termed median, sign, and gap cuts, divide a graph by determining nodes of cut by median, zero, and largest gap of µ2′s components, respectively. We apply these algorithms to 45 graphs corresponding to all solved RNA structures up through 11 vertices (∼220 nucleotides). While we observe that the median cut divides a graph into two similar-sized subgraphs, the sign and gap cuts partition a graph into two topologically-distinct subgraphs. We find that the gap cut produces the best biologically-relevant partitioning for RNA because it divides RNAs at less stable connections while maintaining junctions intact. The iterative gap cuts suggest basic modules and assembly protocols to design large RNA structures. Our graph substructuring thus suggests a systematic approach to explore the modularity of biological networks. In our applications to RNA structures, subgraphs also suggest

Computing Information Value from RDF Graph Properties

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

al-Saffar, Sinan; Heileman, Gregory

2010-11-08

Information value has been implicitly utilized and mostly non-subjectively computed in information retrieval (IR) systems. We explicitly define and compute the value of an information piece as a function of two parameters, the first is the potential semantic impact the target information can subjectively have on its recipient's world-knowledge, and the second parameter is trust in the information source. We model these two parameters as properties of RDF graphs. Two graphs are constructed, a target graph representing the semantics of the target body of information and a context graph representing the context of the consumer of that information. We computemore » information value subjectively as a function of both potential change to the context graph (impact) and the overlap between the two graphs (trust). Graph change is computed as a graph edit distance measuring the dissimilarity between the context graph before and after the learning of the target graph. A particular application of this subjective information valuation is in the construction of a personalized ranking component in Web search engines. Based on our method, we construct a Web re-ranking system that personalizes the information experience for the information-consumer.« less

Kevin Bacon and Graph Theory

ERIC Educational Resources Information Center

Hopkins, Brian

2004-01-01

The interconnected world of actors and movies is a familiar, rich example for graph theory. This paper gives the history of the "Kevin Bacon Game" and makes extensive use of a Web site to analyze the underlying graph. The main content is the classroom development of the weighted average to determine the best choice of "center" for the graph. The…

CUDA Enabled Graph Subset Examiner

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

Johnston, Jeremy T.

2016-12-22

Finding Godsil-McKay switching sets in graphs is one way to demonstrate that a specific graph is not determined by its spectrum--the eigenvalues of its adjacency matrix. An important area of active research in pure mathematics is determining which graphs are determined by their spectra, i.e. when the spectrum of the adjacency matrix uniquely determines the underlying graph. We are interested in exploring the spectra of graphs in the Johnson scheme and specifically seek to determine which of these graphs are determined by their spectra. Given a graph G, a Godsil-McKay switching set is an induced subgraph H on 2k verticesmore » with the following properties: I) H is regular, ii) every vertex in G/H is adjacent to either 0, k, or 2k vertices of H, and iii) at least one vertex in G/H is adjacent to k vertices in H. The software package examines each subset of a user specified size to determine whether or not it satisfies those 3 conditions. The software makes use of the massive parallel processing power of CUDA enabled GPUs. It also exploits the vertex transitivity of graphs in the Johnson scheme by reasoning that if G has a Godsil-McKay switching set, then it has a switching set which includes vertex 1. While the code (in its current state) is tuned to this specific problem, the method of examining each induced subgraph of G can be easily re-written to check for any user specified conditions on the subgraphs and can therefore be used much more broadly.« less

Multi-A Graph Patrolling and Partitioning

NASA Astrophysics Data System (ADS)

Elor, Y.; Bruckstein, A. M.

2012-12-01

We introduce a novel multi agent patrolling algorithm inspired by the behavior of gas filled balloons. Very low capability ant-like agents are considered with the task of patrolling an unknown area modeled as a graph. While executing the proposed algorithm, the agents dynamically partition the graph between them using simple local interactions, every agent assuming the responsibility for patrolling his subgraph. Balanced graph partition is an emergent behavior due to the local interactions between the agents in the swarm. Extensive simulations on various graphs (environments) showed that the average time to reach a balanced partition is linear with the graph size. The simulations yielded a convincing argument for conjecturing that if the graph being patrolled contains a balanced partition, the agents will find it. However, we could not prove this. Nevertheless, we have proved that if a balanced partition is reached, the maximum time lag between two successive visits to any vertex using the proposed strategy is at most twice the optimal so the patrol quality is at least half the optimal. In case of weighted graphs the patrol quality is at least (1)/(2){lmin}/{lmax} of the optimal where lmax (lmin) is the longest (shortest) edge in the graph.

Sketch Matching on Topology Product Graph.

PubMed

Liang, Shuang; Luo, Jun; Liu, Wenyin; Wei, Yichen

2015-08-01

Sketch matching is the fundamental problem in sketch based interfaces. After years of study, it remains challenging when there exists large irregularity and variations in the hand drawn sketch shapes. While most existing works exploit topology relations and graph representations for this problem, they are usually limited by the coarse topology exploration and heuristic (thus suboptimal) similarity metrics between graphs. We present a new sketch matching method with two novel contributions. We introduce a comprehensive definition of topology relations, which results in a rich and informative graph representation of sketches. For graph matching, we propose topology product graph that retains the full correspondence for matching two graphs. Based on it, we derive an intuitive sketch similarity metric whose exact solution is easy to compute. In addition, the graph representation and new metric naturally support partial matching, an important practical problem that received less attention in the literature. Extensive experimental results on a real challenging dataset and the superior performance of our method show that it outperforms the state-of-the-art.

Relating zeta functions of discrete and quantum graphs

NASA Astrophysics Data System (ADS)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation between the spectrum of the Laplacian on a discrete graph and that of the Laplacian on an equilateral metric graph. As a by-product, we determine how the multiplicity of eigenvalues of the quantum graph, that are also in the spectrum of the graph with Dirichlet conditions at the vertices, depends on the graph geometry. Finally we apply the result to calculate the vacuum energy and spectral determinant of a complete bipartite graph and compare our results with those for a star graph, a graph in which all vertices are connected to a central vertex by a single edge.

The international child growth chart.

PubMed

Chauliac, M

1986-01-01

This technical note describes and explains growth charts and their use, including growth charts for illustrative purposes. Growth charts provide a graphic representation of simple anthropometric measurements (weight and height). Thus, they provide better information on the health and nutritional status of children, as well as their evolution with time, for health workers and families. If anthropometric measurements are made regularly and noted on the card, health workers trained in the interpretation of curves established on the basis of these measurements then are able to make the appropriate decisions so as to ensure harmonious physical development for children. These charts also are a tool for the health education of families. Many experiments have shown that mothers who are illiterate are able to comprehend the meaning of the direction taken by a growth curve and then are more receptive to health education. Curves are useful at the individual level for the early detection of any anomaly in growth. At the collective level, the series of curves drawn for a group of children should be analyzed in order to follow growth in the group and to evaluate the impact of actions undertaken to improve the children's health status. In 1978, the World Health Organization (WHO) created a model chart, which may be adapted and reproduced by any country. No great financial investment or complicated material is necessary. The chart should be approximately 210 mm x 297 mm in size and be made of sufficiently thick cardboard to last 5 years. A protective plastic envelope of appropriate size to contain and protect the card is preferable. The model is composed of 2 elements: a chart for boys and a chart for girls. The 1st page includes some information on civil status, useful for finding the chart and for obtaining some idea of the health status of siblings. The dates of vaccination are listed at the bottom of the page. The inner side of the card contains the curves for weight and

Local Higher-Order Graph Clustering

PubMed Central

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

2018-01-01

Local graph clustering methods aim to find a cluster of nodes by exploring a small region of the graph. These methods are attractive because they enable targeted clustering around a given seed node and are faster than traditional global graph clustering methods because their runtime does not depend on the size of the input graph. However, current local graph partitioning methods are not designed to account for the higher-order structures crucial to the network, nor can they effectively handle directed networks. Here we introduce a new class of local graph clustering methods that address these issues by incorporating higher-order network information captured by small subgraphs, also called network motifs. We develop the Motif-based Approximate Personalized PageRank (MAPPR) algorithm that finds clusters containing a seed node with minimal motif conductance, a generalization of the conductance metric for network motifs. We generalize existing theory to prove the fast running time (independent of the size of the graph) and obtain theoretical guarantees on the cluster quality (in terms of motif conductance). We also develop a theory of node neighborhoods for finding sets that have small motif conductance, and apply these results to the case of finding good seed nodes to use as input to the MAPPR algorithm. Experimental validation on community detection tasks in both synthetic and real-world networks, shows that our new framework MAPPR outperforms the current edge-based personalized PageRank methodology. PMID:29770258

Aspects of Performance on Line Graph Description Tasks: Influenced by Graph Familiarity and Different Task Features

ERIC Educational Resources Information Center

Xi, Xiaoming

2010-01-01

Motivated by cognitive theories of graph comprehension, this study systematically manipulated characteristics of a line graph description task in a speaking test in ways to mitigate the influence of graph familiarity, a potential source of construct-irrelevant variance. It extends Xi (2005), which found that the differences in holistic scores on…

Continuous-time quantum walks on star graphs

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

Salimi, S.

2009-06-15

In this paper, we investigate continuous-time quantum walk on star graphs. It is shown that quantum central limit theorem for a continuous-time quantum walk on star graphs for N-fold star power graph, which are invariant under the quantum component of adjacency matrix, converges to continuous-time quantum walk on K{sub 2} graphs (complete graph with two vertices) and the probability of observing walk tends to the uniform distribution.

RATGRAPH: Computer Graphing of Rational Functions.

ERIC Educational Resources Information Center

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)

The graph neural network model.

PubMed

Scarselli, Franco; Gori, Marco; Tsoi, Ah Chung; Hagenbuchner, Markus; Monfardini, Gabriele

2009-01-01

Many underlying relationships among data in several areas of science and engineering, e.g., computer vision, molecular chemistry, molecular biology, pattern recognition, and data mining, can be represented in terms of graphs. In this paper, we propose a new neural network model, called graph neural network (GNN) model, that extends existing neural network methods for processing the data represented in graph domains. This GNN model, which can directly process most of the practically useful types of graphs, e.g., acyclic, cyclic, directed, and undirected, implements a function tau(G,n) is an element of IR(m) that maps a graph G and one of its nodes n into an m-dimensional Euclidean space. A supervised learning algorithm is derived to estimate the parameters of the proposed GNN model. The computational cost of the proposed algorithm is also considered. Some experimental results are shown to validate the proposed learning algorithm, and to demonstrate its generalization capabilities.

VISAGE: Interactive Visual Graph Querying.

PubMed

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2016-06-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete , an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with "wildcard" nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE's ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries.

VISAGE: Interactive Visual Graph Querying

PubMed Central

Pienta, Robert; Navathe, Shamkant; Tamersoy, Acar; Tong, Hanghang; Endert, Alex; Chau, Duen Horng

2017-01-01

Extracting useful patterns from large network datasets has become a fundamental challenge in many domains. We present VISAGE, an interactive visual graph querying approach that empowers users to construct expressive queries, without writing complex code (e.g., finding money laundering rings of bankers and business owners). Our contributions are as follows: (1) we introduce graph autocomplete, an interactive approach that guides users to construct and refine queries, preventing over-specification; (2) VISAGE guides the construction of graph queries using a data-driven approach, enabling users to specify queries with varying levels of specificity, from concrete and detailed (e.g., query by example), to abstract (e.g., with “wildcard” nodes of any types), to purely structural matching; (3) a twelve-participant, within-subject user study demonstrates VISAGE’s ease of use and the ability to construct graph queries significantly faster than using a conventional query language; (4) VISAGE works on real graphs with over 468K edges, achieving sub-second response times for common queries. PMID:28553670

Bipartite separability and nonlocal quantum operations on graphs

NASA Astrophysics Data System (ADS)

Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.

2016-07-01

In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.

Annotation Graphs: A Graph-Based Visualization for Meta-Analysis of Data Based on User-Authored Annotations.

PubMed

Zhao, Jian; Glueck, Michael; Breslav, Simon; Chevalier, Fanny; Khan, Azam

2017-01-01

User-authored annotations of data can support analysts in the activity of hypothesis generation and sensemaking, where it is not only critical to document key observations, but also to communicate insights between analysts. We present annotation graphs, a dynamic graph visualization that enables meta-analysis of data based on user-authored annotations. The annotation graph topology encodes annotation semantics, which describe the content of and relations between data selections, comments, and tags. We present a mixed-initiative approach to graph layout that integrates an analyst's manual manipulations with an automatic method based on similarity inferred from the annotation semantics. Various visual graph layout styles reveal different perspectives on the annotation semantics. Annotation graphs are implemented within C8, a system that supports authoring annotations during exploratory analysis of a dataset. We apply principles of Exploratory Sequential Data Analysis (ESDA) in designing C8, and further link these to an existing task typology in the visualization literature. We develop and evaluate the system through an iterative user-centered design process with three experts, situated in the domain of analyzing HCI experiment data. The results suggest that annotation graphs are effective as a method of visually extending user-authored annotations to data meta-analysis for discovery and organization of ideas.

Graph processing platforms at scale: practices and experiences

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

Lim, Seung-Hwan; Lee, Sangkeun; Brown, Tyler C

2015-01-01

Graph analysis unveils hidden associations of data in many phenomena and artifacts, such as road network, social networks, genomic information, and scientific collaboration. Unfortunately, a wide diversity in the characteristics of graphs and graph operations make it challenging to find a right combination of tools and implementation of algorithms to discover desired knowledge from the target data set. This study presents an extensive empirical study of three representative graph processing platforms: Pegasus, GraphX, and Urika. Each system represents a combination of options in data model, processing paradigm, and infrastructure. We benchmarked each platform using three popular graph operations, degree distribution,more » connected components, and PageRank over a variety of real-world graphs. Our experiments show that each graph processing platform shows different strength, depending the type of graph operations. While Urika performs the best in non-iterative operations like degree distribution, GraphX outputforms iterative operations like connected components and PageRank. In addition, we discuss challenges to optimize the performance of each platform over large scale real world graphs.« less

Survey of Approaches to Generate Realistic Synthetic Graphs

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

Lim, Seung-Hwan; Lee, Sangkeun; Powers, Sarah S

A graph is a flexible data structure that can represent relationships between entities. As with other data analysis tasks, the use of realistic graphs is critical to obtaining valid research results. Unfortunately, using the actual ("real-world") graphs for research and new algorithm development is difficult due to the presence of sensitive information in the data or due to the scale of data. This results in practitioners developing algorithms and systems that employ synthetic graphs instead of real-world graphs. Generating realistic synthetic graphs that provide reliable statistical confidence to algorithmic analysis and system evaluation involves addressing technical hurdles in a broadmore » set of areas. This report surveys the state of the art in approaches to generate realistic graphs that are derived from fitted graph models on real-world graphs.« less

Constructing Dense Graphs with Unique Hamiltonian Cycles

ERIC Educational Resources Information Center

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…

The Replicator Equation on Graphs

PubMed Central

Ohtsuki, Hisashi; Nowak, Martin A.

2008-01-01

We study evolutionary games on graphs. Each player is represented by a vertex of the graph. The edges denote who meets whom. A player can use any one of n strategies. Players obtain a payoff from interaction with all their immediate neighbors. We consider three different update rules, called ‘birth-death’, ‘death-birth’ and ‘imitation’. A fourth update rule, ‘pairwise comparison’, is shown to be equivalent to birth-death updating in our model. We use pair-approximation to describe the evolutionary game dynamics on regular graphs of degree k. In the limit of weak selection, we can derive a differential equation which describes how the average frequency of each strategy on the graph changes over time. Remarkably, this equation is a replicator equation with a transformed payoff matrix. Therefore, moving a game from a well-mixed population (the complete graph) onto a regular graph simply results in a transformation of the payoff matrix. The new payoff matrix is the sum of the original payoff matrix plus another matrix, which describes the local competition of strategies. We discuss the application of our theory to four particular examples, the Prisoner’s Dilemma, the Snow-Drift game, a coordination game and the Rock-Scissors-Paper game. PMID:16860343

On some labelings of triangular snake and central graph of triangular snake graph

NASA Astrophysics Data System (ADS)

Agasthi, P.; Parvathi, N.

2018-04-01

A Triangular snake Tn is obtained from a path u 1 u 2 … u n by joining ui and u i+1 to a new vertex wi for 1≤i≤n‑1. A Central graph of Triangular snake C(T n ) is obtained by subdividing each edge of Tn exactly once and joining all the non adjacent vertices of Tn . In this paper the ways to construct square sum, square difference, Root Mean square, strongly Multiplicative, Even Mean and Odd Mean labeling for Triangular Snake and Central graph of Triangular Snake graphs are reported.

Graph Frequency Analysis of Brain Signals

PubMed Central

Huang, Weiyu; Goldsberry, Leah; Wymbs, Nicholas F.; Grafton, Scott T.; Bassett, Danielle S.; Ribeiro, Alejandro

2016-01-01

This paper presents methods to analyze functional brain networks and signals from graph spectral perspectives. The notion of frequency and filters traditionally defined for signals supported on regular domains such as discrete time and image grids has been recently generalized to irregular graph domains, and defines brain graph frequencies associated with different levels of spatial smoothness across the brain regions. Brain network frequency also enables the decomposition of brain signals into pieces corresponding to smooth or rapid variations. We relate graph frequency with principal component analysis when the networks of interest denote functional connectivity. The methods are utilized to analyze brain networks and signals as subjects master a simple motor skill. We observe that brain signals corresponding to different graph frequencies exhibit different levels of adaptability throughout learning. Further, we notice a strong association between graph spectral properties of brain networks and the level of exposure to tasks performed, and recognize the most contributing and important frequency signatures at different levels of task familiarity. PMID:28439325

My Bar Graph Tells a Story

ERIC Educational Resources Information Center

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…

Graph reconstruction using covariance-based methods.

PubMed

Sulaimanov, Nurgazy; Koeppl, Heinz

2016-12-01

Methods based on correlation and partial correlation are today employed in the reconstruction of a statistical interaction graph from high-throughput omics data. These dedicated methods work well even for the case when the number of variables exceeds the number of samples. In this study, we investigate how the graphs extracted from covariance and concentration matrix estimates are related by using Neumann series and transitive closure and through discussing concrete small examples. Considering the ideal case where the true graph is available, we also compare correlation and partial correlation methods for large realistic graphs. In particular, we perform the comparisons with optimally selected parameters based on the true underlying graph and with data-driven approaches where the parameters are directly estimated from the data.

OPEX: Optimized Eccentricity Computation in Graphs

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

Henderson, Keith

2011-11-14

Real-world graphs have many properties of interest, but often these properties are expensive to compute. We focus on eccentricity, radius and diameter in this work. These properties are useful measures of the global connectivity patterns in a graph. Unfortunately, computing eccentricity for all nodes is O(n2) for a graph with n nodes. We present OPEX, a novel combination of optimizations which improves computation time of these properties by orders of magnitude in real-world experiments on graphs of many different sizes. We run OPEX on graphs with up to millions of links. OPEX gives either exact results or bounded approximations, unlikemore » its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).« less

prepare_taxa_charts.py: A Python program to automate generation of publication ready taxonomic pie chart images from QIIME.

PubMed

Lakhujani, Vijay; Badapanda, Chandan

2017-06-01

QIIME (Quantitative Insights Into Microbial Ecology) is one of the most popular open-source bioinformatics suite for performing metagenome, 16S rRNA amplicon and Internal Transcribed Spacer (ITS) data analysis. Although, it is very comprehensive and powerful tool, it lacks a method to provide publication ready taxonomic pie charts. The script plot_taxa_summary . py bundled with QIIME generate a html file and a folder containing taxonomic pie chart and legend as separate images. The images have randomly generated alphanumeric names. Therefore, it is difficult to associate the pie chart with the legend and the corresponding sample identifier. Even if the option to have the legend within the html file is selected while executing plot_taxa_summary . py , it is very tedious to crop a complete image (having both the pie chart and the legend) due to unequal image sizes. It requires a lot of time to manually prepare the pie charts for multiple samples for publication purpose. Moreover, there are chances of error while identifying the pie chart and legend pair due to random alphanumeric names of the images. To bypass all these bottlenecks and make this process efficient, we have developed a python based program, prepare_taxa_charts . py , to automate the renaming, cropping and merging of taxonomic pie chart and corresponding legend image into a single, good quality publication ready image. This program not only augments the functionality of plot_taxa_summary . py but is also very fast in terms of CPU time and user friendly.

Genome alignment with graph data structures: a comparison

PubMed Central

2014-01-01

Background Recent advances in rapid, low-cost sequencing have opened up the opportunity to study complete genome sequences. The computational approach of multiple genome alignment allows investigation of evolutionarily related genomes in an integrated fashion, providing a basis for downstream analyses such as rearrangement studies and phylogenetic inference. Graphs have proven to be a powerful tool for coping with the complexity of genome-scale sequence alignments. The potential of graphs to intuitively represent all aspects of genome alignments led to the development of graph-based approaches for genome alignment. These approaches construct a graph from a set of local alignments, and derive a genome alignment through identification and removal of graph substructures that indicate errors in the alignment. Results We compare the structures of commonly used graphs in terms of their abilities to represent alignment information. We describe how the graphs can be transformed into each other, and identify and classify graph substructures common to one or more graphs. Based on previous approaches, we compile a list of modifications that remove these substructures. Conclusion We show that crucial pieces of alignment information, associated with inversions and duplications, are not visible in the structure of all graphs. If we neglect vertex or edge labels, the graphs differ in their information content. Still, many ideas are shared among all graph-based approaches. Based on these findings, we outline a conceptual framework for graph-based genome alignment that can assist in the development of future genome alignment tools. PMID:24712884

So Many Graphs, So Little Time

ERIC Educational Resources Information Center

Wall, Jennifer J.; Benson, Christine C.

2009-01-01

Interpreting graphs found in various content areas is an important skill for students, especially in light of high-stakes testing. In addition, reading and understanding graphs is an important part of numeracy, or numeric literacy, a skill necessary for informed citizenry. This article explores the different categories of graphs, provides…

Performance Charts for the Turbojet Engine

NASA Technical Reports Server (NTRS)

Pinkel, Benjamin; Karp, Irving M.

1947-01-01

Charts are presented for computing the thrust, fuel consumption, and other performance values of a turbojet engine for any given set of operating conditions and component efficiencies. The effects of the pressure losses in the inlet duct and combustion chamber, the variation in the physical properties of the gas as it passes through the cycle, and the change in mass flow by the addition of fuel are included. The principle performance charts show the effects of the primary variables and correction charts provide the effects of the secondary variables.

The effect of lab based instruction on ACT science scores

NASA Astrophysics Data System (ADS)

Hamilton, Michelle

Standardized tests, although unpopular, are required for a multitude of reasons. One of these tests is the ACT. The ACT is a college readiness test that many high school juniors take to gain college admittance. Students throughout the United States are unprepared for this assessment. The average high school junior is three points behind twenty-four, the ACT recommended score, for the science section. The science section focuses on reading text and, interpreting graphs, charts, tables and diagrams with an emphasis on experimental design and relationships among variables. For students to become better at interpreting and understanding scientific graphics they must have vast experience developing their own graphics. The purpose of this study was to provide students the opportunity to generate their own graphics to master interpretation of them on the ACT. According to a t-test the results show that students who are continually exposed to creating graphs are able to understand and locate information from graphs at a significantly faster rate.

Real World Graph Connectivity

ERIC Educational Resources Information Center

Lind, Joy; Narayan, Darren

2009-01-01

We present the topic of graph connectivity along with a famous theorem of Menger in the real-world setting of the national computer network infrastructure of "National LambdaRail". We include a set of exercises where students reinforce their understanding of graph connectivity by analysing the "National LambdaRail" network. Finally, we give…

Discriminative graph embedding for label propagation.

PubMed

Nguyen, Canh Hao; Mamitsuka, Hiroshi

2011-09-01

In many applications, the available information is encoded in graph structures. This is a common problem in biological networks, social networks, web communities and document citations. We investigate the problem of classifying nodes' labels on a similarity graph given only a graph structure on the nodes. Conventional machine learning methods usually require data to reside in some Euclidean spaces or to have a kernel representation. Applying these methods to nodes on graphs would require embedding the graphs into these spaces. By embedding and then learning the nodes on graphs, most methods are either flexible with different learning objectives or efficient enough for large scale applications. We propose a method to embed a graph into a feature space for a discriminative purpose. Our idea is to include label information into the embedding process, making the space representation tailored to the task. We design embedding objective functions that the following learning formulations become spectral transforms. We then reformulate these spectral transforms into multiple kernel learning problems. Our method, while being tailored to the discriminative tasks, is efficient and can scale to massive data sets. We show the need of discriminative embedding on some simulations. Applying to biological network problems, our method is shown to outperform baselines.

47 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761... 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 CFR 80.761 - Conversion graphs.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 5 2011-10-01 2011-10-01 false Conversion graphs. 80.761 Section 80.761... 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...

Building Scalable Knowledge Graphs for Earth Science

NASA Technical Reports Server (NTRS)

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.

Chart Audit and Chart Stimulated Recall as Methods of Needs Assessment in Continuing Professional Health Education.

ERIC Educational Resources Information Center

Affleck, Louise; Jennett, Penny

1998-01-01

Chart audit (assessment of patient medical records) is a cost-effective continuing-education needs-assessment method. Chart stimulated recall, in which physicians' memory of particular cases is stimulated by records, potentially increases content validity and exploration of clinical reasoning as well as the context of clinical decisions. (SK)

Qualities of dental chart recording and coding.

PubMed

Chantravekin, Yosananda; Tasananutree, Munchulika; Santaphongse, Supitcha; Aittiwarapoj, Anchisa

2013-01-01

Chart recording and coding are the important processes in the healthcare informatics system, but there were only a few reports in the dentistry field. The objectives of this study are to study the qualities of dental chart recording and coding, as well as the achievement of lecture/workshop on this topic. The study was performed by auditing the patient's charts at the TU Dental Student Clinic from July 2011-August 2012. The chart recording mean scores ranged from 51.0-55.7%, whereas the errors in the coding process were presented in the coder part more than the doctor part. The lecture/workshop could improve the scores only in some topics.

GrouseFlocks: steerable exploration of graph hierarchy space.

PubMed

Archambault, Daniel; Munzner, Tamara; Auber, David

2008-01-01

Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorithms or topological features present in the graph. However, many graphs have domain-specific attributes associated with the nodes and edges, which could be used to create many possible hierarchies providing unique views of the input graph. GrouseFlocks is a system for the exploration of this graph hierarchy space. By allowing users to see several different possible hierarchies on the same graph, the system helps users investigate graph hierarchy space instead of a single fixed hierarchy. GrouseFlocks provides a simple set of operations so that users can create and modify their graph hierarchies based on selections. These selections can be made manually or based on patterns in the attribute data provided with the graph. It provides feedback to the user within seconds, allowing interactive exploration of this space.

graphkernels: R and Python packages for graph comparison

PubMed Central

Ghisu, M Elisabetta; Llinares-López, Felipe; Borgwardt, Karsten

2018-01-01

Abstract Summary 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. Availability and implementation 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. Contact mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch Supplementary information Supplementary data are available online at Bioinformatics. PMID:29028902

graphkernels: R and Python packages for graph comparison.

PubMed

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.

On a programming language for graph algorithms

NASA Technical Reports Server (NTRS)

Rheinboldt, W. C.; Basili, V. R.; Mesztenyi, C. K.

1971-01-01

An algorithmic language, GRAAL, is presented for describing and implementing graph algorithms of the type primarily arising in applications. The language is based on a set algebraic model of graph theory which defines the graph structure in terms of morphisms between certain set algebraic structures over the node set and arc set. GRAAL is modular in the sense that the user specifies which of these mappings are available with any graph. This allows flexibility in the selection of the storage representation for different graph structures. In line with its set theoretic foundation, the language introduces sets as a basic data type and provides for the efficient execution of all set and graph operators. At present, GRAAL is defined as an extension of ALGOL 60 (revised) and its formal description is given as a supplement to the syntactic and semantic definition of ALGOL. Several typical graph algorithms are written in GRAAL to illustrate various features of the language and to show its applicability.

Graphs and Zero-Divisors

ERIC Educational Resources Information Center

Axtell, M.; Stickles, J.

2010-01-01

The last ten years have seen an explosion of research in the zero-divisor graphs of commutative rings--by professional mathematicians "and" undergraduates. The objective is to find algebraic information within the geometry of these graphs. This topic is approachable by anyone with one or two semesters of abstract algebra. This article gives the…

Are randomly grown graphs really random?

PubMed

Callaway, D S; Hopcroft, J E; Kleinberg, J M; Newman, M E; Strogatz, S H

2001-10-01

We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time steps. In the limit of large t, the resulting graph displays surprisingly rich characteristics. In particular, a giant component emerges in an infinite-order phase transition at delta=1/8. At the transition, the average component size jumps discontinuously but remains finite. In contrast, a static random graph with the same degree distribution exhibits a second-order phase transition at delta=1/4, and the average component size diverges there. These dramatic differences between grown and static random graphs stem from a positive correlation between the degrees of connected vertices in the grown graph-older vertices tend to have higher degree, and to link with other high-degree vertices, merely by virtue of their age. We conclude that grown graphs, however randomly they are constructed, are fundamentally different from their static random graph counterparts.

Comparison of reading speed with 3 different log-scaled reading charts.

PubMed

Buari, Noor Halilah; Chen, Ai-Hong; Musa, Nuraini

2014-01-01

A reading chart that resembles real reading conditions is important to evaluate the quality of life in terms of reading performance. The purpose of this study was to compare the reading speed of UiTM Malay related words (UiTM-Mrw) reading chart with MNread Acuity Chart and Colenbrander Reading Chart. Fifty subjects with normal sight were randomly recruited through randomized sampling in this study (mean age=22.98±1.65 years). Subjects were asked to read three different near charts aloud and as quickly as possible at random sequence. The charts were the UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart, respectively. The time taken to read each chart was recorded and any errors while reading were noted. Reading performance was quantified in terms of reading speed as words per minute (wpm). The mean reading speed for UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart was 200±30wpm, 196±28wpm and 194±31wpm, respectively. Comparison of reading speed between UiTM-Mrw Reading Chart and MNread Acuity Chart showed no significant difference (t=-0.73, p=0.72). The same happened with the reading speed between UiTM-Mrw Reading Chart and Colenbrander Reading Chart (t=-0.97, p=0.55). Bland and Altman plot showed good agreement between reading speed of UiTM-Mrw Reading Chart with MNread Acuity Chart with the Colenbrander Reading Chart. UiTM-Mrw Reading Chart in Malay language is highly comparable with standardized charts and can be used for evaluating reading speed. Copyright © 2013 Spanish General Council of Optometry. Published by Elsevier Espana. All rights reserved.

Safe Minimum Internal Temperature Chart

MedlinePlus

... Administrative Forms Standard Forms Skip Navigation Z7_0Q0619C0JGR010IFST1G5B10H1 Web Content Viewer (JSR 286) Actions ${title} Loading... / Topics / ... Chart / Safe Minimum Internal Temperature Chart Z7_0Q0619C0JGR010IFST1G5B10H3 Web Content Viewer (JSR 286) Actions ${title} Loading... Z7_ ...

Genus Ranges of 4-Regular Rigid Vertex Graphs

PubMed Central

Buck, Dorothy; Dolzhenko, Egor; Jonoska, Nataša; Saito, Masahico; Valencia, Karin

2016-01-01

A rigid vertex of a graph is one that has a prescribed cyclic order of its incident edges. We study orientable genus ranges of 4-regular rigid vertex graphs. The (orientable) genus range is a set of genera values over all orientable surfaces into which a graph is embedded cellularly, and the embeddings of rigid vertex graphs are required to preserve the prescribed cyclic order of incident edges at every vertex. The genus ranges of 4-regular rigid vertex graphs are sets of consecutive integers, and we address two questions: which intervals of integers appear as genus ranges of such graphs, and what types of graphs realize a given genus range. For graphs with 2n vertices (n > 1), we prove that all intervals [a, b] for all a < b ≤ n, and singletons [h, h] for some h ≤ n, are realized as genus ranges. For graphs with 2n − 1 vertices (n ≥ 1), we prove that all intervals [a, b] for all a < b ≤ n except [0, n], and [h, h] for some h ≤ n, are realized as genus ranges. We also provide constructions of graphs that realize these ranges. PMID:27807395

Fast generation of sparse random kernel graphs

DOE PAGES

Hagberg, Aric; Lemons, Nathan; Du, Wen -Bo

2015-09-10

The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable. We specify a class of inhomogeneous random graph models, called random kernel graphs, that produces sparse graphs with tunable graph properties, and we develop an efficient generation algorithm to sample random instances from this model. As real-world networks are usually large, it is essential that the run-time of generation algorithms scales better than quadratically in the number of vertices n. We show that for many practical kernels our algorithm runs in timemore » at most ο(n(logn)²). As an example, we show how to generate samples of power-law degree distribution graphs with tunable assortativity.« less

49 CFR 236.718 - Chart, dog.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 49 Transportation 4 2014-10-01 2014-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

49 CFR 236.718 - Chart, dog.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 49 Transportation 4 2013-10-01 2013-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

49 CFR 236.718 - Chart, dog.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 49 Transportation 4 2012-10-01 2012-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

49 CFR 236.718 - Chart, dog.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 49 Transportation 4 2011-10-01 2011-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

49 CFR 236.718 - Chart, dog.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 49 Transportation 4 2010-10-01 2010-10-01 false Chart, dog. 236.718 Section 236.718 Transportation Other Regulations Relating to Transportation (Continued) FEDERAL RAILROAD ADMINISTRATION, DEPARTMENT OF... OF SIGNAL AND TRAIN CONTROL SYSTEMS, DEVICES, AND APPLIANCES Definitions § 236.718 Chart, dog. A...

Comparison of reading speed with 3 different log-scaled reading charts

PubMed Central

Buari, Noor Halilah; Chen, Ai-Hong; Musa, Nuraini

2014-01-01

Background A reading chart that resembles real reading conditions is important to evaluate the quality of life in terms of reading performance. The purpose of this study was to compare the reading speed of UiTM Malay related words (UiTM-Mrw) reading chart with MNread Acuity Chart and Colenbrander Reading Chart. Materials and methods Fifty subjects with normal sight were randomly recruited through randomized sampling in this study (mean age = 22.98 ± 1.65 years). Subjects were asked to read three different near charts aloud and as quickly as possible at random sequence. The charts were the UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart, respectively. The time taken to read each chart was recorded and any errors while reading were noted. Reading performance was quantified in terms of reading speed as words per minute (wpm). Results The mean reading speed for UiTM-Mrw Reading Chart, MNread Acuity Chart and Colenbrander Reading Chart was 200 ± 30 wpm, 196 ± 28 wpm and 194 ± 31 wpm, respectively. Comparison of reading speed between UiTM-Mrw Reading Chart and MNread Acuity Chart showed no significant difference (t = −0.73, p = 0.72). The same happened with the reading speed between UiTM-Mrw Reading Chart and Colenbrander Reading Chart (t = −0.97, p = 0.55). Bland and Altman plot showed good agreement between reading speed of UiTM-Mrw Reading Chart with MNread Acuity Chart with the Colenbrander Reading Chart. Conclusion UiTM-Mrw Reading Chart in Malay language is highly comparable with standardized charts and can be used for evaluating reading speed. PMID:25323642

A model of language inflection graphs

NASA Astrophysics Data System (ADS)

Fukś, Henryk; Farzad, Babak; Cao, Yi

2014-01-01

Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to the abundance of inflectional forms. We construct the simplest form of inflection graphs, namely a bipartite graph in which one group of vertices corresponds to dictionary headwords and the other group to inflected forms encountered in a given text. We, then, study projection of this graph on the set of headwords. The projection decomposes into a large number of connected components, to be called word groups. Distribution of sizes of word group exhibits some remarkable properties, resembling cluster distribution in a lattice percolation near the critical point. We propose a simple model which produces graphs of this type, reproducing the desired component distribution and other topological features.

System analysis through bond graph modeling

NASA Astrophysics Data System (ADS)

McBride, Robert Thomas

2005-07-01

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

76 FR 53530 - Government/Industry Aeronautical Charting Forum Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2011-08-26

... Charting Forum Meeting AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of public meeting...) Aeronautical Charting Forum (ACF) to discuss informational content and design of aeronautical charts and... Charting Forum to be held from October 25 through October 27, 2011, from 8:30 a.m. to 5 p.m. at FAA AeroNav...

Preserving Differential Privacy in Degree-Correlation based Graph Generation

PubMed Central

Wang, Yue; Wu, Xintao

2014-01-01

Enabling accurate analysis of social network data while preserving differential privacy has been challenging since graph features such as cluster coefficient often have high sensitivity, which is different from traditional aggregate functions (e.g., count and sum) on tabular data. In this paper, we study the problem of enforcing edge differential privacy in graph generation. The idea is to enforce differential privacy on graph model parameters learned from the original network and then generate the graphs for releasing using the graph model with the private parameters. In particular, we develop a differential privacy preserving graph generator based on the dK-graph generation model. We first derive from the original graph various parameters (i.e., degree correlations) used in the dK-graph model, then enforce edge differential privacy on the learned parameters, and finally use the dK-graph model with the perturbed parameters to generate graphs. For the 2K-graph model, we enforce the edge differential privacy by calibrating noise based on the smooth sensitivity, rather than the global sensitivity. By doing this, we achieve the strict differential privacy guarantee with smaller magnitude noise. We conduct experiments on four real networks and compare the performance of our private dK-graph models with the stochastic Kronecker graph generation model in terms of utility and privacy tradeoff. Empirical evaluations show the developed private dK-graph generation models significantly outperform the approach based on the stochastic Kronecker generation model. PMID:24723987

Inferring ontology graph structures using OWL reasoning.

PubMed

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.

Evolutionary Games of Multiplayer Cooperation on Graphs

PubMed Central

Arranz, Jordi; Traulsen, Arne

2016-01-01

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

QSPR modeling: graph connectivity indices versus line graph connectivity indices

PubMed

Basak; Nikolic; Trinajstic; Amic; Beslo

2000-07-01

Five QSPR models of alkanes were reinvestigated. Properties considered were molecular surface-dependent properties (boiling points and gas chromatographic retention indices) and molecular volume-dependent properties (molar volumes and molar refractions). The vertex- and edge-connectivity indices were used as structural parameters. In each studied case we computed connectivity indices of alkane trees and alkane line graphs and searched for the optimum exponent. Models based on indices with an optimum exponent and on the standard value of the exponent were compared. Thus, for each property we generated six QSPR models (four for alkane trees and two for the corresponding line graphs). In all studied cases QSPR models based on connectivity indices with optimum exponents have better statistical characteristics than the models based on connectivity indices with the standard value of the exponent. The comparison between models based on vertex- and edge-connectivity indices gave in two cases (molar volumes and molar refractions) better models based on edge-connectivity indices and in three cases (boiling points for octanes and nonanes and gas chromatographic retention indices) better models based on vertex-connectivity indices. Thus, it appears that the edge-connectivity index is more appropriate to be used in the structure-molecular volume properties modeling and the vertex-connectivity index in the structure-molecular surface properties modeling. The use of line graphs did not improve the predictive power of the connectivity indices. Only in one case (boiling points of nonanes) a better model was obtained with the use of line graphs.

Smart Book Charts

NASA Technical Reports Server (NTRS)

Chinnapongse, Ronald L.

2015-01-01

Smart book charts for TPSM: Heatshield for Extreme Entry Environment Technology (HEEET), Conformal Ablative TPS (CA-TPS), 3D Woven Multifunctional Ablative TPS (3D MAT), and Adaptable, Deployable, Entry and Placement Technology (ADEPT).

The Container Problem in Bubble-Sort Graphs

NASA Astrophysics Data System (ADS)

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.

The many faces of graph dynamics

NASA Astrophysics Data System (ADS)

Pignolet, Yvonne Anne; Roy, Matthieu; Schmid, Stefan; Tredan, Gilles

2017-06-01

The topological structure of complex networks has fascinated researchers for several decades, resulting in the discovery of many universal properties and reoccurring characteristics of different kinds of networks. However, much less is known today about the network dynamics: indeed, complex networks in reality are not static, but rather dynamically evolve over time. Our paper is motivated by the empirical observation that network evolution patterns seem far from random, but exhibit structure. Moreover, the specific patterns appear to depend on the network type, contradicting the existence of a ‘one fits it all’ model. However, we still lack observables to quantify these intuitions, as well as metrics to compare graph evolutions. Such observables and metrics are needed for extrapolating or predicting evolutions, as well as for interpolating graph evolutions. To explore the many faces of graph dynamics and to quantify temporal changes, this paper suggests to build upon the concept of centrality, a measure of node importance in a network. In particular, we introduce the notion of centrality distance, a natural similarity measure for two graphs which depends on a given centrality, characterizing the graph type. Intuitively, centrality distances reflect the extent to which (non-anonymous) node roles are different or, in case of dynamic graphs, have changed over time, between two graphs. We evaluate the centrality distance approach for five evolutionary models and seven real-world social and physical networks. Our results empirically show the usefulness of centrality distances for characterizing graph dynamics compared to a null-model of random evolution, and highlight the differences between the considered scenarios. Interestingly, our approach allows us to compare the dynamics of very different networks, in terms of scale and evolution speed.

29 CFR 1926.1422 - Signals-hand signal chart.

Code of Federal Regulations, 2014 CFR

2014-07-01

... 29 Labor 8 2014-07-01 2014-07-01 false Signals-hand signal chart. 1926.1422 Section 1926.1422 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION... Construction § 1926.1422 Signals—hand signal chart. Hand signal charts must be either posted on the equipment...

29 CFR 1926.1422 - Signals-hand signal chart.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 29 Labor 8 2013-07-01 2013-07-01 false Signals-hand signal chart. 1926.1422 Section 1926.1422 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION... Construction § 1926.1422 Signals—hand signal chart. Hand signal charts must be either posted on the equipment...

29 CFR 1926.1422 - Signals-hand signal chart.

Code of Federal Regulations, 2012 CFR

2012-07-01

... 29 Labor 8 2012-07-01 2012-07-01 false Signals-hand signal chart. 1926.1422 Section 1926.1422 Labor Regulations Relating to Labor (Continued) OCCUPATIONAL SAFETY AND HEALTH ADMINISTRATION... Construction § 1926.1422 Signals—hand signal chart. Hand signal charts must be either posted on the equipment...

Graph Mining Meets the Semantic Web

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

Lee, Sangkeun; Sukumar, Sreenivas R; Lim, Seung-Hwan

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 evaluatemore » 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.« less

47 CFR 73.333 - Engineering charts.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 4 2011-10-01 2011-10-01 false Engineering charts. 73.333 Section 73.333 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES FM Broadcast Stations § 73.333 Engineering charts. This section consists of the following Figures 1, 1a, 2, and...

47 CFR 73.333 - Engineering charts.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 4 2012-10-01 2012-10-01 false Engineering charts. 73.333 Section 73.333 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES FM Broadcast Stations § 73.333 Engineering charts. This section consists of the following Figures 1, 1a, 2, and...

47 CFR 73.333 - Engineering charts.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 4 2013-10-01 2013-10-01 false Engineering charts. 73.333 Section 73.333 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES FM Broadcast Stations § 73.333 Engineering charts. This section consists of the following Figures 1, 1a, 2, and...

47 CFR 73.333 - Engineering charts.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 4 2014-10-01 2014-10-01 false Engineering charts. 73.333 Section 73.333 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES FM Broadcast Stations § 73.333 Engineering charts. This section consists of the following Figures 1, 1a, 2, and...

47 CFR 73.333 - Engineering charts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 4 2010-10-01 2010-10-01 false Engineering charts. 73.333 Section 73.333 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES FM Broadcast Stations § 73.333 Engineering charts. This section consists of the following Figures 1, 1a, 2, and...

Graphs as Statements of Belief.

ERIC Educational Resources Information Center

Lake, David

2002-01-01

Identifies points where beliefs are important when making decisions about how graphs are drawn. Describes a simple case of the reaction between 'bicarb soda' and orange or lemon juice and discusses how drawing a graph becomes a statement of belief. (KHR)

Review of Designs for Haptic Data Visualization.

PubMed

Paneels, Sabrina; Roberts, Jonathan C

2010-01-01

There are many different uses for haptics, such as training medical practitioners, teleoperation, or navigation of virtual environments. This review focuses on haptic methods that display data. The hypothesis is that haptic devices can be used to present information, and consequently, the user gains quantitative, qualitative, or holistic knowledge about the presented data. Not only is this useful for users who are blind or partially sighted (who can feel line graphs, for instance), but also the haptic modality can be used alongside other modalities, to increase the amount of variables being presented, or to duplicate some variables to reinforce the presentation. Over the last 20 years, a significant amount of research has been done in haptic data presentation; e.g., researchers have developed force feedback line graphs, bar charts, and other forms of haptic representations. However, previous research is published in different conferences and journals, with different application emphases. This paper gathers and collates these various designs to provide a comprehensive review of designs for haptic data visualization. The designs are classified by their representation: Charts, Maps, Signs, Networks, Diagrams, Images, and Tables. This review provides a comprehensive reference for researchers and learners, and highlights areas for further research.

Interacting particle systems on graphs

NASA Astrophysics Data System (ADS)

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

Some Applications of Graph Theory to Clustering

ERIC Educational Resources Information Center

Hubert, Lawrence J.

1974-01-01

The connection between graph theory and clustering is reviewed and extended. Major emphasis is on restating, in a graph-theoretic context, selected past work in clustering, and conversely, developing alternative strategies from several standard concepts used in graph theory per se. (Author/RC)

On the 2-Extendability of Planar Graphs

DTIC Science & Technology

1989-01-01

connectivity for n-extend- ability of regular graphs, 1988, submitted. [6] L. Lov~isz and M.D. Plummer, Matching Theory, Ann. Discrete Math . 29, North...Holland, Amsterdam, 1986. [7] M.D. Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. [8] M.D. Plummer, A theorem on matchings in the...plane, Graph Theory in Memory of G.A. Dirac, Ann. Discrete Math . 41, North-Holland, Amsterdam, 1989, 347-354. [9] C. Thomassen, Girth in graphs, J

On the local edge antimagicness of m-splitting graphs

NASA Astrophysics Data System (ADS)

Albirri, E. R.; Dafik; Slamin; Agustin, I. H.; Alfarisi, R.

2018-04-01

Let G be a connected and simple graph. A split graph is a graph derived by adding new vertex v‧ in every vertex v‧ such that v‧ adjacent to v in graph G. An m-splitting graph is a graph which has m v‧-vertices, denoted by mSpl(G). A local edge antimagic coloring in G = (V, E) graph is a bijection f:V (G)\\to \\{1,2,3,\\ldots,|V(G)|\\} in which for any two adjacent edges e 1 and e 2 satisfies w({e}1)\

Graph cuts via l1 norm minimization.

PubMed

Bhusnurmath, Arvind; Taylor, Camillo J

2008-10-01

Graph cuts have become an increasingly important tool for solving a number of energy minimization problems in computer vision and other fields. In this paper, the graph cut problem is reformulated as an unconstrained l1 norm minimization that can be solved effectively using interior point methods. This reformulation exposes connections between the graph cuts and other related continuous optimization problems. Eventually the problem is reduced to solving a sequence of sparse linear systems involving the Laplacian of the underlying graph. The proposed procedure exploits the structure of these linear systems in a manner that is easily amenable to parallel implementations. Experimental results obtained by applying the procedure to graphs derived from image processing problems are provided.

Disease management research using event graphs.

PubMed

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.

A Visual Evaluation Study of Graph Sampling Techniques

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

Zhang, Fangyan; Zhang, Song; Wong, Pak C.

2017-01-29

We evaluate a dozen prevailing graph-sampling techniques with an ultimate goal to better visualize and understand big and complex graphs that exhibit different properties and structures. The evaluation uses eight benchmark datasets with four different graph types collected from Stanford Network Analysis Platform and NetworkX to give a comprehensive comparison of various types of graphs. The study provides a practical guideline for visualizing big graphs of different sizes and structures. The paper discusses results and important observations from the study.

Visual mining business service using pixel bar charts

NASA Astrophysics Data System (ADS)

Hao, Ming C.; Dayal, Umeshwar; Casati, Fabio

2004-06-01

Basic bar charts have been commonly available, but they only show highly aggregated data. Finding the valuable information hidden in the data is essential to the success of business. We describe a new visualization technique called pixel bar charts, which are derived from regular bar charts. The basic idea of a pixel bar chart is to present all data values directly instead of aggregating them into a few data values. Pixel bar charts provide data distribution and exceptions besides aggregated data. The approach is to represent each data item (e.g. a business transaction) by a single pixel in the bar chart. The attribute of each data item is encoded into the pixel color and can be accessed and drilled down to the detail information as needed. Different color mappings are used to represent multiple attributes. This technique has been prototyped in three business service applications-Business Operation Analysis, Sales Analysis, and Service Level Agreement Analysis at Hewlett Packard Laboratories. Our applications show the wide applicability and usefulness of this new idea.

The Kirchhoff Index of Quasi-Tree Graphs

NASA Astrophysics Data System (ADS)

Xu, Kexiang; Liu, Hongshuang; Das, Kinkar Ch.

2015-03-01

Resistance distance was introduced by Klein and Randić as a generalisation of the classical distance. The Kirchhoff index Kf(G) of a graph G is the sum of resistance distances between all unordered pairs of vertices. In this article we characterise the extremal graphs with the maximal Kirchhoff index among all non-trivial quasi-tree graphs of order n. Moreover, we obtain a lower bound on the Kirchhoff index for all non-trivial quasi-tree graphs of order n.

Measuring Two-Event Structural Correlations on Graphs

DTIC Science & Technology

2012-08-01

2012 to 00-00-2012 4. TITLE AND SUBTITLE Measuring Two-Event Structural Correlations on Graphs 5a. CONTRACT NUMBER 5b. GRANT NUMBER 5c. PROGRAM ...by event simulation on the DBLP graph. Then we examine the efficiency and scala - bility of the framework with a Twitter network. The third part of...correlation pattern mining for large graphs. In Proc. of the 8th Workshop on Mining and Learning with Graphs, pages 119–126, 2010. [23] T. Smith. A

Flying through Graphs: An Introduction to Graph Theory.

ERIC Educational Resources Information Center

McDuffie, Amy Roth

2001-01-01

Presents an activity incorporating basic terminology, concepts, and solution methods of graph theory in the context of solving problems related to air travel. Discusses prerequisite knowledge and resources and includes a teacher's guide with a student worksheet. (KHR)

Convergence of the Graph Allen-Cahn Scheme

NASA Astrophysics Data System (ADS)

Luo, Xiyang; Bertozzi, Andrea L.

2017-05-01

The graph Laplacian and the graph cut problem are closely related to Markov random fields, and have many applications in clustering and image segmentation. The diffuse interface model is widely used for modeling in material science, and can also be used as a proxy to total variation minimization. In Bertozzi and Flenner (Multiscale Model Simul 10(3):1090-1118, 2012), an algorithm was developed to generalize the diffuse interface model to graphs to solve the graph cut problem. This work analyzes the conditions for the graph diffuse interface algorithm to converge. Using techniques from numerical PDE and convex optimization, monotonicity in function value and convergence under an a posteriori condition are shown for a class of schemes under a graph-independent stepsize condition. We also generalize our results to incorporate spectral truncation, a common technique used to save computation cost, and also to the case of multiclass classification. Various numerical experiments are done to compare theoretical results with practical performance.

Organization Charts in ARL Libraries. SPEC Kit #170.

ERIC Educational Resources Information Center

Association of Research Libraries, Washington, DC. Office of Management Studies.

This kit is based on a review of the organization charts of 71 member libraries of the Association of Research Libraries (ARL) gathered in January 1991, compared with an earlier SPEC Kit published in 1986, and contains charts of 29 of the libraries. A summary of the chart analyses presents information about the titles of library directors,…

Graph Drawing Aesthetics-Created by Users, Not Algorithms.

PubMed

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

2012-01-01

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

Measuring Graph Comprehension, Critique, and Construction in Science

NASA Astrophysics Data System (ADS)

Lai, Kevin; Cabrera, Julio; Vitale, Jonathan M.; Madhok, Jacquie; Tinker, Robert; Linn, Marcia C.

2016-08-01

Interpreting and creating graphs plays a critical role in scientific practice. The K-12 Next Generation Science Standards call for students to use graphs for scientific modeling, reasoning, and communication. To measure progress on this dimension, we need valid and reliable measures of graph understanding in science. In this research, we designed items to measure graph comprehension, critique, and construction and developed scoring rubrics based on the knowledge integration (KI) framework. We administered the items to over 460 middle school students. We found that the items formed a coherent scale and had good reliability using both item response theory and classical test theory. The KI scoring rubric showed that most students had difficulty linking graphs features to science concepts, especially when asked to critique or construct graphs. In addition, students with limited access to computers as well as those who speak a language other than English at home have less integrated understanding than others. These findings point to the need to increase the integration of graphing into science instruction. The results suggest directions for further research leading to comprehensive assessments of graph understanding.

Stocking chart for upland central hardwoods

Treesearch

Martin E. Dale; Donald E. Hilt

1989-01-01

The upland hardwoods stocking chart, introduced by Gingrich in 1967, has become one of the forest manager's most useful tools. The chart allows you to determine the condition of the present stand in relation to a stocking standard. The stocking of a stand is extremely helpful in prescribing various silvicultural treatments such as intermediate thinnings,...

Performance Charts for a Turbojet System

NASA Technical Reports Server (NTRS)

Karp, Irving M.

1947-01-01

Convenient charts are presented for computing the thrust, fuel consumption, and other performance values of a turbojet system. These charts take into account the effects of ram pressure, compressor pressure ratio, ratio of combustion-chamber-outlet temperature to atmospheric temperature, compressor efficiency, turbine efficiency, combustion efficiency, discharge-nozzle coefficient, losses in total pressure in the inlet to the jet-propulsion unit and in the combustion chamber, and variation in specific heats with temperature. The principal performance charts show clearly the effects of the primary variables and correction charts provide the effects of the secondary variables. The performance of illustrative cases of turbojet systems is given. It is shown that maximum thrust per unit mass rate of air flow occurs at a lower compressor pressure ratio than minimum specific fuel consumption. The thrust per unit mass rate of air flow increases as the combustion-chamber discharge temperature increases. For minimum specific fuel consumption, however, an optimum combustion-chamber discharge temperature exists, which in some cases may be less than the limiting temperature imposed by the strength temperature characteristics of present materials.

Exploring and Making Sense of Large Graphs

DTIC Science & Technology

2015-08-01

and bold) are n × n ; vectors (lower-case bold) are n × 1 column vectors, and scalars (in lower-case plain font) typically correspond to strength of...graph is often denoted as |V| or n . Edges or Links: A finite set E of lines between objects in a graph. The edges represent relationships between the...Adjacency matrix of a simple, unweighted and undirected graph. Adjacency matrix: The adjacency matrix of a graph G is an n × n matrix A, whose element aij

Some Recent Results on Graph Matching,

DTIC Science & Technology

1987-06-01

V. CHVATAL, Tough graphs and Hamiltonian circuits, Discrete Math . 5, 1973, 215-228. [El] J. EDMONDS, Paths, trees and flowers, Canad. J. Math. 17...Theory, Ann. Discrete Math . 29, North-Holland, Amsterdam, 1986. [N] D. NADDEF, Rank of maximum matchings in a graph, Math. Programming 22, 52-70. [NP...Optimization, Ann. Discrete Math . 16, North-Holland, Amsterdam, 1982, 241-260. [P1] M.D. PLUMMER, On n-extendable graphs, Discrete Math . 31, 1980, 201-210

Extending Matchings in Graphs: A Survey

DTIC Science & Technology

1990-01-01

private communication from, 1989. [11] D.A. Holton, D. Lou and M.D. Plummer, On the 2-extendability of planar graphs, Discrete Math ., (to appear). [12...222. [231 L. Lovasz and M.D. Plummer, Matching Theory, Ann. Discrete Math . 29, North- Holland, Amsterdam, 1986. [241 W.S. Massey, Algebraic Topology...Plummer, On n-extendable graphs, Discrete Math . 31, 1980, 201-210. [341 , Toughness and matching extension in graphs, Discrete Math . 72, 1988, 311-320

Color Charts, Esthetics, and Subjective Randomness

ERIC Educational Resources Information Center

Sanderson, Yasmine B.

2012-01-01

Color charts, or grids of evenly spaced multicolored dots or squares, appear in the work of modern artists and designers. Often the artist/designer distributes the many colors in a way that could be described as "random," that is, without an obvious pattern. We conduct a statistical analysis of 125 "random-looking" art and design color charts and…

Around the Sun in a Graphing Calculator.

ERIC Educational Resources Information Center

Demana, Franklin; Waits, Bert K.

1989-01-01

Discusses the use of graphing calculators for polar and parametric equations. Presents eight lines of the program for the graph of a parametric equation and 11 lines of the program for a graph of a polar equation. Illustrates the application of the programs for planetary motion and free-fall motion. (YP)

A PVS Graph Theory Library

NASA Technical Reports Server (NTRS)

Butler, Ricky W.; Sjogren, Jon A.

1998-01-01

This paper documents the NASA Langley PVS graph theory library. The library provides fundamental definitions for graphs, subgraphs, walks, paths, subgraphs generated by walks, trees, cycles, degree, separating sets, and four notions of connectedness. Theorems provided include Ramsey's and Menger's and the equivalence of all four notions of connectedness.

Mutual proximity graphs for improved reachability in music recommendation.

PubMed

Flexer, Arthur; Stevens, Jeff

2018-01-01

This paper is concerned with the impact of hubness, a general problem of machine learning in high-dimensional spaces, on a real-world music recommendation system based on visualisation of a k-nearest neighbour (knn) graph. Due to a problem of measuring distances in high dimensions, hub objects are recommended over and over again while anti-hubs are nonexistent in recommendation lists, resulting in poor reachability of the music catalogue. We present mutual proximity graphs, which are an alternative to knn and mutual knn graphs, and are able to avoid hub vertices having abnormally high connectivity. We show that mutual proximity graphs yield much better graph connectivity resulting in improved reachability compared to knn graphs, mutual knn graphs and mutual knn graphs enhanced with minimum spanning trees, while simultaneously reducing the negative effects of hubness.

A Visual Analytics Paradigm Enabling Trillion-Edge Graph Exploration

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

Wong, Pak C.; Haglin, David J.; Gillen, David S.

We present a visual analytics paradigm and a system prototype for exploring web-scale graphs. A web-scale graph is described as a graph with ~one trillion edges and ~50 billion vertices. While there is an aggressive R&D effort in processing and exploring web-scale graphs among internet vendors such as Facebook and Google, visualizing a graph of that scale still remains an underexplored R&D area. The paper describes a nontraditional peek-and-filter strategy that facilitates the exploration of a graph database of unprecedented size for visualization and analytics. We demonstrate that our system prototype can 1) preprocess a graph with ~25 billion edgesmore » in less than two hours and 2) support database query and visualization on the processed graph database afterward. Based on our computational performance results, we argue that we most likely will achieve the one trillion edge mark (a computational performance improvement of 40 times) for graph visual analytics in the near future.« less

Simple graph models of information spread in finite populations

PubMed Central

Voorhees, Burton; Ryder, Bergerud

2015-01-01

We consider several classes of simple graphs as potential models for information diffusion in a structured population. These include biases cycles, dual circular flows, partial bipartite graphs and what we call ‘single-link’ graphs. In addition to fixation probabilities, we study structure parameters for these graphs, including eigenvalues of the Laplacian, conductances, communicability and expected hitting times. In several cases, values of these parameters are related, most strongly so for partial bipartite graphs. A measure of directional bias in cycles and circular flows arises from the non-zero eigenvalues of the antisymmetric part of the Laplacian and another measure is found for cycles as the value of the transition probability for which hitting times going in either direction of the cycle are equal. A generalization of circular flow graphs is used to illustrate the possibility of tuning edge weights to match pre-specified values for graph parameters; in particular, we show that generalizations of circular flows can be tuned to have fixation probabilities equal to the Moran probability for a complete graph by tuning vertex temperature profiles. Finally, single-link graphs are introduced as an example of a graph involving a bottleneck in the connection between two components and these are compared to the partial bipartite graphs. PMID:26064661

Efficient dynamic graph construction for inductive semi-supervised learning.

PubMed

Dornaika, F; Dahbi, R; Bosaghzadeh, A; Ruichek, Y

2017-10-01

Most of graph construction techniques assume a transductive setting in which the whole data collection is available at construction time. Addressing graph construction for inductive setting, in which data are coming sequentially, has received much less attention. For inductive settings, constructing the graph from scratch can be very time consuming. This paper introduces a generic framework that is able to make any graph construction method incremental. This framework yields an efficient and dynamic graph construction method that adds new samples (labeled or unlabeled) to a previously constructed graph. As a case study, we use the recently proposed Two Phase Weighted Regularized Least Square (TPWRLS) graph construction method. The paper has two main contributions. First, we use the TPWRLS coding scheme to represent new sample(s) with respect to an existing database. The representative coefficients are then used to update the graph affinity matrix. The proposed method not only appends the new samples to the graph but also updates the whole graph structure by discovering which nodes are affected by the introduction of new samples and by updating their edge weights. The second contribution of the article is the application of the proposed framework to the problem of graph-based label propagation using multiple observations for vision-based recognition tasks. Experiments on several image databases show that, without any significant loss in the accuracy of the final classification, the proposed dynamic graph construction is more efficient than the batch graph construction. Copyright © 2017 Elsevier Ltd. All rights reserved.

Coloring geographical threshold graphs

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

Bradonjic, Milan; Percus, Allon; Muller, Tobias

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 analyzemore » 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.« less

Fixation probability on clique-based graphs

NASA Astrophysics Data System (ADS)

Choi, Jeong-Ok; Yu, Unjong

2018-02-01

The fixation probability of a mutant in the evolutionary dynamics of Moran process is calculated by the Monte-Carlo method on a few families of clique-based graphs. It is shown that the complete suppression of fixation can be realized with the generalized clique-wheel graph in the limit of small wheel-clique ratio and infinite size. The family of clique-star is an amplifier, and clique-arms graph changes from amplifier to suppressor as the fitness of the mutant increases. We demonstrate that the overall structure of a graph can be more important to determine the fixation probability than the degree or the heat heterogeneity. The dependence of the fixation probability on the position of the first mutant is discussed.

SU-D-BRD-01: An Automated Physics Weekly Chart Checking System Supporting ARIA

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

Chang, X; Yang, D

Purpose: A software tool was developed in this study to perform automatic weekly physics chart check on the patient data in ARIA. The tool accesses the electronic patient data directly from ARIA server and checks the accuracy of treatment deliveries, and generates reports which summarize the delivery history and highlight the errors. Methods: The tool has four modules. 1) The database interface is designed to directly access treatment delivery data from the ARIA database before reorganizing the data into the patient chart tree (PCT). 2) PCT is a core data structure designed to store and organize the data in logicalmore » hierarchies, and to be passed among functions. 3) The treatment data check module analyzes the organized data in PCT and stores the checking results into PCT. 4) Report generation module generates reports containing the treatment delivery summary, chart checking results and plots of daily treatment setup parameters (couch table positions, shifts of image guidance). The errors that are found by the tool are highlighted with colors. Results: The weekly check tool has been implemented in MATLAB and clinically tested at two major cancer centers. Javascript, cascading style sheets (CSS) and dynamic HTML were employed to create the user-interactive reports. It takes 0.06 second to search the delivery records of one beam with PCT and compare the delivery records with beam plan. The reports, saved in the HTML files on shared network folder, can be accessed by web browser on computers and mobile devices. Conclusion: The presented weekly check tool is useful to check the electronic patient treatment data in Varian ARIA system. It could be more efficient and reliable than the manually check by physicists. The work was partially supported by a research grant from Varian Medical System.« less

Partitioning sparse matrices with eigenvectors of graphs

NASA Technical Reports Server (NTRS)

Pothen, Alex; Simon, Horst D.; Liou, Kang-Pu

1990-01-01

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Graph wavelet alignment kernels for drug virtual screening.

PubMed

Smalter, Aaron; Huan, Jun; Lushington, Gerald

2009-06-01

In this paper, we introduce a novel statistical modeling technique for target property prediction, with applications to virtual screening and drug design. In our method, we use graphs to model chemical structures and apply a wavelet analysis of graphs to summarize features capturing graph local topology. We design a novel graph kernel function to utilize the topology features to build predictive models for chemicals via Support Vector Machine classifier. We call the new graph kernel a graph wavelet-alignment kernel. We have evaluated the efficacy of the wavelet-alignment kernel using a set of chemical structure-activity prediction benchmarks. Our results indicate that the use of the kernel function yields performance profiles comparable to, and sometimes exceeding that of the existing state-of-the-art chemical classification approaches. In addition, our results also show that the use of wavelet functions significantly decreases the computational costs for graph kernel computation with more than ten fold speedup.

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

PubMed

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

2009-01-01

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

Analyzing locomotion synthesis with feature-based motion graphs.

PubMed

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.

K-theory of locally finite graph C∗-algebras

NASA Astrophysics Data System (ADS)

Iyudu, Natalia

2013-09-01

We calculate the K-theory of the Cuntz-Krieger algebra OE associated with an infinite, locally finite graph, via the Bass-Hashimoto operator. The formulae we get express the Grothendieck group and the Whitehead group in purely graph theoretic terms. We consider the category of finite (black-and-white, bi-directed) subgraphs with certain graph homomorphisms and construct a continuous functor to abelian groups. In this category K0 is an inductive limit of K-groups of finite graphs, which were calculated in Cornelissen et al. (2008) [3]. In the case of an infinite graph with the finite Betti number we obtain the formula for the Grothendieck group K0(OE)=Z, where β(E) is the first Betti number and γ(E) is the valency number of the graph E. We note that in the infinite case the torsion part of K0, which is present in the case of a finite graph, vanishes. The Whitehead group depends only on the first Betti number: K1(OE)=Z. These allow us to provide a counterexample to the fact, which holds for finite graphs, that K1(OE) is the torsion free part of K0(OE).

Supporting Fourth Graders' Ability to Interpret Graphs through Real-Time Graphing Technology: A Preliminary Study

ERIC Educational Resources Information Center

Deniz, Hasan; Dulger, Mehmet F.

2012-01-01

This study examined to what extent inquiry-based instruction supported with real-time graphing technology improves fourth grader's ability to interpret graphs as representations of physical science concepts such as motion and temperature. This study also examined whether there is any difference between inquiry-based instruction supported with…

Reflections on High School Students' Graphing Skills and Their Conceptual Understanding of Drawing Chemistry Graphs

ERIC Educational Resources Information Center

Gültepe, Nejla

2016-01-01

Graphing subjects in chemistry has been used to provide alternatives to verbal and algorithmic descriptions of a subject by handing students another way of improving their manipulation of concepts. Teachers should therefore know the level of students' graphing skills. Studies have identified that students have difficulty making connections with…

Mutual proximity graphs for improved reachability in music recommendation

PubMed Central

Flexer, Arthur; Stevens, Jeff

2018-01-01

This paper is concerned with the impact of hubness, a general problem of machine learning in high-dimensional spaces, on a real-world music recommendation system based on visualisation of a k-nearest neighbour (knn) graph. Due to a problem of measuring distances in high dimensions, hub objects are recommended over and over again while anti-hubs are nonexistent in recommendation lists, resulting in poor reachability of the music catalogue. We present mutual proximity graphs, which are an alternative to knn and mutual knn graphs, and are able to avoid hub vertices having abnormally high connectivity. We show that mutual proximity graphs yield much better graph connectivity resulting in improved reachability compared to knn graphs, mutual knn graphs and mutual knn graphs enhanced with minimum spanning trees, while simultaneously reducing the negative effects of hubness. PMID:29348779

Horizontal visibility graphs generated by type-I intermittency

NASA Astrophysics Data System (ADS)

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

2013-05-01

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

Exact and approximate graph matching using random walks.

PubMed

Gori, Marco; Maggini, Marco; Sarti, Lorenzo

2005-07-01

In this paper, we propose a general framework for graph matching which is suitable for different problems of pattern recognition. The pattern representation we assume is at the same time highly structured, like for classic syntactic and structural approaches, and of subsymbolic nature with real-valued features, like for connectionist and statistic approaches. We show that random walk based models, inspired by Google's PageRank, give rise to a spectral theory that nicely enhances the graph topological features at node level. As a straightforward consequence, we derive a polynomial algorithm for the classic graph isomorphism problem, under the restriction of dealing with Markovian spectrally distinguishable graphs (MSD), a class of graphs that does not seem to be easily reducible to others proposed in the literature. The experimental results that we found on different test-beds of the TC-15 graph database show that the defined MSD class "almost always" covers the database, and that the proposed algorithm is significantly more efficient than top scoring VF algorithm on the same data. Most interestingly, the proposed approach is very well-suited for dealing with partial and approximate graph matching problems, derived for instance from image retrieval tasks. We consider the objects of the COIL-100 visual collection and provide a graph-based representation, whose node's labels contain appropriate visual features. We show that the adoption of classic bipartite graph matching algorithms offers a straightforward generalization of the algorithm given for graph isomorphism and, finally, we report very promising experimental results on the COIL-100 visual collection.

Chemical Applications of Graph Theory: Part II. Isomer Enumeration.

ERIC Educational Resources Information Center

Hansen, Peter J.; Jurs, Peter C.

1988-01-01

Discusses the use of graph theory to aid in the depiction of organic molecular structures. Gives a historical perspective of graph theory and explains graph theory terminology with organic examples. Lists applications of graph theory to current research projects. (ML)

Inaccurate Dental Charting in an Audit of 1128 General Dental Practice Records.

PubMed

Brown, Nathan L; Jephcote, Victoria E L

2017-03-01

Fourteen dentists at different practices in the UK assessed the dental charts of 1128 patients who were new to the dentist but not new to the practice; 44% of the dental charts were found to be inaccurate. Inaccuracy of the individual practice-based charts ranged between 16% for the best performing practices to 83% for the worst: 5% of dental charts had too many teeth charted and 5% had too few teeth charted; 13% of charts had missed amalgam restorations and 18% had missed tooth-coloured restorations; 5% of charts had amalgam restorations recorded but with the surfaces incorrect (eg an MO restoration charted but a DO restoration actually present); 9% of charts had tooth-coloured restoration surfaces incorrectly recorded. For 7.5% of charts, amalgams were charted but not actually present. Other inaccuracies were also noted. The authors reinforce the requirements of the GDC, the advice of defence organizations, and the forensic importance of accurate dental charts. Clinical relevance: Dental charting forms part of the patient’s dental records, and the GDC requires dentists to maintain complete and accurate dental records.

A distributed query execution engine of big attributed graphs.

PubMed

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.

Extension of Strongly Regular Graphs

DTIC Science & Technology

2008-02-11

E.R. van Dam, W.H. Haemers. Graphs with constant µ and µ. Discrete Math . 182 (1998), no. 1-3, 293–307. [11] E.R. van Dam, E. Spence. Small regular...graphs with four eigenvalues. Discrete Math . 189 (1998), 233-257. the electronic journal of combinatorics 15 (2008), #N3 5

Knowledge Representation Issues in Semantic Graphs for Relationship Detection

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

Barthelemy, M; Chow, E; Eliassi-Rad, T

2005-02-02

An important task for Homeland Security is the prediction of threat vulnerabilities, such as through the detection of relationships between seemingly disjoint entities. A structure used for this task is a ''semantic graph'', also known as a ''relational data graph'' or an ''attributed relational graph''. These graphs encode relationships as typed links between a pair of typed nodes. Indeed, semantic graphs are very similar to semantic networks used in AI. The node and link types are related through an ontology graph (also known as a schema). Furthermore, each node has a set of attributes associated with it (e.g., ''age'' maymore » be an attribute of a node of type ''person''). Unfortunately, the selection of types and attributes for both nodes and links depends on human expertise and is somewhat subjective and even arbitrary. This subjectiveness introduces biases into any algorithm that operates on semantic graphs. Here, we raise some knowledge representation issues for semantic graphs and provide some possible solutions using recently developed ideas in the field of complex networks. In particular, we use the concept of transitivity to evaluate the relevance of individual links in the semantic graph for detecting relationships. We also propose new statistical measures for semantic graphs and illustrate these semantic measures on graphs constructed from movies and terrorism data.« less

Spectral statistics of random geometric graphs

NASA Astrophysics Data System (ADS)

Dettmann, C. P.; Georgiou, O.; Knight, G.

2017-04-01

We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short-range correlations in the level spacings of the spectrum via the nearest-neighbour and next-nearest-neighbour spacing distribution and long-range correlations via the spectral rigidity Δ3 statistic. These correlations in the level spacings give information about localisation of eigenvectors, level of community structure and the level of randomness within the networks. We find a parameter-dependent transition between Poisson and Gaussian orthogonal ensemble statistics. That is the spectral statistics of spatial random geometric graphs fits the universality of random matrix theory found in other models such as Erdős-Rényi, Barabási-Albert and Watts-Strogatz random graphs.

A Weight-Adaptive Laplacian Embedding for Graph-Based Clustering.

PubMed

Cheng, De; Nie, Feiping; Sun, Jiande; Gong, Yihong

2017-07-01

Graph-based clustering methods perform clustering on a fixed input data graph. Thus such clustering results are sensitive to the particular graph construction. If this initial construction is of low quality, the resulting clustering may also be of low quality. We address this drawback by allowing the data graph itself to be adaptively adjusted in the clustering procedure. In particular, our proposed weight adaptive Laplacian (WAL) method learns a new data similarity matrix that can adaptively adjust the initial graph according to the similarity weight in the input data graph. We develop three versions of these methods based on the L2-norm, fuzzy entropy regularizer, and another exponential-based weight strategy, that yield three new graph-based clustering objectives. We derive optimization algorithms to solve these objectives. Experimental results on synthetic data sets and real-world benchmark data sets exhibit the effectiveness of these new graph-based clustering methods.

Simplified Approach Charts Improve Data Retrieval Performance

PubMed Central

Stewart, Michael; Laraway, Sean; Jordan, Kevin; Feary, Michael S.

2016-01-01

The effectiveness of different instrument approach charts to deliver minimum visibility and altitude information during airport equipment outages was investigated. Eighteen pilots flew simulated instrument approaches in three conditions: (a) normal operations using a standard approach chart (standard-normal), (b) equipment outage conditions using a standard approach chart (standard-outage), and (c) equipment outage conditions using a prototype decluttered approach chart (prototype-outage). Errors and retrieval times in identifying minimum altitudes and visibilities were measured. The standard-outage condition produced significantly more errors and longer retrieval times versus the standard-normal condition. The prototype-outage condition had significantly fewer errors and shorter retrieval times than did the standard-outage condition. The prototype-outage condition produced significantly fewer errors but similar retrieval times when compared with the standard-normal condition. Thus, changing the presentation of minima may reduce risk and increase safety in instrument approaches, specifically with airport equipment outages. PMID:28491009

Graph State-Based Quantum Group Authentication Scheme

NASA Astrophysics Data System (ADS)

Liao, Longxia; Peng, Xiaoqi; Shi, Jinjing; Guo, Ying

2017-02-01

Motivated by the elegant structure of the graph state, we design an ingenious quantum group authentication scheme, which is implemented by operating appropriate operations on the graph state and can solve the problem of multi-user authentication. Three entities, the group authentication server (GAS) as a verifier, multiple users as provers and the trusted third party Trent are included. GAS and Trent assist the multiple users in completing the authentication process, i.e., GAS is responsible for registering all the users while Trent prepares graph states. All the users, who request for authentication, encode their authentication keys on to the graph state by performing Pauli operators. It demonstrates that a novel authentication scheme can be achieved with the flexible use of graph state, which can synchronously authenticate a large number of users, meanwhile the provable security can be guaranteed definitely.

A Clustering Graph Generator

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

Winlaw, Manda; De Sterck, Hans; Sanders, Geoffrey

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 tomore » 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.« less

Bayesian and Phylogenic Approaches for Studying Relationships among Table Olive Cultivars.

PubMed

Ben Ayed, Rayda; Ennouri, Karim; Ben Amar, Fathi; Moreau, Fabienne; Triki, Mohamed Ali; Rebai, Ahmed

2017-08-01

To enhance table olive tree authentication, relationship, and productivity, we consider the analysis of 18 worldwide table olive cultivars (Olea europaea L.) based on morphological, biological, and physicochemical markers analyzed by bioinformatic and biostatistic tools. Accordingly, we assess the relationships between the studied varieties, on the one hand, and the potential productivity-quantitative parameter links on the other hand. The bioinformatic analysis based on the graphical representation of the matrix of Euclidean distances, the principal components analysis, unweighted pair group method with arithmetic mean, and principal coordinate analysis (PCoA) revealed three major clusters which were not correlated with the geographic origin. The statistical analysis based on Kendall's and Spearman correlation coefficients suggests two highly significant associations with both fruit color and pollinization and the productivity character. These results are confirmed by the multiple linear regression prediction models. In fact, based on the coefficient of determination (R 2 ) value, the best model demonstrated the power of the pollinization on the tree productivity (R 2  = 0.846). Moreover, the derived directed acyclic graph showed that only two direct influences are detected: effect of tolerance on fruit and stone symmetry on side and effect of tolerance on stone form and oil content on the other side. This work provides better understanding of the diversity available in worldwide table olive cultivars and supplies an important contribution for olive breeding and authenticity.

Mathematical Minute: Rotating a Function Graph

ERIC Educational Resources Information Center

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.

Scaling Semantic Graph Databases in Size and Performance

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

Morari, Alessandro; Castellana, Vito G.; Villa, Oreste

In this paper we present SGEM, a full software system for accelerating large-scale semantic graph databases on commodity clusters. Unlike current approaches, SGEM addresses semantic graph databases by only employing graph methods at all the levels of the stack. On one hand, this allows exploiting the space efficiency of graph data structures and the inherent parallelism of graph algorithms. These features adapt well to the increasing system memory and core counts of modern commodity clusters. On the other hand, however, these systems are optimized for regular computation and batched data transfers, while graph methods usually are irregular and generate fine-grainedmore » data accesses with poor spatial and temporal locality. Our framework comprises a SPARQL to data parallel C compiler, a library of parallel graph methods and a custom, multithreaded runtime system. We introduce our stack, motivate its advantages with respect to other solutions and show how we solved the challenges posed by irregular behaviors. We present the result of our software stack on the Berlin SPARQL benchmarks with datasets up to 10 billion triples (a triple corresponds to a graph edge), demonstrating scaling in dataset size and in performance as more nodes are added to the cluster.« less

47 CFR 73.699 - TV engineering charts.

Code of Federal Regulations, 2012 CFR

2012-10-01

... 47 Telecommunication 4 2012-10-01 2012-10-01 false TV engineering charts. 73.699 Section 73.699 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Television Broadcast Stations § 73.699 TV engineering charts. This section consists of the following Figures...

47 CFR 73.699 - TV engineering charts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... 47 Telecommunication 4 2010-10-01 2010-10-01 false TV engineering charts. 73.699 Section 73.699 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Television Broadcast Stations § 73.699 TV engineering charts. This section consists of the following Figures...

47 CFR 73.699 - TV engineering charts.

Code of Federal Regulations, 2011 CFR

2011-10-01

... 47 Telecommunication 4 2011-10-01 2011-10-01 false TV engineering charts. 73.699 Section 73.699 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Television Broadcast Stations § 73.699 TV engineering charts. This section consists of the following Figures...

47 CFR 73.699 - TV engineering charts.

Code of Federal Regulations, 2014 CFR

2014-10-01

... 47 Telecommunication 4 2014-10-01 2014-10-01 false TV engineering charts. 73.699 Section 73.699 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Television Broadcast Stations § 73.699 TV engineering charts. This section consists of the following Figures...

47 CFR 73.699 - TV engineering charts.

Code of Federal Regulations, 2013 CFR

2013-10-01

... 47 Telecommunication 4 2013-10-01 2013-10-01 false TV engineering charts. 73.699 Section 73.699 Telecommunication FEDERAL COMMUNICATIONS COMMISSION (CONTINUED) BROADCAST RADIO SERVICES RADIO BROADCAST SERVICES Television Broadcast Stations § 73.699 TV engineering charts. This section consists of the following Figures...

Charts designate probable future oceanographic research fields

NASA Technical Reports Server (NTRS)

1968-01-01

Charts outline the questions and problems of oceanographic research in the future. NASA uses the charts to estimate the probable requirements for instrumentation carried by satellites engaged in cooperative programs with other agencies concerned with identification, analysis, and solution of many of these problems.

Collaborative Robotic Instruction: A Graph Teaching Experience

ERIC Educational Resources Information Center

Mitnik, Ruben; Recabarren, Matias; Nussbaum, Miguel; Soto, Alvaro

2009-01-01

Graphing is a key skill in the study of Physics. Drawing and interpreting graphs play a key role in the understanding of science, while the lack of these has proved to be a handicap and a limiting factor in the learning of scientific concepts. It has been observed that despite the amount of previous graph-working experience, students of all ages…

Control chart applications in healthcare: a literature review

NASA Astrophysics Data System (ADS)

Suman, Gaurav; Prajapati, DeoRaj

2018-05-01

The concept of Statistical process control (SPC) was given by the physicist Walter Shewhart in order to improve the industrial manufacturing. The SPC was firstly applied in laboratory and after then shifted to patient level in hospitals. As there is more involvement of human in healthcare, the chances of errors are also more. SPC i.e., control chart can help in determining the source of errors by identifying the special and common causes of variations. This paper presents the review of literature on the application of SPC and control chart in healthcare sector. Forty articles are selected out of 142 potentially relevant searched studies. Selected studies are categorised into eight departments. Literature survey shows that most of work on control chart applications in healthcare is carried out in Surgery, Emergency and Epidemiology departments. US, UK and Australia are the main customers where maximum amount of work was done. The US is the country where control chart in healthcare sector have been used at regular interval. This shows the gap of deploying control chart in different departments and different countries as well. The CUSUM and EWMA chart came into picture in healthcare sector after 2008 and are used at regular interval.

Young Children Communicate with Graphs

ERIC Educational Resources Information Center

Cathcart, W. George

1978-01-01

Graphing is an integrative skill because you can use it whether you are teaching measurement or geometry or number theory or most any other topic. It is also important as a mode of communication which can simplify a large amount of information. Here are five steps for effective presentation of graphing to young students. (Author/RK)

Do parents understand growth charts? A national, Internet-based survey.

PubMed

Ben-Joseph, Elana Pearl; Dowshen, Steven A; Izenberg, Neil

2009-10-01

The objective of this study was to assess parental knowledge and understanding of growth charts. An online survey was conducted with 1000 parents selected to be demographically representative of the US population. Questions explored awareness of, knowledge of, and attitudes toward growth monitoring, as well as the ability to interpret growth chart data. Seventy-nine percent of parents surveyed claimed to have seen a growth chart before, with the majority thinking that they understood it well. Sixty-four percent of parents thought it was important to be shown growth charts to see how their child was growing, and 40% expressed the need to see their child's growth chart as confirmation of their health care provider's verbal interpretation. However, when provided with multiple-choice questions and answers, only 64% could identify a child's weight when shown a plotted point on a growth chart. Ninety-six percent had heard of the term "percentile," but only 68% identified the percentile of the plotted point, and only 56% could identify the definition of percentile. Up to 77% interpreted incorrectly charts containing height/weight measurements in tandem. Although growth charts are used frequently as visual aids to educate parents about their children's growth, many parents cannot comprehend the data. This finding is significant because many parents prefer to be shown growth charts by their health care provider, and many parents report recording their children's measurements on growth charts at home.

Tactile Acuity Charts: A Reliable Measure of Spatial Acuity

PubMed Central

Bruns, Patrick; Camargo, Carlos J.; Campanella, Humberto; Esteve, Jaume; Dinse, Hubert R.; Röder, Brigitte

2014-01-01

For assessing tactile spatial resolution it has recently been recommended to use tactile acuity charts which follow the design principles of the Snellen letter charts for visual acuity and involve active touch. However, it is currently unknown whether acuity thresholds obtained with this newly developed psychophysical procedure are in accordance with established measures of tactile acuity that involve passive contact with fixed duration and control of contact force. Here we directly compared tactile acuity thresholds obtained with the acuity charts to traditional two-point and grating orientation thresholds in a group of young healthy adults. For this purpose, two types of charts, using either Braille-like dot patterns or embossed Landolt rings with different orientations, were adapted from previous studies. Measurements with the two types of charts were equivalent, but generally more reliable with the dot pattern chart. A comparison with the two-point and grating orientation task data showed that the test-retest reliability of the acuity chart measurements after one week was superior to that of the passive methods. Individual thresholds obtained with the acuity charts agreed reasonably with the grating orientation threshold, but less so with the two-point threshold that yielded relatively distinct acuity estimates compared to the other methods. This potentially considerable amount of mismatch between different measures of tactile acuity suggests that tactile spatial resolution is a complex entity that should ideally be measured with different methods in parallel. The simple test procedure and high reliability of the acuity charts makes them a promising complement and alternative to the traditional two-point and grating orientation thresholds. PMID:24504346

Labeled Graph Kernel for Behavior Analysis.

PubMed

Zhao, Ruiqi; Martinez, Aleix M

2016-08-01

Automatic behavior analysis from video is a major topic in many areas of research, including computer vision, multimedia, robotics, biology, cognitive science, social psychology, psychiatry, and linguistics. Two major problems are of interest when analyzing behavior. First, we wish to automatically categorize observed behaviors into a discrete set of classes (i.e., classification). For example, to determine word production from video sequences in sign language. Second, we wish to understand the relevance of each behavioral feature in achieving this classification (i.e., decoding). For instance, to know which behavior variables are used to discriminate between the words apple and onion in American Sign Language (ASL). The present paper proposes to model behavior using a labeled graph, where the nodes define behavioral features and the edges are labels specifying their order (e.g., before, overlaps, start). In this approach, classification reduces to a simple labeled graph matching. Unfortunately, the complexity of labeled graph matching grows exponentially with the number of categories we wish to represent. Here, we derive a graph kernel to quickly and accurately compute this graph similarity. This approach is very general and can be plugged into any kernel-based classifier. Specifically, we derive a Labeled Graph Support Vector Machine (LGSVM) and a Labeled Graph Logistic Regressor (LGLR) that can be readily employed to discriminate between many actions (e.g., sign language concepts). The derived approach can be readily used for decoding too, yielding invaluable information for the understanding of a problem (e.g., to know how to teach a sign language). The derived algorithms allow us to achieve higher accuracy results than those of state-of-the-art algorithms in a fraction of the time. We show experimental results on a variety of problems and datasets, including multimodal data.

Evolutionary graph theory: breaking the symmetry between interaction and replacement

PubMed Central

Ohtsuki, Hisashi; Pacheco, Jorge M.; Nowak, Martin A.

2008-01-01

We study evolutionary dynamics in a population whose structure is given by two graphs: the interaction graph determines who plays with whom in an evolutionary game; the replacement graph specifies the geometry of evolutionary competition and updating. First, we calculate the fixation probabilities of frequency dependent selection between two strategies or phenotypes. We consider three different update mechanisms: birth-death, death-birth and imitation. Then, as a particular example, we explore the evolution of cooperation. Suppose the interaction graph is a regular graph of degree h, the replacement graph is a regular graph of degree g and the overlap between the two graphs is a regular graph of degree l. We show that cooperation is favored by natural selection if b/c > hg/l. Here, b and c denote the benefit and cost of the altruistic act. This result holds for death-birth updating, weak selection and large population size. Note that the optimum population structure for cooperators is given by maximum overlap between the interaction and the replacement graph (g = h = l), which means that the two graphs are identical. We also prove that a modified replicator equation can describe how the expected values of the frequencies of an arbitrary number of strategies change on replacement and interaction graphs: the two graphs induce a transformation of the payoff matrix. PMID:17350049

21 CFR 870.2810 - Paper chart recorder.

Code of Federal Regulations, 2011 CFR

2011-04-01

... 21 Food and Drugs 8 2011-04-01 2011-04-01 false Paper chart recorder. 870.2810 Section 870.2810 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES CARDIOVASCULAR DEVICES Cardiovascular Monitoring Devices § 870.2810 Paper chart recorder...

21 CFR 870.2810 - Paper chart recorder.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Paper chart recorder. 870.2810 Section 870.2810 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES CARDIOVASCULAR DEVICES Cardiovascular Monitoring Devices § 870.2810 Paper chart recorder...

46 CFR 232.3 - Chart of accounts.

Code of Federal Regulations, 2011 CFR

2011-10-01

... UNIFORM FINANCIAL REPORTING REQUIREMENTS § 232.3 Chart of accounts. (a) Purpose of accounts. A contractor shall use this chart of accounts as a guide for preparing the financial statements and for other required financial reports required to be submitted to the Maritime Administration. However, whenever there...

Growth Charts for Children With Down Syndrome in the United States.

PubMed

Zemel, Babette S; Pipan, Mary; Stallings, Virginia A; Hall, Waynitra; Schadt, Kim; Freedman, David S; Thorpe, Phoebe

2015-11-01

Children with Down syndrome (DS) have lower birth weights and grow more slowly than children without DS. Advances in and increased access to medical care have improved the health and well-being of individuals with DS; however, it is unknown whether their growth has also improved. Our objective was to develop new growth charts for children with DS and compare them to older charts from the United States and more contemporary charts from the United Kingdom. The Down Syndrome Growing Up Study (DSGS) enrolled a convenience sample of children with DS up to 20 years of age and followed them longitudinally. Growth parameters were measured by research anthropometrists. Sex-specific growth charts were generated for the age ranges birth to 36 months and 2 to 20 years using the LMS method. Weight-for-length and BMI charts were also generated. Comparisons with other curves were presented graphically. New DSGS growth charts were developed by using 1520 measurements on 637 participants. DSGS growth charts for children <36 months of age showed marked improvements in weight compared with older US charts. DSGS charts for 2- to 20-year-olds showed that contemporary males are taller than previous charts showed. Generally, the DSGS growth charts are similar to the UK charts. The DSGS growth charts can be used as screening tools to assess growth and nutritional status and to provide indications of how growth of an individual child compares with peers of the same age and sex with DS. Copyright © 2015 by the American Academy of Pediatrics.

Growth Charts for Children With Down Syndrome in the United States

PubMed Central

Zemel, Babette S.; Pipan, Mary; Stallings, Virginia A.; Hall, Waynitra; Schadt, Kim; Freedman, David S.; Thorpe, Phoebe

2017-01-01

BACKGROUND AND OBJECTIVES Children with Down syndrome (DS) have lower birth weights and grow more slowly than children without DS. Advances in and increased access to medical care have improved the health and well-being of individuals with DS; however, it is unknown whether their growth has also improved. Our objective was to develop new growth charts for children with DS and compare them to older charts from the United States and more contemporary charts from the United Kingdom. METHODS The Down Syndrome Growing Up Study (DSGS) enrolled a convenience sample of children with DS up to 20 years of age and followed them longitudinally. Growth parameters were measured by research anthropometrists. Sex-specific growth charts were generated for the age ranges birth to 36 months and 2 to 20 years using the LMS method. Weight-for-length and BMI charts were also generated. Comparisons with other curves were presented graphically. RESULTS New DSGS growth charts were developed by using 1520 measurements on 637 participants. DSGS growth charts for children <36 months of age showed marked improvements in weight compared with older US charts. DSGS charts for 2- to 20-year-olds showed that contemporary males are taller than previous charts showed. Generally, the DSGS growth charts are similar to the UK charts. CONCLUSIONS The DSGS growth charts can be used as screening tools to assess growth and nutritional status and to provide indications of how growth of an individual child compares with peers of the same age and sex with DS. PMID:26504127

Approximate Computing Techniques for Iterative Graph Algorithms

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

Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh

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 lowmore » 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.« less

AND/OR graph representation of assembly plans

NASA Astrophysics Data System (ADS)

Homem de Mello, Luiz S.; Sanderson, Arthur C.

1990-04-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

AND/OR graph representation of assembly plans

NASA Technical Reports Server (NTRS)

Homem De Mello, Luiz S.; Sanderson, Arthur C.

1990-01-01

A compact representation of all possible assembly plans of a product using AND/OR graphs is presented as a basis for efficient planning algorithms that allow an intelligent robot to pick a course of action according to instantaneous conditions. The AND/OR graph is equivalent to a state transition graph but requires fewer nodes and simplifies the search for feasible plans. Three applications are discussed: (1) the preselection of the best assembly plan, (2) the recovery from execution errors, and (3) the opportunistic scheduling of tasks. An example of an assembly with four parts illustrates the use of the AND/OR graph representation in assembly-plan preselection, based on the weighting of operations according to complexity of manipulation and stability of subassemblies. A hypothetical error situation is discussed to show how a bottom-up search of the AND/OR graph leads to an efficient recovery.

What energy functions can be minimized via graph cuts?

PubMed

Kolmogorov, Vladimir; Zabih, Ramin

2004-02-01

In the last few years, several new algorithms based on graph cuts have been developed to solve energy minimization problems in computer vision. Each of these techniques constructs a graph such that the minimum cut on the graph also minimizes the energy. Yet, because these graph constructions are complex and highly specific to a particular energy function, graph cuts have seen limited application to date. In this paper, we give a characterization of the energy functions that can be minimized by graph cuts. Our results are restricted to functions of binary variables. However, our work generalizes many previous constructions and is easily applicable to vision problems that involve large numbers of labels, such as stereo, motion, image restoration, and scene reconstruction. We give a precise characterization of what energy functions can be minimized using graph cuts, among the energy functions that can be written as a sum of terms containing three or fewer binary variables. We also provide a general-purpose construction to minimize such an energy function. Finally, we give a necessary condition for any energy function of binary variables to be minimized by graph cuts. Researchers who are considering the use of graph cuts to optimize a particular energy function can use our results to determine if this is possible and then follow our construction to create the appropriate graph. A software implementation is freely available.

Flexibility in data interpretation: effects of representational format.

PubMed

Braithwaite, David W; Goldstone, Robert L

2013-01-01

Graphs and tables differentially support performance on specific tasks. For tasks requiring reading off single data points, tables are as good as or better than graphs, while for tasks involving relationships among data points, graphs often yield better performance. However, the degree to which graphs and tables support flexibility across a range of tasks is not well-understood. In two experiments, participants detected main and interaction effects in line graphs and tables of bivariate data. Graphs led to more efficient performance, but also lower flexibility, as indicated by a larger discrepancy in performance across tasks. In particular, detection of main effects of variables represented in the graph legend was facilitated relative to detection of main effects of variables represented in the x-axis. Graphs may be a preferable representational format when the desired task or analytical perspective is known in advance, but may also induce greater interpretive bias than tables, necessitating greater care in their use and design.

Flexibility in data interpretation: effects of representational format

PubMed Central

Braithwaite, David W.; Goldstone, Robert L.

2013-01-01

Graphs and tables differentially support performance on specific tasks. For tasks requiring reading off single data points, tables are as good as or better than graphs, while for tasks involving relationships among data points, graphs often yield better performance. However, the degree to which graphs and tables support flexibility across a range of tasks is not well-understood. In two experiments, participants detected main and interaction effects in line graphs and tables of bivariate data. Graphs led to more efficient performance, but also lower flexibility, as indicated by a larger discrepancy in performance across tasks. In particular, detection of main effects of variables represented in the graph legend was facilitated relative to detection of main effects of variables represented in the x-axis. Graphs may be a preferable representational format when the desired task or analytical perspective is known in advance, but may also induce greater interpretive bias than tables, necessitating greater care in their use and design. PMID:24427145

Sequential visibility-graph motifs

NASA Astrophysics Data System (ADS)

Iacovacci, Jacopo; Lacasa, Lucas

2016-04-01

Visibility algorithms transform time series into graphs and encode dynamical information in their topology, paving the way for graph-theoretical time series analysis as well as building a bridge between nonlinear dynamics and network science. In this work we introduce and study the concept of sequential visibility-graph motifs, smaller substructures of n consecutive nodes that appear with characteristic frequencies. We develop a theory to compute in an exact way the motif profiles associated with general classes of deterministic and stochastic dynamics. We find that this simple property is indeed a highly informative and computationally efficient feature capable of distinguishing among different dynamics and robust against noise contamination. We finally confirm that it can be used in practice to perform unsupervised learning, by extracting motif profiles from experimental heart-rate series and being able, accordingly, to disentangle meditative from other relaxation states. Applications of this general theory include the automatic classification and description of physical, biological, and financial time series.

Graphing as a Problem-Solving Strategy.

ERIC Educational Resources Information Center

Cohen, Donald

1984-01-01

The focus is on how line graphs can be used to approximate solutions to rate problems and to suggest equations that offer exact algebraic solutions to the problem. Four problems requiring progressively greater graphing sophistication are presented plus four exercises. (MNS)

46 CFR 232.3 - Chart of accounts.

Code of Federal Regulations, 2010 CFR

2010-10-01

... stated in any revision to generally accepted accounting principles, the meaning of the latter shall... UNIFORM FINANCIAL REPORTING REQUIREMENTS § 232.3 Chart of accounts. (a) Purpose of accounts. A contractor shall use this chart of accounts as a guide for preparing the financial statements and for other...

21 CFR 886.1150 - Visual acuity chart.

Code of Federal Regulations, 2010 CFR

2010-04-01

... 21 Food and Drugs 8 2010-04-01 2010-04-01 false Visual acuity chart. 886.1150 Section 886.1150 Food and Drugs FOOD AND DRUG ADMINISTRATION, DEPARTMENT OF HEALTH AND HUMAN SERVICES (CONTINUED) MEDICAL DEVICES OPHTHALMIC DEVICES Diagnostic Devices § 886.1150 Visual acuity chart. (a) Identification...

2-Extendability in Two Classes of Claw-Free Graphs

DTIC Science & Technology

1992-01-01

extendability of planar graphs, Discrete Math ., 96, 1991, 81-99. [Lai M. Las Verguas, A note on matchings in graphs, Colloque sur la Thiorie des Graphes...43, 1987, 187-222. [LP L. Loviss and M.D. Plummet, Matching Theory, Ann. Discrete Math . 29, North-Holland, Amsterdam, 1986. [P11 M.D. Plummer, On n...extendable graphs, Discrete Math . 31, 1960, 201-210. [P21 Extending matchinp in planar graphs IV, Proc. of the Conference in honor of Cert Sabidussi, Ann

The Use of Flow Charts in Sediment Routing Analysis

Treesearch

Leslie M. Reid

1982-01-01

Flow charts are a widely used means of diagramming relationships among transport processes and storage sites during analyses of sediment routing. Because they have taken so many different forms, however, it is very difficult to use published flow charts to compare geomorphic systems. Though they generally are constructed to achieve the same purpose, flow charts...

75 FR 11225 - Government/Industry Aeronautical Charting Forum Meeting

Federal Register 2010, 2011, 2012, 2013, 2014

2010-03-10

... Charting Forum Meeting AGENCY: Federal Aviation Administration (FAA), DOT. ACTION: Notice of public meeting...) Government/Industry Aeronautical Charting Forum (ACF 10-01) to discuss informational content and design of... Aeronautical Charting Forum to be held from April 27 through April 29, 2010 from 8:30 a.m. to 5 p.m. at the Air...

Adherence to the Australian National Inpatient Medication Chart: the efficacy of a uniform national drug chart on improving prescription error.

PubMed

Atik, Alp

2013-10-01

In 2006, the National Inpatient Medication Chart (NIMC) was introduced as a uniform medication chart in Australian public hospitals with the aim of reducing prescription error. The rate of regular medication prescription error in the NIMC was assessed. Data was collected using the NIMC Audit Tool and analyzed with respect to causes of error per medication prescription and per medication chart. The following prescription requirements were assessed: date, generic drug name, route of administration, dose, frequency, administration time, indication, signature, name and contact details. A total of 1877 medication prescriptions were reviewed. 1653 prescriptions (88.07%) had no contact number, 1630 (86.84%) did not have an indication, 1230 and 675 (35.96%) used a drug's trade name. Within 261 medication charts, all had at least one entry, which did not include an indication, 258 (98.85%) had at least one entry, which did not have a contact number and 200 (76.63%) had at least one entry, which used a trade name. The introduction of a uniform national medication chart is a positive step, but more needs to be done to address the root causes of prescription error. © 2012 John Wiley & Sons Ltd.

DELTACON: A Principled Massive-Graph Similarity Function with Attribution

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

Koutra, Danai; Shah, Neil; Vogelstein, Joshua T.

How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known node correspondence, i.e. the detection of changes in the connectivity of graphs, arises in numerous settings. In this work, we formally state the axioms and desired properties of the graph similarity functions, and evaluate when state-of-the-art methods fail to detect crucial connectivity changes in graphs. We propose DeltaCon, a principled, intuitive, and scalable algorithm that assesses the similarity between two graphs on the same nodes (e.g. employees of a company, customersmore » of a mobile carrier). In our experiments on various synthetic and real graphs we showcase the advantages of our method over existing similarity measures. We also employ DeltaCon to real applications: (a) we classify people to groups of high and low creativity based on their brain connectivity graphs, and (b) do temporal anomaly detection in the who-emails-whom Enron graph.« less

DELTACON: A Principled Massive-Graph Similarity Function with Attribution

DOE PAGES

Koutra, Danai; Shah, Neil; Vogelstein, Joshua T.; ...

2014-05-22

How much did a network change since yesterday? How different is the wiring between Bob's brain (a left-handed male) and Alice's brain (a right-handed female)? Graph similarity with known node correspondence, i.e. the detection of changes in the connectivity of graphs, arises in numerous settings. In this work, we formally state the axioms and desired properties of the graph similarity functions, and evaluate when state-of-the-art methods fail to detect crucial connectivity changes in graphs. We propose DeltaCon, a principled, intuitive, and scalable algorithm that assesses the similarity between two graphs on the same nodes (e.g. employees of a company, customersmore » of a mobile carrier). In our experiments on various synthetic and real graphs we showcase the advantages of our method over existing similarity measures. We also employ DeltaCon to real applications: (a) we classify people to groups of high and low creativity based on their brain connectivity graphs, and (b) do temporal anomaly detection in the who-emails-whom Enron graph.« less

33 CFR 164.33 - Charts and publications.

Code of Federal Regulations, 2013 CFR

2013-07-01

... 33 Navigation and Navigable Waters 2 2013-07-01 2013-07-01 false Charts and publications. 164.33...) PORTS AND WATERWAYS SAFETY NAVIGATION SAFETY REGULATIONS § 164.33 Charts and publications. (a) Each... extract from, each of the following publications: (i) U.S. Coast Pilot. (ii) Coast Guard Light List. (3...

Structure and strategy in encoding simplified graphs

NASA Technical Reports Server (NTRS)

Schiano, Diane J.; Tversky, Barbara

1992-01-01

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

Dental Charting. Learning Activities, Unit Tests, Progress Chart, and Work Sheet.

ERIC Educational Resources Information Center

Texas Univ., Austin. Center for Occupational Curriculum Development.

These materials are part of a series dealing with skills and information needed by students in dental assisting. The individualized student materials are suitable for classroom, laboratory, or cooperative training programs. These student materials, designed to be used with the Dental Charting Student Manual, consist of learning activities, unit…

Clinical user experiences of observation and response charts: focus group findings of using a new format chart incorporating a track and trigger system.

PubMed

Elliott, Doug; Allen, Emily; Perry, Lin; Fry, Margaret; Duffield, Christine; Gallagher, Robyn; Iedema, Rick; McKinley, Sharon; Roche, Michael

2015-01-01

Optimising clinical responses to deteriorating patients is an international indicator of acute healthcare quality. Observation charts incorporating track and trigger systems are an initiative to improve early identification and response to clinical deterioration. A suite of track and trigger 'Observation and Response Charts' were designed in Australia and initially tested in simulated environments. This paper reports initial clinical user experiences and views following implementation of these charts in adult general medical-surgical wards. Across eight trial sites, 44 focus groups were conducted with 218 clinical ward staff, mostly nurses, who received training and had used the charts in routine clinical practice for the preceding 2-6 weeks. Transcripts of audio recordings were analysed for emergent themes using an inductive approach. In this exploration of initial user experiences, key emergent themes were: tensions between vital sign 'ranges versus precision' to support decision making; using a standardised 'generalist chart in a range of specialist practice' areas; issues of 'clinical credibility', 'professional autonomy' and 'influences of doctors' when communicating abnormal signs; and 'permission and autonomy' when escalating care according to the protocol. Across themes, participants presented a range of positive, negative or mixed views. Benefits were identified despite charts not always being used up to their optimal design function. Participants reported tensions between chart objectives and clinical practices, revealing mismatches between design characteristics and human staff experiences. Overall, an initial view of 'increased activity/uncertain benefit' was uncovered. Findings particularly reinforced the significant influences of organisational work-based cultures, disciplinary boundaries and interdisciplinary communication on implementation of this new practice chart. Optimal use of all chart design characteristics will be possible when these

The Millennium QUEST: Results of the Survey. Annual Staff Survey. Complete Set of Tables & Charts. Research Report Number 108.

ERIC Educational Resources Information Center

Livieratos, Barbara B.

This document provides a quick overview and set of detailed tables of the findings of the annual employee survey at Howard Community College (Maryland). The Quality Evaluation of Service Trends (QUEST) Survey affords all college employees the opportunity to give their assessment of college services, campus climate, job satisfaction, and college…

The growth rate of vertex-transitive planar graphs

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

Babai, L.

1997-06-01

A graph is vertex-transitive if all of its vertices axe equivalent under automorphisms. Confirming a conjecture of Jon Kleinberg and Eva Tardos, we prove the following trichotomy theorem concerning locally finite vertex-transitive planar graphs: the rate of growth of a graph with these properties is either linear or quadratic or exponential. The same result holds more generally for locally finite, almost vertex-transitive planar graphs (the automorphism group has a finite number of orbits). The proof uses the elements of hyperbolic plane geometry.

Student's Conceptions in Statistical Graph's Interpretation

ERIC Educational Resources Information Center

Kukliansky, Ida

2016-01-01

Histograms, box plots and cumulative distribution graphs are popular graphic representations for statistical distributions. The main research question that this study focuses on is how college students deal with interpretation of these statistical graphs when translating graphical representations into analytical concepts in descriptive statistics.…

Greenberger-Horne-Zeilinger paradoxes from qudit graph states.

PubMed

Tang, Weidong; Yu, Sixia; Oh, C H

2013-03-08

One fascinating way of revealing quantum nonlocality is the all-versus-nothing test due to Greenberger, Horne, and Zeilinger (GHZ) known as the GHZ paradox. So far genuine multipartite and multilevel GHZ paradoxes are known to exist only in systems containing an odd number of particles. Here we shall construct GHZ paradoxes for an arbitrary number (greater than 3) of particles with the help of qudit graph states on a special kind of graphs, called GHZ graphs. Furthermore, based on the GHZ paradox arising from a GHZ graph, we derive a Bell inequality with two d-outcome observables for each observer, whose maximal violation attained by the corresponding graph state, and a Kochen-Specker inequality testing the quantum contextuality in a state-independent fashion.

Panconnectivity of Locally Connected K(1,3)-Free Graphs

DTIC Science & Technology

1989-10-15

Graph Theory, 3 (1979) p. 351-356. 22 7. Cun-Quan Zhang, Cycles of Given Lengths in KI, 3-Free Graphs, Discrete Math ., (1988) to appear. I. f 2.f 𔃽. AA A V V / (S. ...Locally Connected and Hamiltonian-Connected Graphs, Isreal J. Math., 33 (1979) p. 5-8. 4. V. Chvatal and P. Erd6s, A Note on Hamiltonian Circuits, Discrete ... Math ., 2 (1972) p. 111-113. 5. S. V. Kanetkar and P. R. Rao, Connected and Locally 2- Connected, K1.3-Free Graphs are Panconnected, J. Graph Theory, 8

A Graph Based Interface for Representing Volume Visualization Results

NASA Technical Reports Server (NTRS)

Patten, James M.; Ma, Kwan-Liu

1998-01-01

This paper discusses a graph based user interface for representing the results of the volume visualization process. As images are rendered, they are connected to other images in a graph based on their rendering parameters. The user can take advantage of the information in this graph to understand how certain rendering parameter changes affect a dataset, making the visualization process more efficient. Because the graph contains more information than is contained in an unstructured history of images, the image graph is also helpful for collaborative visualization and animation.

NOUS: A Knowledge Graph Management System

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

Knowledge graphs represent information as entities and relationships between them. For tasks such as natural language question answering or automated analysis of text, a knowledge graph provides valuable context to establish the specific type of entities being discussed. It allow us to derive better context about newly arriving information and leads to intelligent reasoning capabilities. We address two primary needs: A) Automated construction of knowledge graphs is a technically challenging, expensive process; and B) The ability to synthesize new information by monitoring newly emerging knowledge is a transformational capability that does not exist in state of the art systems.

FGRAAL: FORTRAN extended graph algorithmic language

NASA Technical Reports Server (NTRS)

Basili, V. R.; Mesztenyi, C. K.; Rheinboldt, W. C.

1972-01-01

The FORTRAN version FGRAAL of the graph algorithmic language GRAAL as it has been implemented for the Univac 1108 is described. FBRAAL is an extension of FORTRAN 5 and is intended for describing and implementing graph algorithms of the type primarily arising in applications. The formal description contained in this report represents a supplement to the FORTRAN 5 manual for the Univac 1108 (UP-4060), that is, only the new features of the language are described. Several typical graph algorithms, written in FGRAAL, are included to illustrate various features of the language and to show its applicability.

Table and charts of equilibrium normal shock and shock tube properties for pure argon with velocities to 18 km/sec

NASA Technical Reports Server (NTRS)

Miller, C. G., III; Wilder, S. E.

1976-01-01

Equilibrium thermodynamic and flow properties are presented in tabulated and graphical form for moving, standing, and reflected normal shock waves in pure argon. Properties include pressure, temperature, density, enthalpy, speed of sound, entropy, molecular-weight ratio, isentropic exponent, velocity, and species mole fractions. Incident (moving) shock velocities are varied from 2 to 18 km/sec for a range of initial pressure of 5 N/sq m to 500 kN/sq m. Working charts illustrating shock tube performance with argon test gas and heated helium and hydrogen driver gases are also presented.

Do Graphs Promote Learning in Principles of Economics?

ERIC Educational Resources Information Center

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)

Lunar and planetary maps and charts available for public sale

NASA Technical Reports Server (NTRS)

1973-01-01

A catalog of lunar and planetary charts which are available from the U.S. Government Printing Office is presented. The charts are identified by the area of the lunar topology involved and the prices of each chart are shown.

Resistance Distances and Kirchhoff Index in Generalised Join Graphs

NASA Astrophysics Data System (ADS)

Chen, Haiyan

2017-03-01

The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. The Kirchhoff index of a graph is defined as the sum of all the resistance distances between any pair of vertices of the graph. Let G=H[G1, G2, …, Gk ] be the generalised join graph of G1, G2, …, Gk determined by H. In this paper, we first give formulae for resistance distances and Kirchhoff index of G in terms of parameters of {G'_i}s and H. Then, we show that computing resistance distances and Kirchhoff index of G can be decomposed into simpler ones. Finally, we obtain explicit formulae for resistance distances and Kirchhoff index of G when {G'_i}s and H take some special graphs, such as the complete graph, the path, and the cycle.

Composing Data Parallel Code for a SPARQL Graph Engine

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

Castellana, Vito G.; Tumeo, Antonino; Villa, Oreste

Big data analytics process large amount of data to extract knowledge from them. Semantic databases are big data applications that adopt the Resource Description Framework (RDF) to structure metadata through a graph-based representation. The graph based representation provides several benefits, such as the possibility to perform in memory processing with large amounts of parallelism. SPARQL is a language used to perform queries on RDF-structured data through graph matching. In this paper we present a tool that automatically translates SPARQL queries to parallel graph crawling and graph matching operations. The tool also supports complex SPARQL constructs, which requires more than basicmore » graph matching for their implementation. The tool generates parallel code annotated with OpenMP pragmas for x86 Shared-memory Multiprocessors (SMPs). With respect to commercial database systems such as Virtuoso, our approach reduces memory occupation due to join operations and provides higher performance. We show the scaling of the automatically generated graph-matching code on a 48-core SMP.« less

Learning locality preserving graph from data.

PubMed

Zhang, Yan-Ming; Huang, Kaizhu; Hou, Xinwen; Liu, Cheng-Lin

2014-11-01

Machine learning based on graph representation, or manifold learning, has attracted great interest in recent years. As the discrete approximation of data manifold, the graph plays a crucial role in these kinds of learning approaches. In this paper, we propose a novel learning method for graph construction, which is distinct from previous methods in that it solves an optimization problem with the aim of directly preserving the local information of the original data set. We show that the proposed objective has close connections with the popular Laplacian Eigenmap problem, and is hence well justified. The optimization turns out to be a quadratic programming problem with n(n-1)/2 variables (n is the number of data points). Exploiting the sparsity of the graph, we further propose a more efficient cutting plane algorithm to solve the problem, making the method better scalable in practice. In the context of clustering and semi-supervised learning, we demonstrated the advantages of our proposed method by experiments.

Fault-tolerant dynamic task graph scheduling

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

Kurt, Mehmet C.; Krishnamoorthy, Sriram; Agrawal, Kunal

2014-11-16

In this paper, we present an approach to fault tolerant execution of dynamic task graphs scheduled using work stealing. In particular, we focus on selective and localized recovery of tasks in the presence of soft faults. We elicit from the user the basic task graph structure in terms of successor and predecessor relationships. The work stealing-based algorithm to schedule such a task graph is augmented to enable recovery when the data and meta-data associated with a task get corrupted. We use this redundancy, and the knowledge of the task graph structure, to selectively recover from faults with low space andmore » time overheads. We show that the fault tolerant design retains the essential properties of the underlying work stealing-based task scheduling algorithm, and that the fault tolerant execution is asymptotically optimal when task re-execution is taken into account. Experimental evaluation demonstrates the low cost of recovery under various fault scenarios.« less

Graphing Online Searches with Lotus 1-2-3.

ERIC Educational Resources Information Center

Persson, Olle

1986-01-01

This article illustrates how Lotus 1-2-3 software can be used to create graphs using downloaded online searches as raw material, notes most commands applied, and outlines three required steps: downloading, importing the downloading file into the worksheet, and making graphs. An example in bibliometrics and sample graphs are included. (EJS)

Can Comparison of Contrastive Examples Facilitate Graph Understanding?

ERIC Educational Resources Information Center

Smith, Linsey A.; Gentner, Dedre

2011-01-01

The authors explore the role of comparison in improving graph fluency. The ability to use graphs fluently is crucial for STEM achievement, but graphs are challenging to interpret and produce because they often involve integration of multiple variables, continuous change in variables over time, and omission of certain details in order to highlight…

Measuring Graph Comprehension, Critique, and Construction in Science

ERIC Educational Resources Information Center

Lai, Kevin; Cabrera, Julio; Vitale, Jonathan M.; Madhok, Jacquie; Tinker, Robert; Linn, Marcia C.

2016-01-01

Interpreting and creating graphs plays a critical role in scientific practice. The K-12 Next Generation Science Standards call for students to use graphs for scientific modeling, reasoning, and communication. To measure progress on this dimension, we need valid and reliable measures of graph understanding in science. In this research, we designed…

Graphing Reality

ERIC Educational Resources Information Center

Beeken, Paul

2014-01-01

Graphing is an essential skill that forms the foundation of any physical science. Understanding the relationships between measurements ultimately determines which modeling equations are successful in predicting observations. Over the years, science and math teachers have approached teaching this skill with a variety of techniques. For secondary…

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

PubMed

Keller, Carmen; Junghans, Alex

2017-11-01

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

Reproducibility of graph metrics of human brain structural networks.

PubMed