WorldWideScience

Sample records for graphs charts recordings

  1. Understanding Charts and Graphs.

    Science.gov (United States)

    1987-07-28

    Farenheit degrees, which have no Onaturalo zero ); finally, ratio scales have numbers that are ordered so that the magnitudes of differences are important and...system. They have to do with the very nature of how marks serve as meaningful symbols. In the ideal case, a chart or graph will be absolutely unambiguous...and these laws comprise this principle (see Stevens, 1974). Absolute discriminability: A minimal magnitude of a mark is necessary for it to be detected

  2. Weighing Rain Gauge Recording Charts

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Weighing rain gauge charts record the amount of precipitation that falls at a given location. The vast majority of the Weighing Rain Gauge Recording Charts...

  3. jsGraph and jsNMR—Advanced Scientific Charting

    Directory of Open Access Journals (Sweden)

    Norman Pellet

    2014-09-01

    Full Text Available The jsGraph library is a versatile javascript library that allows advanced charting to be rendered interactively in web browsers without relying on server-side image processing. jsGraph is released under the MIT license and is free of charge. While being highly customizable through an intuitive javascript API, jsGraph is optimized to render a large quantity of data in a short amount of time. jsGraphs can display line, scatter, contour or zone series. Examples can be consulted on the project home page [1]. Customization of the chart, its axis and its series is achieved through simple but comprehensive JSON configurations.

  4. Qualities of dental chart recording and coding.

    Science.gov (United States)

    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.

  5. Energy predictions. [Briefs on 33 charts, figures, and graphs

    Energy Technology Data Exchange (ETDEWEB)

    Freiwald, D.A.

    1977-01-01

    Briefs describe 33 charts, graphs, and schematics offering some recent history and perspectives on the world and U.S. energy situation and the problems for survival facing the world. Of interest is Figure 28, showing the Club of Rome's model of the earth in terms of resource consumption, food, money, people, pollution, etc. A computer was asked to extend recent history into the future and results indicate a collapse of the industrialized system towards an agrarian culture around the year 2025. It is noted that the model did not consider technological initiative or man's willingness to change lifestyles. The final (33) schematic is a guesstimate of noticeable impact timescales, indicating when research projects on transition or ultimate energy sources at LASL might be expected to yield impact. (MCW)

  6. Paperless chart recording helps cut costs

    International Nuclear Information System (INIS)

    Collier, K.; Sullivan, M.E.

    1997-01-01

    Turbine generator data acquisition systems using personal computers have been installed at the Limerick BWR power plant to replace paper-based chart recorders. This plant is already one of the lowest cost nuclear power plants in the US and this innovation will boost operating efficiency still further. The Limerick control room now has wall-mounted touch screen video displays which provide operators with real-time, electronically achieved information and improving information flow, with a consolidated, consistent user interface. (UK)

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

    Science.gov (United States)

    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.

  8. Diagrams: A Visual Survey of Graphs, Maps, Charts and Diagrams for the Graphic Designer.

    Science.gov (United States)

    Lockwood, Arthur

    Since the ultimate success of any diagram rests in its clarity, it is important that the designer select a method of presentation which will achieve this aim. He should be aware of the various ways in which statistics can be shown diagrammatically, how information can be incorporated in maps, and how events can be plotted in chart or graph form.…

  9. Learning a Health Knowledge Graph from Electronic Medical Records.

    Science.gov (United States)

    Rotmensch, Maya; Halpern, Yoni; Tlimat, Abdulhakim; Horng, Steven; Sontag, David

    2017-07-20

    Demand for clinical decision support systems in medicine and self-diagnostic symptom checkers has substantially increased in recent years. Existing platforms rely on knowledge bases manually compiled through a labor-intensive process or automatically derived using simple pairwise statistics. This study explored an automated process to learn high quality knowledge bases linking diseases and symptoms directly from electronic medical records. Medical concepts were extracted from 273,174 de-identified patient records and maximum likelihood estimation of three probabilistic models was used to automatically construct knowledge graphs: logistic regression, naive Bayes classifier and a Bayesian network using noisy OR gates. A graph of disease-symptom relationships was elicited from the learned parameters and the constructed knowledge graphs were evaluated and validated, with permission, against Google's manually-constructed knowledge graph and against expert physician opinions. Our study shows that direct and automated construction of high quality health knowledge graphs from medical records using rudimentary concept extraction is feasible. The noisy OR model produces a high quality knowledge graph reaching precision of 0.85 for a recall of 0.6 in the clinical evaluation. Noisy OR significantly outperforms all tested models across evaluation frameworks (p < 0.01).

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

    Science.gov (United States)

    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.

  11. Visibility graph approach to the analysis of ocean tidal records

    International Nuclear Information System (INIS)

    Telesca, Luciano; Lovallo, Michele; Pierini, Jorge O.

    2012-01-01

    By using the recent method of the visibility graph, three time series of oceanic tide level in central Argentina were investigated. The degree distributions show a rich structure; in particular the maximum is due to the main periodic oscillations at 24 hours and 12 hours and higher harmonics. The degree distributions of the residuals (obtained removing from the original signals the cyclic components) suggest that the local effects, linked with the particular coastal conditions of the sites, are discernible for the degree k 100. Although a relationship between the spectral exponent α and the exponent of the degree distribution γ of tidal signals can be recognized, this cannot be simply stated due to the very rich and complex structure of time dynamics of tides. The present study, even if still preliminary, show the importance of the visibility graph method in investigating the complex time dynamics of observational and experimental signals.

  12. Generating ActiGraph counts from raw acceleration recorded by an alternative monitor

    DEFF Research Database (Denmark)

    Brønd, Jan Christian; Andersen, Lars Bo; Arvidsson, Daniel

    2017-01-01

    Introduction: Raw acceleration data collected by the ActiGraph accelerometer is aggregated using a proprietary method into arbitrary physical activity intensity units called counts, which has been extensively calibrated and validated against energy expenditure. Generating ActiGraph counts from any...... second across all rotational frequencies compared to the original ActiGraph method. Applying the aggregation method to the 24-hour free-living recordings resulted in an epoch level bias ranging from -16.2 to 0.9 counts per 10 second, a relative difference in the averaged physical activity (counts per...

  13. Development of electronic medical record charting for hospital-based transfusion and apheresis medicine services: Early adoption perspectives

    Directory of Open Access Journals (Sweden)

    Rebecca Levy

    2010-01-01

    Full Text Available Background: Electronic medical records (EMRs provide universal access to health care information across multidisciplinary lines. In pathology departments, transfusion and apheresis medicine services (TAMS involved in direct patient care activities produce data and documentation that typically do not enter the EMR. Taking advantage of our institution′s initiative for implementation of a paperless medical record, our TAMS division set out to develop an electronic charting (e-charting strategy within the EMR. Methods: A focus group of our hospital′s transfusion committee consisting of transfusion medicine specialists, pathologists, residents, nurses, hemapheresis specialists, and information technologists was constituted and charged with the project. The group met periodically to implement e-charting TAMS workflow and produced electronic documents within the EMR (Cerner Millenium for various service line functions. Results: The interdisciplinary working group developed and implemented electronic versions of various paper-based clinical documentation used by these services. All electronic notes collectively gather and reside within a unique Transfusion Medicine Folder tab in the EMR, available to staff with access to patient charts. E-charting eliminated illegible handwritten notes, resulted in more consistent clinical documentation among staff, and provided greater real-time review/access of hemotherapy practices. No major impediments to workflow or inefficiencies have been encountered. However, minor updates and corrections to documents as well as select work re-designs were required for optimal use of e-charting by these services. Conclusion: Documentation of pathology subspecialty activities such as TAMS can be successfully incorporated into the EMR. E-charting by staff enhances communication and helps promote standardized documentation of patient care within and across service lines. Well-constructed electronic documents in the EMR may also

  14. The study of insect blood-feeding behaviour: 2. Recording techniques and the use of flow charts

    Directory of Open Access Journals (Sweden)

    J. J. B. Smith

    1987-01-01

    Full Text Available This paper continues a discussion of approaches and methodologies we have used in our studies of feeding in haematophagous insects. Described are techniques for directly monitoring behaviour: electrical recording of feeding behaviour via resistance changes in the food canal, optical methods for monitoring mouthpart activity, and a computer technique for behavioural event recording. Also described is the use of "flow charts" or "decision diagrams" to model interrelated sequences of behaviours.

  15. Data report - charts and graphs

    International Nuclear Information System (INIS)

    Anon.

    1995-01-01

    This article is the summary report of uranium transactions. Specific data includes: (1) last month's deals, (2) uranium prices, both ranges and historical trends over twelve year period, and (3) SWU prices and ranges over a twelve year period

  16. Electronic growth charts: watching our patients grow.

    Science.gov (United States)

    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.

  17. Patterns in Patient Access and Utilization of Online Medical Records: Analysis of MyChart

    Science.gov (United States)

    2018-01-01

    Background Electronic patient portals provide a new method for sharing personal medical information with individual patients. Objective Our aim was to review utilization patterns of the largest online patient portal in Canada's largest city. Methods We conducted a 4-year time-trend analysis of aggregated anonymous utilization data of the MyChart patient portal at Sunnybrook Health Sciences Centre in Ontario, Canada, from January 1, 2012, through December 31, 2015. Prespecified analyses examined trends related to day (weekend vs weekday), season (July vs January), year (2012 vs 2015), and an extreme adverse weather event (ice storm of December 20-26, 2013). Primary endpoints included three measures of patient portal activity: registrations, logins, and pageviews. Results We identified 32,325 patients who registered for a MyChart account during the study interval. Time-trend analysis showed no sign of attenuating registrations over time. Logins were frequent, averaged 734 total per day, and showed an increasing trend over time. Pageviews mirrored logins, averaged about 3029 total per day, and equated to about 5 pageviews during the average login. The most popular pageviews were clinical notes, followed by laboratory results and medical imaging reports. All measures of patient activity were lower on weekends compared to weekdays (P<.001) yet showed no significant changes related to seasons or extreme weather. No major security breach, malware attack, or software failure occurred during the study. Conclusions Online patient portals can provide a popular and reliable system for distributing personal medical information to active patients and may merit consideration for hospitals. PMID:29410386

  18. Patterns in Patient Access and Utilization of Online Medical Records: Analysis of MyChart.

    Science.gov (United States)

    Redelmeier, Donald A; Kraus, Nicole C

    2018-02-06

    Electronic patient portals provide a new method for sharing personal medical information with individual patients. Our aim was to review utilization patterns of the largest online patient portal in Canada's largest city. We conducted a 4-year time-trend analysis of aggregated anonymous utilization data of the MyChart patient portal at Sunnybrook Health Sciences Centre in Ontario, Canada, from January 1, 2012, through December 31, 2015. Prespecified analyses examined trends related to day (weekend vs weekday), season (July vs January), year (2012 vs 2015), and an extreme adverse weather event (ice storm of December 20-26, 2013). Primary endpoints included three measures of patient portal activity: registrations, logins, and pageviews. We identified 32,325 patients who registered for a MyChart account during the study interval. Time-trend analysis showed no sign of attenuating registrations over time. Logins were frequent, averaged 734 total per day, and showed an increasing trend over time. Pageviews mirrored logins, averaged about 3029 total per day, and equated to about 5 pageviews during the average login. The most popular pageviews were clinical notes, followed by laboratory results and medical imaging reports. All measures of patient activity were lower on weekends compared to weekdays (Psecurity breach, malware attack, or software failure occurred during the study. Online patient portals can provide a popular and reliable system for distributing personal medical information to active patients and may merit consideration for hospitals. ©Donald A Redelmeier, Nicole C Kraus. Originally published in the Journal of Medical Internet Research (http://www.jmir.org), 06.02.2018.

  19. Documentation of psychotropic PRN medication administration: An evaluation of electronic health records compared with paper charts and verbal reports.

    Science.gov (United States)

    Martin, Krystle; Ham, Elke; Hilton, Zoe

    2018-05-12

    To describe the documentation of pro re nata (PRN) medication for anxiety, and to compare documentation at two hospitals providing similar psychiatric services, one that used paper charts and another that used an electronic health record (EHR). We also assessed congruence between nursing documentation and verbal reports from staff about the PRN administration process. The ability to accurately document patients' symptoms and the care given is considered a core competency of the nursing profession (Wilkinson, 2007); however, researchers have found poor concordance between nursing notes and verbal reports or observations of events (e.g., De Marinis, Piredda, Pascarella et al., 2009) and considerable information missing (e.g., Marinis et al., 2010). Additionally, the administration of PRN medication has consistently been noted to be poorly documented (e.g., Baker, Lovell, & Harris, 2008). The project was a mixed method, two-phase study that collected data from two sites. In phase 1, nursing documentation of PRN medication administrations was reviewed in patient charts; phase 2 included verbal reports from staff about this practice. Nurses using EHR documented more information than those using paper charts, including the reason for PRN administration, who initiated the administration, and effectiveness. There were some differences between written and verbal reports, including whether potential side effects were explained to patients prior to PRN administration. We continue the calls for attention to be paid to improving the quality of nursing documentation. Our results support the shift to using EHR, yet not relying on this method completely to ensure comprehensiveness of documentation. Efforts to address the quality of documentation, particularly for PRN administration, are needed. This could be done through training, using structured report templates, and switching to electronic databases. This article is protected by copyright. All rights reserved. This article is

  20. Repeat cesarean delivery: what indications are recorded in the medical chart?

    Science.gov (United States)

    Lydon-Rochelle, Mona T; Gardella, Carolyn; Cárdenas, Vicky; Easterling, Thomas R

    2006-03-01

    National surveillance estimates reported a troubling 63 percent decline in the rate of vaginal birth after cesarean delivery (VBAC) from 1996 (28.3%) to 2003 (10.6%), with subsequent rising rates of repeat cesarean delivery. The study objective was to examine patterns of documented indications for repeat cesarean delivery in women with and without labor. We conducted a population-based validation study of 19 nonfederal short-stay hospitals in Washington state. Of the 4,541 women who had live births in 2000, 11 percent (n = 493) had repeat cesarean without labor and 3 percent (n = 138) had repeat cesarean with labor. Incidence of medical conditions and pregnancy complications, patterns of documented indications for repeat cesarean delivery, and perioperative complications in relation to repeat cesarean delivery with and without labor were calculated. Of the 493 women who underwent a repeat cesarean delivery without labor, "elective"(36%) and "maternal request"(18%) were the most common indications. Indications for maternal medical conditions (3.0%) were uncommon. Among the 138 women with repeat cesarean delivery with labor, 60.1 percent had failure to progress, 24.6 percent a non-reassuring fetal heart rate, 8.0 percent cephalopelvic disproportion, and 7.2 percent maternal request during labor. Fetal indications were less common (5.8%). Breech, failed vacuum, abruptio placentae, maternal complications, and failed forceps were all indicated less than 5.0 percent. Women's perioperative complications did not vary significantly between women without and with labor. Regardless of a woman's labor status, nearly 10 percent of women with repeat cesarean delivery had no documented indication as to why a cesarean delivery was performed. "Elective" and "maternal request" were common indications among women undergoing repeat cesarean delivery without labor, and nearly 10 percent of women had undocumented indications for repeat cesarean delivery in their medical record

  1. From Many Records to One Graph: Heterogeneity Conflicts in the Linked Data Restructuring Cycle

    Science.gov (United States)

    Tallerås, Kim

    2013-01-01

    Introduction: During the last couple of years the library community has developed a number of comprehensive metadata standardization projects inspired by the idea of linked data, such as the BIBFRAME model. Linked data is a set of best practice principles of publishing and exposing data on the Web utilizing a graph based data model powered with…

  2. Barograms / Barograph Charts

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Barograms are weekly rectangular charts recording barometric pressure at a given station. The barograph is an instrument that makes a continuous pen and ink trace of...

  3. Comparison of accuracy of physical examination findings in initial progress notes between paper charts and a newly implemented electronic health record.

    Science.gov (United States)

    Yadav, Siddhartha; Kazanji, Noora; K C, Narayan; Paudel, Sudarshan; Falatko, John; Shoichet, Sandor; Maddens, Michael; Barnes, Michael A

    2017-01-01

    There have been several concerns about the quality of documentation in electronic health records (EHRs) when compared to paper charts. This study compares the accuracy of physical examination findings documentation between the two in initial progress notes. Initial progress notes from patients with 5 specific diagnoses with invariable physical findings admitted to Beaumont Hospital, Royal Oak, between August 2011 and July 2013 were randomly selected for this study. A total of 500 progress notes were retrospectively reviewed. The paper chart arm consisted of progress notes completed prior to the transition to an EHR on July 1, 2012. The remaining charts were placed in the EHR arm. The primary endpoints were accuracy, inaccuracy, and omission of information. Secondary endpoints were time of initiation of progress note, word count, number of systems documented, and accuracy based on level of training. The rate of inaccurate documentation was significantly higher in the EHRs compared to the paper charts (24.4% vs 4.4%). However, expected physical examination findings were more likely to be omitted in the paper notes compared to EHRs (41.2% vs 17.6%). Resident physicians had a smaller number of inaccuracies (5.3% vs 17.3%) and omissions (16.8% vs 33.9%) compared to attending physicians. During the initial phase of implementation of an EHR, inaccuracies were more common in progress notes in the EHR compared to the paper charts. Residents had a lower rate of inaccuracies and omissions compared to attending physicians. Further research is needed to identify training methods and incentives that can reduce inaccuracies in EHRs during initial implementation. © The Author 2016. Published by Oxford University Press on behalf of the American Medical Informatics Association. All rights reserved. For Permissions, please email: journals.permissions@oup.com.

  4. Radar Chart

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The Radar Chart collection is an archived product of summarized radar data. The geographic coverage is the 48 contiguous states of the United States. These hourly...

  5. Chart Series

    Data.gov (United States)

    U.S. Department of Health & Human Services — The Centers for Medicare and Medicaid Services (CMS) offers several different Chart Series with data on beneficiary health status, spending, operations, and quality...

  6. Flaw evaluation charts

    International Nuclear Information System (INIS)

    Korosec, D.; Vojvodic Tuma, J.

    1999-01-01

    The structural integrity of the primary components in pressurized water reactor nuclear power plant is very important in the respect of safe and efficient operation. These components have to be subjected to periodic controls. In the light of fracture mechanics concept, the acceptance criteria for defects (flaws) are developed. Flaw evaluation procedure is necessary, to evaluate the defects regarding their acceptability for further operation. The objective of the flaw evaluation charts is to provide a series of simple graphs as decision maps. that immediate decision may be taken regarding the acceptability of a detected defects, on the basis of ASME Code XI criteria.(author)

  7. Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.

    Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

  8. Graph sampling

    OpenAIRE

    Zhang, L.-C.; Patone, M.

    2017-01-01

    We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

  9. Graph spectrum

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

  10. Risk-adjustment models for heart failure patients' 30-day mortality and readmission rates: the incremental value of clinical data abstracted from medical charts beyond hospital discharge record.

    Science.gov (United States)

    Lenzi, Jacopo; Avaldi, Vera Maria; Hernandez-Boussard, Tina; Descovich, Carlo; Castaldini, Ilaria; Urbinati, Stefano; Di Pasquale, Giuseppe; Rucci, Paola; Fantini, Maria Pia

    2016-09-06

    Hospital discharge records (HDRs) are routinely used to assess outcomes of care and to compare hospital performance for heart failure. The advantages of using clinical data from medical charts to improve risk-adjustment models remain controversial. The aim of the present study was to evaluate the additional contribution of clinical variables to HDR-based 30-day mortality and readmission models in patients with heart failure. This retrospective observational study included all patients residing in the Local Healthcare Authority of Bologna (about 1 million inhabitants) who were discharged in 2012 from one of three hospitals in the area with a diagnosis of heart failure. For each study outcome, we compared the discrimination of the two risk-adjustment models (i.e., HDR-only model and HDR-clinical model) through the area under the ROC curve (AUC). A total of 1145 and 1025 patients were included in the mortality and readmission analyses, respectively. Adding clinical data significantly improved the discrimination of the mortality model (AUC = 0.84 vs. 0.73, p < 0.001), but not the discrimination of the readmission model (AUC = 0.65 vs. 0.63, p = 0.08). We identified clinical variables that significantly improved the discrimination of the HDR-only model for 30-day mortality following heart failure. By contrast, clinical variables made little contribution to the discrimination of the HDR-only model for 30-day readmission.

  11. Adiabatic Charts

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — WBAN-31 is a form on which the Weather Bureau, Army and Navy recorded weather observations in the upper air as observed by rawinsonde and radiosonde. The collection...

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

    Science.gov (United States)

    Shewhart, Mark

    1991-01-01

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

  13. Memory-type control charts in statistical process control

    NARCIS (Netherlands)

    Abbas, N.

    2012-01-01

    Control chart is the most important statistical tool to manage the business processes. It is a graph of measurements on a quality characteristic of the process on the vertical axis plotted against time on the horizontal axis. The graph is completed with control limits that cause variation mark. Once

  14. Charting Ingredients for Life

    Science.gov (United States)

    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.

  15. Equipackable graphs

    DEFF Research Database (Denmark)

    Vestergaard, Preben Dahl; Hartnell, Bert L.

    2006-01-01

    There are many results dealing with the problem of decomposing a fixed graph into isomorphic subgraphs. There has also been work on characterizing graphs with the property that one can delete the edges of a number of edge disjoint copies of the subgraph and, regardless of how that is done, the gr...

  16. Interaction graphs

    DEFF Research Database (Denmark)

    Seiller, Thomas

    2016-01-01

    Interaction graphs were introduced as a general, uniform, construction of dynamic models of linear logic, encompassing all Geometry of Interaction (GoI) constructions introduced so far. This series of work was inspired from Girard's hyperfinite GoI, and develops a quantitative approach that should...... be understood as a dynamic version of weighted relational models. Until now, the interaction graphs framework has been shown to deal with exponentials for the constrained system ELL (Elementary Linear Logic) while keeping its quantitative aspect. Adapting older constructions by Girard, one can clearly define...... "full" exponentials, but at the cost of these quantitative features. We show here that allowing interpretations of proofs to use continuous (yet finite in a measure-theoretic sense) sets of states, as opposed to earlier Interaction Graphs constructions were these sets of states were discrete (and finite...

  17. Preparation of exposures charts for X-ray tubes

    International Nuclear Information System (INIS)

    Zoofan, B.

    1988-01-01

    An exposure chart is a fundamental graph which provides guidance of the exposure conditions in relation to the thickness for a given specimen. It must be prepared specially for the X-ray unit and the type of the film to be used. Although exposure charts are available for each particular X-ray tube from its manufacturer, individual radiographic laboratory should be able to prepare its own exposure charts in a precise manner. Here a typical procedure to prepare such a chart is provided in a practical way with some necessary recommendations

  18. Introduction to graph theory

    CERN Document Server

    Trudeau, Richard J

    1994-01-01

    Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

  19. Radioactive waste management information for 1993 and record-to-date

    International Nuclear Information System (INIS)

    Taylor, K.A.

    1994-07-01

    This document presents detailed data, bar graphs, and pie charts on volume, radioactivity, isotopic identity, origin, and decay status of radioactive waste for the calendar year 1993. It also summarizes the radioactive waste data records compiled from 1952 to present for the Idaho National Engineering Laboratory (INEL). The data presented are from the INEL Radioactive Waste Management Information System

  20. Surface Prognostic Charts

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Surface Prognostic Charts are historical surface prognostic (forecast) charts created by the United States Weather Bureau. They include fronts, isobars, cloud, and...

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

    Science.gov (United States)

    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)

  2. Growth Charts (For Parents)

    Science.gov (United States)

    ... Staying Safe Videos for Educators Search English Español Growth Charts KidsHealth / For Parents / Growth Charts What's in ... Problem? Print en español Tablas de crecimiento About Growth Charts Look at any class picture, and you' ...

  3. APPLICATION OF U-CHART AND C-CHART IN TECHNOLOGICAL PROCESS OF PRIMARY WOOD PROCESSING

    Directory of Open Access Journals (Sweden)

    Damjan Stanojević

    2014-01-01

    Full Text Available Control charts are statistical methods of quality control. Basically it is a graph where the abscissa represents the order of control, and the ordinate is marked with parameter values, which are controled by samples over a certain size. Using charts determine varying quality and also related the stability and capacity of the production process in relation to the established control limits. Dr. Schuchardt, which can be regarded as the creator of control charts, says that their mission: to maintain the production process in a state of control, to lead the production process into a state of control, to show that the state of control has been achieved. According to Dr. Schuchardt „for a phenomenon is said to be controlled if based on current data we can predict, at least within certain limits, how the phenomenon will change in the future. Here, under certain prediction within limits means that we can determine, at least approximately, the probability that the phenomenon is found within the given limits“. Control charts for attribute quality characteristics are: p- control chart, m- control chart, u- control chart, c- control chart.

  4. Graph theory

    CERN Document Server

    Diestel, Reinhard

    2017-01-01

    This standard textbook of modern graph theory, now in its fifth edition, combines the authority of a classic with the engaging freshness of style that is the hallmark of active mathematics. It covers the core material of the subject with concise yet reliably complete proofs, while offering glimpses of more advanced methods in each field by one or two deeper results, again with proofs given in full detail. The book can be used as a reliable text for an introductory course, as a graduate text, and for self-study. From the reviews: “This outstanding book cannot be substituted with any other book on the present textbook market. It has every chance of becoming the standard textbook for graph theory.”Acta Scientiarum Mathematiciarum “Deep, clear, wonderful. This is a serious book about the heart of graph theory. It has depth and integrity. ”Persi Diaconis & Ron Graham, SIAM Review “The book has received a very enthusiastic reception, which it amply deserves. A masterly elucidation of modern graph theo...

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

    Science.gov (United States)

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

  6. Graph theory

    CERN Document Server

    Gould, Ronald

    2012-01-01

    This introduction to graph theory focuses on well-established topics, covering primary techniques and including both algorithmic and theoretical problems. The algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides insights to computer scientists as well as advanced undergraduates and graduate students of topology, algebra, and matrix theory. Fundamental concepts and notation and elementary properties and operations are the first subjects, followed by examinations of paths and searching, trees, and networks. S

  7. Graphs & digraphs

    CERN Document Server

    Chartrand, Gary; Zhang, Ping

    2010-01-01

    Gary Chartrand has influenced the world of Graph Theory for almost half a century. He has supervised more than a score of Ph.D. dissertations and written several books on the subject. The most widely known of these texts, Graphs and Digraphs, … has much to recommend it, with clear exposition, and numerous challenging examples [that] make it an ideal textbook for the advanced undergraduate or beginning graduate course. The authors have updated their notation to reflect the current practice in this still-growing area of study. By the authors' estimation, the 5th edition is approximately 50% longer than the 4th edition. … the legendary Frank Harary, author of the second graph theory text ever produced, is one of the figures profiled. His book was the standard in the discipline for several decades. Chartrand, Lesniak and Zhang have produced a worthy successor.-John T. Saccoman, MAA Reviews, June 2012 (This book is in the MAA's basic library list.)As with the earlier editions, the current text emphasizes clear...

  8. 49 CFR 1114.30 - Production of documents and records and entry upon land for inspection and other purposes.

    Science.gov (United States)

    2010-10-01

    ... Relating to Transportation (Continued) SURFACE TRANSPORTATION BOARD, DEPARTMENT OF TRANSPORTATION RULES OF..., drawings, graphs, charts, photographs, phonograph records, tapes, and other data compilations from which... possession, custody, or control of the party upon whom the request is served, but if the writings or data...

  9. Fractional smith chart theory

    KAUST Repository

    Shamim, Atif

    2011-03-01

    For the first time, a generalized Smith chart is introduced here to represent fractional order circuit elements. It is shown that the standard Smith chart is a special case of the generalized fractional order Smith chart. With illustrations drawn for both the conventional integer based lumped elements and the fractional elements, a graphical technique supported by the analytical method is presented to plot impedances on the fractional Smith chart. The concept is then applied towards impedance matching networks, where the fractional approach proves to be much more versatile and results in a single element matching network for a complex load as compared to the two elements in the conventional approach. © 2010 IEEE.

  10. Control of control charts

    NARCIS (Netherlands)

    Sri Nurdiati, S.N.

    2005-01-01

    Although the Shewhart chart is widely used in practice because of its simplicity, applying this control chart to monitor the mean of a process may lead to two types of problems. The first concerns the typically unknown parameters involved in the distribution, while the second concerns the validity

  11. A spectral chart of synchrotron orbital radiation

    International Nuclear Information System (INIS)

    Hiramatsu, Nobuyasu; Yoneda, Yasuharu

    1977-01-01

    This paper introduces a chart of the spectrum of synchrotron orbital radiation. The radiation from high energy electrons has been used for various purposes. The formulas to express the spectrum have been presented. The parameters which determine the spectrum are the acceleration energy E, the deflection radius R, the wavelength of photons, the photon energy, and the harmonics. The chart in this paper determines the field intensity H to be applied on an accelerator when E and R are freely selected, and either the wavelength or the harmonics is obtained from the other one. Then, the spectrum distribution can be obtained. A.A. Sokolov and I.M. Ternov modified the formula for the emitted energy from an electron which had been given by G.A. Schott. The modified formula is used to obtain the number of photons per 1 eV. The relation between R and the harmonics is expressed by parallel lines in a log-log graph. The relation among R, H and E is also expressed in the same graph by parallel lines. The spectroscopic intensity is also shown in the same graph by a curved line. (Kato, T.)

  12. NNDC Chart of Nuclides

    International Nuclear Information System (INIS)

    Sonzogni, A.

    2008-01-01

    The National Nuclear Data Center has recently developed an interactive chart of nuclides, http://www.nndc.bnl.gov/chart/, that provides nuclear structure and decay data. Since its implementation, it has proven to be one of the most popular web products. The information presented is derived from the ENSDF and Nuclear Wallet Card databases. Experimentally known nuclides are represented by a cell in chart with the number of neutrons on the horizontal axis and the number of protons on the vertical axis. The color of the cell is used to indicate the ground state half-life or the ground state predominant decay mode. (author)

  13. Chromatic graph theory

    CERN Document Server

    Chartrand, Gary; Rosen, Kenneth H

    2008-01-01

    Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

  14. Smart Book Charts

    Science.gov (United States)

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

  15. CDC Child Growth Charts

    Data.gov (United States)

    U.S. Department of Health & Human Services — CDC child growth charts consist of a series of percentile curves that illustrate the distribution of selected body measurements in U.S. children. Pediatric growth...

  16. Great Lakes Ice Charts

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — Charts show ice extent and concentration three times weekly during the ice season, for all lakes except Ontario, from the 1973/74 ice season through the 2001/2002...

  17. Control Chart on Semi Analytical Weighting

    Science.gov (United States)

    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.

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

    Science.gov (United States)

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

  19. Graph visualization (Invited talk)

    NARCIS (Netherlands)

    Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

    2012-01-01

    Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

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

    Science.gov (United States)

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

    2017-07-01

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

  1. Pragmatic Graph Rewriting Modifications

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    1999-01-01

    We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

  2. Chart of the nuclides

    International Nuclear Information System (INIS)

    Yoshizawa, Y.; Horiguchi, T.; Yamada, M.

    1980-01-01

    In this chart, four colors are use to classify nuclides according to their half-lives. The different symbols are also to show the decay modes and their percentage in each nuclide. Four tables are provided on the back of the chart. Table 1 is the ordinary periodic Table. Table 2 provides fundamental constants used for nuclear physics. Tables 3 lists the physical constants (mean density, ionization potential, melting point, and boiling point) of all elements. Table 4 provides the gamma-ray intensity standards. Half-lives, energy, relative intensity, and intensity per decay are list for 33 nuclides. (J.P.N.)

  3. Nuclear industry chart

    International Nuclear Information System (INIS)

    Anon.

    1975-01-01

    As part of a survey on Switzerland a pull-out organisation chart is presented of the nuclear industry showing Swiss government bodies and industrial concerns. Their interests, connections with each other and their associations with international and other national organizations and firms are indicated. (U.K.)

  4. National Forecast Charts

    Science.gov (United States)

    code. Press enter or select the go button to submit request Local forecast by "City, St" or Prediction Center on Twitter NCEP Quarterly Newsletter WPC Home Analyses and Forecasts National Forecast to all federal, state, and local government web resources and services. National Forecast Charts

  5. INIS: Terminology charts

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1970-08-01

    This document is one in a series of publications known as the INIS Reference Series. It is to be used in conjunction with the INIS indexing manual and the INIS thesaurus for the preparation of input to the INIS database. The thesaurus and terminology charts in their first edition (Rev.0) were produced as the result of an agreement between the International Atomic Energy Agency (IAEA) and the European Atomic Energy Community (Euratom). Except for minor changes the terminology and the interrelationships between terms are those of the December 1969 edition of the Euratom Thesaurus. The purpose of the terminology harts is to display the descriptors of the thesaurus in the context of their hierarchical and other semantic relationships. Hierarchically related terms are grouped in clusters, each representing one of the principal concepts of a subject field. The descriptors are grouped around or under the broadest term of the clusters which is printed in upper case. The hierarchical relationships within the clusters are shown by the arrangement of the terms in smaller boxes within the larger boxes circumscribing the clusters. The clusters are connected by lines of various thickness, representing the other (mostly non-hierarchical) relationships. These connections are the equivalent to 'see also' and 'related term' cross-references. The thickness of the lines represents the strength of the semantic relations, or, in the practice of a retrieval system the probability that one term replacing a connected term in a query, will still yield pertinent references. The figures accompanying the descriptors represent their frequency of assignment to the first 987,000 documents stored in the Euratom system (May 1970). They are presented in order to show the relative importance of the descriptors within the subject field. The asterisks (*) accompanying descriptors in the charts refer to descriptors, for which a scope note can be found in the INIS: Thesaurus at the time the charts went

  6. INIS: Terminology charts

    International Nuclear Information System (INIS)

    1970-08-01

    This document is one in a series of publications known as the INIS Reference Series. It is to be used in conjunction with the INIS indexing manual and the INIS thesaurus for the preparation of input to the INIS database. The thesaurus and terminology charts in their first edition (Rev.0) were produced as the result of an agreement between the International Atomic Energy Agency (IAEA) and the European Atomic Energy Community (Euratom). Except for minor changes the terminology and the interrelationships between terms are those of the December 1969 edition of the Euratom Thesaurus. The purpose of the terminology harts is to display the descriptors of the thesaurus in the context of their hierarchical and other semantic relationships. Hierarchically related terms are grouped in clusters, each representing one of the principal concepts of a subject field. The descriptors are grouped around or under the broadest term of the clusters which is printed in upper case. The hierarchical relationships within the clusters are shown by the arrangement of the terms in smaller boxes within the larger boxes circumscribing the clusters. The clusters are connected by lines of various thickness, representing the other (mostly non-hierarchical) relationships. These connections are the equivalent to 'see also' and 'related term' cross-references. The thickness of the lines represents the strength of the semantic relations, or, in the practice of a retrieval system the probability that one term replacing a connected term in a query, will still yield pertinent references. The figures accompanying the descriptors represent their frequency of assignment to the first 987,000 documents stored in the Euratom system (May 1970). They are presented in order to show the relative importance of the descriptors within the subject field. The asterisks (*) accompanying descriptors in the charts refer to descriptors, for which a scope note can be found in the INIS: Thesaurus at the time the charts went

  7. Graphs and matrices

    CERN Document Server

    Bapat, Ravindra B

    2014-01-01

    This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

  8. Adaptive Graph Convolutional Neural Networks

    OpenAIRE

    Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

    2018-01-01

    Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

  9. On middle cube graphs

    Directory of Open Access Journals (Sweden)

    C. Dalfo

    2015-10-01

    Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

  10. Body Mass Index (BMI) Charts (For Parents)

    Science.gov (United States)

    ... Fitness Diseases & Conditions Infections Drugs & Alcohol School & Jobs Sports Expert Answers (Q&A) Staying Safe Videos for ... charts for boys and girls to account for differences in growth rates and amounts of body fat as the two genders mature. That information is recorded in your child's ...

  11. The Energy Chart'93

    International Nuclear Information System (INIS)

    Shervashidze, N.

    1993-01-01

    The Energy Chart'93 is developed with respect to forthcoming restructuring of energy sector in Bulgaria and contains its main directions for both short- and long-term periods. The priorities are given to: energy supply, stabilization of the existing units, ecological development, domestic energy sources, atomic energy, gas energy, utilization of the available hydrological potential. The leading role of legislation in this area is also pointed out, as well as the regulating function of the Committee of Energy. (author)

  12. NOAA Raster Navigational Charts (RNC)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — NOAA, National Ocean Service, Office of Coast Survey, Marine Chart Division is responsible to build and maintain a suite of more than 1000 nautical charts that are...

  13. Price competition on graphs

    NARCIS (Netherlands)

    Soetevent, A.R.

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial

  14. Graphing Inequalities, Connecting Meaning

    Science.gov (United States)

    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…

  15. Similarity Measure of Graphs

    Directory of Open Access Journals (Sweden)

    Amine Labriji

    2017-07-01

    Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

  16. Distance-regular graphs

    NARCIS (Netherlands)

    van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

    2016-01-01

    This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

  17. Fuzzy Graph Language Recognizability

    OpenAIRE

    Kalampakas , Antonios; Spartalis , Stefanos; Iliadis , Lazaros

    2012-01-01

    Part 5: Fuzzy Logic; International audience; Fuzzy graph language recognizability is introduced along the lines of the established theory of syntactic graph language recognizability by virtue of the algebraic structure of magmoids. The main closure properties of the corresponding class are investigated and several interesting examples of fuzzy graph languages are examined.

  18. Spectra of Graphs

    NARCIS (Netherlands)

    Brouwer, A.E.; Haemers, W.H.

    2012-01-01

    This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

  19. Visualizing Library Statistics using Open Flash Chart 2 and Drupal

    Directory of Open Access Journals (Sweden)

    Laura K. Wiegand

    2013-01-01

    Full Text Available Libraries continue to need to demonstrate their value to stakeholders, and while statistics alone do not represent value, they are an important element. We found ourselves, and our stakeholders, uninspired by our infrequently updated bulleted list of statistics on our website and so set out to create a more dynamic and visually appealing look at our statistics. This article outlines how we used our content management system, Drupal, Open Flash Chart and custom programming to convert library statistics into Flash charts, including how to populate the graphs with dynamic data from external sources. The end result is our Library Statistics Dashboard (http://library.uncw.edu/facts_planning/dashboard that visually demonstrates the use, activity and resources in the library via interactive and visually interesting graphs.

  20. Graphs and Homomorphisms

    CERN Document Server

    Hell, Pavol

    2004-01-01

    This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

  1. Simplicial complexes of graphs

    CERN Document Server

    Jonsson, Jakob

    2008-01-01

    A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

  2. Introduction to quantum graphs

    CERN Document Server

    Berkolaiko, Gregory

    2012-01-01

    A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

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

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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.

  5. Extraneous Information and Graph Comprehension: Implications for Effective Design Choices

    Science.gov (United States)

    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…

  6. Interactive SIGHT: textual access to simple bar charts

    Science.gov (United States)

    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

  7. Graphing trillions of triangles.

    Science.gov (United States)

    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.

  8. Spectral Imaging of Portolan Charts

    Science.gov (United States)

    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.

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

    Science.gov (United States)

    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)

  10. Concise nuclear isobar charts

    Energy Technology Data Exchange (ETDEWEB)

    Bucka, H.

    1986-01-01

    In the Concise Nuclear Isobar Charts, data on binding energies of protons and neutrons in the ground state and excitation energies for low-lying nuclear energy levels are displayed, both of which are of great interest for transition processes as well as for questions of nuclear structure. Also, quantum numbers for angular momentum and parity are shown for these energy levels. For the stable nuclei, data for the relative abundances, and for unstable nucleon configurations, the transition probabilities are included in the data displayed. Due to the representation chosen for the atomic nuclei, in many cases a very clear first survey of systematic properties of nuclear energy states as well as spontaneous decay processes is achieved.

  11. Introductory graph theory

    CERN Document Server

    Chartrand, Gary

    1984-01-01

    Graph theory is used today in the physical sciences, social sciences, computer science, and other areas. Introductory Graph Theory presents a nontechnical introduction to this exciting field in a clear, lively, and informative style. Author Gary Chartrand covers the important elementary topics of graph theory and its applications. In addition, he presents a large variety of proofs designed to strengthen mathematical techniques and offers challenging opportunities to have fun with mathematics. Ten major topics - profusely illustrated - include: Mathematical Models, Elementary Concepts of Grap

  12. Price Competition on Graphs

    OpenAIRE

    Adriaan R. Soetevent

    2010-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. I propose an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. One feature of graph models of price competition is that spatial discontinuities in firm-level demand may occur. I show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs. I conjecture that this non-existence result holds...

  13. Price Competition on Graphs

    OpenAIRE

    Pim Heijnen; Adriaan Soetevent

    2014-01-01

    This paper extends Hotelling's model of price competition with quadratic transportation costs from a line to graphs. We derive an algorithm to calculate firm-level demand for any given graph, conditional on prices and firm locations. These graph models of price competition may lead to spatial discontinuities in firm-level demand. We show that the existence result of D'Aspremont et al. (1979) does not extend to simple star graphs and conjecture that this non-existence result holds more general...

  14. Pattern graph rewrite systems

    Directory of Open Access Journals (Sweden)

    Aleks Kissinger

    2014-03-01

    Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

  15. Functions and graphs

    CERN Document Server

    Gelfand, I M; Shnol, E E

    1969-01-01

    The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

  16. Creating more effective graphs

    CERN Document Server

    Robbins, Naomi B

    2012-01-01

    A succinct and highly readable guide to creating effective graphs The right graph can be a powerful tool for communicating information, improving a presentation, or conveying your point in print. If your professional endeavors call for you to present data graphically, here's a book that can help you do it more effectively. Creating More Effective Graphs gives you the basic knowledge and techniques required to choose and create appropriate graphs for a broad range of applications. Using real-world examples everyone can relate to, the author draws on her years of experience in gr

  17. Graph Generator Survey

    Energy Technology Data Exchange (ETDEWEB)

    Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

    2013-10-01

    The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

  18. Loose Graph Simulations

    DEFF Research Database (Denmark)

    Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

    2017-01-01

    We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

  19. Graph Compression by BFS

    Directory of Open Access Journals (Sweden)

    Alberto Apostolico

    2009-08-01

    Full Text Available The Web Graph is a large-scale graph that does not fit in main memory, so that lossless compression methods have been proposed for it. This paper introduces a compression scheme that combines efficient storage with fast retrieval for the information in a node. The scheme exploits the properties of the Web Graph without assuming an ordering of the URLs, so that it may be applied to more general graphs. Tests on some datasets of use achieve space savings of about 10% over existing methods.

  20. WWW chart of the nuclides

    International Nuclear Information System (INIS)

    Huang Xiaolong; Zhou Chunmei; Zhuang Youxiang; Zhao Zhixiang; Golashvili, T.V.; Chechev, V.P.

    2000-01-01

    WWW chart of the nuclides was established on the basis of the latest evaluations of nuclear structure and decay data. By viewing WWW chart of the nuclides, one can retrieve the fundamental data of nuclide such as atomic mass, abundance, spin and parity; the decay mode, branching ratio, half-life and Q-value of radioactive nuclide, energy and intensity of strong γ-ray, etc. The URL (Uniform Resource Locator) of WWW chart of the nuclides is: http://myhome.py.gd.cn/chart/index,asp

  1. Graph Theory. 1. Fragmentation of Structural Graphs

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available The investigation of structural graphs has many fields of applications in engineering, especially in applied sciences like as applied chemistry and physics, computer sciences and automation, electronics and telecommunication. The main subject of the paper is to express fragmentation criteria in graph using a new method of investigation: terminal paths. Using terminal paths are defined most of the fragmentation criteria that are in use in molecular topology, but the fields of applications are more generally than that, as I mentioned before. Graphical examples of fragmentation are given for every fragmentation criteria. Note that all fragmentation is made with a computer program that implements a routine for every criterion.[1] A web routine for tracing all terminal paths in graph can be found at the address: http://vl.academicdirect.ro/molecular_topology/tpaths/ [1] M. V. Diudea, I. Gutman, L. Jäntschi, Molecular Topology, Nova Science, Commack, New York, 2001, 2002.

  2. A graph rewriting programming language for graph drawing

    OpenAIRE

    Rodgers, Peter

    1998-01-01

    This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

  3. Graph Transforming Java Data

    NARCIS (Netherlands)

    de Mol, M.J.; Rensink, Arend; Hunt, James J.

    This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

  4. Distance-transitive graphs

    NARCIS (Netherlands)

    Cohen, A.M.; Beineke, L.W.; Wilson, R.J.; Cameron, P.J.

    2004-01-01

    In this chapter we investigate the classification of distance-transitive graphs: these are graphs whose automorphism groups are transitive on each of the sets of pairs of vertices at distance i, for i = 0, 1,.... We provide an introduction into the field. By use of the classification of finite

  5. Adventures in graph theory

    CERN Document Server

    Joyner, W David

    2017-01-01

    This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

  6. Recognition of fractal graphs

    NARCIS (Netherlands)

    Perepelitsa, VA; Sergienko, [No Value; Kochkarov, AM

    1999-01-01

    Definitions of prefractal and fractal graphs are introduced, and they are used to formulate mathematical models in different fields of knowledge. The topicality of fractal-graph recognition from the point of view, of fundamental improvement in the efficiency of the solution of algorithmic problems

  7. Graph Colouring Algorithms

    DEFF Research Database (Denmark)

    Husfeldt, Thore

    2015-01-01

    This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available...

  8. Packing Degenerate Graphs Greedily

    Czech Academy of Sciences Publication Activity Database

    Allen, P.; Böttcher, J.; Hladký, J.; Piguet, Diana

    2017-01-01

    Roč. 61, August (2017), s. 45-51 ISSN 1571-0653 R&D Projects: GA ČR GJ16-07822Y Institutional support: RVO:67985807 Keywords : tree packing conjecture * graph packing * graph processes Subject RIV: BA - General Mathematics OBOR OECD: Pure mathematics

  9. Generalized connectivity of graphs

    CERN Document Server

    Li, Xueliang

    2016-01-01

    Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.

  10. Growth charts of human development

    NARCIS (Netherlands)

    Van Buuren, Stef

    2014-01-01

    This article reviews and compares two types of growth charts for tracking human development over age. Both charts assume the existence of a continuous latent variable, but relate to the observed data in different ways. The D-score diagram summarizes developmental indicators into a single aggregate

  11. Autoregressive Moving Average Graph Filtering

    OpenAIRE

    Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

    2016-01-01

    One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

  12. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-03-06

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

  13. Subgraph detection using graph signals

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

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

    Science.gov (United States)

    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.

  15. Extremal graph theory

    CERN Document Server

    Bollobas, Bela

    2004-01-01

    The ever-expanding field of extremal graph theory encompasses a diverse array of problem-solving methods, including applications to economics, computer science, and optimization theory. This volume, based on a series of lectures delivered to graduate students at the University of Cambridge, presents a concise yet comprehensive treatment of extremal graph theory.Unlike most graph theory treatises, this text features complete proofs for almost all of its results. Further insights into theory are provided by the numerous exercises of varying degrees of difficulty that accompany each chapter. A

  16. Downhill Domination in Graphs

    Directory of Open Access Journals (Sweden)

    Haynes Teresa W.

    2014-08-01

    Full Text Available A path π = (v1, v2, . . . , vk+1 in a graph G = (V,E is a downhill path if for every i, 1 ≤ i ≤ k, deg(vi ≥ deg(vi+1, where deg(vi denotes the degree of vertex vi ∈ V. The downhill domination number equals the minimum cardinality of a set S ⊆ V having the property that every vertex v ∈ V lies on a downhill path originating from some vertex in S. We investigate downhill domination numbers of graphs and give upper bounds. In particular, we show that the downhill domination number of a graph is at most half its order, and that the downhill domination number of a tree is at most one third its order. We characterize the graphs obtaining each of these bounds

  17. Tailored Random Graph Ensembles

    International Nuclear Information System (INIS)

    Roberts, E S; Annibale, A; Coolen, A C C

    2013-01-01

    Tailored graph ensembles are a developing bridge between biological networks and statistical mechanics. The aim is to use this concept to generate a suite of rigorous tools that can be used to quantify and compare the topology of cellular signalling networks, such as protein-protein interaction networks and gene regulation networks. We calculate exact and explicit formulae for the leading orders in the system size of the Shannon entropies of random graph ensembles constrained with degree distribution and degree-degree correlation. We also construct an ergodic detailed balance Markov chain with non-trivial acceptance probabilities which converges to a strictly uniform measure and is based on edge swaps that conserve all degrees. The acceptance probabilities can be generalized to define Markov chains that target any alternative desired measure on the space of directed or undirected graphs, in order to generate graphs with more sophisticated topological features.

  18. Cycles in graphs

    CERN Document Server

    Alspach, BR

    1985-01-01

    This volume deals with a variety of problems involving cycles in graphs and circuits in digraphs. Leading researchers in this area present here 3 survey papers and 42 papers containing new results. There is also a collection of unsolved problems.

  19. Introduction to graph theory

    CERN Document Server

    Wilson, Robin J

    1985-01-01

    Graph Theory has recently emerged as a subject in its own right, as well as being an important mathematical tool in such diverse subjects as operational research, chemistry, sociology and genetics. This book provides a comprehensive introduction to the subject.

  20. Hyperbolicity in median graphs

    Indian Academy of Sciences (India)

    mic problems in hyperbolic spaces and hyperbolic graphs have been .... that in general the main obstacle is that we do not know the location of ...... [25] Jonckheere E and Lohsoonthorn P, A hyperbolic geometry approach to multipath routing,.

  1. Inland Electronic Navigational Charts (IENC)

    Data.gov (United States)

    Army Corps of Engineers, Department of the Army, Department of Defense — These Inland Electronic Navigational Charts (IENCs) were developed from available data used in maintenance of Navigation channels. Users of these IENCs should be...

  2. Charting Transnational Native American Studies

    Directory of Open Access Journals (Sweden)

    Hsinya Huang

    2012-06-01

    Full Text Available Introduction to the Special Forum entitled "Charting Transnational Native American Studies: Aesthetics, Politics, Identity," edited by Hsinya Huang, Philip J. Deloria, Laura M. Furlan, and John Gamber

  3. Borehole DC-12 hydrostratigraphic chart

    International Nuclear Information System (INIS)

    Gephart, R.E.

    1981-09-01

    This hydrostratigraphic chart identifies the basic stratigraphy and preliminary hydrologic testing results for Borehole DC-12. This borehole was cored through the Saddle Mountains and Wanapum basalt formations and into the Grande Ronde. Selected zones were hydrologically tested during coring

  4. Borehole DC-14 hydrostratigraphic chart

    International Nuclear Information System (INIS)

    Gephart, R.E.

    1981-09-01

    This hydrostratigraphic chart identifies the basic stratigraphy and preliminary hydrologic testing results for Borehole DC-14. This borehole was cored through the Saddle Mountains and Wanapum basalt formations and into the Grande Ronde. Selected zones were hydrologically tested during coring

  5. Borehole DC-15 hydrostratigraphic chart

    International Nuclear Information System (INIS)

    Gephart, R.E.

    1981-09-01

    This hydrostratigraphic chart identifies the basic stratigraphy and preliminary hydrologic testing results for Borehole DC-15. This borehole was cored through the Saddle Mountains and Wanapum basalt formations and into the Grande Ronde. Selected zones were hydrologically tested during coring

  6. NOAA Electronic Navigational Charts (ENC)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The Office of Coast Survey (OCS) has been involved in the development of a NOAA Electronic Navigational Chart (NOAA ENC) suite to support the marine transportation...

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

    Science.gov (United States)

    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.

  8. Uniform Single Valued Neutrosophic Graphs

    Directory of Open Access Journals (Sweden)

    S. Broumi

    2017-09-01

    Full Text Available In this paper, we propose a new concept named the uniform single valued neutrosophic graph. An illustrative example and some properties are examined. Next, we develop an algorithmic approach for computing the complement of the single valued neutrosophic graph. A numerical example is demonstrated for computing the complement of single valued neutrosophic graphs and uniform single valued neutrosophic graph.

  9. Collective Rationality in Graph Aggregation

    NARCIS (Netherlands)

    Endriss, U.; Grandi, U.; Schaub, T.; Friedrich, G.; O'Sullivan, B.

    2014-01-01

    Suppose a number of agents each provide us with a directed graph over a common set of vertices. Graph aggregation is the problem of computing a single “collective” graph that best represents the information inherent in this profile of individual graphs. We consider this aggregation problem from the

  10. Classical dynamics on graphs

    International Nuclear Information System (INIS)

    Barra, F.; Gaspard, P.

    2001-01-01

    We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

  11. Modern graph theory

    CERN Document Server

    Bollobás, Béla

    1998-01-01

    The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

  12. Multivariate Statistical Process Control Charts: An Overview

    OpenAIRE

    Bersimis, Sotiris; Psarakis, Stelios; Panaretos, John

    2006-01-01

    In this paper we discuss the basic procedures for the implementation of multivariate statistical process control via control charting. Furthermore, we review multivariate extensions for all kinds of univariate control charts, such as multivariate Shewhart-type control charts, multivariate CUSUM control charts and multivariate EWMA control charts. In addition, we review unique procedures for the construction of multivariate control charts, based on multivariate statistical techniques such as p...

  13. Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

    Science.gov (United States)

    Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

    2017-06-01

    Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

  14. On some covering graphs of a graph

    Directory of Open Access Journals (Sweden)

    Shariefuddin Pirzada

    2016-10-01

    Full Text Available For a graph $G$ with vertex set $V(G=\\{v_1, v_2, \\dots, v_n\\}$, let $S$ be the covering set of $G$ having the maximum degree over all the minimum covering sets of $G$. Let $N_S[v]=\\{u\\in S : uv \\in E(G \\}\\cup \\{v\\}$ be the closed neighbourhood of the vertex $v$ with respect to $S.$ We define a square matrix $A_S(G= (a_{ij},$ by $a_{ij}=1,$ if $\\left |N_S[v_i]\\cap N_S[v_j] \\right| \\geq 1, i\

  15. Fundamentals of algebraic graph transformation

    CERN Document Server

    Ehrig, Hartmut; Prange, Ulrike; Taentzer, Gabriele

    2006-01-01

    Graphs are widely used to represent structural information in the form of objects and connections between them. Graph transformation is the rule-based manipulation of graphs, an increasingly important concept in computer science and related fields. This is the first textbook treatment of the algebraic approach to graph transformation, based on algebraic structures and category theory. Part I is an introduction to the classical case of graph and typed graph transformation. In Part II basic and advanced results are first shown for an abstract form of replacement systems, so-called adhesive high-level replacement systems based on category theory, and are then instantiated to several forms of graph and Petri net transformation systems. Part III develops typed attributed graph transformation, a technique of key relevance in the modeling of visual languages and in model transformation. Part IV contains a practical case study on model transformation and a presentation of the AGG (attributed graph grammar) tool envir...

  16. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,

    2013-01-01

    This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.

  17. Graphs, groups and surfaces

    CERN Document Server

    White, AT

    1985-01-01

    The field of topological graph theory has expanded greatly in the ten years since the first edition of this book appeared. The original nine chapters of this classic work have therefore been revised and updated. Six new chapters have been added, dealing with: voltage graphs, non-orientable imbeddings, block designs associated with graph imbeddings, hypergraph imbeddings, map automorphism groups and change ringing.Thirty-two new problems have been added to this new edition, so that there are now 181 in all; 22 of these have been designated as ``difficult'''' and 9 as ``unsolved''''. Three of the four unsolved problems from the first edition have been solved in the ten years between editions; they are now marked as ``difficult''''.

  18. Profinite graphs and groups

    CERN Document Server

    Ribes, Luis

    2017-01-01

    This book offers a detailed introduction to graph theoretic methods in profinite groups and applications to abstract groups. It is the first to provide a comprehensive treatment of the subject. The author begins by carefully developing relevant notions in topology, profinite groups and homology, including free products of profinite groups, cohomological methods in profinite groups, and fixed points of automorphisms of free pro-p groups. The final part of the book is dedicated to applications of the profinite theory to abstract groups, with sections on finitely generated subgroups of free groups, separability conditions in free and amalgamated products, and algorithms in free groups and finite monoids. Profinite Graphs and Groups will appeal to students and researchers interested in profinite groups, geometric group theory, graphs and connections with the theory of formal languages. A complete reference on the subject, the book includes historical and bibliographical notes as well as a discussion of open quest...

  19. Subdominant pseudoultrametric on graphs

    Energy Technology Data Exchange (ETDEWEB)

    Dovgoshei, A A; Petrov, E A [Institute of Applied Mathematics and Mechanics, National Academy of Sciences of Ukraine, Donetsk (Ukraine)

    2013-08-31

    Let (G,w) be a weighted graph. We find necessary and sufficient conditions under which the weight w:E(G)→R{sup +} can be extended to a pseudoultrametric on V(G), and establish a criterion for the uniqueness of such an extension. We demonstrate that (G,w) is a complete k-partite graph, for k≥2, if and only if for any weight that can be extended to a pseudoultrametric, among all such extensions one can find the least pseudoultrametric consistent with w. We give a structural characterization of graphs for which the subdominant pseudoultrametric is an ultrametric for any strictly positive weight that can be extended to a pseudoultrametric. Bibliography: 14 titles.

  20. Flowcharting with D-charts

    Science.gov (United States)

    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.

  1. Quantitative graph theory mathematical foundations and applications

    CERN Document Server

    Dehmer, Matthias

    2014-01-01

    The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively. Incorporating interdisciplinary knowledge from graph theory, information theory, measurement theory, and statistical techniques, this book covers a wide range of quantitative-graph theoretical concepts and methods, including those pertaining to real and random graphs such as:Comparative approaches (graph similarity or distance)Graph measures to characterize graphs quantitat

  2. Augmented marked graphs

    CERN Document Server

    Cheung, King Sing

    2014-01-01

    Petri nets are a formal and theoretically rich model for the modelling and analysis of systems. A subclass of Petri nets, augmented marked graphs possess a structure that is especially desirable for the modelling and analysis of systems with concurrent processes and shared resources.This monograph consists of three parts: Part I provides the conceptual background for readers who have no prior knowledge on Petri nets; Part II elaborates the theory of augmented marked graphs; finally, Part III discusses the application to system integration. The book is suitable as a first self-contained volume

  3. Graph Query Portal

    OpenAIRE

    Dayal, Amit; Brock, David

    2018-01-01

    Prashant Chandrasekar, a lead developer for the Social Interactome project, has tasked the team with creating a graph representation of the data collected from the social networks involved in that project. The data is currently stored in a MySQL database. The client requested that the graph database be Cayley, but after a literature review, Neo4j was chosen. The reasons for this shift will be explained in the design section. Secondarily, the team was tasked with coming up with three scena...

  4. Spectral radius of graphs

    CERN Document Server

    Stevanovic, Dragan

    2015-01-01

    Spectral Radius of Graphs provides a thorough overview of important results on the spectral radius of adjacency matrix of graphs that have appeared in the literature in the preceding ten years, most of them with proofs, and including some previously unpublished results of the author. The primer begins with a brief classical review, in order to provide the reader with a foundation for the subsequent chapters. Topics covered include spectral decomposition, the Perron-Frobenius theorem, the Rayleigh quotient, the Weyl inequalities, and the Interlacing theorem. From this introduction, the

  5. Weldability charts for constructional steels

    International Nuclear Information System (INIS)

    Ion, J C; Ashby, M F

    2012-01-01

    The weldability of materials is still a poorly understood concept; a quantitative assessment remains elusive. The variables associated with welding are reduced here into two groups - processing parameters and material properties - from which two characteristic indices are defined and used as the basis of weldability charts. For the case of constructional steels, a carbon equivalent characterises both heat affected zone hardenability and the maximum hardness developed after solid state phase transformations. The welding process is characterised by its energy input. A mathematical model is used to establish relationships between the indices, which are displayed on charts as contours of microstructure and hardness.

  6. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-01-01

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

  7. Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

    Directory of Open Access Journals (Sweden)

    Tomasz Kajdanowicz

    2016-09-01

    Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

  8. Handbook of graph grammars and computing by graph transformation

    CERN Document Server

    Engels, G; Kreowski, H J; Rozenberg, G

    1999-01-01

    Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran

  9. Topics in graph theory graphs and their Cartesian product

    CERN Document Server

    Imrich, Wilfried; Rall, Douglas F

    2008-01-01

    From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

  10. Partitioning a call graph

    NARCIS (Netherlands)

    Bisseling, R.H.; Byrka, J.; Cerav-Erbas, S.; Gvozdenovic, N.; Lorenz, M.; Pendavingh, R.A.; Reeves, C.; Röger, M.; Verhoeven, A.; Berg, van den J.B.; Bhulai, S.; Hulshof, J.; Koole, G.; Quant, C.; Williams, J.F.

    2006-01-01

    Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system and arcs representing calls from one program to

  11. Coloring geographical threshold graphs

    Energy Technology Data Exchange (ETDEWEB)

    Bradonjic, Milan [Los Alamos National Laboratory; Percus, Allon [Los Alamos National Laboratory; Muller, Tobias [EINDHOVEN UNIV. OF TECH

    2008-01-01

    We propose a coloring algorithm for sparse random graphs generated by the geographical threshold graph (GTG) model, a generalization of random geometric graphs (RGG). In a GTG, nodes are distributed in a Euclidean space, and edges are assigned according to a threshold function involving the distance between nodes as well as randomly chosen node weights. The motivation for analyzing this model is that many real networks (e.g., wireless networks, the Internet, etc.) need to be studied by using a 'richer' stochastic model (which in this case includes both a distance between nodes and weights on the nodes). Here, we analyze the GTG coloring algorithm together with the graph's clique number, showing formally that in spite of the differences in structure between GTG and RGG, the asymptotic behavior of the chromatic number is identical: {chi}1n 1n n / 1n n (1 + {omicron}(1)). Finally, we consider the leading corrections to this expression, again using the coloring algorithm and clique number to provide bounds on the chromatic number. We show that the gap between the lower and upper bound is within C 1n n / (1n 1n n){sup 2}, and specify the constant C.

  12. Supermarket model on graphs

    NARCIS (Netherlands)

    Budhiraja, A.S.; Mukherjee, D.; Wu, R.

    2017-01-01

    We consider a variation of the supermarket model in which the servers can communicate with their neighbors and where the neighborhood relationships are described in terms of a suitable graph. Tasks with unit-exponential service time distributions arrive at each vertex as independent Poisson

  13. Basin Hopping Graph

    DEFF Research Database (Denmark)

    Kucharik, Marcel; Hofacker, Ivo; Stadler, Peter

    2014-01-01

    of the folding free energy landscape, however, can provide the relevant information. Results We introduce the basin hopping graph (BHG) as a novel coarse-grained model of folding landscapes. Each vertex of the BHG is a local minimum, which represents the corresponding basin in the landscape. Its edges connect...

  14. Safe Minimum Internal Temperature Chart

    Science.gov (United States)

    ... Internal Temperature Chart Safe steps in food handling, cooking, and storage are essential in preventing foodborne illness. You can't see, smell, or taste harmful bacteria that may cause illness. In every step of food preparation, follow the four guidelines to keep food safe: ...

  15. Borehole DC-6 hydrostratigraphic chart

    International Nuclear Information System (INIS)

    Gephart, R.E.

    1981-09-01

    This hydrostratigraphic chart for Borehole DC-6 identifies the basic stratigraphy and preliminary hydrologic test results. This borehole was cored for obtaining stratigraphic data and only that portion within the Grande Ronde formation remains open for hydrologic testing. The upper two formations were cased and cemented off

  16. AMDIS and CHART update. 1

    International Nuclear Information System (INIS)

    Murakami, I.; Kato, T.; Igarashi, A.

    2002-10-01

    A working group for updating atomic and molecular collision data in the NIFS database AMDIS (electron scattering) and CHART (ion scattering) has been organized. This group has searched and reviewed literatures for collecting relevant atomic data with are to be included into the database. This is a summary report of the activities of this working group. (author)

  17. About the National Forecast Chart

    Science.gov (United States)

    code. Press enter or select the go button to submit request Local forecast by "City, St" or Prediction Center on Twitter NCEP Quarterly Newsletter WPC Home Analyses and Forecasts National Forecast to all federal, state, and local government web resources and services. The National Forecast Charts

  18. The STAPL Parallel Graph Library

    KAUST Repository

    Harshvardhan,; Fidel, Adam; Amato, Nancy M.; Rauchwerger, Lawrence

    2013-01-01

    This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable

  19. A Clustering Graph Generator

    Energy Technology Data Exchange (ETDEWEB)

    Winlaw, Manda [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); De Sterck, Hans [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States); Sanders, Geoffrey [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    2015-10-26

    In very simple terms a network can be de ned as a collection of points joined together by lines. Thus, networks can be used to represent connections between entities in a wide variety of elds including engi- neering, science, medicine, and sociology. Many large real-world networks share a surprising number of properties, leading to a strong interest in model development research and techniques for building synthetic networks have been developed, that capture these similarities and replicate real-world graphs. Modeling these real-world networks serves two purposes. First, building models that mimic the patterns and prop- erties of real networks helps to understand the implications of these patterns and helps determine which patterns are important. If we develop a generative process to synthesize real networks we can also examine which growth processes are plausible and which are not. Secondly, high-quality, large-scale network data is often not available, because of economic, legal, technological, or other obstacles [7]. Thus, there are many instances where the systems of interest cannot be represented by a single exemplar network. As one example, consider the eld of cybersecurity, where systems require testing across diverse threat scenarios and validation across diverse network structures. In these cases, where there is no single exemplar network, the systems must instead be modeled as a collection of networks in which the variation among them may be just as important as their common features. By developing processes to build synthetic models, so-called graph generators, we can build synthetic networks that capture both the essential features of a system and realistic variability. Then we can use such synthetic graphs to perform tasks such as simulations, analysis, and decision making. We can also use synthetic graphs to performance test graph analysis algorithms, including clustering algorithms and anomaly detection algorithms.

  20. Groupies in multitype random graphs

    OpenAIRE

    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.

  1. Groupies in multitype random graphs.

    Science.gov (United States)

    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.

  2. Temporal Representation in Semantic Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Levandoski, J J; Abdulla, G M

    2007-08-07

    A wide range of knowledge discovery and analysis applications, ranging from business to biological, make use of semantic graphs when modeling relationships and concepts. Most of the semantic graphs used in these applications are assumed to be static pieces of information, meaning temporal evolution of concepts and relationships are not taken into account. Guided by the need for more advanced semantic graph queries involving temporal concepts, this paper surveys the existing work involving temporal representations in semantic graphs.

  3. Quantum walks on quotient graphs

    International Nuclear Information System (INIS)

    Krovi, Hari; Brun, Todd A.

    2007-01-01

    A discrete-time quantum walk on a graph Γ is the repeated application of a unitary evolution operator to a Hilbert space corresponding to the graph. If this unitary evolution operator has an associated group of symmetries, then for certain initial states the walk will be confined to a subspace of the original Hilbert space. Symmetries of the original graph, given by its automorphism group, can be inherited by the evolution operator. We show that a quantum walk confined to the subspace corresponding to this symmetry group can be seen as a different quantum walk on a smaller quotient graph. We give an explicit construction of the quotient graph for any subgroup H of the automorphism group and illustrate it with examples. The automorphisms of the quotient graph which are inherited from the original graph are the original automorphism group modulo the subgroup H used to construct it. The quotient graph is constructed by removing the symmetries of the subgroup H from the original graph. We then analyze the behavior of hitting times on quotient graphs. Hitting time is the average time it takes a walk to reach a given final vertex from a given initial vertex. It has been shown in earlier work [Phys. Rev. A 74, 042334 (2006)] that the hitting time for certain initial states of a quantum walks can be infinite, in contrast to classical random walks. We give a condition which determines whether the quotient graph has infinite hitting times given that they exist in the original graph. We apply this condition for the examples discussed and determine which quotient graphs have infinite hitting times. All known examples of quantum walks with hitting times which are short compared to classical random walks correspond to systems with quotient graphs much smaller than the original graph; we conjecture that the existence of a small quotient graph with finite hitting times is necessary for a walk to exhibit a quantum speedup

  4. A cegueira histérica de Adolf Hitler: histórico de um boletim médico The hysterical blindness of Adolf Hitler: record of a medical chart

    Directory of Open Access Journals (Sweden)

    Gerhard Köpf

    2006-01-01

    Full Text Available Em 1918, no hospital militar de Pasewalk, o psiquiatra professor Edmund Forster trata, por meio da hipnose, o cabo Adolf Hitler de uma "neurose de guerra" (cegueira histérica. Em 1933, Hitler assume o poder sobre a Alemanha nazista. Pouco tempo depois, Forster entra em contato com um grupo de escritores que viviam em exílio em Paris e passa sigilosamente a eles os seus conhecimentos sobre o caso. O escritor Ernst Weiss, também médico, usa essas informações de Forster para escrever o seu romance A Testemunha Ocular (Der Augenzeuge, que é publicado somente em 1963. O professor Forster comete suicídio em 1933, depois de sofrer uma campanha de denúncias difamantes. Weiss também se suicida em 1940, quando as tropas alemãs invadem Paris. Várias outras pessoas relacionadas ao boletim médico sobre Hitler são assassinadas pela Gestapo.In 1918, in a military reserve hospital located in the small Pomeranian town of Pasewalk, the neuropsychiatrist Prof. Edmund Forster treated Adolf Hitler, an Austrian caporal suffering from a war neurosis (hysterical blindness, using suggestive techniques. Soon after the Hitler’s ascension to the power in the Nazi Germany, in 1933, Dr. Forster met with a group of exiled writers living in Paris and secretly gave them the information about the case. The writer Ernst Weiss, that was also a physician, latter used this information in order to produce his roman "The Eye Witness", which would be published only in 1963. In 1933, Prof. Forster committed suicide in strange circunstances after successive defamatory statements against him. Also Weiss committed suicide in 1940, when German troops invaded Paris. The Gestapo also murdered several other persons involved in the Hitler’s medical chart.

  5. A generalization of total graphs

    Indian Academy of Sciences (India)

    M Afkhami

    2018-04-12

    Apr 12, 2018 ... product of any lower triangular matrix with the transpose of any element of U belongs to U. The ... total graph of R, which is denoted by T( (R)), is a simple graph with all elements of R as vertices, and ...... [9] Badawi A, On dot-product graph of a commutative ring, Communications in Algebra 43 (2015). 43–50.

  6. Graph transformation tool contest 2008

    NARCIS (Netherlands)

    Rensink, Arend; van Gorp, Pieter

    This special section is the outcome of the graph transformation tool contest organised during the Graph-Based Tools (GraBaTs) 2008 workshop, which took place as a satellite event of the International Conference on Graph Transformation (ICGT) 2008. The contest involved two parts: three “off-line case

  7. On dominator colorings in graphs

    Indian Academy of Sciences (India)

    colors required for a dominator coloring of G is called the dominator .... Theorem 1.3 shows that the complete graph Kn is the only connected graph of order n ... Conversely, if a graph G satisfies condition (i) or (ii), it is easy to see that χd(G) =.

  8. Topic Model for Graph Mining.

    Science.gov (United States)

    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.

  9. Algorithms for Planar Graphs and Graphs in Metric Spaces

    DEFF Research Database (Denmark)

    Wulff-Nilsen, Christian

    structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

  10. An Application of Geospatial Information Systems (GIS) Technology to Anatomic Dental Charting

    OpenAIRE

    Bartling, William C.; Schleyer, Titus K.L.

    2003-01-01

    Historically, an anatomic dental chart is a compilation of color-coded symbols and numbers used within a template, either paper or computerized, to create a graphic record of a patient’s oral health status. This poster depicts how Geospatial Information System (GIS) technology can be used to create an accurate, current anatomic dental chart that contains detailed information not present in current charting systems.

  11. A seminar on graph theory

    CERN Document Server

    Harary, Frank

    2015-01-01

    Presented in 1962-63 by experts at University College, London, these lectures offer a variety of perspectives on graph theory. Although the opening chapters form a coherent body of graph theoretic concepts, this volume is not a text on the subject but rather an introduction to the extensive literature of graph theory. The seminar's topics are geared toward advanced undergraduate students of mathematics.Lectures by this volume's editor, Frank Harary, include ""Some Theorems and Concepts of Graph Theory,"" ""Topological Concepts in Graph Theory,"" ""Graphical Reconstruction,"" and other introduc

  12. Spectral fluctuations of quantum graphs

    International Nuclear Information System (INIS)

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

    2014-01-01

    We prove the Bohigas-Giannoni-Schmit conjecture in its most general form for completely connected simple graphs with incommensurate bond lengths. We show that for graphs that are classically mixing (i.e., graphs for which the spectrum of the classical Perron-Frobenius operator possesses a finite gap), the generating functions for all (P,Q) correlation functions for both closed and open graphs coincide (in the limit of infinite graph size) with the corresponding expressions of random-matrix theory, both for orthogonal and for unitary symmetry

  13. Dynamic Representations of Sparse Graphs

    DEFF Research Database (Denmark)

    Brodal, Gerth Stølting; Fagerberg, Rolf

    1999-01-01

    We present a linear space data structure for maintaining graphs with bounded arboricity—a large class of sparse graphs containing e.g. planar graphs and graphs of bounded treewidth—under edge insertions, edge deletions, and adjacency queries. The data structure supports adjacency queries in worst...... case O(c) time, and edge insertions and edge deletions in amortized O(1) and O(c+log n) time, respectively, where n is the number of nodes in the graph, and c is the bound on the arboricity....

  14. Domination criticality in product graphs

    Directory of Open Access Journals (Sweden)

    M.R. Chithra

    2015-07-01

    Full Text Available A connected dominating set is an important notion and has many applications in routing and management of networks. Graph products have turned out to be a good model of interconnection networks. This motivated us to study the Cartesian product of graphs G with connected domination number, γc(G=2,3 and characterize such graphs. Also, we characterize the k−γ-vertex (edge critical graphs and k−γc-vertex (edge critical graphs for k=2,3 where γ denotes the domination number of G. We also discuss the vertex criticality in grids.

  15. Graph Creation, Visualisation and Transformation

    Directory of Open Access Journals (Sweden)

    Maribel Fernández

    2010-03-01

    Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

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

    Science.gov (United States)

    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

  17. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2017-04-25

    In this paper the focus is on subsampling as well as reconstructing the second-order statistics of signals residing on nodes of arbitrary undirected graphs. Second-order stationary graph signals may be obtained by graph filtering zero-mean white noise and they admit a well-defined power spectrum whose shape is determined by the frequency response of the graph filter. Estimating the graph power spectrum forms an important component of stationary graph signal processing and related inference tasks such as Wiener prediction or inpainting on graphs. The central result of this paper is that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the second-order statistics of the graph signal from the subsampled observations, and more importantly, without any spectral priors. To this end, both a nonparametric approach as well as parametric approaches including moving average and autoregressive models for the graph power spectrum are considered. The results specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non-parametric and the moving average models, whereas a particular subsampling scheme that allows linear estimation for the autoregressive model is proposed. Numerical experiments on synthetic as well as real datasets related to climatology and processing handwritten digits are provided to demonstrate the developed theory.

  18. Practical graph mining with R

    CERN Document Server

    Hendrix, William; Jenkins, John; Padmanabhan, Kanchana; Chakraborty, Arpan

    2014-01-01

    Practical Graph Mining with R presents a "do-it-yourself" approach to extracting interesting patterns from graph data. It covers many basic and advanced techniques for the identification of anomalous or frequently recurring patterns in a graph, the discovery of groups or clusters of nodes that share common patterns of attributes and relationships, the extraction of patterns that distinguish one category of graphs from another, and the use of those patterns to predict the category of new graphs. Hands-On Application of Graph Data Mining Each chapter in the book focuses on a graph mining task, such as link analysis, cluster analysis, and classification. Through applications using real data sets, the book demonstrates how computational techniques can help solve real-world problems. The applications covered include network intrusion detection, tumor cell diagnostics, face recognition, predictive toxicology, mining metabolic and protein-protein interaction networks, and community detection in social networks. De...

  19. Canonical Labelling of Site Graphs

    Directory of Open Access Journals (Sweden)

    Nicolas Oury

    2013-06-01

    Full Text Available We investigate algorithms for canonical labelling of site graphs, i.e. graphs in which edges bind vertices on sites with locally unique names. We first show that the problem of canonical labelling of site graphs reduces to the problem of canonical labelling of graphs with edge colourings. We then present two canonical labelling algorithms based on edge enumeration, and a third based on an extension of Hopcroft's partition refinement algorithm. All run in quadratic worst case time individually. However, one of the edge enumeration algorithms runs in sub-quadratic time for graphs with "many" automorphisms, and the partition refinement algorithm runs in sub-quadratic time for graphs with "few" bisimulation equivalences. This suite of algorithms was chosen based on the expectation that graphs fall in one of those two categories. If that is the case, a combined algorithm runs in sub-quadratic worst case time. Whether this expectation is reasonable remains an interesting open problem.

  20. Quality control chart for crushed granite concrete

    Directory of Open Access Journals (Sweden)

    Ewa E. DESMOND

    2016-07-01

    Full Text Available A chart for assessing in-situ grade (strength of concrete, has been developed in this study. Four grades of concrete after the Nigerian General Specification for Roads and bridges (NGSRB-C20, C25, C30 and C35, is studied at different water-cement ratios for medium and high slump range. The concrete mixes are made from crushed granite rock as coarse aggregate with river sand as fine aggregate. Compression test on specimens are conducted at curing age of 1, 3, 7, 14, 21, 28 and 56 days. Results on concrete workability from slump values, and water-cement ratios revealed that specimens with lower water-cement ratio were less workable but had higher strength, compared to mixes with higher water cement ratio. A simple algorithm using nonlinear regression analysis performed on each experimental data set produced Strength-Age (S-A curves which were used to establish a quality control chart. The accuracy of these curves were evaluated by computing average absolute error (AAS, the error of estimate (EoE and the average absolute error of estimate (Abs EoE for each concrete mix. These were done based on the actual average experimental strengths to measure how close the predicted values are to the experimental data set. The absolute average error of estimate (Abs. EoE recorded was less than ±10% tolerance zone for concrete works.

  1. A paediatric X-ray exposure chart

    Energy Technology Data Exchange (ETDEWEB)

    Knight, Stephen P, E-mail: stephen.knight@health.qld.gov.au [Department of Medical Imaging, Royal Children' s Hospital, Brisbane, Queensland (Australia)

    2014-09-15

    The aim of this review was to develop a radiographic optimisation strategy to make use of digital radiography (DR) and needle phosphor computerised radiography (CR) detectors, in order to lower radiation dose and improve image quality for paediatrics. This review was based on evidence-based practice, of which a component was a review of the relevant literature. The resulting exposure chart was developed with two distinct groups of exposure optimisation strategies – body exposures (for head, trunk, humerus, femur) and distal extremity exposures (elbow to finger, knee to toe). Exposure variables manipulated included kilovoltage peak (kVp), target detector exposure and milli-ampere-seconds (mAs), automatic exposure control (AEC), additional beam filtration, and use of antiscatter grid. Mean dose area product (DAP) reductions of up to 83% for anterior–posterior (AP)/posterior–anterior (PA) abdomen projections were recorded postoptimisation due to manipulation of multiple-exposure variables. For body exposures, the target EI and detector exposure, and thus the required mAs were typically 20% less postoptimisation. Image quality for some distal extremity exposures was improved by lowering kVp and increasing mAs around constant entrance skin dose. It is recommended that purchasing digital X-ray equipment with high detective quantum efficiency detectors, and then optimising the exposure chart for use with these detectors is of high importance for sites performing paediatric imaging. Multiple-exposure variables may need to be manipulated to achieve optimal outcomes.

  2. Learning heat diffusion graphs

    OpenAIRE

    Thanou, Dorina; Dong, Xiaowen; Kressner, Daniel; Frossard, Pascal

    2016-01-01

    Effective information analysis generally boils down to properly identifying the structure or geometry of the data, which is often represented by a graph. In some applications, this structure may be partly determined by design constraints or pre-determined sensing arrangements, like in road transportation networks for example. In general though, the data structure is not readily available and becomes pretty difficult to define. In particular, the global smoothness assumptions, that most of the...

  3. An Unusual Exponential Graph

    Science.gov (United States)

    Syed, M. Qasim; Lovatt, Ian

    2014-01-01

    This paper is an addition to the series of papers on the exponential function begun by Albert Bartlett. In particular, we ask how the graph of the exponential function y = e[superscript -t/t] would appear if y were plotted versus ln t rather than the normal practice of plotting ln y versus t. In answering this question, we find a new way to…

  4. Applied and computational harmonic analysis on graphs and networks

    Science.gov (United States)

    Irion, Jeff; Saito, Naoki

    2015-09-01

    In recent years, the advent of new sensor technologies and social network infrastructure has provided huge opportunities and challenges for analyzing data recorded on such networks. In the case of data on regular lattices, computational harmonic analysis tools such as the Fourier and wavelet transforms have well-developed theories and proven track records of success. It is therefore quite important to extend such tools from the classical setting of regular lattices to the more general setting of graphs and networks. In this article, we first review basics of graph Laplacian matrices, whose eigenpairs are often interpreted as the frequencies and the Fourier basis vectors on a given graph. We point out, however, that such an interpretation is misleading unless the underlying graph is either an unweighted path or cycle. We then discuss our recent effort of constructing multiscale basis dictionaries on a graph, including the Hierarchical Graph Laplacian Eigenbasis Dictionary and the Generalized Haar-Walsh Wavelet Packet Dictionary, which are viewed as generalizations of the classical hierarchical block DCTs and the Haar-Walsh wavelet packets, respectively, to the graph setting. Finally, we demonstrate the usefulness of our dictionaries by using them to simultaneously segment and denoise 1-D noisy signals sampled on regular lattices, a problem where classical tools have difficulty.

  5. Air Emissions Sources, Charts and Maps

    Data.gov (United States)

    U.S. Environmental Protection Agency — Air Emissions provides (1) interactive charts supporting national, state, or county charts, (2) county maps of criteria air pollutant emissions for a state, and (3)...

  6. NOAA Seamless Raster Navigational Charts (RNC)

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — The NOAA Seamless Raster Chart Server provides a seamless collarless mosaic of the NOAA Raster Navigational Charts (RNC). The RNC are a collection of approximately...

  7. Application of Bond Graph Modeling for Photovoltaic Module Simulation

    Directory of Open Access Journals (Sweden)

    Madi S.

    2016-01-01

    Full Text Available In this paper, photovoltaic generator is represented using the bond-graph methodology. Starting from the equivalent circuit the bond graph and the block diagram of the photovoltaic generator have been derived. Upon applying bond graph elements and rules a mathematical model of the photovoltaic generator is obtained. Simulation results of this obtained model using real recorded data (irradiation and temperature at the Renewable Energies Development Centre in Bouzaréah – Algeria are obtained using MATLAB/SMULINK software. The results have compared with datasheet of the photovoltaic generator for validation purposes.

  8. Recognition versus Resolution: a Comparison of Visual Acuity Results Using Two Alternative Test Chart Optotype

    Directory of Open Access Journals (Sweden)

    Jonathan S. Pointer

    2008-01-01

    Conclusions: For normally sighted subjects wearing an optimal refractive correction, a bias was recorded in favour of recognition over resolution acuity: the clinical difference amounted to approximately 40% of one logMAR chart line, with similar high repeatability for either chart optotype. We conclude that the assumption of clinical equivalence between letter and Landolt acuity is reasonable under optimum test conditions.

  9. Graphs cospectral with a friendship graph or its complement

    Directory of Open Access Journals (Sweden)

    Alireza Abdollahi

    2013-12-01

    Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

  10. International chart of the nuclides. 2001

    International Nuclear Information System (INIS)

    Golashvili, T.V.; Kupriyanov, V.M.; Lbov, A.A.

    2002-01-01

    The International Chart of Nuclides - 2001 has been developed taking into account the data obtained in 1998-2001. Unlike widespread nuclide charts the present Chart of Nuclides contains EVALUATED values of the main characteristics. These values are supplied with the standard deviations. (author)

  11. Shewhart control charts in new perspective

    NARCIS (Netherlands)

    Albers, Willem/Wim; Kallenberg, W.C.M.

    2007-01-01

    The effects of estimating parameters and the violation of the assumption of normality when dealing with control charts are discussed. Corrections for estimating errors and extensions of the normal control chart to parametric and nonparametric charts are investigated. The underlying theory is

  12. A comparative study of ICU patient diaries vs. hospital charts

    DEFF Research Database (Denmark)

    Egerod, Ingrid; Christensen, Doris

    2010-01-01

    Intensive care survivors often suffer from memory disorders, and some go on to develop anxiety, depression, and posttraumatic stress. Since the 1980s nurses have written diaries for intensive care patients to help them understand their illness and come to terms with their experiences after...... discharge. The central question we posed in this study was: Why do nurses write diaries in addition to conventional charting in the medical record? To answer this question, we compared intensive care diaries and hospital charts using textual analysis and narrative theory. The aims of our study were...... to compare patient diaries and hospital charts to explore (a) what each documentation instrument has to offer patients in their quest to make sense of their illness, and (b) why it is worthwhile for nurses to sustain the practice of writing diaries. The study findings show that the diary is coherent...

  13. Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

    DEFF Research Database (Denmark)

    Bensmail, Julien; Renault, Gabriel

    2016-01-01

    An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

  14. X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

    Science.gov (United States)

    2017-09-01

    are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

  15. Development and clinical application of a color pediatric visual acuity chart

    Directory of Open Access Journals (Sweden)

    Shu-Guo Yin

    2014-12-01

    Full Text Available AIM: To introduce a new color pediatric visual acuity chart and its clinical application.METHODS:The color pediatric visual acuity chart was designed based on principle of visual angle. The optotype on the color chart had graphics. The progression rate of optotype size between 2 lines was 10(101/2 and 1.2589. A regular geometric progression of optotype sizes and distribution was employed to arrange 8 lines with 11 optotype on the color chart. The testing distance was 3m. The visual acuity score could be recorded as logarithm of the minimum angle of resolution notation or decimal notation. The reliability of naked distant measurements with this new chart was tested in one eye of 100 children(4 ~6 years oldtaking the Chinese national standard logarithm visual acuity chart standard. RESULTS: The color pediatric visual acuity chart and logarithmic chart controls, visual acuity test results that in the two groups had no significant difference(t=1.2671, P>0.05. Two sets of vision data existed positive correlation(r=0.924, PCONCLUSION:Children are easier to accept used new color pediatric visual acuity chart to inspect vision. New chart is reliability and apply to children's vision screening.

  16. Endomorphisms of graph algebras

    DEFF Research Database (Denmark)

    Conti, Roberto; Hong, Jeong Hee; Szymanski, Wojciech

    2012-01-01

    We initiate a systematic investigation of endomorphisms of graph C*-algebras C*(E), extending several known results on endomorphisms of the Cuntz algebras O_n. Most but not all of this study is focused on endomorphisms which permute the vertex projections and globally preserve the diagonal MASA D...... that the restriction to the diagonal MASA of an automorphism which globally preserves both D_E and the core AF-subalgebra eventually commutes with the corresponding one-sided shift. Secondly, we exhibit several properties of proper endomorphisms, investigate invertibility of localized endomorphisms both on C...

  17. Total colourings of graphs

    CERN Document Server

    Yap, Hian-Poh

    1996-01-01

    This book provides an up-to-date and rapid introduction to an important and currently active topic in graph theory. The author leads the reader to the forefront of research in this area. Complete and easily readable proofs of all the main theorems, together with numerous examples, exercises and open problems are given. The book is suitable for use as a textbook or as seminar material for advanced undergraduate and graduate students. The references are comprehensive and so it will also be useful for researchers as a handbook.

  18. Graph Algorithm Animation with Grrr

    OpenAIRE

    Rodgers, Peter; Vidal, Natalia

    2000-01-01

    We discuss geometric positioning, highlighting of visited nodes and user defined highlighting that form the algorithm animation facilities in the Grrr graph rewriting programming language. The main purpose of animation was initially for the debugging and profiling of Grrr code, but recently it has been extended for the purpose of teaching algorithms to undergraduate students. The animation is restricted to graph based algorithms such as graph drawing, list manipulation or more traditional gra...

  19. Optimization Problems on Threshold Graphs

    Directory of Open Access Journals (Sweden)

    Elena Nechita

    2010-06-01

    Full Text Available During the last three decades, different types of decompositions have been processed in the field of graph theory. Among these we mention: decompositions based on the additivity of some characteristics of the graph, decompositions where the adjacency law between the subsets of the partition is known, decompositions where the subgraph induced by every subset of the partition must have predeterminate properties, as well as combinations of such decompositions. In this paper we characterize threshold graphs using the weakly decomposition, determine: density and stability number, Wiener index and Wiener polynomial for threshold graphs.

  20. Eulerian Graphs and Related Topics

    CERN Document Server

    Fleischner, Herbert

    1990-01-01

    The two volumes comprising Part 1 of this work embrace the theme of Eulerian trails and covering walks. They should appeal both to researchers and students, as they contain enough material for an undergraduate or graduate graph theory course which emphasizes Eulerian graphs, and thus can be read by any mathematician not yet familiar with graph theory. But they are also of interest to researchers in graph theory because they contain many recent results, some of which are only partial solutions to more general problems. A number of conjectures have been included as well. Various problems (such a

  1. Growth charts of human development.

    Science.gov (United States)

    van Buuren, Stef

    2014-08-01

    This article reviews and compares two types of growth charts for tracking human development over age. Both charts assume the existence of a continuous latent variable, but relate to the observed data in different ways. The D-score diagram summarizes developmental indicators into a single aggregate score measuring global development. The relations between the indicators should be consistent with the Rasch model. If true, the D-score is a measure with interval scale properties, and allows for the calculation of meaningful differences both within and across age. The stage line diagram describes the natural development of ordinal indicators. The method models the transition probabilities between successive stages of the indicator as smoothly varying functions of age. The location of each stage is quantified by the mid-P-value. Both types of diagrams assist in identifying early and delayed development, as well as finding differences in tempo. The relevant techniques are illustrated to track global development during infancy and early childhood (0-2 years) and Tanner pubertal stages (8-21 years). New reference values for both applications are provided. © The Author(s) 2013 Reprints and permissions: sagepub.co.uk/journalsPermissions.nav.

  2. Quantum Graph Analysis

    Energy Technology Data Exchange (ETDEWEB)

    Maunz, Peter Lukas Wilhelm [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Sterk, Jonathan David [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lobser, Daniel [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Parekh, Ojas D. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Ryan-Anderson, Ciaran [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-01-01

    In recent years, advanced network analytics have become increasingly important to na- tional security with applications ranging from cyber security to detection and disruption of ter- rorist networks. While classical computing solutions have received considerable investment, the development of quantum algorithms to address problems, such as data mining of attributed relational graphs, is a largely unexplored space. Recent theoretical work has shown that quan- tum algorithms for graph analysis can be more efficient than their classical counterparts. Here, we have implemented a trapped-ion-based two-qubit quantum information proces- sor to address these goals. Building on Sandia's microfabricated silicon surface ion traps, we have designed, realized and characterized a quantum information processor using the hyperfine qubits encoded in two 171 Yb + ions. We have implemented single qubit gates using resonant microwave radiation and have employed Gate set tomography (GST) to characterize the quan- tum process. For the first time, we were able to prove that the quantum process surpasses the fault tolerance thresholds of some quantum codes by demonstrating a diamond norm distance of less than 1 . 9 x 10 [?] 4 . We used Raman transitions in order to manipulate the trapped ions' motion and realize two-qubit gates. We characterized the implemented motion sensitive and insensitive single qubit processes and achieved a maximal process infidelity of 6 . 5 x 10 [?] 5 . We implemented the two-qubit gate proposed by Molmer and Sorensen and achieved a fidelity of more than 97 . 7%.

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

    Directory of Open Access Journals (Sweden)

    Mehmet Fatih Öçal

    2017-01-01

    Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

  4. ON BIPOLAR SINGLE VALUED NEUTROSOPHIC GRAPHS

    OpenAIRE

    Said Broumi; Mohamed Talea; Assia Bakali; Florentin Smarandache

    2016-01-01

    In this article, we combine the concept of bipolar neutrosophic set and graph theory. We introduce the notions of bipolar single valued neutrosophic graphs, strong bipolar single valued neutrosophic graphs, complete bipolar single valued neutrosophic graphs, regular bipolar single valued neutrosophic graphs and investigate some of their related properties.

  5. Graph Theory. 2. Vertex Descriptors and Graph Coloring

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2002-12-01

    Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

  6. On an edge partition and root graphs of some classes of line graphs

    Directory of Open Access Journals (Sweden)

    K Pravas

    2017-04-01

    Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

  7. The planar cubic Cayley graphs

    CERN Document Server

    Georgakopoulos, Agelos

    2018-01-01

    The author obtains a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. He obtains counterexamples to conjectures of Mohar, Bonnington and Watkins. The author's analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms.

  8. Groupies in random bipartite graphs

    OpenAIRE

    Yilun Shang

    2010-01-01

    A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.

  9. Nested Dynamic Condition Response Graphs

    DEFF Research Database (Denmark)

    Hildebrandt, Thomas; Mukkamala, Raghava Rao; Slaats, Tijs

    2012-01-01

    We present an extension of the recently introduced declarative process model Dynamic Condition Response Graphs ( DCR Graphs) to allow nested subgraphs and a new milestone relation between events. The extension was developed during a case study carried out jointly with our industrial partner...

  10. Bell inequalities for graph states

    International Nuclear Information System (INIS)

    Toth, G.; Hyllus, P.; Briegel, H.J.; Guehne, O.

    2005-01-01

    Full text: In the last years graph states have attracted an increasing interest in the field of quantum information theory. Graph states form a family of multi-qubit states which comprises many popular states such as the GHZ states and the cluster states. They also play an important role in applications. For instance, measurement based quantum computation uses graph states as resources. From a theoretical point of view, it is remarkable that graph states allow for a simple description in terms of stabilizing operators. In this contribution, we investigate the non-local properties of graph states. We derive a family of Bell inequalities which require three measurement settings for each party and are maximally violated by graph states. In turn, any graph state violates at least one of the inequalities. We show that for certain types of graph states the violation of these inequalities increases exponentially with the number of qubits. We also discuss connections to other entanglement properties such as the positively of the partial transpose or the geometric measure of entanglement. (author)

  11. Graph Sampling for Covariance Estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2017-01-01

    specialize for undirected circulant graphs in that the graph nodes leading to the best compression rates are given by the so-called minimal sparse rulers. A near-optimal greedy algorithm is developed to design the subsampling scheme for the non

  12. Network reconstruction via graph blending

    Science.gov (United States)

    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.

  13. A cluster algorithm for graphs

    NARCIS (Netherlands)

    S. van Dongen

    2000-01-01

    textabstractA cluster algorithm for graphs called the emph{Markov Cluster algorithm (MCL~algorithm) is introduced. The algorithm provides basically an interface to an algebraic process defined on stochastic matrices, called the MCL~process. The graphs may be both weighted (with nonnegative weight)

  14. Planar graphs theory and algorithms

    CERN Document Server

    Nishizeki, T

    1988-01-01

    Collected in this volume are most of the important theorems and algorithms currently known for planar graphs, together with constructive proofs for the theorems. Many of the algorithms are written in Pidgin PASCAL, and are the best-known ones; the complexities are linear or 0(nlogn). The first two chapters provide the foundations of graph theoretic notions and algorithmic techniques. The remaining chapters discuss the topics of planarity testing, embedding, drawing, vertex- or edge-coloring, maximum independence set, subgraph listing, planar separator theorem, Hamiltonian cycles, and single- or multicommodity flows. Suitable for a course on algorithms, graph theory, or planar graphs, the volume will also be useful for computer scientists and graph theorists at the research level. An extensive reference section is included.

  15. Quantum chaos on discrete graphs

    International Nuclear Information System (INIS)

    Smilansky, Uzy

    2007-01-01

    Adapting a method developed for the study of quantum chaos on quantum (metric) graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76), spectral ζ functions and trace formulae for discrete Laplacians on graphs are derived. This is achieved by expressing the spectral secular equation in terms of the periodic orbits of the graph and obtaining functions which belong to the class of ζ functions proposed originally by Ihara (1966 J. Mat. Soc. Japan 18 219) and expanded by subsequent authors (Stark and Terras 1996 Adv. Math. 121 124, Kotani and Sunada 2000 J. Math. Sci. Univ. Tokyo 7 7). Finally, a model of 'classical dynamics' on the discrete graph is proposed. It is analogous to the corresponding classical dynamics derived for quantum graphs (Kottos and Smilansky 1997 Phys. Rev. Lett. 79 4794, Kottos and Smilansky 1999 Ann. Phys., NY 274 76). (fast track communication)

  16. RJSplot: Interactive Graphs with R.

    Science.gov (United States)

    Barrios, David; Prieto, Carlos

    2018-03-01

    Data visualization techniques provide new methods for the generation of interactive graphs. These graphs allow a better exploration and interpretation of data but their creation requires advanced knowledge of graphical libraries. Recent packages have enabled the integration of interactive graphs in R. However, R provides limited graphical packages that allow the generation of interactive graphs for computational biology applications. The present project has joined the analytical power of R with the interactive graphical features of JavaScript in a new R package (RJSplot). It enables the easy generation of interactive graphs in R, provides new visualization capabilities, and contributes to the advance of computational biology analytical methods. At present, 16 interactive graphics are available in RJSplot, such as the genome viewer, Manhattan plots, 3D plots, heatmaps, dendrograms, networks, and so on. The RJSplot package is freely available online at http://rjsplot.net. © 2018 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim.

  17. On characterizing terrain visibility graphs

    Directory of Open Access Journals (Sweden)

    William Evans

    2015-06-01

    Full Text Available A terrain is an $x$-monotone polygonal line in the $xy$-plane. Two vertices of a terrain are mutually visible if and only if there is no terrain vertex on or above the open line segment connecting them. A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. We would like to find properties that are both necessary and sufficient for a graph to be a terrain visibility graph; that is, we would like to characterize terrain visibility graphs.Abello et al. [Discrete and Computational Geometry, 14(3:331--358, 1995] showed that all terrain visibility graphs are “persistent”. They showed that the visibility information of a terrain point set implies some ordering requirements on the slopes of the lines connecting pairs of points in any realization, and as a step towards showing sufficiency, they proved that for any persistent graph $M$ there is a total order on the slopes of the (pseudo lines in a generalized configuration of points whose visibility graph is $M$.We give a much simpler proof of this result by establishing an orientation to every triple of vertices, reflecting some slope ordering requirements that are consistent with $M$ being the visibility graph, and prove that these requirements form a partial order. We give a faster algorithm to construct a total order on the slopes. Our approach attempts to clarify the implications of the graph theoretic properties on the ordering of the slopes, and may be interpreted as defining properties on an underlying oriented matroid that we show is a restricted type of $3$-signotope.

  18. Graph embedding with rich information through heterogeneous graph

    KAUST Repository

    Sun, Guolei

    2017-11-12

    Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

  19. CORECLUSTER: A Degeneracy Based Graph Clustering Framework

    OpenAIRE

    Giatsidis , Christos; Malliaros , Fragkiskos; Thilikos , Dimitrios M. ,; Vazirgiannis , Michalis

    2014-01-01

    International audience; Graph clustering or community detection constitutes an important task forinvestigating the internal structure of graphs, with a plethora of applications in several domains. Traditional tools for graph clustering, such asspectral methods, typically suffer from high time and space complexity. In thisarticle, we present \\textsc{CoreCluster}, an efficient graph clusteringframework based on the concept of graph degeneracy, that can be used along withany known graph clusteri...

  20. [A blood glucose slide chart for improving diabetes patient education].

    Science.gov (United States)

    Potteau, Marie-Hélène

    2015-03-01

    A blood glucose slide chart has been developed in order to help patients with type 2 diabetes who do not speak French or who have comprehension difficulties. Combined with pictograms to help patients visualise the action they need to take depending on the recorded glucose level, it constitutes a therapeutic education tool which can be useful on a day-to-day basis both for patients as well as caregivers.

  1. Making SPC easier with zone control charts

    International Nuclear Information System (INIS)

    Lanning, B.

    1995-01-01

    The zone control chart is a simple, easy to learn statistical process control (SPC) tool that can be applied to any process where the data are normally distributed. Several Shewhart runs rules are incorporated into a simple scoring system, with a single rule to determine when a process is out of control. Zone charts have average run lengths (ARLs) for detecting shifts in the process mean which, for most cases, are uniformly better than the standard control charts. This paper presents the simplified methodology behind the zone control chart

  2. de Sitter relativity in static charts

    Energy Technology Data Exchange (ETDEWEB)

    Cotaescu, Ion I. [West University of Timisoara, Timisoara (Romania)

    2018-02-15

    The relative geodesic motion in static (and spherically symmetric) local charts on the (1 + 3)-dimensional de Sitter spacetimes is studied in terms of conserved quantities. The Lorentzian isometries are derived, relating the coordinates of the local chart of a fixed observer with the coordinates of a mobile chart considered as the rest frame of a massive particle freely moving on a timelike geodesic. The time dilation and Lorentz contraction are discussed pointing out some notable features of the de Sitter relativity in static charts. (orig.)

  3. NuChart: an R package to study gene spatial neighbourhoods with multi-omics annotations.

    Directory of Open Access Journals (Sweden)

    Ivan Merelli

    Full Text Available Long-range chromosomal associations between genomic regions, and their repositioning in the 3D space of the nucleus, are now considered to be key contributors to the regulation of gene expression and important links have been highlighted with other genomic features involved in DNA rearrangements. Recent Chromosome Conformation Capture (3C measurements performed with high throughput sequencing (Hi-C and molecular dynamics studies show that there is a large correlation between colocalization and coregulation of genes, but these important researches are hampered by the lack of biologists-friendly analysis and visualisation software. Here, we describe NuChart, an R package that allows the user to annotate and statistically analyse a list of input genes with information relying on Hi-C data, integrating knowledge about genomic features that are involved in the chromosome spatial organization. NuChart works directly with sequenced reads to identify the related Hi-C fragments, with the aim of creating gene-centric neighbourhood graphs on which multi-omics features can be mapped. Predictions about CTCF binding sites, isochores and cryptic Recombination Signal Sequences are provided directly with the package for mapping, although other annotation data in bed format can be used (such as methylation profiles and histone patterns. Gene expression data can be automatically retrieved and processed from the Gene Expression Omnibus and ArrayExpress repositories to highlight the expression profile of genes in the identified neighbourhood. Moreover, statistical inferences about the graph structure and correlations between its topology and multi-omics features can be performed using Exponential-family Random Graph Models. The Hi-C fragment visualisation provided by NuChart allows the comparisons of cells in different conditions, thus providing the possibility of novel biomarkers identification. NuChart is compliant with the Bioconductor standard and it is freely

  4. Hierarchy of modular graph identities

    International Nuclear Information System (INIS)

    D’Hoker, Eric; Kaidi, Justin

    2016-01-01

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  5. Semantic graphs and associative memories

    Science.gov (United States)

    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.

  6. Hierarchy of modular graph identities

    Energy Technology Data Exchange (ETDEWEB)

    D’Hoker, Eric; Kaidi, Justin [Mani L. Bhaumik Institute for Theoretical Physics, Department of Physics and Astronomy,University of California,Los Angeles, CA 90095 (United States)

    2016-11-09

    The low energy expansion of Type II superstring amplitudes at genus one is organized in terms of modular graph functions associated with Feynman graphs of a conformal scalar field on the torus. In earlier work, surprising identities between two-loop graphs at all weights, and between higher-loop graphs of weights four and five were constructed. In the present paper, these results are generalized in two complementary directions. First, all identities at weight six and all dihedral identities at weight seven are obtained and proven. Whenever the Laurent polynomial at the cusp is available, the form of these identities confirms the pattern by which the vanishing of the Laurent polynomial governs the full modular identity. Second, the family of modular graph functions is extended to include all graphs with derivative couplings and worldsheet fermions. These extended families of modular graph functions are shown to obey a hierarchy of inhomogeneous Laplace eigenvalue equations. The eigenvalues are calculated analytically for the simplest infinite sub-families and obtained by Maple for successively more complicated sub-families. The spectrum is shown to consist solely of eigenvalues s(s−1) for positive integers s bounded by the weight, with multiplicities which exhibit rich representation-theoretic patterns.

  7. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael I.

    2011-01-01

    of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey the use of XML graphs for program analysis with four very different languages: XACT (XML in Java), Java Servlets (Web application programming), XSugar......XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...

  8. Coloring and The Lonely Graph

    OpenAIRE

    Rabern, Landon

    2007-01-01

    We improve upper bounds on the chromatic number proven independently in \\cite{reedNote} and \\cite{ingo}. Our main lemma gives a sufficient condition for two paths in graph to be completely joined. Using this, we prove that if a graph has an optimal coloring with more than $\\frac{\\omega}{2}$ singleton color classes, then it satisfies $\\chi \\leq \\frac{\\omega + \\Delta + 1}{2}$. It follows that a graph satisfying $n - \\Delta < \\alpha + \\frac{\\omega - 1}{2}$ must also satisfy $\\chi \\leq \\frac{\\ome...

  9. Graphs with Eulerian unit spheres

    OpenAIRE

    Knill, Oliver

    2015-01-01

    d-spheres in graph theory are inductively defined as graphs for which all unit spheres S(x) are (d-1)-spheres and that the removal of one vertex renders the graph contractible. Eulerian d-spheres are geometric d-spheres which are d+1 colorable. We prove here that G is an Eulerian sphere if and only if the degrees of all the (d-2)-dimensional sub-simplices in G are even. This generalizes a Kempe-Heawood result for d=2 and is work related to the conjecture that all d-spheres have chromatic numb...

  10. Isomers chart; Table des isomeres

    Energy Technology Data Exchange (ETDEWEB)

    Dupont-Gautier, P; Chantelot, S; Moisson, N [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1967-07-01

    The nuclear isomers are nuclides offering the same mass number and the same atomic number, but different energy levels. In the following chart the zero energy ground states are omitted and the metastable isomers, i.e. of non-zero energy, known and of measurable lifetime, are listed. The lower limit of this lifetime was set here to 0.1 x 10{sup -6} s. The various isomers were classified in increasing lifetimes. (authors) [French] Les isomeres nucleaires sont des nucleides presentant le meme nombre de masse et le meme numero atomique, mais des niveaux energetiques differents. Dans la table suivante, on a neglige les etats fondamentaux d'energie nulle et on a recense les isomeres metastables, c'est-a-dire d'energie non nulle, connus et de periode mesurable. La limite inferieure de cette periode a ete fixee ici a 0,1 x 10{sup -6} s. Les differents isomeres ont ete classes par periodes croissantes. (auteurs)

  11. Isomers chart; Table des isomeres

    Energy Technology Data Exchange (ETDEWEB)

    Dupont-Gautier, P.; Chantelot, S.; Moisson, N. [Commissariat a l' Energie Atomique, Saclay (France). Centre d' Etudes Nucleaires

    1967-07-01

    The nuclear isomers are nuclides offering the same mass number and the same atomic number, but different energy levels. In the following chart the zero energy ground states are omitted and the metastable isomers, i.e. of non-zero energy, known and of measurable lifetime, are listed. The lower limit of this lifetime was set here to 0.1 x 10{sup -6} s. The various isomers were classified in increasing lifetimes. (authors) [French] Les isomeres nucleaires sont des nucleides presentant le meme nombre de masse et le meme numero atomique, mais des niveaux energetiques differents. Dans la table suivante, on a neglige les etats fondamentaux d'energie nulle et on a recense les isomeres metastables, c'est-a-dire d'energie non nulle, connus et de periode mesurable. La limite inferieure de cette periode a ete fixee ici a 0,1 x 10{sup -6} s. Les differents isomeres ont ete classes par periodes croissantes. (auteurs)

  12. Color Charts, Esthetics, and Subjective Randomness

    Science.gov (United States)

    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…

  13. Obtaining the Andersen's chart, triangulation algorithm

    DEFF Research Database (Denmark)

    Sabaliauskas, Tomas; Ibsen, Lars Bo

    Andersen’s chart (Andersen & Berre, 1999) is a graphical method of observing cyclic soil response. It allows observing soil response to various stress amplitudes that can lead to liquefaction, excess plastic deformation or stabilizing soil response. The process of obtaining the original chart has...

  14. Software tool for physics chart checks.

    Science.gov (United States)

    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.

  15. SMART AERONAUTICAL CHART MANAGEMENT SYSTEM DESIGN

    Directory of Open Access Journals (Sweden)

    M. E. Pakdil

    2015-10-01

    Full Text Available 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.

  16. 49 CFR 236.718 - Chart, dog.

    Science.gov (United States)

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

  17. Robust control charts in statistical process control

    NARCIS (Netherlands)

    Nazir, H.Z.

    2014-01-01

    The presence of outliers and contaminations in the output of the process highly affects the performance of the design structures of commonly used control charts and hence makes them of less practical use. One of the solutions to deal with this problem is to use control charts which are robust

  18. Robust Control Charts for Time Series Data

    NARCIS (Netherlands)

    Croux, C.; Gelper, S.; Mahieu, K.

    2010-01-01

    This article presents a control chart for time series data, based on the one-step- ahead forecast errors of the Holt-Winters forecasting method. We use robust techniques to prevent that outliers affect the estimation of the control limits of the chart. Moreover, robustness is important to maintain

  19. Chart of the nuclides - Strasbourg 1990

    International Nuclear Information System (INIS)

    Antony, M.S.

    1991-01-01

    Data were compiled for a nuclide chart over the last two years. The compilation is complete to the end of September 1990. The chart includes about 30000 data. Decay modes are represented by colours. Announcement capabilities and prices are given. (G.P.) 3 refs

  20. Stocking chart for upland central hardwoods

    Science.gov (United States)

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

  1. The Conjugate Acid-Base Chart.

    Science.gov (United States)

    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)

  2. 47 CFR 73.333 - Engineering charts.

    Science.gov (United States)

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

  3. Evolutionary games on graphs

    Science.gov (United States)

    Szabó, György; Fáth, Gábor

    2007-07-01

    Game theory is one of the key paradigms behind many scientific disciplines from biology to behavioral sciences to economics. In its evolutionary form and especially when the interacting agents are linked in a specific social network the underlying solution concepts and methods are very similar to those applied in non-equilibrium statistical physics. This review gives a tutorial-type overview of the field for physicists. The first four sections introduce the necessary background in classical and evolutionary game theory from the basic definitions to the most important results. The fifth section surveys the topological complications implied by non-mean-field-type social network structures in general. The next three sections discuss in detail the dynamic behavior of three prominent classes of models: the Prisoner's Dilemma, the Rock-Scissors-Paper game, and Competing Associations. The major theme of the review is in what sense and how the graph structure of interactions can modify and enrich the picture of long term behavioral patterns emerging in evolutionary games.

  4. Properly colored connectivity of graphs

    CERN Document Server

    Li, Xueliang; Qin, Zhongmei

    2018-01-01

    A comprehensive survey of proper connection of graphs is discussed in this book with real world applications in computer science and network security. Beginning with a brief introduction, comprising relevant definitions and preliminary results, this book moves on to consider a variety of properties of graphs that imply bounds on the proper connection number. Detailed proofs of significant advancements toward open problems and conjectures are presented with complete references. Researchers and graduate students with an interest in graph connectivity and colorings will find this book useful as it builds upon fundamental definitions towards modern innovations, strategies, and techniques. The detailed presentation lends to use as an introduction to proper connection of graphs for new and advanced researchers, a solid book for a graduate level topics course, or as a reference for those interested in expanding and further developing research in the area.

  5. Graph anomalies in cyber communications

    Energy Technology Data Exchange (ETDEWEB)

    Vander Wiel, Scott A [Los Alamos National Laboratory; Storlie, Curtis B [Los Alamos National Laboratory; Sandine, Gary [Los Alamos National Laboratory; Hagberg, Aric A [Los Alamos National Laboratory; Fisk, Michael [Los Alamos National Laboratory

    2011-01-11

    Enterprises monitor cyber traffic for viruses, intruders and stolen information. Detection methods look for known signatures of malicious traffic or search for anomalies with respect to a nominal reference model. Traditional anomaly detection focuses on aggregate traffic at central nodes or on user-level monitoring. More recently, however, traffic is being viewed more holistically as a dynamic communication graph. Attention to the graph nature of the traffic has expanded the types of anomalies that are being sought. We give an overview of several cyber data streams collected at Los Alamos National Laboratory and discuss current work in modeling the graph dynamics of traffic over the network. We consider global properties and local properties within the communication graph. A method for monitoring relative entropy on multiple correlated properties is discussed in detail.

  6. Open Graphs and Computational Reasoning

    Directory of Open Access Journals (Sweden)

    Lucas Dixon

    2010-06-01

    Full Text Available We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of half-edges (edges which are drawn with an unconnected end and enjoy rich compositional principles by connecting graphs along these half-edges. In particular, this allows equations and rewrite rules to be specified between graphs. Particular computational models can then be encoded as an axiomatic set of such rules. Further rules can be derived graphically and rewriting can be used to simulate the dynamics of a computational system, e.g. evaluating a program on an input. Examples of models which can be formalised in this way include traditional electronic circuits as well as recent categorical accounts of quantum information.

  7. The toughness of split graphs

    NARCIS (Netherlands)

    Woeginger, G.J.

    1998-01-01

    In this short note we argue that the toughness of split graphs can be computed in polynomial time. This solves an open problem from a recent paper by Kratsch et al. (Discrete Math. 150 (1996) 231–245).

  8. Generating random networks and graphs

    CERN Document Server

    Coolen, Ton; Roberts, Ekaterina

    2017-01-01

    This book supports researchers who need to generate random networks, or who are interested in the theoretical study of random graphs. The coverage includes exponential random graphs (where the targeted probability of each network appearing in the ensemble is specified), growth algorithms (i.e. preferential attachment and the stub-joining configuration model), special constructions (e.g. geometric graphs and Watts Strogatz models) and graphs on structured spaces (e.g. multiplex networks). The presentation aims to be a complete starting point, including details of both theory and implementation, as well as discussions of the main strengths and weaknesses of each approach. It includes extensive references for readers wishing to go further. The material is carefully structured to be accessible to researchers from all disciplines while also containing rigorous mathematical analysis (largely based on the techniques of statistical mechanics) to support those wishing to further develop or implement the theory of rand...

  9. Social Mathematics and Media: Using Pictures, Maps, Charts, and Graphs. Media Corner.

    Science.gov (United States)

    Braun, Joseph A., Jr., Ed.

    1993-01-01

    Asserts that integrating disciplines is a goal of elementary social studies education. Presents a bibliographic essay describing instructional materials that can be used to integrate mathematics and social studies. Includes recommended photograph packages, computer databases, and data interpretation packages. (CFR)

  10. State Authorization Tracking System (StATS) - Data, Charts and Graphs

    Data.gov (United States)

    U.S. Environmental Protection Agency — The State Authorization Tracking System (StATS) is an information management system designed to document the progress of each state and territory in establishing and...

  11. Graph theory and its applications

    CERN Document Server

    Gross, Jonathan L

    2006-01-01

    Gross and Yellen take a comprehensive approach to graph theory that integrates careful exposition of classical developments with emerging methods, models, and practical needs. Their unparalleled treatment provides a text ideal for a two-semester course and a variety of one-semester classes, from an introductory one-semester course to courses slanted toward classical graph theory, operations research, data structures and algorithms, or algebra and topology.

  12. A faithful functor among algebras and graphs

    OpenAIRE

    Falcón Ganfornina, Óscar Jesús; Falcón Ganfornina, Raúl Manuel; Núñez Valdés, Juan; Pacheco Martínez, Ana María; Villar Liñán, María Trinidad; Vigo Aguiar, Jesús (Coordinador)

    2016-01-01

    The problem of identifying a functor between the categories of algebras and graphs is currently open. Based on a known algorithm that identifies isomorphisms of Latin squares with isomorphism of vertex-colored graphs, we describe here a pair of graphs that enable us to find a faithful functor between finite-dimensional algebras over finite fields and these graphs.

  13. Graphs with branchwidth at most three

    NARCIS (Netherlands)

    Bodlaender, H.L.; Thilikos, D.M.

    1997-01-01

    In this paper we investigate both the structure of graphs with branchwidth at most three, as well as algorithms to recognise such graphs. We show that a graph has branchwidth at most three, if and only if it has treewidth at most three and does not contain the three-dimensional binary cube graph

  14. A Modal-Logic Based Graph Abstraction

    NARCIS (Netherlands)

    Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

    2008-01-01

    Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

  15. Graphs whose complement and square are isomorphic

    DEFF Research Database (Denmark)

    Pedersen, Anders Sune

    2014-01-01

    We study square-complementary graphs, that is, graphs whose complement and square are isomorphic. We prove several necessary conditions for a graph to be square-complementary, describe ways of building new square-complementary graphs from existing ones, construct infinite families of square-compl...

  16. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type...

  17. Building Scalable Knowledge Graphs for Earth Science

    Science.gov (United States)

    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.

  18. Port-Hamiltonian Systems on Open Graphs

    NARCIS (Netherlands)

    Schaft, A.J. van der; Maschke, B.M.

    2010-01-01

    In this talk we discuss how to define in an intrinsic manner port-Hamiltonian dynamics on open graphs. Open graphs are graphs where some of the vertices are boundary vertices (terminals), which allow interconnection with other systems. We show that a directed graph carries two natural Dirac

  19. Constructing Dense Graphs with Unique Hamiltonian Cycles

    Science.gov (United States)

    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…

  20. Skew-adjacency matrices of graphs

    NARCIS (Netherlands)

    Cavers, M.; Cioaba, S.M.; Fallat, S.; Gregory, D.A.; Haemers, W.H.; Kirkland, S.J.; McDonald, J.J.; Tsatsomeros, M.

    2012-01-01

    The spectra of the skew-adjacency matrices of a graph are considered as a possible way to distinguish adjacency cospectral graphs. This leads to the following topics: graphs whose skew-adjacency matrices are all cospectral; relations between the matchings polynomial of a graph and the characteristic

  1. Chromatic polynomials of random graphs

    International Nuclear Information System (INIS)

    Van Bussel, Frank; Fliegner, Denny; Timme, Marc; Ehrlich, Christoph; Stolzenberg, Sebastian

    2010-01-01

    Chromatic polynomials and related graph invariants are central objects in both graph theory and statistical physics. Computational difficulties, however, have so far restricted studies of such polynomials to graphs that were either very small, very sparse or highly structured. Recent algorithmic advances (Timme et al 2009 New J. Phys. 11 023001) now make it possible to compute chromatic polynomials for moderately sized graphs of arbitrary structure and number of edges. Here we present chromatic polynomials of ensembles of random graphs with up to 30 vertices, over the entire range of edge density. We specifically focus on the locations of the zeros of the polynomial in the complex plane. The results indicate that the chromatic zeros of random graphs have a very consistent layout. In particular, the crossing point, the point at which the chromatic zeros with non-zero imaginary part approach the real axis, scales linearly with the average degree over most of the density range. While the scaling laws obtained are purely empirical, if they continue to hold in general there are significant implications: the crossing points of chromatic zeros in the thermodynamic limit separate systems with zero ground state entropy from systems with positive ground state entropy, the latter an exception to the third law of thermodynamics.

  2. Commuting graphs of matrix algebras

    International Nuclear Information System (INIS)

    Akbari, S.; Bidkhori, H.; Mohammadian, A.

    2006-08-01

    The commuting graph of a ring R, denoted by Γ(R), is a graph whose vertices are all non- central elements of R and two distinct vertices x and y are adjacent if and only if xy = yx. The commuting graph of a group G, denoted by Γ(G), is similarly defined. In this paper we investigate some graph theoretic properties of Γ(M n (F)), where F is a field and n ≥ 2. Also we study the commuting graphs of some classical groups such as GL n (F) and SL n (F). We show that Γ(M n (F)) is a connected graph if and only if every field extension of F of degree n contains a proper intermediate field. We prove that apart from finitely many fields, a similar result is true for Γ(GL n (F)) and Γ(SL n (F)). Also we show that for two fields E and F and integers m, n ≥> 2, if Γ(M m (E)) ≅ Γ(M n (F)), then m = n and vertical bar E vertical bar = vertical bar F vertical bar. (author)

  3. FusionCharts Beginner's Guide The Official Guide for FusionCharts Suite

    CERN Document Server

    Nadhani, Sanket; Bhattacharya, Shamasis

    2012-01-01

    The book is written as a practical, step-by-step guide to using FusionCharts Suite. The book not only teaches you the fundamentals and implementation of FusionCharts Suite, but also makes you the data visualization guru among your friends and colleagues by teaching how to select the right chart type and usability tips. Filled with examples, code samples and practical tips in a no-nonsense way, the book is a breeze to read.This book is both for beginners and advanced web developers who need to create interactive charts for their web applications. No previous knowledge of FusionCharts Suite is a

  4. Growth charts for Australian children with achondroplasia.

    Science.gov (United States)

    Tofts, Louise; Das, Sandeep; Collins, Felicity; Burton, Karen L O

    2017-08-01

    Achondroplasia is an autosomal dominant disorder, the most common genetic cause of short stature in humans. Reference curves for head circumference, weight, height, and BMI are needed in clinical practice but none exist for the Australian population. This study aimed to produce head circumference, height, weight, and BMI reference percentile curves for Australian children and adolescents with achondroplasia. Measurements of head circumference, height and weight taken at clinical visits were retrospectively extracted from the electronic medical record. Age was corrected for prematurity. Patients were excluded from head circumference analysis if they had significant neurosurgical complications and from the weight and BMI analysis when they had a clinical diagnosis of overweight. Measurements were available on 138 individuals (69 males and 69 females) taken between 1970 and 2015, with over 50% collected since 2005. A total of 3,352 data points were available. The LMS method was used to produce growth charts with estimated centiles (10, 25, 50, 75, and 90th) separately for males and females. For females birth weight was 3 kg (2.5-3.5 kg), birth length 48 cm (44-50 cm) and head circumference 37.5 cm (36-39 cm), adult height was 125 cm (116-132 cm), weight 42 kg (34-54 kg), and head circumference 58 cm (55.5-60.5 cm) all 50th centile (10-90th). For males birth weight was 3.5 kg (3-4 kg), length 49 cm (46-52 cm) and head circumference 38.5 cm (36-41 cm), adult height was 134 cm (125-141 cm), weight 41 kg (24.5-57 kg) and head circumference 61 cm (58-64 cm). The curves are similar to previously published reference data from the USA and have expected population wide variation from curves from an Argentinian population. Despite limitations of our curves for adolescents (12 years and older) due to data paucity, these Australian growth charts for children and adolescents with achondroplasia will be a useful reference in clinical

  5. Exploring Text and Icon Graph Interpretation in Students with Dyslexia: An Eye-tracking Study.

    Science.gov (United States)

    Kim, Sunjung; Wiseheart, Rebecca

    2017-02-01

    A growing body of research suggests that individuals with dyslexia struggle to use graphs efficiently. Given the persistence of orthographic processing deficits in dyslexia, this study tested whether graph interpretation deficits in dyslexia are directly related to difficulties processing the orthographic components of graphs (i.e. axes and legend labels). Participants were 80 college students with and without dyslexia. Response times and eye movements were recorded as students answered comprehension questions about simple data displayed in bar graphs. Axes and legends were labelled either with words (mixed-modality graphs) or icons (orthography-free graphs). Students also answered informationally equivalent questions presented in sentences (orthography-only condition). Response times were slower in the dyslexic group only for processing sentences. However, eye tracking data revealed group differences for processing mixed-modality graphs, whereas no group differences were found for the orthography-free graphs. When processing bar graphs, students with dyslexia differ from their able reading peers only when graphs contain orthographic features. Implications for processing informational text are discussed. Copyright © 2017 John Wiley & Sons, Ltd. Copyright © 2017 John Wiley & Sons, Ltd.

  6. Graph Quasicontinuous Functions and Densely Continuous Forms

    Directory of Open Access Journals (Sweden)

    Lubica Hola

    2017-07-01

    Full Text Available Let $X, Y$ be topological spaces. A function $f: X \\to Y$ is said to be graph quasicontinuous if there is a quasicontinuous function $g: X \\to Y$ with the graph of $g$ contained in the closure of the graph of $f$. There is a close relation between the notions of graph quasicontinuous functions and minimal usco maps as well as the notions of graph quasicontinuous functions and densely continuous forms. Every function with values in a compact Hausdorff space is graph quasicontinuous; more generally every locally compact function is graph quasicontinuous.

  7. Interactive Graph Layout of a Million Nodes

    OpenAIRE

    Peng Mi; Maoyuan Sun; Moeti Masiane; Yong Cao; Chris North

    2016-01-01

    Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph to...

  8. Khovanov homology of graph-links

    Energy Technology Data Exchange (ETDEWEB)

    Nikonov, Igor M [M. V. Lomonosov Moscow State University, Faculty of Mechanics and Mathematics, Moscow (Russian Federation)

    2012-08-31

    Graph-links arise as the intersection graphs of turning chord diagrams of links. Speaking informally, graph-links provide a combinatorial description of links up to mutations. Many link invariants can be reformulated in the language of graph-links. Khovanov homology, a well-known and useful knot invariant, is defined for graph-links in this paper (in the case of the ground field of characteristic two). Bibliography: 14 titles.

  9. Google Charts Testing | CRDI - Centre de recherches pour le ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    Google Charts Testing. The following item is a demo of Google GeoChart. Please note that geo chart can only recognize country name or city name rather than location or address (that is google my map's expertise). Additionally, Geo chart does support title and legend. To render geo chart properly, please get a ...

  10. PRIVATE GRAPHS – ACCESS RIGHTS ON GRAPHS FOR SEAMLESS NAVIGATION

    Directory of Open Access Journals (Sweden)

    W. Dorner

    2016-06-01

    Full Text Available After the success of GNSS (Global Navigational Satellite Systems and navigation services for public streets, indoor seems to be the next big development in navigational services, relying on RTLS – Real Time Locating Services (e.g. WIFI and allowing seamless navigation. In contrast to navigation and routing services on public streets, seamless navigation will cause an additional challenge: how to make routing data accessible to defined users or restrict access rights for defined areas or only to parts of the graph to a defined user group? The paper will present case studies and data from literature, where seamless and especially indoor navigation solutions are presented (hospitals, industrial complexes, building sites, but the problem of restricted access rights was only touched from a real world, but not a technical perspective. The analysis of case studies will show, that the objective of navigation and the different target groups for navigation solutions will demand well defined access rights and require solutions, how to make only parts of a graph to a user or application available to solve a navigational task. The paper will therefore introduce the concept of private graphs, which is defined as a graph for navigational purposes covering the street, road or floor network of an area behind a public street and suggest different approaches how to make graph data for navigational purposes available considering access rights and data protection, privacy and security issues as well.

  11. Developing the Collection Graph

    NARCIS (Netherlands)

    Blanke, Tobias; Bryant, Michael; Speck, Reto

    2015-01-01

    Library Hi Tech, Volume 33, Issue 4, November 2015. Purpose In 2010 the European Holocaust Research Infrastructure (EHRI) was funded to support research into the Holocaust. The project follows on from significant efforts in the past to develop and record the collections of the Holocaust in several

  12. Karlsruhe nuclide chart - new 9. edition 2015

    Energy Technology Data Exchange (ETDEWEB)

    Soti, Zsolt [European Commission, Joint Research Centre (JRC), Institute for Transuranium Elements (ITU), Postfach 2340, DE-76125 Karlsruhe, (Germany); Magill, Joseph; Pfennig, Gerda; Derher, Raymond [Nucleonica GmbH, c/o European Commission, Postfach 2340, DE-76125 Karlsruhe, (Germany)

    2015-07-01

    Following the success of the 8. Edition of the Karlsruhe Nuclide Chart 2012, a new edition is planned for 2015. Since the 2012 edition, more than 100 nuclides have been discovered and about 1400 nuclides have been updated. In summary, the new 9. edition contains decay and radiation data on approximately 3230 ground state nuclides and 740 isomers from 118 chemical elements. The accompanying booklet provides a detailed explanation of the nuclide box structure used in the Chart. An expanded section contains many additional nuclide decay schemes to aid the user to interpret the highly condensed information in the nuclide boxes. The booklet contains - in addition to the latest values of the physical constants and physical properties - a periodic table of the elements, tables of new and updated nuclides, and a difference chart showing the main changes in the Chart graphically. (authors)

  13. Handbook of thermodynamic tables and charts

    International Nuclear Information System (INIS)

    Raznjevic, K.

    1976-01-01

    A compilation of thermodynamic and thermophysical tables and charts is presented. Numerical values are cited in both technical and SI units. Solid, liquid, vapor, and gaseous forms of organic and inorganic materials are included. 12 figures, 137 tables

  14. Nuclear industry chart no. 21 - France

    International Nuclear Information System (INIS)

    Anon.

    1976-01-01

    A fold-out chart shows the relationship between the government bodies and industrial concerns. Nuclear power plant orders under the 1970-84 programme are tabulated. A directory is included of national bodies, firms and establishments. (U.K.)

  15. Interactive Financial Charts- Agency Financial Reports

    Data.gov (United States)

    General Services Administration — For a visual depiction of GSA's Balance Sheet and Statement of Net Cost, please use the interactive charts to view the financial results for fiscal years 2007-2013.

  16. Chart Supplements - Aeronautical Information Services Digital Products

    Data.gov (United States)

    Department of Transportation — The Chart Supplements are searchable by individual airport in PDF format. They contain data on public and joint use airports, seaplane bases, heliports, VFR airport...

  17. Karlsruhe nuclide chart - new 9. edition 2015

    International Nuclear Information System (INIS)

    Soti, Zsolt; Magill, Joseph; Pfennig, Gerda; Derher, Raymond

    2015-01-01

    Following the success of the 8. Edition of the Karlsruhe Nuclide Chart 2012, a new edition is planned for 2015. Since the 2012 edition, more than 100 nuclides have been discovered and about 1400 nuclides have been updated. In summary, the new 9. edition contains decay and radiation data on approximately 3230 ground state nuclides and 740 isomers from 118 chemical elements. The accompanying booklet provides a detailed explanation of the nuclide box structure used in the Chart. An expanded section contains many additional nuclide decay schemes to aid the user to interpret the highly condensed information in the nuclide boxes. The booklet contains - in addition to the latest values of the physical constants and physical properties - a periodic table of the elements, tables of new and updated nuclides, and a difference chart showing the main changes in the Chart graphically. (authors)

  18. Eigenfunction statistics on quantum graphs

    International Nuclear Information System (INIS)

    Gnutzmann, S.; Keating, J.P.; Piotet, F.

    2010-01-01

    We investigate the spatial statistics of the energy eigenfunctions on large quantum graphs. It has previously been conjectured that these should be described by a Gaussian Random Wave Model, by analogy with quantum chaotic systems, for which such a model was proposed by Berry in 1977. The autocorrelation functions we calculate for an individual quantum graph exhibit a universal component, which completely determines a Gaussian Random Wave Model, and a system-dependent deviation. This deviation depends on the graph only through its underlying classical dynamics. Classical criteria for quantum universality to be met asymptotically in the large graph limit (i.e. for the non-universal deviation to vanish) are then extracted. We use an exact field theoretic expression in terms of a variant of a supersymmetric σ model. A saddle-point analysis of this expression leads to the estimates. In particular, intensity correlations are used to discuss the possible equidistribution of the energy eigenfunctions in the large graph limit. When equidistribution is asymptotically realized, our theory predicts a rate of convergence that is a significant refinement of previous estimates. The universal and system-dependent components of intensity correlation functions are recovered by means of an exact trace formula which we analyse in the diagonal approximation, drawing in this way a parallel between the field theory and semiclassics. Our results provide the first instance where an asymptotic Gaussian Random Wave Model has been established microscopically for eigenfunctions in a system with no disorder.

  19. Box graphs and resolutions I

    Directory of Open Access Journals (Sweden)

    Andreas P. Braun

    2016-04-01

    Full Text Available Box graphs succinctly and comprehensively characterize singular fibers of elliptic fibrations in codimension two and three, as well as flop transitions connecting these, in terms of representation theoretic data. We develop a framework that provides a systematic map between a box graph and a crepant algebraic resolution of the singular elliptic fibration, thus allowing an explicit construction of the fibers from a singular Weierstrass or Tate model. The key tool is what we call a fiber face diagram, which shows the relevant information of a (partial toric triangulation and allows the inclusion of more general algebraic blowups. We shown that each such diagram defines a sequence of weighted algebraic blowups, thus providing a realization of the fiber defined by the box graph in terms of an explicit resolution. We show this correspondence explicitly for the case of SU(5 by providing a map between box graphs and fiber faces, and thereby a sequence of algebraic resolutions of the Tate model, which realizes each of the box graphs.

  20. Degree-based graph construction

    International Nuclear Information System (INIS)

    Kim, Hyunju; Toroczkai, Zoltan; Erdos, Peter L; Miklos, Istvan; Szekely, Laszlo A

    2009-01-01

    Degree-based graph construction is a ubiquitous problem in network modelling (Newman et al 2006 The Structure and Dynamics of Networks (Princeton Studies in Complexity) (Princeton, NJ: Princeton University Press), Boccaletti et al 2006 Phys. Rep. 424 175), ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive construction and sampling questions with aspects that are still open today. Here we give necessary and sufficient conditions for a sequence of nonnegative integers to be realized as a simple graph's degree sequence, such that a given (but otherwise arbitrary) set of connections from an arbitrarily given node is avoided. We then use this result to present a swap-free algorithm that builds all simple graphs realizing a given degree sequence. In a wider context, we show that our result provides a greedy construction method to build all the f-factor subgraphs (Tutte 1952 Can. J. Math. 4 314) embedded within K n setmn S k , where K n is the complete graph and S k is a star graph centred on one of the nodes. (fast track communication)

  1. Hierarchical organisation of causal graphs

    International Nuclear Information System (INIS)

    Dziopa, P.

    1993-01-01

    This paper deals with the design of a supervision system using a hierarchy of models formed by graphs, in which the variables are the nodes and the causal relations between the variables of the arcs. To obtain a representation of the variables evolutions which contains only the relevant features of their real evolutions, the causal relations are completed with qualitative transfer functions (QTFs) which produce roughly the behaviour of the classical transfer functions. Major improvements have been made in the building of the hierarchical organization. First, the basic variables of the uppermost level and the causal relations between them are chosen. The next graph is built by adding intermediary variables to the upper graph. When the undermost graph has been built, the transfer functions parameters corresponding to its causal relations are identified. The second task consists in the upwelling of the information from the undermost graph to the uppermost one. A fusion procedure of the causal relations has been designed to compute the QFTs relevant for each level. This procedure aims to reduce the number of parameters needed to represent an evolution at a high level of abstraction. These techniques have been applied to the hierarchical modelling of nuclear process. (authors). 8 refs., 12 figs

  2. Integer Flows and Circuit Covers of Graphs and Signed Graphs

    Science.gov (United States)

    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

  3. Finding charts for southern IRAS galaxies

    International Nuclear Information System (INIS)

    Sutherland, W.J.; Maddox, S.J.; Saunders, W.

    1991-01-01

    Using the APM Galaxy Survey, we have generated a collection of finding charts for 4614 sources with non-stellar colours in the IRAS Faint Source Catalogue south of δ= -17.5 o . Over 90 per cent of the sources are reliably identified with an optical object, and we provide 1-arcsec positions and B J magnitudes for these. We will provide paper copies of the charts on request, at a small charge to cover photocopying costs. (author)

  4. The European chart of territorial planning

    International Nuclear Information System (INIS)

    1998-01-01

    In this chapter the European chart of territorial planning is included. This European chart contains next chapters: Introduction; The mission of the territorial planning; The basic aims; Realization of aims of the territorial planning; The confirmation of the European co-operation. In the Appendix the Specific aims: (1) The village territory; (2) The urban territory; (3) The boundary territory; (4) The mountain territory; (5) The structurally weak territory; (6) The decaying territory; (7) The coastal territories and islands

  5. Graph modeling systems and methods

    Science.gov (United States)

    Neergaard, Mike

    2015-10-13

    An apparatus and a method for vulnerability and reliability modeling are provided. The method generally includes constructing a graph model of a physical network using a computer, the graph model including a plurality of terminating vertices to represent nodes in the physical network, a plurality of edges to represent transmission paths in the physical network, and a non-terminating vertex to represent a non-nodal vulnerability along a transmission path in the physical network. The method additionally includes evaluating the vulnerability and reliability of the physical network using the constructed graph model, wherein the vulnerability and reliability evaluation includes a determination of whether each terminating and non-terminating vertex represents a critical point of failure. The method can be utilized to evaluate wide variety of networks, including power grid infrastructures, communication network topologies, and fluid distribution systems.

  6. On the graph turnpike problem

    KAUST Repository

    Feder, Tomá s; Motwani, Rajeev

    2009-01-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  7. On the graph turnpike problem

    KAUST Repository

    Feder, Tomás

    2009-06-01

    Results on graph turnpike problem without distinctness, including its NP-completeness, and an O(m+n log n) algorithm, is presented. The usual turnpike problem has all pairwise distances given, but does not specify which pair of vertices w e corresponds to. There are two other problems that can be viewed as special cases of the graph turnpike problem, including the bandwidth problem and the low-distortion graph embedding problem. The aim for the turnpike problem in the NP-complete is to orient the edges with weights w i in either direction so that when the whole cycle is transversed in the real line, it returns to a chosen starting point for the cycle. An instance of the turnpike problem with or without distinctness is uniquely mappable if there exists at most one solution up to translation and choice of orientation.

  8. Negation switching invariant signed graphs

    Directory of Open Access Journals (Sweden)

    Deepa Sinha

    2014-04-01

    Full Text Available A signed graph (or, $sigraph$ in short is a graph G in which each edge x carries a value $\\sigma(x \\in \\{-, +\\}$ called its sign. Given a sigraph S, the negation $\\eta(S$ of the sigraph S is a sigraph obtained from S by reversing the sign of every edge of S. Two sigraphs $S_{1}$ and $S_{2}$ on the same underlying graph are switching equivalent if it is possible to assign signs `+' (`plus' or `-' (`minus' to vertices of $S_{1}$ such that by reversing the sign of each of its edges that has received opposite signs at its ends, one obtains $S_{2}$. In this paper, we characterize sigraphs which are negation switching invariant and also see for what sigraphs, S and $\\eta (S$ are signed isomorphic.

  9. Quantum snake walk on graphs

    International Nuclear Information System (INIS)

    Rosmanis, Ansis

    2011-01-01

    I introduce a continuous-time quantum walk on graphs called the quantum snake walk, the basis states of which are fixed-length paths (snakes) in the underlying graph. First, I analyze the quantum snake walk on the line, and I show that, even though most states stay localized throughout the evolution, there are specific states that most likely move on the line as wave packets with momentum inversely proportional to the length of the snake. Next, I discuss how an algorithm based on the quantum snake walk might potentially be able to solve an extended version of the glued trees problem, which asks to find a path connecting both roots of the glued trees graph. To the best of my knowledge, no efficient quantum algorithm solving this problem is known yet.

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

    Science.gov (United States)

    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

  11. The construction of control chart for PM10 functional data

    Science.gov (United States)

    Shaadan, Norshahida; Jemain, Abdul Aziz; Deni, Sayang Mohd

    2014-06-01

    In this paper, a statistical procedure to construct a control chart for monitoring air quality (PM10) using functional data is proposed. A set of daily indices that represent the daily PM10 curves were obtained using Functional Principal Component Analysis (FPCA). By means of an iterative charting procedure, a reference data set that represented a stable PM10 process was obtained. The data were then used as a reference for monitoring future data. The application of the procedure was conducted using seven-year (2004-2010) period of recorded data from the Klang air quality monitoring station located in the Klang Valley region of Peninsular Malaysia. The study showed that the control chart provided a useful visualization tool for monitoring air quality and was capable in detecting abnormality in the process system. As in the case of Klang station, the results showed that with reference to 2004-2008, the air quality (PM10) in 2010 was better than that in 2009.

  12. On Graph Rewriting, Reduction and Evaluation

    DEFF Research Database (Denmark)

    Zerny, Ian

    2010-01-01

    We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter-derive a t......We inter-derive two prototypical styles of graph reduction: reduction machines à la Turner and graph rewriting systems à la Barendregt et al. To this end, we adapt Danvy et al.'s mechanical program derivations from the world of terms to the world of graphs. We also outline how to inter...

  13. The fascinating world of graph theory

    CERN Document Server

    Benjamin, Arthur; Zhang, Ping

    2015-01-01

    Graph theory goes back several centuries and revolves around the study of graphs-mathematical structures showing relations between objects. With applications in biology, computer science, transportation science, and other areas, graph theory encompasses some of the most beautiful formulas in mathematics-and some of its most famous problems. The Fascinating World of Graph Theory explores the questions and puzzles that have been studied, and often solved, through graph theory. This book looks at graph theory's development and the vibrant individuals responsible for the field's growth. Introducin

  14. Graph-based modelling in engineering

    CERN Document Server

    Rysiński, Jacek

    2017-01-01

    This book presents versatile, modern and creative applications of graph theory in mechanical engineering, robotics and computer networks. Topics related to mechanical engineering include e.g. machine and mechanism science, mechatronics, robotics, gearing and transmissions, design theory and production processes. The graphs treated are simple graphs, weighted and mixed graphs, bond graphs, Petri nets, logical trees etc. The authors represent several countries in Europe and America, and their contributions show how different, elegant, useful and fruitful the utilization of graphs in modelling of engineering systems can be. .

  15. XML Graphs in Program Analysis

    DEFF Research Database (Denmark)

    Møller, Anders; Schwartzbach, Michael Ignatieff

    2007-01-01

    XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....

  16. Graph topologies on closed multifunctions

    Directory of Open Access Journals (Sweden)

    Giuseppe Di Maio

    2003-10-01

    Full Text Available In this paper we study function space topologies on closed multifunctions, i.e. closed relations on X x Y using various hypertopologies. The hypertopologies are in essence, graph topologies i.e topologies on functions considered as graphs which are subsets of X x Y . We also study several topologies, including one that is derived from the Attouch-Wets filter on the range. We state embedding theorems which enable us to generalize and prove some recent results in the literature with the use of known results in the hyperspace of the range space and in the function space topologies of ordinary functions.

  17. Cyclic graphs and Apery's theorem

    International Nuclear Information System (INIS)

    Sorokin, V N

    2002-01-01

    This is a survey of results about the behaviour of Hermite-Pade approximants for graphs of Markov functions, and a survey of interpolation problems leading to Apery's result about the irrationality of the value ζ(3) of the Riemann zeta function. The first example is given of a cyclic graph for which the Hermite-Pade problem leads to Apery's theorem. Explicit formulae for solutions are obtained, namely, Rodrigues' formulae and integral representations. The asymptotic behaviour of the approximants is studied, and recurrence formulae are found

  18. Interacting particle systems on graphs

    Science.gov (United States)

    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

  19. Multiple graph regularized protein domain ranking

    KAUST Repository

    Wang, Jim Jing-Yan

    2012-11-19

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

  20. Multiple graph regularized protein domain ranking

    KAUST Repository

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

    2012-01-01

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

  1. Multiple graph regularized protein domain ranking.

    Science.gov (United States)

    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.

  2. Multiple graph regularized protein domain ranking

    Directory of Open Access Journals (Sweden)

    Wang Jim

    2012-11-01

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

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

    Science.gov (United States)

    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.

  4. Visibility Graph Based Time Series Analysis.

    Science.gov (United States)

    Stephen, Mutua; Gu, Changgui; Yang, Huijie

    2015-01-01

    Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq) and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

  5. Visibility Graph Based Time Series Analysis.

    Directory of Open Access Journals (Sweden)

    Mutua Stephen

    Full Text Available Network based time series analysis has made considerable achievements in the recent years. By mapping mono/multivariate time series into networks, one can investigate both it's microscopic and macroscopic behaviors. However, most proposed approaches lead to the construction of static networks consequently providing limited information on evolutionary behaviors. In the present paper we propose a method called visibility graph based time series analysis, in which series segments are mapped to visibility graphs as being descriptions of the corresponding states and the successively occurring states are linked. This procedure converts a time series to a temporal network and at the same time a network of networks. Findings from empirical records for stock markets in USA (S&P500 and Nasdaq and artificial series generated by means of fractional Gaussian motions show that the method can provide us rich information benefiting short-term and long-term predictions. Theoretically, we propose a method to investigate time series from the viewpoint of network of networks.

  6. Constructing Knowledge Graphs of Depression

    NARCIS (Netherlands)

    Huang, Zhisheng; Yang, Jie; van Harmelen, Frank; Hu, Qing

    2017-01-01

    Knowledge Graphs have been shown to be useful tools for integrating multiple medical knowledge sources, and to support such tasks as medical decision making, literature retrieval, determining healthcare quality indicators, co-morbodity analysis and many others. A large number of medical knowledge

  7. Partitioning graphs into connected parts

    NARCIS (Netherlands)

    Hof, van 't P.; Paulusma, D.; Woeginger, G.J.; Frid, A.; Morozov, A.S.; Rybalchenko, A.; Wagner, K.W.

    2009-01-01

    The 2-DISJOINT CONNECTED SUBGRAPHS problem asks if a given graph has two vertex-disjoint connected subgraphs containing pre-specified sets of vertices. We show that this problem is NP-complete even if one of the sets has cardinality 2. The LONGEST PATH CONTRACTIBILITY problem asks for the largest

  8. Isoperimetric inequalities for minimal graphs

    International Nuclear Information System (INIS)

    Pacelli Bessa, G.; Montenegro, J.F.

    2007-09-01

    Based on Markvorsen and Palmer's work on mean time exit and isoperimetric inequalities we establish slightly better isoperimetric inequalities and mean time exit estimates for minimal graphs in N x R. We also prove isoperimetric inequalities for submanifolds of Hadamard spaces with tamed second fundamental form. (author)

  9. Ancestral Genres of Mathematical Graphs

    Science.gov (United States)

    Gerofsky, Susan

    2011-01-01

    Drawing from sources in gesture studies, cognitive science, the anthropology of religion and art/architecture history, this article explores cultural, bodily and cosmological resonances carried (unintentionally) by mathematical graphs on Cartesian coordinates. Concepts of asymmetric bodily spaces, grids, orthogonality, mapping and sacred spaces…

  10. Humidity Graphs for All Seasons.

    Science.gov (United States)

    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)

  11. Contracting a planar graph efficiently

    DEFF Research Database (Denmark)

    Holm, Jacob; Italiano, Giuseppe F.; Karczmarz, Adam

    2017-01-01

    the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several planar...

  12. Graph Model Based Indoor Tracking

    DEFF Research Database (Denmark)

    Jensen, Christian Søndergaard; Lu, Hua; Yang, Bin

    2009-01-01

    The tracking of the locations of moving objects in large indoor spaces is important, as it enables a range of applications related to, e.g., security and indoor navigation and guidance. This paper presents a graph model based approach to indoor tracking that offers a uniform data management...

  13. A graph with fractional revival

    Science.gov (United States)

    Bernard, Pierre-Antoine; Chan, Ada; Loranger, Érika; Tamon, Christino; Vinet, Luc

    2018-02-01

    An example of a graph that admits balanced fractional revival between antipodes is presented. It is obtained by establishing the correspondence between the quantum walk on a hypercube where the opposite vertices across the diagonals of each face are connected and, the coherent transport of single excitations in the extension of the Krawtchouk spin chain with next-to-nearest neighbour interactions.

  14. Fixation Time for Evolutionary Graphs

    Science.gov (United States)

    Nie, Pu-Yan; Zhang, Pei-Ai

    Evolutionary graph theory (EGT) is recently proposed by Lieberman et al. in 2005. EGT is successful for explaining biological evolution and some social phenomena. It is extremely important to consider the time of fixation for EGT in many practical problems, including evolutionary theory and the evolution of cooperation. This study characterizes the time to asymptotically reach fixation.

  15. Transmission Line Adapted Analytical Power Charts Solution

    Science.gov (United States)

    Sakala, Japhet D.; Daka, James S. J.; Setlhaolo, Ditiro; Malichi, Alec Pulu

    2017-08-01

    The performance of a transmission line has been assessed over the years using power charts. These are graphical representations, drawn to scale, of the equations that describe the performance of transmission lines. Various quantities that describe the performance, such as sending end voltage, sending end power and compensation to give zero voltage regulation, may be deduced from the power charts. Usually required values are read off and then converted using the appropriate scales and known relationships. In this paper, the authors revisit this area of circle diagrams for transmission line performance. The work presented here formulates the mathematical model that analyses the transmission line performance from the power charts relationships and then uses them to calculate the transmission line performance. In this proposed approach, it is not necessary to draw the power charts for the solution. However the power charts may be drawn for the visual presentation. The method is based on applying derived equations and is simple to use since it does not require rigorous derivations.

  16. Chart of nuclides relating to neutron activation

    International Nuclear Information System (INIS)

    Okada, Minoru

    1981-09-01

    This chart is for frequent use in the prediction of the product species of neutron activation. The first edition of the chart has been made in 1976 after the repeated trial preparation. It has the following good points. (1) Any letter in chart is as large as one can read easily. [This condition has been obtained by the selection of items to be shown in chart. They are the name (the symbol of element, mass number, and half-life) of nuclide or of isomer, and the type of decay.]. (2) Decay product has been shown indirectly for branchings with two-step decay via short-lived daughter in an excited state. [This matter has been realized by use of the new mode of indication.] (3) Nuclides shown in chart are (a) naturally occurring nuclides and (b) nuclides formed from naturally occurring nuclides through one of the following reactions: (n, γ), (n, n'), (n, p), (n, α), (n, 2n), (n, pn), (n, 3n), (n, αn), (n, t), (n, 3 He), (n, 2p), and (n, γ)(n, γ). In the revision of the first edition, some modes of indication have become a little simpler, and the isomers of shorter half-lives (0.1 - 1 μs) have been added. (author)

  17. A PIP chart for nuclear plant safety

    International Nuclear Information System (INIS)

    Suzuki, Tatsujiro; Yamaoka, Taiji

    1992-01-01

    While it is known that social and political aspects of nuclear safety issues are important, little study has been done on identifying the breadth of stakeholders whose policies have important influences over nuclear plant safety in a comprehensive way. The objectives of this study are to develop a chart that visually identifies important stakeholders and their policies and illustrates these influences in a hierarchical representation so that the relationship between stakeholders and nuclear safety will be better understood. This study is based on a series of extensive interviews with major stakeholders, such as nuclear plant managers, corporate planning vice presidents, state regulators, news media, and public interest groups, and focuses on one US nuclear power plant. Based on the interview results, the authors developed a conceptual policy influence paths (PIP) chart. The PIP chart illustrates the hierarchy of influence among stakeholders. The PIP chart is also useful in identifying possible stakeholders who can be easily overlooked without the PIP chart. In addition, it shows that influence flow is circular rather than linear in one direction

  18. Coloring sums of extensions of certain graphs

    Directory of Open Access Journals (Sweden)

    Johan Kok

    2017-12-01

    Full Text Available We recall that the minimum number of colors that allow a proper coloring of graph $G$ is called the chromatic number of $G$ and denoted $\\chi(G$. Motivated by the introduction of the concept of the $b$-chromatic sum of a graph the concept of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum are introduced in this paper. The extended graph $G^x$ of a graph $G$ was recently introduced for certain regular graphs. This paper furthers the concepts of $\\chi'$-chromatic sum and $\\chi^+$-chromatic sum to extended paths and cycles. Bipartite graphs also receive some attention. The paper concludes with patterned structured graphs. These last said graphs are typically found in chemical and biological structures.

  19. Mathematical Minute: Rotating a Function Graph

    Science.gov (United States)

    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.

  20. Towards a theory of geometric graphs

    CERN Document Server

    Pach, Janos

    2004-01-01

    The early development of graph theory was heavily motivated and influenced by topological and geometric themes, such as the Konigsberg Bridge Problem, Euler's Polyhedral Formula, or Kuratowski's characterization of planar graphs. In 1936, when Denes Konig published his classical Theory of Finite and Infinite Graphs, the first book ever written on the subject, he stressed this connection by adding the subtitle Combinatorial Topology of Systems of Segments. He wanted to emphasize that the subject of his investigations was very concrete: planar figures consisting of points connected by straight-line segments. However, in the second half of the twentieth century, graph theoretical research took an interesting turn. In the most popular and most rapidly growing areas (the theory of random graphs, Ramsey theory, extremal graph theory, algebraic graph theory, etc.), graphs were considered as abstract binary relations rather than geometric objects. Many of the powerful techniques developed in these fields have been su...

  1. Bounds on Gromov hyperbolicity constant in graphs

    Indian Academy of Sciences (India)

    Infinite graphs; Cartesian product graphs; independence number; domin- ation number; geodesics ... the secure transmission of information through the internet (see [15, 16]). In particular, ..... In particular, δ(G) is an integer multiple of 1/4.

  2. Summary: beyond fault trees to fault graphs

    International Nuclear Information System (INIS)

    Alesso, H.P.; Prassinos, P.; Smith, C.F.

    1984-09-01

    Fault Graphs are the natural evolutionary step over a traditional fault-tree model. A Fault Graph is a failure-oriented directed graph with logic connectives that allows cycles. We intentionally construct the Fault Graph to trace the piping and instrumentation drawing (P and ID) of the system, but with logical AND and OR conditions added. Then we evaluate the Fault Graph with computer codes based on graph-theoretic methods. Fault Graph computer codes are based on graph concepts, such as path set (a set of nodes traveled on a path from one node to another) and reachability (the complete set of all possible paths between any two nodes). These codes are used to find the cut-sets (any minimal set of component failures that will fail the system) and to evaluate the system reliability

  3. Torsional rigidity, isospectrality and quantum graphs

    International Nuclear Information System (INIS)

    Colladay, Don; McDonald, Patrick; Kaganovskiy, Leon

    2017-01-01

    We study torsional rigidity for graph and quantum graph analogs of well-known pairs of isospectral non-isometric planar domains. We prove that such isospectral pairs are distinguished by torsional rigidity. (paper)

  4. Bond graph modeling of centrifugal compression systems

    OpenAIRE

    Uddin, Nur; Gravdahl, Jan Tommy

    2015-01-01

    A novel approach to model unsteady fluid dynamics in a compressor network by using a bond graph is presented. The model is intended in particular for compressor control system development. First, we develop a bond graph model of a single compression system. Bond graph modeling offers a different perspective to previous work by modeling the compression system based on energy flow instead of fluid dynamics. Analyzing the bond graph model explains the energy flow during compressor surge. Two pri...

  5. A Graph Calculus for Predicate Logic

    Directory of Open Access Journals (Sweden)

    Paulo A. S. Veloso

    2013-03-01

    Full Text Available We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation.

  6. Sphere and dot product representations of graphs

    NARCIS (Netherlands)

    R.J. Kang (Ross); T. Müller (Tobias)

    2012-01-01

    textabstractA graph $G$ is a $k$-sphere graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such that $ij\\in E(G)$ if and only if the distance between $v_i$ and $v_j$ is at most $1$. A graph $G$ is a $k$-dot product graph if there are $k$-dimensional real vectors $v_1,\\dots,v_n$ such

  7. Deep Learning with Dynamic Computation Graphs

    OpenAIRE

    Looks, Moshe; Herreshoff, Marcello; Hutchins, DeLesley; Norvig, Peter

    2017-01-01

    Neural networks that compute over graph structures are a natural fit for problems in a variety of domains, including natural language (parse trees) and cheminformatics (molecular graphs). However, since the computation graph has a different shape and size for every input, such networks do not directly support batched training or inference. They are also difficult to implement in popular deep learning libraries, which are based on static data-flow graphs. We introduce a technique called dynami...

  8. Constructs for Programming with Graph Rewrites

    OpenAIRE

    Rodgers, Peter

    2000-01-01

    Graph rewriting is becoming increasingly popular as a method for programming with graph based data structures. We present several modifications to a basic serial graph rewriting paradigm and discuss how they improve coding programs in the Grrr graph rewriting programming language. The constructs we present are once only nodes, attractor nodes and single match rewrites. We illustrate the operation of the constructs by example. The advantages of adding these new rewrite modifiers is to reduce t...

  9. Italian cardiovascular mortality charts of the CUORE project: are they comparable with the SCORE charts?

    LENUS (Irish Health Repository)

    Donfrancesco, Chiara

    2010-08-01

    The aim of this study was to build risk charts for the assessment of cardiovascular mortality of the CUORE project, an Italian longitudinal study, and to compare them with the systematic coronary risk evaluation (SCORE) project charts for low risk European countries.

  10. The development and organizational format of a radiotherapy patient treatment chart

    International Nuclear Information System (INIS)

    Bynum, S.; McMurry, H.

    1989-01-01

    An important and time consuming responsibility of the Dosimetrist is to ensure and supervise accurate recording of delivered dose and treatment methods. With the rapidly growing complexity of technology, data, treatment protocol regimens and treatment methods, the need for accurate recording in a clearly arranged fashion has become imperative not only for daily patient treatment, but also for legal purposes. This paper describes the process of designing a patient treatment chart based on a review of charts already in use in various departments and aided by the input of all members of the Radiation Oncology treatment team at University of North Carolina, Chapel Hill

  11. Two-dimensional phase fraction charts

    International Nuclear Information System (INIS)

    Morral, J.E.

    1984-01-01

    A phase fraction chart is a graphical representation of the amount of each phase present in a system as a function of temperature, composition or other variable. Examples are phase fraction versus temperature charts used to characterize specific alloys and as a teaching tool in elementary texts, and Schaeffler diagrams used to predict the amount of ferrite in stainless steel welds. Isothermal-transformation diagrams (TTT diagrams) are examples that give phase (or microconstituent) amount versus temperature and time. The purpose of this communication is to discuss the properties of two-dimensional phase fraction charts in more general terms than have been reported before. It is shown that they can represent multi-component, multiphase equilibria in a way which is easier to read and which contains more information than the isotherms and isopleths of multi-component phase diagrams

  12. On the sizes of expander graphs and minimum distances of graph codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2014-01-01

    We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

  13. My Bar Graph Tells a Story

    Science.gov (United States)

    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…

  14. The groupies of random multipartite graphs

    OpenAIRE

    Portmann, Marius; Wang, Hongyun

    2012-01-01

    If a vertex $v$ in a graph $G$ has degree larger than the average of the degrees of its neighbors, we call it a groupie in $G$. In the current work, we study the behavior of groupie in random multipartite graphs with the link probability between sets of nodes fixed. Our results extend the previous ones on random (bipartite) graphs.

  15. Modeling Software Evolution using Algebraic Graph Rewriting

    NARCIS (Netherlands)

    Ciraci, Selim; van den Broek, Pim

    We show how evolution requests can be formalized using algebraic graph rewriting. In particular, we present a way to convert the UML class diagrams to colored graphs. Since changes in software may effect the relation between the methods of classes, our colored graph representation also employs the

  16. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo

    2009-01-01

    In this report we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java

  17. An intersection graph of straight lines

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2002-01-01

    G. Ehrlich, S. Even, and R.E. Tarjan conjectured that the graph obtained from a complete 3 partite graph K4,4,4 by deleting the edges of four disjoint triangles is not the intersection graph of straight line segments in the plane. We show that it is....

  18. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    2005-01-01

    We consider the problem of construction of graphs with given degree $k$ and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed ...

  19. Cycles in weighted graphs and related topics

    NARCIS (Netherlands)

    Zhang, Shenggui

    2002-01-01

    This thesis contains results on paths andcycles in graphs andon a more or less relatedtopic, the vulnerability of graphs. In the first part of the thesis, Chapters 2 through 5, we concentrate on paths andcycles in weightedgraphs. A number of sufficient conditions are presentedfor graphs to contain

  20. Graph Transformation Semantics for a QVT Language

    NARCIS (Netherlands)

    Rensink, Arend; Nederpel, Ronald; Bruni, Roberto; Varró, Dániel

    It has been claimed by many in the graph transformation community that model transformation, as understood in the context of Model Driven Architecture, can be seen as an application of graph transformation. In this paper we substantiate this claim by giving a graph transformation-based semantics to

  1. Girth 5 graphs from relative difference sets

    DEFF Research Database (Denmark)

    Jørgensen, Leif Kjær

    We consider the problem of construction of graphs with given degree and girth 5 and as few vertices as possible. We give a construction of a family of girth 5 graphs based on relative difference sets. This family contains the smallest known graph of degree 8 and girth 5 which was constructed by G...

  2. Improper colouring of (random) unit disk graphs

    NARCIS (Netherlands)

    Kang, R.J.; Müller, T.; Sereni, J.S.

    2008-01-01

    For any graph G, the k-improper chromatic number ¿k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate ¿k for unit disk graphs and random unit disk graphs to generalise results of McDiarmid and Reed

  3. Alliances and Bisection Width for Planar Graphs

    DEFF Research Database (Denmark)

    Olsen, Martin; Revsbæk, Morten

    2013-01-01

    An alliance in a graph is a set of vertices (allies) such that each vertex in the alliance has at least as many allies (counting the vertex itself) as non-allies in its neighborhood of the graph. We show that any planar graph with minimum degree at least 4 can be split into two alliances in polyn...

  4. A Type Graph Model for Java Programs

    NARCIS (Netherlands)

    Rensink, Arend; Zambon, Eduardo; Lee, D.; Lopes, A.; Poetzsch-Heffter, A.

    2009-01-01

    In this work we present a type graph that models all executable constructs of the Java programming language. Such a model is useful for any graph-based technique that relies on a representation of Java programs as graphs. The model can be regarded as a common representation to which all Java syntax

  5. RATGRAPH: Computer Graphing of Rational Functions.

    Science.gov (United States)

    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)

  6. A new cluster algorithm for graphs

    NARCIS (Netherlands)

    S. van Dongen

    1998-01-01

    textabstractA new cluster algorithm for graphs called the emph{Markov Cluster algorithm ($MCL$ algorithm) is introduced. The graphs may be both weighted (with nonnegative weight) and directed. Let~$G$~be such a graph. The $MCL$ algorithm simulates flow in $G$ by first identifying $G$ in a

  7. Well-covered graphs and factors

    DEFF Research Database (Denmark)

    Randerath, Bert; Vestergaard, Preben D.

    2006-01-01

    A maximum independent set of vertices in a graph is a set of pairwise nonadjacent vertices of largest cardinality α. Plummer defined a graph to be well-covered, if every independent set is contained in a maximum independent set of G. Every well-covered graph G without isolated vertices has a perf...

  8. A new characterization of trivially perfect graphs

    Directory of Open Access Journals (Sweden)

    Christian Rubio Montiel

    2015-03-01

    Full Text Available A graph $G$ is \\emph{trivially perfect} if for every induced subgraph the cardinality of the largest set of pairwise nonadjacent vertices (the stability number $\\alpha(G$ equals the number of (maximal cliques $m(G$. We characterize the trivially perfect graphs in terms of vertex-coloring and we extend some definitions to infinite graphs.

  9. 47 CFR 80.761 - Conversion graphs.

    Science.gov (United States)

    2010-10-01

    ... MARITIME SERVICES Standards for Computing Public Coast Station VHF Coverage § 80.761 Conversion graphs. The following graphs must be employed where conversion from one to the other of the indicated types of units is... 47 Telecommunication 5 2010-10-01 2010-10-01 false Conversion graphs. 80.761 Section 80.761...

  10. Degree distributions of the visibility graphs mapped from fractional Brownian motions and multifractal random walks

    International Nuclear Information System (INIS)

    Ni Xiaohui; Jiang Zhiqiang; Zhou Weixing

    2009-01-01

    The dynamics of a complex system is usually recorded in the form of time series, which can be studied through its visibility graph from a complex network perspective. We investigate the visibility graphs extracted from fractional Brownian motions and multifractal random walks, and find that the degree distributions exhibit power-law behaviors, in which the power-law exponent α is a linear function of the Hurst index H of the time series. We also find that the degree distribution of the visibility graph is mainly determined by the temporal correlation of the original time series with minor influence from the possible multifractal nature. As an example, we study the visibility graphs constructed from three Chinese stock market indexes and unveil that the degree distributions have power-law tails, where the tail exponents of the visibility graphs and the Hurst indexes of the indexes are close to the α∼H linear relationship.

  11. On a conjecture concerning helly circle graphs

    Directory of Open Access Journals (Sweden)

    Durán Guillermo

    2003-01-01

    Full Text Available We say that G is an e-circle graph if there is a bijection between its vertices and straight lines on the cartesian plane such that two vertices are adjacent in G if and only if the corresponding lines intersect inside the circle of radius one. This definition suggests a method for deciding whether a given graph G is an e-circle graph, by constructing a convenient system S of equations and inequations which represents the structure of G, in such a way that G is an e-circle graph if and only if S has a solution. In fact, e-circle graphs are exactly the circle graphs (intersection graphs of chords in a circle, and thus this method provides an analytic way for recognizing circle graphs. A graph G is a Helly circle graph if G is a circle graph and there exists a model of G by chords such that every three pairwise intersecting chords intersect at the same point. A conjecture by Durán (2000 states that G is a Helly circle graph if and only if G is a circle graph and contains no induced diamonds (a diamond is a graph formed by four vertices and five edges. Many unsuccessful efforts - mainly based on combinatorial and geometrical approaches - have been done in order to validate this conjecture. In this work, we utilize the ideas behind the definition of e-circle graphs and restate this conjecture in terms of an equivalence between two systems of equations and inequations, providing a new, analytic tool to deal with it.

  12. Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

    Directory of Open Access Journals (Sweden)

    Katona Gyula Y.

    2014-11-01

    Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

  13. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar; Leus, Geert

    2016-01-01

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  14. On 4-critical t-perfect graphs

    OpenAIRE

    Benchetrit, Yohann

    2016-01-01

    It is an open question whether the chromatic number of $t$-perfect graphs is bounded by a constant. The largest known value for this parameter is 4, and the only example of a 4-critical $t$-perfect graph, due to Laurent and Seymour, is the complement of the line graph of the prism $\\Pi$ (a graph is 4-critical if it has chromatic number 4 and all its proper induced subgraphs are 3-colorable). In this paper, we show a new example of a 4-critical $t$-perfect graph: the complement of the line gra...

  15. Subsampling for graph power spectrum estimation

    KAUST Repository

    Chepuri, Sundeep Prabhakar

    2016-10-06

    In this paper we focus on subsampling stationary random signals that reside on the vertices of undirected graphs. Second-order stationary graph signals are obtained by filtering white noise and they admit a well-defined power spectrum. Estimating the graph power spectrum forms a central component of stationary graph signal processing and related inference tasks. We show that by sampling a significantly smaller subset of vertices and using simple least squares, we can reconstruct the power spectrum of the graph signal from the subsampled observations, without any spectral priors. In addition, a near-optimal greedy algorithm is developed to design the subsampling scheme.

  16. Proving relations between modular graph functions

    International Nuclear Information System (INIS)

    Basu, Anirban

    2016-01-01

    We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet, while the links are the scalar Green functions connecting the vertices. Graphs with four and five links satisfy several non-trivial relations, which have been proved recently. We prove these relations by using elementary properties of Green functions and the details of the graphs. We also prove a relation between modular graph functions with six links. (paper)

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

    Science.gov (United States)

    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.

  18. ICAO Aeronautical chart production: aerodrome obstruction charts from small–format aerial digital imagery

    Directory of Open Access Journals (Sweden)

    Jorge Padro Molina

    2012-11-01

    Full Text Available Aeronautical charts and aerodrome obstruction charts, provide information about obstacles around the airport, so pilots and air traffic controllers can comply with the procedures and limitations of its utilization. Safety in aviation demands updated and precise aeronautical charts production, adopting the standards of the International Civil Aviation Organization (ICAO. In this paper the methodology employed to generate obstruction charts for five airports in Mexico, using aerial digital imagery obtained with small–format cameras, is described. Through two aerial surveys on each airport, from 10 000 and 5 000 feet above ground level, two orthomosaics were generated covering the airport influence area, the runway, and the obstacle limitation surfaces: approach/Take–off climb, transitional, inner horizontal, and conical. Using stereopair photointerpretation most of the obstacles were identified, and by means of the orthomosaics; aerodrome charts, and aerodrome obstruction charts types A, B and C, were generated. Using satellite geodetic receivers, 18 points were surveyed on each runway in order to obtain its dimensions, and to establish ground control points for mosaics generation. Throughout detailed field work, height and location of the obstacles were verified, and finally, after several reviewing processes by aeronautical authorities, generation of ICAO charts was concluded when all airport maps were integrated in a Geographical Information System.

  19. Significance evaluation in factor graphs

    DEFF Research Database (Denmark)

    Madsen, Tobias; Hobolth, Asger; Jensen, Jens Ledet

    2017-01-01

    in genomics and the multiple-testing issues accompanying them, accurate significance evaluation is of great importance. We here address the problem of evaluating statistical significance of observations from factor graph models. Results Two novel numerical approximations for evaluation of statistical...... significance are presented. First a method using importance sampling. Second a saddlepoint approximation based method. We develop algorithms to efficiently compute the approximations and compare them to naive sampling and the normal approximation. The individual merits of the methods are analysed both from....... Conclusions The applicability of saddlepoint approximation and importance sampling is demonstrated on known models in the factor graph framework. Using the two methods we can substantially improve computational cost without compromising accuracy. This contribution allows analyses of large datasets...

  20. Groups, graphs and random walks

    CERN Document Server

    Salvatori, Maura; Sava-Huss, Ecaterina

    2017-01-01

    An accessible and panoramic account of the theory of random walks on groups and graphs, stressing the strong connections of the theory with other branches of mathematics, including geometric and combinatorial group theory, potential analysis, and theoretical computer science. This volume brings together original surveys and research-expository papers from renowned and leading experts, many of whom spoke at the workshop 'Groups, Graphs and Random Walks' celebrating the sixtieth birthday of Wolfgang Woess in Cortona, Italy. Topics include: growth and amenability of groups; Schrödinger operators and symbolic dynamics; ergodic theorems; Thompson's group F; Poisson boundaries; probability theory on buildings and groups of Lie type; structure trees for edge cuts in networks; and mathematical crystallography. In what is currently a fast-growing area of mathematics, this book provides an up-to-date and valuable reference for both researchers and graduate students, from which future research activities will undoubted...

  1. Flux networks in metabolic graphs

    International Nuclear Information System (INIS)

    Warren, P B; Queiros, S M Duarte; Jones, J L

    2009-01-01

    A metabolic model can be represented as a bipartite graph comprising linked reaction and metabolite nodes. Here it is shown how a network of conserved fluxes can be assigned to the edges of such a graph by combining the reaction fluxes with a conserved metabolite property such as molecular weight. A similar flux network can be constructed by combining the primal and dual solutions to the linear programming problem that typically arises in constraint-based modelling. Such constructions may help with the visualization of flux distributions in complex metabolic networks. The analysis also explains the strong correlation observed between metabolite shadow prices (the dual linear programming variables) and conserved metabolite properties. The methods were applied to recent metabolic models for Escherichia coli, Saccharomyces cerevisiae and Methanosarcina barkeri. Detailed results are reported for E. coli; similar results were found for other organisms

  2. 3-biplacement of bipartite graphs

    Directory of Open Access Journals (Sweden)

    Lech Adamus

    2008-01-01

    Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.

  3. Progress in the technology of nautical charting

    Digital Repository Service at National Institute of Oceanography (India)

    Joseph, A.

    ". The article skims through the various aspects of safety of navigation such as nautical charts created by the Arabs in the medieval days of stellar navigation in the Indian Ocean; the contributions by the Chinese, the British, and the Portuguese; hydrographic...

  4. 7 CFR 51.2276 - Color chart.

    Science.gov (United States)

    2010-01-01

    ... Regulations of the Department of Agriculture AGRICULTURAL MARKETING SERVICE (Standards, Inspections, Marketing Practices), DEPARTMENT OF AGRICULTURE REGULATIONS AND STANDARDS UNDER THE AGRICULTURAL MARKETING ACT OF 1946... Walnut Color Chart) to which reference is made in §§ 51.2281 and 51.2282 illustrates the four shades of...

  5. Nuclear industry chart no. 20 - Sweden

    International Nuclear Information System (INIS)

    Anon.

    1976-01-01

    A folding chart is presented of the Swedish nuclear industry, which shows the government bodies, companies, utilities and other groups who participate in the nuclear field. Their special interests and activities and affiliations with each other and with international organisations are indicated. (U.K.)

  6. A robust standard deviation control chart

    NARCIS (Netherlands)

    Schoonhoven, M.; Does, R.J.M.M.

    2012-01-01

    This article studies the robustness of Phase I estimators for the standard deviation control chart. A Phase I estimator should be efficient in the absence of contaminations and resistant to disturbances. Most of the robust estimators proposed in the literature are robust against either diffuse

  7. Charting environmental pollution. [by noise measurements

    Science.gov (United States)

    Halpert, E.; Bizo, F.; Karacsonyi, Z.

    1974-01-01

    It is found that areas affected by different noxious agents are within the limits traced for high noise level areas; consequently, it is suggested that high noise pressure levels should be used as the primary indication of environmental pollution. A complex methodology is reported for charting environmental pollution due to physical, chemical and biological noxious agents on the scale of an industrial district.

  8. ICS International Chronostratigraphic Chart 2016/04

    NARCIS (Netherlands)

    Cohen, K.M.|info:eu-repo/dai/nl/185633374; Finney, S.C.; Gibbard, P.L.

    Units of all ranks are in the process of being defined by Global Boundary Stratotype Section and Points (GSSP) for their lowerboundaries, including those of the Archean and Proterozoic, long defined by Global Standard Stratigraphic Ages (GSSA). Charts and detailed information on ratified GSSPs are

  9. ICS International Chronostratigraphic Chart 2017/02

    NARCIS (Netherlands)

    Cohen, K.M.|info:eu-repo/dai/nl/185633374; Harper, D.A.T.; Gibbard, P.L.

    Units of all ranks are in the process of being defined by Global Boundary Stratotype Section and Points (GSSP) for their lowerboundaries, including those of the Archean and Proterozoic, long defined by Global Standard Stratigraphic Ages (GSSA). Charts and detailed information on ratified GSSPs are

  10. ICS International Chronostratigraphic Chart 2015/01

    NARCIS (Netherlands)

    Cohen, K.M.|info:eu-repo/dai/nl/185633374; Finney, S.C.; Gibbard, P.L.

    Units of all ranks are in the process of being defined by Global Boundary Stratotype Section and Points (GSSP) for their lower boundaries, including those of the Archean and Proterozoic, long defined by Global Standard Stratigraphic Ages (GSSA). Charts and detailed information on ratified GSSPs are

  11. Charts for interpreting wildland fire behavior characteristics

    Science.gov (United States)

    Patricia L. Andrews; Richard C. Rothermel

    1982-01-01

    The fire characteristics chart is proposed as a graphical method ofpresenting two primary characteristics of fire behavior – spread rate and intensity. Its primary use is communicating and interpreting either site-specific predictions of fire behavior or National Fire-Danger Rating System (NFDRS) indexes and components. Rate of spread, heat per unit area, flame length...

  12. On the centrality of some graphs

    Directory of Open Access Journals (Sweden)

    Vecdi Aytac

    2017-10-01

    Full Text Available A central issue in the analysis of complex networks is the assessment of their stability and vulnerability. A variety of measures have been proposed in the literature to quantify the stability of networks and a number of graph-theoretic parameters have been used to derive formulas for calculating network reliability. Different measures for graph vulnerability have been introduced so far to study different aspects of the graph behavior after removal of vertices or links such as connectivity, toughness, scattering number, binding number, residual closeness and integrity. In this paper, we consider betweenness centrality of a graph. Betweenness centrality of a vertex of a graph is portion of the shortest paths all pairs of vertices passing through a given vertex. In this paper, we obtain exact values for betweenness centrality for some wheel related graphs namely gear, helm, sunflower and friendship graphs.

  13. Quantum walk on a chimera graph

    Science.gov (United States)

    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.

  14. Fibonacci number of the tadpole graph

    Directory of Open Access Journals (Sweden)

    Joe DeMaio

    2014-10-01

    Full Text Available In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2 and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

  15. Software for Graph Analysis and Visualization

    Directory of Open Access Journals (Sweden)

    M. I. Kolomeychenko

    2014-01-01

    Full Text Available This paper describes the software for graph storage, analysis and visualization. The article presents a comparative analysis of existing software for analysis and visualization of graphs, describes the overall architecture of application and basic principles of construction and operation of the main modules. Furthermore, a description of the developed graph storage oriented to storage and processing of large-scale graphs is presented. The developed algorithm for finding communities and implemented algorithms of autolayouts of graphs are the main functionality of the product. The main advantage of the developed software is high speed processing of large size networks (up to millions of nodes and links. Moreover, the proposed graph storage architecture is unique and has no analogues. The developed approaches and algorithms are optimized for operating with big graphs and have high productivity.

  16. Parallel External Memory Graph Algorithms

    DEFF Research Database (Denmark)

    Arge, Lars Allan; Goodrich, Michael T.; Sitchinava, Nodari

    2010-01-01

    In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one o f the private-cache chip multiprocessor (CMP) models. We study the fundamental problem of list ranking which leads to efficient solutions to problems on trees, such as computing lowest...... an optimal speedup of ¿(P) in parallel I/O complexity and parallel computation time, compared to the single-processor external memory counterparts....

  17. Submanifolds weakly associated with graphs

    Indian Academy of Sciences (India)

    A CARRIAZO, L M FERN ´ANDEZ and A RODRÍGUEZ-HIDALGO. Department of Geometry and Topology, ..... by means of trees (connected graphs without cycles) and forests (disjoint unions of trees, see [6]) given in [3], by extending it to weak ... CR-submanifold. In this case, every tree is a K2. Finally, Theorem 3.8 of [3] can ...

  18. Topological structure of dictionary graphs

    International Nuclear Information System (INIS)

    Fuks, Henryk; Krzeminski, Mark

    2009-01-01

    We investigate the topological structure of the subgraphs of dictionary graphs constructed from WordNet and Moby thesaurus data. In the process of learning a foreign language, the learner knows only a subset of all words of the language, corresponding to a subgraph of a dictionary graph. When this subgraph grows with time, its topological properties change. We introduce the notion of the pseudocore and argue that the growth of the vocabulary roughly follows decreasing pseudocore numbers-that is, one first learns words with a high pseudocore number followed by smaller pseudocores. We also propose an alternative strategy for vocabulary growth, involving decreasing core numbers as opposed to pseudocore numbers. We find that as the core or pseudocore grows in size, the clustering coefficient first decreases, then reaches a minimum and starts increasing again. The minimum occurs when the vocabulary reaches a size between 10 3 and 10 4 . A simple model exhibiting similar behavior is proposed. The model is based on a generalized geometric random graph. Possible implications for language learning are discussed.

  19. Quantum information processing with graph states

    International Nuclear Information System (INIS)

    Schlingemann, Dirk-Michael

    2005-04-01

    Graph states are multiparticle states which are associated with graphs. Each vertex of the graph corresponds to a single system or particle. The links describe quantum correlations (entanglement) between pairs of connected particles. Graph states were initiated independently by two research groups: On the one hand, graph states were introduced by Briegel and Raussendorf as a resource for a new model of one-way quantum computing, where algorithms are implemented by a sequence of measurements at single particles. On the other hand, graph states were developed by the author of this thesis and ReinhardWerner in Braunschweig, as a tool to build quantum error correcting codes, called graph codes. The connection between the two approaches was fully realized in close cooperation of both research groups. This habilitation thesis provides a survey of the theory of graph codes, focussing mainly, but not exclusively on the author's own research work. We present the theoretical and mathematical background for the analysis of graph codes. The concept of one-way quantum computing for general graph states is discussed. We explicitly show how to realize the encoding and decoding device of a graph code on a one-way quantum computer. This kind of implementation is to be seen as a mathematical description of a quantum memory device. In addition to that, we investigate interaction processes, which enable the creation of graph states on very large systems. Particular graph states can be created, for instance, by an Ising type interaction between next neighbor particles which sits at the points of an infinitely extended cubic lattice. Based on the theory of quantum cellular automata, we give a constructive characterization of general interactions which create a translationally invariant graph state. (orig.)

  20. Recognition versus Resolution: a Comparison of Visual Acuity Results Using Two Alternative Test Chart Optotype

    Science.gov (United States)

    Pointer, Jonathan S.

    2010-01-01

    Purpose To quantify the difference between recognition (letter) and resolution (Landolt) visual acuity (VA) in a group of normally sighted subjects. Is it reasonable to assume that the two acuity measures are clinically equivalent? Methods A pair of 6 m acuity test charts was produced: one comprised letters and the other Landolt broken rings. Construction of both charts conformed to the logMAR design format. Monocular VA was determined for the dominant eye of 300 screened and normally sighted optometric patients aged 16 to 40, each wearing an optical refractive (spectacle) correction. Results Letter acuity was superior to Landolt acuity (P≤0.0001). The mean paired acuity difference was -0.041 logMAR (standard deviation 0.034): the 95% limits of agreement were ±0.067 logMAR units or ±3.3 chart optotype. Repeatability was high and similar for each chart type (±2.1 and ±2.4 optotype for letter and Landolt, respectively). Gender, test sequence, and laterality of the dominant eye (left or right) were each non-statistically significant variables. Conclusions For normally sighted subjects wearing an optimal refractive correction, a bias was recorded in favour of recognition over resolution acuity: the clinical difference amounted to approximately 40% of one logMAR chart line, with similar high repeatability for either chart optotype. We conclude that the assumption of clinical equivalence between letter and Landolt acuity is reasonable under optimum test conditions.

  1. Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

    Directory of Open Access Journals (Sweden)

    P. Anusha Devi

    2015-10-01

    Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

  2. Reason for hospital admission: a pilot study comparing patient statements with chart reports.

    Science.gov (United States)

    Berger, Zackary; Dembitzer, Anne; Beach, Mary Catherine

    2013-01-01

    Providers and patients bring different understandings of health and disease to their encounters in the hospital setting. The literature to date only infrequently addresses patient and provider concordance on the reported reason for hospitalization, that is, whether they express this reason in similar ways. An agreement or common ground between such understandings can serve as a basis for future communication regarding an illness and its treatment. We interviewed a convenience sample of patients on the medical wards of an urban academic medical center. We asked subjects to state the reason why their doctors admitted them to the hospital, and then compared their statement with the reason in the medical record. We defined concordance on reported reason for hospitalization as agreement between the patient's report and the reason abstracted from the chart. We interviewed and abstracted chart data from a total of 46 subjects. Concordance on reported reason for hospitalization was present in 24 (52%) and discordance in 17 (37%); 5 patients (11%) could not give any reason for their hospitalization. Among the 17 patients whose report was discordant with their chart, 12 (71%) reported a different organ system than was recorded in the chart. A significant proportion of medical inpatients could not state their physicians' reason for admission. In addition, patients who identify a different reason for hospitalization than the chart often give a different organ system altogether. Providers should explore patient understanding of the reason for their hospitalization to facilitate communication and shared decision making.

  3. Construction and validation of a Tamil logMAR chart.

    Science.gov (United States)

    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.

  4. Collective Memory and Nostalgia in The Dutch Radio2 Top2000 Chart 1999-2013

    NARCIS (Netherlands)

    Sterken, Elmer

    The paper analyses the impact of age on the ranking of recorded popular songs in the Dutch Radio2 Top2000 chart in the years 1999-2013. We measure the competition between the loss of collective memory and nostalgia with respect to popular songs.

  5. Customized versus population-based birth weight charts for the detection of neonatal growth and perinatal morbidity in a cross-sectional study of term neonates.

    Science.gov (United States)

    Carberry, Angela E; Raynes-Greenow, Camille H; Turner, Robin M; Jeffery, Heather E

    2013-10-15

    Customized birth weight charts that incorporate maternal characteristics are now being adopted into clinical practice. However, there is controversy surrounding the value of these charts in the prediction of growth and perinatal outcomes. The objective of this study was to assess the use of customized charts in predicting growth, defined by body fat percentage, and perinatal morbidity. A total of 581 term (≥37 weeks' gestation) neonates born in Sydney, Australia, in 2010 were included. Body fat percentage measurements were taken by using air displacement plethysmography. Objective composite measurements of perinatal morbidity were used to identify neonates who had poor outcomes; these data were extracted from medical records. The value of customized charts was assessed by calculating positive predictive values, negative predictive values, and odds ratios with 95% confidence intervals. Customized versus population-based charts did not improve the prediction of either low body fat percentage (59% vs. 66% positive predictive value and 87% vs. 89% negative predictive value, respectively) or high body fat percentage (48% vs. 53% positive predictive value and 90% vs. 89% negative predictive value, respectively). Customized charts were not better than population-based charts at predicting perinatal morbidity (for customized charts, odds ratio = 1.02, 95% confidence interval: 1.01, 1.04; for population-based charts, odds ratio = 1.03, 95% confidence interval: 1.01, 1.05) per percentile decrease in birth weight. Customized birth weight charts do not provide significant improvements over population-based charts in predicting neonatal growth and morbidity.

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

    Science.gov (United States)

    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.

  7. Design chart of optimum current leads

    International Nuclear Information System (INIS)

    Ishibashi, K.; Katase, A.; Maechata, K.

    1986-01-01

    The heat flow through current leads is one of major heat losses in a superconducting magnet system. To reduce the heat flow, current leads have been optimized in a complex way by varying such quantities as conductor length, cross-sectional area, heat transfer coefficient and cooling perimeter. Therefore, this study is made to simplify the design procedure, and to explain the general characteristics of the current leads. A new combined parameter which takes turbulent flow into account is introduced in the present work to enable us to draw a useful design chart. This chart gives, to a wide variety of current leads, detailed information about the optimum design-viz. geometric dimensions, heat flow into liquid helium, and pressure drop of the cooling gas. Change of the cross-sectional area along the conductor may improve the current lead performance. The effects of this area change are examined in detail

  8. Jean Rotz and the Marine Chart, 1542

    Science.gov (United States)

    Taylor, E. G. R.

    This paper was first published in the Journal in 1954 (Vol. 7, p. 138). It is followed by comments from Michael Richey.At the time (1542) when Jean Rotz presented Henry VIII with a variation compass, and an accompanying treatise on its making and use, the question of magnetic variation was an acute one. It formed part of a wider controversy concerning the general validity of the sea-chart which had been raised among seamen. As to this, Dr Pedro Nunez, writing a treatise in 1537 addressed to his friend and pupil the Infante Dom Luys of Portugal, said that there were skilled pilots who derided the chart and declared it to be - the falsest thing in the world. Hastening to its defence, Nunez dealt at length with the navigating errors introduced by ignoring the convergence of the meridians, and showed besides that a rhumb, or line of constant bearing was a spiral curve on the globe.

  9. Subtle Nonlinearity in Popular Album Charts

    Science.gov (United States)

    Bentley, R. Alexander; Maschner, Herbert D. G.

    Large-scale patterns of culture change may be explained by models of self organized criticality, or alternatively, by multiplicative processes. We speculate that popular album activity may be similar to critical models of extinction in that interconnected agents compete to survive within a limited space. Here we investigate whether popular music albums as listed on popular album charts display evidence of self-organized criticality, including a self-affine time series of activity and power-law distributions of lifetimes and exit activity in the chart. We find it difficult to distinguish between multiplicative growth and critical model hypotheses for these data. However, aspects of criticality may be masked by the selective sampling that a "Top 200" listing necessarily implies.

  10. APLIKASI GANTT CHART PADA ALGORITMA PENJADUALAN PROSES

    Directory of Open Access Journals (Sweden)

    Sri Handayani

    2014-01-01

    Full Text Available Operating system is a compulsory subject taken in the Information Technology Student FTIK - USM . In the discussion of the material management process of the operating systems course , there are some scheduling algorithm which processes need to be understood and any existing process scheduling algorithm presented in the form of Grantt Charts . Because of the difficulties experienced by students in understanding the process of scheduling algorithms by an Operating System become researchers inspiration to conduct this study to make an application Grantt Chart.. This study uses a waterfall system development , where the flow will follow the research the phase in waterfall . This application will be built using Visual Basic 6 .  The purpose of this research is to produce an application of learning are presented in graphical form to facilitate students in understanding the material scheduling process performed by an operating system so that students can also understand how a computer can do multiple processes simultaneously.

  11. JDATAVIEWER – JAVA-Based Charting Library

    CERN Document Server

    Kruk, G

    2009-01-01

    The JDataViewer is a Java-based charting library developed at CERN, with powerful, extensible and easy to use function editing capabilities. Function edition is heavily used in Control System applications, but poorly supported in products available on the market. The JDataViewer enables adding, removing and modifying function points graphically (using a mouse) or by editing a table of values. Custom edition strategies are supported: developer can specify an algorithm that reacts to the modification of a given point in the function by automatically adapting all other points. The library provides all typical 2D plotting types (scatter, polyline, area, bar, HiLo, contour), as well as data point annotations and data indicators. It also supports common interactors to zoom and move the visible view, or to select and highlight function segments. A clear API is provided to configure and customize all chart elements (colors, fonts, data ranges ...) programmatically, and to integrate non-standard rendering types, inter...

  12. Intelligent Bar Chart Plagiarism Detection in Documents

    Directory of Open Access Journals (Sweden)

    Mohammed Mumtaz Al-Dabbagh

    2014-01-01

    Full Text Available This paper presents a novel features mining approach from documents that could not be mined via optical character recognition (OCR. By identifying the intimate relationship between the text and graphical components, the proposed technique pulls out the Start, End, and Exact values for each bar. Furthermore, the word 2-gram and Euclidean distance methods are used to accurately detect and determine plagiarism in bar charts.

  13. Intelligent bar chart plagiarism detection in documents.

    Science.gov (United States)

    Al-Dabbagh, Mohammed Mumtaz; Salim, Naomie; Rehman, Amjad; Alkawaz, Mohammed Hazim; Saba, Tanzila; Al-Rodhaan, Mznah; Al-Dhelaan, Abdullah

    2014-01-01

    This paper presents a novel features mining approach from documents that could not be mined via optical character recognition (OCR). By identifying the intimate relationship between the text and graphical components, the proposed technique pulls out the Start, End, and Exact values for each bar. Furthermore, the word 2-gram and Euclidean distance methods are used to accurately detect and determine plagiarism in bar charts.

  14. Intelligent Bar Chart Plagiarism Detection in Documents

    Science.gov (United States)

    Al-Dabbagh, Mohammed Mumtaz; Salim, Naomie; Alkawaz, Mohammed Hazim; Saba, Tanzila; Al-Rodhaan, Mznah; Al-Dhelaan, Abdullah

    2014-01-01

    This paper presents a novel features mining approach from documents that could not be mined via optical character recognition (OCR). By identifying the intimate relationship between the text and graphical components, the proposed technique pulls out the Start, End, and Exact values for each bar. Furthermore, the word 2-gram and Euclidean distance methods are used to accurately detect and determine plagiarism in bar charts. PMID:25309952

  15. Replica methods for loopy sparse random graphs

    International Nuclear Information System (INIS)

    Coolen, ACC

    2016-01-01

    I report on the development of a novel statistical mechanical formalism for the analysis of random graphs with many short loops, and processes on such graphs. The graphs are defined via maximum entropy ensembles, in which both the degrees (via hard constraints) and the adjacency matrix spectrum (via a soft constraint) are prescribed. The sum over graphs can be done analytically, using a replica formalism with complex replica dimensions. All known results for tree-like graphs are recovered in a suitable limit. For loopy graphs, the emerging theory has an appealing and intuitive structure, suggests how message passing algorithms should be adapted, and what is the structure of theories describing spin systems on loopy architectures. However, the formalism is still largely untested, and may require further adjustment and refinement. (paper)

  16. Chemical Graph Transformation with Stereo-Information

    DEFF Research Database (Denmark)

    Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel

    2017-01-01

    Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...

  17. Reconstructing Topological Graphs and Continua

    OpenAIRE

    Gartside, Paul; Pitz, Max F.; Suabedissen, Rolf

    2015-01-01

    The deck of a topological space $X$ is the set $\\mathcal{D}(X)=\\{[X \\setminus \\{x\\}] \\colon x \\in X\\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever $\\mathcal{D}(X)=\\mathcal{D}(Y)$ then $X$ is homeomorphic to $Y$. It is shown that all metrizable compact connected spaces are reconstructible. It follows that all finite graphs, when viewed as a 1-dimensional cell-complex, are reconstructible in the topological sense, and more genera...

  18. Decomposing a graph into bistars

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2013-01-01

    Bárat and the present author conjectured that, for each tree T, there exists a natural number kT such that the following holds: If G is a kT-edge-connected graph such that |E(T)| divides |E(G)|, then G has a T-decomposition, that is, a decomposition of the edge set into trees each of which...... is isomorphic to T. The conjecture has been verified for infinitely many paths and for each star. In this paper we verify the conjecture for an infinite family of trees that are neither paths nor stars, namely all the bistars S(k,k+1)....

  19. On path hypercompositions in graphs and automata

    Directory of Open Access Journals (Sweden)

    Massouros Christos G.

    2016-01-01

    Full Text Available The paths in graphs define hypercompositions in the set of their vertices and therefore it is feasible to associate hypercompositional structures to each graph. Similarly, the strings of letters from their alphabet, define hypercompositions in the automata, which in turn define the associated hypergroups to the automata. The study of the associated hypercompositional structures gives results in both, graphs and automata theory.

  20. Attack Graph Construction for Security Events Analysis

    Directory of Open Access Journals (Sweden)

    Andrey Alexeevich Chechulin

    2014-09-01

    Full Text Available The paper is devoted to investigation of the attack graphs construction and analysis task for a network security evaluation and real-time security event processing. Main object of this research is the attack modeling process. The paper contains the description of attack graphs building, modifying and analysis technique as well as overview of implemented prototype for network security analysis based on attack graph approach.

  1. Steiner Distance in Graphs--A Survey

    OpenAIRE

    Mao, Yaping

    2017-01-01

    For a connected graph $G$ of order at least $2$ and $S\\subseteq V(G)$, the \\emph{Steiner distance} $d_G(S)$ among the vertices of $S$ is the minimum size among all connected subgraphs whose vertex sets contain $S$. In this paper, we summarize the known results on the Steiner distance parameters, including Steiner distance, Steiner diameter, Steiner center, Steiner median, Steiner interval, Steiner distance hereditary graph, Steiner distance stable graph, average Steiner distance, and Steiner ...

  2. Density conditions for triangles in multipartite graphs

    DEFF Research Database (Denmark)

    Bondy, Adrian; Shen, Jin; Thomassé, Stephan

    2006-01-01

    subgraphs in G. We investigate in particular the case where G is a complete multipartite graph. We prove that a finite tripartite graph with all edge densities greater than the golden ratio has a triangle and that this bound is best possible. Also we show that an infinite-partite graph with finite parts has...... a triangle, provided that the edge density between any two parts is greater than 1/2....

  3. Efficient Algorithmic Frameworks via Structural Graph Theory

    Science.gov (United States)

    2016-10-28

    constant. For example, they measured that, on large samples of the entire network, the Amazon graph has average degree 17.7, the Facebook graph has average...department heads’ opinions of departments, and generally lack transparency and well-defined measures . On the other hand, the National Research Council (the...Efficient and practical resource block allocation for LTE -based D2D network via graph coloring. Wireless Networks 20(4): 611-624 (2014) 50. Hossein

  4. Reproducibility of graph metrics of human brain functional networks.

    Science.gov (United States)

    Deuker, Lorena; Bullmore, Edward T; Smith, Marie; Christensen, Soren; Nathan, Pradeep J; Rockstroh, Brigitte; Bassett, Danielle S

    2009-10-01

    Graph theory provides many metrics of complex network organization that can be applied to analysis of brain networks derived from neuroimaging data. Here we investigated the test-retest reliability of graph metrics of functional networks derived from magnetoencephalography (MEG) data recorded in two sessions from 16 healthy volunteers who were studied at rest and during performance of the n-back working memory task in each session. For each subject's data at each session, we used a wavelet filter to estimate the mutual information (MI) between each pair of MEG sensors in each of the classical frequency intervals from gamma to low delta in the overall range 1-60 Hz. Undirected binary graphs were generated by thresholding the MI matrix and 8 global network metrics were estimated: the clustering coefficient, path length, small-worldness, efficiency, cost-efficiency, assortativity, hierarchy, and synchronizability. Reliability of each graph metric was assessed using the intraclass correlation (ICC). Good reliability was demonstrated for most metrics applied to the n-back data (mean ICC=0.62). Reliability was greater for metrics in lower frequency networks. Higher frequency gamma- and beta-band networks were less reliable at a global level but demonstrated high reliability of nodal metrics in frontal and parietal regions. Performance of the n-back task was associated with greater reliability than measurements on resting state data. Task practice was also associated with greater reliability. Collectively these results suggest that graph metrics are sufficiently reliable to be considered for future longitudinal studies of functional brain network changes.

  5. Decomposing a planar graph into an independent set and a 3-degenerate graph

    DEFF Research Database (Denmark)

    Thomassen, Carsten

    2001-01-01

    We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph. (C) 2001 Academic Press....

  6. Graph algorithms in the titan toolkit.

    Energy Technology Data Exchange (ETDEWEB)

    McLendon, William Clarence, III; Wylie, Brian Neil

    2009-10-01

    Graph algorithms are a key component in a wide variety of intelligence analysis activities. The Graph-Based Informatics for Non-Proliferation and Counter-Terrorism project addresses the critical need of making these graph algorithms accessible to Sandia analysts in a manner that is both intuitive and effective. Specifically we describe the design and implementation of an open source toolkit for doing graph analysis, informatics, and visualization that provides Sandia with novel analysis capability for non-proliferation and counter-terrorism.

  7. The Harary index of a graph

    CERN Document Server

    Xu, Kexiang; Trinajstić, Nenad

    2015-01-01

    This is the first book to focus on the topological index, the Harary index, of a graph, including its mathematical properties, chemical applications and some related and attractive open problems. This book is dedicated to Professor Frank Harary (1921—2005), the grandmaster of graph theory and its applications. It has be written by experts in the field of graph theory and its applications. For a connected graph G, as an important distance-based topological index, the Harary index H(G) is defined as the sum of the reciprocals of the distance between any two unordered vertices of the graph G. In this book, the authors report on the newest results on the Harary index of a graph. These results mainly concern external graphs with respect to the Harary index; the relations to other topological indices; its properties and applications to pure graph theory and chemical graph theory; and two significant variants, i.e., additively and multiplicatively weighted Harary indices. In the last chapter, we present a number o...

  8. Mechatronic modeling and simulation using bond graphs

    CERN Document Server

    Das, Shuvra

    2009-01-01

    Introduction to Mechatronics and System ModelingWhat Is Mechatronics?What Is a System and Why Model Systems?Mathematical Modeling Techniques Used in PracticeSoftwareBond Graphs: What Are They?Engineering SystemsPortsGeneralized VariablesBond GraphsBasic Components in SystemsA Brief Note about Bond Graph Power DirectionsSummary of Bond Direction RulesDrawing Bond Graphs for Simple Systems: Electrical and MechanicalSimplification Rules for Junction StructureDrawing Bond Graphs for Electrical SystemsDrawing Bond Graphs for Mechanical SystemsCausalityDrawing Bond Graphs for Hydraulic and Electronic Components and SystemsSome Basic Properties and Concepts for FluidsBond Graph Model of Hydraulic SystemsElectronic SystemsDeriving System Equations from Bond GraphsSystem VariablesDeriving System EquationsTackling Differential CausalityAlgebraic LoopsSolution of Model Equations and Their InterpretationZeroth Order SystemsFirst Order SystemsSecond Order SystemTransfer Functions and Frequency ResponsesNumerical Solution ...

  9. An algebraic approach to graph codes

    DEFF Research Database (Denmark)

    Pinero, Fernando

    This thesis consists of six chapters. The first chapter, contains a short introduction to coding theory in which we explain the coding theory concepts we use. In the second chapter, we present the required theory for evaluation codes and also give an example of some fundamental codes in coding...... theory as evaluation codes. Chapter three consists of the introduction to graph based codes, such as Tanner codes and graph codes. In Chapter four, we compute the dimension of some graph based codes with a result combining graph based codes and subfield subcodes. Moreover, some codes in chapter four...

  10. The color space of a graph

    DEFF Research Database (Denmark)

    Jensen, T.R.; Thomassen, Carsten

    2000-01-01

    If k is a prime power, and G is a graph with n vertices, then a k-coloring of G may be considered as a vector in GF(k)(n). We prove that the subspace of GF(3)(n) spanned by all 3-colorings of a planar triangle-free graph with n vertices has dimension n. In particular, any such graph has at least n...... - 1 nonequivalent 3-colorings, and the addition of any edge or any vertex of degree 3 results in a 3-colorable graph. (C) 2000 John Wiley & Sons, Inc....

  11. Interactive Graph Layout of a Million Nodes

    Directory of Open Access Journals (Sweden)

    Peng Mi

    2016-12-01

    Full Text Available Sensemaking of large graphs, specifically those with millions of nodes, is a crucial task in many fields. Automatic graph layout algorithms, augmented with real-time human-in-the-loop interaction, can potentially support sensemaking of large graphs. However, designing interactive algorithms to achieve this is challenging. In this paper, we tackle the scalability problem of interactive layout of large graphs, and contribute a new GPU-based force-directed layout algorithm that exploits graph topology. This algorithm can interactively layout graphs with millions of nodes, and support real-time interaction to explore alternative graph layouts. Users can directly manipulate the layout of vertices in a force-directed fashion. The complexity of traditional repulsive force computation is reduced by approximating calculations based on the hierarchical structure of multi-level clustered graphs. We evaluate the algorithm performance, and demonstrate human-in-the-loop layout in two sensemaking case studies. Moreover, we summarize lessons learned for designing interactive large graph layout algorithms on the GPU.

  12. Text-Filled Stacked Area Graphs

    DEFF Research Database (Denmark)

    Kraus, Martin

    2011-01-01

    -filled stacked area graphs; i.e., graphs that feature stacked areas that are filled with small-typed text. Since these graphs allow for computing the text layout automatically, it is possible to include large amounts of textual detail with very little effort. We discuss the most important challenges and some...... solutions for the design of text-filled stacked area graphs with the help of an exemplary visualization of the genres, publication years, and titles of a database of several thousand PC games....

  13. Reconstructing Nearly Simple Polytopes from their Graph

    OpenAIRE

    Doolittle, Joseph

    2017-01-01

    We present a partial description of which polytopes are reconstructible from their graphs. This is an extension of work by Blind and Mani (1987) and Kalai (1988), which showed that simple polytopes can be reconstructed from their graphs. In particular, we introduce a notion of $h$-nearly simple and prove that 1-nearly simple and 2-nearly simple polytopes are reconstructible from their graphs. We also give an example of a 3-nearly simple polytope which is not reconstructible from its graph. Fu...

  14. A Reduction of the Graph Reconstruction Conjecture

    Directory of Open Access Journals (Sweden)

    Monikandan S.

    2014-08-01

    Full Text Available A graph is said to be reconstructible if it is determined up to isomor- phism from the collection of all its one-vertex deleted unlabeled subgraphs. Reconstruction Conjecture (RC asserts that all graphs on at least three vertices are reconstructible. In this paper, we prove that interval-regular graphs and some new classes of graphs are reconstructible and show that RC is true if and only if all non-geodetic and non-interval-regular blocks G with diam(G = 2 or diam(Ḡ = diam(G = 3 are reconstructible

  15. Total dominator chromatic number of a graph

    Directory of Open Access Journals (Sweden)

    Adel P. Kazemi

    2015-06-01

    Full Text Available Given a graph $G$, the total dominator coloring problem seeks a proper coloring of $G$ with the additional property that every vertex in the graph is adjacent to all vertices of a color class. We seek to minimize the number of color classes. We initiate to study this problem on several classes of graphs, as well as finding general bounds and characterizations. We also compare the total dominator chromatic number of a graph with the chromatic number and the total domination number of it.

  16. Equitable Colorings Of Corona Multiproducts Of Graphs

    Directory of Open Access Journals (Sweden)

    Furmánczyk Hanna

    2017-11-01

    Full Text Available A graph is equitably k-colorable if its vertices can be partitioned into k independent sets in such a way that the numbers of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G and denoted by =(G. It is known that the problem of computation of =(G is NP-hard in general and remains so for corona graphs. In this paper we consider the same model of coloring in the case of corona multiproducts of graphs. In particular, we obtain some results regarding the equitable chromatic number for the l-corona product G ◦l H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a cycle or a complete graph. Our proofs are mostly constructive in that they lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G. Moreover, we confirm the Equitable Coloring Conjecture for corona products of such graphs. This paper extends the results from [H. Furmánczyk, K. Kaliraj, M. Kubale and V.J. Vivin, Equitable coloring of corona products of graphs, Adv. Appl. Discrete Math. 11 (2013 103–120].

  17. VT Digital Line Graph Miscellaneous Transmission Lines

    Data.gov (United States)

    Vermont Center for Geographic Information — (Link to Metadata) This datalayer is comprised of Miscellaineous Transmission Lines. Digital line graph (DLG) data are digital representations of cartographic...

  18. Comparison of customised growth charts v. standard population

    African Journals Online (AJOL)

    pregnant diabetic population using population-based growth charts and customised growth charts. Methods. ... Of the patients, 44 had type 1, 66 type 2 and 173 gestational diabetes. The growth of .... with diabetic ketoacidosis, of whom one.

  19. Arctic Sea Ice Charts from Danish Meteorological Institute, 1893 - 1956

    Data.gov (United States)

    National Oceanic and Atmospheric Administration, Department of Commerce — From 1893 to 1956, the Danish Meteorological Institute (DMI) created charts of observed and inferred sea ice extent for each summer month. These charts are based on...

  20. U.S. Pacific Command > Organization > Organization Chart

    Science.gov (United States)

    Responsibility USPACOM Previous Commanders Organization Organization Chart Media News Flickr Photos Video Directory Media Inquiries Home : Organization : Organization Chart About DoD DoD Careers Join the Military

  1. Chesapeake Highway Advisories Routing Traffic, Chart, Business Plan

    Science.gov (United States)

    1996-10-01

    THE BUSINESS PLAN IS ORGANIZED INTO FOUR MAJOR SECTIONS. THE FIRST SECTION IS INTRODUCTORY IN NATURE AND PROVIDES BACKGROUND INFORMATION ON ITS AND THE CHART PROGRAM IN MARYLAND. IT INCLUDES THE CHART MISSION, GOALS AND OBJECTIVES, AS WELL AS OVERVIE...

  2. A new Snellen's visual acuity chart with 'Indian' numerals.

    OpenAIRE

    Al-Salem, M

    1987-01-01

    'Indian' numerals, which are popular among the Arab population, were used to devise a new Snellen's visual acuity chart. The new chart has the advantages of a reading chart. It keeps the patient's interest, does not miss alexic patients, and is quicker to perform. It is also devoid of the many disadvantages of a kinetic response chart (the capital E letter or Landolt's broken rings), especially that of the limited option of test objects.

  3. On cyclic orthogonal double covers of circulant graphs by special infinite graphs

    Directory of Open Access Journals (Sweden)

    R. El-Shanawany

    2017-12-01

    Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

  4. The complexity of the matching-cut problem for planar graphs and other graph classes

    NARCIS (Netherlands)

    Bonsma, P.S.

    2009-01-01

    The Matching-Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be -complete when restricted to graphs with maximum degree four. In this paper it

  5. Memory-type control charts for monitoring the process dispersion

    NARCIS (Netherlands)

    Abbas, N.; Riaz, M.; Does, R.J.M.M.

    2014-01-01

    Control charts have been broadly used for monitoring the process mean and dispersion. Cumulative sum (CUSUM) and exponentially weighted moving average (EWMA) control charts are memory control charts as they utilize the past information in setting up the control structure. This makes CUSUM and

  6. 15 CFR 738.3 - Commerce Country Chart structure.

    Science.gov (United States)

    2010-01-01

    ... 15 Commerce and Foreign Trade 2 2010-01-01 2010-01-01 false Commerce Country Chart structure. 738.3 Section 738.3 Commerce and Foreign Trade Regulations Relating to Commerce and Foreign Trade... COMMERCE CONTROL LIST OVERVIEW AND THE COUNTRY CHART § 738.3 Commerce Country Chart structure. (a) Scope...

  7. Probability on graphs random processes on graphs and lattices

    CERN Document Server

    Grimmett, Geoffrey

    2018-01-01

    This introduction to some of the principal models in the theory of disordered systems leads the reader through the basics, to the very edge of contemporary research, with the minimum of technical fuss. Topics covered include random walk, percolation, self-avoiding walk, interacting particle systems, uniform spanning tree, random graphs, as well as the Ising, Potts, and random-cluster models for ferromagnetism, and the Lorentz model for motion in a random medium. This new edition features accounts of major recent progress, including the exact value of the connective constant of the hexagonal lattice, and the critical point of the random-cluster model on the square lattice. The choice of topics is strongly motivated by modern applications, and focuses on areas that merit further research. Accessible to a wide audience of mathematicians and physicists, this book can be used as a graduate course text. Each chapter ends with a range of exercises.

  8. Enabling Graph Appliance for Genome Assembly

    Energy Technology Data Exchange (ETDEWEB)

    Singh, Rina [ORNL; Graves, Jeffrey A [ORNL; Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Shankar, Mallikarjun [ORNL

    2015-01-01

    In recent years, there has been a huge growth in the amount of genomic data available as reads generated from various genome sequencers. The number of reads generated can be huge, ranging from hundreds to billions of nucleotide, each varying in size. Assembling such large amounts of data is one of the challenging computational problems for both biomedical and data scientists. Most of the genome assemblers developed have used de Bruijn graph techniques. A de Bruijn graph represents a collection of read sequences by billions of vertices and edges, which require large amounts of memory and computational power to store and process. This is the major drawback to de Bruijn graph assembly. Massively parallel, multi-threaded, shared memory systems can be leveraged to overcome some of these issues. The objective of our research is to investigate the feasibility and scalability issues of de Bruijn graph assembly on Cray s Urika-GD system; Urika-GD is a high performance graph appliance with a large shared memory and massively multithreaded custom processor designed for executing SPARQL queries over large-scale RDF data sets. However, to the best of our knowledge, there is no research on representing a de Bruijn graph as an RDF graph or finding Eulerian paths in RDF graphs using SPARQL for potential genome discovery. In this paper, we address the issues involved in representing a de Bruin graphs as RDF graphs and propose an iterative querying approach for finding Eulerian paths in large RDF graphs. We evaluate the performance of our implementation on real world ebola genome datasets and illustrate how genome assembly can be accomplished with Urika-GD using iterative SPARQL queries.

  9. Correlation between skin color evaluation by skin color scale chart and narrowband reflectance spectrophotometer.

    Science.gov (United States)

    Treesirichod, Arucha; Chansakulporn, Somboon; Wattanapan, Pattra

    2014-07-01

    Various methods are available for the evaluation of skin color. A skin color scale chart is a convenient and inexpensive tool. However, the correlation between a skin color scale chart and objective measurement has not been evaluated. To assess the correlation between skin color evaluation done by a skin color scale chart (Felix von Luschan skin color chart) and a narrowband reflectance spectrophotometer (Mexameter MX18). The participants were evaluated for skin color by using the Felix von Luschan skin color chart (range 1-36) and a narrowband reflectance spectrophotometer (Mexameter MX18) in which the results of the measurements were expressed as Erythema (E) and Melanin (M) indices. Skin color was measured on four different anatomical skin sites from each participant on the medial aspect of the volar and the dorsal regions of both forearms. A total of 208 records from 52 participants were established. The majority of participants (19.2%) were rated with the skin color scale at the number 16 (range 14-33). The mean M plus E, M, and E indices were 498.9 ± 143.9, 230.4 ± 74.4, and 268.5 ± 73.2, respectively. The correlation coefficient between the number on the skin color scale and each index: M plus E, M, and E indices were 0.90, 0.90, and 0.86, respectively, with a statistical significance of P spectrophotometer.

  10. Isospectral graphs with identical nodal counts

    International Nuclear Information System (INIS)

    Oren, Idan; Band, Ram

    2012-01-01

    According to a recent conjecture, isospectral objects have different nodal count sequences (Gnutzmann et al 2005 J. Phys. A: Math. Gen. 38 8921–33). We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counterexamples to this conjecture. In addition, these examples demonstrate a surprising connection between isospectral discrete and quantum graphs. (paper)

  11. Compression-based inference on graph data

    NARCIS (Netherlands)

    Bloem, P.; van den Bosch, A.; Heskes, T.; van Leeuwen, D.

    2013-01-01

    We investigate the use of compression-based learning on graph data. General purpose compressors operate on bitstrings or other sequential representations. A single graph can be represented sequentially in many ways, which may in uence the performance of sequential compressors. Using Normalized

  12. On minimum degree conditions for supereulerian graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Xiong, L.

    1999-01-01

    A graph is called supereulerian if it has a spanning closed trail. Let $G$ be a 2-edge-connected graph of order $n$ such that each minimal edge cut $E \\subseteq E (G)$ with $|E| \\le 3$ satisfies the property that each component of $G-E$ has order at least $(n-2)/5$. We prove that either $G$ is

  13. On the exterior structure of graphs

    International Nuclear Information System (INIS)

    Kastler, Daniel

    2004-01-01

    After a detailed ab initio description of the exterior structure of graphs as handled by Connes and Kreimer in their work on renormalization (illustrated by the example of the φ 3 model in six dimensions) we spell out in detail their study of the Lie algebra of infinitesimal characters and of the group of characters of the Hopf algebra of Feynman graphs

  14. The Minimum Distance of Graph Codes

    DEFF Research Database (Denmark)

    Høholdt, Tom; Justesen, Jørn

    2011-01-01

    We study codes constructed from graphs where the code symbols are associated with the edges and the symbols connected to a given vertex are restricted to be codewords in a component code. In particular we treat such codes from bipartite expander graphs coming from Euclidean planes and other...... geometries. We give results on the minimum distances of the codes....

  15. Domination versus disjunctive domination in graphs | Henning ...

    African Journals Online (AJOL)

    Domination versus disjunctive domination in graphs. Michael A Henning, Sinclair A Marcon. Abstract. A dominating set in a graph G is a set S of vertices of G such that every vertex not in S is adjacent to a vertex of S. The domination number of G is the minimum cardinality of a dominating set of G. For a positive integer b, ...

  16. Eigenvalues and expansion of bipartite graphs

    DEFF Research Database (Denmark)

    Høholdt, Tom; Janwa, Heeralal

    2012-01-01

    We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...

  17. Co-Roman domination in graphs

    Indian Academy of Sciences (India)

    1National Centre for Advanced Research in Discrete Mathematics ... 3Department of Computer Science, Ball State University, Muncie, IN, USA .... The corona of two disjoint graphs G1 and G2 is defined to be the graph G = G1 ◦ G2,.

  18. Trajectories entropy in dynamical graphs with memory

    Directory of Open Access Journals (Sweden)

    Francesco eCaravelli

    2016-04-01

    Full Text Available In this paper we investigate the application of non-local graph entropy to evolving and dynamical graphs. The measure is based upon the notion of Markov diffusion on a graph, and relies on the entropy applied to trajectories originating at a specific node. In particular, we study the model of reinforcement-decay graph dynamics, which leads to scale free graphs. We find that the node entropy characterizes the structure of the network in the two parameter phase-space describing the dynamical evolution of the weighted graph. We then apply an adapted version of the entropy measure to purely memristive circuits. We provide evidence that meanwhile in the case of DC voltage the entropy based on the forward probability is enough to characterize the graph properties, in the case of AC voltage generators one needs to consider both forward and backward based transition probabilities. We provide also evidence that the entropy highlights the self-organizing properties of memristive circuits, which re-organizes itself to satisfy the symmetries of the underlying graph.

  19. Graphs, Ideal Flow, and the Transportation Network

    OpenAIRE

    Teknomo, Kardi

    2016-01-01

    This lecture discusses the mathematical relationship between network structure and network utilization of transportation network. Network structure means the graph itself. Network utilization represent the aggregation of trajectories of agents in using the network graph. I show the similarity and relationship between the structural pattern of the network and network utilization.

  20. Supplantation of Mental Operations on Graphs

    Science.gov (United States)

    Vogel, Markus; Girwidz, Raimund; Engel, Joachim

    2007-01-01

    Research findings show the difficulties younger students have in working with graphs. Higher mental operations are necessary for a skilled interpretation of abstract representations. We suggest connecting a concrete representation of the modeled problem with the related graph. The idea is to illustrate essential mental operations externally. This…

  1. Some remarks on definability of process graphs

    NARCIS (Netherlands)

    Grabmayer, C.A.; Klop, J.W.; Luttik, B.; Baier, C.; Hermanns, H.

    2006-01-01

    We propose the notions of "density" and "connectivity" of infinite process graphs and investigate them in the context of the wellknown process algebras BPA and BPP. For a process graph G, the density function in a state s maps a natural number n to the number of states of G with distance less or

  2. On revealing graph cycles via boundary measurements

    International Nuclear Information System (INIS)

    Belishev, M I; Wada, N

    2009-01-01

    This paper deals with boundary value inverse problems on a metric graph, the structure of the graph being assumed unknown. The question under consideration is how to detect from the dynamical and/or spectral inverse data whether the graph contains cycles (is not a tree). For any graph Ω, the dynamical as well as spectral boundary inverse data determine the so-called wave diameter d w : H -1 (Ω) → R defined on functionals supported in the graph. The known fact is that if Ω is a tree then d w ≥ 0 holds and, in this case, the inverse data determine Ω up to isometry. A graph Ω is said to be coordinate if the functions {dist Ω (., γ)} γin∂Ω constitute a coordinate system on Ω. For such graphs, we propose a procedure, which reveals the presence/absence of cycles. The hypothesis is that Ω contains cycles if and only if d w takes negative values. We do not justify this hypothesis in the general case but reduce it to a certain special class of graphs (suns)

  3. Declarative Process Mining for DCR Graphs

    DEFF Research Database (Denmark)

    Debois, Søren; Hildebrandt, Thomas T.; Laursen, Paw Høvsgaard

    2017-01-01

    We investigate process mining for the declarative Dynamic Condition Response (DCR) graphs process modelling language. We contribute (a) a process mining algorithm for DCR graphs, (b) a proposal for a set of metrics quantifying output model quality, and (c) a preliminary example-based comparison...

  4. A Graph Library Extension of SVG

    DEFF Research Database (Denmark)

    Nørmark, Kurt

    2007-01-01

    be aggregated as a single node, and an entire graph can be embedded in a single node. In addition, a number of different graph animations are described. The starting point of the SVG extension is a library that provides an exact of mirror of SVG 1.1 in the functional programming language Scheme. Each element...

  5. Acyclicity in edge-colored graphs

    DEFF Research Database (Denmark)

    Gutin, Gregory; Jones, Mark; Sheng, Bin

    2017-01-01

    A walk W in edge-colored graphs is called properly colored (PC) if every pair of consecutive edges in W is of different color. We introduce and study five types of PC acyclicity in edge-colored graphs such that graphs of PC acyclicity of type i is a proper superset of graphs of acyclicity of type i......+1, i=1,2,3,4. The first three types are equivalent to the absence of PC cycles, PC closed trails, and PC closed walks, respectively. While graphs of types 1, 2 and 3 can be recognized in polynomial time, the problem of recognizing graphs of type 4 is, somewhat surprisingly, NP-hard even for 2-edge-colored...... graphs (i.e., when only two colors are used). The same problem with respect to type 5 is polynomial-time solvable for all edge-colored graphs. Using the five types, we investigate the border between intractability and tractability for the problems of finding the maximum number of internally vertex...

  6. From concatenated codes to graph codes

    DEFF Research Database (Denmark)

    Justesen, Jørn; Høholdt, Tom

    2004-01-01

    We consider codes based on simple bipartite expander graphs. These codes may be seen as the first step leading from product type concatenated codes to more complex graph codes. We emphasize constructions of specific codes of realistic lengths, and study the details of decoding by message passing...

  7. Graph coarsening and clustering on the GPU

    NARCIS (Netherlands)

    Fagginger Auer, B.O.; Bisseling, R.H.

    2013-01-01

    Agglomerative clustering is an effective greedy way to quickly generate graph clusterings of high modularity in a small amount of time. In an effort to use the power offered by multi-core CPU and GPU hardware to solve the clustering problem, we introduce a fine-grained sharedmemory parallel graph

  8. Pixels to Graphs by Associative Embedding

    KAUST Repository

    Newell, Alejandro; Deng, Jia

    2017-01-01

    network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them

  9. Isomorphisms and traversability of directed path graphs

    NARCIS (Netherlands)

    Broersma, Haitze J.; Li, Xueliang; Li, X.

    1998-01-01

    The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\\forw P_k(D)$ of a digraph $D$ is obtained by representing the directed paths on $k$ vertices of $D$ by vertices. Two vertices are joined by an arc whenever the corresponding directed paths in $D$

  10. Perfect secure domination in graphs

    Directory of Open Access Journals (Sweden)

    S.V. Divya Rashmi

    2017-07-01

    Full Text Available Let $G=(V,E$ be a graph. A subset $S$ of $V$ is a dominating set of $G$ if every vertex in $Vsetminus  S$ is adjacent to a vertex in $S.$ A dominating set $S$ is called a secure dominating set if for each $vin Vsetminus S$ there exists $uin S$ such that $v$ is adjacent to $u$ and $S_1=(Ssetminus{u}cup {v}$ is a dominating set. If further the vertex $uin S$ is unique, then $S$ is called a perfect secure dominating set. The minimum cardinality of a perfect secure dominating set of $G$ is called the perfect  secure domination number of $G$ and is denoted by $gamma_{ps}(G.$ In this paper we initiate a study of this parameter and present several basic results.

  11. Graph Mining Meets the Semantic Web

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Sangkeun (Matt) [ORNL; Sukumar, Sreenivas R [ORNL; Lim, Seung-Hwan [ORNL

    2015-01-01

    The Resource Description Framework (RDF) and SPARQL Protocol and RDF Query Language (SPARQL) were introduced about a decade ago to enable flexible schema-free data interchange on the Semantic Web. Today, data scientists use the framework as a scalable graph representation for integrating, querying, exploring and analyzing data sets hosted at different sources. With increasing adoption, the need for graph mining capabilities for the Semantic Web has emerged. We address that need through implementation of three popular iterative Graph Mining algorithms (Triangle count, Connected component analysis, and PageRank). We implement these algorithms as SPARQL queries, wrapped within Python scripts. We evaluate the performance of our implementation on 6 real world data sets and show graph mining algorithms (that have a linear-algebra formulation) can indeed be unleashed on data represented as RDF graphs using the SPARQL query interface.

  12. On the nullity number of graphs

    Directory of Open Access Journals (Sweden)

    Mustapha Aouchiche

    2017-10-01

    Full Text Available The paper discusses bounds on the nullity number of graphs. It is proved in [B. Cheng and B. Liu, On the nullity of graphs. Electron. J. Linear Algebra 16 (2007 60--67] that $\\eta \\le n - D$, where $\\eta$, n and D denote the nullity number, the order and the diameter of a connected graph, respectively. We first give a necessary condition on the extremal graphs corresponding to that bound, and then we strengthen the bound itself using the maximum clique number. In addition, we prove bounds on the nullity using the number of pendant neighbors in a graph. One of those bounds is an improvement of a known bound involving the domination number.

  13. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2011-01-01

    in a third syntactic theory. The structure of the store-based abstract machine corresponding to this third syntactic theory oincides with that of Turner's original reduction machine. The three syntactic theories presented here The three syntactic heories presented here therefore have the following......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...

  14. Three Syntactic Theories for Combinatory Graph Reduction

    DEFF Research Database (Denmark)

    Danvy, Olivier; Zerny, Ian

    2013-01-01

    , as a store-based reduction semantics of combinatory term graphs. We then refocus this store-based reduction semantics into a store-based abstract machine. The architecture of this store-based abstract machine coincides with that of Turner's original reduction machine. The three syntactic theories presented......We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...

  15. Algorithms and Data Structures for Graphs

    DEFF Research Database (Denmark)

    Rotenberg, Eva

    are planar graphs, which are those that can be drawn on a piece of paper without any pair of edges crossing. For planar graphs where each edge can only be traversed in one direction, a fundamental question is whether there is a route from vertex A to vertex B in the graph. We show how such a graph can...... of the form: "Is there an edge such that all paths between A and B go via that edge?" and which can quickly be updated when edges are inserted or deleted. We further show how to represent a planar graph such that we can quickly update our representation when an edge is deleted, and such that questions...

  16. OPEX: Optimized Eccentricity Computation in Graphs

    Energy Technology Data Exchange (ETDEWEB)

    Henderson, Keith [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)

    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, unlike its competitors which give probabilistic approximations or sacrifice node-level information (eccentricity) to compute graphlevel information (diameter).

  17. On The Roman Domination Stable Graphs

    Directory of Open Access Journals (Sweden)

    Hajian Majid

    2017-11-01

    Full Text Available A Roman dominating function (or just RDF on a graph G = (V,E is a function f : V → {0, 1, 2} satisfying the condition that every vertex u for which f(u = 0 is adjacent to at least one vertex v for which f(v = 2. The weight of an RDF f is the value f(V (G = Pu2V (G f(u. The Roman domination number of a graph G, denoted by R(G, is the minimum weight of a Roman dominating function on G. A graph G is Roman domination stable if the Roman domination number of G remains unchanged under removal of any vertex. In this paper we present upper bounds for the Roman domination number in the class of Roman domination stable graphs, improving bounds posed in [V. Samodivkin, Roman domination in graphs: the class RUV R, Discrete Math. Algorithms Appl. 8 (2016 1650049].

  18. Pristine transfinite graphs and permissive electrical networks

    CERN Document Server

    Zemanian, Armen H

    2001-01-01

    A transfinite graph or electrical network of the first rank is obtained conceptually by connecting conventionally infinite graphs and networks together at their infinite extremities. This process can be repeated to obtain a hierarchy of transfiniteness whose ranks increase through the countable ordinals. This idea, which is of recent origin, has enriched the theories of graphs and networks with radically new constructs and research problems. The book provides a more accessible introduction to the subject that, though sacrificing some generality, captures the essential ideas of transfiniteness for graphs and networks. Thus, for example, some results concerning discrete potentials and random walks on transfinite networks can now be presented more concisely. Conversely, the simplifications enable the development of many new results that were previously unavailable. Topics and features: *A simplified exposition provides an introduction to transfiniteness for graphs and networks.*Various results for conventional g...

  19. A model of language inflection graphs

    Science.gov (United States)

    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.

  20. Disease management research using event graphs.

    Science.gov (United States)

    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.

  1. Pixels to Graphs by Associative Embedding

    KAUST Repository

    Newell, Alejandro

    2017-06-22

    Graphs are a useful abstraction of image content. Not only can graphs represent details about individual objects in a scene but they can capture the interactions between pairs of objects. We present a method for training a convolutional neural network such that it takes in an input image and produces a full graph. This is done end-to-end in a single stage with the use of associative embeddings. The network learns to simultaneously identify all of the elements that make up a graph and piece them together. We benchmark on the Visual Genome dataset, and report a Recall@50 of 9.7% compared to the prior state-of-the-art at 3.4%, a nearly threefold improvement on the challenging task of scene graph generation.

  2. Approximate Computing Techniques for Iterative Graph Algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Panyala, Ajay R.; Subasi, Omer; Halappanavar, Mahantesh; Kalyanaraman, Anantharaman; Chavarria Miranda, Daniel G.; Krishnamoorthy, Sriram

    2017-12-18

    Approximate computing enables processing of large-scale graphs by trading off quality for performance. Approximate computing techniques have become critical not only due to the emergence of parallel architectures but also the availability of large scale datasets enabling data-driven discovery. Using two prototypical graph algorithms, PageRank and community detection, we present several approximate computing heuristics to scale the performance with minimal loss of accuracy. We present several heuristics including loop perforation, data caching, incomplete graph coloring and synchronization, and evaluate their efficiency. We demonstrate performance improvements of up to 83% for PageRank and up to 450x for community detection, with low impact of accuracy for both the algorithms. We expect the proposed approximate techniques will enable scalable graph analytics on data of importance to several applications in science and their subsequent adoption to scale similar graph algorithms.

  3. Inferring ontology graph structures using OWL reasoning

    KAUST Repository

    Rodriguez-Garcia, Miguel Angel

    2018-01-05

    Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

  4. Inferring ontology graph structures using OWL reasoning.

    Science.gov (United States)

    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.

  5. Orientations of BCFW charts on the Grassmannian

    International Nuclear Information System (INIS)

    Olson, Timothy M.

    2015-01-01

    The Grassmannian formulation of N=4 super Yang-Mills theory expresses tree-level scattering amplitudes as linear combinations of residues from certain contour integrals. BCFW bridge decompositions using adjacent transpositions simplify the evaluation of individual residues, but orientation information is lost in the process. We present a straightforward algorithm to compute relative orientations between the resulting coordinate charts, and we show how to generalize the technique for charts corresponding to sequences of any not-necessarily-adjacent transpositions. As applications of these results, we demonstrate the existence of a signed boundary operator that manifestly squares to zero and prove via our algorithm that any residues appearing in the tree amplitude sum are decorated with appropriate signs so all poles that appear twice cancel exactly, not just mod 2 as in previous works. We also identify other non-physical poles in the boundary of Grassmannian representations of the amplitude and justify their removal so that the final result contains only physical local poles.

  6. The Hill Chart Calculation for Pelton Runner Models using the HydroHillChart - Pelton Module Software

    Directory of Open Access Journals (Sweden)

    Adelina Bostan

    2015-07-01

    Full Text Available The Pelton turbines industrial design is based on the hill chart characteristics obtained by measuring the models. Primary data measurements used to obtain the hill chart can be processed graphically, by hand or by using graphic programs respectively CAD programs; the HydroHillChart - Pelton module software is a specialized tool in achieving the hill chart, using interpolation cubic spline functions. Thereby, based on measurements of several models of Pelton turbines, a computerized library, used to design industrial Pelton turbines can be created. The paper presents the universal characteristics calculated by using the HydroHillChart - Pelton module software for a series of Pelton runners.

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

    Science.gov (United States)

    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…

  8. Graph-based Operational Semantics of a Lazy Functional Languages

    DEFF Research Database (Denmark)

    Rose, Kristoffer Høgsbro

    1992-01-01

    Presents Graph Operational Semantics (GOS): a semantic specification formalism based on structural operational semantics and term graph rewriting. Demonstrates the method by specifying the dynamic ...

  9. Multiplex visibility graphs to investigate recurrent neural network dynamics

    Science.gov (United States)

    Bianchi, Filippo Maria; Livi, Lorenzo; Alippi, Cesare; Jenssen, Robert

    2017-03-01

    A recurrent neural network (RNN) is a universal approximator of dynamical systems, whose performance often depends on sensitive hyperparameters. Tuning them properly may be difficult and, typically, based on a trial-and-error approach. In this work, we adopt a graph-based framework to interpret and characterize internal dynamics of a class of RNNs called echo state networks (ESNs). We design principled unsupervised methods to derive hyperparameters configurations yielding maximal ESN performance, expressed in terms of prediction error and memory capacity. In particular, we propose to model time series generated by each neuron activations with a horizontal visibility graph, whose topological properties have been shown to be related to the underlying system dynamics. Successively, horizontal visibility graphs associated with all neurons become layers of a larger structure called a multiplex. We show that topological properties of such a multiplex reflect important features of ESN dynamics that can be used to guide the tuning of its hyperparamers. Results obtained on several benchmarks and a real-world dataset of telephone call data records show the effectiveness of the proposed methods.

  10. Twin edge colorings of certain square graphs and product graphs

    Directory of Open Access Journals (Sweden)

    R Rajarajachozhan

    2016-04-01

    Full Text Available A twin edge $k\\!$-coloring of a graph $G$ is a proper edge $k$-coloring of $G$ with the elements of $\\mathbb{Z}_k$ so that the induced vertex $k$-coloring, in which the color of a vertex $v$ in $G$ is the sum in $\\mathbb{Z}_k$ of the colors of the edges incident with $v,$ is a proper vertex $k\\!$-coloring. The minimum $k$ for which $G$ has a twin edge $k\\!$-coloring is called the twin chromatic index of $G.$ Twin chromatic index of the square $P_n^2,$ $n\\ge 4,$ and the square $C_n^2,$ $n\\ge 6,$ are determined. In fact, the twin chromatic index of the square $C_7^2$ is $\\Delta+2,$ where $\\Delta$ is the maximum degree. Twin chromatic index of $C_m\\,\\Box\\,P_n$ is determined, where $\\Box$ denotes the Cartesian product. $C_r$ and $P_r$ are, respectively, the cycle, and the path on $r$ vertices each.

  11. Graph-theoretical concepts and physicochemical data

    Directory of Open Access Journals (Sweden)

    Lionello Pogliani

    2003-02-01

    Full Text Available Graph theoretical concepts have been used to model the molecular polarizabilities of fifty-four organic derivatives, and the induced dipole moment of a set of fifty-seven organic compounds divided into three subsets. The starting point of these modeling strategies is the hydrogen-suppressed chemical graph and pseudograph of a molecule, which works very well for second row atoms. From these types of graphs a set of graph-theoretical basis indices, the molecular connectivity indices, can be derived and used to model properties and activities of molecules. With the aid of the molecular connectivity basis indices it is then possible to build higher-order descriptors. The problem of 'graph' encoding the contribution of the inner-core electrons of heteroatoms can here be solved with the aid of odd complete graphs, Kp-(p-odd. The use of these graph tools allow to draw an optimal modeling of the molecular polarizabilities and a satisfactory modeling of the induced dipole moment of a wide set of organic derivatives.

  12. Optical generation of matter qubit graph states

    International Nuclear Information System (INIS)

    Benjamin, S C; Eisert, J; Stace, T M

    2005-01-01

    We present a scheme for rapidly entangling matter qubits in order to create graph states for one-way quantum computing. The qubits can be simple three-level systems in separate cavities. Coupling involves only local fields and a static (unswitched) linear optics network. Fusion of graph-state sections occurs with, in principle, zero probability of damaging the nascent graph state. We avoid the finite thresholds of other schemes by operating on two entangled pairs, so that each generates exactly one photon. We do not require the relatively slow single qubit local flips to be applied during the growth phase: growth of the graph state can then become a purely optical process. The scheme naturally generates graph states with vertices of high degree and so is easily able to construct minimal graph states, with consequent resource savings. The most efficient approach will be to create new graph-state edges even as qubits elsewhere are measured, in a 'just in time' approach. An error analysis indicates that the scheme is relatively robust against imperfections in the apparatus

  13. Draft tube flow phenomena across the bulb turbine hill chart

    International Nuclear Information System (INIS)

    Duquesne, P; Fraser, R; Maciel, Y; Aeschlimann, V; Deschênes, C

    2014-01-01

    In the framework of the BulbT project launched by the Consortium on Hydraulic Machines and the LAMH (Hydraulic Machine Laboratory of Laval University) in 2011, an intensive campaign to identify flow phenomena in the draft tube of a model bulb turbine has been done. A special focus was put on the draft tube component since it has a particular importance for recuperation in low head turbines. Particular operating points were chosen to analyse flow phenomena in this component. For each of these operating points, power, efficiency and pressure were measured following the IEC 60193 standard. Visualizations, unsteady wall pressure and efficiency measurements were performed in this component. The unsteady wall pressure was monitored at seven locations in the draft tube. The frequency content of each pressure signal was analyzed in order to characterize the flow phenomena across the efficiency hill chart. Visualizations were recorded with a high speed camera using tufts and cavitation bubbles as markers. The predominant detected phenomena were mapped and categorized in relation to the efficiency hill charts obtained for three runner blade openings. At partial load, the vortex rope was detected and characterized. An inflection in the partial load efficiency curves was found to be related to complex vortex rope instabilities. For overload conditions, the efficiency curves present a sharp drop after the best efficiency point, corresponding to an inflection on the power curves. This break off is more severe towards the highest blade openings. It is correlated to a flow separation at the wall of the draft tube. Also, due to the separation occurring in these conditions, a hysteresis effect was observed on the efficiency curves

  14. Particle transport in breathing quantum graph

    International Nuclear Information System (INIS)

    Matrasulov, D.U.; Yusupov, J.R.; Sabirov, K.K.; Sobirov, Z.A.

    2012-01-01

    Full text: Particle transport in nanoscale networks and discrete structures is of fundamental and practical importance. Usually such systems are modeled by so-called quantum graphs, the systems attracting much attention in physics and mathematics during past two decades [1-5]. During last two decades quantum graphs found numerous applications in modeling different discrete structures and networks in nanoscale and mesoscopic physics (e.g., see reviews [1-3]). Despite considerable progress made in the study of particle dynamics most of the problems deal with unperturbed case and the case of time-dependent perturbation has not yet be explored. In this work we treat particle dynamics for quantum star graph with time-dependent bonds. In particular, we consider harmonically breathing quantum star graphs, the cases of monotonically contracting and expanding graphs. The latter can be solved exactly analytically. Edge boundaries are considered to be time-dependent, while branching point is assumed to be fixed. Quantum dynamics of a particle in such graphs is studied by solving Schrodinger equation with time-dependent boundary conditions given on a star graph. Time-dependence of the average kinetic energy is analyzed. Space-time evolution of the Gaussian wave packet is treated for harmonically breathing star graph. It is found that for certain frequencies energy is a periodic function of time, while for others it can be non-monotonically growing function of time. Such a feature can be caused by possible synchronization of the particles motion and the motions of the moving edges of graph bonds. (authors) References: [1] Tsampikos Kottos and Uzy Smilansky, Ann. Phys., 76, 274 (1999). [2] Sven Gnutzmann and Uzy Smilansky, Adv. Phys. 55, 527 (2006). [3] S. GnutzmannJ.P. Keating, F. Piotet, Ann. Phys., 325, 2595 (2010). [4] P.Exner, P.Seba, P.Stovicek, J. Phys. A: Math. Gen. 21, 4009 (1988). [5] J. Boman, P. Kurasov, Adv. Appl. Math., 35, 58 (2005)

  15. Concordance of chart and billing data with direct observation in dental practice.

    Science.gov (United States)

    Demko, Catherine A; Victoroff, Kristin Zakariasen; Wotman, Stephen

    2008-10-01

    The commonly used methods of chart review, billing data summaries and practitioner self-reporting have not been examined for their ability to validly and reliably represent time use and service delivery in routine dental practice. A more thorough investigation of these data sources would provide insight into the appropriateness of each approach for measuring various clinical behaviors. The aim of this study was to assess the validity of commonly used methods such as dental chart review, billing data, or practitioner self-report compared with a 'gold standard' of information derived from direct observation of routine dental visits. A team of trained dental hygienists directly observed 3751 patient visits in 120 dental practices and recorded the behaviors and procedures performed by dentists and hygienists during patient contact time. Following each visit, charts and billing records were reviewed for the performed and billed procedures. Dental providers characterized their frequency of preventive service delivery through self-administered surveys. We standardized the observation and abstraction methods to obtain optimal measures from each of the multiple data sources. Multi-rater kappa coefficients were computed to monitor standardization, while sensitivity, specificity, and kappa coefficients were calculated to compare the various data sources with direct observation. Chart audits were more sensitive than billing data for all observed procedures and demonstrated higher agreement with directly observed data. Chart and billing records were not sensitive for several prevention-related tasks (oral cancer screening and oral hygiene instruction). Provider self-reports of preventive behaviors were always over-estimated compared with direct observation. Inter-method reliability kappa coefficients for 13 procedures ranged from 0.197 to 0.952. These concordance findings suggest that strengths and weaknesses of data collection sources should be considered when investigating

  16. A heterogeneous graph-based recommendation simulator

    Energy Technology Data Exchange (ETDEWEB)

    Yeonchan, Ahn [Seoul National University; Sungchan, Park [Seoul National University; Lee, Matt Sangkeun [ORNL; Sang-goo, Lee [Seoul National University

    2013-01-01

    Heterogeneous graph-based recommendation frameworks have flexibility in that they can incorporate various recommendation algorithms and various kinds of information to produce better results. In this demonstration, we present a heterogeneous graph-based recommendation simulator which enables participants to experience the flexibility of a heterogeneous graph-based recommendation method. With our system, participants can simulate various recommendation semantics by expressing the semantics via meaningful paths like User Movie User Movie. The simulator then returns the recommendation results on the fly based on the user-customized semantics using a fast Monte Carlo algorithm.

  17. Giant Components in Biased Graph Processes

    OpenAIRE

    Amir, Gideon; Gurel-Gurevich, Ori; Lubetzky, Eyal; Singer, Amit

    2005-01-01

    A random graph process, $\\Gorg[1](n)$, is a sequence of graphs on $n$ vertices which begins with the edgeless graph, and where at each step a single edge is added according to a uniform distribution on the missing edges. It is well known that in such a process a giant component (of linear size) typically emerges after $(1+o(1))\\frac{n}{2}$ edges (a phenomenon known as ``the double jump''), i.e., at time $t=1$ when using a timescale of $n/2$ edges in each step. We consider a generalization of ...

  18. Graph Processing on GPUs: A Survey

    DEFF Research Database (Denmark)

    Shi, Xuanhua; Zheng, Zhigao; Zhou, Yongluan

    2018-01-01

    hundreds of billions, has attracted much attention in both industry and academia. It still remains a great challenge to process such large-scale graphs. Researchers have been seeking for new possible solutions. Because of the massive degree of parallelism and the high memory access bandwidth in GPU......, utilizing GPU to accelerate graph processing proves to be a promising solution. This article surveys the key issues of graph processing on GPUs, including data layout, memory access pattern, workload mapping, and specific GPU programming. In this article, we summarize the state-of-the-art research on GPU...

  19. The Partial Mapping of the Web Graph

    Directory of Open Access Journals (Sweden)

    Kristina Machova

    2009-06-01

    Full Text Available The paper presents an approach to partial mapping of a web sub-graph. This sub-graph contains the nearest surroundings of an actual web page. Our work deals with acquiring relevant Hyperlinks of a base web site, generation of adjacency matrix, the nearest distance matrix and matrix of converted distances of Hyperlinks, detection of compactness of web representation, and visualization of its graphical representation. The paper introduces an LWP algorithm – a technique for Hyperlink filtration.  This work attempts to help users with the orientation within the web graph.

  20. Graph reconstruction with a betweenness oracle

    DEFF Research Database (Denmark)

    Abrahamsen, Mikkel; Bodwin, Greg; Rotenberg, Eva

    2016-01-01

    Graph reconstruction algorithms seek to learn a hidden graph by repeatedly querying a blackbox oracle for information about the graph structure. Perhaps the most well studied and applied version of the problem uses a distance oracle, which can report the shortest path distance between any pair...... of nodes. We introduce and study the betweenness oracle, where bet(a, m, z) is true iff m lies on a shortest path between a and z. This oracle is strictly weaker than a distance oracle, in the sense that a betweenness query can be simulated by a constant number of distance queries, but not vice versa...

  1. A first course in graph theory

    CERN Document Server

    Chartrand, Gary

    2012-01-01

    This comprehensive text offers undergraduates a remarkably student-friendly introduction to graph theory. Written by two of the field's most prominent experts, it takes an engaging approach that emphasizes graph theory's history. Unique examples and lucid proofs provide a sound yet accessible treatment that stimulates interest in an evolving subject and its many applications.Optional sections designated as ""excursion"" and ""exploration"" present interesting sidelights of graph theory and touch upon topics that allow students the opportunity to experiment and use their imaginations. Three app

  2. THE CHART ROMANIA-NATO-UE

    Directory of Open Access Journals (Sweden)

    Duduială Popescu Lorena

    2009-05-01

    Full Text Available viewed in the context of geopolitical and geostrategic current and through the elements of distinction in terms of identity and cultural institutions, chart Romania - NATO / Israel - EU stands under the sign of the common interest channel, firstly, on common values and hence the collective interests of the partners involved in the two organizational structures. Noteworthy in this context is the extent of bilateral involvement of Romania in the bodies and the politico-military, represented by NATO (the North Atlantic Treaty Organization, which is primarily military values and the construction superstate permanent expansion and development - European Union , both generating as much for our country as obligations of a politico-military security, and economic, social, institutional, cultural.

  3. Informal networks: the company behind the chart.

    Science.gov (United States)

    Krackhardt, D; Hanson, J R

    1993-01-01

    A glance at an organizational chart can show who's the boss and who reports to whom. But this formal chart won't reveal which people confer on technical matters or discuss office politics over lunch. Much of the real work in any company gets done through this informal organization with its complex networks of relationships that cross functions and divisions. According to consultants David Krackhardt and Jeffrey Hanson, managers can harness the true power in their companies by diagramming three types of networks: the advice network, which reveals the people to whom others turn to get work done; the trust network, which uncovers who shares delicate information; and the communication network, which shows who talks about work-related matters. Using employee questionnaires, managers can generate network maps that will get to the root of many organizational problems. When a task force in a computer company, for example, was not achieving its goals, the CEO turned to network maps to find out why. He discovered that the task force leader was central in the advice network but marginal in the trust network. Task force members did not believe he would look out for their interests, so the CEO used the trust map to find someone to share responsibility for the group. And when a bank manager saw in the network map that there was little communication between tellers and supervisors, he looked for ways to foster interaction among employees of all levels. As companies continue to flatten and rely on teams, managers must rely less on their authority and more on understanding these informal networks. Managers who can use maps to identify, leverage, and revamp informal networks will have the key to success.

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

    Science.gov (United States)

    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.

  5. Temporal Statistical Analysis of Degree Distributions in an Undirected Landline Phone Call Network Graph Series

    Directory of Open Access Journals (Sweden)

    Orgeta Gjermëni

    2017-10-01

    Full Text Available This article aims to provide new results about the intraday degree sequence distribution considering phone call network graph evolution in time. More specifically, it tackles the following problem. Given a large amount of landline phone call data records, what is the best way to summarize the distinct number of calling partners per client per day? In order to answer this question, a series of undirected phone call network graphs is constructed based on data from a local telecommunication source in Albania. All network graphs of the series are simplified. Further, a longitudinal temporal study is made on this network graphs series related to the degree distributions. Power law and log-normal distribution fittings on the degree sequence are compared on each of the network graphs of the series. The maximum likelihood method is used to estimate the parameters of the distributions, and a Kolmogorov–Smirnov test associated with a p-value is used to define the plausible models. A direct distribution comparison is made through a Vuong test in the case that both distributions are plausible. Another goal was to describe the parameters’ distributions’ shape. A Shapiro-Wilk test is used to test the normality of the data, and measures of shape are used to define the distributions’ shape. Study findings suggested that log-normal distribution models better the intraday degree sequence data of the network graphs. It is not possible to say that the distributions of log-normal parameters are normal.

  6. An Exponentially Weighted Moving Average Control Chart for Bernoulli Data

    DEFF Research Database (Denmark)

    Spliid, Henrik

    2010-01-01

    of the transformation is given and its limit for small values of p is derived. Control of high yield processes is discussed and the chart is shown to perform very well in comparison with both the most common alternative EWMA chart and the CUSUM chart. The construction and the use of the proposed EWMA chart......We consider a production process in which units are produced in a sequential manner. The units can, for example, be manufactured items or services, provided to clients. Each unit produced can be a failure with probability p or a success (non-failure) with probability (1-p). A novel exponentially...... weighted moving average (EWMA) control chart intended for surveillance of the probability of failure, p, is described. The chart is based on counting the number of non-failures produced between failures in combination with a variance-stabilizing transformation. The distribution function...

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

    Science.gov (United States)

    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.

  8. The making of Andersen’s liquefaction chart

    OpenAIRE

    Sabaliauskas, Tomas; Ibsen, Lars Bo

    2017-01-01

    Andersen’s chart (Andersen & Berre, 1999) is a graphical method of observing cyclic soil response. It allows observing soil response to various stress amplitudes that can lead to liquefaction, excess plastic deformation stabilizing soil response.The process of obtaining the original chart has been improved. Algorithm based approximation is introduced. Pore pressure dependent ultimate bearing capacity normalization factor is introduced to normalize the chart.

  9. Blinded with Science or Informed by Charts? A Replication Study

    OpenAIRE

    Dragicevic , Pierre; Jansen , Yvonne

    2018-01-01

    International audience; We provide a reappraisal of Tal and Wansink's study "Blinded with Science" , where seemingly trivial charts were shown to increase belief in drug efficacy, presumably because charts are associated with science. Through a series of four replications conducted on two crowdsourcing platforms, we investigate an alternative explanation, namely, that the charts allowed participants to better assess the drug's efficacy. Considered together, our experiments suggest that the ch...

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

    Science.gov (United States)

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

    2012-01-01

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

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

    Directory of Open Access Journals (Sweden)

    Natalia B Mota

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

  12. Edge Cover Domination in Mangoldt Graph

    African Journals Online (AJOL)

    Bheema

    Department of Applied Mathematics, Y.V. University, Kadapa, Andhra Pradesh, India. 2. Department of Mathematics, Sri Padmavati Mahila University, Tirupati, ...... arithmetic graphs, Ph.D Thesis, Sri Venkateswara University, Tirupati, India.

  13. Digital Line Graphs (DLG) 24K

    Data.gov (United States)

    Kansas Data Access and Support Center — Digital line graph (DLG) data are digital representations of cartographic information. DLG's of map features are converted to digital form from maps and related...

  14. Inferring ontology graph structures using OWL reasoning

    KAUST Repository

    Rodriguez-Garcia, Miguel Angel; Hoehndorf, Robert

    2018-01-01

    ' 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

  15. Distance matrices and quadratic embedding of graphs

    Directory of Open Access Journals (Sweden)

    Nobuaki Obata

    2018-04-01

    Full Text Available A connected graph is said to be of QE class if it admits  a quadratic embedding in a Hilbert space, or equivalently, if the distance matrix is conditionally negative definite. Several criteria for a graph to be of QE class are derived from the point of view of graph operations. For a quantitative criterion the QE constant is introduced and concrete examples are shown with explicit calculation. If the distance matrix admits a constant row sum, the QE constant coincides with the second largest eigenvalue of the distance matrix. The QE constants are determined for all graphs on $n$ vertices with $n\\le5$, among which two are not of QE class.

  16. A graph model for opportunistic network coding

    KAUST Repository

    Sorour, Sameh; Aboutoraby, Neda; Al-Naffouri, Tareq Y.; Alouini, Mohamed-Slim

    2015-01-01

    © 2015 IEEE. Recent advancements in graph-based analysis and solutions of instantly decodable network coding (IDNC) trigger the interest to extend them to more complicated opportunistic network coding (ONC) scenarios, with limited increase

  17. Digital Line Graphs (DLG) 100K

    Data.gov (United States)

    Kansas Data Access and Support Center — Digital line graph (DLG) data are digital representations of cartographic information. DLG's of map features are converted to digital form from maps and related...

  18. Kuramoto model for infinite graphs with kernels

    KAUST Repository

    Canale, Eduardo; Tembine, Hamidou; Tempone, Raul; Zouraris, Georgios E.

    2015-01-01

    . We focus on circulant graphs which have enough symmetries to make the computations easier. We then focus on the asymptotic regime where an integro-partial differential equation is derived. Numerical analysis and convergence proofs of the Fokker

  19. Quantum Graphs And Their Resonance Properties

    International Nuclear Information System (INIS)

    Lipovsky, J.

    2016-01-01

    In the current review, we study the model of quantum graphs. We focus mainly on the resonance properties of quantum graphs. We define resolvent and scattering resonances and show their equivalence. We present various results on the asymptotics of the number of resolvent resonances in both non-magnetic and magnetic quantum graphs and find bounds on the coefficient by the leading term of the asymptotics. We explain methods how to find the spectral and resonance condition. Most of the notions and theorems are illustrated in examples. We show how to find resonances numerically and, in a simple example, we find trajectories of resonances in the complex plane. We discuss Fermi’s golden rule for quantum graphs and distribution of the mean intensity for the topological resonances. (author)

  20. Determining X-chains in graph states

    International Nuclear Information System (INIS)

    Wu, Jun-Yi; Kampermann, Hermann; Bruß, Dagmar

    2016-01-01

    The representation of graph states in the X-basis as well as the calculation of graph state overlaps can efficiently be performed by using the concept of X-chains (Wu et al 2015 Phys. Rev. A 92 012322). We present a necessary and sufficient criterion for X-chains and show that they can efficiently be determined by the Bareiss algorithm. An analytical approach for searching X-chain groups of a graph state is proposed. Furthermore we generalize the concept of X-chains to so-called Euler chains, whose induced subgraphs are Eulerian. This approach helps to determine if a given vertex set is an X-chain and we show how Euler chains can be used in the construction of multipartite Bell inequalities for graph states. (paper)