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.

Pie de madura

Directory of Open Access Journals (Sweden)

Julio E. Torres Reyes

2014-08-01

Full Text Available En el Hospital provincial “Antonio Agosthino Neto” de la ciudad de NDalatando, Kwanza Norte, Republica de Angola, se recibe una paciente femenina de la raza negra de 20 años de edad, con antecedentes de trabajar en el campo, laborando habitualmente descalza. Desde hace dos años, después de haberse hecho una herida con una espina de acacia, presentaba lesiones en la región del tarso y metatarso del pie derecho. Las lesiones nodulares que abarcaban la planta y dorso del pie presentaban color rojo amarillento y supuraban constantemente, con aumento de partes blandas. Se le indicaron análisis complementarios y estudios imagenológicos. Después de obtener los resultados micológicos, bacteriológicos e imagenológicos y debido a las lesiones óseas y en partes blandas que presentaba la paciente, se decide la amputación quirúrgica del pie

El pie diabético

OpenAIRE

Cespedes Cespedes, Tomás; Cuevas Gómez, Rafael; Dorca Coll, Adelina; Sacristán Valero, Sergi

1991-01-01

El pie diabético está considerado como un pie de alto riesgo, está demostrado que si aplicáramos una adecuada y correcta educación sanitaria a todos los profesionales de la salud y al propio paciente, se podrían evitar en la mayoría de los casos las tan temidas amputaciones. En el presente trabajo hacemos referencia de las características más importantes de la diabetes, pie diabético y a la actuación profesional del podólogo frente a estos pacientes.

Drawing Euler Diagrams with Circles

OpenAIRE

Stapleton, Gem; Zhang, Leishi; Howse, John; Rodgers, Peter

2010-01-01

Euler diagrams are a popular and intuitive visualization tool which are used in a wide variety of application areas, including biological and medical data analysis. As with other data visualization methods, such as graphs, bar charts, or pie charts, the automated generation of an Euler diagram from a suitable data set would be advantageous, removing the burden of manual data analysis and the subsequent task of drawing an appropriate diagram. Various methods have emerged that automatically dra...

Energy Blocks--A Physical Model for Teaching Energy Concepts

Science.gov (United States)

Hertting, Scott

2016-01-01

Most physics educators would agree that energy is a very useful, albeit abstract topic. It is therefore important to use various methods to help the student internalize the concept of energy itself and its related ideas. These methods include using representations such as energy bar graphs, energy pie charts, or energy tracking diagrams.…

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

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

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

Pie plano-valgo adquirido

OpenAIRE

Albiol Ferrer, Josep Maria; Giralt de Veciana, Enrique; Marugán de los Bueis, Montse; Novel Martí, Virginia; Ogalla, José Manuel; Zalacain, Antonio

1990-01-01

Es la patología del pie que tiene mayor incidencia durante la infancia. Su recuperación eficaz, además de precisar un largo período de tratamiento, requiere un diagnóstico precoz. Durante la lactancia, a partir de los tres meses, y después, durante la infancia, hasta los tres años aproximadamente, una gruesa y blanda capa de panlculo adiposo determina una configuración que rellena la bóveda y ofrece una falsa imagen de pie plano.

Nuestro concepto actual del pie valgo

OpenAIRE

Dorca Coll, Adelina; Cespedes Cespedes, Tomás; Concustell Gonfaus, Josep; Sacristán Valero, Sergi; Dorca Coll, Ma. Rosa

1996-01-01

Los autores hacen una revisión de los conceptos y etiologías que se han descrito del pie valgo. Incluyen una definición personal sobre el concepto funcional del pie valgo, definen por primera vez la marcha que cursa con estrés en valgo y presentan una descripción del comportamiento biomecánico de los diferentes pies valgos. Esta diferenciación será de gran utilidad para la posterior aplicación del tratamiento ortopodológico adecuado. Es de resaltar las imágenes que se presentan obtenidas de c...

9 CFR 319.500 - Meat pies.

Science.gov (United States)

2010-01-01

... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Meat pies. 319.500 Section 319.500... ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND VOLUNTARY INSPECTION AND CERTIFICATION DEFINITIONS AND STANDARDS OF IDENTITY OR COMPOSITION Meat Food Entree Products, Pies, and...

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.

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.

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.

El pie del adulto mayor

OpenAIRE

Parodi García, José Francisco

2005-01-01

Acta Médica Peruana es una publicación del Colegio Médico del Perú El estudio del pie y sus patologías es un capítulo muy importante de la Geriatría. Las patologías del pie no escapan las características comunes de muchos síndromes geriátricos como son el ser asumidos como "normales para la edad", ser poco valorados, menospreciados, no tratados, con gran impacto sobre la salud en general y la calidad de vida.

Tratamiento Actual del Pie Zambo

OpenAIRE

Salom Taverner, M.; Mínguez Rey, María Fe

2015-01-01

El pie zambo es una deformidad congénita en la que el pie presenta una deformidad en equino, varo de retropié, aductus del antepié y cavo. Su tratamiento ha variado con el tiempo. Clásicamente se trataba mediante distintas técnicas quirúrgicas que permitían corregir todas las deformidades pero que se acompañaban de frecuentes complicaciones a corto y largo plazo. Actualmente el tratamiento más extendido de esta deformidad es el tratamiento conservador mediante la técnica de Ponset...

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

PIE analysis for minor actinide

International Nuclear Information System (INIS)

Suyama, Kenya

2005-01-01

Minor actinide (MA) is generated in nuclear fuel during the operation of power reactor. For fuel design, reactivity decrease due to it should be considered. Out of reactors, MA plays key role to define the property of spent fuel (SF) such as α-radioactivity, neutron emission rate, and criticality of SF. In order to evaluate the calculation codes and libraries for predicting the amount of MA, comparison between calculation results and experimentally obtained data has been conducted. In this report, we will present the status of PIE data of MA taken by post irradiation examinations (PIE) and several calculation results. (author)

Pied de Pulse

NARCIS (Netherlands)

2016-01-01

This project has two aims. The first is to study and implement a fractal-like structure of circles inspired by Apollonian circles, combined with a pied de poule (houndstooth). The second aim is to push the integration of electric actuators in garments, using the power of algorithmic design and

An exergy method for compressor performance analysis

Energy Technology Data Exchange (ETDEWEB)

McGovern, J A; Harte, S [Trinity Coll., Dublin (Ireland)

1995-07-01

An exergy method for compressor performance analysis is presented. The purpose of this is to identify and quantify defects in the use of a compressor`s shaft power. This information can be used as the basis for compressor design improvements. The defects are attributed to friction, irreversible heat transfer, fluid throttling, and irreversible fluid mixing. They are described, on a common basis, as exergy destruction rates and their locations are identified. The method can be used with any type of positive displacement compressor. It is most readily applied where a detailed computer simulation program is available for the compressor. An analysis of an open reciprocating refrigeration compressor that used R12 refrigerant is given as an example. The results that are presented consist of graphs of the instantaneous rates of exergy destruction according to the mechanisms involved, a pie chart of the breakdown of the average shaft power wastage by mechanism, and a pie chart with a breakdown by location. (author)

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)

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)

Obesidad infantil: factor de riesgo para desarrollar pie plano

OpenAIRE

Saldívar-Cerón, Héctor Iván; Garmendia Ramírez, Alberto; Rocha Acevedo, Marco Antonio; Pérez-Rodríguez, Pedro

2015-01-01

Introducción: En México, la prevalencia de sobrepeso y obesidad en escolares es del 34.4% (ENSANUT 2012). Esta puede inducir un círculo vicioso “pie plano-plantalgia-sedentarismo-obesidad”. Sin embargo, la presencia y grado de pie plano en escolares con obesidad no se ha descrito en la población mexicana. El objetivo del estudio fue determinar la prevalencia de pie plano y su asociación con obesidad en escolares de Tamaulipas, México. Métodos: Se realizó un estudio analítico, transversal c...

Personalized Information Environments: Do Public Libraries Want a Slice of the PIE?

Science.gov (United States)

Worcester, Lea

2003-01-01

Discussion of personalized information environments (PIEs) focuses on library personalized interfaces. Describes academic library PIEs and commercial sites, such as Amazon.com that use personalization; explores the Public Library of Charlotte and Mecklenburg's personalized interface; and discusses opportunities and challenges PIEs offer public…

Solución Oportuna de Pie Plano

OpenAIRE

Espol; Tabares Cedeno, Maria Veronica; Ribadeneira Coloma, Betsy Evelyn; Zurita Aviles, Salomon Efrain

2015-01-01

Proponer una nueva técnica, donde se obtenga como beneficio la reparación definitiva de una lesion muy común como es el pie plano flexible y al mismo tiempo consolidar una empresa rentable y que genere valor ala sociedad el indice de prevalencia con diagnóstico de pie plano en el Ecuador es la especialidad de traumatología presentan este tipo de lesión. Guayaquil Magíster en Gerencia Hospitalaria

Pied de pulse: packing embroidered circles and coil actuators in pied de poule (houndstooth)

NARCIS (Netherlands)

Feijs, L.M.G.; Toeters, M.J.; Torrence, E.; Torrence, B.; Sequin, C.; McKenna, D.; Fenyvesi, K.; Sarhangi, R.

2016-01-01

We report on the integration of fractal-like structures inspired by Appolonian circles with pied de poule (houndstooth) fabric patterns, and on the use of electric actuators in garments made with digital embroidery techniques.

El pie en la danza clásica_

Directory of Open Access Journals (Sweden)

Nuria Massó Ortigosa.

2010-05-01

Full Text Available La danza es una forma de lenguaje que utiliza como instrumento al propio cuerpo, y su práctica continuada genera cambios y adaptaciones debidas a las altas exigencias de esta actividad. En este artículo se analizan las demandas, patologías y exigencias osteo-musculares del pie en la danza clásica. Para ello se ha partido del análisis de las estructuras del pie en distintas posiciones técnicas como la punta, media punta, o el “en dehors”. Como consecuencia de estas demandas de esfuerzo, se observa que una alta proporción de bailarines/as presenta alteraciones en el pie como hallux valgus y dedos en garra. También se ha estudiado la implicación en las técnicas básicas del pie de danza clásica de los músculos tríceps sural, peroneo lateral largo, tibial posterior, flexor largo y flexor corto del dedo gordo, tibial anterior, extensor propio del dedo gordo, abductor del dedo gordo, así como la musculatura interósea y plantar.

La ortopodología en el pie de riesgo (1ª Parte)

OpenAIRE

Dorca Coll, Adelina; Céspedes Céspedes, Tomás; Concustell Gonfaus, Josep; Cuevas Gómez, Rafael; Sacristán Valero, Sergi

1994-01-01

Los autores definen por primera vez el concepto de 'pie de riesgo' y ofrecen diferentes alternativas podológicas para prevenir lesiones en el pie y en el supuesto de que estas lesiones estén establecidas, presentan tratamientos ortésicos que equilibren el pie y eviten mayores cambios degenerativos.

Constructing and applying the fractal pied de poule (houndstooth)

NARCIS (Netherlands)

Feijs, L.M.G.; Toeters, M.J.; Hart, G.; Sarhangi, R.

2013-01-01

Time is ready for a fractal version of pied de poule; it is almost "in the air". Taking inspiration from the Cantor set, and using the analysis of the classical pattern, we obtain a family of elegant new fractal Pied de Poules. We calculate the fractal dimension and develop an attractive fashion

Test requirement for PIE of HANARO irradiated fuel rod

International Nuclear Information System (INIS)

Lim, I. C.; Cho, Y. G.

2000-06-01

Since the first criticality of HANARO reached in Feb. of 1995, the rod type U 3 Si-A1 fuel imported from AECL has been used. From the under-water fuel inspection which has been conducted since 1997, a ballooning-rupture type abnormality was observed in several fuel rods. In order to find the root cause of this abnormality and to find the resolution, the post irradiation examination(PIE) was proposed as the best way. In this document, the information from the under-water inspection as well as the PIE requirements are described. Based on the information in this document, a detail test plan will be developed by the project team who shall conduct the PIE

Proceedings of 2005 JAEA-KAERI joint seminar on advanced irradiation and PIE technologies

International Nuclear Information System (INIS)

2006-05-01

In this seminar, total participants of over 100 were jointed from JAEA, KAERI, Hanyang University, Chungnam National University, Kyung Hee University, Oarai Branch of Institute for Materials Research (IMR) of Tohoku University, Nippon Nuclear Fuel Development Co., Ltd., Nuclear Development Corporation and others. The technical development and experimental data on the irradiation test and PIE were aggressively discussed in this seminar. Contributed presentations were 35 in three sessions; Current status and future program on irradiation test and PIE (10 presentations), Development of irradiation and PIE technologies (15 presentations) and Evaluation of irradiation and PIE data (10 presentations). Development of instrumented capsule technologies for HANARO irradiation, current PIE activities in each hot laboratory of both countries, development of irradiation capsules in JMTR for the Irradiation Assisted Stress Corrosion Cracking (IASCC) study, development of irradiation and PIE techniques for the safety research on the high burnup fuel, utilization plan of JOYO and development of MOX fuel containing americium have been widely noticed as topic items on irradiation and PIE technologies. This proceedings is containing papers presented in the 2005 JAEA-KAERI Joint Seminar. It also indicates the current status of the aggressive information exchange activity on two fields of irradiation test and PIE technologies between JAEA and KAERI under the Arrangement for the Implementation of Cooperative Research Program mentioned above. The 35 of the presented papers are indexed individually. (J.P.N.)

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.

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

Current activities in development of PIE techniques in JMTR hot laboratory

International Nuclear Information System (INIS)

Ishii, Toshimitsu; Ohmi, Masao; Shimizu, Michio; Kaji, Yoshiyuki; Ueno, Fumiyoshi

2006-01-01

A wide variety of post-irradiation examinations (PIEs) for research and development of nuclear fuels and materials to be utilized in nuclear field has been carried out since 1971 in three kinds of β-γ hot cells; concrete, lead and steel cells in the JMTR Hot Laboratory (JMTR HL) associated with the Japan Materials Testing Reactor (JMTR). In addition to PIEs, the re-capsuling work including re-instrumentation was also conducted for the power ramping tests of the irradiated LWR fuels using Boiling Water Capsule (BOCA). Recently, new PIE techniques are required for the advanced irradiation studies. In this paper, the irradiation assisted stress corrosion cracking (IASCC) growth test technique of irradiated in-core structural materials and the remote operation technique of the atomic force microscope (AFM) are described as JMTR HL's current activities in the development of new PIE techniques. (author)

Enfoque integral del paciente con pie diabético

Directory of Open Access Journals (Sweden)

Galia Fonseca Portilla

1996-04-01

Full Text Available Debe tenerse en cuenta que el diagnóstico de Diabetes Mellitus supone un cambio radical en las costumbres del paciente y que alcanzarlo puede requerir largo tiempo, por esto es necesario que los pacientes asistan a control cada dos o tres meses ye n cada visita insistirle en la importancia de curaciones. Si se continúa apoyando sobre la úlcera, se siguen exprimiendo, como esponja, las bacterias. Para el manejo del pie diabético se distinguen: prevención primaria (detección precoz del pie en riesgo, prevención secundaria (cuidado adecuado de las úlceras grado 1, 2 por el equipo interdisciplinario y prevención terciaria (a nivel hospitalario, para evitar la amputación de los pies con úlceras grado 3-5.

Structural Conservation and Functional Diversity of the Poxvirus Immune Evasion (PIE) Domain Superfamily.

Science.gov (United States)

Nelson, Christopher A; Epperson, Megan L; Singh, Sukrit; Elliott, Jabari I; Fremont, Daved H

2015-08-28

Poxviruses encode a broad array of proteins that serve to undermine host immune defenses. Structural analysis of four of these seemingly unrelated proteins revealed the recurrent use of a conserved beta-sandwich fold that has not been observed in any eukaryotic or prokaryotic protein. Herein we propose to call this unique structural scaffolding the PIE (Poxvirus Immune Evasion) domain. PIE domain containing proteins are abundant in chordopoxvirinae, with our analysis identifying 20 likely PIE subfamilies among 33 representative genomes spanning 7 genera. For example, cowpox strain Brighton Red appears to encode 10 different PIEs: vCCI, A41, C8, M2, T4 (CPVX203), and the SECRET proteins CrmB, CrmD, SCP-1, SCP-2, and SCP-3. Characterized PIE proteins all appear to be nonessential for virus replication, and all contain signal peptides for targeting to the secretory pathway. The PIE subfamilies differ primarily in the number, size, and location of structural embellishments to the beta-sandwich core that confer unique functional specificities. Reported ligands include chemokines, GM-CSF, IL-2, MHC class I, and glycosaminoglycans. We expect that the list of ligands and receptors engaged by the PIE domain will grow as we come to better understand how this versatile structural architecture can be tailored to manipulate host responses to infection.

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

49 CFR 40.385 - Who bears the burden of proof in a PIE proceeding?

Science.gov (United States)

2010-10-01

... 49 Transportation 1 2010-10-01 2010-10-01 false Who bears the burden of proof in a PIE proceeding... TRANSPORTATION WORKPLACE DRUG AND ALCOHOL TESTING PROGRAMS Public Interest Exclusions § 40.385 Who bears the burden of proof in a PIE proceeding? (a) As the proponent of issuing a PIE, the initiating official bears...

Code Analyses Supporting PIE of Weapons-Grade MOX Fuel

International Nuclear Information System (INIS)

Ott, Larry J.; Bevard, Bruce Balkcom; Spellman, Donald J.; McCoy, Kevin

2010-01-01

The U.S. Department of energy has decided to dispose of a portion of the nation's surplus weapons-grade plutonium by reconstituting it into mixed oxide (MOX) fuel and irradiating the fuel in commercial power reactors. Four lead test assemblies (LTAs) were manufactured with weapons-grade mixed oxide (WG-MOX) fuel and irradiated in the Catawba Nuclear Station Unit 1, to a maximum fuel rod burnup of ∼47.3 GWd/MTHM. As part of the fuel qualification process, five rods with varying burnups and initial plutonium contents were selected from one assembly and shipped to the Oak Ridge National Laboratory (ORNL) for hot cell examination. ORNL has provided analytical support for the post-irradiation examination (PIE) of these rods via extensive fuel performance modeling which has aided in instrument settings and PIE data interpretation. The results of these fuel performance simulations are compared in this paper with available PIE data.

Shelf life of pie caps with biodegradable films as spacers

Directory of Open Access Journals (Sweden)

Daniela Verónica Escobar Gianni

2013-01-01

Full Text Available Commonly pie caps at market use polyethylene films as spacers between them. This paper studies the conventional spacers replacement with edible and biodegradable films made with whey protein isolate (WPI and potassium sorbate as a preservative. Besides facilitating the separation of pie caps, with this application is intended to increase their shelf life. The films made by the compression molding method were used as spacers in pie caps without preservative in their formula (A and with preservative (B and they were compared with conventional polyethylene spacers (C. During four months, monthly sensory, microbiological and physicochemical (humidity evaluations were done on the pie caps, together with humidity and solubility evaluations of the films. None of the samples showed microbiological or sensory deterioration. The sensory attributes showed no or slight difference in study time. Between samples the differences were minor: the best scores were for sample A in color, sample C in flavor, and samples B and C in texture and overall liking. The edible films have an interesting potential for this application, although studies in disguise the flavor of serum should be done.

Nonperturbative path integral expansion II

International Nuclear Information System (INIS)

Kaiser, H.J.

1976-05-01

The Feynman path integral representation of the 2-point function for a self-interacting Bose field is investigated using an expansion ('Path Integral Expansion', PIE) of the exponential of the kinetic term of the Lagrangian. This leads to a series - illustrated by a graph scheme - involving successively a coupling of more and more points of the lattice space commonly employed in the evaluation of path integrals. The values of the individual PIE graphs depend of course on the lattice constant. Two methods - Pade approximation and Borel-type extrapolation - are proposed to extract information about the continuum limit from a finite-order PIE. A more flexible PIE is possible by expanding besides the kinetic term a suitably chosen part of the interaction term too. In particular, if the co-expanded part is a mass term the calculation becomes only slightly more complicated than in the original formulation and the appearance of the graph scheme is unchanged. A significant reduction of the number of graphs and an improvement of the convergence of the PIE can be achieved by performing certain sums over an infinity of graph elements. (author)

Geophysical evidence for an extensive Pie de Palo Complex mafic-ultramafic belt, San Juan, Argentina

Science.gov (United States)

Chernicoff, Carlos J.; Vujovich, Graciela I.; van Staal, Cees R.

2009-12-01

The recent completion of a high-resolution aeromagnetic survey over the Pie de Palo uplift of the western Sierras Pampeanas has revealed an area of large magnetic anomalies associated with the Pie de Palo Complex. The Las Pirquitas thrust, which has transported and uplifted the Pie de Palo Complex, is recognized for at least 30 km in a roughly NE direction along the western boundary of the Pie de Palo Complex, beyond its limited outcrop. The type of sediments of the Caucete Group in the footwall of the Las Pirquitas thrust, which are regarded as the leading edge of the Precordillera terrane, are associated with much less pronounced magnetic anomalies. In addition, a conspicuous, NNE trending, broad magnetic high stands out in the survey, several kilometers to the east of the main outcrops of the Pie de Palo Complex; this broad magnetic anomaly bisects the Pie de Palo basement block, and continues further south at least as far as 32°S, the southern boundary of the latest aeromagnetic survey. This magnetic anomaly is interpreted to represent a structure corresponding to the Grenvillian Precordillera-Pie de Palo tectonic boundary zone, and would comprise the buried largest part of the mafic-ultramafic belt. The geophysical model of the magnetic data indicates that the boundary zone dips to the east, possibly suggesting the existence of a set of synthetic east dipping, west-verging thrusts, of which only one major structure (Las Pirquitas thrust) is exposed; the possibility of other slivers of upthrust boundary zone material cannot be excluded. It is considered that the Pie de Palo Complex represents a small sliver upthrust from the unexposed boundary zone material (containing highly magnetic mafic-ultramafic rocks). The east-dipping, west verging structures associated with the Pie de Palo Complex are suggested to represent an Ordovician reactivation of a Grenvillian suture zone developed when the Precordillera basement and Pie de Palo terrane docked; this

El pie del diabético

Directory of Open Access Journals (Sweden)

Parra Myriam

1990-12-01

Full Text Available

Existen complicaciones neurovasculares periféricas en el paciente diabético que de no prevenirse o tratarse precozmente pueden conducir a la formación de lesiones graves e irreversibles en el pie. Los grados de lesión pueden evolucionar desde la presencia de factores de riesgo hasta la formación de gangrena local o generalizada conllevando a la amputación del pie. La participación del paciente y la familia con relación a los cuidados podológicos, cumplimiento en el  tratamiento dietético, farmacológico, de ejercicio e identificación de riesgos son definitivos; estos aspectos requieren de la orientación e intervención del profesional de enfermería en el manejo de cada grado de lesión basándose en la identificación de diagnósticos reales y/o potenciales prioritarios.

La ortopodología en el pie de riesgo (2ª Parte)

OpenAIRE

Céspedes Céspedes, Tomás; Dorca Coll, Adelina; Concustell Gonfaus, Josep; Cuevas Gómez, Rafael; Sacristán Valero, Sergi

1994-01-01

Los autores presentan y describen varios casos clínicos podológicos, en los que aprecia: Una alteración y limitació progresiva de las funciones del pie y como resultado un transtomo general del equilibrio estático y dinámico: características que corresponden al ya descrito «Pie de riesgo'

El dolor patelofemoral en el baile flamenco y su relación con el pie

Directory of Open Access Journals (Sweden)

José M. Castillo-López

2017-05-01

Full Text Available El dolor patelofemoral es uno de los desórdenes más comunes que afectan a la rodilla. De las lesiones descritas en el baile flamenco profesional, destacan las relacionadas con el pie y la rodilla, en relación al microtraumatismo repetido del gesto técnico del zapateado y a la flexión de rodilla mantenida que requiere. El objetivo de este estudio es determinar la presencia de dolor patelo femoral en profesionales del baile de flamenco y comprobar si existe relación alguna con el pie pronador y genus valgo. En el estudio han participado 46 profesionales del baile flamenco, 38 bailaoras y 8 bailaores, con una carga media de 25.4 ± 8.25 horas de baile semanales. El 34.78% de los participantes presentaban dolor patelofemoral. El 24% presentaba también genus valgo. Se encontró un 34.78% de pies pronadores. La asociación de pies pronadores y genus valgo fue del 31.25%, mientras que la asociación de pies pronadores y dolor patelofemoral fue de 43.75 % de los casos. Factores predisponentes de esta patología se dan en la práctica del baile flamenco: el impacto repetitivo, una posición mantenida y forzada de la rodilla en un rango concreto, desplazamientos y los giros bruscos. Como conclusión, se demuestra relación directa entre la presencia de pies pronadores y dolor patelofemoral en el baile flamenco. Así como entre pies pronadores y genus valgo. Estudios científicos actuales demuestran la utilidad de soportes plantares en este síndrome. La incidencia de pies pronadores y dolor patelofemoral hace recomendable estudios biomecánicos y podológicos y el uso de soportes plantares personalizados en cada caso.

PIE DIABÉTICO: ¿PODEMOS PREVENIRLO?

Directory of Open Access Journals (Sweden)

Dra. Oriana Paiva M.

2016-03-01

Full Text Available La diabetes es una enfermedad epidémica, con más de 400 millones de personas diagnosticadas en la actualidad. Las úlceras del pie son una de las complicaciones crónicas más frecuentes de esta población, con un riesgo acumulado de desarrollarla a lo largo de la vida de 15%. La neuropatía y la enfermedad vascular son las principales causas de su aparición. Las amputaciones no traumáticas en diabéticos son 15 veces más frecuentes que en la población general, superando en 2 a 3 veces la tasa en hombres que en mujeres. El 80% se puede prevenir. La clave para ello incluye un examen periódico del pie a todo diabético al menos 1 vez al año, educación del paciente en autocuidado, para que logre identificar precozmente la aparición de lesiones evitando mayores complicaciones, un zapato adecuado y un buen control metabólico.

Description of the PIE facility for research reactors irradiated fuels in CNEA

International Nuclear Information System (INIS)

Bisca, A.; Coronel, R.; Homberger, V.; Quinteros, A.; Ratner, M.

2002-01-01

The PIE Facility (LAPEP), located at the Ezeiza Atomic Center (CAE), was designed to carry out destructive and non-destructive post-irradiation examinations (PIE) on research and power reactor spent fuels, reactor internals and other irradiated materials, and to perform studies related with: Station lifetime extension; Fuel performance; Development of new fuels; and Failures and determination of their causes. LAPEP is a relevant facility where research and development can be carried out. It is worth mentioning that in this facility the PIE corresponding to the Surveillance Program for the Atucha I Nuclear Power Plant (CNA-1) were successfully performed. Materials testing during the CNA-1 repair and the study of failures in fuel element plugs of the Embalse Nuclear Power Plant (CNE) were also performed. (author)

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

La enfermedad de manos, pies y boca (Hand, Foot, and Mouth Disease)

Centers for Disease Control (CDC) Podcasts

La enfermedad de manos, pies y boca es una enfermedad contagiosa que afecta principalmente a niños menores de cinco años. En este podcast, la doctora Eileen Schneider habla de los síntomas de la enfermedad de manos, pies y boca, cómo se propaga y cómo protegerse y proteger a sus hijos para que no se infecten con el virus.

PIE on Safety-Tested AGR-1 Compact 5-1-1

Energy Technology Data Exchange (ETDEWEB)

Hunn, John D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Morris, Robert Noel [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baldwin, Charles A. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Montgomery, Fred C. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Gerczak, Tyler J. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2015-08-01

Post-irradiation examination (PIE) is being performed in support of tristructural isotropic (TRISO) coated particle fuel development and qualification for High-Temperature Gas-cooled Reactors (HTGRs). AGR-1 was the first in a series of TRISO fuel irradiation experiments initiated in 2006 under the Advanced Gas Reactor (AGR) Fuel Development and Qualification Program; this work continues to be funded by the Department of Energy's Office of Nuclear Energy as part of the Advanced Reactor Technologies (ART) initiative. AGR-1 fuel compacts were fabricated at Oak Ridge National Laboratory (ORNL) in 2006 and irradiated for three years in the Idaho National Laboratory (INL) Advanced Test Reactor (ATR) to demonstrate and evaluate fuel performance under HTGR irradiation conditions. PIE is being performed at INL and ORNL to study how the fuel behaved during irradiation, and to examine fuel performance during exposure to elevated temperatures at or above temperatures that could occur during a depressurized conduction cooldown event. This report summarizes safety testing of irradiated AGR-1 Compact 5-1-1 in the ORNL Core Conduction Cooldown Test Facility (CCCTF) and post-safety testing PIE.

Development, irradiation testing and PIE of UMo fuel at AECL

International Nuclear Information System (INIS)

Sears, D.F.

2005-01-01

This paper reviews recent U-Mo dispersion fuel development, irradiation testing and postirradiation examination (PIE) activities at AECL. Low-enriched uranium fuel alloys and powders have been fabricated at Chalk River Labs, with compositions ranging from U-7Mo to U-10Mo. The bulk alloys and powders were characterized using optical and scanning electron microscopy, chemical analysis, X-ray diffraction and neutron diffraction analysis. The analyses confirmed that the powders were of high quality, and in the desired gamma phase. Subsequently, kilogram quantities of DU-Mo and LEU-Mo powder have been manufactured for commercial customers. Mini-elements have been fabricated with LEU-7Mo and LEU-10Mo dispersed in aluminum, with a nominal loading of 4.5 gU/cm 3 . These have been irradiated in the NRU reactor at linear powers up to 100 kW/m. The mini-elements achieved 60 atom% 235 U burnup in 2004 March, and the irradiation is continuing to a planned discharge burnup of 80 atom% 235 U. Interim PIE has been conducted on mini-elements that were removed after 20 atom% 235 U burnup. The PIE results are presented in this paper. (author)

Current status of PIE activities in O-arai Engineering Center of JNC on FBR MOX fuel

International Nuclear Information System (INIS)

Koyama, Shin-ichi; Osaka, Masahiko; Namekawa, Takashi; Itoh, Masahiko

2003-01-01

Japan Nuclear Cycle Development Institute (JNC) is now totally promoting the development of commercialized fast reactors to realize stable supply of energy in future. One of the important items is to develop high-performance fuel. For this purpose, it is essential to carry out post-irradiation examinations (PIE) for evaluation of irradiated fuel performance and also to establish the PIE technology. This paper describes the current status of PIE results including its technology in O-arai Engineering Center of JNC. The facilities have been operating safely and successfully since the 1960's. Obtained PIE data were reflected to the design and operation of the experimental fast reactor JOYO, the prototype fast reactor MONJU and future fast reactors. The core modification from the breeding core (MK-I) to the irradiation core (MK-II) of JOYO was performed in 1982. Irradiation tests of fuels and materials in MK-II core started in 1982. At PIE facilities in OEC, 65 of driver fuels, fuel irradiation test rigs, material irradiation test rigs and several other components were examined related to JOYO MK-II core operation, and thus a lot of aspects were accumulated for irradiated fuel behaviors. As topical activities of these PIE techniques, burnup measurement and analytical technique for Minor Actinides (MA), such as neptunium and americium were described here. (author)

21 CFR 152.126 - Frozen cherry pie.

Science.gov (United States)

2010-04-01

... incorporating in a filling contained in a pastry shell mature, pitted, stemmed cherries that are fresh, frozen, and/or canned. The top of the pie may be open or it may be wholly or partly covered with pastry or other suitable topping. Filling, pastry, and topping components of the food consist of optional...

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.

Recent and future PIE activities in KAERI

International Nuclear Information System (INIS)

Ahn, Sangbok; Ryu, Woo-seok; Hong, Kwonpyo; Jeon, Yongbum; Kim, Dosik; Choo, Yongsun

2012-01-01

KAERI has two PIE hot cell facilities. One is Irradiated Material Examination Facility (IMEF) to examine irradiated nuclear fuels and core structural materials at HANARO, and the other is a Post Irradiation Examination Facility (PIEF) to do the operated PWR nuclear fuels and skeleton. Their activities are categorized by hot cell examinations, new technique developments, maintenance of facility utilities and a public acceptance work. In the past three years hot cell tests were executed over 2,000 times related to R and D projects of the future and next generation reactors such as SMART, U-Mo fuels, I-NERI etc., including 30 rods to be operated in domestic PWR's. To supply PIE data on time to the user schedules new equipment and techniques are being developed for 10 items which include an annealing fission gas release rate, thermal diffusivity measurement, a laser puncturing fission gas collection system and mechanical property measurements on PWR FA skeleton etc. For maintenance of facilities the aged utility equipment are refurbished and exchanged for new ones. The partly cracked and leaking building walls are completely repaired, and the aged electric UPS's, HVAC system parts, heating and cooling system are exchanged for new ones. Additionally efforts to upgrade the public acceptance for facility visiting events, open training courses to the university and graduated students have been made. Regarding the future of domestic R and D and a power reactor operating plan the demand for hot cell examinations will be steadily increased. Along with them new PIE techniques on TRISO fuels, minor actinide SFR fuels and CANDU fuels etc are required to be developed. New space to install small scale hot cells, and develop for the extreme conditioned test to meet future demands will be taken. (author)

PIE the search: searching PubMed literature for protein interaction information.

Science.gov (United States)

Kim, Sun; Kwon, Dongseop; Shin, Soo-Yong; Wilbur, W John

2012-02-15

Finding protein-protein interaction (PPI) information from literature is challenging but an important issue. However, keyword search in PubMed(®) is often time consuming because it requires a series of actions that refine keywords and browse search results until it reaches a goal. Due to the rapid growth of biomedical literature, it has become more difficult for biologists and curators to locate PPI information quickly. Therefore, a tool for prioritizing PPI informative articles can be a useful assistant for finding this PPI-relevant information. PIE (Protein Interaction information Extraction) the search is a web service implementing a competition-winning approach utilizing word and syntactic analyses by machine learning techniques. For easy user access, PIE the search provides a PubMed-like search environment, but the output is the list of articles prioritized by PPI confidence scores. By obtaining PPI-related articles at high rank, researchers can more easily find the up-to-date PPI information, which cannot be found in manually curated PPI databases. http://www.ncbi.nlm.nih.gov/IRET/PIE/.

Consideraciones anatómicas y funcionales en la patología del quinto radio del pie

OpenAIRE

Gallart Ortega, José; Lahoz Gimeno, Manuel

2013-01-01

OBJETIVO: Se analiza si las diferentes alteraciones morfológicas y funcionales del pie se asocian estadísticamente a las diferentes desviaciones del quinto radio en el plano transverso y/o sagital como posible causa o agravantes de ésta. A su vez se describen las diferentes patologías quirúrgicas en quinto radio del pie y se evalúa el resultado goniométrico postquirúrgico de las diferentes técnicas quirúrgicas empleadas. MATERIAL MÉTODOS: En una muestra consecutiva de 121 pies intervenidos qu...

Valoración de los resultados del tratamiento quirúrgico del pie plano estático

OpenAIRE

Paz Jiménez, José; Amigo Fernandez, A.; Romo Contreras, I.

1989-01-01

La deformidad fundamental del pie plano es el valgo de talón. Existe siempre un movimiento helicoidal en pronación del retropic y supinación del antepic. En este trabajo se hace una revisión de los pacientes tratados en nuestro Servicio a lo largo de diez años, que han sido sometidos a intervención quirúrgica, mayoritariamente artrodesis. - El fotopodograma constituye un excelente método para controlar la evolución de un pie plano. El pie plano por astrágalo vertical es irreductible des...

Geometry and computation of Houndstooth (Pied-de-poule)

NARCIS (Netherlands)

Feijs, L.M.G.; Bosch, Robert; McKenna, Douglas; Sarhangi, Reza

2012-01-01

We apply a variety of geometric and computational tools to improve our understanding of the Houndstooth (Pied de poule) pattern. Although the pattern must have been known for centuries, it was made famous mostly by Christian Dior and is still frequently used in many variations. It is a

Using Discrete Trial Training to Identify Specific Learning Impairments in Boys with Fragile X Syndrome

Science.gov (United States)

Hall, Scott S.; Hustyi, Kristin M.; Hammond, Jennifer L.; Hirt, Melissa; Reiss, Allan L.

2014-01-01

We examined whether "discrete trial training" (DTT) could be used to identify learning impairments in mathematical reasoning in boys with fragile X syndrome (FXS). Boys with FXS, aged 10-23 years, and age and IQ-matched controls, were trained to match fractions to pie-charts and pie-charts to decimals either on a computer or with a…

Factores asociados al pie diabético en pacientes ambulatorios. Centro de Diabetes Cardiovascular del Caribe. Barranquilla (Colombia

Directory of Open Access Journals (Sweden)

Mildred Rosales Amarís

2012-01-01

respectivamente, la neuropatía (OR = 10.14; p = 0.00 y la deformidad de los pies (OR = 10.02; p = 0.00 se asociaron significativamente al pie diabético. Se encontró como factor protector el autocuidado (OR = 0.21; p = 0.00000 y la educación relacionada con el control de factores de riesgo para la diabetes (OR = 0.32; p = 0.00007. Conclusión: La macroangiopatía, la microangiopatía, la neuropatía y la deformidad en los pies se comportaron como factores asociados a la presencia del pie diabético. El autocuidado contribuyó a la prevención del mismo.

Efectividad de un programa educativo en pacientes con pie diabético de riesgo

Directory of Open Access Journals (Sweden)

Olga Lidia Pereira Despaigne

2015-01-01

Full Text Available Se realizó un estudio de intervención terapéutica educativa en pacientes con pie diabético de riesgo, atendidos en la Consulta de Angiopatía Diabética del Hospital Provincial Docente Clinicoquirúrgico "Saturnino Lora Torres" de Santiago de Cuba, desde enero del 2011 hasta igual mes del 2013, a fin de determinar la efectividad de un programa educativo (momento de la intervención al respecto. Fueron indicativos de pie diabético de riesgo (momento del diagnóstico, la úlcera previa o amputación, la neuropatía periférica con pérdida de sensación protectora, la enfermedad arterial periférica, la hiperqueratosis y la afección grave de las uñas, la deformidad en el pie, la movilidad articular reducida, el calzado inadecuado, el tabaquismo, la edad avanzada, la larga evolución de la diabetes mellitus y la falta de educación diabetológica en pie diabético. La información fue analizada y procesada mediante las pruebas de hipótesis de Mann-Whitney y de comparación de medias, con un error de 5 %, y se obtuvo que con este programa (momento evaluativo se disminuyera la afectación que el pie diabético ocasiona a la actividad social, laboral y familiar de estas personas, así como el elevado costo económico, tanto para ellos como para el sistema de salud

Great tit and pied flycatcher populations on the territory of radioactive trail in the eastern Urals

International Nuclear Information System (INIS)

Lebedeva, N.V.

1994-01-01

The purpose of this preliminary study was to evaluate the prospects for using populations of the great tit (Parus major) and the pied flycatcher (Ficedula hypoleuca) in ecological monitoring of territories contaminated with radionuclides. Studies were performed in the summer of 1992 in birch forests of the Southern Urals. Artificial nesting sites (log houses) located 1.5 m above the ground were distributed over territories of two test plots: 30 log houses on the contaminated plot and 60 on the control plot (contamination with Sr-90 1.5 and 2 · 10 -3 mCi/m 2 , respectively). The nesting success in the great tit was similar on both plots, whereas that in the pied flycatcher was significantly greater on the control plot (in a open-quotes cleanclose quotes forest). Pied flycatchers build their nests out of highly radioactive materials, whereas great tits use nonradioactive or weakly emitting materials. Hence, pied flycatcher's nestlings receive a significant radiation dose from components of the nest: From the moment of egg laying, this dose amounts to 0.5 rem. The pied flycatcher can be used as an indicator of radioactive contamination. This species is more sensitive than the great tit, which has been successfully used as an indicator for monitoring the industrial air pollution

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

Caracterización clínico epidemiológica de pacientes afectados por pie diabético

Directory of Open Access Journals (Sweden)

Dania Núñez Álvarez

2018-01-01

Full Text Available Introducción: el pie diabético constituye un problema de salud en los pacientes portadores de diabetes mellitus y se registra como la primera causa de amputación no traumática de los miembros. El conocimiento de sus particularidades clínico-epidemiológicas resulta de sumo interés. Objetivo: caracterizar clínica y epidemiológicamente a los pacientes con pie diabético neuroinfeccioso en el Hospital "Dr. Joaquín Castillo Duany" de Santiago de Cuba. Método: se realizó un estudio descriptivo retrospectivo. El universo estuvo constituido por 96 pacientes diagnosticados con pie diabético durante el periodo comprendido entre el 2011 y el 2015. Se emplearon variables demográficas y relacionadas con factores de riesgo generales y específicos del pie diabético. Resultados: el pie diabético predominó entre la cuarta y sexta décadas de vida (24,7 % y en pacientes del sexo femenino (59,7 %. La diabetes mellitus tipo 2 estuvo representada en el 52,5 %. Mientras el factor de riesgo general de pie diabético más frecuente fue la obesidad (56,7 %, la neuropatía diabética, como factor de riesgo específico se presentó en el 98,9 % de los enfermos estudiados. Conclusiones: el pie diabético predominó en la cuarta y sexta décadas de la vida y en el sexo femenino. El mayor porcentaje de los pacientes era portador de diabetes mellitus tipo 2. La obesidad, la neuropatía diabética periférica, el sobrepeso, y la hiperglucemia constituyeron los factores de riesgo prevalecientes.

Proceedings of 2012 JAEA/KAERI joint seminar on advanced irradiation and PIE technologies

International Nuclear Information System (INIS)

Ishihara, Masahiro; Ishitsuka, Etsuo; Suzuki, Masahide

2012-12-01

Under the 'Arrangement for Corporation in the field of peaceful uses of Nuclear Energy between the Japan Atomic Energy Agency (JAEA) and the Korean Atomic Energy Research Institute (KAERI)', the 2012 JAEA/KAERI Joint Seminar on Advanced Irradiation and PIE (post-irradiation examination) Technologies has been held at Mito, Japan from March 28 to 30, 2012. This triennial seminar is the seventh in series of bilateral exchange of irradiation and PIE technologies and research reactor management. Since the first joint seminar on the PIE Technology between JAERI (Japan Atomic Energy Research Institute, former agency of JAEA) and KAERI was held at JAERI Oarai Research Institute, Japan in 1992, the international cooperation program between JAEA and KAERI has been actively carried out in the field of neutron irradiation. At the fifth seminar in 2005 and sixth in 2008, the irradiation technology and the research reactor management fields were included, respectively, to the joint seminar, and it covers whole areas of irradiation using research reactors. In this seminar total 37 presentations were made in three technical sessions, which are 'research reactor management', 'advanced irradiation technology' and 'post-irradiation examination technology', and active information exchange was done among participants. Papers or manuscripts presented in the 2012 JAEA/KAERI Joint Seminar on Advanced Irradiation and PIE Technologies are contained in the proceedings. (author)

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.

The MEGAPIE PIE sample preparation

International Nuclear Information System (INIS)

Wohlmuther, M.; Boutellier, V.; Dai, Y.; Gavillet, D.; Geissmann, K.; Hahl, S.; Hammer, B.; Lagotzki, A.; Leu, H.; Linder, H.P.; Kalt, A.; Kuster, D.; Neuhausen, J.; Schumann, D.; Schwarz, R.; Schweikert, H.; Spahr, A.; Suter, P.; Teichmann, S.; Thomsen, K.; Wiese, H.; Wagner, W.; Zimmermann, U.; Zumbach, C.

2015-01-01

On the way towards Accelerator-driven Systems (ADS), the MEGAPIE (Mega-Watt Pilot Experiment) project is one of the key milestones. The MEGAPIE project aimed to prove that a liquid Lead-Bismuth-Eutectic (LBE) spallation target can be licensed, planned, built, operated, dismantled, examined and disposed. The project has finished the phase of producing the samples for Post-irradiation Examination (PIE). Samples to study structural material property changes due to the harsh environment of high temperatures, contact with flowing liquid metal (LBE), proton and neutron irradiation will be investigated by all partner laboratories (CEA, CNRS, ENEA, KIT, PSI and SCK-CEN). (authors)

PIE of test assembly of Qinshan nuclear power plant

International Nuclear Information System (INIS)

Ran, M.; Yan, J.; Wang, S.

2000-01-01

The small dimensional test fuel assembly (3x3-2) for the Qinshan Nuclear Power Plant was irradiated up to 25.7 Gwd/tU in the in-pile loop (15.5 Mpa,320 C) in Heavy Water Research Reactor (HWRR), CIAE, at simulative condition to Qinshan PWR normal and short time overpower operation for verifying the design, technology, and material properties of the fuel assembly. Comprehensive post-irradiation examination (PIE) including dimension measurement, gamma scanning, eddy current test, X ray, radiography, measurement of fission gas release, and quantitative metallography etc. were performed. PIE results show that the diameter of the fuel rods changed, ridges appeared on the cladding, pellets swelled, and the rate of fission gas release was higher than what we expected. The results would be an important basis for further improvement of design, technology and material properties for Qinshan PWR assembly. (author)

The pied piper of Hamelin: Exploring the story

Directory of Open Access Journals (Sweden)

Leila Mury Bergmann

2008-12-01

Full Text Available This article’s goal is to explore the story of The Pied Piper of Hamelin. In order to do so, social aspects of childhood in the (probable time when the story was created are presented, as well as some curiosities about the text. Furthermore, this paper brings a personal statement (by the authors of a storytelling activity in a public school nursery in Porto Alegre, based upon the version of the book The Pied Piper of Hamelin, by Tatiana Belinky. After some questions and informal conversation about the tale, the children’s verbal expositions were analyzed. The research brings, as a theoretical background, contributions of studies from authors connected, mainly, to the field of Children’s Literature and Education. It brought the conclusion that the piper’s story motivated representative interventions, since during the storytelling activity children used typical aspects of their culture and also showed their dominium of temporal arrangement of the text’s events, as well as their peculiar creativity – according to their age – of recreating in the situation of the so-called make-believe.

9 CFR 381.158 - Poultry dinners (frozen) and pies.

Science.gov (United States)

2010-01-01

... 9 Animals and Animal Products 2 2010-01-01 2010-01-01 false Poultry dinners (frozen) and pies. 381... AGRICULTURE AGENCY ORGANIZATION AND TERMINOLOGY; MANDATORY MEAT AND POULTRY PRODUCTS INSPECTION AND VOLUNTARY INSPECTION AND CERTIFICATION POULTRY PRODUCTS INSPECTION REGULATIONS Definitions and Standards of Identity or...

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

PIE and separate effect test of high burnup UO2 fuel

International Nuclear Information System (INIS)

Yang, Yong Sik; Kim, S.K.; Kim, D.H.

2005-01-01

To investigate the performance of a high burnup UO 2 fuel, the highest burnup fuel assembly in KOREA was transported to the PIE facility in KAERI. It was a 17·17 fuel assembly irradiated at the Ulchin Unit 2 PWR. The peak fuel rod average burnup was about 57MWd/kgU and locally 65MWd/kgU. The general PIE was performed to investigate the fuel rod irradiation performance. Fission gas release, burnup, oxide thickness, hydrogen pickup, CRUD, and density change were measured by destructive of non-destructive test. Microstructure change, bubble and pore size distributions were observed by optical microscopy, SEM and EPMA. All generated and available PIE results were used to verify high burnup fuel performance code INFRA. Several rods were cut for additional separate effect test. For the high burnup fission gas release behaviour analysis, annealing apparatus were developed and installed in hot cell and preliminary test was performed. In addition to current apparatus new induction furnace will be installed in hot cell to investigate the high temperature and transient fission gas release behaviour. Ring tensile test was performed to analyze the material property degradation which caused by the oxidation and hydride, and additional mechanical tests will be performed. (Author)

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.

Recent improvements in PIE-techniques at the IFE hot-laboratory

International Nuclear Information System (INIS)

Jenssen, Haakon Kristian

1999-01-01

The PIE-techniques at the IFE nuclear fuel section are continuously improved through upgrading of equipment and methods, e.g. image handling techniques and components utilised in data acquisition and editing techniques. To improve the quality or spatial resolution of neutron radiographs the normal technique was complemented with another method. The dysprosium foil/X-ray film technique is now supplemented with a track-etch recorder consisting of a cellulose nitrate film. For further examination the cellulose nitrate film can be digitised to allow electronic image treatment. Promising results were obtained with this technique on neutron radiographs, namely higher spatial resolution compared to the normal technique, high contrast and sharp neutron radiography images. The traditional one-axial profilometry of fuel rods were modified so that diameter/bow measurements are possible at several angular orientations during one acquisition sequence. This extension is very useful in several ways, for instance the built-in data symmetry of the method is used to check the correctness of the measurement results. Diameter and bow measurements give in addition detailed and complete information of canning irregularities and fuel rod profiles. PIE data are collected and compiled in an image file. Inspection and examination of the file information is possible through an ideal user-interface, i.e. Adobe photoshop software with navigator possibilities. An example incorporating PIE data acquired from a fuel rod exposed in a loss of coolant experiment is utilised for illustration of the user-interface and some of its possibilities (author) (ml)

Tratamiento del pie diabético en pacientes ancianos con Heberprot-P

Directory of Open Access Journals (Sweden)

José Luís Solís Licea

2015-12-01

Full Text Available El pie diabético constituye la complicación crónica de mayor morbimortalidad de la diabetes mellitus, significando un problema de salud internacional, del cual no escapa nuestro país y nuestro sistema de salud. Se realizó un estudio de tipo clínico observacional y descriptivo, con el objetivo de evaluar el resultado del tratamiento con Heberprot-P en pacientes con úlceras del pie diabético, en ancianos ingresados en el servicio de Angiología del Hospital General Docente “Dr. Ernesto Guevara de la Serna”, del municipio de Las Tunas, provincia de Las Tunas, en el período comprendido entre el 1ro de enero de 2010 al 31 de diciembre de 2011. Se estudiaron los pacientes según las variables de edad, localización de la lesión, resultado del tratamiento según la clasificación de Wagner y reacciones adversas presentadas. Con este estudio se pretende poner en manos del personal de la salud un material de consulta, que permita evaluar el tratamiento con Heberprot-P del pie diabético en el anciano.

Pie plano astrágalo vertical asociado a sinovitis. Fases de tratamiento

OpenAIRE

Planell i Mas, Elena de; Bonilla Toyos, Elvira

2008-01-01

El pie plano astrágalo vertical congénito es una deformidad poco frecuente que se puede encontrar de forma aislada, dentro de un cuadro polimalformativo o en relación con afectaciones neurológicas. Se caracteriza por una luxación del escafoides por encima del astrágalo,lo que provoca un pie rígido o de dificil manipulación. En este artículo los autores describen un caso clínico de un paciente que acude a consulta por presentar una inflamación dolorosa en la zona de la cabeza del astrágalo del...

International Workshop on Characterization and PIE Needs for Fundamental Understanding of Fuels Performance and Safety

Energy Technology Data Exchange (ETDEWEB)

Not Listed

2011-12-01

The International Workshop on Characterization and PIE Needs to Support Science-Based Development of Innovative Fuels was held June 16-17, 2011, in Paris, France. The Organization for Economic Co-operation and Development (OECD), Nuclear Energy Agency (NEA) Working Party on the Fuel Cycle (WPFC) sponsored the workshop to identify gaps in global capabilities that need to be filled to meet projected needs in the 21st century. First and foremost, the workshop brought nine countries and associated international organizations, together in support of common needs for nuclear fuels and materials testing, characterization, PIE, and modeling capabilities. Finland, France, Germany, Republic of Korea, Russian Federation, Sweden, Switzerland, United Kingdom, United States of America, IAEA, and ITU (on behalf of European Union Joint Research Centers) discussed issues and opportunities for future technical advancements and collaborations. Second, the presentations provided a base level of understanding of current international capabilities. Three main categories were covered: (1) status of facilities and near term plans, (2) PIE needs from fuels engineering and material science perspectives, and (3) novel PIE techniques being developed to meet the needs. The International presentations provided valuable data consistent with the outcome of the National Workshop held in March 2011. Finally, the panel discussion on 21st century PIE capabilities, created a unified approach for future collaborations. In conclusion, (1) existing capabilities are not sufficient to meet the needs of a science-based approach, (2) safety issues and fuels behavior during abnormal conditions will receive more focus post-Fukushima; therefore we need to adopt our techniques to those issues, and (3) International collaboration is needed in the areas of codes and standards development for the new techniques.

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

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.

Social suppliers: Exploring the cultural contours of the performance and image enhancing drug (PIED) market among bodybuilders in the Netherlands and Belgium.

Science.gov (United States)

van de Ven, Katinka; Mulrooney, Kyle J D

2017-02-01

This paper explores the understudied phenomenon of performance and image enhancing drug (PIED) markets by examining the structure and formation of the market for PIEDs among bodybuilders in the Netherlands and Belgium. This article specifically seeks to account for individual reasons and motivations for dealing PIEDs within these bodybuilding subcultures. Understanding illicit PIED markets is important for policy decisions as knowledge on the production and distribution of these substances may assist in designing law enforcement efforts, harm reduction initiatives and treatment options. This article draws on two years of fieldwork in various bodybuilding settings, 47 semi-structured interviews with individuals who are directly or indirectly involved in the PIED market and 64 PIED dealing cases initiated by criminal justice agencies in the Netherlands and Belgium. The data indicates that PIED dealing groups and individuals are often driven by motivations stemming from their social and cultural embeddedness in the bodybuilding subculture. Specifically, these PIED dealers are 'over-socialized' into the structure and culture of bodybuilding and follow the cultural scripts that come with their group affiliation and organization. As a result of the cultural context in which these transactions occur, PIED dealing networks among bodybuilders in the Netherlands and Belgium are more likely to consist of friends or 'friends of friends' tied together by threads of collective meaning found within the bodybuilding subculture. We argue that efforts seeking to explain the structure, formation and motivations of illicit PIED dealing must learn to appreciate how culture mediates structural forces and thereby influences individual and collective action. Policy makers, health care professionals and other relevant parties should consider a plurality of factors (social, economic and cultural) when designing and evaluating PIED-related interventions such as law enforcement efforts, harm

Alteraciones biomecánicas del antepie en el pie zambo y su tratamiento

OpenAIRE

Oller Asensio, Antonio; Prats Climent, Baldiri

1991-01-01

Definición y recuerdo anátomo-fisio-patológico del pie zambo y de las alteraciones funcionales más frecuentes que se encuentran asociadas a esta patología. Se define la metodología básica de exploración física del paciente y estudio radiológico con la determinación de las tangentes tibio-calcáneas. Desarrollo de los tratamientos generales, ortopodológicos, fisioterapéuticos y quirúrgicos. Presentación de tres casos clínicos afectos de alteraciones biomecánicas por pie zambo con su tratamiento...

Uso del método de Ilizarov en pie bot pediátrico. [Use of the Ilizarov method in pediatric clubfoot

Directory of Open Access Journals (Sweden)

Silvana Fiscina

2013-05-01

Full Text Available Introducción El objetivo de tratamiento del pie Bot está enfocado en lograr un pie plantígrado, indoloro y  que permita el uso del calzado habitual. El objetivo del trabajo fue medir la incidencia de recidiva luego de obtenida la corrección de la deformidad en pacientes con pie bot tratados con tutor de Ilizarov, y  analizar los factores pronósticos asociados. Material y Método Cohorte retrospectiva de factores pronóstico. Se trató con este método a 48 pacientes (70 pies desde 1988. Se excluyeron los pacientes con falta de corrección de la deformidad en el momento de retirar el tutor (deformidad residual o corrección incompleta. La variable de estudio fue la recidiva. Resultados El 77% de los 70 pies eran idiopáticos. Solo 18 pies no habían sido tratados. Todos eran pacien- tes pediátricos. El promedio de edad en el momento de la cirugía era de 7,9 años. Se incluyeron tres grupos de pacientes: tratados con Ilizarov solo (40,2%, en combi- nación con cirugía de partes blandas (38,5% y asociado con osteotomías (21,3%. El seguimiento promedio posoperatorio fue de 10,6 años (de 5,5 a 22. En el 71% de los pies, los resultados fueron pobres, la deformidad recidivó en un promedio de 38 meses, y fueron necesarias cirugías complementarias para lograr un pie plantígrado. Conclusión Presentamos una importante casuística con seguimiento alejado de pie bot recidivado o inveterado, con una alta recidiva de la deformidad (71%. No encontramos diferencias estadísticamente significativas entre los subgrupos estudiados (edad, diagnóstico, trata- mientos previos y procedimientos asociados. Actualmente no consideramos a esta técnica de primera elección, pues nuestros resultados fueron poco alentadores.

Development of PIE techniques for irradiated LWR pressure vessel steels

International Nuclear Information System (INIS)

Nishi, Masahiro; Kizaki, Minoru; Sukegawa, Tomohide

1999-01-01

For the evaluation of safety and integrity of light water reactors (LWRs), various post irradiation examinations (PIEs) of reactor pressure vessel (RPV) steels and fuel claddings have been carried out in the Research Hot Laboratory (RHL). In recent years, the instrumented Charpy impact testing machine was remodeled aiming at the improvement of accuracy and reliability. By this remodeling, absorbed energy and other useful information on impact properties can be delivered from the force-displacement curve for the evaluation of neutron irradiation embrittlement behavior of LWR-RPV steels at one-time striking. In addition, two advanced PIE technologies are now under development. One is the remote machining of mechanical test pieces from actual irradiated pressure vessel steels. The other is development of low-cycle and high-cycle fatigue test technology in order to clarify the post-irradiation fatigue characteristics of structural and fuel cladding materials. (author)

49 CFR 40.403 - Must a service agent notify its clients when the Department issues a PIE?

Science.gov (United States)

2010-10-01

... 49 Transportation 1 2010-10-01 2010-10-01 false Must a service agent notify its clients when the... Must a service agent notify its clients when the Department issues a PIE? (a) As a service agent, if... clients, in writing, about the issuance, scope, duration, and effect of the PIE. You may meet this...

Magnetic Resonance Imaging: A Tool for Pork Pie Development

Science.gov (United States)

Gaunt, Adam P.; Morris, Robert H.; Newton, Michael I.

2013-01-01

The traditional British pork pie consists of roughly chopped pork cooked in a hot water pastry crust. Due to shrinkage of the meat during cooking, the gap formed around the meat is usually sealed using a gelatin based jelly to exclude air and thus help to preserve the pie. The properties of the jelly are such that it will ingress into the pastry crust causing undesirable softening. The jelly is traditionally produced by simmering pig trotters with seasoning for several hours. In this work we demonstrate the potential of magnetic resonance imaging (MRI) as a tool for investigating the conditions required for producing jellies with different properties and present two examples of this use. Firstly we demonstrate that MRI can determine the ability of water to diffuse through the jelly which is critical in minimizing the amount of moisture moving from the jelly to the crust. Secondly, the impact of jelly temperature on the penetration length into the crust is investigated. These examples highlight the power of MRI as a tool for food assessment. PMID:28239124

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

Clínica del pie valgo

OpenAIRE

Marcelino Reyes, Jesús

1998-01-01

Genericamente reconocemos al pie valgo, por las características siguientes: - desviación de la linea de Helbing ( retropié) - aplanamiento de la bóveda longitudinal interna - pronación de antepié. - aspecto de pié plano. Pero no podemos contentarnos con estas cuatro reglas,y por lo tanto hemos de pormenorizar y clasificar en función de los diferentes elementos que intervienen en la morfogenética de pié. Con lo cual también tendremos una visión mas amplia a la hora de poder aplicar un tratamie...

Microbiological evaluation of sweet pies marketed fairs in special city Goiânia-GO

Directory of Open Access Journals (Sweden)

Edmar Soares Nicolau

2014-02-01

Full Text Available The sweet pies are widely consumed in special fairs in Goiânia-GO city. In general they are marketed in inadequate way, without refrigeration and most of times without any protection against various types of contaminants, including microbial contamination that can cause food toxi-infections to consumers. This study aimed to evaluate the microbiological quality of pies sold in 105 stalls in 23 special fair city of Goiânia, and also the impact of training on the Good Manufacturing Practices (GMP in the quality of these products. The micro-organisms investigated were those required the by standard microbiological: Salmonella, fecal coliforms, Bacillus cereus and Staphylococcus coagulase positive. We also observed the temperature exposure of these foods on newsstands. We analyzed 259 samples in total, with 209 in the first stage, before the training of the fairground, and 50 in the second, after qualifying for the fair dealers in GMP. Pies sweets collected before training of fair dealers were considered unfit for consumption because it contains health indicators above the recommended limit (65.6% with fecal coliforms, 20.6% Staphylococcus coagulase positive and 16.8% with Bacillus cereus. In samples collected after training there was an improvement in the indices (28,0% contained coliforms, 14,0% Staphylococcus coagulase positive and 28,0% of Bacillus cereus, all above the limit set. None samples had Salmonella in both steps. It can be concluded that with the training of fair dealers there was an improvement in the microbiological quality of these products. These results reinforce the need for training of the fairground and the impact it can have on the quality of the products. The storage temperatures pies ranged from –5.3ºC to 28.7ºC in first step and –3.6ºC to 24.0ºC in the second. The presence of the refrigerated was not sufficient to maintain the optimal temperature (to 10 ° C for storage of pies.

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.

Oxidative stress in pied flycatcher (Ficedula hypoleuca) nestlings from metal contaminated environments in northern Sweden

International Nuclear Information System (INIS)

Berglund, A.M.M.; Sturve, J.; Foerlin, L.; Nyholm, N.E.I.

2007-01-01

Metals have been shown to induce oxidative stress in animals. One of the most metal polluted terrestrial environments in Sweden is the surroundings of a sulfide ore smelter plant located in the northern part of the country. Pied flycatcher nestlings (Ficedula hypoleuca) that grew up close to the industry had accumulated amounts of arsenic, cadmium, mercury, lead, iron and zinc in their liver tissue. The aim of this study was to investigate if pied flycatcher nestlings in the pollution gradient of the industry were affected by oxidative stress using antioxidant molecules and enzyme activities. The antioxidant assays were also evaluated in search for useful biomarkers in pied flycatchers. This study indicated that nestlings in metal contaminated areas showed signs of oxidative stress evidenced by up regulated hepatic antioxidant defense given as increased glutathione reductase (GR) and catalase (CAT) activities and slightly but not significantly elevated lipid peroxidation and glutathione-S-transferase (GST) activities. Stepwise linear regression indicated that lipid peroxidation and CAT activities were influenced mostly by iron, but iron and lead influenced the CAT activity to a higher degree. Positive relationships were found between GST and lead as well as GR activities and cadmium. We conclude that GR, CAT, GST activities and lipid peroxidation levels may function as useful biomarkers for oxidative stress in free-living pied flycatcher nestlings exposed to metal contaminated environments

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

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

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.

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

Graph Theory. 2. Vertex Descriptors and Graph Coloring

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

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

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

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

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

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

Fitness costs of polygyny in female Pied Flycatchers Ficedula hypoleuca

NARCIS (Netherlands)

Both, C.

2002-01-01

Variance in mating systems can only be understood if the fitness consequences of the available options are known for both sexes. In Pied Flycatchers Ficedula hypoleuca it has for long been suggested that females pairing with already mated males pay a fitness cost, and it is still debated why females

Prevención de úlceras en el pie del paciente diabético

Directory of Open Access Journals (Sweden)

Análida Pinilla Roa

2000-01-01

Full Text Available La Diabetes Mellitus tipo dos (1 es una de las enfermedades metabólicas más comunes dentro de la población adulta (mayor de 30 años, da lugar a múltiples complicaciones como insuficiencia renal, enfermedades cardiovasculares, ceguera, neuropatía periférica y amputaciones de los miembros inferiores. Vale la pena destacar el profundo impacto de la diabetes en los pies debido a la gran morbilidad y mortalidad que puede causar. Se sabe que los problemas en los pies de los diabéticos son el resultado de varios factores como son la neuropatía periférica, la vasculopatía, los trastornos de la inmunidad  y los traumatismos entre otros. Cada uno de estos factores contribuye a la formación de úlceras que no sanan fácilmente y en general se infectan causando un proceso séptico que requiere el tratamiento radical de la amputación. El objetivo de este artículo es concientizar al personal de salud sobre  la necesidad de la prevención de las úlceras en los pies de los pacientes diabéticos, mediante la educación para permitir una detección temprana y un tratamiento oportuno, disminuir la tasa de úlceras y por ende de amputaciones de los miembros inferiores. La educación al paciente y al personal de salud debe incluir: el reconocimiento de signos tempranos de ulceración en las áreas de mayor presión de los pies mediante un adecuado autoexamen diario, la asesoría para el uso de calzado protector, adecuados hábitos de aseo y corte de uñas, así como medidas preventivas para evitar el trauma.

[Characterization and nutritional value of a food artisan: the meat pie of Murcia].

Science.gov (United States)

Ruiz-Cano, Domingo; Pérez-Llamas, Francisca; López-Jiménez, José Ángel; González-Silvera, Daniel; Frutos, Maria José; Zamora, Salvador

2013-01-01

The main aims of this study are to describe the characteristics of the meat pie, a typical product of the regional gastronomy of Murcia and to determine its nutritional and energy values, fatty acid profile and fat quality. There were studied 24 samples of Murcia's meat pie from the six best-selling retail establishments in this Region (four units per establishment).The moisture, protein, fat, carbohydrates, fibre and minerals, contents and the energy value, fatty acid profile and fat quality were analyzed using the Official Analysis Methods of Foods. All analyses were performed by triplicate. The average weight of this product was 192.3 ± 11.8 g, with three differentiated parts (base, filling and pastry lid). All ingredients were natural raw materials: wheat flour, lard, ground beef, sliced boiled egg and chorizo, water and spices (salt, pepper, garlic, paprika and nutmeg). Most of its organoleptic attributes are due to the type and amount of fat or lard. The combination of the other ingredients and the particular formulation of the spices are also responsible of other attributes. Due to its protein content (11.0%), this meat pie can replace other meat dishes, and be incorporated into a balanced diet. However, it is necessary to take into account its fat and energy contents (17.3 g and 317 kcal/100 g, respectively). Unlike many common pastry products, it contains no trans fatty acids. The results of the research show that the studied product remains, at present, an artisan food, and offer reliable information that it is representative of the energy and nutritional values of the Murcia's meat pie, a typical product of the gastronomy of the Region of Murcia. Copyright © AULA MEDICA EDICIONES 2013. Published by AULA MEDICA. All rights reserved.

Valoración del pie plano en personas adultas con síndrome de Down y de su afectación en la vida diaria

OpenAIRE

Stafford, Frances

2017-01-01

Se realizó un estudio en 50 adultos con síndrome de Down, entre 18 y 40 años para analizar la incidencia e influencia del pie plano sobre el funcionamiento de la vida diaria. La incidencia fue del 70%, con grados diversos de pie plano. Hubo dolor en 4 personas, si bien era debido a otros problemas y no achacable al pie plano. En ningún caso la presencia de pie plano afectó al funcionamiento de la vida ordinaria.

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

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.

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.

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

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

Nesting ecology of Pied Avocet Recurvirostra avosetta in Sfax salina ...

African Journals Online (AJOL)

In this paper we use the results of a one-year monitoring of nests in Sfax salina to provide information on its nesting parameters, in particular nesting phenology, colony size and hatching success. Our results show that Pied Avocets formed dense colonies at the beginning of the nesting season, but colony size decreased as ...

Fractal Pied de Poule (houndstooth) Collection SS'15 : Parka and Jacket

NARCIS (Netherlands)

2015-01-01

Fractal Pied de Poule (houndstooth) Spring/Summer '15 is a collection consisting of a body, a jacket and a parka. The last two will be shown here. Algorithms, new materials, digital prototyping, drapability, tessellations and fractals are recurring themes in our projects. The body, the jacket and

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.

Moult, pied plumage and relationships within the genus of the Black ...

African Journals Online (AJOL)

The pied plumage of the adult Black Sparrowhawk is rather exceptional in the genus Accipiter and it could be explained by functionality or by phylogenetic relationships. The moult pattern of museum specimens is presented, supplementing information from captive birds. The post-juvenile moulting sequence is similar to that ...

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.

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

Improvements in PIE-techniques at the IFE hot-laboratory. 'Neutron radiography, three dimensional profilometry and image compilation of PIE data for visualization in an image based user-interface'

International Nuclear Information System (INIS)

Jenssen, H.K.; Oberlaender, B.C.

2002-01-01

The PIE-techniques used at IFE are continuously improved through upgrading of equipment and methods, e.g. image handling techniques and components utilized in data acquisition and editing techniques. To improve the quality or spatial resolution of neutron radiographs the normal technique was complemented with another method, i.e. the dysprosium foil/X ray film technique is supplemented with a track-etch recorder consisting of a cellulose nitrate film. For further examination of the neutron radiographs the cellulose nitrate film can be digitized to allow electronic image treatment. Promising results were obtained with this technique on neutron radiographs, namely higher spatial resolution compared to the normal technique, high contrast and sharp neutron radiography images. The traditional uniaxial profilometry of fuel rods was modified so that diameter/bow measurements are possible at several angular orientations during one acquisition sequence. This extension is very useful in several ways, for instance the built-in data symmetry of the method is used to check the correctness of the measurement results. Diameter and bow measurements give information of cladding irregularities and fuel rod profiles. Implementation of electronic image handling techniques is particularly useful in PIE when data are collected and compiled in an image file. Inspection and examination of the file contents (examination results) are possible through an ideal user-interface, i.e. Adobe Photoshop software with navigator possibilities. Examples incorporating PIE data acquired from neutron radiography, visual inspection and ceramography are utilized for illustration of the user-interface and some of its possibilities. (author)

Spatial distribution of breeding Pied Flycatchers Ficedula hypoleuca in respect to their natal sites

Directory of Open Access Journals (Sweden)

Sokolov, L.

2004-06-01

Full Text Available Study of philopatry and dispersal of pied flycatchers Ficedula hypoleuca was launched on the Courish Spit (SE Baltic in 1981. Since then, ca. 9,000 nestlings were ringed at different sites in the Russian part of the Courish Spit. A total of 557 individuals ringed as pulli were recaptured in subsequent seasons in the study area. Both males and females are more often recaptured in the plots where they were ringed than in other plots. These results were interpreted in the framework of the hypothesis forwarded by Löhrl (1959 and supported by Berndt & Winkel (1979. These authors suggested that cavity nesters (pied flycatchers and collared flycatchers F. albicollis imprint their future local breeding area during the period of postfledging exploration. Birds that survive until the next spring, return to these imprinted areas to breed. A similar study done by Sokolov et al. (1984 on the Courish Spit in an open nesting species, the chaffinch Fringilla coelebs, confirmed this finding. We assumed that juvenile pied flycatchers disperse for varying distances during their postfledging movements and imprint a local area, some 1–5 kilometres in diameter. This area is the goal of their migration next spring. It is suggested that in spring, yearlings are non–randomly distributed in respect to the area they have imprinted as juveniles. Recently, Vysotsky (2000, 2001 re–analysed the same data on philopatry of pied flycatchers on the Courish Spit and forwarded an alternative hypothesis. He suggests that juveniles, both males and females, do not imprint any local area during the postfledging period, but are distributed randomly across the area of several dozens of kilometres in spring. Vysotsky was able to show that distribution of distances of natal dispersal did not differ from the random pattern the study plot which was an 8.5 km long line of nest boxes along the Courish Spit. The aim of this study was to test these two alternative hypotheses. To do so, we

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

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

Active basement uplift as seen with cosmogenic lenses: the Sierra Pie de Palo case (Western Argentina)

Science.gov (United States)

Siame, L. L.; Sébrier, M.; Costa, C. H.; Ahumada, E. A.; Bellier, O.

2013-12-01

The Andean foreland of western Argentina (28°S-33°S) corresponds to retroarc deformations associated with the ongoing flat subduction of the Nazca plate beneath the South American lithosphere, and associated with high levels of seismic activity and crustal active faulting. To improve earthquake source identification and characterization in the San Juan region, data from seismology, structural geology and quantitative geomorphology can be integrated and combined to provide a seismotectonic model. In this model, the Andean back-arc of western Argentina has to be regarded as an obliquely converging foreland where Plio-Quaternary deformations are partitioned between strike-slip and thrust motions that are localized on the E-verging, thin-skinned Argentine Precordillera, and the W-verging thick-skinned Sierras Pampeanas, respectively. In this domain, the Sierra Pie de Palo is a key structure playing a major role in the partitioning of the Plio-Quaternary deformations. Located in the westernmost Sierras Pampeanas, the Sierra Pie de Palo forms a NNE striking, 80 km-long and 35-40 km-wide, ellipsoid range that reaches elevation as high as 3162 m. This mountain range is an actively growing basement fold associated with a high level of seismic activity (e.g., the November 23, 1977, Caucete, Mw 7.4 earthquake). To evaluate the degree of tectonic activity around the Sierra Pie de Palo, we combined a detailed morphometric analysis of the topography together with in situ-produced cosmogenic 10Be concentrations measured in (1) bedrock outcrops corresponding to the exhumed erosional regional surface, (2) surface boulders abandoned on alluvial fans deformed by active faults, and (3) in fluvial sediments sampled at the outlets of selected watersheds that drains out from the Sierra Pie de Palo. All together, our results allows: (1) assessing quantitative constraints on the rate of tectonic and denudation processes that are responsible for the active growth and erosion of the Sierra

Giant Paperclip Necklaces, Soup-Can Rings and Cherry-Pie Hats

Science.gov (United States)

Winters, Laurel A.

2011-01-01

In this article, the author describes an art project inspired by the wearable sculpture art created by artist Marjorie Schick. Students used wallpaper paste and newspapers to create papier-mache for a mountain hat, a cherry-pie mask/hat, a "dress" shoe and a Cubistic mask. Cardboard was used in many of these things, in addition to being used as…

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

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph 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

Metacoder: An R package for visualization and manipulation of community taxonomic diversity data.

Directory of Open Access Journals (Sweden)

Zachary S L Foster

2017-02-01

Full Text Available Community-level data, the type generated by an increasing number of metabarcoding studies, is often graphed as stacked bar charts or pie graphs that use color to represent taxa. These graph types do not convey the hierarchical structure of taxonomic classifications and are limited by the use of color for categories. As an alternative, we developed metacoder, an R package for easily parsing, manipulating, and graphing publication-ready plots of hierarchical data. Metacoder includes a dynamic and flexible function that can parse most text-based formats that contain taxonomic classifications, taxon names, taxon identifiers, or sequence identifiers. Metacoder can then subset, sample, and order this parsed data using a set of intuitive functions that take into account the hierarchical nature of the data. Finally, an extremely flexible plotting function enables quantitative representation of up to 4 arbitrary statistics simultaneously in a tree format by mapping statistics to the color and size of tree nodes and edges. Metacoder also allows exploration of barcode primer bias by integrating functions to run digital PCR. Although it has been designed for data from metabarcoding research, metacoder can easily be applied to any data that has a hierarchical component such as gene ontology or geographic location data. Our package complements currently available tools for community analysis and is provided open source with an extensive online user manual.

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.

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

Providing Information about Reading Lists via a Dashboard Interface

Directory of Open Access Journals (Sweden)

Dr Jason Cooper

2013-01-01

Full Text Available As developers of the open source LORLS Resource/Reading List Management System we have developed a dashboard to better support academic staffs’ understanding of how their students use reading lists. This dashboard provides both graphical and tabulated information drawn from LORLS and the Aleph Integrated Library System. Development of the dashboard required changes to back-end functionality of LORLS such as logging views of reading lists and caching of loan data. Changes to the front end included the use of HTML5 canvas elements to generate pie charts and line graphs. Recently launched to academic staff at Loughborough University, the dashboard has already garnered much praise. It is hoped that further development of the dashboard will provide even more support for academics in the compilation of their reading lists.

ADIOS-automated data inquiry for oil spills

International Nuclear Information System (INIS)

Lehr, W.J.; Overstreet, R.; Jones, R.; Watabayashi, G.

1992-01-01

An intelligent computer database called ADIOS has been developed which stores properties of several hundred oils and oil products and which is combined with a model for oil weathering. Environmental data are input by the user through a menu-driven graphic interface. The format of the output is designed to provide immediate information for oil spill cleanup decisions. Typical output information includes changes in key physical parameters (density, viscosity, water content of emulsions) over time and an oil loss budget at any specific time. The model includes algorithms for spill spreading, evaporation, entrainment, droplet size distributions, rate of mousse formation, and changes in density and viscosity. ADIOS will eventually be part of a larger spill model which includes oil transport. ADIOS calculations are presented as either pie charts or graphs. 21 refs., 2 figs

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.

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

Kempton, Mark

This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

Detection of rhodopsin dimerization in situ by PIE-FCCS, a time-resolved fluorescence spectroscopy.

Science.gov (United States)

Smith, Adam W

2015-01-01

Rhodopsin self-associates in the plasma membrane. At low concentrations, the interactions are consistent with a monomer-dimer equilibrium (Comar et al., J Am Chem Soc 136(23):8342-8349, 2014). At high concentrations in native tissue, higher-order clusters have been observed (Fotiadis et al., Nature 421:127-128, 2003). The physiological role of rhodopsin dimerization is still being investigated, but it is clear that a quantitative assessment is essential to determining the function of rhodopsin clusters in vision. To quantify rhodopsin interactions, I will outline the theory and methodology of a specialized time-resolved fluorescence spectroscopy for measuring membrane protein-protein interactions called pulsed-interleaved excitation fluorescence cross-correlation spectroscopy (PIE-FCCS). The strength of this technique is its ability to quantify rhodopsin interactions in situ (i.e., a live cell plasma membrane). There are two reasons for restricting the scope to live cell membranes. First, the compositional heterogeneity of the plasma membrane creates a complex milieu with thousands of lipid, protein, and carbohydrate species. This makes it difficult to infer quaternary interactions from detergent solubilized samples or construct a model phospholipid bilayer that recapitulates all of the interactions present in native membranes. Second, organizational structure and dynamics is a key feature of the plasma membrane, and fixation techniques like formaldehyde cross-linking and vitrification will modulate the interactions. PIE-FCCS is based on two-color fluorescence imaging with time-correlated single-photon counting (TCSPC) (Becker et al., Rev Sci Instrum 70:1835-1841, 1999). By time-tagging every detected photon, the data can be analyzed as a fluorescence intensity distribution, fluorescence lifetime histogram, or fluorescence (cross-)correlation spectra (FCS/FCCS) (Becker, Advanced time-correlated single-photon counting techniques, Springer, Berlin, 2005). These

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

Effect of the enriched filter pie with natural phosphate and microorganisms on soil and plant in a Vermelho-Distrófico Latossolo

Directory of Open Access Journals (Sweden)

Leónides Castellanos González

2016-03-01

Full Text Available The objective of the research was to evaluate the use of filter pie and phosphate rock enriched with biofertilizer microorganisms on the population of microorganisms and phosphorus tenor in the soil and on plants. The experiment was conducted in a vegetation house with corn plants with Latossolo Red-Distrófico, containing seven treatments disposed in an entirely randomized design, where the treatments were: soil samples and filter pie with additions of phosphate of Araxá rock enriched with microorganisms coming from Biopack (1, Embrafos (2 and Azotofos (3, and without enrichment with microorganisms (4, and three controls, soil just with filter pie (5, soil just with phosphate rock (6 and only soil (7, with three repetitions. Height, stem diameter and number of leaves for plants were evaluated at 14, 28 and 42 days. At the 45 days the dry matters of leafs and roots were evaluated, as the same as populations of the microorganisms and phosphorus tenor in the soil and in the aerial part of the plant. The tenor of soluble phosphorus in the soil and accumulated phosphorous in the aerial part of corn plan were increased by the treatments with filter pie but not higher with filter pie enriched with biofertilizers, so its use isn’t justified. The pie treatments increase the fungus, total and solubilizers bacterial populations in the soil, provoking an increase of the height, diameter, number of leaves and dry matter of corn plants in a Red-Distrófico Latossolo.

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

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.

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

Técnica de Imhäuser en el pie zambo : resultados a medio y largo plazo

OpenAIRE

Fernández Gutiérrez, C.; Núñez Batalla, Daniel; Pena Vázquez, J.; Antuña Antuña, S.; González Méndez, J.; López Fernández, P; Paz Jiménez, José

1996-01-01

Se revisan un total de 60 pies con equinovaro congénito pertenecientes a 48 pacientes, todos con un seguimiento superior a 5 años. En todos los casos se realizó un tratamiento combinado: ortopédico (manipulaciones y enyesados desde el nacimiento) y quirúrgico (correcciones según el método de Imhäuser modificado). Se valoró morfológica, funcional y radiográficamente cada caso. En la valoración global sólo 1 caso fue considerado malo, 13 regulares (21,6%), 6 por pies planos valgo...

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.

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.

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.

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

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.

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

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,

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.

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.

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.

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.

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

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.

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.

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.

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.

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

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.

Atritis gotosa como causa de pie de riesgo

OpenAIRE

Ortega-Avila, Ana Belén; Fernández Torres, Raúl; Agüera Jiménez, David

2016-01-01

INTRODUCCIÓN: La gota es una manifestación común de la artritis, cuya inflamación se debe al depóstido de cristales de uratao monosódico en articulaciones y tejidos blandos por un aumento de ácido úrico en sangre y su padecimiento muestra una relación creciente con la edad. OBJETIVOS: Analizar las características fisiopatológicas de la artritis gotosa en el pie así como justificar la repercusión negativa que tiene su padecimiento en la calidad de vida de la población basándose en la simple af...

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

Proceedings of 2008 KAERI/JAEA joint seminar on advanced irradiation and PIE technologies

International Nuclear Information System (INIS)

Ryu, Woo-Seog; Ishihara, Masahiro

2008-12-01

Under the Arrangement for Cooperation in the field of peaceful uses of Nuclear Energy between the Korea Atomic Energy Research Institute (KAERI) and the Japan Atomic Energy Agency (JAEA), the 2008 KAERI-JAEA Joint Seminar on Advanced Irradiation and PIE (post-irradiation examination) Technologies has been held at KAERI in Daejeon, Korea, from November 5 to 7, 2008. This seminar was organized by the PIE and Radwaste Division, Research Reactor Engineering Division, and HANARO Management Division in KAERI. It was also the first time to hold the seminar under the agreement signed September 4, 2008. This triennial seminar is the sixth in series of bilateral exchange of irradiation technologies. Since the first joint seminar on Post Irradiation Examination Technology between JAERI and KAERI held at JAERI Oarai center, Japan in 1992, it has been a good model of international cooperation program between KAERI and JAEA in the field of neutron irradiation uses. At the fifth seminar in 2005, irradiation technology field was included to the joint seminar, moreover in this time it is expanded to the research reactor management field for covering whole areas of irradiation using in research reactors. The seminar was divided into three technical sessions; the sessions addressed the general topics of 'research reactor management', 'advanced irradiation technology' and 'post-irradiation examination technology'. Total 46 presentations were made, and active information exchange was done among participants. This proceeding is containing the papers or manuscripts presented in the 2008 KAERI-JAEA Joint Seminar on Advanced Irradiation and PIE Technologies. The 46 of the presented papers indexed individually. (J.P.N.)

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.

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

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

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.

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

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.

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

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

Stuffed Turkey and Pumpkin Pie: In, Through and Out of American Contexts

Directory of Open Access Journals (Sweden)

Tamara Kohn

2013-02-01

Full Text Available This article explores the meanings embedded in the production, consumption, and symbolic positioning of turkey and pumpkin pie, foods closely associated with the American ritual feast of Thanksgiving. An analysis of turkey and pumpkin pie recipes used and adapted by first- and second-generation immigrants in north America, and by north Americans living abroad, throws into relief complex relations between food production, food consumption and the complexities of lived and often multiple sociocultural identifications. Through sharing the experiences, memories and associations evoked by individuals in the production of holiday recipes, I argue that ideas about ‘tradition’ and a desire to celebrate family and community through the ritual of baking, serving and consuming a ‘standard’ Thanksgiving holiday meal allow one to feel part of an imagined global American community. At the same time these details demonstrate celebration of individual and familial distinctiveness that is traced to (sometimes contested memories of childhood and/or ethnic background, as well as to exploration, innovation and experience in the world at large through travel, migration and imagination.

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

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

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

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

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

Science.gov (United States)

Vorburger, Robert S; Reischauer, Carolin; Boesiger, Peter

2013-02-01

Bootstrap methods have recently been introduced to diffusion-weighted magnetic resonance imaging to estimate the measurement uncertainty of ensuing diffusion parameters directly from the acquired data without the necessity to assume a noise model. These methods have been previously combined with deterministic streamline tractography algorithms to allow for the assessment of connection probabilities in the human brain. Thereby, the local noise induced disturbance in the diffusion data is accumulated additively due to the incremental progression of streamline tractography algorithms. Graph based approaches have been proposed to overcome this drawback of streamline techniques. For this reason, the bootstrap method is in the present work incorporated into a graph setup to derive a new probabilistic fiber tractography method, called BootGraph. The acquired data set is thereby converted into a weighted, undirected graph by defining a vertex in each voxel and edges between adjacent vertices. By means of the cone of uncertainty, which is derived using the wild bootstrap, a weight is thereafter assigned to each edge. Two path finding algorithms are subsequently applied to derive connection probabilities. While the first algorithm is based on the shortest path approach, the second algorithm takes all existing paths between two vertices into consideration. Tracking results are compared to an established algorithm based on the bootstrap method in combination with streamline fiber tractography and to another graph based algorithm. The BootGraph shows a very good performance in crossing situations with respect to false negatives and permits incorporating additional constraints, such as a curvature threshold. By inheriting the advantages of the bootstrap method and graph theory, the BootGraph method provides a computationally efficient and flexible probabilistic tractography setup to compute connection probability maps and virtual fiber pathways without the drawbacks of

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

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.

Introducing a Framework for Physics Innovation and Entrepreneurship (PIE) Education

Science.gov (United States)

Roughani, Bahram

A desired outcome for Physics Innovation and Entrepreneurship (PIE) education is preparing physics majors with an innovative and entrepreneurial mindset who are capable of opportunity recognition and adept in leveraging physics knowledge to address specific needs. Physics as a discipline is well-recognized to prepare students who become problem solvers and critical thinkers, gifted in dealing with abstract ideas and ambiguities in the context of complex and real-world problems. These characteristics when enhanced through appropriate combinations of curricular, co-curricular, and extra-curricular programs can prepare physics majors for careers and future challenges that may involve translating physics knowledge into useful products and services either as part of a technical team within an organization or through startups. A viable PIE education model prepares graduates for various career paths in addition to the traditional options such as pursuing graduate studies or becoming a science teacher. Having a well-defined ``third option'' for physics will benefit the robustness of the physics discipline through recruitment and retention of prospective students who in principle are interested in physics as a subject, but in practice they may overlook physics as their preferred major primarily because they are uncertain about a viable career path based on an undergraduate physics education. The ''Pathways to Innovation'' at Loyola is established based on the program developed by VentureWell and Epicenter (NSF Supported).

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.

On two energy-like invariants of line graphs and related graph operations

Directory of Open Access Journals (Sweden)

Xiaodan Chen

2016-02-01

Full Text Available Abstract For a simple graph G of order n, let μ 1 ≥ μ 2 ≥ ⋯ ≥ μ n = 0 $\\mu_{1}\\geq\\mu_{2}\\geq\\cdots\\geq\\mu_{n}=0$ be its Laplacian eigenvalues, and let q 1 ≥ q 2 ≥ ⋯ ≥ q n ≥ 0 $q_{1}\\geq q_{2}\\geq\\cdots\\geq q_{n}\\geq0$ be its signless Laplacian eigenvalues. The Laplacian-energy-like invariant and incidence energy of G are defined as, respectively, LEL ( G = ∑ i = 1 n − 1 μ i and IE ( G = ∑ i = 1 n q i . $$\\mathit{LEL}(G=\\sum_{i=1}^{n-1}\\sqrt{ \\mu_{i}} \\quad\\mbox{and}\\quad \\mathit {IE}(G=\\sum_{i=1}^{n} \\sqrt{q_{i}}. $$ In this paper, we present some new upper and lower bounds on LEL and IE of line graph, subdivision graph, para-line graph and total graph of a regular graph, some of which improve previously known results. The main tools we use here are the Cauchy-Schwarz inequality and the Ozeki inequality.

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

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

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

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

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

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

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.

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

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.

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.

Calling Where It Counts: Subordinate Pied Babblers Target the Audience of Their Vocal Advertisements.

Science.gov (United States)

Humphries, David J; Finch, Fiona M; Bell, Matthew B V; Ridley, Amanda R

2015-01-01

For territorial group-living species, opportunities to reproduce on the natal territory can be limited by a number of factors including the availability of resources within a territory, access to unrelated individuals, and monopolies on reproduction by dominant group members. Individuals looking to reproduce are therefore faced with the options of either waiting for a breeding opportunity to arise in the natal territory, or searching for reproductive opportunities in non-natal groups. In the cooperatively breeding Southern pied babbler, Turdoides bicolor, most individuals who achieve reproductive success do so through taking up dominant breeding positions within non-natal groups. For subordinate pied babblers therefore, searching for breeding opportunities in non-natal groups is of primary importance as this represents the major route to reproductive success. However, prospecting (where individuals leave the group to search for reproductive opportunities within other groups) is costly and individuals rapidly lose weight when not part of a group. Here we demonstrate that subordinate pied babblers adopt an alternative strategy for mate attraction by vocal advertisement from within their natal territories. We show that subordinates focus their calling efforts on the edges of their territory, and specifically near boundaries with neighbouring groups that have potential breeding partners (unrelated individuals of the opposite sex). In contrast to prospecting, calling individuals showed no body mass loss associated with this behaviour, suggesting that calling from within the group may provide a 'cheap' advertisement strategy. Additionally, we show that subordinates use information regarding the composition of neighbouring groups to target the greatest number of potential mating partners.

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

A satisfação do cliente : estudo do caso do franchising de fast-food King Pie na Cidade de Maputo em Moçambique

OpenAIRE

Ramos, Vânia Raquel Raimundo

2014-01-01

Dissertação de Mestrado em Gestão/MBA apresentada à Universidade Aberta O presente trabalho tem por objectivo central, estudar a satisfação dos clientes da empresa King Pie na Cidade de Maputo. O King Pie é uma cadeia sul-africana de fast-food, que em Moçambique opera em regime de franchising, estando presente no mercado local desde o ano de 2004. Neste momento, o King Pie dispõe quatro (4) estabelecimentos localizados na Cidade de Maputo com dois (2) investidores no país que detêm o direi...

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

Energy Technology Data Exchange (ETDEWEB)

Simmhan, Yogesh; Kumbhare, Alok; Wickramaarachchi, Charith; Nagarkar, Soonil; Ravi, Santosh; Raghavendra, Cauligi; Prasanna, Viktor

2014-08-25

Large scale graph processing is a major research area for Big Data exploration. Vertex centric programming models like Pregel are gaining traction due to their simple abstraction that allows for scalable execution on distributed systems naturally. However, there are limitations to this approach which cause vertex centric algorithms to under-perform due to poor compute to communication overhead ratio and slow convergence of iterative superstep. In this paper we introduce GoFFish a scalable sub-graph centric framework co-designed with a distributed persistent graph storage for large scale graph analytics on commodity clusters. We introduce a sub-graph centric programming abstraction that combines the scalability of a vertex centric approach with the flexibility of shared memory sub-graph computation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation. We map Connected Components, SSSP and PageRank algorithms to this model to illustrate its flexibility. Further, we empirically analyze GoFFish using several real world graphs and demonstrate its significant performance improvement, orders of magnitude in some cases, compared to Apache Giraph, the leading open source vertex centric implementation.

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.

OAP- OFFICE AUTOMATION PILOT GRAPHICS DATABASE SYSTEM

Science.gov (United States)

Ackerson, T.

1994-01-01

The Office Automation Pilot (OAP) Graphics Database system offers the IBM PC user assistance in producing a wide variety of graphs and charts. OAP uses a convenient database system, called a chartbase, for creating and maintaining data associated with the charts, and twelve different graphics packages are available to the OAP user. Each of the graphics capabilities is accessed in a similar manner. The user chooses creation, revision, or chartbase/slide show maintenance options from an initial menu. The user may then enter or modify data displayed on a graphic chart. The cursor moves through the chart in a "circular" fashion to facilitate data entries and changes. Various "help" functions and on-screen instructions are available to aid the user. The user data is used to generate the graphics portion of the chart. Completed charts may be displayed in monotone or color, printed, plotted, or stored in the chartbase on the IBM PC. Once completed, the charts may be put in a vector format and plotted for color viewgraphs. The twelve graphics capabilities are divided into three groups: Forms, Structured Charts, and Block Diagrams. There are eight Forms available: 1) Bar/Line Charts, 2) Pie Charts, 3) Milestone Charts, 4) Resources Charts, 5) Earned Value Analysis Charts, 6) Progress/Effort Charts, 7) Travel/Training Charts, and 8) Trend Analysis Charts. There are three Structured Charts available: 1) Bullet Charts, 2) Organization Charts, and 3) Work Breakdown Structure (WBS) Charts. The Block Diagram available is an N x N Chart. Each graphics capability supports a chartbase. The OAP graphics database system provides the IBM PC user with an effective means of managing data which is best interpreted as a graphic display. The OAP graphics database system is written in IBM PASCAL 2.0 and assembler for interactive execution on an IBM PC or XT with at least 384K of memory, and a color graphics adapter and monitor. Printed charts require an Epson, IBM, OKIDATA, or HP Laser

Using animated computer-generated text and graphics to depict the risks and benefits of medical treatment.

Science.gov (United States)

Tait, Alan R; Voepel-Lewis, Terri; Brennan-Martinez, Colleen; McGonegal, Maureen; Levine, Robert

2012-11-01

Conventional print materials for presenting risks and benefits of treatment are often difficult to understand. This study was undertaken to evaluate and compare subjects' understanding and perceptions of risks and benefits presented using animated computerized text and graphics. Adult subjects were randomized to receive identical risk/benefit information regarding taking statins that was presented on an iPad (Apple Corp, Cupertino, Calif) in 1 of 4 different animated formats: text/numbers, pie chart, bar graph, and pictograph. Subjects completed a questionnaire regarding their preferences and perceptions of the message delivery together with their understanding of the information. Health literacy, numeracy, and need for cognition were measured using validated instruments. There were no differences in subject understanding based on the different formats. However, significantly more subjects preferred graphs (82.5%) compared with text (17.5%, Pbenefits offer an effective means to describe medical risk/benefit statistics. That understanding and satisfaction were significantly better when the format matched the individual's preference for message delivery is important and reinforces the value of "tailoring" information to the individual's needs and preferences. Copyright © 2012 Elsevier Inc. All rights reserved.

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.

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

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

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.

PIE Report on the KOMO-3 Irradiation Test Fuels

International Nuclear Information System (INIS)

Park, Jong Man; Ryu, H. J.; Yang, J. H.

2009-04-01

In the KOMO-3, in-reactor irradiation test had been performed for 12 kinds of dispersed U-Mo fuel rods, a multi wire fuel rod and a tube fuel rod. In this report we described the PIE results on the KOMO-3 irradiation test fuels. The interaction layer thickness between fuel particle and matrix could be reduced by using a large size U-Mo fuel particle or introducing Al-Si matrix or adding the third element in the U-Mo particle. Monolithic fuel rod of multi-wire or tube fuel was also effective in reducing the interaction layer thickness

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…

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.

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)

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

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

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

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.

PIE on Safety-Tested Loose Particles from Irradiated Compact 4-4-2

Energy Technology Data Exchange (ETDEWEB)

Hunn, John D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Gerczak, Tyler J. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Morris, Robert Noel [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baldwin, Charles A. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Montgomery, Fred C. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2016-04-01

Post-irradiation examination (PIE) is being performed in support of tristructural isotropic (TRISO) coated particle fuel development and qualification for High Temperature Gas-cooled Reactors (HTGRs). This work is sponsored by the Department of Energy Office of Nuclear Energy (DOE-NE) through the Advanced Reactor Technologies (ART) Office under the Advanced Gas Reactor Fuel Development and Qualification (AGR) Program. The AGR-1 experiment was the first in a series of TRISO fuel irradiation tests initiated in 2006. The AGR-1 TRISO particles and fuel compacts were fabricated at Oak Ridge National Laboratory (ORNL) in 2006 using laboratory-scale equipment and irradiated for 3 years in the Advanced Test Reactor (ATR) at Idaho National Laboratory (INL) to demonstrate and evaluate fuel performance under HTGR irradiation conditions. Post-irradiation examination was performed at INL and ORNL to study how the fuel behaved during irradiation, and to test fuel performance during exposure to elevated temperatures at or above temperatures that could occur during a depressurized conduction cooldown event. This report summarizes safety testing and post-safety testing PIE conducted at ORNL on loose particles extracted from irradiated AGR-1 Compact 4-4-2.

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

Corrections to the 148Nd method of evaluation of burnup for the PIE samples from Mihama-3 and Genkai-1 reactors

International Nuclear Information System (INIS)

Suyama, Kenya; Mochizuki, Hiroki

2006-01-01

The value of the burnup is one of the most important parameters of samples taken by post-irradiation examination (PIE). Generally, it is evaluated by the Neodymium-148 method. Precise evaluation of the burnup value requires: (1) an effective fission yield of 148 Nd; (2) neutron capture reactions of 147 Nd and 148 Nd; (3) a conversion factor from fissions per initial heavy metal to the burnup unit GWd/t. In this study, the burnup values of the PIE data from Mihama-3 and Genkai-1 PWRs, which were taken by the Japan Atomic Energy Research Institute, were re-evaluated using more accurate corrections for each of these three items. The PIE data were then re-analyzed using SWAT and SWAT2 code systems with JENDL-3.3 library. The re-evaluation of the effective fission yield of 148 Nd has an effect of 1.5-2.0% on burnup values. Considering the neutron capture reactions of 147 Nd and 148 Nd removes dependence of C/E values of 148 Nd on the burnup value. The conversion factor from FIMA(%) to GWd/t changes according to the burnup value. Its effect on the burnup evaluation is small for samples having burnup of larger than 30 GWd/t. The analyses using the corrected burnup values showed that the calculated 148 Nd concentrations and the PIE data is approximately 1%, whereas this was 3-5% in prior analyses. This analysis indicates that the burnup values of samples from Mihama-3 and Genkai-1 PWRs should be corrected by 2-3%. The effect of re-evaluation of the burnup value on the neutron multiplication factor is an approximately 0.6% change in PIE samples having the burnup of larger than 30 GWd/t. Finally, comparison between calculation results using a single pin-cell model and an assembly model is carried out. Because the results agreed with each other within a few percent, we concluded that the single pin-cell model is suitable for the analysis of PIE samples and that the underestimation of plutonium isotopes, which occurred in the previous analyses, does not result from a geometry

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.

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

Acciones educativas de prevención del pie diabético Educational actions to prevent diabetic foot complications

Directory of Open Access Journals (Sweden)

Pedro Vejerano García

2009-08-01

Full Text Available La Diabetes Mellitus y sus complicaciones son causas de hospitalización, invalidez y afectación económica. Este trabajo hace referencia a la experiencia camagüeyana en prevención, seguimiento y control del pie diabético. Dicha experiencia demostró que la pobre educación para prevenir las complicaciones del pie diabético, se convierte en un factor de riesgo sociocultural modificable. Una consulta de mayor alcance como la Clínica del Pie Diabético, pone al territorio en condiciones ventajosas para atender la transición epidemiológica de la diabetes y sus complicaciones.Diabetes Mellitus and its complications are causes of hospitalization, disability, and financial problems. This paper deals with the experience in prevention, monitoring, and control of diabetic foot in the province of Camagüey. This experience proved that a poor education in the prevention of diabetic foot complications is a modifiable sociocultural risk factor. As an example of more comprehensive consultation, the Diabetic Foot Clinic has benefitted the territory in the assistance of Diabetes Mellitus and its complications.

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

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.

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

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.

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.

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.

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.

Visual presentations of efficacy data in direct-to-consumer prescription drug print and television advertisements: A randomized study.

Science.gov (United States)

Sullivan, Helen W; O'Donoghue, Amie C; Aikin, Kathryn J; Chowdhury, Dhuly; Moultrie, Rebecca R; Rupert, Douglas J

2016-05-01

To determine whether visual aids help people recall quantitative efficacy information in direct-to-consumer (DTC) prescription drug advertisements, and if so, which types of visual aids are most helpful. Individuals diagnosed with high cholesterol (n=2504) were randomized to view a fictional DTC print or television advertisement with no visual aid or one of four visual aids (pie chart, bar chart, table, or pictograph) depicting drug efficacy. We measured drug efficacy and risk recall, drug perceptions and attitudes, and behavioral intentions. For print advertisements, a bar chart or table, compared with no visual aid, elicited more accurate drug efficacy recall. The bar chart was better at this than the pictograph and the table was better than the pie chart. For television advertisements, any visual aid, compared with no visual aid, elicited more accurate drug efficacy recall. The bar chart was better at this than the pictograph or the table. Visual aids depicting quantitative efficacy information in DTC print and television advertisements increased drug efficacy recall, which may help people make informed decisions about prescription drugs. Adding visual aids to DTC advertising may increase the public's knowledge of how well prescription drugs work. Published by Elsevier Ireland Ltd.

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

Slow improvements of metal exposure, health- and breeding conditions of pied flycatchers (Ficedula hypoleuca) after decreased industrial heavy metal emissions

International Nuclear Information System (INIS)

Berglund, A.M.M.; Nyholm, N.E.I.

2011-01-01

The environment around metal industries, such as smelters, is often highly contaminated due to continuous deposition of metals. We studied nest box breeding populations of pied flycatchers (Ficedula hypoleuca) in a well-studied pollution gradient from a sulfide ore smelter in Northern Sweden, after reduced aerial metal emissions (by 93-99%) from the smelter. The deposition of arsenic, cadmium, copper and zinc (based on moss samples) reflected the reduced emissions fairly well. However, nestling pied flycatchers had similar concentrations of these elements and mercury in tissues (bone, liver and blood) and feces in the 2000s, as in the 1980s, when the emissions were substantially higher. The exposure to high metal concentrations in the close vicinity of the smelter resulted in inhibited ALAD activities, depressed hemoglobin and hematocrit levels and increased mortality of nestlings. Our results indicate that in the highly contaminated environment around the smelter, nestlings reflected the slowly cycling soil pool, rather than the atmospheric deposition, and the concentration in soils plays an important role for the response of pied flycatchers to reduced atmospheric deposition. - Highlights: → Pied flycatchers were studied in a pollution gradient from a sulfide smelter. → Metal emissions from the smelter have decreased substantially. → Nestling birds still had high metal concentrations in tissues. → Health and survival rates of nestlings were negatively affected. → Recovery of birds is not expected in the near future.

Slow improvements of metal exposure, health- and breeding conditions of pied flycatchers (Ficedula hypoleuca) after decreased industrial heavy metal emissions

Energy Technology Data Exchange (ETDEWEB)

Berglund, A.M.M., E-mail: asa.berglund@emg.umu.se; Nyholm, N.E.I.

2011-09-15

The environment around metal industries, such as smelters, is often highly contaminated due to continuous deposition of metals. We studied nest box breeding populations of pied flycatchers (Ficedula hypoleuca) in a well-studied pollution gradient from a sulfide ore smelter in Northern Sweden, after reduced aerial metal emissions (by 93-99%) from the smelter. The deposition of arsenic, cadmium, copper and zinc (based on moss samples) reflected the reduced emissions fairly well. However, nestling pied flycatchers had similar concentrations of these elements and mercury in tissues (bone, liver and blood) and feces in the 2000s, as in the 1980s, when the emissions were substantially higher. The exposure to high metal concentrations in the close vicinity of the smelter resulted in inhibited ALAD activities, depressed hemoglobin and hematocrit levels and increased mortality of nestlings. Our results indicate that in the highly contaminated environment around the smelter, nestlings reflected the slowly cycling soil pool, rather than the atmospheric deposition, and the concentration in soils plays an important role for the response of pied flycatchers to reduced atmospheric deposition. - Highlights: {yields} Pied flycatchers were studied in a pollution gradient from a sulfide smelter. {yields} Metal emissions from the smelter have decreased substantially. {yields} Nestling birds still had high metal concentrations in tissues. {yields} Health and survival rates of nestlings were negatively affected. {yields} Recovery of birds is not expected in the near future.

49 CFR 40.361 - What is the purpose of a public interest exclusion (PIE)?

Science.gov (United States)

2010-10-01

... transportation employers and employees from serious noncompliance with DOT drug and alcohol testing rules, the Department's policy is to ensure that employers conduct business only with responsible service agents. (b... alcohol testing regulations, has shown that it is not currently acting in a responsible manner. (c) A PIE...

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)

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

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)

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.

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.

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.

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

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

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

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.

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

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

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.

The Canonical Immediate Early 3 Gene Product pIE611 of Mouse Cytomegalovirus Is Dispensable for Viral Replication but Mediates Transcriptional and Posttranscriptional Regulation of Viral Gene Products.

Science.gov (United States)

Rattay, Stephanie; Trilling, Mirko; Megger, Dominik A; Sitek, Barbara; Meyer, Helmut E; Hengel, Hartmut; Le-Trilling, Vu Thuy Khanh

2015-08-01

Transcription of mouse cytomegalovirus (MCMV) immediate early ie1 and ie3 is controlled by the major immediate early promoter/enhancer (MIEP) and requires differential splicing. Based on complete loss of genome replication of an MCMV mutant carrying a deletion of the ie3-specific exon 5, the multifunctional IE3 protein (611 amino acids; pIE611) is considered essential for viral replication. Our analysis of ie3 transcription resulted in the identification of novel ie3 isoforms derived from alternatively spliced ie3 transcripts. Construction of an IE3-hemagglutinin (IE3-HA) virus by insertion of an in-frame HA epitope sequence allowed detection of the IE3 isoforms in infected cells, verifying that the newly identified transcripts code for proteins. This prompted the construction of an MCMV mutant lacking ie611 but retaining the coding capacity for the newly identified isoforms ie453 and ie310. Using Δie611 MCMV, we demonstrated the dispensability of the canonical ie3 gene product pIE611 for viral replication. To determine the role of pIE611 for viral gene expression during MCMV infection in an unbiased global approach, we used label-free quantitative mass spectrometry to delineate pIE611-dependent changes of the MCMV proteome. Interestingly, further analysis revealed transcriptional as well as posttranscriptional regulation of MCMV gene products by pIE611. Cytomegaloviruses are pathogenic betaherpesviruses persisting in a lifelong latency from which reactivation can occur under conditions of immunosuppression, immunoimmaturity, or inflammation. The switch from latency to reactivation requires expression of immediate early genes. Therefore, understanding of immediate early gene regulation might add insights into viral pathogenesis. The mouse cytomegalovirus (MCMV) immediate early 3 protein (611 amino acids; pIE611) is considered essential for viral replication. The identification of novel protein isoforms derived from alternatively spliced ie3 transcripts prompted

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.

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.

A meta-analysis on PewDiePie, his swearing and its development

OpenAIRE

Mononen, O. (Ossi)

2018-01-01

Abstract This thesis discusses the swearing present in the videos of the YouTube content creator PewDiePie through meta-analysis of a research article on the subject. The thesis will approach the primary article from the points of view of the fields of language play, language policy, ecological language learning and linguistic superdiversities. The primary article is analysed from the point of view of each field in order t...

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

The impact of conflict issues on fixed-pie perceptions, problem solving, and integrative outcomes in negotiation

NARCIS (Netherlands)

Harinck, F.; de Dreu, C.K.W.; van Vianen, A.E.M.

2000-01-01

It is argued that a negotiators fixed-pie perception, cooperative motivation, problem-solving behavior, and integrative outcomes are influenced by the content of the negotiationthe conflict issue. Negotiation involves conflicting interests, conflicting ideas about intellective problems, or

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

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.

Corrections to the {sup 148}Nd method of evaluation of burnup for the PIE samples from Mihama-3 and Genkai-1 reactors

Energy Technology Data Exchange (ETDEWEB)

Suyama, Kenya [Fuel Cycle Facility Safety Research Group, Nuclear Safety Research Center, Japan Atomic Energy Agency, Tokai-mura, Naka-gun, Ibaraki 319-1195 (Japan)]. E-mail: suyama.kenya@jaea.go.jp; Mochizuki, Hiroki [Japan Research Institute, Limited, 16 Ichiban-cho, Chiyoda-ku, Tokyo 102-0082 (Japan)

2006-03-15

The value of the burnup is one of the most important parameters of samples taken by post-irradiation examination (PIE). Generally, it is evaluated by the Neodymium-148 method. Precise evaluation of the burnup value requires: (1) an effective fission yield of {sup 148}Nd; (2) neutron capture reactions of {sup 147}Nd and {sup 148}Nd; (3) a conversion factor from fissions per initial heavy metal to the burnup unit GWd/t. In this study, the burnup values of the PIE data from Mihama-3 and Genkai-1 PWRs, which were taken by the Japan Atomic Energy Research Institute, were re-evaluated using more accurate corrections for each of these three items. The PIE data were then re-analyzed using SWAT and SWAT2 code systems with JENDL-3.3 library. The re-evaluation of the effective fission yield of {sup 148}Nd has an effect of 1.5-2.0% on burnup values. Considering the neutron capture reactions of {sup 147}Nd and {sup 148}Nd removes dependence of C/E values of {sup 148}Nd on the burnup value. The conversion factor from FIMA(%) to GWd/t changes according to the burnup value. Its effect on the burnup evaluation is small for samples having burnup of larger than 30 GWd/t. The analyses using the corrected burnup values showed that the calculated {sup 148}Nd concentrations and the PIE data is approximately 1%, whereas this was 3-5% in prior analyses. This analysis indicates that the burnup values of samples from Mihama-3 and Genkai-1 PWRs should be corrected by 2-3%. The effect of re-evaluation of the burnup value on the neutron multiplication factor is an approximately 0.6% change in PIE samples having the burnup of larger than 30 GWd/t. Finally, comparison between calculation results using a single pin-cell model and an assembly model is carried out. Because the results agreed with each other within a few percent, we concluded that the single pin-cell model is suitable for the analysis of PIE samples and that the underestimation of plutonium isotopes, which occurred in the previous

tcsBU: a tool to extend TCS network layout and visualization.

Science.gov (United States)

Múrias dos Santos, António; Cabezas, Maria Pilar; Tavares, Ana Isabel; Xavier, Raquel; Branco, Madalena

2016-02-15

TCS is a widely used haplotype network reconstruction software, but lacks the capability of overlapping genetic with geographic structure, which is often a first step in phylogeographic analysis. tcsBU is a web-based program that extends the capabilities of TCS, by implementing haplotype classification into an arbitrary user-defined scheme, which is displayed as pie-chart like graphs embedded into the network. Taking advantage of modern graphic libraries, tcsBU also improves the speed at which the final network layout is reached. Networks can be saved as a Scalable Vector Graphics format. tcsBU is available on-line at http://cibio.up.pt/software/tcsBU/. The source code is freely available from https://github.com/sairum/tcsbu/ under a standard MIT license. © The Author 2015. Published by Oxford University Press. All rights reserved. For Permissions, please e-mail: journals.permissions@oup.com.

Pie technique of LWR fuel cladding fracture toughness test

International Nuclear Information System (INIS)

Endo, Shinya; Usami, Koji; Nakata, Masahito; Fukuda, Takuji; Numata, Masami; Kizaki, Minoru; Nishino, Yasuharu

2006-01-01

Remote-handling techniques were developed by cooperative research between the Department of Hot Laboratories in the Japan Atomic Energy Research Institute (JAERI) and the Nuclear Fuel Industries Ltd. (NFI) for evaluating the fracture toughness on irradiated LWR fuel cladding. The developed techniques, sample machining by using the electrical discharge machine (EDM), pre-cracking by fatigue tester, sample assembling to the compact tension (CT) shaped test fixture gave a satisfied result for a fracture toughness test developed by NFL. And post-irradiation examination (PIE) using the remote-handling techniques were carried out to evaluate the fracture toughness on BWR spent fuel cladding in the Waste Safety Testing Facility (WASTEF). (author)

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

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

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.

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

Science.gov (United States)

Warnke-Sommer, Julia; Ali, Hesham

2016-05-06

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

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

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.

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.

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

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

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.

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

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

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

Análisis de los factores influyentes en la prevalencia de las úlceras de pie en pacientes en hemodiálisis

Directory of Open Access Journals (Sweden)

María Jesús Lechuga Domínguez

Full Text Available Resumen Introducción Los pacientes en tratamiento renal sustitutivo con terapia de hemodiálisis, tienen elevado riesgo de sufrir úlceras en los pies, debido a la presencia de numerosos factores de riesgo asociados. Objetivos El presente estudio, se plantea como objetivo principal establecer la prevalencia de úlceras en los pies, en los pacientes que realizan tratamiento con hemodiálisis en el Hospital San Rafael de A Coruña. Como objetivo secundario, valorar los factores de riesgo de ulceración del pie. Material y Método Se realiza un estudio descriptivo transversal, en el que incluyen a los 131 pacientes con insuficiencia renal crónica (IRC en tratamiento con hemodiálisis, que cumplen los criterios de inclusión. Se ha marcado como variable principal del estudio la presencia o ausencia de úlcera en el pie. Se valora el estado vascular, con la palpación de pulsos y con registro de sonido doppler de las arterias pedia y tibial posterior, además se realiza el cálculo del índice tobillo brazo (ITB. Se valora el estado neurológico, tras la exploración de la sensibilidad protectora con monofilamento y de la sensibilidad profunda con diapasón graduado. Resultados El 10,7% de los pacientes del estudio tienen úlcera activa en el pie. No se logra palpar pulso en la arteria pedia en un 43,5% de los pacientes y en la arteria tibial posterior en un 60% de la muestra estudiada. El 25% de los pacientes presenta un valor de ITB, por debajo de 0,90 y un 13,5% presenta arterias no compresibles. Presentan alteración de sensibilidad profunda un 48,9% de los pacientes y alteración de la sensibilidad protectora un 44,3%. Conclusión La prevención primaria a través de protocolos estandarizados de exploración del pie en las unidades de hemodiálisis, podrá minimizar la posibilidad de ulceraciones que comprometan la calidad de vida de los pacientes. Sistemáticamente habrá que realizar una valoración vascular, neurológica y de alteraciones

A proposal for laminated pie mechanical construction of a toroidal magnet for the far detector for the MINOS experiment

International Nuclear Information System (INIS)

Fields, T.; Guarino, V.; Petereit, E.; Schoessow, P.; Thompson, K.

1996-01-01

This proposal describes an alternative to the reference design for the construction of the toroidal magnet for the detector for the MINOS experiment. This design proposes to construct the steel planes from several steel sheets and laminate them into the required thickness of four centimeters. The 8 meter planes are constructed by cutting all of the steel plates to the same size, which is pie a pie shaped segment of either 30 or 22.5 degrees each. All of the plates in the construction are identical, which is conducive to rapid production and lower cost. The advantages of the proposed laminated construction over the reference design are listed in this paper

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.

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.

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

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

Science.gov (United States)

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

2018-01-01

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

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

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.

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

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

Pie waste - A component of food waste and a renewable substrate for producing ethanol.

Science.gov (United States)

Magyar, Margaret; da Costa Sousa, Leonardo; Jayanthi, Singaram; Balan, Venkatesh

2017-04-01

Sugar-rich food waste is a sustainable feedstock that can be converted into ethanol without an expensive thermochemical pretreatment that is commonly used in first and second generation processes. In this manuscript we have outlined the pie waste conversion to ethanol through a two-step process, namely, enzyme hydrolysis using commercial enzyme products mixtures and microbial fermentation using yeast. Optimized enzyme cocktail was found to be 45% alpha amylase, 45% gamma amylase, and 10% pectinase at 2.5mg enzyme protein/g glucan produced a hydrolysate with high glucose concentration. All three solid loadings (20%, 30%, and 40%) produced sugar-rich hydrolysates and ethanol with little to no enzyme or yeast inhibition. Enzymatic hydrolysis and fermentation process mass balance was carried out using pie waste on a 1000g dry weight basis that produced 329g ethanol at 20% solids loading. This process clearly demonstrate how food waste could be efficiently converted to ethanol that could be used for making biodiesel by reacting with waste cooking oil. Copyright © 2017 Elsevier Ltd. All rights reserved.

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

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

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

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.

TRI DMR Dashboard Pie Chart.png | ECHO | US EPA

Science.gov (United States)

ECHO, Enforcement and Compliance History Online, provides compliance and enforcement information for approximately 800,000 EPA-regulated facilities nationwide. ECHO includes permit, inspection, violation, enforcement action, and penalty information about facilities regulated under the Clean Air Act (CAA) Stationary Source Program, Clean Water Act (CWA) National Pollutant Elimination Discharge System (NPDES), and/or Resource Conservation and Recovery Act (RCRA). Information also is provided on surrounding demographics when available.

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.

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

Diseño y manufactura de pie Protésico

OpenAIRE

Hernández Martin, John Alexander; Parra Piñeros, Luis Alberto; Pinzón Pinzón, Cesar Agusto; Bejarano Peña, Oscar Heli; Romero Gutiérrez, Jairo Alberto; García Benavides, Pedro Eladio

2017-01-01

El término prótesis hace referencia al dispositivo que sustituye o compensa la pérdida de un miembro perdido, para el caso objeto de estudio, se da en una prótesis de miembro inferior, en el caso de una amputación de miembros inferiores a nivel transtibial, el pie es el elemento ausente más significativo ya que asume la estabilidad mínima del cuerpo del paciente, además de interferir en el balance intrínseco del cuerpo humano. Por lo anteriormente descrito uno de los pilares más importantes d...

''Cutie Pie,'' A portable radiation instrument

International Nuclear Information System (INIS)

Ballou, C.O.

1947-01-01

A portable beta and gamma radiation meter of exceedingly small dimensions and weight has been developed. User acceptance has been more enthusiastic than any previous instrument of its type. The circuit, using one Victoreen V-32 tube, is the simplest electronic circuit possible for radiation work and gives high sensitivity. Stability exceeds anything of comparable sensitivity which has come to our attention. The short term stability is due to a circuit which prevents emission before the cathode reaches operating temperature. Long term stability has been improved by evacuating the tube enclosure and switch. The complete, one unit instrument, weighs four pounds two ounces, and is carried with a pistol grip. Exclusive of chamber and handle, its dimensions are 3'' wide, 6 1/2'' long, and 5'' high. The case is formed of aluminum and is designed to give excellent visibility of the meter. Three ranges of approximately 50, 500 and 5000 mr/hr have been incorporated in the instruments. The instrument has been named ''Cutie Pie'' due to its diminutive size

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.

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.

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.

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.

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.

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

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.

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.

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

Local adjacency metric dimension of sun graph and stacked book graph

Science.gov (United States)

Yulisda Badri, Alifiah; Darmaji

2018-03-01

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

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

Science.gov (United States)

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

2017-12-01

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

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

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

Lifting the Curse of the Roman: Quintus Horatius Flaccus Meets the Pied Piper of Hamelin.

Science.gov (United States)

Blackburn, William

There are many similarities between Robert Browning's "The Pied Piper of Hamelin" and Lewis Carroll's "Alice in Wonderland" that are seldom noted by literary critics. Both works were begun for the amusement of specific children, both employ a strange subterranean journey as a central device, and both are works of nonsense…

Expert interpretation of bar and line graphs: The role of graphicacy in reducing the effect of graph format.

Directory of Open Access Journals (Sweden)

David ePeebles

2015-10-01

Full Text Available The distinction between informational and computational equivalence of representations, first articulated by Larkin and Simon (1987 has been a fundamental principle in the analysis of diagrammatic reasoning which has been supported empirically on numerous occasions. We present an experiment that investigates this principle in relation to the performance of expert graph users of 2 x 2 'interaction' bar and line graphs. The study sought to determine whether expert interpretation is affected by graph format in the same way that novice interpretations are. The findings revealed that, unlike novices - and contrary to the assumptions of several graph comprehension models - experts' performance was the same for both graph formats, with their interpretation of bar graphs being no worse than that for line graphs. We discuss the implications of the study for guidelines for presenting such data and for models of expert graph comprehension.

Proving termination of graph transformation systems using weighted type graphs over semirings

NARCIS (Netherlands)

Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

2015-01-01

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

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.

DIMENSI METRIK GRAPH LOBSTER Ln (q;r

Directory of Open Access Journals (Sweden)

PANDE GDE DONY GUMILAR

2013-05-01

Full Text Available The metric dimension of connected graph G is the cardinality of minimum resolving set in graph G. In this research, we study how to find the metric dimension of lobster graph Ln (q;r. Lobster graph Ln (q;r is a regular lobster graph with vertices backbone on the main path, every backbone vertex is connected to q hand vertices and every hand vertex is connected to r finger vertices, with n, q, r element of N. We obtain the metric dimension of lobster graph L2 (1;1 is 1, the metric dimension of lobster graph L2 (1;1 for n > 2 is 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

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.

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

The One Universal Graph — a free and open graph database

Science.gov (United States)

Ng, Liang S.; Champion, Corbin

2016-02-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks.

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

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)

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)

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

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.

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)

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.

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.

RNA graph partitioning for the discovery of RNA modularity: a novel application of graph partition algorithm to biology.

Directory of Open Access Journals (Sweden)

Namhee Kim

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

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.

Enfermedad de mano, pie y boca en un hospital del Callao, 2016

Directory of Open Access Journals (Sweden)

Milton José Max Rodríguez-Zúñiga

Full Text Available La enfermedad de mano, pie y boca (EMPB es una enfermedad exantemática viral, causada principalmente por Coxsackie A16, con una sintomatología típica consistente en fiebre; exantema pápulo-vesicular en manos, pies y genitales; y un enantema ulceroso en boca. En el verano del 2016 se presentó una diversidad de casos en un hospital del Callao en niños y adultos, con una sintomatología compatible con EMPB; el diagnóstico fue clínico, se aplicó terapia de soporte con resolución final de síntomas. En la última década se han presentado reportes en algunos países con una afectación atípica causada por el Coxsackie A6, produciendo lesiones más extensas y en adultos. Sin embargo, el diagnóstico sigue siendo clínico, solo necesitando confirmación virológica en casos atípicos o cuando el diagnóstico no es claro. La importancia de este reporte radica en describir los casos del Callao ocurridos en el verano del 2016, para servir de apoyo a los profesionales de la salud en el diagnóstico y manejo de pacientes con similar sintomatología.

The relationship of family characteristics and bipolar disorder using causal-pie models.

Science.gov (United States)

Chen, Y-C; Kao, C-F; Lu, M-K; Yang, Y-K; Liao, S-C; Jang, F-L; Chen, W J; Lu, R-B; Kuo, P-H

2014-01-01

Many family characteristics were reported to increase the risk of bipolar disorder (BPD). The development of BPD may be mediated through different pathways, involving diverse risk factor profiles. We evaluated the associations of family characteristics to build influential causal-pie models to estimate their contributions on the risk of developing BPD at the population level. We recruited 329 clinically diagnosed BPD patients and 202 healthy controls to collect information in parental psychopathology, parent-child relationship, and conflict within family. Other than logistic regression models, we applied causal-pie models to identify pathways involved with different family factors for BPD. The risk of BPD was significantly increased with parental depression, neurosis, anxiety, paternal substance use problems, and poor relationship with parents. Having a depressed mother further predicted early onset of BPD. Additionally, a greater risk for BPD was observed with higher numbers of paternal/maternal psychopathologies. Three significant risk profiles were identified for BPD, including paternal substance use problems (73.0%), maternal depression (17.6%), and through poor relationship with parents and conflict within the family (6.3%). Our findings demonstrate that different aspects of family characteristics elicit negative impacts on bipolar illness, which can be utilized to target specific factors to design and employ efficient intervention programs. Copyright © 2013 Elsevier Masson SAS. All rights reserved.

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

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)

Local survival of pied flycatcher males and females in a pollution gradient of a Cu smelter

International Nuclear Information System (INIS)

Eeva, T.; Hakkarainen, H.; Belskii, E.

2009-01-01

Survival is one of the most central population measures when the effects of the pollution are studied in natural bird populations. However, only few studies have actually measured rigorous survival estimates on adult birds. In recent years there has been a methodological advance in survival analyses by mark-recapture models. We modelled local survival (including mortality and emigration) with the program MARK in a population of a small insectivorous passerine bird, the pied flycatcher (Ficedula hypoleuca), around a point source of heavy metals. The local survival of females in the polluted area was about 50% lower than in the other areas. Males, however, survived relatively well in the heavily polluted area, but showed somewhat lower survival in the moderately polluted area. Different pollution effects between two sexes might be due to pollution-related differences in reproductive effort in females and males, and/or more intensive uptake of heavy metals by laying females. - Female pied flycatchers (Ficedula hypoleuca) show decreased local survival around a copper smelter.

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.

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

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

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

Continuous-time quantum walks on star graphs

International Nuclear Information System (INIS)

Salimi, S.

2009-01-01

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

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.

The Smallest Valid Extension-Based Efficient, Rare Graph Pattern Mining, Considering Length-Decreasing Support Constraints and Symmetry Characteristics of Graphs

Directory of Open Access Journals (Sweden)

Unil Yun

2016-05-01

Full Text Available Frequent graph mining has been proposed to find interesting patterns (i.e., frequent sub-graphs from databases composed of graph transaction data, which can effectively express complex and large data in the real world. In addition, various applications for graph mining have been suggested. Traditional graph pattern mining methods use a single minimum support threshold factor in order to check whether or not mined patterns are interesting. However, it is not a sufficient factor that can consider valuable characteristics of graphs such as graph sizes and features of graph elements. That is, previous methods cannot consider such important characteristics in their mining operations since they only use a fixed minimum support threshold in the mining process. For this reason, in this paper, we propose a novel graph mining algorithm that can consider various multiple, minimum support constraints according to the types of graph elements and changeable minimum support conditions, depending on lengths of graph patterns. In addition, the proposed algorithm performs in mining operations more efficiently because it can minimize duplicated operations and computational overheads by considering symmetry features of graphs. Experimental results provided in this paper demonstrate that the proposed algorithm outperforms previous mining approaches in terms of pattern generation, runtime and memory usage.

Relating zeta functions of discrete and quantum graphs

Science.gov (United States)

Harrison, Jonathan; Weyand, Tracy

2018-02-01

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

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

The One Universal Graph — a free and open graph database

International Nuclear Information System (INIS)

Ng, Liang S.; Champion, Corbin

2016-01-01

Recent developments in graph database mostly are huge projects involving big organizations, big operations and big capital, as the name Big Data attests. We proposed the concept of One Universal Graph (OUG) which states that all observable and known objects and concepts (physical, conceptual or digitally represented) can be connected with only one single graph; furthermore the OUG can be implemented with a very simple text file format with free software, capable of being executed on Android or smaller devices. As such the One Universal Graph Data Exchange (GOUDEX) modules can potentially be installed on hundreds of millions of Android devices and Intel compatible computers shipped annually. Coupled with its open nature and ability to connect to existing leading search engines and databases currently in operation, GOUDEX has the potential to become the largest and a better interface for users and programmers to interact with the data on the Internet. With a Web User Interface for users to use and program in native Linux environment, Free Crowdware implemented in GOUDEX can help inexperienced users learn programming with better organized documentation for free software, and is able to manage programmer's contribution down to a single line of code or a single variable in software projects. It can become the first practically realizable “Internet brain” on which a global artificial intelligence system can be implemented. Being practically free and open, One Universal Graph can have significant applications in robotics, artificial intelligence as well as social networks. (paper)

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

PENGARUH KEDISIPLINAN GURU TERHADAP PRESTASI KERJA PADA MADRASAH IBTIDAIYAH (MI ARROSIDIYAH DESA SUMBERAGUNG REJOTANGAN TULUNGAGUNG (Studi Kasus Kendali Mutu

Directory of Open Access Journals (Sweden)

Suprihno Suprihno

2015-06-01

Full Text Available Lately Islamic School called madrasah as an institution of Islamic education get more attention and public trust in the appeal of public educational institutions, because madrasah will be able to fulfill the needs of science and religion, especially the religion of Islam. This research using “descriptive statistical” methods. This method is used to analyze the data in a way to describe or portray the collected data itself to the population. The Result of this research presented in the form of tables, graphs, pie charts, pictogram, calculation mode, median, mean, calculating deciles, percentiles, calculation of data spread through the calculation of average and standard deviation, percentage calculations. The factors affecting the level of discipline of MI Arrosidiyah teachers is low teacher income, family problems, work environment problem, individual teachers, and work culture. As a follow-up study of quality control is suggested to MI Arrosidiah to Increase teacher salaries, improve harmonization of family, school Enforcement, Improved motivation and Competitive Culture.

Healthy imaginations: a social history of the epidemiology of Aboriginal and Torres Strait Islander health.

Science.gov (United States)

Brough, M

2001-01-01

It is difficult to imagine Aboriginal and Torres Strait Islander health without the powerful descriptors of epidemiology. The statistical imagery of numerical tables, pie charts, and bar graphs have become a key element in the public presentation of Indigenous public health issues. Such quantitative measurements of health draw on the authority of neutral, objective science and are thus rarely questioned in terms of their social meaning. This paper traces the history of this imagery through the 20th century, providing a social account of epidemiological description. Historical notions such as social Darwinism, assimilation, and dangerous other are all seen to be woven into the epidemiological text. The enormous rise in the epidemiological description of Indigenous health problems in recent years needs to be analyzed as a social phenomenon and, in particular, as an aspect of emerging forms of governmentality. Finally, it is argued that such analyses are needed in order to promote an anthropology of epidemiology and to avoid limiting medical anthropology to applications within epidemiology.

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

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

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)

Ontogenetic variation in the plumage colour of female European Pied Flycatchers Ficedula hypoleuca

OpenAIRE

Potti, Jaime; Canal, David; Camacho, Carlos

2014-01-01

Although variation in the dorsal plumage colour of male European Pied Flycatchers Ficedula hypoleuca has received a great deal of attention, females of the species have been usually considered to be nearly uniformly monochromatic brown. Using reflectance spectrophotometry, we explore the age-dependent variation of plumage colour in females. We disentangle the within- and between-individual effects of this pattern and show a within-individual darkening of the mantle colour with age, whereas di...

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.

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.

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

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

Quantum chaos on discrete graphs

International Nuclear Information System (INIS)

Smilansky, Uzy

2007-01-01

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

RJSplot: Interactive Graphs with R.

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.

Bipartite separability and nonlocal quantum operations on graphs

Science.gov (United States)

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

2016-07-01

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

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

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

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.

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

Graph processing platforms at scale: practices and experiences

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [ORNL; Lee, Sangkeun (Matt) [ORNL; Brown, Tyler C [ORNL; Sukumar, Sreenivas R [ORNL; Ganesh, Gautam [ORNL

2015-01-01

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

Generalized hypercube graph $\\Q_n(S$, graph products and self-orthogonal codes

Directory of Open Access Journals (Sweden)

Pani Seneviratne

2016-01-01

Full Text Available A generalized hypercube graph $\\Q_n(S$ has $\\F_{2}^{n}=\\{0,1\\}^n$ as the vertex set and two vertices being adjacent whenever their mutual Hamming distance belongs to $S$, where $n \\ge 1$ and $S\\subseteq \\{1,2,\\ldots, n\\}$. The graph $\\Q_n(\\{1\\}$ is the $n$-cube, usually denoted by $\\Q_n$.We study graph boolean products $G_1 = \\Q_n(S\\times \\Q_1, G_2 = \\Q_{n}(S\\wedge \\Q_1$, $G_3 = \\Q_{n}(S[\\Q_1]$ and show that binary codes from neighborhood designs of $G_1, G_2$ and $G_3$ are self-orthogonal for all choices of $n$ and $S$. More over, we show that the class of codes $C_1$ are self-dual. Further we find subgroups of the automorphism group of these graphs and use these subgroups to obtain PD-sets for permutation decoding. As an example we find a full error-correcting PD set for the binary $[32, 16, 8]$ extremal self-dual code.

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

Survey of Approaches to Generate Realistic Synthetic Graphs

Energy Technology Data Exchange (ETDEWEB)

Lim, Seung-Hwan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Lee, Sangkeun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Shankar, Mallikarjun [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Imam, Neena [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2016-10-01

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

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…

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.

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

Science.gov (United States)

Agasthi, P.; Parvathi, N.

2018-04-01

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

Orientations of infinite graphs with prescribed edge-connectivity

DEFF Research Database (Denmark)

Thomassen, Carsten

2016-01-01

We prove a decomposition result for locally finite graphs which can be used to extend results on edge-connectivity from finite to infinite graphs. It implies that every 4k-edge-connected graph G contains an immersion of some finite 2k-edge-connected Eulerian graph containing any prescribed vertex...... set (while planar graphs show that G need not containa subdivision of a simple finite graph of large edge-connectivity). Also, every 8k-edge connected infinite graph has a k-arc-connected orientation, as conjectured in 1989....

Genus Ranges of 4-Regular Rigid Vertex Graphs.

Science.gov (United States)

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

2015-01-01

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

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

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

Large-Scale Graph Processing Using Apache Giraph

KAUST Repository

Sakr, Sherif

2017-01-07

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.

Large-Scale Graph Processing Using Apache Giraph

KAUST Repository

Sakr, Sherif; Orakzai, Faisal Moeen; Abdelaziz, Ibrahim; Khayyat, Zuhair

2017-01-01

This book takes its reader on a journey through Apache Giraph, a popular distributed graph processing platform designed to bring the power of big data processing to graph data. Designed as a step-by-step self-study guide for everyone interested in large-scale graph processing, it describes the fundamental abstractions of the system, its programming models and various techniques for using the system to process graph data at scale, including the implementation of several popular and advanced graph analytics algorithms.

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

Relating the effects of protein type and content in increased-protein cheese pies to consumers' perception of satiating capacity.

Science.gov (United States)

Marcano, J; Varela, P; Fiszman, S

2015-02-01

Since proteins have been shown to have the highest satiation-inducing effects of all the macronutrients, increasing the protein level is one of the main strategies for designing foods with enhanced satiating capacity. However, few studies analyze the effect that protein addition has on the texture and flavor characteristics of the target food item to relate it to the expected satiating capacity it elicits. The present work studied cheese pies with three levels of soy and whey proteins. Since the protein level altered the rheological behavior of the batters before baking and the texture of the baked pies, the feasibility of adding several protein levels for obtaining a range of final products was investigated. A check-all-that-apply questionnaire containing 32 sensory and non-sensory characteristics of the samples was given to consumers (n = 131) who also scored the perceived samples' satiating capacity. The results showed that the type and content of protein contributed distinctive sensory characteristics to the samples that could be related to their satiating capacity perception. Harder and drier samples (high protein levels) were perceived as more satiating with less perceptible sweet and milky cheese pie characteristic flavors. Soy contributed an off-flavour. These results will contribute to a better understanding of the interrelation of all these factors, aiding the development of highly palatable solid foods with enhanced satiating capacities.

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…

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

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.

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)

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

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.

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.

Statistical summary 1990-91

International Nuclear Information System (INIS)

1991-01-01

The information contained in this statistical summary leaflet summarizes in bar charts or pie charts Nuclear Electric's performance in 1990-91 in the areas of finance, plant and plant operations, safety, commercial operations and manpower. It is intended that the information will provide a basis for comparison in future years. The leaflet also includes a summary of Nuclear Electric's environmental policy statement. (UK)

Cellular Automata on Graphs: Topological Properties of ER Graphs Evolved towards Low-Entropy Dynamics

Directory of Open Access Journals (Sweden)

Marc-Thorsten Hütt

2012-06-01

Full Text Available Cellular automata (CA are a remarkably  efficient tool for exploring general properties of complex systems and spatiotemporal patterns arising from local rules. Totalistic cellular automata,  where the update  rules depend  only on the density of neighboring states, are at the same time a versatile  tool for exploring  dynamical  processes on graphs. Here we briefly review our previous results on cellular automata on graphs, emphasizing some systematic relationships between network architecture and dynamics identified in this way. We then extend the investigation  towards graphs obtained in a simulated-evolution procedure, starting from Erdő s–Rényi (ER graphs and selecting for low entropies of the CA dynamics. Our key result is a strong association of low Shannon entropies with a broadening of the graph’s degree distribution.

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

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.

Forbidden Structures for Planar Perfect Consecutively Colourable Graphs

Directory of Open Access Journals (Sweden)

Borowiecka-Olszewska Marta

2017-05-01

Full Text Available A consecutive colouring of a graph is a proper edge colouring with posi- tive integers in which the colours of edges incident with each vertex form an interval of integers. The idea of this colouring was introduced in 1987 by Asratian and Kamalian under the name of interval colouring. Sevast- janov showed that the corresponding decision problem is NP-complete even restricted to the class of bipartite graphs. We focus our attention on the class of consecutively colourable graphs whose all induced subgraphs are consecutively colourable, too. We call elements of this class perfect consecutively colourable to emphasise the conceptual similarity to perfect graphs. Obviously, the class of perfect consecutively colourable graphs is induced hereditary, so it can be characterized by the family of induced forbidden graphs. In this work we give a necessary and sufficient conditions that must be satisfied by the generalized Sevastjanov rosette to be an induced forbid- den graph for the class of perfect consecutively colourable graphs. Along the way, we show the exact values of the deficiency of all generalized Sevastjanov rosettes, which improves the earlier known estimating result. It should be mentioned that the deficiency of a graph measures its closeness to the class of consecutively colourable graphs. We motivate the investigation of graphs considered here by showing their connection to the class of planar perfect consecutively colourable graphs.

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

Enlarging the Societal Pie Through Wise Legislation: A Psychological Perspective.

Science.gov (United States)

Baron, Jonathan; Bazerman, Max H; Shonk, Katherine

2006-06-01

We offer a psychological perspective to explain the failure of governments to create near-Pareto improvements. Our tools for analyzing these failures reflect the difficulties people have trading small losses for large gains: the fixed-pie approach to negotiations, the omission bias and status quo bias, parochialism and dysfunctional competition, and the neglect of secondary effects. We examine the role of human judgment in the failure to find wise trade-offs by discussing diverse applications of citizen and government decision making, including AIDS treatment, organ-donation systems, endangered-species protection, subsidies, and free trade. Our overall goal is to offer a psychological approach for understanding suboptimality in government decision making. © 2006 Association for Psychological Science.

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.

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)

On the diameter of dot-critical graphs

Directory of Open Access Journals (Sweden)

Doost Ali Mojdeh

2009-01-01

Full Text Available A graph G is \\(k\\-dot-critical (totaly \\(k\\-dot-critical if \\(G\\ is dot-critical (totaly dot-critical and the domination number is \\(k\\. In the paper [T. Burtona, D. P. Sumner, Domination dot-critical graphs, Discrete Math, 306 (2006, 11-18] the following question is posed: What are the best bounds for the diameter of a \\(k\\-dot-critical graph and a totally \\(k\\-dot-critical graph \\(G\\ with no critical vertices for \\(k \\geq 4\\? We find the best bound for the diameter of a \\(k\\-dot-critical graph, where \\(k \\in\\{4,5,6\\}\\ and we give a family of \\(k\\-dot-critical graphs (with no critical vertices with sharp diameter \\(2k-3\\ for even \\(k \\geq 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.

graphkernels: R and Python packages for graph comparison.

Science.gov (United States)

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

2018-02-01

Measuring the similarity of graphs is a fundamental step in the analysis of graph-structured data, which is omnipresent in computational biology. Graph kernels have been proposed as a powerful and efficient approach to this problem of graph comparison. Here we provide graphkernels, the first R and Python graph kernel libraries including baseline kernels such as label histogram based kernels, classic graph kernels such as random walk based kernels, and the state-of-the-art Weisfeiler-Lehman graph kernel. The core of all graph kernels is implemented in C ++ for efficiency. Using the kernel matrices computed by the package, we can easily perform tasks such as classification, regression and clustering on graph-structured samples. The R and Python packages including source code are available at https://CRAN.R-project.org/package=graphkernels and https://pypi.python.org/pypi/graphkernels. mahito@nii.ac.jp or elisabetta.ghisu@bsse.ethz.ch. Supplementary data are available online at Bioinformatics. © The Author(s) 2017. Published by Oxford University Press.

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.

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.

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.

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

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.

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

Stovetop Earth Pecan Pie

Science.gov (United States)

Robin, C. M.

2005-12-01

Many fluid mechanical experiments with direct applications to Earth Science are performed with sugary syrups using conceptually straightforward procedures. Corn syrup has indeed proven to be a godsend for those studying convection and related non-linear phenomena. In addition, however, it gives experimentalists a deep physical intuition for the interior workings of hot planets. The basic concepts behind plate tectonics and mantle convection are not difficult; indeed, although they may not be aware of it, most students probably have a basic intuitive understanding of fluid mechanics gained in their daily life. However, the large size and long time scale of geophysical processes may be quite intimidating to young students. Even a simple geophysical experiment requires a complicated array of coolers, heaters and measuring and recording equipment. It is of interest to introduce students to the geodynamical concepts that can be visualized in a high-tech lab using familiar processes and equipment. Using a homemade apparatus and grocery store supplies, I propose using a 'Stove-top Earth pecan pie' to introduce simple geodynamic concepts to middle- and high-school students. The initially cold syrup heats up and the pecans begin to float (continent formation), the syrup begins to convect (mantle convection), and convection slows down after the heat is removed (secular cooling). Even Wilson cycles can be simulated by moving the pan to one side or the other of the stovetop or heating element. The activity formally introduces students to convection and its application to the earth, and makes them think about plate motion, heat transfer, scaling, and experimental procedures. As an added bonus, they can eat their experiments after recess!

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

HydroHillChart – Francis module. Software used to Calculate the Hill Chart of the Francis Hydraulic Turbines

Directory of Open Access Journals (Sweden)

Dorian Nedelcu

2015-07-01

Full Text Available The paper presents the Hydro Hill Chart - Francis module application, used to calculate the hill chart of the Pelton, Francis and Kaplan hydraulic turbine models, by processing the data measured on the stand. After describing the interface and menu, the input data is graphically presented and the universal characteristic for measuring scenarios ao=const. and n11=const is calculated. Finally, the two calculated hill charts are compared through a graphical superimposition of the isolines.

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

An Association-Oriented Partitioning Approach for Streaming Graph Query

Directory of Open Access Journals (Sweden)

Yun Hao

2017-01-01

Full Text Available The volumes of real-world graphs like knowledge graph are increasing rapidly, which makes streaming graph processing a hot research area. Processing graphs in streaming setting poses significant challenges from different perspectives, among which graph partitioning method plays a key role. Regarding graph query, a well-designed partitioning method is essential for achieving better performance. Existing offline graph partitioning methods often require full knowledge of the graph, which is not possible during streaming graph processing. In order to handle this problem, we propose an association-oriented streaming graph partitioning method named Assc. This approach first computes the rank values of vertices with a hybrid approximate PageRank algorithm. After splitting these vertices with an adapted variant affinity propagation algorithm, the process order on vertices in the sliding window can be determined. Finally, according to the level of these vertices and their association, the partition where the vertices should be distributed is decided. We compare its performance with a set of streaming graph partition methods and METIS, a widely adopted offline approach. The results show that our solution can partition graphs with hundreds of millions of vertices in streaming setting on a large collection of graph datasets and our approach outperforms other graph partitioning methods.

A comparative study of applying Mason’s Rule in the case of flow-graphs and bond-graphs

Directory of Open Access Journals (Sweden)

Adriana Grava

2009-05-01

Full Text Available The paper presents two methods to analyzethe electric circuits using the flow-graphs and thebond-graphs studying the differences between thesemethods.As it can be noticed, the two methods are totallydifferent; their common point being Mason’s rule thatis applied in both cases but it is applied differently foreach type of graphs.

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

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)

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

Desempenho de cordeiros alimentados com inclusão de torta de macaúba na dieta Performance of lambs fed with macauba pie inclusion in the diet

Directory of Open Access Journals (Sweden)

Rafael Alves de Azevedo

2012-11-01

Full Text Available O objetivo deste trabalho foi avaliar o consumo de nutrientes e o desempenho produtivo e econômico de ovinos confinados da raça Santa Inês, alimentados com dietas com diferentes taxas de inclusão de torta de macaúba. Os animais (24 foram distribuídos em delineamento de blocos ao acaso, nos tratamentos com 0, 100, 200 e 300 g kg-1 de torta de macaúba na matéria seca da dieta, em seis repetições, durante 60 dias de confinamento. A adição de torta de macaúba a taxas crescentes à dieta aumentou linearmente o consumo de proteína bruta, extrato etéreo, fibra em detergente neutro e a conversão alimentar. Não houve diferença no consumo de matéria seca, ganho médio diário e ganho de peso vivo total com a adição da torta. O tratamento com inclusão de 100 g kg-1 apresentou a melhor relação custo:benefício na avaliação das receitas bruta e líquida obtidas com a venda dos animais vivos e abatidos. A adição da torta de macaúba em até 300 g kg-1 da dieta não altera o desempenho produtivo dos animais, entretanto, a inclusão de 100 g kg-1 proporciona melhor retorno econômico.The objective of this work was to evaluate the nutrient uptake and the productive and economic performance of confined Santa Inês lambs fed diets with different levels of macauba pie inclusion . The animals (24 were distributed in a randomized block design, in treatments with 0, 100, 200 and 300 g kg-1 macauba pie in the diet dry matter, with six replicates during 60 days of confinement. The addition of macauba pie at increasing rates to the diet linearly increased the intake of crude protein, ether extract, neutral detergent fiber and feed conversion. There was no difference in dry matter intake, average daily gain and total live weight gain with the macauba pie addition. Diet with 100 g kg-1 macauba pie inclusion showed the best cost:benefit ratio in the evaluation of gross and net revenues from the sale of live and slaughtered animals. The addition

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.

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

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

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

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

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.

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.

Captive breeding and reintroduction of the oriental pied hornbill (Anthracoceros albirostris) in Khao Kheow Open Zoo, Thailand.

Science.gov (United States)

Chaiyarat, Rattanawat; Kongprom, Urarikha; Manathamkamon, Darika; Wanpradab, Sunan; Sangarang, Satean

2012-01-01

This article discusses two related issues of the captive breeding and reintroduction of the Oriental pied hornbill (Anthracoceros albirostris) in order to increase its population in the natural habitats. Oriental pied hornbills were bred in Khao Kheow Open Zoo. Three pairs were separated and kept in breeding cages. Females occupied artificial nests between February and April 2005-2007. Eggs were laid and incubated between February and March each year from 2005 to 2007. Nestlings hatched in late March and left the nest in late April 2005-2007. Each breeding pair was fed with approximately 400 g of food each day. All three pairs reproduced resulting in mature offspring of seven in 2005, six in 2006, and five in 2007. Four of sixteen 3-year-old birds were randomly selected and equipped with a GPS receiver on their backs. Activities of the birds attached and unattached with GPS were not significantly different. The first two birds (one female, one male with GPS) were reintroduced on August 5, 2006, and another nine birds (four birds with GPS) were reintroduced on December 26, 2006. The average home range of these reintroduced birds was 0.13 km(2) . Their foods consisted of wild plants and animals in the home range. The first reintroduced pair was able to breed naturally by laying and hatching eggs in an artificial nest. Two juveniles left the nest in April 2008. These results indicate that both captive breeding and reintroduction are potentially important ways to increase the population of the Oriental pied hornbill in natural habitats. © 2011 Wiley Periodicals, Inc.

Incremental Frequent Subgraph Mining on Large Evolving Graphs

KAUST Repository

Abdelhamid, Ehab

2017-08-22

Frequent subgraph mining is a core graph operation used in many domains, such as graph data management and knowledge exploration, bioinformatics and security. Most existing techniques target static graphs. However, modern applications, such as social networks, utilize large evolving graphs. Mining these graphs using existing techniques is infeasible, due to the high computational cost. In this paper, we propose IncGM+, a fast incremental approach for continuous frequent subgraph mining problem on a single large evolving graph. We adapt the notion of “fringe” to the graph context, that is the set of subgraphs on the border between frequent and infrequent subgraphs. IncGM+ maintains fringe subgraphs and exploits them to prune the search space. To boost the efficiency, we propose an efficient index structure to maintain selected embeddings with minimal memory overhead. These embeddings are utilized to avoid redundant expensive subgraph isomorphism operations. Moreover, the proposed system supports batch updates. Using large real-world graphs, we experimentally verify that IncGM+ outperforms existing methods by up to three orders of magnitude, scales to much larger graphs and consumes less memory.

Smooth Bundling of Large Streaming and Sequence Graphs

NARCIS (Netherlands)

Hurter, C.; Ersoy, O.; Telea, A.

2013-01-01

Dynamic graphs are increasingly pervasive in modern information systems. However, understanding how a graph changes in time is difficult. We present here two techniques for simplified visualization of dynamic graphs using edge bundles. The first technique uses a recent image-based graph bundling

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.

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.

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.

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.

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.

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

Trade-offs between sexual advertisement and immune function in the pied flycatcher (Ficedula hypoleuca).

OpenAIRE

Kilpimaa, Janne; Alatalo, Rauno V.; Siitari, Heli

2004-01-01

Good genes models of sexual selection assume that sexual advertisement is costly and thus the level of advertisement honestly reveals heritable viability. Recently it has been suggested that an important cost of sexual advertisement might be impairment of the functioning of the immune system. In this field experiment we investigated the possible trade-offs between immune function and sexual advertisement by manipulating both mating effort and activity of immune defence in male pied flycatcher...

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

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

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

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

The Container Problem in Bubble-Sort Graphs

Science.gov (United States)

Suzuki, Yasuto; Kaneko, Keiichi

Bubble-sort graphs are variants of Cayley graphs. A bubble-sort graph is suitable as a topology for massively parallel systems because of its simple and regular structure. Therefore, in this study, we focus on n-bubble-sort graphs and propose an algorithm to obtain n-1 disjoint paths between two arbitrary nodes in time bounded by a polynomial in n, the degree of the graph plus one. We estimate the time complexity of the algorithm and the sum of the path lengths after proving the correctness of the algorithm. In addition, we report the results of computer experiments evaluating the average performance of the algorithm.

The Perceived Invalidation of Emotion Scale (PIES): Development and psychometric properties of a novel measure of current emotion invalidation.

Science.gov (United States)

Zielinski, Melissa J; Veilleux, Jennifer C

2018-05-24

Emotion invalidation is theoretically and empirically associated with mental and physical health problems. However, existing measures of invalidation focus on past (e.g., childhood) invalidation and/or do not specifically emphasize invalidation of emotion. In this article, the authors articulate a clarified operational definition of emotion invalidation and use that definition as the foundation for development of a new measure of current perceived emotion invalidation across a series of five studies. Study 1 was a qualitative investigation of people's experiences with emotional invalidation from which we generated items. An initial item pool was vetted by expert reviewers in Study 2 and examined via exploratory factor analysis in Study 3 within both college student and online samples. The scale was reduced to 10 items via confirmatory factor analysis in Study 4, resulting in a brief but psychometrically promising measure, the Perceived Invalidation of Emotion Scale (PIES). A short-term longitudinal investigation (Study 5) revealed that PIES scores had strong test-retest reliability, and that greater perceived emotion invalidation was associated with greater emotion dysregulation, borderline features and symptoms of emotional distress. In addition, the PIES predicted changes in relational health and psychological health over a 1-month period. The current set of studies thus presents a psychometrically promising and practical measure of perceived emotion invalidation that can provide a foundation for future research in this burgeoning area. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

The many faces of graph dynamics

Science.gov (United States)

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

2017-06-01

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

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

Low-algorithmic-complexity entropy-deceiving graphs

KAUST Repository

Zenil, Hector

2017-07-08

In estimating the complexity of objects, in particular, of graphs, it is common practice to rely on graphand information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which an object, such as a graph, can be described or observed. From observations that can reconstruct the same graph and are therefore essentially translations of the same description, we see that when applying a computable measure such as the Shannon entropy, not only is it necessary to preselect a feature of interest where there is one, and to make an arbitrary selection where there is not, but also more general properties, such as the causal likelihood of a graph as a measure (opposed to randomness), can be largely misrepresented by computable measures such as the entropy and entropy rate. We introduce recursive and nonrecursive (uncomputable) graphs and graph constructions based on these integer sequences, whose different lossless descriptions have disparate entropy values, thereby enabling the study and exploration of a measure\\'s range of applications and demonstrating the weaknesses of computable measures of complexity.

Multiple graph regularized nonnegative matrix factorization

KAUST Repository

Wang, Jim Jing-Yan

2013-10-01

Non-negative matrix factorization (NMF) has been widely used as a data representation method based on components. To overcome the disadvantage of NMF in failing to consider the manifold structure of a data set, graph regularized NMF (GrNMF) has been proposed by Cai et al. by constructing an affinity graph and searching for a matrix factorization that respects graph structure. Selecting a graph model and its corresponding parameters is critical for this strategy. This process is usually carried out by cross-validation or discrete grid search, which are time consuming and prone to overfitting. In this paper, we propose a GrNMF, called MultiGrNMF, in which the intrinsic manifold is approximated by a linear combination of several graphs with different models and parameters inspired by ensemble manifold regularization. Factorization metrics and linear combination coefficients of graphs are determined simultaneously within a unified object function. They are alternately optimized in an iterative algorithm, thus resulting in a novel data representation algorithm. Extensive experiments on a protein subcellular localization task and an Alzheimer\\'s disease diagnosis task demonstrate the effectiveness of the proposed algorithm. © 2013 Elsevier Ltd. All rights reserved.

Low-algorithmic-complexity entropy-deceiving graphs

KAUST Repository

Zenil, Hector; Kiani, Narsis A.; Tegner, Jesper

2017-01-01

In estimating the complexity of objects, in particular, of graphs, it is common practice to rely on graphand information-theoretic measures. Here, using integer sequences with properties such as Borel normality, we explain how these measures are not independent of the way in which an object, such as a graph, can be described or observed. From observations that can reconstruct the same graph and are therefore essentially translations of the same description, we see that when applying a computable measure such as the Shannon entropy, not only is it necessary to preselect a feature of interest where there is one, and to make an arbitrary selection where there is not, but also more general properties, such as the causal likelihood of a graph as a measure (opposed to randomness), can be largely misrepresented by computable measures such as the entropy and entropy rate. We introduce recursive and nonrecursive (uncomputable) graphs and graph constructions based on these integer sequences, whose different lossless descriptions have disparate entropy values, thereby enabling the study and exploration of a measure's range of applications and demonstrating the weaknesses of computable measures of complexity.

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

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

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

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

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

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)

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

Transduction on Directed Graphs via Absorbing Random Walks.

Science.gov (United States)

De, Jaydeep; Zhang, Xiaowei; Lin, Feng; Cheng, Li

2017-08-11

In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications.Different from existing research efforts that either only deal with undirected graphs or circumvent directionality by means of symmetrization, we propose a novel random walk approach on directed graphs using absorbing Markov chains, which can be regarded as maximizing the accumulated expected number of visits from the unlabeled transient states. Our algorithm is simple, easy to implement, and works with large-scale graphs on binary, multiclass, and multi-label prediction problems. Moreover, it is capable of preserving the graph structure even when the input graph is sparse and changes over time, as well as retaining weak signals presented in the directed edges. We present its intimate connections to a number of existing methods, including graph kernels, graph Laplacian based methods, and interestingly, spanning forest of graphs. Its computational complexity and the generalization error are also studied. Empirically our algorithm is systematically evaluated on a wide range of applications, where it has shown to perform competitively comparing to a suite of state-of-the-art methods. In particular, our algorithm is shown to work exceptionally well with large sparse directed graphs with e.g. millions of nodes and tens of millions of edges, where it significantly outperforms other state-of-the-art methods. In the dynamic graph setting involving insertion or deletion of nodes and edge-weight changes over time, it also allows efficient online updates that produce the same results as of the batch update counterparts.

High-performance analysis of filtered semantic graphs

OpenAIRE

Buluç, A; Fox, A; Gilbert, JR; Kamil, S; Lugowski, A; Oliker, L; Williams, S

2012-01-01

High performance is a crucial consideration when executing a complex analytic query on a massive semantic graph. In a semantic graph, vertices and edges carry \\attributes" of various types. Analytic queries on semantic graphs typically depend on the values of these attributes; thus, the computation must either view the graph through a filter that passes only those individual vertices and edges of interest, or else must first materialize a subgraph or subgraphs consisting of only the vertices ...

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

On the local edge antimagicness of m-splitting graphs

Science.gov (United States)

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

2018-04-01

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

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

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

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

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)

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

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

On the Recognition of Fuzzy Circular Interval Graphs

OpenAIRE

Oriolo, Gianpaolo; Pietropaoli, Ugo; Stauffer, Gautier

2011-01-01

Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw-free graphs. In this paper, we provide a polynomial-time algorithm for recognizing such graphs, and more importantly for building a suitable representation.

The Thickness of Amalgamations and Cartesian Product of Graphs

Directory of Open Access Journals (Sweden)

Yang Yan

2017-08-01

Full Text Available The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study the thickness of Cartesian product of graphs, and by using operations on graphs, we derive the thickness of the Cartesian product Kn □ Pm for most values of m and n.

Generating Realistic Labelled, Weighted Random Graphs

Directory of Open Access Journals (Sweden)

Michael Charles Davis

2015-12-01

Full Text Available Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. In this paper, we present a generative model for random graphs with discrete vertex labels and numeric edge weights. The weights are represented as a set of Beta Mixture Models (BMMs with an arbitrary number of mixtures, which are learned from real-world networks. We propose a Bayesian Variational Inference (VI approach, which yields an accurate estimation while keeping computation times tractable. We compare our approach to state-of-the-art random labelled graph generators and an earlier approach based on Gaussian Mixture Models (GMMs. Our results allow us to draw conclusions about the contribution of vertex labels and edge weights to graph structure.

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

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.

Measuring Two-Event Structural Correlations on Graphs

Science.gov (United States)

2012-08-01

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

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

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

Evaluation of statistical control charts for on-line radiation monitoring

International Nuclear Information System (INIS)

Hughes, L.D.; DeVol, T.A.

2008-01-01

Statistical control charts are presented for the evaluation of time series radiation counter data from flow cells used for monitoring of low levels of 99 TcO 4 - in environmental solutions. Control chart methods consisted of the 3-sigma (3σ) chart, the cumulative sum (CUSUM) chart, and the exponentially weighted moving average (EWMA) chart. Each method involves a control limit based on the detector background which constitutes the detection limit. Both the CUSUM and EWMA charts are suitable to detect and estimate sample concentration requiring less solution volume than when using a 3? control chart. Data presented here indicate that the overall accuracy and precision of the CUSUM method is the best. (author)